Alphabeta Math
DefinitionDefinition: 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.

Smooth cobordism triad for Morse theory

Definition

A smooth cobordism triad (W;M0,M1) consists of the following data.

For n=0, the convention is ∂W=M0=M1=∅: a zero-dimensional manifold has discrete point charts and empty boundary. The two collar domains are empty and their unique maps supply the collar data. No manifold of dimension −1 is introduced. Reversal retains the same empty faces.

The two faces are the incoming face M0 and the outgoing face M1; they are disjoint by the decomposition ∂W=M0⊔M1 fixed by the data. Each face is a union of boundary components and need not be connected. Either face may be empty: ∂W=∅ with M0=M1=∅ is allowed, and so is M0=∅, M1=∂W. All smooth maps between manifolds with boundary are the ones of Smooth maps between manifolds with boundary, and all diffeomorphisms below are diffeomorphisms of that category.

The reversed triad of (W;M0,M1) is (W;M1,M0): it carries the same manifold W with the two faces exchanged and with the same fixed collars, read with the opposite roles.

No orientation is required, and an orientation, when present, is extra structure: no statement on this page uses one unless it is listed among the hypotheses.

Depends on

Used by

Dependency tree · two levels

27 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