Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
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.

Finite truncated forward-amplitude bootstrap data

Definition

Let B(v) and ν0=2m2>0 be the pole-subtracted forward-amplitude data of the amplitude-input definition. In addition to being even and holomorphic near v=0, retain its real-analyticity condition B(v‾)=B(v)‾. If B(v)=∑j≥0βjvj near 0, uniqueness of the Taylor expansion gives βj=βj‾ from this condition and β2n+1=0 from evenness. Hence the even Taylor coefficients are real. Fix an integer truncation order N≥1. For n≥1 define the Taylor coefficient cn=B(2n)(0)/(2n)! and the dimensionless forward on-shell coefficient bk=ν02k+2ck+1∈R for 0≤k≤N. Since v and ν0 have units (mass)2, cn has units (mass)−4n and bk is dimensionless. Here “Wilson coefficient” refers only to this normalized on-shell amplitude coordinate; it does not identify a generic coefficient of an off-shell Lagrangian operator basis.

For each integer r≥0 with 2r≤N, form the quadratic constraint

∑i,j=0raiajbi+j≥0for every (a0,…,ar)∈Rr+1.

For each integer r≥0 with 2r+1≤N, form the two additional quadratic constraints

∑i,j=0raiajbi+j+1≥0,∑i,j=0raiaj(bi+j−bi+j+1)≥0for every (a0,…,ar)∈Rr+1.

The finite order-N forward-amplitude bootstrap feasible set KN is the subset of RN+1 consisting of vectors (b0,…,bN) that satisfy every applicable constraint above. The finite truncated bootstrap problem is to determine whether a supplied coefficient vector belongs to KN. Passing this finite test is a necessary condition supplied by forward positivity; it is not defined to be sufficient for the existence of a full amplitude-data package as defined above.

Depends on

Dependency tree · 1 level

Sources