The compact connection range admits uniformly bounded finite tails
ProvedBianchiIX.exists_compact_connection_tailFor real variables , set
The shear components and wall rates are
These functions define the normalized vacuum Bianchi IX vector field . For , define
and .
For , put
For , set and
Write for the normalized vector field and for its constraint.
The normalized and projective state spaces are and with their finite-product norms. The maps act on these state spaces.
The projective vector field in normalized time is
Write , , and let be the maximal solution of with initial value at and domain . Put
For , define
For any real height , put
The infimum uses the total real-order convention. Let mean that is the least element of , and, writing , that
All vector and operator norms use the finite-product supremum norms. For , there are such that for and , holds, are at , and
import Definitions.Def_BianchiIX_Dynamics_ProjectiveState import Definitions.Def_BianchiIX_Dynamics_CoreAngle import Definitions.Def_BianchiIX_Dynamics_CoreTail import Mathlib.Analysis.Calculus.Deriv.Pow import Mathlib.Analysis.Calculus.Deriv.Mul import Mathlib.Analysis.Calculus.Deriv.Add import Mathlib.Analysis.Real.Sqrt import Mathlib.Tactic.Linarith import Mathlib.Tactic.Ring import Mathlib.Analysis.Calculus.ContDiff.Operations import Mathlib.Analysis.Calculus.Deriv.Prod import Mathlib.Analysis.Calculus.MeanValue import Mathlib.Data.Fin.VecNotation import Mathlib.Tactic.FinCases import Mathlib.Tactic.FunProp import Mathlib.Analysis.SpecialFunctions.Pow.Deriv import Mathlib.Tactic.FieldSimp import Mathlib.Analysis.SpecialFunctions.Integrals.Basic import Mathlib.Analysis.ODE.ExistUnique import Mathlib.Analysis.Calculus.FDeriv.Partial import Mathlib.Analysis.Calculus.ImplicitContDiff import Mathlib.Analysis.Calculus.Deriv.Inv import Mathlib.Tactic.LinearCombination import Mathlib.Analysis.SpecialFunctions.Arcosh import Mathlib.MeasureTheory.Integral.IntervalIntegral.FundThmCalculus import Mathlib.Analysis.Calculus.InverseFunctionTheorem.Deriv import Mathlib.Analysis.Calculus.Deriv.MeanValue import Mathlib.Topology.Order.IntermediateValue import Mathlib.Topology.Order.Compact import Mathlib.Topology.Instances.Real.Lemmas import Mathlib.Tactic.NormNum import Mathlib.Analysis.Calculus.FDeriv.Symmetric import Mathlib.Tactic.Module import Mathlib.Analysis.SpecialFunctions.Arsinh import Mathlib.Analysis.SpecialFunctions.Sqrt import Mathlib.Data.Matrix.Mul import Mathlib.Algebra.BigOperators.Fin import Mathlib.Data.Real.Basic import Mathlib.Analysis.ODE.Gronwall import Mathlib.Analysis.SpecialFunctions.Trigonometric.ArctanDeriv import Mathlib.Analysis.SpecialFunctions.Trigonometric.DerivHyp import Mathlib.Analysis.SpecialFunctions.Log.Basic import Mathlib.MeasureTheory.Integral.IntervalIntegral.DistLEIntegral import Mathlib.Tactic.GCongr import Mathlib.Analysis.Calculus.Deriv.Slope import Mathlib.Topology.Order.OrderClosed import Mathlib.Topology.MetricSpace.Thickening noncomputable section open BianchiIX open Set Filter Metric open scoped Topology
theorem BianchiIX.exists_compact_connection_tail {η : ℝ} (hη : 0 < η ∧ η ≤ 1 / 8) :
∃ ε > (0 : ℝ), ∃ C > (0 : ℝ), ∀ Y : CoreAngleState,
(31 / 8 ≤ Y 0 ∧ Y 0 ≤ 6) → |Y 1| ≤ ε → |Y 2| ≤ ε →
coreTailValid η Y ∧ ContDiffAt ℝ 2 (coreTailTime η) Y ∧
ContDiffAt ℝ 2 (coreTailState η) Y ∧
|coreTailTime η Y| + ‖coreTailState η Y‖ +
‖fderiv ℝ (coreTailTime η) Y‖ + ‖fderiv ℝ (coreTailState η) Y‖ +
‖fderiv ℝ (fderiv ℝ (coreTailTime η)) Y‖ +
‖fderiv ℝ (fderiv ℝ (coreTailState η)) Y‖ ≤ C := by sorry