Documentation

LeanPool.NavierStokesAndEuler.Euler.RegularizedMetricPaths

Literal metric, loss, and forcing paths for the actual full-order word regularization.

noncomputable def EulerRegularizedMetricPaths.metricOperatorPath (period : ℝ) [Fact (0 < period)] (T : ℝ) (K : ↑(Set.Icc 0 T) → EulerSpatialSobolevInverse.SmoothCoefficient period) (hK : Continuous fun (t : ↑(Set.Icc 0 T)) => (K t).operator) :

A genuine continuous path of L² multipliers from the given actual smooth coefficient family.

Equations
Instances For

    The literal scalar metric-growth and radius-loss coefficients are integrable for continuous time paths.

    The literal finite forcing coefficient is integrable for genuine continuous family paths.

    theorem EulerRegularizedMetricPaths.regularized_metric_path_eq (period : ℝ) [Fact (0 < period)] {α : Type u_1} {β : Type u_2} [Fintype α] [Fintype β] {q : ℕ} (d : α → β → ℕ) (w : (i : α) → (j : β) → Fin (d i j) → Fin 4) (hd : ∀ (i : α) (j : β), d i j ≤ q + 1) (n : ℕ) (T : ℝ) (hT : 0 ≤ T) (order : α → ℕ) (R : C(↑(Set.Icc 0 T), ℝ)) (K : ↑(Set.Icc 0 T) → EulerSpatialSobolevInverse.SmoothCoefficient period) (hK : Continuous fun (t : ↑(Set.Icc 0 T)) => (K t).operator) (u : C(↑(Set.Icc 0 T), ↥(EulerCylinderSobolevSpace.SobolevSpace period (q + 1)))) (r : ℝ) :

    The computed metric path is exactly the actual factorial-weighted metric sum on the regularized fields.

    theorem EulerRegularizedMetricPaths.regularized_loss_path_eq (period : ℝ) [Fact (0 < period)] {α : Type u_1} {β : Type u_2} [Fintype α] [Fintype β] {q : ℕ} (d : α → β → ℕ) (w : (i : α) → (j : β) → Fin (d i j) → Fin 4) (hd : ∀ (i : α) (j : β), d i j ≤ q + 1) (n : ℕ) (T : ℝ) (hT : 0 ≤ T) (order : α → ℕ) (R : C(↑(Set.Icc 0 T), ℝ)) (K : ↑(Set.Icc 0 T) → EulerSpatialSobolevInverse.SmoothCoefficient period) (hK : Continuous fun (t : ↑(Set.Icc 0 T)) => (K t).operator) (u : C(↑(Set.Icc 0 T), ↥(EulerCylinderSobolevSpace.SobolevSpace period (q + 1)))) (r : ℝ) :

    The computed radius-loss path is exactly the actual order-weighted metric sum.

    theorem EulerRegularizedMetricPaths.regularized_forcing_path_eq (period : ℝ) [Fact (0 < period)] {α : Type u_1} {β : Type u_2} [Fintype α] [Fintype β] {q : ℕ} (d : α → β → ℕ) (w : (i : α) → (j : β) → Fin (d i j) → Fin 4) (hd : ∀ (i : α) (j : β), d i j ≤ q + 1) (n : ℕ) (T : ℝ) (hT : 0 ≤ T) (order : α → ℕ) (R : C(↑(Set.Icc 0 T), ℝ)) (A : C(↑(Set.Icc 0 T), ↥(EulerCylinderSobolevSpace.SobolevSpace period 1) →L[ℝ] ↥(EulerLiftedGradientSpace.LiftL2 period))) (G : C(↑(Set.Icc 0 T), ↥(EulerLiftedGradientSpace.LiftL2 period) →L[ℝ] ↥(EulerLiftedGradientSpace.LiftL2 period))) (u : C(↑(Set.Icc 0 T), ↥(EulerCylinderSobolevSpace.SobolevSpace period (q + 1)))) (f p : C(↑(Set.Icc 0 T), ↥(EulerCylinderSobolevSpace.SobolevSpace period q))) (r : ℝ) :

    The computed forcing path is exactly the actual weighted family norm of the regularized PDE forcing.