Documentation

LeanPool.HighContrastHomogenization.Provider.Regularity.FiniteLipschitzCoreBase

High-contrast homogenization: Provider.Regularity.FiniteLipschitzCoreBase #

Imported from the Apache-2.0 HighContrastHomogenization development at commit 7a13dbcd8d6609264a713373f5c69ceeac870472.

Shared analytic core for finite large-scale regularity #

This module contains the common affine approximation, replacement, and Poincare estimates used by the recurrence and best-fit branches.

Restrict a solution on the origin cube at scale m to scale min k m, so the requested local scale never exceeds its domain.

Equations
Instances For

    The coefficient-weighted H¹ energy norm of the solution on the origin cube at scale min k m.

    Equations
    • One or more equations did not get rendered due to their size.
    Instances For

      The intercept of the L² best affine fit to the restricted solution on the origin cube at scale min k m.

      Equations
      • One or more equations did not get rendered due to their size.
      Instances For

        The slope of the L² best affine fit to the restricted solution on the origin cube at scale min k m.

        Equations
        • One or more equations did not get rendered due to their size.
        Instances For

          The normalized affine approximation error of the restricted solution, using its best-fit intercept and slope at scale min k m.

          Equations
          • One or more equations did not get rendered due to their size.
          Instances For
            theorem HCPolySupport.HighContrast.FiniteLipschitzCoreInternal.normalizedAffineCandidateError_zero_sub_le_add {d : ℕ} (Q : TriadicCube d) (f : Vec d → ℝ) (c₁ c₂ : ℝ) (e₁ e₂ : Vec d) (h₁ : MeasureTheory.MemLp (fun (x : Vec d) => f x - (c₁ + vecDot e₁ x)) 2 (normalizedCubeMeasure Q)) (h₂ : MeasureTheory.MemLp (fun (x : Vec d) => f x - (c₂ + vecDot e₂ x)) 2 (normalizedCubeMeasure Q)) :
            normalizedAffineCandidateError Q (fun (x : Vec d) => 0) (c₁ - c₂) (e₁ - e₂) ≤ normalizedAffineCandidateError Q f c₁ e₁ + normalizedAffineCandidateError Q f c₂ e₂
            theorem HCPolySupport.HighContrast.FiniteLipschitzCoreInternal.caccioppoliPrefactor_weakError_le_one {d : ℕ} [NeZero d] {C₀ s r : ℝ} (hC₀ : 0 < C₀) (hs : 0 < s) (hsr : s < r) (hr_lt : r < 1 / 2) {a : Book.Ch02.TriadicCoeffFamily d} {k : ℤ} (herror : scalarIdentityWeakError a s k ≤ 1) :
            have D := exponentGapFactor s r * (4 * ↑d); have α := r / (1 - 2 * r); have K := (C₀ / (1 - 2 * r)).rpow (2 + 4 * r / (1 - 2 * r)) * r.rpow (-(2 * r / (1 - 2 * r))) * (D * D).rpow α * D; Book.Ch03.caccioppoliPrefactor C₀ (originCube d k) a r r ≤ K * cubeBesovScaleWeight 1 (originCube d k) ^ 2
            theorem HCPolySupport.HighContrast.FiniteLipschitzCoreInternal.exists_finiteLipschitzOneStepConstant_of_harmonic_decay (d : ℕ) [NeZero d] (s : ℝ) (hs : 0 < s) (hs_lt : s < 1 / 2) (N : ℕ) (hN : 0 < N) (theta : ℝ) (htheta : 0 < theta) (hdecay : ∀ (k : ℤ) (v : H1Function (openCubeSet (originCube d k))), (WeakPoissonEquationOn (openCubeSet (originCube d k)) v fun (x : Vec d) => 0) → ∀ (c : ℝ) (e : Vec d), ∃ (c' : ℝ) (e' : Vec d), normalizedAffineCandidateError (originCube d (k - ↑N)) v.toFun c' e' ≤ theta * normalizedAffineCandidateError (originCube d k) v.toFun c e) :
            ∃ (C : ℝ), 0 < C ∧ ∀ (a : Book.Ch02.TriadicCoeffFamily d) (m : ℤ) (u : Book.Ch03.CubeSolution (originCube d m) a), ∀ k ≤ m, finiteLipschitzAffineErrorRow a m u (k - ↑N) ≤ theta * finiteLipschitzAffineErrorRow a m u k + C * scalarIdentityWeakError a s k * finiteLipschitzEnergyRow a m u k