Documentation

LeanPool.NavierStokesAndEuler.Euler.BaseFirstPacketSupport

The actual finite initial base of the induction is compactly supported: it is the compact smooth datum plus its first packet's literal compact initial increment.

theorem EulerBaseDatum.packetBase_initial_support (β : ) ( : |β| 1) (ell : ) (hell : 0 < ell) (hell1 : ell 1) (T : ) (hT : 0 < T) (hTB : T initialTime) :
(tsupport fun (x : EulerSmoothLimit.Space) => (packetBaseState β ell hell hell1 T hT hTB).evolution.velocity (0, x))Metric.closedBall 0 2
theorem EulerBaseDatum.FirstPacketChoice.initial_support {β : } { : |β| 1} {ell : } {hell : 0 < ell} {hell1 : ell 1} {T : } {hT : 0 < T} {hTB : T initialTime} {δ : } { : 0 < δ} {hchild k : } {hk : EulerPacketSourceFrequency.UniversalFrequency k} {nextEll : } {hnext : 0 < nextEll} {hnext1 : nextEll 1} (F : FirstPacketChoice β ell hell hell1 T hT hTB δ hchild k hk nextEll hnext hnext1) :
(tsupport fun (x : EulerSmoothLimit.Space) => (state β ell hell hell1 T hT hTB δ hchild k hk nextEll hnext hnext1 F).evolution.velocity (0, x))Metric.closedBall 0 2
theorem EulerBaseDatum.FirstPacketChoice.initial_compact {β : } { : |β| 1} {ell : } {hell : 0 < ell} {hell1 : ell 1} {T : } {hT : 0 < T} {hTB : T initialTime} {δ : } { : 0 < δ} {hchild k : } {hk : EulerPacketSourceFrequency.UniversalFrequency k} {nextEll : } {hnext : 0 < nextEll} {hnext1 : nextEll 1} (F : FirstPacketChoice β ell hell hell1 T hT hTB δ hchild k hk nextEll hnext hnext1) :
HasCompactSupport fun (x : EulerSmoothLimit.Space) => (state β ell hell hell1 T hT hTB δ hchild k hk nextEll hnext hnext1 F).evolution.velocity (0, x)