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.
Translation estimates for continuous positive type functions
Statement
Let be a topological group and let be a continuous function of positive type on with (Continuous positive-type functions and normalization). Let be a GNS triple for , so that is a strongly continuous unitary representation on the complex Hilbert space (Hilbert space) and (Matrix coefficient of a unitary representation). Then for all :
- ;
- ;
- ;
- if , then .
Facts & Assumptions
Given: a topological group ; a continuous positive-type function with ; a GNS triple with and .
The pairing is linear in the first argument, conjugate-linear in the second, , and (The induced length is a norm, Hilbert space).
Cauchy–Schwarz gives (Cauchy–Schwarz: , with equality exactly for dependent pairs).
Each is unitary, so , and is a homomorphism (Matrix coefficient of a unitary representation).
Proof
Given: a topological group , a positive-type function with GNS triple as in the statement, and .
For every one has : expanding the squared norm with [A1], unitarity gives , and . This is claim 3 with .
For claim 1, unitarity gives , so ; Cauchy–Schwarz and give , and step 1.1 with turns into , hence the second bound with in place of .
For claim 2, , so Cauchy–Schwarz gives ; squaring and using step 1.1 with and gives .
For claim 4 assume . Since , the triangle inequality and give ; substituting from step 1.1 and yields , which is claim 4.
Depends on
Used by
Dependency tree · two levels
20 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
- Bachir Bekka, Pierre de la Harpe and Alain Valette, Kazhdan's Property (T) (Cambridge University Press 2008; author-hosted complete text) (standard reference, not scraped)
- Bachir Bekka and Pierre de la Harpe, Unitary Representations of Groups, Duals, and Characters (arXiv:1912.07262v1, 16 December 2019) (standard reference, not scraped)