Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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 approximation of a parabolic shear map

Statement

Assume Countable Choice. Let Ω^=[−1,1]2, let Th be a matching shape-regular affine triangulation, and put Φ(x,y)=(x,y+x2/4). Let Ih be the vertexwise P1 interpolant and Φh(x,y)=(x,y+Ih(x2/4)). In the notation of Curved-domain geometry approximation errors, there is a constant C depending only on the shape-regularity bound such that e0≤Ch2 and e1≤Ch. For sufficiently small h, det⁡DΦh≥1/2, and Φh is globally one-to-one on the square. The exact map has det⁡DΦ=1 and a global inverse (X,Y)↦(X,Y−X2/4).

Facts & Assumptions

Given: Countable Choice; the square and a matching shape-regular affine triangulation with maximal diameter h.

[F1]

Matching affine simplicial meshes and shape regularity: triangle interiors are disjoint and shared boundaries are complete matching facets.

[F2]

Shape regularity controls affine simplex geometry: barycentric gradients on a shape-regular triangle satisfy ∣∇λi∣≤ChK−1.

[F3]

Curved-domain geometry approximation errors: e0 and e1 are the uniform value and derivative differences of exact and approximate geometry maps.

[A1]

Countable Choice is the explicit hypothesis of [F2] (The Axiom of Countable Choice (ACω)).

Proof

1.1givenalgebra

Direct differentiation gives DΦ=(10x/21) and determinant 1; the stated inverse is verified by substitution. On a triangle with barycentric coordinates λi and vertex first-coordinates xi, exact quadratic expansion gives Ih(x2/4)−x2/4=14∑i<jλiλj(xi−xj)2. Since ∣xi−xj∣≤hK and 0≤λi≤1, this is bounded by ChK2.

2.1F2F3A1step 1.1algebra

Differentiating the barycentric expression in step 1.1, only the factors λiλj vary; their derivatives are bounded by ChK−1 using [F2], while ∣xi−xj∣2≤hK2. The product rule therefore gives a derivative bound ChK. Thus ∥D(Ih(x2/4)−x2/4)∥L∞(K)≤ChK, yielding the global Ch derivative estimate and the Ch2 value estimate. By [F3] these are the geometry errors e1 and e0.

3.1F1step 2.1algebra∎

The first coordinate of Φh is x, and on each vertical segment its second coordinate is the continuous piecewise-affine function y+Ih(x2/4)(x,y). Its slope on every subsegment is 1+∂yIh(x2/4)≥1−Ch. Choose h with Ch≤1/2. Integration over the finitely many subsegments makes this coordinate strictly increasing with increment at least half the vertical increment. Equal images must therefore have equal first coordinates and then equal second-coordinate inputs; hence Φh is injective. The same derivative estimate gives det⁡DΦh=1+∂yIh(x2/4)≥1/2.

Depends on

Used by

Dependency tree · two levels

12 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