Documentation

LeanPool.NavierStokesAndEuler.Euler.Foundations.Sobolev

Actual Fourier Sobolev estimates on Euclidean spaces. The Sobolev norm below is the LΒ² norm of (1 + |ΞΎ|Β²)^(s/2) 𝓕f(ΞΎ), so its relation to the represented function is explicit. All estimates are proved from inversion and HΓΆlder.

noncomputable def EulerSobolev.weightedFourier {F : Type u_1} [NormedAddCommGroup F] [NormedSpace β„‚ F] (d : β„•) (s : ℝ) (f : SchwartzMap (Domain d) F) :

The Fourier transform multiplied by the Sobolev weight.

Equations
Instances For
    noncomputable def EulerSobolev.sobolevNorm {F : Type u_1} [NormedAddCommGroup F] [NormedSpace β„‚ F] (d : β„•) (s : ℝ) (f : SchwartzMap (Domain d) F) :

    The inhomogeneous Fourier HΛ’ norm of a Schwartz function.

    Equations
    Instances For

      Fourier inversion bounds a Schwartz function pointwise by the LΒΉ norm of its transform.

      HΓΆlder with the reciprocal weight converts the Fourier LΒΉ norm into the HΛ’ norm.

      A genuine pointwise Sobolev embedding for every s > d/2.

      The actual Fourier multiplier formula bounds each directional derivative.

      A directional derivative maps H^(s+1) to H^s with its explicit Fourier factor.

      theorem EulerSobolev.sobolevNorm_iteratedLineDeriv_le {F : Type u_1} [NormedAddCommGroup F] [NormedSpace β„‚ F] (d k : β„•) (s : ℝ) (f : SchwartzMap (Domain d) F) (m : Fin k β†’ Domain d) :
      sobolevNorm d s (schwartzIteratedDerivative m f) ≀ ((2 * Real.pi) ^ k * ∏ i : Fin k, β€–m iβ€–) * sobolevNorm d (s + ↑k) f

      Iterating the Fourier multiplier estimate loses exactly one Sobolev order per derivative.

      theorem EulerSobolev.iteratedFDeriv_norm_le_sobolevNorm {F : Type u_1} [NormedAddCommGroup F] [NormedSpace β„‚ F] [CompleteSpace F] (d k : β„•) (s : ℝ) (hs : ↑d < 2 * s) (f : SchwartzMap (Domain d) F) (x : Domain d) :
      β€–iteratedFDeriv ℝ k (⇑f) xβ€– ≀ embeddingConstant d s hs * (2 * Real.pi) ^ k * sobolevNorm d (s + ↑k) f

      Sobolev embedding controls the operator norm of every actual FrΓ©chet derivative.

      Coordinatewise complexification is an actual linear isometry of Euclidean spaces.

      Equations
      Instances For

        Coordinatewise isometric complexification of a real Schwartz vector field.

        Equations
        Instances For
          noncomputable def EulerSobolev.realSobolevNorm (d q : β„•) (s : ℝ) (f : SchwartzMap (Domain d) (Domain q)) :

          The usual Fourier HΛ’ norm of a real vector field, via isometric complexification.

          Equations
          Instances For
            theorem EulerSobolev.real_iteratedFDeriv_norm_le_sobolevNorm (d q k : β„•) (s : ℝ) (hs : ↑d < 2 * s) (f : SchwartzMap (Domain d) (Domain q)) (x : Domain d) :

            Sobolev embedding for genuine real Euclidean vector fields and all derivative orders.

            On ℝ³, H^(k+2) controls every derivative of order k. In particular, HΒ³ β†’ CΒΉ.

            On ℝ⁴, H^(k+3) controls every derivative of order k.

            noncomputable def EulerSobolev.compactSobolevNorm (d q : β„•) (s : ℝ) (f : Domain d β†’ Domain q) (hf : ContDiff ℝ (β†‘βŠ€) f) (hc : HasCompactSupport f) :

            The same concrete Fourier norm, now for an unbundled smooth compactly supported field.

            Equations
            Instances For
              theorem EulerSobolev.smooth_compact_solenoidal_limit_of_sobolev (f : β„• β†’ EulerSmoothLimit.Space β†’ EulerSmoothLimit.Space) (hf : βˆ€ (n : β„•), ContDiff ℝ (β†‘βŠ€) (f n)) (hc : βˆ€ (n : β„•), HasCompactSupport (f n)) (hSob : βˆ€ (k : β„•), Summable fun (n : β„•) => compactSobolevNorm 3 3 (2 + ↑k) (f n) β‹― β‹―) (K : Set EulerSmoothLimit.Space) (hK : IsCompact K) (hsupp : βˆ€ (n : β„•), Function.support (f n) βŠ† K) (hdiv : βˆ€ (n : β„•) (x : EulerSmoothLimit.Space), EulerSmoothLimit.divergence (f n) x = 0) :

              The all-order Sobolev estimates construct the actual smooth, compactly supported, finite-energy solenoidal limit. Uniform derivative bounds are derived by Fourier analysis inside the proof, rather than supplied as an additional hypothesis.