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 integers form a totally ordered ring
Statement
The relation of Order on the integers is well defined and is a total order on ; it is compatible with addition ( implies ) and positives are closed under multiplication ( and imply ). Thus is a totally ordered commutative ring.
Facts & Assumptions
Given: Integers , , with the operations of Arithmetic on the integers.
Addition on is commutative and associative (Addition is commutative, Addition is associative).
The order on is total, antisymmetric, and transitive ( is a linear order on ).
Natural order is translation-invariant: (Order is compatible with addition).
By the definition of natural order, exactly when for some natural ; if , such a gap is nonzero (Order on the natural numbers).
Natural multiplication is commutative and associative, distributes over addition, and has the usual zero and identity laws; multiplication by a nonzero natural preserves strict order (Multiplication is commutative, Multiplication is associative, Distributivity and the successor law for multiplication, Zero and one under multiplication, Order is compatible with multiplication).
The integer operations make a commutative ring with multiplicative identity (The integers form a commutative ring).
Proof
Suppose and , i.e. and .
Suppose .
Totality: in either or , so or .
Antisymmetry: and give and , hence , which is as classes.
Transitivity: from and , adding gives ; regrouping, ; cancelling, , i.e. .
Compatibility with addition: reads , which regroups to , equivalent to , i.e. .
Suppose and , i.e. and .
Adding : .
Regrouping with the equations of step 1.1: .
Write and with nonzero naturals .
So ; cancelling gives . Applying the same argument with primed and unprimed representatives exchanged proves the converse implication, so the relation is independent of representatives.
Expanding both components of : and , so .
Since are nonzero, and by [L4]. Hence [L5] gives , and step 3.2 yields , which is .
The order is well defined, total, compatible with addition, and positives are closed under multiplication; together with [L6], this makes a totally ordered commutative ring.
Depends on
The integers as equivalence classes of pairs of naturals
Arithmetic on the integers
Order on the integers
Order on the natural numbers
The integers form a commutative ring
Addition is commutative
Addition is associative
is a linear order on
Order is compatible with addition
Multiplication is commutative
Multiplication is associative
Distributivity and the successor law for multiplication
Zero and one under multiplication
Order is compatible with multiplication