• Keine Ergebnisse gefunden

(a) Show thatsup(A+B

N/A
N/A
Protected

Academic year: 2022

Aktie "(a) Show thatsup(A+B"

Copied!
1
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

EXERCISES 12: LECTURE FOUNDATIONS OF MATHEMATICS

Exercise 1. Show thatQ is the smallest field contained inR. That is, for all fieldsK ⊂R one hasQ⊂K.

Exercise 2. Let A, B 6= ∅ be subsets of R>0. Define A+B = {a+b|a ∈A, b ∈B} and A·B={ab|a∈A, b∈B}.

(a) Show thatsup(A+B) = sup(A) + sup(B).

(b) Show thatinf(A+B) = inf(A) + inf(B).

(c) Show thatsup(A·B) = sup(A)sup(B).

(d) Show thatinf(A·B) = inf(A)inf(B).

(e) Decide (with a proof) whether (a)-(d) also hold in case A, B 6= ∅ are subsets of R instead of R>0.

Exercise 3. Let A ⊂Rbe a set such that inf(A) >0. Define 1/A= {1/a|a∈A}. Show thatsup(1/A) = 1/(infA).

Exercise 4. Show thatRis not countable.

Submission of the exercise sheet: 16.Dec.2019 before the lecture. Return of the exercise sheet: 19.Dec.2019 during the exercise sessions.

1

Referenzen

ÄHNLICHE DOKUMENTE

The energy levels ǫ J,n of our molecule are enumerated by the angular momentum and the radial quantum number n.. To understand the structure of the low-lying energy levels we

Return of the exercise sheet: 03.Oct.2019 during the exercise

In the following exercises, by an A-tree for q, we mean a tree that is labeled with states by a run of A and in which the root node is labeled with q..

a natural if it is finite and ω if it

Prove that W (q, n) is infinite if and only if there is a transition sequence in the original lcs visiting q

b) Modify the game arena such that it becomes deadlock free such that the correctness of the tree acceptance game (Lemma 8.13 in the lecture notes) is preserved.. c) How can one

The locks are controlled by a single hardware controller that has the following inputs: An input r coming from a door–request button outside of the laboratory which is set iff

A simple, sampling-based tool for this purpose is the program gprof, which measures for each procedure (or method) P in the program how often it is called and how much time is