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.

The unit group (Z/n)×(\mathbb{Z}/n)^\times and Euler's totient φ(n)=(Z/n)×\varphi(n)=\lvert(\mathbb{Z}/n)^\times\rvert for n1n\ge1

Definition

Let n1n\ge1 be an integer. Multiplication makes Z/n\mathbb Z/n a commutative monoid with identity [1]n[1]_n by For every natural nn, (Z/n,+)(\mathbb{Z}/n,+) is an abelian group, multiplication is a commutative monoid operation, and both distributive laws hold. A class uZ/nu\in\mathbb Z/n 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

(Z/n)×:={uZ/n:some vZ/n satisfies uv=[1]n}.(\mathbb Z/n)^\times:=\{\,u\in\mathbb Z/n:\text{some }v\in\mathbb Z/n\text{ satisfies }uv=[1]_n\,\}.

By The invertible elements of a monoid form a group under the restricted operation, multiplication restricts to a group operation on (Z/n)×(\mathbb Z/n)^\times, called the unit group modulo nn.

The quotient Z/n\mathbb Z/n is finite with cardinality nn by For n1n\ge 1, every class in Z/n\mathbb{Z}/n has one representative rr with 0r<n0\le r<n, so Z/n=n\lvert\mathbb{Z}/n\rvert=n; while Z/0\mathbb{Z}/0 is in bijection with Z\mathbb{Z}, and its unit set is a finite subset by A subset of a finite set is finite, with BA\lvert B\rvert \le \lvert A\rvert, and equality holds if and only if B=AB = A. Euler's totient function is therefore defined for every positive integer nn by

φ(n):=(Z/n)×N\varphi(n):=\big|(\mathbb Z/n)^\times\big|\in\mathbb N

(The cardinality A\lvert A\rvert of a finite set). For n=1n=1, the quotient has one element, which is its multiplicative identity and hence a unit, so φ(1)=1\varphi(1)=1 follows from the definition.

Remarks

  • The domain of φ\varphi here is the positive integers. No value φ(0)\varphi(0) 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 00 and 11 (Field).

Depends on

Used by

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