Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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 stabilizer acts unitarily on an imprimitivity fibre

Statement

Assume AC and let (U,P) be a transitive system on G/H on a separable Hilbert space, with multiplicity-normalized model and source-variable cocycle fields φg as above. Fix a Borel section s with s(eH)=e. There exist a Borel unitary field Bx and a strongly continuous unitary representation σ:H→U(K), unique up to unitary equivalence, such that for every g and almost every x, φg(x)=Bgx σ(h(g,x)) Bx−1, where h(g,x)=s(gx)−1gs(x). The representatives can be replaced by this strict formula on all pairs and normalized with BeH=I, so that σ(h)=φh(eH) and Bx=φs(x)(eH). Changes of fields or section give equivalent σ. If H=G one recovers the original representation; if H is trivial the recovered representation is trivial.

Facts & Assumptions

Given: AC, the normalized transitive system, its cocycle fields φg, a Borel section s with s(eH)=e, and the section cocycle h(g,x)=s(gx)−1gs(x).

[F1]

The cocycle fields φg may be chosen jointly Borel on G×G/H, unitary for every g and a.e. x, with the a.e. cocycle law and with g↦φg continuous in local measure in the strong topology; they represent the operators Wg=Vg−1WUgW−1 (Measurable cocycle fields for a multiplicity-normalized system).

[F2]

Haar regularization: every such Borel U(K)-valued cocycle factors as c(g,x)=B(gx)σ(h(g,x))B(x)−1 for a Borel unitary field B and a strongly continuous unitary σ:H→U(K), and σ is unique up to unitary equivalence under Borel gauge changes (Haar regularization of transitive unitary cocycles).

[F3]

The section satisfies s(eH)=e, q∘s=id, and the section cocycle satisfies the strict identity h(g1g2,x)=h(g1,g2x)h(g2,x); moreover h(h′,eH)=h′ for h′∈H and h(s(x),eH)=e (Borel cross-sections for closed subgroups of second-countable locally compact Hausdorff groups, Left and right cosets gH and Hg of a subgroup, Left group actions, transitive actions, and faithful actions).

[F4]

Unitary fields over a standard Borel base may be modified on null sets, conjugated pointwise, and evaluated at points after being placed in strict form; changes on null sets do not change the a.e. class of the field, and conjugating the whole factorization by a fixed unitary does not change the equivalence class of σ (Standard Borel spaces, Hilbert space, Separability: the existence of an at most countable dense subset, Hilbert-adjoint identities, Unitary equivalence of systems of imprimitivity and of the induced representations).

[F5]

U(K) with the strong topology is a second-countable topological group, and Borel homomorphisms from the second-countable group H into it are strongly continuous (Steinhaus and Pettis: Borel homomorphisms of second-countable locally compact groups are continuous).

Proof

technique · direct

Given: AC, the transitive system with normalized model, the cocycle fields, and the section s.

1.1F1F2

The assignment c(g,x):=φg(x) is a Borel U(K)-valued cocycle on G×G/H satisfying the a.e. cocycle law and the local-measure continuity of [F1]; hence [F2] applies and produces a Borel unitary field B and a strongly continuous unitary σ:H→U(K) with φg(x)=B(gx)σ(h(g,x))B(x)−1 for every g and a.e. x.

1.2F2F4

Normalization at eH: if {eH} is μ-null, redefine BeH=I; this changes B on a null set and the factorization remains valid a.e. If {eH} is an atom, replace Bx by BxBeH−1 and σ by BeHσ(⋅)BeH−1, which is a unitary equivalence of representations and makes the new field equal to I at eH. In both cases the factorization holds for every g and a.e. x, and BeH=I.

1.3F2F3

Uniqueness and gauge: if (B1,σ1) and (B2,σ2) both factorize the same cocycle, the uniqueness clause of [F2] gives a single unitary T with σ2(h)T=Tσ1(h) for all h; a Borel gauge change B↦AB multiplies the lifted trivializations on the left and does not change the equivalence class. A change of section changes B by the corresponding σ-factor and leaves the class of σ fixed.

2.1F3step 1.1

Place the formula in strict form: define φ^g(x):=B(gx)σ(h(g,x))B(x)−1; by [step 1.1] φ^g=φg a.e. for every g, and the right-hand side is jointly Borel in (g,x); the strict section identity of [F3] makes φ^ an exact cocycle on all of G×G/H, so replacing the original fields by φ^ changes nothing in the a.e. class and gives the displayed formula for every pair.

3.1F3step 1.2step 2.1

Evaluating the strict formula at x=eH: for h′∈H one has h(h′,eH)=s(eH)−1h′s(eH)=h′, so φh′(eH)=B(eH)σ(h′)B(eH)−1=σ(h′) because BeH=I; and for g=s(x), h(s(x),eH)=s(x)−1s(x)s(eH)=e gives φs(x)(eH)=B(x)σ(e)BeH−1=B(x). Thus the recovered data are exactly σ(h′)=φh′(eH) and Bx=φs(x)(eH).

4.1F3F4step 3.1

Boundary cases: if H=G then G/H is a point, s(eH)=e, and the factorization collapses to φg=Bσ(g)B−1, so σ is unitarily equivalent to the original representation carried by the fields. If H={e} then H is the trivial group and σ is a strongly continuous unitary representation of the trivial group, hence the identity representation on its given fibre K; nothing more is asserted.

5.1step 1.1step 2.1step 3.1step 1.3step 4.1F5F6∎

Steps 1.1, 2.1 and 3.1 give existence of B,σ with the strict factorization and the two evaluation identities; [step 1.3] gives uniqueness up to unitary equivalence and gauge; [step 4.1] gives the two boundary cases. This proves the statement.

Depends on

Used by

Dependency tree · two levels

80 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