Alphabeta Math
LemmaStatement: AI-adaptedProof: 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.

P1 interpolation scaling on uniformly curved cells

Statement

Assume AC and Countable Choice. In dimension two let K=Ψ(K~), where K~ is a shape-regular affine triangle of diameter comparable to hK, and Ψ extends to a C2 diffeomorphism on a neighborhood of K~‾. Assume ∥DΨ∥∞+∥DΨ−1∥∞+∥D2Ψ∥∞+∥JΨ−1∥∞ are uniformly bounded. Let v denote its continuous representative and set IKv=(IK~(v∘Ψ))∘Ψ−1, the mapped nodal P1 interpolant. For v∈H2(K), ∥v−IKv∥L2(K)≤ChK2∥v∥H2(K) and ∣v−IKv∣H1(K)≤ChK∥v∥H2(K), with C uniform over the family.

Facts & Assumptions

Given: AC and Countable Choice; a uniformly shape-regular affine triangle family; uniformly bi-Lipschitz C2 cell maps with bounded second derivatives and Jacobian inverse; and v∈H2(K).

[F1]

Local interpolation estimates on shape-regular affine meshes: under Countable Choice and, for automatic nodal boundedness, AC, on a shape-regular affine mesh, the nodal P1 interpolant of an H2 function has L2 error at most ChK2∣v∣H2 and H1 seminorm error at most ChK∣v∣H2.

[F2]

Admissible isoparametric curved cells: admissible maps are diffeomorphisms with positive Jacobian and uniform derivative and inverse bounds.

[F3]

AC is used for continuous-representative nodal evaluation in [F5] and its automatic nodal-boundedness application in [F1]; Countable Choice is used through [F1] and [F4] (The Axiom of Choice, The Axiom of Countable Choice (ACω)).

[F4]

C^k boundary flattening preserves local W^{k,p}: under Countable Choice, composition with a C2 diffeomorphism and its inverse having bounded derivatives through order two is bounded on local W2,2 spaces, with the weak derivatives given by the chain-rule polynomials.

[F5]

Sobolev threshold for Lagrange point evaluations on a reference simplex: under AC, in dimension d=2, point evaluation is bounded on W2,2 because 2>d/p=1, so the nodal values are defined for the continuous representative.

Proof

1.1F2F4F5givenalgebra

First apply [F4] to w=v∘Ψ on the interiors of the reference and curved cells. The maps extend to a C2 diffeomorphism on neighborhoods of the compact cell closures, and the stated derivative, inverse-derivative, and Jacobian bounds give w∈H2(K~) with ∥w∥H2(K~)≤C∥v∥H2(K). Now [F5] supplies the unique continuous representative v~ of w on K~‾, so its three reference-vertex values are defined. The function v~∘Ψ−1 is continuous on K‾ and represents v, by the inverse-composition part of [F4]. If g is any other continuous representative of v on K‾, then g∘Ψ is a continuous representative of w and equals v~ by [F5]; hence the representative on K is unique. Its values at the curved-cell vertices are exactly the pulled-back nodal values. Applying [F4] to the inverse map also gives the uniform L2 and H1 norm bounds needed when the interpolation error is pushed back to K.

2.1F1F5step 1.1given

Apply [F1] to w on the affine triangle K~. The mapped interpolant is exactly (IK~w)∘Ψ−1 because its three nodal values are those of v at the three image vertices. The affine estimates give ∥w−IK~w∥L2(K~)≤ChK2∥w∥H2(K~) and ∣w−IK~w∣H1(K~)≤ChK∥w∥H2(K~), using the assumed diameter comparability.

3.1F1F2F3F4F5step 1.1step 2.1∎

Push the error through Ψ−1 using step 1.1. The resulting uniform norm bounds are the two claimed estimates. AC is used in [F5] for the continuous representative and nodal evaluations, including the automatic nodal-boundedness application in [F1]; Countable Choice is used through [F1] and [F4].

Depends on

Used by

Dependency tree · two levels

29 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