Alphabeta Math
PropositionStatement: 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.

Finite galleries and separating hyperplanes

Statement

Let T be an open convex subset of a finite-dimensional real vector space E, and let A be a locally finite arrangement of linear hyperplanes in T. A hyperplane separates two chambers if the chambers lie in opposite open half-spaces bounded by it. Each adjacency in a gallery has a unique defining hyperplane; say the gallery crosses that hyperplane at the adjacency. Any two chambers are joined by a finite gallery. A gallery between them has minimum length if and only if it crosses each separating hyperplane exactly once and crosses no other hyperplane. The minimum length is the number of distinct separating hyperplanes; coincident hyperplanes are counted once.

Facts & Assumptions

[F1]

The arrangement interface defines local finiteness, chambers as connected components, walls using closures in E, adjacency as a shared wall, and finite galleries (Locally finite arrangements and relative face terminology).

[F2]

Convexity puts every segment between points of T in T (A convex subset of ℝᵐ contains every line segment between two of its points).

[F3]

A linear hyperplane is a linear subspace with one-dimensional quotient (Linear hyperplane). Step 2.1 constructs its continuous defining form in the coordinate Euclidean topology and proves its closedness.

[F5]

A finite-dimensional vector space over an infinite field is not a finite union of proper linear subspaces (A finite-dimensional vector space over an infinite field is not a finite union of proper subspaces).

[F6]

The real interval [0,1] is connected, since it is order-convex (A subset of ℝ is connected if and only if it is order-convex, that is, an interval).

[F7]

The image of a connected subset under a continuous map is connected in the subspace topology (A continuous image of a connected space is connected, and connectedness is a topological property, assertion 1).

Proof

Given: An open convex T⊆E and a locally finite arrangement A as stated, with the coordinate Euclidean topology specified by [F1].

Goal: Establish the gallery and minimum-length assertions.

1.1F1F3given

If T is empty there are no chambers, so the assertions about chambers and galleries are vacuous. If dim⁡E=0 and T is nonempty, then T=E={0}, there are no hyperplanes, and there is just one chamber. Its one-chamber gallery has length zero, and no adjacency of distinct chambers is possible. All conclusions follow. Henceforth assume T≠∅ and n=dim⁡E≥1, and use the coordinate Euclidean norm ∥⋅∥ on E.

1.2F1F2choosealgebra

We will use the following interpolation fact, proved here. If V⊆E is nonempty, open and convex, z∈V‾, b∈V and 0<t≤1, then (1−t)z+tb∈V. The case t=1 is immediate. For 0<t<1, take r>0 with B(b,r)⊆V and, by the definition of closure, take v∈V with ∥v−z∥<tr/(1−t). Then b′=b+(1−t)(z−v)/t lies in B(b,r), and (1−t)z+tb=(1−t)v+tb′∈V by convexity. As t tends to zero these points approach z, since their distance from z is t∥b−z∥.

2.1F1F3step 1.1constructalgebra

Let e1,…,en be the coordinate basis. For each hyperplane H, let j be the least index for which ej∉H. Since E/H is one-dimensional, every z∈E has a unique expression z=h+tej with h∈H and t∈R. Set αH(z)=t. Uniqueness gives linearity, αH(ej)=1, and ker⁡αH=H. With ai=αH(ei) and z=∑iziei, we have αH(z)=∑iaizi and ∣αH(z)−αH(w)∣≤(∑i∣ai∣)∥z−w∥. The positive constant ∑i∣ai∣ therefore gives continuity. The preimage of {0} is closed, and the two strict sign sets are open half-spaces: for a nonzero value, a ball of radius less than ∣αH(z)∣/(∑i∣ai∣) preserves its sign. Thus H is closed. The least-index rule specifies these forms without an arbitrary family of choices.

2.2F2F6F7step 1.1choose

Every convex subset S⊆E is connected. Indeed, for u,v∈S the segment map γ:[0,1]→E, γ(t)=(1−t)u+tv, has image in S, and ∥γ(t)−γ(s)∥=∣t−s∣∥v−u∥ proves continuity. Its image is connected by [F6] and [F7]. If S had a separation into two nonempty relatively open parts, choosing u and v in different parts would give a separation of this segment by their traces, a contradiction. Empty sets and singletons have no such separation. This applies in particular to balls, half-balls, and the convex sign sets below.

3.1F1F2step 2.1step 2.2

Local finiteness and closedness of the hyperplanes show that their union is relatively closed in T: near a point outside the union, take an open neighbourhood meeting only finitely many hyperplanes and remove those closed sets. The complement is therefore open in E, since T is open. Any connected subset of the complement has a constant sign for every αH, since the two open half-spaces would otherwise separate it. Conversely, every realizable sign set in T is convex, hence connected by step 2.2, and lies in the complement. Thus chambers are exactly these sign sets and are convex. Each point of the complement has a ball inside it; that ball is connected and hence lies in the point's chamber. Consequently chambers are open.

4.1F1F2F4step 1.1step 3.1choose

Choose x∈C and y0∈D for any two chambers C,D. Their closed bounded segment K=[x,y0] lies in T. In coordinates it is compact by [F4], with n≥1 by step 1.1; transporting a cover along the coordinate isometry gives compactness in E. Local finiteness and openness of T cover K by open subsets of E, contained in T, each meeting only finitely many arrangement hyperplanes. The ambient-cover assertion of [F4] gives a finite subcover. Its union is an open neighbourhood U⊆T of K meeting only finitely many hyperplanes. Cover K also by all balls B(p,r/2) with p∈K, r>0, and B(p,r)⊆U. The same ambient-cover assertion yields finitely many such balls. The minimum ε>0 of their half-radii ensures that every point at distance less than ε from some point of K lies in U, by the triangle inequality. Since ∥(1−t)x+ty−((1−t)x+ty0)∥≤∥y−y0∥ for 0≤t≤1, every y∈D sufficiently close to y0 has its whole segment from x inside U.

4.2F1F2F3step 2.1step 3.1choosealgebra

Suppose distinct chambers C,D share a wall W=C‾∩H=D‾∩K. Since W has affine dimension n−1 and is contained in both hyperplanes, its affine hull is both H and K, so H=K. The set C‾ is convex: given u,v∈C‾, 0≤s≤1 and δ>0, choose c,d∈C within δ of u,v, respectively. Then (1−s)c+sd∈C by step 3.1 and is within δ of (1−s)u+sv, proving that this last point is in C‾. Hence W is convex. Put d=n−1. Starting with w0∈W, repeatedly choose a point of W outside the affine span of the points already chosen until it is H; this gives w0,…,wd∈W with wi−w0 a basis of H. For d>0, the set O={w0+∑i=1dλi(wi−w0):λi>0, ∑i=1dλi<1} is contained in W by repeated convex combinations. The coefficient functions λi on H are continuous: extend the basis of H to one of E; each coefficient of z−w0 is a linear combination of its Euclidean coordinates, hence an affine function of z whose continuity follows from the finite-sum bound of step 2.1. Thus the strict inequalities define a relatively open subset of H, nonempty because it contains the barycentre of w0,…,wd. For d=0, take O=W=H={0}. This proves locally that W contains a nonempty relatively open subset O of H.

5.1F1F3F5step 2.1step 1.2step 4.2choose

Choose q∈H∩T, which exists because H is an arrangement hyperplane. For every z∈W, we have z∈T‾, so step 1.2 with V=T and b=q gives (1−t)z+tq∈H∩T for 0<t≤1. These points approach z. Therefore W is contained in the closure in H of H∩T. In particular the nonempty relatively open set O⊆W of step 4.2 meets H∩T by the definition of closure. Thus O∩T is nonempty and relatively open in H. Choose a∈O∩T and an open neighbourhood N⊆T of a meeting only finitely many arrangement hyperplanes. Each such hyperplane other than H intersects H in a proper linear subspace. If there are any, [F5] gives a direction in H outside their union; a sufficiently short line through a in this direction stays in O∩N and meets each excluded subspace in at most one parameter, so choose a parameter avoiding them all. If there are none, use a itself. This yields p∈O∩T lying on no arrangement hyperplane other than H. When dim⁡H=0, there is no other distinct linear hyperplane in E, so this is precisely the latter case. Shrinking inside N and avoiding its finitely many other closed hyperplanes gives a ball about p contained in T and meeting no arrangement hyperplane except H.

5.2step 2.1step 4.1F3F5choose

Let B be the finite set of hyperplanes meeting U. For every distinct pair H,K∈B, their intersection has codimension two. Since x is in no arrangement hyperplane, the affine span of x and H∩K is a proper affine hyperplane. Avoid the finitely many such affine hyperplanes when choosing y close to y0 in D; this is possible by applying [F5] to their direction subspaces and moving on a short line in a direction outside their union, avoiding finitely many intersection parameters. In dimension less than two there are no distinct pairs to avoid. The segment from x to y then meets no two distinct arrangement hyperplanes simultaneously. It meets each member of B at most once, because its endpoints avoid that hyperplane and a nonzero affine linear function on a segment has at most one zero.

6.1F1step 2.1step 2.2step 3.1step 4.2step 5.1

The ball from step 5.1 meets both C and D, since p∈W. Each of its two half-balls is connected by step 2.2 and lies in the complement, hence is contained in a single chamber. Each chamber lies on one side of H by step 3.1, so the distinct chambers C,D occupy opposite half-balls. Every other arrangement hyperplane misses the entire ball and has constant sign on it. Their signs therefore differ at H and agree at every other hyperplane. The argument applies to any shared wall, so its defining hyperplane is the only sign change and is unique for this adjacency.

6.2F1F3step 2.1step 2.2step 3.1step 5.2

List the finitely many crossing points in order. Between successive crossing points the segment lies in a chamber by step 3.1. At a crossing point p∈H, local finiteness and the absence of a simultaneous crossing give a ball in T meeting no arrangement hyperplane except H. Its two half-balls are connected by step 2.2, and contain the two neighbouring segment pieces, so each is contained in the corresponding chamber, say A and B. These chambers are distinct because they lie on opposite sides of H. Their signs agree at every other arrangement hyperplane, which misses the entire ball. The entire slice of the ball by H lies in both chamber closures.

7.1F1F3step 2.1step 3.1step 1.2step 5.2step 6.2choosealgebra

To prove equality of the full wall intersections, take z∈A‾∩H and b∈B. Then z∈T‾, and step 1.2 puts zt=(1−t)z+tb in T for 0<t≤1. For each arrangement hyperplane other than H, continuity of its defining form gives at z the weak sign of A, which is the weak sign of B by step 6.2; its value at b has the strict sign of B. Linearity therefore gives the strict sign of B at zt. For H the value at z is zero, so its value at zt also has the strict sign of B. Thus zt∈B by step 3.1, and zt→z proves z∈B‾∩H. Interchanging A,B proves A‾∩H=B‾∩H. This intersection contains the relatively open ball slice of step 6.2, so its affine dimension is n−1: the slice contains n affinely independent points in H (one point when n=1), and the intersection is contained in H. Consequently it is a wall of both chambers under [F1]. The successive chambers therefore form a finite gallery. A hyperplane is crossed by this segment exactly when its endpoint signs differ, and then it is crossed once by the affine linearity from step 5.2. Thus this gallery crosses precisely the hyperplanes separating C and D, once each; in particular their number is finite.

8.1step 6.1step 7.1F1∎

For any finite gallery from C to D, step 6.1 shows that each adjacency changes exactly the sign of its defining hyperplane. Hence every separating hyperplane must be crossed an odd, and therefore positive, number of times, while every other hyperplane is crossed an even number of times. Every gallery has length at least the number of separating hyperplanes. The gallery of step 7.1 attains that bound. Equality holds exactly when each separating hyperplane is crossed once and no other hyperplane is crossed. Since A is a set of hyperplanes, coincident hyperplanes contribute only once.

Depends on

Used by · 6

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.