Alphabeta Math
LemmaStatement: Literature-sourcedProof: Literature-sourcedPipeline-generatedverified 2026-09-26 (gpt-6-sol)
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.

Hyperelementary permutation subring reduction

Statement

Let H′ be the p-hyperelementary subgroups of G, for all primes p. The additive span P(H′)=∑H∈H′ZInd⁡HG1H is a subring of R(G). Moreover, if 1G∈P(H′), then proving 1H∈IE(H) for each hyperelementary H implies 1G∈IE(G).

Facts & Assumptions

[F2]

Induction satisfies the projection formula on character rings (Induction and restriction satisfy the projection formula on character rings). Hyperelementary groups are closed under subgroups (Subgroups of elementary and hyperelementary groups), and induction is transitive along subgroup chains (Induction is transitive along subgroup chains).

[F3]

The induction ideal IE(G) is the additive span of characters induced from elementary subgroups (Induction ideal of a subgroup family).

Proof

Given: H,K∈H′ and E is the elementary family.

1.1F1F2given

By the projection formula, (Ind⁡HG1H)(Ind⁡KG1K)=Ind⁡HG(Res⁡HGInd⁡KG1K). Mackey's formula expresses the restricted character as a finite sum of Ind⁡H∩xKx−1H1H∩xKx−1. Each intersection is hyperelementary by subgroup closure; transitivity then makes every summand induced back to G equal to Ind⁡H∩xKx−1G1H∩xKx−1. Thus products of the displayed generators stay in P(H′), and bilinearity makes its additive span a subring.

2.1F2F3step 1.1

If 1H∈IE(H), express it by [F3] as an integral sum of characters induced from elementary subgroups of H. Inducing this sum to G and using transitivity puts Ind⁡HG1H in IE(G). Apply this to every summand of a relation for 1G in P(H′). ∎

Depends on

Used by

Dependency tree · two levels

21 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