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.
A finite product of normal -subgroups is a normal -subgroup
Statement
A finite product of normal -subgroups of a group is a normal -subgroup. The empty product is the trivial subgroup. See A finite -group has order for a prime and some .
Facts & Assumptions
Given: The hypotheses and objects in the Statement.
Let be a prime natural number (def-prime). A finite -group is a finite group (def-group, def-finite-cardinality) whose order has the form for some , with natural exponentiation as in def-nat-power. The case permits the trivial group. A finite -group is nontrivial exactly when . (A finite -group has order for a prime and some ).
If and , then is a subgroup and . Here . (If and , then is a subgroup and ).
If is a subgroup of a finite group , then ; in particular divides . (Lagrange's theorem: for every subgroup of a finite group ).
Proof
Induct on the number of factors; the empty product is the trivial normal -subgroup.
Let and be normal -subgroups. By [L2], is a subgroup, and for every ambient-group element , so is normal. The multiplication map is surjective. For a fixed factorization , all its preimages are exactly with . Thus every fibre has elements and . By [L3], is a power of , so is a power of .
Applying step 2.1 repeatedly proves the result for every finite product, including one factor and repeated factors.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
20 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
- Keith Conrad, The Sylow Theorems, Sections 1-2 (standard reference, not scraped)