Alphabeta Math
RemarkRemark: Literature-sourcedProof: Not suppliedPipeline-generated sources checked 2026-09-22 not proved here
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.

Recorded, not proved here. This statement is included so the library can refer to it honestly, with a citation to the literature. It is not proved anywhere in this library: the track that would prove it has not been developed here yet.

Critical images of proper local Fredholm restrictions are nowhere dense externally

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let f:MN be a Ch map of fixed Fredholm index m between Hausdorff second-countable real Banach manifolds (Countable base Banach manifold and smooth map), where h is a positive integer or and h>max{m,0}. Suppose WM is open, f(W) lies in a target chart, and on W the map has Fredholm normal form

(u,v)(u,g(u,v)),

where the kernel variable lies in a finite-dimensional space K, the obstruction component lies in a finite-dimensional space Q, and dimKdimQ=m (Local finite-dimensional reduction for a Fredholm map).

If CW is closed in M and fC:CN is proper, then

f(CCrit(f))

is closed and nowhere dense in N, where Crit(f)={xM:Df(x) is not surjective} and nowhere dense has the meaning in Nowhere dense, meagre, residual, and comeagre subsets of a topological space.

Remarks

This is the localized category consequence used in Smale's proof, not a separately numbered theorem there and not a local proof in this library.

Depends on

Used by

Dependency tree · two levels

23 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