Chambers of Arrangements of Hyperplanes and Arrow's Impossibility Theorem

Abstract

Let A be a nonempty real central arrangement of hyperplanes and Ch be the set of chambers of A. Each hyperplane H defines a half-space H+ and the other half-space H-. Let B = \+, -\. For H∈ A, define a map εH+ : Ch B by εH+ (C)=+ (if C⊂eq H+) and εH+ (C)= - (if C⊂eq H-). Define εH-=-εH+. Let Chm = Ch× Ch×...× Ch (mtimes). Then the maps εH induce the maps εH : Chm Bm . We will study the admissible maps : Chm Ch which are compatible with every εH. Suppose | A|≥ 3 and m≥ 2. Then we will show that A is indecomposable if and only if every admissible map is a projection to a omponent. When A is a braid arrangement, which is indecomposable, this result is equivalent to Arrow's impossibility theorem in economics. We also determine the set of admissible maps explicitly for every nonempty real central arrangement.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…