Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

The boundary of a bounded contractible Lipschitz polyhedron is connected

Statement

Assume AC. A nonempty bounded contractible Lipschitz polyhedron Ω⊂R3 has nonempty connected boundary. In particular the connected-boundary clause of the regular-decomposition theorem follows from the domain assumptions in the discrete-compactness theorem.

Facts & Assumptions

Given: AC and Ω. Use real coefficients in all homology groups.

[F1]

Compact topological manifold boundaries admit collars gives a compact topological manifold with boundary a collar and proves its interior inclusion a homotopy equivalence.

[F2]

Poincaré–Lefschetz duality says Hp(M;R)≅H3−p(M,∂M;R) for a compact oriented three-manifold. Its AC assumption is retained.

[F3]

Long exact sequence of a pair supplies exactness, Homotopic maps induce equal maps in singular cohomology supplies cohomology homotopy invariance, and the chain/cochain conventions are The singular chain complex and singular homology and Singular cohomology with coefficients. The needed degree-zero and point calculations are given below for the actual real coefficients; no integral-coefficient-only or B-page example is imported as a supplier.

Proof

1.1F1F3constructF2

Put M=Ω‾. It is compact by boundedness and closedness. Near each boundary point a Lipschitz graph chart x3=ϕ(x′) straightens M by the explicit homeomorphism (x′,x3)↦(x′,x3−ϕ(x′)) to a closed halfspace neighborhood. Interior points use Euclidean balls. These charts show that M is a Hausdorff second-countable three-manifold with topological boundary exactly ∂Ω and interior exactly Ω. Its orientation is the standard Euclidean orientation on its interior; this is precisely the orientation convention for manifolds with boundary in [F2]. By [F1], Ω↪M is a homotopy equivalence. Contractibility of Ω, [F3], and factorization through a point give H2(M;R)=0: the point has one singular simplex in each degree, and its real cochain differentials are successively zero and identity, so its positive cohomology is zero. Also M is path connected: its interior is path connected by contractibility, and a half-chart path joins any boundary point to its interior. The augmentation identifies H0(M;R) with R, because any difference of points is the boundary of a path and every zero-chain of coefficient sum zero is a finite linear combination of such differences. The boundary is nonempty: a ray from any interior point eventually leaves the bounded set and its first exit point is a boundary point.

2.1F2F3step 1.1algebra∎

By [F2], H1(M,∂M;R)=0. The exact sequence in [F3] then makes H0(∂M;R)→H0(M;R) injective. The boundary is a two-manifold by the graph charts, hence locally path connected, so its connected components are path components. If there were two, choose one point in each. Their difference is nonzero in H0(∂M;R): the sum of coefficients on the first path component defines a linear functional on zero-chains which kills every one-simplex boundary, yet sends this difference to one. Its image in H0(M;R) is zero since the two points are joined by a path in M, contradicting injectivity. Therefore the nonempty boundary is connected. No finite-element incidence matrix is used to infer this continuum topological claim.

Depends on

Used by

Dependency tree · two levels

63 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