All proofs
Project-declaredLean 4.29.0-rc6 · mathlib@5c8398df5281

Moser Reg Power Cutoff Witness grad

DeGiorgi.moserRegPowerCutoffWitness_grad

Plain-language statement

The gradient of moserRegPowerCutoffWitness decomposes as η · (chain rule) + (product rule). This is the analogue of deGiorgiCutoffTestWitnessWeighted_grad from Chapter 05.

Exact Lean statement

lemma moserRegPowerCutoffWitness_grad
    {u η : E → ℝ} {s ε N p Cη : ℝ}
    (hs : 0 < s) (hs1 : s ≤ 1) (hε : 0 < ε) (hN : 0 ≤ N)
    (hu1 : MemW1pWitness 2 u (Metric.ball (0 : E) 1))
    (hη : ContDiff ℝ (⊤ : ℕ∞) η)
    (hη_bound : ∀ x, |η x| ≤ 1)
    (hη_grad_bound : ∀ x, ‖fderiv ℝ η x‖ ≤ Cη)
    (x : E) (i : Fin d) :
    (moserRegPowerCutoffWitness (d := d) (p := p)
      hs hs1 hε hN hu1 hη hη_bound hη_grad_bound).weakGrad x i =
      η x * (moserRegClippedPosPartWitness (d := d) (u := u) (p := p)
        hs hs1 hε hN hu1).weakGrad x i +
      (fderiv ℝ η x) (EuclideanSpace.single i 1) *
        moserRegPow ε N p (min (max (u x) 0) N)

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
lemma moserRegPowerCutoffWitness_grad    {u η : E  } {s ε N p Cη : }    (hs : 0 < s) (hs1 : s  1) (hε : 0 < ε) (hN : 0  N)    (hu1 : MemW1pWitness 2 u (Metric.ball (0 : E) 1))    (hη : ContDiff  (⊤ : ∞) η)    (hη_bound :  x, |η x|  1)    (hη_grad_bound :  x, ‖fderiv  η x‖  Cη)    (x : E) (i : Fin d) :    (moserRegPowerCutoffWitness (d := d) (p := p)      hs hs1 hε hN hu1 hη hη_bound hη_grad_bound).weakGrad x i =      η x * (moserRegClippedPosPartWitness (d := d) (u := u) (p := p)        hs hs1 hε hN hu1).weakGrad x i +      (fderiv  η x) (EuclideanSpace.single i 1) *        moserRegPow ε N p (min (max (u x) 0) N) := by  -- moserRegPowerCutoffWitness = hwComp.mul_smooth_bounded η  -- mul_smooth_bounded.weakGrad x i = η x * hw.weakGrad x i + ∂ᵢη(x) * u(x)  -- This is definitionally true by the construction.  set_option maxHeartbeats 400000 in  simp only [moserRegPowerCutoffWitness, MemW1pWitness.mul_smooth_bounded,    moserRegClippedPosPartWitness, WithLp.ofLp_add, WithLp.ofLp_smul,    smul_eq_mul, Pi.add_apply, Pi.smul_apply]
Project
DeGiorgi
License
Apache-2.0
Commit
4c1b3077d378
Source
DeGiorgi/MoserIteration/CutoffPrep/RegularizedWitnesses.lean:165-185

Reuse this declaration

Bring the exact result into your workflow

The import identifies the source module. Your project still needs the pinned package dependency shown on this page.

What this badge means

This completion status comes from the project or community source. It has not yet been represented here as an independent rebuild and axiom audit.

Continue in this project

Related declarations

Project-declaredLean 4.29.0-rc6

Ae eq of tendsto e Lp Norm sub

BareFunction.ae_eq_of_tendsto_eLpNorm_sub

Plain-language statement

Lp limit uniqueness: if f_n → g₁ and f_n → g₂ in eLpNorm, then g₁ =ᵐ g₂.

partial differential equationsregularity theoryanalysis

Source project: DeGiorgi

Person-level attribution pending.

View proof record
Project-declaredLean 4.29.0-rc6

E Lp Norm pi le sum component

BareFunction.eLpNorm_pi_le_sum_component

Plain-language statement

Vector eLpNorm ≤ sum of component eLpNorms for Pi-valued functions. Uses eLpNorm_mono_real for the pointwise bound together with eLpNorm_sum_le for ℝ-valued functions, avoiding Pi instance synthesis.

partial differential equationsregularity theoryanalysis

Source project: DeGiorgi

Person-level attribution pending.

View proof record
Project-declaredLean 4.29.0-rc6

Mem Lp of tendsto e Lp Norm

BareFunction.memLp_of_tendsto_eLpNorm

Plain-language statement

If f n → g in eLpNorm and each f n ∈ Lp, then g ∈ Lp, provided g is AEStronglyMeasurable. Avoids the Lp type entirely. The key observation: eLpNorm (f n - g) → 0 means eLpNorm (f N - g) < 1 for some N. Then eLpNorm g ≤ eLpNorm (f N - g) + eLpNorm (f N) < ∞.

partial differential equationsregularity theoryanalysis

Source project: DeGiorgi

Person-level attribution pending.

View proof record