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.
Continuous convolution operators are Hilbert–Schmidt
Statement
Assume the Axiom of Choice. Let be a compact Lie group with normalized Haar measure and let . Then has the square-integrable kernel on , is Hilbert–Schmidt with , and is compact.
Facts & Assumptions
Given: Assume the Axiom of Choice, a compact Lie group with normalized Haar measure , and .
The Axiom of Choice is The Axiom of Choice; it enters through the Haar measure and the Hilbert–Schmidt theory cited.
defines a bounded operator on , and is continuous (Convolution operators).
If is a kernel class, the associated operator on is Hilbert–Schmidt with ; Hilbert–Schmidt operators are compact (L two kernels give Hilbert–Schmidt operators, Hilbert–Schmidt operators are compact).
Fubini's theorem identifies the product integral of an integrable function on two sigma-finite measure spaces with either iterated integral (Fubini's theorem for L^1 functions on a sigma-finite product), and Haar measure is translation invariant (Haar integration is translation and conjugation invariant).
Proof
The kernel is continuous on the compact product by [L1], hence bounded and measurable; its squared modulus is integrable, and by Fubini and translation invariance .
The operator with kernel is by [L1], so by [L2] the operator is Hilbert–Schmidt with and is compact.
Depends on
Used by
Dependency tree · two levels
61 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)
- Anthony W. Knapp, Lie Groups Beyond an Introduction, 2nd ed. (standard reference, not scraped)