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

Dominated positive type and positive commutant contractions

Statement

Assume the Axiom of Choice. Let G be a topological group, let 0≤ψ≤φ in P(G), and let (πφ,Hφ,ξφ) be the cyclic GNS triple of φ. There is a unique bounded linear operator T∈B(Hφ) such that T=T∗, both T and I−T are positive, T∈πφ(G)′, and ψ(g)=⟨πφ(g)Tξφ,ξφ⟩(g∈G). Conversely, every bounded self-adjoint T∈πφ(G)′ for which T and I−T are positive defines a continuous function ψT(g)=⟨πφ(g)Tξφ,ξφ⟩ of positive type with 0≤ψT≤φ. Here positive means that the quadratic form u↦⟨Tu,u⟩ is real and nonnegative, as in the positive operator definition.

Facts & Assumptions

Given: AC; a topological group G; 0≤ψ≤φ in P(G); the first-variable-linear Hilbert pairing; and the GNS triple of φ.

[F1]

The relation 0≤ψ≤φ means that ψ and φ−ψ are continuous functions of positive type (Continuous positive-type functions and normalization).

[F2]

The GNS space is the Hilbert completion of the quotient by the null space of the form Bφ, the point-mass formula is Bφ(δx,δy)=φ(y−1x), and the canonical vector is cyclic with πφ(g)ξφ represented by δg (Positive-type functions define the GNS pre-Hilbert form, GNS construction for a continuous positive-type function).

[F3]

On a complex Hilbert space with the first-variable-linear convention, every bounded linear functional F has a unique representing vector y with F(v)=⟨v,y⟩; the theorem assumes Countable Choice (Riesz representation for Hilbert spaces).

[F4]

Cauchy–Schwarz holds on every real or complex inner-product space (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs). The quotient of finitely supported functions by the null space of Bψ is an inner-product space (Positive-type functions define the GNS pre-Hilbert form).

Proof

Bekka–de la Harpe–Valette's Proposition C.5.1 proves the related domination estimate and constructs an intertwiner into the GNS space of a dominated function. The argument below derives the precise positive-commutant-operator correspondence directly from the dominated sesquilinear form, including uniqueness.

Proof technique: direct.

1.1F1F2

For η∈{ψ,φ−ψ,φ} let Bη(f,h)=∑x,yf(x)h(y)‾η(y−1x) on finitely supported functions. By [F1] and Positive-type functions define the GNS pre-Hilbert form, these are Hermitian positive-semidefinite forms, and Bφ=Bψ+Bφ−ψ. Thus 0≤Bψ(f,f)≤Bφ(f,f).

1.2F2F4

The form Bψ induces an inner product on the quotient by its null space, so Cauchy–Schwarz there gives ∣Bψ(f,h)∣2≤Bψ(f,f)Bψ(h,h) for all finitely supported f,h, including null vectors.

1.3F1F2F5

Conversely, let T satisfy the stated positive-contraction and commutant conditions, and put ψT(g)=⟨πφ(g)Tξφ,ξφ⟩. For a finite list g1,…,gn and scalars c1,…,cn, set u=∑jcjπφ(gj)ξφ. Commutation and unitarity give ∑i,jci‾cjψT(gi−1gj)=⟨Tu,u⟩≥0. Thus ψT is positive type; the same calculation with I−T shows that φ−ψT is positive type. Strong continuity and the matrix coefficient definition make both functions continuous, so 0≤ψT≤φ.

2.1F1F2step 1.2

Let D=span⁡C{πφ(g)ξφ:g∈G}. Identify a finite sum of orbit vectors with the corresponding quotient class [f]∈C(G)/Nφ. Define b0([f],[h])=Bψ(f,h). If [f]=0, then Bφ(f,f)=0, so [F1] gives Bψ(f,f)=0; by step 1.2, Bψ(f,h)=0 for every h. Hermitian symmetry gives independence in the second variable as well. Hence b0 is well-defined on D. If φ=0, this also gives Bψ(δg,δe)=ψ(g)=0 for every g, and the quotient is zero.

2.2F2step 1.1step 1.2

For u=[f],v=[h]∈D, steps 1.1–1.2 give 0≤b0(u,u)≤∥u∥2,∣b0(u,v)∣≤∥u∥ ∥v∥. Since D is dense in Hφ, this bound extends b0 uniquely to a continuous Hermitian sesquilinear form b on Hφ×Hφ, still satisfying 0≤b(u,u)≤∥u∥2.

3.1F3F5step 2.2

Fix u∈Hφ. The map v↦b(u,v)‾ is a bounded linear functional of norm at most ∥u∥. By [F3] there is a unique Tu with b(u,v)‾=⟨v,Tu⟩, equivalently b(u,v)=⟨Tu,v⟩. Uniqueness of representing vectors and linearity of b in its first argument show that u↦Tu is linear; the norm bound gives ∥Tu∥≤∥u∥, so T is bounded.

4.1F5step 2.2step 3.1

Hermitian symmetry gives ⟨Tu,v⟩=⟨u,Tv⟩ for all u,v, so T=T∗ by uniqueness of the Hilbert adjoint. Also ⟨Tu,u⟩=b(u,u)≥0 and ⟨(I−T)u,u⟩=∥u∥2−b(u,u)≥0. Thus T and I−T are positive.

4.2F2F5step 3.1

For k∈G, simultaneous left translation leaves each kernel entry ψ(h−1g) unchanged, since (kh)−1(kg)=h−1g. Hence b(πφ(k)u,πφ(k)v)=b(u,v) first on D and then on all of Hφ by continuity. Using b(u,v)=⟨Tu,v⟩ and unitarity, this identity gives ⟨πφ(k)−1Tπφ(k)u,v⟩=⟨Tu,v⟩ for all u,v. Therefore Tπφ(k)=πφ(k)T, so T∈πφ(G)′.

5.1F2step 3.1step 4.2

On point masses, the form formula gives b(πφ(g)ξφ,ξφ)=Bψ(δg,δe)=ψ(g). Since T commutes with πφ(g), this is ⟨πφ(g)Tξφ,ξφ⟩.

6.1F2F5step 4.2step 5.1

Suppose S is another bounded operator in the commutant with the same coefficient. For all g,h∈G, commutation and unitarity give ⟨Sπφ(g)ξφ,πφ(h)ξφ⟩=⟨Sπφ(h−1g)ξφ,ξφ⟩=ψ(h−1g). The same identity holds for T. The orbit vectors span the dense subspace D, so boundedness and continuity imply ⟨(S−T)u,v⟩=0 for all u,v∈Hφ, whence S=T. This proves uniqueness, including the zero space.

7.1F3F5F6step 3.1∎

AC is used to infer Countable Choice for the GNS completion and bounded extensions and for the Riesz representation in step 3.1; it also satisfies the hypotheses of the adjoint and positive-operator definitions. The finite form calculations, extension from the specified dense orbit span, uniqueness, and converse matrix tests use no further choice.

Depends on

Used by

Dependency tree · two levels

50 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