The Parity Gate: How the Golden Conjugation Determines BSD

The functional equation of an elliptic curve L-function contains a sign ε = ±1, the root number, that determines the parity of the analytic rank before any computation takes place. In the compiler framework (Papers 135–139), this sign is the parity gate: the golden conjugation φ ↔ ψ acting at the β₁ row, selecting whether the coherence thread enters in drainage mode (ε = −1, odd rank, forced zero) or growth mode (ε = +1, even rank, no forced zero). This paper develops the symmetry case ε = −1 in full detail. The zero at s = 1 is forced by the functional equation; the Heegner point (Gross–Zagier, 1986) provides the coherence thread; Kolyvagin's Euler system confirms that no other threads or phantom threads exist. The five-factor grammar of Paper 139 is verified explicitly at rank 1: L′(E, 1) = Ω · ĥ(PK) · ∏cp · |Sha| / |E(ℚ)tors|², with every factor identified as a language element. The root number is computed from local data at each prime — it is itself a compiled quantity, the product of local signs ε = ∏ wp. In the golden framework, the local root number at a multiplicative prime is the conjugate of the local Euler mode: wp = −ap, so φ-mode in the Euler factor (ap = +1, growth) maps to ψ-mode in the root number (wp = −1), and vice versa. The global root number records whether the cumulative conjugation is symmetric or antisymmetric. BSD in the symmetry case is not merely verified — it is explained: the golden conjugation forces the zero, the Heegner thread fills it, and the grammar specifies the leading coefficient.