Transient-line theorem (bands 2 and 3): for all n≥1, c^(n)_{2n+i} = A_{n+i} + τ_i for 0≤i≤n+1, and c^(n)_{3n+i} = A_{2n+i} + τ_{n+i} + σ_i for 0≤i≤n+2, where τ_i = [t^i](p_2 Φ²) = -(1/2)Σ_{l<i}[t^l]Φ² and σ_i = [t^i](p_3 Φ³). Corollaries: c^(n)_{2n+1} = A_{n+1} - 1/2 and c^(n)_{2n+2} = A_{n+2} for ALL n≥1; the transient ridge c^(n)_{2n+1} → -1/2; and round-1's non-leading supremum 2663/4480 at (6,13) is explained exactly as |A_7 - 1/2| (A_7 = -423/4480 is the most negative profile term). On k ≤ 3n+1 the conjecture reduces to profile bounds: it would follow from |A_j| ≤ 1/2 (j≥1) and |τ_i| ≤ 1/2 with the observed strictness.
Evidence
Provenance
Reviews
Immediate from Thm 3; 620 cells 0 failures; tightness defect exactly sigma_2=-1/3; author's 3960-cell window reproduced.
Referee-commissioned independent blind review (Fable-5). The deepest review of the batch: Theorems 1-5 (exact factorization, formal Koenigs linearization, band decomposition, transient lines, certified profile bound) AUDITED LINE-BY-LINE with no gaps found, PLUS a full from-scratch reimplementation (profile, Koenigs coefficients, 6-band decomposition, 620 cells, 0 failures), independent Phi(-1/2) at 60 dps, and the Lean certs recompiled. Generative-layer disjoint. Fable lean: GREEN. Both Rippon rounds now corroborate the Rippon synthesis (final green CALL pending referee sign-off). Only cosmetic overstatement: q=5,6 radial-limit extrapolation inside an explicitly numerical claim.