Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck pass
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.

The Smale–Hirsch immersion theorem

Statement

Assume the axiom of countable choice. Let Mm and Nn be smooth manifolds without boundary with m<n. Then the derivative map D:Imm⁡(M,N)⟶FImm⁡(M,N),f⟼(f,df), is a weak homotopy equivalence for the weak compact-open C∞ topology. Its relative parametric form is stated for compact parameter pairs Compact parameter pairs and relative families: a continuous family of formal immersions that is smoothly holonomic on the prescribed closed sub-parameter set Q can be deformed relative to Q to a continuous family of genuine immersions. Here smoothly holonomic means that the original data are smooth and holonomic on an open parameter neighbourhood of Q, as in that definition. A smooth family with this property admits a smooth relative deformation. Positive codimension is essential for the closed-source assertion.

Facts & Assumptions

Given: Countable choice, boundaryless Mm,Nn with m<n, and the compact parameter pair with original neighbourhood-holonomic relative data.

[F1]

Open-source derivative equivalence holds also in equal dimension, with compatible relative compact-parameter homotopies (Smale–Hirsch for open source manifolds).

[F2]

The normal disk-bundle reduction constructs genuine and formal restriction comparisons on the enriched normal-identification spaces, and proves their forgetful Serre lifting comparison with common fibre Aut⁡(E) (Positive-codimension thickening reduces closed sources to the open case).

[F3]

The weak equivalence includes every component and every based homotopy group (Weak homotopy equivalence). Finite relative parameter lifting is Finite relative homotopy lifting across a weak equivalence, and the countable-choice finite parameter model is A handle decomposition gives a relative CW complex. Statement (iv) of Immersion extension on a disk: absolute and relative parametric forms is the compact-source neighbourhood-pair transfer, including interval factors and smooth relative output. It applies to the compact closed source components below; the open components use [F1].

Proof

technique · direct open/closed comparison and normal-identification fibration descent
1.1F1F2given

For a connected noncompact source, [F1] applies because such a boundaryless component is open in the no-compact-component sense. Suppose the connected source is closed. For any fixed normal-bundle type E of rank n−m>0, its open disk-bundle interior has dimension n and every component is noncompact. Apply [F1] there. The dimension-preserving collar and enriched restriction comparisons of [F2] show that the derivative map on the enriched spaces IE→FE is a weak equivalence.

2.1F2F3step 1.1

The enriched spaces are not ordinary formal components. Their forgetful maps over the loci of normal type E are Serre fibrations, with fibre the actual isomorphisms E≅ν, which after one identification form Aut⁡(E). The derivative induces the identity on that common fibre. The exact-sequence and component-action comparison in [F2] therefore descends the enriched equivalence to the ordinary locus, at every genuine basepoint. Every formal component meets some such locus, taking E to be the datum's own normal bundle; all compact based homotopies and paths in that locus have their identifications transported by the forgetful lifting comparison. This accounts for their monodromy rather than discarding the identification fibre. Consequently the ordinary closed-source derivative map is a weak equivalence on all components and at every basepoint.

3.1F1F3step 1.1step 2.1

For disconnected M, its second-countable component set is at most countable. The weak mapping spaces are products over source components: every tested compact source set meets only finitely many components. Componentwise maps and homotopies therefore compute homotopy groups and components of the product. The component comparisons of steps 1.1–2.1 give all higher isomorphisms, and countable choice gives the product component bijection. Empty sources give singleton spaces. Thus the ordinary derivative map is a weak equivalence for all the stated sources.

4.1F1F2F3step 1.1step 2.1step 3.1construct∎

Fix one compact collared parameter neighbourhood R with Q⊂int⁡R⊂R⊂W, where the original data on W×M are smooth and holonomic. For every closed source component X, compactness and the ordinary derivative weak equivalence of steps 1.1–2.1 satisfy exactly the compact-source transfer hypothesis in [F3]. It gives a formal deformation to genuine families, fixed on R before smoothing and hence fixed on a common smaller neighbourhood of Q afterward; smooth original data give a smooth deformation. The finite pair model of (P,R) can be fixed once for all these components. For each noncompact source component apply the direct relative construction of [F1], fixing that same smaller parameter neighbourhood. The at-most-countably many component constructions may be selected by countable choice. Their product homotopy is weakly continuous because every compact source set meets finitely many components; smoothness is local on those open components. This proves the relative conclusions on all of M. The compact-source transfer is applied only after ordinary weak equivalence is established by the normal-identification fibration descent, so varying normal-bundle identifications and their monodromy are retained.

Depends on

Used by

Dependency tree · two levels

93 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