Alphabeta Math
RemarkRemark: Literature-sourcedProof: Not applicablePipeline-generated
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.

Regular homotopy allows self-intersections but never rank drop

Remark

A regular homotopy H:M×[0,1]→N of immersions requires every slice Ht to be immersive (Regular homotopy of immersions, Smooth families of maps and their evaluation maps): the rank of dHt is dim⁡M at every point of every slice (Immersions, submersions, and constant-rank maps), and no slice may contain a point of rank drop, a cusp of the parametrised family or a point whose derivative degenerates.

Self-intersections, by contrast, are permitted: an immersion may identify two distinct points x≠y with Ht(x)=Ht(y) as long as the differential is injective at each point. Their tangent images may coincide; transversality is not required by the immersion condition. During an eversion of S2 in R3 the slices must acquire self-intersections and cannot be embeddings (Sphere eversion cannot be an isotopy through embeddings), while no slice may have a rank drop, so the two phenomena are logically independent.

For a fixed smooth map, the set of source points where its differential has full rank is open (The immersion and submersion loci are open). This is a statement about the source, rather than about a topology on a space of maps. A smooth family is a regular homotopy exactly when every slice is an immersion; immersive slices for t<1 do not guarantee an immersive final slice.

Depends on

Used by

Dependency tree · two levels

22 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