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.
In , inversion pairs every class except and , which are the only self-inverse classes
Statement
Let be prime. In the finite unit group , inversion partitions all classes other than and into disjoint pairs with distinct members. The only self-inverse classes are and .
When these two displayed classes coincide, and the unit group has that single element.
Facts & Assumptions
Given: A prime and the unit group .
The quotient is a field (For every prime , the two operations on make it a field).
Units form a finite group under multiplication and every class has one standard representative; moreover exactly when , which means (The unit group and Euler's totient for , For , every class in has one representative with , so ; while is in bijection with , The congruence class and the quotient set , Congruence modulo an integer: when , including the moduli and ).
An invertible element has a unique inverse, and every one-sided inverse equals that inverse (In a monoid, a left inverse and a right inverse of the same element are equal; hence an invertible element has exactly one inverse, and it is two-sided).
Proof
If a unit is self-inverse, then , so . In a field a product is zero only if a factor is zero: if the first factor is nonzero, multiply by its inverse. Hence or .
Conversely, and , so both displayed classes are self-inverse.
If , then , so ; the unique nonzero standard class is , and it is the only unit.
On the remaining finite set, inversion has no fixed point by steps 1.1 and 1.2. Since is an inverse of , uniqueness in [L3] gives . Therefore the inversion orbits are disjoint pairs with distinct members.
Steps 1.1 through 2.1 prove the pairing and its boundary case.
Depends on
- For every prime $p$, the two operations on $\mathbb{Z}/p$ make it a field
- The unit group $(\mathbb{Z}/n)^\times$ and Euler's totient $\varphi(n)=\lvert(\mathbb{Z}/n)^\times\rvert$ for $n\ge1$
- In a monoid, a left inverse and a right inverse of the same element are equal; hence an invertible element has exactly one inverse, and it is two-sided
- 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 congruence class $[a]_n$ and the quotient set $\mathbb{Z}/n$
- Congruence modulo an integer: $a\equiv b\pmod n$ when $n\mid(a-b)$, including the moduli $0$ and $1$
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 78 results over 24 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
- Mathematics LibreTexts, Wilson's Theorem (standard reference, not scraped)