Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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.

Exponential hp energy convergence for weighted-analytic polygon corners

Statement

Assume Countable Choice. Let Ω⊂R2 be a bounded polygonal open domain with finite corner set C={c1,…,cm} and weights 0≤βi<1. For γ∈[0,∞)m define Φγ(x)=∏i∣x−ci∣γi; β+j−2 means componentwise addition. For integer k≥2, define

∥v∥Hβk,2(Ω)2=∥v∥H1(Ω)2+∑j=2k∑∣α∣=j∥Φβ+j−2Dαv∥22.

Let Bβ2(Ω) consist of real-valued functions in every Hβk,2(Ω) for which some Cu,du>0 satisfy

∥Φβ+k−2∑∣α∣=k∣Dαu∣∥2≤Cuduk−2(k−2)!(k≥2).

Let (Tk)k≥1 be nested finite matching shape-regular affine triangulations of Ω, with at most C0k triangles. Write hT=diam⁡(T) and dist⁡(T,C)=inf⁡x∈T,c∈C∣x−c∣. Assume a fixed 0<σ<1 and C1>0 satisfy

σ≤hTdist⁡(T,C)≤σ−1(T‾∩C=∅),hT≤C1σk(T‾∩C≠∅).

Let pk∈N be uniform total polynomial degrees with c0k≤pk≤c1k for fixed 0<c0≤c1. For a fixed union ΓD of polygon edges, let Vk be the space of broken piecewise-Ppk functions whose polynomial traces agree on every interior edge and vanish on the boundary edges in ΓD; put Nk=dim⁡Vk. This is the corresponding subspace of the variable-degree space in Variable-degree conforming hp spaces on matching affine meshes. For this smoother class, the boundary condition means that the unique continuous representative supplied by Weighted analytic polygon functions have corner decay and scaled analytic bounds vanishes pointwise on the edges in ΓD; no zero condition is imposed on the other edges. If u∈Bβ2(Ω) satisfies this boundary condition, then constants C,b>0, independent of k, satisfy

inf⁡vk∈Vk∥∇(u−vk)∥L2(Ω)≤Ce−bNk1/3.

For a bounded coercive conforming Galerkin problem on a Hilbert space V⊂H1(Ω), assume u∈V is its exact variational solution: a(u,v)=F(v) for every v∈V, with bounded load F. If Vk⊂V and the norm on V is equivalent to the gradient seminorm, Céa's estimate gives the same exponential rate for the energy error, with its actual M/α and norm-equivalence factors included. The constants may depend on the polygon, weights, weighted analytic bounds, mesh shape and grading constants, degree constants, ΓD, and the Galerkin coercivity and norm-equivalence constants.

Facts & Assumptions

Given: Countable Choice; the polygon, corners and weights; the full weighted-analytic hypotheses; a nested shape-regular matching mesh sequence with the exact grading and count assumptions; uniform total degrees c0k≤pk≤c1k; and the fixed boundary-edge set ΓD.

[A1]

Countable Choice is assumed explicitly; no full Choice is used in this proof. (The Axiom of Countable Choice (ACω))

[F1]

The weighted corner estimates give a continuous representative, corner decay ∣u−u(ci)∣≤Cra, pointwise derivative bounds, and analytic scaled bounds on regular triangles. (Weighted analytic polygon functions have corner decay and scaled analytic bounds)

[F2]

The analytic polynomial supplier gives exponential W1,∞ approximation on a reference triangle and an endpoint-preserving interval projector whose derivative is an L2 contraction with exponential H1 error. (Analytic derivative bounds give exponential polynomial approximation on a triangle)

[F3]

The degree-uniform strong-edge lift extends an endpoint-zero polynomial from one edge, vanishes on the other edges, preserves degree, and has seminorm at most CℓE1/2∥∂τq∥2. (A degree-uniform polynomial edge lift with the strong edge norm)

[F4]

The variable-degree space is the finite matching polynomial space with trace equality; the conformity lemma glues matching polynomial traces into H1; and the corner count gives Nk≤CNk3. (Variable-degree conforming hp spaces on matching affine meshes, Matching variable-degree polynomial traces give an H1 function, Uniform-degree polygon corner spaces have cubic degree-of-freedom growth)

[F5]

Céa's theorem gives ∥u−uk∥V≤(M/α)inf⁡vk∈Vk∥u−vk∥V for the exact variational solution u and its Galerkin solution uk, under its stated bounded-load, boundedness, coercivity, conformity, and Countable Choice hypotheses. (Céa quasi-optimality for coercive conforming Galerkin problems)

[F6]

Cauchy–Schwarz controls one-dimensional trace errors and the area estimates on the regular triangles. (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs)

Proof

1.1A1F1givenalgebra

Fix 0<a<min⁡i(1−βi) as in [F1]. Call a cell a cap when its closure contains a corner. Since the corner set is finite and distinct corners have positive separation, for all sufficiently large k each cap contains at most one corner; its diameter is at most C1σk. On a noncap cell T with dT=dist⁡(T,C)<R, the mesh condition gives σ≤hT/dT≤σ−1, so [F1] gives uniform scaled analytic derivative bounds after subtracting a suitable constant. If dT≥R, the compact-away-from-corners bounds in [F1], together with bounded hT and the fixed rT=R, give the same conclusion after enlarging constants. Thus each noncap reference pullback has derivative bounds CrTaA1∣α∣∣α∣!, where rT=min⁡(R,dT).

2.1F1F2F6step 1.1givenconstruct

For every mesh edge incident to a polygon corner, prescribe the linear interpolant of the two endpoint values of the continuous representative of u. All cells sharing such an edge are caps. On every other edge E, prescribe the single common endpoint-preserving derivative-projection polynomial gE from [F2], in one globally fixed edge orientation. The edge lies a distance comparable to its length from any nearby corner: for an edge opposite a cap corner this follows from shape regularity and the altitude bound, and for a noncap neighbor it also follows from the mesh ratio condition. Thus [F1]–[F2] give, on each noncap edge, ∥u−gE∥L∞(E)+ℓE1/2∥∂τ(u−gE)∥L2(E)≤CrTae−bpk for each adjoining noncap cell, with comparable scales on both sides. Here the sup bound follows from the endpoint identity and ∥e∥∞≤∥e′∥L1≤∥e′∥L2 for the endpoint-zero reference error; [F6] justifies the last inequality. On an edge incident to a corner, both adjacent cells are caps, its prescribed linear polynomial shares the exact continuous vertex values, and no tangential regularity of u at the corner is used. Every edge polynomial takes the value of u at both endpoints. If E⊂ΓD, these endpoint values and the entire prescribed edge polynomial are zero.

3.1F2F3step 1.1step 2.1algebra

Let T be a noncap triangle and choose qT∈Ppk(T) by transporting the analytic approximation [F2] for the scaled pullback, then adding back its subtracted constant. Thus ∥u−qT∥∞+hT∥∇(u−qT)∥∞≤CrTae−bpk. Correct its three vertex values by an affine polynomial to obtain q~T matching the prescribed gE at all vertices; the correction has H1 seminorm at most CrTae−bpk. On each edge, gE−q~T∣E has zero endpoints, degree at most pk, and strong edge derivative norm at most CrTae−bpk. Lift these three residuals separately by [F3]. Their sum does not change the other edge traces, so the resulting vT∈Ppk(T) has all three prescribed traces and ∣u−vT∣H1(T)≤CrTae−bpk≤Ce−bpk.

3.2F1F2F3F6step 1.1step 2.1algebra

Let T be a cap at corner ci, with diameter hT; for large k it contains no other corner. Start with the affine interpolant aT of the three exact vertex values. By [F1], ∣u−aT∣H1(T)≤ChTa. Its two edges incident to ci already have the prescribed linear traces. On the opposite edge E, every point has distance comparable to hT from ci, so the gradient bound in [F1] and Cauchy–Schwarz [F6] give ℓE1/2∥∂τu∥L2(E)≤ChTa. The interval derivative projection in [F2] is contractive, and the vertex estimate in [F1] gives the same bound for gE−aT∣E. This discrepancy vanishes at both endpoints; add its lift from [F3]. The resulting polynomial has all prescribed traces and ∣u−vT∣H1(T)≤ChTa≤Cσak. No H2 regularity is used on a cap.

4.1F4step 3.1step 3.2givenalgebra

Every pair of adjacent local polynomials has common trace gE; the boundary traces vanish on ΓD. Thus they assemble to vk∈Vk by [F4]. Summing squared cell errors from steps 3.1 and 3.2 over at most C0k cells gives ∥∇(u−vk)∥2≤Ck(e−bpk+σak)≤C′e−ηk for some η>0, because pk≥c0k and 0<σ<1. The finitely many earlier meshes are handled by vk=0 and an increase of C′. Since Nk≤CNk3 by [F4], k≥CN−1/3Nk1/3 and therefore inf⁡v∈Vk∥∇(u−v)∥2≤Ce−bNk1/3.

5.1F5step 4.1givenalgebra∎

Under the additional Galerkin hypotheses, u satisfies a(u,v)=F(v) for every v∈V, and the Galerkin solution uk∈Vk satisfies a(uk,vk)=F(vk) for every vk∈Vk. Thus Céa [F5] applies to this same u and uk. Apply it to the best-approximation estimate of step 4.1. Norm equivalence between ∥⋅∥V and the gradient seminorm changes only the stated constant, and the actual M/α factor is retained. This proves the energy-error conclusion.

Depends on

Used by

Dependency tree · two levels

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

Sources