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.
Addition and multiplication on by and
Definition
Let , including and . For classes in (The congruence class and the quotient set ) define
These are binary operations in the sense of Binary operation on a set; associativity, commutativity, and a subset closed under the operation. Indeed, if and , then and , so
by Congruent integers may be added, subtracted and multiplied: representative changes preserve both arithmetic operations. Thus the two displayed classes do not depend on the representatives chosen.
For , every class is a singleton and these operations reproduce integer addition and multiplication under the bijection . For , the quotient has one element, so and both operations are the unique binary operation on a one-element set.
Remarks
- The representative-independence argument is part of the definition. Without it the displayed formulas would be rules on integers, not operations on classes.
- No field assertion is made here. In particular, the coincidence will exclude from being a field.
Depends on
Used by
- Over F₂, the equation x+y=0 has exactly two solutions, so the infinite-field hypothesis is necessary Counterexample
- (ℤ/12)^×={[1],[5],[7],[11]} and φ(12)=4 Example
- A modulus n>1 is composite exactly when two nonzero classes in ℤ/n have product [0]ₙ Example
- The Chinese remainder bijection ℤ/12→ℤ/3×ℤ/4 computed on all standard representatives Example
- The four cosets of 4ℤ in (ℤ,+) reproduce addition modulo 4 Example
- The Klein four-group as the direct product of two groups of order 2 Example
- The residue classes ℤ/n as a ℤ-module Example
- The trivial action of ℤ/2 on a singleton is transitive but not faithful Example
- False: [a]ₙ[b]ₙ=[0]ₙ always implies [a]ₙ=[0]ₙ or [b]ₙ=[0]ₙ False statement
- For every n∈ℕ, the congruence-class group (ℤ/n,+) is the quotient group (ℤ,+)/nℤ Proposition
- For every n∈ℕ, the congruence-class ring ℤ/n is the quotient ring ℤ/nℤ Proposition
- Chinese remainder theorem for a finite pairwise-coprime list: simultaneous residues determine one class modulo the product, and the resulting bijection preserves addition and multiplication Theorem
- Euler's theorem: if n≥1 and gcd(a,n)=1, then a^φ(n)≡1pmod n Theorem
- For every natural n, (ℤ/n,+) is an abelian group, multiplication is a commutative monoid operation, and both distributive laws hold Theorem
- Wilson's theorem: for every prime p, (p-1)!≡-1pmod p Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 48 results over 14 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
- K. Conrad, Modular Arithmetic (standard reference, not scraped)