Alphabeta Math
TheoremStatement: 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.

Extreme normalized positive type is equivalent to irreducible GNS

Statement

Assume the Axiom of Choice, let G be a topological group, let φ∈P1(G), and let (πφ,Hφ,ξφ) be its cyclic GNS triple. Then φ is an extreme point of the convex set P1(G) if and only if πφ is irreducible. The complex Hilbert pairing is linear in its first variable.

Facts & Assumptions

Given: AC; a topological group G; a normalized continuous positive-type function φ; its canonical GNS triple; and the library's first-variable- linear complex Hilbert pairing.

[F1]

P(G) is the set of continuous positive-type functions and P1(G)={ψ∈P(G):ψ(e)=1}; multiplying a positive-type function by any nonnegative real scalar preserves positive type by the defining matrix test (Continuous positive-type functions and normalization). The same test proves P1(G) is convex: convex combinations preserve positive semidefiniteness and keep the identity value equal to 1.

[F2]

For a convex set, x is extreme exactly when every expression x=(1−t)y+tz with 0<t<1 and y,z in the set has y=z=x (Extreme point and face).

[F3]

Under AC, the normalized positive-type/pointed-cyclic correspondence identifies φ with its canonical cyclic GNS triple (Normalized positive type and pointed cyclic unitary representations).

[F4]

Under AC, the GNS triple is cyclic, has diagonal coefficient φ, and satisfies ∥ξφ∥2=φ(e); here therefore ∥ξφ∥=1 (GNS construction for a continuous positive-type function).

[F5]

A unitary representation is a homomorphism into bijective complex-linear isometries; a closed linear subspace M is invariant when π(g)M=M for every g; irreducible means that the only such subspaces are {0} and H (Strongly continuous unitary representations, invariant linear subspaces and intertwiners).

[F6]

Under AC, a function 0≤ψ≤φ has a unique bounded self-adjoint commutant operator T with T and I−T positive and ψ(g)=⟨πφ(g)Tξφ,ξφ⟩; conversely such an operator gives a positive-type function dominated by φ (Dominated positive type and positive commutant contractions).

[F7]

For normalized φ and its unit cyclic GNS vector, every strict convex decomposition into distinct members of P1(G) gives a nonscalar positive contraction in πφ(G)′ whose coefficient is the first weighted summand; every nonscalar positive contraction in that commutant gives such a strict decomposition (Nonscalar commutant contractions and convex decompositions).

[F8]

Under AC, every bounded self-intertwiner of an irreducible complex unitary representation is scalar (Schur lemma for complex unitary representations).

[F9]

Under Countable Choice, every vector has a unique decomposition x=m+n with m∈M and n∈M⊥ when M is a closed linear subspace of a Hilbert space (Orthogonal decomposition by a closed subspace).

[F10]

For that decomposition, the orthogonal projection PM is a bounded linear idempotent with range M, kernel M⊥, and PM∗=PM (Hilbert projections are linear, self-adjoint and contractive).

[F11]

M⊥={y:⟨y,m⟩=0 for every m∈M}, and orthogonality is symmetric (Orthogonality and the orthogonal complement).

[F12]

The complex Hilbert pairing is linear in its first variable and conjugate-linear in its second (Real and complex inner-product spaces and their induced length).

[F13]

A self-adjoint bounded operator is positive when its quadratic form is real and nonnegative on every vector (Self-adjoint, positive, unitary and normal operators).

[F14]

AC implies DC and then Countable Choice, whose definition supplies the assumption required in [F9], [F10] and [F13] (The Axiom of Choice, AC implies DC implies countable choice, The Axiom of Countable Choice (ACω)).

Proof

Bekka–de la Harpe–Valette prove the same equivalence in Theorem C.5.2. Their proof decomposes the cyclic vector along a proper invariant subspace in one direction and uses their preceding domination proposition plus Schur's lemma in the other. Here the projection is shown to lie in the commutant and the two checked local positive-contraction lemmas supply the exact convex-splitting and domination statements used below; no later group-C∗ pure-state theorem is needed.

Proof technique: direct.

1.1F1F3F4algebra

For ψ1,ψ2∈P1(G) and r∈[0,1], every test matrix of rψ1+(1−r)ψ2 is a convex combination of positive semidefinite matrices and is therefore positive semidefinite; its value at e is 1. Thus P1(G) is convex by [F1]. The normalized correspondence [F3] identifies the canonical GNS triple as the pointed cyclic class associated with φ, while [F4] gives its coefficient and ∥ξφ∥2=φ(e)=1, so Hφ≠{0}.

1.2F1F2

Suppose πφ is irreducible and write φ=sφ1+(1−s)φ2 with 0<s<1 and φ1,φ2∈P1(G).

1.3F1F6algebra

If φ1=φ2, the convex identity gives φ1=φ2=φ. In the remaining case assume φ1≠φ2. The matrix test in [F1] shows that sφ1 and (1−s)φ2=φ−sφ1 are of positive type, so 0≤sφ1≤φ. By [F6] there is a unique positive contraction T in the commutant with coefficient sφ1.

1.4F4F5F9F10F14

Suppose instead that πφ is reducible. By [F4] its Hilbert space is nonzero, so [F5] supplies a proper nonzero closed invariant linear subspace M⊂Hφ. AC gives Countable Choice by [F14]; apply [F9] and [F10] to obtain the unique orthogonal projection P=PM onto M.

1.5F5F11F12

If y∈M⊥, m∈M, and g∈G, unitarity and invariance give ⟨πφ(g)y,m⟩=⟨y,πφ(g)−1m⟩=0, since πφ(g)−1m∈M. Applying this for g−1 shows πφ(g)M⊥=M⊥.

2.1F2F4F8step 1.3algebra

In the distinct-summand case of step 1.3, T is a bounded self-intertwiner of the irreducible representation, so [F8] gives T=λI. Evaluating its coefficient at e and using ∥ξφ∥=1 gives λ=s; for each g, sφ1(g)=⟨πφ(g)Tξφ,ξφ⟩=sφ(g), so φ1=φ and then φ2=φ, contradicting that case. Together with the equal-summand case in step 1.3, every strict convex decomposition is trivial, and [F2] makes φ extreme.

2.2F9F10F11F12F13F14step 1.5

For x=m+n with m∈M and n∈M⊥, both summands remain in their respective subspaces under πφ(g). Uniqueness in [F9] therefore gives Pπφ(g)x=πφ(g)m=πφ(g)Px for every x,g, so P∈πφ(G)′. From [F10], P=P∗=P2, and I−P is also self-adjoint and idempotent. Orthogonality of Px and (I−P)x gives ⟨Px,x⟩=∥Px∥2≥0 and ⟨(I−P)x,x⟩=∥(I−P)x∥2≥0; thus [F13] makes P and I−P positive.

3.1F2F7F10step 2.2algebra

The projection is nonscalar: if P=λI, idempotence yields λ2=λ, so λ=0 or 1; its range would then be {0} or Hφ, contrary to ran⁡P=M being proper and nonzero. By [F7], this nonscalar positive contraction yields s∈(0,1) and distinct φ1,φ2∈P1(G) with φ=sφ1+(1−s)φ2. The definition [F2] then shows φ is not extreme.

4.1step 1.2step 1.3step 2.1step 1.4step 1.5step 2.2step 3.1

Steps 1.2, 1.3 and 2.1 prove irreducibility implies extremality, and steps 1.4, 1.5, 2.2 and 3.1 prove that reducibility implies non-extremality. These give both implications of the stated equivalence.

5.1F3F4F5F6F7F8F9F10F13F14step 1.4step 1.5step 2.2∎

AC is declared because [F3], [F4], [F6], [F7] and [F8] assume it, and because [F14] supplies Countable Choice for the orthogonal decomposition and projection in [F9] and [F10] and for the positive-operator definition [F13]. After the subspace in [F5] is fixed, the decomposition and projection are unique; the invariant-complement and commutation arguments use no further choice.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

56 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