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.

p-surgery on a smooth m-manifold

Definition

Assume ACω (The Axiom of Countable Choice (ACω)). Let M be a smooth m-manifold, let 0≤p≤m−1 and q=m−p, so that q≥1, and let φ:Sp×Dq↪M be a framed embedded surgery sphere with image in the interior of M (Framed embedded surgery sphere). The p-surgery on M along φ, also called a spherical modification of type (p+1,q), is the smooth m-manifold Mφ obtained by removing the open tubular piece φ(Sp×int⁡Dq) and gluing in Dp+1×Sq−1 along the common boundary, using the identification induced by φ on Sp×Sq−1: Mφ=(M∖φ(Sp×int⁡Dq))∪φ∣Sp×Sq−1(Dp+1×Sq−1).

The two pieces are smooth manifolds with boundary sharing the boundary component Sp×Sq−1 under the identification induced by φ; the complement also retains ∂M. They are glued along collars of the shared component and the seam is smoothed by the signed collar charts also used along the boundary of a smooth handle attachment (Attaching a smooth handle with corner rounding, Collar neighborhood theorem). The smooth structure produced this way is independent of the auxiliary collar and smoothing choices up to a diffeomorphism supported near the seam; this is proved by the gluing lemma of this page, and it is the sense in which the construction is well defined (The surgery gluing has a canonical smooth structure up to diffeomorphism ↗).

The core sphere is φ0:Sp→M, φ0(x)=φ(x,0); it lies in the removed piece and is not a submanifold of Mφ. The belt sphere is {0}×Sq−1⊆Dp+1×Sq−1⊆Mφ, a closed embedded (q−1)-sphere with the normal data of the disk-factor decomposition (K handle core cocore attaching region and belt sphere). The glued-in disk factor has dimension p+1, while the whole piece has dimension (p+1)+(q−1)=m. The disk dimension is the index shift recorded by the trace construction of this page.

The boundary identification is the restriction of the supplied product embedding φ, whose derivative along the core induces the normal framing. Changing that embedding or its framing can change the surgery, but distinct normal framings need not give distinct boundary identifications or distinct diffeomorphism types. Nothing in the definition asserts that a framing exists for a given embedded sphere; that condition is the content of the framing lemma of this page.

When ∂M≠∅ the construction takes place in the interior of M and leaves ∂M unchanged: the removed piece lies in the interior and the glued-in piece meets ∂M in no point. The case p=m−1 (so q=1) replaces an open product neighbourhood Sm−1×(−1,1) by the two disks Dm×S0; the openness of the removed piece and the count of the disk factors are the point of the endpoint formula, which is computed on the B page. No case p=m is included, since then q=0 and the boundary being traded would be Sm×S−1; the range 0≤p≤m−1 excludes it, in accordance with the plan's binding repair.

The smooth structure and boundary conventions are those of Smooth charts, atlases, and structures with boundary, and diffeomorphism means diffeomorphism of smooth manifolds (Diffeomorphisms and local diffeomorphisms of manifolds). Countable Choice is used exactly where the cited collar and handle-attachment suppliers use it, that is, in the existence of the collars along which the two pieces are glued.

Depends on

Used by

Dependency tree · two levels

31 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