Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

Broken and conforming polynomial spaces on a matching mesh

Definition

Let T be a matching affine simplicial mesh of Ω as defined in Matching affine simplicial meshes and shape regularity. Fix k∈N0, K∈{R,C}, and an integer q≥1. On each cell let Pk(K;Kq) denote the restrictions to K of Kq-valued polynomials of total degree at most k. The broken polynomial space is the finite product Vhbr:=∏K∈TPk(K;Kq), viewed as functions defined almost everywhere cell by cell. For an interior facet F=K∩K′, the jump is the difference of the two polynomial traces, with either fixed ordering of K,K′; its vanishing is independent of that ordering. The conforming polynomial space is Vhconf:={v∈Vhbr:v∣F,K=v∣F,K′ on every interior facet F}. The zero-boundary subspace consists of those v∈Vhconf whose polynomial trace is zero on every boundary facet. These are algebraic definitions. The Sobolev inclusions and the zero-boundary closure conclusion are proved separately in the corresponding local theorems on matching piecewise polynomials and zero-boundary values. If T=∅, then Ω=∅ by the mesh definition; the empty product is the zero vector space consisting of the unique empty function, and the trace conditions are vacuous.

Depends on

Used by

Dependency tree · one level

1 result within one dependency step 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