Semester 2 Definitions Flashcards

1
Q

A = #B means

A

Bijective

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

A =< #B

A

Injective

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

A finite set

A

A = null set
A = {1,….,N} for some N £ Natural numbers, N > 0

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Countable

A

A =< #Natural numbers

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Countably infinite

A

A = #Natural numbers

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Uncountable

A

A >= #Natural numbers and #A =/ #Natural numbers

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Limit superior

A

The limit superior limsup(Xn) is the largest limit point of Xn

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Limit inferior

A

Is the smallest limit point of Xn

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Sigma-Algebra

A

A σ-algebra on a set Ω is a B ∈ P(P(Ω)) such that:
(a) ∅ ∈ B
(b) if A ∈ B, then Ω\A is in B
(c) If An is a countable subset of B, then the union of all An is in B.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

A Borel Sigma-Algebra

A

The Borel σ-algebra on Ω is the σ-algebra generated by τ . (B_Ω :=< τ >σ)
Its elements are called Borel sets

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Content

A

Suppose B is a Boolean algebra on a set Ω. A content on (Ω, B) is a function µ : B → [0, +∞] such that
(a) µ(∅) = 0
(b) If A, B ∈ B and A ∩ B = ∅ then µ(A ∪ B) = µ(A) + µ(B)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Inner Content u-

A

Consider a content space (&,B,u) and for any subset A £ P(&):
u-(A) := sup{ u(A-) | A- £ B, A- C A }

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Outer Content u+

A

Consider a content space (&,B,u) and for any subset A £ P(&):
u+ := inf{ u(A+) | A+ £ B, A C A+ }

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Interval

A

An interval I ⊆ Rn, n ∈ N is a set of the form I=I1 × … × In with intervals Ij ⊆ R, j ∈ {1, …, n}

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Extended Reals

A

The extended reals are obtained from R by adding two distinct points +- inf.
For any x £ R: -inf < x < +inf
For any x £ Rinf: x.0 = 0, x/inf = 0
if x > -inf : x + inf + inf
if x > 0 : x . inf = inf
-(inf) = - inf, -(-inf) = inf

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Completion

A

If ($,B,u) is a content space with u-,u+ as the inner and outer content, then (%,B^,u^) is the completion of ($,B,u) with B^ as a Boolean algebra with B c B^ and u^ := u+ = u-

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

Inner and Outer Jordan Contents

A

Let A c Rn;
L-(A) := sup{ L^n(A-)|A- c A, A- £ I}
L+(A):= inf{ L^n(A+)|A c A+, A+ £ I}
£ [0,inf]

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

Sum of intervals

A

If J is a countable set, and for every j ∈ J, Ij ⊂Rn is an interval with λ^n(Ij ) < ∞, then UNION Ij is called a sum of intervals.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

Outer Lebesgue measure

A

For A ⊂ Rn we let
λ(A) := inf{SUM Ij is a sum of intervals, A ⊂ Union Ij}
λ is called outer Lebesgue measure.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

Outer measure

A

An outer measure on Ω is a map µ : P(Ω) → R
such that
*µ(∅) = 0
* monotony: if A ⊂ B ⊂ Ω, then µ(A) ≤ µ(B)
* σ-subadditivity: if An ∈ P(Ω) ∀n ∈ N, then
u(UNION An) =< SUM u(An)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
21
Q

u-Nullset

A

If µ : P(Ω) → R is an outer measure, then A ⊂ Ω is a µ-nullset if µ(A) = 0

22
Q

u-Almost everywhere

A

A property is said to hold µ-almost everywhere iff it holds ∀x ∈ B with B ⊂ Ω, µ(B^c) = 0

23
Q

sigma-additive (content space)

A

u is called sigma-additive if for any pairwise disjoint An, n £ N,
u(U An) = E u(An)

24
Q

u-Finite (content space)

A

u is called Finite if for any A £ B, u(A) < inf

25
Q

sigma-finite (content space)

A

σ-finite if Ω = UNION Ωn for some Ωn ∈ B with µ(Ωn) < ∞ ∀n ∈ N

26
Q

Premeasure (content space)

A

A premeasure on B is a content which is sigma additive. It is called a measure if B is a sigma-algebra

27
Q

u-measurable

A

Let u:P(&) -> Rinf denote an outer measure on the set &.
Then A £ P(&) is called u-measurable if
for any S £ P(&): u(S) >= u(SnA) + (SnA^c)

28
Q

Lebesgue Measure

A

If µ = λ is the outer Lebesgue measure on Ω=Rn then
L := {A ∈ P(Rn)|A is λ-measurable},
is the set of Lebesgue measurable sets, λ|L is the Lebesgue Measure.

29
Q

Vitali Sets

A

On Ω := [0, 1], let x ∼ y : iff x − y ∈ Q. For every ξ ∈ Ω/∼, choose a representative x ∈ Ω, ξ =[xξ],
V := {xξ|ξ ∈ Ω/∼}

30
Q

Partition

A

Let B c Rn be measurable. A partition # = (Am) of B is given by pairwise disjoint Am £ L such that B = U Am

31
Q

Refinement

A

If #, #~ £ Pb, then #~ is a refinement of #, if # = (Am), #~ = (A~m~) for every m~ £ N, there exists m £ N: A~m~ c Am

32
Q

Common Refinement

A

. #~ := (Am n A~m~) is a common refinement of #,#~

33
Q

Upper sum

A

Let B c Rn with B £ L and # £ Pb, # = (Am).
Let f:B -> Rinf.
S(# ; f) := E L(Am).supf(Am)

34
Q

Lower sum

A

Let B c Rn with B £ L and # £ Pb, # = (Am).
Let f:B -> Rinf.
s(# ; f) := E L(Am).inf f(Am)

35
Q

Intermediate sum

A

Let B c Rn with B £ L and # £ Pb, # = (Am).
Let f:B -> Rinf and for any m £ N, choose $m £ Am, $ = ($m).
o(#,$;f) = E L(Am).f($m)

36
Q

Upper Lebesgue Integral

A

Upper integral bounded by B of f(x) dL :=
sup{s(π; f)|π ≻ π⋆}

37
Q

Lower Lebesgue Integral

A

Let B £ L and f:B -> Rinf is integrable on B if condition * holds and our integral exists such that for any e>0 there exists #e £ Pb such that, #e > #* and all # £ Pb with # > #e.
|o(#,$,f) - int f(x) dL|< e.
sup{ s(#,f)|# > #*}

38
Q

Characteristic function

A

For any set & and A £ P(&), the characteristic function for A in & is:
Xa: & -> R,
Xa(L): = {1 if x £ A | 0 if x £/ A}

39
Q

Measurable

A

Let A,B denote sigma-algebras on the sets &,% and let f: & -> %.
Then f is A-B measurable if for any D £ B: f-1(D) £ A

40
Q

Step Function

A

If B £ L then f: B -> Rinf is a step function iff it only takes countably many values

41
Q

Simple Function

A

A function f: Rinf -> R is called simple if it is measurable and it takes only finitely many values

42
Q

Unsigned simple

A

A function f: Rinf -> R is called simple if it is measurable and it takes only finitely many values. It is unsigned simple if f(Rn) c [0,inf)

43
Q

Boolean Algebra

A

Let Ω denote a set. A Boolean algebra on Ω is a set B ∈ P(P(Ω)) such that
(a) ∅ ∈ B
(b) if A ∈ B, then Ω\A is in B
(c) if A, B ∈ B, then A ∪ B ∈ B

44
Q

Measure space

A

If & is a set, B a sigma-algebra and u a measure then (&,B,u) is a measure space

45
Q

Content space

A

Is & is a set, B is a boolean algebra and u a content, then (&,B,u) is a content space

46
Q

Power Set

A

The set of all subsets of &

47
Q

Complement

A

The complement of A in Ω is A^c
:= {x ∈ Ω|x /∈ A}

48
Q

Difference

A

The difference is A\B := {x ∈ A|x /∈ B}

49
Q

Jordan algebra

A
50
Q

Fundamental theorem on the Lebesgue Measure

A

The Lebesgue measurable sets L ⊂ P(Rn) form a σ-algebra J and thus the Borel σ-algebra B_Rn . The Lebesgue measure defines a measure on L, which is invariant under Euclidean motions, and which on bounded. A ∈ J agrees with the Jordan content.