Alphabeta Math
LemmaStatement: AI-generatedProof: AI-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.

The Salvetti order complex and its finite CW case

Statement

For the poset P(A) in The incident facet and chamber poset, take as simplices the empty set and the nonempty finite chains. They form an abstract simplicial complex in the sense of An abstract simplicial complex. Define Sal⁡(I,A) to be its geometric realization with the weak topology of The geometric realization of an abstract simplicial complex. Its open simplices give a CW complex in the sense of CW complex with closure finiteness and weak topology. If A is finite, this complex is finite.

Facts & Assumptions

[F1]

The incident pairs and their order are defined in The incident facet and chamber poset.

[F2]

Abstract simplicial complexes include the empty simplex and are closed under subsets: An abstract simplicial complex. Their realization uses finite-support barycentric functions and the weak topology on Euclidean simplices: The geometric realization of an abstract simplicial complex.

[F3]

A CW complex is Hausdorff, has a discrete zero-skeleton and is built by disk attachments to successive skeleta, with closure finiteness and the weak topology: CW complex with closure finiteness and weak topology.

[F4]

Facets are nonempty fibers of the simultaneous sign map, and chambers are the fibers with no zero signs: Sign facets of a cone arrangement.

[F5]

Attaching disks along their boundaries means taking the quotient of the disjoint union of the preceding skeleton and the disks by the boundary identifications, as in Cell attachment by a characteristic map.

Proof

Given: the poset and arrangement in the Statement, with the conventions of [F1] and [F4].

Proof technique: direct.

Goal: establish the chain complex, all the CW conditions and finiteness for a finite arrangement.

1.1F1F2

Put V=P(A) and let K consist of the empty set and its nonempty finite chains. Every subset of a finite chain is a finite chain or empty, and every vertex is a singleton chain. Thus (V,K) meets the abstract simplicial complex definition. Write X=∣K∣ for its weak realization.

2.1F2step 1.1

For each vertex v, the coordinate function av:X→[0,1], av(α)=α(v), is continuous: its restriction to every Euclidean simplex is continuous, so inverse images of open sets are open by the weak topology. Distinct points differ at some coordinate; inverse images of disjoint open intervals about those coordinate values are disjoint open neighbourhoods. Thus X is Hausdorff. Simplex inclusions are continuous by the same weak-topology definition, and their inverse barycentric coordinate maps are continuous by the coordinate functions. Hence every simplex has its Euclidean topology as a subspace of X.

3.1F2step 2.1

For a nonempty chain σ of size p+1, the points of support exactly σ form its open simplex eσ. These sets partition X. The set ∣σ∣ is closed in X: it is the intersection of the coordinate zero sets for vertices outside σ. Since eσ is dense in its Euclidean simplex, its closure in X is exactly ∣σ∣. The standard p-simplex is a closed p-disk with boundary the union of its proper faces, giving the required disk characteristic map and an interior homeomorphism onto eσ.

4.1F2step 2.1step 3.1

Define X−1=∅ and let Xp be the union of the simplices of dimension at most p. These form an increasing filtration with union X, since every point has finite support. The subspace topology on Xp is the weak topology on those simplices. Indeed, if B⊆Xp has closed intersection with each of them, then for any simplex τ of K, B∩∣τ∣ is the finite union of the closed sets B∩∣σ∣ over the faces σ⊆τ of dimension at most p. Each such face is closed in ∣τ∣, so the weak topology makes B closed in X, hence in Xp. Conversely, a set closed in Xp has closed intersection with each of its simplices by continuity of inclusion. For p=0, every subset meets each vertex simplex in a closed set, so every subset of X0 is closed and X0 is discrete.

5.1F5step 3.1step 4.1

For p≥1, take the disjoint union of Xp−1 and a closed p-simplex for each p-dimensional simplex of K, and identify every boundary point with the same barycentric point in Xp−1. Face inclusions give continuous attaching maps. The resulting map onto Xp identifies exactly these points, since distinct p-simplex interiors have distinct supports. A subset of Xp has closed preimage in this disjoint union exactly when its intersection with Xp−1 and with each p-simplex is closed. By the preceding skeleton criterion, this is exactly closedness in Xp. The map therefore has the quotient topology, proving that each skeleton is obtained by the disk attachments required in [F5].

6.1F2F3step 2.1step 3.1step 4.1step 5.1

The closure ∣σ∣ of each cell meets precisely its finitely many nonempty face cells. This proves closure finiteness. Closedness in X is tested on all the Euclidean simplices by [F2]; these are exactly the closed cells with their subspace topology. This proves the CW weak-topology condition. Together with Hausdorffness, the discrete zero-skeleton and the disk attachments, all conditions in [F3] hold.

7.1F1F4step 1.1step 6.1∎

If ∣A∣=n, distinct facets have distinct sign vectors in {−,0,+}A, and distinct chambers have distinct sign vectors in {−,+}A, by their fiber definitions. Thus there are at most 3n facets and 2n chambers, and at most 6n incident pairs. A finite vertex set has finitely many subsets, hence finitely many chains and cells. This also includes n=0, since the sign map then has the single nonempty fiber I, which is also its single chamber.

Source notes

This is the simplicial convention of Paris §3.1, printed p.386, rather than the unsubdivided regular CW convention. No homotopy equivalence to the complement is proved by the elementary construction here.

Depends on

Used by · 7

Dependency tree · 2 levels

Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.