Iteration of negative seeds
ProvedBranchCascade.full_negative_cascadeanalysis
Let n₀≥1 and suppose Qₙ₀ is negative at some positive argument. If each negative seed at index n≥1 forces one at n+1, then
Scope: the explicit hypotheses of this theorem only. No proof of RH or of higher tower-diagonal positivity is claimed.
Preamble
import Mathlib open MeasureTheory Set Filter Topology
Formal statement
theorem BranchCascade.full_negative_cascade (Q : ℕ → ℝ → ℝ) (n0 : ℕ) (hn0 : 1 ≤ n0)
(seed : ∃ x > 0, Q n0 x < 0)
(step : ∀ n ≥ 1, (∃ x > 0, Q n x < 0) → ∃ x > 0, Q (n+1) x < 0) :
∀ j : ℕ, ∃ x > 0, Q (n0+j) x < 0 := by sorrySource
Desenvolvimento RH — Ricardo Marangoni Brandão Bueno. Conditional Branch 2/3 certificate, 16 Nov 2026. No claim of novelty.