1/34
Looks like no tags are added yet.
Name | Mastery | Learn | Test | Matching | Spaced | Call with Kai |
|---|
No analytics yet
Send a link to your students to track their progress
conditions to be a norm
‖x‖ =0 iff x=0
‖λx‖ = λ‖x‖
‖x+y‖ ≤ ‖x‖ +‖y‖ (triangle inequality)
how to define infinity norm ie. ‖x‖∞=…
‖x‖∞= max (x1, x2, …, xn)
how to define p-norm ie ‖x‖p=…
‖x‖p= ( ∑ |xi|p ) 1/p
what is a normed space
a pair (X, ‖.‖) where X is a vector space and ‖.‖ is a norm
when is a set K convex
∀ x,y∈K, λx + (1-λ)y ∈K
what is Minkowksi’s inequality
‖x+y‖p ≤ ‖x‖p + ‖y‖p
when are two norms ‖·‖ and ‖·‖’ on X equivalent
if ∃ 0<c1 ≤ c2 s.t
c1 ‖x‖ ≤ ‖x‖’ ≤ c2 ‖x‖ ∀x∈X
what is the space ℓp , what is its (usual) norm and what kind of space is it
space of all the sequences (xj) st ∑ |xi|p converges
equipped with the p-norm
infinite dimensional vector space
what is the space ℓ∞ and what is its (usual) norm
space of bounded sequences
equipped with the infinity norm
what is the space C([a,b]) and its (usual) norm
the space of continuous functions on [a,b]
sup-norm ie ‖f‖∞= supx∈[a,b] |f(x)|
if T: X→Y, what is the operator norm on T
‖T‖= sup { (‖T(x)‖Y) / (‖x‖X) | x∈X, x≠0 }
conditions for a metric d on a set X
d(x,y) = 0 iff x=y
d(x,y) = d(y,x)
d(x,y) ≤ d(x,z) + d(z,y) (triangle inequality)
what is the discrete metric
d(x,y)= 0 if x=y, =1 otherwise
let (X1,d1) and (X2,d2) be metric spaces. For any 1 ≤ p < ∞, how can we define a metric on X1×X2, (then also for p=∞)
ϱp( (x1, x2),(y1,y2) ) = ( d1(x1,y1)p + d2(x2,y2)p )1/p
ϱ∞( (x1, x2),(y1,y2) ) = max( d1(x1,y1),d2(x2,y2) )
when is S⊂(X,d) bounded
when ∃ a∈X and r>0 s.t S⊂B(a,r)
when is U⊂(X,d) open (in X). when is it closed
when ∀ x∈U, ∃ ε>0 st B(x,ε)⊂U
closed when X\U is open
what is true about an intersections/unions of finitely many open/closed sets (does it hold for countably many?)
intersections, open: open, not for infinite
intersections, closed: closed, yes for infinite
unions, open: open, yes for infinite
unions, closed: closed, not for infinite
how can we define convergence of (xn)∈(X,d) in terms of open sets
xn→x iff for every open set U that contains x, ∃ N≥1 s.t xn∈U for all n≥N
how can we define closedness using convergent sequences
F⊆(X,d) is closed iff for every convergent (xn)∈F, the limit is also found in F
when is a function f: X→Y Lipschitz cts
if ∃ C≥0 s.t
dY( f(x), f(y) ) ≤ C dX(x,y) for ∀ x,y∈X
give an example of a Lipschitz function
d(x,A)= infz∈A d(x,z)
let X and Y be metric spaces. when is f:X→Y cts (using sets)
f is cts iff for an open set U⊂Y, f-1(U) is open in X (also works for closed)
when are two metrics (on the same set) topologically equivalent
when the two metric spaces have exactly the same open sets
when are two metrics (on the same set) Lipschitz equivalent
if ∃ 0 < c ≤ C st
cd1(x,y) ≤ d2(x,y) ≤ Cd1(x,y)
what can we say about the cty of f: X→Y and g: Y→X, and the topologically equivalent metrics d1,d2 on X
what about if the metrics are Lipschitz equivalent?
f is cts from (X, d1) into (Y, dY) iff its cts from (X, d2) into (Y,dY)
similarly for g
same results hold for Lipschitz equivalence and Lipschitz cts
what is the relationship between Lipschitz and topological equivalence
Lipschitz is stronger ie Lipschitz implies topological, but not the other way round
what is the relationship between equivalent norms and equivalent metrics
two norms will induce equivalent metrics iff they are equivalent
define an isometry between X and Y
f: X→Y st f is a bijection, and distance is preserved
define a homeomorphism between X and Y
f: X→Y st f is a bijection, and both f and f-1 are cts