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.
The GNS null space is invariant under left translation
Statement
Let be the GNS form on the finitely supported functions , and let . Then is a complex linear subspace, and every left translation maps onto itself. Consequently it induces an invertible map on .
Facts & Assumptions
The GNS form is positive semidefinite and sesquilinear, and every null vector is orthogonal to all finitely supported functions (Positive-type functions define the GNS pre-Hilbert form).
For finitely supported , (Positive-type functions define the GNS pre-Hilbert form).
is a group, so its multiplication and inversion obey the group laws (Topological group: multiplication and inversion are continuous).
Proof
Given: A topological group , a continuous positive-type function , and its GNS form and null set .
For fixed , the support of is , so preserves finite support and is complex-linear. The group law gives , , and .
For finitely supported , [A2] gives Only finitely many terms are nonzero. Substitute and ; then , so the sum becomes . Thus left translation preserves the whole form.
If , [A1] makes all four terms in vanish, and sesquilinearity gives for every . Hence is a complex linear subspace. Step 2.1 implies ; applying it to and using step 1.1 gives . Therefore if , then , so is well-defined on the quotient. Its inverse is induced by , and the identities in step 1.1 descend to the quotient.
Depends on
Used by
Dependency tree · two levels
7 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 and de la Harpe, Unitary Representations of Groups, Duals, and Characters, Construction 1.B.5, Chapter 1 §1.B, printed pp. 27–28 (standard reference, not scraped)
- Bekka, de la Harpe and Valette, Kazhdan's Property (T), Theorem C.4.10, Appendix C §C.4, printed pp. 376–377 (standard reference, not scraped)