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

Shape regularity controls affine simplex geometry

Statement

Assume Countable Choice. Let FK(x^)=bK+AKx^ map the fixed reference simplex S^d bijectively to a cell K of a shape-regular family, and let hK be its diameter and ρK its inradius. There are constants c,C>0, depending only on d, the reference simplex, and the shape regularity bound, such that chK≤smin⁡(AK)≤∥AK∥≤ChK,chKd≤det⁡AK≤ChKd. For each facet F, its affine surface Jacobian is comparable to hKd−1, and its altitude from the opposite vertex is comparable to hK. Thus Sobolev scaling constants can be expressed using hK alone, with constants uniform over the family.

Facts & Assumptions

Given: A nondegenerate affine simplex map, a fixed reference simplex, and the shape regularity bound hK/ρK≤σ.

[F1]

The reference simplex is fixed, with diameter DwidehatS<∞ and inradius rwidehatS>0; hK is the diameter and ρK the inradius of K. (Matching affine simplicial meshes and shape regularity)

[F2]

The oriented area element of an affine facet is n dS=det⁡(AK)AK−Tn^ dS^, so its surface Jacobian is JF=det⁡(AK)∣AK−Tn^∣ when det⁡AK>0. Affine Sobolev seminorms transform with the corresponding powers of AK and AK−1. (Gauss–Green formula on an affine simplex, Affine pullback of weak derivatives and Sobolev seminorms)

[F3]

The two affine change-of-variables suppliers used in [F2] assume Countable Choice. (The Axiom of Countable Choice (ACω))

Proof

1.1F1givenalgebra

Use a singular-value decomposition AK=UΣVT. If vmax⁡ is a unit right singular vector for smax⁡=∥AK∥, the reference inscribed ball contains two points separated by 2rS^vmax⁡; their images are separated by 2rS^smax⁡. Thus smax⁡≤hK/(2rS^). For a unit right singular vector vmin⁡ and corresponding left vector umin⁡, the width of K in direction umin⁡ equals smin⁡ times the width of the reference simplex in direction vmin⁡, which is at most smin⁡DS^. Every ball of radius t<ρK contained in K has width 2t in every direction, so letting t↑ρK gives 2ρK≤smin⁡DS^. Since hK/ρK≤σ, smin⁡≥2hK/(σDS^).

2.1step 1.1givenalgebra

Every singular value lies between chK and ChK by step 1.1. Their product is ∣det⁡AK∣=det⁡AK because the reference map is orientation preserving. Hence c′hKd≤det⁡AK≤C′hKd.

3.1F2F3step 1.1step 2.1algebra∎

For a reference facet normal n^, [F2] gives its physical surface Jacobian JF=det⁡(AK)∣AK−Tn^∣. The singular values of AK from step 1.1 are between chK and ChK, so ∣AK−Tn^∣ is between chK−1 and ChK−1. Together with the determinant bounds this gives chKd−1≤JF≤ChKd−1. The simplex pyramid identity ∣K∣=∣F∣HF/d gives HF=d∣K∣/∣F∣, so step 2.1 and these facet bounds show chK≤HF≤ChK. This proves all claimed geometric scalings.

Depends on

Used by

Dependency tree · two levels

15 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