Connection entry data produce a transverse first return with one wall crossing
ProvedBianchiIX.exists_connection_first_returnFor 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
Put , , , , and .
Define
For a normalized trajectory write
For , set , , and
Let mean that this infimum is a least element, the full interval lies in the maximal domain with positive , the growing wall is below one before the endpoint, and its normalized-time derivative is strictly positive at the endpoint. The infimum has its total real-order meaning.
Assume with , , and . Write and . There exists which is the least positive maximal-domain time with . For ,
On this interval is strictly decreasing and strictly increasing, and before . There is exactly one with , and
import Definitions.Def_BianchiIX_Algebra_Flow import Definitions.Def_BianchiIX_Dynamics_Normalized import Definitions.Def_BianchiIX_Algebra_Coordinates import Definitions.Def_BianchiIX_Dynamics_ProjectiveState import Definitions.Def_BianchiIX_Dynamics_MaximalFlow import Definitions.Def_BianchiIX_Dynamics_ConnectionClock import Definitions.Def_BianchiIX_Dynamics_ConnectionRegion import Definitions.Def_BianchiIX_Dynamics_ConnectionExistence 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.Deriv.Inv import Mathlib.Tactic.FieldSimp import Mathlib.Tactic.LinearCombination import Mathlib.Topology.Instances.Real.Lemmas import Mathlib.Analysis.SpecialFunctions.Arsinh import Mathlib.Analysis.SpecialFunctions.Sqrt 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.Arcosh import Mathlib.MeasureTheory.Integral.IntervalIntegral.FundThmCalculus import Mathlib.Analysis.Calculus.InverseFunctionTheorem.Deriv import Mathlib.Analysis.Calculus.Deriv.MeanValue import Mathlib.Analysis.SpecialFunctions.Pow.Deriv import Mathlib.Analysis.SpecialFunctions.Integrals.Basic import Mathlib.Analysis.ODE.ExistUnique import Mathlib.Analysis.Calculus.FDeriv.Partial import Mathlib.MeasureTheory.Integral.IntervalIntegral.DistLEIntegral import Mathlib.Tactic.GCongr import Mathlib.Analysis.Calculus.Deriv.Slope import Mathlib.Topology.Order.OrderClosed import Mathlib.Topology.Order.IntermediateValue noncomputable section open BianchiIX open Set
theorem BianchiIX.exists_connection_first_return {μ u w : ℝ} (hμ : 4 ≤ μ)
(hu : 0 ≤ u ∧ u ≤ (1 / 10000) / μ) (hw : 0 < w ∧ w ≤ 1 / 10000) :
let x := fromProjectiveState (connectionEntry μ u w)
let β := fun t => toProjectiveState (normalizedMaxCurve x 0 t)
∃ T > (0 : ℝ),
IsLeast {t | 0 < t ∧ t ∈ normalizedMaxDomain x 0 ∧ β t 3 = 1} T ∧
(∀ t ∈ Icc 0 T, 3 / (2 * μ ^ 2) ≤ 1 + normalizedMaxCurve x 0 t 0 ∧ connectionRegion μ (β t)) ∧
StrictAntiOn (fun t => β t 2) (Icc 0 T) ∧ StrictMonoOn (fun t => β t 3) (Icc 0 T) ∧
(∀ t ∈ Ico 0 T, β t 3 < 1) ∧
(∃! r, r ∈ Ioo 0 T ∧ β r 2 = β r 3) ∧
HasDerivAt (fun t => β t 3)
((1 + normalizedMaxCurve x 0 T 0) * connectionClockRate (β T)) T ∧
0 < (1 + normalizedMaxCurve x 0 T 0) * connectionClockRate (β T) := by sorry