Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedaudited 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.

Trivial and one-dimensional monomial cases

Example

Let G be a finite group. Then:

  1. every one-dimensional complex character λ of G is monomial (Monomial representations, monomial characters, and M-groups), namely Ind⁡GGλ=λ, and in particular the trivial character of G is monomial;
  2. the trivial group is an M-group;
  3. every finite abelian group is an M-group, because all of its irreducible complex characters are one-dimensional.

The three cases are the degenerate ends of the theory: subgroups of index one, the group of order one, and the abelian groups, whose irreducible characters cannot be induced from any proper subgroup.

Facts & Assumptions

Given: A finite group G with identity element 1 (Group and abelian group), a one-dimensional complex representation L of G with character λ (The character χV(g)=tr⁡(ρV(g)) of a finite-dimensional complex representation), and the trivial representation C of G, on which every g∈G acts as the identity.

[F1]

For a subgroup H≤G and a complex H-module W, the induced module is Ind⁡HGW={f:G→W:f(gh)=h−1⋅f(g) for all g∈G,h∈H} with (x⋅f)(g)=f(x−1g) and pointwise module operations. (The induced R-linear G-module Ind⁡HGW as H-covariant functions on G).

[F2]

A linear character of H is a homomorphism λ:H→C×, equivalently the character of a one-dimensional complex representation of H; a character χ of G is monomial if χ=Ind⁡HGλ for some H≤G and linear character λ of H; G is an M-group if every irreducible complex character of G is monomial; and a nonzero representation is monomial exactly when its character is. (Monomial representations, monomial characters, and M-groups).

[F3]

A complex representation of G is a group homomorphism G→GL⁡C(V) on a finite-dimensional complex vector space V, and it is irreducible exactly when V≠0 and 0 and V are its only invariant subspaces. (A finite-dimensional representation ρ:G→GL⁡(V) over a field, and its degree, Subrepresentations, direct sums of representations, and irreducibility).

[F4]

Every irreducible representation of a finite abelian group over a splitting field has degree 1, and C is a splitting field for every finite group. (Every irreducible representation of a finite abelian group over a splitting field is one-dimensional, A cyclotomic field splits a finite group).

[F5]

The irreducible complex characters χ1,…,χr of a finite group G satisfy ∑i=1rχi(1)2=∣G∣. (The regular character gives a second proof of the sum-of-squares formula).

[F6]

For a finite-dimensional H-representation W one has dim⁡kInd⁡HGW=[G:H]dim⁡kW, and the character of an irreducible representation is an irreducible character. (The dimension of an induced finite-dimensional representation is [G:H]dim⁡W, An irreducible complex character).

Verification

technique · direct
1.1

Evaluation at the identity, Φ:Ind⁡GGL→L, Φ(f):=f(1), is a C-linear map of G-modules. It is C-linear because the module operations on Ind⁡GGL are pointwise by [F1]; and for f∈Ind⁡GGL and x∈G one has Φ(x⋅f)=(x⋅f)(1)=f(x−1)=x⋅f(1)=x⋅Φ(f), where the covariance law of [F1] with g=1 and h=x−1 gives f(x−1)=f(1⋅x−1)=(x−1)−1⋅f(1)=x⋅f(1).

F1given
2.1

The map Φ is bijective. For v∈L define fv:G→L by fv(g):=g−1⋅v; then fv(gh)=(gh)−1⋅v=h−1⋅(g−1⋅v)=h−1⋅fv(g) for all g∈G and h∈H=G, so fv∈Ind⁡GGL by [F1], and Ψ(v):=fv is C-linear and G-equivariant because fx⋅v(g)=g−1⋅(x⋅v)=(x⋅fv)(g). Moreover Φ(Ψ(v))=fv(1)=v, and for f∈Ind⁡GGL the same covariance law with g=1, h=g gives f(g)=f(1⋅g)=g−1⋅f(1)=ff(1)(g), that is Ψ(Φ(f))=f. Hence Ψ=Φ−1 and Ind⁡GGL≅L as G-modules, so their characters agree: Ind⁡GGλ=λ. The degrees match, since dim⁡CInd⁡GGL=[G:G]dim⁡CL=1 by [F6].

F1F6step 1.1construct
3.1

By step 2.1 every one-dimensional complex character λ of G is monomial in the sense of [F2], with H=G and Ind⁡GGλ=λ. In particular the trivial character 1G, the character of the trivial representation C of G, is one-dimensional and hence monomial; the trivial representation is irreducible because a one-dimensional space has no nonzero proper subspace, so 0 and C are its only invariant subspaces by [F3].

F2F3step 2.1
4.1

For the trivial group G={1} one has ∣G∣=1, so ∑iχi(1)2=1 over the irreducible complex characters by [F5]; each term χi(1)2 is a positive integer, so the sum has exactly one term and χ1(1)=1. Hence {1} has exactly one irreducible complex character, of degree one, and it is monomial by step 3.1; by [F2] the trivial group is an M-group.

F2F5step 3.1
5.1

For a finite abelian group A, the field C is a splitting field for A by [F4], so every irreducible complex representation of A has degree 1 by [F4]; hence every irreducible complex character of A is a one-dimensional character and is monomial by step 3.1, so A is an M-group by [F2]. Moreover [F5] now evaluates to ∣A∣=∑i1=∣Irr⁡(A)∣, so a finite abelian group has exactly ∣A∣ irreducible characters, all of them linear and monomial; the cases ∣A∣=1 and ∣A∣=2 are the extremes, the former being step 4.1.

F2F4F5step 3.1algebra
6.1

All three assertions hold: every one-dimensional character of a finite group is induced from the group itself and is monomial, the trivial group is an M-group, and every finite abelian group is an M-group. The construction involves no proper subgroup and no choice: for H=G the module Ind⁡GGL is explicitly identified with L by evaluation at 1, with inverse v↦fv, and the only groups used have a specified single irreducible character or are handled by the degree count ∑iχi(1)2=∣A∣ of [F5].

F5step 1.1step 2.1step 3.1step 4.1step 5.1∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

38 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