Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck pass
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 TPFA Rellich compactness and physical weak gradients

Statement

Assume the Axiom of Choice. Let TPFA-admissible meshes also form a regular simplicial companion family, with homogeneous Dirichlet data and fixed 0<λ∗≤λK≤λ∗. If cell vectors vh satisfy sup⁡h∥vh∥Eh<∞, there are a subsequence and v∈H01(Ω) such that Πhvh→v strongly in L2(Ω), and the gradients of the conforming companions converge weakly to ∇v in L2.

There is also an explicit physical weak-gradient reconstruction. Let PK,F be the pyramid with vertex xK and base F‾, ignoring its measure-zero boundary. For F=K∣L put DF=PK,F∪PL,F, fix the normal n=nK,F, and define Ghv=dvL−vKdFnon DF. On a boundary pyramid put Ghv=−dvKnK,F/dK,F. These regions partition Ω up to null sets. Along the same subsequence Ghvh⇀∇v in L2(Ω;Rd), and ∥Ghvh∥22=d(∑F=K∣L∣F∣dF∣vL−vK∣2+∑F∈Fbdy∣F∣dK,F∣vK∣2)≤dλ∗∥vh∥Eh2. The dimension factor d is essential. This physical gradient differs from the face-copy bookkeeping gradient in the TPFA Definition; no identification of that separate copy space with Ω is asserted.

Facts & Assumptions

Given: AC, the stated refining meshes, positive coefficient bounds, and energy-bounded zero-boundary cell states.

[F1]

Orthogonal TPFA diffusion with harmonic face transmissibility gives dF=dK,F+dL,F and λ∗≤λFharm≤λ∗, so its energy is uniformly equivalent to the unweighted face energy.

[F2]

Finite-volume companions, mean tests and weak-gradient closure bounds companions in W01,2 and their L2 distance from cell states by ChDh,2. The subcritical W0 one p embedding into L2 gives compactness of H01→L2; reflexive weak subsequences are supplied by Reflexivity of Lp for one less p less infinity and Reflexivity is equivalent to weak subsequential compactness of bounded sequences. The gradient-closed-range argument is also proved in Weak compactness of bounded space-time Sobolev gradients.

[F3]

Finite-volume families with a regular simplicial companion gives convex cells, fans, a uniformly bounded face count and diam⁡K≤h.

[F4]

Under the assumed AC, The ultrafilter lemma, from the Axiom of Choice: every filter extends to an ultrafilter supplies the ultrafilter lemma, AC implies DC implies countable choice supplies DC and Countable Choice, and Hahn-Banach dominated extension theorem for real vector spaces supplies HB. Thus the choice hypotheses of both weak-subsequence suppliers in [F2] are discharged.

Proof

1.1F1givenconstructalgebra

Assign the interior face value vF=(dL,FvK+dK,FvL)/dF and the boundary face value zero. Then vF−vK=dK,F(vL−vK)/dF and vF−vL=−dL,F(vL−vK)/dF. Summing both incident terms gives Dh,2(v)2=∑F=K∣L∣F∣∣vL−vK∣2/dF+∑F∈Fbdy∣F∣∣vK∣2/dK,F. Thus [F1] bounds Dh,2 by λ∗−1/2∥v∥Eh.

2.1F2F4step 1.1given

By [F2], the companions are bounded in H01 and have a subsequence converging strongly in L2. Apply the space-time gradient-compactness lemma in [F2] to these companions as constant-in-time functions on (0,1), with p=2 and H=L2(Ω). It identifies the strong limit as some v∈H01 and gives weak convergence of the companion gradients to ∇v; testing against functions constant in time gives the spatial weak convergence. Their L2 distance from Πhvh tends to zero by h→0 and step 1.1. This proves the claimed strong state convergence and companion-gradient assertion.

2.2F1F3step 1.1algebra

Convexity and the cell point in the interior make each cell the union of its face pyramids with disjoint interiors. Orthogonality makes their volumes ∣PK,F∣=∣F∣dK,F/d, so ∣DF∣=∣F∣dF/d. Multiplying each squared reconstruction value by its physical region volume gives exactly the displayed norm identity, and [F1] proves its bound.

3.1F1F3step 1.1step 2.2algebra

Let ϕ be any smooth vector field on a neighborhood of Ω‾, and write ϕF for its face mean. The face-oriented finite sum ∑F=K∣L∣F∣(vL−vK)nK,F⋅ϕF−∑F∈Fbdy∣F∣vKnK,F⋅ϕF is exactly −∫ΩΠhv div⁡ϕ, by the divergence formula in each cell and face cancellation. Replacing each ϕF by the mean of ϕ over the corresponding diamond or boundary pyramid changes this sum by at most Ch∥∇ϕ∥∞∑F∣F∣∣ΔFv∣. Cauchy–Schwarz bounds that last face sum by Dh,2(v)(∑F∣F∣dF)1/2, taking boundary dF=dK,F. The second factor equals (d∣Ω∣)1/2. By step 2.2 the modified sum is ∫Ghv⋅ϕ. Hence the weak-gradient defect tends to zero.

4.1F2F4step 2.1step 2.2step 3.1∎

The norm bound in step 2.2 and [F2, F4], applied successively to the d scalar L2 coordinates, supply a weakly convergent subsequence of physical gradients. Steps 2.1 and 3.1 identify its distributional limit as ∇v. Smooth compactly supported tests determine the L2 field uniquely, so every weak subsequence on the extracted state subsequence has that limit, giving the asserted weak convergence.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

66 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