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.
Convolution operators
Definition
Assume the Axiom of Choice. Let be a compact Lie group with normalized Haar measure , and let be the complex Hilbert space of the left and right regular representations (Left and right regular representations on L2(G)). For a continuous function the convolution operator with kernel is This is the right-convolution convention fixed for the whole page. The integral converges absolutely for every by Cauchy–Schwarz, because is bounded and has finite measure, and is a well-defined element of : the bound is proved together with the Hilbert–Schmidt property on this page. The assignment is linear, so is a bounded linear operator on with and also .
The right translate and left translate of a kernel are and the adjoint kernel is .
Remarks
- The convention makes the operator associated with right translation of the argument: after the substitution and use of left invariance of Haar measure, In general this is not ; that expression uses the inverted kernel and agrees with this convention only under an additional inversion symmetry of .
- The kernel of is continuous on ; it is the kernel whose square-integrability is proved on this page.
- Convolution is commutative on central functions, and for central the operator commutes with both regular actions; this is used in the approximate-identity and Peter–Weyl arguments.
Depends on
Used by
Dependency tree · two levels
12 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
- Anthony W. Knapp, Lie Groups Beyond an Introduction, 2nd ed. (standard reference, not scraped)
- Brian Conrad and Aaron Landesman, Compact Lie Groups (standard reference, not scraped)