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.
for a normal subgroup of a finite -group
Statement
If and is a finite -group, then
Facts & Assumptions
Given: A finite -group , a normal subgroup , and the quotient map .
For every finite -group , ( for a finite -group).
A surjective homomorphism sends the derived subgroup onto the derived subgroup of the target (Homomorphisms respect commutator subgroups and derived series).
In , coset multiplication satisfies , and subgroups of correspond to subgroups of containing by and inverse image (For , the cosets form a group with identity and inverse , Correspondence theorem: subgroups of correspond to subgroups of containing , with normality preserved).
Proof
By [L2], . Also , so .
Apply [L1] in and use step 1.1: . Directly, , so the correspondence in [L3] gives .
Depends on
- $\Phi(P)=P'P^p$ for a finite $p$-group
- Homomorphisms respect commutator subgroups and derived series
- For $N\mathrel{\trianglelefteq}G$, the cosets form a group with identity $N$ and inverse $(gN)^{-1}=g^{-1}N$
- Correspondence theorem: subgroups of $G/N$ correspond to subgroups of $G$ containing $N$, with normality preserved
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
19 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- M. van Beek, Topics in Finite p-Groups, Lemma 3.6(ii) (standard reference, not scraped)