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.
Sard--Smale residual regular values for Fredholm maps
Statement
Let be a Fredholm map of index between countable-base Banach manifolds. If , its regular values form a residual subset of .
Facts & Assumptions
Given: Such a Fredholm map with .
Fredholmness means finite kernel and cokernel, closed range, and locally constant index (Fredholm maps and regular values on countable-base Banach manifolds).
Residual means complement of a meagre set (Nowhere dense, meagre, residual, and comeagre subsets of a topological space).
The finite-dimensional Sard theorem gives null critical values at its stated differentiability threshold (Morse-Sard for Euclidean maps).
Proof
At each , the finite-dimensional kernel and cokernel in [F1] permit the standard local Lyapunov--Schmidt reduction of to a map between finite-dimensional spaces whose source-target dimension difference is .
Fredholm maps are locally proper on suitable closed neighbourhoods. Using the countable bases, choose countably many such neighbourhoods covering . On each , Lyapunov--Schmidt reduction and [F3] show that the image of the critical set has empty interior; properness makes that image closed, hence nowhere dense.
Every critical value belongs to one of these countably many nowhere-dense images. Their union is meagre, so [F2] makes its complement residual; every point of that complement is a regular value of .
Depends on
Used by
Dependency tree · two levels
10 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
- Stephen Smale, An Infinite Dimensional Version of Sard's Theorem, Theorem (1.3) (standard reference, not scraped)