Ch 20 Scale Types May 23, 2011 presented by Tucker Lentz May 23, 2011 presented by Tucker Lentz.

Slides:



Advertisements
Similar presentations
Discrete Mathematics II
Advertisements

Introduction The concept of transform appears often in the literature of image processing and data compression. Indeed a suitable discrete representation.
CSCI 115 Chapter 6 Order Relations and Structures.
COUNTING AND PROBABILITY
Copyright © Cengage Learning. All rights reserved.
Discrete Mathematics Lecture 5 Alexander Bukharovich New York University.
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,
Parallel Scheduling of Complex DAGs under Uncertainty Grzegorz Malewicz.
Lecture 6 Hyperreal Numbers (Nonstandard Analysis)
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.
A Semantic Characterization of Unbounded-Nondeterministic Abstract State Machines Andreas Glausch and Wolfgang Reisig 1.
Chapter 5 Orthogonality
I. Homomorphisms & Isomorphisms II. Computing Linear Maps III. Matrix Operations VI. Change of Basis V. Projection Topics: Line of Best Fit Geometry of.
Discrete Mathematics Lecture 4 Harper Langston New York University.
Coordinate Systems (11/4/05) It turns out that every vector space V which has a finite basis can be “realized” as one of the spaces R n as soon as we pick.
I. Isomorphisms II. Homomorphisms III. Computing Linear Maps IV. Matrix Operations V. Change of Basis VI. Projection Topics: Line of Best Fit Geometry.
Sequence A list of objects arranged in a particular order.
Foundations of Measurement Ch 3 & 4 April 4, 2011 presented by Tucker Lentz April 4, 2011 presented by Tucker Lentz.
Preliminaries/ Chapter 1: Introduction. Definitions: from Abstract to Linear Algebra.
Definition and Properties of the Production Function Lecture II.
Quantum One: Lecture 7. The General Formalism of Quantum Mechanics.
WHOLE NUMBERS; INTEGERS Whole numbers: Z 0,+ = the natural numbers  {0}. Integers:
Partially Ordered Sets (POSets)
MTH-376 Algebra Lecture 1. Instructor: Dr. Muhammad Fazeel Anwar Assistant Professor Department of Mathematics COMSATS Institute of Information Technology.
CHAPTER FIVE Orthogonality Why orthogonal? Least square problem Accuracy of Numerical computation.
Mathematics. Session Functions, Limits and Continuity-1.
Solving fixpoint equations
UNIVERSAL FUNCTIONS A Construction Using Fourier Approximations.
 Let A and B be any sets A binary relation R from A to B is a subset of AxB Given an ordered pair (x, y), x is related to y by R iff (x, y) is in R. This.
Numbers, Operations, and Quantitative Reasoning.
4.1 Vector Spaces and Subspaces 4.2 Null Spaces, Column Spaces, and Linear Transformations 4.3 Linearly Independent Sets; Bases 4.4 Coordinate systems.
Logic and Philosophy Alan Hausman PART ONE Sentential Logic Sentential Logic.
Chapter 3 Functions Functions provide a means of expressing relationships between variables, which can be numbers or non-numerical objects.
Geometric Transformations:
SECTION 3 ISOMORPHIC BINARY STRUCTURES Definition Let  S,  and  S’,  ’  be binary algebraic structures. An isomorphism of S with S’ is a one-to-one.
Order in the Integers Characterization of the Ring of Integers.
Properties of Real Numbers. Sets In mathematics, a set is a collection of things Sets can be studies as a topic all on its own (known as set theory),
Chapter 5 – Relations and Functions. 5.1Cartesian Products and Relations Definition 5.1: For sets A, B  U, the Cartesian product, or cross product, of.
Copyright © Cengage Learning. All rights reserved. CHAPTER 8 RELATIONS.
Discrete Mathematics R. Johnsonbaugh
Week 6 - Friday.  What did we talk about last time?  Solving recurrence relations.
Chapter SETS DEFINITION OF SET METHODS FOR SPECIFYING SET SUBSETS VENN DIAGRAM SET IDENTITIES SET OPERATIONS.
Math 3121 Abstract Algebra I Lecture 10 Finish Section 11 Skip 12 – read on your own Start Section 13.
Math 3121 Abstract Algebra I Lecture 7: Finish Section 7 Sections 8.
CSNB 143 Discrete Mathematical Structures
FUNCTIONS COSC-1321 Discrete Structures 1. Function. Definition Let X and Y be sets. A function f from X to Y is a relation from X to Y with the property.
A function is a rule f that associates with each element in a set A one and only one element in a set B. If f associates the element b with the element.
Chapter 6- LINEAR MAPPINGS LECTURE 8 Prof. Dr. Zafer ASLAN.
4 Vector Spaces 4.1 Vector Spaces and Subspaces 4.2 Null Spaces, Column Spaces, and Linear Transformations 4.3 Linearly Independent Sets; Bases 4.4 Coordinate.
Week 15 - Wednesday.  What did we talk about last time?  Review first third of course.
Garis-garis Besar Perkuliahan
Properties of Groups Proposition 1: Let (G,  ) be a group. i.The inverse element of any element of G is unique. Remark: In view of i., we may use the.
Matrices, Vectors, Determinants.
Week 8 - Wednesday.  What did we talk about last time?  Relations  Properties of relations  Reflexive  Symmetric  Transitive.
Prepared By Meri Dedania (AITS) Discrete Mathematics by Meri Dedania Assistant Professor MCA department Atmiya Institute of Technology & Science Yogidham.
Sect. 4.5: Cayley-Klein Parameters 3 independent quantities are needed to specify a rigid body orientation. Most often, we choose them to be the Euler.
Math 3121 Abstract Algebra I
7.3 Linear Systems of Equations. Gauss Elimination
CHAPTER 3 SETS, BOOLEAN ALGEBRA & LOGIC CIRCUITS
Chapter 3 The Real Numbers.
Unit-III Algebraic Structures
Groups and Applications
The Basic of Measurement
Quantum One.
Homomorphisms (11/20) Definition. If G and G’ are groups, a function  from G to G’ is called a homomorphism if it is operation preserving, i.e., for all.
Group theory 101 Suggested reading:
UNITARY REPRESENTATIONS OF THE POINCARE GROUP
A Portrait of a Group on a Surface with Boundary
Presentation transcript:

Ch 20 Scale Types May 23, 2011 presented by Tucker Lentz May 23, 2011 presented by Tucker Lentz

Depth disclaimer Presentation only goes up to Theorem 7

What is the key to measurement? 1. Rich empirical structure 2. Symmetry 108

“By symmetry, one means that the structure is isomorphic to itself...” self-isomorphisms are called automorphisms Symmetry 109

Stanley Smith Stevens American psychologist who founded Harvard's Psycho-Acoustic Laboratorypsychologist Harvard Stevens’ Power Law in psychophysics “In most cases a formulation of the rules of assignment discloses directly the kind of measurement and hence the kind of scale involved. If there remains any ambiguity, we may seek the final and definitive answer in the mathematical group structure of the scale form: in what ways can we transform its values and still have it serve all the functions previously fulfilled?” 109

“Why do not psychologists accept the natural and obvious conclusion that subjective measurements of loudness in numerical terms (like those of length or weight or brightness)... are mutually inconsistent and cannot be the basis of measurement?” 110

“...Measurement is not a term with some mysterious inherent meaning, part of which may have been overlooked by physicists and may be in course of discovery by psychologists...we cease to know what is to be understood by the term when we encounter it; our pockets have been picked of a useful coin....” 110f

1. Wasn’t interested in existence and uniqueness theorems 2. Limited his work to only a handful of transformations and didn’t ask what the possible groups of transformations are. 3. Failed to raise the question of “possible candidate representations that exhibit a particular degree of uniqueness” (?) 4. No proper justification for the importance of invariance under automorphisms has been provided. Problems for Stevens 111f

Stevens’ Classification of Scale Types 113

A is a non-empty set (possibly empirical entities, possibly numbers) J is the index set, non empty, usually integers ∀ j ∈ J, S j is a relation of finite order on A A = A, S jj ∈ J is a relational structure Formal Definitions 115

If one of the S j is a weak or total order, we use ≿ A = A, ≿, S jj ∈ J is a weakly or totally ordered relational structure If A is a subset of Re and the weak or total order S j we used ≿ for is ≥, then we write ℛ = R, ≥, R jj ∈ J and call it an ordered numerical structure Formal Definitions 115

Isomorphism: φ is 1-to-1 mapping between the structures Homomorphism: φ is onto, but not 1-to-1 Automorphism: φ is an isomorphism between A and itself Endomorphism: φ is a homomorphism between A and itself Formal Definitions 115

Numerical Representation: A is a totally ordered structure ℛ is an ordered numerical structure A is isomorphic to ℛ Formal Definitions 115

M-point Homogeneity M is the size of two arbitrarily selected sets of ordered points that can always be mapped into each other by one of our automorphisms (element in ℋ ) 115

N-1 is the largest number of points at which any two distinct automorphic transformations may agree N-point Uniqueness 116

Note that we have moved from ℋ to G. Homogeneous if at least 1-point homogeneous Unique if there is an upper bound on the number of fixed points distinct automorphisms can agree Homogeneity and Uniqueness (in general) 116

M is the largest degree of homogeneity N is the least degree of uniqueness (M, N) is the scale type Scale Type 116

Theorem 1 i) if M-point homogeneous, then (M-1)-point homogeneous ii) If N-point unique, then (N+1)-point unique iii) M ≤ N 117

Theorem 2 M < order of some S j, or the scale type is (∞,∞) 117

For theorem 3 we need some more definitions F is a function or “generalized operation” on A n F is a set of generalized operations A -invariance Algebraic closure of B under F 118

Theorem 3 Another way of getting at N-point uniqueness, relating uniqueness to invariance 118

Dilation & Translation Every automorphism is either a dilation or a translation The identity function is the only automorphism that is both Dilations have at least one fixed point 118

Theorem 4 1-point uniqueness means that two translations can have at most 1 point in common. 118f

Real Relational Structures

“[The Archimedean] concept has been defined up to now only in structures for which an operation is either given or readily defined, as in the case of difference or conjoint structures. For general relational structures one does not know how to define the Archimedean property. This may be a reasonable way to do so in general, as is argued at some length in Luce and Narens (in press). Homogeneous, Archimedean Ordered Translation Groups 123

Theorem 7 123

124

124

“What is clear is that the usual physical representation involving units in no way depends upon extensive measurement or even on having an empirical operation. The key to the representation is for the structure lying on one component of an Archimedean conjoint structure to have translations that form a homogeneous, Archimedean ordered group...” Theorem 7 124f

END