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.

Matching variable-degree polynomial traces give an H1 function

Statement

Assume Countable Choice. On a finite matching affine simplicial mesh or a finite face-to-face affine tensor-box mesh, a piecewise polynomial scalar function whose two traces agree on every interior facet belongs to H1(Ω), and its weak gradient equals its ordinary cellwise polynomial gradient almost everywhere. The simplex degrees may vary by cell; the box degrees may also vary.

Facts & Assumptions

Given: Countable Choice; a finite matching mesh T of affine simplices or affine tensor boxes; a real-valued function v whose restriction to each cell is a polynomial of its assigned finite degree; equality of the two traces on every interior facet; and a test function φ∈Cc∞(Ω).

[F1]

Variable-degree conforming hp spaces on matching affine meshes: the mesh has finitely many cells, each cell restriction is a polynomial, and the conforming condition is equality of the polynomial traces on every whole shared facet.

[F2]

Continuous matching piecewise polynomials belong to W1p: under Countable Choice, a finite matching affine simplicial mesh with a single finite polynomial degree and matching traces gives a member of W1,2 whose weak gradient is cellwise.

[F3]

Divergence for finite piecewise C1 presentations: under Countable Choice, cellwise Gauss–Green holds for a finite piecewise C1 presentation, and the fluxes on a shared face cancel when the pieces are glued.

[F4]

A weak derivative is characterized by integration against compactly supported smooth tests, and H1=W1,2 consists of L2 classes with all first weak derivatives in L2. (Weak derivative of a locally integrable function, Integer-order Sobolev spaces and their norms)

Proof

1.1F1F2givenchoose

If the mesh is empty, its domain is empty by the mesh convention and the assertion is immediate. Otherwise, because the mesh and every local degree are finite, v and each cellwise first derivative gi:=∂i(v∣K) are bounded on each closed cell; a finite union then puts v,gi in L2(Ω). If the mesh is simplicial, set p∗=max⁡K∈TpK. Every restriction lies in Pp∗(K), and the trace-matching condition is unchanged. Applying [F2] at the single degree p∗ proves the claim on this branch.

1.2F1F3givenalgebra

Suppose the cells are affine tensor boxes. Fix a coordinate i. On each cell, apply [F3] to the smooth field vφei; its divergence is v ∂iφ+giφ. Sum the finitely many resulting identities. At an interior face the two outward normals are opposite, because the adjacent cell interiors lie on opposite sides of its supporting hyperplane; the common trace in [F1] therefore makes the two fluxes cancel. The boundary-face terms vanish since φ has compact support in Ω. Thus ∫Ωv ∂iφ=−∫Ωgiφ.

2.1F1F4step 1.1step 1.2algebra∎

By [F4], step 1.2 says that gi is the weak ith derivative of v. This holds for every coordinate i, and step 1.1 supplies v,gi∈L2; hence v∈H1(Ω) with the stated cellwise weak gradient. Together with the simplex branch of step 1.1 this proves the assertion for both mesh types.

Depends on

Used by

Dependency tree · two levels

33 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