Scribd
Upload
20 views2 pages

Unit 3 Remaining Part

The document defines a field and provides examples of fields and non-fields. It also defines related concepts like minimal polynomials, irreducible polynomials, and primitive polynomials.

Uploaded by

ajinkya shende
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
20 views2 pages

Unit 3 Remaining Part

The document defines a field and provides examples of fields and non-fields. It also defines related concepts like minimal polynomials, irreducible polynomials, and primitive polynomials.

Uploaded by

ajinkya shende
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Definition.

A field is a set F, containing at least two elements, on which two operations + and · (called
addition and multiplication, respectively) are defined so that for each pair of elements x, y in F there
are unique elements x + y and x · y (often written xy) in F for which the following conditions hold for
all elements x, y, z in F:
(i) x + y = y + x (commutativity of addition)
(ii) (x + y) + z = x + (y + z) (associativity of addition)
(iii) There is an element 0 ∈ F, called zero, such that x+ 0 = x. (existence of an additive
identity)
(iv) For each x, there is an element −x ∈ F such that x+(−x) = 0. (existence of additive
inverses)
(v) X.y = y.x (commutativity of multiplication)
(vi) (x · y) · z = x · (y · z) (associativity of multiplication)
(vii) (x + y) · z = x · z + y · z and x · (y + z) = x · y + x · z (distributivity)
(viii) There is an element 1 ∈ F, such that 1 ≠ 0 and x·1 = x. (existence of a multiplicative
identity)
(ix) If x ≠ 0, then there is an element x −1 ∈ F such that x · x −1 = 1. (existence of
multiplicative inverses)
Examples:
(R,+,*) is a field
Suppose that a,b,c,d∈ℝ. We know that ℝ has addition and multiplication as binary operations
since (a+b)=c for some c, and ab=d for some d. Furthermore, we know that addition and
multiplication defined on real numbers is both commutative and associative.
Additionally, the identity element for addition is 0, since ∀x∈ℝ, x+0=x, and the identity element for
multiplication is 1, since 1x=x.
Lastly, the inverse element for addition is -x, since x+(−x)=0 (0 being the identity for addition), and
the inverse element for multiplication 1/x since x⋅1x=1 when x ≠ 0.
(ℤ,+,*) is NOT a field.
We note that for x∈ℤ, our multiplicative inverse x−1=1/x. Note that if x≠±1, then our inverse x−1∉ℤ.
For example, if x = 3, then our multiplicative inverse would be 1/3, but 1/3 is not an integer.
Therefore, ℤ is not a field.

Minimal Polynomial
n
The minimal polynomial of matrix A∈ Rnxn is a monic polynomial q(k) = kD+1 + ∑ aiki
i=0
(A monic polynomial is a non-zero univariate polynomial (that is, a polynomial in a single variable)
in which the leading coefficient (the nonzero coefficient of highest degree) is equal to 1.)

Irreducible Polynomials
A polynomial with integer coefficients, or, more generally, with coefficients in a unique
factorization domain R, is sometimes said to be irreducible (or irreducible over R) if it is
an irreducible element of the polynomial ring, that is, it is not invertible, not zero, and cannot
be factored into the product of two non-invertible polynomials with coefficients in R.
This definition generalizes the definition given for the case of coefficients in a field, because,
over a field, the non-constant polynomials are exactly the polynomials that are non-invertible
and non-zero.

Examples of reducible polynomials:


p1(x) = x2+4x+4 = (x+2)(x+2)
p2(x) = x2-1= (x+1)(x-1)
4 2 2
p3(x) = x2- = (x+ )( x- )
9 3 3
p4(x) = x - 2 = (x + √ 2 )(x - √ 2 )
2

p5(x)= x2 + 1 = (x + i)(x - i)

Over the integer first two polynomials are reducible, remaining three are irreducible.
Over the rational numbers, first three polynomials are reducible, remaining two are irreducible.
Over the real numbers, first four polynomials are reducible, remaining one is irreducible.
Over the complex numbers, all five polynomials are reducible.

Primitive Polynomials:

You might also like