Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)audited 2026-07-31
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 Z/n\mathbb{Z}/n by [a]n+[b]n=[a+b]n[a]_n+[b]_n=[a+b]_n and [a]n[b]n=[ab]n[a]_n[b]_n=[ab]_n

Definition

Let nNn\in\mathbb N, including n=0n=0 and n=1n=1. For classes in Z/n\mathbb Z/n (The congruence class [a]n[a]_n and the quotient set Z/n\mathbb{Z}/n) define

[a]n+[b]n:=[a+b]n,[a]n[b]n:=[ab]n.[a]_n+[b]_n:=[a+b]_n,\qquad [a]_n[b]_n:=[ab]_n.

These are binary operations in the sense of Binary operation on a set; associativity, commutativity, and a subset closed under the operation. Indeed, if [a]n=[a]n[a]_n=[a']_n and [b]n=[b]n[b]_n=[b']_n, then aa(modn)a\equiv a'\pmod n and bb(modn)b\equiv b'\pmod n, so

a+ba+b(modn),abab(modn)a+b\equiv a'+b'\pmod n,\qquad ab\equiv a'b'\pmod n

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 n=0n=0, every class is a singleton and these operations reproduce integer addition and multiplication under the bijection ZZ/0\mathbb Z\to\mathbb Z/0. For n=1n=1, the quotient has one element, so [0]1=[1]1[0]_1=[1]_1 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 [0]1=[1]1[0]_1=[1]_1 will exclude Z/1\mathbb Z/1 from being a field.

Depends on

Used by

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