update la7

This commit is contained in:
2019-12-04 20:38:18 +01:00
parent a5c210aa6f
commit 8afd1da9fc
4 changed files with 9 additions and 9 deletions
Binary file not shown.
Binary file not shown.
+8 -8
View File
@@ -46,27 +46,27 @@
Definiere:
\begin{align*}
&w_1 := \begin{cases}
1 & \exists k \in \N\colon n = 3k+1 \\
0 & \exists k \in \N\colon n = 3k+2 \\
-1 & \exists k \in \N\colon n = 3k
1 & \exists k \in \N_0\colon n = 3k+1 \\
0 & \exists k \in \N_0\colon n = 3k+2 \\
-1 & \exists k \in \N_0\colon n = 3k
\end{cases}, \qquad
w_2 \colon= \begin{cases}
0 & \exists k \in \N\colon n = 3k+1 \\
1 & \exists k \in \N\colon n = 3k+2 \\
-1 & \exists k \in \N\colon n = 3k
0 & \exists k \in \N_0\colon n = 3k+1 \\
1 & \exists k \in \N_0\colon n = 3k+2 \\
-1 & \exists k \in \N_0\colon n = 3k
\end{cases}
.\end{align*}
Zz.: $w_1, w_2 \in W$. Sei $n \in \N$ beliebig.
Falls $\exists k \in \N\colon n = 3k+1$, dann $n + 1 = 3k+2$ und $n + 2 = 3(k+1)$.
Falls $\exists k \in \N_0\colon n = 3k+1$, dann $n + 1 = 3k+2$ und $n + 2 = 3(k+1)$.
\begin{align*}
w_1(n) + w_1(n+1) + w_1(n+2) &= 1 + 0 - 1 = 0
\intertext{und}
w_2(n) + w_2(n+1) + w_2(n+2) &= 0 + 1 - 1 = 0
.\end{align*}
Fälle $\exists k \in \N\colon n = 3k+2$ bzw. $n = 3k$ folgen analog.
Fälle $\exists k \in \N_0\colon n = 3k+2$ bzw. $n = 3k$ folgen analog.
Zz.: $\{w_1, w_2\} $ ist Erzeugendensystem. Sei $f \in W$ beliebig.
Wähle $a_1 := f(1)$ und $a_2 := f(2)$. Damit gilt: