Foundations of Measurement Ch 3 & 4 April 4, 2011 presented by Tucker Lentz April 4, 2011 presented by Tucker Lentz.

Slides:



Advertisements
Similar presentations
Chapter 3 Direct Proof and Proof by Contrapositive
Advertisements

Types of Logic Circuits
Ch 4: Difference Measurement. Difference Measurement In Ch 3 we saw the kind of representation you can get with a concatenation operation on an ordered.
Copyright © Cengage Learning. All rights reserved. CHAPTER 5 SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION.
Elementary Number Theory and Methods of Proof
Section 7.4: Closures of Relations Let R be a relation on a set A. We have talked about 6 properties that a relation on a set may or may not possess: reflexive,
EC941 - Game Theory Prof. Francesco Squintani Lecture 8 1.
Lecture 6 Hyperreal Numbers (Nonstandard Analysis)
Copyright © Cengage Learning. All rights reserved.
Math 3121 Abstract Algebra I
Algebraic Structures DEFINITIONS: PROPERTIES OF BINARY OPERATIONS Let S be a set and let  denote a binary operation on S. (Here  does not necessarily.
1.  Detailed Study of groups is a fundamental concept in the study of abstract algebra. To define the notion of groups,we require the concept of binary.
Finite Automata Great Theoretical Ideas In Computer Science Anupam Gupta Danny Sleator CS Fall 2010 Lecture 20Oct 28, 2010Carnegie Mellon University.
Discrete Structures Chapter 2 Part B Mathematical Induction
Probability theory 2011 Convergence concepts in probability theory  Definitions and relations between convergence concepts  Sufficient conditions for.
Preliminaries/ Chapter 1: Introduction. Definitions: from Abstract to Linear Algebra.
2012: J Paul GibsonTSP: Mathematical FoundationsMAT7003/L5- CountingAndEnumeration.1 MAT 7003 : Mathematical Foundations (for Software Engineering) J Paul.
Rational and Real Numbers The Rational Numbers are a field Rational Numbers are an integral domain, since all fields are integral domains What other properties.
WHOLE NUMBERS; INTEGERS Whole numbers: Z 0,+ = the natural numbers  {0}. Integers:
Monotone Sequences Objective: To define a Monotone Sequence and determine whether it converges or not.
1 Chapter 8 The Discrete Fourier Transform 2 Introduction  In Chapters 2 and 3 we discussed the representation of sequences and LTI systems in terms.
C OURSE : D ISCRETE STRUCTURE CODE : ICS 252 Lecturer: Shamiel Hashim 1 lecturer:Shamiel Hashim second semester Prepared by: amani Omer.
Set theory Sets: Powerful tool in computer science to solve real world problems. A set is a collection of distinct objects called elements. Traditionally,
Slide 5-1 Copyright © 2005 Pearson Education, Inc. SEVENTH EDITION and EXPANDED SEVENTH EDITION.
Math 3121 Abstract Algebra I Lecture 3 Sections 2-4: Binary Operations, Definition of Group.
Linear Algebra Chapter 4 Vector Spaces.
Inequalities and Proof
Numbers, Operations, and Quantitative Reasoning.
The importance of sequences and infinite series in calculus stems from Newton’s idea of representing functions as sums of infinite series.  For instance,
Week 15 - Wednesday.  What did we talk about last time?  Review first third of course.
Homework Review notes Complete Worksheet #1. Homework Let A = {a,b,c,d}, B = {a,b,c,d,e}, C = {a,d}, D = {b, c} Describe any subset relationships. 1.
Set, Combinatorics, Probability & Number Theory Mathematical Structures for Computer Science Chapter 3 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Set,
The Integers. The Division Algorithms A high-school question: Compute 58/17. We can write 58 as 58 = 3 (17) + 7 This forms illustrates the answer: “3.
Relations, Functions, and Matrices Mathematical Structures for Computer Science Chapter 4 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesFunctions.
April 14, 2015Applied Discrete Mathematics Week 10: Equivalence Relations 1 Properties of Relations Definition: A relation R on a set A is called transitive.
Mathematical Induction
Week 11 - Monday.  What did we talk about last time?  Binomial theorem and Pascal's triangle  Conditional probability  Bayes’ theorem.
Copyright © Cengage Learning. All rights reserved. CHAPTER 8 RELATIONS.
CS201: Data Structures and Discrete Mathematics I
Week 6 - Friday.  What did we talk about last time?  Solving recurrence relations.
Chap. 4 Vector Spaces 4.1 Vectors in Rn 4.2 Vector Spaces
ICS 253: Discrete Structures I Induction and Recursion King Fahd University of Petroleum & Minerals Information & Computer Science Department.
Foundations of Discrete Mathematics Chapter 4 By Dr. Dalia M. Gil, Ph.D.
Math 344 Winter 07 Group Theory Part 2: Subgroups and Isomorphism
1 Quasi-randomness is determined by the distribution of copies of a graph in equicardinal large sets Raphael Yuster University of Haifa.
INM175 Topic 8 1 Module INM175 Discrete Mathematics Topic 8 Algebraic Theories.
UNIT - 2.  A binary operation on a set combines two elements of the set to produce another element of the set. a*b  G,  a, b  G e.g. +, -, ,  are.
CS 203: Introduction to Formal Languages and Automata
Great Theoretical Ideas in Computer Science.
Great Theoretical Ideas In Computer Science Anupam GuptaCS Fall 2006 Lecture 15Oct 17, 2006Carnegie Mellon University Algebraic Structures: Groups,
Ch 20 Scale Types May 23, 2011 presented by Tucker Lentz May 23, 2011 presented by Tucker Lentz.
Copyright © Cengage Learning. All rights reserved. CHAPTER 8 RELATIONS.
Copyright © Zeph Grunschlag, Induction Zeph Grunschlag.
Module #3 - Sets 3/2/2016(c) , Michael P. Frank 2. Sets and Set Operations.
Finite Automata Great Theoretical Ideas In Computer Science Victor Adamchik Danny Sleator CS Spring 2010 Lecture 20Mar 30, 2010Carnegie Mellon.
12. Lecture WS 2012/13Bioinformatics III1 V12 Menger’s theorem Borrowing terminology from operations research consider certain primal-dual pairs of optimization.
Algebra 2 Properties of Real Numbers Lesson 1-2 Goals Goal To graph and order real numbers. To Identity properties of real numbers. Rubric Level 1 –
Proof And Strategies Chapter 2. Lecturer: Amani Mahajoub Omer Department of Computer Science and Software Engineering Discrete Structures Definition Discrete.
Chapter 2 Sets and Functions.
Chapter 3 The Real Numbers.
The Language of Sets If S is a set, then
Unit-III Algebraic Structures
Great Theoretical Ideas in Computer Science
Set, Combinatorics, Probability & Number Theory
B.Sc. III Year Mr. Shrimangale G.W.
Alternating tree Automata and Parity games
Great Theoretical Ideas in Computer Science
Foundations of Discrete Mathematics
Preliminaries/ Chapter 1: Introduction
From the last time: gcd(a, b) can be characterized in two different ways: It is the least positive value of ax + by where x and y range over integers.
Presentation transcript:

Foundations of Measurement Ch 3 & 4 April 4, 2011 presented by Tucker Lentz April 4, 2011 presented by Tucker Lentz

Agenda 11:00 Chapter 3: Extensive Measurement 12:40 break 12:50 Chapter 4: Difference Measurement 11:00 Chapter 3: Extensive Measurement 12:40 break 12:50 Chapter 4: Difference Measurement

Ch 3: Extensive Measurement

Closed Extensive Structure closed, i.e., when any two objects can be concatenated Connectivity: for all a, b ∈ A, a ≿ b or b ≾ a (p14) 73 No matter what the difference is between c and d, as long as a strictly exceeds b, there is some integer that when multiplied by the difference between a and b will swamp the difference between c and d. there are no negative nor zero elements

Closed Extensive Structure 74

Formal Proof of Theorem 1 80

is a simply ordered group iff is a simple order is a group If a ≿ b, then a○c ≿ b○c and c○a ≿ c○b. is also Archimedean if (with the identity element e) a ≻ e, then na ≻ b, for some n. Theorem 5 (Holder's Theorem) An Archimedean simply ordered group is isomorphic to a subgroup of, and the isomorphism is unique up to scaling by a positive constant.

LEMMA 1: There is no anomalous pair. (p 77) LEMMA 2: Every element is either positive, null or negative. (p 78) LEMMA 3: A, ≿, ◦ is weakly commutative (p 78) LEMMA 4: The relation ≈ on A x A is an equivalence relation (p 79) Formal Proof of Theorem 1

79

81 Lemma 6 and Theorem 2.5 prove the existence ofa real-valued function ψ on D such that such that for all [a, b], [c, d] ∈ D 80

Formal Proof of Theorem 1 Define ϕ on A as follows: for all a ∈ A, ϕ (a) = ψ([2a, a]). We verify that ϕ has the desired properties.

Informal Proof Sketch

Select any e in A; this will be the unit. For any other a in A, and for any positive integer n, the Archimedean axiom guarantees that there is an integer m for which me ≻ na. Let m n be the least integer for which this is true, namely, m n e ≻ na ≿ (m n - l)e. Thus, m n copies of e, are approximately equal to n copies of a. As we select n larger and larger, the approximation presumably gets closer and closer and, assuming that the limit exists, it is plausible to define 75

When concatenation is not closed B is the subset of A x A that contains the pairs that can be concatenated (82) 84

Extensive structure with no essential maximum The new associativity: if a, b can be concatenated, and a ◦ b can be concatenated with c, then any concatenation of a, b and c is allowed (82) 84

Extensive structure with no essential maximum Commutativity and monotonicity: If a and c can be concatenated, and a strictly exceeds b, then c and b can be concatenated, and the concatenation of a and c must exceed the concatenation of c and b. (83) 84

Extensive structure with no essential maximum Solvability postulate: there is no smallest element A that can be concatenated. (83) 84

Extensive structure with no essential maximum Positivity 84

Extensive structure with no essential maximum Archimedean axiom: In the earlier structure we defined na and then had for any b in A, there is an n such that na ≿ b. However, because of the restrictions on B, we may not arbitrarily concatenate elements in A. So axiom 6 defines a strictly bounded standard sequence, and assumes it is finite. (83-84) 84

Extensive structure with no essential maximum 85

Some Empirical Interpretations New concatenation operation: a * b is the hypotenuse of a right triangle formed by rods a and b This results in a structure A, ≿, * that satisfies the axioms of definition 3, and the resulting ψ is proportional to ϕ 2 88

Some Empirical Interpretations “To most people, the new interpretation seems much more artificial than the original one. In spite of this strong feeling, neither Ellis nor the authors know of any argument for favoring the first interpretation except familiarity, convention, and, perhaps, convenience...” 88

Some Empirical Interpretations 89

89

90 A, ≿, ◦ A, ≿ ’, ‖

Velocity In a Newtonian universe, a closed extensive structure A, ≿, ◦ could represent velocity For a relativistic universe we need to introduce extensive structures with essential maxima

Essential Maxima in Extensive Structures 92

92

92

92 Theorem 7 gives the representation required for relativistic velocities

Non-Additive Representations right-angled concatenation and relativistic velocity are two examples of non-additive representations  a third: Consider a positive extensive structure with a scale ϕ additive over  ; then ψ = exp ϕ is an alternative scale, which is multiplicative over . 100

Non-Additive Representations 100

Conventionality of Representations 102 “...despite its great appeal and universal acceptance, the additive representation is just one of the infinitely many, equally adequate representations that are generated by the family of strictly monotonic increasing functions from the reals onto the positive reals...”

Extensive Measurement in the Social Sciences In many cases, there is no concatenation operation appropriate to the entities of interest in social science However, an empirical concatenation operation is not necessary for fundamental measurement There are cases where it works, e.g., subjective probability (ch 5) and risk (3.14.1)

Risk 125

126

127

127

Limitations of Extensive Measurement While I am certain we won’t have time to discuss it, I highly recommend reading the 2 page discussion of this topic (pages ).

End