Alphabeta Math
LemmaStatement: 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.

Kernel, range, and mean-zero inverse for the no-flux Laplacian

Statement

Use either connected no-flux realization in No-flux finite-volume and conforming realizations for phase fields. In its finite-volume branch, assume the interior cell graph is connected; in its interval conforming branch, assume N≥1. Write uˉh=⟨uh,1⟩h/⟨1,1⟩h and Xh,0={uh:uˉh=0}. Then Ah is self-adjoint and nonnegative, ker⁡Ah=span⁡{1}, and ran⁡Ah=Xh,0. The restriction Ah:Xh,0→Xh,0 is positive definite and invertible. Define Ah†uh by first projecting uh onto Xh,0 and then applying this self-adjoint positive inverse. For each fixed finite mesh there is Ch<∞ such that ∥uh−uˉh1∥h2≤Ch⟨Ahuh,uh⟩h. For a one-cell mesh, Xh,0={0} and the inequality is vacuous.

Facts & Assumptions

Given: A finite-dimensional real inner-product space and one of the two connected no-flux realizations in the statement.

[F1]

No-flux finite-volume and conforming realizations for phase fields: in the cell branch, ⟨Ahu,v⟩h=∑F=K∣LTF(uK−uL)(vK−vL) with TF>0; in the interval branch, ⟨Ahu,v⟩h=∫0Lu′v′ dx on continuous piecewise-affine functions.

[F2]

For a nonempty subset of Rn with n≥1, compactness, closedness and boundedness, pseudocompactness, and attainment of extrema by every continuous real-valued function are equivalent: every continuous real-valued function on a nonempty compact subset of a finite-dimensional Euclidean space attains its minimum.

Proof

1.1F1givenalgebra

The displayed bilinear form in [F1] is symmetric, so Ah is self-adjoint. Its quadratic form is a sum of positive transmissibility-weighted squared jumps in the cell branch and is ∫0L∣uh′∣2 in the interval branch, so it is nonnegative. If it is zero, every interior jump vanishes in the cell branch, and connectedness makes all cell values equal; in the interval branch the derivative is zero on every segment, and continuity makes the function constant. Conversely, constants have zero quadratic form. Thus ker⁡Ah=span⁡{1}.

2.1step 1.1algebra

Self-adjointness implies ran⁡Ah⊆(ker⁡Ah)⊥: for z=Ahx and c∈ker⁡Ah, ⟨z,c⟩h=⟨x,Ahc⟩h=0. Rank-nullity gives dim⁡ran⁡Ah=dim⁡Xh−dim⁡ker⁡Ah=dim⁡(ker⁡Ah)⊥, so equality holds. The orthogonal complement of the constants is exactly Xh,0.

3.1step 1.1step 2.1algebra

The restriction of Ah to Xh,0 maps into Xh,0 and has trivial kernel by step 1.1. It is therefore bijective on this finite-dimensional space. Hence each mean-zero source has a unique mean-zero inverse, and projecting an arbitrary source onto Xh,0 defines Ah†.

4.1F1step 1.1step 3.1algebra

On Xh,0 the restriction of Ah is self-adjoint positive definite by step 1.1. If x,y∈Xh,0, write x=Ahs and y=Aht with s,t∈Xh,0; then ⟨Ah†x,y⟩h=⟨s,Aht⟩h=⟨Ahs,t⟩h=⟨x,Ah†y⟩h, so its inverse is self-adjoint. Also, for nonzero x=Ahs, ⟨Ah†x,x⟩h=⟨s,Ahs⟩h>0.

5.1F1F2step 1.1algebra∎

If Xh,0={0} the claimed inequality is immediate. Otherwise its unit sphere is compact and nonempty. The continuous quadratic form uh↦⟨Ahuh,uh⟩h attains a minimum there by [F2]. The minimum is positive, since a zero value would put a unit mean-zero vector in the constant kernel from step 1.1. Calling the minimum λh>0, homogeneity gives ∥uh−uˉh1∥h2≤λh−1⟨Ahuh,uh⟩h.

Depends on

Used by

Dependency tree · two levels

11 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