Alphabeta Math
PropositionStatement: 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.

Smooth Hadamard changes intertwine the polynomial microcausal products

Statement

Assume ACω. Let W,W′∈D′(M×M) be scalar Hadamard bisolutions for the same (M,g,P) and the same positive-frequency null relation, with W−WT=W′−W′T=iE for one fixed distribution E. Then K:=W′−W is a smooth symmetric function on M×M. For every compactly supported polynomial microcausal functional F, define ΓKF(ϕ)=⟨F(2)(ϕ),χKμg⊗2⟩,αK=exp⁡ ⁣(ℏ2ΓK)=∑j≥0(ℏ/2)jj!ΓKj. Here χ is any compactly supported cutoff equal to one near the compact support of F(2)(ϕ), and μg is the metric density. The sum is finite on each F, αK is bijective with inverse α−K, and, coefficientwise in the formal parameter ℏ, αK(F⋆WG)=αKF⋆W′αKG for all F,G∈Fμcpoly(M). No existence of W or W′ is asserted.

Facts & Assumptions

Given: ACω, the manifold and operator conventions of Wavefront and positive-frequency Hadamard data, Hadamard bisolutions W,W′, and F,G∈Fμcpoly(M).

[A1]

Assume only Countable Choice ACω for the wavefront pullback and product estimates (The Axiom of Countable Choice (ACω)).

[F1]

A Hadamard bisolution has WF⁡(W)=WF⁡(W′)=Cg+, with future-null first covector and its negative transported second covector; transpose exchanges this set with the past-frequency relation (Wavefront and positive-frequency Hadamard data).

[F2]

For distributions, WF⁡(u+v)⊆WF⁡(u)∪WF⁡(v), WF⁡(τ∗u)=τ∗WF⁡(u), and an empty wavefront set is equivalent to smoothness (Wavefront sets are invariant under smooth coordinate changes).

[F3]

Hadamard contractions on the stated compactly supported polynomial microcausal class are defined coefficientwise and preserve that class; the conormal product and pullback rules they use are proved in Product and pullback under wavefront transversality (Hadamard contractions preserve microcausal polynomial functionals).

[F4]

On X=Rd, the regular polynomial contraction product for an arbitrary bidistribution W is associative (Regular Wick-star contractions are well defined and associative). Its interface is restricted to smooth compact coefficient kernels.

[F5]

On the same regular polynomial class, for symmetric continuous K, αK=exp⁡((η/2)ΓK) is finite and satisfies αK(F⋆WG)=αKF⋆W+KαKG (Regular normal-ordering change is an exact star isomorphism). Its identity is the finite contraction/binomial formula; the local proof below checks that formula on distributional microcausal coefficients.

[F6]

The actual two-original-vertex matchings with singular W cross edges and smooth K self/cross edges satisfy simultaneous and every intermediate transversality condition. Their canonical products, compact integrations, slot permutations and finite derivatives commute in the stated sense. This does not assert a singular self-contraction ΓW. Canonical compatibility of microcausal cross contractions and smooth self contractions

Proof

Given: [A1] and [F1]–[F6].

1.1A1F1F2givenalgebra

Define Cg−:=τ∗Cg+, where τ(x,y)=(y,x); its first covectors are past-directed. Put K=W′−W. The common antisymmetric part gives K−KT=0, so K is symmetric. By [F1]–[F2], WF⁡(K)⊆WF⁡(W)∪WF⁡(W′)=Cg+. Symmetry also gives WF⁡(K)=τ∗WF⁡(K)⊆Cg−. A nonzero null covector cannot be both future and past, so Cg+∩Cg−=∅ and WF⁡(K)=∅. By [F2], K is smooth.

1.2F3algebra

By [F3], ΓK is defined on the class and preserves microcausality. On a polynomial of degree d, ΓKjF=0 for 2j>d, so αKF and α−KF are finite sums. The coefficient of ΓKq in either composition is multiplied by ∑j=0q(qj)(−1)q−j=(1−1)q, which is zero for q>0 and one for q=0. Hence αKα−K=α−KαK=I.

1.3A1F3F4F5F6algebra

On the regular polynomial subspace of a Euclidean chart, [F4]–[F5] fix the contraction ordering and the factor ℏ/2. For the general class, label the two functional arguments by 1,2 and define DL(F⊗G) by multiplying their first derivative distributions by L and integrating the contracted pair with μg⊗2. Let ΓK(1) and ΓK(2) contract two derivative slots within the first and second arguments using the same density. The finite Leibniz expansion of the second derivative gives ΓK∘m=m∘(ΓK(1)+ΓK(2)+2DK), where m is pointwise multiplication. The factor 2 consists of the two cross terms, equal because K is symmetric. Every term is defined by [F3] and is the canonical labelled matching of [F6]. Its two smooth cross terms are equal by the proved slot-permutation rule and symmetry of K, without extending the regular coefficient-kernel topology to singular inputs.

2.1F3F6step 1.2step 1.3algebra∎

Expand each coefficient into its original F and G kernel slots. Every DW edge joins the first original block to the second; every additional edge from ΓK(1), ΓK(2) or DK is smooth. Each derivative slot is removed at most once. Hence [F6] proves the full matching and every intermediate product/pushforward are admissible and independent of edge order. Finite Leibniz and permutation identities count exactly the same labelled matchings in either order. Thus these operators commute on the coefficient expressions used here, and the binomial exponential law is a finite polynomial identity in commuting degree-lowering operations. It makes no assertion about a singular ΓW on one microcausal functional. Finite polynomial degree makes every coefficient sum finite. Thus αK(F⋆WG)=m eℏ2(ΓK(1)+ΓK(2)+2DK)eℏDW(F⊗G)=m eℏ2(ΓK(1)+ΓK(2))eℏDW+K(F⊗G)=αKF⋆W+KαKG. Here DW+K=DW+DK by bilinearity and W+K=W′. These are coefficientwise identities of finite sums, not analytic convergence claims. Together with step 1.2 this proves the stated intertwiner and bijectivity.

Depends on

Dependency tree · 2 levels

Sources