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 unit group and Euler's totient for
Definition
Let be an integer. Multiplication makes a commutative monoid with identity by For every natural , is an abelian group, multiplication is a commutative monoid operation, and both distributive laws hold. A class is a unit when it is invertible in that monoid (Left inverse, right inverse, and invertible element of a monoid). The set of all units is
By The invertible elements of a monoid form a group under the restricted operation, multiplication restricts to a group operation on , called the unit group modulo .
The quotient is finite with cardinality by For , every class in has one representative with , so ; while is in bijection with , and its unit set is a finite subset by A subset of a finite set is finite, with , and equality holds if and only if . Euler's totient function is therefore defined for every positive integer by
(The cardinality of a finite set). For , the quotient has one element, which is its multiplicative identity and hence a unit, so follows from the definition.
Remarks
- The domain of here is the positive integers. No value is defined.
- The one-element multiplicative monoid is a group, even though its identity is also its additive zero. It is not a field because a field requires distinct elements and (Field).
Depends on
- For every natural $n$, $(\mathbb{Z}/n,+)$ is an abelian group, multiplication is a commutative monoid operation, and both distributive laws hold
- Left inverse, right inverse, and invertible element of a monoid
- The invertible elements of a monoid form a group under the restricted operation
- For $n\ge 1$, every class in $\mathbb{Z}/n$ has one representative $r$ with $0\le r<n$, so $\lvert\mathbb{Z}/n\rvert=n$; while $\mathbb{Z}/0$ is in bijection with $\mathbb{Z}$
- The cardinality $\lvert A\rvert$ of a finite set
- A subset of a finite set is finite, with $\lvert B\rvert \le \lvert A\rvert$, and equality holds if and only if $B = A$
- Field
Used by
- Euler's totient is multiplicative: gcd(m,n)=1 implies φ(mn)=φ(m)φ(n) for positive m,n Corollary
- φ(1)=1, and φ(p)=p-1 for every prime p Corollary
- (ℤ/12)^×={[1],[5],[7],[11]} and φ(12)=4 Example
- (ℤ/8)^×={[1],[3],[5],[7]} is not cyclic because every element squares to [1] Example
- The unit group modulo one hundred is isomorphic to C₂0 times C₂ Example
- In (ℤ/p)^×, inversion pairs every class except [1]ₚ and [-1]ₚ, which are the only self-inverse classes Lemma
- Euler's product formula φ(n)=n∏_p∣ n(1-1/p)=∏_pᵏ∥ n(pᵏ-pᵏ⁻¹) for n≥1, stated through a finite injective list of its prime divisors Theorem
- Euler's theorem: if n≥1 and gcd(a,n)=1, then a^φ(n)≡1pmod n Theorem
- For a prime p and k≥1, φ(pᵏ)=pᵏ-pᵏ⁻¹ Theorem
- For every positive integer n, ∑_d∣ n, d>0φ(d)=n Theorem
- For n≥1, [a]ₙ is a unit if and only if gcd(a,n)=1 Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 65 results over 19 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, The Chinese Remainder Theorem (standard reference, not scraped)
- Mathematics LibreTexts, Euler's phi Function (standard reference, not scraped)