def
definition
extendByZero
show as:
view math explainer →
open explainer
Read the cached plain-language explainer.
open lean source
IndisputableMonolith.ClassicalBridge.Fluids.ContinuumLimit2D on GitHub at line 55.
browse module
All declarations in this module, on Recognition.
explainer page
depends on
used by
-
aestronglyMeasurable_galerkinForcing_mode_of_continuous -
coeff_bound_of_uniformBounds -
continuum_limit_exists -
ConvergenceHypothesis -
ConvergenceHypothesis -
divConstraint_eq_zero_of_forall -
divFreeCoeffBound -
divFree_of_forall -
duhamelRemainderOfGalerkin -
duhamelRemainderOfGalerkin_integratingFactor -
duhamelRemainderOfGalerkin_kernel -
extendByZero_add -
extendByZero_laplacianCoeff -
extendByZeroLinear -
extendByZero_neg -
extendByZero_smul -
galerkin_duhamelKernel_identity -
galerkinForcing -
galerkinNS_hasDerivAt_duhamelRemainder_mode -
galerkinNS_hasDerivAt_extendByZero_mode -
hasDerivAt_extendByZero_apply -
norm_extendByZero_le -
nsDuhamelCoeffBound -
nsDuhamelCoeffBound_galerkinKernel -
nsDuhamelCoeffBound_galerkinKernel_of_forcing -
nsDuhamelCoeffBound_galerkinKernel_of_forcingHyp -
nsDuhamelCoeffBound_kernelIntegral -
nsDuhamelCoeffBound_kernelIntegral_of_forcing -
nsDuhamel_of_forall -
nsDuhamel_of_forall_kernelIntegral -
nsDuhamel_of_forall_kernelIntegral_of_forcing -
stokesMildCoeffBound -
stokesMild_of_forall -
tendsto_duhamelKernelIntegral_of_dominated_convergence -
UniformBoundsHypothesis -
rs_implies_global_regularity_2d -
rs_implies_global_regularity_2d_coeffBound -
rs_implies_global_regularity_2d_divFreeCoeffBound -
rs_implies_global_regularity_2d_nsDuhamelCoeffBound -
rs_implies_global_regularity_2d_nsDuhamelCoeffBound_galerkinKernel
formal source
52 0
53
54/-- Extend a truncated Galerkin state by zero to a full Fourier coefficient state. -/
55noncomputable def extendByZero {N : ℕ} (u : GalerkinState N) : FourierState2D :=
56 fun k =>
57 -- Build a 2-vector coefficient from its two components.
58 !₂[coeffAt u k ⟨0, by decide⟩, coeffAt u k ⟨1, by decide⟩]
59
60/-!
61## Linearity of the zero-extension embedding
62
63We will eventually want to pass (linear) identities from Galerkin trajectories to limits.
64For that, it is useful to record that `extendByZero` is a linear map.
65-/
66
67lemma coeffAt_add {N : ℕ} (u v : GalerkinState N) (k : Mode2) (j : Fin 2) :
68 coeffAt (u + v) k j = coeffAt u k j + coeffAt v k j := by
69 classical
70 by_cases hk : k ∈ modes N
71 · simp [coeffAt, hk]
72 · simp [coeffAt, hk]
73
74lemma coeffAt_smul {N : ℕ} (c : ℝ) (u : GalerkinState N) (k : Mode2) (j : Fin 2) :
75 coeffAt (c • u) k j = c * coeffAt u k j := by
76 classical
77 by_cases hk : k ∈ modes N
78 · simp [coeffAt, hk]
79 · simp [coeffAt, hk]
80
81lemma extendByZero_add {N : ℕ} (u v : GalerkinState N) :
82 extendByZero (u + v) = extendByZero u + extendByZero v := by
83 classical
84 funext k
85 ext j