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.

Finite-volume families with a regular simplicial companion

Definition

Let Ω⊂Rd be a nonempty bounded connected Lipschitz polyhedral domain, d≥1. A regular simplicial companion family consists of refining uniformly regular boundary-anchored cell-face meshes in Finite-volume cell-face meshes and geometric regularity, and, for each mesh, a matching simplicial subdivision Sh of its cell closures with the following finite geometric data and uniform constants c,C,J>0.

Each cell closure K‾ is the union of at most J closed nondegenerate d-simplices with pairwise disjoint interiors. Each simplex has diameter at most Ch and inradius at least ch, and the chosen cell point xK is a subdivision vertex. The subdivision of each cell closure is a fan from xK over a triangulation of its boundary, and subdivisions agree on shared faces. Each original face closure F‾ is a union of at most J closed subdivision facets. In dimension one these mean the two subintervals from xK to the endpoints.

For each subdivision vertex z, let K(z) consist of the original cells whose closures contain z. This set has at most J elements. For any K,L∈K(z) there is a path of at most J cells in K(z), from K to L, consecutive cells sharing an original face whose closure contains z. If z∈∂Ω, every K∈K(z) has such a path to a cell with a boundary face whose closure contains z. These are connectivity checks on finite vertex stars, not an assumption of an analytic inequality.

For shared face values vF, cell values vK, and homogeneous boundary values vF=0, define the piecewise constant state Πhv∣K=vK and Dh,p(v)p=∑K∑F⊂∂K∣F∣dK,F1−p∣vF−vK∣p(1<p<∞). The mean interpolator Ihv has cell and face values equal to the corresponding means of a Sobolev function, with face means interpreted by the simplex trace; for v∈W01,p(Ω) its boundary face means are zero. Define Ehv to be continuous and affine on each subdivision simplex, with nodal value ∣K(z)∣−1∑K∈K(z)vK at an interior vertex z and zero at a boundary vertex. Thus Eh is an explicit linear function of the cell values; its definition does not assume its stability.

These conditions allow nonorthogonal cells. A nonempty example in every dimension is the uniform cubical partition of (0,1)d, with cell centers, a fixed matching barycentric subdivision of every face, and the cones from cell centers to those face simplices. Scaling leaves finitely many simplex shapes and bounded vertex stars; coordinate adjacency connects each interior star and connects each boundary star to a boundary face. In dimension one use equal subintervals and their midpoints. Hence all the displayed constants can be chosen independently of refinement.

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