Alphabeta Math
ExampleConstruction: AI-adaptedVerification: 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.

Z\mathbb{Z} is an integral domain of characteristic 00 whose group of units is {1,1}\{1,-1\}, so it is not a field: 22 is nonzero and not invertible

Example

Let Z\mathbb{Z} be the integers with the commutative ring structure of Z\mathbb{Z} is a commutative ring and an ordered ring, the published construction being an instance of the general definitions, and let 2:=1+12 := 1 + 1. Then:

  1. Z\mathbb{Z} is an integral domain (Zero divisor, and integral domain: a commutative ring with 101 \ne 0 and no zero divisors);
  2. Z×={1,1}\mathbb{Z}^{\times} = \{1,-1\} ((Z,,1)(\mathbb{Z}, \cdot, 1) is a commutative monoid whose group of units is {1,1}\{1, -1\}; equivalently u1u \mid 1 holds exactly for u=1u = 1 and u=1u = -1, with the unit group structure from The units of a ring are the invertible elements of its multiplicative monoid, and R×R^{\times} is a group under multiplication; 0R×0 \in R^{\times} only in the zero ring);
  3. 202 \ne 0 and 2Z×2 \notin \mathbb{Z}^{\times}, so Z\mathbb{Z} is not a field (Field);
  4. char(Z)=0\operatorname{char}(\mathbb{Z}) = 0 (The characteristic of a ring: the least n1n \ge 1 with n1R=0n \cdot 1_R = 0 when one exists, and 00 otherwise).

So an integral domain need not be a field: claim 1 with claim 3 is the witness that the two notions differ.

Facts & Assumptions

Given: The integers Z\mathbb{Z} with the operations of Arithmetic on the integers and the order of Order on the integers, and the numeral 2:=1+12 := 1 + 1 (The integers as equivalence classes of pairs of naturals).

[L2]

If x,yZx, y \in \mathbb{Z} are nonzero then xy0xy \ne 0 (The integers have no zero divisors; multiplicative cancellation).

[L4]

The order on Z\mathbb{Z} is total and compatible with addition, and Z\mathbb{Z} is a commutative ring (The integers form a totally ordered ring, The integers form a commutative ring, Order on the integers).

[L5]

ι:NZ\iota : \mathbb{N} \to \mathbb{Z}, ι(n)=[(n,0)]\iota(n) = [(n,0)], is injective and preserves addition, multiplication and order (The naturals embed in the integers); the formulas for 0Z=[(0,0)]0_{\mathbb Z}=[(0,0)] and 1Z=[(1,0)]1_{\mathbb Z}=[(1,0)] give ι(0)=0\iota(0)=0 and ι(1)=1\iota(1)=1 (Arithmetic on the integers).

[L6]

Induction on N\mathbb{N}, and n+1=σ(n)n + 1 = \sigma(n) on N\mathbb{N} (The principle of mathematical induction, Addition of natural numbers, The natural numbers N\mathbb{N} (von Neumann)).

[L7]

The additive multiples in a ring satisfy 01=00 \cdot 1 = 0 and σ(n)1=n1+1\sigma(n) \cdot 1 = n \cdot 1 + 1 for nNn \in \mathbb{N} (Powers gng^{n}: natural exponents in a monoid and integer exponents in a group, with g0=eg^{0} = e).

[L8]

char(R)\operatorname{char}(R) is the least n1n \ge 1 with n1R=0Rn \cdot 1_R = 0_R, or 00 if there is none (The characteristic of a ring: the least n1n \ge 1 with n1R=0n \cdot 1_R = 0 when one exists, and 00 otherwise); a field is a commutative ring in which every nonzero element is a unit (Every field is a commutative ring with 101 \ne 0; it is an integral domain, and it is a commutative division ring, Field).

Verification

technique · direct
1.1

Claim 1: Z\mathbb{Z} is a commutative ring by [L1]; 101 \ne 0, since 1=ι(1)1 = \iota(1), 0=ι(0)0 = \iota(0) and ι\iota is injective while 101 \ne 0 in N\mathbb{N}; and Z\mathbb{Z} has no zero divisors by [L2]. So Z\mathbb{Z} is an integral domain.

L1L2L5
1.2

Claim 2 is [L3]: the multiplicative monoid of the ring Z\mathbb{Z} is (Z,,1)(\mathbb{Z},\cdot,1), and its group of units is {1,1}\{1,-1\}.

L1L3
1.3

0<1<20 < 1 < 2: 1=ι(1)1 = \iota(1) lies in the image of ι\iota, so 010 \le 1, and 101 \ne 0 by injectivity of ι\iota; adding 11 to 0<10 < 1 gives 1<1+1=21 < 1 + 1 = 2.

L4L5
1.4

The map nn1n \mapsto n \cdot 1 from N\mathbb{N} to Z\mathbb{Z} is ι\iota. Both send 00 to 00, since 01=00 \cdot 1 = 0 and ι(0)=0\iota(0) = 0; and if n1=ι(n)n \cdot 1 = \iota(n) then σ(n)1=n1+1=ι(n)+ι(1)=ι(n+1)=ι(σ(n))\sigma(n)\cdot 1 = n \cdot 1 + 1 = \iota(n) + \iota(1) = \iota(n+1) = \iota(\sigma(n)), because ι\iota preserves addition. Induction on N\mathbb{N} gives the claim.

L5L6L7
2.1

Claim 3: by step 1.3, 0<1<20 < 1 < 2, so 202 \ne 0 and 212 \ne 1; and 1<0<2-1 < 0 < 2 by adding 1-1 to 0<10 < 1 and using transitivity, so 212 \ne -1. Hence 2{1,1}=Z×2 \notin \{1,-1\} = \mathbb{Z}^{\times} by step 1.2. A field has every nonzero element a unit, so Z\mathbb{Z} is not a field.

step 1.2step 1.3L4L8
2.2

Claim 4: for nNn \in \mathbb{N} with n1n \ge 1 we have n1=ι(n)n \cdot 1 = \iota(n) by step 1.4, and ι(n)ι(0)=0\iota(n) \ne \iota(0) = 0 because ι\iota is injective and n0n \ne 0. So no n1n \ge 1 satisfies n1=0n \cdot 1 = 0, and char(Z)=0\operatorname{char}(\mathbb{Z}) = 0.

step 1.4L5L8
3.1

Claims 1 to 4 are established in steps 1.1, 1.2, 2.1 and 2.2.

step 1.1step 1.2step 2.1step 2.2

Remarks

Depends on

Used by

Dependency tree · next 3 levels

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