Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck 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}, in which 1=0: a commutative ring of characteristic 1 that is not a domain, not a division ring and not a field

Example

Let Z={z} be a one-element set, and define z+z:=z, z⋅z:=z, 0Z:=z and 1Z:=z. Then:

  1. Z 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=0Z;
  2. up to the choice of the single element, it is the only ring in which 1=0: any ring R with 1R=0R has R={0R} (In any ring 0⋅a=a⋅0=0, (−a)b=a(−b)=−(ab), (−a)(−b)=ab, (−1)a=−a and a(b−c)=ab−ac);
  3. Z has no zero divisors, and is nevertheless not an integral domain (Zero divisor, and integral domain: a commutative ring with 1≠0 and no zero divisors), because it fails 1≠0;
  4. Z is not a division ring (Division ring: a ring with 1≠0 in which every nonzero element is a unit) and not a field (Field), for the same reason;
  5. char⁡(Z)=1 (The characteristic of a ring: the least n≥1 with n⋅1R=0 when one exists, and 0 otherwise).

Facts & Assumptions

Given: The one-element set Z={z} with z+z=z, z⋅z=z, 0Z=z and 1Z=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 1≠0 and no zero divisors; an element a is a zero divisor only if a≠0 (Zero divisor, and integral domain: a commutative ring with 1≠0 and no zero divisors).

[L4]

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

[L5]

char⁡(R) is the least n∈N with n≥1 and n⋅1R=0R, if there is one, and 0 otherwise; the multiples satisfy 0⋅a=0R and σ(n)⋅a=n⋅a+a (The characteristic of a ring: the least n≥1 with n⋅1R=0 when one exists, and 0 otherwise, Powers gn: natural exponents in a monoid and integer exponents in a group, with g0=e).

Verification

technique · direct
1.1

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

L1given
1.2

Claim 2 is [L2]: if R is a ring with 1R=0R then x=1Rx=0Rx=0R for every x∈R, so R={0R}.

L2
1.3

Z has no zero divisors: a zero divisor must be an element a≠0, and Z has no such element.

L3given
2.1

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

step 1.1step 1.3L3
2.2

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

step 1.1L4
2.3

1⋅1Z=0⋅1Z+1Z=0Z+1Z=1Z=0Z, using the recursion of [L5] at σ(0)=1 and 1Z=0Z from step 1.1.

step 1.1L5
3.1

Claim 5: by step 2.3 the natural number 1 satisfies 1≥1 and 1⋅1Z=0Z, and no natural number n with n≥1 is smaller than 1; so the least such n is 1 and char⁡(Z)=1.

step 2.3L5∎

Remarks

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

31 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources