Anki Deck Changes

Commit: 4a2a331e - fix some PlsFix and retag

Author: obrhubr <obrhubr@gmail.com>

Date: 2025-12-12T21:07:40+01:00

Changes: 23 note(s) changed (4 added, 19 modified, 0 deleted)

ℹ️ Cosmetic Changes Hidden: 5 note(s) had formatting-only changes and are not shown below

Note 1: ETH::A&D

Deck: ETH::A&D
Note Type: Algorithms
GUID: j#w5w>dS6
modified

Before

Front

Back

ETH::1._Semester::A&D::10._Shortest_Paths::2._Bellman-Ford_Algorithm REWORK
Runtime of
Bellman-Ford

Runtime: {{c1::\( \mathcal{O}(|E| \cdot |V|)\)}}

Approach: {{c2::Initiate all distances with  \(\infty\) . Then go \(|V| - 1\) times through every edge, and test for all (u,v) in E if \(\text{dist}[v] > \text{dist}[u] + w(u,v)\). If yes, update the distance. If after \(|V| - 1\) iterations an edge can still be relaxed (in a last iteration), then there exists a negative cycle.}}

Uses:
?


After

Front

Back

ETH::1._Semester::A&D::10._Shortest_Paths::2._Bellman-Ford_Algorithm PlsFix::AD_Algo
Runtime of
Bellman-Ford

Runtime: :\( \mathcal{O}(|E| \cdot |V|)\)}}

Approach: Initiate all distances with  \(\infty\) . Then go \(|V| - 1\) times through every edge, and test for all (u,v) in E if \(\text{dist}[v] > \text{dist}[u] + w(u,v)\). If yes, update the distance. If after \(|V| - 1\) iterations an edge can still be relaxed (in a last iteration), then there exists a negative cycle

Uses: Detect negative cycles, find minimal-cost paths in weighted graphs with negative weights}}
?


Field-by-field Comparison
Field Before After
Name <div style="text-align: center;"><b>Bellman-Ford</b></div><div style="text-align: center; "><br></div><div><b>Runtime</b>: {{c1::\( \mathcal{O}(|E| \cdot |V|)\)}}</div><div><br></div><div><b>Approach</b>: {{c2::Initiate all distances with  \(\infty\) . Then go&nbsp;\(|V| - 1\)&nbsp;times through every edge, and test for all (u,v) in E if&nbsp;\(\text{dist}[v] &gt; \text{dist}[u] + w(u,v)\). If yes, update the distance. If after&nbsp;\(|V| - 1\)&nbsp;iterations an edge can still be relaxed (in a last iteration), then there exists a negative cycle.}}</div><div><br></div><div><b>Uses</b>: {{c3::Detect negative cycles, find minimal-cost paths in weighted graphs with negative weights}}</div> <div style="text-align: center;"><b>Bellman-Ford</b></div><div style="text-align: center; "><br></div><div><b>Runtime</b>: :\( \mathcal{O}(|E| \cdot |V|)\)}}</div><div><br></div><div><b>Approach</b>: Initiate all distances with  \(\infty\) . Then go&nbsp;\(|V| - 1\)&nbsp;times through every edge, and test for all (u,v) in E if&nbsp;\(\text{dist}[v] &gt; \text{dist}[u] + w(u,v)\). If yes, update the distance. If after&nbsp;\(|V| - 1\)&nbsp;iterations an edge can still be relaxed (in a last iteration), then there exists a negative cycle</div><div><br></div><div><b>Uses</b>: Detect negative cycles, find minimal-cost paths in weighted graphs with negative weights}}</div>
Tags: REWORK ETH::1._Semester::A&D::10._Shortest_Paths::2._Bellman-Ford_Algorithm PlsFix::AD_Algo

Note 2: ETH::A&D

Deck: ETH::A&D
Note Type: Algorithms
GUID: F^nhYx>fXl
modified

Before

Front

Back

ETH::1._Semester::A&D::11._Minimum_Spanning_Trees::1._Boruvka's_Algorithm REWORK
Runtime of
Boruvka

Runtime: {{c1::\( \mathcal{O}((|E| + |V|) \cdot \log |V|)\)}}

Approach:

Uses:
?


After

Front

Back

ETH::1._Semester::A&D::11._Minimum_Spanning_Trees::1._Boruvka's_Algorithm PlsFix::AD_Algo
Runtime of
Boruvka

Runtime:

Approach: Add all vertices to the set of components (so every vertex has its own component). As long as the size of the components set is greater than 1, connect each component to the one with the cheapest edge.

Uses: Find MST in weighted, undirected graph
?


Field-by-field Comparison
Field Before After
Name <div style="text-align: center;"><b>Boruvka</b></div><div><br></div><div><b>Runtime</b>: {{c1::\( \mathcal{O}((|E| + |V|) \cdot \log |V|)\)}}</div><div><br></div><div><b>Approach</b>: {{c2::Add all vertices to the set of components (so every vertex has its own component). As long as the size of the components set is greater than 1, connect each component to the one with the cheapest edge.}}</div><div><br></div><div><b>Uses</b>: {{c3::Find MST in weighted, undirected graph}}</div> <div style="text-align: center;"><b>Boruvka</b></div><div><br></div><div><b>Runtime</b>: </div><div><br></div><div><b>Approach</b>: Add all vertices to the set of components (so every vertex has its own component). As long as the size of the components set is greater than 1, connect each component to the one with the cheapest edge.</div><div><br></div><div><b>Uses</b>: Find MST in weighted, undirected graph</div>
Tags: REWORK ETH::1._Semester::A&D::11._Minimum_Spanning_Trees::1._Boruvka's_Algorithm PlsFix::AD_Algo

Note 3: ETH::A&D

Deck: ETH::A&D
Note Type: Horvath Classic
GUID: eP)-7WD~tP
modified

Before

Front

ETH::1._Semester::A&D::07._Graphs::2._Closed_Eulerian_Walks PlsFix::ClozeThatBish REWORK
What is the runtime for an algorithm to determine a Eulerian walk if it exists and how fast is an algorithm to determine a Hamiltonian path if it exists?

Back

ETH::1._Semester::A&D::07._Graphs::2._Closed_Eulerian_Walks PlsFix::ClozeThatBish REWORK
What is the runtime for an algorithm to determine a Eulerian walk if it exists and how fast is an algorithm to determine a Hamiltonian path if it exists?

Eulerian path - \(O(n+m)\)
Hamiltonian walk - exponential, we have to brute-force

After

Front

ETH::1._Semester::A&D::07._Graphs::2._Closed_Eulerian_Walks
Runtime Determine if Eulerian walk exists?

Back

ETH::1._Semester::A&D::07._Graphs::2._Closed_Eulerian_Walks
Runtime Determine if Eulerian walk exists?

Eulerian path - \(O(n+m)\)
Field-by-field Comparison
Field Before After
Front What is the runtime for an algorithm to determine a Eulerian walk if it exists and how fast is an algorithm to determine a Hamiltonian path if it exists? <b>Runtime</b>&nbsp;Determine if Eulerian walk exists?
Back Eulerian path -&nbsp;\(O(n+m)\)<br>Hamiltonian walk - exponential, we have to brute-force Eulerian path -&nbsp;\(O(n+m)\)
Tags: PlsFix::ClozeThatBish REWORK ETH::1._Semester::A&D::07._Graphs::2._Closed_Eulerian_Walks

Note 4: ETH::A&D

Deck: ETH::A&D
Note Type: Horvath Classic
GUID: FAEpag8L6e
added

Previous

Note did not exist

New Note

Front

ETH::1._Semester::A&D::07._Graphs::2._Closed_Eulerian_Walks
Runtime Determine if Hamiltonian path exists?

Back

ETH::1._Semester::A&D::07._Graphs::2._Closed_Eulerian_Walks
Runtime Determine if Hamiltonian path exists?

Hamiltonian walk - exponential, we have to brute-force
Field-by-field Comparison
Field Before After
Front <b>Runtime</b>&nbsp;Determine if <b>Hamiltonian path</b>&nbsp;exists?
Back Hamiltonian walk - <b>exponential</b>, we have to brute-force
Tags: ETH::1._Semester::A&D::07._Graphs::2._Closed_Eulerian_Walks

Note 5: ETH::DiskMat

Deck: ETH::DiskMat
Note Type: Horvath Cloze
GUID: FQ(ROCHF--
modified

Before

Front

ETH::1._Semester::DiskMat::2._Math._Reasoning,_Proofs,_and_a_First_Approach_to_Logic::6._Some_Proof_Patterns::05._Case_Distinction PlsFix::ClozeThatBish
Describe the three steps of a case distinction proof of statement \(S\).

Back

ETH::1._Semester::DiskMat::2._Math._Reasoning,_Proofs,_and_a_First_Approach_to_Logic::6._Some_Proof_Patterns::05._Case_Distinction PlsFix::ClozeThatBish
Describe the three steps of a case distinction proof of statement \(S\).

1. Find a finite list \(R_1, \ldots, R_k\) of mathematical statements (the cases)
2. Prove that at least one of \(R_i\) is true (at least one case occurs)
3. Prove that \(R_i \Rightarrow S\) for \(i = 1, \ldots, k\)

After

Front

DELETE ETH::1._Semester::DiskMat::2._Math._Reasoning,_Proofs,_and_a_First_Approach_to_Logic::6._Some_Proof_Patterns::05._Case_Distinction

Inverse in a group:

  • Addition \(-a\)
  • Multiplication {{c1::\(a^{-1}\)}}.

Back

DELETE ETH::1._Semester::DiskMat::2._Math._Reasoning,_Proofs,_and_a_First_Approach_to_Logic::6._Some_Proof_Patterns::05._Case_Distinction

Inverse in a group:

  • Addition \(-a\)
  • Multiplication {{c1::\(a^{-1}\)}}.
Field-by-field Comparison
Field Before After
Text Describe the three steps of a case distinction proof of statement \(S\). <p>Inverse in a group:</p><ul><li><b>Addition&nbsp;</b>{{c1::\(-a\)}}</li><li><b>Multiplication&nbsp;</b>{{c1::\(a^{-1}\)}}.</li></ul>
Extra 1. Find a finite list \(R_1, \ldots, R_k\) of mathematical statements (the cases)<br>2. Prove that at least one of \(R_i\) is true (at least one case occurs)<br>3. Prove that \(R_i \Rightarrow S\) for \(i = 1, \ldots, k\)
Tags: PlsFix::ClozeThatBish ETH::1._Semester::DiskMat::2._Math._Reasoning,_Proofs,_and_a_First_Approach_to_Logic::6._Some_Proof_Patterns::05._Case_Distinction DELETE

Note 6: ETH::DiskMat

Deck: ETH::DiskMat
Note Type: Horvath Classic
GUID: e#X:3>sc!d
modified

Before

Front

ETH::1._Semester::DiskMat::3._Sets,_Relations,_and_Functions::5._Partial_Order_Relations::5._Meet,_Join,_and_Lattices REWORK
What are the meet and join of elements \(a\) and \(b\) in a poset?

Back

ETH::1._Semester::DiskMat::3._Sets,_Relations,_and_Functions::5._Partial_Order_Relations::5._Meet,_Join,_and_Lattices REWORK
What are the meet and join of elements \(a\) and \(b\) in a poset?


  • Meet (\(a \land b\)): The greatest lower bound of \(\{a, b\}\)

  • Join (\(a \lor b\)): The least upper bound of \(\{a, b\}\)

After

Front

ETH::1._Semester::DiskMat::3._Sets,_Relations,_and_Functions::5._Partial_Order_Relations::5._Meet,_Join,_and_Lattices
What is the meet of elements \(a\) and \(b\) in a poset?

Back

ETH::1._Semester::DiskMat::3._Sets,_Relations,_and_Functions::5._Partial_Order_Relations::5._Meet,_Join,_and_Lattices
What is the meet of elements \(a\) and \(b\) in a poset?

Meet (\(a \land b\)): The greatest lower bound of \(\{a, b\}\).
Field-by-field Comparison
Field Before After
Front What are the meet and join of elements \(a\) and \(b\) in a poset? What is the meet of elements \(a\) and \(b\) in a poset?
Back <ul><br><li><strong>Meet</strong> (\(a \land b\)): The greatest lower bound of \(\{a, b\}\)</li><br><li><strong>Join</strong> (\(a \lor b\)): The least upper bound of \(\{a, b\}\)</li><br></ul> <div><strong>Meet</strong> (\(a \land b\)): The greatest lower bound of \(\{a, b\}\).</div>
Tags: REWORK ETH::1._Semester::DiskMat::3._Sets,_Relations,_and_Functions::5._Partial_Order_Relations::5._Meet,_Join,_and_Lattices

Note 7: ETH::DiskMat

Deck: ETH::DiskMat
Note Type: Horvath Cloze
GUID: yF7brLJQxE
modified

Before

Front

ETH::1._Semester::DiskMat::3._Sets,_Relations,_and_Functions::5._Partial_Order_Relations::4._Special_Elements_in_Posets REWORK
Special elements in posets: \((A; \preceq)\) is a poset, \( S \subseteq A\).
\(a \in A\) is the greatest lower (least upper) bound of \(S\) if \(a\) is the greatest (least) element of the set of all lower (upper) bounds of \(S\).

Back

ETH::1._Semester::DiskMat::3._Sets,_Relations,_and_Functions::5._Partial_Order_Relations::4._Special_Elements_in_Posets REWORK
Special elements in posets: \((A; \preceq)\) is a poset, \( S \subseteq A\).
\(a \in A\) is the greatest lower (least upper) bound of \(S\) if \(a\) is the greatest (least) element of the set of all lower (upper) bounds of \(S\).

After

Front

ETH::1._Semester::DiskMat::3._Sets,_Relations,_and_Functions::5._Partial_Order_Relations::4._Special_Elements_in_Posets
Special elements in posets: \((A; \preceq)\) is a poset, \( S \subseteq A\).
\(a \in A\) is the greatest lower (least upper) bound of \(S\) if \(a\) is the greatest (least) element of the set of all lower (upper) bounds of \(S\).

Back

ETH::1._Semester::DiskMat::3._Sets,_Relations,_and_Functions::5._Partial_Order_Relations::4._Special_Elements_in_Posets
Special elements in posets: \((A; \preceq)\) is a poset, \( S \subseteq A\).
\(a \in A\) is the greatest lower (least upper) bound of \(S\) if \(a\) is the greatest (least) element of the set of all lower (upper) bounds of \(S\).

Note that greatest (least) refers to the operation \(\preceq\) and not to order by \(>\) or \(<\) (smaller, bigger).
Field-by-field Comparison
Field Before After
Extra Note that greatest (least) refers to the operation&nbsp;\(\preceq\)&nbsp;and not to order by&nbsp;\(&gt;\)&nbsp;or&nbsp;\(&lt;\)&nbsp;(smaller, bigger).
Tags: REWORK ETH::1._Semester::DiskMat::3._Sets,_Relations,_and_Functions::5._Partial_Order_Relations::4._Special_Elements_in_Posets

Note 8: ETH::DiskMat

Deck: ETH::DiskMat
Note Type: Horvath Cloze
GUID: h:Z}faoBcQ
modified

Before

Front

ETH::1._Semester::DiskMat::5._Algebra::3._The_Structure_of_Groups::5._Cyclic_Groups
We can reduce the exponent \(a^m\) modulo \(n\) by {{c1::the \(\text{ord}(a)\)}} iff. \(\gcd(a, n) = 1\), i.e. \(a\) and \(n\) are coprime.

Back

ETH::1._Semester::DiskMat::5._Algebra::3._The_Structure_of_Groups::5._Cyclic_Groups
We can reduce the exponent \(a^m\) modulo \(n\) by {{c1::the \(\text{ord}(a)\)}} iff. \(\gcd(a, n) = 1\), i.e. \(a\) and \(n\) are coprime.

After

Front

ETH::1._Semester::DiskMat::5._Algebra::3._The_Structure_of_Groups::5._Cyclic_Groups
We can reduce the exponent \(a^m\) modulo \(n\) by {{c1::the \(\text{ord}(a)\)}} iff. \(\gcd(a, n) = 1\), i.e. \(a\) and \(n\) are coprime.

Back

ETH::1._Semester::DiskMat::5._Algebra::3._The_Structure_of_Groups::5._Cyclic_Groups
We can reduce the exponent \(a^m\) modulo \(n\) by {{c1::the \(\text{ord}(a)\)}} iff. \(\gcd(a, n) = 1\), i.e. \(a\) and \(n\) are coprime.

This is because if \(\gcd(a, n) = 1\) then there exists an \(m\) for which \(a^m = e\).
Field-by-field Comparison
Field Before After
Extra This is because if&nbsp;\(\gcd(a, n) = 1\)&nbsp;then there exists an&nbsp;\(m\)&nbsp;for which&nbsp;\(a^m = e\).
Tags: ETH::1._Semester::DiskMat::5._Algebra::3._The_Structure_of_Groups::5._Cyclic_Groups

Note 9: ETH::DiskMat

Deck: ETH::DiskMat
Note Type: Horvath Cloze
GUID: lx/&=nJI{d
modified

Before

Front

ETH::1._Semester::DiskMat::5._Algebra::2._Monoids_and_Groups::3._Inverses_and_Groups REWORK

The inverse in a group with addition is denoted \(-a\), and the inverse in a group with multiplication is denoted {{c2::\(a^{-1}\)}}.


If the operation is addition, the neutral element is usually denoted \(0\). If the operation is multiplication, the neutral element is denoted \(1\).

Back

ETH::1._Semester::DiskMat::5._Algebra::2._Monoids_and_Groups::3._Inverses_and_Groups REWORK

The inverse in a group with addition is denoted \(-a\), and the inverse in a group with multiplication is denoted {{c2::\(a^{-1}\)}}.


If the operation is addition, the neutral element is usually denoted \(0\). If the operation is multiplication, the neutral element is denoted \(1\).

After

Front

ETH::1._Semester::DiskMat::5._Algebra::2._Monoids_and_Groups::3._Inverses_and_Groups

Neutral Element of a group:

  • Addition \(0\)
  • Multiplication \(1\).

Back

ETH::1._Semester::DiskMat::5._Algebra::2._Monoids_and_Groups::3._Inverses_and_Groups

Neutral Element of a group:

  • Addition \(0\)
  • Multiplication \(1\).
Field-by-field Comparison
Field Before After
Text <p>The inverse in a group with addition is denoted {{c1::\(-a\)}}, and the inverse in a group with multiplication is denoted {{c2::\(a^{-1}\)}}.</p><br><p>If the operation is addition, the neutral element is usually denoted {{c3::\(0\)}}. If the operation is multiplication, the neutral element is denoted {{c4::\(1\)}}.</p> <p>Neutral Element of a group:</p><ul><li><b>Addition</b>&nbsp;{{c1::\(0\)}}.&nbsp;</li><li><b>Multiplication</b>&nbsp;{{c2::\(1\)}}.</li></ul>
Tags: REWORK ETH::1._Semester::DiskMat::5._Algebra::2._Monoids_and_Groups::3._Inverses_and_Groups

Note 10: ETH::DiskMat

Deck: ETH::DiskMat
Note Type: Horvath Cloze
GUID: MUE8!)s%
modified

Before

Front

ETH::1._Semester::DiskMat::5._Algebra::3._The_Structure_of_Groups::2._Group_Homomorphisms REWORK

Lemma 5.5(ii): A group homomorphism \(\psi: G \rightarrow H\) maps inverses to {{c1::inverses: \(\psi(\widehat{a}) = \widetilde{\psi(a)}\)}} for all \(a\).

Back

ETH::1._Semester::DiskMat::5._Algebra::3._The_Structure_of_Groups::2._Group_Homomorphisms REWORK

Lemma 5.5(ii): A group homomorphism \(\psi: G \rightarrow H\) maps inverses to {{c1::inverses: \(\psi(\widehat{a}) = \widetilde{\psi(a)}\)}} for all \(a\).

After

Front

ETH::1._Semester::DiskMat::5._Algebra::3._The_Structure_of_Groups::2._Group_Homomorphisms

Lemma 5.5(ii): A group homomorphism \(\psi: G \rightarrow H\) maps {{c1::inverses to inverses: \(\psi(\widehat{a}) = \widetilde{\psi(a)}\)}} for all \(a\).

Back

ETH::1._Semester::DiskMat::5._Algebra::3._The_Structure_of_Groups::2._Group_Homomorphisms

Lemma 5.5(ii): A group homomorphism \(\psi: G \rightarrow H\) maps {{c1::inverses to inverses: \(\psi(\widehat{a}) = \widetilde{\psi(a)}\)}} for all \(a\).

Field-by-field Comparison
Field Before After
Text <p><strong>Lemma 5.5(ii)</strong>: A group homomorphism \(\psi: G \rightarrow H\) maps inverses to {{c1::inverses: \(\psi(\widehat{a}) = \widetilde{\psi(a)}\)}} for all \(a\).</p> <p><strong>Lemma 5.5(ii)</strong>: A group homomorphism \(\psi: G \rightarrow H\) maps {{c1::inverses to inverses: \(\psi(\widehat{a}) = \widetilde{\psi(a)}\)}} for all \(a\).</p>
Tags: REWORK ETH::1._Semester::DiskMat::5._Algebra::3._The_Structure_of_Groups::2._Group_Homomorphisms

Note 11: ETH::DiskMat

Deck: ETH::DiskMat
Note Type: Horvath Cloze
GUID: hx=y:u%$sF
modified

Before

Front

ETH::1._Semester::DiskMat::5._Algebra::3._The_Structure_of_Groups::5._Cyclic_Groups marked

By what can we reduce the exponent of an element in a finite order Group?

Back

ETH::1._Semester::DiskMat::5._Algebra::3._The_Structure_of_Groups::5._Cyclic_Groups marked

By what can we reduce the exponent of an element in a finite order Group?


In a group \(G\) of finite order, for \(a \in G\): \[a^m = a^{R_{\text{ord}(a)}(m)}\]

This holds because:

 \(a^m = a^{m + \text{ord}(a)} = a^m \cdot a^{\text{ord}(a)} = a^m \cdot e = a^m\).

After

Front

ETH::1._Semester::DiskMat::5._Algebra::3._The_Structure_of_Groups::5._Cyclic_Groups

By what can we reduce the exponent of an element in a finite order Group?

Back

ETH::1._Semester::DiskMat::5._Algebra::3._The_Structure_of_Groups::5._Cyclic_Groups

By what can we reduce the exponent of an element in a finite order Group?


In a group \(G\) of finite order, for \(a \in G\): \[a^m = a^{R_{\text{ord}(a)}(m)}\]This holds because:

 \(a^m = a^{m + \text{ord}(a)}\)

\( = a^m \cdot a^{\text{ord}(a)}\)

\( = a^m \cdot e = a^m\)

Field-by-field Comparison
Field Before After
Extra <p>In a group \(G\) of finite order, for \(a \in G\): \[a^m = a^{R_{\text{ord}(a)}(m)}\]<br></p> <p>This holds because:</p><p>&nbsp;\(a^m = a^{m + \text{ord}(a)} = a^m \cdot a^{\text{ord}(a)} = a^m \cdot e = a^m\).</p> <p>In a group \(G\) of finite order, for \(a \in G\): \[a^m = a^{R_{\text{ord}(a)}(m)}\]This holds because:</p><p>&nbsp;\(a^m = a^{m + \text{ord}(a)}\)</p><p>\( = a^m \cdot a^{\text{ord}(a)}\)</p><p>\( = a^m \cdot e = a^m\)</p>
Tags: marked ETH::1._Semester::DiskMat::5._Algebra::3._The_Structure_of_Groups::5._Cyclic_Groups

Note 12: ETH::DiskMat

Deck: ETH::DiskMat
Note Type: Horvath Cloze
GUID: EDPL:,`:xZ
modified

Before

Front

ETH::1._Semester::DiskMat::5._Algebra::3._The_Structure_of_Groups::5._Cyclic_Groups

The group {{c2:: \(\langle \mathbb{Z}_n; \oplus \rangle\)}} is generated by \(1\).

Back

ETH::1._Semester::DiskMat::5._Algebra::3._The_Structure_of_Groups::5._Cyclic_Groups

The group {{c2:: \(\langle \mathbb{Z}_n; \oplus \rangle\)}} is generated by \(1\).

After

Front

ETH::1._Semester::DiskMat::5._Algebra::3._The_Structure_of_Groups::5._Cyclic_Groups

The group\(\langle \mathbb{Z}; +, -, 0 \rangle\) is generated by  \(1, -1\).

Back

ETH::1._Semester::DiskMat::5._Algebra::3._The_Structure_of_Groups::5._Cyclic_Groups

The group\(\langle \mathbb{Z}; +, -, 0 \rangle\) is generated by  \(1, -1\).

Field-by-field Comparison
Field Before After
Text <p>The group {{c2:: \(\langle \mathbb{Z}_n; \oplus \rangle\)}} is generated by {{c1:: \(1\)}}.</p> <p>The group\(\langle \mathbb{Z}; +, -, 0 \rangle\)&nbsp;is generated by {{c1::&nbsp;\(1, -1\)}}.</p>
Tags: ETH::1._Semester::DiskMat::5._Algebra::3._The_Structure_of_Groups::5._Cyclic_Groups

Note 13: ETH::DiskMat

Deck: ETH::DiskMat
Note Type: Horvath Cloze
GUID: k3`On,s-[c
modified

Before

Front

ETH::1._Semester::DiskMat::5._Algebra::3._The_Structure_of_Groups::5._Cyclic_Groups

The generators of \(\langle \mathbb{Z}_n; \oplus \rangle\) are all \(g \in \mathbb{Z}_n\) for which \(\gcd(g, n) = 1\) (i.e., \(g\) is coprime to \(n\)).

The group \(\langle \mathbb{Z}_n; \oplus \rangle\) is cyclic for every \(n\), where \(1\) is always a generator.

Back

ETH::1._Semester::DiskMat::5._Algebra::3._The_Structure_of_Groups::5._Cyclic_Groups

The generators of \(\langle \mathbb{Z}_n; \oplus \rangle\) are all \(g \in \mathbb{Z}_n\) for which \(\gcd(g, n) = 1\) (i.e., \(g\) is coprime to \(n\)).

The group \(\langle \mathbb{Z}_n; \oplus \rangle\) is cyclic for every \(n\), where \(1\) is always a generator.

After

Front

ETH::1._Semester::DiskMat::5._Algebra::3._The_Structure_of_Groups::5._Cyclic_Groups

The generators of \(\langle \mathbb{Z}_n; \oplus \rangle\) are all \(g \in \mathbb{Z}_n\) for which \(\gcd(g, n) = 1\)(i.e., \(g\) is coprime to \(n\)).

Back

ETH::1._Semester::DiskMat::5._Algebra::3._The_Structure_of_Groups::5._Cyclic_Groups

The generators of \(\langle \mathbb{Z}_n; \oplus \rangle\) are all \(g \in \mathbb{Z}_n\) for which \(\gcd(g, n) = 1\)(i.e., \(g\) is coprime to \(n\)).

Field-by-field Comparison
Field Before After
Text <p>The generators of \(\langle \mathbb{Z}_n; \oplus \rangle\) are all \(g \in \mathbb{Z}_n\) for which {{c1::\(\gcd(g, n) = 1\)}} (i.e., \(g\) is {{c2::coprime}} to \(n\)).</p> <p>The group \(\langle \mathbb{Z}_n; \oplus \rangle\) is cyclic for every \(n\), where {{c3::\(1\)}} is always a generator.</p> <p>The generators of \(\langle \mathbb{Z}_n; \oplus \rangle\) are all \(g \in \mathbb{Z}_n\) for which {{c1::\(\gcd(g, n) = 1\)(i.e., \(g\) is coprime to \(n\))}}.</p>
Tags: ETH::1._Semester::DiskMat::5._Algebra::3._The_Structure_of_Groups::5._Cyclic_Groups

Note 14: ETH::DiskMat

Deck: ETH::DiskMat
Note Type: Horvath Classic
GUID: AR?8CyMux0
modified

Before

Front

ETH::1._Semester::DiskMat::5._Algebra::5._Rings_and_Fields::5._Polynomial_Rings PlsFix::NiklasWTHman

Front

What is a polynomial over a commutative ring?

Back

A polynomial \(a(x)\) over a commutative ring \(R\) in the indeterminate \(x\) is a formal expression of the form: \[ a(x) = {{c2::a_d x^d + a_{d-1}x^{d-1} + \cdots + a_1 x + a_0}} = \sum_{i=0}^d a_i x^i \] for some non-negative integer \(d\), with \(a_i \in R\).

The set of polynomials in \(x\) over \(R\) is denoted .

Back

ETH::1._Semester::DiskMat::5._Algebra::5._Rings_and_Fields::5._Polynomial_Rings PlsFix::NiklasWTHman

Front

What is a polynomial over a commutative ring?

Back

A polynomial \(a(x)\) over a commutative ring \(R\) in the indeterminate \(x\) is a formal expression of the form: \[ a(x) = {{c2::a_d x^d + a_{d-1}x^{d-1} + \cdots + a_1 x + a_0}} = \sum_{i=0}^d a_i x^i \] for some non-negative integer \(d\), with \(a_i \in R\).

The set of polynomials in \(x\) over \(R\) is denoted .


After

Front

ETH::1._Semester::DiskMat::5._Algebra::5._Rings_and_Fields::5._Polynomial_Rings

What is a polynomial over a commutative ring?

Back

ETH::1._Semester::DiskMat::5._Algebra::5._Rings_and_Fields::5._Polynomial_Rings

What is a polynomial over a commutative ring?


A polynomial \(a(x)\) over a commutative ring \(R\) in the indeterminate \(x\) is a formal expression of the form: \[ a(x) = {{c2::a_d x^d + a_{d-1}x^{d-1} + \cdots + a_1 x + a_0}} = \sum_{i=0}^d a_i x^i \] for some non-negative integer \(d\), with \(a_i \in R\).

The set of polynomials in \(x\) over \(R\) is denoted \(R[x]\).


Field-by-field Comparison
Field Before After
Front <h1>Front</h1> <p>What is a polynomial over a commutative ring?</p> <h1>Back</h1> <p>A polynomial \(a(x)\) over a commutative ring \(R\) in the indeterminate \(x\) is a formal expression of the form: \[ a(x) = {{c2::a_d x^d + a_{d-1}x^{d-1} + \cdots + a_1 x + a_0}} = \sum_{i=0}^d a_i x^i \] for some non-negative integer \(d\), with \(a_i \in R\).</p> <p>The set of polynomials in \(x\) over \(R\) is denoted {{c4::\(R[x]\)}}.</p> <p>What is a polynomial over a commutative ring?</p>
Back <p>A polynomial \(a(x)\) over a commutative ring \(R\) in the indeterminate \(x\) is a formal expression of the form: \[ a(x) = {{c2::a_d x^d + a_{d-1}x^{d-1} + \cdots + a_1 x + a_0}} = \sum_{i=0}^d a_i x^i \] for some non-negative integer \(d\), with \(a_i \in R\).</p> <p>The set of polynomials in \(x\) over \(R\) is denoted&nbsp;\(R[x]\).</p><p><br></p>
Tags: PlsFix::NiklasWTHman ETH::1._Semester::DiskMat::5._Algebra::5._Rings_and_Fields::5._Polynomial_Rings

Note 15: ETH::DiskMat

Deck: ETH::DiskMat
Note Type: Horvath Classic
GUID: lq:b}[Y<9t
modified

Before

Front

ETH::1._Semester::DiskMat::5._Algebra::7._Polynomials_as_Functions::3._Polynomial_Interpolation PlsFix::NiklasWTHman

Front

Lagrange Interpolation for polynomials in a Field

Back

Let \(\beta_i = a(\alpha_i)\) for \(i = 1, \dots, d+1\).

Then \(a(x)\) is given by Lagrange's Interpolation formula: \[a(x) = \sum_{i=1}^{d+1} \beta_i u_i(x)\] where the polynomial \(u_i(x)\) is: \[u_i(x) = \frac{{{c2::(x - \alpha_1) \cdots (x - \alpha_{i-1})(x - \alpha_{i+1}) \cdots (x - \alpha_{d+1})}}}{{{c3::(\alpha_i - \alpha_1) \cdots (\alpha_i - \alpha_{i-1})(\alpha_i - \alpha_{i+1}) \cdots (\alpha_i - \alpha_{d+1})}}}\]

Note that for \(u_i(x)\) to be well-defined, all constant terms \(\alpha_i - \alpha_j\) in the denominator must be invertible. This is guaranteed in a field since \(a_i - a_j \neq 0\) for \(i \neq j\) (as they are all distinct).

Back

ETH::1._Semester::DiskMat::5._Algebra::7._Polynomials_as_Functions::3._Polynomial_Interpolation PlsFix::NiklasWTHman

Front

Lagrange Interpolation for polynomials in a Field

Back

Let \(\beta_i = a(\alpha_i)\) for \(i = 1, \dots, d+1\).

Then \(a(x)\) is given by Lagrange's Interpolation formula: \[a(x) = \sum_{i=1}^{d+1} \beta_i u_i(x)\] where the polynomial \(u_i(x)\) is: \[u_i(x) = \frac{{{c2::(x - \alpha_1) \cdots (x - \alpha_{i-1})(x - \alpha_{i+1}) \cdots (x - \alpha_{d+1})}}}{{{c3::(\alpha_i - \alpha_1) \cdots (\alpha_i - \alpha_{i-1})(\alpha_i - \alpha_{i+1}) \cdots (\alpha_i - \alpha_{d+1})}}}\]

Note that for \(u_i(x)\) to be well-defined, all constant terms \(\alpha_i - \alpha_j\) in the denominator must be invertible. This is guaranteed in a field since \(a_i - a_j \neq 0\) for \(i \neq j\) (as they are all distinct).


After

Front

ETH::1._Semester::DiskMat::5._Algebra::7._Polynomials_as_Functions::3._Polynomial_Interpolation

Lagrange Interpolation for polynomials in a Field

Back

ETH::1._Semester::DiskMat::5._Algebra::7._Polynomials_as_Functions::3._Polynomial_Interpolation

Lagrange Interpolation for polynomials in a Field


Let \(\beta_i = a(\alpha_i)\) for \(i = 1, \dots, d+1\).

Then \(a(x)\) is given by Lagrange's Interpolation formula: \[a(x) = \sum_{i=1}^{d+1} \beta_i u_i(x)\] where the polynomial \(u_i(x)\) is: \[u_i(x) = \frac{{{c2::(x - \alpha_1) \cdots (x - \alpha_{i-1})(x - \alpha_{i+1}) \cdots (x - \alpha_{d+1})}}}{{{c3::(\alpha_i - \alpha_1) \cdots (\alpha_i - \alpha_{i-1})(\alpha_i - \alpha_{i+1}) \cdots (\alpha_i - \alpha_{d+1})}}}\]

Note that for \(u_i(x)\) to be well-defined, all constant terms \(\alpha_i - \alpha_j\) in the denominator must be invertible. This is guaranteed in a field since \(a_i - a_j \neq 0\) for \(i \neq j\) (as they are all distinct).

Field-by-field Comparison
Field Before After
Front <h1>Front</h1> <p>Lagrange Interpolation for polynomials in a Field</p> <h1>Back</h1> <p>Let \(\beta_i = a(\alpha_i)\) for \(i = 1, \dots, d+1\).</p> <p>Then \(a(x)\) is given by Lagrange's Interpolation formula: \[a(x) = \sum_{i=1}^{d+1} \beta_i u_i(x)\] where the polynomial \(u_i(x)\) is: \[u_i(x) = \frac{{{c2::(x - \alpha_1) \cdots (x - \alpha_{i-1})(x - \alpha_{i+1}) \cdots (x - \alpha_{d+1})}}}{{{c3::(\alpha_i - \alpha_1) \cdots (\alpha_i - \alpha_{i-1})(\alpha_i - \alpha_{i+1}) \cdots (\alpha_i - \alpha_{d+1})}}}\]</p> <p>Note that for \(u_i(x)\) to be well-defined, all constant terms \(\alpha_i - \alpha_j\) in the denominator must be invertible. This is guaranteed in a field since \(a_i - a_j \neq 0\) for \(i \neq j\) (as they are all distinct).</p> <p>Lagrange Interpolation for polynomials in a Field</p>
Back <p>Let \(\beta_i = a(\alpha_i)\) for \(i = 1, \dots, d+1\).</p> <p>Then \(a(x)\) is given by Lagrange's Interpolation formula: \[a(x) = \sum_{i=1}^{d+1} \beta_i u_i(x)\] where the polynomial \(u_i(x)\) is: \[u_i(x) = \frac{{{c2::(x - \alpha_1) \cdots (x - \alpha_{i-1})(x - \alpha_{i+1}) \cdots (x - \alpha_{d+1})}}}{{{c3::(\alpha_i - \alpha_1) \cdots (\alpha_i - \alpha_{i-1})(\alpha_i - \alpha_{i+1}) \cdots (\alpha_i - \alpha_{d+1})}}}\]</p> <p>Note that for \(u_i(x)\) to be well-defined, all constant terms \(\alpha_i - \alpha_j\) in the denominator must be invertible. This is guaranteed in a field since \(a_i - a_j \neq 0\) for \(i \neq j\) (as they are all distinct).</p>
Tags: PlsFix::NiklasWTHman ETH::1._Semester::DiskMat::5._Algebra::7._Polynomials_as_Functions::3._Polynomial_Interpolation

Note 16: ETH::DiskMat

Deck: ETH::DiskMat
Note Type: Horvath Cloze
GUID: vKeo,n,kS
added

Previous

Note did not exist

New Note

Front

ETH::1._Semester::DiskMat::5._Algebra::3._The_Structure_of_Groups::5._Cyclic_Groups
The group \(\langle \mathbb{Z}_n; \oplus \rangle\) is cyclic for every \(n\), where  1 is always a generator.

Back

ETH::1._Semester::DiskMat::5._Algebra::3._The_Structure_of_Groups::5._Cyclic_Groups
The group \(\langle \mathbb{Z}_n; \oplus \rangle\) is cyclic for every \(n\), where  1 is always a generator.
Field-by-field Comparison
Field Before After
Text The group&nbsp;\(\langle \mathbb{Z}_n; \oplus \rangle\)&nbsp;is {{c2::cyclic for every&nbsp;\(n\)}}, where {{c3:: 1}} is always a generator.
Tags: ETH::1._Semester::DiskMat::5._Algebra::3._The_Structure_of_Groups::5._Cyclic_Groups

Note 17: ETH::DiskMat

Deck: ETH::DiskMat
Note Type: Horvath Classic
GUID: e=ty%{6vg!
added

Previous

Note did not exist

New Note

Front

ETH::1._Semester::DiskMat::3._Sets,_Relations,_and_Functions::5._Partial_Order_Relations::5._Meet,_Join,_and_Lattices
What is the join of elements \(a\) and \(b\) in a poset?

Back

ETH::1._Semester::DiskMat::3._Sets,_Relations,_and_Functions::5._Partial_Order_Relations::5._Meet,_Join,_and_Lattices
What is the join of elements \(a\) and \(b\) in a poset?

Join (\(a \lor b\)): The least upper bound of \(\{a, b\}\)
Field-by-field Comparison
Field Before After
Front What is the join of elements \(a\) and \(b\) in a poset?
Back <strong>Join</strong> (\(a \lor b\)): The least upper bound of \(\{a, b\}\)
Tags: ETH::1._Semester::DiskMat::3._Sets,_Relations,_and_Functions::5._Partial_Order_Relations::5._Meet,_Join,_and_Lattices

Note 18: ETH::DiskMat

Deck: ETH::DiskMat
Note Type: Horvath Cloze
GUID: ztTfjE7<>>
added

Previous

Note did not exist

New Note

Front

ETH::1._Semester::DiskMat::5._Algebra::2._Monoids_and_Groups::3._Inverses_and_Groups

Inverse in a group:

  • Addition \(-a\)
  • Multiplication {{c2::\(a^{-1}\)}}.

Back

ETH::1._Semester::DiskMat::5._Algebra::2._Monoids_and_Groups::3._Inverses_and_Groups

Inverse in a group:

  • Addition \(-a\)
  • Multiplication {{c2::\(a^{-1}\)}}.
Field-by-field Comparison
Field Before After
Text <p>Inverse in a group:</p><ul><li><b>Addition&nbsp;</b>{{c1::\(-a\)}}</li><li><b>Multiplication&nbsp;</b>{{c2::\(a^{-1}\)}}.</li></ul>
Tags: ETH::1._Semester::DiskMat::5._Algebra::2._Monoids_and_Groups::3._Inverses_and_Groups
↑ Top