Mercurial > 13ws.ds
annotate notes/tex/basics.tex @ 45:e65f4b1a6e32
remove fairly useless setbeamercovered
| author | Markus Kaiser <markus.kaiser@in.tum.de> |
|---|---|
| date | Wed, 08 Jan 2014 14:26:02 +0100 |
| parents | f52078f78e60 |
| children |
| rev | line source |
|---|---|
|
1
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
1 \defineUnit{mengen}{% |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
2 \begin{frame} |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
3 \frametitle{Mengen} |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
4 |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
5 \begin{definition}[Menge] |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
6 Eine \structure{Menge} ist eine \alert{ungeordnete} Sammlung \alert{unterscheidbarer} Objekte.\\ |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
7 Mit \structure{Mengenklammern} werden Objekte zusammengefasst. |
| 3 | 8 \[ A \defeq \left\{ a, b, \ldots, z \right\} \] |
|
1
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
9 Man nennt $a$ ein \structure{Element} von $A$, es gilt $a \in A$. |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
10 \end{definition} |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
11 |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
12 \begin{itemize} |
| 3 | 13 \item Reihenfolge ist \alert{egal} |
| 14 \item Elemente kommen \alert{nicht} mehrfach vor | |
|
1
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
15 \end{itemize} |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
16 |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
17 \vfill |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
18 |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
19 \begin{example}[] |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
20 \begin{itemize} |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
21 \item $\left\{ a, b, c, a, c \right\} = \left\{ a, b, c \right\} = \left\{ c, a, b \right\}$ |
| 3 | 22 \item $\N \defeq \left\{ 1, 2, 3, \ldots \right\}$ |
| 23 \item $\emptyset \defeq \left\{ \right\}$ | |
|
1
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
24 \end{itemize} |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
25 \end{example} |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
26 \end{frame} |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
27 |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
28 \begin{frame} |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
29 \frametitle{Schreibweisen} |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
30 |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
31 \begin{definition}[Extensionale Schreibweise] |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
32 Die \structure{extensionale Schreibweise} einer Menge zählt ihre Elemente auf. |
| 3 | 33 \[ M \defeq \left\{ x_1, x_2, x_3, \ldots \right\} \] |
|
1
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
34 \end{definition} |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
35 \vfill |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
36 \begin{example}[] |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
37 \begin{itemize} |
| 3 | 38 \item $A \defeq \left\{ 2, 4, 6, \ldots \right\}$ |
| 39 \item $B \defeq \left\{ 1, 2, 3, 4 \right\}$ = [4] | |
| 40 \item $C \defeq \left\{ 2, 3, 5, 7, 11, \ldots \right\}$ | |
| 41 \item $D \defeq \left\{ \alpha, a, \smiley, 8, \left\{ 1, 2 \right\}, \N \right\}$ | |
|
1
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
42 \end{itemize} |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
43 \end{example} |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
44 \end{frame} |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
45 |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
46 \begin{frame} |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
47 \frametitle{Schreibweisen} |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
48 |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
49 \begin{definition}[Intensionale Schreibweise] |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
50 Die \structure{intensionale Schreibweise} beschreibt eine Menge durch charakteristische Eigenschaften. |
| 3 | 51 \[ M \defeq \left\{ x \in \Omega \mid P(x) \right\} \] |
|
1
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
52 $M$ enthält alle Elemente im \structure{Universum} $\Omega$ mit der Eigenschaft $P$. |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
53 \end{definition} |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
54 \vfill |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
55 \begin{example}[] |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
56 \begin{itemize} |
| 3 | 57 \item $A \defeq \left\{ 2, 4, 6, \ldots \right\} = \left\{ x \in \N \mid x\ \text{gerade} \right\} = \left\{ 2x : x \in \N \right\}$ |
| 58 \item $B \defeq \left\{ 1, 2, 3, 4 \right\} = \left\{ x \in \N \mid x \leq 4 \right\}$ | |
| 59 \item $C \defeq \left\{ 2, 3, 5, 7, 11, \ldots \right\} = \left\{ x \in \N \mid x\ \text{prim} \right\}$ | |
|
1
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
60 \end{itemize} |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
61 \end{example} |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
62 \end{frame} |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
63 } |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
64 |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
65 \defineUnit{mengenoperationen}{% |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
66 \begin{frame} |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
67 \frametitle{Mengenoperationen} |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
68 |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
69 \begin{block}{Bezeichnungen} |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
70 \begin{itemize} |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
71 \item Objekte in Mengen |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
72 \begin{description}[\qquad\qquad] |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
73 \item[$a \in A$] $a$ ist Element von $A$ |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
74 \item[$b \not\in A$] $b$ ist kein Element von $A$ |
| 3 | 75 \item[$\abs{A}$] Anzahl der Elemente in $A$, Kardinalität |
|
1
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
76 \end{description} |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
77 \item Relationen zwischen Mengen |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
78 \begin{description}[\qquad\qquad] |
|
27
f52078f78e60
fix arrows in early slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
26
diff
changeset
|
79 \item[$B \subseteq A$] $B$ ist Teilmenge von $A$, \quad $x \in B \rightarrow x \in A$ |
|
1
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
80 \item[$B \subset A$] $B$ ist echte Teilmenge von $A$ |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
81 \item[$B = A$] $B \subseteq A$ und $A \subseteq B$ |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
82 \end{description} |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
83 \end{itemize} |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
84 \end{block} |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
85 |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
86 \begin{example}[] |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
87 \begin{itemize} |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
88 \item $1 \in \left\{ 1, 2, 3, 4 \right\}$, aber $9 \not\in \left\{ 1, 2, 3, 4 \right\}$ |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
89 \item $\left\{ 1, 2 \right\} \subseteq \left\{ 1, 2, 3, 4 \right\}$, aber $\left\{ 1, 5 \right\} \not\subseteq \left\{ 1, 2 \right\}$ |
| 3 | 90 \item $\emptyset \subseteq [5] \subseteq \N \subseteq \N_0 \subseteq \Z \subseteq \Q \subseteq \R \subseteq \C$ |
|
1
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
91 \end{itemize} |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
92 \end{example} |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
93 \end{frame} |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
94 |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
95 \begin{frame} |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
96 \frametitle{Mengenoperationen} |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
97 |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
98 \begin{block}{Operationen} |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
99 \begin{description}[\qquad\qquad] |
| 3 | 100 \item[$\setnot{A}$] $\defeq \left\{ x \mid x \not\in A \right\}$\hfill\alert{Komplement} |
| 101 \item[$A \cup B$] $\defeq \left\{ x \mid x \in A\ \text{oder}\ x \in B \right\}$\hfill\alert{Vereinigung} | |
| 102 \item[$A \cap B$] $\defeq \left\{ x \mid x \in A\ \text{und}\ x \in B \right\}$\hfill\alert{Schnitt} | |
| 103 \item[$A \setminus B$] $\defeq A \cap \setnot{B}$\hfill\alert{Differenz} | |
| 104 \item[$A \setsymdiff B$] $\defeq \left( A \setminus B \right) \cup \left( B \setminus A \right)$\hfill\alert{Symmetrische Differenz} | |
|
1
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
105 \end{description} |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
106 \end{block} |
|
21
03a0cf37ddaa
fix compilation errors
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
20
diff
changeset
|
107 \vfill |
| 3 | 108 Für mehrere Mengen schreibt man |
|
1
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
109 \begin{align} |
| 3 | 110 \bigcap_{i=1}^n A_i &\defeq A_1 \cap A_2 \cap \ldots \cap A_n\\ |
| 111 \bigcup_{i=1}^n A_i &\defeq A_1 \cup A_2 \cup \ldots \cup A_n | |
|
1
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
112 \end{align} |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
113 \end{frame} |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
114 } |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
115 |
| 3 | 116 \defineUnit{venn}{% |
| 117 \begin{frame} | |
| 118 \frametitle{Venn-Diagramme} | |
| 119 | |
| 120 \structure{Venn-Diagramme} visualisieren Mengen $A, B, \ldots$ im Universum $\Omega$. | |
| 121 | |
| 122 { | |
| 123 \def\universe{(-1.5, -1.25) rectangle (2.5, 1.25) node[anchor=north east, black] {$\Omega$}} | |
| 124 \def\first{(0, 0) circle (1)} | |
| 125 \def\second{(1, 0) circle (1)} | |
| 126 \tikzstyle{universe} = [draw, thick, tumblue, fill=tumlightblue!15] | |
| 127 \tikzstyle{inset} = [fill=tumred!35] | |
| 128 \tikzstyle{outline} = [draw, thick, black] | |
| 129 \begin{columns} | |
| 130 \begin{column}{.5\textwidth} | |
| 131 \begin{itemize} | |
| 132 \item $A \cup B$ | |
| 133 \begin{figure} | |
| 134 \begin{tikzpicture} | |
| 135 \draw[universe] \universe; | |
| 136 \fill[inset] \first; | |
| 137 \fill[inset] \second; | |
| 138 \draw[outline] \first node[left=1em] {$A$}; | |
| 139 \draw[outline] \second node[right=1em] {$B$}; | |
| 140 \end{tikzpicture} | |
| 141 \end{figure} | |
| 142 \item $A \setminus B$ | |
| 143 \begin{figure} | |
| 144 \begin{tikzpicture} | |
| 145 \draw[universe] \universe; | |
| 146 \begin{scope} | |
| 147 \clip \first; | |
| 148 \fill[inset, even odd rule] \first \second; | |
| 149 \end{scope} | |
| 150 \draw[outline] \first node[left=1em] {$A$}; | |
| 151 \draw[outline] \second node[right=1em] {$B$}; | |
| 152 \end{tikzpicture} | |
| 153 \end{figure} | |
| 154 \end{itemize} | |
| 155 \end{column} | |
| 156 \begin{column}{.5\textwidth} | |
| 157 \begin{itemize} | |
| 158 \item $A \cap B$ | |
| 159 \begin{figure} | |
| 160 \begin{tikzpicture} | |
| 161 \draw[universe] \universe; | |
| 162 \begin{scope} | |
| 163 \clip \first; | |
| 164 \fill[inset] \second; | |
| 165 \end{scope} | |
| 166 \draw[outline] \first node[left=1em] {$A$}; | |
| 167 \draw[outline] \second node[right=1em] {$B$}; | |
| 168 \end{tikzpicture} | |
| 169 \end{figure} | |
| 170 \item $A \setsymdiff B = (A \setminus B) \cup (B \setminus A)$ | |
| 171 \begin{figure} | |
| 172 \begin{tikzpicture} | |
| 173 \draw[universe] \universe; | |
| 174 \fill[inset, even odd rule] \first \second; | |
| 175 \draw[outline] \first node[left=1em] {$A$}; | |
| 176 \draw[outline] \second node[right=1em] {$B$}; | |
| 177 \end{tikzpicture} | |
| 178 \end{figure} | |
| 179 \end{itemize} | |
| 180 \end{column} | |
| 181 \end{columns} | |
| 182 } | |
| 183 \end{frame} | |
| 184 } | |
| 185 | |
| 186 \defineUnit{mengenrechenregeln}{% | |
| 187 \begin{frame} | |
| 188 \frametitle{Rechnen mit Mengen} | |
| 189 | |
| 190 \begin{theorem}[De Morgansche Gesetze] | |
| 191 Sind $A, B$ Mengen, dann gilt | |
| 192 \begin{alignat}{2} | |
| 193 \setnot{A \cup B} &= \setnot{A} \cap \setnot{B} \qquad\qquad& \setnot{A \cap B} &= \setnot{A} \cup \setnot{B}\\ | |
| 194 \intertext{Für Mengen $A_i$ gilt} | |
|
21
03a0cf37ddaa
fix compilation errors
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
20
diff
changeset
|
195 \setnot{\bigcup_{i=1}^nA_i} &= \bigcap_{i=1}^n\setnot{A_i} & \setnot{\bigcap_{i=1}^nA_i} &= \bigcup_{i=1}^n\setnot{A_i} |
| 3 | 196 \end{alignat} |
| 197 \end{theorem} | |
| 198 | |
| 199 \vfill | |
| 200 | |
| 201 \begin{itemize} | |
| 202 \item Zusammen mit $\setnot{\setnot{A}} = A$ wichtigste Regel | |
| 203 \item Gilt auch in der Aussagenlogik | |
| 204 \end{itemize} | |
| 205 \end{frame} | |
| 206 } | |
| 207 | |
|
1
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
208 \defineUnit{potenzmenge}{% |
| 3 | 209 \begin{frame} |
| 210 \frametitle{Potenzmenge} | |
| 211 | |
| 212 \begin{definition}[Potenzmenge] | |
| 213 Die \structure{Potenzmenge} $\powerset{M}$ zu einer Menge $M$ ist die Menge all ihrer Teilmengen. | |
| 214 \[ \powerset{M} \defeq \left\{ X \mid X \subseteq M \right\} \] | |
| 215 \end{definition} | |
| 216 | |
| 217 \begin{itemize} | |
| 218 \item $\powerset{M}$ enthält für endliche Mengen genau $2^{\abs{M}}$ Elemente | |
| 219 \item Man schreibt deshalb auch $2^M$ | |
| 220 \item Es ist $M \in \powerset{M}$ und $\emptyset \in \powerset{M}$ | |
| 221 \end{itemize} | |
| 222 | |
| 223 \vfill | |
| 224 | |
| 225 \begin{example}[] | |
| 226 Für $M = \left\{ a, b, c \right\}$ ist | |
| 6 | 227 \[ \powerset{M} = \left\{ |
| 3 | 228 \emptyset, |
| 229 \left\{ a \right\}, | |
| 230 \left\{ b \right\}, | |
| 231 \left\{ c \right\}, | |
| 232 \left\{ a, b \right\}, | |
| 233 \left\{ a, c \right\}, | |
| 234 \left\{ b, c \right\}, | |
| 235 \left\{ a, b, c \right\} | |
| 236 \right\} \] | |
| 237 mit $\abs{\powerset{M}} = 2^3 = 8$ | |
| 238 \end{example} | |
| 239 \end{frame} | |
|
1
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
240 } |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
241 |
|
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
242 \defineUnit{tupel}{% |
| 3 | 243 \begin{frame} |
| 244 \frametitle{Tupel} | |
| 245 | |
| 246 \begin{definition}[Tupel] | |
| 247 Ein \structure{$n$-Tupel} ist eine \alert{geordnete} Sammlung $n$ \alert{beliebiger} Objekte.\\ | |
| 248 Mit \structure{Tupelklammern} werden Objekte zusammengefasst. | |
| 249 \[ T \defeq \left( t_1, t_2, \ldots, t_n \right)\] | |
| 250 \end{definition} | |
| 251 | |
| 252 \begin{itemize} | |
| 253 \item Reihenfolge \alert{nicht} egal | |
| 254 \item Elemente \alert{dürfen} mehrmals vorkommen | |
| 255 \end{itemize} | |
| 256 | |
| 257 \vfill | |
| 258 | |
| 259 \begin{example}[] | |
| 260 \begin{itemize} | |
|
4
fac222767cda
add missing math context
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
3
diff
changeset
|
261 \item $\left( a, b, c \right) \neq \left( c, a, b \right) \neq \left( a, b, c, a, c \right)$ |
| 3 | 262 \item $\left( 1, 2, 3 \right) \neq \left\{ 3, 2, 1 \right\} = \left\{ 1, 2, 3 \right\}$ |
| 263 \item $\left( \left\{ \alpha, \beta \right\}, \emptyset, \N \right)$ | |
| 264 \end{itemize} | |
| 265 \end{example} | |
| 266 \end{frame} | |
| 267 | |
| 268 \begin{frame} | |
| 269 \frametitle{Kreuzprodukt} | |
| 270 | |
| 271 \begin{definition}[Kreuzprodukt] | |
| 272 Sind $A, B$ Mengen, dann ist ihr \structure{kartesisches Produkt} (Kreuzprodukt) | |
| 273 \begin{align} | |
| 274 A \times B &\defeq \left\{ \left( a, b \right) \mid a \in A, b \in B \right\}\\ | |
| 275 \intertext{Für Mengen $A_i$ ist} | |
| 276 A_1 \times \ldots \times A_n &\defeq \left\{ \left(a_1, \ldots, a_n\right) \mid a_1 \in A_1, \ldots, a_n \in A_n \right\} | |
| 277 \end{align} | |
| 278 \end{definition} | |
| 279 | |
| 280 \begin{itemize} | |
| 281 \item Für endliche $A_i$ ist $\abs{A_1 \times \ldots \times A_n} = \abs{A_1} \cdot \ldots \cdot \abs{A_n}$ | |
| 282 \item Man schreibt \structure{$A^n \defeq \underbracket[0.5pt]{A \times \ldots \times A}_{\text{n mal}}$} mit $A^0 = \left\{ \emptyset \right\}$ | |
| 283 \end{itemize} | |
| 284 | |
| 285 \vfill | |
| 286 | |
| 287 \begin{example}[] | |
| 288 \begin{itemize} | |
| 289 \item $\left\{ 1, 2 \right\} \times \left\{ a, b \right\} = \left\{ (1, a), (2, a), (1, b), (2, b) \right\}$ | |
| 290 \item $\left\{ \alpha, \beta \right\}^2 = \left\{ (\alpha, \alpha), (\alpha, \beta), (\beta, \alpha), (\beta, \beta) \right\}$ | |
| 291 \end{itemize} | |
| 292 \end{example} | |
| 293 \end{frame} | |
|
1
ae52d9ffef38
add basic theme; first slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
diff
changeset
|
294 } |
| 6 | 295 |
| 296 \defineUnit{relationen}{% | |
| 297 \begin{frame} | |
| 298 \frametitle{Relation} | |
| 299 | |
| 300 \begin{definition}[Relation] | |
| 301 Eine binäre \structure{Relation} $R$ verbindet Elemente zweier Mengen $A$ und $B$. | |
| 302 \[ R \subseteq A \times B\] | |
| 303 Ist $(a, b) \in R$, so schreibt man auch \structure{$a\rel{R}b$}. | |
| 304 \end{definition} | |
| 305 | |
| 306 \begin{itemize} | |
| 307 \item Eine Relation über $M \times M$ nennt man homogen | |
| 308 \item Es gibt $\abs{\powerset{A \times B}}$ Relationen über $A, B$ | |
| 309 \end{itemize} | |
| 310 | |
| 311 \begin{example}[] | |
| 312 \begin{itemize} | |
| 313 \item Die \alert{Gleichheitsrelation} über $\N \times \N$ \\ | |
| 314 $\left\{ (1,1), (2,2), (3,3), (4,4), (5,5), (6,6), (7,7) \ldots \right\}$ | |
| 315 \medskip | |
| 316 \item Die \alert{Teilbarkeitsrelation} über $\N$ \\ | |
| 317 $\left\{ (1,1), (1,2), (1,3), \ldots, (2,2), (2,4), \ldots, (3,3), (3,6), \ldots \right\}$ | |
| 318 \end{itemize} | |
| 319 \end{example} | |
| 320 \end{frame} | |
| 321 | |
| 322 \begin{frame} | |
| 323 \frametitle{Grafische Darstellung} | |
| 324 | |
| 325 \begin{block}{Grafische Darstellung von Relationen} | |
| 326 Jede Relation $R \subseteq M \times M$ kann als \structure{Graph} dargestellt werden. Die Elemente aus M werden zu \structure{Knoten} und für jedes Tupel $(a, b) \in R$ wird ein \structure{Pfeil} von $a$ nach $b$ eingefügt. | |
| 327 \end{block} | |
| 328 | |
| 329 \begin{example}[] | |
| 330 Sei $R \subseteq [4] \times [4]$ eine Relation über den natürlichen Zahlen. | |
| 331 \[ R \defeq \left\{ (1, 1), (1, 2), (2, 3), (2, 4), (3, 3), (3, 4), (4, 3) \right\}\] | |
| 332 | |
|
11
c2d858c9c53e
move example graph into example block
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
6
diff
changeset
|
333 \centering |
|
c2d858c9c53e
move example graph into example block
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
6
diff
changeset
|
334 \begin{tikzpicture}[x=5em, y=2.5em] |
|
c2d858c9c53e
move example graph into example block
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
6
diff
changeset
|
335 \path (0, 0) node[pretty] (1) {$1$} |
|
c2d858c9c53e
move example graph into example block
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
6
diff
changeset
|
336 +(1, 0) node[pretty] (2) {$2$} |
|
c2d858c9c53e
move example graph into example block
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
6
diff
changeset
|
337 +(2, 1) node[pretty] (3) {$3$} |
|
c2d858c9c53e
move example graph into example block
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
6
diff
changeset
|
338 +(2, -1) node[pretty] (4) {$4$}; |
| 6 | 339 |
|
11
c2d858c9c53e
move example graph into example block
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
6
diff
changeset
|
340 \path[edge] |
| 6 | 341 (1) edge[loop left] (1) |
| 342 (1) edge (2) | |
| 343 (2) edge (3) | |
| 344 (2) edge (4) | |
| 345 (3) edge[loop above] (3) | |
| 346 (3) edge[bend left] (4) | |
| 347 (4) edge[bend left] (3); | |
|
11
c2d858c9c53e
move example graph into example block
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
6
diff
changeset
|
348 \end{tikzpicture} |
|
c2d858c9c53e
move example graph into example block
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
6
diff
changeset
|
349 \end{example} |
| 6 | 350 \end{frame} |
|
26
4436f8006ebd
fix minor errors; sixth slides and sheet
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
21
diff
changeset
|
351 } |
| 6 | 352 |
|
26
4436f8006ebd
fix minor errors; sixth slides and sheet
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
21
diff
changeset
|
353 \defineUnit{relationeneigenschaften}{% |
| 6 | 354 \begin{frame} |
| 355 \frametitle{Eigenschaften von Relationen} | |
| 356 | |
| 357 \begin{block}{Eigenschaften homogener Relationen} | |
| 358 Sei $R \in M \times M$ eine homogene Relation. Man nennt $R$ | |
| 359 \begin{description}[antisymmetrisch] | |
| 360 \item[reflexiv] $ \forall a\hphantom{, b, c} \in M.\ (a, a) \in R$ | |
| 361 \item[total] $ \forall a, b\hphantom{, c} \in M.\ (a, b) \in R \vee (b, a) \in R$ | |
| 362 \medskip | |
|
27
f52078f78e60
fix arrows in early slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
26
diff
changeset
|
363 \item[symmetrisch] $ \forall a, b\hphantom{, c} \in M.\ (a, b) \in R \hphantom{{}\wedge (b, a) \in R}\rightarrow (b,a ) \in R$ |
|
f52078f78e60
fix arrows in early slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
26
diff
changeset
|
364 \item[asymmetrisch] $ \forall a, b\hphantom{, c} \in M.\ (a, b) \in R \hphantom{{}\wedge (b, a) \in R}\rightarrow (b,a ) \not\in R$ |
|
f52078f78e60
fix arrows in early slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
26
diff
changeset
|
365 \item[antisymmetrisch] $ \forall a, b\hphantom{, c} \in M.\ (a, b) \in R \wedge (b, a) \in R \rightarrow a \equiv b$ |
| 6 | 366 \medskip |
|
27
f52078f78e60
fix arrows in early slides
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
26
diff
changeset
|
367 \item[transitiv] $ \forall a, b, c \in M.\ (a, b) \in R \wedge (b, c) \in R \rightarrow (a, c) \in R$ |
| 6 | 368 \end{description} |
| 369 \end{block} | |
| 370 | |
| 371 \vfill | |
| 372 | |
| 373 \begin{itemize} | |
| 374 \item Jede totale Relation ist reflexiv | |
| 375 \item Jede asymmetrische Relation ist antisymmetrisch | |
| 376 \item \structure{Äquivalenzrelationen} sind reflexiv, symmetrisch und transitiv | |
| 377 \item $R^+$ ist die \structure{transitive Hülle}, $R^*$ die \structure{reflexive transitive Hülle} | |
| 378 \end{itemize} | |
| 379 \end{frame} | |
| 380 } | |
| 381 | |
| 382 \defineUnit{funktionen}{% | |
| 383 \begin{frame} | |
| 384 \frametitle{Funktion} | |
| 385 | |
| 386 \begin{definition}[Funktion] | |
| 387 Eine Relation $f \subseteq A \times B$ ist eine \structure{Funktion von A nach B} wenn es für alle $a \in A$ genau ein Element $b \in B$ mit $a \rel{f} b$ gibt. | |
| 388 \[ \forall a \in A. \abs{\left\{ (a, b) \mid b \in B \right\}} \alert{=} 1 \] | |
| 389 Man schreibt | |
| 390 \begin{align} | |
| 391 f : A &\to B \\ | |
| 392 a &\mapsto f(a) = b | |
| 393 \end{align} | |
| 394 \structure{$A \to B$} bezeichnet die Menge aller Funktionen von $A$ nach $B$. | |
| 395 \end{definition} | |
| 396 | |
| 397 \vfill | |
| 398 \centering | |
| 399 { | |
| 400 \tikzstyle{set} = [draw, thick, tumgreen, fill=tumgreen!15] | |
| 401 \tikzstyle{element} = [thick] | |
| 402 \tikzstyle{arrow} = [thick, tumblue, shorten >=-.4em, shorten <=-.4em] | |
| 403 \begin{tikzpicture}[x=1.5em, y=1.5em] | |
| 404 \draw[set] (0, 0) ellipse (1 and 2); | |
| 405 \draw[set] (5, 0) ellipse (1 and 2); | |
| 406 | |
| 407 \path[element] | |
| 408 (0,0) | |
| 409 +(0, 1.5) node (a1) {$\times$} | |
| 410 +(0.2, 0.85) node (a2) {$\times$} | |
| 411 +(0.1, -0.6) node (a4) {$\times$} | |
| 412 +(-0.1, -1.5) node (a5) {$\times$}; | |
| 413 | |
| 414 \path[element] | |
| 415 (5,0) | |
| 416 +(0, 1.5) node (b1) {$\times$} | |
| 417 +(0.2, 0.85) node (b2) {$\times$} | |
| 418 +(-0.3, 0.0) node (b3) {$\times$} | |
| 419 +(0.1, -0.6) node (b4) {$\times$} | |
| 420 +(-0.1, -1.5) node (b5) {$\times$}; | |
| 421 | |
| 422 \path[arrow] | |
| 423 (a1) edge (b1) | |
| 424 (a2) edge (b5) | |
| 425 (a4) edge (b2) | |
| 426 (a5) edge (b5); | |
| 427 | |
| 428 \path | |
| 429 (0, -2.5) node {$A$} | |
| 430 (5, -2.5) node {$B$} | |
| 431 (2.5, -2.5) node {$f$}; | |
| 432 \end{tikzpicture} | |
| 433 } | |
| 434 \end{frame} | |
| 435 | |
| 436 \begin{frame} | |
| 437 \frametitle{Bild und Urbild} | |
| 438 | |
| 439 \begin{definition}[Bild] | |
| 440 Sei $f : A \to B$ eine Funktion, $X \subseteq A$, $Y \subseteq B$, $b \in B$. Dann ist | |
| 441 \begin{align} | |
| 442 f(X) &\defeq \left\{ f(x) \mid x \in X \right\} \\ | |
| 443 \intertext{das \structure{Bild} der Menge $X$ unter $f$. Außerdem ist} | |
| 444 f^{-1}(b) &\defeq \left\{ a \mid a \in A, f(a) = b \right\} \\ | |
| 445 f^{-1}(Y) &\defeq \bigcup_{y \in Y} \left\{ f^{-1}(y) \right\} | |
| 446 \end{align} | |
| 447 das \structure{Urbild} des Elements $b$ und der Menge $Y$ unter $f$. | |
| 448 \end{definition} | |
| 449 | |
| 450 \vfill | |
| 451 | |
| 452 \begin{itemize} | |
| 453 \item Man nennt $A = f^{-1}(B)$ \structure{Urbild} oder \structure{Definitionsmenge} von $f$ | |
| 454 \item Man nennt $f(A) \subseteq B$ \structure{Bild} oder \structure{Wertemenge} von $f$ | |
| 455 \end{itemize} | |
| 456 \end{frame} | |
| 457 | |
| 458 \begin{frame} | |
| 459 \frametitle{Komposition} | |
| 460 | |
| 461 \begin{definition}[Funktionskomposition] | |
| 462 Seien $f : B \to C$ und $g : A \to B$ Funktionen. Dann ist | |
| 463 \begin{align} | |
| 464 h : A &\to C \\ | |
| 465 a &\mapsto (f \circ g)(a) = f(g(a)) | |
| 466 \end{align} | |
| 467 die \structure{Komposition} der Funktionen $f$ und $g$.\\ | |
| 468 Man ließt $f \circ g$ als \enquote{f \structure{nach} g}. | |
| 469 \end{definition} | |
| 470 | |
| 471 \vfill | |
| 472 | |
| 473 Man definiert die Potenzierung von Funktionen ähnlich der Mengentheorie. | |
| 474 \begin{align} | |
| 475 f^0 &\defeq id\\ | |
| 476 f^n &\defeq \underbracket[0.5pt]{f \circ \ldots \circ f}_{\text{n mal}} | |
| 477 \end{align} | |
| 478 Dabei bezeichnet $id$ die \structure{Identität} mit $id(x) \defeq x$. | |
| 479 \end{frame} | |
| 480 | |
|
15
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
481 { |
|
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
482 \tikzstyle{set} = [draw, thick, tumgreen, fill=tumgreen!15] |
|
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
483 \tikzstyle{element} = [thick] |
|
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
484 \tikzstyle{head} = [draw, fill=tumblue!15, thick] |
|
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
485 \tikzstyle{arrow} = [thick, tumblue, shorten >=-.4em, shorten <=-.4em] |
|
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
486 \newcommand{\function}[3]{% |
|
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
487 \draw[set] (0, 0) ellipse (1 and 2); |
|
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
488 \draw[set] (4, 0) ellipse (1 and 2); |
| 6 | 489 |
|
15
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
490 \path[element] |
|
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
491 (0,0) |
|
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
492 +(0, 1.5) node (a1) {$\times$} |
|
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
493 +(0.2, 0.85) node (a2) {$\times$} |
|
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
494 +(0.1, 0.3) node (a3) {$\times$} |
|
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
495 +(-0.1, -0.1) node (a4) {$\times$} |
|
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
496 +(-0.2, -0.7) node (a5) {##2} |
|
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
497 +(-0.1, -1.5) node (a6) {##3}; |
| 6 | 498 |
|
15
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
499 \path[element] |
|
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
500 (4,0) |
|
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
501 +(0, 1.5) node (b1) {$\times$} |
|
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
502 +(0.2, 0.85) node (b2) {$\times$} |
|
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
503 +(-0.3, 0.0) node (b3) {$\times$} |
|
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
504 +(0.1, -0.6) node (b4) {$\times$} |
|
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
505 +(-0.1, -1.5) node (b5) {$\times$}; |
|
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
506 |
|
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
507 \path |
|
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
508 (0, -2.5) node {$A$} |
|
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
509 (4, -2.5) node {$B$} |
|
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
510 (2, -2.5) node {$f$} |
|
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
511 (2, 3) node[head] {##1}; |
|
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
512 } |
| 6 | 513 |
|
15
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
514 \begin{frame} |
|
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
515 \frametitle{Eigenschaften von Funktionen} |
| 6 | 516 |
|
15
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
517 \begin{block}{Eigenschaften von Funktionen} |
|
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
518 Sei $f: A \to B$ eine Funktion. Man nennt $f$ |
|
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
519 \begin{description}[surjektiv] |
|
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
520 \item[injektiv] $\forall b \in B. \abs{f^{-1}(b)} \leq 1$ \hfill(Kein $b$ wird doppelt getroffen) |
|
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
521 \item[surjektiv] $\forall b \in B. \abs{f^{-1}(b)} \geq 1$\hfill(Jedes $b$ wird getroffen) |
|
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
522 \item[bijektiv] $\forall b \in B. \abs{f^{-1}(b)} = 1$\hfill(Jedes $b$ wird genau einmal getroffen) |
|
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
523 \end{description} |
|
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
524 \end{block} |
| 6 | 525 |
|
15
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
526 \vfill |
|
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
527 \centering |
| 6 | 528 \begin{tikzpicture}[x=1.5em, y=1.5em] |
| 529 \function{Injektiv}{}{} | |
| 530 | |
| 531 \path[arrow] | |
|
15
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
532 (a1) edge (b1) |
|
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
533 (a2) edge (b3) |
|
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
534 (a3) edge (b2) |
|
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
535 (a4) edge (b4); |
| 6 | 536 \end{tikzpicture} |
| 537 \hfill | |
| 538 \begin{tikzpicture}[x=1.5em, y=1.5em] | |
| 539 \function{Surjektiv}{$\times$}{$\times$} | |
| 540 | |
| 541 \path[arrow] | |
|
15
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
542 (a1) edge (b1) |
|
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
543 (a2) edge (b3) |
|
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
544 (a3) edge (b2) |
|
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
545 (a4) edge (b4) |
|
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
546 (a5) edge (b5) |
|
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
547 (a6) edge (b5); |
| 6 | 548 \end{tikzpicture} |
| 549 \hfill | |
| 550 \begin{tikzpicture}[x=1.5em, y=1.5em] | |
| 551 \function{Bijektiv}{}{$\times$} | |
| 552 | |
| 553 \path[arrow] | |
|
15
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
554 (a1) edge (b1) |
|
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
555 (a2) edge (b3) |
|
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
556 (a3) edge (b2) |
|
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
557 (a4) edge (b4) |
|
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
558 (a6) edge (b5); |
| 6 | 559 \end{tikzpicture} |
|
15
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
560 \end{frame} |
|
2c32ba8308c3
hopefully fix compilation error in funktionen unit
Markus Kaiser <markus.kaiser@in.tum.de>
parents:
12
diff
changeset
|
561 } |
| 6 | 562 } |