Fibonacci prefix bounds imply vanishing binary mesh
ProvedFreiman.upper_mesh_from_prefix_boundscontinued-fractionshall-raynumber-theory
A lower bound floor(depth/3) on the prefix length and the inverse-square Fibonacci cylinder estimate force the mesh of the binary interval tree to tend to zero.
Preamble
import Definitions.Def_Freiman_upperModel
Formal statement
namespace Freiman
theorem upper_mesh_from_prefix_bounds (T : List Bool → upperInterval) (f : List Bool → ℕ) (hg : ∀ w, w.length / 3 ≤ f w) (hb : ∀ w, upperLength (T w) ≤ 1 / (((Nat.fib (f w + 1) : ℕ) : ℝ) ^ 2)) :
upperMesh T := by
sorry
end FreimanSource
Freiman's Hall ray: Proof report and corrected English text, 8 September 2026, Part IV, active source report/source/staging/parts/m2a.tex. Mesh argument after m2a:ratio-table; common found:continuity.