Alphabeta Math
Pipeline-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.

✓ 18 results · all verified · 8 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 10 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Neural operators and PINN consistency

1 · Prerequisites

2 · Logical flowchart

3 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Discretization-invariant operator family

Definition

Let A and U be real Banach spaces of functions on bounded domains D and D′, with the input point evaluations used below defined. For every n≥1, choose finite-dimensional normed spaces En,Fn, an exactly defined sampling map Sn:A→En (for example, Sn(a)=(a(ξn,1),…,a(ξn,Nn)) at specified input points), a finite-dimensional map G~n:En→Fn, and an output reconstruction map Rn:Fn→U. The reconstruction supplies a function with a defined value at every point of D′. The corresponding continuum-valued discrete map is Gn(a):=Rn(G~n(Sn(a)))∈U. A family (Gn)n≥1 is a discretization-invariant approximation of an operator G:A→U if its sampling maps and output reconstructions are part of the family and it approximates this single continuum operator as the input discretization is refined. In the compact-uniform version, for every compact K⊂A, sup⁡a∈K∥Gn(a)−G(a)∥U⟶0. For K=∅, the supremum of this nonnegative error is defined to be 0. When A consists of almost-everywhere equivalence classes, the sampling map must be explicitly defined on those classes or use a specified representative convention; point evaluation is not inferred from the equivalence class alone. This definition does not identify unrelated grid-specific maps as one operator family.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Physics-informed residual loss and Hölder regularization

Definition

Let U⊂Rd be a bounded Lipschitz domain, let Γ⊆∂U be closed, let L be a differential operator on U, and let B be a boundary operator on Γ. Let f:U→R and g:Γ→R be target data. For a trial function h, define its residuals by rh(x)=L[h](x)−f(x) and qh(x)=B[h](x)−g(x). For 0<α≤1 and a function v on a set E, define its Hölder seminorm by [v]α;E=sup⁡x≠y∈E∣v(x)−v(y)∣∣x−y∣α. Set [v]α;E=0 when E has fewer than two points. Only trial functions for which L[h] on U and B[h] on Γ are pointwise defined and finite are admitted. For the population loss, require f,rh to be measurable with respect to (U,μr) and g,qh to be measurable with respect to (Γ,μb). For positive fixed weights λr,λb and probability measures μr on U, μb on Γ, the population loss is Loss⁡PINN(h;λ)=λr∫U∣rh∣2 dμr+λb∫Γ∣qh∣2 dμb. These nonnegative population integrals take values in [0,+∞], so they may be infinite. The Hölder seminorms below may likewise be infinite.

For d≥2, given positive integer counts mr,mb, residual collocation points xr1,…,xrmr, and boundary collocation points xb1,…,xbmb, the empirical loss is Loss⁡mPINN(h;λ)=λrmr∑i=1mr∣rh(xri)∣2+λbmb∑j=1mb∣qh(xbj)∣2. For d=1, a bounded Lipschitz domain has finite boundary, so Γ is finite. In this branch require every singleton {y}⊆Γ to be μb-measurable. When every point of Γ is available deterministically, define its exact full-boundary contribution by Loss⁡PINN,b(h;λb)=λb∑y∈Γμb({y})∣qh(y)∣2=λb∫Γ∣qh∣2 dμb, and, for a positive integer count mr and residual collocation points xr1,…,xrmr, set Loss⁡mPINN(h;λ)=λrmr∑i=1mr∣rh(xri)∣2+Loss⁡PINN,b(h;λb). For d≥2, its Hölder-regularized version is Loss⁡m(h;λ,λmR)=Loss⁡mPINN(h;λ)+λr,mR[L[h]]α;U2+λb,mR[B[h]]α;Γ2. For d=1, the Hölder-regularized version is Loss⁡m(h;λ,λmR)=Loss⁡mPINN(h;λ)+λr,mR[L[h]]α;U2; it uses the exact full-boundary contribution above, has no random boundary sample, and has no boundary seminorm penalty. Require the regularization coefficients appearing in either version to be nonnegative; a zero coefficient contributes zero even when its seminorm is infinite. For finite realized sample lists the empirical sums are finite; the regularized objective is allowed to take the value +∞. These are population and empirical functionals; they do not specify an optimization algorithm or assert that training reaches a global minimizer.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Shin's positive divergence-form operator

Definition

Let U⊂Rd be open. For finite real coefficient functions aij,bi,ci,d on U, the positive divergence-form expression is L[u]=∑i,j=1dDi(aijDju)+∑i=1dDi(biu)+∑i=1dciDiu+du. Its classical domain consists of those u∈C2(U) for which every displayed flux derivative Di(aijDju) and Di(biu) exists pointwise and is finite on U. The classical formula assigns no value outside this domain. In particular, if each Diaij and Dibi exists pointwise and is finite, the product rule makes every u∈C2(U) admissible and gives the nondivergence expansion L[u]=∑i,j=1daijDiDju+∑j=1db~jDju+c~ u, with b~j=∑i=1dDiaij+bj+cj,c~=∑i=1dDibi+d. The positive divergence convention here means that the principal part is +∑i,jDi(aijDju). This sign is part of the definition.

When a weak formulation is used, its divergence derivatives are instead distributional derivatives of locally integrable fluxes, with the integrability hypotheses supplied in that formulation. Equality with a pointwise expression requires separate justification; pointwise differentiability alone does not assert it.

Source indexing discrepancy

The source displays ∑i,jDi(aijDju+biu) while its expanded coefficients and energy argument count Di(biu) only once. Read literally, that displayed sum instead gives d∑iDi(biu) and changes both the drift and potential. The active definition above separates the two sums explicitly and agrees with the stated expanded coefficients. The original printed expression is retained here as a source discrepancy, not used as an algebraic identity.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Shin's parabolic operator, data, and initial-lateral boundary

Definition

Let U⊂Rd be nonempty, bounded, and open, let T>0, and set Q=U×(0,T) and ΓT=(Uˉ×{0})∪(∂U×[0,T]). The final-time face U×{T} is excluded from ΓT. For time-dependent coefficients define Lt[u]=∑i,j=1dDi(aij(x,t)Dju)+∑i=1dDi(bi(x,t)u)+∑i=1dci(x,t)Diu+d(x,t)u. Where the coefficient derivatives exist, write its nondivergence expansion as Lt[u]=∑i,jaijDiDju+∑ib~iDiu+c~ u, where b~i=∑jDjaji+bi+ci and c~=∑iDibi+d. For symmetric a, the drift also equals ∑jDjaij+bi+ci, the form used by the symmetric source consumers. The initial-boundary value problem uses the sign convention −ut+Lt[u]=fin Q,u=φon ∂U×[0,T],u=gon Uˉ×{0}, with compatibility g(x)=φ(x,0) on ∂U. Its residual for a trial function h is f+ht−Lt[h], and its prescribed-data error is measured on ΓT.

For the source notation C2+α(Q), use the parabolic distance dp((x,t),(y,s))=(∣x−y∣2+∣t−s∣)1/2. Let B=U×{0} and Sτ=∂U×[0,τ]. For P=(x,τ)∈Q, set δ(P)=inf⁡R∈B∪Sτdp(P,R) and δP,Q=min⁡{δ(P),δ(Q)}. For an integer m≥0, define ∣v∣m,α=sup⁡P∈Qδ(P)m∣v(P)∣+sup⁡P≠Q∈QδP,Qm+α∣v(P)−v(Q)∣dp(P,Q)α. The class C2+α(Q) consists of functions for which ∣u∣0,α+∑i∣Diu∣1,α+∑i,j∣Diju∣1,α+∣ut∣2,α<∞, with the indicated derivatives continuous in Q. This fixes the source's weighted parabolic Hölder convention.

Source indexing discrepancy

The source displays ∑i,jDi(aijDju+biu) while its expanded coefficients and energy argument count Di(biu) only once. Read literally, that displayed sum instead gives d∑iDi(biu) and changes both the drift and potential. The active definition above separates the two sums explicitly and agrees with the stated expanded coefficients. The original printed expression is retained here as a source discrepancy, not used as an algebraic identity.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Lower cell-mass bounds give a random fill-distance estimate

Statement

Let d≥1, s>0, and let X⊂Rd carry a probability measure μ. Fix an integer m≥1 and c>0, and put ε=(cm)−1/s. Suppose there is a finite measurable partition X1,…,XK of X at this particular scale such that each cell lies in a cube of side ε and μ(Xj)≥cεs. Let Y1,…,Ym be independent random points each with law μ. Then with probability at least 1−m(1−1m)m every point of X lies within Euclidean distance d c−1/sm−1/(2s) of at least one sample point. For an interior space of dimension d, use s=d; for a boundary space of Hausdorff dimension d−1>0, use s=d−1 and its own cell-mass constant. If d=1 and every boundary point is available deterministically, the boundary fill distance is zero and no random boundary sample is needed.

Facts & Assumptions

Given: The finite partition at the selected scale, its cell-mass lower bound, and m independent samples with common law μ.

[F1]

A probability measure is finitely subadditive, so the probability of a finite union of missed-cell events is at most the sum of their probabilities (Measures on sigma-algebras, Finite and countable subadditivity of measures).

[F2]

Independent random elements with common law μ have product law on each finite tuple; hence the probability that all m samples miss a cell of measure pj is (1−pj)m (Independent random elements).

[F3]

Countable additivity, applied to the finite disjoint partition followed by empty sets, makes the cell measures sum to the measure of the whole space (Measures on sigma-algebras).

Proof

Proof strategy: coupon-collector union bound.

1.1givenF3algebra

The cell measures sum to one by [F3], and each is at least cεs=1/m. Therefore the number of cells is at most m.

1.2givenF1F2algebra

A fixed cell of mass pj≥cεs=1/m is missed by all m independent samples with probability (1−pj)m≤(1−1/m)m by [F2]. By [F1], the probability that at least one cell is missed is at most m(1−1/m)m.

2.1step 1.1step 1.2algebra∎

On the complementary event, every cell contains a sample. Since each cell lies in a cube of side ε, any point of the cell is within the cube's Euclidean diameter dε of a sample in that same cell. Substituting ε=(cm)−1/s gives the stated fill radius and probability.

Remarks

It suffices to assume the partitions exist for 0<ε≤ε0 and then restrict to m≥max⁡{1,c−2ε0−2s}. Indeed, this is exactly the condition (cm)−1/s≤ε0. For upper ball-mass bounds used at the fill radius, also require D(cm)−1/s≤ρ0 if their range is 0<ρ≤ρ0. The normalized Appendix B mass is cεs=1/m, so its failure probability is m(1−1/m)m, independently of c. If one deliberately chooses 0<c≤1, this is no larger than m(1−c/m)m, recovering the weaker later printed probability with those same chosen constants. Replacing a lower-mass constant by a smaller one is valid, but all radii, Cm, and regularization thresholds must then use the new constant. No such replacement is made implicitly.

LemmaStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

The printed all-scale probability cell-mass bound is inconsistent

Statement

Let X be a nonempty measurable space, let d≥1, let c>0, and let μ be a probability measure on X. There is no family of finite measurable partitions Pε of X, one for every ε>0, for which every cell E∈Pε satisfies μ(E)≥cεd.

Facts & Assumptions

Given: A probability measure μ on nonempty X, an integer d≥1, and a constant c>0.

[F1]

A probability measure satisfies μ(X)=1 (Probability measures and probability spaces).

[F2]

If E⊆X is measurable, then μ(E)≤μ(X) (Measures are monotone).

Proof

technique · choose one scale at which the asserted lower bound exceeds total mass
1.1givenF1F2choose

Choose ε>c−1/d. Since X is nonempty, any partition of X has at least one cell E. The set E is measurable and E⊆X, so [F1] and [F2] give μ(E)≤1.

2.1givenstep 1.1algebracontradiction∎

The asserted lower bound gives μ(E)≥cεd>1, contradicting step 1.1. Hence no such all-scale family of partitions exists.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

A smooth radial profile with a prescribed inner plateau

Statement

There exists b∈Cc∞(R) with 0≤b≤1, b(x)=1 for ∣x∣≤1, and b(x)=0 for ∣x∣≥2, such that the profile χ:[0,∞)→R defined by χ(r)=b(4r) is the restriction of a smooth function on R, equals 1 for 0≤r≤1/4, and equals 0 for r≥1/2.

Here Cc∞(R) denotes the infinitely differentiable, compactly supported real-valued functions.

Facts & Assumptions

Given: A one-dimensional smooth cutoff with unit plateau radius 1 and support radius 2 as stated in [F1].

[F1]

In dimension one there exists b∈Cc∞(R) with 0≤b≤1, b=1 on ∣x∣≤1, and b=0 on ∣x∣≥2 (Explicit compactly supported smooth cutoffs).

[F2]

Composition of a smooth function with an affine map is smooth, by the chain rule (The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a)).

Proof

technique · direct
1.1F1choose

Choose b supplied by [F1] and set χ(r)=b(4r) for r≥0.

2.1step 1.1F1F2algebra∎

The function x↦b(4x) is smooth by [F2], so its restriction is the stated smooth profile. If 0≤r≤1/4, then ∣4r∣≤1 and b(4r)=1; if r≥1/2, then ∣4r∣≥2 and b(4r)=0. The bounds on b are inherited by composition.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Uniformly convergent images of a compact set have compact union

Statement

Let (X,dX) and (Y,dY) be metric spaces, let K⊆X be compact, and let f,fn:X→Y be continuous for every integer n≥1. Suppose that for every ε>0 there is N≥1 such that dY(fn(x),f(x))<ε for all n≥N and all x∈K. Then W=f[K]∪⋃n=1∞fn[K] is compact in Y. The empty-set case is included, and the proof uses no choice principle.

Facts & Assumptions

Proof

technique · open-cover argument with a uniform neighborhood of the limit image
1.1givenF1F2cases

If K=∅, then W=∅ and it is compact. Otherwise let V be any family of open subsets of Y covering W. By [F2], f[K] is compact, so [F1] gives finitely many V1,…,Vq∈V covering f[K]. Set O=⋃i=1qVi, an open set containing f[K].

2.1step 1.1F1F3algebra

Form the family of all balls BY(y,r) with y∈f[K], r>0, and BY(y,2r)⊆O. This family covers f[K] by openness and [F3], so [F1] gives a finite subcover with centers y1,…,ys and radii r1,…,rs. Since f[K]≠∅, s≥1; let δ=min⁡iri>0. If z∈Y and dY(z,y)<δ for some y∈f[K], choose i with dY(y,yi)<ri; then dY(z,yi)<δ+ri≤2ri, so z∈BY(yi,2ri)⊆O. Thus every point within distance δ of some point of f[K] lies in O.

3.1givenstep 2.1algebra

Uniform convergence supplies N≥1 such that dY(fn(x),f(x))<δ for every x∈K and every n≥N. Since f(x)∈f[K], step 2.1 implies fn[K]⊆O for every n≥N.

4.1step 1.1step 3.1F1F2algebra∎

For each of the finitely many indices 1≤n<N, [F2] makes fn[K] compact, so [F1] supplies a finite subfamily of V covering it. Together with V1,…,Vq from step 1.1, these finitely many members cover f[K], all fn[K] with n≥N, and each remaining fn[K]. Hence every open cover of W has a finite subcover, so W is compact by [F1]. The proof uses only finite subcovers and a finite minimum, not a choice axiom.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

The neural-operator input and output spaces have the approximation property

Statement

Assume Countable Choice. Let D⊂Rd be a bounded Lipschitz domain. Each of the real spaces Lp(D) for 1≤p<∞, Wm,p(D) for m∈N and 1≤p<∞, and Cm(Dˉ) for m∈N0 has the approximation property: on every norm-compact subset, the identity can be approximated uniformly by bounded finite-rank linear maps. Here the Cm norm is the maximum of the uniform norms of the derivatives through order m, extended continuously to Dˉ. For any bounded Lipschitz domain D′⊂Rd′, the corresponding real output spaces Lp2(D′) for 1≤p2<∞, Wm2,p2(D′) for m2∈N and 1≤p2<∞, and Cm2(D′‾) for m2∈N0 also have the approximation property.

Facts & Assumptions

Given: Countable Choice, a bounded Lipschitz domain and one of the listed real function spaces.

[F1]

For every listed space, every norm-compact set and every positive error, a bounded finite-rank map with that compact-uniform error exists, with range consisting of restrictions of compactly supported ambient smooth functions (Inward mollification and smooth finite-rank approximation on Lipschitz domains).

[F2]

AP for a Banach space means uniform approximation of the identity on each norm-compact subset by bounded finite-rank linear maps (Approximation property and bounded approximation property).

[F3]

Under Countable Choice, the integer-order Sobolev formula is a norm and W0,p=Lp, and real Lp is complete (Integer-order Sobolev spaces and their norms, The Sobolev norm descends to equivalence classes, Riesz-Fischer completeness of Lp for 1≤p≤∞).

[F4]

Hölder bounds the integral pairing by the product of conjugate norms, including conjugate exponents 1 and ∞ (Holder's inequality for integrals, including the endpoint cases).

[F5]

For a continuously differentiable real curve on a compact interval, the integral of its derivative is its endpoint difference; a continuous integrand has its integral as a differentiable primitive (Fundamental theorem of calculus for Banach-valued continuous curves).

Choice use: Countable Choice supplies the Lp completeness and weak-derivative interfaces in [F3], the calculus interface [F5], and the inward-mollification lemma [F1]. The final passage to AP makes no additional selections from infinite families.

Proof

1.1F3F4givenconstruct

The listed Sobolev spaces are Banach under the stated Countable Choice hypothesis. Indeed, let (un) be Cauchy in Wm,p(D). By [F3], for each of the finitely many ∣α∣≤m, Dαun converges in Lp to a class vα; put u=v0. For any ϕ∈Cc∞(D), its derivatives are bounded with compact support, hence belong to the conjugate Lp′ space, including p′=∞ when p=1. By [F4], both integrals in ∫DunDαϕ=(−1)∣α∣∫DDαunϕ converge to the corresponding integrals of u and vα. Thus vα is the weak derivative Dαu by [F3], so u∈Wm,p(D), and the finite norm sum gives un→u in that norm. This includes m=0, which gives Lp(D).

1.2F5givenconstructalgebra

The listed Cm(Dˉ) spaces are Banach as well. If (un) is Cauchy in their norm, every derivative sequence has a uniform limit gα on Dˉ: pointwise real completeness gives the limit, and the uniform Cauchy estimate gives uniform convergence. Each gα is continuous, since for a positive error one first approximates it uniformly by a fixed continuous Dαun and then applies continuity of that fixed function. Put u=g0. For ∣α∣<m, an interior point x, and a coordinate direction ei, take h small enough that the segment x+[0,h]ei lies in D. By [F5], Dαun(x+hei)−Dαun(x)=∫0hDα+eiun(x+sei) ds. Uniform convergence passes this identity to gα(x+hei)−gα(x)=∫0hgα+ei(x+sei) ds, since the integral error is bounded by ∣h∣ times the uniform error. By [F5], ∂igα=gα+ei. Induction in ∣α∣ yields Dαu=gα in D through order m, with the continuous extensions already supplied on Dˉ. Thus u∈Cm(Dˉ) and un→u in norm. For m=0 only the uniform-limit continuity argument is needed. The displayed maximum is a norm because its order-zero term detects zero functions and the remaining norm axioms hold termwise.

2.1F1F2F3step 1.1step 1.2given

Fix one listed space X, a norm-compact K⊆X, and ε>0. Its Banach-space status was established in the two preceding steps. Apply [F1], using W0,p=Lp in the Lebesgue case, to obtain a bounded finite-rank F:X→X with sup⁡u∈K∥Fu−u∥X<ε. These are exactly the quantified requirements of [F2], so every listed space has AP, including every p=1 case.

3.1step 2.1given∎

The argument in step 2.1 holds for every Euclidean dimension, every nonnegative integer regularity and every finite exponent in the stated ranges. Applying it with the output dimension and output regularity parameters proves the output-space clause. The proof establishes AP for Cm(Dˉ) without any basis assertion.

AlgorithmAlgorithm: Literature-sourcedProof: Not applicableOpen item page →

Empirical Hölder-regularized PINN objective

Definition

Inputs are a dimension d≥1, the data and operators specified in the physics-informed residual loss definition, 0<α≤1, positive weights λr,λb, and an admissible trial function h. The procedure returns the scalar empirical objective value Jm(h). It uses the realized sample points and target values as inputs; it does not generate random samples.

For d≥2, also supply positive integer counts mr,mb, residual samples xr1,…,xrmr∈U with their observed values f(xri), boundary samples xb1,…,xbmb∈Γ with their observed values g(xbj), constants cr,cb,Cr,Cb>0, and small-scale cutoffs ℓ0,i,ρ0,i>0. At the selected partition scales 0<ℓi≤ℓ0,i, require cells Ujℓr and Γjℓb with masses at least crℓrd and cbℓbd−1, each contained in a cube of side ℓi. Require upper ball-mass bounds μr(B‾ρ(x)∩U)≤Crρd and μb(B‾ρ(y)∩Γ)≤Cbρd−1 for every center and for all 0<ρ≤ρ0,i. The admissible counts satisfy, for i∈{r,b}, mi≥max⁡{1,ci−2ℓ0,i−2si,ci−2dsiρ0,i−2si}, so the computed partition scales and fill radii lie in the specified ranges.

For d=1, supply a positive integer mr, residual samples xr1,…,xrmr∈U with observed values f(xri), constants cr,Cr>0, and cutoffs ℓ0,r,ρ0,r>0. At the residual scale ℓr below, require a finite measurable partition with each cell contained in an interval of length ℓr and mass at least crℓr, and require upper ball-mass bounds μr(B‾ρ(x)∩U)≤Crρ for every center x∈U and all 0<ρ≤ρ0,r. The admissible count satisfies mr≥max⁡{1,cr−2ℓ0,r−2,cr−2ρ0,r−2}, so ℓr=δr is in the specified ranges. Supply the observed boundary values at every point of the finite set Γ with their masses μb({y}). No random boundary sample or boundary sample count is used.

For d≥2, set sr=d, sb=d−1, and, for i∈{r,b}, compute ℓi=(cimi)−1/si,δi=d ℓi,κi=Ci/ci, Cm=3max⁡i∈{r,b}{κidsi/2mi1/2},λ^i,mR=3λiδi2αCm. For d=1, compute ℓr=δr=(crmr)−1,κr=Cr/cr,Cm=3κrmr1/2, λ^r,mR=3λrδr2αCm=λrcr−2ακrmr−α−1/2,λ^b,mR=0. For d≥2, use supplied regularization weights λi,mR satisfying λi,mR≥λ^i,mR componentwise; for a sequence of sample counts also require ∥λmR∥∞=O(∥λ^mR∥∞). For d=1, set λb,mR=0 and choose λr,mR≥λ^r,mR, with the corresponding one-coordinate max-norm order condition across a sequence of counts. If no residual weights are supplied, set them equal to their thresholds.

Finally evaluate and return Jm(h)=Loss⁡m(h;λ,λmR) using the realized residual values, the realized boundary values when d≥2, the exact weighted full-boundary contribution when d=1, and the residual seminorm penalty when d=1 or both seminorm penalties when d≥2. The regularization thresholds are the source's exact thresholds and cannot be replaced by a generic positive penalty.

Remark

For d≥2, the exact residual and boundary threshold coordinates are λ^r,mR=3λr(d)2αcr−2α/dmr−α/dCm,λ^b,mR=3λb(d)2αcb−2α/(d−1)mb−α/(d−1)Cm, where Cm=3max⁡{(Cr/cr)(d)dmr1/2,(Cb/cb)(d)d−1mb1/2}. For d=1, the residual threshold is λ^r,mR=(λrcr−2α/κr)mr−α−1/2, with κr=Cr/cr, and the boundary threshold is zero. The weight vector must satisfy the componentwise lower bound and max-norm order condition in the Algorithm.

The original all-ε>0 sampling quantifier has no probability-measure instances; it is preserved and refuted in the all-scale inconsistency lemma. The small-scale range above is the corrected active sampling convention. No lower-mass constant normalization is implicit in this algorithm.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Neural operator between function spaces

Definition

Let D⊂Rd and D′⊂Rd′ be bounded domains. Let A and U be real Banach spaces of scalar functions whose elements have continuous representatives on Dˉ and Dˉ′, respectively, and suppose the inclusions into C(Dˉ) and C(Dˉ′) are continuous when these continuous-function spaces carry the supremum norm. In the continuous-function setting, a neural operator is a composition of a pointwise lifting map, finitely many integral-kernel layers, and a pointwise projection map. A layer with channel dimensions qt,qt+1≥1 has the form vt+1(x)=σt ⁣(Wtvt(x)+∫Dκt(x,y)vt(y) dy+bt(x)),x∈Dˉ, where vt:Dˉ→Rqt is continuous, Wt∈Rqt+1×qt, κt:Dˉ×Dˉ→Rqt+1×qt and bt:Dˉ→Rqt+1 are continuous, and the scalar activation σt is applied coordinatewise. The lifting and projection maps are finite feedforward networks applied pointwise, with their input and output channel dimensions chosen to make the composition well-defined. All integrals are Lebesgue integrals, which exist because the integrands are continuous on a compact set. For distinct input and output domains the final integral layer has kernel on Dˉ′×Dˉ, integrates over D, and has zero local matrix term; subsequent projection acts on Dˉ′. For any stronger specified output space, the selected composition is required actually to map into that space.

The integral universality subclass is defined separately on L1(D;Rq0), including almost-everywhere equivalence classes. Fix continuous activations σ1,σ2,σ3 with σ1 of at most linear growth, N≥2, and channel dimensions q1,…,qN≥1. For 0≤t≤N−1 let St(v)(x)=∫Dκt(x,y)v(y) dy+bt(x),x∈Dˉ, where κt:Rd×Rd→Rqt+1×qt and bt:Rd→Rqt+1 are finite MLPs with hidden activation σ2 and affine output. Set v1=S0(a), v2=S1(v1), and vt+1=St(σ1(vt)) for 2≤t≤N−1. An element of NON is G(a)(x)=∫DκN(x,y)vN(y) dy,x∈Dˉ′, where κN:Rd′×Rd→Rqout×qN is a finite MLP with activation σ3 and affine output. There are exactly N−2 intermediate σ1 activations. Scalar input and output mean q0=qout=1. The final integral is over D, with output variable in D′. This class has identity lifting and projection and zero local matrix terms. It specializes the architectural scheme with its first layer extended to L1 classes; it does not require continuous input representatives.

The first integral is invariant under null changes and obeys ∥S0(a)∥∞≤∥κ0∥∞∥a∥1+∥b0∥∞. Uniform continuity of its kernel on the compact product implies continuity of its output by the same L1 estimate. All later fields are continuous and bounded, so their integrals and activations are defined; the output is continuous on Dˉ′. Viewing it in a stronger Banach space U requires the selected kernels actually to produce outputs in U. The universality theorem constructs such kernels; arbitrary continuous kernels alone do not guarantee this condition.

For equal input and output domains, the diagram records the composition order: a pointwise lift, integral-kernel layers on D, and a pointwise output projection. Each Kt box denotes the integral layer defined above; arrows denote function composition and do not assert a theorem.

diagram failed to render:
\begin{tikzpicture}[>=stealth,node distance=2.7cm]
  \node[draw,rounded corners,minimum width=2cm,align=center] (a) {$a\in A$};
  \node[draw,rounded corners,minimum width=2cm,align=center,right of=a] (p) {$P$ pointwise lift};
  \node[draw,rounded corners,minimum width=2cm,align=center,right of=p] (k) {$\sigma_t,\mathcal K_t$\ integral layers};
  \node[draw,rounded corners,minimum width=2cm,align=center,right of=k] (q) {$Q$ pointwise projection};
  \node[draw,rounded corners,minimum width=2cm,align=center,right of=q] (g) {$G(a)\in U$};
  \draw[->] (a) -- (p);
  \draw[->] (p) -- (k);
  \draw[->] (k) -- (q);
  \draw[->] (q) -- (g);
\end{tikzpicture}

This schematic is only a depiction of the composition defined above; it is not used in the discretization or universality proofs.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Activation classes for neural-operator universality

Definition

Fix an input dimension q≥1 and an integer m≥0. Let Am(q) be the class of continuous scalar activations σ:R→R for which there is one depth n∈N such that, for every compact K⊂Rq, the scalar-output depth-n multilayer perceptrons with activation σ are dense in Cm(K) in the Cm norm. For m=0, C0(K) has the supremum norm. For m>0, Cm(K) means jets of functions defined and Cm on an open neighborhood of K: identify two functions when all their derivatives of orders at most m agree on K, and use the norm max⁡∣β∣≤msup⁡x∈K∣Dβf(x)∣. Only networks that are Cm near K enter this density assertion. For vector outputs, stack scalar-output networks of that same depth. The source notation Am suppresses the input dimension fixed by the finite-dimensional network under consideration. Let AmL,(q) be the subclass whose members are Borel measurable and have at most linear growth, meaning sup⁡s∈R∣σ(s)∣1+∣s∣<∞. For an integer q≥1, define BAq to consist of those σ∈A0(q) for which, for every compact K⊂Rq, every ε>0, and every C≥diam⁡2(K), there is a finite multilayer perceptron f:Rq→Rq with ∣f(x)−x∣2≤ε(x∈K),∣f(x)∣2≤C(x∈Rq). Here diam⁡2(K)=sup⁡x,y∈K∣x−y∣2, with diameter and all displayed approximation seminorms equal to zero on the empty set. The diameter-based global bound is part of this definition and is retained verbatim; whether it has any members is checked separately.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Elliptic H1 error estimate from the source coefficient bound

Statement

Assume Countable Choice. Let U⊂Rd be bounded Lipschitz. Let A=(aij) be a bounded measurable real symmetric matrix field, uniformly elliptic with eigenvalues at least λ0>0, and let b,c,d be bounded measurable real coefficient fields satisfying λ0−2(∥b(x)∥2+∥c(x)∥2)+λ0−1∣d(x)∣≤v2(x∈U). For the divergence operator, with all divergence derivatives interpreted distributionally, L[e]=∑i,jDi(aijDje)+∑iDi(bie)+∑iciDie+de, every real e∈H01(U)∩C2(U)∩C0(Uˉ) for which the distribution L[e] is represented by an L2(U) function satisfies ∥e∥H1(U)2≤CE(∥L[e]∥L2(U)2+∥e∥L2(U)2), where CE depends only on λ0 and v. The zero-trace condition is required for the integration by parts.

Facts & Assumptions

Given: The bounded Lipschitz domain, uniformly elliptic symmetric matrix, coefficient bound, zero-trace function, and divergence operator in the Statement.

[A1]

Countable Choice is the explicit premise of the zero-boundary Sobolev closure convention (The Axiom of Countable Choice (ACω), Zero-boundary Sobolev space as a norm closure).

[F1]

H1(U)=W1,2(U) has norm squared ∥e∥L2(U)2+∥∇e∥L2(U)2 (Integer-order Sobolev spaces and their norms).

[F2]

The divergence operator uses the positive-principal-part convention displayed in Shin's positive divergence-form operator.

[F3]

H01(U) is the H1-closure of Cc∞(U), and the H1 norm contains the L2 norm and weak-gradient norm (Zero-boundary Sobolev space as a norm closure, Integer-order Sobolev spaces and their norms).

[F4]

Hölder's integral inequality at exponents p=q=2 bounds the L2 pairings used below (Holder's inequality for integrals, including the endpoint cases).

Proof

Proof strategy: integrate against the zero-trace error and absorb lower-order terms by explicit square inequalities.

1.1givenA1F2F3F4algebra

By [F3], choose ϕn∈Cc∞(U) with ϕn→e in H1(U). The distributional definition of each divergence term and the ordinary test-function integration by parts give ∫UϕnL[e] dx=−∫UaijDjeDiϕn dx−∫UbieDiϕn dx+∫UciDie ϕn dx+∫Ude ϕn dx. All coefficients are bounded and e,∇e,L[e]∈L2, so [F4] makes each term continuous under H1 convergence. Taking n→∞ and using [F2] yields −∫UeL[e] dx=∫UaijDjeDie dx+∫UbieDie dx−∫UcieDie dx−∫Ude2 dx. The principal term is at least λ0∥∇e∥22 by ellipticity.

2.1givenF4step 1.1algebra

The coefficient bound gives ∥b∥2+∥c∥2≤λ02v2 and ∣d∣≤λ0v2. Hence the absolute value of the two first-order terms is at most 2λ0∣v∣∥e∥2∥∇e∥2 by [F4], and the zero-order term is at most λ0v2∥e∥22. The scalar bound 2λ0∣v∣xy≤λ02y2+λ0v2x2 follows by expanding (λ0/2 y−λ0∣v∣x)2≥0. Therefore −∫UeL[e] dx≥λ02∥∇e∥22−2λ0v2∥e∥22.

3.1F1F4step 2.1algebra∎

Since L[e]∈L2(U), [F4] and step 2.1 imply λ02∥∇e∥22≤∥L[e]∥2∥e∥2+2λ0v2∥e∥22. The elementary square inequality xy≤x2/(2λ0)+λ0y2/2 follows from (x/λ0−λ0y)2≥0 and gives λ02∥∇e∥22≤12λ0∥L[e]∥22+(λ02+2λ0v2)∥e∥22. Dividing by λ0/2 yields ∥∇e∥22≤λ0−2∥L[e]∥22+(1+4v2)∥e∥22. By [F1], adding ∥e∥22 gives the claimed H1 estimate with CE=max⁡{λ0−2,2+4v2}.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Elliptic residual and boundary stability from a maximum principle

Statement

Let U⊂Rd be bounded and open, and let L[u]=∑i,j=1daijDiDju+∑j=1db~jDju+c~ u on U, where a(x) is symmetric, ξTa(x)ξ≥λ0∣ξ∣2 for all x∈U and ξ∈Rd with λ0>0, the coefficients are continuous and bounded, and c~≤0. There is a constant CL<∞, depending only on U, λ0, and the coefficient bounds, such that every w∈C2(U)∩C0(Uˉ) with L[w]∈C0(U) satisfies ∥w∥C0(U)≤CL(∥L[w]∥C0(U)+∥w∥C0(∂U)). In particular, for any two functions u∗,h∈C2(U)∩C0(Uˉ), ∥u∗−h∥C0(U)≤CL(∥L[u∗]−L[h]∥C0(U)+∥u∗−h∥C0(∂U)).

Facts & Assumptions

Given: The bounded domain, uniformly elliptic coefficient matrix, bounded lower-order coefficients with c~≤0, and w∈C2(U)∩C0(Uˉ).

[F1]

The operator expands with the positive principal part and zero-order coefficient shown in Shin's positive divergence-form operator.

[F2]

A continuous function on the compact set Uˉ attains its maximum; a C2 function at an interior maximum has zero gradient and negative-semidefinite Hessian.

Proof

Proof strategy: construct a strict positive barrier and apply the weak maximum principle by perturbation.

1.1givenF1algebrachoose

Since U is bounded, choose real numbers a1<b1 with a1≤x1≤b1 on Uˉ. Let B=∥b~1∥C0(U) and C0=∥c~∥C0(U). Choose κ>0 large enough that κ2λ0−κB−C0≥1. For ψ(x)=eκx1, [F1] gives L[ψ](x)=eκx1(κ2a11(x)+κb~1(x)+c~(x))≥eκa1>0. Choose M>eκb1 and set Φ=M−ψ. Then Φ>0 on Uˉ and L[Φ]=Mc~−L[ψ]≤−eκa1.

2.1givenstep 1.1algebra

Put R=∥L[w]∥C0(U), Q=∥w∥C0(∂U), and η=eκa1. For z=w−Q−(R/η)Φ, the boundary values satisfy z≤0. In U, L[z]=L[w]−Qc~−(R/η)L[Φ]≥−R+R=0, because −Qc~≥0.

3.1step 2.1F2algebra∎

Suppose z(x0)>0 at some x0∈U. Since z≤0 on ∂U and z is continuous on Uˉ, its positive maximum is attained at an interior point. For sufficiently small δ>0, z+δψ has an interior positive maximum as well: its value at x0 is at least z(x0)>0, while its boundary values are at most δeκb1<z(x0). At that interior maximum [F2] and c~≤0 give L[z+δψ]≤0, contradicting L[z+δψ]>0. Hence z≤0 on U, and therefore w≤Q+(R/η)∥Φ∥C0(Uˉ). Applying the same argument to −w yields the corresponding lower bound. Taking CL=max⁡{1,∥Φ∥C0(Uˉ)/η} proves the first estimate; applying it to u∗−h proves the second.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

The zero-boundary Sobolev evolution triple on an arbitrary bounded open set

Statement

Assume Countable Choice. Let U⊂Rd be bounded and open, d≥1, and put H=L2(U;R) and V=H01(U;R), where the latter is the H1-closure of Cc∞(U). Then V is a separable real Hilbert space, its inclusion into H is continuous, injective and dense, and (V,H,V∗) is a real evolution triple. The gradient norm and the full H1 norm are equivalent on V. No regularity of ∂U is required.

Facts & Assumptions

Given: Countable Choice, a bounded open U⊂Rd, and the stated real spaces.

[A1]

Countable Choice is carried by the L2 completeness and density suppliers and by the countable selections below (The Axiom of Countable Choice (ACω)).

[F1]

L2(U) is a real Hilbert space; rational box-step functions are countable and dense in L2(Rd) (L2 with the integral pairing is a Hilbert space, Rational box-step functions form a countable dense subset of Lp(Rn) for 1≤p<∞).

[F2]

Weak derivatives are defined by integration against compactly supported smooth tests; H01(U) is the H1-closure of those smooth functions (Integer-order Sobolev spaces and their norms, Zero-boundary Sobolev space as a norm closure).

[F3]

On an open set bounded in one direction, ∥v∥2≤C∥Dv∥2 for v∈H01(U) (The Poincare inequality for zero-boundary Sobolev closures on domains bounded in one direction).

[F4]

Cc∞(U) is dense in L2(U) for every open U (Smooth compactly supported functions of an open set are dense in L2).

[F5]

A continuous dense injective Hilbert inclusion V↪H defines the canonical real evolution triple (Evolution triples and the parabolic energy space).

Proof

1.1givenA1F1construct

If U=∅, both spaces are zero and the conclusions hold. Otherwise choose finite a<b with U⊂{a<x1<b}. The zero extension of any h∈H belongs to L2(Rd) with the same norm. Restricting the countable dense box-step family in [F1] to U therefore gives a countable dense subset of H. The product Z=Hd+1 is a separable Hilbert space.

2.1F1F2step 1.1algebra

The map J:H1(U)→Z, J(v)=(v,D1v,…,Ddv), is an isometry for the full Sobolev norm. Its range is closed: if J(vn)→(v,g1,…,gd) in Z, then for every ϕ∈Cc∞(U), Cauchy–Schwarz gives ∫vDiϕ=lim⁡n∫vnDiϕ=−lim⁡n∫Divnϕ=−∫giϕ. Thus gi=Div weakly, so the limit is J(v). A closed subspace of a Hilbert space is complete, hence H1(U) is Hilbert.

3.1F2F3step 1.1step 2.1algebra

By the closure definition, V is a closed subspace of H1(U) and is Hilbert. The Poincare inequality applies because U is bounded in the first direction, and yields ∥Dv∥22≤∥v∥H12≤(1+C2)∥Dv∥22 on V. This proves norm equivalence and continuity of the inclusion V↪H. Injectivity holds because these spaces use the same almost-everywhere equivalence classes.

4.1A1step 1.1step 2.1step 3.1construct

A subspace Y of a separable metric space Z is separable under [A1]: if (zj) is dense in Z, the sets Y∩B(zj,r) for positive rational r form a countable base of Y; choose one point from every nonempty such set. Any relatively open neighborhood contains one of these sets, so the chosen points are dense. Apply this first to J(H1(U))⊂Z and then to J(V); transport the dense subsets through the isometry J. Thus V is separable.

5.1F2F4F5step 3.1step 4.1algebra∎

By [F4], Cc∞(U) is dense in H, and it is contained in V by [F2]. Thus V↪H is dense. The Hilbert, separability, continuity and injectivity conclusions already proved give the canonical evolution triple by [F5]. Every argument used an arbitrary bounded open U, so none requires a boundary chart or a polyhedral boundary.

Source notes

This reproduces the actual argument of the read published polyhedral Sobolev-evolution supplier on the larger bounded-open-set domain class. Its closed-graph, separability and compact-smooth-density arguments do not use polyhedral geometry. The bibliographic reference records the evolution-space context; no new reading of Clason's full text is claimed here.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Parabolic L2 energy estimate with zero initial-lateral trace

Statement

Assume Countable Choice. Let U⊂Rd be bounded and open, T>0, Q=U×(0,T), and let Lt[e]=∑i,j=1dDi(aijDje)+∑i=1dDi(bie)+∑iciDie+de with aij=aji, a(x,t)≥λ0I for some λ0>0, and real measurable a,b,c,d bounded with the spatial derivatives needed for the displayed divergence form. Let V=H01(U), H=L2(U), and let e∈L2(0,T;V) have weak derivative et∈L2(0,T;V∗) and satisfy −et+Lt[e]=r∈L2(U×(0,T)) weakly. Use its continuous H representative for the initial datum e(0) and endpoint norms. The source application has e(0)=0. Then there is CE<∞, depending only on T, λ0, and the coefficient bounds, such that sup⁡0≤t≤T∥e(t)∥L2(U)2+∫0T∥∇e(t)∥L2(U)2 dt≤CE(∥e(0)∥L2(U)2+∥r∥L2(Q)2). The spatial zero trace is the stated V membership almost everywhere in time. In particular, the estimate applies to locally classical continuous errors once their energy-space membership and weak equation have been established; no closed-cylinder derivatives are required.

Facts & Assumptions

Given: The coefficient bounds, uniform ellipticity, zero spatial trace, initial L2 trace, and the variational solution e of the inhomogeneous error equation.

[A1]

Countable Choice is assumed by the zero-boundary Sobolev closure convention used for each spatial slice (The Axiom of Countable Choice (ACω), Zero-boundary Sobolev space as a norm closure).

[F1]

On the real evolution triple the energy identity gives ⟨et,e⟩=12ddt∥e(t)∥L2(U)2 almost everywhere, and the squared norm is absolutely continuous; it is proved by Bochner time mollification (The evolution-space energy identity and continuous H trace, Evolution triples and the parabolic energy space). The required triple on every bounded open set is supplied by The zero-boundary Sobolev evolution triple on an arbitrary bounded open set.

[F2]

The principal matrix satisfies ∫UaijDjeDie dx≥λ0∥∇e∥L2(U)2 by its pointwise ellipticity hypothesis.

[F3]

The parabolic convention has initial and lateral boundary data on ΓT (Shin's parabolic operator, data, and initial-lateral boundary).

[F4]

H01(U) is the H1-closure of Cc∞(U) (Zero-boundary Sobolev space as a norm closure).

Proof

Proof strategy: multiply by the error, integrate by parts, absorb lower-order terms, and apply Gronwall's inequality.

1.1givenA1F1F2F3F4algebra

For almost every t, by [F4], approximate e(⋅,t) in H1(U) by compactly supported smooth functions. For each approximant the distributional definition of the divergence terms gives the spatial integration-by-parts identity; the coefficient bounds make every pairing continuous in H1, so passing to the limit produces no boundary term because e(⋅,t)∈H01(U). Pair the weak equation −et+Lt[e]=r against e in V∗,V and use [F1] and [F2]. Moving the time derivative to the left gives 12E′(t)+λ0∥∇e(t)∥22≤(∥b∥∞+∥c∥∞)∥e(t)∥2∥∇e(t)∥2+∥d∥∞E(t)+∥r(t)∥2∥e(t)∥2, where E(t)=∥e(t)∥22.

2.1step 1.1algebra

By Young's inequality, the first product on the right is at most λ04∥∇e∥22+C1E(t) and the last product is at most 12∥r(t)∥22+12E(t), for a finite C1 depending only on the coefficient bounds and λ0. Hence for C2=C1+∥d∥∞+12, E′(t)+λ0∥∇e(t)∥22≤2C2E(t)+∥r(t)∥22.

3.1step 2.1algebra

Dropping the nonnegative gradient term in step 2.1 and multiplying by e−2C2t gives ddt(e−2C2tE(t))≤e−2C2t∥r(t)∥22. Integrating from 0 to any s≤T yields sup⁡0≤s≤TE(s)≤e2C2T(E(0)+∥r∥L2(Q)2).

4.1step 2.1step 3.1algebra∎

Integrating step 2.1 from 0 to T and using step 3.1 gives λ0∫0T∥∇e(t)∥22dt≤E(0)+2C2Tsup⁡0≤t≤TE(t)+∥r∥L2(Q)2. Combining this with step 3.1 and dividing by λ0>0 proves the stated estimate after increasing the constant.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Variable-coefficient parabolic residual and boundary stability

Statement

Let U⊂Rd be nonempty, bounded, and open, T>0, and P[w]=−wt+∑i,j=1daij(x,t)DiDjw+∑j=1db~j(x,t)Djw+c~(x,t)w on Q=U×(0,T). Suppose a(x,t) is symmetric, ξTa(x,t)ξ≥λ0∣ξ∣2 with λ0>0, b~,c~ are bounded and continuous, and c~≤0. There is CP<∞, depending only on U,T,λ0 and the coefficient bounds, such that every w∈C2,1(Q)∩C0(Uˉ×[0,T]) with P[w]∈C0(Q) satisfies ∥w∥C0(Q)≤CP(∥P[w]∥C0(Q)+∥w∥C0(ΓT)), where ΓT=(Uˉ×{0})∪(∂U×[0,T]) excludes the final-time face.

Facts & Assumptions

Given: The bounded cylinder, uniformly elliptic coefficient matrix, bounded drift and zero-order coefficients with c~≤0, and the regularity and data of w in the Statement.

[F1]

The parabolic operator has the sign convention P=−∂t+Lt and its prescribed boundary is initial plus lateral data (Shin's parabolic operator, data, and initial-lateral boundary).

[F2]

On the final-time face the time derivative is the left derivative; at a final-time maximum it is nonnegative (Parabolic cylinder and parabolic boundary).

Proof

Proof strategy: use a spatial exponential barrier and the weak parabolic maximum principle.

1.1givenF1algebrachoose

Choose a1<b1 with a1≤x1≤b1 on Uˉ. Let B=∥b~1∥∞, C0=∥c~∥∞, and choose κ>0 so that κ2λ0−κB−C0≥1. For ψ(x,t)=eκx1, [F1] gives P[ψ]=eκx1(κ2a11+κb~1+c~)≥η:=eκa1>0. Choose M>eκb1 and put Φ=M−ψ. Then Φ>0 and P[Φ]=Mc~−P[ψ]≤−η.

2.1givenstep 1.1algebra

Let R=∥P[w]∥∞, Q0=∥w∥C0(ΓT), and z=w−Q0−(R/η)Φ. On ΓT, z≤0, and in Q, P[z]=P[w]−Q0c~−(R/η)P[Φ]≥−R+R=0.

3.1step 1.1step 2.1F2contradiction

Fix any 0<τ<T and work on Uˉ×[0,τ], where the time derivatives at spatial interior points at t=τ exist because τ<T. Suppose z>0 somewhere on this stopped cylinder. Since z≤0 on ΓT, a positive maximum occurs at a spatial interior point and at a time in (0,τ]. For sufficiently small δ>0, z+δψ still has a positive maximum away from ΓT. At this maximum, the spatial gradient is zero and the spatial Hessian is negative semidefinite; the time derivative is zero for t<τ and nonnegative from the left if t=τ. Thus [F2] and c~≤0 imply P[z+δψ]≤0, while step 2.1 and step 1.1 give P[z+δψ]>0. This contradiction shows z≤0 on every stopped cylinder; let τ↑T and use continuity at the final face. Hence w≤Q0+(R/η)∥Φ∥∞.

4.1step 3.1algebra∎

Apply the same argument to −w, for which P[−w]=−P[w] and the boundary norm is still Q0. Combining the upper and lower bounds gives the asserted estimate with CP=max⁡{1,∥Φ∥∞/η}.

LemmaStatement: AI-adaptedProof: AI-generatedOpen item page →

Finite sampling reconstruction bridges compact-uniform raw quadrature limits

Statement

Let X,U be real Banach spaces, and let continuous maps H,Hn:X→U satisfy sup⁡a∈K∥Hn(a)−H(a)∥U→0 for every norm-compact K⊂X. Suppose continuous finite-dimensional sampling and reconstruction maps Sn:X→En and Jn:En→X are supplied and satisfy sup⁡a∈K∥JnSn(a)−a∥X→0 on every such K. Then Gn(a)=Hn(Jn(Sn(a))) factors through finite-dimensional data, with Fn=En, finite map the identity and output reconstruction Rn=Hn∘Jn:En→U, and Gn→H uniformly on every norm-compact input set in the actual U norm. When X,U are function spaces on bounded domains with the pointwise output convention required by the discretization-invariant-family definition, this is a finite-sampling family in that definition.

For the supremum-norm continuous-input case these reconstruction hypotheses always hold with exactly the prescribed tags of arbitrary finite partitions of a nonempty bounded open D⊂Rd whose maximal cell diameters hn tend to zero. Namely let X=C(Dˉ;Rq), let Sn(a)=(a(ξn,j))j, and, when hn>0, for x∈Dˉ put wn,j(x)=max⁡{0,2hn−∣x−ξn,j∣},Jn(z)(x)=∑jwn,j(x)zj∑jwn,j(x). If hn=0, the domain is the zero-dimensional singleton; define Jn(z) to be the constant function with value z1. This reconstructs every input exactly. In both branches ∥JnSn∥X→X≤1, and the reconstruction error is bounded by the input modulus of continuity at 2hn, uniformly on every compact input family. In a stronger Banach input norm the first clause applies whenever the stated reconstructions converge in that norm; convergence in the supremum norm alone is not substituted for that condition.

A further case needs no input reconstruction. Suppose a raw finite architecture first uses its input only through the sampled pointwise lift in the integral-only field v1,n(x)=∑jωn,jκn(x,ξn,j)P(a(ξn,j))+bn(x), and every later stage acts on this field and the fixed parameters without further access to the original input. Assume these stages are defined and continuous on the compatible Banach spaces in question. Then each raw map itself factors through the finite input sample vector. Its compact-uniform raw convergence therefore already gives a finite-sampling family in the actual output norm, regardless of whether a sample reconstruction into the input norm has been supplied. This includes the integral-only universality subclass, when its kernels and intermediate spaces satisfy the declared compatible norm hypotheses.

Facts & Assumptions

Given: The Banach spaces, continuous raw maps, finite-dimensional maps, and compact-uniform limits in the Statement. In the concrete branch the nonempty bounded open set and tagged partitions are given, with nonnegative maximal diameters tending to zero.

[F1]

Uniformly convergent continuous images of a compact set have compact union, including the limit image (Uniformly convergent images of a compact set have compact union).

[F4]

A map between function spaces satisfying the domain and pointwise-output conventions, and factoring through the supplied finite sampling, finite map and output reconstruction, has the type required by Discretization-invariant operator family. Ambient open covers of compact metric subsets admit finite subcovers (A subset of a metric space is open in the subspace metric exactly when it is the trace of an open set of the ambient space, and it is compact as a metric space in its own right exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it).

Proof

1.1givenF1construct

Fix compact K⊂X. If K is empty the conclusion is vacuous. Otherwise put An=JnSn and L=K∪⋃n≥1An(K). The maps An are continuous and converge uniformly on K to the identity. Thus [F1] makes L compact in the actual X norm. By hypothesis sup⁡b∈L∥Hn(b)−H(b)∥U→0.

1.2givenF2constructalgebra

In the concrete branch 0≤hn<∞. If hn=0, every cell is its singleton tag, so their finite union D is finite. A nonempty open subset of Rd with d≥1 contains a ball and hence infinitely many points; therefore this case forces d=0 and D=Dˉ is the singleton of R0. All tags are that point, and Jn(z)(x)=z1 is a bounded linear reconstruction of norm at most one, with JnSn(a)=a and reconstruction error 0=ωa(0). Now suppose hn>0. Every point of D is within hn of some tag in its cell. The distance to the finite tag set is continuous, so the same inequality holds on Dˉ. Consequently ∑jwn,j(x)>0 there. The normalized weights are continuous, nonnegative and sum to one. Thus Jn is a bounded linear map from the finite sample space with its maximum norm into C(Dˉ;Rq), of norm at most one. The sampling map is bounded with norm at most one. A positive weight implies ∣x−ξn,j∣<2hn, so ∥JnSn(a)−a∥∞≤ωa(2hn), where ωa(r)=sup⁡∣x−y∣≤r∣a(x)−a(y)∣.

2.1givenF4step 1.1constructalgebra

Continuity of H controls uniform perturbations of the compact set K. Explicitly, for ε>0 collect every ball B(x,r) with x∈K and r>0 such that ∥H(z)−H(x)∥U<ε/2 for ∥z−x∥X<3r. These balls cover K; choose a finite subcover and take δ to be its smallest radius. If a∈K and ∥b−a∥X<δ, both points lie within 3r of one selected center, so ∥H(b)−H(a)∥U<ε. Hence sup⁡K∥H(An(a))−H(a)∥U→0. Combining this with step 1.1 gives sup⁡K∥Gn−H∥U→0. The maps Sn, identity on En, and Rn=HnJn provide the asserted finite-dimensional factorization, and [F4] applies when its function-space conventions hold; no access to the original input is used by Rn.

3.1F2F3step 2.1step 1.2algebra

For a compact K⊂C(Dˉ;Rq) and η>0, [F3] gives a finite η-net a1,…,as. By [F2] their moduli tend to zero. For a∈K within η of ai, ωa(r)≤2η+ωai(r). Therefore sup⁡a∈Kωa(r)→0. Step 1.2 supplies the reconstruction hypotheses of steps 1.1–2.1 and proves the whole concrete branch. The general argument measured every reconstruction error in X and every output error in U, so it also proves the first clause without any unproved norm upgrade.

4.1givenF4constructalgebra∎

For the last assertion set En=Fn=(Rq0)Nn and let Sn(a) be its prescribed sample vector. For z∈En, construct v1,n(z)(x)=∑jωn,jκn(x,ξn,j)P(zj)+bn(x) and apply the subsequent raw stages to this field; call the resulting output Rn(z). The first field belongs to its designated auxiliary space because it is a finite sum of its kernel sections and bias with finite scalar/vector coefficients. Every subsequent field belongs to its designated space by the stated compatibility assumptions. The finite sum and continuity of the lift make the first field continuous in z, and continuity of the subsequent maps makes Rn:En→U continuous. Induction through those stages proves Hn(a)=Rn(Sn(a)) exactly. The identity finite map between En and Fn gives [F4], and the assumed compact-uniform raw limit proves its convergence in the actual U norm. No off-grid original input is requested at any stage of this construction.

Source notes

This statement is a local alteration and application of the compact-union mechanism in Kovachki et al., Appendix B, Lemma21, and its use for compact-uniform composition in the proof of Lemma22. The complete relevant source statements and printed proofs on PDF/printed pages74–77 of the cached JMLR full text were inspected in this provenance clarification. The source does not state the present finite-sampling bridge, the explicit normalized tag weights, or the integral-first factorization as these separate assertions; those adaptations are fully proved above. The source's printed closedness argument in Lemma21 assumes unjustified convergence of the selected integer indices. The locally proved open-cover compact-union supplier supplies the correct stated conclusion without relying on that step. The finite sampling/reconstruction interpretation is the explicit local definition of discretization invariance. No new retrieval, source-fetch stamp, whole-paper reread, or source attribution for the newly authored formulas is claimed.

AlgorithmAlgorithm: AI-adaptedProof: Not applicableOpen item page →

Riemann-sum realization of a neural operator

Definition

The raw quadrature rule below takes the continuous input function, including any off-grid values used by a local term or pointwise lifting. It is not by itself asserted to factor through its stored input samples. A finite-sampling version is specified after the raw rule.

For the continuous-function architecture, take its pointwise lift P, layers indexed by 0≤t<L, and pointwise projection Q. Given a finite partition of D into nonempty measurable cells E1,…,EN, choose tags ξj∈Ej and weights ωj=∣Ej∣. Initialize the raw lifted field v0,n(x)=P(a(x)) on Dˉ and store v0,n(ξj). For each layer whose output domain is Dˉ, define at every x∈Dˉ vt+1,n(x)=σt ⁣(Wtvt,n(x)+∑j=1Nωjκt(x,ξj)vt,n(ξj)+bt(x)), and store its values at all tags for the next layer. If the last layer instead has output domain Dˉ′≠Dˉ, use its required zero local term and define, for x∈Dˉ′, vL,n(x)=σL−1 ⁣(∑j=1NωjκL−1(x,ξj)vL−1,n(ξj)+bL−1(x)). Return the function x↦Q(vL,n(x)) on the output closure, evaluating these same formulas at each requested query point. A refinement changes cells, tags, and weights, while all layer, lifting, and projection parameters remain fixed.

For a finite-sampling realization on continuous inputs, first reconstruct the input from its prescribed tags by the normalized nonnegative weights in the finite-sampling reconstruction bridge. Run the raw rule on this reconstructed function, including in the pointwise lifting and every local term. Its output is then a function of the finite input sample vector alone, with the same continuum parameters. The weights and reconstruction change with the partition; the learned parameters do not. Along partition sequences whose maximal cell diameters hn=max⁡jdiam⁡(En,j) tend to zero, if the raw maps converge compact-uniformly in the output supremum norm, the bridge transfers that convergence to this finite-sampling realization. For a stronger compatible Banach input/output formulation, supply reconstructions into the actual input Banach space that converge compact-uniformly in that input norm; the same bridge then preserves the raw rule's proved output Banach norm convergence. The explicit continuous-input weights alone do not assert this stronger reconstruction property.

Remarks

At every refinement, each cell contributes its volume weight, all kernels and pointwise-network parameters are shared with the continuum operator, and the output can be evaluated at any query point. Changing only the mesh size without preserving these three conventions does not instantiate the discretization family defined above.

The integral universality subclass also admits L1 input equivalence classes. Point samples of those classes are not canonical; this algorithm uses continuous representatives when applying sampling and makes no assertion of an intrinsic point-sampling rule on arbitrary L1 classes. Norm convergence of the reconstructions requires the hypotheses of the discretization theorem for the chosen norm.

When the first input-dependent layer is integral-only, the raw rule already has a finite-sample reconstruction: its first preactivation is a finite sum of kernel sections plus the fixed bias, with coefficients given by the sampled lifting values. Its first output is the coordinatewise activation of this preactivation and need not lie in the span of the kernel sections. All later reconstructed fields depend only on the sampled lifting values and fixed parameters. The finite-sampling bridge applies with this activation among the subsequent maps and transfers the full compatible-Banach raw convergence without an input-reconstruction premise. No such assertion is made for a raw local path retaining the original input.

The failure of exact finite sampling for an unchanged raw local path is illustrated in the counterexample cited below. This is a nonlogical reader example; the reconstruction and convergence claims above use the proved finite-sampling bridge.

CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedjudge pass (gpt-6-luna)Open item page →

The PINN regularization thresholds need not be comparable under the stated count condition

Statement refuted

For d≥2, 0<α≤1, and positive constants in equation (3.1), the count condition mr=O(mbd/(d−1)) alone does not imply that the two threshold coordinates have bounded max-to-min ratio. In particular, choosing λmR=λ^mR satisfies the stated coordinatewise lower bound and norm upper bound, while that ratio can diverge.

Facts & Assumptions

Given: The threshold definitions for d≥2, positive fixed λr,λb,cr,cb, and the sample-count condition in the Statement.

[F1]

The exact thresholds are λ^r,mR=3λr(d)2αcr−2α/dmr−α/dCm,λ^b,mR=3λb(d)2αcb−2α/(d−1)mb−α/(d−1)Cm, where the same positive Cm divides both coordinates (Empirical Hölder-regularized PINN objective).

Proof

Proof strategy: explicit sample-count sequence.

1.1givenF1algebrachoose

Set mr=mb=n for integers n≥1. Since d/(d−1)>1, we have n≤nd/(d−1), so the required count condition holds. Choose λmR=λ^mR; then the coordinatewise lower-bound condition is equality and the max norm is exactly the prescribed comparison scale.

2.1step 1.1F1algebra∎

Cancelling the common factor Cm in [F1] gives λr,mRλb,mR=λ^r,mRλ^b,mR=λrcr−2α/dλbcb−2α/(d−1) nα/(d−1)−α/d=C nα/(d(d−1)), where C>0 is independent of n. The exponent is positive, so the ratio tends to infinity. Thus the two coordinates need not be comparable under the stated count condition.

CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedOpen item page →

Exterior-sphere domains need not have global C2alpha Dirichlet solutions

Statement refuted

The following assertion is false under the library's bounded global Hölder norm: every bounded Lipschitz domain satisfying an exterior sphere condition at each boundary point, with a strictly elliptic operator having Hölder coefficients and nonpositive expanded zero-order coefficient, has for every Hölder forcing and continuous Dirichlet data a unique solution in C2,α(U)∩C0(Uˉ).

Facts & Assumptions

Given: 0<α<1 and the source's claimed C2,α(U)∩C0(Uˉ) solution class.

[F1]

The library's C2,α(U) is the bounded global Hölder class; its norm includes the supremum of every second derivative over all of U (Hölder spaces Ck,α, closure and interior scaled norms, and Ck,α domains).

[F2]

For L=Δ, a bounded-domain function w∈C2(U)∩C0(Uˉ) with Δw=0 and w∣∂U=0 vanishes identically (Elliptic residual and boundary stability from a maximum principle).

[F3]

The locally proved radial profile χ is smooth, equals 1 for r≤1/4, and equals 0 for r≥1/2 (A smooth radial profile with a prescribed inner plateau).

[F4]

The Laplacian of a scalar C2 function on an open subset of R2 is wxx+wyy (The Laplacian of a C2 function and of a C2 vector field).

[F5]

The total chain rule applies to the smooth local polar-coordinate change on r>0 (The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a)).

Counterexample

1.1givencases

Let U={(rcos⁡θ,rsin⁡θ):0<r<1, 0<θ<2π/3}. It is bounded and Lipschitz: its boundary consists of two line segments and a circular arc, meeting at finitely many corners of angles 2π/3 and π/2. At a smooth boundary point, a sufficiently small ball tangent on the exterior side is disjoint from U; on the circular arc one can use a ball outside the unit disk. At a corner of interior angle β<π, choose a ball tangent at the corner with its center on the exterior angle bisector. Directions from the vertex to points in this ball lie within angle π/2 of the center direction, while the sector directions are at angular distance at least π−β/2>π/2; hence the ball is exterior. Therefore U satisfies the exterior sphere condition everywhere.

1.2givenF3F4F5algebra

Let χ be the profile supplied by [F3]. Set u(r,θ)=χ(r)r3/2sin⁡(3θ/2),L=Δ,f=Δu,g=0. Since r>0 on U, u∈C∞(U). It extends continuously by zero at the vertex, vanishes on both straight sides because the sine factor vanishes, and vanishes on the circular arc because χ(1)=0. To compute Δw for any C2 function in local polar coordinates, write c=cos⁡θ and s=sin⁡θ. The chain rule [F5] gives wxx=c2wrr+s2rwr+s2r2wθθ−2scrwrθ+2scr2wθ,wyy=s2wrr+c2rwr+c2r2wθθ+2scrwrθ−2scr2wθ. By [F4], adding yields Δw=wrr+r−1wr+r−2wθθ. For w=r3/2sin⁡(3θ/2), these derivatives are wr=32r1/2sin⁡(3θ/2), wrr=34r−1/2sin⁡(3θ/2), and wθθ=−94r3/2sin⁡(3θ/2), so the polar Laplacian is zero on r<1/4. On the annulus where χ varies, r is bounded away from zero and all factors are smooth; outside r<1/2, u=0. Thus f is smooth and supported in 1/4≤r≤1/2. The domain U is convex, so boundedness of ∇f gives a Lipschitz bound on f along each segment in U; since U is bounded and 0<α<1, this implies f∈C0,α(U).

2.1step 1.2F1algebra

Along the ray θ=π/3 and for 0<r<1/4, ∂rru=(3/4)r−1/2, which is unbounded as r↓0. A bounded global C2,α norm bounds every Cartesian second derivative and hence every unit-direction second derivative, so [F1] implies u∉C2,α(U). The coefficients of L=Δ are smooth, the ellipticity constant is 1, and the expanded zero-order coefficient is 0≤0.

3.1step 1.2step 2.1F2algebra∎

The displayed u is a classical solution in C2(U)∩C0(Uˉ) of Δu=f with zero Dirichlet data. Any other solution in that class differs from u by a zero-boundary harmonic function, which vanishes by [F2]. Hence it is the unique classical solution, and no solution in the asserted global C2,α(U)∩C0(Uˉ) class exists. This refutes the assertion.

False statementConstruction: Literature-sourcedVerification: AI-adaptedprecheck passOpen item page →

Exterior spheres and continuous boundary data do not give global bounded C2alpha solvability

Statement

Let 0<α<1 and let U⊂Rd be bounded and satisfy an exterior sphere condition at every boundary point. Let aij=aji∈C1,α(U) be uniformly elliptic with minimum eigenvalue at least λ0>0, let bi∈C1,α(U) and ci,d∈Cα(U), and define L[u]=∑i,j=1dDi(aijDju+biu)+∑i=1dciDiu+du. Assume ∑i,j∣aij(x)∣2≤Λ and λ0−2(∥b(x)∥2+∥c(x)∥2)+λ0−1∣d(x)∣≤v2 on U, and use the expanded coefficients b~j=∑iDiaij+bj+cj and c~=∑iDibi+d≤0. For every f∈C0,α(U) and g∈C0(∂U), the source assertion is that the Dirichlet problem L[u]=f in U, u=g on ∂U has a unique solution u∈C2,α(U)∩C0(Uˉ). For any h∈C0(U) with L[h]∈C0,α(U) and h∈C0,α(∂U), the source further asserts ∥u−h∥C0(U)≤C(∥f−L[h]∥C0(U)+∥g−h∥C0(∂U)), where C depends only on the domain and the displayed coefficient bounds. The global existence part of this assertion is false under the library's bounded global Hölder convention.

Facts & Assumptions

Given: The source assertion in the Statement, including its printed divergence indexing. The refutation uses b=c=d=0, so the indexing discrepancy does not affect it.

[A1]

Assume for contradiction that the asserted global existence conclusion holds for every admissible datum.

[F1]

The sector U={0<r<1,0<θ<2π/3} is bounded Lipschitz and satisfies the exterior-sphere condition. With L=Δ, g=0 and u=χ(r)r3/2sin⁡(3θ/2), its smooth forcing f=Δu is globally Hölder, and u is classical and continuous on the closure, but has unbounded second derivatives (Exterior-sphere domains need not have global C2alpha Dirichlet solutions).

[F2]

The zero-boundary classical homogeneous Dirichlet problem is unique by comparison (Elliptic residual and boundary stability from a maximum principle).

[F3]

The global bounded Hölder norm includes the supremum of every second derivative (Hölder spaces Ck,α, closure and interior scaled norms, and Ck,α domains). The positive-principal convention is fixed by Shin's positive divergence-form operator.

Refutation

1.1assume-contraF1F3

Assume for contradiction the claimed global existence assertion [A1]. Use the sector and data from [F1]. The coefficient matrix is the identity and all lower coefficients vanish; uniform ellipticity holds with λ0=1, the pointwise source bounds hold with Λ=2 and v=0, and the expanded zero-order coefficient is zero. Thus these data satisfy every hypothesis of the claimed existence assertion.

1.2A1F1F2

Assumption [A1] gives a global bounded C2,α(U) solution u∗ continuous on the closure. The explicit u from [F1] is a second classical continuous Dirichlet solution. Their difference is zero-boundary harmonic, so [F2] implies u∗=u.

2.1step 1.2F1F3discharge-contradiction∎

Along θ=π/3 and r<1/4, ∂rru=(3/4)r−1/2 is unbounded. A globally bounded Cartesian Hessian would bound this unit-direction second derivative. Therefore [F3] excludes u from the asserted global class, contradicting step 1.2. The global existence claim is false; its failure does not refute the separately proved classical residual estimate.

Remarks

The printed source formula also repeats biu inside the double divergence sum, although its stated expanded drift contains b only once. This defect is retained visibly in the historical assertion above. The native Laplacian sector refutation is independent of that discrepancy. The repaired existence theorem uses the intended single b divergence and preserves the correct local-interior and conditional smooth-boundary branches.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Fourier neural-operator layer

Definition

Let Td=(R/Z)d with normalized Lebesgue measure, represented by the unit cube [0,1]d, and let v∈C(Td;Rq) be a periodic vector field. Let K≥0 be a frequency cutoff, and let Rk∈Cq′×q be trainable matrices for integer multi-indices k with ∥k∥∞≤K. Define the truncated Fourier integral layer by KRv(x)=∑∥k∥∞≤Ke2πik⋅xRkv^(k),v^(k)=∫Tde−2πik⋅yv(y) dy. For real-valued outputs require R−k=Rk‾ and R0 real. A Fourier neural-operator layer is vt+1(x)=σ(Wtvt(x)+KRvt(x)+bt(x)), where Wt is a real pointwise channel map, bt∈C(Td;Rq′) is a continuous periodic real bias, and σ:R→R is continuous and acts coordinatewise. The finite Fourier sum and these conditions give vt+1∈C(Td;Rq′). This definition gives a Fourier-parameterized layer only. It does not assert that the architecture is universal in any specified function-space topology.

LemmaStatement: Literature-sourcedProof: AI-generatedOpen item page →

The printed diameter-bounded activation class is empty

Statement

For each q≥1, the class BAq in the displayed activation-class definition is empty.

Facts & Assumptions

Given: An integer q≥1 and the definition of BAq.

[F1]

Membership in BAq requires, for every compact K⊂Rq, every ε>0, and every C≥diam⁡2(K), a network satisfying both the identity-approximation and global-bound inequalities (Activation classes for neural-operator universality).

Proof

Proof strategy: direct.

1.1givenF1choose

Suppose σ∈BAq. Choose x0∈Rq with x0≠0, set K={x0}, choose C=0, and choose 0<ε<∣x0∣2. Since a singleton has diameter zero, these choices satisfy the quantifiers in [F1].

2.1givenstep 1.1F1contradiction∎

The required network would satisfy ∣f(x)∣2≤0 for every x∈Rq, hence f(x0)=0. It would also satisfy ∣f(x0)−x0∣2≤ε, which becomes ∣x0∣2≤ε, contrary to the choice of ε. Therefore no σ belongs to BAq.

Remark

The source's immediately adjacent assertion that ReLU belongs to this class cannot follow from the printed definition: the contradiction above applies to every activation. The global-output-bound branch of the source's Theorem 11 is therefore vacuous as printed. A change from diameter to a bound involving the location of K would be a different definition and requires owner reconciliation.

LemmaStatement: Literature-sourcedProof: AI-generatedOpen item page →

Kernel Riemann sums converge uniformly on compact continuous-input sets

Statement

Let d,d′∈N with d,d′≥1, let D⊂Rd be nonempty, bounded, and Jordan measurable, let D′⊂Rd′ be nonempty and bounded, let κ∈C(Dˉ′×Dˉ) be scalar-valued, and let K⊂C(Dˉ) be nonempty and compact in the supremum norm. Give products of metric spaces the max metric. Let Qn:C(Dˉ)→R be bounded linear quadrature functionals with sup⁡n∥Qn∥<∞ and Qnf→∫Df(y) dy for every f∈C(Dˉ). Then sup⁡a∈Ksup⁡x∈Dˉ′∣Qn(κ(x,⋅)a(⋅))−∫Dκ(x,y)a(y) dy∣⟶0. This conclusion is in the supremum norm on the output variable. It does not by itself establish convergence in an arbitrary Banach output norm U.

Facts & Assumptions

Given: The compact set K, the continuous kernel κ, and the quadrature functionals in the Statement.

[F2]

The hypotheses give pointwise convergence Qnf→∫Df on C(Dˉ) and a uniform bound on the operator norms of Qn.

Proof

Proof strategy: direct finite-net argument.

1.1givenF3F4algebra

Define Φ(x,a)=κ(x,⋅)a(⋅) on Dˉ′×K. For (x,a),(x′,a′) in this product, ∥Φ(x′,a′)−Φ(x,a)∥∞≤∥κ∥∞∥a′−a∥∞+∥a∥∞sup⁡y∈Dˉ∣κ(x′,y)−κ(x,y)∣. The constants are finite by [F3]. Given η>0, uniform continuity of κ on Dˉ′×Dˉ gives a positive δ1 making the second term less than η/2 when ∣x′−x∣<δ1; choosing δ2>0 with ∥κ∥∞δ2<η/2 bounds the first term whenever ∥a′−a∥∞<δ2 (if ∥κ∥∞=0, that term is zero). Thus Φ is continuous for the max product metric. The domain is compact by [F3], so [F4] makes its image S compact.

1.2givenF2algebra

Put M=1+sup⁡n∥Qn∥+∣D∣>0. For any f,g∈C(Dˉ), ∣Qn(f)−∫Df−Qn(g)+∫Dg∣≤M∥f−g∥∞, since ∣∫D(f−g)∣≤∣D∣∥f−g∥∞.

2.1step 1.1F1F2choose

Fix ε>0. Put M=1+sup⁡n∥Qn∥+∣D∣>0. By [F1] and step 1.1, choose a finite ε/(3M)-net f1,…,fJ for S. For each j, [F2] gives an index nj such that ∣Qn(fj)−∫Dfj∣<ε/3 whenever n≥nj.

3.1step 1.2step 2.1algebra∎

Let n≥max⁡jnj and f∈S. Choose j with ∥f−fj∥∞<ε/(3M). By [step 1.2] and the bound from [step 2.1], ∣Qn(f)−∫Df∣≤M∥f−fj∥∞+∣Qn(fj)−∫Dfj∣+M∥fj−f∥∞<ε. Every f∈S has this bound, so taking the supremum over a∈K and x∈Dˉ′ proves the assertion.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Fill-distance control of the population PINN loss

Statement

For d≥2, let U⊂Rd and Γ⊂Rd be measurable, and let μr and μb be probability measures on them. For positive integers mr,mb, let the residual samples x1r,…,xmrr and boundary samples x1b,…,xmbb form εr- and εb-nets of U and Γ in Euclidean distance. Assume that for every center x∈U and y∈Γ, μr(B‾εr(x)∩U)≤Crεrd,μb(B‾εb(y)∩Γ)≤Cbεbd−1. Suppose [L[h]]α;U, [B[h]]α;Γ, [f]α;U, and [g]α;Γ are finite, where [v]α;E=sup⁡x≠y∈E∣v(x)−v(y)∣/∣x−y∣α, with value zero when E has fewer than two points. Let λr,λb>0, and use the population and empirical weighted-square PINN losses Loss⁡PINN(h;λ)=λr∫U∣L[h]−f∣2 dμr+λb∫Γ∣B[h]−g∣2 dμb, Loss⁡mPINN(h;λ)=λrmr∑i=1mr∣L[h](xir)−f(xir)∣2+λbmb∑j=1mb∣B[h](xjb)−g(xjb)∣2. Define Cm=3max⁡{Crmrεrd, Cbmbεbd−1},λr,mR=3λrεr2αCm,λb,mR=3λbεb2αCm. Then Loss⁡PINN(h;λ)≤CmLoss⁡mPINN(h;λ)+Cm(λr,mR[L[h]]α;U2+λb,mR[B[h]]α;Γ2)+3λrεr2α[f]α;U2+3λbεb2α[g]α;Γ2.

For d=1, assume μr is a probability measure on measurable U⊂R, and Γ is a nonempty finite measurable set with probability measure μb, with every singleton {y}⊆Γ measurable. Every point of Γ is available deterministically. For a positive integer mr, let x1r,…,xmrr form an εr-net of U, and assume μr(B‾εr(x)∩U)≤Crεr for every center x∈U. Suppose the same four Hölder seminorms are finite. Use the exact weighted boundary loss Loss⁡PINN,b(h;λb)=λb∫Γ∣B[h]−g∣2 dμb=λb∑y∈Γμb({y})∣B[h](y)−g(y)∣2 and the empirical loss Loss⁡mPINN(h;λ)=λrmr∑i=1mr∣L[h](xir)−f(xir)∣2+Loss⁡PINN,b(h;λb). Set Cm=3Crmrεr,λr,mR=3λrεr2αCm,λb,mR=0. Then Loss⁡PINN(h;λ)≤CmLoss⁡mPINN(h;λ)+Cmλr,mR[L[h]]α;U2+3λrεr2α[f]α;U2. There is no random boundary term or boundary-data error term in this branch because the full boundary contribution is evaluated exactly.

Facts & Assumptions

Given: The trial function, residual and boundary operators, sample sets, fill distances, measures, and positive loss weights in the Statement.

[F1]

The population and empirical PINN losses use the weighted-square conventions in the local definition (Physics-informed residual loss and Hölder regularization).

[F2]

For d≥2, the residual cells have mass at most Crεrd and the boundary cells have mass at most Cbεbd−1 by the upper ball-mass assumptions. For d=1, each residual cell has mass at most Crεr by the residual upper ball-mass assumption in the Statement.

[F3]

The Hölder seminorm convention is ∣v(x)−v(y)∣≤[v]α;E∣x−y∣α (Physics-informed residual loss and Hölder regularization).

[F4]

In the one-dimensional branch, the exact full-boundary empirical contribution equals the population boundary integral, and a finite union of sample-centered εr-balls covers U (Physics-informed residual loss and Hölder regularization, Finite and countable subadditivity of measures).

Proof

Proof strategy: integrate local collocation bounds over a measurable partition subordinate to the sampling balls.

1.1givenconstruct

Put Ai=B‾εr(xir)∩U and Vi=Ai∖⋃k<iAk. The ball-mass assumptions make the Ai measurable, and the net property makes the Vi a measurable partition of U subordinate to the sampling balls. For d≥2, use the same construction on Γ with the boundary balls to obtain cells Wj; for d=1, use every point of the finite boundary deterministically and make no boundary partition.

1.2givenF2F3algebra

By [F2], μr(Vi)≤Crεrd in the d≥2 branch and μr(Vi)≤Crεr in the d=1 branch. If x∈Vi, the three-term square inequality and [F3] give ∣L[h](x)−f(x)∣2≤3∣L[h](xir)−f(xir)∣2+3εr2α[L[h]]α;U2+3εr2α[f]α;U2. For d≥2, each boundary cell satisfies μb(Wj)≤Cbεbd−1, and its analogous local square bound holds.

2.1step 1.1step 1.2F1algebra

Integrate the residual inequality over the cells. The collocation terms contribute at most 3Crmrεrdλrmr−1∑i∣L[h](xir)−f(xir)∣2 for d≥2, and 3Crmrεrλrmr−1∑i∣L[h](xir)−f(xir)∣2 for d=1. The seminorm and data terms contribute 3λrεr2α([L[h]]α;U2+[f]α;U2) because μr(U)=1.

2.2step 1.1step 1.2F1F4algebra

For d≥2, integrating the boundary inequality gives the estimate with 3Cbmbεbd−1 multiplying the empirical boundary term and 3λbεb2α([B[h]]α;Γ2+[g]α;Γ2) for the remaining terms. For d=1, the weighted boundary term in the population loss is exactly Loss⁡PINN,b(h;λb) from [F4].

3.1step 2.1step 2.2F4algebra∎

For d≥2, by the definition of Cm, the empirical residual and boundary coefficients in steps 2.1–2.2 are at most Cm. The seminorm coefficients equal Cmλr,mR and Cmλb,mR by definition, while the data terms already have their displayed coefficients. Adding the estimates yields the result. For d=1, the net and upper ball-mass bound imply 1=μr(U)≤∑i=1mrμr(B‾εr(xir)∩U)≤mrCrεr, so Cm≥3. Thus Cm dominates the exact boundary term, the residual empirical coefficient from step 2.1 equals Cm, and Cmλr,mR=3λrεr2α. Combining these bounds with the residual data term proves the one-dimensional inequality.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Interior parabolic Schauder estimates by freezing the Gaussian kernel

Statement

Assume Countable Choice. Let 0<α<1, and let O⊂Rd×R be open. Use ρ((x,t),(y,s))=max⁡{∣x−y∣,∣t−s∣} and [v]α;E=sup⁡z≠z′∈E∣v(z)−v(z′)∣/ρ(z,z′)α. Suppose the symmetric matrix A, vector β and scalar q are locally α-Hölder for this metric, and λI≤A≤ΛI with 0<λ≤Λ<∞. For every compact parabolic cylinder K contained in the interior of a larger compact cylinder K′⊂O there is C<∞, depending on these cylinders, d,α,λ,Λ and the coefficient Hölder norms on K′, such that every smooth u satisfying ut−A:D2u−β⋅Du−qu=F near K′ obeys ∥u∥C2+α,1+α/2(K)≤C(∥u∥L∞(K′)+∥F∥Cα,α/2(K′)). Here the left norm consists of the suprema and parabolic α-Hölder seminorms of u,Du,D2u,ut. The constant does not depend on derivatives of the coefficients above their displayed Hölder regularity. The assertion is an estimate for smooth solutions, not a prior assumption of classical solvability.

Facts & Assumptions

Given: Countable Choice, the cylinders, coefficients, smooth solution and source in the Statement.

[A1]

Countable Choice is inherited from the Gaussian integration and distribution suppliers (The Axiom of Countable Choice (ACω)).

[F1]

The causal heat kernel has unit spatial mass, parabolic scaling, Gaussian derivative bounds and distributional equation (∂t−Δ)Γ=δ (Normalisation, parabolic scaling, heat equation and derivative bounds for the heat kernel, The causal heat kernel is the fundamental solution of the heat operator).

[F2]

A smooth cutoff equal to one near a compact set and supported inside a prescribed open neighborhood exists (A Euclidean bump for a compact set inside an open set).

Proof

1.1A1F1givenalgebra

Fix a constant symmetric matrix A0 with eigenvalues in [λ,Λ]. The linear substitution x=A01/2y in [F1] gives G(x,t)=1t>0(4πt)−d/2(det⁡A0)−1/2exp⁡(−xTA0−1x/(4t)),(∂t−A0:D2)G=δ. Put N=d+2 and Kij=DijG. Direct differentiation gives ∣Kij(z)∣≤Cρ(z,0)−N, ∣DxKij(z)∣≤Cρ(z,0)−N−1 and ∣∂tKij(z)∣≤Cρ(z,0)−N−2 away from zero, with Gaussian decay as ∣x∣/t increases. The extension across t=0 is smooth away from x=0, since that decay dominates every power. The constants are uniform over A0 in the given ellipticity interval.

1.2givenalgebrachoose

For use with cutoffs, the following interpolation estimate holds on nested cylinders, with norms scaled to their outer radius r: for each ε>0, the scaled lower-order α norms of u and rDu are at most εr2(∥D2u∥α;r+∥ut∥α;r)+Cε∥u∥∞, provided the finite difference segments lie in the larger cylinder. To verify it, write Diu(x,t) as a centered first difference of step θr plus its Taylor integral remainder, bounded by Cθr∥D2u∥∞. Apply the same identity to differences between two points. For separations smaller than θr use the top Hölder norms, and for larger separations use the supremum estimate and divide by the separation to the power α. For time differences of u use ∣t−s∣∥ut∥∞. For time differences of Du use spatial first differences of step ∣t−s∣, bounding their time difference by C∣t−s∣∥ut∥∞ and the two remainders by C∣t−s∣∥D2u∥∞; then split at ∣t−s∣=θ2r2. The coefficients of the top norms are positive powers of θ because α<1. Choosing θ small makes them at most ε; the larger-separation terms have finite constants depending on that θ and the cylinder separation.

2.1F1step 1.1algebra

Each positive-time spatial integral of Kij is zero. Its improper integrals on parabolic balls have a bound independent of the radius. Indeed integration of DijG over ∣x∣<R gives a boundary integral of DjG; its absolute value is at most CRdt−d/2−1exp⁡(−cR2/t). Integration for 0<t<R2, followed by t=R2s, is bounded by C∫01s−d/2−1e−c/sds<∞. The integral is independent of R by scaling. Differences of two such truncations, hence the integrals on centered parabolic annuli, are bounded uniformly as well. This is the cancellation needed at the singularity; an absolute integral of ∣Kij∣ there is not asserted.

3.1F1step 1.1step 2.1construct

Let v∈Cc∞ have support in a parabolic cylinder of radius at most r and put F0=vt−A0:D2v. Integrating the derivative of the Gaussian convolution from a time before the support gives v=G∗F0: the initial convolution is zero, its derivative is convolution with F0, and the positive-time approximate identity gives the upper endpoint. This uses only [F1] and differentiation of smooth compactly supported functions. Differentiation of this identity expresses Dijv as the principal-value convolution with Kij, with a fixed bounded constant multiple of F0 if the truncation is by parabolic balls rather than positive time strips. That constant is the radius-independent truncation integral in step 2.1.

4.1step 1.1step 2.1step 3.1algebra

The singular-integral estimates follow directly as follows. At a pole subtract F0 evaluated at that pole. On an annulus of radius s, the difference is bounded by [F0]αsα, and its absolute integral against Kij is at most C[F0]αsα. For two poles at parabolic distance h, the parts within distance 4h of either pole are therefore bounded by C[F0]α∫04hsα−1ds≤C[F0]αhα. On the complement use the same subtracted constant at both poles. The kernel difference is at most Chs−N−1: spatial displacement follows from DxKij, and time displacement, of size at most h2, from ∂tKij and h2s−N−2≤hs−N−1. Its integral is bounded by C[F0]αh∫4h∞sα−2ds≤C[F0]αhα. Changing the near-region truncation produces annular pieces controlled by these same estimates; changing the subtracted constant produces at most C∣F0(z)−F0(z′)∣ by step 2.1. Thus [D2v]α≤C[F0]α. On the support neighborhood, integrating only up to radius comparable with r and using the bounded truncation term gives ∥D2v∥∞≤C(∥F0∥∞+rα[F0]α); outside that neighborhood the kernel is nonsingular and its Gaussian bound gives the same estimate. The compact time support may be used to truncate all time integrals before subtraction, so no absolutely divergent integral at infinite time is introduced.

5.1step 4.1algebra

Since vt=F0+A0:D2v, the same bounds hold for vt. In the scaled notation ∥g∥α;r=∥g∥∞+rα[g]α, the result is r2(∥D2v∥α;r+∥vt∥α;r)≤Cr2∥vt−A0:D2v∥α;r. All constants depend only on d,α,λ,Λ and the fixed support-radius multiple. The strict inequality α<1 is used in the convergent far integral of step 4.1.

6.1F2step 5.1step 1.2givenconstruct

Choose a cutoff η supported in a cylinder of radius r near z0, and put v=ηu, extended by zero. Freeze A0=A(z0). Leibniz's formula gives vt−A0:D2v=ηF+(A−A0):D2v+β⋅Dv+qv+u(ηt−A:D2η−β⋅Dη)−2(ADη)⋅Du. The scaled product norm of (A−A0):D2v is bounded by Crα[A]α∥D2v∥α;r. Choose r so that this coefficient, multiplied by the constant in step 5.1, is at most 1/4, and absorb it there. The remaining drift, zero-order and cutoff terms involve only u,Du and F; step 1.2 absorbs their top-norm contributions after choosing its ε sufficiently small. Cutoffs with derivatives bounded by powers of the inverse gap between inner and outer cylinders are supplied by [F2] after rescaling.

7.1step 1.2step 6.1algebra∎

The resulting nested-cylinder inequality has the form M(s)≤εM(S)+Cε(S−s)−mB, where M is the full scaled top norm, m<∞ is fixed and B=∥u∥∞+∥F∥α. To remove the outer top norm, choose radii sj=s0+a(1−2−j) whose limiting cylinder is strictly inside the domain, and take ε<2−m−1. Iteration gives a convergent geometric sum of the B terms. The remainder εjM(sj) tends to zero because u is smooth on the fixed larger compact cylinder. Thus M(s0)≤CB. A finite cover of K by the small cylinders in step 6.1, and step 1.2 for the lower derivatives, gives the stated estimate. The choices used coefficient Hölder bounds and ellipticity only, proving the asserted independence from higher coefficient derivatives.

Source notes

The full Shin source definitions and Appendix F were read. That appendix cites a classical existence theorem and does not prove the estimate above; the kernel calculation is supplied here. The published heat-kernel suppliers provide their displayed kernel/distribution interfaces, not a variable-coefficient existence theorem.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Classical parabolic solvability by weak approximation and exterior-ball barriers

Statement

Assume Countable Choice and the Axiom of Choice. Let U⊂Rd be nonempty, bounded and open, T>0, and 0<α<1. At every x0∈∂U assume there is an exterior tangent closed ball, disjoint from U and containing x0 on its sphere. Let A=AT, β,q,f be bounded on U×(0,T], locally parabolic α-Hölder up to its final face, with λI≤A≤ΛI, λ>0, and q≤0. Let the combined initial and lateral datum ψ be continuous on ΓT=(Uˉ×{0})∪(∂U×[0,T]), including compatibility at their intersection. Then there is a unique u∈Cloc2+α,1+α/2(U×(0,T])∩C(Uˉ×[0,T]) with −ut+A:D2u+β⋅Du+qu=f and u=ψ on ΓT. It obeys ∥u∥∞≤∥ψ∥∞+T∥f∥∞. Moreover it is the interior limit of smooth-coefficient weak solutions on finite polyhedral subdomains exhausting U, with uniform supremum bounds and the uniform compact-interior estimates just stated. If the coefficients possess a bounded divergence representation compatible in distributions, those approximants may be chosen by convolution of its original divergence coefficients.

Facts & Assumptions

Given: The choices, domain, exterior balls, bounded coefficients, ellipticity, sign, local Hölder regularity and compatible continuous data in the Statement.

[A1]

Countable Choice is used by weak solvability and countable extraction. The Axiom of Choice is carried by truncation calculus, reference-simplex extension and Sobolev embedding; it also implies the Dependent Choice needed by the cited Arzela–Ascoli theorem (The Axiom of Countable Choice (ACω), The Axiom of Choice).

[F1]

On every bounded open D, H01(D)↪L2(D) is a separable Hilbert evolution triple (The zero-boundary Sobolev evolution triple on an arbitrary bounded open set).

[F2]

A bounded coercive measurable form on that triple has a unique weak parabolic solution, with a continuous L2 trace and the energy-pairing identity (Well-posedness for measurable coercive parabolic forms, The evolution-space energy identity and continuous H trace).

[F3]

Positive parts have gradient D(v+)=1v>0Dv, and compactly supported cutoff positive parts are admissible Sobolev tests (Positive-part truncation calculus and admissible cut-off weak tests).

[F4]

Uniform spatial difference-quotient L2 bounds give the corresponding weak derivative; sufficiently high-order local spacetime Sobolev regularity gives a smooth representative by embedding on small simplices (The difference-quotient characterisation of W1,p for 1<p<∞, A reference simplex is an integer-order Sobolev extension domain, Higher-order Sobolev embedding).

[F5]

Smooth solutions satisfy interior parabolic Schauder estimates with constants independent of higher coefficient derivatives (Interior parabolic Schauder estimates by freezing the Gaussian kernel).

[F6]

Equicontinuity and boundedness on compact sets give compact closure in the uniform topology under the declared choice assumptions (Arzelà--Ascoli for real C(K) under Countable Choice and Dependent Choice: compact closure iff equicontinuous and pointwise bounded).

Proof

1.1givenalgebracontradiction

Write P=−∂t+A:D2+β⋅D+q. First prove classical comparison. If Pv≥0 and v≤0 on the initial and lateral faces, fix τ<T. The function v−ε(t+1) has strictly positive P, since P(t+1)=−1+q(t+1)≤−1. If it had a positive maximum on Uˉ×[0,τ], that maximum would occur at a spatial interior point at time s>0. Its spatial gradient is zero, its Hessian is negative semidefinite, and its time derivative is nonnegative if s=τ and zero if s<τ. The derivatives exist since τ<T. Thus its P value is nonpositive, a contradiction. Let ε↓0, then τ↑T, using continuity. The same proof works on subcylinders and shows uniqueness by applying it to both signs of a solution difference.

1.2A1F2F3algebraconstruct

For a smooth-coefficient weak subsolution of vt−div⁡(ADv)−B⋅Dv−qv≤0 with zero initial positive part and weak nonpositive boundary order, use v+ as test. The needed time identity follows by taking time averages in the variational equation, testing with smooth convex approximations to the positive part, applying the ordinary chain rule to those averages, and passing first in the averaging radius and then in the convex approximation; the derivatives of the convex approximations lie in [0,1], so [F3] and dominated convergence justify both passages. Consequently 12ddt∥v+∥22+λ2∥Dv+∥22≤(∥B∥∞22λ+∥q+∥∞)∥v+∥22. An integrating factor and its zero initial value give v+=0. To justify weak boundary order without a smooth boundary, write v=w+H with w∈H01(D) and compare to a smooth barrier W satisfying H−W<0 on a neighborhood of ∂D. Approximate w by compactly supported smooth wj. Then (wj+H−W)+ has compact support in D. The positive-part map is continuous in H1: its gradient formula from [F3], the vanishing of Dv on a zero level set, and dominated convergence along almost-everywhere convergent subsequences prove this directly. Thus (v−W)+∈H01(D). Replace W by W+ε and then let ε↓0 when boundary order is non-strict. This proves the same local comparison on intersections with an interior ball, using the classical interior values on its artificial boundary.

1.3givenconstruct

Enlarge the time interval slightly. At each interior spatial point the coefficients and f have one-sided Hölder limits at T by hypothesis; extend them constantly after T, preserving ellipticity, sign and bounds. Extend the lateral datum continuously after T. It suffices to construct a solution on the longer cylinder and then restrict, so all subsequent compact-interior arguments include the original final face. Choose finite unions Un of dyadic cubes compactly contained in U, whose distance from its complement is at least 2/n, exhausting every compact subset of U, and with every point of ∂Un within C/n of ∂U. For example use a grid with side at most 1/(10nd) and take the interior of the union of closed grid cubes at distance greater than 3/n from the complement, passing to increasing finite unions with earlier domains if needed. Neighboring excluded cubes show the stated boundary-distance bound. Every fixed compact subset is eventually included.

2.1givenstep 1.3construct

Extend A outside U by λI, and β,q,f by zero, using bounded measurable extensions also before the initial time. Convolve with nonnegative smooth mollifiers of spatial radius less than 1/n and time radius less than 1/n2. The smooth coefficients An,βn,qn,fn retain the uniform bounds, ellipticity and qn≤0, converge locally in every lower Hölder exponent, and have uniformly bounded local α norms away from the initial/lateral boundary. The last assertion follows directly by writing a difference of convolutions as the average of the corresponding differences of the original locally Hölder function. Extend the continuous combined datum to a continuous H on a neighborhood of the closed cylinder and mollify it to Hn→H uniformly. Such an extension can be made explicitly with a continuous increasing subadditive modulus ω dominating the data modulus: H(z)=inf⁡y∈ΓT(ψ(y)+ω(dp(z,y))), truncated to the data range, equals ψ on ΓT and has modulus ω. A concave dominating modulus is subadditive. Prescribe Hn on ∂Un and initially on Un.

3.1A1F1F2step 1.2step 2.1algebra

Rewrite the smooth nondivergence equation in divergence form, with Bn=βn−div⁡An. Subtract Hn and multiply the zero-data unknown by e−knt, choosing finite kn large enough that its form satisfies an(v,v)+kn∥v∥22≥(λ/2)∥Dv∥22+∥v∥22. This follows by Young's inequality for the finite bounded Bn and qn; the form is bounded for each fixed n. The transformed source is smooth and belongs to L2(0,T;H−1(Un)). Apply [F1] and [F2], and undo the transformations, to get a weak solution un with those initial and lateral data. The bounds on Bn, kn and derivatives of Hn need not be uniform: they were used only to construct each approximant. Weak comparison from step 1.2 with ±(M0+tMf), where M0 bounds ∣Hn∣ and Mf bounds ∣fn∣, gives ∣un∣≤M0+tMf, uniformly in n.

3.2givenstep 2.1algebrachoose

Fix x0∈∂U. Take an exterior ball of center y and radius R. Replacing it by a smaller internally tangent ball makes its only contact with the old sphere be x0; its remaining points lie in the old ball's interior, so its only contact with Uˉ is x0. For r=∣x−y∣ set h=R−p−r−p≥0 on Uˉ, with h(x0)=0. Direct differentiation gives Lnh=pr−p−2(tr⁡An−(p+2)(x−y)TAn(x−y)r2+βn⋅(x−y))+qnh. Choose p with (p+2)λ>dΛ+sup⁡n∥βn∥∞(R+ρ)+1. Multiply h by a positive constant so that −Lnh≥1 in Un∩Bρ(x0), uniformly in n. On the artificial sphere Uˉ∩∂Bρ(x0) the minimum of h is positive by its isolated zero. These barriers use coefficient bounds and ellipticity only.

4.1A1F2F4step 3.1construct

Each weak un is smooth in the interior. Here is the regularity argument. With a compactly supported space-time cutoff η, test its smooth divergence equation with −D−h(η2Dhun), first using time averages to make the test legitimate. Difference-quotient integration by parts places Dh on the coefficients and gradient. The principal term is at least λ∥ηDDhun∥22. The remaining terms are sums of a bounded derivative of a smooth coefficient times a lower derivative of un, or a cutoff derivative times Dhun, or a differentiated smooth source; Cauchy–Schwarz and Young absorb half the principal term and bound the rest by a finite multiple of the Lt2Hx1 norm and source norms on a larger compact cylinder. A time cutoff removes its bottom boundary contribution; the top contribution has favorable sign. The quotient bound in [F4] and passage h→0 give all second spatial derivatives locally in L2. Repeating this calculation for a spatial derivative, with the Leibniz formula putting each differentiated coefficient beside a lower spatial derivative of un, proves inductively that every spatial derivative is locally in L2. The equation then gives un,t and all its spatial derivatives in L2. Differentiating that equation distributionally in time gives all spatial derivatives of un,tt in L2, since the smooth coefficient time derivatives multiply already known spatial derivatives of un and un,t. Induction gives all mixed time/space derivatives locally in L2. Apply [F4] on a small spacetime simplex around each interior point, with arbitrarily high Sobolev order; its extension and embedding theorems apply in dimension d+1≥2. The resulting representatives are smooth and agree on overlaps because they represent the same almost-everywhere function.

5.1A1F5F6step 2.1step 3.1step 4.1construct

On each compact subcylinder, [F5], the uniform supremum bound and the uniform local coefficient/source Hölder bounds give uniform bounds for un,Dun,D2un,un,t and their parabolic Hölder seminorms. Apply [F6] to these finitely many derivative families, then extract diagonally over a countable exhaustion of compact subcylinders. The limits of derivatives are derivatives of the limit by the coordinate segment integral identities. Thus a subsequence tends locally with two spatial and one time derivatives to u, and passage to the equations gives Pu=f. The uniform α seminorm bounds pass directly to differences of the limit, giving its asserted local full-α regularity. Its supremum is bounded by ∥ψ∥∞+T∥f∥∞ after letting the uniform data approximation error decrease to zero.

6.1step 1.2step 2.1step 3.1step 5.1step 3.2construct

Fix (x0,t0) on the lateral face with t0>0 and an error ε>0. Choose ρ,η>0 such that H differs from c0=ψ(x0,t0) by less than ε when ∣x−x0∣<ρ, ∣t−t0∣<η, also allowing t=0 if needed. Then Hn differs by less than 2ε for all large n. On the local cylinder with bottom s=max⁡(0,t0−η) use W=2ε+Ah+B(t−t0)2. Choose B to dominate the uniform solution bound on the artificial bottom if s>0, using Bη2; if s=0 the initial data already have the required 2ε bound. Choose A both to dominate on the artificial spatial face and to satisfy A≥Mf+∥q∥∞∣c0∣+2Bη, increasing the uniform q bound slightly if necessary. Then (∂t−Ln)W≥A−2Bη dominates the absolute source of un−c0, which includes the term qnc0. On the true boundary of Un its datum is Hn, so the comparison in step 1.2 gives ∣un−c0∣≤W throughout this neighborhood. First pass to the interior limit, then let (x,t)→(x0,t0), and finally ε↓0. This proves lateral boundary attainment from both time directions.

7.1step 1.1step 1.2step 1.3step 5.1step 6.1construct

At (x0,0), including a corner, use W=2ε+A∣x−x0∣2+Bt. Choose A to dominate on the artificial spatial face and choose B≥Mf+∥q∥∞∣ψ(x0,0)∣+CA, where C bounds ∣Ln∣x−x0∣2∣ on the neighborhood. The terms −qnW have favorable sign. Initial and nearby lateral data differ from ψ(x0,0) by at most 2ε. The same comparison and limits prove initial attainment. At spatial interior points of the original final face, step 1.3 and step 5.1 give regularity and continuity. Together these arguments extend u continuously to the whole closed cylinder with its prescribed values. Step 1.1 gives uniqueness.

8.1step 1.3step 2.1step 3.1step 5.1step 7.1givenalgebra∎

If the original bounded divergence coefficients a,b,c,d have the distributionally compatible expansion A=a, βj=∑iDiaij+bj+cj, q=∑iDibi+d, choose their convolutions rather than independently convolving the expanded coefficients. Use a nonnegative temporal mollifier supported at strictly positive past lags, so its convolution samples t−s with s>0, and a spatial mollifier whose support stays inside U at every point of Un. Extend in time by a=λI, b=c=d=0 before time zero; this introduces no spatial derivative error. Distributional spatial differentiation commutes with convolution, so the expanded coefficients are the convolutions of β,q and retain their bounds and sign. At t≤T no value or limit of the original b,c,d beyond or at T is needed. Each fixed smooth approximant can be extended locally past T when its existence construction requires it; only its convergence on positive-time compact sets below T is needed for the energy limit. The boundary arguments apply at every lateral time below T, and the solution already constructed in step 7.1 supplies the continuous final trace. This proves the compatible approximation assertion without imposing endpoint continuity on the original divergence coefficients.

Remarks

The boundedness of the expanded drift, potential and source is essential to this proof. In the source weighted convention ∣v∣0,α contains sup⁡∣v∣, so membership in that class supplies it. Weighted bounds only on δβ, δ2q, δ2f together with merely local Hölder regularity do not imply it. No global C2,1 derivative bound at the initial/lateral boundary is concluded.

The full Shin Assumption 3.4 and Appendix F were read. Its Theorem F.1 cites Friedman, Chapter 3 Corollary 2; no reading of that full book is claimed. The present proof uses the displayed published weak variational interface and supplies the classical upgrade locally.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Zero-data bounded classical parabolic errors are weak energy solutions

Statement

Assume Countable Choice and the Axiom of Choice. Let U⊂Rd be bounded and open with an exterior tangent ball at every boundary point, and let T>0. Consider the intended divergence operator Ltu=∑i,jDi(aijDju)+∑iDi(biu)+∑iciDiu+du. Assume a=aT≥λ0I, λ0>0, and a,b,c,d bounded; the spatial derivatives of a,b agree with distributional derivatives locally, and the expansion βj=∑iDiaij+bj+cj,q=∑iDibi+d is locally valid with bounded a,β,q, locally parabolic α-Hölder up to the final face, 0<α<1, and q≤0. Let r be bounded and locally parabolic α-Hölder up to that face. If e is locally classical, bounded, continuous on the closed cylinder, zero on the initial and lateral faces, and satisfies −et+Lte=r, then e∈L2(0,T;H01(U)),et∈L2(0,T;H−1(U)),e(0)=0 in L2(U). It is the unique zero-initial variational solution of that equation, and for a finite CE depending only on T,λ0 and the divergence coefficient bounds, sup⁡0≤t≤T∥e(t)∥22+∫0T∥De(t)∥22dt≤CE∥r∥L2(U×(0,T))2. Consequently a sequence of such errors with ∥em∥∞→0 and ∥rm∥∞→0 converges strongly to zero in L2(0,T;H1(U)). No closed-cylinder derivative regularity is assumed.

Facts & Assumptions

Given: The choice assumptions, domain, coefficients, distributionally compatible expansion, source and classical zero-data error in the Statement.

[A1]

Countable Choice and the Axiom of Choice are retained from the approximation, truncation and Sobolev suppliers (The Axiom of Countable Choice (ACω), The Axiom of Choice).

[F1]

The bounded-open-set Sobolev triple is separable; H01(U) is the H1-closure of compactly supported smooth functions (The zero-boundary Sobolev evolution triple on an arbitrary bounded open set, Zero-boundary Sobolev space as a norm closure).

[F2]

Smooth weak approximants on exhausting polyhedral domains have uniform compact-interior classical estimates and converge to the unique bounded classical solution with the prescribed continuous data; compatible divergence-coefficient convolutions are permitted (Classical parabolic solvability by weak approximation and exterior-ball barriers).

[F3]

Evolution-space solutions have continuous L2 traces and satisfy the time energy-pairing identity (The evolution-space energy identity and continuous H trace).

[F4]

A bounded sequence in a separable Hilbert space has a weakly convergent subsequence, and the corresponding Bochner spaces are separable Hilbert spaces (Bounded sequences in a separable Hilbert space have weakly convergent subsequences).

[F5]

Every L1 approximate identity converges strongly to the identity in finite Lp, in particular p=2; the kernel may be anisotropic provided its mass, uniformly bounded L1 norm and shrinking-tail conditions hold (Every L1 approximate identity converges to the identity in Lp for 1≤p<∞).

Proof

1.1A1F2givenconstruct

Use the domains Un and divergence-compatible smooth convolution approximants from [F2], with zero initial and lateral data and source rn. Their spatial mollifier support stays inside U at every point of Un; their temporal mollifier is supported at positive past lags, sampling t−s with s>0. Thus an retains ellipticity and its bound, bn,cn,dn retain their separate bounds, and the expanded βn,qn are the convolutions of the bounded original expanded coefficients, retaining their bounds and qn≤0. No endpoint limit of the original b,c,d at T is used. Each fixed smooth approximant may be extended locally past T for its construction; compactness is used only at times below T. The resulting weak solutions en are smooth in the interior, uniformly bounded, and have a locally classical subsequential limit with zero continuous initial/lateral data at every time below T by [F2]. Classical comparison on cylinders ending below T identifies the limit with e.

2.1F1F3step 1.1algebra

Test the weak equation en,t−Lnen=−rn with en. The divergence terms have no boundary contribution because en∈H01(Un) in time-integrated sense. In particular the lower-order spatial form is ∫UnanDen⋅Den+∫Un(bn−cn)⋅Den en−∫Undnen2. The cross term is bn−cn, since the b term is integrated by parts and the c term is not. Write B=∥b∥∞+∥c∥∞ and D=∥d∥∞. With yn=∥en∥22, [F3], ellipticity and Young's inequality give 12yn′+λ02∥Den∥22≤(B22λ0+D+12)yn+12∥rn∥22. The constants are uniform in n; derivatives of the smoothed coefficients do not occur.

3.1step 2.1algebra

Put C0=B2/λ0+2D+1. The previous inequality gives yn′+λ0∥Den∥22≤C0yn+∥rn∥22. Multiply by e−C0t and integrate, using yn(0)=0. Then sup⁡tyn≤eC0T∥rn∥L22. Integrating the same differential inequality without the factor bounds λ0∫∥Den∥22 by C0Tsup⁡yn+∥rn∥L22. The boundedness of r and the finite cylinder give a uniform right side.

4.1A1F1F4step 1.1step 3.1construct

Extend each en by zero from Un to U. For almost every time this lies in H01(U): extend its compactly supported smooth H1(Un) approximants by zero, which preserves their norms, and use the closure definition in [F1]. The bounds in step 3.1 therefore give a bounded sequence in L2(0,T;H01(U)). Apply [F4] and pass to a weakly convergent subsequence. The local uniform convergence from step 1.1 identifies this weak limit with e almost everywhere, by testing on compact interior cylinders. Such cylinders exhaust U×(0,T); a locally zero L2 function is zero almost everywhere on their union. Hence e∈L2(0,T;H01(U)).

5.1F1F5step 1.1step 3.1step 4.1algebra

Fix a compact positive-time cylinder K⋐U×(0,T) and a smooth spacetime cutoff χ equal to one near K. Extend each of χb,χc,χd by zero to Rd+1; these bounded compactly supported functions belong to L2. The nonnegative product convolution kernels used in step 1.1 have mass one, L1 norm one, and support shrinking to zero in both space and time (with positive past time lag). Thus they satisfy the approximate-identity conditions, although the spatial and temporal scales differ. Apply [F5] with p=2 to these extensions. For large n their convolutions agree on K with bn,cn,dn, respectively, so bn→b, cn→c and dn→d strongly in L2(K), with their common uniform supremum bounds. Only an,βn,qn,rn are asserted to converge uniformly on such compact cylinders, by their local Hölder regularity. For a smooth test ϕ supported in K, the anDen⋅Dϕ term passes by uniform coefficient convergence and weak L2 gradient convergence. In the term cn⋅Den ϕ, the test vector cnϕ converges strongly in L2(K), so its pairing with the bounded weakly convergent gradients tends to ∫c⋅De ϕ. In the bnen⋅Dϕ and dnenϕ terms, strong local coefficient convergence and local uniform convergence of en imply strong L2 convergence of the products. The source and time-test terms pass by local uniform convergence. These arguments prove the limiting weak identity on every compact positive-time cylinder without extra spatial C1 assumptions on b,c,d.

6.1F1step 3.1step 4.1step 5.1algebra

For a smooth spacetime test with compact spatial support in U but not necessarily vanishing at initial time, first perform the passage above on [δ,T], taking its support strictly below T when necessary. The common bounded coefficient and source norms, supremum bounds and energy bounds control the omitted interval (0,δ) uniformly: terms linear in gradients are at most a fixed constant times δ∥Den∥L2 by Cauchy–Schwarz, and the zeroth-order, source and time-test terms are at most a constant times δ. The same bounds hold for the limit by step 4.1. Letting δ↓0 therefore gives the identity with zero initial boundary term, inherited from the approximants. Density of spatial compact-smooth functions in H01(U) extends the positive-time identity to all variational tests, since the divergence coefficients are bounded and the limit has the membership established in step 4.1. It follows that et=Lte−r∈L2(0,T;H−1(U)).

7.1F1F3step 2.1step 3.1step 6.1algebra

By [F3], this evolution-space function has a continuous L2 trace. Its integration-by-parts identity compared with the weak identity in step 6.1, for tests η(t)ϕ(x) with η(0)≠0 and ϕ∈Cc∞(U), gives (e(0),ϕ)L2=0. Density in L2(U) gives e(0)=0. Thus e is a zero-initial variational solution as claimed. If two such weak solutions exist, their difference has zero source and zero initial value. The same test and integrating-factor argument as steps 2.1–3.1 on U gives zero L2 norm at every time, proving weak uniqueness.

8.1F3step 2.1step 3.1step 7.1algebra

Apply [F3] to the now identified weak solution e, repeating step 2.1 on U with its actual source r. The integrating-factor and integrated gradient arguments in step 3.1 yield the stated estimate with, for example, CE=eC0T+λ0−1(C0TeC0T+1). The exact value is immaterial, but its dependence is only on the declared quantities, not on boundary derivatives of e.

9.1step 8.1algebra∎

For the final convergence assertion, ∥rm∥L22≤T∣U∣∥rm∥∞2→0. The estimate in step 8.1 gives ∫∥Dem∥22→0, and either that estimate or ∫∥em∥22≤T∣U∣∥em∥∞2 gives the zeroth-order term. Their sum is the squared L2(0,T;H1(U)) norm. This proves strong convergence and completes the result.

Remarks

The expansion assumption is deliberately distributional as well as pointwise. Local C1 spatial coefficients imply it. The source's word “differentiable” should not be used to conceal an unproved weak integration-by-parts identity for pathological pointwise derivatives. This helper imposes no extra boundary smoothness and no C2,1 regularity on the closed cylinder.

The intended operator has a separately indexed ∑iDi(biu) term. The source's printed ∑i,jDi(aijDju+biu) repeats that term d times and is incompatible with its own expanded drift and potential; it is not the operator used in this helper.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Variable-coefficient parabolic initial-boundary existence and residual stability

Statement

Assume Countable Choice and the Axiom of Choice. Let U⊂Rd be nonempty, bounded and open, T>0, Q=U×(0,T), and 0<α<1. Use the intended divergence operator Ltu=∑i,jDi(aijDju)+∑iDi(biu)+∑iciDiu+du, and its spatially expanded coefficients b~j=∑iDiaij+bj+cj,c~=∑iDibi+d. Assume a,b have the pointwise spatial derivatives needed for the expanded coefficients, a=aT≥λ0I with λ0>0, and every spatial boundary point has an exterior tangent ball. The classical equation is understood through these expanded nondivergence coefficients. Assume a,b~,c~,f have finite source order-zero weighted parabolic Hölder norms and the additional source weighted bounds ∣δb~∣α,∣δ2c~∣α,∣δ2f∣α<∞. Here the order-zero convention is ∣v∣0,α=sup⁡P∈Q∣v(P)∣+sup⁡P≠R∈QδP,Rα∣v(P)−v(R)∣dp(P,R)α,dp(P,R)=(∣x−y∣2+∣t−s∣)1/2, with δ(P)=min⁡{dist⁡(x,∂U),t} and δP,R=min⁡{δ(P),δ(R)}. Assume the initial datum g and lateral datum φ are Hölder continuous with compatible values g(x)=φ(x,0) on ∂U. Retain the source barrier assumption that some θ>0 satisfies θ2a11+θb~1≥1 and its coefficient bounds ∑i,j∣aij∣2≤Λ,λ0−2(∣b∣2+∣c∣2)+λ0−1∣d∣≤v2. Then the problem −ut+Ltu=f, u=g initially and u=φ laterally has a unique solution u∗∈Cloc2+α,1+α/2(U×(0,T])∩C(Uˉ×[0,T]). Write ψ for the combined prescribed datum and ΓT=(Uˉ×{0})∪(∂U×[0,T]). If c~≤0, every h∈C2,1(Q)∩C(Uˉ×[0,T]) with finite residual norm satisfies ∥h−u∗∥∞≤∥h−ψ∥C(ΓT)+T∥f+ht−Lth∥∞. Consequently any sequence whose two right-hand errors tend to zero converges uniformly to u∗. If it exactly satisfies the initial and lateral conditions, its residuals are also locally parabolic Hölder, and the displayed divergence-to-nondivergence expansion agrees in distributions locally, its errors em=hm−u∗ belong to L2(0,T;H01(U)) and satisfy ∥em∥L2(0,T;H1(U))→0. If additionally u∗∈L2(0,T;H1(U)), as holds for zero initial and lateral data, then hm also belong to that space and converge strongly there to u∗. Hölder prescribed data alone do not assert this additional membership of the individual functions. In particular these deterministic implications apply on every probability-one event where a PINN residual-consistency theorem supplies the stated residual and prescribed-data limits.

Facts & Assumptions

Given: All choices, domain, coefficient, Hölder, data, exterior-ball and retained source hypotheses in the Statement; the weak-expansion compatibility is additionally assumed for the energy clause.

[A1]

Countable Choice and the Axiom of Choice are retained from weak existence, Sobolev truncation, compactness and smooth-interior embedding (The Axiom of Countable Choice (ACω), The Axiom of Choice).

[F1]

The parabolic operator uses P=−∂t+Lt and prescribed initial plus lateral data, excluding the final-time face (Shin's parabolic operator, data, and initial-lateral boundary).

[F2]

Bounded locally parabolic Hölder nondivergence coefficients with elliptic principal part, nonpositive potential and exterior balls have a unique continuous-up-to-boundary interior classical solution; its proof includes weak approximation, interior regularity, boundary barriers and comparison (Classical parabolic solvability by weak approximation and exterior-ball barriers).

[F3]

A bounded zero-data locally classical error with bounded locally Hölder residual and the compatible bounded divergence representation is the unique zero-initial energy solution, with the stated Lt2Hx1 estimate (Zero-data bounded classical parabolic errors are weak energy solutions).

Proof

1.1givenF1algebra

The supremum term of ∣⋅∣0,α gives boundedness of a,b~,c~,f. On every compact positive-time cylinder away from the spatial boundary, δ has a positive lower bound; hence its weighted seminorm gives an ordinary local parabolic Hölder bound there. Near a spatial interior point of the final face the same lower bound holds, since the final face is not part of the distance-defining boundary. Thus these coefficients and source have unique one-sided Hölder limits at T and the regularity required in [F2]. The Frobenius bound on a gives an upper eigenvalue bound in addition to uniform lower ellipticity. The two Hölder data sets define one continuous ψ on the compact ΓT by the compatibility hypothesis.

2.1A1F2step 1.1construct

Choose k≥max⁡{0,sup⁡Qc~}. Setting u=ektw transforms the equation into −wt+a:D2w+b~⋅Dw+(c~−k)w=e−ktf, with transformed datum e−ktψ. The potential is nonpositive and all other hypotheses of [F2] hold by step 1.1. Apply that supplier and multiply back by ekt to construct u∗ with the stated regularity and data. Applying its comparison uniqueness to differences after the same transformation gives uniqueness for the original equation. No assumption of closed-cylinder second derivatives is used.

3.1F1F2step 2.1givenalgebra

Assume now c~≤0, put e=h−u∗, R=∥f+ht−Lth∥∞, and E=∥h−ψ∥C(ΓT). The nonnegative barrier W=E+tR satisfies (∂t−Lt)W=R−c~(E+tR)≥R. The forward equation for e has source f+ht−Lth, of absolute value at most R. The comparison proved in [F2] applied to e−W and −e−W gives ∣e∣≤W, and therefore the displayed stability bound. Its application on closed cylinders ending at τ<T, followed by τ↑T, requires no unsupported derivative on the top face of the original open Q.

4.1step 3.1algebra

For any sequence with Em→0 and Rm→0, step 3.1 gives ∥hm−u∗∥∞≤Em+TRm→0. If these errors converge on a probability-one event, this same deterministic argument applies separately to every outcome in that event and proves almost-sure uniform convergence. It invokes no optimization property beyond the residual and boundary limits actually supplied.

5.1F3step 2.1step 4.1givenalgebra∎

Under the additional weak-expansion compatibility, if hm exactly satisfies the initial and lateral data, em=hm−u∗ has zero prescribed data and −em,t+Ltem=−(f+hm,t−Lthm)=:rm. Fix 0<τ<T. The residual is locally Hölder up to this stopped final face because τ is interior to the original time interval; all coefficient, continuity, zero-data and distributional compatibility hypotheses of [F3] hold on U×(0,τ). Apply [F3] there. Its energy proof gives a constant uniform for τ≤T: with B=∥b∥∞+∥c∥∞, D=∥d∥∞ and C0=B2/λ0+2D+1, one may use CE(T)=eC0T+λ0−1(C0TeC0T+1). Consequently sup⁡t≤τ∥em(t)∥22+∫0τ∥Dem(t)∥22dt≤CE(T)∥rm∥L2(U×(0,τ))2. Let τ↑T. The stopped energy solutions agree with the same classical em, so their weak spatial derivatives agree on overlaps. Monotone convergence gives em∈L2(0,T;H01(U)) and the full-interval gradient bound. The bounded divergence coefficients and the equation then give em,t∈L2(0,T;H−1(U)), with the zero initial trace inherited from any stopped interval. Since ∥rm∥L22≤T∣U∣∥rm∥∞2→0, the gradient norm tends to zero; step 4.1 also gives ∫0T∥em∥22dt≤T∣U∣∥em∥∞2→0. Thus the errors converge strongly to zero in L2(0,T;H1(U)). If u∗ also belongs to that space, adding em proves membership and strong convergence of hm there; zero prescribed data give this additional membership by [F3] applied to u∗ with source f on stopped cylinders and the same limiting argument. No residual limit or derivatives at the original final face are required.

Remarks

The order-zero weighted Hölder requirement makes the source word “Hölder” precise through its equation (2.7), including its supremum term. If instead the original statement intended merely local Hölder continuity with only the positive-order weighted bounds, this proof does not cover that larger class: the heat equation with source sin⁡(x)/t on (0,π) and zero initial data has no continuous zero-initial solution. Against a nonnegative compactly supported spatial test its equation would equate a time derivative of a bounded quantity plus a bounded quantity to a positive constant divided by t, contradicting integration near zero. The intended interpretation must be approved explicitly, not silently substituted.

The source assumes pointwise spatial differentiability. Distributional compatibility is needed only by the additional energy clause, not by classical existence or sup-norm stability. It is automatic for local spatial C1 coefficients, but must be stated if that word is interpreted more broadly. The source's printed double sum places biu inside the i,j sum and repeats it d times; this item uses the separately indexed divergence term matching its own displayed expanded coefficients.

The exact source trial-class convention weights Dijh by δ rather than δ2. It is retained as a source convention in the definition; neither existence nor this proof asserts that the solution has that stronger weighted norm. The stability conclusion applies to its classical trial members, and in fact to the larger classical class explicitly stated here.

The source barrier and divergence coefficient bounds are retained even where the existence construction does not need their full strength. The deterministic consistency clause is the PDE interface used by the separate regularized-PINN consumer; it is not a new sampling, global-minimizer, or optimizer theorem. The full Shin definitions, Assumption 3.4 and Appendix F were read. Its cited Friedman theorem was not represented as a local proof or as newly read full text.

TheoremStatement: AI-adaptedProof: AI-generatedOpen item page →

Neural-operator quadratures in the uniform norm and compatible Banach norms

Statement

Let a finite neural operator have bounded domains, continuous kernels and biases, continuous pointwise activations, and continuous pointwise lifting and projection networks. For every integral use finite measurable partitions whose cells have tags, volume weights, and maximal diameter tending to zero. Its compatible quadratures converge in the output supremum norm uniformly on every compact input set in C(Dˉ), and hence on compact subsets of any Banach input space continuously included in C(Dˉ). Intermediate values in these realizations are evaluated by their defining functions at all required tags and output queries; changing meshes does not change the continuum parameters.

More generally, the same conclusion holds in the output Banach norm for the following compatible-space architecture. At each stage choose a Banach function space Xt continuously included in C(Dˉt;Rqt). For an integral layer from Xt to an auxiliary Banach function space Yt of Rqt+1-valued functions on Dˉt+1, require a continuous inclusion Yt↪C(Dˉt+1;Rqt+1) and require that y↦κt(⋅,y) be continuous from Dˉt into the space of linear maps Rqt→Yt, in operator norm. Every local linear term is a bounded map Xt→Yt, its bias belongs to Yt, and its following activation is a continuous map Yt→Xt+1. Any separate lifting and projection maps are continuous between their specified Banach spaces. The same maps are used in the discrete and continuum constructions. No arbitrary output Banach norm follows from its continuous inclusion into the supremum norm alone.

The quadrature maps in these two assertions are the raw maps: their local paths may still evaluate the original continuous input at output queries. For the supremum-norm architecture, first reconstruct the input from the partition tags by the finite-sampling reconstruction bridge and apply the same raw quadrature maps to that reconstruction. This gives a genuine finite-sampling family with the same learned parameters, converging uniformly on every compact input set in the output supremum norm. In the general compatible-Banach architecture the identical finite-sampling conclusion follows whenever continuous finite-dimensional input reconstructions into its actual input space are supplied and converge compact-uniformly in that norm. The raw quadrature convergence in the full generality above remains valid without this extra reconstruction premise; it is not itself an assertion of finite-sample factorization of an unchanged local path. If the first integral layer is integral-only and all later stages use only its reconstructed field and fixed parameters, the raw maps already factor through the finite vector of tag samples of the lifted field. For a general continuous lifting P, the sampling map in this assertion is explicitly Sn(a)=(P(a)(ξn,j))j; it may be nonlocal in the original input. For a pointwise lifting, these values are computed from the original input tag samples. Factorization through those original samples for a general lifting requires that its lifted tag values themselves factor through them. With the stated sampling map, the full compatible-Banach convergence gives a finite-sampling family without an input reconstruction.

Facts & Assumptions

Given: A finite composition and compatible tagged, volume-weighted partitions as in the Statement; all compact input sets use their specified norm topology.

[F1]

The neural-operator layer and compatible quadrature conventions are Neural operator between function spaces and Riemann-sum realization of a neural operator.

[F2]

The scalar kernel quadrature estimate in the supremum norm is proved in Kernel Riemann sums converge uniformly on compact continuous-input sets. The direct modulus argument below also handles bounded measurable domains without an extra Jordan-boundary assumption.

[F3]

Continuous raw maps converging compact-uniformly remain convergent after continuous finite-dimensional input reconstructions converging compact-uniformly in the actual input norm. Such reconstructions always exist for continuous inputs in the supremum norm, with the specified tags and normalized nonnegative weights. An integral-only first input stage already factors through its finite samples without an input reconstruction (Finite sampling reconstruction bridges compact-uniform raw quadrature limits).

Proof

1.1givenF1constructalgebra

Write I(v)=∫Dκ(⋅,y)v(y) dy for one compatible Banach layer, and let C be a compact subset of its input space X. Its image in C(Dˉ) is compact: pulling an open cover back through the continuous inclusion and using compactness proves this directly. Thus R=sup⁡v∈C∥v∥∞<∞. This family has a common modulus of continuity tending to zero. Indeed a finite η-net in the supremum norm and uniform continuity of its finitely many functions give ∣v(y)−v(z)∣≤2η+max⁡j∣vj(y)−vj(z)∣ for every v∈C. Uniform continuity of the finitely many functions follows by the compact-domain subsequence contradiction. Let B=sup⁡y∥κ(⋅,y)∥L(Rq,Y) and let ωκ be its norm modulus. Compactness similarly proves B<∞ and ωκ(h)→0. Therefore the Y-valued integrands Φv(y)=κ(⋅,y)v(y) have common modulus bounded by Rωκ(h)+BωC(h).

2.1step 1.1constructalgebra

A continuous Y-valued function Φ on Dˉ has an integral in Y: volume-weighted step sums on partitions of diameter h form a Cauchy family, since comparing two sums on their common refinement bounds their difference by ∣D∣ωΦ(h+h′). Completeness of Y gives a limit, independent of tags and partitions. Each coordinate of point evaluation on Y is bounded by its specified continuous inclusion into C(Dˉ′;Rqt+1); explicitly, ∣uj(x)∣≤cY∥u∥Y. Applying these bounded functionals to the convergent sums therefore identifies the limit with the pointwise integral in every coordinate. Comparing a fixed tagged sum to refinements and taking the limit gives ∥Qn(v)−I(v)∥Y≤∣D∣[Rωκ(hn)+BωC(hn)] uniformly for v∈C. Also ∥Qn(v)−Qn(w)∥Y≤∣D∣B∥v−w∥∞≤∣D∣BcX∥v−w∥X, where cX is the embedding bound. These estimates use only measurable disjoint cells, their volumes summing to ∣D∣, and their diameter bound.

3.1step 2.1givenconstructalgebra

Suppose inductively that the discrete inputs vn(a) converge in X to the continuum inputs v(a) uniformly for a in the original compact set K. The continuum map is continuous by the bound for I from step 2.1 and continuity of all other maps, so C=v(K) is compact. Comparing preactivations at vn(a) and v(a), the quadrature Lipschitz bound and the bounded local-map norm give an upper bound (∣D∣BcX+∥W∥)∥vn(a)−v(a)∥X+∥Qn(v(a))−I(v(a))∥Y, which tends to zero uniformly in a. The continuum preactivations form a compact set P⊂Y. A continuous map T:Y→X′ takes perturbations tending uniformly to zero around P to uniformly vanishing output errors: for a prescribed ε, cover P by finitely many balls B(pi,ri) on each of which ∥T(z)−T(pi)∥<ε/2 for ∥z−pi∥<3ri, and use a positive perturbation bound smaller than min⁡iri. If p∈B(pi,ri) and ∥z−p∥<min⁡iri, both images are within ε/2 of T(pi). Apply this to the activation. The same argument treats continuous lifting or projection maps. Starting with the identical input and proceeding through the finitely many stages proves uniform convergence in the final Banach norm.

4.1step 1.1step 2.1step 3.1F1F2algebra

For the supremum-norm architecture take every relevant X and Y to be the continuous-function space with its supremum norm. Joint continuity of κ(x,y) on the compact product implies continuity of y↦κ(⋅,y) in that norm, by its uniform modulus on the product. Finite matrix local terms are bounded in that norm. For any fixed continuous scalar activation, its induced map on continuous functions is continuous in the supremum norm: near a function of norm R, all scalar arguments lie in [−R−1,R+1], where the activation is uniformly continuous. Pointwise finite networks are finite compositions of these continuous maps. Thus all conditions in steps 1.1–2.1 hold, proving the first clause and then its continuously embedded input-space version.

5.1givenF3step 3.1step 4.1constructalgebra∎

Each raw map is continuous between its specified spaces: finite quadrature sums use bounded point evaluations and bounded kernel maps, and all local, activation, lifting and projection maps are continuous by hypothesis. For continuous inputs, apply the explicit reconstructions in [F3]; steps 1.1–4.1 supply the raw compact-uniform convergence required there. The bridge gives finite-dimensional sampling and output reconstruction with the same continuum parameters and output supremum convergence. In the general Banach case use the supplied reconstructions converging in its actual input norm and apply the first clause of the same bridge; its compact-union argument preserves exactly the output norm proved in step 3.1. For an integral-only first layer after a general lifting P, define Sn(a)=(P(a)(ξn,j))j. For an arbitrary vector z in this finite-dimensional space, form the first field ∑jωn,jκ(⋅,ξn,j)zj+b and apply all subsequent stages to define Rn(z). Compatibility makes this a continuous output-valued map, and the raw map equals RnSn exactly. This is the construction of [F3], with the lifted field as input. A pointwise lift computes Sn from the original input samples; a nonlocal lift need not do so. The explicitly specified sampling map and identity finite map give the asserted discretization family in either case.

Remark

For example, kernels continuous in the output Cr norm and norm-continuous local and nonlinear maps give convergence in Cr. The preceding arbitrary Banach formulation is useful beyond such examples. The stronger original assertion is retained verbatim in the proposal's archived preimage and is explicitly refuted by the separate one-neuron C1 counterexample; neither an open-problem label nor an unqualified norm upgrade is warranted.

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Populated sampling cells control the uniform PINN residual

Statement

Let X⊂RD carry a probability measure μ, let s,c>0, and fix an integer m≥1. Put ℓ=(cm)−1/s. Suppose a specified finite measurable partition X1,…,XK of X has each cell contained in a cube of side ℓ and of mass at least cℓs. Let Y1,…,Ym be independent points of law μ, and put δ=Dℓ. With probability at least max⁡{0,1−mexp⁡(−m/8)} every cell contains at least m/2 samples, counted with multiplicity. On this event, simultaneously for all real functions v,g with finite α-Hölder seminorms on X, ∥v−g∥∞;X2≤6m(1m∑i=1m∣v(Yi)−g(Yi)∣2)+3δ2α([v]α;X2+[g]α;X2). No independence between the functions and the samples is required.

Facts & Assumptions

Given: The specified partition, iid samples, and functions in the Statement.

[F1]

A probability measure assigns total mass one; independence gives product probabilities for finite sample tuples (Probability measures and probability spaces, Independent random elements).

[F2]

The probability of a finite union of events is bounded by the sum of their probabilities (Finite and countable subadditivity of measures).

Proof

1.1givenF1algebra

Write pj=μ(Xj) and Nj=∑i=1m1{Yi∈Xj}. Since pj≥cℓs=m−1/2 and ∑jpj=1, we have K≤m. Independence gives Ee−Nj/2=(1−pj+pje−1/2)m≤exp⁡(−mpj(1−e−1/2)). For a nonnegative random variable Z, aP(Z>a)≤EZ, by integrating Z≥a1Z>a. Apply this with Z=e−Nj/2 and a=e−mpj/4 to get P(Nj<mpj/2)≤exp⁡(mpj/4−mpj(1−e−1/2))≤e−mpj/8. Here e1/2≥1+1/2+1/8=13/8>8/5 implies e−1/2<5/8, and 1−x≤e−x follows by differentiating e−x−1+x.

2.1step 1.1F2algebra

The event Nj<m/2 is contained in Nj<mpj/2. By step 1.1 and [F2], its union over cells has probability at most Ke−m/8≤me−m/8. This proves the probability assertion, with the trivial lower bound zero when necessary.

3.1step 2.1algebra∎

On the complementary event fix x∈Xj. Every sample Yi∈Xj is within δ of x. The three-term square inequality gives ∣v(x)−g(x)∣2≤3∣v(Yi)−g(Yi)∣2+3δ2α([v]α;X2+[g]α;X2). Average over the Nj≥m/2 samples in this cell. Its first term is at most (3/Nj)∑i=1m∣v(Yi)−g(Yi)∣2≤6m m−1∑i∣v(Yi)−g(Yi)∣2. Taking the supremum over x proves the inequality. This is a deterministic inequality on the occupancy event, so it holds for sample-dependent trial functions as well.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Regularized PINN minimizers have vanishing residuals under sample refinement

Statement

Let D≥2, 0<α≤1, and let the residual and boundary sets U,Γ⊂RD carry probability measures μr,μb. Put sr=D and sb=D−1. For i=r,b, fix ci,Ci,ℓ0,i,ρ0,i>0 and a specified family of finite measurable partitions of the corresponding set at every 0<ℓ≤ℓ0,i. Each cell is contained in an ambient cube of side ℓ and has mass at least ciℓsi. Assume μi(B‾ρ(x))≤Ciρsi for centers in that set and 0<ρ≤ρ0,i. These are small-scale conditions. The usual Lipschitz-domain and positive-density hypotheses may be retained, but the explicit partition and ball bounds are the properties used below.

Take nested iid sample sequences of respective laws μr,μb and counts mr,mb→∞. For sufficiently large counts put ℓi=(cimi)−1/si,δi=Dℓi,Ai=mi−α/si, Cm=3max⁡i=r,b{(Ci/ci)Dsi/2mi},λ^i,mR=3λiδi2α/Cm, where λr,λb>0 are fixed. The count threshold is explicitly mi≥max⁡{1,ci−2ℓ0,i−2si,ci−2Dsiρ0,i−2si}; thus both partition and ball bounds apply. Choose weights λi,mR≥λ^i,mR and ∥λmR∥∞=O(∥λ^mR∥∞), with the same constants throughout the formulas.

Let f,g have finite α-Hölder seminorms on their respective sets. Let Hm be trial classes for which L[h] and B[h] have finite such seminorms; in the PDE application retain Hm⊂Ck,α(U)∩C0,α(Uˉ). On these sets define the population and empirical PINN losses by the weighted-square integral and sample-mean formulas in the fill-distance lemma, and define the regularized objective explicitly by Jm(h)=λrmr∑j=1mr∣L[h](xjr)−f(xjr)∣2+λbmb∑j=1mb∣B[h](xjb)−g(xjb)∣2+λr,mR[L[h]]α;U2+λb,mR[B[h]]α;Γ2. Suppose there are witnesses um∗∈Hm with zero empirical PINN loss and [L[um∗]]α;U2+[B[um∗]]α;Γ2≤M<∞, uniformly in m. Every global minimizer hm of Jm satisfies the following, uniformly for every such minimizer on the same sampling events.

On the hit-cell event, with probability at least 1−q(mr)−q(mb) (clipped at zero), Loss⁡PINN(hm;λ)=O(Ar+Ab),q(n)=n(1−1/n)n. If the residual and boundary sample streams are independent, the lower bound improves to (1−q(mr))(1−q(mb)), exactly the Appendix B probability. If the chosen cr,cb≤1, this also implies the weaker later printed bound with 1−ci/mi in place of 1−1/mi. No normalization is implicit.

On the occupancy event, with probability at least 1−Q(mr)−Q(mb) (clipped at zero), ∥L[hm]−f∥∞;U2+∥B[hm]−g∥∞;Γ2=O(Ar+Ab),Q(n)=ne−n/8. For independent streams one may instead use max⁡{0,1−Q(mr)}max⁡{0,1−Q(mb)}. Almost surely the two uniform errors tend to zero along any count pairs tending to infinity. If mr=O(mbD/(D−1)), both displayed right sides are O(mr−α/D). No comparability of the regularization coordinates is required. Constants in these bounds depend on M, the fixed data, and the constant in the weight upper bound. If the witness bound is almost surely finite rather than deterministic, the eventual almost-sure assertions hold with that random finite constant. These are statements about global minimizers, not a training algorithm.

Facts & Assumptions

Given: The data, partitions, samples, exact thresholds, witnesses, and global minimizers in the Statement.

[F1]

The objective Jm is explicitly defined in the Statement. It extends the weighted-square and seminorm conventions of Physics-informed residual loss and Hölder regularization and Empirical Hölder-regularized PINN objective to the measurable-set setting of Fill-distance control of the population PINN loss; no Lipschitz boundary or differential interpretation is required for these functionals.

[F2]

A hit in every cell gives the fill radii δi and failure bounds q(mi) (Lower cell-mass bounds give a random fill-distance estimate).

[F3]

The deterministic population-loss bound uses Cm and penalties 3λiδi2α/Cm (Fill-distance control of the population PINN loss).

[F4]

The occupancy event and its deterministic uniform inequality have failure bound Q(mi) (Populated sampling cells control the uniform PINN residual).

[F5]

Summable failure probabilities imply only finitely many failures almost surely (The first Borel-Cantelli lemma for measures).

[F6]

The original all-positive-scale lower mass assumption is impossible, and the original count condition does not imply threshold comparability (The printed all-scale probability cell-mass bound is inconsistent, The PINN regularization thresholds need not be comparable under the stated count condition).

Proof

1.1givenF1algebra

Write Jm for the regularized objective at hm and ai=Dαci−2α/si, so δi2α=aiAi. Minimality against um∗ and [F1] give 0≤Jm≤M∥λmR∥∞≤Kmax⁡{Ar,Ab}/Cm, for a fixed K. In particular, the ith empirical mean squared error is at most Jm/λi and the squared operator seminorm is at most Jm/λi,mR. No max-to-min ratio is used.

2.1F2F3step 1.1algebra

On both hit-cell events, [F2] and [F3] give Loss⁡PINN(hm;λ)≤CmJm+3∑iλiaiAi[datai]α2=O(Ar+Ab) by step 1.1. The union bound gives the stated joint probability without an independence premise; independence of the streams gives the product. If 0<ci≤1, then 0≤1−1/mi≤1−ci/mi, which proves the stated normalized comparison of probabilities.

2.2F4step 1.1algebra

On the two occupancy events apply [F4] with (v,g)=(L[hm],f) and (B[hm],g) respectively. For each i, step 1.1 yields ∥errori∥∞2≤6miλiJm+3aiAiJmλi,mR+3aiAi[datai]α2≤(6miλi+Cmλi)Jm+3aiAi[datai]α2. Here λi,mR≥3λiaiAi/Cm gives the second inequality. Since Cm≥3(Ci/ci)Dsi/2mi for each component, step 1.1 makes the last expression O(Ar+Ab). This proves the uniform bound and its event probability. It remains valid for all sample-dependent minimizers because [F4] is simultaneous for every function.

3.1F5F6step 2.2algebra∎

For every integer n, Q(n)=ne−n/8. Grouping k2≤n<(k+1)2 bounds its sum by ∑k≥1(2k+1)(k+1)e−k/8<∞; convergence follows, for example, since the ratio of successive summands tends to e−1/8<1. Apply [F5] separately to the occupancy failure events at every integer sample count in each fixed nested stream. Almost surely, beyond two finite count thresholds every occupancy event holds, so step 2.2 applies along every count pair tending to infinity, including arbitrarily slowly growing or repeated count pairs. Thus both uniform errors tend to zero. Finally mr≤CmbD/(D−1) implies Ab≤Cα/DAr, proving the rate specialization. The conclusion has been proved using the corrected small-scale events and without the invalid all-scale premise or weight-comparability inference recorded in [F6].

Remarks

The original literal Assumption 3.1 quantifies its lower mass bound over every ε>0; [F6] refutes it. The corrected Statement explicitly restricts the range and does not claim the literal source hypotheses have instances. The original source uses the exact regularizers above and asserts uniform convergence, but Appendix C's bounded max-to-min inference is false by [F6]. The populated-cell proof above establishes that convergence with the same regularizers under the corrected nonvacuous sampling condition. Its occupancy probability is different from the Appendix B hit probability and is not attributed to the source. Appendix B's probability uses 1−1/m; the later printed 1−c/m requires the explicitly stated normalization for this comparison. The complete pre-repair carrier, including its exact original statement, is preserved in the proposal's immutable before snapshot.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Smooth elliptic Dirichlet solvability from a boundary Sobolev bootstrap

Statement

Assume the Axiom of Choice and Countable Choice. Let all coefficients and data be real. Let n≥2, and let V⊂Rn be nonempty and bounded with smooth boundary. Suppose A,β,c,F,G are smooth on a neighborhood of Vˉ, A=AT, λI≤A≤ΛI for constants 0<λ≤Λ, and c≤0. For L=A:D2+β⋅D+c, the Dirichlet problem Lu=F in V, u=G on ∂V has exactly one solution u∈C∞(Vˉ). Here smoothness on the closure means that all interior derivatives extend continuously to the closure, equivalently that a smooth extension exists to every finite differentiability order.

Facts & Assumptions

Given: The dimension, smooth bounded domain, coefficient bounds, sign, forcing and lifting in the Statement. AC and CC are used through the Fredholm, extension, embedding and difference quotient suppliers.

[F1]

Weak Fredholm theory for the negative-principal divergence operator gives existence for every L2 forcing once its zero-boundary weak kernel is trivial (The Fredholm alternative for weak elliptic Dirichlet problems, Uniformly elliptic divergence-form operators and their sesquilinear forms).

[F2]

A zero-trace weak solution with Lipschitz principal coefficients and L2 forcing lies in global H2 on a bounded C2 domain; its proof uses tangential flat-face H2 estimates and recovery of the normal second derivative by division by ann (Global H2 Dirichlet regularity, Tangential H2 estimate near a flat Dirichlet boundary, The normal second derivative is recovered from the equation).

[F3]

Smooth-coefficient weak solutions have the higher integer Sobolev regularity locally in the interior (Interior Hk+2 elliptic regularity).

[F4]

Smooth bounded domains admit integer Sobolev extensions; sufficiently high Sobolev order gives continuous classical derivatives to any prescribed finite order. On these domains the zero trace agrees with zero classical boundary values (Bounded C^k domains admit integer-order Sobolev extension, Higher-order Sobolev embedding, The trace agrees with classical restriction for continuous Sobolev functions, The kernel of the trace is the closure of the test functions).

[F5]

For a positive-principal uniformly elliptic operator with nonpositive potential, the residual estimate implies that a zero-boundary classical homogeneous solution is zero (Elliptic residual and boundary stability from a maximum principle).

[F6]

H01 is the closed H1 closure of compactly supported smooth functions (Zero-boundary Sobolev space as a norm closure). Localized boundary flattening preserves this closure (Weak divergence-form equations are invariant under C2 boundary charts). Fixed tangential translations, difference quotients and smooth cutoff multiplications preserve H01(H) by approximation, since they are bounded on H1(H) and preserve Cc∞(H) (The difference-quotient test function and its commutators). Tangential quotients converge strongly in L2(H) to the corresponding derivative for H1(H) functions (The difference-quotient characterisation of W1,p for 1<p<∞). The choices allowed here are AC and CC (The Axiom of Choice, The Axiom of Countable Choice (ACω)).

Proof

1.1givenF1F2F3F4F5F6

First establish the regularity fact needed to test the homogeneous kernel: a zero-trace weak solution with smooth coefficients and smooth forcing on a smooth bounded domain lies in Hk(V) for every integer k. Write the negative operator as P=−L=−∂i(Aij∂j)+(∂iAij−βj)∂j−c. Its principal coefficients are Lipschitz and uniformly elliptic, and its lower coefficients are bounded. Global H2 regularity gives the base u∈H2(V).

1.2givenF1F2F3F4F5F6

Here is the full higher-order induction, rather than an appeal to boundary smoothness. Assume u∈Hm+1(V) for some m≥1. On an interior patch, the local higher-order Sobolev theorem gives Hm+2 on a smaller patch. On a boundary patch, use a smooth graph chart and nested smooth cutoffs as in the actual global H2 proof. In the flattened coordinates the cutoff solution v has compact lateral support in H‾, belongs to Hm+1(H)∩H01(H), and satisfies Pv=−aijDiDjv+BiDiv+Cv=F0. The transformed coefficients are smooth with ann≥λ′>0, and F0∈Hm on the patch after localization; the cutoff commutators have order at most one and thus belong to Hm by the induction hypothesis. A further cutoff identically one on the desired smaller patch avoids all artificial lateral boundaries.

1.3givenF1F2F3F4F5F6

For every tangential multi-index γ of order m, put w=Dtanγv. It belongs to H01(H) directly from the closure definition. Indeed every iterated tangential difference quotient of v lies in H01(H) by [F6]. For v∈Hm+1(H) these quotients converge to w in H1: weak derivatives commute with the quotients, and repeated application of their strong L2 convergence and the bound ∥δhjz∥2≤∥Djz∥2 proves convergence for v and each first derivative. Closedness of H01(H) gives the assertion without any half-space trace-kernel theorem. Apply the product rule in distributions to obtain Pw=DtanγF0+∑0<η≤γ(γη)(Dtanηaij)DiDjDtanγ−ηv−∑0<η≤γ(γη)(DtanηBi)DiDtanγ−ηv−∑0<η≤γ(γη)(DtanηC)Dtanγ−ηv. Every term is L2: the largest derivative of v in a commutator has order m+1, since ∣η∣≥1. Multiplying w by the further cutoff adds only L2 commutators, since w∈H1. Convert P back to divergence form and apply precisely the flat-boundary tangential H2 lemma plus normal recovery (and the interior H2 input) used in the global H2 proof. This gives w∈H2 on the smaller half-patch. Therefore all derivatives of v of total order m+2 with at most two normal differentiations are L2 there.

1.4givenF1F2F3F4F5F6

Recover the remaining order-m+2 derivatives by induction on their number q≥3 of normal differentiations. In distributions differentiate the equation by Dnq−2Dtanγ, where ∣γ∣=m+2−q, and isolate the term −annDnqDtanγv. When all m derivatives fall on v, every other principal term has at most q−1 normal differentiations and is already L2 by this normal-count induction. If any derivative falls on a coefficient, the derivative of v has order at most m+1, hence is L2 by the original Sobolev induction. Differentiated lower-order terms also have order at most m+1, and the differentiated F0 is L2. The reciprocal 1/ann is smooth and bounded on the patch. Division proves that the missing distributional derivative is represented by an L2 function. There is no circular assumption of its boundary integrability: the distribution identity itself supplies the derivative, exactly as in the normal-recovery lemma. This proves Hm+2 on every smaller boundary patch. A finite cover proves u∈Hm+2(V), completing the induction.

1.5givenF1F2F3F4F5F6

For any fixed r, choose k with k−n/2>r+1/2. Smooth-domain extension and the higher-order Sobolev embedding give a Cr(Vˉ) representative. Representatives at different r coincide, since continuous representatives equal almost everywhere must agree everywhere. Thus u∈C∞(Vˉ). Its zero trace equals its zero classical boundary value.

2.1givenF1F2F3F4F5F6∎

Now apply the weak Fredholm theorem to P on H01(V). Every element of the homogeneous kernel has the just-proved smoothness up to the boundary. The residual estimate for L with c≤0 makes that kernel zero, since both its forcing norm and boundary norm vanish. The first Fredholm alternative therefore gives a unique weak solution for every smooth forcing. For the specified boundary value, apply it to v=u−G with forcing −F−PG∈C∞(Vˉ). The regularity argument makes v smooth to the boundary, and u=v+G solves the required problem. Uniqueness follows from the same residual estimate. This proves the lemma without a boundary Schauder theorem or continuity-method premise.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Uniform boundary Schauder bounds and smooth interior domain approximants

Statement

Assume the Axiom of Choice and Countable Choice. Fix n≥2 and 0<α<1. Consider a family of bounded smooth domains V in a fixed bounded set with a common finite boundary graph atlas: the graph radii, inverse-chart radii and bounds for all chart and inverse-chart derivatives through order two and the α-Hölder seminorms of their second derivatives are uniformly controlled. Let L=A:D2+β⋅D+c have real smooth coefficients near Vˉ, with A=AT, λI≤A≤ΛI for fixed 0<λ≤Λ, and uniformly bounded global C0,α(Vˉ) coefficient norms. There is a uniform C<∞ such that every real u∈C∞(Vˉ) with zero boundary values satisfies ∥u∥C2,α(Vˉ)≤C(∥u∥∞;V+∥Lu∥C0,α(Vˉ)). The constant depends only on the stated uniform geometric and coefficient controls, dimension and exponent, and not on higher smoothness norms. No sign of c is required for this a priori estimate.

Furthermore every nonempty bounded C2,α domain U⊂Rn has smooth bounded open subsets Vj with Vˉj⊂U, every compact subset of U eventually contained in Vj, and a common finite graph atlas with the uniform controls just described. Nestedness is not asserted or required.

Facts & Assumptions

Given: AC, CC, dimension, exponent, the uniform graph atlas, smooth real coefficients, ellipticity and Hölder coefficient bounds, and a smooth zero-boundary solution as in the Statement. For the second assertion, the bounded C2,α domain U is given. The proof never applies its a priori inequality to a function whose closure regularity has not already been established.

[F1]

Compactly supported Hölder data have a classical Newtonian potential with controlled local C2,α norm, including in dimension two with the logarithmic kernel (Hölder data give a classical Newtonian solution).

[F2]

For n≥3, continuous data on a Euclidean sphere have a unique harmonic ball extension. Smooth sphere data have such an extension for all n≥2, and the proof below supplies the dimension-two continuous-data extension by uniform approximation. Harmonic interior derivative estimates control every derivative on a smaller ball by the supremum on a larger ball; the weak maximum principle gives uniqueness on a bounded half-ball (Continuous Dirichlet problem on a ball, Smooth sphere data have a harmonic replacement under Countable Choice, Interior derivative estimates for harmonic functions, Weak maximum principle for the laplacian).

[F3]

Mollification is smooth and differentiates under the integral; smooth cutoffs and locally finite smooth partitions subordinate to Euclidean open covers exist (Convolution with a mollifier is smooth, and derivatives pass under the integral sign, Test function cutoffs and euclidean localization).

[F4]

Polar integration, differentiation under an integrable majorant and dominated convergence are available (Polar coordinates decompose Lebesgue measure into r^{n-1} dr d sigma, Differentiation under the integral sign, Dominated convergence).

[F6]

A positive definite symmetric matrix has an orthogonal spectral decomposition, hence a positive square root with the corresponding eigenvalue bounds; finite orthonormal completion is available (Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis, Gram–Schmidt turns every finite independent list into an orthonormal list with the same successive spans).

[F7]

The bounded global and scaled Hölder norms and their closure convention are as stated locally (Hölder spaces Ck,α, closure and interior scaled norms, and Ck,α domains). AC and CC are permitted and inherited through the analytic integration and potential suppliers (The Axiom of Choice, The Axiom of Countable Choice (ACω)).

Proof

1.1givenF4F5F7

Let k=n−1≥1, 0<α<1, and Pt(z)=ckt(∣z∣2+t2)(k+1)/2,Qj,t(z)=ckzj(∣z∣2+t2)(k+1)/2, where ck is the reciprocal of ∫Rk(1+∣z∣2)−(k+1)/2dz. This integral is finite by polar integration: its radial behavior is rk−1 at zero and r−2 at infinity. Thus Pt is nonnegative, has mass one by scaling, and its usual differentiation verifies harmonicity in (z,t). The formulas apply also when n=2, k=1; no n≥3 half-space theorem is assumed.

1.2givenF4F5F7

We first prove the elementary singular-kernel estimate required below. If a∈Cc0,α(Rk) has support in a fixed ball, then on every fixed bounded cylinder ∣x∣≤R, 0≤t≤R the functions Tj,ta(x)=∫RkQj,t(z)a(x−z)dz(t>0) extend continuously to t=0 and satisfy ∥Tja∥C0,α(CR‾)≤C∥a∥C0,α(Rk). Here the boundary integral is the absolutely convergent cancellation expression Tj,0a(x)=∫∣z∣<1Qj,0(z)(a(x−z)−a(x))dz+∫∣z∣≥1Qj,0(z)a(x−z)dz. Indeed the kernels are odd in z, their integrals over every centered annulus vanish, and uniformly in t≥0, ∣Qj,t(z)∣≤C∣z∣−k,∣DzQj,t(z)∣+∣∂tQj,t(z)∣≤C∣z∣−k−1(z≠0). The near part of the displayed cancellation integral is bounded by C[a]α∫01rα−1dr. For bounded x, the far integral lies in a fixed annulus and is bounded by CR∥a∥∞; this proves the supremum bound uniformly in t.

1.3givenF4F5F7

Here are the complete difference estimates. For a vertical change ∣t−s∣=δ<1/8, subtract a(x) under the integral on ∣z∣<1 using oddness. The part ∣z∣<2δ is bounded by C[a]αδα. On 2δ<∣z∣<1, the mean value estimate for ∂tQ bounds the difference by C[a]αδ∫2δ1rα−2dr≤Cα[a]αδα. The far part costs CR∥a∥∞δ, hence also CR∥a∥∞δα. The same argument with s=0 proves convergence to the boundary expression.

1.4givenF4F5F7

For a horizontal change ∣x−y∣=δ<1/8 at fixed height, write both operators in the physical integration variable ζ, subtract respectively a(x) and a(y) in unit balls centered at their poles, and split at the union of the two radius-2δ balls. The near pieces cost C[a]αδα, since each pole is at most 3δ from the other near ball. On the common far region inside the unit balls, use ∣Qt(x−ζ)−Qt(y−ζ)∣≤Cδ∣x−ζ∣−k−1 and ∣a(ζ)−a(x)∣≤[a]α∣x−ζ∣α. Its integral is the same C[a]αδ∫2δ2rα−2dr as above. The remaining constant-difference term is a(x)−a(y) times an integral of Qt over the far integration region. That integral is uniformly bounded: compare its domain to a centered annulus, whose integral is zero. At the inner boundary the symmetric difference is contained in a shell of radius at most 4δ and outside radius δ, of volume Cδk and kernel bound Cδ−k; its integral is O(1). At the outer boundary the symmetric difference has volume Cδ and bounded kernel, also O(1). These bounds use only the stated kernel estimates, uniformly in t. Multiplying by ∣a(x)−a(y)∣≤[a]αδα gives the required bound. Outside the unit neighborhoods the kernels and their first derivatives are bounded on the fixed support region, so that part is Lipschitz with constant CR∥a∥∞; the moving unit-boundary shells have the same bound after the cancellation constants are included. This proves horizontal α-Hölder control. Larger increments are covered by the supremum bound. Combining a horizontal and a vertical change proves the asserted joint Hölder estimate.

1.5givenF4F5F7

The Poisson operator itself maps bounded Cα data to Cα on the closed half-space, locally with controlled norm. Horizontal differences follow by translation and its mass one. For vertical differences, differentiating the explicit kernel and scaling gives ∫∣∂tPt(z)∣ ∣z∣αdz≤Cαtα−1,∫∂tPt=0. The moment is finite since α<1. Thus ∣∂t(Pt∗a)∣≤C[a]αtα−1; integration from s to t gives C[a]α∣t−s∣α. The same moment estimate for Pt proves its convergence to a at t=0 with error C[a]αtα.

1.6givenF4F5F7

Now let ϕ∈Cc2,α(Rk). Set H(x,t)=Pt∗ϕ(x). Differentiation under the integral for t>0, followed by tangential integration by parts, gives DaH=Pt∗Daϕ and DabH=Pt∗Dabϕ. The explicit identities ∂tPt=−∑j=1k∂jQj,t,Δx,tPt=0 give DtDaH=−∑jQj,t∗Djaϕ,DttH=−∑aPt∗Daaϕ. The same identity without Da bounds DtH by the Tj estimates applied to Djϕ. Each datum on the right is compactly supported Cα. The just-proved P and T bounds show that H, its gradient and Hessian extend to the boundary, with Hessian α-Hölder there and ∥H∥C2,α(CR‾)≤C∥ϕ∥C2,α(Rk). Classical derivatives up to the boundary mean the continuous interior derivative extensions; their compatibility follows from the fundamental theorem of calculus along interior coordinate segments and then passage to the boundary. No Riesz-transform boundedness theorem or unproved mixed-derivative claim has been cited.

1.7givenF1F2F3F5F6

Write Br+=Br∩{xn>0} and its flat face Br′=Br∩{xn=0}. If u∈C2(B1+)∩C(B1+‾), Δu=f∈C0,α(B1+‾), and u=0 on B1′, then ∥u∥C2,α(B1/4+‾)≤C(∥u∥∞;B1++∥f∥C0,α(B1+‾)). To prove this, extend f evenly across the flat face on B1, and multiply by a smooth cutoff supported in B1 and equal to one on B3/4. The even extension is Hölder: if the two points are on opposite sides, the distance between their reflected upper-half-space points is no greater than their original distance. Thus the resulting F∈Ccα(Rn) has controlled norm. The actual local theorem thm-newtonian-potential-for-holder-data-is-classical gives v=−NF, with Δv=f on B3/4+ and ∥v∥C2,α(Bˉ3/4)≤C∥f∥Cα. This theorem covers n=2 with its logarithmic kernel, and no boundedness of v at infinity is required.

1.8givenF1F2F3F5F6

The continuous ball-Dirichlet supplier currently has dimension restriction n≥3. For n=2 the needed continuous-data disk solution follows from the actual n≥2 supplier lem-smooth-sphere-data-have-a-harmonic-replacement as follows. Parametrize the boundary circle by angle and extend its continuous datum to a continuous 2π-periodic function a(θ). Convolve in the angle with a nonnegative smooth periodic unit-mass kernel supported, modulo 2π, in ∣θ∣<ϵ. The result aϵ is smooth and periodic, and ∥aϵ−a∥∞≤sup⁡∣h∣≤ϵ,θ∣a(θ−h)−a(θ)∣→0 by uniform continuity on the circle. The smooth-sphere supplier gives harmonic Hϵ continuous on the closed disk with these data. The weak maximum principle gives ∥Hϵ−Hη∥∞;Bˉ≤∥aϵ−aη∥∞, so Hϵ converges uniformly on the closed disk to a continuous function with the prescribed boundary datum. Interior derivative estimates applied to the differences show that all derivatives converge uniformly on smaller disks; the fundamental theorem of calculus identifies them as the derivatives of the uniform limit, which is therefore harmonic. Uniqueness follows from the weak maximum principle. This supplies continuous ball data in dimension two without extending a dimension-restricted theorem silently.

1.9givenF1F2F3F5F6

Choose a tangential cutoff equal to one on B2/3′ and supported in B3/4′, and put ϕ equal to that cutoff times v∣xn=0, extended by zero to Rn−1. the Poisson-extension calculation above gives a harmonic H=Pϕ with controlled C2,α norm on B2/3+‾. The remainder w=u−v+H is harmonic in B2/3+, continuous on its closure and zero on its flat face. Its odd extension is harmonic in B1/2. Here is a proof requiring no boundary derivatives of u: on each ball centered on the flat face and compactly contained in B2/3, solve the ordinary ball Dirichlet problem for the continuous odd boundary data obtained from w; uniqueness on the ball makes its solution odd, and uniqueness by the weak maximum principle on the upper half-ball identifies it with w. Thus the odd extension is harmonic near every plane point, as well as off the plane.

1.10givenF1F2F3F5F6

The actual harmonic interior derivative estimates on B1/2 bound its derivatives through order three on B1/4 by C∥w∥∞;B1/2+. A third derivative bound gives the required second derivative α-Hölder bound on that ball, since α<1. Combining this with the v,H bounds proves the half-ball estimate, and at the same time proves its boundary regularity upgrade noncircularly for the Laplacian.

1.11givenF1F2F3F5F6

Rescaling gives the corresponding estimate between Br+ and Br/4+ in scaled norms. It holds for every constant symmetric positive definite principal matrix A0 with λI≤A0≤ΛI, with constants depending only on n,α,λ,Λ and a fixed target-radius fraction. To see that the linear normalization preserves the boundary plane, take S=A01/2, choose an orthogonal matrix O whose last column is Sen/∣Sen∣, and set T=SO. Then TTT=A0 and (Ty)n=∣Sen∣yn. Therefore A0:Dx2 becomes Δy under x=Ty, and upper half-spaces map onto upper half-spaces. The singular values of T lie in [λ,Λ], so contained/containing half-balls have fixed comparable radii. Restricting the estimate to the contained smaller half-ball gives the assertion.

1.12givenF5F7

This section is intentionally an a priori statement: let V have smooth boundary but a uniformly controlled finite C2,α graph atlas, let A,β,c be smooth near Vˉ with uniform Cα bounds and ellipticity, and let u be smooth to the boundary, zero on the boundary, with Lu=F. Then ∥u∥C2,α(Vˉ)≤C(∥u∥∞+∥F∥Cα(Vˉ)), where C depends on the uniform atlas, the coefficient Hölder bounds, ellipticity, dimension and exponent, but not on higher smoothness norms.

1.13givenF5F7

A smooth graph flattening x=Ψ(y) transforms the equation to A~:Dy2w+β~⋅Dyw+c~w=F~ with w=u∘Ψ and zero flat trace. The chain rule expresses A~=DΨ−1A(DΨ−1)T and the drift as the transformed original drift plus A:Dx2Ψ−1. The uniform C2,α chart bounds give uniform ellipticity and Cα bounds for every transformed coefficient. Thus no derivative of the original coefficients beyond the stated Hölder bound enters this estimate.

1.14givenF5F7

Fix a small common chart radius r. On each boundary patch freeze A~ at its flat-face center and apply the constant-coefficient half-ball estimate on an ambient half-ball of radius comparable to r; on interior balls use the corresponding constant-coefficient full-ball estimate, which follows directly from the local Newtonian potential and harmonic remainder argument. For the frozen forcing use A~0:D2w=F~+(A~0−A~):D2w−β~⋅Dw−c~w. There is no regularity issue in this application, since w is already smooth on the closed half-patch.

1.15givenF5F7

Use the common scaled global norm Nr(u)=∥u∥∞+r∥Du∥∞+r2∥D2u∥∞+r2+α[D2u]α. The product inequality [pq]α≤∥p∥∞[q]α+[p]α∥q∥∞, the freezing bounds ∥A~−A~0∥∞≤Krα, [A~]α≤K, and the convex-half-ball estimate [Dw]α≤Cr1−α∥D2w∥∞ show that the scaled frozen error is at most C(Krα+r∥β~∥∞+r1+α[β~]α+r2∥c~∥∞+r2+α[c~]α) Nr(u)=:η(r)Nr(u). Chart norm comparison changes C only by uniform atlas constants; the terms from second chart derivatives times Du carry a factor r and are controlled in the same way. In particular η(r)→0 uniformly over the stated family.

1.16givenF5F7

For precision, gluing the patch estimates costs a fixed constant independent of the number of patches. Take a finite cover by their smaller inner patches and interior balls, with a Lebesgue number at least c0r, using the common graph radii and a lattice of balls of radius a fixed multiple of r; the constant c0>0 depends only on the uniform atlas distortion. Supremum derivative norms are bounded by the maximum of the corresponding local norms, with the uniform chart comparisons. If ∣x−y∣<c0r, the pair lies in one inner patch and its Hessian quotient is controlled there. If ∣x−y∣≥c0r, its contribution to r2+α[D2u]α is at most 2c0−αr2∥D2u∥∞. Thus Nr(u)≤C0(∥u∥∞+r2∥F∥∞+r2+α[F]α)+C1η(r)Nr(u). The constants C0,C1 are uniform; no sum over all covering balls occurs. Choose the common radius so C1η(r)≤1/2 and absorb the final term. Since r is now fixed in terms of the permitted data, the unscaled asserted global estimate follows. This argument proves the estimate only for the smooth functions to which it was applied; a consuming existence proof obtains the original solution's regularity by passing this estimate to a limit.

1.17givenF3F5F7

A bounded C2,α domain U has a global C2,α defining function ρ on Rn, equal to 1 outside a large ball and to −1 away from a collar inside U, with U={ρ<0} and ∣Dρ∣≥c>0 near ∂U. Here is a construction. On a finite boundary atlas use the signed graph functions ρℓ=xn−hℓ(x′), after rigid motions, each negative inside. Choose a smooth partition of unity on a collar subordinate to those chart neighborhoods and put ρ0=∑χℓρℓ. On the boundary, the gradients of the signed graph functions are positive scalar multiples of the same outward unit normal; the terms Dχℓρℓ vanish there. Therefore Dρ0≠0 on the boundary, with a uniform lower bound by compactness. Every active signed graph function has the same sign on each side, so ρ0 has exactly the correct sign in a sufficiently small collar. Multiply by a smooth collar cutoff equal to one in a smaller collar, and outside use the sign function −1 on U, +1 outside. The latter is multiplied by a function identically zero near the boundary, so this gluing is C2,α globally and introduces no new zeros. Shrinking the collar preserves the gradient lower bound. All derivatives and their Hölder bounds are finite because only finitely many compactly supported chart pieces occur.

1.18givenF3F5F7

Let ρj=ρ∗ρsj for sj↓0, and put aj=max⁡{j−1,∥ρj−ρ∥C1}. Mollification gives aj→0, uniform C2,α bounds on ρj and C2 convergence to ρ; the latter follows from uniform continuity of D2ρ. Define Vj={ρj<−2aj}. For large j, its boundary lies in the fixed collar, where ∣Dρj∣≥c/2. Hence Vj has smooth boundary, Vˉj⊂U, and every compact subset of U eventually lies inside Vj. It is bounded since ρj=1 outside a fixed large ball. No regular-value selection is needed for this particular smooth-boundary approximation.

1.19givenF3F5F7

These domains have a common finite atlas with uniformly bounded C2,α graph norms. Indeed, after shrinking the original charts, choose in each a coordinate with ∣∂nρ∣≥c1>0. Uniform C1 convergence gives ∣∂nρj∣≥c1/2, so the level equations ρj(x′,hj(x′))=−2aj have graphs on fixed smaller chart cylinders, by monotonicity in the normal coordinate and the intermediate value theorem. Their derivative formulas are Dahj=−ρj,aρj,n, Dabhj=−ρj,ab+ρj,anDbhj+ρj,bnDahj+ρj,nnDahjDbhjρj,n. The denominator stays bounded away from zero, the second derivatives of ρj have uniform Hölder bounds, and the first derivative formulas give uniform Lipschitz bounds for the graphs and their first derivatives. Product, quotient and composition Hölder estimates then give the uniform C2,α bounds. Compactness and convergence place all of ∂Vj in these fixed smaller cylinders. This proves every geometric property needed by the freezing and gluing argument, rather than invoking an unproved smooth-domain-approximation theorem.

2.1givenF1F2F3F4F5F6F7∎

The freezing and gluing argument proves the uniform a priori estimate for precisely the smooth solutions specified in the Statement, and the defining-function construction supplies the required smooth interior approximating domains with the uniform atlas controls needed by that estimate. The half-ball estimate and the Poisson mixed derivative bounds were derived by the kernel calculation and reflection above; they were not assumed as external analytic results. Both conclusions follow.

Remarks

This item supplies a uniform a priori estimate for already smooth Dirichlet approximants. A separate existence proof may apply it to smooth weak-Fredholm/Sobolev solutions and pass the resulting bounds to a local classical limit. This gives a noncircular global regularity upgrade without the published boundary Schauder item's externally quoted half-ball input.

The bibliographic entries identify the established mathematical framework. No new external full-text reading credit is claimed for this repair. The local proof explicitly covers the half-space kernel in dimension two instead of invoking a half-space supplier whose current Statement begins at dimension three.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Exterior-sphere elliptic Dirichlet existence, energy and residual stability

Statement

Assume the Axiom of Choice and Countable Choice. Let all coefficients and data be real. Let n≥1, 0<α<1, and let U⊂Rn be nonempty, bounded and Lipschitz, with an exterior ball at every boundary point. Suppose aij=aji,bi∈C1,α(U) and ci,d∈C0,α(U), with finite global norms, and λ0I≤A=(aij)≤Λ0I for constants 0<λ0≤Λ0. Define L[u]=∑i,jDi(aijDju)+∑iDi(biu)+∑iciDiu+du, βj=∑iDiaij+bj+cj,γ=∑iDibi+d, and assume γ≤0. Retain, when required by the source application, the bounds ∑i,j∣aij∣2≤Λ and λ0−2(∣b∣2+∣c∣2)+λ0−1∣d∣≤v2.

For every f∈C0,α(U) and g∈C(∂U) there is exactly one solution u∈Cloc2,α(U)∩C(Uˉ),Lu=f,u∣∂U=g. There is a finite constant CL, depending on U, ellipticity and the sup bounds of the expanded coefficients A,β,γ, such that every h∈C2(U)∩C(Uˉ) with bounded residual satisfies ∥u−h∥∞;U≤CL(∥f−Lh∥∞;U+∥g−h∥∞;∂U). If g=0, then u∈H01(U) and ∥u∥H1(U)≤CE∥f∥∞;U, where CE may additionally depend on ∥DA∥∞. If g is the restriction of an ambient C2,α lifting G near Uˉ, then u−G∈H01(U). If in addition U is C2,α and g has such a lifting G, the solution lies in C2,α(Uˉ) and satisfies ∥u∥2,α;Uˉ≤C(∥f∥0,α;U+∥G∥2,α;Uˉ). The global branch follows by uniform estimates on smooth interior approximants and passage to the classical limit.

Facts & Assumptions

Given: The domain, coefficients, sign and finite norms, forcing and boundary datum in the Statement. Assume AC and CC; their uses are inherited by smooth weak solvability, Sobolev extension, measure theory and sequential compactness.

[F1]

Smooth-domain, smooth-coefficient Dirichlet approximants exist by weak Fredholm theory and the locally proved boundary Sobolev bootstrap (Smooth elliptic Dirichlet solvability from a boundary Sobolev bootstrap).

[F2]

The residual estimate holds with the positive principal convention and nonpositive expanded potential (Elliptic residual and boundary stability from a maximum principle, Shin's positive divergence-form operator).

[F3]

Interior Schauder estimates give uniform local C2,α bounds from uniform coefficient Hölder bounds, the forcing norm and the solution supremum (Interior Schauder estimate for uniformly elliptic equations, Hölder spaces Ck,α, closure and interior scaled norms, and Ck,α domains).

[F4]

Mollification is smooth, commutes with the derivatives in use and preserves sup and Hölder bounds by integration; regular levels of smooth functions have smooth boundaries (Convolution with a mollifier is smooth, and derivatives pass under the integral sign, Morse-Sard for Euclidean maps).

[F6]

Pointwise bounded equicontinuous families on compact metric spaces have convergent subsequences; apply this to the function, gradient and Hessian jointly (Real and finite-dimensional Euclidean Ascoli–Arzelà criteria).

[F7]

Zero-trace spaces are closures of compactly supported smooth classes; extension by zero from H01(V) to H01(U) is therefore valid for V⊂U. On smooth domains the zero trace and classical zero boundary restriction agree (Zero-boundary Sobolev space as a norm closure, The kernel of the trace is the closure of the test functions, The trace agrees with classical restriction for continuous Sobolev functions). Cauchy–Schwarz and Young inequalities control the energy products (Holder's inequality for integrals, including the endpoint cases, Young's inequality for conjugate real exponents).

[F8]

Already smooth zero-boundary Dirichlet solutions on smooth domains with a common uniformly controlled C2,α graph atlas obey a uniform global a priori Schauder bound from the supremum and forcing norm. Every bounded C2,α domain has relatively compact smooth approximating open sets with exactly those uniform atlas bounds, eventually containing every interior compact set (Uniform boundary Schauder bounds and smooth interior domain approximants). This estimate is used only on smooth approximants, not on the original solution before boundary regularity has been established.

[F9]

The permitted choices are AC and CC (The Axiom of Choice, The Axiom of Countable Choice (ACω)). The zero-boundary Sobolev space is Hilbert, Gram–Schmidt applies to every finite initial list after dependent vectors are discarded, and finite Bessel bounds control the coefficient sums (The Sobolev space H1 is a Hilbert space, Gram–Schmidt turns every finite independent list into an orthonormal list with the same successive spans, Bessel's inequality for a finite orthonormal list and Parseval's identity for an orthonormal basis). Every bounded linear functional on a Hilbert space is an inner product against a vector (Riesz representation for Hilbert spaces). The proof below gives the weak subsequence argument directly in the separable closed span.

Proof

1.1givenF2algebra

Expand the intended divergence expression by the product rule to obtain L=A:D2+β⋅D+γ. On a bounded Lipschitz domain, two sufficiently close points in a fixed smaller graph patch can be joined inside a larger patch by a path of length at most a fixed multiple of their distance; bounded first derivatives therefore give a Lipschitz bound for a,b there. A finite cover and the supremum bound for separated pairs give their global Hölder bounds. Thus the finite global coefficient assumptions give finite Hölder bounds for the expanded coefficients, γ≤0, and a finite bound for DA. Throughout the proof write c=γ, and use λ=λ0, Λ=Λ0.

1.2givenF2F4F7algebra

If n=1, the bounded Lipschitz set is a finite union of open intervals: its compact boundary has a finite one-sided graph-chart cover, and in dimension one each such chart contains one boundary point. On each interval (a,b) all coefficients and f extend Hölder-continuously to [a,b] and A≥λ. Write y=(u,u′), so y′=M(x)y+F(x), where M=(01−c/A−β/A) and F=(0,f/A). For Th(x)=∫axM(t)h(t) dt, iterated integration gives ∥Tkh∥∞≤∥h∥∞(∥M∥∞(b−a))k/k!. Therefore the uniformly convergent series y=∑k≥0Tk(y(a)+∫a⋅F) solves the integral equation, hence the differential system; the factorial bound also proves uniqueness by iterating the homogeneous difference equation. Choose one particular solution with the prescribed left value and slope zero, and add s times the homogeneous solution with initial value zero and slope one. That homogeneous solution cannot also vanish at b: otherwise [F2] would make it identically zero, contradicting its slope at a. Thus exactly one s gives the prescribed right value. The equation makes u′′ globally Hölder, so u∈C2,α([a,b]). Zero endpoint values imply u∈H01(a,b) directly: multiply by a cutoff vanishing within ε of each endpoint, with derivative bounded by C/ε; since ∣u∣≤∥u′∥∞dist⁡(x,∂(a,b)), the cutoff error in H1 tends to zero, and each compactly supported H1 function is approximated by mollification. For zero data, integration against u gives λ∥u′∥22≤∥f∥2∥u∥2+∥β−A′∥∞∥u′∥2∥u∥2+∥c∥∞∥u∥22; Young's inequality and [F2] then give the stated energy bound on these finitely many intervals. This proves all existence, energy, and global regularity conclusions in dimension one; [F2] gives stability. Henceforth take n≥2.

1.3givenF1F4F5

Let δ(x)=dist⁡(x,Rn∖U) on all of Rn; it is nonnegative, 1-Lipschitz, vanishes outside U, and has compact support because U is bounded. Fix a nonnegative unit-mass smooth mollifier supported in the unit ball. Put εj↓0 and δj=ρεj∗δ. Then ∣δj−δ∣≤εj. Choose a regular value tj∈(2εj,3εj), using the local Euclidean Morse–Sard theorem, and set Vj={δj>tj}. This is bounded with compact smooth boundary, satisfies Vˉj⊂U (indeed δ≥tj−εj>εj on its closure), and contains {δ>4εj}. Every compact subset of U is contained in Vj for all sufficiently large j. Discard an initial empty Vj if necessary. Nestedness is not required anywhere below. If there are several components, use the same argument componentwise; a compact smooth boundary has a finite graph cover and the proof supplies the same finite-cover regularity on their union.

1.4givenF1F4F5

Choose sj<εj/4 tending to zero and mollify the original coefficients and forcing at scale sj on a neighborhood of Vˉj: Aj=ρsj∗A,βj=ρsj∗β,cj=ρsj∗c,fj=ρsj∗f. Only values inside U are used there. Consequently Aj=AjT, λI≤Aj≤ΛI, cj≤0, and the sup bounds of βj,cj,fj,DAj do not exceed the original corresponding bounds. On every fixed interior ball, their Hölder norms are uniformly bounded and they converge uniformly to the original coefficients/data; DAj→DA uniformly locally as well. The Hölder bound follows directly by integrating ∣F(x−z)−F(y−z)∣≤[F]α∣x−y∣α. Each coefficient is smooth near Vˉj; its higher derivatives can grow with j, which does not matter.

1.5givenF1F4F5

Extend g to a bounded continuous G on Rn using Tietze and set Gj=ρsj∗G. Uniform convergence Gj→G holds on any fixed compact neighborhood of Uˉ, by uniform continuity there. Also ∥Gj∥∞≤∥G∥∞. The lemma gives a smooth classical uj on Vˉj satisfying Ljuj=fjin Vj,uj=Gjon ∂Vj.

1.6givenF2algebra

Take a slab a≤x1≤b containing Uˉ, put B=sup⁡j∥βj,1∥∞, C0=sup⁡j∥cj∥∞, and choose κ with λκ2−Bκ−C0≥1. For ψ=eκx1, Ljψ≥eκa=:η>0. Fix M>eκb and put Φ=M−ψ>0. Then LjΦ≤−η for every j. The comparison implication used below follows directly: if z∈C2(Vj)∩C(Vˉj), Ljz≥0 and z≤0 on ∂Vj, a value z(x0)>0 would, for ϵ>0 sufficiently small that ϵeκb<z(x0), force z+ϵψ to have a positive interior maximum. There its gradient is zero and Hessian negative semidefinite, so ellipticity and cj≤0 give Lj(z+ϵψ)≤0. This contradicts Lj(z+ϵψ)≥ϵη>0, proving z≤0.

1.7givenF2

Let Q=∥G∥∞ and R=∥f∥∞. On ∂Vj, both uj−Q−(R/η)Φ and −uj−Q−(R/η)Φ are nonpositive. Their Lj images are nonnegative, since cj≤0, ∣fj∣≤R and LjΦ≤−η. Comparison gives ∣uj∣≤Q+(R/η)∥Φ∥∞=:M0 on Vj. This constant depends only on the original domain/slab, uniform ellipticity and expanded coefficient sup bounds, R,Q. It is independent of j, of the smoothness of ∂Vj, and of all higher coefficient derivatives.

1.8givenF3F6

For every ball B2r(x)⋐U, it is contained in Vj for large j. Apply the actual interior Schauder theorem to uj there. All coefficient Cα norms and ellipticity constants are uniformly controlled on that fixed ball, ∥uj∥∞≤M0, and the Cα norm of fj is uniformly bounded. Hence uj is uniformly bounded in C2,α(Br(x)).

1.9givenF3F6

Cover U by a countable family of such inner balls with rational centers/radii. Arzelà–Ascoli on each smaller closed ball and diagonal extraction give one subsequence for which (uj,Duj,D2uj) converges uniformly on every compact subset of U. The fundamental theorem of calculus on coordinate segments identifies the limits with (u,Du,D2u); their compatibility on overlapping balls follows from uniform convergence. Passing each Hessian Hölder difference quotient to the limit proves u∈Cloc2,α(U). Uniform local convergence of all coefficients/data and derivatives gives Lu=f pointwise. The uniform bound gives ∣u∣≤M0.

1.10givenF2

Fix q∈∂U. Let BR(z) be an exterior ball tangent at q. Replace it by the smaller ball with center z′=(z+q)/2 and radius r0=R/2. Its closed ball is contained in BR(z)∪{q}: for x≠q on the smaller closed ball, strict triangle inequality gives ∣x−z∣<R. Thus ∣x−z′∣≥r0(x∈Uˉ),∣x−z′∣=r0  ⟺  x=q. This strict contact property is necessary; the original exterior ball could touch the boundary at several points.

1.11givenF2

Write r=∣x−z′∣, e=(x−z′)/r, and let R1=max⁡Uˉr. Choose an integer m>0 so large that (m+2)λ−nΛ−R1sup⁡j∥βj∥∞≥1. Define W0=r0−m−r−m. It is smooth near Uˉ, nonnegative there, vanishes exactly at q, and a direct differentiation gives LjW0=mr−m−2(tr⁡Aj−(m+2)eTAje+rβj⋅e)+cjW0≤−mr−m−2≤−mR1−m−2. After multiplying by R1m+2/m, obtain a single Wq≥0 with Wq(q)=0, Wq>0 on Uˉ∖{q}, and LjWq≤−1 for every j.

1.12givenF2

Fix 0<ϵ<1. Continuity of G at q gives a neighborhood N of q where ∣G(x)−g(q)∣<ϵ/2. Uniform approximation gives ∣Gj−G∣<ϵ/2 on Uˉ for all sufficiently large j. Thus ∣Gj−g(q)∣<ϵ on N∩Uˉ. On the compact complementary set Uˉ∖N, Wq has a strictly positive minimum; choose K so large that ∣Gj−g(q)∣≤ϵ+KWqon all of Uˉ for all sufficiently large j, and also K≥R+C0(∣g(q)∣+ϵ). Apply comparison on Vj to zj+=uj−g(q)−ϵ−KWq,zj−=−uj+g(q)−ϵ−KWq. They are nonpositive on ∂Vj, and Ljzj+=fj−cj(g(q)+ϵ)−KLjWq≥−R−C0(∣g(q)∣+ϵ)+K≥0, Ljzj−=−fj+cj(g(q)−ϵ)−KLjWq≥−R−C0(∣g(q)∣+ϵ)+K≥0. Therefore ∣uj(x)−g(q)∣≤ϵ+KWq(x)(x∈Vj) for all sufficiently large j. Passing to the interior limit gives the same bound for u on U. Let x→q from inside U and use Wq(x)→0; then lim sup⁡x→q∣u(x)−g(q)∣≤ϵ. Since ϵ was arbitrary, u(x)→g(q). Set u=g on ∂U. The resulting function is continuous at every boundary point and in the interior, hence belongs to C(Uˉ).

1.13givenF2

This proves existence. The exponential-barrier comparison from the residual-stability lemma applied to the difference of two solutions proves uniqueness. Its stated residual estimate applied to u−h proves the stability branch without any regularity of h stronger than C2(U)∩C(Uˉ) plus bounded residual. No boundary-correction existence needs to be assumed.

1.14givenF2F7F9

Now set g=0 and choose G=Gj=0 exactly. Let uj be the corresponding approximants above. For them, the positive equation expands equivalently to div⁡(AjDuj)+qj⋅Duj+cjuj=fj,qj=βj−div⁡Aj. The bounds on DAj,βj give sup⁡j∥qj∥∞≤Q1<∞. This is where the original C1,α regularity of A is used; existence in the purely nondivergence formulation required only Cα principal coefficients after an appropriate different approximation argument.

1.15givenF2F7F9

Multiply by uj, integrate over Vj, and use uj=0 on its smooth boundary: λ∥Duj∥22≤∥fj∥2∥uj∥2+Q1∥Duj∥2∥uj∥2+∥cj∥∞∥uj∥22. Young's inequality gives ∥Duj∥22≤C(∥fj∥22+∥uj∥22). The uniform supremum estimate with Q=0 yields ∥uj∥2≤∣U∣1/2C∥f∥∞, and ∥fj∥2≤∣U∣1/2∥f∥∞. Thus sup⁡j∥uj∥H1(Vj)≤CU∥f∥∞. Because uj is smooth to its smooth boundary and zero there, it lies in H01(Vj). Extend it by zero to U; approximation of each class by Cc∞(Vj)⊂Cc∞(U) proves that this extension belongs to H01(U) and has the same H1 norm.

1.16givenF2F7F9

For completeness, no unproved compactness premise is hidden here. In the Hilbert space H01(U), take the closed span of the countable sequence of extensions. Apply Gram–Schmidt to its listed vectors, discarding zeros, to obtain a finite or countable orthonormal basis of that span. Boundedness, diagonal extraction of the scalar coordinates, and Bessel's inequality give square-summable limiting coordinates and a vector in that closed span. Approximate each test vector by its finite basis sums; the common norm bound then proves convergence against every inner product test vector in that span. For any ambient Hilbert test vector z, finite Bessel bounds make the series of its coordinates in this basis converge in the closed span, and its residual is orthogonal to every basis vector and hence to the span; replacing z by this series thus gives the same pairing; Riesz representation therefore proves weak convergence in the ambient Hilbert space, including convergence against the bounded L2 pairings of functions and gradients. Its L2 restriction to every compact interior ball agrees with u, since the chosen local-classical subsequence converges uniformly there. Thus the weak limit is the function u almost everywhere on U. It follows that u∈H01(U),∥u∥H1(U)≤CU∥f∥∞. Equivalently the weak limit in H1(U) remains in the closed linear subspace H01(U); the direct closed-span construction already takes place in that subspace.

1.17givenF2F7F9

Passing the original weak equations to the limit against any φ∈Cc∞(U) is legitimate by local uniform convergence of coefficients/data and weak convergence of gradients. The divergence representation above shows that u solves the variational equation; density extends it to all H01 tests because A,q,c,f are bounded. This establishes both the finite-energy membership and the correct weak interpretation, rather than inferring them from continuity and zero boundary values alone.

1.18givenF2F7F9

For a general C2,α lifting G, apply this zero-boundary result to v=u−G with forcing f−LG∈C0,α(U). Uniqueness of the classical Dirichlet problem identifies that zero-boundary solution with u−G.

1.19givenF1F4F8

Suppose n≥2, U is C2,α and the datum has the stated ambient lifting G. Use the smooth interior approximating domains Vj from [F8], which have uniform C2,α graph charts and eventually contain every compact subset of U. Write dj=dist⁡(Vˉj,Rn∖U)>0. Repeat the already proved smooth-coefficient construction at scales 0<rj<dj/4 tending to zero, so all coefficient, forcing and lifting convolution evaluations near Vˉj remain inside U. Uniform ellipticity, symmetry, the expanded-potential sign and all global Cα bounds are preserved. For the undifferentiated a,b terms, their finite first-derivative bounds yield a global Lipschitz bound on this fixed smooth domain: in each graph patch, sufficiently close points are connected inside a slightly larger patch by a path of length at most C∣x−y∣; a finite cover handles close pairs and the supremum bound handles separated pairs. The prescribed highest-derivative Hölder norms then give the uniform expanded coefficient norms. The lifting mollifications have uniformly bounded C2,α norms and converge uniformly near the closure.

1.20givenF1F2F4F8

Let uj be the smooth Dirichlet solutions on Vj with forcing fj and boundary lifting Gj. Their existence and smoothness up to the smooth boundary were proved by the Sobolev-bootstrap helper before using any boundary Schauder estimate. The exponential comparison gives a uniform supremum bound. Apply [F8] to the already smooth zero-boundary functions wj=uj−Gj, whose forcings fj−LjGj have uniformly bounded Cα norms. The domain geometry and coefficient controls are uniform, so sup⁡j∥uj∥C2,α(Vˉj)≤C(∥f∥0,α;U+∥G∥2,α;Uˉ).

2.1givenF2F3F6F8∎

The existing interior compactness and exterior-ball boundary comparison arguments give a subsequence converging locally in C2(U) to the unique classical Dirichlet solution u. The displayed global derivative bounds pass to this local limit. For any fixed distinct x,y∈U, both points eventually lie in Vj, so their second-derivative Hölder quotient passes to the limit with the same common bound. Hence D2u is bounded and globally α-Hölder on U, and extends continuously to the closure. The function and gradient extend continuously as well: bounded first and second derivatives give Lipschitz bounds along the controlled-length local interior paths in each graph patch, and separated pairs are bounded by the global suprema. These extensions are the continuous extensions of the interior derivatives. Consequently u∈C2,α(Uˉ) with the stated data estimate, obtained entirely from smooth approximants without assuming the original solution's boundary Hölder norm. Together with the parent's one-dimensional argument and the prior local existence, uniqueness, stability and energy steps, all branches follow.

Remarks

The source's globally bounded C2,α(U) claim for merely continuous boundary data and an exterior-sphere domain is false; the separate false statement and its native sector counterexample preserve that assertion and its refutation. The correct unconditional class here is local C2,α with continuity on the closure.

The printed expression ∑i,jDi(aijDju+biu) repeats the b term n times. The intended single-divergence expression and the displayed expanded coefficients are used here. The simple residual barrier constant depends on the expanded drift and potential; no dependence solely on the source's pointwise λ0,Λ,v bounds is asserted.

The smooth-boundary global branch is proved using explicit Newtonian/Poisson half-ball estimates and freezing on smooth interior approximants. The solution's boundary regularity is obtained only after passing the resulting uniform estimates to the local classical limit. The published boundary Schauder carrier's externally quoted half-ball input is not consumed. No new external source-reading credit is claimed by this repair.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Elliptic PINN minimizers converge to the Dirichlet solution

Statement

Assume the Axiom of Choice and Countable Choice. Use the corrected small-scale sampling, trial-class, exact-zero-witness, and exact regularization hypotheses of the regularized PINN theorem, with residual and boundary operators L and boundary restriction. Require every admitted trial function in Hm to belong to C2(U)∩C(Uˉ). Let d≥2 and let U⊂Rd be bounded Lipschitz with an exterior sphere at every boundary point. For 0<α<1, let aij=aji∈C1,α(U) have minimum eigenvalue at least λ0>0, let bi∈C1,α(U) and ci,d∈C0,α(U), and put L[u]=∑i,jDi(aijDju)+∑iDi(biu)+∑iciDiu+du, b~j=∑iDiaij+bj+cj,c~=∑iDibi+d≤0. All indicated Hölder norms are finite global norms. Retain the source coefficient bounds ∑i,j∣aij∣2≤Λ and λ0−2(∣b∣2+∣c∣2)+λ0−1∣d∣≤v2. Let f∈C0,α(U) and g∈C0,α(∂U). There is exactly one u∗∈Cloc2,α(U)∩C0(Uˉ) with L[u∗]=f and u∗=g on ∂U.

Every sequence of global regularized empirical minimizers hm converges to u∗ in C0(U) almost surely as both sample counts tend to infinity. If mr=O(mbd/(d−1)), the occupancy-event squared uniform error is O(mr−α/d), with the probability and constants of the regularized-loss theorem. If each minimizer satisfies the boundary data exactly, the errors belong to H01(U) and converge to zero in H1(U) almost surely. If in addition U is C2,α and g has a C2,α lifting, the usual global C2,α(Uˉ) branch applies with its stated coefficient/data hypotheses. No global Hölder regularity is claimed from the exterior-sphere condition alone, and no optimizer convergence is asserted.

Facts & Assumptions

Given: The stated coefficient, sampling, witness, global-minimizer, and choice hypotheses.

[F1]

The elliptic theorem gives unique local-Hölder classical existence with continuous boundary attainment, the smooth-boundary global branch under its extra hypotheses, and H01 membership of every zero-boundary classical solution whose forcing is globally Hölder (Exterior-sphere elliptic Dirichlet existence, energy and residual stability).

[F2]

The populated-cell proof gives both residual errors tending uniformly to zero almost surely, without weight comparability, and its quantitative occupancy-event bounds (Regularized PINN minimizers have vanishing residuals under sample refinement).

[F3]

The actual expanded coefficients satisfy the residual-stability estimate for any C2(U)∩C(Uˉ) error (Shin's positive divergence-form operator, Elliptic residual and boundary stability from a maximum principle).

[F4]

The source coefficient bound and H01 membership give the elliptic energy estimate (Elliptic H1 error estimate from the source coefficient bound).

[A1]

The Axiom of Choice and Countable Choice are inherited from the existence supplier; the zero-boundary closure/energy convention retains Countable Choice (The Axiom of Choice, The Axiom of Countable Choice (ACω)).

Proof

1.1givenA1F1F2F3algebra

The finite global C1,α norms of a,b make b~,c~ globally bounded and Hölder, with c~≤0. Thus [F1] yields the unique solution in the stated local class. Apply [F3] to em=hm−u∗, whose boundary values are hm−g and whose forcing is L[hm]−f. It gives ∥em∥∞≤CL(∥L[hm]−f∥∞+∥hm−g∥∞;∂U). Both terms tend to zero almost surely by [F2]. Squaring this estimate transfers the occupancy-event rate and its event probability to the solution error. The constant may depend on the bounded expanded coefficients and thus their derivative bounds, not only Λ,v.

2.1givenF1F2F4step 1.1algebra

If the boundary data are exact, em∈C2(U)∩C(Uˉ) has zero boundary value and L[em]=L[hm]−f∈C0,α(U). The zero-boundary assertion in [F1] gives em∈H01(U); this is proved by zero extensions of the smooth approximants and weak convergence, not inferred from continuity alone. Since ∣U∣<∞, step 1.1 and [F2] imply ∥em∥L2(U)+∥L[em]∥L2(U)→0. Apply [F4] to obtain ∥em∥H1(U)→0. This statement is about the errors, and remains meaningful even if the individual nonzero-data solution is not in H1(U).

3.1F1step 1.1step 2.1algebra∎

Under the extra smooth-boundary/data hypotheses, [F1] supplies the stated global regularity branch for this same unique solution. The native sector counterexample refutes extending that conclusion to every exterior-sphere Lipschitz domain. This completes all the stated convergence and regularity assertions.

Remarks

The source's stronger global C2,α(U) existence assertion for exterior-sphere domains is false for its own globally bounded Hölder convention; the native 2π/3 cutoff-sector counterexample is retained. The exact original carrier is archived in the proposal. The active divergence formula counts div⁡(bu) once, consistently with the expanded coefficients and energy calculation; the original repeated-index printed expression is recorded in the operator definition's source discrepancy. The minimizer conclusion uses the repaired populated-cell proof and the corrected small-scale sampling convention, with no hidden balance premise.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Parabolic PINN minimizers converge to the initial-boundary solution

Statement

Assume the Axiom of Choice and Countable Choice. Let U⊂Rd be nonempty, bounded and open with an exterior ball at every spatial boundary point, T>0, and Q=U×(0,T). Use the full parabolic coefficient/data hypotheses of the variable-coefficient existence theorem: differentiability of aij,bi, symmetry and uniform ellipticity, the source weighted parabolic Hölder coefficient bounds, bounded locally parabolic Hölder expanded drift and potential, bounded locally parabolic Hölder forcing, compatible Hölder initial and lateral data, and one-sided local Hölder control at interior points of the final face. Use Lt[u]=∑i,jDi(aijDju)+∑iDi(biu)+∑iciDiu+du, b~i=∑jDjaij+bi+ci,c~=∑iDibi+d≤0. Retain the source pointwise bounds with constants λ0,Λ,v and its auxiliary θ>0 condition θ2a11+θb~1≥1; the direct parabolic time barrier also works without that auxiliary condition. Boundedness is part of the source's order-zero Hölder norm, not a consequence of its weighted δ2f bound alone.

Use the corrected small-scale sampling, data/trial-class, exact-zero-witness and exact regularization assumptions of the regularized PINN theorem in the ambient dimension D=d+1, with residual −ht+Lt[h], target f, and restriction to the initial-lateral boundary ΓT with target ψ combining the compatible data. Require Hm⊂C2,1(Q)∩C(Uˉ×[0,T]). The Euclidean Hölder assumptions in this sampling interface are retained in addition to the parabolic PDE regularity assumptions. There is one classical solution u∗∈C2,1(Q)∩C(Uˉ×[0,T]), locally parabolic Hölder in its displayed derivatives, to −ut∗+Lt[u∗]=f and the prescribed data.

Every sequence of global empirical regularized minimizers converges to u∗ in C0(Q) almost surely as both counts tend to infinity. For mr=O(mb(d+1)/d), the occupancy-event squared uniform solution error is O(mr−α/(d+1)), with the probability and constants of the regularized-loss theorem at dimension D=d+1. If all minimizers satisfy both initial and lateral data exactly and the displayed divergence expansion agrees distributionally with the classical operator (in particular if a,b are spatially C1 locally), then their errors belong to L2(0,T;H01(U)) and tend to zero in L2(0,T;H1(U)) almost surely. The energy conclusion uses the actual bounded divergence coefficients and their source v bound. No closed-cylinder C2,1 regularity of u∗ or convergence of an optimizer is asserted.

Facts & Assumptions

Given: The parabolic problem, full sampling and exact regularizer hypotheses, global minimizers and choice assumptions in the Statement.

[F1]

The local variable-coefficient construction gives the unique classical solution with continuous initial/lateral/final boundary attainment and the residual stability estimate (Variable-coefficient parabolic initial-boundary existence and residual stability, Variable-coefficient parabolic residual and boundary stability, Shin's parabolic operator, data, and initial-lateral boundary).

[F2]

The populated-cell theorem gives uniform convergence of the PDE and prescribed-data residuals almost surely, together with its count-dependent occupancy-event rate; weight comparability is not a premise (Regularized PINN minimizers have vanishing residuals under sample refinement).

[F3]

A zero-data locally classical continuous error for the weak-compatible divergence operator has finite variational energy and zero L2 initial trace (Zero-data bounded classical parabolic errors are weak energy solutions).

[F4]

The variational zero-spatial-trace energy estimate applies in that class (Parabolic L2 energy estimate with zero initial-lateral trace).

[A1]

The existence and compactness suppliers carry AC and CC; the Sobolev energy-space convention carries CC (The Axiom of Choice, The Axiom of Countable Choice (ACω)).

Proof

1.1givenA1F1F2algebra

Apply [F1] under the full stated PDE hypotheses to obtain u∗. For em=hm−u∗ the equation is P[em]=−rm with rm=f+(hm)t−Lt[hm], and its boundary values are hm−ψ. The residual stability estimate gives ∥em∥∞;Q≤CP(∥rm∥∞;Q+∥hm−ψ∥∞;ΓT). By [F2] both terms tend to zero almost surely. Squaring this estimate transfers the occupied-cell error bound and its event probability to the solution error. With D=d+1, the count specialization in [F2] is exactly the one displayed here.

2.1givenF2F3F4step 1.1algebra∎

Under exact initial and lateral data the errors have zero classical prescribed values and bounded globally Hölder residuals. Under the explicit weak-compatible divergence hypothesis, [F3] identifies each with the zero-initial variational Dirichlet solution, so em∈L2(0,T;H01(U)) with the required time derivative in the dual space. There is no inference from continuous zero trace alone. Since Q has finite volume, [F2] implies ∥rm∥L2(Q)→0. Apply [F4] with em(0)=0 to get both sup⁡t∥em(t)∥2→0 and ∥∇em∥L2(Q)→0. Their sum implies the asserted L2(0,T;H1(U)) convergence.

Remarks

The source's pointwise word “differentiable” is retained for its classical problem. Its integration-by-parts energy argument additionally uses the weak divergence identity; this requirement is explicit here, with local spatial C1 as a sufficient interpretation. Merely continuous zero boundary data do not prove energy membership. The new energy-identification helper supplies that separate step once the divergence equation has its intended weak meaning. The source's unusual weighted C2+α convention is preserved in the definition; this theorem does not claim that the limiting continuous-data solution has the printed weighted global trial norm.

TheoremStatement: AI-adaptedProof: AI-generatedOpen item page →

Neural operators approximate continuous maps uniformly on compacta

Statement

Assume Countable Choice. Let D⊂Rd and D′⊂Rd′ be bounded Lipschitz domains. Let A be Lp1(D), Wm1,p1(D), or C(Dˉ), with 1≤p1<∞ and m1≥1 where applicable. Let U be Lp2(D′), Wm2,p2(D′), or Cm2(Dˉ′), with 1≤p2<∞, with m2=0 in the Lebesgue case, m2≥1 in the Sobolev case, and m2≥0 in the continuous case. Let G†:A→U be continuous, K⊂A compact, and ε>0. Suppose σ1∈A0L, σ2∈A0, and σ3∈Am2 in every finite input dimension used below. Then some finite-layer neural operator G in the specified integral architecture satisfies sup⁡a∈K∥G†(a)−G(a)∥U<ε.

The printed additional source implication asserts that, if U is Hilbert, M>0, ∥G†(a)∥U≤M on all A, and σ1∈BA, then ∥G(a)∥U≤4M on all A. This exact implication is vacuous because its diameter-bounded class is empty. A useful corrected implication replaces only that additional activation premise by the following explicitly different property: for every compact S⊂Rq, every C≥sup⁡z∈S∣z∣2 with the convention that the radius of the empty set is zero, and every η>0, there is a σ1 MLP b:Rq→Rq with sup⁡S∣b(z)−z∣2<η and sup⁡Rq∣b(z)∣2≤C. Under this replacement the same global bound 4M holds. This replacement does not change the printed diameter-based definition.

Facts & Assumptions

Given: The spaces, compact set, target, activation hypotheses and error in the Statement.

[F1]

The activation hypotheses supply fixed-depth finite MLP density in the indicated finite-dimensional Cm norms; stacking scalar networks of a common depth gives vector outputs. Their affine output layers allow linear combinations and constant functions (Activation classes for neural-operator universality).

[F2]

The architecture uses affine integral maps on D, coordinatewise σ1 between its intermediate affine maps, and a final kernel on D′×D integrated over D (Neural operator between function spaces).

[F3]

Smooth restrictions are norm-dense in all listed output spaces, including Cm(Dˉ′), by the constructive smooth-range approximation in Inward mollification and smooth finite-rank approximation on Lipschitz domains. Thus the targets subsequently approximated using the Am premise can be chosen ambient smooth; no extension of an arbitrary Cm(Dˉ′) function is assumed.

[F4]

Under Countable Choice, if a,b∈Lloc1(D) are distinct modulo null functions then some real φ∈Cc∞(D) has ∫Dφ(a−b)≠0, by injectivity of regular distributions (Locally integrable functions embed in distributions, The Axiom of Countable Choice (ACω)).

[F6]

Under Countable Choice, the pointwise universal-approximation theorem applies to activations in Mpt that are not polynomial almost everywhere (Single-hidden-layer universal approximation, Locally essentially bounded activations with null discontinuity closure).

[F5]

The source's diameter-bounded class is empty (The printed diameter-bounded activation class is empty).

Proof

1.1givenF4choosealgebra

If K is empty choose the zero operator. Otherwise put T=G†∣K and choose 0<τ<ε/5. Every listed input space injects continuously into L1(D): for finite p, ∥a∥1≤∣D∣1−1/p∥a∥p≤∣D∣1−1/p∥a∥Wm,p when applicable, and for C(Dˉ) use ∥a∥1≤∣D∣∥a∥∞. Thus each smooth moment a↦∫Dφa is continuous on A and such moments separate distinct members of K, using [F4]; distinct continuous functions also differ on an interior set of positive measure.

1.2F1F6constructalgebra

ReLU is continuous and Borel, is pointwise bounded on every compact interval, and has empty discontinuity set, so it belongs to Mpt. It cannot agree almost everywhere with a polynomial: that polynomial would vanish on the negative half-line by continuity, hence identically, contradicting ReLU on the positive half-line. Thus [F6] applies. The corrected property has concrete instances. For ReLU and a compact S⊂Rq, suppose C≥sup⁡S∣z∣2. If S is empty choose zero. If C=0, then S⊂{0} and again choose zero. If C>0, the coordinate clamp cj(z)=−C+ReLU⁡(zj+C)−ReLU⁡(zj−C) is an exact ReLU network onto [−C,C]q and fixes S. The radial projection P onto the Euclidean ball of radius C is continuous and fixes S. By [F6] approximate P on the cube by a ReLU MLP p with Euclidean error <ξ, where 0<2ξ<η. Then b(z)=Cp(c(z))/(C+ξ) is a finite ReLU MLP, globally bounded by C, and for z∈S its error is less than ξ+ξC/(C+ξ)<2ξ<η. Composition of layered MLPs is a layered MLP because consecutive affine maps merge. ReLU also has linear growth and belongs to every relevant A0 by [F6]. Thus this corrected branch is nonvacuous.

2.1step 1.1constructchoose

The set Q={(a,b)∈K2:∥T(a)−T(b)∥U≥τ} is compact. For each pair in Q a separating moment from step 1.1 remains nonzero on a neighborhood of that pair. A finite subcover supplies moments φ1,…,φJ such that E(a)=(∫Dφja)j=1J has E(a)≠E(b) for all (a,b)∈Q. If Q is nonempty, the positive continuous function ∣E(a)−E(b)∣2 on Q has a positive minimum r; if Q is empty set J=1, φ1=0, and r=1. In both cases ∣E(a)−E(b)∣2<r implies ∥T(a)−T(b)∥U<τ. This is the complete finite-moment reduction and does not presume a dual representation theorem.

3.1step 2.1constructalgebra

Cover the compact E(K) by finitely many open balls of radius r/4 with centers zi=E(ai), ai∈K, 1≤i≤s. Put hi(z)=max⁡(0,r/2−∣z−zi∣2), h0(z)=dist⁡(z,E(K)), and wi(z)=hi(z)/(h0(z)+∑k=1shk(z)). The denominator is positive everywhere: off E(K) its first term is positive, and on E(K) some hi>r/4. Consequently w=(w1,…,ws) is continuous on all RJ, nonnegative, and ∑iwi≤1, with equality on E(K). For a∈K, wi(E(a))>0 implies ∣E(a)−E(ai)∣2<r/2 and hence ∥T(a)−T(ai)∥U<τ. The convex combination ∑iwi(E(a))T(ai) therefore differs from T(a) by less than τ.

4.1step 3.1F3chooseconstructalgebra

For every listed output space choose smooth neighborhood restrictions ϕi with ∥ϕi−T(ai)∥U<τ, using [F3]. Define Bv=∑iviϕi and L=max⁡(1,∥B∥ℓ1→U). Since the weights in step 3.1 sum to one on E(K), sup⁡K∥T(a)−Bw(E(a))∥U<2τ. This is the output finite-dimensional factorization.

5.1step 1.1step 4.1F1chooseconstructalgebra

Let Z={z:dist⁡(z,E(K))≤1}, a compact subset of RJ. Uniform continuity of w on Z gives 0<δ<1 such that z,z′∈Z and ∣z−z′∣2<δ imply ∣w(z)−w(z′)∣1<τ/L. Set R=max⁡(1,sup⁡a∈K∥a∥1). By the σ2 premise [F1] choose common-depth scalar networks pj with sup⁡Dˉ∣pj−φj∣<δ/(2RJ). Then E~(a)=(∫Dpj(y)a(y) dy)j satisfies sup⁡K∣E~−E∣2<δ/2, so E~(K)⊂Z and sup⁡K∥Bw(E(a))−Bw(E~(a))∥U<τ. The input layer kernel (x,y)↦(pj(y))j ignores x and has exactly constant spatial output. The estimate uses only L1 bounds and covers p1=1.

6.1step 5.1F1choosealgebra

Apply the σ1∈A0 premise to the continuous map w on compact E~(K), obtaining a finite MLP f:RJ→Rs such that sup⁡z∈E~(K)∣f(z)−w(z)∣1<τ/L. Then sup⁡K∥Bw(E~(a))−Bf(E~(a))∥U<τ. Only C0 approximation of this middle map is used; no differentiability of σ1 is needed.

7.1step 4.1step 6.1F1chooseconstructalgebra

Put V=max⁡(1,sup⁡a∈K∣f(E~(a))∣1), finite by continuity and compactness. Define cU=1 for U=Cm2(Dˉ′) with the maximum derivative norm, and cU=(Jm2∣D′∣)1/p2 for U=Wm2,p2(D′) with the usual sum-of-p2-powers norm, where Jm counts multi-indices of order at most m; this also treats Lp2 with J0=1. For Cm2 functions u, directly integrating each derivative gives ∥u∥U≤cU∥u∥Cm2. By σ3∈Am2 choose common-depth networks qi such that ∥qi−ϕi∥Cm2(Dˉ′)<τ/(cUV). These approximants are chosen from the Cm2 network subfamily supplied by that density premise, so their derivatives exist. With B~v=∑iviqi, the estimate ∥(B~−B)v∥U≤cU∣v∣1max⁡i∥qi−ϕi∥Cm2 yields sup⁡K∥B~f(E~(a))−Bf(E~(a))∥U<τ. Equivalent choices of standard Banach norms merely change cU.

8.1step 5.1step 6.1step 7.1F1F2constructalgebra

Write the middle MLP as f(z)=An+1σ1(Anσ1(⋯σ1(A1z+b1)⋯ )+bn)+bn+1 with n hidden layers. On a spatially constant field v(y)=z, the affine map z↦Az+b is represented exactly by the integral kernel A/∣D∣ and constant bias b. Such constants are exact σ2 networks through their output biases. Use these layers after the input layer of step 5.1, placing precisely the n coordinatewise σ1 activations of f between them. The final kernel κ(x,y)=∣D∣−1(q1(x),…,qs(x)) is a σ3 network ignoring y, so its integral over D sends a constant v to B~v. This proves that G(a)=B~f(E~(a)) belongs to NOn+2 under the indexing convention in [F2]. All intermediate fields are constant and the final output belongs to U for every a∈A.

9.1step 4.1step 5.1step 6.1step 7.1step 8.1algebra

Adding the four errors in steps 4.1–7.1 gives sup⁡K∥T(a)−G(a)∥U<5τ<ε. This proves the core theorem. The proof in fact only needs continuity of T on K and the continuous injective L1 realization of A; it retains all the listed source spaces.

10.1step 8.1step 9.1chooseconstructalgebra

For the corrected additional branch assume U Hilbert, M>0, and sup⁡A∥G†(a)∥U≤M. Apply the core construction with an error 0<γ<min⁡(M,ε/2), calling the resulting operator G0. It has the exact form G0(a)=∑ifi(E~(a))qi. Choose an orthonormal basis e1,…,et for the finite-dimensional span of the qi, discarding linear dependences, and express G0(a)=∑jgj(E~(a))ej. Each gj is a linear combination of the fi and hence the same-depth σ1 MLP; each ej is a linear combination of the qi and hence a same-depth σ3 network. If the span is zero the zero operator already suffices. Otherwise ∣g(E~(a))∣2=∥G0(a)∥U<M+γ<2M on K.

11.1step 10.1F2constructalgebra

The set S=g(E~(K)) is compact with radius at most 2M. Apply the explicitly corrected property in the Statement with C=2M and tolerance 0<η<ε−γ, obtaining b. Compose its σ1 MLP with g and use final kernel ∣D∣−1(ej(x))j. By step 8.1 this is an operator G1 of the required architecture. Orthonormality gives sup⁡K∥G1−G0∥U<η and ∥G1(a)∥U=∣b(g(E~(a)))∣2≤2M≤4M for every a∈A. Thus its approximation error is below γ+η<ε. The argument handles arbitrary positive M without the source's unjustified normalization M≥1.

12.1step 9.1step 11.1F5∎

For the exact printed additional implication the premise σ1∈BA is impossible by [F5], so that implication is true but has no instances. Steps 10.1–11.1 establish the explicitly different nonvacuous branch; neither step alters the diameter-based class. This completes all asserted implications.

LemmaStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Approximation property gives finite-dimensional factorization on compacta

Statement

Let X,Y be real Banach spaces with the approximation property, T:X→Y continuous, K⊂X compact, and ε>0. There are integers J,s≥1, bounded linear maps E:X→RJ and B:Rs→Y, and continuous h:RJ→Rs such that sup⁡x∈K∥T(x)−Bh(E(x))∥Y<ε. In particular E(x)=(ℓj(x))j=1J for bounded linear functionals ℓj, and Bv=∑i=1sviβi for finitely many βi∈Y.

Statement references

Facts & Assumptions

Given: The Banach spaces with AP, the continuous map T, compact K, and error ε>0.

[F1]

AP approximates the identity uniformly on any compact set by bounded finite-rank linear maps (Approximation property and bounded approximation property).

[F2]

A chosen finite basis has bounded linear coordinate maps in both directions (A chosen algebraic basis identifies a finite-dimensional normed space with a coordinate space).

Proof

1.1givenchooseconstructalgebra

If K is empty use zero maps. Otherwise consider all pairs (x,ρ) with x∈K and ρ>0 such that ∥T(z)−T(x)∥Y<ε/4 whenever ∥z−x∥X<3ρ. Continuity ensures that the balls B(x,ρ) from this family cover K; take a finite subcover B(xi,ρi). Put δ=min⁡iρi>0. For x∈K and z∈X with ∥z−x∥X<δ, select i with ∥x−xi∥X<ρi; then both x,z lie within 3ρi of xi, so ∥T(z)−T(x)∥Y<ε/2. No compact neighborhood of K is asserted or needed.

2.1step 1.1F1choosealgebra

Apply AP in X to choose bounded finite-rank P with sup⁡K∥Px−x∥X<δ. By step 1.1, sup⁡K∥T(Px)−T(x)∥Y<ε/2. The set T(P(K)) is compact; apply AP in Y to obtain bounded finite-rank Q with sup⁡x∈K∥QT(Px)−T(Px)∥Y<ε/2. Thus QTP approximates T on K within ε. This makes only two AP selections and does not require a sequence, an infinite union of compact sets, or a choice principle for sequences.

3.1step 2.1F2constructalgebra∎

Choose a finite basis α1,…,αJ of P(X). Its coordinate functionals are bounded by [F2]; hence Px=∑jℓj(x)αj with ℓj bounded on X, by composing those functionals with P. Write Rz=∑jzjαj, E(x)=(ℓj(x))j. Choose a finite basis β1,…,βs of Q(Y), with bounded coordinate functionals ci, and put hi(z)=ci(QT(Rz)) and Bv=∑iviβi. Each hi is continuous on all RJ, and BhE=QTP. For a zero-dimensional range use one zero basis vector and the zero coefficient map instead of an actual basis. These formulas prove the stated factorization and complete the proof.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Inward mollification and smooth finite-rank approximation on Lipschitz domains

Statement

Assume Countable Choice. Let D⊆Rd be a bounded Lipschitz open set, with d≥1, and let m∈N0. Let X be either Wm,p(D;R) for 1≤p<∞, including W0,p(D)=Lp(D), or Cm(Dˉ;R). In the latter space derivatives in D extend continuously to Dˉ, and the norm is max⁡∣α∣≤msup⁡Dˉ∣Dαu∣. For every norm-compact K⊆X and every ε>0, there is a bounded finite-rank linear map F:X→X such that sup⁡u∈K∥Fu−u∥X<ε and whose range is contained in the restrictions to D of functions in Cc∞(Rd), with their continuous boundary values in the Cm case. In particular, such smooth restrictions are norm-dense in X.

Moreover, there are finitely many ambient smooth cutoffs ψj, vectors vj, a unit-mass ρ∈Cc∞(Rd), and t0>0 such that for 0<t<t0 the kernel kt(x,y)=∑jψj(x)ρt(x+tvj−y), with ρt(z)=t−dρ(z/t), defines bounded linear smoothing maps Stu(x)=∫Dkt(x,y)u(y) dy. They satisfy sup⁡0<t<t0∥St∥X→X<∞ and sup⁡u∈K∥Stu−u∥X→0 for every norm-compact K⊂X. Each kernel is ambient smooth with fixed compact support in its first variable.

Facts & Assumptions

Given: Countable Choice, D,d,m,X,K,ε as in the statement. Lipschitz means that every boundary point has a rigid graph chart in which D is the strict epigraph of a Lipschitz function.

[F1]

The Sobolev norm is the finite ℓp sum of the Lp norms of the weak derivatives through order m, and W0,p=Lp; this is a well-defined norm under Countable Choice (Integer-order Sobolev spaces and their norms, The Sobolev norm descends to equivalence classes).

[F2]

A finite open cover of a compact Euclidean set admits nonnegative ambient smooth functions compactly supported in the respective cover members and summing to one on a neighborhood of that set (Finite ambient partitions near compact sets).

[F3]

Interior mollification commutes with every weak derivative through order m wherever the closed mollifier-support ball is compactly contained in the domain (Interior mollification commutes with weak derivatives).

[F4]

Under Countable Choice, translations are isometries in Lp(Rd) and are norm-continuous for p<∞; convolution with a compact smooth kernel is smooth and differentiates by differentiating the kernel (Complex translation, convolution, approximate identities, and mollification).

[F5]

Minkowski's integral inequality holds for all 1≤p<∞; its p=1 case is Tonelli's identity (Minkowski's integral inequality).

[F6]

Classical derivatives of a Cm function are weak derivatives, and the weak Leibniz rule holds for a smooth multiplier with bounded derivatives (Classical derivatives agree with weak derivatives, Weak Leibniz rule with a smooth factor).

[F8]

Bounded measurable Euclidean sets have finite measure, and Hölder, including p=1, gives ∥u∥L1(D)≤∣D∣1−1/p∥u∥Lp(D) for nonempty open D (Lebesgue measure is sigma-finite, and every metrically bounded subset of Rn has finite outer measure, Holder's inequality for integrals, including the endpoint cases).

[F9]

Nested balls admit a nonnegative compactly supported smooth bump equal to one on the inner ball (A smooth bump between concentric Euclidean balls).

Choice use: Countable Choice is used in the Sobolev, Lebesgue-measure, translation, convolution and weak-derivative interfaces [F1], [F3]–[F6], [F8]. The geometric cover and all later nets and cell selections are finite selections. No stronger choice axiom is used.

Proof

1.1givenF7F8constructalgebra

If D=∅, X is the zero space; take F=0, the empty cutoff family, kt=0, St=0 and t0=1. If K=∅ the compact approximation clause is vacuous and F=0 suffices; the smoothing construction below depends only on D and X, and can be obtained by carrying it out with K={0}. Henceforth both sets are nonempty. In particular 0<∣D∣<∞, because D contains a ball and is bounded. Fix one boundary chart Q, with Lipschitz graph function φ of constant L, and an ambient neighborhood U of its boundary point with Uˉ⊂Q compact. In chart coordinates set v=(L+2)ed. For x∈Dˉ∩Uˉ, ∣z∣≤1, and sufficiently small t>0, uniformly in x,z, the point y=x+tv−tz stays in Q because t(∣v∣+1)<dist⁡(Uˉ,Qc). Moreover yd−φ(y′)≥xd−φ(x′)+t(L+2)−t∣zd∣−Lt∣z′∣≥t>0. Thus B‾(x+tv,t)⋐D. Rotate v back to the original coordinates.

2.1F2F7step 1.1construct

The compact boundary admits finitely many such Uj, 1≤j≤J, covering it. The compact remainder Dˉ∖⋃j=1JUj lies in D; cover it by finitely many balls with closures in D, and let U0 be their union, omitting it if the remainder is empty. Then Uˉ0⋐D, so v0=0 has the same ball property for sufficiently small t. Apply [F2] to this finite open cover of Dˉ, obtaining ψj∈Cc∞(Uj) with ∑jψj=1 near Dˉ. The minimum of the finitely many positive bounds on t gives t0>0 such that B‾(x+tvj,t)⋐D for every x∈Dˉ∩supp⁡ψj and 0<t<t0. Taking the family of all admissible chart neighborhoods before extracting a finite subcover avoids selecting a chart independently at every boundary point.

3.1F4F8F9step 2.1construct

By [F9] choose a nonnegative smooth bump compactly supported in B1(0) and positive on B‾1/2(0), and divide it by its positive integral to obtain ρ∈Cc∞(B1(0)) with ∫ρ=1. Put ρt(w)=t−dρ(w/t). Every u∈X belongs continuously to L1(D): use [F8] for Sobolev spaces, and ∥u∥1≤∣D∣∥u∥Cm for Cm. For its zero extension E0u define Hj,tu(x)=(ρt∗E0u)(x+tvj) and Stu=∑jψjHj,tu. By [F4] these are well-defined linear constructions independent of representatives and Stu∈Cc∞(Rd).

4.1F1F3step 2.1step 3.1

First take X=Wm,p(D). For every ∣γ∣≤m and x∈Dˉ∩supp⁡ψj, [F3] and step 2.1 give DγHj,tu(x)=∫ρ(z)(E0Dγu)(x+t(vj−z)) dz. The translated center has distance greater than t from Dc: the entire closed ball of radius t is a compact subset of D. The identity consequently holds on a neighborhood of each indicated x. Equivalently the defining weak-derivative identity can be tested against y↦ρt(x+tvj−y), whose support is compact in D; its two derivative signs cancel. Only interior values are used, with no assertion that derivatives commute with zero extension across ∂D.

4.2F4F5step 3.1construct

For f∈Lp(Rd) define Tj,tf(x)=∫ρ(z)f(x+t(vj−z)) dz and ωf(r)=sup⁡∣h∣≤r∥f(⋅+h)−f∥p. Translation invariance and [F5] give ∥Tj,tf∥p≤∥f∥p and ∥Tj,tf−f∥p≤ωf((∣vj∣+1)t). By [F4], ωf(r)→0 as r↓0. The integral estimates also apply when p=1, where [F5] follows directly from Tonelli.

4.3F7step 3.1construct

Fix 0<t<t0. Write kt(x,y)=∑jψj(x)ρt(x+tvj−y), so Stu(x)=∫Dkt(x,y)u(y) dy. Fix a closed box Q containing Dˉ. The finitely many Dxαkt, ∣α∣≤m, are smooth and uniformly continuous on the compact set Dˉ×Q by [F7]. For any η>0, partition Q into finitely many measurable cells Qℓ of small enough diameter, assigning shared and outer faces consistently, and choose yℓ∈Qℓ. Their diameters can be chosen so that ∣Dxαkt(x,y)−Dxαkt(x,yℓ)∣<η for x∈Dˉ, y∈Qℓ and ∣α∣≤m. The point yℓ need not lie in D.

5.1F1F6step 2.1step 4.1step 4.2algebra

Set fγ=E0Dγu. The finite Leibniz rule [F6], step 4.1 and ∑jψj=1 near Dˉ give, for ∣α∣≤m, the a.e. identity on D Dα(Stu−u)=∑j∑β≤α(αβ)(Dβψj)(Tj,tfα−β−Dα−βu). Every derivative Dβψj vanishes off supp⁡ψj, so step 4.1 supplies exactly the identities used in this formula. All these fixed multiplier derivatives are bounded. Step 4.2 and the finite norm sum [F1] therefore imply ∥Stu−u∥Wm,p→0. The same Leibniz formula without subtracting u, and ∥Tj,tfγ∥p≤∥fγ∥p≤∥u∥Wm,p, give sup⁡0<t<t0∥St∥X→X≤MX<∞. For example take the ℓp norm over α of ∑j,β≤α(αβ)∥Dβψj∥∞. This argument includes m=0 and p=1.

6.1F6F7step 2.1step 4.1step 5.1algebra

Now take X=Cm(Dˉ). By [F6] each bounded classical derivative is its weak derivative, so u∈Wm,1(D) and step 4.1 applies. Each Dγu is uniformly continuous on Dˉ by [F7]. For x∈Dˉ∩supp⁡ψj, every sampled y=x+t(vj−z) lies in D and ∣y−x∣≤(∣vj∣+1)t. Positivity and mass one of ρ thus give sup⁡x∈Dˉ∩supp⁡ψj∣DγHj,tu(x)−Dγu(x)∣≤sup⁡x,y∈Dˉ∣x−y∣≤(∣vj∣+1)t∣Dγu(y)−Dγu(x)∣⟶0. The formula of step 5.1, first on D and then by continuity on Dˉ, gives ∥Stu−u∥Cm→0. Bounding each averaged derivative by ∥Dγu∥∞ and summing the same fixed multiplier constants gives sup⁡0<t<t0∥St∥X→X≤MX<∞ also in this case.

7.1F1F8step 3.1step 5.1step 6.1step 4.3constructalgebra

Define Ft,ηu(x)=∑ℓkt(x,yℓ)∫D∩Qℓu(y) dy. Each coefficient is a bounded linear functional by step 3.1, and there are finitely many coefficients. Each range function kt(⋅,yℓ) belongs to Cc∞(Rd), so the operator has finite rank with the required smooth range. Comparison with the integral for St gives max⁡∣α∣≤msup⁡Dˉ∣Dα(Ft,η−St)u∣≤η∥u∥L1(D). For X=Cm(Dˉ), this yields ∥Ft,η−St∥X→X≤∣D∣η. For X=Wm,p(D) let Am be the finite number of multi-indices of order at most m. Taking the derivative Lp norms and then applying [F8] gives ∥Ft,η−St∥X→X≤Am1/p∣D∣1/pη∣D∣1−1/p=Am1/p∣D∣η. This includes p=1, and it shows each Ft,η is bounded because St is bounded.

7.2step 5.1step 6.1givenchoosealgebra

By steps 5.1 and 6.1 the operators St:X→X converge pointwise to the identity and satisfy ∥St∥≤MX. Choose δ<ε/[4(MX+1)]. Compactness gives a finite δ-net u1,…,uN in K. Pointwise convergence permits one t∈(0,t0) such that max⁡i∥Stui−ui∥<ε/4. For any u∈K, choose one net point within δ; then ∥Stu−u∥≤(MX+1)δ+max⁡i∥Stui−ui∥<ε/2. Compactness also makes R=sup⁡u∈K∥u∥ finite: a finite cover by unit balls bounds all these norms by one plus the largest center norm.

8.1step 7.1step 7.2choosealgebra∎

Choose η>0 small enough that the relevant bound in step 7.1 is below ε/[2(R+1)]. For F=Ft,η, sup⁡u∈K∥Fu−u∥≤∥F−St∥R+sup⁡u∈K∥Stu−u∥<ε. Its range is a finite span of ambient compactly supported smooth functions by step 7.1. Applying this conclusion to the singleton compact set K={u} proves smooth-restriction density for every u∈X. All net, partition and representative-point choices here are finite; Countable Choice enters only the analytical interfaces stated above.

LemmaStatement: AI-adaptedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Smooth integral functionals approximate bounded functionals on compact sets

Statement

Assume Countable Choice. Let D⊂Rd be a bounded Lipschitz domain, and let X=Lp(D), X=Wm,p(D), or X=Cm(Dˉ), where 1≤p<∞ and m≥0 wherever applicable. For every bounded linear functional L:X→R, every compact K⊂X, and every ε>0, there is κ∈Cc∞(D) such that sup⁡a∈K∣L(a)−∫Dκ(y)a(y) dy∣<ε.

The input function in this integral is its zeroth derivative. The conclusion is compact-uniform, without an assertion of operator-norm density of these functionals.

Facts & Assumptions

Given: D,X,L,K,ε as in the Statement.

[F1]

The inward smoothing construction supplies Sta(x)=∫Dkt(x,y)a(y) dy, where kt is ambient smooth, has fixed compact support in x, and Sta→a uniformly on each compact subset of X. Its explicit kernel is kt(x,y)=∑jψj(x)ρt(x+tvj−y) (Inward mollification and smooth finite-rank approximation on Lipschitz domains).

[F2]

All listed X embed continuously into L1(D); this follows directly from Hölder's inequality on the bounded domain, or the sup norm in the continuous case. Countable Choice is used by the local smoothing supplier (The Axiom of Countable Choice (ACω)).

[F3]

The finite normalized-bump construction gives an ambient smooth cutoff equal to one near any compact subset of an open set, taking values between zero and one and compactly supported in that open set (Finite ambient partitions near compact sets).

Proof

1.1givenF1F2chooseconstruct

Empty K or L=0 is handled by κ=0. Otherwise [F1] permits choosing t>0 with sup⁡K∥Sta−a∥X<ε/(2∥L∥). For fixed t, the map y↦kt(⋅,y)∣D is ambient C∞ with values in X: every mixed x and y derivative is uniformly continuous on compact products, so the ordinary finite-dimensional Taylor remainders in y, uniformly for x derivatives through order m, tend to zero in the Cm norm and hence in the X norm. Thus κt(y)=L(kt(⋅,y)∣D) is ambient smooth, with Dyακt=L(Dyαkt(⋅,y)∣D). It is bounded on Dˉ.

1.2F2F3chooseconstructalgebra

Compactness of K in X implies its compactness in L1(D) by [F2]. Given θ>0, take a finite θ/2 net a1,…,as in that L1 image. By integrability and an exhaustion of D by compact subsets, there is one compact F⊂D with ∫D∖F∣ai∣<θ/2 for all i. Therefore sup⁡a∈K∫D∖F∣a∣<θ. Choose a smooth cutoff 0≤ζ≤1, compactly supported in D, equal to one on F; use [F3] for the one-set open cover {D} of F. Then sup⁡K∫D(1−ζ)∣a∣<θ. This uses a finite net and finitely many integrable tails, including at p=1; it requires no L∞ approximation of a dual coefficient.

2.1step 1.1F1F2constructalgebra

For each a∈X, one has L(Sta)=∫Dκt(y)a(y) dy. To justify the identity without assuming a vector-integration theorem, partition a box containing D into cells of diameter tending to zero and replace kt(⋅,y) on each cell by kt(⋅,yl). Uniform continuity of every x derivative through order m makes the error in X at most cXη∥a∥1, where η→0 is the uniform kernel derivative error and cX converts a Cm bound to an X bound. Applying bounded L to the finite sums is legitimate by linearity. Their scalar integral errors are at most ∥L∥cXη∥a∥1 as well, so passing to the limit proves the identity. Consequently sup⁡K∣L(a)−∫Dκta∣<ε/2.

3.1step 2.1step 1.2constructalgebra∎

If ∥κt∥L∞(D)=0, choose κ=0. Otherwise use step 1.2 with θ=ε/(2∥κt∥∞) and set κ=ζκt∈Cc∞(D). The cutoff error satisfies sup⁡K∣∫D(κt−κ)a∣≤∥κt∥∞sup⁡K∫D(1−ζ)∣a∣<ε/2. Combining with step 2.1 proves the claim.

4 · Examples, counterexamples and false statements

None yet.

Sources