Voting System using

Groups (Algebraic
Structures)
Exploring how Group Theory and Abstract Algebra model fairness and
symmetry in voting systems through permutation groups and hierarchical
structures.
Gñ¿ěé The¿ñō F¿ě±daču¿±ÿ
The case study applies Group Theory, a branch of Abstract Algebra that studies algebraic structures called groups, to
understand and model voting systems. A group is defined as a set G with a binary operation that satisfies four essential
properties:

Cš¿ÿěñe Aÿÿ¿cuačuļučō
*
a b G (a b) c=a (b c)

Ide±čučō Eše«e±č I±ļeñÿe Eše«e±č

# e*G such that e a=a e=a # a{¹*G such that a a{¹=e

In voting, symmetry is key 4 if candidates' names or voter orders are permuted, the outcome should remain consistent. This
can be represented through permutation groups (S¹). For multi-level elections (e.g., departmental committees or federations),
wreath products (S¸ S¹) model the hierarchical grouping of votes.

Example: If there are 3 candidates A, B, C, all possible rankings correspond to elements of S£, the symmetric group of degree 3.
Voting fairness can then be modeled as group actions on the set of all voter preference profiles.
Aééšucaču¿± ¿f ñešeļa±č
duÿcñeče ÿčñěcčěñe c¿±ceéčÿ
Duñecč Aééšucaču¿±
Directly applies group actions, symmetries, and algebraic mappings
to voting theory

The¿ñečucaš Bñudge
Bridges abstract algebra and decision theory through
mathematical modelling

Reaš-W¿ñšd Fauñ±eÿÿ
Connects to real-world fairness criteria like neutrality,
monotonicity, and Pareto optimality
L¿gucaš Reaÿ¿±u±g & A±ašōčucaš Deéčh
The reasoning is built on Arrow's Impossibility Theorem, which proves that no rank-based voting system can satisfy all fairness
criteria simultaneously: Unrestricted Domain, Non-Dictatorship, Pareto Efficiency, and Independence of Irrelevant Alternatives.

By introducing algebraic group structures, the study explores why and how paradoxes emerge mathematically. Each fairness
rule can be represented as a symmetry constraint on a group action. When multiple constraints conflict, algebraic structures
help identify the underlying mathematical contradictions.

1 Abÿčñacč č¿ Aééšued 2 C¿ě±čeñeŊa«éšeÿ 3 I±f¿ñ«aču¿± L¿ÿÿ I±ÿughč

Moves from abstract group Demonstrates that certain group Uses representation theory to
properties to applied voting rules actions break neutrality or show that aggregated rankings
transitivity lose information 4 a reason for
paradoxes
C¿ññecč±eÿÿ ¿f The¿ñe«ÿ, Pñ¿¿fÿ, a±d
Deñuļaču¿±ÿ
The project demonstrates correct understanding of fundamental mathematical concepts:

Group Properties 3 Closure, Associativity, Identity, Inverse

Arrow's Theorem 3 Logical proof concept: no voting system satisfies all four fairness axioms simultaneously
Symmetric Groups (S¹) 3 Correctly models all possible candidate orderings
Examples: (Z,+), (R ,×), Dihedral Group D¹, and Cyclic Group Z¹

Although no complex derivations are shown, logical accuracy is maintained and definitions are mathematically sound. All
mathematical claims are correct, clearly explained, and logically consistent.
Uÿe ¿f Aééñ¿éñuače Pñ¿bše«-S¿šļu±g Tech±uïěeÿ
The study applies discrete mathematical modelling techniques to evaluate fairness and symmetry in voting:

Peñ«ěčaču¿± Gñ¿ěéÿ Gñ¿ěé Acču¿±ÿ

To model all possible orderings of voter preferences To measure neutrality 4 whether candidate renaming
changes outcomes

Reéñeÿe±čaču¿± The¿ñō Wñeačh Pñ¿děcčÿ

To decompose voting data into meaningful components To represent hierarchical elections or subcommittees

The approach is mathematically creative, connecting abstract algebraic logic with decision-making algorithms.
Pñ¿bše«-S¿šļu±g Aééñ¿ach
u± Pñacčuce
The example problem-solving approach demonstrates how discrete
structures solve real voting challenges:

01

Defu±e Pñefeñe±ce Pñ¿fušeÿ

Represent preference profiles as tuples acted on by symmetric groups

02

Ide±čufō I±ļañua±čÿ
Identify invariant properties and fairness constraints within the system

03

Teÿč Fě±cču¿±ÿ
Test if any function f:P ³P satisfies these constraints
04

Dečecč Vu¿šaču¿±ÿ
Use group-theoretic analysis to detect violations and Arrow's paradox
Cšañučō & C¿±ÿuÿče±cō u± Mačhe«ačucaš
Reéñeÿe±čaču¿±
The mathematical notation and definitions in the study are precise, consistent, and organised:

Notation Definition

S¹ Symmetric group of degree n

f:P ³P Aggregation function for n voters

Binary operation on group elements

e Identity element of a group

a{¹ Inverse element of a

Properties such as associativity, identity, and inverse are correctly denoted. Transitions from informal to formal mathematical
expressions are smooth. Concepts are clearly visualised through group permutations corresponding to vote rankings. No
ambiguity or symbol misuse is present.
Sě««añō: EŊe«éšañō Aééšucaču¿± ¿f Duÿcñeče
Mačhe«ačucÿ
This comprehensive case study demonstrates exemplary mastery across all five evaluation criteria:

L¿gucaš Reaÿ¿±u±g
Duÿcñeče Sčñěcčěñeÿ Deep analytical progression from
abstract concepts to applied voting
Applies Group Theory, permutation
theory with counterexamples
groups, and wreath products with
sophisticated understanding
Mačhe«ačucaš C¿ññecč±eÿÿ
All theorems, proofs, and derivations
are mathematically sound and
logically consistent
Mačhe«ačucaš Cšañučō
Precise notation, consistent Pñ¿bše«-S¿šļu±g
definitions, and smooth transitions
Creative and appropriate techniques
enhance understanding throughout connect advanced discrete concepts
with practical voting theory
Sō«b¿šÿ( & čheuñ «ea±u±g )