Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)
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.

Green morphisms induce algebraic Weyl maps

Statement

Assume Countable Choice and let ι:U→M be an admissible Green-background morphism of Algebraic free Weyl net on Green backgrounds, with Green data of Green-hyperbolic free scalar interface. The extension map [f]↦[ι∗f] is a well-defined real symplectic linear map Sι:V(U)→V(M). The generator assignment WU(v)↦WM(Sιv) extends to a unital ∗-homomorphism αι:W(U)→W(M), and identity and composition of admissible embeddings are preserved. For every open O⊆U, the map also sends WU(O) into WM(im⁡(ι∣O)).

Functoriality diagram

For composable admissible embeddings, the two paths send each generator WM1(v) to WM3(Sȷ∘ιv); the equality is checked algebraically below, independently of the diagram.

W(M1)W(M2)W(M3)®®|±®|

Facts & Assumptions

Given: Green-data backgrounds U,M, an admissible embedding ι:U→M, and real test functions f,h on U.

[A1]

Assume Countable Choice as stated in The Axiom of Countable Choice (ACω) for the time-oriented Lorentzian background data.

[F1]

Green-hyperbolic free scalar interface: E± obey PE±f=E±Pf=f, have respectively future and past causal support. The definition supplies formal self-adjointness but does not assert Green-map uniqueness; the needed uniqueness is proved below.

[F2]

Causal propagator induces the free scalar symplectic quotient: V(M)=Dg(M)/PDg(M) carries the well-defined symplectic form σM([f],[h])=∫Mf(EMh) μgM, and likewise on U.

[F3]

Algebraic free Weyl net on Green backgrounds: W(v)W(w)=e−iσ(v,w)/2W(v+w), W(v)∗=W(−v), and W(0) is the unit.

[F4]

Algebraic free Weyl net on Green backgrounds: an admissible embedding is causally convex, isometric, preserves orientation and time orientation, and intertwines the scalar operators; its test map is extension by zero.

[F5]

Compactness of closed advanced-retarded support overlaps under Countable Choice: the closed overlap of a future-supported smooth function over a compact set and a past-supported smooth function over a compact set is compact under Countable Choice.

[F6]

A manifold bump for a compact set inside an open set supplies a compactly supported smooth cutoff equal to one near such an overlap.

Proof

1.1F2F3algebra

First the displayed Weyl relations define an associative unital ∗-algebra on the finite formal sums. For v,w,z∈V(M), the exponent in (W(v)W(w))W(z) is −i2(σ(v,w)+σ(v+w,z)), whereas the exponent in W(v)(W(w)W(z)) is −i2(σ(w,z)+σ(v,w+z)); bilinearity makes these equal. Also W(0)W(v)=W(v)=W(v)W(0) since σ(0,v)=σ(v,0)=0, and W(v)W(−v)=W(0) since σ(v,−v)=0. The involution reverses products because alternation gives σ(w,v)=−σ(v,w); hence the relations are consistent with the claimed unit and involution.

1.2A1F1F2F4F5F6givenalgebra

Put Sι[f]:=[ι∗f]. It is well-defined because ι∗(PUk)=PM(ι∗k) by [F4], so changing f by an element of PUDg(U) changes ι∗f by an element of PMDg(M). For f∈Dg(U), the restriction u=(EM±ι∗f)∣U solves PUu=f. Its support lies in JM±(supp⁡f)∩U=JU±(supp⁡f): the inclusion from right to left is immediate, and the reverse follows because a causal curve in M from a point of supp⁡f⊂U to a point of U remains in U by causal convexity [F4]. Here is the uniqueness argument actually needed. If w is the difference of u and EU+f, then PUw=0 and supp⁡w⊆JU+(supp⁡f). For any compact smooth real h on U, set v=EU−h. The closed overlap of their supports is compact by [F5]. A compact cutoff η=1 near that overlap from [F6] gives ∫Uwh μg=∫UwPv μg=∫U(Pw)v μg=0: apply formal self-adjointness first to ηw and v; every commutator term has a derivative of η where both supports meet and hence vanishes. A smooth nonzero real w has a small fixed-sign coordinate neighborhood and a nonnegative test bump there, contradicting this vanishing integral. Thus w=0. The advanced case interchanges the signs. Hence u=EU±f without presupposing uniqueness in the definition. The isometry preserves μg, so this compatibility gives σM(Sι[f],Sι[h])=∫Uf(EUh) μgU=σU([f],[h]); thus Sι is symplectic.

2.1F2F3F4step 1.2givenalgebra∎

Define αι on each basis symbol by αι(WU(v))=WM(Sιv) and extend complex-linearly to finite sums. Since Sι is symplectic, applying αι to the product in [F3] gives e−iσU(v,w)/2WM(Sι(v+w))=WM(Sιv)WM(Sιw); applying it to WU(v)∗ gives WM(−Sιv)=WM(Sιv)∗. It also sends WU(0) to WM(0), so it is a unital ∗-homomorphism. If f is supported in an open O⊆U, then ι∗f is supported in im⁡(ι∣O); therefore the generator formula sends each local generator into WM(im⁡(ι∣O)), and sums and products do too. Extension by zero respects identity and composition, hence the generator formula gives αid=id and αȷ∘ι=αȷ∘αι.

Depends on

Dependency tree · 2 levels

Sources