TaoFivePrimes.rh_high_height_bracket_tree_sound
ProvedTaoFivePrimes.rh_high_height_bracket_tree_soundnumerical-verificationriemann-zetatao-five-primes
The list interpretation of an indexed proof-carrying bracket tree has its advertised number of leaves, ordered disjoint coordinate brackets, and bounds inside the tree span. This is a general structural soundness theorem. It does not prove any normalized zeta enclosure.
Preamble
import Definitions.Def_TaoFivePrimes_RHHighHeightBracketInterface
Formal statement
theorem TaoFivePrimes.rh_high_height_bracket_tree_sound {l r n : Nat} (t : RHHighHeightBracketData.Tree l r n) :
(RHHighHeightBracketInterface.leaves t).length=n ∧
(RHHighHeightBracketInterface.leaves t).Pairwise (fun p q => p.r≤q.l) ∧
(∀ p ∈ RHHighHeightBracketInterface.leaves t, l≤p.l ∧ p.r≤r) := by sorrySource
Finite structural sign and order certificates, generated from the native FLINT 3.6.0 Platt FFT/interpolation proposal on [3289999872,3290000000]. Numeric tests are necessary constructor proof fields and use ordinary decide +kernel. No value containment, total zero count or RH conclusion is asserted. Platt method: DOI 10.1090/mcom/3198. The surrounding project preserves attribution to sometik179 (c9908072-d99a-4431-aad8-a72c6352619a) and Gabewhigham. The interpretation uses the Mathlib completed-zeta normalization from the separately accepted normalization theorem.