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.
Simple Field Extensions and the Construction of the Complex Numbers
1 · Prerequisites
- Binary Operations, Monoids, Groups and Subgroups
- 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
- 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
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- The ZFC Axioms and the Basic Set Constructions
2 · Summary
Fields, subfields, polynomial rings, evaluation, division, irreducibility, principal ideals, and quotient rings provide the algebraic setting for adjoining elements. The ordered-field and completeness properties of the reals supply positivity, monotonicity of squaring, and nonnegative square roots. These declared dependencies support the construction without using the later fundamental theorem of algebra or any normed-space structure.
The development defines generated subrings and subfields, algebraic elements, minimal polynomials, and simple extensions, then proves the quotient and universal properties of adjoining a root together with the power-basis theorem. It specializes these results to construct , obtains unique Cartesian arithmetic, and identifies its quadratic universal property. Conjugation and modulus follow from those coordinates; their algebraic laws, the triangle inequality, the real automorphisms of , and an explicit square-root formula complete the progression.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Field extensions, generated subrings , generated subfields , and simple extensions
Definition
A field extension is a field together with a specified field homomorphism (Field, Field homomorphism and embedding). Since that map is injective, we identify with its image and write .
For , the subring generated by and is and the subfield generated by and is These intersections are nonempty because is among the displayed subrings and subfields, and they are respectively a subring and a subfield (Subring: a subset containing and closed under addition, additive inverses and multiplication, Subfield: a subring of a field closed under inverses of its nonzero elements, and therefore a field with the restricted operations). Equivalently, and are the smallest subring and subfield of containing . For a singleton, write and . An extension is simple if for some .
For completeness, the asserted injectivity is immediate: if with , then , a contradiction.
The composite of two subfields is the subfield generated by their union
Statement
If and are subfields of a field , then This common subfield is denoted and is called the composite of and .
Facts & Assumptions
Given: Subfields .
For a subfield and , is the smallest subfield of containing (Field extensions, generated subrings , generated subfields , and simple extensions).
Proof
A subfield contains if and only if it contains and every element of .
By minimality, is the intersection of precisely the subfields described in step 1.1.
Interchanging and shows that is the same intersection.
Hence both generated fields equal the displayed intersection; denote it by .
Algebraic and transcendental elements and algebraic extensions
Definition
Let be a field extension (Field extensions, generated subrings , generated subfields , and simple extensions) and let . The element is algebraic over if for some nonzero polynomial (Evaluation and roots of a polynomial in a commutative target ring); it is transcendental over otherwise. The extension is algebraic if every element of is algebraic over , and transcendental otherwise.
The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element
Statement
Let be a field extension and . Evaluation is the unique -algebra homomorphism If is transcendental, its kernel is zero. If is algebraic, there is a unique monic irreducible polynomial such that and, for every , The polynomial is the minimal polynomial of over .
Facts & Assumptions
Given: A field extension and an element .
Given a unital homomorphism of commutative rings and , there is a unique homomorphism extending and sending to (Universal property of : a coefficient homomorphism and the image of determine a unique ring homomorphism).
Every ideal of is generated by one polynomial (For every field , is a principal ideal domain).
An element is algebraic precisely when some nonzero polynomial evaluates to zero at it (Algebraic and transcendental elements and algebraic extensions).
Proof
Apply [F1] to the inclusion and ; this gives the stated evaluation homomorphism and its uniqueness.
By [F3], is transcendental exactly when .
Suppose is algebraic. Then the kernel is a nonzero proper ideal, so [F2] gives for a nonzero nonconstant .
Multiplying by the inverse of its leading coefficient does not change its principal ideal, so choose the generator monic.
For any , if and only if belongs to the kernel, which is equivalent to and hence to .
If with both and nonconstant, then ; since is a field, one factor evaluates to zero and lies in , impossible because its degree is smaller than . Thus is irreducible.
If is another monic polynomial with the same property, then and by step 3.2; equal degree and monicity give .
A simple transcendental extension consists exactly of rational expressions in its generator
Statement
If is a field extension and is transcendental over , then
Facts & Assumptions
Given: A field extension and an element transcendental over .
For transcendental , evaluation has zero kernel (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element).
is the smallest subfield of containing and (Field extensions, generated subrings , generated subfields , and simple extensions).
Transcendental means that no nonzero polynomial in vanishes at (Algebraic and transcendental elements and algebraic extensions).
Proof
Let be the set on the right. By [F1], implies , so every displayed quotient is defined.
The choices and show that .
Common denominators show that is closed under addition, subtraction, and multiplication.
If , then by [A1], and its inverse is .
Conversely, every subfield containing and contains , , and for every with ; hence it contains .
Thus is a subfield of containing and , so by [F2].
In particular , and step 3.1 gives equality.
Two simple transcendental extensions are uniquely -isomorphic once their generators are matched
Statement
Let and be transcendental over . There is a unique -isomorphism such that .
Facts & Assumptions
Given: Transcendental elements and over the same field .
Every element of has the form with and , and likewise for (A simple transcendental extension consists exactly of rational expressions in its generator).
An element is transcendental over when no nonzero polynomial in vanishes at it (Algebraic and transcendental elements and algebraic extensions).
Proof
Define . The denominators are nonzero by [A1].
If , cross-multiplication gives ; [A1] gives , and evaluation at proves that the two proposed images agree. Thus is well-defined.
The formula preserves sums and products, fixes , and sends to .
The same construction with and interchanged is inverse to , so is an -isomorphism.
Any -homomorphism sending to must send to ; [F1] therefore forces it to equal .
for monic irreducible is a field extension containing the root with unique reduced representatives
Statement
Let be monic and irreducible, and put and . Then is a field extension of , , and every element of has a unique representative with (with allowed). In particular, if , every element is uniquely
Facts & Assumptions
Given: A field and a monic irreducible polynomial .
For nonconstant , the quotient is a field if and only if is irreducible (For a nonconstant in , the ideal is maximal and is a field exactly when is irreducible).
If in , each has unique with and either or (Division algorithm for polynomials over a field).
Evaluation at an element is the unique homomorphism extending the coefficient map and sending to that element (Universal property of : a coefficient homomorphism and the image of determine a unique ring homomorphism).
A field extension identifies the base field with an injectively embedded subfield (Field extensions, generated subrings , generated subfields , and simple extensions).
Proof
Irreducibility makes nonconstant, and [F1] makes a field.
The constant-class map is injective: if a constant lies in , then ; uniqueness in [F2], comparing with , forces .
In , by the quotient arithmetic; equivalently this is evaluation at from [F3].
By [F2], write with or ; hence , so every class has a reduced representative.
Thus the constant-class map supplies the field extension .
If two reduced representatives give the same class, then . Applying uniqueness in [F2] to shows and .
Writing the unique reduced polynomial coefficientwise yields the displayed unique expression; when it consists only of , and the zero class is represented by the zero polynomial.
Every nonconstant polynomial over a field has a root in some field extension
Statement
Every nonconstant polynomial has a root in some field extension of .
Facts & Assumptions
Given: A field and a nonconstant polynomial .
Every nonzero nonunit polynomial over a field is a finite product of irreducible polynomials (Every nonzero nonunit polynomial over a field factors into irreducible polynomials).
If is monic irreducible, then is a field extension in which is a root of ( for monic irreducible is a field extension containing the root with unique reduced representatives).
Proof
A nonconstant polynomial is nonzero and not a unit, so [F1] supplies an irreducible factor of .
Divide by its nonzero leading coefficient to obtain a monic irreducible factor ; and still .
By [F2], is a field extension and satisfies .
Since for some , evaluation gives .
Universal property of adjoining a root of an irreducible polynomial
Statement
Let be monic and irreducible, let , and put . If is a field extension and satisfies , there is a unique field homomorphism that fixes and sends to . Its image is .
Facts & Assumptions
Given: The fields and roots appearing in the statement.
Evaluation gives the unique homomorphism fixing and sending to (Universal property of : a coefficient homomorphism and the image of determine a unique ring homomorphism).
A homomorphism whose kernel contains an ideal factors uniquely through (A ring homomorphism whose kernel contains a two-sided ideal factors uniquely through the quotient ring).
is a field extension, , and every element of is a polynomial in ( for monic irreducible is a field extension containing the root with unique reduced representatives).
Proof
By [F1], evaluation at is a homomorphism fixing .
Since , the ideal lies in ; [F2] therefore gives a unique homomorphism with .
The formula fixes constant classes and sends to ; its image is exactly the set of polynomial values.
Because [F3] makes a field and , its kernel is not all of and hence is zero; thus is a field homomorphism.
Any homomorphism fixing and sending to sends every to ; since every element is such an by [F3], it equals .
A simple algebraic extension is its minimal-polynomial quotient and has power basis and degree
Statement
Let be a field extension and let be algebraic with minimal polynomial of degree . Evaluation induces an -isomorphism Moreover, every element of has a unique expression Thus is the power basis, and the degree of the simple extension is .
Facts & Assumptions
Given: A field extension and an algebraic element whose minimal polynomial has degree .
Evaluation has kernel , and is irreducible (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element).
The first isomorphism theorem identifies a ring modulo the kernel of a homomorphism with its image (First isomorphism theorem for rings: ).
Division by a nonzero polynomial gives a unique remainder of smaller degree (Division algorithm for polynomials over a field).
A quotient by a nonconstant polynomial is a field exactly when is irreducible (For a nonconstant in , the ideal is maximal and is a field exactly when is irreducible).
is the generated subring and the generated subfield (Field extensions, generated subrings , generated subfields , and simple extensions).
Proof
Evaluation has image and kernel by [F1]; [F2] therefore induces .
Since is irreducible, [F4] makes the quotient and hence a field.
The field contains and , while every subfield containing them contains all polynomial values; minimality in [F5] gives .
Division by in [F3] gives each quotient class a representative of degree below , hence gives every element of a displayed power expression.
If two such expressions agree, their difference is a polynomial of degree below in the kernel ; uniqueness of the remainder in [F3] makes the difference zero coefficientwise.
The existence and uniqueness in steps 4.1--5.1 are exactly the assertion that the displayed powers form a basis; by definition, its number is .
Stem fields of a monic irreducible polynomial are uniquely -isomorphic when their distinguished roots are matched
Statement
Let be monic and irreducible. If and with , then there is a unique -isomorphism sending to .
Facts & Assumptions
Given: The polynomial, extensions, and distinguished roots in the statement.
The minimal polynomial of an algebraic element is the unique monic irreducible generator of its evaluation kernel, and it divides every polynomial vanishing at that element (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element).
A root of a monic irreducible polynomial determines a unique homomorphism from its adjoining quotient, fixing and matching the root (Universal property of adjoining a root of an irreducible polynomial).
A simple algebraic extension generated by a root is isomorphic to its minimal-polynomial quotient (A simple algebraic extension is its minimal-polynomial quotient and has power basis and degree ).
Proof
By [F1], the minimal polynomials of and divide ; monic irreducibility of all three makes both minimal polynomials equal to .
Using [F2] and the quotient identifications in [F3], obtain -homomorphisms and with and .
The composite fixes and , so uniqueness in [F2] makes it the identity on ; similarly is the identity on .
Hence is an -isomorphism, and the same uniqueness clause shows that no other such isomorphism can send to .
is irreducible over
Statement
The polynomial is irreducible in .
Facts & Assumptions
Given: The polynomial .
The real numbers form an ordered field (The reals form a totally ordered field).
In an ordered field, the square of every nonzero element is positive (Squares of nonzero elements are positive).
A polynomial of degree two or three over a field is irreducible if and only if 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).
Proof
For , either , so , or [F2] gives . Thus by the ordered-field laws in [F1].
Hence has no real root.
Since it has degree two, [F3] now gives its irreducibility over .
The complex numbers as , with the real embedding and imaginary unit
Definition
Form the polynomial ring (The polynomial ring over a commutative ring as finitely supported coefficient sequences with convolution) and define the complex numbers by the quotient ring (The quotient ring with ). Write for the constant class and set Thus in the quotient. The constant-class map is the specified real map; its injectivity and the field structure are proved in is a field, every element is uniquely , and every nonzero element has inverse ↗, after which is a field extension in the sense of Field extensions, generated subrings , generated subfields , and simple extensions.
is a field, every element is uniquely , and every nonzero element has inverse
Statement
is a field containing the embedded copy of . Every complex number has a unique form with , and
If , then
Facts & Assumptions
Given: The quotient construction .
The polynomial is irreducible over ( is irreducible over ).
For a monic irreducible polynomial of degree , is a field extension of and every class has a unique representative of degree below ( for monic irreducible is a field extension containing the root with unique reduced representatives).
The real numbers form an ordered field (The reals form a totally ordered field).
In an ordered field every nonzero square is positive (Squares of nonzero elements are positive).
is the quotient and (The complex numbers as , with the real embedding and imaginary unit ).
Proof
Apply [F2] to [F1]. With the construction in [F5], this proves that is a field, that the constant-class map embeds , and that every class has a unique representative , hence a unique form .
Quotient addition and multiplication, followed by , give the two displayed coordinate formulas. All field axioms are inherited from the field in step 1.1.
If , uniqueness in step 1.1 gives or . The corresponding square is positive by [F4], the other square is nonnegative, and therefore in the ordered field [F3].
Direct multiplication using step 2.1 gives . Since the real denominator is nonzero by step 2.2, division proves the inverse formula.
is the real coordinate plane, with coordinate arithmetic
Statement
The map is a bijection. Under it, and
Facts & Assumptions
Given: The complex field in its quotient construction.
Every complex number has a unique form , and addition and multiplication have the displayed coordinate formulas ( is a field, every element is uniquely , and every nonzero element has inverse ).
Proof
Uniqueness in [F1] makes well-defined and injective.
For every , the complex number maps to , so is surjective.
Applying to the addition formula in [F1] gives the first coordinate identity.
Applying to the multiplication formula in [F1] gives the second coordinate identity.
has power basis and degree
Statement
The complex field is a simple algebraic extension . Its power basis is , and .
Facts & Assumptions
Given: The real field extension generated by .
is irreducible over ( is irreducible over ).
For algebraic over with minimal polynomial of degree , every element of is uniquely , so is the power basis and (A simple algebraic extension is its minimal-polynomial quotient and has power basis and degree ).
Every complex number is uniquely ( is a field, every element is uniquely , and every nonzero element has inverse ), and (The complex numbers as , with the real embedding and imaginary unit ).
A root of a nonzero polynomial is algebraic (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).
Proof
By [F3], is a root of , and [F1] and [F4] make that polynomial its minimal polynomial.
The unique coordinate form in [F3] gives .
Apply [F2] to step 1.1: the power basis is and the degree is .
A square root of in a real field extension determines a unique real-field homomorphism from
Statement
Let be a field extension and let satisfy . There is a unique field homomorphism fixing and sending to . Its image is .
Facts & Assumptions
Given: A real field extension and with .
The complex numbers are with (The complex numbers as , with the real embedding and imaginary unit ).
is monic and irreducible over ( is irreducible over ).
In a quotient adjoining a root of a monic irreducible polynomial, any root in an extension determines a unique base-field homomorphism, whose image is the generated subring (Universal property of adjoining a root of an irreducible polynomial).
Proof
The equation says exactly that is a root of .
Apply [F3] to [F1], [F2], and step 1.1. It gives the unique homomorphism fixing , sending to , and having image .
Real and imaginary parts, complex conjugation, and modulus
Definition
Every has unique coordinates ( is a field, every element is uniquely , and every nonzero element has inverse ). Define and define its modulus by The real numbers are least-upper-bound complete (The Cauchy-sequence reals have the least-upper-bound property), so the nonnegative square root exists and is unique by Square roots exist: a unique with ; the positives are .
Conjugation is an involutive real-field automorphism, , and modulus is definite, multiplicative, and subadditive
Statement
Complex conjugation is a real-field automorphism satisfying For every ,
Facts & Assumptions
Given: and .
Complex numbers have unique real coordinates and the coordinate addition and multiplication formulas ( is a field, every element is uniquely , and every nonzero element has inverse ).
Conjugation and modulus are defined by and (Real and imaginary parts, complex conjugation, and modulus).
The real numbers are a complete ordered field (The Cauchy-sequence reals have the least-upper-bound property), and every nonnegative element of a complete ordered field has a unique nonnegative square root (Square roots exist: a unique with ; the positives are ).
For nonnegative elements of an ordered field, if and only if (Squaring is monotone on the nonnegatives).
The square of every nonzero element of an ordered field is positive (Squares of nonzero elements are positive).
Proof
Coordinate expansion using [F1] and [F2] proves the two homomorphism laws, that conjugation fixes every real number, and that applying it twice is the identity. Thus conjugation is an involutive real-field automorphism.
Direct multiplication gives .
Lagrange's identity gives The final inequality follows from [F5], with the zero case included.
By [F2] and [F3], . If , then ; conversely, makes , and [F5] forces .
Apply step 1.2 to and use step 1.1: . Both sides of are nonnegative, so uniqueness in [F3] proves multiplicativity.
Hence : if this follows from ; otherwise both quantities are nonnegative, step 1.3 and [F4] give the inequality after squaring.
Expanding with [F1] and [F2], then using step 3.2, gives
Both sides of are nonnegative, so [F4] turns the squared inequality in step 4.1 into the triangle inequality.
The only real-field automorphisms of are the identity and complex conjugation
Statement
Every field automorphism of that fixes pointwise is either the identity or complex conjugation, and these two automorphisms are distinct.
Facts & Assumptions
Given: A real-field automorphism of .
Every complex number has a unique form , and is a field ( is a field, every element is uniquely , and every nonzero element has inverse ); (The complex numbers as , with the real embedding and imaginary unit ).
Complex conjugation is an involutive real-field automorphism (Conjugation is an involutive real-field automorphism, , and modulus is definite, multiplicative, and subadditive).
A square root of determines a unique real-field homomorphism from by the image of (A square root of in a real field extension determines a unique real-field homomorphism from ).
Proof
By [F1], ; since is a field homomorphism fixing , applying it gives .
In the complex field, ; hence a root has or . Thus .
If , uniqueness in [F3] makes the identity. If , [F2] and uniqueness in [F3] make conjugation.
The two maps are distinct because they send to the distinct elements and .
Every complex number has a square root, by an explicit Cartesian formula
Statement
Every has a square root. If , one square root is If , one may take when , and when .
Facts & Assumptions
Given: A complex number .
The real numbers are a complete ordered field (The Cauchy-sequence reals have the least-upper-bound property), so every nonnegative real has a unique nonnegative square root (Square roots exist: a unique with ; the positives are ).
The real numbers form an ordered field (The reals form a totally ordered field).
Squaring is order-preserving and order-reflecting on nonnegative elements (Squaring is monotone on the nonnegatives).
Complex multiplication is ( is a field, every element is uniquely , and every nonzero element has inverse ).
Proof
Suppose and . Then [F2] gives .
Suppose and . Then [F2] gives .
Suppose . Then , so [F1] gives . If , [F4] yields ; if , it yields . In either case .
By [F2], exists and is positive; hence is defined.
From and [F1],
Therefore and , so coordinate multiplication gives .
The cases with , with , and are exhaustive, so every complex number has a square root.
5 · Examples, counterexamples and false statements
None yet.
Sources
Standard references
Recommended treatments; not extraction sources.