Alphabeta Math
DefinitionDefinition: AI-adaptedProof: AI-generatedPipeline-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.

Formal scaling and renormalization cocycle

Definition

Assume Countable Choice.

Let M=R4 have Minkowski metric η=diag⁡(−1,1,1,1). A scalar local polynomial functional is a finite sum F(ϕ)=c+∑j=1N∫Mfj(x)Pj(jsjϕ(x)) d4x, where N is a finite nonnegative integer, ϕ∈C∞(M;R), c∈C, and fj∈Cc∞(M;C). For a finite integer sj≥0, the sj-jet is jsjϕ(x)=(∂αϕ(x))α∈{0,1,2,…}4, ∣α∣≤sj; each Pj is a complex polynomial in these finitely many jet coordinates. This is the local functional class used by the supplied scalar time-ordered system.

For every mass label m≥0, suppose a normalized scalar time-ordered system Tn(m) with the same local scalar contract is supplied. Define its coefficientwise formal S-map by Sm(V)=∑n=0∞1n!Tn(m)(V,…,V),T0(m)=1,T1(m)=id⁡. The series is formal in the interaction degree; no analytic convergence is asserted.

Use units c=ℏ=1, so the mass label m has mass dimension one. The scale parameter ρ>0 is dimensionless. On scalar field configurations put (Cρϕ)(x)=ρ−1ϕ(ρ−1x), the engineering scaling of a four-dimensional scalar field. For a mass-indexed family of functionals F=(Fm)m≥0, define (σρF)m=Cρ∗Fρ−1m,(Cρ∗F)(ϕ)=F(Cρ−1ϕ). Thus the component at mass m is pulled back from the component at mass ρ−1m; equivalently the mass label scales as m↦ρm. If A=(Am)m≥0 is instead a family of maps from local functionals (or their formal series) to local or microcausal functionals (or their formal series), define its induced scale conjugate, denoted σρAσρ−1, by (σρAσρ−1)m=Cρ∗∘Aρ−1m∘(Cρ∗)−1,(Cρ∗)−1=Cρ−1∗. Here the rightmost pullback acts on the input, the leftmost pullback acts on every output coefficient, and formal indeterminates are fixed. In particular the mass-m component of the scale-conjugated formal S-map is (σρSσρ−1)m=Cρ∗∘Sρ−1m∘(Cρ∗)−1. These functional and map actions are extended coefficientwise to formal series. They obey σ1=id⁡ and σρτ=σρστ; the dilation sends compact supports to compact supports and normalizes the proper orthochronous Poincare action.

For m≥0, ρ>0 and each n≥0, define the conjugated sequence of multilinear maps componentwise by Tn,ρ′(m)(F1,…,Fn):=Cρ∗ ⁣[Tn(ρ−1m)((Cρ∗)−1F1,…,(Cρ∗)−1Fn)]. For n=0 this means T0,ρ′(m)=Cρ∗1=1; for n=1 it gives T1,ρ′(m)=id⁡. Assume for every m≥0 and ρ>0 that this sequence, as well as the supplied sequence (Tn(m))n≥0, satisfies the normalized local scalar time-ordered-system contract for the same free data at mass m, after transporting the free data at mass ρ−1m by the stated pullback. This is the scale-admissibility condition on the sequences. Their formal S-maps are distinct objects: by multilinearity and coefficientwise pullback, the S-map of (Tn,ρ′(m))n≥0 is exactly (σρSσρ−1)m displayed above. Define Zρ=(Zρ,m)m≥0 by the componentwise equations Cρ∗∘Sρ−1m∘(Cρ∗)−1=Sm∘Zρ,m(m≥0), where each Zρ,m is the unique formal local map with identity linear term, supplied by the finite-renormalization comparison proposition under these hypotheses. The notation Zρ,m(V)=V+O(V2) means that all terms after the linear term have interaction degree at least two. This is a conditional definition: no existence of a time-ordered system for any particular model is asserted.

Facts & Assumptions

Given: Countable Choice, the mass-indexed normalized systems, and the scale-admissibility condition in the Definition.

[A1]

Assume Countable Choice The Axiom of Countable Choice (ACω) for the supplied scalar contraction contract and the given-systems comparison result. No new arbitrary graph extension is chosen in this scale-action construction.

[F1]

Local scalar time-ordered product contract: a scalar time-ordered system is a sequence of symmetric maps on compactly supported finite-jet polynomial functionals of a smooth real scalar field, with T0=1, T1=id⁡, and the stated causal, covariance, scaling, and formal unitarity conditions.

[F2]

Renormalization maps form a formal composition group: for two systems satisfying that contract for the same free data and first-order normalization, there is a unique formal local map Z(V)=V+O(V2) with S′=S∘Z; these maps preserve support and scalar Poincare covariance.

[F3]

Local scalar time-ordered product contract: for γ=(a,Λ) in the proper orthochronous Poincare group, (γ⋅ϕ)(x)=ϕ(Λ−1(x−a)) and (γ⋅F)(ϕ)=F(γ−1⋅ϕ).

[F4]

Local scalar time-ordered product contract: the time-ordered maps are equivariant under this action, as expressed by the covariance condition in its Definition.

Proof

technique · direct verification of the scaling action and conditional well-definedness

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

1.1givenF1F3F4algebra

Direct substitution gives CρCτϕ(x)=(ρτ)−1ϕ((ρτ)−1x)=Cρτϕ(x). Repeated chain rule gives ∂α(Cρϕ)(x)=ρ−1−∣α∣(∂αϕ)(ρ−1x), so field substitution preserves finite polynomial jets; positive dilations also send compact coefficient supports to compact sets. Thus the induced functional pullback preserves the local polynomial class and has inverse Cρ−1∗. The mass relabelling composes as τ−1ρ−1m=(ρτ)−1m, including m=0, so the functional action obeys σρτ=σρστ and σρ−1 is its inverse. The induced conjugations on map families obey the same composition law, because the pullbacks compose as Cρ∗Cτ∗=Cρτ∗ and the mass labels reindex in that same order. For Taϕ(x)=ϕ(x−a), direct substitution gives CρTaCρ−1=Tρa; scalar dilations commute with each Lorentz transformation. By [F3] this action normalizes the proper orthochronous Poincare group, and by [F4] conjugation preserves covariance of the time-ordered system.

2.1A1F1F2step 1.1

The displayed componentwise definition gives symmetric multilinear maps Tn,ρ′(m), and summing their diagonal values with coefficients 1/n! gives Cρ∗∘Sρ−1m∘(Cρ∗)−1 coefficientwise. At each mass component the sequences (Tn(m))n≥0 and (Tn,ρ′(m))n≥0 have the same free data and satisfy the normalization hypotheses of [F2] by the scale-admissibility condition in the Definition. Under [A1], applying [F2] gives a unique formal local map Zρ(V)=V+O(V2) preserving support and covariance and satisfying the displayed equation. This defines Zρ only under these hypotheses.

3.1A1F2step 1.1algebra∎

For ρ=1, step 1.1 gives σ1=id⁡, so the defining equation is S=S∘Z1. The identity map also satisfies the finite-renormalization conditions, and uniqueness in [F2] gives Z1=id⁡.

Remarks

The time-ordered systems and scale-admissibility condition are supplied inputs. Their comparison map is determined uniquely by a triangular coefficient recursion under Countable Choice from the actual contraction contract. Constructing time-ordered systems is a separate theorem with its own Choice hypotheses; no existence of a system for a particular model is asserted here.

Depends on

Dependency tree · 2 levels

Sources