Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (openai/gpt-5.4)audited 2026-07-25
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.

A field has no zero divisors: ab=0a=0ab = 0 \Rightarrow a = 0 or b=0b = 0

Statement

In any field FF (Field), if a,bFa, b \in F satisfy ab=0ab = 0, then a=0a = 0 or b=0b = 0.

Facts & Assumptions

Given: A field FF and elements a,bFa, b \in F with ab=0ab = 0.

[L1]

Field axioms (Field): if a0a \ne 0 then aa has a multiplicative inverse a1a^{-1} with a1a=1a^{-1} a = 1; multiplication is associative; and 11 is the multiplicative identity, so 1x=x1 \cdot x = x.

[L2]

For every xFx \in F, x0=0x \cdot 0 = 0 (Multiplication by zero: 0a=00 \cdot a = 0, using commutativity).

Proof

technique · direct
1.1

If a=0a = 0 the disjunction a=0a = 0 or b=0b = 0 already holds, so it suffices to assume a0a \ne 0 and derive b=0b = 0.

suffices: a ne 0 implies b = 0
1.2

Assuming a0a \ne 0, the inverse a1a^{-1} exists with a1a=1a^{-1} a = 1.

L1
1.3

Since 11 is the multiplicative identity, b=1bb = 1 \cdot b.

L1
1.4

By associativity, (a1a)b=a1(ab)(a^{-1} a) \cdot b = a^{-1} (a b).

L1
1.5

We are given ab=0ab = 0.

given
1.6

a10=0a^{-1} \cdot 0 = 0.

L2
2.1

Substituting 1=a1a1 = a^{-1} a into b=1bb = 1 \cdot b and using associativity gives b=(a1a)b=a1(ab)b = (a^{-1} a) b = a^{-1}(ab).

step 1.2step 1.3step 1.4
2.2

Since ab=0ab = 0, we have a1(ab)=a10a^{-1}(ab) = a^{-1} \cdot 0.

step 1.5
3.1

Combining, b=a1(ab)=a10=0b = a^{-1}(ab) = a^{-1} \cdot 0 = 0.

step 2.1step 2.2step 1.6
4.1

Hence a0a \ne 0 forces b=0b = 0, so in every case a=0a = 0 or b=0b = 0.

step 1.1step 3.1

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 2 results over 2 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