Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-09-27
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.

Frobenius character extension is irreducible

Statement

Let G be a finite Frobenius group with complement H and let φ be a nontrivial irreducible complex character of H. Then φ~=Ind⁡HGθ+φ(1)1G with θ=φ−φ(1)1H is an irreducible complex character of G.

Facts & Assumptions

Given: A finite group G with Frobenius complement {1}<H<G, a nontrivial irreducible complex character φ of H, and the class function φ~ of Frobenius character extension construction.

[F1]

Put d=φ(1)∈N>0. The construction gives φ~=Ind⁡HG(φ−d1H)+d1G, φ~∣H=φ and φ~(1)=d, hence Res⁡HGInd⁡HGθ=θ (Frobenius character extension construction). Induction of class functions is linear and sends honest characters to honest characters (Induced class functions and restricted class functions). Thus φ~=Ind⁡HGφ−dInd⁡HG1H+d1G is an integral combination of honest characters. Each honest character has integral coefficients in the irreducible-character basis: its coefficient at χi is its inner product with χi, a dimension of an intertwiner space (The irreducible complex characters form an orthonormal basis of cf(G), The class-function inner product ⟨χV,χW⟩ equals dim⁡Hom⁡G(W,V)). Consequently φ~=∑iniχi with ni∈Z, so it is a virtual character (Virtual characters and the character ring R(G) of a finite group).

[F2]

For class functions α on H and β on G one has ⟨Ind⁡HGα,β⟩G=⟨α,Res⁡HGβ⟩H (Frobenius reciprocity for class functions).

[F3]

The inner product ⟨α,β⟩=1∣G∣∑g∈Gα(g)β(g)‾ is linear in the first argument and conjugate-linear in the second, and ⟨1G,1G⟩=1; the same holds on H (The standard inner product on cf(G)).

[F4]

Irreducible complex characters ψ1,ψ2 of a finite group satisfy ⟨ψ1,ψ2⟩=δ12; the trivial character 1H, being the character of the one-dimensional trivial representation, is irreducible with ⟨1H,1H⟩=1, and since φ≠1H the characters φ and 1H are distinct irreducibles, so ⟨φ,1H⟩=0 and ⟨φ,φ⟩=1 (The first orthogonality relation for irreducible complex characters, An irreducible complex character, The trivial representation, the regular representation, and permutation representations from finite G-sets).

Proof

technique · direct
1.1

With θ=φ−φ(1)1H one computes ⟨θ,θ⟩H=⟨φ,φ⟩−2φ(1)⟨φ,1H⟩+φ(1)2⟨1H,1H⟩=1+0+φ(1)2, using the orthonormality data of [F4] and the linearity of the inner product in its first argument.

F3F4algebra
2.1

Similarly ⟨θ,1H⟩H=⟨φ,1H⟩−φ(1)⟨1H,1H⟩=0−φ(1)=−φ(1), and hence by [F2] ⟨Ind⁡HGθ,1G⟩G=⟨θ,Res⁡HG1G⟩H=−φ(1).

F2F4step 1.1algebra
2.2

By [F2] and the restriction identity of [F1], ⟨Ind⁡HGθ,Ind⁡HGθ⟩G=⟨θ,Res⁡HGInd⁡HGθ⟩H=⟨θ,θ⟩H=1+φ(1)2.

F1F2step 1.1
3.1

Expanding φ~=Ind⁡HGθ+φ(1)1G and using linearity in the first slot and conjugate-linearity in the second (the cross inner products are the equal real number −d) together with ⟨1G,1G⟩=1 gives ⟨φ~,φ~⟩G=⟨Ind⁡HGθ,Ind⁡HGθ⟩G+2φ(1)⟨Ind⁡HGθ,1G⟩G+φ(1)2⟨1G,1G⟩G=(1+φ(1)2)−2φ(1)2+φ(1)2=1.

F3step 2.1step 2.2algebra
4.1

For the expansion φ~=∑iniχi of the virtual character φ~ over the irreducible characters of G in [F1], orthonormality [F4] gives ∑ini2=⟨φ~,φ~⟩G=1; as the coefficients ni are integers, exactly one of them equals ±1 and all others are 0, so φ~=±χ for some irreducible character χ of G.

F1F4step 3.1algebra
5.1

Since φ~(1)=φ(1)≥1 by [F1] while χ(1)≥1 and (−χ)(1)<0, the sign is positive, so φ~=χ is a genuine irreducible character of G. ∎

F1step 4.1given

Depends on

Used by

Dependency tree · two levels

37 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