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.
Nonlinear full-approximation multigrid — Examples
1 · Prerequisites
- Banach-Space Differential Calculus and Banach Manifolds
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Norms and Realification
- Complexification, Realification and Real Structures
- Conjugate Gradients, MINRES and Preconditioning
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Determinants of Matrices over a Commutative Ring
- Direct Matrix Factorisations: LU, Cholesky and QR
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Dimensional Normed Spaces and Riesz Lemma
- Foundations of the Real Numbers for Analysis
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Multigrid methods and complexity
- Nonlinear equations and Newton methods
- Nonlinear full-approximation multigrid
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Simple Field Extensions and the Construction of the Complex Numbers
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Fundamental Theorems of Calculus
- The Inverse and Implicit Function Theorems
- The Riemann Integral: Definition and Integrability
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
These examples compute the tau correction for a nonlinear reaction-diffusion discretization, show a fine-root failure when tau is omitted, verify the exact linear correction reduction on a two-dimensional matrix, and track the certified local contraction radius through a pitchfork bifurcation. Each calculation is finite-dimensional and uses the hypotheses stated on the companion A page. None asserts an arbitrary-start nonlinear FAS convergence result.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
The tau term recovers the restricted root in reaction Poisson
Statement
For the finite-difference semilinear reaction operator with , take , , , and the Galerkin coarse operator . For the manufactured fine root and , the tau correction is and the exact coarse branch returns , so the corrected fine iterate is still .
Facts & Assumptions
Given: The two residual maps, the transfers, , and .
Finite-budget nonlinear FAS two-grid cycle: the coarse target is , where , and the fine correction is .
An exact fine root is fixed by the FAS V/W cycle: if the smoother fixes the fine root and the exact coarse solver selects its restriction at zero defect, FAS leaves the root fixed.
Example
Given: Exact real arithmetic and the direct coarse root on the selected branch.
Verification
Direct multiplication gives and , so . The restricted iterate is , while .
The Galerkin coarse value at the restricted iterate is . Thus [F1] gives and the tau-corrected coarse right side is .
Since , the exact selected coarse solution is . Therefore and the fine correction leaves unchanged; the pre/post residual smoothers also leave it fixed because . This is the instance of [F2] with the actual tau value verified above.
Omitting tau can move an exact fine root
Statement refuted
The claim that replacing the tau-corrected coarse right side by the restricted fine right side always preserves an exact fine-grid root is false.
Facts & Assumptions
Given: The two-dimensional fine residual with , right side , prolongation , iterate restriction , residual restriction , and rediscretized coarse residual .
Finite-budget nonlinear FAS two-grid cycle: the FAS coarse right side includes and the prolongated update is .
An exact fine root is fixed by the FAS V/W cycle: with the tau-corrected right side and the selected zero-defect coarse root, an exact fine root is fixed.
Counterexample
Set . Then , so is an exact fine root. Its restriction is and the restricted right side is .
With tau omitted, the coarse equation is , whose exact solution is . The fine correction is which is not . Thus the false claim fails for this SPD fine system and this specified rediscretized coarse operator.
For the same inputs, the correct tau is , so the tau-corrected coarse right side is and its selected root is . The resulting correction is zero, in accord with [F2].
The certified FAS contraction radius shrinks at a pitchfork
Statement
For with zero right side, use the coarse space spanned by , iterate and residual restriction , coarse residual , and one pre- and one post-sweep . The exact-branch FAS cycle has root and derivative norm For each such , the local theorem certifies radius , which tends to zero as the pitchfork parameter approaches .
Facts & Assumptions
Given: , the two-dimensional fine residual, zero right side, the stated transfers and coarse residual, one pre/post smoother, exact coarse solve, and exact arithmetic.
Finite-budget nonlinear FAS two-grid cycle: the coarse target is and the correction is .
A smooth FAS cycle converges locally under its actual derivative bounds: if the actual exact-branch cycle has root derivative norm , derivative-Lipschitz constant on a radius- ball, and , then its iterates converge to the root from that ball.
On a convex open set, a uniform bound implies : a uniform derivative bound on a convex open set gives a Lipschitz bound there.
Second derivative formula for a composed cycle map: applying the second-derivative composition formula with identity middle map gives .
Example
Given: The scalar function , the radius , and the exact coarse branch.
Verification
Let . For any pre-smoothed , [F1] gives The exact coarse solution is , so prolonging sets the second fine coordinate to zero. The following post-sweep leaves it zero. Hence the actual cycle map is
Write and . For , and , . By [F4], , so these bounds give . The derivative matrix of is , so [F3] gives on the ball.
Since implies and , for the unique fine root is . Also , so differentiating the two sweeps gives
With , Thus [F2] applies on this ball. Its certified radius tends to zero as ; at , and the strict derivative hypothesis fails. For , the scalar equation has the additional roots , which is the pitchfork bifurcation.
A one-level linear FAS correction is the Galerkin correction
Statement
Take , , , , and the Galerkin coarse matrix . For any fine iterate and right side , the coarse FAS difference is exactly , and the prolongated update is the ordinary Galerkin coarse correction.
Facts & Assumptions
Given: The two-dimensional linear system, the specified transfers, exact coarse solution, and exact real arithmetic.
Finite-budget nonlinear FAS two-grid cycle: FAS solves the tau-corrected coarse equation and corrects by .
Linear FAS exactly reduces to a Galerkin correction V/W cycle: for a linear Galerkin hierarchy with , the full recursive FAS cycle is the same as the linear correction V/W cycle.
Example
Given: The matrix , prolongation , restriction , and residual restriction in the Statement.
Verification
Direct multiplication gives and . Write and . The FAS coarse target is The exact coarse solution is therefore .
Since , the coarse difference is and the fine update is the standard Galerkin correction. With matching residual-correction smoothers, [F2] identifies the full V/W iterate as well.