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

Primal interface spaces and jump convention

Definition

For each i, let Wi be the vector space of local boundary nodal traces compatible with the fixed outer Dirichlet values, and set W=∏iWi (all interface copies independent). Let W^⊂W be the subspace whose nodal traces agree at every shared interface node; let R:W^→W be the inclusion. Choose a set of primal constraints, meaning finitely many linear functionals on local traces whose values are required to agree across their incident subdomains. Vertex values and normalized edge averages are examples. The partially assembled space W~ is the subspace of W satisfying those primal equalities, so W^⊂W~⊂W.

The remaining continuity equations are collected in a jump map B:W~→Rm with ker⁡B=W^. It may contain redundant rows. Fix the redundant-multiplier convention Λ:=range⁡B with its inherited Euclidean inner product: multiplier vectors are elements of this range, not arbitrary row-coordinate vectors modulo an unstated choice. Then BT is injective on Λ. For the PE26 two-dimensional estimate, all subdomain vertices are primal and the only remaining jump rows are nodal differences on open interface edges, each shared by exactly two subdomains.

An interface corner is primal whenever its value is among the selected primal functionals. An edge average on a side E is ∣E∣−1∫Evh ds, which is a finite sum of nodal values for a P1 trace. The two-dimensional bound below uses corner constraints; no edge-average bound is claimed there.

Depends on

Used by

Dependency tree · two levels

4 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