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.
Multigrid methods and complexity — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Absolute Continuity and the Sharp Fundamental Theorem of Calculus
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Areas of Elementary Plane Figures
- Banach Valued Integration and the Radon Nikodym Property
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Bounded Variation and the Riemann–Stieltjes Integral
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- Complex Norms and Realification
- Complexification, Realification and Real Structures
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- 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
- Countability Axioms and Cardinal Functions
- Cyclic Groups and Direct Products
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Differentiation of Monotone Functions and the Vitali Covering Theorem
- Direct Matrix Factorisations: LU, Cholesky and QR
- Distributions Test Functions and Differentiation
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Euclidean Surface Measure, Divergence, and Green Identities
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Fubini and Change of Variables
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hausdorff via the Diagonal
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Lax--Milgram and Weak Elliptic Solutions
- Lebesgue Measure on Euclidean Space
- 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
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Modes of Convergence Egorov and Lusin
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Multigrid methods and complexity
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Norming and Separation under Hahn–Banach
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Radon Measures and the Riesz Markov Kakutani Theorem
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Schwartz Space and the Plancherel Theorem
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Smooth Approximation and Sobolev Extension
- Smooth Partitions of Unity and Exhaustions
- Sobolev Traces and Zero Boundary Values
- Splitting Fields
- Subspaces, Products, and Quotients
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Analytic Hahn Banach Theorem
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Inverse and Implicit Function Theorems
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Maximal Function and Lebesgue Differentiation
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Derivatives and Sobolev Spaces
2 · Summary
The examples calculate a coarse correction that removes a piecewise-linear error exactly, expand the V- and W-cycle work recurrences for four-to-one coarsening, and check a finite Poisson mode against the uniform two-grid estimate. Every convergence claim uses the A-page hypotheses; arithmetic work and convergence remain separate.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
A linear error on the one-dimensional Poisson coarse space is removed exactly
Example
Consider the homogeneous weak Dirichlet form for on , in the sense of Weak Dirichlet solutions for a divergence-form operator and Uniformly elliptic divergence-form operators and their sesquilinear forms, and the uniform mesh with four fine intervals. The continuous piecewise-linear nodal basis has interior hat functions . Its stiffness matrix is
The coarser mesh has one interior node. Its piecewise-linear prolongation is . The vector is represented exactly on the coarse space, so one exact Galerkin correction removes it.
This calculation uses the homogeneous weak-form branch, whose functional-space interface assumes Countable Choice. It establishes the finite matrix identity without asserting solution existence for a forcing or a finite-element error estimate, and it makes no claim about inhomogeneous trace data.
Facts & Assumptions
Given: The interval , its zero-boundary weak Poisson form, the four-interval uniform mesh, and its continuous piecewise-linear nodal basis.
Weak Dirichlet solutions for a divergence-form operator: in the homogeneous branch, a weak solution is an class satisfying for every test function; that branch assumes Countable Choice. Only the definition of the weak form is used here, not an existence theorem.
Uniformly elliptic divergence-form operators and their sesquilinear forms: with coefficient and , the form is in the real case.
Galerkin coarse matrices and the exact coarse-correction error map: and when is invertible.
Continuous piecewise-affine functions with zero endpoints lie in H1-zero: each continuous piecewise-affine function on vanishing at and belongs to .
Assume The Axiom of Countable Choice () for the homogeneous Sobolev interface in [F1]. The finite matrix calculation uses this homogeneous branch.
Verification
Each fine nodal hat is continuous piecewise affine and zero at both endpoints, so [F4] places it in , the test space in [F1] under [A1]. On each interval its derivative is constant. For , the integral receives from each of its two adjacent intervals, giving ; for adjacent indices, the shared interval contributes ; nonadjacent supports have zero derivative-product integral. Thus the matrix of is the displayed .
With , direct multiplication gives and . Therefore [F3] gives , which maps to .
For , step 2.1 yields . The error is exactly the prolongation of its single coarse value , so the exact coarse correction removes it.
V- and W-cycle work under two-dimensional four-to-one coarsening
Example
Assume a two-dimensional hierarchy with levels of sizes , so the finest level has unknowns and each coarsening step reduces the size by four. Suppose each level has constant work per unknown, the base solve has bounded positive cost, and the cycle is as in Finite recursive Galerkin V- and W-cycle for an SPD hierarchy. The V-cycle has one coarse call; the W-cycle has two. Both have arithmetic work under these hypotheses, with different geometric sums.
Facts & Assumptions
Given: Integer , level sizes for , , per-level work with , a bounded positive coarsest solve, and the V/W call counts .
Work recurrence for fixed-coarsening multigrid cycles in all three regimes: for , work is when .
Verification
For the V-cycle, . Repeated substitution gives The sum lies between and , and , so . This is also the case of [F1].
For the W-cycle, , so The sum lies between and , while ; consequently both terms are and the first is a positive lower bound. Hence , agreeing with [F1] because .
One high-frequency mode in the finite one-dimensional Poisson two-grid cycle
Example
Use the four-interval mesh from the homogeneous weak Dirichlet Poisson form on and the exact piecewise-linear coarse correction. Here , where , and . For the error , the coarse correction leaves the vector unchanged, while one Richardson sweep with step damps it by . The symmetric two-grid error map therefore sends this particular mode to . The level-uniform theorem bounds the full operator norm by for one sweep, not merely this single mode.
The calculation uses the homogeneous weak-form convention and makes no claim about solution existence or finite-element discretization error.
Facts & Assumptions
Given: The homogeneous weak Dirichlet Poisson form on , the four-interval fine mesh with , , coarse prolongation , the error , and one Richardson sweep.
Weak Dirichlet solutions for a divergence-form operator: the homogeneous weak Dirichlet problem uses and the form identity against every test function; this branch assumes Countable Choice.
Uniformly elliptic divergence-form operators and their sesquilinear forms: for the real Poisson coefficients , , the form is .
Galerkin coarse matrices and the exact coarse-correction error map: and when is invertible.
The symmetric two-grid error map from a pre-smoother and Galerkin correction: the symmetric cycle map is .
The symmetric 1D Poisson two-grid cycle is uniformly contractive: the symmetric 1D Poisson map has for every and every even .
Continuous piecewise-affine functions with zero endpoints lie in H1-zero: each continuous piecewise-affine function on vanishing at and belongs to .
Assume The Axiom of Countable Choice () for the homogeneous Sobolev interface in [F1]. This example uses the homogeneous branch and makes no inhomogeneous trace claim.
Verification
The fine nodal hats are continuous piecewise affine and vanish at both endpoints, so [F6] puts them in the homogeneous test space of [F1] under [A1]; [F2] then gives their form as . Direct determinant expansion gives so , while direct multiplication gives . Thus one pre-sweep sends to .
Direct multiplication gives and . Hence and , since the middle component of is zero. Since is symmetric and commutes with , its -adjoint equals . Thus [F4] gives .
Since (equivalently after multiplying by positive quantities and squaring), this mode is damped by less than . [F5] with bounds the full energy operator norm by , including every fine-grid mode.