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

Orbit indicators form a basis of invariant functions

Statement

Let a group G act on a set X with finitely many distinct orbits O, and let k be any field. The invariant functions f:X→k, meaning f(g⋅x)=f(x) for all g,x, form a vector space under pointwise operations. Its basis is {1O:O∈O} and its dimension is ∣O∣. Here 1O is 1k on O and 0k elsewhere. For conjugation on a finite group, these are the class functions and conjugacy-class indicators. If X=∅, the basis is empty.

Facts & Assumptions

Given: A left action of G on X, a finite orbit set O, and a field k.

[F1]

A left action satisfies e⋅x=x and (gh)⋅x=g⋅(h⋅x) (Left group actions, transitive actions, and faithful actions).

[F2]

Distinct orbits partition X, and two points share an orbit exactly when one is g⋅x for some g (The orbits of a group action are the equivalence classes of x∼y iff y=g⋅x for some g, and hence partition the acted-on set).

[F3]

The vector-space axioms are the abelian addition laws, two distributive laws, scalar associativity and the scalar identity law (Vector space over a field).

[F4]

Finite sums in an additive commutative monoid are independent of enumeration and the empty sum is zero (A finite sum in a commutative monoid indexed by an arbitrary finite set).

[F5]

A basis is a linearly independent spanning subset; the empty basis belongs to the zero space (Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis).

[F6]

The conjugacy class of x is {gxg−1:g∈G} (The conjugacy class Cl⁡G(x) and centralizer CG(x) of an element).

Proof

technique · direct
1.1F3givenalgebra

Write W for the invariant functions. The zero function is invariant. If f,h∈W and a,b∈k, then (af+bh)(g⋅x)=af(g⋅x)+bh(g⋅x)=af(x)+bh(x)=(af+bh)(x), so af+bh∈W. For each x, associativity and commutativity of function addition, the zero and negative identities, a(f+h)=af+ah, (a+b)f=af+bf, (ab)f=a(bf) and 1kf=f are the corresponding field equalities evaluated at x. Equality at every x is equality of functions. This verifies all the axioms in F3.

1.2F2given

By F2, x and g⋅x belong to the same orbit. Consequently 1O(g⋅x)=1O(x), so every orbit indicator lies in W. If f∈W, its values at any two points of one orbit coincide by F2 and invariance. Each orbit is nonempty, so there is a unique scalar cO such that f(x)=cO for all x∈O. This defines cO by its unique value and does not choose orbit representatives.

2.1F4F2step 1.1step 1.2

Define h=∑O∈OcO1O using F4 in the additive vector space W. Evaluation of a finite sum is the sum of its values, by the recursive pointwise addition. At a point x, exactly one indicator is 1k, namely that of its orbit, and every other term vanishes. Thus h(x)=cG⋅x=f(x), so h=f and the indicators span W.

3.1F2F4F5step 2.1

Suppose ∑O∈OaO1O=0. Fix any orbit O and one x∈O, possible because O is nonempty. Evaluation at x gives aO=0. This holds for each orbit separately, so no simultaneous choice is required. Also different orbits have different indicators by evaluation on either orbit and 1k≠0k. Hence these ∣O∣ vectors are independent and, by F5 and step 2.1, form a basis, giving the asserted dimension.

4.1F1F6step 1.1step 1.2step 2.1step 3.1algebra

On X=G, set g⋅x=gxg−1. Then exe−1=x and (gh)x(gh)−1=g(hxh−1)g−1, so this is an action by F1. F6 identifies its orbits as the conjugacy classes. Invariance is precisely constancy on conjugacy classes, the definition of a class function here. If G is finite there are finitely many classes, so steps 1.1–3.1 apply.

5.1F4F5step 2.1step 3.1∎

If X=∅, there is just the empty function, which is the zero function; there are no orbits and F4 gives the zero function as the empty sum. F5 gives the empty basis and dimension zero. With one orbit, step 2.1 reads f=cX1X, and step 3.1 proves that this single nonzero indicator is a basis.

Sources

Etingof et al., §4.2 opening, p. 63, supplies the class-function setting. Judson, §14.2 opening identifies the conjugation orbits. The orbit-function basis argument is the local generalization and uses neither character orthogonality nor completeness.

Depends on

Used by

Dependency tree · two levels

29 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