A formal social‑choice theorem stating that no deterministic rank‑order aggregation rule (voting system) converting individual complete preference orderings into a collective ranking can satisfy simultaneously a standard set of fairness axioms — unrestricted domain, paretian unanimity, independence of irrelevant alternatives, and non‑dictatorship — when there are at least three alternatives.

Principle

Any rank‑order aggregation method for three or more alternatives must violate at least one of the listed axioms; the theorem forces explicit trade‑offs among fairness criteria when designing voting rules.

Demonstration

Illustrative scenario: Situation: three voters rank candidates A, B and C differently so that pairwise majorities cycle (A over B, B over C, C over A). Recognition: applying a rank‑order rule that respects pairwise preferences and independence leads to cyclical collective preferences. Action: designers must abandon or weaken one axiom (e.g., restrict allowable preference domains or relax independence). Consequence: no voting rule can be both fully fair by these axioms and universally applicable to all preference profiles with three or more options.

Misapplication

Concluding that democratic decision‑making is impossible or meaningless. The error is conflating a formal impossibility among idealized axioms with the practical usefulness of voting systems; the theorem identifies necessary trade‑offs but does not imply that all voting methods are useless in practice.

Consequence

The theorem compels designers to prioritize which axioms to satisfy, motivates domain restrictions (e.g., single‑peaked preferences), encourages consideration of cardinal measures or randomized procedures, and explains why different voting systems produce different normative outcomes.

Reversal

If the domain of individual preferences is restricted (for example, to single‑peaked preferences) or if aggregation permits cardinal utilities, randomness, or limited strategy sets, aggregation rules can satisfy more fairness criteria; the impossibility applies only under the theorem’s specified assumptions.

Boundary

Clearly within: deterministic, rank‑order social choice functions aggregating complete preference orderings over three or more alternatives under the listed axioms. Boundary case: aggregation methods that permit incomplete preferences or restrict domains. Clearly outside: decision procedures using cardinal utility aggregation, randomized social choice or procedures that accept partial orderings not covered by the theorem’s assumptions.

Semantic Tension

Majoritarian Consistency ↔ Independence of Irrelevant Alternatives — enforcing independence can conflict with producing transitive majoritarian outcomes, requiring explicit prioritization of axioms.

Synthesis

Arrow’s result is not a refutation of collective choice but a formal map of unavoidable trade‑offs: it requires that any practical voting system make explicit which fairness condition(s) it relaxes or which domain restrictions it assumes.