Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Global Schauder estimate and classical Dirichlet solvability by the continuity method

Statement

Assume the Axiom of Choice and Countable Choice. Let n≥2, 0<α<1, let Ω be a bounded C2,α domain and let L=aij∂i∂j+bi∂i+c be uniformly elliptic on Ωˉ, with aij,bi,c∈C0,α(Ωˉ), constants λ,Λ, [A]0,α≤K, and ∥b∥C0,α+∥c∥C0,α≤M. Put X:={u∈C2,α(Ωˉ):u∣∂Ω=0} and Lt:=tL+(1−t)Δ for t∈[0,1]. Assume that each Lt:X→C0,α(Ωˉ) is injective. Then every Lt is bijective; in particular every f∈C0,α(Ωˉ) and g∈C2,α(Ωˉ) determine a unique classical solution of Lu=f in Ω, u=g on ∂Ω, and ∥u∥C2,α(Ωˉ)≤C(∥f∥C0,α(Ωˉ)+∥g∥C2,α(Ωˉ)), where C is uniform in t,u,f,g.

Facts & Assumptions

Given: the Axiom of Choice and Countable Choice, n≥2, 0<α<1, the bounded C2,α domain Ω, the operator L with the stated coefficient bounds, the family Lt=tL+(1−t)Δ, and the hypothesis that every Lt is injective on X.

[A1]

The Axiom of Choice and Countable Choice are used through the Banach-space, maximum-principle, Arzela-Ascoli and Schauder-regularity inputs; the further choices in the contradiction argument are finite or sequential. (The Axiom of Choice, The Axiom of Countable Choice (ACω))

[F1]

The closure class C2,α(Ωˉ) and its zero-boundary subspace X are Banach spaces, as is Y:=C0,α(Ωˉ), with the full finite Hölder norms. These are precisely the boundary-extension classes and closed subspaces of The closure Hölder spaces are Banach spaces; no identification with all of Cb2,α(Ω) is needed.

[F2]

Each Lt maps X boundedly into Y, with a bound uniform in t: ∥Ltu∥C0,α≤CL∥u∥C2,α for u∈X and t∈[0,1], because the coefficients are bounded in C0,α and the principal matrices At=tA+(1−t)I are uniformly elliptic with constants min⁡{λ,1},max⁡{Λ,1}, C0,α seminorm at most K and lower-order coefficient bounds at most M. Moreover t↦Lt is affine, so Lt−Ls=(t−s)(L−Δ) with ∥(L−Δ)u∥C0,α≤CL′∥u∥C2,α. (Uniformly elliptic nondivergence-form operators and their frozen coefficients)

[F3]

Uniform boundary Schauder estimate (Boundary Schauder estimate for the Dirichlet problem): applied to Lt with the uniform constants of [F2], it gives ∥u∥C2,α(Ωˉ)≤C1(∥Ltu∥C0,α(Ωˉ)+∥u∥C0(Ω))(u∈X, t∈[0,1]), with C1 depending only on n,α, the uniform ellipticity and coefficient bounds and Ω.

[F4]

Compactness: a sequence bounded in X has a subsequence converging in C2(Ωˉ); this is the vector-valued Arzela-Ascoli theorem Real and finite-dimensional Euclidean Ascoli–Arzelà criteria applied to the maps x↦(uj(x),∇uj(x),D2uj(x)), which are equicontinuous and pointwise bounded because ∥uj∥C2,α≤1. (Arzelà--Ascoli for real C(K) under Countable Choice and Dependent Choice: compact closure iff equicontinuous and pointwise bounded)

[F5]

Base point: L0=Δ is bijective from X to Y. Injectivity: if Δu=0 on Ω with u=0 on ∂Ω, the weak maximum principle (applied to u and −u, componentwise for complex functions) gives u=0. Surjectivity: given h∈Y, put f:=−h∈C0,α(Ωˉ) and let u be the weak solution of −Δu=f with zero boundary values given by Global Schauder regularity for the weak Dirichlet Laplacian; then u∈C2,α(Ωˉ), u=0 on ∂Ω and Δu=h pointwise, so L0u=h. (Weak maximum principle for the laplacian)

[F6]

Method of continuity (The method of continuity for a uniformly estimated affine family of bounded operators): if L0 is bijective and, for some 0≤C<∞, ∥x∥X≤C∥Ltx∥Y holds for all t∈[0,1] and all x∈X, then every Lt is bijective with ∥Lt−1∥≤C.

Proof

technique · direct
1.1F1F2givenA1

Setting. By [F1], X and Y are Banach spaces over the same field, and by [F2] each Lt is a bounded operator X→Y forming an affine family Lt=(1−t)L0+tL1 with L0=Δ and L1=L. It remains to verify the two hypotheses of [F6]: the bijectivity of L0 and the uniform a priori estimate.

1.2F2F3

The estimate with the supremum term. By [F3], for every u∈X and t∈[0,1], ∥u∥C2,α(Ωˉ)≤C1(∥Ltu∥C0,α(Ωˉ)+∥u∥C0(Ω)). This is the only place where the boundary Schauder estimate enters; its constant is uniform in t because the family is uniformly elliptic with uniformly bounded C0,α coefficients.

2.1step 1.2F2F4givencontradiction

Removing the supremum term. Suppose the uniform estimate ∥u∥X≤C∥Ltu∥Y failed for every finite C. Then for each j∈N there are tj∈[0,1] and uj∈X with ∥uj∥C2,α=1 and ∥Ltjuj∥C0,α<1/(j+1). By step 1.2, 1≤C1(1/(j+1)+∥uj∥C0), so ∥uj∥C0≥1/(2C1) for all large j. By [F4] and compactness of [0,1] there is a subsequence, relabelled, with tj→t and uj→u in C2(Ωˉ); then ∥u∥C0=lim⁡∥uj∥C0≥1/(2C1)>0, so u≠0, and u∣∂Ω=0 because uj∣∂Ω=0 and the convergence is uniform. Moreover Ltu=0: indeed Ltjuj=Ltuj+(tj−t)(L−Δ)uj; the second term tends to 0 in the C0,α norm by [F2] and ∣tj−t∣→0 with ∥uj∥C2,α=1, while Ltuj→Ltu in the supremum norm because uj→u in C2 and the coefficients of Lt are fixed continuous functions; since Ltjuj→0 in Y, it follows that Ltu=0. For distinct x,y, pass the uniformly bounded Hessian difference quotients to the C2 limit to obtain [D2u]0,α≤lim inf⁡j[D2uj]0,α<∞. Hence u∈X, so the injectivity hypothesis on Lt forces u=0, contradicting u≠0. Hence there is 0<C<∞ with ∥u∥C2,α≤C∥Ltu∥C0,α for all u∈X and t∈[0,1].

3.1F5step 2.1

The base point is bijective. By [F5], L0=Δ is injective and surjective, hence bijective, with ∥L0−1∥≤C already implied by the uniform estimate of step 2.1.

4.1step 2.1step 3.1F6

The method of continuity. Applying [F6] with L0=Δ, L1=L, the uniform estimate of step 2.1 and the bijectivity of step 3.1, every Lt:X→Y is bijective and ∥Lt−1∥Y→X≤C with the same constant C for all t∈[0,1].

5.1step 4.1F2algebra

Nonzero boundary data. Let f∈Y, g∈C2,α(Ωˉ) and fix t∈[0,1]. Since Ltg∈Y and Lt is bijective by step 4.1, there is a unique u0∈X with Ltu0=f−Ltg; then u:=u0+g lies in C2,α(Ωˉ), satisfies Ltu=f in Ω and u=g on ∂Ω, and ∥u∥C2,α≤∥u0∥C2,α+∥g∥C2,α≤C∥f−Ltg∥C0,α+∥g∥C2,α≤C′(∥f∥C0,α+∥g∥C2,α) by [F2], with C′ independent of t and of (u,f,g). Uniqueness for fixed t follows from injectivity: two solutions differ by an element of X in the kernel of Lt.

6.1step 4.1step 5.1F6given∎

Conclusion. Under the stated injectivity hypothesis, the affine family Lt satisfies the uniform a priori estimate of step 2.1 and has the bijective base point L0=Δ of step 3.1; the method of continuity therefore makes every Lt bijective, uniformly in t, and subtracting a C2,α extension of the boundary datum produces the classical solution of the Dirichlet problem for L with the displayed estimate. In particular the injectivity hypothesis can be verified separately for each t (a separate uniqueness argument must respect the displayed positive-principal-part sign convention), and the conclusion is a genuine existence statement for classical solutions, obtained without compactness of the operator L itself.

Remarks

  • The two structural inputs are the boundary Schauder estimate, which supplies the uniform a priori bound, and the weak solvability of the Dirichlet Laplacian (through the maximum principle and the global Schauder regularity theorem), which supplies the bijective base point. The contradiction step uses Arzela-Ascoli to rule out a loss of the supremum term.
  • The constant is uniform in t because the uniform coefficient bounds and injectivity on the fixed compact parameter family give the estimate in step 2.1; the theorem does not use symmetry of L, and the injectivity hypothesis is the exact place where a possible eigenvalue of the family is excluded.

Depends on

Used by

Dependency tree · two levels

67 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources