Crossing as a sum of vectors
Move everything in the crossing equation to one side. The identity contributes a fixed function , and each exchanged operator contributes with weight . Their sum must vanish for every .
Expand each function in a Taylor series around . Only odd orders survive, because every changes sign under . Keeping orders up to turns each function into a vector with components.
Source: D. Mazáč · S. Rychkov and A. Vichi
One inequality instead of infinitely many unknowns
Suppose a linear functional , a fixed set of weights for the Taylor components, is positive on the identity and non-negative on every allowed . Apply it to the crossing equation. The left side is a positive number plus non-negative terms, so it cannot be zero.
That contradiction excludes every spectrum with this gap at once, whatever the dimensions and coefficients above it. Searching for such an is a linear programme. If none exists, the solver instead returns a set of operators with positive weights that satisfies the truncated equations.
Source: S. Rychkov and A. Vichi · D. Simmons-Duffin
Worked example: a functional built from two derivatives
Take and keep the first and third derivatives, . In a fixed normalisation the vectors are as below. The second component of is negative for light operators and changes sign at .
Set the gap at . The functional gives , zero at , at , at and at . Nothing above the gap can cancel the identity, so the gap is excluded.
Set the gap at instead. Then , and every normalised functional is negative on it when , or negative on when . The solver finds : a positive spectrum, so this gap is allowed at this order.
With two derivatives, the bound is therefore the zero of the third-order component, . The bisection over linear programmes gives , the same number within its tolerance.
Source: D. Mazáč · S. Rychkov and A. Vichi
More derivatives, a sharper bound
Each extra pair of derivatives gives the functional more freedom, so the bound can only fall. For it is at , at , at and at .
The free fermion has its first operator at and satisfies crossing exactly, so no valid bound can go below . Mazáč and Paulos constructed functionals in closed form showing that is the optimal bound. The numbers above approach it from above, slowly.
Source: D. Mazáč · D. Mazáč and M. F. Paulos