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.

Invariant choices of facet points for finite linear symmetry groups

Statement

Let A be a finite arrangement of proper linear hyperplanes in a finite-dimensional real vector space E, and let a finite group G act linearly, permuting A. Set I=E in the facet and induced-action conventions of Sign facets of a cone arrangement, Facet incidence and localized chamber signs and Linear symmetries act on the Salvetti model. There are choices x(F)∈F for every facet satisfying x(gF)=gx(F) for all g∈G.

Facts & Assumptions

Given: The finite arrangement and group in the Statement, with I=E. Goal: Make equivariant facet choices.

[F1]

With I=E, the finite arrangement is locally finite in a nonempty open convex cone. Facets are nonempty relatively open convex sign cones with the conventions of Sign facets of a cone arrangement and Facet incidence and localized chamber signs.

[F2]

Every g∈G preserves I=E and permutes A, so Linear symmetries act on the Salvetti model applies and gives an action on the facets and their incidence.

Proof

technique · direct
1.1F1F2given

There are finitely many facets, since each is specified by a sign in {−,0,+} for each member of the finite arrangement. For one facet F in each G-orbit choose vF∈F, and let GF={g:gF=F}. Put x(F)=∣GF∣−1∑h∈GFhvF. Every summand lies in the convex set F, so x(F)∈F. Reindexing the finite sum shows that GF fixes x(F).

2.1step 1.1∎

Set x(gF)=gx(F) on that orbit. If gF=g′F, then g−1g′∈GF, so the assigned points coincide. This proves well-definedness and equivariance. The construction also covers the facet containing the origin and the empty arrangement; only finite choices were used.

Depends on

Used by · 2

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.