Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Tree recursion under an explicit vanishing-boundary hypothesis

Statement

Let n≥4 and let p1,…,pn∈C4∖{0} be complex null momenta with ∑a=1npa=0. Choose spinor factors κ(pa)=λaλ~a, whose existence is established by the null-factorization result on this page, and choose distinct labels i,j. The spinor factors and h use the convention in the spinor-helicity definition. For dimensionless z∈C, make the two-line shift

λi(z)=λi+zλj,λ~j(z)=λ~j−zλ~i,

leaving λ~i, λj and every other spinor unchanged; set pa(z)=κ−1(λa(z)λ~a(z)).

Let A(z)=F(z)/G(z), where F,G∈C[z], G≢0, and common factors are canceled. A finite pole is a zero of the reduced denominator G; it is simple when that zero has multiplicity one. Assume A is regular at z=0, has distinct simple finite poles z1,…,zm≠0 and no other finite poles, and A(z)→0 as z→∞. For a simple pole, define rα=Res⁡z=zαA(z) as the coefficient of (z−zα)−1 in its Laurent expansion. Then

A(0)=−∑α=1mrαzα=−∑α=1mRes⁡z=zαA(z)z.

For a factorization channel, choose a subset Sα⊂{1,…,n} with 2≤∣Sα∣≤n−2, containing exactly one of i,j. Put Pα(z)=∑a∈Sαpa(z) and Qα(z)=h(Pα(z),Pα(z)). Assume every pole is assigned a distinct such channel with Qα(zα)=0 and Qα′(zα)≠0. Since z is dimensionless, Qα′ has the same inverse-length-squared units as Qα. If the residue factorization

rα=∑s∈HαAL,s(zα)AR,−s(zα)Qα′(zα)

holds, where Hα is the finite set of internal helicity labels and AL,s,AR,−s are the supplied complex values for the two lower-point channel subproblems at the shifted factorization kinematics, with the internal momenta Pα(zα) and −Pα(zα) null, then

A(0)=−∑α=1m1zαQα′(zα)∑s∈HαAL,s(zα)AR,−s(zα).

This is the BCFW recursion for the stated shift. The residue-factorization equality and the vanishing at infinity are hypotheses here; this theorem does not derive them for a chosen QFT model.

Facts & Assumptions

Given: n≥4, nonzero complex null external momenta with total momentum zero, the specified shift of two distinct legs, and a rational A(z) regular at zero with only the distinct simple finite poles stated above and A(z)→0 at infinity. For the recursion conclusion also assume the displayed finite-channel residue factorization and simple channel zeros.

[F1]

Complex null momenta and helicity weights: a spinor factorization has matrix entries κ(p)aa˙=λaλ~a˙.

[F2]

Complex null momenta and helicity weights: h(p,q)=p0q0−p1q1−p2q2−p3q3.

[F3]

Null momenta admit unique spinor-helicity classes: det⁡κ(p)=h(p,p) for every p.

[F4]

Null momenta admit unique spinor-helicity classes: every nonzero complex null external momentum has spinor factors.

[A1]

The shift changes only λi and λ~j by the displayed amounts; total external momentum is zero before shifting.

[A2]

A(z) is rational, regular at 0, has only the stated distinct nonzero simple finite poles, and tends to zero at infinity.

[A3]

At each pole, the finite factorization channel satisfies Qα(zα)=0, Qα′(zα)≠0, and the stated product-and-helicity-sum residue identity.

Proof

1.1givenF1F2F3F4A1choosealgebra

The finite collection of initial spinor factors exists by [F4]; since n is finite, choose them successively without an arbitrary-family choice principle. In matrix coordinates, κ(pi(z))=(λi+zλj)λ~i=κ(pi)+zλjλ~i and κ(pj(z))=λj(λ~j−zλ~i)=κ(pj)−zλjλ~i. Each shifted matrix is an outer product by [F1], hence has determinant zero; [F3] and [F2] then give nullness, and the two added terms cancel. Thus ∑apa(z)=0.

1.2A2algebra

Set rα=Res⁡z=zαA(z). The rational function A(z)−∑α=1mrα/(z−zα) has no finite pole, so it is a polynomial; it tends to zero at infinity by [A2], so that polynomial is zero. Evaluating the resulting partial-fraction identity at z=0 gives A(0)=−∑αrα/zα.

2.1A2A3step 1.2algebra∎

Since zα≠0, the factor 1/z is regular there and Res⁡z=zα(A(z)/z)=rα/zα. This proves the residue form. Under [A3], substitute each stated factorization for rα to obtain the claimed recursion. No contour or large-z model estimate is used beyond the explicit decay hypothesis.

Remarks

The proof establishes a rational-function identity and a conditional substitution. Rationality, simple factorization poles, the residue product, and decay for a particular tree amplitude remain separate model-specific obligations. No loop integration, nonperturbative S-matrix construction, or convergence result for perturbative gravity follows.

Depends on

Dependency tree · 2 levels

Sources