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.
and
Example
Every displayed unit is its own inverse.
Facts & Assumptions
Given: The quotient and its unit group.
The classes modulo have the unique standard representatives (For , every class in has one representative with , so ; while is in bijection with ).
The class is a unit exactly when , and counts these units (For , is a unit if and only if , The unit group and Euler's totient for ).
Euler's finite prime-divisor product gives (Euler's product formula for , stated through a finite injective list of its prime divisors).
Equality of residue classes is congruence of representatives (The congruence class and the quotient set ), and congruence means divisibility of their difference (Congruence modulo an integer: when , including the moduli and ).
Products of residue classes are computed by multiplying representatives: (Addition and multiplication on by and ).
Verification
Among , exactly have gcd with : every other representative is divisible by or . Thus [L1] and [L2] give the displayed unit group and .
The congruences , , and show that the three nonidentity units, as well as , are self-inverse.
Since , [L3] independently gives , agreeing with the list.
Depends on
- For $n\ge1$, $[a]_n$ is a unit if and only if $\gcd(a,n)=1$
- Euler's product formula $\varphi(n)=n\prod_{p\mid n}(1-1/p)=\prod_{p^k\parallel n}(p^k-p^{k-1})$ for $n\ge1$, stated through a finite injective list of its prime divisors
- 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 unit group $(\mathbb{Z}/n)^\times$ and Euler's totient $\varphi(n)=\lvert(\mathbb{Z}/n)^\times\rvert$ for $n\ge1$
- Addition and multiplication on $\mathbb{Z}/n$ by $[a]_n+[b]_n=[a+b]_n$ and $[a]_n[b]_n=[ab]_n$
- 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
Nothing in the library uses this result yet.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 128 results over 28 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, Euler's phi Function (standard reference, not scraped)
- UW Oshkosh, Number Theory Notes 3 (standard reference, not scraped)