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 universal Weyl C*-algebra
Definition
Assume Countable Choice. Let be a finite-dimensional real symplectic vector space and let . Regard the additive group underlying as discrete for this construction, and define Let be the complex vector space of finitely supported functions on , with basis and unit . Define and extend multiplication bilinearly and the involution conjugate-linearly. Here a linear functional is positive unital if for every and . Put , equip with and let be left multiplication on the Hilbert completion of this quotient. The lemma The universal Weyl norm is finite and has the C*-completion property ↗ verifies that these quotients and representations are well-defined. Define the universal C*-seminorm and completion by The lemma The universal Weyl norm is finite and has the C*-completion property ↗ proves that the twisted algebra and GNS representations are well-defined, the seminorm is finite and nonzero, and the completion is universal for unitary generators with the displayed Weyl relations. Countable Choice is included through the Hilbert completions in that construction.
Remarks
The universal algebra is built from bounded unitary symbols and treats the underlying additive group as discrete. It does not impose strong continuity on ; regularity is a property of a representation. It is distinct from the polynomial Weyl quotient of Polynomial Weyl algebra and its central parameter, whose generators are polynomial and whose definition has no C*-norm or topology. The local descriptions here state the distinction; the PA-07 item is not treated as an accepted dependency.
Depends on
Used by
Dependency tree · two levels
24 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
- Christopher J. Fewster and Kasia Rejzner, Algebraic Quantum Field Theory—an introduction, arXiv:1904.04051v2 (standard reference, not scraped)
- Amritanshu Prasad, An Easy Proof of the Stone-von Neumann-Mackey Theorem (standard reference, not scraped)