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
- Modular order finding with rational reconstruction Algorithm
- Reversible modular multiplication by a unit Algorithm
- Shor factoring with verified output and bounded outer retries Algorithm
- [ℚ(ζₙ):ℚ]=φ(n) and Gal(ℚ(μₙ)/ℚ)≅(ℤ/n)^× Corollary
- Complete splitting criterion for a cyclotomic field Corollary
- Euler's totient is multiplicative: gcd(m,n)=1 implies φ(mn)=φ(m)φ(n) for positive m,n Corollary
- For an odd prime p, ℚ(ζₚ) has exactly one intermediate field of degree two over ℚ Corollary
- For every prime p, the multiplicative group (ℤ/pℤ)^× is cyclic Corollary
- The Dirichlet series of Euler's totient is zeta of s minus 1 divided by zeta of s on Re s greater than 2 Corollary
- The Galois group of a cyclotomic extension is abelian Corollary
- The generators of a cyclic group of order m are the gᵃ with gcd(a,m)=1, so there are φ(m) of them Corollary
- The reduction of Φₙ is irreducible over F_q exactly when [q] generates (ℤ/n)^× Corollary
- φ(1)=1, and φ(p)=p-1 for every prime p Corollary
- Carmichael's function λ(n) as the exponent of (ℤ/nℤ)^× Definition
- Primitive roots modulo n Definition
- (ℤ/12)^×={[1],[5],[7],[11]} and φ(12)=4 Example
- (ℤ/8)^×={[1],[3],[5],[7]} is not cyclic because every element squares to [1] Example
- Prime decomposition in Q(zeta₁2) Example
- Prime decomposition in Q(zeta₈) Example
- The finite Heisenberg group is the unique Sylow p-subgroup of its coordinate upper-triangular group Example
- The unit group modulo one hundred is isomorphic to C₂₀ × C₂ Example
- Φ₁ through Φ₁₂ computed from the divisor recursion Example
- FALSE: every finite abelian group is Gal(ℚ(μₙ)/ℚ) for some n False statement
- A cyclic group of order n has exactly φ(n) generators Lemma
- For odd n, primitive-root existence is equivalent for n and 2n Lemma
- For odd prime p, p∤ u, and k≥1, the class of 1+pu has order pᵏ⁻¹ modulo pᵏ Lemma
- For primes p<q, nontrivial actions of Cₚ on C_q exist exactly when p∣(q-1) and are unique up to automorphisms Lemma
- Half an even order gives a square root of one Lemma
- In (ℤ/p)^×, inversion pairs every class except [1]ₚ and [-1]ₚ, which are the only self-inverse classes Lemma
- Mixed CRT signs yield proper gcd factors Lemma
- Random residue gcd branch for factoring Lemma
- Two-adic order distribution in odd prime-power unit groups Lemma
- φ(m)φ(n)=φ(gcd(m,n)) φ(lcm(m,n)) Lemma
- A unit is a primitive root modulo n if and only if it generates (ℤ/nℤ)^× Proposition
- For fixed odd modulus, the Jacobi symbol is a homomorphism on the unit group Proposition
- Quadratic residuosity is representative-independent and the residues are the image of squaring Proposition
- μₙ(K) is cyclic of order dividing n, and has a primitive n-th root of unity exactly when its order is n Proposition
- Φₙ is irreducible over K exactly when [K(ζₙ):K]=φ(n), exactly when the embedding into (ℤ/n)^× is onto Proposition
- Bounded-error success of Shor factoring Theorem
- Classical randomized order-to-factor success bound Theorem
…and 24 more results.
Dependency tree · two levels
30 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on 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)