Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passverified 2026-08-03 (gpt-5.6-sol-codex-subscription)
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.

Every field is a commutative ring with 101 \ne 0; it is an integral domain, and it is a commutative division ring

Statement

Let FF be a field (Field), with addition ++, multiplication \cdot, and distinguished elements 010 \ne 1. Then

  1. (F,+,,0,1)(F, +, \cdot, 0, 1) is a ring (Ring: an abelian group under addition and a monoid under multiplication, with multiplication distributing over addition on both sides), and it is commutative (Commutative ring), with 101 \ne 0;
  2. FF is an integral domain (Zero divisor, and integral domain: a commutative ring with 101 \ne 0 and no zero divisors);
  3. FF is a division ring (Division ring: a ring with 101 \ne 0 in which every nonzero element is a unit), and hence a commutative division ring.

The field structure is not changed by this: the ring operations are the field operations, and the ring's zero and identity are the field's 00 and 11.

Facts & Assumptions

Given: A field FF with operations ++ and \cdot and distinguished elements 010 \ne 1, satisfying the axioms (A), (M) and (D) of Field.

[A1]

Axiom (M) of Field: multiplication is associative and commutative on all of FF, and x1=xx \cdot 1 = x for every xFx \in F, the element 00 included; moreover (F{0},)(F \setminus \{0\}, \cdot) is an abelian group with identity 11, so every x0x \ne 0 has a multiplicative inverse x1x^{-1} with xx1=1x \cdot x^{-1} = 1.

[A2]

Axiom (A): (F,+)(F,+) is an abelian group with identity 00; addition is associative and commutative, x+0=xx + 0 = x for all xx, and every xx has an additive inverse x-x with x+(x)=0x + (-x) = 0 (Field, Group and abelian group).

[A3]

Axiom (D), left distributivity: x(y+z)=xy+xzx(y+z) = xy + xz for all x,y,zFx, y, z \in F (Field).

[A4]

010 \ne 1 (Field).

[L1]

A ring is an abelian group under addition, a monoid under multiplication, and satisfies both distributive laws; it is commutative when its multiplication is (Ring: an abelian group under addition and a monoid under multiplication, with multiplication distributing over addition on both sides, Commutative ring, Semigroup and monoid).

[L2]

In a field, ab=0ab = 0 implies a=0a = 0 or b=0b = 0 (A field has no zero divisors: ab=0a=0ab = 0 \Rightarrow a = 0 or b=0b = 0).

[L3]

In a field the identities 00, 11 and the inverses x-x, x1x^{-1} are unique, so the notation is single-valued (Identities and inverses in a field are unique, Left inverse, right inverse, and invertible element of a monoid).

Proof

technique · direct
1.1

(F,+,0)(F,+,0) is an abelian group: this is axiom (A), and 0+x=x+0=x0 + x = x + 0 = x follows from x+0=xx + 0 = x and commutativity of addition.

A2
1.2

(F,,1)(F,\cdot,1) is a commutative monoid: multiplication is a binary operation on FF, it is associative and commutative on all of FF by axiom (M), and x1=xx \cdot 1 = x for every xFx \in F by the same axiom, whence 1x=x1=x1 \cdot x = x \cdot 1 = x by commutativity.

A1L1
1.3

Right distributivity: for all x,y,zFx, y, z \in F, (y+z)x=x(y+z)=xy+xz=yx+zx(y+z)x = x(y+z) = xy + xz = yx + zx, the first and third equalities being commutativity of multiplication at the pairs (y+z,x)(y+z, x), (x,y)(x,y) and (x,z)(x,z) from axiom (M) as stated in [A1], and the middle one axiom (D).

A1A3
1.4

FF has no zero divisors: if ab=0ab = 0 then a=0a = 0 or b=0b = 0 by [L2], which is exactly the condition of Zero divisor, and integral domain: a commutative ring with 101 \ne 0 and no zero divisors.

L2
2.1

By steps 1.1, 1.2 and 1.3 together with axiom (D), FF satisfies (R1), (R2) and (R3) of Ring: an abelian group under addition and a monoid under multiplication, with multiplication distributing over addition on both sides, so FF is a ring; its multiplication is commutative by step 1.2, so it is a commutative ring; and 101 \ne 0 by [A4]. This is claim 1.

step 1.1step 1.2step 1.3A3A4L1
3.1

Claim 2: by step 2.1 the ring FF is commutative with 101 \ne 0, and by step 1.4 it has no zero divisors, so it is an integral domain.

step 2.1step 1.4L2
3.2

Claim 3: 101 \ne 0 by [A4]; and if xFx \in F with x0x \ne 0, axiom (M) supplies x1Fx^{-1} \in F with xx1=1x \cdot x^{-1} = 1, and x1x=1x^{-1} \cdot x = 1 as well, by the commutativity of multiplication that (M) asserts. So xx is a unit of the ring FF, and FF is a division ring; it is commutative by step 2.1.

step 2.1A1A4L3
4.1

Claims 1, 2 and 3 are established in steps 2.1, 3.1 and 3.2.

step 2.1step 3.1step 3.2

Remarks

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 22 results over 14 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources