Alphabeta Math
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.

✓ 10 results · all verified · 2 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full by a delegated reviewing agent on the owner's instruction; the judge is an additional, independent cross-model AI review of the proofs. The 8 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Rings, Domains and Fields: Examples and Counterexamples

1 · Prerequisites

2 · Summary

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-28Open item page →

Z is a commutative ring and an ordered ring, the published construction being an instance of the general definitions

Example

Let Z be the integers (The integers as equivalence classes of pairs of naturals) with the operations of Arithmetic on the integers and the order of Order on the integers. Then:

  1. (Z,+,⋅,0,1) is a ring in the sense of Ring: an abelian group under addition and a monoid under multiplication, with multiplication distributing over addition on both sides, and it is commutative (Commutative ring);
  2. Z with the order ≤ is an ordered ring in the sense of Ordered ring: a ring with a total order compatible with addition and with positives closed under multiplication;
  3. its positive cone P={ x∈Z:0<x } satisfies trichotomy and closure in the sense of The order presentation and the positive-cone presentation of an ordered ring determine each other: P={ x:0<x } satisfies trichotomy and closure, and a<b:  ⟺  b−a∈P recovers the order, and the order it induces is the published order of Order on the integers.

The point of the example is that nothing is being built: the published The integers form a commutative ring and The integers form a totally ordered ring were proved before rings were defined and used the words "commutative ring" and "totally ordered ring" informally. This item records that those words, as used there, mean exactly what Ring: an abelian group under addition and a monoid under multiplication, with multiplication distributing over addition on both sides and Ordered ring: a ring with a total order compatible with addition and with positives closed under multiplication mean, so that a statement about rings may be applied to Z without translation.

Facts & Assumptions

Given: The set Z with +, ⋅, 0=[(0,0)], 1=[(1,0)] and the order ≤ (The integers as equivalence classes of pairs of naturals, Arithmetic on the integers, Order on the integers).

[L1]

(Z,+,⋅,0,1) is a commutative ring with multiplicative identity, in which every element has an additive inverse, namely −[(a,b)]=[(b,a)] (The integers form a commutative ring).

[L2]

The relation of Order on the integers is a total order on Z; it is compatible with addition (x≤y implies x+z≤y+z), and 0<x and 0<y imply 0<xy (The integers form a totally ordered ring).

[L3]

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

[L4]

An ordered ring is a ring with a total order satisfying (OR1) and (OR2) as in [L2] (Ordered ring: a ring with a total order compatible with addition and with positives closed under multiplication).

Verification

technique · direct
1.1

By [L1], addition on Z is associative and commutative, 0 is a two-sided additive identity, and every element has an additive inverse; so (Z,+,0) is an abelian group.

L1L3
1.2

By [L1], multiplication is associative and commutative and 1 is a multiplicative identity, so (Z,⋅,1) is a commutative monoid; and multiplication distributes over addition. Since multiplication is commutative, the right distributive law follows from the left one: (y+z)x=x(y+z)=xy+xz=yx+zx.

L1L3
2.1

By steps 1.1 and 1.2 the structure (Z,+,⋅,0,1) satisfies (R1), (R2) and (R3) of Ring: an abelian group under addition and a monoid under multiplication, with multiplication distributing over addition on both sides and its multiplication is commutative, so it is a commutative ring. This is claim 1.

step 1.1step 1.2L3
3.1

By [L2] the relation ≤ is a total order on Z satisfying (OR1) and (OR2) verbatim; with step 2.1 this makes Z an ordered ring, which is claim 2.

step 2.1L2L4
4.1

Claim 3 is [L5] applied to the ordered ring of step 3.1.

step 3.1L5∎

Remarks

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passverified 2026-08-03 (gpt-5.6-sol-codex-subscription)Open item page →

Z is an integral domain of characteristic 0 whose group of units is {1,−1}, so it is not a field: 2 is nonzero and not invertible

Example

Facts & Assumptions

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

[L2]

If x,y∈Z are nonzero then xy≠0 (The integers have no zero divisors; multiplicative cancellation).

[L4]

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

[L5]

ι:N→Z, ι(n)=[(n,0)], is injective and preserves addition, multiplication and order (The naturals embed in the integers); the formulas for 0Z=[(0,0)] and 1Z=[(1,0)] give ι(0)=0 and ι(1)=1 (Arithmetic on the integers).

[L7]

The additive multiples in a ring satisfy 0⋅1=0 and σ(n)⋅1=n⋅1+1 for n∈N (Powers gn: natural exponents in a monoid and integer exponents in a group, with g0=e).

[L8]

char⁡(R) is the least n≥1 with n⋅1R=0R, or 0 if there is none (The characteristic of a ring: the least n≥1 with n⋅1R=0 when one exists, and 0 otherwise); a field is a commutative ring in which every nonzero element is a unit (Every field is a commutative ring with 1≠0; it is an integral domain, and it is a commutative division ring, Field).

Verification

technique · direct
1.1

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

L1L2L5
1.2

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

L1L3
1.3

0<1<2: 1=ι(1) lies in the image of ι, so 0≤1, and 1≠0 by injectivity of ι; adding 1 to 0<1 gives 1<1+1=2.

L4L5
1.4

The map n↦n⋅1 from N to Z is ι. Both send 0 to 0, since 0⋅1=0 and ι(0)=0; and if n⋅1=ι(n) then σ(n)⋅1=n⋅1+1=ι(n)+ι(1)=ι(n+1)=ι(σ(n)), because ι preserves addition. Induction on N gives the claim.

L5L6L7
2.1

Claim 3: by step 1.3, 0<1<2, so 2≠0 and 2≠1; and −1<0<2 by adding −1 to 0<1 and using transitivity, so 2≠−1. Hence 2∉{1,−1}=Z× by step 1.2. A field has every nonzero element a unit, so Z is not a field.

step 1.2step 1.3L4L8
2.2

Claim 4: for n∈N with n≥1 we have n⋅1=ι(n) by step 1.4, and ι(n)≠ι(0)=0 because ι is injective and n≠0. So no n≥1 satisfies n⋅1=0, and char⁡(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

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-07-28Open item page →

Q and R are fields, hence commutative rings, integral domains and ordered rings, all of characteristic 0

Example

Facts & Assumptions

Given: F is Q or R, with its published operations and order.

[L2]

The published order on each makes it a totally ordered field: the order is total, x≤y implies x+z≤y+z, and 0<x and 0<y imply 0<xy (The rationals form a totally ordered field, The reals form a totally ordered field).

[L5]

An ordered field is a field with a subset P satisfying trichotomy (O1) and closure (O2), the order being a<b:  ⟺  b−a∈P; and every ordered field is an ordered ring whose positive cone is P (Ordered field, Every ordered field is an ordered ring, and its order is the one its positive cone induces).

[L7]

In an ordered field, n⋅1F>0 for every n≥1, the multiples being given by 1⋅1F=1F and (n+1)⋅1F=n⋅1F+1F (Canonical naturals are positive and strictly increasing).

[L8]

char⁡(R) is the least n≥1 with n⋅1R=0R, or 0 if there is none (The characteristic of a ring: the least n≥1 with n⋅1R=0 when one exists, and 0 otherwise).

Verification

technique · direct
1.1

Claim 1: F is a field by [L1], hence a commutative ring with 1≠0 and an integral domain by [L3].

L1L3
2.1

By [L2] the published order on F is a total order satisfying (OR1) and (OR2) of Ordered ring: a ring with a total order compatible with addition and with positives closed under multiplication verbatim; with step 1.1 this makes F an ordered ring.

L1L2L3
3.1

By [L4] applied to that ordered ring, P={ x∈F:0<x } satisfies trichotomy and closure, and the relation a<b:  ⟺  b−a∈P is the published order. Together with the field structure from step 1.1, trichotomy and closure are exactly axioms (O1) and (O2) of Ordered field, so (F,P) is an ordered field whose order is the published one. This is claim 2.

step 1.1step 2.1L4L5
4.1

By step 3.1 the ordered-field structure of F is available, so [L7] applies. Its multiples and the multiples of [L8] are the same elements: both agree with the canonical natural ι(n) of The canonical natural ι(n)=n⋅1F of a field by [L6], since ι(1)=ι(0)+1F=1F and both recursions add 1F at each successor. Hence n⋅1F>0 for every natural n≥1, and n⋅1F≠0F because 0F is not positive by trichotomy.

step 3.1L5L6L7
5.1

Claim 3: by step 4.1 there is no natural n≥1 with n⋅1F=0F, so char⁡(F)=0 by [L8].

step 4.1L8
6.1

Claims 1, 2 and 3 are established in steps 1.1, 3.1 and 5.1.

step 1.1step 3.1step 5.1∎

Remarks

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passverified 2026-08-03 (gpt-5.6-sol-codex-subscription)Open item page →

The Cauchy sequences of rationals form a commutative ring that is not an integral domain: two eventually-constant sequences with disjoint supports multiply to zero

Example

Let X:={ n∈N:n≥1 } (The natural numbers N (von Neumann), Order on the natural numbers) and let C be the set of Cauchy sequences of rationals, that is, the set of those functions X→Q that satisfy the condition of Cauchy sequence of rationals; that definition indexes its sequences (an)n≥1, so X, and not N, is the index set. Give C the termwise operations and the constant sequences 0 and 1. Then:

  1. C is a commutative ring in the sense of Ring: an abelian group under addition and a monoid under multiplication, with multiplication distributing over addition on both sides and Commutative ring, with 1≠0;

  2. C is a subring (Subring: a subset containing 1R and closed under addition, additive inverses and multiplication) of the ring QX of all functions X→Q with pointwise operations (The ring RX of all functions from a set X into a ring, with pointwise operations);

  3. C is not an integral domain (Zero divisor, and integral domain: a commutative ring with 1≠0 and no zero divisors): the sequences

    a=(1,0,0,0,… ),b=(0,1,1,1,… )

    defined by a1=1, an=0 for n≥2, and b1=0, bn=1 for n≥2, are both Cauchy, both nonzero, and satisfy ab=0; so each is a zero divisor.

Facts & Assumptions

Given: X={ n∈N:n≥1 }; the set C of functions X→Q that are Cauchy in the sense of Cauchy sequence of rationals; termwise addition and multiplication; and the constant sequences 0 and 1.

[L1]

C with termwise addition and multiplication and the constant sequences 0 and 1 is a commutative ring with identity (Cauchy sequences form a commutative ring).

[L3]

For a set Y and a ring R, the set RY of all functions Y→R with pointwise operations and the constant functions 0R, 1R is a ring, commutative when R is (The ring RX of all functions from a set X into a ring, with pointwise operations).

[L5]

A sequence (cn)n≥1 of rationals is Cauchy when for every rational ε>0 there is N∈N with ∣cm−cn∣<ε for all m,n≥N (Cauchy sequence of rationals).

[L7]

a is a zero divisor when a≠0 and ab=0 or ba=0 for some b≠0; in a commutative ring the two alternatives agree. An integral domain is a commutative ring with 1≠0 and no zero divisors (Zero divisor, and integral domain: a commutative ring with 1≠0 and no zero divisors).

[L8]

If n∈N and n≥1, then either n=1 or n≥2, by discreteness of the natural order (Order on the natural numbers, Discreteness: σ(n) is the immediate successor).

Verification

technique · direct
1.1

Claim 1: [L1] states exactly that C, with these operations and these two constant sequences, is a commutative ring with identity, so all of (R1), (R2), (R3) and commutativity hold. And 1≠0 in C, since the two constant sequences differ at the index 1, where 1≠0 in Q.

L1L2
1.2

QX is a commutative ring by [L3] with Y=X and R=Q, its operations being pointwise, which on functions X→Q is termwise.

L2L3
1.3

Any eventually constant sequence is Cauchy: if cn=c for all n≥N0, then for any rational ε>0 and all m,n≥N0 we have ∣cm−cn∣=∣c−c∣=0<ε. In particular a, b and the constant sequences 0 and 1 lie in C.

L2L5given
1.4

ab=0: at the index 1 the product is a1b1=1⋅0=0, and at every index n≥2 it is anbn=0⋅1=0; every index of X is 1 or is ≥2 by [L8].

L2L6L8given
2.1

Claim 2: C⊆QX, the identity of QX is the constant sequence 1, which lies in C by step 1.3, and C is closed under termwise subtraction and multiplication because it is a ring under those operations by [L1] and they are the operations of QX by step 1.2. So the criterion [L4] applies.

step 1.2step 1.3L1L4
2.2

a≠0 and b≠0 in C: a1=1≠0 and b2=1≠0 in Q, and two sequences are equal exactly when they agree at every index.

step 1.3L2given
3.1

Claim 3: by steps 2.2 and 1.4 the element a is nonzero and ab=0 with b nonzero, so a is a zero divisor, and symmetrically so is b. Hence C has zero divisors and is not an integral domain, although by step 1.1 it is a commutative ring with 1≠0.

step 1.1step 2.2step 1.4L7∎

Remarks

  • The index set is stated because it is not N. Cauchy sequence of rationals indexes its sequences from n=1, while The ring RX of all functions from a set X into a ring, with pointwise operations takes an arbitrary index set; the ambient ring in claim 2 is therefore QX with X={ n∈N:n≥1 }, not QN. Since N contains 0 (The natural numbers N (von Neumann)) the two are different sets of functions, and the subring claim would be false as stated about the second.

  • Why this matters for the construction of R. The real numbers are defined as the quotient C/N by the null sequences (The real numbers), and The reals form a field proves that quotient is a field. The present example shows the field property cannot come from C alone: C is not even a domain. What The reals form a field actually uses is The null ideal is maximal, a property of N inside C. The two zero divisors above cause no trouble in the quotient: a is a null sequence (Null sequence), so its class is 0, and b differs from the constant sequence 1 by a null sequence, so its class is 1.

  • The witnesses are chosen to keep the verification short. Both are eventually constant, hence Cauchy with no ε bookkeeping, and their supports are disjoint, which makes the product zero at every index.

ExampleConstruction: Literature-sourcedVerification: AI-generatedprecheck passaudited 2026-07-28Open item page →

A product of two rings with 1≠0 always has zero divisors: (1,0)(0,1)=(0,0) in Z×Z, so a product of integral domains is never an integral domain

Example

Let R and S be rings (Ring: an abelian group under addition and a monoid under multiplication, with multiplication distributing over addition on both sides) with 1R≠0R and 1S≠0S, and let R×S be the product ring (The product ring R×S with componentwise operations, its identity (1R,1S) and its units R××S×). Then:

  1. (1R,0S) and (0R,1S) are nonzero elements of R×S whose product is (0R,0S); each is therefore a zero divisor (Zero divisor, and integral domain: a commutative ring with 1≠0 and no zero divisors);
  2. consequently R×S is never an integral domain, whatever R and S are; in particular a product of two integral domains is not one;
  3. the concrete instance is Z×Z, where (1,0)(0,1)=(0,0) while Z itself is an integral domain (Z is an integral domain of characteristic 0 whose group of units is {1,−1}, so it is not a field: 2 is nonzero and not invertible).

Facts & Assumptions

Given: Rings R, S with 1R≠0R and 1S≠0S, and the product ring R×S with componentwise operations, zero (0R,0S) and identity (1R,1S) (The product ring R×S with componentwise operations, its identity (1R,1S) and its units R××S×).

[L3]

a is a zero divisor when a≠0 and ab=0 or ba=0 for some b≠0; an integral domain is a commutative ring with 1≠0 and no zero divisors (Zero divisor, and integral domain: a commutative ring with 1≠0 and no zero divisors, Commutative ring).

Verification

technique · direct
1.1

(1R,0S)≠(0R,0S), since the first components differ, 1R≠0R; and (0R,1S)≠(0R,0S), since the second components differ, 1S≠0S.

L1given
1.2

(1R,0S)⋅(0R,1S)=(1R0R,  0S1S)=(0R,0S), the components being computed by [L2].

L1L2
2.1

Claim 1: by steps 1.1 and 1.2 the element (1R,0S) is nonzero, the element (0R,1S) is nonzero, and their product is the zero of R×S; so each is a zero divisor.

step 1.1step 1.2L3
3.1

Claim 2: an integral domain has no zero divisors, and R×S has one by step 2.1; so R×S is not an integral domain. Every integral domain satisfies 1≠0, so a product of two integral domains falls under the hypothesis and is never one.

step 2.1L3
4.1

Claim 3: Z is a ring with 1≠0 by [L4], so steps 2.1 and 3.1 apply with R=S=Z, giving (1,0)(0,1)=(0,0) with both factors nonzero; and Z is an integral domain by [L4], so Z×Z is a product of two integral domains that is not one.

step 2.1step 3.1L4∎

Remarks

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-28Open item page →

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

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passverified 2026-08-03 (gpt-5.6-sol-codex-subscription)Open item page →

Z sits inside Q as a subring that is not a subfield, so the inverse-closure clause of the subfield definition is doing work

Example

The integers are not literally a subset of the rationals in this library: Q is a set of equivalence classes of pairs of integers, so "Z inside Q" means the image of the embedding j:Z→Q, j(k)=[(k,1)], of The integers embed in the rationals. Write K:=j(Z)⊆Q and let 2:=1+1 in Z. Then:

  1. K is a subring of the ring Q (Subring: a subset containing 1R and closed under addition, additive inverses and multiplication);
  2. K is not a subfield of Q (Subfield: a subring of a field closed under inverses of its nonzero elements, and therefore a field with the restricted operations): the element j(2) is a nonzero member of K whose inverse in Q does not lie in K;
  3. so the inverse-closure clause (K2) of Subfield: a subring of a field closed under inverses of its nonzero elements, and therefore a field with the restricted operations is not implied by being a subring.

Facts & Assumptions

Given: The embedding j:Z→Q, j(k)=[(k,1)], and K=j(Z); the numeral 2=1+1 in Z (The integers as equivalence classes of pairs of naturals).

[L1]

j is injective and preserves addition and multiplication; composing with the embedding of N it also preserves order (The integers embed in the rationals).

[L6]

A subfield of a field F is a subring closed under the inverses of its nonzero elements (Subfield: a subring of a field closed under inverses of its nonzero elements, and therefore a field with the restricted operations).

[L8]

ι:N→Z is injective and order preserving with ι(0)=0, ι(1)=1 (The naturals embed in the integers, Arithmetic on the integers).

Verification

technique · direct
1.1

j(0Z)=0Q and j(1Z)=1Q. The first: j(0)+j(0)=j(0+0)=j(0)=j(0)+0Q, and cancelling j(0) gives j(0)=0Q. The second: j(1)j(1)=j(1⋅1)=j(1), and j(1)≠0Q because 1Z≠0Z and j is injective with j(0Z)=0Q; so j(1)=1Q. Consequently j(−b)=−j(b) for every b, since j(b)+j(−b)=j(0)=0Q.

L1L2L3L4L8
1.2

0<1<2 in Z, and −1<0: the first because 1=ι(1) is nonnegative and 1≠0 by injectivity of ι, the second by adding 1 to 0<1, and the third by adding −1 to 0<1. Hence 2≠0, 2≠1 and 2≠−1, so 2∉Z× by [L7].

L3L7L8
2.1

1Q=j(1Z)∈K by step 1.1; and for u=j(a), v=j(b) in K we have u−v=j(a)+(−j(b))=j(a)+j(−b)=j(a−b)∈K and uv=j(a)j(b)=j(ab)∈K. So K is a subring of Q by [L5]. This is claim 1.

step 1.1L1L2L5
2.2

j(2)≠0Q: by step 1.2, 2≠0Z, and j is injective with j(0Z)=0Q by step 1.1. So j(2) has an inverse j(2)−1 in the field Q.

step 1.1step 1.2L1L2
3.1

j(2)−1∉K. Suppose it were, say j(2)−1=j(m) for some m∈Z. Then j(2m)=j(2)j(m)=1Q=j(1Z), so 2m=1Z by injectivity of j; commutativity also gives m2=1, so m is a two-sided inverse and 2 is a unit of Z, contradicting step 1.2.

step 1.1step 1.2step 2.2L1L3L7
4.1

Claims 2 and 3: by claim 1 the set K is a subring of Q, and by steps 2.2 and 3.1 it contains a nonzero element whose inverse in Q is not in K; so (K2) of [L6] fails and K is not a subfield. Since K satisfies (K1), the clause (K2) is not implied by (K1).

step 2.1step 2.2step 3.1L6∎

Remarks

CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck passverified 2026-08-03 (gpt-5.6-sol-codex-subscription)Open item page →

2Z is closed under addition, negation and multiplication and is not a subring of Z, because it does not contain 1

Statement refuted

False claim: if S is a subset of a ring R that contains 0R and is closed under addition, under additive inverses and under multiplication, then S is a subring of R (Subring: a subset containing 1R and closed under addition, additive inverses and multiplication).

The even integers refute it. Let 2:=1+1 in Z and

2Z  :=  { x∈Z  :  2∣x }  =  { 2k:k∈Z },

divisibility being the relation of Divisibility in Z: d∣a when a=dq for some integer q. This set contains 0, is closed under addition, additive inverses and multiplication, and does not contain 1; so it fails clause (T1) of Subring: a subset containing 1R and closed under addition, additive inverses and multiplication and is not a subring of Z.

Facts & Assumptions

[L2]

d∣a means a=dq for some q∈Z, and d∣0 for every d (Divisibility in Z: d∣a when a=dq for some integer q).

[L3]

Divisibility is linear: if d∣a and d∣b then d∣ax+by for all x,y∈Z; and d∣a implies d∣ac and d∣−a (Divisibility is reflexive and transitive on Z, and is linear: if d∣a and d∣b then d∣ax+by for all integers x,y; also d∣a implies d∣ac, −d∣a and d∣−a).

[L5]

The order on Z is total and compatible with addition, and ι:N→Z is injective and order preserving with ι(0)=0, ι(1)=1 (The integers form a totally ordered ring, Order on the integers, The naturals embed in the integers, The integers as equivalence classes of pairs of naturals, Arithmetic on the integers).

[L6]

A subring must satisfy (T1) 1R∈S, (T2) closure under addition, (T3) closure under additive inverses and (T4) closure under multiplication (Subring: a subset containing 1R and closed under addition, additive inverses and multiplication); equivalently 1R∈S together with a−b∈S and ab∈S (Subring criterion: S⊆R is a subring if and only if 1R∈S and a−b∈S and ab∈S for all a,b∈S; and an intersection of subrings is a subring).

[L7]

A subgroup of an abelian group is a subset containing the identity and closed under the operation and under inverses (Subgroup).

[L8]

The refuted claim: a subset of a ring containing 0 and closed under addition, additive inverses and multiplication is a subring.

Counterexample

technique · direct
1.1

0∈2Z, since 2∣0 by [L2].

L2
1.2

2Z is closed under multiplication: if 2∣a then 2∣ab for every b∈Z, by [L3].

L3
1.3

0<1<2 and −1<0 in Z: 1=ι(1) is nonnegative and differs from 0=ι(0) because ι is injective, so 0<1; adding 1 gives 1<2; and adding −1 to 0<1 gives −1<0. Hence 2≠1 and 2≠−1.

L5
2.1

2Z is closed under addition and under additive inverses: if 2∣a and 2∣b then 2∣a⋅1+b⋅1=a+b by the linearity of [L3], and 2∣−a by [L3]. So 2Z is a subgroup of (Z,+,0) in the sense of [L7].

step 1.1L1L3L7
2.2

1∉2Z: if 2∣1 then 2∈{1,−1} by [L4], contradicting step 1.3.

step 1.3L2L4
3.1

By steps 1.1, 2.1 and 1.2 the set 2Z contains 0 and is closed under addition, additive inverses and multiplication; by step 2.2 it does not contain 1=1Z, so clause (T1) of [L6] fails and 2Z is not a subring of Z. The claim of [L8] is therefore false.

step 1.1step 2.1step 1.2step 2.2L6L8∎

Remarks

CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck passverified 2026-08-03 (gpt-5.6-sol-codex-subscription)Open item page →

The map n↦(n,0) from Z to Z×Z preserves addition and multiplication and does not preserve 1, so the clause f(1)=1 is not redundant

Statement refuted

False claim: if R and S are rings and f:R→S satisfies f(x+y)=f(x)+f(y) and f(xy)=f(x)f(y) for all x,y∈R, then f is a ring homomorphism (Ring homomorphism: additive, multiplicative, and required to send 1 to 1); that is, clause (RH3), f(1R)=1S, is redundant.

The map

f:Z⟶Z×Z,f(n):=(n,0)

refutes it, Z×Z being the product ring (The product ring R×S with componentwise operations, its identity (1R,1S) and its units R××S×). It satisfies both displayed conditions and sends 1 to (1,0), which is not the identity (1,1) of Z×Z.

Facts & Assumptions

Given: The commutative ring Z, the product ring Z×Z with componentwise operations, zero (0,0) and identity (1,1), and the map f(n)=(n,0) (Z is a commutative ring and an ordered ring, the published construction being an instance of the general definitions, The product ring R×S with componentwise operations, its identity (1R,1S) and its units R××S×).

[L2]

Z×Z is a ring whose operations are componentwise, whose zero is (0,0) and whose identity is (1,1); two of its elements are equal exactly when both components agree (The product ring R×S with componentwise operations, its identity (1R,1S) and its units R××S×).

[L4]

1≠0 in Z, since 1=ι(1), 0=ι(0), ι is injective, and 1=σ(0)≠0 in N by Peano axiom (P1) (The naturals embed in the integers, Arithmetic on the integers, The von Neumann naturals form a Peano system).

[L5]

A ring homomorphism must satisfy (RH1) additivity, (RH2) multiplicativity and (RH3) f(1R)=1S; (RH1) alone makes f a homomorphism of the additive groups (Ring homomorphism: additive, multiplicative, and required to send 1 to 1, Monoid homomorphism and group homomorphism).

[L6]

The refuted claim: (RH1) and (RH2) imply (RH3).

Counterexample

technique · direct
1.1

f is additive: f(m+n)=(m+n,0)=(m,0)+(n,0)=f(m)+f(n), the middle equality being componentwise addition with 0+0=0. So f satisfies (RH1) and is a homomorphism of the additive groups.

L1L2L5
1.2

f is multiplicative: f(mn)=(mn,0) and f(m)f(n)=(m,0)(n,0)=(mn,  0⋅0)=(mn,0), using componentwise multiplication and 0⋅0=0. So f satisfies (RH2).

L2L3
1.3

f(1)=(1,0)≠(1,1), since the second components differ: 0≠1 in Z by [L4]. So (RH3) fails for f.

L2L4
2.1

By steps 1.1, 1.2 and 1.3 the map f satisfies (RH1) and (RH2) and fails (RH3), so it is not a ring homomorphism and the claim of [L6] is false: clause (RH3) of Ring homomorphism: additive, multiplicative, and required to send 1 to 1 is not redundant.

step 1.1step 1.2step 1.3L5L6∎

Remarks

False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passverified 2026-08-03 (gpt-5.6-sol-codex-subscription)Open item page →

FALSE: In every commutative ring, each nonzero element is either a unit or a zero divisor

Statement

False claim: in every commutative ring R (Commutative ring), every a∈R with a≠0 is either a unit of R (The units of a ring are the invertible elements of its multiplicative monoid, and R× is a group under multiplication; 0∈R× only in the zero ring) or a zero divisor (Zero divisor, and integral domain: a commutative ring with 1≠0 and no zero divisors).

The integers refute it. With 2:=1+1 in Z, the element 2 is nonzero, is not a unit, and is not a zero divisor.

Facts & Assumptions

[L3]

If x,y∈Z are nonzero then xy≠0 (The integers have no zero divisors; multiplicative cancellation).

[L4]

The order on Z is total and compatible with addition; ι:N→Z is injective and order preserving with ι(0)=0 and ι(1)=1. Since 0+1=1 in N, one has 0≤1 there and hence ι(0)≤ι(1) (The integers form a totally ordered ring, Order on the integers, The naturals embed in the integers, Order on the natural numbers, Addition of natural numbers).

[L5]

a is a zero divisor when a≠0 and ab=0 or ba=0 for some b≠0 (Zero divisor, and integral domain: a commutative ring with 1≠0 and no zero divisors).

[L6]

The refuted claim: in every commutative ring, every nonzero element is a unit or a zero divisor.

Refutation

technique · direct
1.1

0<1<2 and −1<0 in Z: 1=ι(1) is nonnegative and differs from 0=ι(0) because ι is injective, so 0<1; adding 1 gives 1<2; adding −1 to 0<1 gives −1<0. In particular 2≠0, 2≠1 and 2≠−1.

L4
2.1

2 is not a unit of Z: by [L2] the units are 1 and −1, and 2 is neither, by step 1.1.

step 1.1L2
2.2

2 is not a zero divisor of Z: if 2b=0 with b≠0, then 2≠0 by step 1.1 and b≠0 give 2b≠0 by [L3], a contradiction; and b⋅2=2b by commutativity. So no such b exists.

step 1.1L1L3L5
3.1

Z is a commutative ring by [L1], and by step 1.1 the element 2 is nonzero, while by steps 2.1 and 2.2 it is neither a unit nor a zero divisor. So the claim of [L6] is false.

step 1.1step 2.1step 2.2L1L6∎

Remarks

  • What the claim is confusing it with. In an integral domain every nonzero element is a non-zero-divisor, and the claim would follow if every nonzero non-zero-divisor were a unit. That last implication is what Z refutes: 2 cancels, by The integers have no zero divisors; multiplicative cancellation, and is still not invertible.

  • The claim becomes true under a finiteness hypothesis, which it does not make. If R is a commutative ring and a≠0, consider x↦ax. If it is injective and R is finite, it is surjective by A subset of a finite set is finite, with ∣B∣≤∣A∣, and equality holds if and only if B=A, so ax=1 for some x and a is a unit; if it is not injective, then ax=ay with x≠y gives a(x−y)=0 with x−y≠0, so a is a zero divisor. The hypothesis that R is finite is exactly what Z fails, and the statement above assumes nothing of the kind. This paragraph applies the cited finite-set theorem as an observation about the claim; it is not part of the refutation.

  • The witness is 2, not 0. Under the convention of Zero divisor, and integral domain: a commutative ring with 1≠0 and no zero divisors the element 0 is not a zero divisor, so a claim quantified over nonzero elements is not vacuously repaired by looking at 0; the refutation has to exhibit a genuine nonzero element, and it does.

Sources