Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck passjudge 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.

Discrete Poincaré inequality from boundary paths

Statement

Let T be a finite boundary-anchored TPFA mesh and let Te>0 be its interior and boundary transmissibilities. A boundary path family assigns to each cell K a finite simple path γK of adjacent interior faces, followed by one boundary face of its terminal cell; simple means it visits no cell more than once. Set Δeu=uK−uL on an interior face e=K∣L with a fixed orientation, and set Δeu=uK on a boundary face of K. The sign of an interior increment is reversed when the path traverses the fixed orientation backward. Put SK=∑e∈γKTe−1,Cpath=max⁡e∑K:e∈γK∣K∣SK. Then every cell vector u satisfies the discrete Poincaré inequality ∑K∈K∣K∣uK2≤Cpath∑eTe(Δeu)2=Cpath∥u∥Eh2. Consequently, any uniformly regular mesh family supplied with boundary path families whose Cpath are uniformly bounded has a mesh-uniform Poincaré constant. This theorem does not assert that every orthogonal mesh family has such a uniform path bound.

Facts & Assumptions

Given: A finite cell-face mesh, positive interior and boundary transmissibilities, a specified boundary path from every cell, and the finite value Cpath above.

[F1]

Finite-volume cell-face meshes and geometric regularity: each cell has a finite boundary path in a boundary-anchored mesh, and ∣K∣ is its volume.

[F2]

Orthogonal TPFA diffusion with harmonic face transmissibility: the transmissibility energy is ∥u∥Eh2=∑eTe(Δeu)2, with boundary increment uK because the Dirichlet boundary value is zero.

[A1]

For each cell K, a particular finite path γK is included as data; SK and Cpath are finite.

Proof

1.1F1A1givenalgebra

Fix a cell K. Traverse its supplied path to a boundary face. The signed increments telescope from uK to the terminal boundary value 0, so uK=∑e∈γKϵK,eΔeu, where each ϵK,e∈{−1,1} records the orientation.

2.1F2step 1.1algebra

Weighted Cauchy–Schwarz with weights Te gives ∣uK∣2≤(∑e∈γKTe−1)(∑e∈γKTe(Δeu)2)=SK∑e∈γKTe(Δeu)2.

3.1A1F2step 2.1algebra∎

Multiply step 2.1 by ∣K∣ and sum over all cells. Since the mesh, edge set, and paths are finite, reorder the sums to obtain ∑K∣K∣uK2≤∑eTe(Δeu)2∑K:e∈γK∣K∣SK≤Cpath∑eTe(Δeu)2. The last sum is the energy norm in [F2], proving the assertion.

Depends on

Used by

Nothing in the library uses this result yet.

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