Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-sol)audited 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.

An invariant irreducible normal representation yields projective inertia operators

Statement

Let N⊴G be finite groups, let ρ:N→GL⁡(S) be an irreducible representation on a nonzero finite-dimensional complex space S, let θ be its character, and let I=IG(θ) be the inertia group. Then there are operators P(i)∈GL⁡(S), i∈I, with P(1)=id⁡S and P(n)=ρ(n),P(ni)=ρ(n)P(i),P(in)=P(i)ρ(n)(n∈N, i∈I), and there is a normalized two-cocycle α on Q=I/N, in the multiplicative convention of Normalized two-cocycle and two-coboundary, such that P(i)P(j)=α(iN,jN)P(ij)(i,j∈I). Thus P is a normalized projective representation of I whose factor set descends to I/N. Every second family P′ with the same normalization and the same three identities satisfies P′(i)=c(iN)P(i) for a function c:Q→C× with c(N)=1, and the factor set of P′ is α′(q,r)=c(q)c(r)c(qr)−1α(q,r)(q,r∈Q).

Facts & Assumptions

Given: Finite groups N⊴G, an irreducible finite-dimensional complex representation ρ:N→GL⁡(S) with S≠0, its character θ=χρ, the inertia group I=IG(θ), and a left transversal T for the cosets iN of N in I with 1∈T.

[F1]

gθ(n)=θ(g−1ng) and IG(θ)={g∈G:gθ=θ}, and the stabilizer satisfies N≤IG(θ)≤G. (Inertia group and characters lying above a normal type).

[F2]

The conjugate representation gW of a representation W of H≤G is the same space regarded as a representation of gHg−1 by (ghg−1)⋅w:=h⋅w, and gχ(ghg−1)=χ(h) for its character. (Conjugate representations and conjugate characters on conjugate subgroups).

[F3]

Finite-dimensional complex representations of a finite group are isomorphic if and only if they have the same character. (Finite-dimensional complex representations of a finite group are determined up to isomorphism by their characters).

[F4]

Every endomorphism of an irreducible representation over an algebraically closed field is a scalar operator. (Over an algebraically closed field, every endomorphism of an irreducible representation is scalar).

[F5]

The factor set of a normalized projective representation satisfies α(1,q)=α(q,1)=1 and α(q,r)α(qr,s)=α(r,s)α(q,rs). (The factor set satisfies the two-cocycle equation).

[F6]

A normalized two-cocycle on a group G with values in the abelian group M=C× written multiplicatively and with trivial action is a function α:G×G→C× with α(1,q)=α(q,1)=1 and α(q,r)α(qr,s)=α(r,s)α(q,rs) for all q,r,s. (Normalized two-cocycle and two-coboundary).

[A1]

Since N⊴I, left and right cosets coincide, so every i∈I has a unique expression i=nt and a unique expression i=tn′ with n,n′∈N and t∈T; explicitly t=ti is the transversal element with i∈tN, n=it−1 and n′=t−1i.

Proof

technique · direct
1.1

For t∈T the conjugate tρ is a representation of tNt−1=N whose character is tθ=θ=χρ by [F1] and [F2]; hence tρ≅ρ by [F3]. Choose Tt∈GL⁡(S) with Ttρ(n)=ρ(tnt−1)Tt for every n∈N, and set T1:=id⁡S, which satisfies this relation.

F1F2F3givenchoose
2.1

By [A1] write each i∈I as i=niti with ni∈N, ti∈T, and set P(i):=ρ(ni)Tti. This is well defined because the pair (ni,ti) is unique, and P(1)=ρ(1)T1=id⁡S, while P(n)=ρ(n)T1=ρ(n) for n∈N; each P(i) is invertible, with P(i)−1=Tti−1ρ(ni)−1.

A1step 1.1given
3.1

For x∈N and i∈I one has P(xi)=ρ(x)P(i) and P(ix)=P(i)ρ(x). Indeed xi=(xni)ti and ix=ni(tixti−1)ti are the decompositions of [A1], so P(xi)=ρ(xni)Tti=ρ(x)P(i), and P(ix)=ρ(ni)ρ(tixti−1)Tti=ρ(ni)Ttiρ(x)=P(i)ρ(x) using the intertwining relation of step 1.1.

A1step 1.1step 2.1algebra
3.2

For every i∈I and m∈N one has P(i)ρ(m)P(i)−1=ρ(imi−1). Indeed P(i)ρ(m)P(i)−1=ρ(ni)Ttiρ(m)Tti−1ρ(ni)−1=ρ(ni)ρ(timti−1)ρ(ni)−1=ρ(i m i−1), using i=niti and step 1.1.

step 1.1step 2.1algebra
4.1

For i,j∈I the operator A(i,j):=P(i)P(j)P(ij)−1 is invertible and satisfies A(i,j)ρ(m)=P(i)P(j)ρ((ij)−1m(ij))P(ij)−1=ρ(i j (ij)−1m(ij) j−1i−1)A(i,j)=ρ(m)A(i,j) for every m∈N, by step 3.2 applied to i, j and ij; since ρ is irreducible over the algebraically closed field C, [F4] gives a unique α(i,j)∈C× with A(i,j)=α(i,j)id⁡S, the scalar being nonzero because A(i,j) is invertible, so P(i)P(j)=α(i,j)P(ij) for all i,j∈I.

step 3.2F4givenalgebra
5.1

The scalar α(i,j) of step 4.1 depends only on the cosets iN and jN: the general element of iN is ix and the general element of jN is yj with x,y∈N, so it suffices to compare A(ix,j) and A(i,yj) with A(i,j). For the first, ixj=(ij)(j−1xj) with j−1xj∈N, so P(ixj)=P(ij)ρ(j−1xj) by step 3.1 and ρ(j−1xj)=P(j)−1ρ(x)P(j) by step 3.2, whence A(ix,j)=P(i)ρ(x)P(j)ρ(j−1xj)−1P(ij)−1=P(i)ρ(x)ρ(x)−1P(j)P(ij)−1=A(i,j). For the second, yj=y⋅j and iyj=(iyi−1)(ij) with iyi−1∈N, so P(yj)=ρ(y)P(j) and P(iyj)=ρ(iyi−1)P(ij) by step 3.1, while P(i)ρ(y)P(i)−1=ρ(iyi−1) by step 3.2, hence A(i,yj)=P(i)ρ(y)P(j)P(ij)−1ρ(iyi−1)−1=ρ(iyi−1)A(i,j)ρ(iyi−1)−1=A(i,j), the last equality because A(i,j) is a scalar.

step 3.1step 3.2step 4.1algebra
6.1

Write α(iN,jN):=α(i,j), which is well defined by step 5.1, so that P(i)P(j)=α(iN,jN)P(ij) for all i,j∈I; and α(N,qN)=α(qN,N)=1 for every q∈I, since P(1)P(j)=P(j) and P(i)P(1)=P(i) with P(1)=id⁡S by step 2.1 force A(1,j)=id⁡S=A(i,1).

step 2.1step 4.1step 5.1given
7.1

The function α:Q×Q→C× is a normalized two-cocycle on Q=I/N in the sense of [F6]: the normalization is step 6.1, and associativity of composition in GL⁡(S) gives α(i,j)α(ij,k)P(ijk)=(P(i)P(j))P(k)=P(i)(P(j)P(k))=α(j,k)α(i,jk)P(ijk), while P(ijk) is invertible by step 2.1, so α(iN,jN)α(ijN,kN)=α(jN,kN)α(iN,jkN); passing to cosets, this is the cocycle identity of [F6] on Q.

F6step 2.1step 6.1algebra
7.2

Now let P′ be a second family with the same normalization and the same three identities. For each i∈I, the operator C(i):=P(i)−1P′(i) commutes with ρ(N): by step 3.2, which applies to P′ by the same computation, P(i)ρ(m)P(i)−1=ρ(imi−1)=P′(i)ρ(m)P′(i)−1, hence C(i)ρ(m)=ρ(m)C(i) for all m∈N. By [F4] there is a unique c(i)∈C× with C(i)=c(i)id⁡S, so P′(i)=c(i)P(i). Step 3.1 for both families gives c(xi)=c(i)=c(ix) for x∈N, so c is constant on both left and right N-cosets and defines c:Q→C×, and c(N)=1 because P′(1)=P(1)=id⁡S. Finally P′(i)P′(j)=c(i)c(j)α(iN,jN)P(ij)=c(i)c(j)c(ij)−1α(iN,jN)P′(ij), so the factor set of P′ is α′(q,r)=c(q)c(r)c(qr)−1α(q,r).

step 3.1step 3.2step 4.1step 6.1F4algebra
8.1

Steps 2.1, 3.1, 6.1 and 7.1 produce operators P(i)∈GL⁡(S) with P(1)=id⁡S, P(n)=ρ(n), P(ni)=ρ(n)P(i), P(in)=P(i)ρ(n) and P(i)P(j)=α(iN,jN)P(ij) for the normalized two-cocycle α on I/N. Composing α with the coset projection I×I→(I/N)×(I/N) therefore expresses P as a normalized projective representation of I in the sense of [F5] whose factor set is carried by I/N, and step 7.2 shows that every other normalized family differs from P by a C×-valued cochain c on I/N with α′=c(q)c(r)c(qr)−1α.

F5step 2.1step 3.1step 6.1step 7.1step 7.2∎

Depends on

Used by

Dependency tree · two levels

16 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