How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Field Extensions and the Complex Numbers: Examples and Counterexamples
1 · Prerequisites
- Binary Operations, Monoids, Groups and Subgroups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Group Homomorphisms and the Isomorphism Theorems
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Simple Field Extensions and the Construction of the Complex Numbers
- The ZFC Axioms and the Basic Set Constructions
2 · Summary
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
with basis
Example
Over the rational field (The rationals form a field), let , whose existence and positive choice are supplied by the completeness of (The Cauchy-sequence reals have the least-upper-bound property) and Square roots exist: a unique with ; the positives are . Then and every element is uniquely with .
Facts & Assumptions
Given: The element over .
Eisenstein's criterion makes a primitive integer polynomial irreducible over when some prime divides every nonleading coefficient, does not divide the leading coefficient, and its square does not divide the constant coefficient (Eisenstein criterion over the integers).
A simple algebraic extension is its minimal-polynomial quotient and has the associated power basis (A simple algebraic extension is its minimal-polynomial quotient and has power basis and degree ).
The real numbers are a complete ordered field, so exists and satisfies (The Cauchy-sequence reals have the least-upper-bound property, Square roots exist: a unique with ; the positives are ).
An element is algebraic when a nonzero polynomial vanishes at it (Algebraic and transcendental elements and algebraic extensions); for an algebraic element with minimal polynomial , exactly when divides (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element).
Verification
The polynomial satisfies [F1] at the prime , so it is monic and irreducible over ; since it vanishes at , [F4] makes it the minimal polynomial of .
Apply [F2] to obtain the quotient isomorphism, the basis , and the unique form .
For instance, , because .
The four-element field
Example
Let , with its quotient arithmetic (For every , the congruence-class ring is the quotient ring ). This is a field (For every prime , the two operations on make it a field). Then is a field of four elements.
Facts & Assumptions
Given: The field and the polynomial .
A quadratic over a field is irreducible exactly when it has no root in that field (A polynomial of degree two or three over a field is irreducible exactly when it has no root in the field).
The quotient by a monic irreducible degree- polynomial is a field and has unique representatives of degree below ( for monic irreducible is a field extension containing the root with unique reduced representatives).
Verification
The values of at and are both in , so [F1] makes it irreducible.
By [F2], is a field and its unique linear representatives are exactly , giving the displayed four classes.
The defining relation is , hence in characteristic two. Consequently and , which determines the products of the nonzero elements.
is not a field: reducibility creates nonzero zero divisors
Statement refuted
The quotient by any nonconstant polynomial over a field is a field.
Counterexample
In the rational field (The rationals form a field), take The two classes and are nonzero, but their product is zero.
Facts & Assumptions
Given: The quotient .
Division by a nonzero polynomial gives a unique remainder of smaller degree (Division algorithm for polynomials over a field).
is a field if and only if the nonconstant polynomial is irreducible (For a nonconstant in , the ideal is maximal and is a field exactly when is irreducible).
Verification
Neither nor lies in : each already has degree below , so uniqueness of the remainder in [F1] would otherwise make it zero.
Yet , so the product of their nonzero classes is zero.
Thus has nonzero zero divisors and is not a field, agreeing with [F2] because is reducible.
The minimal polynomial of over is
Example
Let , with the nonnegative real square roots supplied by the completeness of (The Cauchy-sequence reals have the least-upper-bound property) and Square roots exist: a unique with ; the positives are . Its minimal polynomial over is so .
Facts & Assumptions
Given: The real number .
Eisenstein's criterion proves irreducibility over under its prime divisibility hypotheses (Eisenstein criterion over the integers).
The polynomial-ring universal property gives substitution homomorphisms such as (Universal property of : a coefficient homomorphism and the image of determine a unique ring homomorphism).
A root of a nonzero polynomial is algebraic (Algebraic and transcendental elements and algebraic extensions), and the minimal polynomial of an algebraic element is the monic irreducible polynomial generating its evaluation kernel (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element).
Its degree equals the degree of the associated simple extension (A simple algebraic extension is its minimal-polynomial quotient and has power basis and degree ).
The real numbers are a complete ordered field, so the displayed nonnegative square roots exist and square to their radicands (The Cauchy-sequence reals have the least-upper-bound property, Square roots exist: a unique with ; the positives are ).
Verification
From one obtains , hence .
Substitution from [F2] gives , which satisfies [F1] at and is therefore irreducible.
Substitution by is inverse to substitution by , so a factorization of would produce one of . Thus is irreducible.
Since is monic, irreducible, and annihilates , [F3] identifies it as the minimal polynomial; [F4] gives degree .
The square roots of are
Example
The two square roots of are
Facts & Assumptions
Given: The imaginary unit .
Complex multiplication satisfies ( is a field, every element is uniquely , and every nonzero element has inverse ).
The real numbers are a complete ordered field, so the nonnegative real square root satisfies (The Cauchy-sequence reals have the least-upper-bound property, Square roots exist: a unique with ; the positives are ).
Every complex number has a square root (Every complex number has a square root, by an explicit Cartesian formula).
Verification
By [F1] and [F2], ; its negative has the same square.
Conversely, if , [F1] gives and . Consequently , they have the same sign, and .
Then , so [F2] gives or . These are exactly the two values in step 1.1.
Thus the existence guaranteed abstractly by [F3] is realized by exactly the two displayed roots.
FALSE: the complex field admits an order making it an ordered field
Statement refuted
There is a total order on compatible with its field operations.
Facts & Assumptions
Given: The proposed ordered-field structure on .
In an ordered field every nonzero square is positive (Squares of nonzero elements are positive).
(The complex numbers as , with the real embedding and imaginary unit ), and every complex number is uniquely ( is a field, every element is uniquely , and every nonzero element has inverse ), so is nonzero.
Refutation
Suppose such an ordered-field structure existed. Since , [F1] and [F2] would give .
Also by [F1], so compatibility with addition gives , impossible in a strict order.
Therefore no order compatible with the complex field operations exists.
An annihilating polynomial need not be minimal: is a root of both and
Statement refuted
Every nonzero polynomial that vanishes at an algebraic element is that element's minimal polynomial.
Counterexample
Let , whose nonnegative real value satisfies because is complete (The Cauchy-sequence reals have the least-upper-bound property, Square roots exist: a unique with ; the positives are ). Then both and vanish at , but only the first is minimal.
Facts & Assumptions
Given: The algebraic number over .
Eisenstein's criterion proves irreducibility over under its prime divisibility hypotheses (Eisenstein criterion over the integers).
The minimal polynomial is the unique monic irreducible generator of the evaluation kernel, and it divides every annihilating polynomial (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element).
The real numbers are a complete ordered field, so exists and satisfies (The Cauchy-sequence reals have the least-upper-bound property, Square roots exist: a unique with ; the positives are ).
Verification
Evaluation gives and .
The polynomial satisfies [F1] at , so [F2] identifies it as the minimal polynomial of over .
The other annihilator factors as and has larger degree, so it is a proper multiple of the minimal polynomial.
Thus a polynomial may annihilate an algebraic element without being its minimal polynomial.
Sources
Standard references
Recommended treatments; not extraction sources.