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 be a topological group, let , and let be its cyclic GNS triple. Then is an extreme point of the convex set if and only if is irreducible. The complex Hilbert pairing is linear in its first variable.
Facts & Assumptions
Given: AC; a topological group ; a normalized continuous positive-type function ; its canonical GNS triple; and the library's first-variable- linear complex Hilbert pairing.
is the set of continuous positive-type functions and ; 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 is convex: convex combinations preserve positive semidefiniteness and keep the identity value equal to .
For a convex set, is extreme exactly when every expression with and in the set has (Extreme point and face).
Under AC, the normalized positive-type/pointed-cyclic correspondence identifies with its canonical cyclic GNS triple (Normalized positive type and pointed cyclic unitary representations).
Under AC, the GNS triple is cyclic, has diagonal coefficient , and satisfies ; here therefore (GNS construction for a continuous positive-type function).
A unitary representation is a homomorphism into bijective complex-linear isometries; a closed linear subspace is invariant when for every ; irreducible means that the only such subspaces are and (Strongly continuous unitary representations, invariant linear subspaces and intertwiners).
Under AC, a function has a unique bounded self-adjoint commutant operator with and positive and ; conversely such an operator gives a positive-type function dominated by (Dominated positive type and positive commutant contractions).
For normalized and its unit cyclic GNS vector, every strict convex decomposition into distinct members of gives a nonscalar positive contraction in 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).
Under AC, every bounded self-intertwiner of an irreducible complex unitary representation is scalar (Schur lemma for complex unitary representations).
Under Countable Choice, every vector has a unique decomposition with and when is a closed linear subspace of a Hilbert space (Orthogonal decomposition by a closed subspace).
For that decomposition, the orthogonal projection is a bounded linear idempotent with range , kernel , and (Hilbert projections are linear, self-adjoint and contractive).
, and orthogonality is symmetric (Orthogonality and the orthogonal complement).
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).
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).
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 ()).
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- pure-state theorem is needed.
Proof technique: direct.
For and , every test matrix of is a convex combination of positive semidefinite matrices and is therefore positive semidefinite; its value at is . Thus 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 , so .
Suppose is irreducible and write with and .
If , the convex identity gives . In the remaining case assume . The matrix test in [F1] shows that and are of positive type, so . By [F6] there is a unique positive contraction in the commutant with coefficient .
Suppose instead that is reducible. By [F4] its Hilbert space is nonzero, so [F5] supplies a proper nonzero closed invariant linear subspace . AC gives Countable Choice by [F14]; apply [F9] and [F10] to obtain the unique orthogonal projection onto .
If , , and , unitarity and invariance give , since . Applying this for shows .
In the distinct-summand case of step 1.3, is a bounded self-intertwiner of the irreducible representation, so [F8] gives . Evaluating its coefficient at and using gives ; for each , , so and then , contradicting that case. Together with the equal-summand case in step 1.3, every strict convex decomposition is trivial, and [F2] makes extreme.
For with and , both summands remain in their respective subspaces under . Uniqueness in [F9] therefore gives for every , so . From [F10], , and is also self-adjoint and idempotent. Orthogonality of and gives and ; thus [F13] makes and positive.
The projection is nonscalar: if , idempotence yields , so or ; its range would then be or , contrary to being proper and nonzero. By [F7], this nonscalar positive contraction yields and distinct with . The definition [F2] then shows is not extreme.
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.
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
- Normalized positive type and pointed cyclic unitary representations
- The Axiom of Choice
- Continuous positive-type functions and normalization
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Extreme point and face
- Orthogonality and the orthogonal complement
- Real and complex inner-product spaces and their induced length
- Self-adjoint, positive, unitary and normal operators
- Strongly continuous unitary representations, invariant linear subspaces and intertwiners
- Dominated positive type and positive commutant contractions
- Nonscalar commutant contractions and convex decompositions
- Hilbert projections are linear, self-adjoint and contractive
- AC implies DC implies countable choice
- GNS construction for a continuous positive-type function
- Orthogonal decomposition by a closed subspace
- Schur lemma for complex unitary representations
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
- Bekka, de la Harpe and Valette, Kazhdan's Property (T), Theorem C.5.2 and complete proof (standard reference, not scraped)
- Bekka, de la Harpe and Valette, Kazhdan's Property (T), Proposition C.5.1 and complete proof (standard reference, not scraped)