5) Polynomial Rings and Factorisation Flashcards

1
Q

What is the Division Theorem for Polynomials

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What is a root of a field

A

An element a ∈ K is a root of f ∈ K[X] if f(a) = 0

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Under what condition is an element of a field a root

A

Let K be a field, let f ∈ K[X] and let a ∈ K. Then a is a root of f iff X − a is a factor of f

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Describe the proof that an element of a field is a root iff X − a is a factor of f

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What is the greatest common divisor of a polynomial

A

The greatest common divisor of polynomials f, g is a polynomial d such that d divides f and g and, if h is any polynomial dividing both f and g, then h divides d

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What is a monic greatest common divisor

A

A unqiue gcd such that gcd(f, g) = 1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What is the Division Algorithm for Polynomials

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What is the ideal generated by two polynomials equivalent to

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What do we know about the ideal of every polynomial ring

A

Every ideal of a polynomial ring K[X] is principal

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Describe the proof that every ideal of a polynomial ring is principal

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

What are irreducible and associated elements

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

How can you prove a polynomial is irreducible using reduction modulo n

A
  • If the polynomial were reducible, then reducing it modulo every n (except specific exceptions) would result in a reducible polynomial
  • Find a value of n such that the polynomial remains irreducible when reduced modulo n.
  • If you can find such an n, the original polynomial must be irreducible
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

What is a Unique Factorisation Domain (UFD)

A

A commutative domain R is said to be a UFD, if every non-zero, non-invertible element of R has a unique factorisation as a product of irreducible elements.

’Unique’ here means up to rearrangement of factors and associated factors

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

What is a Principal Ideal Domain (PID)

A

A commutative domain in which every ideal is principal

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Give an example of a Principal Ideal Domain (PID)

A

The ring Z is a PID since every ideal has the form < n > for some integer n

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Give an example of a ring which is a UFD but not a PID

A
  • The ring Z[X]
  • Every polynomial in Z[X] can be factored uniquely into irreducible polynomials, up to multiplication by units (±1)
  • The ideal ⟨2,X⟩ in Z[X] is not principal