Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-06
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.

Brauer induction

Statement

For every finite group G, every complex virtual character of G is an integral linear combination of characters Ind⁡HGλ, where H is p-elementary for some prime p and λ is a linear complex character of H.

Facts & Assumptions

[F1]

The elementary detection relation is Elementary detection at a fixed element.

[F2]

Elementary induction subgroups are ideals by The induction subgroup is an ideal.

[F3]

Characters of elementary groups reduce integrally to induced linear characters by Characters of elementary groups are induced from linear characters.

[F4]

Proof

Given: E is the family of all elementary subgroups of G, and IE(G) is its induction ideal.

1.1F1givenalgebra

If G is trivial, the assertion is immediate. Otherwise, for every prime p∣∣G∣, write ∣G∣=pnplp with p∤lp. By [F1], lp1G∈IEp(G)⊆IE(G). The integers lp have greatest common divisor 1: for each prime divisor q of ∣G∣, the particular integer lq is prime to q. Bézout therefore gives 1G∈IE(G).

2.1F2step 1.1

By [F2], every χ∈R(G) satisfies χ=χ1G∈IE(G). Thus it is an integral sum of characters Ind⁡HGθ with H elementary and θ∈R(H).

3.1F3F4step 2.1

By [F3], each such θ is an integral combination of characters induced from linear characters of elementary subgroups K≤H. Transitivity [F4] changes Ind⁡HGInd⁡KHλ into Ind⁡KGλ, which is exactly the claimed form. ∎

Depends on

Used by

Dependency tree · two levels

19 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