Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28
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.

Equivalence classes of degree-one representations are exactly homomorphisms G→k×; equivalently they factor through G/G′, and they form an abelian group

Statement

Let k be a field and let G be a group.

  1. choosing a basis of a degree-one representation of G over k produces a homomorphism χ:G→k×, and every such homomorphism produces a normalized degree-one representation on the one-dimensional space k;
  2. two degree-one representations are equivalent if and only if they produce the same homomorphism, so equivalence classes of degree-one representations are in bijection with the homomorphisms G→k×;
  3. equivalently, those equivalence classes are in bijection with the homomorphisms that factor through the abelianisation quotient G/G′;
  4. under pointwise multiplication and inversion of the corresponding homomorphisms, these equivalence classes form an abelian group.

Facts & Assumptions

Given: A field k and a group G.

[L1]

A degree-one representation is a finite-dimensional representation whose underlying vector space has dimension 1 (A finite-dimensional representation ρ:G→GL⁡(V) over a field, and its degree).

[L3]

Every homomorphism from G to an abelian group factors uniquely through the quotient G/G′ (The derived subgroup is characteristic and the abelianization is universal, Monoid homomorphism and group homomorphism).

[L4]

Two representations are equivalent when there is an invertible intertwiner between them (Intertwiners, the spaces Hom⁡G(V,W) and End⁡G(V), equivalent representations, and faithful representations).

Proof

technique · constructive
1.1L1L2givenconstruct

Let ρ:G→GL⁡(V) be a degree-one representation. By [L1], choose a basis vector v of the one-dimensional space V. For each g∈G there is a unique scalar χ(g)∈k with ρ(g)v=χ(g)v, and because ρ(g) is invertible, that scalar lies in k×.

2.1step 1.1L2givenalgebra

The representation law gives χ(gh)v=ρ(gh)v=ρ(g)ρ(h)v=χ(g)χ(h)v, so χ(gh)=χ(g)χ(h). Thus χ:G→k× is a group homomorphism. Under the identification V≅k sending v to 1, the representation becomes the normalized action g⋅a=χ(g)a on the one-dimensional space k.

3.1step 2.1L2givenconstruct

Conversely, if χ:G→k× is a group homomorphism, define ρχ(g):k→k by ρχ(g)(a)=χ(g)a. Each ρχ(g) is invertible with inverse multiplication by χ(g)−1, and the homomorphism law for χ gives ρχ(gh)=ρχ(g)ρχ(h). So ρχ is a degree-one representation.

4.1step 2.1step 3.1L4givenalgebra

If two degree-one representations are equivalent, an invertible intertwiner sends a chosen basis vector of one space to a nonzero scalar multiple of a basis vector of the other, so the character extracted in step 2.1 is unchanged; conversely, if two degree-one representations produce the same homomorphism χ, then step 2.1 identifies each of them with the same normalized representation ρχ of step 3.1, so they are equivalent by [L4]. Therefore equivalence classes of degree-one representations are in bijection with homomorphisms G→k×.

5.1step 4.1L2L3discharge-construct∎

Because k× is abelian by [L2], [L3] identifies the same equivalence classes with the homomorphisms factoring through G/G′. If χ,ψ:G→k× are homomorphisms, then (χψ)(g):=χ(g)ψ(g) and χ−1(g):=χ(g)−1 are again homomorphisms. Thus the equivalence classes of degree-one representations form an abelian group under pointwise multiplication and inversion of their corresponding homomorphisms.

Depends on

Used by

Dependency tree · two levels

26 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