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.

Identities and inverses in a field are unique

Statement

In a field FF (Field) the additive identity, the multiplicative identity, each additive inverse, and each multiplicative inverse are unique. Hence the notations 00, 11, x-x, and x1x^{-1} denote well-defined elements, as the field definition and its consequences assume.

Facts & Assumptions

Given: A field FF satisfying the axioms (A), (M), (D) (Field).

[L1]

(F,+)(F, +) is an abelian group with identity 00: addition is associative and commutative and x+0=xx + 0 = x for all xx; and (F{0},)(F \setminus \{0\}, \cdot) is an abelian group with identity 11: multiplication is associative and commutative and x1=xx \cdot 1 = x for all x0x \ne 0 (Field).

Proof

technique · direct
1.1

The additive identity is unique: if 00 and 00' both satisfy x+0=xx + 0 = x and x+0=xx + 0' = x for all xx, then 0=0+0=0+0=00' = 0' + 0 = 0 + 0' = 0, using that 00 is an identity, commutativity, and that 00' is an identity.

L1
1.2

Additive inverses are unique: if aa and bb both satisfy x+a=0x + a = 0 and x+b=0x + b = 0, then a=a+0=a+(x+b)=(a+x)+b=0+b=ba = a + 0 = a + (x + b) = (a + x) + b = 0 + b = b, using associativity and commutativity.

L1
1.3

The same two arguments in the abelian group (F{0},)(F \setminus \{0\}, \cdot) give uniqueness of the multiplicative identity, 1=11=11=11' = 1' \cdot 1 = 1 \cdot 1' = 1, and of multiplicative inverses: if xa=1x a = 1 and xb=1x b = 1 with x0x \ne 0, then a=a1=a(xb)=(ax)b=1b=ba = a \cdot 1 = a (x b) = (a x) b = 1 \cdot b = b (using ax=xa=1a x = x a = 1).

L1
2.1

Therefore 00, 11 and, for each xx, its additive inverse x-x and (for x0x \ne 0) its multiplicative inverse x1x^{-1} are the unique elements with their defining properties, so all four notations are well-defined.

step 1.1step 1.2step 1.3

Depends on

Used by

Cited to discharge well-definedness by Field.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 1 result over 1 level. 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