Documentation

LeanPool.HighContrastHomogenization.Support.Besov.Positive.Full

Coarse-graining support: Support.Besov.Positive.Full #

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

Full positive Besov wrappers #

The following value sets record all finite-depth truncations. The full seminorm wrappers use sSup; the overlap full norm wrappers are defined as full seminorm plus the fixed parent mean term. Since the codomain is ℝ, boundedness is recorded separately in regularity packages whenever a theorem needs these full wrappers to behave as finite norms.

noncomputable def HCPolySupport.cubeBesovDisjointSeminormValueSet {d : ℕ} (Q : TriadicCube d) (s : ℝ) (p q : ENNReal) (u : Vec d → ℝ) :

The set of disjoint Besov seminorm truncations over all depths.

Equations
Instances For
    noncomputable def HCPolySupport.cubeBesovDisjointSeminorm {d : ℕ} (Q : TriadicCube d) (s : ℝ) (p q : ENNReal) (u : Vec d → ℝ) :

    The real supremum of all disjoint Besov seminorm truncations.

    Equations
    Instances For
      noncomputable def HCPolySupport.cubeBesovDisjointSeminormTopValueSet {d : ℕ} (Q : TriadicCube d) (s : ℝ) (p : ENNReal) (u : Vec d → ℝ) :

      The set of disjoint maximum-aggregation seminorm truncations over all depths.

      Equations
      Instances For
        noncomputable def HCPolySupport.cubeBesovDisjointSeminormTop {d : ℕ} (Q : TriadicCube d) (s : ℝ) (p : ENNReal) (u : Vec d → ℝ) :

        The real supremum of all disjoint maximum-aggregation seminorm truncations.

        Equations
        Instances For
          noncomputable def HCPolySupport.cubeBesovDisjointNormValueSet {d : ℕ} (Q : TriadicCube d) (s : ℝ) (p q : ENNReal) (u : Vec d → ℝ) :

          The set of disjoint Besov norm truncations, including the weighted parent mean.

          Equations
          Instances For
            noncomputable def HCPolySupport.cubeBesovDisjointNorm {d : ℕ} (Q : TriadicCube d) (s : ℝ) (p q : ENNReal) (u : Vec d → ℝ) :

            The real supremum of all disjoint Besov norm truncations.

            Equations
            Instances For
              noncomputable def HCPolySupport.cubeBesovDisjointNormTopValueSet {d : ℕ} (Q : TriadicCube d) (s : ℝ) (p : ENNReal) (u : Vec d → ℝ) :

              The set of disjoint maximum-aggregation norm truncations over all depths.

              Equations
              Instances For
                noncomputable def HCPolySupport.cubeBesovDisjointNormTop {d : ℕ} (Q : TriadicCube d) (s : ℝ) (p : ENNReal) (u : Vec d → ℝ) :

                The real supremum of all disjoint maximum-aggregation norm truncations.

                Equations
                Instances For
                  noncomputable def HCPolySupport.cubeBesovOverlapSeminormValueSet {d : ℕ} (Q : TriadicCube d) (s : ℝ) (p q : ENNReal) (u : Vec d → ℝ) :

                  The set of overlapping Besov seminorm truncations over all depths.

                  Equations
                  Instances For
                    noncomputable def HCPolySupport.cubeBesovOverlapSeminorm {d : ℕ} (Q : TriadicCube d) (s : ℝ) (p q : ENNReal) (u : Vec d → ℝ) :

                    The real supremum of all overlapping Besov seminorm truncations.

                    Equations
                    Instances For
                      noncomputable def HCPolySupport.cubeBesovOverlapSeminormTopValueSet {d : ℕ} (Q : TriadicCube d) (s : ℝ) (p : ENNReal) (u : Vec d → ℝ) :

                      The set of overlapping maximum-aggregation seminorm truncations over all depths.

                      Equations
                      Instances For
                        noncomputable def HCPolySupport.cubeBesovOverlapSeminormTop {d : ℕ} (Q : TriadicCube d) (s : ℝ) (p : ENNReal) (u : Vec d → ℝ) :

                        The real supremum of all overlapping maximum-aggregation seminorm truncations.

                        Equations
                        Instances For
                          noncomputable def HCPolySupport.cubeBesovOverlapNormValueSet {d : ℕ} (Q : TriadicCube d) (s : ℝ) (p q : ENNReal) (u : Vec d → ℝ) :

                          The set of overlapping Besov norm truncations, including the weighted parent mean.

                          Equations
                          Instances For
                            noncomputable def HCPolySupport.cubeBesovOverlapNorm {d : ℕ} (Q : TriadicCube d) (s : ℝ) (p q : ENNReal) (u : Vec d → ℝ) :

                            The full overlapping seminorm plus the absolute parent mean weighted by side length to -s.

                            Equations
                            Instances For
                              noncomputable def HCPolySupport.cubeBesovOverlapNormTopValueSet {d : ℕ} (Q : TriadicCube d) (s : ℝ) (p : ENNReal) (u : Vec d → ℝ) :

                              The set of overlapping maximum-aggregation norm truncations over all depths.

                              Equations
                              Instances For
                                noncomputable def HCPolySupport.cubeBesovOverlapNormTop {d : ℕ} (Q : TriadicCube d) (s : ℝ) (p : ENNReal) (u : Vec d → ℝ) :

                                The full overlapping maximum-aggregation seminorm plus the weighted absolute parent mean.

                                Equations
                                Instances For
                                  structure HCPolySupport.CubeBesovDisjointRegularity {d : ℕ} (Q : TriadicCube d) (s : ℝ) (p q : ENNReal) (u : Vec d → ℝ) :

                                  Boundedness above of all disjoint Besov seminorm truncations.

                                  Instances For
                                    structure HCPolySupport.CubeBesovDisjointRegularityTop {d : ℕ} (Q : TriadicCube d) (s : ℝ) (p : ENNReal) (u : Vec d → ℝ) :

                                    Boundedness above of all disjoint maximum-aggregation seminorm truncations.

                                    Instances For
                                      structure HCPolySupport.CubeBesovOverlapRegularity {d : ℕ} (Q : TriadicCube d) (s : ℝ) (p q : ENNReal) (u : Vec d → ℝ) :

                                      Boundedness above of all overlapping Besov seminorm truncations.

                                      Instances For
                                        structure HCPolySupport.CubeBesovOverlapRegularityTop {d : ℕ} (Q : TriadicCube d) (s : ℝ) (p : ENNReal) (u : Vec d → ℝ) :

                                        Boundedness above of all overlapping maximum-aggregation seminorm truncations.

                                        Instances For
                                          @[simp]
                                          theorem HCPolySupport.cubeBesovDisjointSeminorm_const {d : ℕ} (Q : TriadicCube d) (s : ℝ) (p q : ENNReal) (u : ℝ) (hp0 : p ≠ 0) (hpTop : p ≠ ⊤) (hq0 : q ≠ 0) (hqTop : q ≠ ⊤) :
                                          (cubeBesovDisjointSeminorm Q s p q fun (x : Vec d) => u) = 0
                                          theorem HCPolySupport.cubeBesovDisjointSeminorm_zero {d : ℕ} (Q : TriadicCube d) (s : ℝ) (p q : ENNReal) (hp0 : p ≠ 0) (hpTop : p ≠ ⊤) (hq0 : q ≠ 0) (hqTop : q ≠ ⊤) :
                                          (cubeBesovDisjointSeminorm Q s p q fun (x : Vec d) => 0) = 0
                                          @[simp]
                                          theorem HCPolySupport.cubeBesovDisjointSeminormTop_const {d : ℕ} (Q : TriadicCube d) (s : ℝ) (p : ENNReal) (u : ℝ) (hp0 : p ≠ 0) (hpTop : p ≠ ⊤) :
                                          (cubeBesovDisjointSeminormTop Q s p fun (x : Vec d) => u) = 0
                                          theorem HCPolySupport.cubeBesovDisjointSeminormTop_zero {d : ℕ} (Q : TriadicCube d) (s : ℝ) (p : ENNReal) (hp0 : p ≠ 0) (hpTop : p ≠ ⊤) :
                                          (cubeBesovDisjointSeminormTop Q s p fun (x : Vec d) => 0) = 0
                                          @[simp]
                                          theorem HCPolySupport.cubeBesovDisjointNorm_const {d : ℕ} (Q : TriadicCube d) (s : ℝ) (p q : ENNReal) (u : ℝ) (hp0 : p ≠ 0) (hpTop : p ≠ ⊤) (hq0 : q ≠ 0) (hqTop : q ≠ ⊤) :
                                          (cubeBesovDisjointNorm Q s p q fun (x : Vec d) => u) = cubeBesovScaleWeight s Q * ‖u‖
                                          theorem HCPolySupport.cubeBesovDisjointNorm_zero {d : ℕ} (Q : TriadicCube d) (s : ℝ) (p q : ENNReal) (hp0 : p ≠ 0) (hpTop : p ≠ ⊤) (hq0 : q ≠ 0) (hqTop : q ≠ ⊤) :
                                          (cubeBesovDisjointNorm Q s p q fun (x : Vec d) => 0) = 0
                                          @[simp]
                                          theorem HCPolySupport.cubeBesovDisjointNormTop_const {d : ℕ} (Q : TriadicCube d) (s : ℝ) (p : ENNReal) (u : ℝ) (hp0 : p ≠ 0) (hpTop : p ≠ ⊤) :
                                          theorem HCPolySupport.cubeBesovDisjointNormTop_zero {d : ℕ} (Q : TriadicCube d) (s : ℝ) (p : ENNReal) (hp0 : p ≠ 0) (hpTop : p ≠ ⊤) :
                                          (cubeBesovDisjointNormTop Q s p fun (x : Vec d) => 0) = 0
                                          @[simp]
                                          theorem HCPolySupport.cubeBesovOverlapSeminorm_const {d : ℕ} (Q : TriadicCube d) (s : ℝ) (p q : ENNReal) (u : ℝ) (hp0 : p ≠ 0) (hpTop : p ≠ ⊤) (hq0 : q ≠ 0) (hqTop : q ≠ ⊤) :
                                          (cubeBesovOverlapSeminorm Q s p q fun (x : Vec d) => u) = 0
                                          theorem HCPolySupport.cubeBesovOverlapSeminorm_zero {d : ℕ} (Q : TriadicCube d) (s : ℝ) (p q : ENNReal) (hp0 : p ≠ 0) (hpTop : p ≠ ⊤) (hq0 : q ≠ 0) (hqTop : q ≠ ⊤) :
                                          (cubeBesovOverlapSeminorm Q s p q fun (x : Vec d) => 0) = 0
                                          @[simp]
                                          theorem HCPolySupport.cubeBesovOverlapSeminormTop_const {d : ℕ} (Q : TriadicCube d) (s : ℝ) (p : ENNReal) (u : ℝ) (hp0 : p ≠ 0) (hpTop : p ≠ ⊤) :
                                          (cubeBesovOverlapSeminormTop Q s p fun (x : Vec d) => u) = 0
                                          theorem HCPolySupport.cubeBesovOverlapSeminormTop_zero {d : ℕ} (Q : TriadicCube d) (s : ℝ) (p : ENNReal) (hp0 : p ≠ 0) (hpTop : p ≠ ⊤) :
                                          (cubeBesovOverlapSeminormTop Q s p fun (x : Vec d) => 0) = 0
                                          @[simp]
                                          theorem HCPolySupport.cubeBesovOverlapNorm_const {d : ℕ} (Q : TriadicCube d) (s : ℝ) (p q : ENNReal) (u : ℝ) (hp0 : p ≠ 0) (hpTop : p ≠ ⊤) (hq0 : q ≠ 0) (hqTop : q ≠ ⊤) :
                                          (cubeBesovOverlapNorm Q s p q fun (x : Vec d) => u) = cubeBesovScaleWeight s Q * ‖u‖
                                          theorem HCPolySupport.cubeBesovOverlapNorm_zero {d : ℕ} (Q : TriadicCube d) (s : ℝ) (p q : ENNReal) (hp0 : p ≠ 0) (hpTop : p ≠ ⊤) (hq0 : q ≠ 0) (hqTop : q ≠ ⊤) :
                                          (cubeBesovOverlapNorm Q s p q fun (x : Vec d) => 0) = 0
                                          @[simp]
                                          theorem HCPolySupport.cubeBesovOverlapNormTop_const {d : ℕ} (Q : TriadicCube d) (s : ℝ) (p : ENNReal) (u : ℝ) (hp0 : p ≠ 0) (hpTop : p ≠ ⊤) :
                                          theorem HCPolySupport.cubeBesovOverlapNormTop_zero {d : ℕ} (Q : TriadicCube d) (s : ℝ) (p : ENNReal) (hp0 : p ≠ 0) (hpTop : p ≠ ⊤) :
                                          (cubeBesovOverlapNormTop Q s p fun (x : Vec d) => 0) = 0