Linfty subsolution De Giorgi exists threshold
DeGiorgi.linfty_subsolution_DeGiorgi_exists_threshold
Plain-language statement
Existence of a threshold realizing the De Giorgi L∞ estimate.
Exact Lean statement
theorem linfty_subsolution_DeGiorgi_exists_threshold
(hd : 2 < (d : ℝ))
(A : EllipticCoeff d (Metric.ball (0 : E) 1))
{u : E → ℝ}
(hsub : IsSubsolution A u)
(hposInt :
IntegrableOn (fun x => |max (u x) 0| ^ 2)
(Metric.ball (0 : E) 1) volume) :
∃ lamStar : ℝ,
0 < lamStar ∧
C_DeGiorgi_subsolution d A *
Real.sqrt (∫ x in Metric.ball (0 : E) 1, |max (u x) 0| ^ 2 ∂volume) ≤
lamStar ∧
∀ᵐ x ∂(volume.restrict (Metric.ball (0 : E) (1 / 2 : ℝ))),
max (u x) 0 ≤ lamStarFormal artifact
Lean source
theorem linfty_subsolution_DeGiorgi_exists_threshold (hd : 2 < (d : ℝ)) (A : EllipticCoeff d (Metric.ball (0 : E) 1)) {u : E → ℝ} (hsub : IsSubsolution A u) (hposInt : IntegrableOn (fun x => |max (u x) 0| ^ 2) (Metric.ball (0 : E) 1) volume) : ∃ lamStar : ℝ, 0 < lamStar ∧ C_DeGiorgi_subsolution d A * Real.sqrt (∫ x in Metric.ball (0 : E) 1, |max (u x) 0| ^ 2 ∂volume) ≤ lamStar ∧ ∀ᵐ x ∂(volume.restrict (Metric.ball (0 : E) (1 / 2 : ℝ))), max (u x) 0 ≤ lamStar := by let I₀ : ℝ := ∫ x in Metric.ball (0 : E) 1, |max (u x) 0| ^ 2 ∂volume have hI₀_nonneg : 0 ≤ I₀ := by dsimp [I₀] refine integral_nonneg ?_ intro x positivity have hbound := linfty_subsolution_DeGiorgi (d := d) hd A hsub hposInt by_cases hI₀_zero : I₀ = 0 · refine ⟨1, by norm_num, ?_, ?_⟩ · have hsmall_zero : C_DeGiorgi_subsolution d A * Real.sqrt I₀ = 0 := by simp [I₀, hI₀_zero] rw [hsmall_zero] norm_num · filter_upwards [hbound] with x hx have hsqrt_zero : Real.sqrt (∫ x in Metric.ball (0 : E) 1, |max (u x) 0| ^ 2 ∂volume) = 0 := by rw [show (∫ x in Metric.ball (0 : E) 1, |max (u x) 0| ^ 2 ∂volume) = I₀ by rfl, hI₀_zero] simp have hsmall_zero' : C_DeGiorgi_subsolution d A * Real.sqrt (∫ x in Metric.ball (0 : E) 1, |max (u x) 0| ^ 2 ∂volume) = 0 := by rw [hsqrt_zero] ring have hx_pair : u x ≤ C_DeGiorgi_subsolution d A * Real.sqrt (∫ x in Metric.ball (0 : E) 1, |max (u x) 0| ^ 2 ∂volume) ∧ 0 ≤ C_DeGiorgi_subsolution d A * Real.sqrt (∫ x in Metric.ball (0 : E) 1, |max (u x) 0| ^ 2 ∂volume) := by simpa using hx rw [hsmall_zero'] at hx_pair have hx_zero : max (u x) 0 ≤ 0 := by exact max_le_iff.mpr ⟨hx_pair.1, le_rfl⟩ linarith · let lamStar : ℝ := C_DeGiorgi_subsolution d A * Real.sqrt I₀ have hLamStar : 0 < lamStar := by have hI₀_pos : 0 < I₀ := lt_of_le_of_ne hI₀_nonneg (by simpa [eq_comm] using hI₀_zero) dsimp [lamStar, I₀] exact deGiorgi_exact_height_threshold_on_unitBall (d := d) (K := K_DeGiorgi_subsolution d A) (K_DeGiorgi_subsolution_pos (d := d) A) hI₀_pos refine ⟨lamStar, hLamStar, le_rfl, ?_⟩ simpa [lamStar, I₀] using hbound- Project
- DeGiorgi
- License
- Apache-2.0
- Commit
- 4c1b3077d378
- Source
- DeGiorgi/DeGiorgiIteration/Linfty.lean:1230-1289
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
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₂.
Source project: DeGiorgi
Person-level attribution pending.
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.
Source project: DeGiorgi
Person-level attribution pending.
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) < ∞.
Source project: DeGiorgi
Person-level attribution pending.