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 seven D4 planes give a finite spherical cellulation
Statement
Let be the seven planes with forms . Their intersections with the unit sphere give a finite regular cell decomposition: its open faces are chamber intersections, its open edges are great-circle arcs between intersection points, and its vertices are the intersection points. Here regular means every closed cell is embedded and homeomorphic to a closed disk, with its boundary a union of lower-dimensional cells.
Statement references
Facts & Assumptions
The Example in Seven relative D4 hyperplanes and thirty-two chambers states that the independent coordinates , and identify the relative arrangement with the kernels of , and that its chambers are precisely the nonempty strict sign regions. Rename these coordinates here.
A finite CW decomposition means finitely many disk characteristic maps with closure-finite weak topology, as in CW complex with closure finiteness and weak topology.
Proof
Given: The data in the Statement and the exact supplier facts above.
Goal: Establish the Statement.
The three coordinate planes are present. Each spherical chamber lies in one coordinate octant, so its closure lies in a hemisphere where , with the octant signs . Radial projection identifies that closed spherical chamber with the section of its closed polyhedral cone by . This section is a compact convex polygon with nonempty interior: the octant gives boundedness, and the chamber is full-dimensional. A compact convex polygon is a closed disk by radial lines from any interior point, and its vertices correspond to the cone's extreme rays, while its edges correspond to the cone's two-dimensional facets.
Every plane pair meets in a line, giving two sphere points; there are finitely many such points. They split each great circle into finitely many arcs. The polygonal disks from step 1.1, their arcs and vertices cover the sphere, with disjoint open cells and with intersections unions of faces, as follows from their weak linear sign inequalities. Each closed cell is embedded and closed in : it is specified on the sphere by finitely many weak linear sign inequalities and equalities. There are finitely many cells, so closure finiteness holds.
To check the weak topology in [F2], let have closed in for every cell . Since is closed in , each is closed in . The closed cells cover the sphere, so is a finite union of closed subsets and is closed. Conversely, a closed subset of has closed intersection with each closed cell in its subspace topology. The same argument on each skeleton, using its finitely many closed cells, shows that its topology is the quotient topology of the disk attachments along their boundaries: a set is closed exactly when its inverse image in every attaching disk and in the preceding skeleton is closed. Thus these characteristic maps, with the stated boundary faces, give the required CW attachments and weak topology. The asserted finite regular cell decomposition follows.
Depends on
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.