Proof that if Voting is Perfect in One Dimension, then the First. Eigenvector Extracted from the Double-Centered Transformed

Similar documents
Rank One Update And the Google Matrix by Al Bernstein Signal Science, LLC

p (i.e., the set of all nonnegative real numbers). Similarly, Z will denote the set of all

Principle Component Analysis

The Schur-Cohn Algorithm

7.2 Volume. A cross section is the shape we get when cutting straight through an object.

Review of linear algebra. Nuno Vasconcelos UCSD

The Number of Rows which Equal Certain Row

Model Fitting and Robust Regression Methods

Learning Enhancement Team

Variable time amplitude amplification and quantum algorithms for linear algebra. Andris Ambainis University of Latvia

ψ ij has the eigenvalue

Jens Siebel (University of Applied Sciences Kaiserslautern) An Interactive Introduction to Complex Numbers

QUADRATIC RESIDUES MATH 372. FALL INSTRUCTOR: PROFESSOR AITKEN

Introduction to Group Theory Note 2 Theory of Representation

4. Eccentric axial loading, cross-section core

FUNDAMENTALS ON ALGEBRA MATRICES AND DETERMINANTS

Demand. Demand and Comparative Statics. Graphically. Marshallian Demand. ECON 370: Microeconomic Theory Summer 2004 Rice University Stanley Gilbert

set is not closed under matrix [ multiplication, ] and does not form a group.

Haddow s Experiment:

Dennis Bricker, 2001 Dept of Industrial Engineering The University of Iowa. MDP: Taxi page 1

VECTORS VECTORS VECTORS VECTORS. 2. Vector Representation. 1. Definition. 3. Types of Vectors. 5. Vector Operations I. 4. Equal and Opposite Vectors

VECTORS AND TENSORS IV.1.1. INTRODUCTION

Converting Regular Expressions to Discrete Finite Automata: A Tutorial

INTRODUCTION TO COMPLEX NUMBERS

( ) ( )()4 x 10-6 C) ( ) = 3.6 N ( ) = "0.9 N. ( )ˆ i ' ( ) 2 ( ) 2. q 1 = 4 µc q 2 = -4 µc q 3 = 4 µc. q 1 q 2 q 3

Fundamental Theorem of Calculus

Math 497C Sep 17, Curves and Surfaces Fall 2004, PSU

COMPLEX NUMBER & QUADRATIC EQUATION

Lecture 2e Orthogonal Complement (pages )

AT100 - Introductory Algebra. Section 2.7: Inequalities. x a. x a. x < a

Language Processors F29LP2, Lecture 5

Chapter Newton-Raphson Method of Solving a Nonlinear Equation

I. Theory of Automata II. Theory of Formal Languages III. Theory of Turing Machines

September 13 Homework Solutions

The Geometry of Logit and Probit

1 From NFA to regular expression

2.4 Linear Inequalities and Interval Notation

Supplement 4 Permutations, Legendre symbol and quadratic reciprocity

Homework 3 Solutions

Intermediate Math Circles Wednesday, November 14, 2018 Finite Automata II. Nickolas Rollick a b b. a b 4

Multiple view geometry

Chapter 9 Definite Integrals

Convert the NFA into DFA

Physics for Scientists and Engineers I

CS 373, Spring Solutions to Mock midterm 1 (Based on first midterm in CS 273, Fall 2008.)

Vectors , (0,0). 5. A vector is commonly denoted by putting an arrow above its symbol, as in the picture above. Here are some 3-dimensional vectors:

I1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix

Introduction to Group Theory

Review of Gaussian Quadrature method

Quiz: Experimental Physics Lab-I

UNIVERSITY OF IOANNINA DEPARTMENT OF ECONOMICS. M.Sc. in Economics MICROECONOMIC THEORY I. Problem Set II

INTRODUCTORY NUMERICAL ANALYSIS

USA Mathematical Talent Search Round 1 Solutions Year 25 Academic Year

p-adic Egyptian Fractions

Matrix Algebra. Matrix Addition, Scalar Multiplication and Transposition. Linear Algebra I 24

Study of Trapezoidal Fuzzy Linear System of Equations S. M. Bargir 1, *, M. S. Bapat 2, J. D. Yadav 3 1

Quadratic Forms. Quadratic Forms

Two Coefficients of the Dyson Product

consider in the case of 1) internal resonance ω 2ω and 2) external resonance Ω ω and small damping

Regular expressions, Finite Automata, transition graphs are all the same!!

GAUSS ELIMINATION. Consider the following system of algebraic linear equations

1. For each of the following theorems, give a two or three sentence sketch of how the proof goes or why it is not true.

H-matrix theory and applications

CS 301. Lecture 04 Regular Expressions. Stephen Checkoway. January 29, 2018

Quadratic reciprocity

QUADRATIC EQUATIONS OBJECTIVE PROBLEMS

FINITE NEUTROSOPHIC COMPLEX NUMBERS. W. B. Vasantha Kandasamy Florentin Smarandache

Least squares. Václav Hlaváč. Czech Technical University in Prague

Watson-Crick local languages and Watson-Crick two dimensional local languages

Substitution Matrices and Alignment Statistics. Substitution Matrices

Graph Theory. Dr. Saad El-Zanati, Faculty Mentor Ryan Bunge Graduate Assistant Illinois State University REU. Graph Theory

Math 4310 Solutions to homework 1 Due 9/1/16

Applied Statistics Qualifier Examination

CMPSCI 250: Introduction to Computation. Lecture #31: What DFA s Can and Can t Do David Mix Barrington 9 April 2014

An Introduction to Support Vector Machines

Industrial Electrical Engineering and Automation

LINEAR ALGEBRA APPLIED

COMPLEX NUMBERS INDEX

Trigonometry. Trigonometry. Solutions. Curriculum Ready ACMMG: 223, 224, 245.

USA Mathematical Talent Search Round 1 Solutions Year 21 Academic Year

The area under the graph of f and above the x-axis between a and b is denoted by. f(x) dx. π O

Simplifying Algebra. Simplifying Algebra. Curriculum Ready.

Math 154B Elementary Algebra-2 nd Half Spring 2015

Farey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University

5. (±±) Λ = fw j w is string of even lengthg [ 00 = f11,00g 7. (11 [ 00)± Λ = fw j w egins with either 11 or 00g 8. (0 [ ffl)1 Λ = 01 Λ [ 1 Λ 9.

DCDM BUSINESS SCHOOL NUMERICAL METHODS (COS 233-8) Solutions to Assignment 3. x f(x)

U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017

Recursively Enumerable and Recursive. Languages

Designing finite automata II

Tries and suffixes trees

Chapter Newton-Raphson Method of Solving a Nonlinear Equation

Announcements. Image Formation: Outline. The course. Image Formation and Cameras (cont.)

Strong Bisimulation. Overview. References. Actions Labeled transition system Transition semantics Simulation Bisimulation

Calculus Module C21. Areas by Integration. Copyright This publication The Northern Alberta Institute of Technology All Rights Reserved.

Introduction to Algebra - Part 2

10. AREAS BETWEEN CURVES

Andrew Ryba Math Intel Research Final Paper 6/7/09 (revision 6/17/09)

Homework 4. 0 ε 0. (00) ε 0 ε 0 (00) (11) CS 341: Foundations of Computer Science II Prof. Marvin Nakayama

Chapter 2 Finite Automata

Transcription:

Proof tht f Votng s Perfect n One Dmenson, then the Frst Egenvector Extrcted from the Doule-Centered Trnsformed Agreement Score Mtrx hs the Sme Rn Orderng s the True Dt Keth T Poole Unversty of Houston 4 Ferury 00 Notton nd Defntons Let the true del onts of the legsltors e denoted s,,, Wthout loss of generlty let the orderng of the true del onts of the legsltors on the dmenson from left to rght e: 3 Let e the numer of non-unnmous roll cll votes wth > 0 nd let the cutont for the jth roll cll e Z j Votng s erfect Tht s, ll legsltors re sncere voters nd ll legsltors to the left of cutont vote for the sme lterntve nd ll legsltors to rght of cutont vote for the oostve lterntve For exmle, f ll legsltors to the left of Z j vote Ny, then ll legsltors to the rght of Z j vote Ye Wthout loss of generlty we cn ssume tht every legsltor to the left of Z j votes Ye nd every legsltor to the rght of Z j votes Ny Tht s, the olrty of the roll cll does not ffect the nlyss elow

Let e the numer of cutonts etween legsltors nd, e the numer of cutonts etween legsltors nd 3, nd so on, wth - eng the numer of cutonts etween legsltors - nd Hence - () = = > 0 The greement score etween two legsltors s the smle roorton of roll clls tht they vote for the sme outcome Hence, the greement score etween legsltors - nd s smly ecuse nd gree on ll roll clls excet for those wth cutonts etween them Smlrly, the greement score etween legsltors nd 3 s - - - nd the greement score etween legsltors nd 3 s In generl, for two legsltors nd where, the greement score s: A = - - = () These defntons llow me to stte the followng theorem: Theorem: If Votng s Perfect n One Dmenson, then the Frst Egenvector Extrcted From the Doule Centered y Mtrx of Sured Dstnces from Euton (3) hs t Lest the Sme We Monotone Rn Orderng s the Legsltors Proof: The greement scores cn e treted s Euclden dstnces y smly sutrctng them from Tht s:

- - - = d = - A = - = = (3) The d s comuted from euton (3) stsfy the three xoms of dstnce: they re nonnegtve ecuse y () 0 A so tht 0 d ; they re symmetrc, d = d ; nd they stsfy the trngle neulty To see ths, consder ny trle of onts < < c The dstnces re: d = - = nd d = c c- = nd d = c c- = Hence d c = d + d c (4) Becuse ll the trngle neultes re eultes, n Euclden geometry ths mles tht,, nd c ll le on strght lne (Borg nd Groenen, 997, ch 8) Becuse ll the trngle neultes re eultes nd ll trles of onts le on strght lne, the dstnces comuted from () cn e drectly wrtten s dstnces etween onts: - d = = = (5) where d = 0 The y mtrx of sured dstnces s: D = 0 ( ) ( ) ( ) 0 ( ) ( ) ( ) 0 (6) 3

To recover the s, smly doule-center D nd erform n egenvlueegenvector decomoston The frst egenvector s the soluton To see ths: Where Let the men of the jth column of D e Let the men of the th row of D e Let the men of the mtrx D e = = s the men of the dj = = j j j d = = - + dj j j= j= d = = - + dj j = j= j= = d = = - + The mtrx D s doule-centered s follows: from ech element sutrct the row men, sutrct the column men, dd the mtrx men, nd dvde y ; tht s, (d j - d j - d + d ) y j = = ( )( j ) Ths roduces the y symmetrc ostve semdefnte mtrx Y: Y = (7) Becuse Y s symmetrc wth rn of one, ts egenvlue-egenvector decomoston s smly: 4

u u Y = λ u u u u (8) Hence, the soluton s u u = λ u Becuse, wthout loss of generlty, the orgn cn e lced t zero, tht s, = 0, the soluton cn lso e wrtten s: u u = λ u (9) The onts from (9) exctly reroduce the dstnces n (4), the greement scores n (), nd the orgnl roll cll votes In ddton, note tht the mrror mge of the onts n (9) ( multlcton y mnus one) lso exctly reroduces the orgnl roll cll votes Furthermore, for ny r of true legsltor del onts nd wth one or more mdonts etween them, < Zj <, the recovered legsltor del onts must hve the sme orderng, < If there re no mdonts etween nd -- tht s, 5

ther roll cll votng ttern s dentcl -- then the recovered legsltor del onts re dentcl; = Hence, f there re cuttng onts etween every r of djcent legsltors, tht s, for =,, -, then the rn orderng of the recovered del onts s the sme s the true rn orderng If some of the = 0, then the recovered del onts hve we monotone trnsformton of the true rn orderng (n other words there re tes, some legsltors hve the sme recovered del onts) Ths comletes the roof QED Dscusson Note tht n ntervl level set of onts s recovered However, ths s n rtfct of the dstruton of cuttng onts For exmle, f >, ths hs the effect of mng d > d 3 even f the true coordntes,, 3 were evenly sced Wth erfect one dmensonl votng, the legsltor confgurton s only dentfed u to we monotone trnsformton of the true rn orderng The rn orderng cn lso e recovered from the mtrx Y gven n (7) wthout erformng n egenvlue-egenvector decomoston Note tht, wth the orgn t zero, the dgonl elements of Y re smly the legsltor coordntes sured The rn orderng cn e recovered y tng the sure root of the frst dgonl element nd then dvdng through the frst row of the mtrx Note tht ths sets > 0 nd the remnng onts re dentfed vs vs 6