Contents

Description of CHPV and GV

Introduction
Analogy
Weightings
Voting
Counting
Outcomes
Party-List
Summary

Evaluations of CHPV and GV

Ranked Ballot

Introduction (RB)
General Criteria
Majority Criteria
Clones & Teaming
Teaming Thresholds
Summary (RB)

Party-List

Introduction (PL)
Diagrams & Maps
CHPV Maps
Optimality
Party Cloning
Proportionality
Summary (PL)

Comparisons of CHPV with other voting systems

Single-Winner

Introduction (SW)
Plurality (FPTP)
Borda Count
Geometric Voting
Positional Voting
Condorcet Methods
AV (IRV)
Plur. Rule Methods
Summary (SW)

Multiple-Winner

Introduction (MW)
STV
Party-List
PL ~ Hare
PL ~ Droop
~ Maps Opt PC Pro
PL ~ D'Hondt
~ Maps Opt PC Pro
PL ~ Sainte-Laguë
~ Maps Opt PC Pro
Mixed Member Sys
Summary (MW)

Conclusions

Ranked Ballot CHPV
Party-List CHPV

General

Table of Contents

Map Construction

Table of Contents

Mathematical Proofs

Table of Contents
Notation & Formats

Valid XHTML 1.0 Strict

Valid CSS

Home About Description Evaluations(RB) Evaluations(PL) Comparisons(SW) Comparisons(MW) Conclusions General Maps Proofs
Home About Description Evaluations(RB) Evaluations(PL) Comparisons(SW) Comparisons(MW) Conclusions General Maps Proofs
Home > Proofs > Geometric Voting > CG1
Last Revision: New on 18 Oct 2020

Mathematical Proofs: Geometric Voting

Proof CG1: Common Ratio 'Arc' on a Three-Preference Map

Common Ratio Arc

For a three-candidate single-winner election employing a positional voting system, an equilateral triangular map can define and display the three normalised preference weightings used. Such a map is very similar in construction and use to the Three-Party CHPV Maps described in the Map Construction appendix. Here however, each apex represents a weighting of one for the stated preference and the opposing baseline represents a weighting of zero.

The point shown on the map hence represents a voting system whose weightings are a for the first preference (P1), b for the second one (P2) and c for the third (P3). As for any map, these three co-ordinate values must sum to unity.

For a GV system, the three preferences must be in the ratio 1:r:r2. These weightings can be normalised by dividing each one by the sum of the three. Therefore, the normalised weightings for a GV variant with a common ratio of r are as stated below.

GV Weightings

In order to plot each point as r varies, the conventional cartesian co-ordinates (x,y) may be used to replace the weighting co-ordinates (a,b,c). The cartesian origin as at the centre of the P1P3 baseline as shown. Bearing in mind that the map is an equilateral triangle with a perpendicular height of one, then the cartesian co-ordinates of the three apexes are as stated below left. The straight line equation for each of the three baselines is also given; below right.

Baseline Equations
Apex Co-ordinates

As each weighting varies from zero at its baseline to one at its apex, then the scaling constant k for each weighting can be determined as shown below.

Ka calculation Kb calculation Kc calculation

Substituting these three values for k back into their original equations yields the following relationships between the x,y and a,b,c co-ordinates. Clearly, as intended, the y and b co-ordinates are one and the same. By subtracting the first equation for y below from the third one, the transform equation for the x co-ordinate in terms of co-ordinates a and c is easily found as shown below right.

Equation for x
Equations for y

The equations for x and y as functions of a, b and c are now known and those for a, b and c as functions of r are already given above. Hence, using substitution, the equations for x and y as functions of r are given below.

x and y as a function of r

Using these equations, various points representing GV systems with particular common ratios can be plotted on the map. If this is done, it soon appears to be the case that all such points lie on a circular arc where its radius is 2/3 and its centre is offset from the origin at x = 0 and y = -1/3; as shown in the above map. To prove that all points do indeed lie on this arc, the general equation for any circle can be used. For a circle, the square of the radius is equal to the sum of the squares of the x and y co-ordinate values once the appropriate centre offset has been subtracted from each of these values. The equation for this particular circle is hence stated below. The derivation that follows simply shows that the left-hand side of the equation equals the right-hand side thereby proving that all points lie on this circle.

Equation for a circle

Notice that the gradient of the arc at the map centre is zero and at apex P1 it is the same as that of the P1P2 baseline.

For a positional voting system to be legitimate, the first preference must be worth more than the last preference and the lower of two adjacent preferences must not have a higher weighting. Otherwise, less-preferred candidates can get promoted over more-preferred ones. Inside the grey region of the map, P1 has a higher weighting than P2 and P2 has a higher weighting than P3. Hence, any point in another region of the map represents an invalid positional voting system.

Note that the equations used in this proof do not restrict r to be less than one. Here, the common ratio can be anywhere in the range 0 ≤ r ≤ ∞. Hence, the continuation of the arc from the map centre (where r = 1) to apex P3 (where r = ∞) is also shown on the map. Although values of r above unity are not permitted for legitimate positional voting systems, they remain valid for geometric sequences.


Return to main text > Comparisons: Geometric Voting 1

Refer to > Mathematical Proofs: Table of Contents