Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6.1-sol)
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.

Dead-end components

Definition

Let F be a smooth cooriented codimension-one foliation of a boundaryless manifold M. A dead-end component is a compact embedded region N⊊M of ambient dimension with nonempty boundary, saturated by leaves of F, whose boundary is a union of leaves and whose positive transverse direction points inward at every boundary point. Equivalently, a positive transverse path starting in N cannot leave N. The equivalence follows in a boundary defining coordinate r≥0: inwardness gives dr(γ′)>0 at every boundary crossing, so a first exit is impossible; conversely an outward transverse vector gives a short exiting path. Compactness and the boundary charts make the boundary a finite union of compact leaves, as shown in A no-transversal leaf bounds a positive accessibility region with finite inward boundary ↗. A foliation with no such region is dead-end free.

Nonempty boundary excludes an entire connected component of a disconnected ambient manifold, where the inward condition would be vacuous. The definition is componentwise and is unchanged by replacing an existing region by its connected component with boundary. The open formulation in other treatments describes the interior of a trapping region; it is not used to assert a compact closure without proof.

Depends on

Used by

Dependency tree · two levels

14 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