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.

No-flux TPFA diffusion generator

Definition

Let T=(K,F) be a finite TPFA-admissible cell-face mesh from Finite-volume cell-face meshes and geometric regularity and Orthogonal TPFA diffusion with harmonic face transmissibility. Impose homogeneous no-flux boundary conditions: boundary faces contribute zero flux and therefore no conductance. For adjacent cells K,L, set

cKL=∑F=K∣LTF,

where the sum is over their common interior faces and is zero when they are not adjacent. Set cKL=cLK and mK=∣K∣. If more than one face separates a cell pair, summing their conductances gives the same cell-balance flux as retaining the faces separately. Define the symmetric matrix Lh by (Lh)KK=∑L≠KcKL and (Lh)KL=−cKL for K≠L.

For species diffusivities dr≥0, the no-flux finite-volume diffusion equation is MUr′+drLhUr=0 for each species r, where M=diag⁡(∣K∣). Its component equation is

∣K∣(UK,r)′=dr∑L:cKL>0cKL(UL,r−UK,r).

The equality is the usual shared-face TPFA balance with outward flux TF(UK,r−UL,r) and no boundary flux. The matrix Lh is symmetric, has zero row sums and nonpositive off-diagonal entries, and obeys vTLhv=∑{K,L}cKL(vK−vL)2≥0, where the sum is over unordered adjacent cell pairs. With M=diag⁡(∣K∣), the generator −M−1Lh is self-adjoint in the weighted pairing ⟨v,w⟩M=vTMw. This definition makes no accuracy claim for arbitrary admissible meshes.

Depends on

Used by

Dependency tree · one level

2 results 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