Single choice

1

Trick Question → If sup M = inf M, then it can only contain a single point → be constant.
Thus it converges automatically

C is wrong since sup or inf not existing means they aren’t .

5

B → wrong since it’s big O not small o

  • would be correct, although it forces the derivative to be
  • Only means that the quotient is bounded, not that it converges to a value (can oscillate in there)

D → correct

  • with for .
    • thus as forces it to converge to
    • So .

10

Differentiability ⇒ stetigkeit ⇒ Riemann-Integrierbar

Aber für eine Funktion gilt: die Ableitung muss nicht Integrierbar sein → Volterra type functions.

11

for any polynomial. How many solutions?

For every at most a finite amount of solutions →

  • true for , the polynomial would have to have an infinite amount of degrees
  • false for , then we can have and circle around as often as we want with sin, cos

For every there exists a polynomial s.t. has at least solutions. → True, the taylorseries of again.

Proofs

18.a)

Wir leiten ab und können dann beschränken.
Proof: bounded und dadurch Lipschitz (via MVT)

  • for s.t. hence .
  • And the supremum for all is .

Dadurch ist Lipschitz stetig ⇒ glm. stetig.
Proof: Sei

  • Dann gilt Lipschitz-Stetigkeit
  • Sei fix. Dann . s.t.
    • .
    • This gives us uniform continuity

18.b)

Für x = 0 trivial. Für , sei fixiert. Dann wächst der untere Term ins unendliche → geht zu 0.

18.c)

Wir leiten ab und schauen nach kritischen Punkten. Da muss einer das maximum, der andere das Minimum sein.

Dann gilt
Dan beide für , ist gleichmäßig gegen stetig.

19.a)

We use the MVT to show that for
Then we can just place into the inequality and get our result out.

19.b)

First we transform to with .
Then and monoton decreasing as and therefore it converges.

Then by continuity of and stuff . And since has a single fixedpoint .
Thus . as !