Alphabeta Math
ExampleConstruction: AI-adaptedVerification: 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.

A parabolic shear has certified linear geometry approximations

Example

Assume Countable Choice. On [−1,1]2, the exact shear Φ(x,y)=(x,y+x2/4) maps each straight reference edge to a straight or parabolic arc. Its determinant is 1. On any shape-regular affine mesh, the nodal P1 geometry map satisfies e0≤Ch2, e1≤Ch, and Jh≥1/2 for small enough h. Consequently its Laplace tensor differs from the exact pulled-back tensor by at most Ch in L∞.

Facts & Assumptions

Given: Countable Choice; a matching shape-regular affine triangulation of the square and the map Φ(x,y)=(x,y+x2/4).

[F1]

Curved-domain geometry approximation errors: admissible cellwise geometry maps have matching traces, positive Jacobians and common image topology; e0,e1 measure their uniform value and derivative errors, and boundary-trace compatibility must be stated separately.

[F2]

P1 approximation of a parabolic shear map: under Countable Choice, the vertexwise P1 map Φh=(x,y+Ih(x2/4)) has e0≤Ch2, e1≤Ch, det⁡DΦh≥1/2 for small h, and is globally injective.

[F3]

Derivative geometry error controls the Laplace tensor defect: with both Jacobians bounded below by j∗>0 and both map derivatives uniformly bounded, derivative error e1 bounds the Laplace tensor gap by Ce1.

[F4]

A continuous bijection from a compact metric space onto a metric space carries open sets to open sets, so its inverse is continuous: a continuous bijection from a compact metric space to a metric space has continuous inverse.

[A1]

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

Verification

1.1givenalgebra

Differentiate Φ to obtain DΦ=(10x/21) and det⁡DΦ=1. The quadratic term makes the image of a nonvertical straight edge a parabolic arc, while vertical edges remain vertical.

1.2F1F2A1given

Apply [F2] on the shape-regular mesh to get the stated value error, derivative error, and positive-Jacobian certificate.

2.1F1F2F4A1givenstep 1.1step 1.2algebra

On each shared reference edge, the two affine traces of Ih(x2/4) agree at its endpoints and therefore agree everywhere on that edge. Thus Φh has matching traces; the exact map is globally smooth and has matching traces as well. On each boundary edge, Φh is the straight segment joining the exact images of its vertices. The vertical boundary traces agree exactly with Φ; on each horizontal boundary segment, Φh(x,±1)=(x,±1+Ih(x2/4)), so the boundary discrepancy is bounded by Ch2 from step 1.2. Compatibility here does not assert equality of the exact parabolic arcs and their straight approximations. By [F2], Φh is continuous and injective on the compact square, hence by [F4] is a homeomorphism onto its image, as is Φ. Its cell restrictions are invertible affine maps extending to neighborhood diffeomorphisms; the exact restrictions extend by the global shear. These facts verify matching and boundary-trace compatibility and common image topology in [F1].

3.1F3A1step 1.1step 1.2step 2.1algebra∎

Step 1.1 bounds DΦ uniformly, and step 1.2 gives ∥DΦh∥∞≤∥DΦ∥∞+Ch and determinant lower bounds J=1, Jh≥1/2. Apply [F3] cellwise, with the compatible maps from step 2.1, and substitute e1≤Ch from step 1.2. This yields ∥B−Bh∥∞≤Ch with constants uniform over the mesh family.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

25 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