Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

Projective representations and normalized factor sets

Definition

Let Q be a finite group and let V be a nonzero finite-dimensional complex vector space. A normalized projective representation of Q on V is a map P:Q⟶GL⁡(V) with P(1)=id⁡V for which there are scalars α(q,r)∈C× satisfying P(q)P(r)=α(q,r)P(qr)(q,r∈Q). The function α is the factor set of P; in this convention the scalar multiplies P(qr), so that the relation with α≡1 is the multiplicativity of an ordinary representation. The degree of P is dim⁡CV.

The factor set is determined by P. If P(q)P(r)=α(q,r)P(qr) and P(q)P(r)=β(q,r)P(qr) for scalars, then (α(q,r)−β(q,r))P(qr)=0 and P(qr) is invertible, so α(q,r)=β(q,r). Thus a map P either has no factor set or has exactly one, and the equation is a genuine condition on P: it says that the composite of P with the quotient map GL⁡(V)→PGL⁡(V) is a group homomorphism, since P(q)P(r)P(qr)−1 is a scalar exactly when the displayed relation holds. The scalars are automatically nonzero, because P(q)P(r) is invertible and P(q)P(r)=α(q,r)P(qr). The normalization P(1)=id⁡V fixes the representative of a projective representation up to scalars; with it the relation at q=r=1 forces α(1,1)=1, and the general normalization identities α(1,q)=α(q,1)=1 are proved in The factor set satisfies the two-cocycle equation.

Similarity. Projective representations P of Q on V and P′ of Q on V′ are similar when there is a C-linear isomorphism M:V→V′ with P′(q)=M P(q) M−1(q∈Q). Similar projective representations have the same factor set: multiplying P′(q)P′(r)=MP(q)P(r)M−1=α(q,r)MP(qr)M−1=α(q,r)P′(qr) identifies the factor set of P′ with that of P. Similarity is an equivalence relation on the projective representations of Q with a fixed factor set, and it preserves the degree.

Irreducibility. A normalized projective representation P of Q on V is reducible when there is a subspace W≤V with 0≠W≠V and P(q)W⊆W for every q∈Q, and irreducible otherwise. Because every P(q) is invertible, P(q)W⊆W for all q is equivalent to P(q)W=W for all q. A similarity M:P→P′ carries P-invariant subspaces bijectively onto P′-invariant subspaces, so reducibility and irreducibility are similarity invariants; this is the notion of irreducibility used in The projective Clifford correspondence for an invariant irreducible representation.

Remarks

  • Why V≠0. For the zero space the group GL⁡(0) is trivial, so the relation P(q)P(r)=α(q,r)P(qr) holds for every scalar function α and no factor set is determined. The zero module reappears in the module dictionary of Projective representations and twisted algebra modules as the common zero object of all twisted module categories, which is why the correspondence is stated for nonzero modules.

  • Conventions. The factor set here is the map α of Späth, Definition 1.4, normalized by P(1)=id⁡; its cocycle equation and its behaviour under rephasing are recorded in The factor set satisfies the two-cocycle equation and Rephasing changes factor sets by coboundaries. A projective representation in this sense is not a representation: the scalar α(q,r) need not be 1, and the maps P(q) need not multiply.

Used by

Dependency tree · 0 levels

Nothing. This result depends on no other item in the library.

Sources