The canonical connection return is twice differentiable in all entry parameters
ProvedBianchiIX.connectionReturn_regularFor 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 .
For an observable , put and define
Then holds, and are at , and holds throughout a neighborhood of . With , , and ,
import Definitions.Def_BianchiIX_Dynamics_ConnectionClock import Definitions.Def_BianchiIX_Dynamics_ConnectionRegion import Definitions.Def_BianchiIX_Dynamics_ConnectionReturn 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.Topology.Instances.Real.Lemmas import Mathlib.Analysis.SpecialFunctions.Arsinh import Mathlib.Analysis.SpecialFunctions.Sqrt 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.MeasureTheory.Integral.IntervalIntegral.DistLEIntegral import Mathlib.Tactic.GCongr import Mathlib.Analysis.Calculus.Deriv.Slope import Mathlib.Topology.Order.OrderClosed import Mathlib.Topology.Order.IntermediateValue import Mathlib.Topology.Order.Compact import Mathlib.Tactic.NormNum noncomputable section open BianchiIX open Set Filter open scoped Topology
theorem BianchiIX.connectionReturn_regular {p : ConnectionParameters} (hμ : 4 ≤ p 0)
(hu : 0 ≤ p 1 ∧ p 1 ≤ (1 / 10000) / p 0) (hw : 0 < p 2 ∧ p 2 ≤ 1 / 10000) :
let x := connectionInitialState p
let T := connectionReturnTime p
connectionReturnValid p ∧ ContDiffAt ℝ 2 connectionReturnTime p ∧
ContDiffAt ℝ 2 connectionReturnState p ∧
HasFDerivAt connectionReturnTime
((normalizedEventTimeDifferential projectiveGrowingWall x 0 T).comp
(fderiv ℝ connectionInitialState p)) p ∧
HasFDerivAt connectionReturnState
(((fderiv ℝ toProjectiveState (normalizedMaxCurve x 0 T)).comp
(normalizedEventDifferential projectiveGrowingWall x 0 T)).comp
(fderiv ℝ connectionInitialState p)) p ∧
(∀ᶠ q in 𝓝 p, connectionReturnValid q) := by sorry