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 free Weyl algebra obeys time slice
Statement
Assume Countable Choice and Dependent Choice. Let be a Cauchy morphism of Green-data backgrounds: it is an orientation-preserving, time-orientation-preserving isometric embedding with causally convex open image, compatible scalar operators, and image containing a Cauchy hypersurface of . Assume the Green maps and Cauchy uniqueness in Green-hyperbolic free scalar interface. Then the induced algebraic Weyl map is surjective. If the induced symplectic quotient map is injective, then is an isomorphism.
Statement references
Facts & Assumptions
Given: Countable Choice, Dependent Choice, a Cauchy morphism with its Green-data interfaces, and the induced quotient map .
Assume and Dependent Choice, with the exact principles of The Axiom of Countable Choice () and The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain.
Algebraic free Weyl net on Green backgrounds: has formal basis indexed by , and its elements are finite linear combinations of those basis symbols.
Compact test classes localize to a Cauchy neighborhood: every target class has a representative with .
Green morphisms induce algebraic Weyl maps: is a unital -homomorphism; is symplectic.
Proof
Let be any basis generator of . By [F2] there is with . Hence by [F3]. Every element of is a finite linear combination of basis generators by [F1], so every element has a preimage under . This proves surjectivity.
Suppose is injective. If maps to zero, first combine any repeated so the remaining are distinct. Their images are then distinct, and sends the sum to . The latter can be zero only if every , since the are a formal vector-space basis by [F1]. Thus is injective. Together with step 1.1 it is bijective; the inverse of a bijective algebra homomorphism preserves products, the unit and involution, so it is an isomorphism.
Remarks
The Weyl algebra here is the explicit algebraic -algebra of Algebraic free Weyl net on Green backgrounds. No -norm or completion is asserted. Reeh–Schlieder and local factor type remain nonlogical context because their source proof requires an edge-of-the-wedge uniqueness input not supplied by this pair.
Depends on
The Axiom of Countable Choice ()
The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain
Algebraic free Weyl net on Green backgrounds
Green-hyperbolic free scalar interface
Compact test classes localize to a Cauchy neighborhood
Green morphisms induce algebraic Weyl maps
Causal propagator induces the free scalar symplectic quotient