Nicholas Lawrance | ICRA 20111Nicholas Lawrance | Thesis Defence1 1 Functional Analysis I Presented by Nick Lawrance.

Slides:



Advertisements
Similar presentations
EE1J2 – Discrete Maths Lecture 9
Advertisements

Signal , Weight Vector Spaces and Linear Transformations
Signal , Weight Vector Spaces and Linear Transformations
Charts. Coordinate Chart  A chart is a neighborhood W and function . W  XW  X  : W  E d  : W  E d  is a diffeomorphism  is a diffeomorphism.
1 Numerical geometry of non-rigid shapes Mathematical background Mathematical background Tutorial 1 © Maks Ovsjanikov, Alex & Michael Bronstein tosca.cs.technion.ac.il/book.
EE1J2 – Discrete Maths Lecture 7
Digital Communications I: Modulation and Coding Course Spring Jeffrey N. Denenberg Lecture 3b: Detection and Signal Spaces.
Lecture 2: Geometry vs Linear Algebra Points-Vectors and Distance-Norm Shang-Hua Teng.
1 Lecture 6 Topics –Proof of the existence of unsolvable problems Problems/languages not in REC Proof Technique –There are more problems/languages than.
CS 2210 (22C:019) Discrete Structures Sets and Functions Spring 2015 Sukumar Ghosh.
Krakow, Summer 2011 Circle and Sphere Orders William T. Trotter
Vocabulary word (put this word on the back of the card.) THIS WILL BE THE DEFINITION – FILL IN THE BLANKS ON THE VOCABULARY CARDS PROVIDED.
 Limit Cycle Isolated closed trajectories Analysis is, in general, quite difficult. For nonlinear systems, two simple results exist. Limit Cycle
University of Texas at Austin CS395T - Advanced Image Synthesis Spring 2006 Don Fussell Orthogonal Functions and Fourier Series.
1 CMSC 250 Chapter 7, Functions. 2 CMSC 250 Function terminology l A relationship between elements of two sets such that no element of the first set is.
Cardinality of Sets Section 2.5.
Signal-Space Analysis ENSC 428 – Spring 2008 Reference: Lecture 10 of Gallager.
Signal Processing and Representation Theory Lecture 1.
University of Texas at Austin CS384G - Computer Graphics Fall 2008 Don Fussell Orthogonal Functions and Fourier Series.
Chap 3. Formalism Hilbert Space Observables
General (point-set) topology Jundong Liu Ohio Univ.
MA4266 Topology Wayne Lawton Department of Mathematics S ,
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
Discrete Mathematics and Its Applications Sixth Edition By Kenneth Rosen Copyright  The McGraw-Hill Companies, Inc. Permission required for reproduction.
Vector Norms and the related Matrix Norms. Properties of a Vector Norm: Euclidean Vector Norm: Riemannian metric:
MA5296 Lecture 1 Completion and Uniform Continuity Wayne M. Lawton Department of Mathematics National University of Singapore 2 Science Drive 2 Singapore.
MA5241 Lecture 1 TO BE COMPLETED
Chapter 4 Hilbert Space. 4.1 Inner product space.
AGC DSP AGC DSP Professor A G Constantinides©1 Signal Spaces The purpose of this part of the course is to introduce the basic concepts behind generalised.
Sets 2/10/121. What is a Set? Informally, a collection of objects, determined by its members, treated as a single mathematical object Not a real definition:
Rules of the game  You will work with your Unit 3 group  We will have 4 rounds of 6 questions each. Most are multiple choice; some are fill in the blank.
Discrete Structures Li Tak Sing ( 李德成 ) Lectures
Sets.
Introduction to Real Analysis Dr. Weihu Hong Clayton State University 8/27/2009.
Basic Structures: Sets, Functions, Sequences, and Sums.
P-1 The Real Number System. Real Numbers— Irrational Numbers— the real number that can not be written as the ratio of two integers. Rational Numbers—
Sets Definition: A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a.
CompSci 102 Discrete Math for Computer Science February 7, 2012 Prof. Rodger Slides modified from Rosen.
Discrete Mathematics Set.
Math 51/COEN 19. Sequences and Summations - vocab An arithmetic progression is a sequence of the form a, a+d, a+2d, …, a+nd, … with fixed a, d in R and.
CS 285- Discrete Mathematics
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.
Department of Statistics University of Rajshahi, Bangladesh
Let X be a metric space. A subset M of X is said to be  Rare(Nowhere Dense) in X if its closure M has no interior points,  Meager(of First Category)
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.
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.
Extending a displacement A displacement defined by a pair where l is the length of the displacement and  the angle between its direction and the x-axix.
Euclidean space Euclidean space is the set of all n-tuples of real numbers, formally with a number called distance assigned to every pair of its elements.
Topology Preserving Edge Contraction Paper By Dr. Tamal Dey et al Presented by Ramakrishnan Kazhiyur-Mannar.
Week 8 - Wednesday.  What did we talk about last time?  Relations  Properties of relations  Reflexive  Symmetric  Transitive.
Infinite sets We say that a set A is infinite if a proper subset B exists of A such that there is a bijection It is easy to see that no set with a finite.
Department of Mathematics
Function Hubert Chan (Chapter 2.1, 2.2) [O1 Abstract Concepts]
Discrete Mathematics Lecture 6
Vector Space Examples Definition of vector space
Department of Mathematics
Week 4 3. Complete metric spaces, Hilbert spaces Example 1:
CS 2210:0001 Discrete Structures Sets and Functions
Chapter 3 The Real Numbers.
Function Hubert Chan (Chapter 2.1, 2.2) [O1 Abstract Concepts]
2.4 Sequences and Summations
Some Review Problems for Math 141 Final
Cardinality of Sets Section 2.5.
Chapter 3 The Real Numbers.
Discrete Math (2) Haiming Chen Associate Professor, PhD
Lecture 7 Functions.
Discrete Structures for Computer Science
Revision of topics/definitions
ICOM 5016 – Introduction to Database Systems
Set – collection of objects
Presentation transcript:

Nicholas Lawrance | ICRA 20111Nicholas Lawrance | Thesis Defence1 1 Functional Analysis I Presented by Nick Lawrance

Nicholas Lawrance | ICRA What we want to take from this... My hope is that a proper understanding of the fundamentals will provide a good basis for future work Clearly, not all of the maths will be directly useful. We should try to focus on areas that seem like they might provide utility The topic areas are not fixed yet

Nicholas Lawrance | ICRA Revision of topics/definitions

Nicholas Lawrance | ICRA Injective transformations

Nicholas Lawrance | ICRA Surjective transformations

Nicholas Lawrance | ICRA Bijective transformations

Nicholas Lawrance | ICRA Sequences

Nicholas Lawrance | ICRA Sequences N = {1, 2, 3,...} is countably infinite The rational numbers Q are countable, the real numbers R are not Examples Can also have a finite index set, and a subset of the index results in a family of elements

Nicholas Lawrance | ICRA Supremum and Infimum Easy to think of as maximum and minimum, but not strictly correct. They are the bounds but do not have to exist in the set A = {-1, 0, 1}sup(A) = 1inf(A) = -1 B = {n -1 : n = [1, 2, 3,...]}sup(B) = 1inf(B) = 0

Nicholas Lawrance | ICRA l p - norms For an n-dimensional space 2-dimensional Euclidean space unit spheres for a range of p values

Nicholas Lawrance | ICRA

Nicholas Lawrance | ICRA Metric Space

Nicholas Lawrance | ICRA Examples Euclidean R, R 2, R 3, R n. Complex plane C Sequence space l ∞ –Remember a sequence is an ordered list of elements where each element can be associated with the natural numbers N Discrete metric space such that

Nicholas Lawrance | ICRA Function space C[a,b] X is the set of continuous functions of independent variable t є J,J = [a,b] t x y d(x, y) ba

Nicholas Lawrance | ICRA l p -space Note that this basically implies that each point is a finite distance from the ‘origin’ Sequence can be finite or not

Nicholas Lawrance | ICRA Open and closed sets

Nicholas Lawrance | ICRA Balls cannot be empty (they must contain the centre which is a member of X) In a discrete metric space, sphere of radius 1 contains all members except x 0, S(x 0, 1) = X- x 0

Nicholas Lawrance | ICRA Open and closed sets ε > 0 x0x0 x x x0x0 B(x 0, ε) Neighbourhood

Nicholas Lawrance | ICRA

Nicholas Lawrance | ICRA Selected problems x0x0 x 0 +1x 0 -1 R x0x0 C t x0x0 ba

Nicholas Lawrance | ICRA

Nicholas Lawrance | ICRA We need Let f(t) = |x(t) – y(t)| Find the stationary points

Nicholas Lawrance | ICRA

Nicholas Lawrance | ICRA

Nicholas Lawrance | ICRA Accumulation points and closure

Nicholas Lawrance | ICRA Accumulation points and closure B(x 0, ε) M X x0x0 Accumulation point if every neighbourhood of x 0 contains a y є M distinct from x 0

Nicholas Lawrance | ICRA a)Closure of the integers is the integers b)Closure of Q is R c)Closure of rational C is C d)Closure of both disks is {z | |z| ≤ 1}

Nicholas Lawrance | ICRA Convergence

Nicholas Lawrance | ICRA Completeness

Nicholas Lawrance | ICRA Isometric mapping

Nicholas Lawrance | ICRA Summary Metric Spaces Open closed sets (calls, spheres etc) Convergence Completeness Next –Banach spaces (basically vector spaces) –Hilbert spaces (Banach spaces with inner product (dot product))