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 be a bounded polygonal open domain with finite corner set and weights . For define ; means componentwise addition. For integer , define
Let consist of real-valued functions in every for which some satisfy
Let be nested finite matching shape-regular affine triangulations of , with at most triangles. Write and . Assume a fixed and satisfy
Let be uniform total polynomial degrees with for fixed . For a fixed union of polygon edges, let be the space of broken piecewise- functions whose polynomial traces agree on every interior edge and vanish on the boundary edges in ; put . 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 ; no zero condition is imposed on the other edges. If satisfies this boundary condition, then constants , independent of , satisfy
For a bounded coercive conforming Galerkin problem on a Hilbert space , assume is its exact variational solution: for every , with bounded load . If and the norm on is equivalent to the gradient seminorm, Céa's estimate gives the same exponential rate for the energy error, with its actual and norm-equivalence factors included. The constants may depend on the polygon, weights, weighted analytic bounds, mesh shape and grading constants, degree constants, , 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 ; and the fixed boundary-edge set .
Countable Choice is assumed explicitly; no full Choice is used in this proof. (The Axiom of Countable Choice ())
The weighted corner estimates give a continuous representative, corner decay , pointwise derivative bounds, and analytic scaled bounds on regular triangles. (Weighted analytic polygon functions have corner decay and scaled analytic bounds)
The analytic polynomial supplier gives exponential approximation on a reference triangle and an endpoint-preserving interval projector whose derivative is an contraction with exponential error. (Analytic derivative bounds give exponential polynomial approximation on a triangle)
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 . (A degree-uniform polynomial edge lift with the strong edge norm)
The variable-degree space is the finite matching polynomial space with trace equality; the conformity lemma glues matching polynomial traces into ; and the corner count gives . (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)
Céa's theorem gives for the exact variational solution and its Galerkin solution , under its stated bounded-load, boundedness, coercivity, conformity, and Countable Choice hypotheses. (Céa quasi-optimality for coercive conforming Galerkin problems)
Cauchy–Schwarz controls one-dimensional trace errors and the area estimates on the regular triangles. (Cauchy–Schwarz: , with equality exactly for dependent pairs)
Proof
Fix 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 each cap contains at most one corner; its diameter is at most . On a noncap cell with , the mesh condition gives , so [F1] gives uniform scaled analytic derivative bounds after subtracting a suitable constant. If , the compact-away-from-corners bounds in [F1], together with bounded and the fixed , give the same conclusion after enlarging constants. Thus each noncap reference pullback has derivative bounds , where .
For every mesh edge incident to a polygon corner, prescribe the linear interpolant of the two endpoint values of the continuous representative of . All cells sharing such an edge are caps. On every other edge , prescribe the single common endpoint-preserving derivative-projection polynomial 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, for each adjoining noncap cell, with comparable scales on both sides. Here the sup bound follows from the endpoint identity and 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 at the corner is used. Every edge polynomial takes the value of at both endpoints. If , these endpoint values and the entire prescribed edge polynomial are zero.
Let be a noncap triangle and choose by transporting the analytic approximation [F2] for the scaled pullback, then adding back its subtracted constant. Thus . Correct its three vertex values by an affine polynomial to obtain matching the prescribed at all vertices; the correction has seminorm at most . On each edge, has zero endpoints, degree at most , and strong edge derivative norm at most . Lift these three residuals separately by [F3]. Their sum does not change the other edge traces, so the resulting has all three prescribed traces and
Let be a cap at corner , with diameter ; for large it contains no other corner. Start with the affine interpolant of the three exact vertex values. By [F1], . Its two edges incident to already have the prescribed linear traces. On the opposite edge , every point has distance comparable to from , so the gradient bound in [F1] and Cauchy–Schwarz [F6] give . The interval derivative projection in [F2] is contractive, and the vertex estimate in [F1] gives the same bound for . This discrepancy vanishes at both endpoints; add its lift from [F3]. The resulting polynomial has all prescribed traces and . No regularity is used on a cap.
Every pair of adjacent local polynomials has common trace ; the boundary traces vanish on . Thus they assemble to by [F4]. Summing squared cell errors from steps 3.1 and 3.2 over at most cells gives for some , because and . The finitely many earlier meshes are handled by and an increase of . Since by [F4], and therefore .
Under the additional Galerkin hypotheses, satisfies for every , and the Galerkin solution satisfies for every . Thus Céa [F5] applies to this same and . Apply it to the best-approximation estimate of step 4.1. Norm equivalence between and the gradient seminorm changes only the stated constant, and the actual factor is retained. This proves the energy-error conclusion.
Depends on
- Variable-degree conforming hp spaces on matching affine meshes
- A degree-uniform polynomial edge lift with the strong edge norm
- Analytic derivative bounds give exponential polynomial approximation on a triangle
- Weighted analytic polygon functions have corner decay and scaled analytic bounds
- Uniform-degree polygon corner spaces have cubic degree-of-freedom growth
- Matching variable-degree polynomial traces give an H1 function
- Céa quasi-optimality for coercive conforming Galerkin problems
- Cauchy–Schwarz: $|\langle x,y\rangle|\le\|x\|\,\|y\|$, with equality exactly for dependent pairs
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
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
- Yanchen He, Paul Houston, Christoph Schwab, and Thomas P. Wihler, Exponential Convergence of hp-ILGFEM, version 1 (standard reference, not scraped)
- Martin Vohralík, Finite Element Methods, Chapter 6: hp finite elements (standard reference, not scraped)