Alphabeta Math
DefinitionDefinition: AI-adaptedProof: 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.

Finite-volume cell-face meshes and geometric regularity

Definition

Let d≥1 and let Ω⊂Rd be a nonempty bounded connected open polyhedral set, meaning the interior of a finite union of bounded closed convex polytopes. A closed convex polytope is a bounded intersection of finitely many closed half-spaces with nonempty interior. A cell-face mesh T=(K,F) consists of finitely many nonempty cells K=int⁡PK⊂Ω, where each PK is a closed convex polytope, with pairwise disjoint interiors and Ω‾=⋃K∈KK‾, together with the relative interiors of the (d−1)-dimensional faces of their closures. Each interior face F∈Fint is incident to exactly two cells K,L and is denoted F=K∣L; each boundary face F∈Fbdy is incident to one cell and is contained in ∂Ω. In dimension one a face is an endpoint and has measure ∣F∣=1.

Write ∣K∣ for the d-dimensional volume of K, ∣F∣ for the (d−1)-dimensional measure of F, nK,F for the unit normal outward from K, xK for a chosen point in K, and xF for the centroid of F. For every incident pair set dK,F=dist⁡(xK,F)>0. The cell adjacency graph has one vertex for each cell and an edge for each interior face. A mesh is boundary anchored if every cell has a finite path in this graph to a cell incident to a boundary face; such a path can be chosen simple, with no repeated cells.

For a family (Th), put h=max⁡K∈Kdiam⁡K. The family is uniformly regular if there are fixed constants c,C>0 and N0∈N such that, for every mesh and each of its cells and faces, chd≤∣K∣≤Chd,chd−1≤∣F∣≤Chd−1,ch≤dK,F≤Ch, and each cell has at most N0 faces. A family is refining if h→0. These bounds are invoked only where explicitly assumed; a cell-face mesh alone is not asserted to be uniformly regular or orthogonal.

The finite-volume convention is that a face flux QK,F is signed outward from K. If F=K∣L is an interior face, local conservation requires the single shared-flux identity QK,F+QL,F=0. The mesh drawing below labels the center-to-center vector and the outward normal; no orthogonality is part of this general mesh definition.

KLF=KjLxKxLxL¡xKnK;FnL;F

The cell-face mesh definition and the diagram fix only the objects, incidences, normals, and orientation. A two-point flux approximation adds a separate orthogonality condition; the hybrid mimetic method is formulated on the general cell-face geometry specified here.

Used by

Dependency tree · 0 levels

Nothing. This result depends on no other item in the library.

Sources