Crossing parity: even, odd, odd
ProvedNaculichRegge.crossing_parity_opsLet be the action of exchanging external legs 2 and 3 on the trace basis (, , fixed). Then
import Definitions.Def_NaculichRegge_TraceBasis open Polynomial
namespace NaculichRegge
/-- Naculich, eqs. (3.7), (4.7): under the exchange of legs 2 and 3, `𝐓_t²` is even,
`𝐓_{s-u}²` is odd, and `C₀₀` is odd. -/
theorem crossing_parity_ops :
crossing * Tt2 * crossing = Tt2 ∧ crossing * Tsu2 * crossing = -Tsu2 ∧
crossing.mulVec C00 = -C00 := by sorry
end NaculichReggeRead-back
What the Lean code literally says, in plain math · Aristotle (Harmonic) — same agent as the drafter; non-blind
Non-blind read-back — not independent testimony. This read-back was written by the same agent that drafted these Lean statements, with full knowledge of the source paper and of the intended meaning; it was not produced by an independent, blind auditor. Reviewers must not treat it as independent evidence of faithfulness and should check it against the Lean code themselves.
The statement is the conjunction of three equalities, with no hypotheses:
and (as colour vectors). Products are ordinary matrix products.
Definitions used. Throughout, denotes the polynomial variable of ; a colour vector is a column vector (component is the coefficient of the trace-basis element ), and a colour operator is a matrix over acting on column vectors by matrix–vector multiplication. and are the two fixed matrices
, and ("crossing") is the permutation matrix exchanging coordinates and and fixing . With , the Regge colour factor is , where is: the identity if (for every ); otherwise if ; otherwise if ; otherwise if (here is truncated at ); and the zero matrix in all other cases. A pair is admissible if , or , or and , or and ; is the finite set of admissible pairs with and .