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.
Block defect groups are p radical
Statement
Every block defect group satisfies .
Facts & Assumptions
Given: A defect group of a block of a finite group over a field of characteristic .
For every Sylow there is with . (Block defect is an intersection of two sylow subgroups)
Every -subgroup is 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
Put . Choose a Sylow subgroup of containing , and a Sylow subgroup of containing , by [F2]. Then is a -subgroup of containing its Sylow subgroup , hence equals . Take from [F1]. Intersecting with gives .
The product of normal -subgroups of a finite group is a normal -subgroup: for two factors its order is the product of their orders divided by the intersection order, by counting representations of a product element. A finite product over all such subgroups therefore defines . If is Sylow in , normality makes a -subgroup containing , hence equal to . Thus lies in both and , so in by step 1.1. Conversely by the definition of its normalizer and is a -group, so . Both inclusions prove equality.
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
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)