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.
False: every short exact sequence of groups splits
Statement
False claim: every short exact sequence of groups has a homomorphic section and therefore splits.
Facts & Assumptions
Given: A prime and the sequence induced by multiplication by and reduction modulo ,
The false claim says that this short exact sequence has a section.
A section is a homomorphism satisfying (Group extensions, sections, complements, and split extensions).
Every subgroup of a cyclic group is cyclic (Every subgroup of a cyclic group is cyclic; the least positive exponent in a nontrivial subgroup supplies a generator).
The order criterion determines which multiples of a finite-order element are zero (If then iff is an integer multiple of , the powers are distinct, and has exactly elements; if has infinite order then only for ).
Refutation
The kernel of reduction is , which has order by [L3], so the displayed sequence is short exact.
Assume, for contradiction, that [A1] holds and let be a section. Since is the identity, is injective and its image has order . By [L2], for some . Its generator has order , so [L3] gives and hence . Thus ; both subgroups have elements, so .
Hence is zero, contradicting [L1]. Therefore this sequence does not split and [A1] is false.
Depends on
- Group extensions, sections, complements, and split extensions
- Every subgroup of a cyclic group is cyclic; the least positive exponent in a nontrivial subgroup supplies a generator
- If $\operatorname{ord}(g) = n$ then $g^{k} = e$ iff $k$ is an integer multiple of $n$, the powers $g^{0}, \dots, g^{n-1}$ are distinct, and $\langle g \rangle$ has exactly $n$ elements; if $g$ has infinite order then $g^{j} = g^{k}$ only for $j = k$
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: 64 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
- J. S. Milne, Group Theory (standard reference, not scraped)