Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-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.

The reference-triangle Duffy map has the stated image and Jacobian

Statement

For the map D(r,s)=(r,rs) of The reference-triangle Duffy map from a vertex, the image of [0,1]2 is T={(x,y):0≤y≤x≤1}. On r>0 it has inverse (x,y)↦(x,y/x) and Jacobian determinant r; the edge r=0 maps to (0,0).

Facts & Assumptions

Given: The map D(r,s)=(r,rs) on the square [0,1]2.

[F1]

The reference-triangle Duffy map from a vertex: D(r,s)=(r,rs) and T={(x,y):0≤y≤x≤1}.

[F2]

Continuously differentiable maps, local inverses, and local diffeomorphisms: a map on an open Euclidean set is C1 when all components are differentiable with continuous derivative entries; a local inverse is the inverse of a bijective restriction.

[F3]

The Jacobian determinant of a square-dimensional C1 map is the determinant of its Jacobian matrix: the Jacobian determinant is the determinant of the derivative matrix.

Proof

1.1F1F2F3algebra

For an increment (h,k), D(r+h,s+k)−D(r,s)=(h,sh+rk+hk). The linear part (h,sh+rk) has matrix (10sr), while the remainder has Euclidean norm ∣hk∣≤(h2+k2)/2; divided by ∥(h,k)∥2=h2+k2 it tends to zero. Thus this is the total derivative. Its entries are continuous, so the polynomial extension is C1 on R2 by [F2]; its determinant is r by [F3].

2.1F1step 1.1givenalgebra∎

If 0≤r,s≤1, then 0≤rs≤r≤1, so D(r,s)∈T. Conversely, for (x,y)∈T with x>0, r=x and s=y/x lie in [0,1] and map to (x,y); when x=0, y=0 and every (0,s) maps to the vertex. For r>0, the displayed inverse is unique. This proves the image, inverse, and collapsed-edge claims.

Depends on

Used by

Cited to discharge well-definedness by The reference-triangle Duffy map from a vertex.

Dependency tree · two levels

24 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