Alphabeta Math
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-08
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.

Irreducible multiplicity data is not canonical outside type I

Statement refuted

False claim: for every second-countable locally compact group, the irreducible direct-integral data of a representation - the measure class on the unitary dual and the multiplicity function - is canonically determined. Counterexample: let F=⟨a,b⟩ be the free group on two generators, A=⟨a⟩, B=⟨b⟩, and let λF be the left regular representation on ℓ2(F). Then there are two direct integral decompositions into irreducible representations λF≅∫A^⊕Ind⁡AFχ dμ(χ)≅∫B^⊕Ind⁡BFψ dν(ψ), where μ,ν are Haar measures on the compact duals A^,B^≅T, every fibre Ind⁡AFχ and Ind⁡BFψ is irreducible, and Ind⁡AFχ≇Ind⁡BFψ for all (χ,ψ)∈A^×B^. Moreover F is not type I, because L(F) is an infinite-dimensional non-type-I factor (The left regular factor of an ICC discrete group is a non-type-I factor). Hence the two decompositions have disjoint supports in the dual and there is no uniqueness of irreducible multiplicity data: only the central factor decomposition is canonical.

Facts & Assumptions

[F1]

Assume AC. For F=F2=⟨a,b⟩, the infinite cyclic subgroups A=⟨a⟩ and B=⟨b⟩ are self-commensurating and g−1Bg∩A={e} for all g∈F (The Axiom of Choice, The two cyclic basis factors of the rank-two free group are self-commensurating with trivial cross-conjugate intersections).

[F2]

For a subgroup D of a discrete group and a unitary character χ, choose a right transversal T of the left cosets D\F, containing e. Write tg=α(t,g)(t⋅g) with α(t,g)∈D. The monomial representation on ℓ2(T) is (πχ(g)u)(t)=χ(α(t,g))u(t⋅g). It satisfies πχ(t−1)δe=δt, πχ(d)δe=χ(d)δe, and its δe coefficient is χ(g) if g∈D and zero otherwise (Commensurator, unitary characters and monomial induced representations in the transversal model, Matrix-coefficient properties of the transversal model of a monomial representation).

[F3]

Inducing a character from a self-commensurating open subgroup gives an irreducible representation. The inequivalence criterion applies vacuously when all cross intersections have infinite index in the first subgroup (Mackey-Shoda irreducibility criterion for monomial representations, Mackey-Shoda non-equivalence criterion for monomial representations).

[F4]

A constant separable Hilbert field with a countable orthonormal fundamental family is measurable; a field of unitary representations with measurable matrix coefficients integrates by fibrewise action (Measurable Hilbert field from a countable fundamental family, Direct integral of a measurable Hilbert field, Direct integrals of unitary representations).

[F5]

On the probability torus, the characters z↦zn, n∈Z, have integral zero except for n=0, and their span is dense in complex L2 (The one-dimensional torus and its normalized Haar integral, The trigonometric characters are orthonormal in L2 of the torus, The trigonometric system is complete in L2 of the torus). AC supplies their Countable Choice premise (AC implies DC implies countable choice).

[F6]

Two strongly continuous cyclic unitary representations with the same pointed diagonal coefficient are unitarily equivalent (Uniqueness of the pointed cyclic GNS representation). The regular representation has cyclic vector δe and coefficient 1g=e (Left and right regular unitary representations of an LCH group, The regular representations are unitary, strongly continuous, and the left one is faithful).

[F7]

The regular representation of F2 is a non-type-I factor representation (The left regular factor of an ICC discrete group is a non-type-I factor); a type I group has no such separable factor representation (Type I factor representations and type I groups).

Counterexample

Given: AC, the discrete second-countable locally compact group F=F2, and its infinite cyclic free factors A,B.

1.1F1F2F4F5construct

A character of A is uniquely determined by z=χ(a)∈{z∈C:∣z∣=1}, with χ(an)=zn. This identifies A^ with the torus: compact subsets of the discrete cyclic group are finite, so its compact-open character topology is exactly the topology of this evaluation. Transport normalized torus Haar measure to A^; do the same for B and ψ(b). These are standard-Borel probability parameter spaces. A transversal T of A\F is countable. Realize all πz=Ind⁡AFχz on the fixed space ℓ2(T) as in [F2]. For fixed g every basis matrix coefficient is zero or a monomial zn, hence continuous in z. Thus [F4] defines ΠA=∫A^⊕πz dμ(z) on L2(A^;ℓ2(T)). The pointwise group law is exact for every parameter; since F is discrete, the integrated unitary representation is automatically strongly continuous.

2.1F2F4F5step 1.1

The constant section ξ(z)=δe is a unit vector. Its diagonal coefficient at g is the integral of the coefficient in [F2]: it is zero if g∉A, and if g=an it is ∫zn dμ(z)=1n=0. Hence it equals 1g=e. Crucially, ξ is cyclic for the entire integral. Indeed, for every t∈T and n∈Z, the group law and [F2] give ΠA(t−1an)ξ(z)=znδt. The span of these orbit vectors contains every finite sum of Fourier polynomials times coset basis vectors. Such sums are dense: the squared norm is the sum of the scalar-coordinate squared L2 norms, so truncating the countable coset coordinates makes the tail arbitrarily small, and [F5] approximates each of the finitely many remaining coordinates by Fourier polynomials. This proves global cyclicity, without inferring it from fibrewise cyclicity.

3.1F6step 1.1step 2.1

The regular representation and (ΠA,ξ) now have the same diagonal coefficient and cyclic unit vectors, so [F6] gives λF≅ΠA. Repeating steps 1.1 and 2.1 with B gives λF≅∫A^⊕Ind⁡AFχ dμ(χ)≅∫B^⊕Ind⁡BFψ dν(ψ). Both measures are normalized Haar probabilities.

4.1F1F3step 3.1

By self-commensuration in [F1], [F3] makes every fibre in both integrals irreducible. Every intersection g−1Bg∩A is trivial, hence has infinite index in the infinite group A. The cross-family inequivalence hypothesis is therefore vacuous, and [F3] gives Ind⁡AFχ≇Ind⁡BFψ for every pair of parameters. Within one family, distinct characters also give inequivalent fibres: if the intersection g−1Ag∩A has finite index in both groups, self-commensuration forces g∈A; conjugation then fixes every character of the abelian A, and different characters differ on A. The same inequivalence criterion applies, and similarly for B. Thus each model has multiplicity one on its own irreducible classes, and the two sets of classes are disjoint.

5.1F7step 3.1step 4.1∎

No removal of null parameter sets, change of measure within its class, or parameter identification can match the irreducible fibres of these two probability models: every cross pair is inequivalent by step 4.1. This refutes canonical irreducible measure-class/multiplicity data. No standard-Borel structure on the full dual F^ is being assumed; the two models already use standard-Borel circles and disjoint images among irreducible classes. Moreover [F7] proves that F is not type I. In this example the central factor datum remains the one-point non-irreducible regular factor of [F7]; the two irreducible disintegrations are not central diagonalizations. Hence the uniqueness appropriate to central factor decompositions cannot be transferred to irreducible multiplicity data outside type I.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

147 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