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.
does not split
Statement refuted
Every short exact sequence of groups splits.
For every prime , the sequence
obtained from multiplication by and reduction modulo is a counterexample.
Facts & Assumptions
Given: A prime , written additively with the middle group .
A split extension has a homomorphic section of its quotient map (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).
An element of finite order satisfies exactly when (If then iff is an integer multiple of , the powers are distinct, and has exactly elements; if has infinite order then only for ).
Counterexample
The injection sends to , and the quotient map sends to . The kernel of is the subgroup of order , so the sequence is short exact.
Suppose, for contradiction, that a section existed. Since is the identity, is injective, so its image is a subgroup of order . By [L2], for some . Its generator has order , so [L3] gives and hence . Thus ; both subgroups have elements, so they are equal.
Then is the zero homomorphism, contradicting that it is the identity on the nontrivial group . Thus the extension does not split.
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)