Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-13
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.

Local homology detects manifold dimension, interior, and boundary

Statement

Let M be an n-manifold with boundary and xM. For any commutative unital coefficient ring R, Hk(M,M{x};R){R,xintM and k=n,0,otherwise. The boundary subset is independent of charts, and a nonempty manifold's dimension is intrinsic. Homeomorphisms preserve boundary and, for nonempty manifolds, dimension. A manifold is boundaryless exactly when it is locally Euclidean of its specified dimension. Dimension is not intrinsic for the empty space, and the zero coefficient ring cannot detect boundary or dimension; use integral coefficients for these conclusions. No AC is assumed.

Facts & Assumptions

[F1]

Topological manifolds with and without boundary supplies half-space charts, the existential boundary subset, and the zero-dimensional convention.

[F2]

Excision for singular homology permits removal of Z when its closure lies in the interior of the subspace of the pair.

[F3]

Homology of spheres computes reduced sphere homology, including S0.

[F4]

Long exact sequence of a pair supplies the pair sequence.

[F5]

Homotopic maps induce the same map on singular homology identifies homology under explicit contractions and deformation retractions.

[F6]

Functoriality of relative homology sends homeomorphisms of pairs to isomorphisms.

Proof

Given: M,n,x,R as stated; homology groups in negative degrees are zero.

1.1

In any chart containing x, restrict to an open ball about its image if that image is above the hyperplane, or to the intersection of an open ball with the half-space if it is on the hyperplane. Translate the center to 0 (only parallel to the hyperplane in the latter case). Write U for the resulting neighborhood of x. Since M is Hausdorff, M{x} is open: separate each other point from x by open sets and take their union. The closed set Z=MU omits x, so Z=Zint(M{x}). Thus [F2] and [F6] identify the local pair homology with that of (B,B{0}) or (B+,B+{0}), where the ball has radius r>0.

F1F2F6given
1.2

A point has exactly one singular generator in every degree. Its boundary is multiplication by i=0k(1)i, namely identity for positive even k and zero for odd k, with zero degree-zero boundary. Hence its homology is R in degree zero and zero above. A nonempty contractible space has the same homology by [F5], with the degree-zero isomorphism induced by its map to a point. For a contractible Y and nonempty AY, [F4] therefore identifies Hk(Y,A;R) with H~k1(A;R) for k1 and gives H0(Y,A;R)=0. At k=1 this is the kernel of the surjective augmentation H0(A;R)R, and at higher degrees it follows from the two zero adjacent groups. Surjectivity uses any one point of the given nonempty A.

F4F5given
2.1

At an interior chart point with n1, B contracts to 0. For ρ=r/2, the homotopy h(y,t)=(1t+tρy)y retracts B{0} onto its radius-ρ sphere: the norm is (1t)y+tρ, strictly between 0 and r, and the sphere is fixed. Scaling identifies it with Sn1. By [F3], [F5] and step 1.2, the pair group is R exactly in degree n. This includes n=1, where the punctured interval has two components and the augmentation kernel is {(a,a):aR}. When n=0, the chart pair is ({0},); its relative chain complex is the point complex calculated in step 1.2, giving the same conclusion.

F3F5step 1.1step 1.2
2.2

At a boundary chart point necessarily n1. Choose a=(0,,0,r/2). Both B+ and B+{0} contract to a by (y,t)(1t)y+ta. The ball and half-space are convex; for t>0 the last coordinate is positive, so the punctured homotopy never meets 0, and at t=0 the input already avoids 0. Their inclusion induces an isomorphism on H0 and on every higher group, as seen by their maps to a point. The exact sequence [F4] gives zero relative groups in every degree.

F4F5step 1.1step 1.2
3.1

Now take R=Z. The nonzero group in step 2.1 and the all-zero groups in step 2.2 are intrinsic to the pair (M,M{x}). Thus no point can be a boundary point in one chart and an interior point in another, even if different dimension labels are considered. This proves chart independence of [F1]'s boundary set and the formula in the statement. If a nonempty space has manifold dimension labels n and m, some point is interior in an n-chart: every nonempty open subset of a positive-dimensional half-space meets its strict interior; for dimension zero every point is interior. The same point is interior for the other manifold structure by the zero/nonzero distinction. Its unique nonzero local degree is both n and m, hence n=m. A homeomorphism identifies the local pairs by [F6], so preserves these data.

F1F6step 2.1step 2.2
4.1

If the boundary is empty, [F1]'s restriction to small balls gives Euclidean neighborhoods. Conversely, if M is locally Euclidean of dimension n, the interior calculation of step 2.1 at every point gives a nonzero integral local group and precludes a boundary chart by step 2.2. This proves both directions of the stated equivalence. For empty M the pointwise assertion and boundary equivalence are vacuous, but every dimension label is allowed. Zero coefficients make all local groups zero, without affecting the integral argument for intrinsic properties. The contractions explicitly include their endpoints, and the point calculation uses unnormalized chains; no omitted degenerate-generator convention or choice principle is involved.

F1step 2.1step 2.2step 3.1

Depends on

Used by

Dependency tree · two levels

22 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