Documentation

LeanPool.HighContrastHomogenization.Support.Deterministic.ConstantCoefficientDirichletBesov.OverlapFluctuation

Coarse-graining support: #

Support.Deterministic.ConstantCoefficientDirichletBesov.OverlapFluctuation

Imported from the Apache-2.0 CoarseGraining development at commit c7ddd76c08ade64fed1b8d2ca51be14dfee8deb4.

noncomputable def HCPolySupport.overlapCentersAverage {d : ℕ} (Q : TriadicCube d) (j : ℕ) (F : TriadicCube d → ℝ) :

Average over the overlapping centers at a fixed depth.

Equations
Instances For
    theorem HCPolySupport.overlapCentersAverage_mul_left {d : ℕ} (Q : TriadicCube d) (j : ℕ) (c : ℝ) (F : TriadicCube d → ℝ) :
    (overlapCentersAverage Q j fun (S : TriadicCube d) => c * F S) = c * overlapCentersAverage Q j F
    theorem HCPolySupport.overlapCentersAverage_const {d : ℕ} (Q : TriadicCube d) (j : ℕ) (c : ℝ) :
    (overlapCentersAverage Q j fun (x : TriadicCube d) => c) = c
    theorem HCPolySupport.overlapCentersAverage_nonneg {d : ℕ} (Q : TriadicCube d) (j : ℕ) (F : TriadicCube d → ℝ) (hF : ∀ S ∈ overlapCentersAtDepth Q j, 0 ≤ F S) :
    theorem HCPolySupport.overlapCentersAverage_L2_sum_le_sum_overlapCentersAverage_L2 {d : ℕ} {ι : Type u_1} (Q : TriadicCube d) (j : ℕ) (s : Finset ι) (A : TriadicCube d → ι → ℝ) (hA : ∀ S ∈ overlapCentersAtDepth Q j, ∀ i ∈ s, 0 ≤ A S i) :
    (overlapCentersAverage Q j fun (S : TriadicCube d) => (∑ i ∈ s, A S i) ^ 2) ^ (1 / 2) ≤ ∑ i ∈ s, (overlapCentersAverage Q j fun (S : TriadicCube d) => A S i ^ 2) ^ (1 / 2)
    noncomputable def HCPolySupport.overlapCubeFluctuationVec {d : ℕ} (S : TriadicCube d) (u : Vec d → Vec d) :
    Vec d → Vec d

    Vector fluctuation around the overlapping-cube average.

    Equations
    Instances For
      noncomputable def HCPolySupport.cubeBesovOverlappingPositiveVectorDepthAverage {d : ℕ} (Q : TriadicCube d) (u : Vec d → Vec d) (j : ℕ) :

      Depth-j overlapping positive q = 2 square average.

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