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.
Gallagher correspondence for a direct product
Example
Let be finite groups, , and identify with . Fix afforded by . Then , and extends to . The irreducible -modules above are exactly, without repetitions, the modules for , where Their ramification indices are .
Facts & Assumptions
Given: The groups, modules, characters, and hypotheses in the example. All representations here are finite-dimensional complex left representations.
Given an extension to inertia, tensoring it with inflated quotient irreducibles is a bijection above the type, with ramification equal to quotient degree. (Gallagher correspondence for an extendible type).
Verification
For , conjugation sends to in the left-character convention. Characters are invariant under inner conjugation of by similarity of matrices, so every element fixes and inertia is . The map is multiplicative and restricts to the original action. The quotient map identifies with .
Gallagher applies to this extension. Its tensor with an inflated quotient module has exactly the displayed action, hence is . The bijection gives irreducibility, exhaustivity, and uniqueness of the parameter. Restricting to makes the second factor trivial and gives copies of , which is the ramification. When this is just ; when it is just .
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
8 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
- Britta Späth, Reduction theorems for some global-local conjectures — Theorem 1.3; tom Dieck Remark 4.2.5 specialized to a direct product (standard reference, not scraped)