Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)audited 2026-07-28
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.

The zero ring {0}\{0\}, in which 1=01 = 0: a commutative ring of characteristic 11 that is not a domain, not a division ring and not a field

Example

Let Z={z}Z = \{z\} be a one-element set, and define z+z:=zz + z := z, zz:=zz \cdot z := z, 0Z:=z0_Z := z and 1Z:=z1_Z := z. Then:

  1. ZZ is a commutative ring (Ring: an abelian group under addition and a monoid under multiplication, with multiplication distributing over addition on both sides, Commutative ring), the zero ring, and 1Z=0Z1_Z = 0_Z;
  2. up to the choice of the single element, it is the only ring in which 1=01 = 0: any ring RR with 1R=0R1_R = 0_R has R={0R}R = \{0_R\} (In any ring 0a=a0=00 \cdot a = a \cdot 0 = 0, (a)b=a(b)=(ab)(-a)b = a(-b) = -(ab), (a)(b)=ab(-a)(-b) = ab, (1)a=a(-1)a = -a and a(bc)=abaca(b - c) = ab - ac);
  3. ZZ has no zero divisors, and is nevertheless not an integral domain (Zero divisor, and integral domain: a commutative ring with 101 \ne 0 and no zero divisors), because it fails 101 \ne 0;
  4. ZZ is not a division ring (Division ring: a ring with 101 \ne 0 in which every nonzero element is a unit) and not a field (Field), for the same reason;
  5. char(Z)=1\operatorname{char}(Z) = 1 (The characteristic of a ring: the least n1n \ge 1 with n1R=0n \cdot 1_R = 0 when one exists, and 00 otherwise).

Facts & Assumptions

Given: The one-element set Z={z}Z = \{z\} with z+z=zz + z = z, zz=zz \cdot z = z, 0Z=z0_Z = z and 1Z=z1_Z = z.

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

[L3]

An integral domain is a commutative ring with 101 \ne 0 and no zero divisors; an element aa is a zero divisor only if a0a \ne 0 (Zero divisor, and integral domain: a commutative ring with 101 \ne 0 and no zero divisors).

[L4]

A division ring is a ring with 101 \ne 0 in which every nonzero element is a unit; a field has 010 \ne 1 among its axioms (Division ring: a ring with 101 \ne 0 in which every nonzero element is a unit, Field).

[L5]

char(R)\operatorname{char}(R) is the least nNn \in \mathbb{N} with n1n \ge 1 and n1R=0Rn \cdot 1_R = 0_R, if there is one, and 00 otherwise; the multiples satisfy 0a=0R0 \cdot a = 0_R and σ(n)a=na+a\sigma(n)\cdot a = n \cdot a + a (The characteristic of a ring: the least n1n \ge 1 with n1R=0n \cdot 1_R = 0 when one exists, and 00 otherwise, Powers gng^{n}: natural exponents in a monoid and integer exponents in a group, with g0=eg^{0} = e).

Verification

technique · direct
1.1

Every equation between elements of ZZ holds, since ZZ has exactly one element and both sides of any equation are that element. In particular addition is associative and commutative with two-sided identity 0Z0_Z and with zz its own additive inverse; multiplication is associative and commutative with two-sided identity 1Z1_Z; and both distributive laws hold. So ZZ is a commutative ring, and 1Z=z=0Z1_Z = z = 0_Z. This is claim 1.

L1given
1.2

Claim 2 is [L2]: if RR is a ring with 1R=0R1_R = 0_R then x=1Rx=0Rx=0Rx = 1_R x = 0_R x = 0_R for every xRx \in R, so R={0R}R = \{0_R\}.

L2
1.3

ZZ has no zero divisors: a zero divisor must be an element a0a \ne 0, and ZZ has no such element.

L3given
2.1

Claim 3: by step 1.1 the ring ZZ is commutative, by step 1.3 it has no zero divisors, and by step 1.1 it has 1Z=0Z1_Z = 0_Z; the clause 101 \ne 0 of [L3] therefore fails and ZZ is not an integral domain.

step 1.1step 1.3L3
2.2

Claim 4: the clause 101 \ne 0 of [L4] fails in ZZ, so ZZ is not a division ring; and the axioms of Field require 010 \ne 1, so ZZ is not a field. Note that "every nonzero element is a unit" holds vacuously in ZZ, so it is only the clause 101 \ne 0 that excludes it from being a division ring.

step 1.1L4
2.3

11Z=01Z+1Z=0Z+1Z=1Z=0Z1 \cdot 1_Z = 0 \cdot 1_Z + 1_Z = 0_Z + 1_Z = 1_Z = 0_Z, using the recursion of [L5] at σ(0)=1\sigma(0) = 1 and 1Z=0Z1_Z = 0_Z from step 1.1.

step 1.1L5
3.1

Claim 5: by step 2.3 the natural number 11 satisfies 111 \ge 1 and 11Z=0Z1 \cdot 1_Z = 0_Z, and no natural number nn with n1n \ge 1 is smaller than 11; so the least such nn is 11 and char(Z)=1\operatorname{char}(Z) = 1.

step 2.3L5

Remarks

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

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