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.
Quasisimple normal intersections and perfect central actions
Statement
If is quasisimple and is proper, then . If is perfect, normalizes , and every commutator with and lies in , then centralizes .
Facts & Assumptions
Given: Groups , subgroups and as in the statement. A group is perfect when it equals its commutator subgroup.
Quasisimple means and is simple. (Quasisimple groups, components, and the layer)
A simple group has only the trivial and whole normal subgroups. (Simple groups)
The center commutes with every element of , and . (The center of a group, Commutators and the commutator subgroup )
Proof
The image is normal in the simple group , so it is trivial or the whole quotient. In the trivial case . In the whole case , and the quotient is generated by the image of the abelian group ; hence is abelian. But a quotient of the perfect group is perfect, and an abelian perfect group is trivial. Thus , contrary to properness. Only the first case remains.
Fix . Since normalizes , the formula defines a function by hypothesis. Its values are central, so and therefore . Thus is a homomorphism to the abelian group . It kills every commutator of , and , so is trivial. Every consequently commutes with every , as claimed. The argument also covers a trivial center or a trivial .
Depends on
Used by
Dependency tree · two levels
11 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.