Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicable
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.

Linear hyperplane arrangements and local finiteness

PDF p. 4: §2.1

Definition

Let E be a real vector space equipped with a specified topology, and give each subset of E the subspace topology: its open sets are its intersections with open subsets of E. In the finite-dimensional setting one may use the Euclidean topology described in the arrangement interface. A subset T⊆E is convex when (1−t)x+ty∈T for all x,y∈T and 0≤t≤1. A linear hyperplane is a linear subspace H⊆E of codimension one, meaning that E/H has dimension one.

A hyperplane arrangement (T,H) consists of a convex subset T⊆E and a set H of linear hyperplanes in E, possibly infinite, such that H∩T≠∅ for every H∈H.

For a convex subset T′⊆T, the restriction to T′ is the arrangement (T′,HT′), where HT′={H∈H:H∩T′≠∅}. It is also denoted (T′,H) when the restriction of the hyperplane set is understood.

The arrangement is locally finite if, for every x∈T, there is an open set U in the subspace topology on T with x∈U such that U meets only finitely many distinct members of H.

Justification

The specified topology gives a subspace topology on T, so the neighbourhood condition is meaningful. Convexity of T′ and the defining filter on HT′ ensure that the restriction again satisfies the arrangement definition. The members retained are hyperplanes in E themselves, so distinct hyperplanes are counted separately even if their intersections with T coincide. The finite-dimensional convention and these arrangement operations agree with the arrangement interface.

Source notes

The cited article supplies the arrangement terminology and its restriction and local-finiteness conventions. The explicit choice of topology makes the neighbourhood convention precise; no particular topology is asserted for an arbitrary-dimensional E.

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.

Sources