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.

Slides:

Advertisements

Similar presentations

1 2-4 Reasoning in Algebra Objectives: Use basic properties of algebra in reasoning Define congruence State the properties of congruence.

Advertisements

Reflexive example: AB = AB Symmetric example: AB = BA

Teoria podejmowania decyzji Relacja preferencji. Binarny relations – properties Pre-orders and orders, relation of rational preferences Strict preference.

Proving Segment Relationships Postulate The Ruler Postulate The points on any line or line segment can be paired with real numbers so that, given.

Chris Morgan, MATH G160 January 9, 2012 Lecture 1 Chapter 4.1, 4.2, & 4.3: Set Theory, Introduction to Probability.

Sets Definition of a Set: NAME = {list of elements or description of elements} i.e. B = {1,2,3} or C = {x  Z + | -4 < x < 4} Axiom of Extension: A set.

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.

1 Section 7.1 Relations and their properties. 2 Binary relation A binary relation is a set of ordered pairs that expresses a relationship between elements.

1 PROPERTIES OF EQUALITY Standard 1 SOLUTION OF EQUATIONS INCLUDING ABSOLUTE VALUE EQUATIONS EQUATIONS LEVEL 1 EQUATIONS LEVEL 2 EQUATIONS LEVEL 3 EQUATIONS.

1-7 The Distributive Property

Algebraic Properties: The Rules of Algebra Be Cool - Follow The Rules!

3-4 Algebra Properties Used in Geometry The properties of operations of real numbers that you used in arithmetic and algebra can be applied in geometry.

EXAMPLE 4 Use properties of equality LOGO You are designing a logo to sell daffodils. Use the information given. Determine whether m EBA = m DBC. SOLUTION.

Solving fixpoint equations

Chapter 7 Section 1.  Students will write ratios and solve proportions.

Chapter 3 – Set Theory .

Integers and Properties

Digraphs and Relations Warm Up. The Divisibility Relation Let “|” be the binary relation on N×N such that a|b (“a divides b”) iff there is an n ∈ N such.

Math Chapter 6 Part II. POWER SETS In mathematics, given a set S, the power set of S, written P(S) or 2 n(S), is the set of all subsets of S. Remember.

Sets Define sets in 2 ways  Enumeration  Set comprehension (predicate on membership), e.g., {n | n  N   k  k  N  n = 10  k  0  n  50} the set.

Building a System of Geometry Knowledge 2.4

2.4: Building a System of Geometric Knowledge

Reasoning with Properties from Algebra. Properties of Equality Addition (Subtraction) Property of Equality If a = b, then: a + c = b + c a – c = b – c.

Properties and Mental Computation p. 80. Math talk What are some math properties that we use? Why do you think we have them? Do you ever use them?

Section 2.4: Reasoning in Algebra

Chapter 2 Section 5. Objective  Students will make a connection between reasoning in Algebra and reasoning in Geometry.

Lesson Reasoning with Postulates and Algebra Properties.

Practical Considerations When t , the supp, then there will be a value of t when supp folds, it becomes multi-w-to-one-x mapping.

Relations, Functions, and Countability

Language: Set of Strings

A Quick Math Overview (not the last one!) Section 1.4, you should it read carefully! Reading the corresponding material from the book is strongly encouraged.

Mathematical Preliminaries

1.6 Solving Inequalities.. Trichotomy Property a b.

Network and Computer Security (CS 475) Modular Arithmetic

Rosen 1.6, 1.7. Basic Definitions Set - Collection of objects, usually denoted by capital letter Member, element - Object in a set, usually denoted by.

Geometry 2.5 Big Idea: Reason Using Properties from Algebra.

Chapter 2.5 Notes: Reason Using Properties from Algebra Goal: You will use algebraic properties in logical arguments.

1.2 Field Axioms (Properties) Notes on a Handout.

2.3 Diagrams and 2.4 Algebraic Reasoning. You will hand this in P. 88, 23.

Problem Statement How do we represent relationship between two related elements ?

Chapter 8 Equivalence Relations Let A and B be two sets. A relation R from A to B is a subset of AXB. That is, R is a set of ordered pairs, where the first.

Representing Relations Using Matrices A relation between finite sets can be represented using a zero-one matrix Suppose R is a relation from A = {a 1,

Lecture 4 Infinite Cardinals. Some Philosophy: What is “2”? Definition 1: 2 = 1+1. This actually needs the definition of “1” and the definition of the.

Properties of Algebra (aka all the rules that holds the math together!)

Determine the sequence of genes along a chromosome based on the following recombination frequencies A-C 20% A-D 10% B-C 15% B-D 5%

1.3 Segments and Measure The segment postulate Distance Formula.

2/26/ : Using Proof in Algebra1 Expectation: L3.3.1: Know the basic structure for a proof of an “if, then” statement.

1 Set Theory Second Part. 2 Disjoint Set let A and B be a set. the two sets are called disjoint if their intersection is an empty set. Intersection of.

Binary Relations Definition: A binary relation R from a set A to a set B is a subset R ⊆ A × B. Example: Let A = { 0, 1,2 } and B = {a,b} {( 0, a), (

Ch 2-5 Reasoning in Geometry and Algebra

2.5 Algebra Reasoning. Addition Property: if a=b, then a+c = b+c Addition Property: if a=b, then a+c = b+c Subtraction Property: if a=b, then a-c = b-c.

Chapter8 Relations 8.1: Relations and their properties.

Section 2.2 Day 1. A) Algebraic Properties of Equality Let a, b, and c be real numbers: 1) Addition Property – If a = b, then a + c = b + c Use them 2)

Warm Up Rewrite each term using math symbols you learned in chapter 1 (symbols for a line, angle, ray, etc.) Example: MN Ray MN _________________________________________________________.

2.4 Objective: The student will be able to:

Objective: To connect reasoning in algebra to geometry.

Aim: Full House Grid: 9 Grid Play: Calculate answer & cross it off

2. Definition of congruent segments AB = CD 2.

تصنيف التفاعلات الكيميائية

CHAPTER 7 SIMILAR POLYGONS.

Relations: representation and closures

2.5 Reason Using Properties from Algebra

PROPERTIES OF ALGEBRA.

Relations and their Properties

4.5 Equivalence Relations

Equivalence Relations

Equivalence Relations

Preliminaries/ Chapter 1: Introduction

Presentation transcript:

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 set A “The question arises whether similarly tight representations ever exist when there is no concatenation operation.” 136

Difference Measurement Extensive measurement: consider a set of movable rods Difference measurement: consider fixed points on a line. Consider a set of intervals between points We can construct standard sequences in A with an auxiliary, uncalibrated rod to lay off equal intervals 136

Difference Measurement Denoting elements of A by a, b, e, d, we denote intervals in A by ab, cd, etc. We distinguish between ab and ba. Comparison with a set of movable rods generates an ordering on the intervals in A. ab ≿ cd if some rod does not exceed ab but exceeds or matches cd. 137

Axiomatization of Difference Measurement Holder (1901) showed how the measurement of intervals between points on a line can be reduced to extensive measurement. Standard sequences of equally spaced elements a 1, a 2, a 3,..., where the intervals a 1 a 2 ∼ a 2 a 3 ∼... Equivalent intervals are identified with a single element, their equivalence class 143

Otto Ludwig Hölder

Positive Difference Structures 145

145

147 Interpret A as the set of endpoints of intervals. A* is the set of positive intervals, and is a subset of A x A.

Positive Difference Structures 147 Transitivity

Positive Difference Structures 147 Axiom 3 guarantees that there are no null intervals. Note it also follows that A* is not reflexive or symmetric.

Positive Difference Structures 147 Weak monotonicity: this is needed to guarantee that concatenation of non-adjacent intervals gets the right results

Positive Difference Structures 147 Archimedean axiom: a n a 1 = (n-1)a 2 a 1

Positive Difference Structures 147 Archimedean axiom: a n a 1 = (n-1)a 2 a 1

Positive Difference Structures 147

147

Algebraic Difference Structures 151 We now allow for negative and null intervals, so we don’t need A*.

Algebraic Difference Structures 151 Axioms 2 and 3 of Definition 1 are here replaced by Axiom 2. It is a pretty intuitive axiom

Algebraic Difference Structures 151 Axioms 3-5 are correspond to axioms 4-6 of Definition 1

Algebraic Difference Structures 151

Cross Modality Difference Structures 165 Solvability axiom: The first part says that any element in A i x A i can be matched with an element in A 1 x A 1. The second part is just the normal solvability property for A 1. But because of the first part, it follows that all the A i have the solvability property. This is also why the Archimedean axiom is formulated for A 1.

Finite, Equally Spaced Difference Structures 167

Absolute-Difference Structures 172 Axiom 3: Betweenness is well behaved i) If b is between a and c, and if c is between b and d, then c and b are between a and d. ii) If b is between a and c and c is between a and d, then ad exceeds bd

Absolute-Difference Structures 172 Weak Monotonicity: If b is between a and c and b’ is between a’ and c’, and ab ∼ a’b’, then bc ≿ b’c’ iff ac ≿ a’c’

Absolute-Difference Structures 172 Solvability: if ab ≿ cd, then there is some d’ that is between a and b such that ad’ ∼ cd

Absolute-Difference Structures 172 Archimedean: a i is between a 1 and a i+1 for all i, and successive intervals are non-null. a i a 1 is strictly bounded.

Absolute-Difference Structures 173

End