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

Uniform-degree polygon corner spaces have cubic degree-of-freedom growth

Statement

For k≥1, let a matching triangulation Tk of a polygon have at most C0k triangles. Assign a uniform total polynomial degree pk≥1 with pk≤C1k. The algebraic space of continuous piecewise Ppk functions has dimension

Nk≤C2k3,

where C2 depends only on C0 and C1. The same upper bound holds for any subspace imposing homogeneous boundary traces. This is an upper count only; it asserts no hp approximation rate.

Facts & Assumptions

Given: Integer k≥1, a matching triangulation Tk with #Tk≤C0k, and uniform degree 1≤pk≤C1k.

[F1]

Variable-degree conforming hp spaces on matching affine meshes: the continuous polynomial space is a linear subspace of the broken product of its cell polynomial spaces.

Proof

1.1F1givenalgebra

On a triangle, monomials xiyj with i,j≥0 and i+j≤pk form a basis of Ppk. Counting by total degree gives dim⁡Ppk=∑r=0pk(r+1)=(pk+1)(pk+2)/2.

2.1F1step 1.1givenalgebra∎

The broken product over Tk therefore has dimension #Tk(pk+1)(pk+2)/2. By [F1], trace matching and any zero-boundary conditions define a linear subspace, whose dimension cannot exceed the broken dimension. Using #Tk≤C0k and pk≤C1k, and k≥1, gives Nk≤C0k(C1k+1)(C1k+2)/2≤C2k3 for an explicit finite C2 depending only on C0,C1.

Depends on

Used by

Dependency tree · two levels

2 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