A ring has the following properties:
Note 1: ETH::DiskMat
Deck: ETH::DiskMat
Note Type: Horvath Classic
GUID:
modified
Note Type: Horvath Classic
GUID:
EOU=o(/Tm!
Before
Front
Back
A ring has the following properties:
Additive Group:
- closure
- associativity
- identity
- inverse
Multiplicative group:
- closure
- associativity
- distributivity
After
Front
A ring has the following properties:
Back
A ring has the following properties:
Additive Group:
- closure
- associativity
- identity
- inverse
- commutative
Multiplicative group:
- closure
- associativity
- identity
- distributivity
Field-by-field Comparison
| Field | Before | After |
|---|---|---|
| Back | Additive Group:<br><ul><li>closure</li><li>associativity</li><li>identity</li><li>inverse</li></ul><div>Multiplicative group:</div><div></div><ul><li>closure</li><li>associativity</li><li>distributivity</li></ul> | Additive Group:<br><ul><li>closure</li><li>associativity</li><li>identity</li><li>inverse</li><li>commutative</li></ul><div>Multiplicative group:</div><div></div><ul><li>closure</li><li>associativity</li><li>identity</li><li>distributivity</li></ul> |
Note 2: ETH::DiskMat
Deck: ETH::DiskMat
Note Type: Horvath Classic
GUID:
modified
Note Type: Horvath Classic
GUID:
Jyob1i~-v!
Before
Front
A commutative ring has the following properties:
Back
A commutative ring has the following properties:
Additive Group:
- closure
- associativity
- identity
- inverse
Multiplicative group:
- closure
- associativity
- distributivity
- commutative
After
Front
A commutative ring has the following properties:
Back
A commutative ring has the following properties:
Additive Group:
- closure
- associativity
- identity
- inverse
- commutative
Multiplicative group:
- closure
- associativity
- identity
- distributivity
- commutative
Field-by-field Comparison
| Field | Before | After |
|---|---|---|
| Back | Additive Group:<br><ul><li>closure</li><li>associativity</li><li>identity</li><li>inverse</li></ul><div>Multiplicative group:</div><div></div><ul><li>closure</li><li>associativity</li><li>distributivity</li><li>commutative</li></ul> | Additive Group:<br><ul><li>closure</li><li>associativity</li><li>identity</li><li>inverse</li><li>commutative</li></ul><div>Multiplicative group:</div><div></div><ul><li>closure</li><li>associativity</li><li>identity</li><li>distributivity</li><li>commutative</li></ul> |
Note 3: ETH::DiskMat
Deck: ETH::DiskMat
Note Type: Horvath Cloze
GUID:
modified
Note Type: Horvath Cloze
GUID:
qFYoZgCSMu
Before
Front
The predicate \(\tau\) defines the {{c1:: set of strings \(L \subseteq \{0, 1\}\) that correspond to true statements}}.
Back
The predicate \(\tau\) defines the {{c1:: set of strings \(L \subseteq \{0, 1\}\) that correspond to true statements}}.
After
Front
The predicate \(\tau\) defines the set {{c1::of strings \(L \subseteq \{0, 1\}\) that correspond to true statements}}.
Back
The predicate \(\tau\) defines the set {{c1::of strings \(L \subseteq \{0, 1\}\) that correspond to true statements}}.
Field-by-field Comparison
| Field | Before | After |
|---|---|---|
| Text | The predicate \(\tau\) defines the {{c1:: |
The predicate \(\tau\) defines the set {{c1::of strings \(L \subseteq \{0, 1\}\) that correspond to true statements}}. |
Note 4: ETH::DiskMat
Deck: ETH::DiskMat
Note Type: Horvath Classic
GUID:
modified
Note Type: Horvath Classic
GUID:
uFE6t!4Hr%
Before
Front
A field has the following properties:
Back
A field has the following properties:
Additive Group:
- closure
- associativity
- identity
- inverse
Multiplicative group:
- closure
- associativity
- distributivity
- identity
- no zero-divisor
- inverse
After
Front
A field has the following properties:
Back
A field has the following properties:
Additive Group:
- closure
- associativity
- identity
- inverse
- commutative
Multiplicative group:
- closure
- associativity
- distributivity
- identity
- no zero-divisor
- inverse
Field-by-field Comparison
| Field | Before | After |
|---|---|---|
| Back | Additive Group:<br><ul><li>closure</li><li>associativity</li><li>identity</li><li>inverse</li></ul><div>Multiplicative group:</div><div></div><ul><li>closure</li><li>associativity</li><li>distributivity</li><li>identity</li><li>no zero-divisor</li><li>inverse</li></ul> | Additive Group:<br><ul><li>closure</li><li>associativity</li><li>identity</li><li>inverse</li><li>commutative</li></ul><div>Multiplicative group:</div><div></div><ul><li>closure</li><li>associativity</li><li>distributivity</li><li>identity</li><li>no zero-divisor</li><li>inverse</li></ul> |
Note 5: ETH::DiskMat
Deck: ETH::DiskMat
Note Type: Horvath Classic
GUID:
modified
Note Type: Horvath Classic
GUID:
y|z>._M[it
Before
Front
An integral domain has the following properties:
Back
An integral domain has the following properties:
Additive Group:
- closure
- associativity
- identity
- inverse
Multiplicative group:
- closure
- associativity
- distributivity
- identity
- no zero-divisors
After
Front
An integral domain has the following properties:
Back
An integral domain has the following properties:
Additive Group:
- closure
- associativity
- identity
- inverse
- commutative
Multiplicative group:
- closure
- associativity
- distributivity
- identity
- no zero-divisors
Field-by-field Comparison
| Field | Before | After |
|---|---|---|
| Back | Additive Group:<br><ul><li>closure</li><li>associativity</li><li>identity</li><li>inverse</li></ul><div>Multiplicative group:</div><div></div><ul><li>closure</li><li>associativity</li><li>distributivity</li><li>identity</li><li>no zero-divisors</li></ul> | Additive Group:<br><ul><li>closure</li><li>associativity</li><li>identity</li><li>inverse</li><li>commutative</li></ul><div>Multiplicative group:</div><div></div><ul><li>closure</li><li>associativity</li><li>distributivity</li><li>identity</li><li>no zero-divisors</li></ul> |
Note 6: ETH::LinAlg
Deck: ETH::LinAlg
Note Type: Horvath Cloze
GUID:
modified
Note Type: Horvath Cloze
GUID:
w49b;wY}uY
Before
Front
The {{c2::rank of a matrix \(\textbf{rank}(A), A \in \mathbb{R}^{m \times n}\) is a number between 0 and n}} which .
Back
The {{c2::rank of a matrix \(\textbf{rank}(A), A \in \mathbb{R}^{m \times n}\) is a number between 0 and n}} which .
A column is independent if it is not the linear combination of the previous ones (or the next ones, if you do it the other way round).
After
Front
The {{c2::rank of a matrix \(\textbf{rank}(A), A \in \mathbb{R}^{m \times n}\) is a number between 0 and n}} which counts the number of independent columns.
Back
The {{c2::rank of a matrix \(\textbf{rank}(A), A \in \mathbb{R}^{m \times n}\) is a number between 0 and n}} which counts the number of independent columns.
A column is independent if it is not the linear combination of the previous ones (or the next ones, if you do it the other way round).
Field-by-field Comparison
| Field | Before | After |
|---|---|---|
| Text | The {{c2::rank of a matrix \(\textbf{rank}(A), A \in \mathbb{R}^{m \times n}\) is a number between 0 and n}} which {{c1:counts the number of independent columns}}. | The {{c2::rank of a matrix \(\textbf{rank}(A), A \in \mathbb{R}^{m \times n}\) is a number between 0 and n}} which {{c1::counts the number of independent columns}}. |