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.
Normal p core lies in every block defect group
Statement
For a finite group , its largest normal -subgroup lies in every block defect group over a field of characteristic .
Facts & Assumptions
Given: A finite group and a defect group .
A defect group is an intersection of two Sylow -subgroups. (Block defect is an intersection of two sylow subgroups)
A -subgroup can be contained in a Sylow subgroup. (Sylow II: in a finite group every -subgroup lies in a conjugate of any Sylow -subgroup, and the Sylow -subgroups form a single conjugacy class)
Proof
For finite , the product of two normal -subgroups is normal and is a subgroup; its order is , a power of . The order formula follows because each element of the product has exactly representations as . There are finitely many subgroups of , so their finite product defines the largest normal -subgroup , including the trivial subgroup. If is Sylow and is a -subgroup, the same order formula makes a -subgroup containing ; maximality of forces . Thus .
Choose a Sylow containing by [F2]. By [F1], for some . Apply step 1.1 to both Sylow subgroups to obtain .
Sources
Webb, A Course in Finite Group Representation Theory, §§11.3, 11.6 and 12.3–12.5, especially pp.240–245. Local argument and conventions as displayed above.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
13 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
- Webb, A Course in Finite Group Representation Theory, §§11.3, 11.6 and 12.3–12.5, especially pp.240–245 (standard reference, not scraped)