Docs / Semantics / Aggregation / Basic

Aggregation rules

import Linglib.Semantics.Aggregation.Basic

This file defines aggregation rules, which combine several rankings of the same objects into one. A profile assigns each object a vector of values, one per individual, and an aggregation rule assigns each profile a relation on the objects, read x ⪰ y. In social choice the individuals are voters and the objects social states; for a multidimensional adjective the individuals are its dimensions and the relation is its comparative.

The information a rule may use is fixed by invariance under a class of vectors of changes of scale, one for each individual. On a single scale the changes of scale are the strictly increasing maps of an ordinal scale, the positive affine maps of an interval scale and the similarities of a ratio scale. A class applies such maps separately to each individual (non-comparability), one map to every individual (full comparability), or affine maps with a common unit (unit comparability). Arrow's conditions, the strong Pareto condition, Pareto indifference and anonymity are predicates on rules.

A rule ranks vectors, ofRel R, when each output is the preimage, under the profile, of one relation R on vectors of values. Every classical rule does, and on three or more objects a rule with preorder outputs does exactly when it is independent and Pareto indifferent. ofRel carries infima and suprema of relations on vectors to those of rules.

Main definitions

Main statements

Implementation notes

  • A rule is total on profiles, so Arrow's unrestricted-domain condition is built in; a domain restriction is a hypothesis of the statement that needs it.
  • Outputs are bare relations, since majority rule is not transitive. AsymmRel is the strict part of an output and AntisymmRel its indifference part.

TODO

  • Preorder.ofCriteria, the ordering of worlds by an ordering source, is the Pareto rule with propositions as the individuals; the harmony of Harmonic Grammar is the utilitarian rule with constraints as the individuals. State both as aggregation rules.

References

Declarations

L77–78

An aggregation rule assigns to each profile a relation on the objects, read x ⪰ y.

@[reducible, inline] abbrev Aggregation.RuleL80–81
(ι : Type u_4) (α : Type u_5) (K : Type u_6) :
Type (max (max u_5 u_6) u_4)

Built from

Used by Aggregation.ParetoIndifferent, Aggregation.Independent, Aggregation.TransitiveValued, Aggregation.CompleteValued, Aggregation.WeakOrderValued, Aggregation.weakOrderValued_iff, Aggregation.QuasiOrderValued, Aggregation.Anonymous, Aggregation.WeakOrderValued.quasiOrderValued, Aggregation.WeakPareto, Aggregation.StrongPareto, Aggregation.IsDictator, Aggregation.NonDictatorial, Aggregation.StrongPareto.weakPareto, Aggregation.Arrovian, Aggregation.arrovian_iff, Aggregation.ofRel, Aggregation.paretoIndifferent_iff_forall_exists_eq_preimage, Aggregation.iff_of_eq_of_ne, Aggregation.independent_and_paretoIndifferent_iff_exists_ofRel

Used in Semantics/Aggregation/Arrow, Semantics/Aggregation/Rules, DAmbrosioHedden2024, Sassoon2013

Informational invariance

The information a rule may use is fixed by its Invariant classes: sets of vectors of changes of scale, one for each individual, acting on a profile coordinatewise.

L88–94
L96–100
L115–116
L119–120
L128–131
L152–154
L156–157
L159–160
L162–163
L165–166
L168–169
L173–178

Conditions on rules

Pareto indifference says that objects with the same vector of values are indifferent.

def Aggregation.ParetoIndifferentL186–187
{ι : Type u_1} {α : Type u_2} {K : Type u_3} (a : Rule ι α K) :

Built from ,

Used by Aggregation.paretoIndifferent_ofRel, Aggregation.paretoIndifferent_iff_forall_exists_eq_preimage, Aggregation.iff_of_eq_of_ne, Aggregation.independent_and_paretoIndifferent_iff_exists_ofRel

Used in Semantics/Aggregation/Rules

L189–191
L199–205
L207–208
L223–225
L227–229
L239–240

A rule meets Arrow's conditions relative to a class T of changes of scale when it is invariant under T, outputs weak orderings, satisfies weak Pareto and independence, and has no dictator. Arrow's own conditions take T to be ordinal.

structure Aggregation.ArrovianL244–258
{ι : Type u_1} {α : Type u_2} {K : Type u_3} [Preorder K] (T : Set (ι → K ↪o K)) (a : Rule ι α K) :

Built from , , , ,

Used by Aggregation.arrovian_iff

Used in Semantics/Aggregation/Arrow, Semantics/Aggregation/Rules, DAmbrosioHedden2024, VanRooij2011

Rules that rank vectors

The rule that ranks objects by a relation R on their vectors of values.

def Aggregation.ofRelL262–263
{ι : Type u_1} {α : Type u_2} {K : Type u_3} (R : (ι → K) → (ι → K) → Prop) :
Rule ι α K

Built from

Used by Aggregation.ofRel_apply, Aggregation.instDecidableRelOfRelOfForall, Aggregation.ofRel_iInf, Aggregation.ofRel_iSup, Aggregation.independent_ofRel, Aggregation.paretoIndifferent_ofRel, Aggregation.quasiOrderValued_ofRel, Aggregation.weakOrderValued_ofRel, Aggregation.anonymous_ofRel, Aggregation.invariant_ofRel, Aggregation.weakPareto_ofRel_iff, Aggregation.independent_and_paretoIndifferent_iff_exists_ofRel

Used in Semantics/Aggregation/Rules, DAmbrosioHedden2024, Sassoon2013

L269–271
L276–278
L280–282
L284–285
L287–288
L290–291
L293–295
L297–301
L303–307
L309–317

Welfarism

When every output is a preorder, Pareto indifference holds exactly when each output ranks the objects by a ranking of their vectors of values (D’Ambrosio & Hedden 2024 fn. 16, after Blackorby et al. 1990).

theorem Aggregation.paretoIndifferent_iff_forall_exists_eq_preimageL327–341
{ι : Type u_1} {α : Type u_2} {K : Type u_3} {a : Rule ι α K} (h : QuasiOrderValued a) :
ParetoIndifferent a ↔ ∀ (v : Profile ι α K), ∃ (R : (ι → K) → (ι → K) → Prop), a v = v ⁻¹'o R

Built from , , ,

L372–399

Welfarism: on three or more objects, a rule with preorder outputs is independent and Pareto indifferent exactly when it ranks objects by one relation on their vectors of values.

theorem Aggregation.independent_and_paretoIndifferent_iff_exists_ofRelL402–421
{ι : Type u_1} {α : Type u_2} {K : Type u_3} {a : Rule ι α K} (hQ : QuasiOrderValued a) (h₃ : 3 ≤ ENat.card α) :
Independent a ∧ ParetoIndifferent a ↔ ∃ (R : (ι → K) → (ι → K) → Prop), a = ofRel R

Built from , , , ,