Alphabeta Math
Session-authored (Fable 5 assisted)
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.

17 results · all verified · 0 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 17 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Simple Field Extensions and the Construction of the Complex Numbers

1 · Prerequisites

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 C=R[x]/(x2+1), 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 C, and an explicit square-root formula complete the progression.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-08-13Open item page →

Field extensions, generated subrings F[S], generated subfields F(S), and simple extensions

Definition

A field extension K/F is a field K together with a specified field homomorphism FK (Field, Field homomorphism and embedding). Since that map is injective, we identify F with its image and write FK.

For SK, the subring generated by F and S is F[S]={R:R is a subring of K and FSR}, and the subfield generated by F and S is F(S)={E:E is a subfield of K and FSE}. These intersections are nonempty because K is among the displayed subrings and subfields, and they are respectively a subring and a subfield (Subring: a subset containing 1R 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, F[S] and F(S) are the smallest subring and subfield of K containing FS. For a singleton, write F[a] and F(a). An extension K/F is simple if K=F(a) for some aK.

For completeness, the asserted injectivity is immediate: if φ(a)=0 with a0, then 1=φ(a1a)=φ(a1)φ(a)=0, a contradiction.

CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-13Open item page →

The composite of two subfields is the subfield generated by their union

Statement

If E and E are subfields of a field Ω, then E(E)=E(E)={L:L is a subfield of Ω,EEL}. This common subfield is denoted EE and is called the composite of E and E.

Facts & Assumptions

Given: Subfields E,EΩ.

[F1]

For a subfield FK and SK, F(S) is the smallest subfield of K containing FS (Field extensions, generated subrings F[S], generated subfields F(S), and simple extensions).

Proof

technique · direct
1.1

A subfield LΩ contains EE if and only if it contains E and every element of E.

algebra
2.1

By minimality, E(E) is the intersection of precisely the subfields described in step 1.1.

F1step 1.1
2.2

Interchanging E and E shows that E(E) is the same intersection.

F1step 1.1
3.1

Hence both generated fields equal the displayed intersection; denote it by EE.

step 2.1step 2.2
DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-08-13Open item page →

Algebraic and transcendental elements and algebraic extensions

Definition

Let K/F be a field extension (Field extensions, generated subrings F[S], generated subfields F(S), and simple extensions) and let aK. The element a is algebraic over F if f(a)=0 for some nonzero polynomial fF[x] (Evaluation and roots of a polynomial in a commutative target ring); it is transcendental over F otherwise. The extension K/F is algebraic if every element of K is algebraic over F, and transcendental otherwise.

TheoremStatement: Literature-sourcedProof: Literature-sourcedprecheck passaudited 2026-08-13Open item page →

The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element

Statement

Let K/F be a field extension and aK. Evaluation is the unique F-algebra homomorphism eva:F[x]K,ff(a). If a is transcendental, its kernel is zero. If a is algebraic, there is a unique monic irreducible polynomial maF[x] such that ker(eva)=(ma), and, for every fF[x], f(a)=0maf. The polynomial ma is the minimal polynomial of a over F.

Facts & Assumptions

Given: A field extension K/F and an element aK.

[F1]

Given a unital homomorphism ϕ:RS of commutative rings and sS, there is a unique homomorphism evϕ,s:R[x]S extending ϕ and sending x to s (Universal property of R[x]: a coefficient homomorphism and the image of x determine a unique ring homomorphism).

[F2]

Every ideal of F[x] is generated by one polynomial (For every field F, F[x] is a principal ideal domain).

[F3]

An element is algebraic precisely when some nonzero polynomial evaluates to zero at it (Algebraic and transcendental elements and algebraic extensions).

Proof

technique · direct
1.1

Apply [F1] to the inclusion FK and a; this gives the stated evaluation homomorphism and its uniqueness.

F1
2.1

By [F3], a is transcendental exactly when ker(eva)=0.

F3step 1.1
2.2

Suppose a is algebraic. Then the kernel is a nonzero proper ideal, so [F2] gives ker(eva)=(m) for a nonzero nonconstant m.

F2F3step 1.1
3.1

Multiplying m by the inverse of its leading coefficient does not change its principal ideal, so choose the generator m monic.

step 2.2algebra
3.2

For any fF[x], f(a)=0 if and only if f belongs to the kernel, which is equivalent to f(m) and hence to mf.

step 2.2
4.1

If m=uv with both u and v nonconstant, then 0=m(a)=u(a)v(a); since K is a field, one factor evaluates to zero and lies in (m), impossible because its degree is smaller than degm. Thus m is irreducible.

step 2.2step 3.1algebra
5.1

If m is another monic polynomial with the same property, then mm and mm by step 3.2; equal degree and monicity give m=m.

step 3.2algebra
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-13Open item page →

A simple transcendental extension consists exactly of rational expressions in its generator

Statement

If K/F is a field extension and aK is transcendental over F, then F(a)={f(a)g(a)1:f,gF[x], g0}.

Facts & Assumptions

Given: A field extension K/F and an element aK transcendental over F.

[F1]

For transcendental a, evaluation F[x]K has zero kernel (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element).

[F2]
[A1]

Transcendental means that no nonzero polynomial in F[x] vanishes at a (Algebraic and transcendental elements and algebraic extensions).

Proof

technique · direct
1.1

Let R be the set on the right. By [F1], g0 implies g(a)0, so every displayed quotient is defined.

F1
2.1

The choices (f,g)=(c,1) and (x,1) show that F{a}R.

step 1.1algebra
2.2

Common denominators show that R is closed under addition, subtraction, and multiplication.

step 1.1algebra
2.3

If f(a)g(a)10, then f0 by [A1], and its inverse is g(a)f(a)1R.

A1step 1.1
2.4

Conversely, every subfield containing F and a contains f(a), g(a), and g(a)1 for every f,gF[x] with g0; hence it contains R.

step 1.1algebra
3.1

Thus R is a subfield of K containing F and a, so F(a)R by [F2].

F2step 2.1step 2.2step 2.3
4.1

In particular RF(a), and step 3.1 gives equality.

F2step 3.1step 2.4
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-13Open item page →

Two simple transcendental extensions are uniquely F-isomorphic once their generators are matched

Statement

Let a and b be transcendental over F. There is a unique F-isomorphism Φ:F(a)F(b) such that Φ(a)=b.

Facts & Assumptions

Given: Transcendental elements a and b over the same field F.

[F1]

Every element of F(a) has the form f(a)g(a)1 with f,gF[x] and g0, and likewise for F(b) (A simple transcendental extension consists exactly of rational expressions in its generator).

[A1]

An element is transcendental over F when no nonzero polynomial in F[x] vanishes at it (Algebraic and transcendental elements and algebraic extensions).

Proof

technique · direct
1.1

Define Φ(f(a)g(a)1)=f(b)g(b)1. The denominators are nonzero by [A1].

A1F1
2.1

If f(a)g(a)1=r(a)s(a)1, cross-multiplication gives (fsrg)(a)=0; [A1] gives fs=rg, and evaluation at b proves that the two proposed images agree. Thus Φ is well-defined.

A1step 1.1algebra
2.2

The formula preserves sums and products, fixes F, and sends a to b.

step 1.1algebra
3.1

The same construction with a and b interchanged is inverse to Φ, so Φ is an F-isomorphism.

A1F1step 2.1step 2.2
4.1

Any F-homomorphism sending a to b must send f(a)g(a)1 to f(b)g(b)1; [F1] therefore forces it to equal Φ.

F1step 1.1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-13Open item page →

F[x]/(p) for monic irreducible p is a field extension containing the root x+(p) with unique reduced representatives

Statement

Let pF[x] be monic and irreducible, and put K=F[x]/(p) and a=x+(p). Then K is a field extension of F, p(a)=0, and every element of K has a unique representative r with degr<degp (with r=0 allowed). In particular, if degp=n, every element is uniquely c0+c1a++cn1an1,cjF.

Facts & Assumptions

Given: A field F and a monic irreducible polynomial pF[x].

[F1]

For nonconstant pF[x], the quotient F[x]/(p) is a field if and only if p is irreducible (For a nonconstant p in F[x], the ideal (p) is maximal and F[x]/(p) is a field exactly when p is irreducible).

[F2]

If g0 in F[x], each fF[x] has unique q,r with f=qg+r and either r=0 or degr<degg (Division algorithm for polynomials over a field).

[F3]

Evaluation at an element is the unique homomorphism extending the coefficient map and sending x to that element (Universal property of R[x]: a coefficient homomorphism and the image of x determine a unique ring homomorphism).

[F4]

A field extension identifies the base field with an injectively embedded subfield (Field extensions, generated subrings F[S], generated subfields F(S), and simple extensions).

Proof

technique · direct
1.1

Irreducibility makes p nonconstant, and [F1] makes K a field.

F1
1.2

The constant-class map FK is injective: if a constant c lies in (p), then c=qp; uniqueness in [F2], comparing c=0p+c with c=qp+0, forces c=0.

F2
1.3

In K, p(a)=p(x)+(p)=0 by the quotient arithmetic; equivalently this is evaluation at a from [F3].

F3algebra
1.4

By [F2], write f=qp+r with r=0 or degr<degp; hence f+(p)=r+(p), so every class has a reduced representative.

F2
2.1

Thus the constant-class map supplies the field extension K/F.

F4step 1.1step 1.2
2.2

If two reduced representatives r,s give the same class, then rs=qp. Applying uniqueness in [F2] to rs shows q=0 and r=s.

F2step 1.4
3.1

Writing the unique reduced polynomial coefficientwise yields the displayed unique expression; when n=1 it consists only of c0, and the zero class is represented by the zero polynomial.

step 1.4step 2.2algebra
CorollaryStatement: Literature-sourcedProof: Literature-sourcedprecheck passaudited 2026-08-13Open item page →

Every nonconstant polynomial over a field has a root in some field extension

Statement

Every nonconstant polynomial fF[x] has a root in some field extension of F.

Facts & Assumptions

Given: A field F and a nonconstant polynomial fF[x].

[F1]

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).

[F2]

If p is monic irreducible, then F[x]/(p) is a field extension in which x+(p) is a root of p (F[x]/(p) for monic irreducible p is a field extension containing the root x+(p) with unique reduced representatives).

Proof

technique · direct
1.1

A nonconstant polynomial is nonzero and not a unit, so [F1] supplies an irreducible factor q of f.

F1
2.1

Divide q by its nonzero leading coefficient to obtain a monic irreducible factor p; (p)=(q) and still pf.

step 1.1algebra
3.1

By [F2], K=F[x]/(p) is a field extension and a=x+(p) satisfies p(a)=0.

F2step 2.1
4.1

Since f=ph for some hF[x], evaluation gives f(a)=p(a)h(a)=0.

step 2.1step 3.1algebra
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-13Open item page →

Universal property of adjoining a root of an irreducible polynomial

Statement

Let pF[x] be monic and irreducible, let K=F[x]/(p), and put a=x+(p). If L/F is a field extension and bL satisfies p(b)=0, there is a unique field homomorphism φ:KL that fixes F and sends a to b. Its image is F[b].

Facts & Assumptions

Given: The fields and roots appearing in the statement.

[F1]

Evaluation gives the unique homomorphism F[x]L fixing F and sending x to b (Universal property of R[x]: a coefficient homomorphism and the image of x determine a unique ring homomorphism).

[F2]

A homomorphism RS whose kernel contains an ideal I factors uniquely through R/I (A ring homomorphism whose kernel contains a two-sided ideal factors uniquely through the quotient ring).

[F3]

K is a field extension, p(a)=0, and every element of K is a polynomial in a (F[x]/(p) for monic irreducible p is a field extension containing the root x+(p) with unique reduced representatives).

Proof

technique · direct
1.1

By [F1], evaluation at b is a homomorphism evb:F[x]L fixing F.

F1
2.1

Since p(b)=0, the ideal (p) lies in ker(evb); [F2] therefore gives a unique homomorphism φ:KL with φ(f+(p))=f(b).

F2step 1.1
3.1

The formula fixes constant classes and sends a=x+(p) to b; its image is exactly the set F[b] of polynomial values.

F3step 2.1algebra
3.2

Because [F3] makes K a field and φ(1)=1, its kernel is not all of K and hence is zero; thus φ is a field homomorphism.

F3step 2.1algebra
4.1

Any homomorphism fixing F and sending a to b sends every f(a) to f(b); since every element is such an f(a) by [F3], it equals φ.

F3step 3.1
TheoremStatement: Literature-sourcedProof: Literature-sourcedprecheck passaudited 2026-08-13Open item page →

A simple algebraic extension is its minimal-polynomial quotient and has power basis 1,a,,an1 and degree n

Statement

Let K/F be a field extension and let aK be algebraic with minimal polynomial ma of degree n. Evaluation induces an F-isomorphism F[x]/(ma)F(a),f+(ma)f(a). Moreover, every element of F(a) has a unique expression c0+c1a++cn1an1,cjF. Thus 1,a,,an1 is the power basis, and the degree of the simple extension is [F(a):F]=n.

Facts & Assumptions

Given: A field extension K/F and an algebraic element aK whose minimal polynomial ma has degree n.

[F1]

Evaluation has kernel (ma), and ma is irreducible (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element).

[F2]

The first isomorphism theorem identifies a ring modulo the kernel of a homomorphism with its image (First isomorphism theorem for rings: R/kerfimf).

[F3]

Division by a nonzero polynomial gives a unique remainder of smaller degree (Division algorithm for polynomials over a field).

[F4]

A quotient F[x]/(p) by a nonconstant polynomial is a field exactly when p is irreducible (For a nonconstant p in F[x], the ideal (p) is maximal and F[x]/(p) is a field exactly when p is irreducible).

[F5]

F[a] is the generated subring and F(a) the generated subfield (Field extensions, generated subrings F[S], generated subfields F(S), and simple extensions).

Proof

technique · direct
1.1

Evaluation has image F[a] and kernel (ma) by [F1]; [F2] therefore induces F[x]/(ma)F[a].

F1F2
2.1

Since ma is irreducible, [F4] makes the quotient and hence F[a] a field.

F1F4step 1.1
3.1

The field F[a] contains F and a, while every subfield containing them contains all polynomial values; minimality in [F5] gives F[a]=F(a).

F5step 2.1
4.1

Division by ma in [F3] gives each quotient class a representative of degree below n, hence gives every element of F(a) a displayed power expression.

F3step 1.1step 3.1
5.1

If two such expressions agree, their difference is a polynomial of degree below n in the kernel (ma); uniqueness of the remainder in [F3] makes the difference zero coefficientwise.

F1F3step 4.1
6.1

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 n is [F(a):F].

step 4.1step 5.1
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-13Open item page →

Stem fields of a monic irreducible polynomial are uniquely F-isomorphic when their distinguished roots are matched

Statement

Let pF[x] be monic and irreducible. If L=F(α) and M=F(β) with p(α)=p(β)=0, then there is a unique F-isomorphism LM sending α to β.

Facts & Assumptions

Given: The polynomial, extensions, and distinguished roots in the statement.

[F1]

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).

[F2]

A root of a monic irreducible polynomial determines a unique homomorphism from its adjoining quotient, fixing F and matching the root (Universal property of adjoining a root of an irreducible polynomial).

[F3]

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 1,a,,an1 and degree n).

Proof

technique · direct
1.1

By [F1], the minimal polynomials of α and β divide p; monic irreducibility of all three makes both minimal polynomials equal to p.

F1algebra
2.1

Using [F2] and the quotient identifications in [F3], obtain F-homomorphisms φ:LM and ψ:ML with φ(α)=β and ψ(β)=α.

F2F3step 1.1
3.1

The composite ψφ fixes F and α, so uniqueness in [F2] makes it the identity on L; similarly φψ is the identity on M.

F2step 2.1
4.1

Hence φ is an F-isomorphism, and the same uniqueness clause shows that no other such isomorphism can send α to β.

F2step 3.1
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-13Open item page →

x2+1 is irreducible over R

Statement

The polynomial x2+1 is irreducible in R[x].

Facts & Assumptions

Given: The polynomial x2+1R[x].

[F1]

The real numbers form an ordered field (The reals form a totally ordered field).

[F2]

In an ordered field, the square of every nonzero element is positive (Squares of nonzero elements are positive).

[F3]

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

technique · direct
1.1

For rR, either r=0, so r2=0, or [F2] gives r2>0. Thus r2+1>0 by the ordered-field laws in [F1].

F1F2
2.1

Hence x2+1 has no real root.

step 1.1
3.1

Since it has degree two, [F3] now gives its irreducibility over R.

F3step 2.1
DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-08-13Open item page →

The complex numbers as R[x]/(x2+1), with the real embedding and imaginary unit i

Definition

Form the polynomial ring R[x] (The polynomial ring over a commutative ring as finitely supported coefficient sequences with convolution) and define the complex numbers by the quotient ring C:=R[x]/(x2+1) (The quotient ring R/I with (r+I)(s+I)=rs+I). Write a for the constant class a+(x2+1) and set i:=x+(x2+1). Thus i2=1 in the quotient. The constant-class map RC is the specified real map; its injectivity and the field structure are proved in C=R[x]/(x2+1) is a field, every element is uniquely a+bi, and every nonzero element has inverse (abi)/(a2+b2) , after which C/R is a field extension in the sense of Field extensions, generated subrings F[S], generated subfields F(S), and simple extensions.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-13Open item page →

C=R[x]/(x2+1) is a field, every element is uniquely a+bi, and every nonzero element has inverse (abi)/(a2+b2)

Statement

C=R[x]/(x2+1) is a field containing the embedded copy of R. Every complex number has a unique form a+bi with a,bR, and

(a+bi)+(u+vi)=(a+u)+(b+v)i, (a+bi)(u+vi)=(aubv)+(av+bu)i.

If a+bi0, then

(a+bi)1=abia2+b2.

Facts & Assumptions

Given: The quotient construction C=R[x]/(x2+1).

[F1]

The polynomial x2+1 is irreducible over R (x2+1 is irreducible over R).

[F2]

For a monic irreducible polynomial p of degree n, F[x]/(p) is a field extension of F and every class has a unique representative of degree below n (F[x]/(p) for monic irreducible p is a field extension containing the root x+(p) with unique reduced representatives).

[F3]

The real numbers form an ordered field (The reals form a totally ordered field).

[F4]

In an ordered field every nonzero square is positive (Squares of nonzero elements are positive).

[F5]

C is the quotient R[x]/(x2+1) and i=x+(x2+1) (The complex numbers as R[x]/(x2+1), with the real embedding and imaginary unit i).

Proof

technique · direct
1.1

Apply [F2] to [F1]. With the construction in [F5], this proves that C is a field, that the constant-class map embeds R, and that every class has a unique representative a+bx, hence a unique form a+bi.

F1F2F5
2.1

Quotient addition and multiplication, followed by i2=1, give the two displayed coordinate formulas. All field axioms are inherited from the field in step 1.1.

F5step 1.1algebra
2.2

If a+bi0, uniqueness in step 1.1 gives a0 or b0. The corresponding square is positive by [F4], the other square is nonnegative, and therefore a2+b2>0 in the ordered field [F3].

F3F4step 1.1
3.1

Direct multiplication using step 2.1 gives (a+bi)(abi)=a2+b2. Since the real denominator is nonzero by step 2.2, division proves the inverse formula.

step 2.1step 2.2algebra
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-13Open item page →

C is the real coordinate plane, with coordinate arithmetic

Statement

The map Φ:CR2,Φ(a+bi)=(a,b), is a bijection. Under it, Φ((a+bi)+(u+vi))=(a+u,b+v) and Φ((a+bi)(u+vi))=(aubv,av+bu).

Facts & Assumptions

Given: The complex field in its quotient construction.

[F1]

Every complex number has a unique form a+bi, and addition and multiplication have the displayed coordinate formulas (C=R[x]/(x2+1) is a field, every element is uniquely a+bi, and every nonzero element has inverse (abi)/(a2+b2)).

Proof

technique · direct
1.1

Uniqueness in [F1] makes Φ well-defined and injective.

F1
1.2

For every (a,b)R2, the complex number a+bi maps to (a,b), so Φ is surjective.

F1
2.1

Applying Φ to the addition formula in [F1] gives the first coordinate identity.

F1step 1.1
3.1

Applying Φ to the multiplication formula in [F1] gives the second coordinate identity.

F1step 1.1
CorollaryStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-13Open item page →

C/R has power basis 1,i and degree 2

Statement

The complex field is a simple algebraic extension C=R(i). Its power basis is 1,i, and [C:R]=2.

Facts & Assumptions

Given: The real field extension C/R generated by i.

[F1]

x2+1 is irreducible over R (x2+1 is irreducible over R).

[F2]

For a algebraic over F with minimal polynomial ma of degree n, every element of F(a) is uniquely c0+c1a++cn1an1, so 1,a,,an1 is the power basis and [F(a):F]=n (A simple algebraic extension is its minimal-polynomial quotient and has power basis 1,a,,an1 and degree n).

[F4]

A root of a nonzero polynomial is algebraic (Algebraic and transcendental elements and algebraic extensions); for an algebraic element with minimal polynomial ma, f(a)=0 exactly when ma divides f (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element).

Proof

technique · direct
1.1

By [F3], i is a root of x2+1, and [F1] and [F4] make that polynomial its minimal polynomial.

F1F3F4
1.2

The unique coordinate form in [F3] gives C=R(i).

F3
2.1

Apply [F2] to step 1.1: the power basis is 1,i and the degree is 2.

F2step 1.1step 1.2
CorollaryStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-13Open item page →

A square root of 1 in a real field extension determines a unique real-field homomorphism from C

Statement

Let L/R be a field extension and let jL satisfy j2=1. There is a unique field homomorphism CL fixing R and sending i to j. Its image is R[j].

Facts & Assumptions

Given: A real field extension L/R and jL with j2=1.

[F1]

The complex numbers are R[x]/(x2+1) with i=x+(x2+1) (The complex numbers as R[x]/(x2+1), with the real embedding and imaginary unit i).

[F2]

x2+1 is monic and irreducible over R (x2+1 is irreducible over R).

[F3]

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

technique · direct
1.1

The equation j2=1 says exactly that j is a root of x2+1.

algebra
2.1

Apply [F3] to [F1], [F2], and step 1.1. It gives the unique homomorphism fixing R, sending i to j, and having image R[j].

F1F2F3step 1.1
DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-08-13Open item page →

Real and imaginary parts, complex conjugation, and modulus

Definition

Every zC has unique coordinates z=a+bi (C=R[x]/(x2+1) is a field, every element is uniquely a+bi, and every nonzero element has inverse (abi)/(a2+b2)). Define Rez=a,Imz=b,z=abi, and define its modulus by z=a2+b2. 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 a0 with (a)2=a; the positives are {x2:x0}.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-13Open item page →

Conjugation is an involutive real-field automorphism, zz=z2, and modulus is definite, multiplicative, and subadditive

Statement

Complex conjugation is a real-field automorphism satisfying z+w=z+w,zw=zw,z=z. For every z,wC, zz=z2,z0,z=0z=0, zw=zw,z+wz+w.

Facts & Assumptions

Given: z=a+bi and w=u+vi.

[F1]

Complex numbers have unique real coordinates and the coordinate addition and multiplication formulas (C=R[x]/(x2+1) is a field, every element is uniquely a+bi, and every nonzero element has inverse (abi)/(a2+b2)).

[F2]

Conjugation and modulus are defined by a+bi=abi and a+bi=a2+b2 (Real and imaginary parts, complex conjugation, and modulus).

[F3]

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 a0 with (a)2=a; the positives are {x2:x0}).

[F4]

For nonnegative elements r,s of an ordered field, rs if and only if r2s2 (Squaring is monotone on the nonnegatives).

[F5]

The square of every nonzero element of an ordered field is positive (Squares of nonzero elements are positive).

Proof

technique · direct
1.1

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.

F1F2algebra
1.2

Direct multiplication gives zz=a2+b2=z2.

F1F2algebra
1.3

Lagrange's identity gives (a2+b2)(u2+v2)(au+bv)2=(avbu)20. The final inequality follows from [F5], with the zero case included.

F5algebra
2.1

By [F2] and [F3], z0. If z=0, then z=0; conversely, z=0 makes a2+b2=0, and [F5] forces a=b=0.

F2F3F5step 1.2
3.1

Apply step 1.2 to zw and use step 1.1: zw2=(zw)zw=(zz)(ww)=z2w2. Both sides of zw=zw are nonnegative, so uniqueness in [F3] proves multiplicativity.

F3step 1.1step 1.2step 2.1
3.2

Hence au+bvzw: if au+bv0 this follows from zw0; otherwise both quantities are nonnegative, step 1.3 and [F4] give the inequality after squaring.

F4step 2.1step 1.3
4.1

Expanding with [F1] and [F2], then using step 3.2, gives z+w2=a2+b2+u2+v2+2(au+bv)(z+w)2.

F1F2step 1.2step 3.2algebra
5.1

Both sides of z+wz+w are nonnegative, so [F4] turns the squared inequality in step 4.1 into the triangle inequality.

F4step 2.1step 4.1
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-13Open item page →

The only real-field automorphisms of C are the identity and complex conjugation

Statement

Every field automorphism of C that fixes R pointwise is either the identity or complex conjugation, and these two automorphisms are distinct.

Facts & Assumptions

Proof

technique · direct
1.1

By [F1], i2=1; since σ is a field homomorphism fixing 1, applying it gives σ(i)2=1.

F1algebra
2.1

In the complex field, t2+1=(ti)(t+i); hence a root has t=i or t=i. Thus σ(i){i,i}.

F1step 1.1algebra
3.1

If σ(i)=i, uniqueness in [F3] makes σ the identity. If σ(i)=i, [F2] and uniqueness in [F3] make σ conjugation.

F2F3step 2.1
4.1

The two maps are distinct because they send i to the distinct elements i and i.

F1step 3.1algebra
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-13Open item page →

Every complex number has a square root, by an explicit Cartesian formula

Statement

Every z=a+biC has a square root. If b0, one square root is u+vi,u=z+a2,v=b2u. If b=0, one may take a when a0, and ia when a<0.

Facts & Assumptions

Given: A complex number z=a+bi.

[F2]

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 a0 with (a)2=a; the positives are {x2:x0}).

[F3]

The real numbers form an ordered field (The reals form a totally ordered field).

[F4]

Squaring is order-preserving and order-reflecting on nonnegative elements (Squaring is monotone on the nonnegatives).

Proof

technique · cases
1.1

Suppose b=0 and a0. Then [F2] gives (a)2=a=z.

assume-case nonnegativeF2
1.2

Suppose b=0 and a<0. Then [F2] gives (ia)2=a=z.

assume-case negativeF2F3algebra
1.3

Suppose b0. Then b2>0, so [F1] gives z2>a2. If a0, [F4] yields z>a; if a<0, it yields z>a. In either case z+a>0.

assume-case nonzeroF1F3F4
2.1

By [F2], u=(z+a)/2 exists and is positive; hence v=b/(2u) is defined.

F2F3step 1.3
3.1

From 4u2=2(z+a) and [F1], v2=b24u2=z2a22(z+a)=za2.

F1step 2.1algebra
4.1

Therefore u2v2=a and 2uv=b, so coordinate multiplication gives (u+vi)2=a+bi=z.

F5step 2.1step 3.1algebra
5.1

The cases b=0 with a0, b=0 with a<0, and b0 are exhaustive, so every complex number has a square root.

step 1.1step 1.2step 4.1cases-exhaustive

5 · Examples, counterexamples and false statements

None yet.

Sources