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.
Finite-group counting model for induction
Example
Let be finite, , and let be a unitary representation on a complex Hilbert space . Give both groups counting measure and take . The induced Hilbert space consists of functions satisfying , with squared norm . The left action is . This is the published algebraic induced module with its invariant counting inner product.
Facts & Assumptions
Given: The finite groups , the Hilbert space , and the unitary -action .
The algebraic induced module consists of the right--covariant functions with left action (The induced -linear -module as -covariant functions on ).
Verification
Counting measure is left and right invariant on a finite group, so both modular functions are and satisfies the rho covariance. The finite quotient formula is the partition of a finite sum into cosets: . Thus the quotient measure is counting measure, and the general covariance and left action reduce to [F1].
If is replaced by , then , so unitarity makes . The stated norm and inner product are therefore independent of coset representatives.
Left multiplication permutes the finite set , and [F1] shows it preserves the covariance law; reindexing the finite sum proves . The covariant subspace is closed in the complete finite product , so completion adds no vectors. This is exactly the algebraic induced module with the stated invariant inner product. ∎
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
4 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–Valette, Kazhdan’s Property (T), Appendices B and E (standard reference, not scraped)
- Vogan, Unitary induced representations, §§1–4 (standard reference, not scraped)