Signed-Bit Representations of Real Numbers and the Constructive Stone-Yosida Theorem Robert S. Lubarsky and Fred Richman Florida Atlantic University.

Slides:



Advertisements
Similar presentations
Vector Spaces A set V is called a vector space over a set K denoted V(K) if is an Abelian group, is a field, and For every element vV and K there exists.
Advertisements

Completeness and Expressiveness
The proof is quite similar to that of a previous result: a compact subspace of a Hausdorff is closed. Theorem: If topological X  space is compact and.
Lecture 7 Surreal Numbers. Lecture 7 Surreal Numbers.
6.1 Vector Spaces-Basic Properties. Euclidean n-space Just like we have ordered pairs (n=2), and ordered triples (n=3), we also have ordered n-tuples.
Recursive Definitions and Structural Induction
Lecture 6 Hyperreal Numbers (Nonstandard Analysis)
II. Linear Independence 1.Definition and Examples.
Introduction to Computability Theory
Great Theoretical Ideas in Computer Science.
I. Homomorphisms & Isomorphisms II. Computing Linear Maps III. Matrix Operations VI. Change of Basis V. Projection Topics: Line of Best Fit Geometry of.
1 Undecidability Andreas Klappenecker [based on slides by Prof. Welch]
EE1J2 – Discrete Maths Lecture 7
CS2420: Lecture 27 Vladimir Kulyukin Computer Science Department Utah State University.
Introduction to Gröbner Bases for Geometric Modeling Geometric & Solid Modeling 1989 Christoph M. Hoffmann.
1 Decidability continued. 2 Undecidable Problems Halting Problem: Does machine halt on input ? State-entry Problem: Does machine enter state halt on input.
Preliminaries/ Chapter 1: Introduction. Definitions: from Abstract to Linear Algebra.
App III. Group Algebra & Reduction of Regular Representations 1. Group Algebra 2. Left Ideals, Projection Operators 3. Idempotents 4. Complete Reduction.
ORDINAL NUMBERS VINAY SINGH MARCH 20, 2012 MAT 7670.
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.
Relations Chapter 9.
Sets.
MA5209 Algebraic Topology Wayne Lawton Department of Mathematics National University of Singapore S ,
Section 1.8: Functions A function is a mapping from one set to another that satisfies certain properties. We will first introduce the notion of a mapping.
Topological Forcing Semantics with Settling Robert S. Lubarsky Florida Atlantic University.
Solving fixpoint equations
T. Mhamdi, O. Hasan and S. Tahar, HVG, Concordia University Montreal, Canada July 2010 On the Formalization of the Lebesgue Integration Theory in HOL On.
CSE & CSE6002E - Soft Computing Winter Semester, 2011 More Rough Sets.
Computably Enumerable Semigroups, Algebras, and Groups Bakhadyr Khoussainov The University of Auckland New Zealand Research is partially supported by Marsden.
1 Network and Computer Security (CS 475) Modular Arithmetic and the RSA Public Key Cryptosystem Jeremy R. Johnson.
COMPSCI 102 Introduction to Discrete Mathematics.
Chapter 4 Hilbert Space. 4.1 Inner product space.
ICS 253: Discrete Structures I Induction and Recursion King Fahd University of Petroleum & Minerals Information & Computer Science Department.
Network and Computer Security (CS 475) Modular Arithmetic
CS 103 Discrete Structures Lecture 13 Induction and Recursion (1)
Math 344 Winter 07 Group Theory Part 2: Subgroups and Isomorphism
Some Aspects of Quasi-Stone Algebras, II Solutions and Simplifications of Some Problems from Sankappanavar and Sankappanavar Jonathan David Farley, D.Phil.
Great Theoretical Ideas in Computer Science.
1 CS 140 Discrete Mathematics Combinatorics And Review Notes.
1 Melikyan/DM/Fall09 Discrete Mathematics Ch. 7 Functions Instructor: Hayk Melikyan Today we will review sections 7.3, 7.4 and 7.5.
 Example: [Z m ;+,*] is a field iff m is a prime number  [a] -1 =?  If GCD(a,n)=1,then there exist k and s, s.t. ak+ns=1, where k, s  Z.  ns=1-ak.
8.5 Equivalence Relations
CompSci 102 Discrete Math for Computer Science March 13, 2012 Prof. Rodger Slides modified from Rosen.
Relations and Functions ORDERED PAIRS AND CARTESIAN PRODUCT An ordered pair consists of two elements, say a and b, in which one of them, say a is designated.
2004/10/5fuzzy set theory chap03.ppt1 Classical Set Theory.
The main study of Field Theory By: Valerie Toothman
Summary of the Last Lecture This is our second lecture. In our first lecture, we discussed The vector spaces briefly and proved some basic inequalities.
Linear Programming Chap 2. The Geometry of LP  In the text, polyhedron is defined as P = { x  R n : Ax  b }. So some of our earlier results should.
Section 2.5. Cardinality Definition: A set that is either finite or has the same cardinality as the set of positive integers (Z + ) is called countable.
Chapter 2 1. Chapter Summary Sets (This Slide) The Language of Sets - Sec 2.1 – Lecture 8 Set Operations and Set Identities - Sec 2.2 – Lecture 9 Functions.
INTERPOLATORY SOLUTIONS OF LINEAR ODE’S AND EXTENSIONS Wayne M. Lawton Dept. of Mathematics, National University of Singapore 2 Science Drive 2, Singapore.
Prepared By Meri Dedania (AITS) Discrete Mathematics by Meri Dedania Assistant Professor MCA department Atmiya Institute of Technology & Science Yogidham.
“It is impossible to define every concept.” For example a “set” can not be defined. But Here are a list of things we shall simply assume about sets. A.
The Principle of ImageCollection by Albert Ziegler University of Munich (LMU)
Chapter 2 Sets and Functions.
Discrete Mathematics CS 2610
The Language of Sets If S is a set, then
Department of Mathematics
Unit-III Algebraic Structures
Chapter 2 Sets and Functions.
Existence of Non-measurable Set
Chapter 2 Sets and Functions.
Lecture 7 Functions.
Section 4.1: Vector Spaces and Subspaces
Section 4.1: Vector Spaces and Subspaces
VII.1 Hille-Yosida Theorem
Chapter 5 Limits and Continuity.
Preliminaries/ Chapter 1: Introduction
Chapter 7 Quotients.
Chapter 3: Simplicial Homology Instructor: Yusu Wang
Presentation transcript:

Signed-Bit Representations of Real Numbers and the Constructive Stone-Yosida Theorem Robert S. Lubarsky and Fred Richman Florida Atlantic University

Def A Riesz space R is a lattice ordered vector space. Canonical example A (natural) collection of functions from some domain into the reals ℝ -- meet and join computed pointwise. Representation Theorem (Stone, Yosida, …) (classical) Every Riesz space is embeddable into a function space. (Extensions: Preserving certain structure; domain a quotient of a function space, etc.)

Proof idea For R ⊆ ℝ W, w  W induces ŵ : R → ℝ via ŵ(f) = f(w). So for a general Riesz space R, the desired domain is a subset of Σ = Hom(R, ℝ). So embed R into ℝ Σ. █

Proof idea For R ⊆ ℝ W, w  W induces ŵ : R → ℝ via ŵ(f) = f(w). So for a general Riesz space R, the desired domain is a subset of Σ = Hom(R, ℝ). So embed R into ℝ Σ. █ Why does Σ have non-trivial elements? Classically, the Axiom of Choice. Constructively…

(Coquand-Spitters) (DC) If R is separable, and every element is normable, and r  R is (sufficiently) different from 0 then there is a σ  Σ such that σ(r) ≠ 0. (C-S) Is DC necessary? What choice principle is involved?

(Coquand-Spitters) (DC) If R is separable, and every element is normable, and r  R is (sufficiently) different from 0 then there is a σ  Σ such that σ(r) ≠ 0. (C-S) Is DC necessary? What choice principle is involved? Example Let R a be generated by the projections onto the real and complex lines of the solutions to x 2 = a. If you cannot decide whether a = 0, then you cannot in general find the roots.

Let 1  R be distinguished. Def (r  R) r is normable if glb {q  ℚ | q > r} (i.e. sup(r)) exists. Def Pos(r) if sup(r) > 0. Def r  (p, q) = (r – p) ⋀ (q – r) Note For r a function, Pos( r  (p, q) ) iff rng(r) ⋂ (p, q) is non-empty. Hence r can be identified with those intervals (p, q) such that Pos( r  (p, q) ).

Dedekind real r is located: if p r.

Dedekind real r is located: if p r. Signed-bit representation: ● (-2, 2)

Dedekind real r is located: if p r. Signed-bit representation: (-2, 1) ● ● (-1, 2) ● (-2, 2)

Dedekind real r is located: if p r. Signed-bit representation: (-2, 0) ● ● ● (0, 2) (-1, 1) (-2, 1) ● ● (-1, 2) ● (-2, 2)

Dedekind real r is located: if p r. Signed-bit representation: (-2, 0) ● ● ● (0, 2) (-1, 1) ● (-2, 2)

● ●● (-2, -1) (-3/2, -1/2) (-1, 0) (-2, 0) ● ● ● (0, 2) (-1, 1) ● (-2, 2)

● ●● ● ● (-2, -1) (-3/2, -1/2) (-1, 0) (-1/2, 1/2) (0, 1) (-2, 0) ● ● ● (0, 2) (-1, 1) ● (-2, 2)

● ●● ● ● ● ● (-2, -1) (-3/2, -1/2) (-1, 0) (-1/2, 1/2) (0, 1) (1/2, 3/2) (1, 2) (-2, 0) ● ● ● (0, 2) (-1, 1) ● (-2, 2) (the pseudo-tree) T

● ●● ● ● ● ● (-2, -1) (-3/2, -1/2) (-1, 0) (-1/2, 1/2) (0, 1) (1/2, 3/2) (1, 2) (-2, 0) ● ● ● (0, 2) (-1, 1) ● (-2, 2)

● ●● ● ● ● ● (-2, -1) (-3/2, -1/2) (-1, 0) (-1/2, 1/2) (0, 1) (1/2, 3/2) (1, 2) (-2, 0) ● ● ● (0, 2) (-1, 1) ● (-2, 2)

Recall that r  R can be identified with { (p, q) | Pos(r  (p, q) ) }. That in turn is a sub-tree T r of T with the extendibility property: no terminal nodes. For r, s  R and intervals I, J, (I, J) is in the signed-bit representation of R iff Pos( r  I ⋀ s  J ). The signed-bit representation T R of R is the set of all such finite sequences of intervals, indexed by members of R.

Theorem For every set T X of finite sequences (indexed by X) of intervals from T with the extendibility property, there is a canonical Riesz space R ⊇ X such that T X is the signed- bit representation of X.

Definition An ideal I r through T r is a (non- empty) subset closed downwards and under join and with no terminal element.

Definition An ideal through T R is an ideal I r through each T r such that finite products stay in T R : Π r  X I r ⊆ T R (X finite).

Theorem There is a canonical bijection between ideals through T R and Σ. (Recall Σ is Hom(R, ℝ).)

Definition An ideal through T R is an ideal I r through each T r such that finite products stay in T R : Π r  X I r ⊆ T R (X finite). Theorem There is a canonical bijection between ideals through T R and Σ. (Recall Σ is Hom(R, ℝ).) (Note: This can be extended to account for ideals through T X and homomorphisms of the Riesz space generated by X.)

So the existence of homomorphisms from Riesz spaces with dense subsets of size  is equivalent to the existence of ideals through subsets of  -sized products of T with the extendibility property. This is a Martin’s Axiom-like property of set theory.

Let ℱ be the topological space of all ideals through T X, where X has two elements. An open set is given by finitely many pieces of positive and negative information. Positive information is a pair of intervals, i.e. a member of T × T. Negative information is a pair of such closed intervals.

Claim The (full) topological model over ℱ is the (canonical) generic model for a Riesz space with two generators, and that space has no homomorphisms to ℝ.