The ternary operator has the following syntax:
Note 1: ETH::EProg
Deck: ETH::EProg
Note Type: Horvath Classic
GUID:
modified
Note Type: Horvath Classic
GUID:
Q=BFp=(vY3
Before
Front
Back
The ternary operator has the following syntax:
After
Front
The ternary operator has the following syntax:
Back
The ternary operator has the following syntax:
test ? valueTrue : valueFalse
Field-by-field Comparison
| Field | Before | After |
|---|---|---|
| Front | The ternary operator has the following syntax: |
The ternary operator has the following syntax: |
| Back | test ? valueTrue : valueFalse |
Note 2: ETH::LinAlg
Deck: ETH::LinAlg
Note Type: Horvath Cloze
GUID:
added
Note Type: Horvath Cloze
GUID:
col^b$YzMt
Previous
Note did not exist
New Note
Front
\(v^\top v = \) \(||v||^2\) (in terms of norm)
Back
\(v^\top v = \) \(||v||^2\) (in terms of norm)
as \(||v|| = \sqrt{v^\top v}\).
Field-by-field Comparison
| Field | Before | After |
|---|---|---|
| Text | \(v^\top v = \){{c1:: \(||v||^2\)}} (in terms of norm) | |
| Extra | as \(||v|| = \sqrt{v^\top v}\). |
Note 3: ETH::LinAlg
Deck: ETH::LinAlg
Note Type: Horvath Classic
GUID:
added
Note Type: Horvath Classic
GUID:
d4<]X?O^},
Previous
Note did not exist
New Note
Front
When is \(0 \in \textbf{Span}(\{v_1, \dots, v_n\})\)?
Back
When is \(0 \in \textbf{Span}(\{v_1, \dots, v_n\})\)?
\(0\) is in the span of any vectors, even in the span of the empty set.
Field-by-field Comparison
| Field | Before | After |
|---|---|---|
| Front | When is \(0 \in \textbf{Span}(\{v_1, \dots, v_n\})\)? | |
| Back | \(0\) is in the span of any vectors, even in the span of the empty set. |
Note 4: ETH::LinAlg
Deck: ETH::LinAlg
Note Type: Horvath Cloze
GUID:
added
Note Type: Horvath Cloze
GUID:
gU%jisb2z3
Previous
Note did not exist
New Note
Front
Scalar product properties: \(u, v, w \in \mathbb{R}^m\) be vectors and \(\lambda \in \mathbb{R}\) a scalar.
- \(v \cdot w = w \cdot v\) (symmetry / commutatitivity
- \((\lambda v) \cdot w = \lambda (v \cdot w)\) (scalars move freely)
- \(u \cdot (v + w) = u \cdot v + u \cdot w\) and \((u + v) \cdot w = u\cdot w + v \cdot w\) (distributivity)
- \(v \cdot v \geq 0\) with equality if and only if \(v = 0\) (positive definiteness
Back
Scalar product properties: \(u, v, w \in \mathbb{R}^m\) be vectors and \(\lambda \in \mathbb{R}\) a scalar.
- \(v \cdot w = w \cdot v\) (symmetry / commutatitivity
- \((\lambda v) \cdot w = \lambda (v \cdot w)\) (scalars move freely)
- \(u \cdot (v + w) = u \cdot v + u \cdot w\) and \((u + v) \cdot w = u\cdot w + v \cdot w\) (distributivity)
- \(v \cdot v \geq 0\) with equality if and only if \(v = 0\) (positive definiteness
Field-by-field Comparison
| Field | Before | After |
|---|---|---|
| Text | Scalar product properties: \(u, v, w \in \mathbb{R}^m\) be vectors and \(\lambda \in \mathbb{R}\) a scalar.<br><ol><li>{{c1::\(v \cdot w = w \cdot v\) (symmetry / commutatitivity}}</li><li>{{c2:: \((\lambda v) \cdot w = \lambda (v \cdot w)\) (scalars move freely)}}</li><li>{{c3:: \(u \cdot (v + w) = u \cdot v + u \cdot w\) and \((u + v) \cdot w = u\cdot w + v \cdot w\) (distributivity)}}</li><li>{{c4:: \(v \cdot v \geq 0\) with equality if and only if \(v = 0\) (positive definiteness}}</li></ol> |
Note 5: ETH::LinAlg
Deck: ETH::LinAlg
Note Type: Horvath Cloze
GUID:
added
Note Type: Horvath Cloze
GUID:
k_E{8UgRT{
Previous
Note did not exist
New Note
Front
The dimensions of a hyperplane \(H\) through the origin in \(\mathbb{R}^m\) is \(m - 1\).
Back
The dimensions of a hyperplane \(H\) through the origin in \(\mathbb{R}^m\) is \(m - 1\).
See assignment 6 proof.
Field-by-field Comparison
| Field | Before | After |
|---|---|---|
| Text | The dimensions of a hyperplane \(H\) through the origin in \(\mathbb{R}^m\) is {{c1:: \(m - 1\)}}. | |
| Extra | See assignment 6 proof. |
Note 6: ETH::LinAlg
Deck: ETH::LinAlg
Note Type: Horvath Classic
GUID:
added
Note Type: Horvath Classic
GUID:
ltjw8T1j7K
Previous
Note did not exist
New Note
Front
The span \(\textbf{Span}(\emptyset)\) is:
Back
The span \(\textbf{Span}(\emptyset)\) is:
\(\{0\}\) only the zero vector, as the empty sum = 0.
Field-by-field Comparison
| Field | Before | After |
|---|---|---|
| Front | The span \(\textbf{Span}(\emptyset)\) is: | |
| Back | \(\{0\}\) only the zero vector, as the empty sum = 0. |
Note 7: ETH::LinAlg
Deck: ETH::LinAlg
Note Type: Horvath Cloze
GUID:
modified
Note Type: Horvath Cloze
GUID:
nkL&a6|Q;d
Before
Front
The span of m linearly independent vectors is \({{c1::\mathbb{R}^m}}\).
Back
The span of m linearly independent vectors is \({{c1::\mathbb{R}^m}}\).
This also means that a matrix in \(\mathbb{R}^{n \times n}\) with rank(A) = n spans the entire space.
After
Front
The span of m linearly independent vectors is {{c1::\(\mathbb{R}^m\)}}.
Back
The span of m linearly independent vectors is {{c1::\(\mathbb{R}^m\)}}.
This also means that a matrix in \(\mathbb{R}^{n \times n}\) with rank(A) = n spans the entire space.
Field-by-field Comparison
| Field | Before | After |
|---|---|---|
| Text | The span of m linearly independent vectors is |
The span of m linearly independent vectors is {{c1::\(\mathbb{R}^m\)}}. |
Note 8: ETH::LinAlg
Deck: ETH::LinAlg
Note Type: Horvath Cloze
GUID:
modified
Note Type: Horvath Cloze
GUID:
qGI8y.9F)Z
Before
Front
If I add vector v, which is a linear combination of \(v_1, v_2, ..., v_n\) to the span it:
Back
If I add vector v, which is a linear combination of \(v_1, v_2, ..., v_n\) to the span it:
does not change
After
Front
If I add vector v, which is a linear combination of \(v_1, v_2, ..., v_n\) to the span it does not change
Back
If I add vector v, which is a linear combination of \(v_1, v_2, ..., v_n\) to the span it does not change
Field-by-field Comparison
| Field | Before | After |
|---|---|---|
| Text | If I add vector v, which is a linear combination of \(v_1, v_2, ..., v_n\) to the span it |
If I add vector v, which is a linear combination of \(v_1, v_2, ..., v_n\) to the span it {{c1::does not change}} |
| Extra |
Note 9: ETH::LinAlg
Deck: ETH::LinAlg
Note Type: Horvath Cloze
GUID:
added
Note Type: Horvath Cloze
GUID:
w7_|F6Nt!U
Previous
Note did not exist
New Note
Front
The triangle inequality \(||v|| + ||w|| \geq ||v+w||\) holds exactly if \(\exists \lambda \) s.t. \(w = \lambda v\) (i.e. they are scalar multiples)
Back
The triangle inequality \(||v|| + ||w|| \geq ||v+w||\) holds exactly if \(\exists \lambda \) s.t. \(w = \lambda v\) (i.e. they are scalar multiples)
Field-by-field Comparison
| Field | Before | After |
|---|---|---|
| Text | The triangle inequality \(||v|| + ||w|| \geq ||v+w||\) holds exactly if {{c1::\(\exists \lambda \) s.t. \(w = \lambda v\) (i.e. they are scalar multiples)}} |