A width comparison trace has a finite deadline
ProvedOpenGA.WidthComparisonTrace.le_extinctionTimeconnected-sumfinite-extinctionopenga-endgamepoincare-conjecture
Every normalized finite scalar/width comparison trace with initial width bound W and final time T satisfies T <= T*(1/4,W). The proof combines the existing scalar lower bound, area-energy width comparison and finite downward-jump deadline. Existence of such traces is an explicit input.
Preamble
import Definitions.Def_OpenGA_WidthComparisonTrace import Definitions.Def_OpenGA_WidthExtinctionTime
Formal statement
/-!
# The lifetime bound for scalar and width comparison traces
This packages the existing scalar lower bound, area-energy width comparison,
and finite-jump deadline into one reusable theorem. No geometric existence
claim is made: the trace is an explicit input.
-/
namespace OpenGA
open Set Filter
open scoped Topology
theorem WidthComparisonTrace.le_extinctionTime {W T : ℝ} (F : WidthComparisonTrace W T) :
T ≤ widthExtinctionTime (1 / 4) W := by sorry
end OpenGA
Source