Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedverified 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.

Euclidean Schwinger hierarchies and controlled limit data

Definition

Fix an integer d≥1, write Euclidean space as Ed=R×Rd−1 with coordinates x=(t,x), and put Sd=S(Ed;C) and Sd,n=S(Edn;C) for n≥1, with Sd,0=C. For d=1, R0 is the one-point vector space with unit measure. A Schwinger hierarchy is a sequence S=(Sn)n≥0 with S0=1 and each Sn∈Sd,n′; its moments on elementary tests are ⟨Sn,f1⊗⋯⊗fn⟩. The associated unital algebraic test algebra is Td=⨁n≥0algSd⊗algn with concatenation multiplication, unit 1∈Sd,0=C, and involution (f1⊗⋯⊗fn)∗=f‾n⊗⋯⊗f‾1 and (c1)∗=c‾1. The moments define ωS:Td→C by linear extension. At d=4 this is the same four-dimensional algebra and moment convention used by the positive-tempered-moment definition.

Ordinary moment positivity means ωS(1)=1 and ωS(a∗a)≥0 for every a∈Td. It is distinct from reflection positivity. Let ϑ(t,x)=(−t,x) and Ed,+={(t,x):t>0}. The positive-time polynomial algebra Td,+ is the unital star subalgebra generated by tests in Cc∞(Ed,+;C). Define the antilinear reflection Θ by Θf=f∘ϑ‾ on degree one, Θ(c1)=c‾1, and Θ(ab)=Θ(b)Θ(a). Reflection positivity is ωS(Θa a)∈[0,∞) for every a∈Td,+. For the finite-site version, fix a finite set J, a permutation ρ:J→J with ρ2=id⁡, and a specified subset J+⊆J. Let AJ=C[zj:j∈J] be the commutative polynomial algebra with zj∗=zj and conjugation of coefficients, and let AJ,+ be its unital subalgebra generated by zj for j∈J+. Define ΘJ by conjugating coefficients and replacing every zj by zρ(j). For a specified complex-linear functional ω:AJ→C with ω(1)=1, ordinary positivity means ω(a∗a)∈[0,∞) for all a∈AJ, and reflection positivity means ω((ΘJa)a)∈[0,∞) for all a∈AJ,+. One may also use Q=AJ/I for an ideal I⊆AJ invariant under both ∗ and ΘJ, provided I⊆ker⁡ω:={a∈AJ:ω(a)=0}. Writing [a]=a+I, define [a]∗=[a∗], Θ‾J[a]=[ΘJa], the positive-site algebra Q+={[a]:a∈AJ,+}, and the normalized complex-linear functional ω‾([a])=ω(a). The kernel condition makes this value independent of the representative: if a−b∈I, then ω(a)−ω(b)=ω(a−b)=0. On Q, ordinary positivity means ω‾(u∗u)∈[0,∞) for every u∈Q, and reflection positivity means ω‾((Θ‾Ju)u)∈[0,∞) for every u∈Q+. Equivalently, one may specify a normalized complex-linear functional ω‾ on Q first and set ω(a)=ω‾([a]); this automatically satisfies the kernel condition. An exchanging pair of sites is J={−,+} with ρ(−)=+, ρ(+)=−, and J+={+}.

A regulated hierarchy is a family Sλ=(Snλ)n≥0 indexed by a nonempty directed set (Λ,⪯), where directed means every two indices have a common upper bound. A distributional continuum limit is a hierarchy S such that for every fixed n and every Φ∈Sd,n, ⟨Snλ,Φ⟩→⟨Sn,Φ⟩ as λ advances in Λ. A limit contract records these pairings, the regulator family, and any additional uniform estimates; pointwise-in-n convergence by itself asserts no uniform bound as n varies.

For explicit comparison, define the Schwartz seminorm Pk(Φ)=max⁡∣α∣,∣β∣≤ksup⁡x∈Edn∣xα∂βΦ(x)∣ on Sd,n. A per-order uniform continuity record is a choice, for each fixed n, of rn∈N0 and Cn≥0 such that ∣⟨Snλ,Φ⟩∣≤CnPrn(Φ) for every λ∈Λ and Φ∈Sd,n. Separately, a uniform-order bound on the limit hierarchy is the explicit cross-order condition that there exist fixed s∈N and A,B,q>0 with ∣⟨Sn,Φ⟩∣≤ABn(n!)qPsn(Φ) for every n≥1 and Φ∈Sd,n. This bound is recorded separately and is not inferred from distributional convergence or asserted equivalent to a corrected Osterwalder–Schrader regularity hypothesis.

For γ(x)=Rx+a with R∈O(d) and a∈Ed, define (UγΦ)(x1,…,xn)=Φ(γ−1x1,…,γ−1xn). Euclidean invariance means ⟨Sn,UγΦ⟩=⟨Sn,Φ⟩ for every such γ and Φ∈Sd,n. Permutation symmetry means invariance of the pairing under each permutation of its n argument blocks. Clustering means that for every n,m≥1, f∈Sd,n and g∈Sd,m,

⟨Sn+m,f⊗τae0g⟩⟶⟨Sn,f⟩⟨Sm,g⟩(a→+∞),

where e0=(1,0) and (τae0g)(x1,…,xm)=g(x1−ae0,…,xm−ae0). This contract definition asserts neither existence of a regulated limit nor any of these additional properties.

Remarks

The reflection form, the ordinary positive-moment form, and the clustering limit are three distinct interfaces. Fixed-order distributional convergence can pass a reflection quadratic form; it does not by itself establish clustering or a uniform-order growth bound. The locally defined uniform-order bound above is not asserted equivalent to an Osterwalder–Schrader hypothesis. Any later reconstruction claim must state the exact corrected theorem version and prove its test-space and order-growth hypotheses. This definition does not invoke a reconstruction theorem or assert construction of a null-quotient Hilbert space, positive-time translation semigroup, self-adjoint generator, analytic continuation, locality, or spectrum condition.

Depends on

Dependency tree · 2 levels

Sources