Alphabeta Math
Session-authored (Fable 5 assisted)
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\mathbb{Z} is a commutative ring and an ordered ring, the published construction being an instance of the general definitions

Example

Let Z\mathbb{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)(\mathbb{Z}, +, \cdot, 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\mathbb{Z} with the order \le 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={xZ:0<x}P = \{\, x \in \mathbb{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}P = \{\, x : 0 < x \,\} satisfies trichotomy and closure, and a<b:    baPa < b :\iff b - a \in 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\mathbb{Z} without translation.

Facts & Assumptions

Given: The set Z\mathbb{Z} with ++, \cdot, 0=[(0,0)]0 = [(0,0)], 1=[(1,0)]1 = [(1,0)] and the order \le (The integers as equivalence classes of pairs of naturals, Arithmetic on the integers, Order on the integers).

[L1]

(Z,+,,0,1)(\mathbb{Z}, +, \cdot, 0, 1) is a commutative ring with multiplicative identity, in which every element has an additive inverse, namely [(a,b)]=[(b,a)]-[(a,b)] = [(b,a)] (The integers form a commutative ring).

[L2]

The relation of Order on the integers is a total order on Z\mathbb{Z}; it is compatible with addition (xyx \le y implies x+zy+zx + z \le y + z), and 0<x0 < x and 0<y0 < y imply 0<xy0 < 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\mathbb{Z} is associative and commutative, 00 is a two-sided additive identity, and every element has an additive inverse; so (Z,+,0)(\mathbb{Z},+,0) is an abelian group.

L1L3
1.2

By [L1], multiplication is associative and commutative and 11 is a multiplicative identity, so (Z,,1)(\mathbb{Z},\cdot,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(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)(\mathbb{Z},+,\cdot,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 \le is a total order on Z\mathbb{Z} satisfying (OR1) and (OR2) verbatim; with step 2.1 this makes Z\mathbb{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\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

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

Q\mathbb{Q} and R\mathbb{R} are fields, hence commutative rings, integral domains and ordered rings, all of characteristic 00

Example

Let FF be either Q\mathbb{Q} (The rationals form a field) or R\mathbb{R} (The reals form a field), with its published order (The rationals form a totally ordered field, The reals form a totally ordered field). Then:

  1. FF is a commutative ring with 101 \ne 0 and an integral domain (Every field is a commutative ring with 101 \ne 0; it is an integral domain, and it is a commutative division ring, Zero divisor, and integral domain: a commutative ring with 101 \ne 0 and no zero divisors);
  2. FF with its order is an ordered ring (Ordered ring: a ring with a total order compatible with addition and with positives closed under multiplication), and the set P={xF:0<x}P = \{\, x \in F : 0 < x \,\} is a positive cone making FF an ordered field in the sense of Ordered field, whose induced order is the published one;
  3. char(F)=0\operatorname{char}(F) = 0 (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: FF is Q\mathbb{Q} or R\mathbb{R}, with its published operations and order.

[L1]

Q\mathbb{Q} and R\mathbb{R} are fields (The rationals form a field, The reals form a field, Field).

[L2]

The published order on each makes it a totally ordered field: the order is total, xyx \le y implies x+zy+zx + z \le y + z, and 0<x0 < x and 0<y0 < y imply 0<xy0 < 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 PP satisfying trichotomy (O1) and closure (O2), the order being a<b:    baPa < b :\iff b - a \in P; and every ordered field is an ordered ring whose positive cone is PP (Ordered field, Every ordered field is an ordered ring, and its order is the one its positive cone induces).

[L7]

In an ordered field, n1F>0n \cdot 1_F > 0 for every n1n \ge 1, the multiples being given by 11F=1F1 \cdot 1_F = 1_F and (n+1)1F=n1F+1F(n+1)\cdot 1_F = n \cdot 1_F + 1_F (Canonical naturals are positive and strictly increasing).

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

Verification

technique · direct
1.1

Claim 1: FF is a field by [L1], hence a commutative ring with 101 \ne 0 and an integral domain by [L3].

L1L3
2.1

By [L2] the published order on FF 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 FF an ordered ring.

L1L2L3
3.1

By [L4] applied to that ordered ring, P={xF:0<x}P = \{\, x \in F : 0 < x \,\} satisfies trichotomy and closure, and the relation a<b:    baPa < b :\iff b - a \in 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)(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 FF is available, so [L7] applies. Its multiples and the multiples of [L8] are the same elements: both agree with the canonical natural ι(n)\iota(n) of The canonical natural ι(n)=n1F\iota(n) = n \cdot 1_F of a field by [L6], since ι(1)=ι(0)+1F=1F\iota(1) = \iota(0) + 1_F = 1_F and both recursions add 1F1_F at each successor. Hence n1F>0n \cdot 1_F > 0 for every natural n1n \ge 1, and n1F0Fn \cdot 1_F \ne 0_F because 0F0_F is not positive by trichotomy.

step 3.1L5L6L7
5.1

Claim 3: by step 4.1 there is no natural n1n \ge 1 with n1F=0Fn \cdot 1_F = 0_F, so char(F)=0\operatorname{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:={nN:n1}X := \{\, n \in \mathbb{N} : n \ge 1 \,\} (The natural numbers N\mathbb{N} (von Neumann), Order on the natural numbers) and let C\mathcal{C} be the set of Cauchy sequences of rationals, that is, the set of those functions XQX \to \mathbb{Q} that satisfy the condition of Cauchy sequence of rationals; that definition indexes its sequences (an)n1(a_n)_{n \ge 1}, so XX, and not N\mathbb{N}, is the index set. Give C\mathcal{C} the termwise operations and the constant sequences 00 and 11. Then:

  1. C\mathcal{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 101 \ne 0;

  2. C\mathcal{C} is a subring (Subring: a subset containing 1R1_R and closed under addition, additive inverses and multiplication) of the ring QX\mathbb{Q}^{X} of all functions XQX \to \mathbb{Q} with pointwise operations (The ring RXR^{X} of all functions from a set XX into a ring, with pointwise operations);

  3. C\mathcal{C} is not an integral domain (Zero divisor, and integral domain: a commutative ring with 101 \ne 0 and no zero divisors): the sequences

    a=(1,0,0,0,),b=(0,1,1,1,)a = (1,0,0,0,\dots), \qquad b = (0,1,1,1,\dots)

    defined by a1=1a_1 = 1, an=0a_n = 0 for n2n \ge 2, and b1=0b_1 = 0, bn=1b_n = 1 for n2n \ge 2, are both Cauchy, both nonzero, and satisfy ab=0ab = 0; so each is a zero divisor.

Facts & Assumptions

Given: X={nN:n1}X = \{\, n \in \mathbb{N} : n \ge 1 \,\}; the set C\mathcal{C} of functions XQX \to \mathbb{Q} that are Cauchy in the sense of Cauchy sequence of rationals; termwise addition and multiplication; and the constant sequences 00 and 11.

[L1]

C\mathcal{C} with termwise addition and multiplication and the constant sequences 00 and 11 is a commutative ring with identity (Cauchy sequences form a commutative ring).

[L2]

Q\mathbb{Q} is a field; in particular 101 \ne 0 in Q\mathbb{Q} and Q\mathbb{Q} is a commutative ring (The rationals form a field, Ring: an abelian group under addition and a monoid under multiplication, with multiplication distributing over addition on both sides, Commutative ring).

[L3]

For a set YY and a ring RR, the set RYR^{Y} of all functions YRY \to R with pointwise operations and the constant functions 0R0_R, 1R1_R is a ring, commutative when RR is (The ring RXR^{X} of all functions from a set XX into a ring, with pointwise operations).

[L5]

A sequence (cn)n1(c_n)_{n \ge 1} of rationals is Cauchy when for every rational ε>0\varepsilon > 0 there is NNN \in \mathbb{N} with cmcn<ε|c_m - c_n| < \varepsilon for all m,nNm, n \ge N (Cauchy sequence of rationals).

[L7]

aa is a zero divisor when a0a \ne 0 and ab=0ab = 0 or ba=0ba=0 for some b0b \ne 0; in a commutative ring the two alternatives agree. An integral domain is a commutative ring with 101 \ne 0 and no zero divisors (Zero divisor, and integral domain: a commutative ring with 101 \ne 0 and no zero divisors).

[L8]

If nNn\in\mathbb N and n1n\ge1, then either n=1n=1 or n2n\ge2, by discreteness of the natural order (Order on the natural numbers, Discreteness: σ(n)\sigma(n) is the immediate successor).

Verification

technique · direct
1.1

Claim 1: [L1] states exactly that C\mathcal{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 101 \ne 0 in C\mathcal{C}, since the two constant sequences differ at the index 11, where 101 \ne 0 in Q\mathbb{Q}.

L1L2
1.2

QX\mathbb{Q}^{X} is a commutative ring by [L3] with Y=XY = X and R=QR = \mathbb{Q}, its operations being pointwise, which on functions XQX \to \mathbb{Q} is termwise.

L2L3
1.3

Any eventually constant sequence is Cauchy: if cn=cc_n = c for all nN0n \ge N_0, then for any rational ε>0\varepsilon > 0 and all m,nN0m, n \ge N_0 we have cmcn=cc=0<ε|c_m - c_n| = |c - c| = 0 < \varepsilon. In particular aa, bb and the constant sequences 00 and 11 lie in C\mathcal{C}.

L2L5given
1.4

ab=0ab = 0: at the index 11 the product is a1b1=10=0a_1 b_1 = 1 \cdot 0 = 0, and at every index n2n \ge 2 it is anbn=01=0a_n b_n = 0 \cdot 1 = 0; every index of XX is 11 or is 2\ge 2 by [L8].

L2L6L8given
2.1

Claim 2: CQX\mathcal{C} \subseteq \mathbb{Q}^{X}, the identity of QX\mathbb{Q}^{X} is the constant sequence 11, which lies in C\mathcal{C} by step 1.3, and C\mathcal{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\mathbb{Q}^{X} by step 1.2. So the criterion [L4] applies.

step 1.2step 1.3L1L4
2.2

a0a \ne 0 and b0b \ne 0 in C\mathcal{C}: a1=10a_1 = 1 \ne 0 and b2=10b_2 = 1 \ne 0 in Q\mathbb{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 aa is nonzero and ab=0ab = 0 with bb nonzero, so aa is a zero divisor, and symmetrically so is bb. Hence C\mathcal{C} has zero divisors and is not an integral domain, although by step 1.1 it is a commutative ring with 101 \ne 0.

step 1.1step 2.2step 1.4L7

Remarks

  • The index set is stated because it is not N\mathbb{N}. Cauchy sequence of rationals indexes its sequences from n=1n = 1, while The ring RXR^{X} of all functions from a set XX into a ring, with pointwise operations takes an arbitrary index set; the ambient ring in claim 2 is therefore QX\mathbb{Q}^{X} with X={nN:n1}X = \{\, n \in \mathbb{N} : n \ge 1 \,\}, not QN\mathbb{Q}^{\mathbb{N}}. Since N\mathbb{N} contains 00 (The natural numbers N\mathbb{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\mathbb{R}. The real numbers are defined as the quotient C/N\mathcal{C}/\mathcal{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\mathcal{C} alone: C\mathcal{C} is not even a domain. What The reals form a field actually uses is The null ideal is maximal, a property of N\mathcal{N} inside C\mathcal{C}. The two zero divisors above cause no trouble in the quotient: aa is a null sequence (Null sequence), so its class is 00, and bb differs from the constant sequence 11 by a null sequence, so its class is 11.

  • The witnesses are chosen to keep the verification short. Both are eventually constant, hence Cauchy with no ε\varepsilon 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 101 \ne 0 always has zero divisors: (1,0)(0,1)=(0,0)(1,0)(0,1) = (0,0) in Z×Z\mathbb{Z} \times \mathbb{Z}, so a product of integral domains is never an integral domain

Example

Let RR and SS be rings (Ring: an abelian group under addition and a monoid under multiplication, with multiplication distributing over addition on both sides) with 1R0R1_R \ne 0_R and 1S0S1_S \ne 0_S, and let R×SR \times S be the product ring (The product ring R×SR \times S with componentwise operations, its identity (1R,1S)(1_R, 1_S) and its units R××S×R^{\times} \times S^{\times}). Then:

  1. (1R,0S)(1_R, 0_S) and (0R,1S)(0_R, 1_S) are nonzero elements of R×SR \times S whose product is (0R,0S)(0_R, 0_S); each is therefore a zero divisor (Zero divisor, and integral domain: a commutative ring with 101 \ne 0 and no zero divisors);
  2. consequently R×SR \times S is never an integral domain, whatever RR and SS are; in particular a product of two integral domains is not one;
  3. the concrete instance is Z×Z\mathbb{Z} \times \mathbb{Z}, where (1,0)(0,1)=(0,0)(1,0)(0,1) = (0,0) while Z\mathbb{Z} itself is an integral domain (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).

Facts & Assumptions

Given: Rings RR, SS with 1R0R1_R \ne 0_R and 1S0S1_S \ne 0_S, and the product ring R×SR \times S with componentwise operations, zero (0R,0S)(0_R,0_S) and identity (1R,1S)(1_R,1_S) (The product ring R×SR \times S with componentwise operations, its identity (1R,1S)(1_R, 1_S) and its units R××S×R^{\times} \times S^{\times}).

[L3]

aa is a zero divisor when a0a \ne 0 and ab=0ab = 0 or ba=0ba = 0 for some b0b \ne 0; an integral domain is a commutative ring with 101 \ne 0 and no zero divisors (Zero divisor, and integral domain: a commutative ring with 101 \ne 0 and no zero divisors, Commutative ring).

Verification

technique · direct
1.1

(1R,0S)(0R,0S)(1_R, 0_S) \ne (0_R, 0_S), since the first components differ, 1R0R1_R \ne 0_R; and (0R,1S)(0R,0S)(0_R, 1_S) \ne (0_R, 0_S), since the second components differ, 1S0S1_S \ne 0_S.

L1given
1.2

(1R,0S)(0R,1S)=(1R0R,  0S1S)=(0R,0S)(1_R, 0_S)\cdot(0_R, 1_S) = (1_R 0_R,\; 0_S 1_S) = (0_R, 0_S), the components being computed by [L2].

L1L2
2.1

Claim 1: by steps 1.1 and 1.2 the element (1R,0S)(1_R,0_S) is nonzero, the element (0R,1S)(0_R,1_S) is nonzero, and their product is the zero of R×SR \times 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×SR \times S has one by step 2.1; so R×SR \times S is not an integral domain. Every integral domain satisfies 101 \ne 0, so a product of two integral domains falls under the hypothesis and is never one.

step 2.1L3
4.1

Claim 3: Z\mathbb{Z} is a ring with 101 \ne 0 by [L4], so steps 2.1 and 3.1 apply with R=S=ZR = S = \mathbb{Z}, giving (1,0)(0,1)=(0,0)(1,0)(0,1) = (0,0) with both factors nonzero; and Z\mathbb{Z} is an integral domain by [L4], so Z×Z\mathbb{Z} \times \mathbb{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}\{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

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

Z\mathbb{Z} sits inside Q\mathbb{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\mathbb{Q} is a set of equivalence classes of pairs of integers, so "Z\mathbb{Z} inside Q\mathbb{Q}" means the image of the embedding j:ZQj : \mathbb{Z} \to \mathbb{Q}, j(k)=[(k,1)]j(k) = [(k,1)], of The integers embed in the rationals. Write K:=j(Z)QK := j(\mathbb{Z}) \subseteq \mathbb{Q} and let 2:=1+12 := 1 + 1 in Z\mathbb{Z}. Then:

  1. KK is a subring of the ring Q\mathbb{Q} (Subring: a subset containing 1R1_R and closed under addition, additive inverses and multiplication);
  2. KK is not a subfield of Q\mathbb{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)j(2) is a nonzero member of KK whose inverse in Q\mathbb{Q} does not lie in KK;
  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:ZQj : \mathbb{Z} \to \mathbb{Q}, j(k)=[(k,1)]j(k) = [(k,1)], and K=j(Z)K = j(\mathbb{Z}); the numeral 2=1+12 = 1 + 1 in Z\mathbb{Z} (The integers as equivalence classes of pairs of naturals).

[L1]

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

[L6]

A subfield of a field FF 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]

ι:NZ\iota : \mathbb{N} \to \mathbb{Z} is injective and order preserving with ι(0)=0\iota(0) = 0, ι(1)=1\iota(1) = 1 (The naturals embed in the integers, Arithmetic on the integers).

Verification

technique · direct
1.1

j(0Z)=0Qj(0_{\mathbb{Z}}) = 0_{\mathbb{Q}} and j(1Z)=1Qj(1_{\mathbb{Z}}) = 1_{\mathbb{Q}}. The first: j(0)+j(0)=j(0+0)=j(0)=j(0)+0Qj(0) + j(0) = j(0+0) = j(0) = j(0) + 0_{\mathbb{Q}}, and cancelling j(0)j(0) gives j(0)=0Qj(0) = 0_{\mathbb{Q}}. The second: j(1)j(1)=j(11)=j(1)j(1)j(1) = j(1 \cdot 1) = j(1), and j(1)0Qj(1) \ne 0_{\mathbb{Q}} because 1Z0Z1_{\mathbb{Z}} \ne 0_{\mathbb{Z}} and jj is injective with j(0Z)=0Qj(0_{\mathbb{Z}}) = 0_{\mathbb{Q}}; so j(1)=1Qj(1) = 1_{\mathbb{Q}}. Consequently j(b)=j(b)j(-b) = -j(b) for every bb, since j(b)+j(b)=j(0)=0Qj(b) + j(-b) = j(0) = 0_{\mathbb{Q}}.

L1L2L3L4L8
1.2

0<1<20 < 1 < 2 in Z\mathbb{Z}, and 1<0-1 < 0: the first because 1=ι(1)1 = \iota(1) is nonnegative and 101 \ne 0 by injectivity of ι\iota, the second by adding 11 to 0<10 < 1, and the third by adding 1-1 to 0<10 < 1. Hence 202 \ne 0, 212 \ne 1 and 212 \ne -1, so 2Z×2 \notin \mathbb{Z}^{\times} by [L7].

L3L7L8
2.1

1Q=j(1Z)K1_{\mathbb{Q}} = j(1_{\mathbb{Z}}) \in K by step 1.1; and for u=j(a)u = j(a), v=j(b)v = j(b) in KK we have uv=j(a)+(j(b))=j(a)+j(b)=j(ab)Ku - v = j(a) + (-j(b)) = j(a) + j(-b) = j(a-b) \in K and uv=j(a)j(b)=j(ab)Kuv = j(a)j(b) = j(ab) \in K. So KK is a subring of Q\mathbb{Q} by [L5]. This is claim 1.

step 1.1L1L2L5
2.2

j(2)0Qj(2) \ne 0_{\mathbb{Q}}: by step 1.2, 20Z2 \ne 0_{\mathbb{Z}}, and jj is injective with j(0Z)=0Qj(0_{\mathbb{Z}}) = 0_{\mathbb{Q}} by step 1.1. So j(2)j(2) has an inverse j(2)1j(2)^{-1} in the field Q\mathbb{Q}.

step 1.1step 1.2L1L2
3.1

j(2)1Kj(2)^{-1} \notin K. Suppose it were, say j(2)1=j(m)j(2)^{-1} = j(m) for some mZm \in \mathbb{Z}. Then j(2m)=j(2)j(m)=1Q=j(1Z)j(2m) = j(2)j(m) = 1_{\mathbb{Q}} = j(1_{\mathbb{Z}}), so 2m=1Z2m = 1_{\mathbb{Z}} by injectivity of jj; commutativity also gives m2=1m2=1, so mm is a two-sided inverse and 22 is a unit of Z\mathbb{Z}, contradicting step 1.2.

step 1.1step 1.2step 2.2L1L3L7
4.1

Claims 2 and 3: by claim 1 the set KK is a subring of Q\mathbb{Q}, and by steps 2.2 and 3.1 it contains a nonzero element whose inverse in Q\mathbb{Q} is not in KK; so (K2) of [L6] fails and KK is not a subfield. Since KK 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 →

2Z2\mathbb{Z} is closed under addition, negation and multiplication and is not a subring of Z\mathbb{Z}, because it does not contain 11

Statement refuted

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

The even integers refute it. Let 2:=1+12 := 1 + 1 in Z\mathbb{Z} and

2Z  :=  {xZ  :  2x}  =  {2k:kZ},2\mathbb{Z} \;:=\; \{\, x \in \mathbb{Z} \;:\; 2 \mid x \,\} \;=\; \{\, 2k : k \in \mathbb{Z} \,\},

divisibility being the relation of Divisibility in Z\mathbb{Z}: dad \mid a when a=dqa = dq for some integer qq. This set contains 00, is closed under addition, additive inverses and multiplication, and does not contain 11; so it fails clause (T1) of Subring: a subset containing 1R1_R and closed under addition, additive inverses and multiplication and is not a subring of Z\mathbb{Z}.

Facts & Assumptions

Given: The commutative ring Z\mathbb{Z}, the numeral 2=1+12 = 1 + 1, and the set 2Z={xZ:2x}2\mathbb{Z} = \{\, x \in \mathbb{Z} : 2 \mid x \,\} (Z\mathbb{Z} is a commutative ring and an ordered ring, the published construction being an instance of the general definitions, Divisibility in Z\mathbb{Z}: dad \mid a when a=dqa = dq for some integer qq).

[L2]

dad \mid a means a=dqa = dq for some qZq \in \mathbb{Z}, and d0d \mid 0 for every dd (Divisibility in Z\mathbb{Z}: dad \mid a when a=dqa = dq for some integer qq).

[L3]

Divisibility is linear: if dad \mid a and dbd \mid b then dax+byd \mid ax + by for all x,yZx, y \in \mathbb{Z}; and dad \mid a implies dacd \mid ac and dad \mid -a (Divisibility is reflexive and transitive on Z\mathbb{Z}, and is linear: if dad \mid a and dbd \mid b then dax+byd \mid ax + by for all integers x,yx, y; also dad \mid a implies dacd \mid ac, da-d \mid a and dad \mid -a).

[L5]

The order on Z\mathbb{Z} is total and compatible with addition, and ι:NZ\iota : \mathbb{N} \to \mathbb{Z} is injective and order preserving with ι(0)=0\iota(0) = 0, ι(1)=1\iota(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) 1RS1_R \in S, (T2) closure under addition, (T3) closure under additive inverses and (T4) closure under multiplication (Subring: a subset containing 1R1_R and closed under addition, additive inverses and multiplication); equivalently 1RS1_R \in S together with abSa - b \in S and abSab \in S (Subring criterion: SRS \subseteq R is a subring if and only if 1RS1_R \in S and abSa - b \in S and abSab \in S for all a,bSa, b \in 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 00 and closed under addition, additive inverses and multiplication is a subring.

Counterexample

technique · direct
1.1

02Z0 \in 2\mathbb{Z}, since 202 \mid 0 by [L2].

L2
1.2

2Z2\mathbb{Z} is closed under multiplication: if 2a2 \mid a then 2ab2 \mid ab for every bZb \in \mathbb{Z}, by [L3].

L3
1.3

0<1<20 < 1 < 2 and 1<0-1 < 0 in Z\mathbb{Z}: 1=ι(1)1 = \iota(1) is nonnegative and differs from 0=ι(0)0 = \iota(0) because ι\iota is injective, so 0<10 < 1; adding 11 gives 1<21 < 2; and adding 1-1 to 0<10 < 1 gives 1<0-1 < 0. Hence 212 \ne 1 and 212 \ne -1.

L5
2.1

2Z2\mathbb{Z} is closed under addition and under additive inverses: if 2a2 \mid a and 2b2 \mid b then 2a1+b1=a+b2 \mid a \cdot 1 + b \cdot 1 = a + b by the linearity of [L3], and 2a2 \mid -a by [L3]. So 2Z2\mathbb{Z} is a subgroup of (Z,+,0)(\mathbb{Z},+,0) in the sense of [L7].

step 1.1L1L3L7
2.2

12Z1 \notin 2\mathbb{Z}: if 212 \mid 1 then 2{1,1}2 \in \{1,-1\} by [L4], contradicting step 1.3.

step 1.3L2L4
3.1

By steps 1.1, 2.1 and 1.2 the set 2Z2\mathbb{Z} contains 00 and is closed under addition, additive inverses and multiplication; by step 2.2 it does not contain 1=1Z1 = 1_{\mathbb{Z}}, so clause (T1) of [L6] fails and 2Z2\mathbb{Z} is not a subring of Z\mathbb{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)n \mapsto (n,0) from Z\mathbb{Z} to Z×Z\mathbb{Z} \times \mathbb{Z} preserves addition and multiplication and does not preserve 11, so the clause f(1)=1f(1) = 1 is not redundant

Statement refuted

False claim: if RR and SS are rings and f:RSf : R \to S satisfies f(x+y)=f(x)+f(y)f(x+y) = f(x)+f(y) and f(xy)=f(x)f(y)f(xy) = f(x)f(y) for all x,yRx, y \in R, then ff is a ring homomorphism (Ring homomorphism: additive, multiplicative, and required to send 11 to 11); that is, clause (RH3), f(1R)=1Sf(1_R) = 1_S, is redundant.

The map

f:ZZ×Z,f(n):=(n,0)f : \mathbb{Z} \longrightarrow \mathbb{Z}\times\mathbb{Z}, \qquad f(n) := (n, 0)

refutes it, Z×Z\mathbb{Z}\times\mathbb{Z} being the product ring (The product ring R×SR \times S with componentwise operations, its identity (1R,1S)(1_R, 1_S) and its units R××S×R^{\times} \times S^{\times}). It satisfies both displayed conditions and sends 11 to (1,0)(1,0), which is not the identity (1,1)(1,1) of Z×Z\mathbb{Z}\times\mathbb{Z}.

Facts & Assumptions

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

[L2]

Z×Z\mathbb{Z}\times\mathbb{Z} is a ring whose operations are componentwise, whose zero is (0,0)(0,0) and whose identity is (1,1)(1,1); two of its elements are equal exactly when both components agree (The product ring R×SR \times S with componentwise operations, its identity (1R,1S)(1_R, 1_S) and its units R××S×R^{\times} \times S^{\times}).

[L4]

101 \ne 0 in Z\mathbb{Z}, since 1=ι(1)1 = \iota(1), 0=ι(0)0 = \iota(0), ι\iota is injective, and 1=σ(0)01 = \sigma(0) \ne 0 in N\mathbb{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)=1Sf(1_R) = 1_S; (RH1) alone makes ff a homomorphism of the additive groups (Ring homomorphism: additive, multiplicative, and required to send 11 to 11, Monoid homomorphism and group homomorphism).

[L6]

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

Counterexample

technique · direct
1.1

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

L1L2L5
1.2

ff is multiplicative: f(mn)=(mn,0)f(mn) = (mn, 0) and f(m)f(n)=(m,0)(n,0)=(mn,  00)=(mn,0)f(m)f(n) = (m,0)(n,0) = (mn,\; 0 \cdot 0) = (mn, 0), using componentwise multiplication and 00=00 \cdot 0 = 0. So ff satisfies (RH2).

L2L3
1.3

f(1)=(1,0)(1,1)f(1) = (1,0) \ne (1,1), since the second components differ: 010 \ne 1 in Z\mathbb{Z} by [L4]. So (RH3) fails for ff.

L2L4
2.1

By steps 1.1, 1.2 and 1.3 the map ff 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 11 to 11 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 RR (Commutative ring), every aRa \in R with a0a \ne 0 is either a unit of RR (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) or a zero divisor (Zero divisor, and integral domain: a commutative ring with 101 \ne 0 and no zero divisors).

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

Facts & Assumptions

[L3]

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; ι:NZ\iota : \mathbb{N} \to \mathbb{Z} is injective and order preserving with ι(0)=0\iota(0) = 0 and ι(1)=1\iota(1) = 1. Since 0+1=10+1=1 in N\mathbb N, one has 010\le1 there and hence ι(0)ι(1)\iota(0)\le\iota(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]

aa is a zero divisor when a0a \ne 0 and ab=0ab = 0 or ba=0ba = 0 for some b0b \ne 0 (Zero divisor, and integral domain: a commutative ring with 101 \ne 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<20 < 1 < 2 and 1<0-1 < 0 in Z\mathbb{Z}: 1=ι(1)1 = \iota(1) is nonnegative and differs from 0=ι(0)0 = \iota(0) because ι\iota is injective, so 0<10 < 1; adding 11 gives 1<21 < 2; adding 1-1 to 0<10 < 1 gives 1<0-1 < 0. In particular 202 \ne 0, 212 \ne 1 and 212 \ne -1.

L4
2.1

22 is not a unit of Z\mathbb{Z}: by [L2] the units are 11 and 1-1, and 22 is neither, by step 1.1.

step 1.1L2
2.2

22 is not a zero divisor of Z\mathbb{Z}: if 2b=02b = 0 with b0b \ne 0, then 202 \ne 0 by step 1.1 and b0b \ne 0 give 2b02b \ne 0 by [L3], a contradiction; and b2=2bb \cdot 2 = 2b by commutativity. So no such bb exists.

step 1.1L1L3L5
3.1

Z\mathbb{Z} is a commutative ring by [L1], and by step 1.1 the element 22 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

Sources