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.
MINI Stokes block-preconditioned spectral intervals
Statement
Assume Countable Choice and the hypotheses of Steady MINI Stokes pressure-mass Schur bounds. Precondition the steady MINI saddle system symmetrically with , using the convention of Symmetric saddle-point system, Schur complement, and block preconditioners. Put Every eigenvalue of the Cholesky-symmetrically preconditioned matrix lies in where has multiplicity (zero when the dimensions are equal). This interval is for the steady Stokes scaling ; it is not an iteration-count or solver-speed guarantee.
Facts & Assumptions
Given: Countable Choice, the steady MINI Schur bounds, and the spectrum formula for a symmetrically pressure-mass-preconditioned saddle system.
If the eigenvalues of the normalized Schur matrix lie in , the preconditioned saddle eigenvalues are , , and with multiplicity (Spectrum of a symmetrically pressure-mass-preconditioned saddle system).
The MINI steady Schur bounds are (Steady MINI Stokes pressure-mass Schur bounds).
The finite MINI spaces satisfy and (Local and global dimensions of the mini element).
Countable Choice is the only choice principle used in the supplier chain (The Axiom of Countable Choice ()).
Proof
The finite mesh contains a simplex, so [F3] gives and ; therefore both and have positive dimensions as required by [F1]. Congruence of [F2] by shows that the normalized Schur eigenvalues lie in Since is nonzero and is positive definite, [F2] also forces ; both endpoints are positive.
The derivative formulas and for show that the two eigenvalue branches map onto the two stated intervals. Applying [F1] therefore yields the displayed spectral enclosure and multiplicity.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
33 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
- Michele Benzi, Gene H. Golub, and Jörg Liesen, Numerical solution of saddle point problems (standard reference, not scraped)