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.
An involution on five points has three fixed points and one two-point orbit, verifying
Example
Let act on so that its nonidentity element interchanges and and fixes . Then and .
Facts & Assumptions
Given: The additive group and the displayed permutation of .
A finite -group action satisfies (If a finite -group acts on a finite set , then ).
The residue classes modulo form a group (For every natural , is an abelian group, multiplication is a commutative monoid operation, and both distributive laws hold).
The two classes are represented by and (For , every class in has one representative with , so ; while is in bijection with ).
Congruence modulo means divisibility of the difference by (Congruence modulo an integer: when , including the moduli and ).
Verification
Map to the identity permutation and to . Since , [L2] and [L3] give an action of on .
Its orbit partition is , and the global fixed set is .
Hence , , and is divisible by , verifying [L1] by [L4].
Depends on
- If a finite $p$-group $P$ acts on a finite set $X$, then $|X|\equiv|X^P|\pmod p$
- For every natural $n$, $(\mathbb{Z}/n,+)$ is an abelian group, multiplication is a commutative monoid operation, and both distributive laws hold
- 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}$
- 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: 79 results over 18 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, Group Actions, Theorem 4.1 (standard reference, not scraped)