This project contains a formalization of my paper Aggregation of evaluations without unanimity.
The main definitions and results are spread across several files:
- The basic definitions are found in
Basic.lean. - Theorem 1.3 is found in
ReductionTo2.leanunder the nametrivial_iff_trivial_for_2. - Theorem 1.4 is found in
ReductionTo1.leanunder the nametrivial_for_2_of_trivial_for_1. - The furthermore clause of Theorem 1.4 is found in
BooleanAux.leanunder the namenot_trivial_for_1B. - The basic definitions of symmetric Boolean predicates are found in
SymmetricDefs.lean. - Theorem 1.5 is found in
Symmetric.leanunder the namesymmetric_classification. - The furthermore clause of Theorem 1.5 is found in
SymmetricOnlyIf.leanunder the namenontrivial_if_has_nonconst_counterexample'. - The polymorphisms of NAE are determined in
NAE.lean, specificallyNAE_polymorphisms. - Theorem 1.6 is found in
SymmetricClassifyMain.leanunder the namesymmetric_polymorphisms. - Theorem 1.7 is found in
Unanimity.leanunder the nametrivial_iff_impossibility.