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.
acting on three points has and , so the fixed-point congruence modulo fails without the -group hypothesis
Statement refuted
False claim. For every finite group acting on a finite set , one has .
Facts & Assumptions
Given: The natural action of on .
The fixed-point congruence is proved for finite -groups (If a finite -group acts on a finite set , then ).
The global fixed set consists of the points fixed by every group element (The fixed-point sets and of a group action).
The natural -action on three points is faithful and transitive (The natural action of on three points is faithful and transitive but not free).
The group has order (The class equation of is ).
Congruence modulo means divisibility of the difference by (Congruence modulo an integer: when , including the moduli and ).
Counterexample
For each , some transposition moves , so no point is fixed by every element of and . Thus and .
The difference is not divisible by , so [L5] shows that the congruence fails. By [L4], is not a power of , so this does not contradict [L1] and isolates its -group hypothesis.
Depends on
- If a finite $p$-group $P$ acts on a finite set $X$, then $|X|\equiv|X^P|\pmod p$
- The fixed-point sets $X^g$ and $X^G$ of a group action
- The natural action of $S_3$ on three points is faithful and transitive but not free
- The class equation of $S_3$ is $6=1+2+3$
- 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: 61 results over 12 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 and following discussion (standard reference, not scraped)