Created
April 23, 2012 18:59
-
-
Save kiritsuku/2473068 to your computer and use it in GitHub Desktop.
hm uebung 1 vom 23.04.12
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| \documentclass{article} | |
| \usepackage[utf8]{inputenc} | |
| \usepackage[T1]{fontenc} | |
| \usepackage{amsfonts} | |
| \usepackage{amsmath} | |
| \usepackage{mathtools} | |
| \usepackage[margin=2cm]{geometry} % margins | |
| \usepackage{fancyhdr} % site layout | |
| \usepackage{datetime} | |
| \usepackage{soul} | |
| % package soul | |
| % set underline properties | |
| \setul{0.3ex}{0.1ex} | |
| % package datetime | |
| \renewcommand{\dateseparator}{.} | |
| \ddmmyyyydate | |
| % package fancyhdr | |
| % defines header and footer | |
| \pagestyle{fancy} | |
| \lhead{HM-Übung 1 -- 23.04.2012} | |
| \chead{} | |
| \rhead{\thepage} | |
| \lfoot{} | |
| \cfoot{} | |
| \rfoot{} | |
| \DeclareUnicodeCharacter{2227}{\ensuremath{\land}} %∧ | |
| \DeclareUnicodeCharacter{2228}{\ensuremath{\lor}} %∨ | |
| \DeclareUnicodeCharacter{2208}{\ensuremath{\in}} %∈ | |
| \DeclareUnicodeCharacter{2200}{\ensuremath{\forall}} %∀ | |
| \DeclareUnicodeCharacter{2203}{\ensuremath{\exists}} %∃ | |
| \DeclareUnicodeCharacter{211D}{\ensuremath{\mathbb{R}}} %ℝ | |
| \newcommand{\R}{\ensuremath{\mathbb{R}}} | |
| \DeclareUnicodeCharacter{2115}{\ensuremath{\mathbb{N}}} %ℕ | |
| \newcommand{\N}{\ensuremath{\mathbb{N}}} | |
| \DeclareUnicodeCharacter{211A}{\ensuremath{\mathbb{Q}}} %ℚ | |
| \newcommand{\Q}{\ensuremath{\mathbb{Q}}} | |
| \DeclareUnicodeCharacter{2102}{\ensuremath{\mathbb{C}}} %ℂ | |
| \newcommand{\C}{\ensuremath{\mathbb{C}}} | |
| \DeclareUnicodeCharacter{2124}{\ensuremath{\mathbb{Z}}} %ℤ | |
| \newcommand{\Z}{\ensuremath{\mathbb{Z}}} | |
| \DeclareUnicodeCharacter{2119}{\ensuremath{\mathbb{P}}} | |
| \newcommand{\PP}{\ensuremath{\mathbb{P}}} | |
| %\DeclareUnicodeCharacter{????}{\ensuremath{\mathbb{I}}} | |
| \newcommand{\I}{\ensuremath{\mathbb{I}}} | |
| \DeclareUnicodeCharacter{221E}{\ensuremath{\infty}} %∞ | |
| \DeclareUnicodeCharacter{21D4}{\ensuremath{\iff}} %⇔ | |
| \DeclareUnicodeCharacter{21D2}{\ensuremath{\implies}} %⇒ | |
| \DeclareUnicodeCharacter{21D0}{\ensuremath{\Leftarrow}} %⇐ | |
| % lower greek letters | |
| \DeclareUnicodeCharacter{03B1}{\ensuremath{\alpha}} %α | |
| \DeclareUnicodeCharacter{03B2}{\ensuremath{\beta}} %β | |
| \DeclareUnicodeCharacter{03B3}{\ensuremath{\gamma}} %γ | |
| \DeclareUnicodeCharacter{03B4}{\ensuremath{\delta}} %δ | |
| \DeclareUnicodeCharacter{03B5}{\ensuremath{\varepsilon}} %ε | |
| \DeclareUnicodeCharacter{03F5}{\ensuremath{\epsilon}} %ϵ | |
| \DeclareUnicodeCharacter{03B6}{\ensuremath{\zeta}} %ζ | |
| \DeclareUnicodeCharacter{03B7}{\ensuremath{\eta}} %η | |
| \DeclareUnicodeCharacter{03B8}{\ensuremath{\theta}} %θ | |
| \DeclareUnicodeCharacter{03D1}{\ensuremath{\vartheta}} %ϑ | |
| \DeclareUnicodeCharacter{03B9}{\ensuremath{\iota}} %ι | |
| \DeclareUnicodeCharacter{03BA}{\ensuremath{\kappa}} %κ | |
| \DeclareUnicodeCharacter{03BB}{\ensuremath{\lambda}} %λ | |
| \DeclareUnicodeCharacter{03BC}{\ensuremath{\mu}} %μ | |
| \DeclareUnicodeCharacter{03BD}{\ensuremath{\nu}} %ν | |
| \DeclareUnicodeCharacter{03BE}{\ensuremath{\xi}} %ξ | |
| \DeclareUnicodeCharacter{03BF}{\ensuremath{\circ}} %ο | |
| \DeclareUnicodeCharacter{03C0}{\ensuremath{\pi}} %π | |
| \DeclareUnicodeCharacter{03C1}{\ensuremath{\rho}} %ρ | |
| \DeclareUnicodeCharacter{03F1}{\ensuremath{\varrho}} %ϱ | |
| \DeclareUnicodeCharacter{03C2}{\ensuremath{\varsigma}} %ς | |
| \DeclareUnicodeCharacter{03C3}{\ensuremath{\sigma}} %σ | |
| \DeclareUnicodeCharacter{03C4}{\ensuremath{\tau}} %τ | |
| \DeclareUnicodeCharacter{03C5}{\ensuremath{\upsilon}} %υ | |
| \DeclareUnicodeCharacter{03C6}{\ensuremath{\varphi}} %φ | |
| \DeclareUnicodeCharacter{03D5}{\ensuremath{\phi}} %ϕ | |
| \DeclareUnicodeCharacter{03C7}{\ensuremath{\chi}} %χ | |
| \DeclareUnicodeCharacter{03C8}{\ensuremath{\psi}} %Ψ | |
| \DeclareUnicodeCharacter{03C9}{\ensuremath{\omega}} %ω | |
| % http://www.maths.tcd.ie/~dwilkins/LaTeXPrimer/Theorems.html | |
| \newtheorem{theorem}{Theorem}[section] | |
| \newtheorem{lemma}[theorem]{Lemma} | |
| \newtheorem{proposition}[theorem]{Proposition} | |
| \newtheorem{corollary}[theorem]{Corollary} | |
| \newenvironment{proof}[1][Beweis:]{\begin{trivlist} | |
| \item[\hskip \labelsep {\bfseries #1}]}{\end{trivlist}} | |
| \newenvironment{definition}[1][Definition:]{\begin{trivlist} | |
| \item[\hskip \labelsep {\bfseries #1}]}{\end{trivlist}} | |
| \newenvironment{example}[1][Beispiel:]{\begin{trivlist} | |
| \item[\hskip \labelsep {\bfseries #1}]}{\end{trivlist}} | |
| \newenvironment{remark}[1][Bemerkung:]{\begin{trivlist} | |
| \item[\hskip \labelsep {\bfseries #1}]}{\end{trivlist}} | |
| \newcommand{\qed}{\nobreak \ifvmode \relax \else | |
| \ifdim\lastskip<1.5em \hskip-\lastskip | |
| \hskip1.5em plus0em minus0.5em \fi \nobreak | |
| \vrule height0.75em width0.5em depth0.25em\fi} | |
| \begin{document} | |
| \section*{Fourierreihen im Komplexen} | |
| \begin{definition} | |
| Seien $a,b∈ℝ,\ a<b$ und sei $g:[a,b]\to ℂ$ eine Funktion mit $u:=\Re(g),\ v:=\Im(g)$; also $g=u+iv$. Sind $u,v∈ℝ[a,b]$, so schreiben wir $g∈ℝ([a,b],ℂ)$ und definieren $\int\limits_a^b g(x)\mathrm{d}x:=\int\limits_a^b u(x)\mathrm{d}x+i\int\limits_a^b v(x)\mathrm{d}x$. | |
| \end{definition} | |
| \begin{remark} | |
| Ist auch $k∈ℝ([a,b],ℂ)$ und $α,β∈ℂ$, so gilt: | |
| \begin{enumerate} | |
| \item[(a)] $αg+βh∈ℝ([a,b],ℂ)$ und $\int\limits_a^b (αg+βh)\mathrm{d}x=α\int\limits_a^b g(x)\mathrm{d}x+β\int\limits_a^b h(x)\mathrm{d}x$ | |
| \end{enumerate} | |
| \end{remark} | |
| \begin{definition} | |
| Sei $f∈ℝ([a,b],ℂ)$. Dann heißen $c_n:=\frac{1}{2\pi}\int\limits_{-\pi}^\pi f(x)e^{-inx}\mathrm{d}x\ (n∈ℤ)$ die komplexen Fourierkoeffizienten von $f$ auf $\sum\limits_{n=-\infty}^\infty c_ne^{inx}$ heißt die zu $f$ gehörende \emph{komplexe Fourrierreihe}. | |
| \end{definition} | |
| Sei $f∈ℝ[-\pi,\pi]$ und seinen $a_n,b_n$ die zugehörigen Fourierkoeffizienten (vgl. \S13). Dann gilt: | |
| \[ | |
| \begin{split} | |
| &c_n=\frac{1}{2\pi}\int\limits_{-\pi}^\pi f(x)(\cos(nx)-i\sin(nx))\mathrm{d}x=\frac{1}{2}\left(a_n-i b_n\right)\quad(n∈ℕ)\\ | |
| &c_0=\frac{1}{2\pi}\int\limits_{-\pi}^\pi f(x)1\mathrm{d}x=\frac{1}{2}a_0\\ | |
| &c_{-n}=\frac{1}{2\pi}\int\limits_{-\pi}^\pi f(x)(\cos(nx)+i\sin(nx))\mathrm{d}x=\frac{1}{2}\left(a_n+i b_n\right)\quad(n∈ℕ) | |
| \end{split} | |
| \] | |
| Dann ergibt sich: | |
| \[ | |
| \begin{split} | |
| \sum\limits_{k=-n}^k c_ke^{ikx}=\frac{a_0}{2}+{}&\underbrace{\sum\limits_{k=1}^n\left(c_ke^{ikx}+c_{-k}e^{-ikx}\right)}_{ | |
| \mathrlap{\begin{array}{@{}l} | |
| \hspace{-0.6ex}=\cos(kx)(c_n+c_{-n})+i\sin(kx)(c_k-c_{-k})\\ | |
| \hspace{-0.6ex}=a_k\cos(kx)+b_k\sin(kx) | |
| \end{array}} | |
| }\\ | |
| \end{split} | |
| \] | |
| Also: | |
| \[ | |
| \sum\limits_{k=-n}^nc_ke^{ikx}=\frac{a_0}{2}=\sum\limits_{k=1}^n\left(a_k\cos(kx)+b_k\sin(kx)\right) | |
| \] | |
| \begin{definition} | |
| Sei $(a_n)$ eine Folge in $ℂ$ und $x∈ℝ$. Dann: | |
| \[ | |
| \sum\limits_{n=-\infty}^{\infty}c_ke^{inx}\ \text{konvergiert}:⇔\lim\limits_{n\to\infty}\sum\limits_{k=-n}^n c_ke^{ikx}\ \text{ex.}\quad(\text{in}\ ℂ) | |
| \] | |
| \end{definition} | |
| \begin{remark} | |
| Ist $f∈R[-\pi,\pi]\ \text{und}\ x∈ℝ$, so gilt: Die komplexe Fourierreihe konv. in $x∈[-\pi,\pi]$⇔ die reelle FR konv. in $x$. | |
| \end{remark} | |
| \section*{Aufgabe 1} | |
| Untersuchen Sie, ob die foglenden GW ex. und geben Sie diese ggf. an: | |
| \[ | |
| \begin{split} | |
| i)& \lim\limits_{(x,y)\to(0,0)}\left(\frac{x^2}{|y|}\right)^y\\ | |
| ii)& \lim\limits_{(x,y)\to(0,0)}\frac{x^2+y^2}{\sqrt{x^2+y^2+1}-1}\\ | |
| iii)& \lim\limits_{(x,y)\to(0,0)}\frac{xy}{e^{x^2}-1} | |
| \end{split} | |
| \] | |
| \begin{enumerate} | |
| \item[i)] | |
| $D=\{(x,y)∈ℝ^2:y\neq 0\}$. Sei $x_n^α:=e^{-αn},\ y_n^α:=\frac{1}{n}$.\\Dann ist $(x_n^α,\ y_n^α)$ Folge in $D$ mit GW $(0,0)$. Dann: | |
| \[ | |
| \left(\frac{x_n^{α^2}}{|y_n^α|}\right)^{y_n^α}=\left(ne^{-2αn}\right)^\frac{1}{n}=n^{\frac{1}{n}}e^{-2α}\xrightarrow{n\to\infty}e^{-2α} | |
| \] | |
| Insbesondere unterscheiden sich die GWe zu $(x_n^α,\ y_n^α)$ und $(x_n^5,\ y_n^5)$ ⇒ lim ex. nicht. | |
| \item[ii)] | |
| $D=ℝ^2\backslash\{(0,0)\}$. Sei $(x_n,\ y_n)$ Folge in $D$ mit GW $(0,0)$.\\Dann: $x_n\to0,\ y_n\to0$, also auch $z_n:=x_n^2+y_n^2\to0\ (n\to\infty)$. Es folgt nach \emph{l'Hopital}: | |
| \[ | |
| \lim\limits_{n\to\infty}\frac{x_n^2+y_n^2}{\sqrt{x_n^2+y_n^2+1}-1}=\lim\limits_{n\to\infty}\frac{z_n}{\sqrt{z_n+1}-1}=\lim\limits_{z\to0^+}\frac{z}{\sqrt{z+1}-1}=\lim\limits_{z\to0^+}\frac{1}{\frac{1}{z\sqrt{z+1}}}=2 | |
| \] | |
| Damit: | |
| \[ | |
| \lim\limits_{(x,y)\to (0,0)}\frac{x_n^2+y_n^2}{\sqrt{x_n^2+y_n^2+1}-1}=2 | |
| \] | |
| \item[iii)] | |
| Wegen \emph{l'Hopital} gilt: | |
| \[ | |
| \lim\limits_{x\to0}\frac{x^2}{e^{x^2}-1}=\lim\limits_{x\to0}\frac{2x}{2xe^{x^2}}=1 | |
| \] | |
| Darum gilt für jede Folge $(x_n,\ y_n)$ in $D=\{(x,y)∈ℝ^2:x\neq0\}$ mit GW $(0,0)$. | |
| \[ | |
| \lim\limits_{n\to\infty}\frac{x_n^2y_n}{e^{x_n^2}-1}=\lim\limits_{n\to\infty}\frac{x_n^2}{e^{x_n^2}-1}\cdot\lim\limits_{n\to\infty}y_n=1\cdot0=0 | |
| \] | |
| \end{enumerate} | |
| \section*{Aufgabe 2} | |
| Überprüfen Sie, ob die folgenden Teilmengen des $ℝ^2$ bzw. $ℝ^3$ beschränkt, offen, abgeschlossen oder kompakt sind. | |
| \begin{enumerate} | |
| \item[a)] $M_1=\{(x,y)∈ℝ^2: 0<y\leq1-x^2\}$\\ | |
| $M_1$ ist weder offen noch abg., beschr.; also nicht kompakt. | |
| \begin{enumerate} | |
| \item[]\ul{Beschr\"anktheit}: Für $(x,y)∈M_1$ gilt:\\ | |
| $0<y\leq1, x^2\leq1-y<1$. Daher: $||(x,y)||=\sqrt{x^2+y^2}\leq\sqrt{1^2+1}=\sqrt{2}$\ ⇒ $M_1$ ist beschr. | |
| \item[]\ul{Offenheit}: $(0,1)∈M_1$, aber: $(0,1+ε)\notin M_1 ∀ ε>0$. $||(0,1+ε)-(0,1)||=ε$ | |
| \item[]\ul{Abgeschlossenheit}: Sei $(x_n,y_n):=(0,\frac{1}{n})∈M_1 \text{für} n∈ℕ$. Dann: $(x_n,y_n)\to(0,0)\text{und} (0,0)\notin M_1$. Also ist $M_1$ nicht abg. | |
| \end{enumerate} | |
| \end{enumerate} | |
| \end{document} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment