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.

The factor set satisfies the two-cocycle equation

Statement

The factor set of a normalized projective representation satisfies α(1,q)=α(q,1)=1 and α(q,r)α(qr,s)=α(r,s)α(q,rs)(q,r,s∈Q).

Facts & Assumptions

Given: A finite group Q, a nonzero finite-dimensional complex vector space V, and a normalized projective representation P:Q→GL⁡(V) with factor set α.

[F1]

P(1)=id⁡V and P(q)P(r)=α(q,r)P(qr) for all q,r∈Q, with α(q,r)∈C×; every P(q) is invertible. (Projective representations and normalized factor sets).

[F2]

For an abelian group M with a G-action, written additively, a normalized two-cocycle is a function f with g⋅f(h,k)−f(gh,k)+f(g,hk)−f(g,h)=0 and f(1,g)=f(g,1)=0. Its two-coboundary formula is (δu)(g,h)=g⋅u(h)−u(gh)+u(g). (Normalized two-cocycle and two-coboundary).

[A1]

Multiplication in GL⁡(V) is associative and id⁡V is its identity.

Proof

technique · direct
1.1

Relation [F1] at q=1 reads P(1)P(r)=α(1,r)P(r), that is P(r)=α(1,r)P(r) by [A1]; multiplying by the inverse of P(r) gives α(1,r)=1. Symmetrically, [F1] at r=1 gives P(q)P(1)=α(q,1)P(q), so α(q,1)=1.

F1A1algebra
1.2

Multiplying the relation of [F1] on the left by P(q) and applying it twice, P(q)(P(r)P(s))=α(r,s)P(q)P(rs)=α(r,s)α(q,rs)P(qrs). Applying it in the other order, (P(q)P(r))P(s)=α(q,r)P(qr)P(s)=α(q,r)α(qr,s)P(qrs).

F1algebra
2.1

By associativity in GL⁡(V), the two expressions of step 1.2 are equal; since P(qrs) is invertible, cancelling it gives α(q,r)α(qr,s)=α(r,s)α(q,rs).

step 1.2F1A1algebra
3.1

Reading the additive data of [F2] in multiplicative notation for the abelian group C× with trivial Q-action — sums become products, negatives become inverses and 0 becomes 1 — the cocycle equation g⋅f(h,k)−f(gh,k)+f(g,hk)−f(g,h)=0 becomes α(h,k)α(g,hk)=α(gh,k)α(g,h), which after renaming (g,h,k) as (q,r,s) is the equation of step 2.1, and f(1,g)=f(g,1)=0 becomes α(1,q)=α(q,1)=1. Thus α is a normalized two-cocycle on Q with values in C× in the multiplicative form of the published convention.

F2step 1.1step 2.1∎

Depends on

Used by

Dependency tree · one level

2 results within one dependency step 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