Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)
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 Dirichlet Holder estimate from finite flattened charts

Statement

Assume the Axiom of Choice and Countable Choice. A bounded smooth domain Ω⊂R3 means a bounded nonempty open set whose boundary, after a rigid motion near each point, is the graph of a C∞ function with Ω on one side. Fix 0<α<1 and Cartesian coordinates on R3. A multi-index is β=(β1,β2,β3)∈N03, ∣β∣=β1+β2+β3, and Dβ=∂1β1∂2β2∂3β3. For k∈{0,2}, Ck,α(Ω‾) consists of real-valued functions whose partial derivatives through order k on Ω extend continuously to Ω‾ and for which

[q]0,α;Ω‾:=sup⁡x,y∈Ω‾x≠y∣q(x)−q(y)∣∣x−y∣α,∥q∥Ck,α(Ω‾):=∑∣β∣≤ksup⁡Ω‾∣Dβq∣+∑∣β∣=k[Dβq]0,α;Ω‾

is finite. In particular, ∥q∥C0(Ω‾):=sup⁡Ω‾∣q∣. There is C=C(Ω,α) such that every u∈C2,α(Ω‾) with zero boundary restriction satisfies

∥u∥C2,α(Ω‾)≤C(∥Δu∥C0,α(Ω‾)+∥u∥C0(Ω‾)).

The constant does not depend on higher derivatives of u; this is an a priori estimate, in particular for smooth approximants, not an assumed weak-to-classical existence theorem.

Facts & Assumptions

Given: The fixed domain, exponent and zero-boundary Hölder function in the Statement.

[A1]

The Axiom of Choice and Countable Choice are retained. The Axiom of Choice The Axiom of Countable Choice (ACω)

[F1]

A bounded smooth domain has smooth boundary graph charts. The chain rule computes transformed first and second derivatives. Bounded C^k domains and boundary charts The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a)

[F2]

The proved flat-face estimate controls the scaled C2,α norm on an inner half-ball by the outer supremum and the scaled Hölder norm of its Laplacian, including nonzero face values of that forcing. Flat Dirichlet Holder estimate by normal-jet lifting and reflection

[F3]

Compactly supported Hölder forcing has the proved Newtonian C2,α estimate. The same potential-plus-harmonic decomposition gives the interior ball estimate; the harmonic derivative bounds follow from the sphere-average identity and differentiation of a compact smooth averaging kernel. Newtonian cancellation and the three-dimensional Holder bound Divergence on a bounded C1 Euclidean domain

[F4]

A pointwise bounded equicontinuous finite-dimensional vector-valued sequence on a compact metric space has a uniformly convergent subsequence. Real and finite-dimensional Euclidean Ascoli–Arzelà criteria

Proof

1.1givenA1F1constructalgebra

Finite normalized charts. Near each boundary point rotate and translate so that the domain is x3>φ(x′), with φ(0)=0 and Dφ(0)=0. The shear Ψ(y′,t)=(y′,t+φ(y′)) maps the actual upper half-patch onto the domain portion of its image, and maps t=0 onto the boundary. Its inverse subtracts φ, its Jacobian determinant is one, and J=DΨ and J−1 are bounded on smaller compact patches. Compactness of the smooth boundary permits a finite initial atlas. Further recenterings at nearby boundary points and rotations to their tangent planes have uniformly bounded derivatives on a common smaller radius: in each initial compact graph patch the normal derivative is bounded away from zero and the graph derivatives are bounded; solving the graph identity and differentiating gives these uniform bounds. Thus arbitrarily small radii r can be used with one fixed bound on the first three chart derivatives, independent of the number of recentered patches.

2.1F1step 1.1algebra

For v=u∘Ψ, the chain rule gives Dyv=JTDxu and Dy2v=JTDx2uJ+∑kuxkDy2Ψk. Solving these identities expresses Δxu∘Ψ=aijDijv+biDiv, with a=J−1J−T, a(0)=I, and bounded smooth b. On a radius-r patch, ∥a−I∥∞≤Cr, while [a]α, ∥b∥∞ and [b]α are bounded uniformly for r below the fixed atlas radius. Chain/product differences also give two-sided control of the local C2,α norms. In particular the coefficient of the top-order seminorm in this comparison stays bounded as r↓0; terms involving derivatives of charts and derivatives of u of order at most two contribute a fixed-radius multiple of ∥u∥C2. This follows from [pq]α≤∥p∥∞[q]α+[p]α∥q∥∞ and [p∘Ψ]α≤[p]αLip⁡(Ψ)α.

3.1F2F3step 2.1algebra

Local freezing. Write f=Δu. In a boundary half-patch, Δyv=f∘Ψ+(I−a):D2v−b⋅Dv and v=0 on the flat face. Apply [F2], with outer radius r and inner radius r/2. The seminorm part of the principal error is bounded by Cr[D2v]α+Cr∥v∥C2; its supremum contributes only Cr∥v∥C2 after rescaling. The drift product and its seminorm contribute only Cr∥v∥C2 because Dv is Lipschitz on the convex half-ball. It follows, after the chart comparison in step 2.1, that [D2u]α;inner patch≤C0r[D2u]α;Ω+Cr(∥f∥C0,α+∥u∥C2), where C0 is independent of small r. For an interior ball, extend a cutoff times f by zero, subtract its Newtonian potential, and bound the harmonic remainder by the averaging-kernel argument in [F3]. This gives the same bound without the C0r term. No regularity of a weak solution has been assumed in this use of a priori estimates.

4.1step 1.1step 3.1constructalgebra

Global seminorm absorption. At a fixed sufficiently small r, take boundary centers forming an r-net in the compact boundary and interior balls of comparable radii for points farther from the boundary. Use outer patches with fixed larger radii proportional to r and controlled inner patches of radius proportional to r; the uniform bi-Lipschitz chart bounds of step 1.1 ensure that each point has a controlled inner patch containing its intersection with a Euclidean ball of radius cr, with c>0 independent of the number of centers. Compactness selects finitely many. A pair at distance below cr is therefore in one controlled patch; a pair farther apart has Hessian difference quotient at most 2(cr)−α∥D2u∥∞. Taking a maximum of the local estimates, not a sum over patches, yields [D2u]α;Ω≤C1r[D2u]α;Ω+Cr(∥f∥C0,α+∥u∥C2). Choose r with C1r<1/2 and absorb. Thus ∥u∥C2,α≤C(∥f∥C0,α+∥u∥C2), with the radius now fixed solely by the domain and exponent.

5.1F4step 4.1contradictionalgebra

Removing the lower derivative terms. If the stated estimate were false, normalize zero-boundary C2,α functions to obtain ∥uj∥C2,α=1 and ∥Δuj∥C0,α+∥uj∥∞→0. The finite chart atlas makes the function and gradient fields uniformly equicontinuous from their bounded next derivatives; the Hessians are equicontinuous from their common Hölder bound. Apply [F4] to this finite list of derivative fields. A subsequence converges uniformly on Ω‾; integration on coordinate segments in interior balls identifies its derivative fields. Since uj→0 uniformly, its first and second derivative limits vanish in the interior and, by continuity, on the closure. Thus ∥uj∥C2→0. Step 4.1 then gives 1≤C(∥Δuj∥C0,α+∥uj∥C2)→0, a contradiction. This proves the full a priori estimate with only the supremum of u on the right.

6.1F1F2F3F4step 5.1∎

All charts, radii and constants were fixed by Ω and α before the solution was chosen. Reflection and the Newtonian kernel enter through [F2], flattening and coefficient perturbation were derived in steps 1.1--3.1, and the finite-cover and compactness arguments in steps 4.1--5.1 complete the claimed global estimate. No published boundary or global Schauder theorem is an input.

Depends on

Dependency tree · 2 levels

Sources