Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 2026-09-27
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.

Elementary expansions and collapses of finite CW complexes

Definition

Let X be a finite CW complex and let n≥1. Write Dn={x∈Rn:∣x∣≤1} for the closed unit ball, Sn−1=∂Dn for its boundary sphere, and D+n−1={(x,t)∈Sn−1:t≥0} for a closed upper hemisphere of Sn−1.

An elementary expansion of X of dimension n is an inclusion X↪Y of CW complexes together with a homeomorphism Φ:(Dn,D+n−1)→(Qn,Qn−1) of ball pairs and a continuous map φ:Qn→Y such that

  • φ is a characteristic map for a new n-cell en=φ(Qn∖∂Qn),
  • φ∣Qn−1 is a characteristic map for a new (n−1)-cell en−1=φ(Qn−1∖∂Qn−1),
  • the remaining boundary is old: φ(∂Qn∖int⁡Qn−1)⊆X, and
  • Y=X∪en−1∪en as a CW complex, with X a subcomplex.

The new (n−1)-cell is called the free face of the new n-cell. The restriction of φ to Qn−1 maps its interior homeomorphically onto en−1 and maps its boundary into X; it need not be a homeomorphism onto the closed cell, whose attaching map may identify boundary points. The complementary boundary of Qn maps into X. In particular, an attachment of only one n-cell to a complex already containing the alleged free face is not an elementary expansion under this definition.

We say that Y collapses to X by an elementary collapse and write Y↘X when X↪Y is an elementary expansion; the elementary collapse is the inverse formal operation removing the pair (en−1,en). A finite sequence of elementary expansions and elementary collapses, each performed relative to the cells retained by the previous steps, is a formal deformation; when every cell of a subcomplex X0 is retained throughout, the deformation is written relative to X0, and the operations are then said to fix the retained subcomplex. The one-cell case n=1 attaches a new vertex and a new edge joining it to an old vertex, the new vertex being the free face.

Depends on

Used by

Dependency tree · two levels

16 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