Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-09-01
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 transversality homotopy theorem

Statement

Let f:MN be smooth and let ZN be a closed embedded submanifold. Then f is smoothly homotopic to a smooth map g:MN with gZ.

Facts & Assumptions

Given: A smooth map f:MN and a closed embedded submanifold ZN.

[L1]

A smooth map admits a finite-dimensional perturbation family whose evaluation map is a submersion, hence transverse to Z (A tubular target produces a submersive finite-dimensional perturbation family).

[L2]

Parametric transversality says that a smooth family transverse to Z has a dense set of transverse slices (Parametric transversality).

Proof

technique · direct
1.1

By [L1], choose an open ball BRm and a smooth family F:M×BN with F0=f such that the evaluation map F is transverse to Z.

L1givenchoose
2.1

By [L2], the set of parameters aB for which the slice g:=Fa is transverse to Z is dense in B. Choose such a parameter a.

L2step 1.1choose
3.1

Because B is an open ball containing 0, the straight segment ta stays in B for all tI. Therefore H:M×IN,H(x,t):=F(x,ta), is a smooth homotopy from f to g in the sense of [F1]. Thus f is smoothly homotopic to a smooth map transverse to Z.

F1step 1.1step 2.1algebra

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

13 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