Schauder estimates Created 2026-10-14 Updated 2026-11-05
Schauder estimates control Hölder norms of derivatives of a solution to an elliptic differential equation. For a second-order uniformly elliptic operator with coefficients, where , interior estimates gain two derivatives over a forcing, while estimates up to a boundary also require regular boundary data.
On a bounded domain, a standard global Dirichlet problem estimate isHere denotes a extension of the prescribed boundary data. For homogeneous data choose . The constant depends on ellipticity, domain geometry, coefficient bounds and ; it is independent of the particular solution. The term allows a nontrivial homogeneous kernel and can be removed only with an additional uniqueness estimate.[ref]
The boundary term is essential. On the unit disk, is harmonic with supremum one but boundary second tangential derivative of size . Its global norm cannot be bounded using only zero forcing and that fixed supremum. An interior Schauder estimate remains valid on a smaller disk, whose distance from the boundary controls the constant. This separates interior regularity from control of rapidly oscillating boundary data.
Strong maximum principle for elliptic operators Created 2026-10-05 Updated 2026-10-06
For a locally uniformly elliptic operator with locally bounded coefficients and , a function satisfying on a connected domain cannot attain a nonnegative global maximum inside unless it is constant. If , the maximum can have either sign. If the maximum set were proper, choose an interior ball in its complement tangent to that set. The Hopf boundary point lemma gives a nonzero normal derivative at the contact point, contradicting the vanishing gradient at an interior maximum.
The strong minimum principle for elliptic operators follows by applying this to . For nonnegative with , replacing by retains the inequality, so the strict positivity-or-zero conclusion does not require an original sign restriction on .
Uniformly elliptic operator Created 2026-09-24 Updated 2026-11-05
For a real second-order principal coefficient matrix , uniform ellipticity means that one constant , independent of , satisfiesFor measurable coefficients the condition is imposed almost everywhere; for a classical pointwise operator it holds at every relevant point. The quadratic form depends only on the symmetric part of . Many estimates also assume a finite uniform upper bound or bounded full coefficients; the lower bound alone does not supply them.
For example, has lower bound one. On , the matrix is positive definite at each point but has no positive uniform lower bound: test as . On the restricted strip , a bound works. This distinguishes a strictly elliptic operator from a uniformly elliptic operator on the whole domain.
In a divergence-form elliptic operator, the same inequality controls the principal gradient energy. Together with bounded coefficients and the Poincaré inequality, it underlies coercivity and weak existence. A nonsymmetric coefficient matrix needs separate boundedness control, as shown by quadratic ellipticity does not bound a nonsymmetric coefficient matrix.[ref]
Weak Robin problem for a uniformly elliptic operator Created 2026-10-05 Updated 2026-10-06
For with smooth coefficients on a bounded smooth domain, the weak formulation of and conormal Robin boundary condition isThe bilinear form is bounded by the Sobolev trace theorem. If satisfy the positive uniformly elliptic operator inequality, the multiplicative trace inequality on a bounded smooth domain and the Young inequality show that the form is coercive when is sufficiently large, even if and have negative parts. The Lax-Milgram theorem then gives a unique weak solution for every .
Weighted Jacobi eigenvalues for a square Dirichlet grid Created 2026-10-06 Updated 2026-11-05
Consider the five-point discretization of the uniformly elliptic operator with on the unit square, with homogeneous Dirichlet boundary conditions. Let and . In the discrete sine basis, the weighted Jacobi method has iteration matrix eigenvaluesEach one-dimensional second difference contributes , and the matrix diagonal is , giving the displayed ratio. Its value is strictly between zero and two for every finite grid. Thus puts every iteration eigenvalue strictly inside the unit circle and gives convergence on every grid. At , the highest-frequency factors approach minus one as , so convergence holds while high-frequency smoothing is poor.