<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>~iany/ Linear Algebra</title><link>https://blog.iany.me/tags/linear-algebra/</link><description>Recent content in Linear Algebra «~iany/»</description><language>en-US</language><managingEditor>me@iany.me (Ian Yang)</managingEditor><webMaster>me@iany.me (Ian Yang)</webMaster><copyright>CC-BY-SA 4.0</copyright><lastBuildDate>Tue, 18 Nov 2025 21:23:25 +0800</lastBuildDate><atom:link href="https://blog.iany.me/tags/linear-algebra/index.xml" rel="self" type="application/rss+xml"/><item><title>Study on Quotient Spaces</title><link>https://blog.iany.me/2025/11/study-on-quotient-spaces/</link><pubDate>Tue, 18 Nov 2025 21:23:25 +0800</pubDate><author>me@iany.me (Ian Yang)</author><guid>https://blog.iany.me/2025/11/study-on-quotient-spaces/</guid><description>&lt;p&gt;I&amp;rsquo;m reading &lt;em&gt;Linear Algebra Done Right&lt;/em&gt; by Axler and found the section on quotient spaces difficult to understand, so I researched and took these notes.&lt;/p&gt;
&lt;h2 id="definitions"&gt;Definitions&lt;/h2&gt;
&lt;details open disabled class="kg-card kg-callout kg-callout-definition" data-callout-type="definition"&gt;
&lt;summary class="kg-callout-title" tabindex="-1"&gt;
&lt;i aria-hidden="true" class="kg-callout-type fas fa-book"&gt;&lt;/i&gt;
3.95 notion: $v + U$
&lt;/summary&gt;
&lt;div class="kg-callout-content"&gt;
&lt;p&gt;Suppose &lt;code&gt;$v \in V$&lt;/code&gt; and &lt;code&gt;$U \subseteq V$&lt;/code&gt;. Then &lt;code&gt;$v + U$&lt;/code&gt; is the subset of &lt;code&gt;$V$&lt;/code&gt; defined by&lt;/p&gt;
&lt;pre&gt;&lt;code class="language-katex"&gt;\[v + U = \{v + u : u \in U\}.\]
&lt;/code&gt;&lt;/pre&gt;
&lt;/div&gt;
&lt;/details&gt;
&lt;p&gt;Also called a translate. &lt;strong&gt;Attention&lt;/strong&gt; that a translate is a set.&lt;/p&gt;
&lt;details open disabled class="kg-card kg-callout kg-callout-definition" data-callout-type="definition"&gt;
&lt;summary class="kg-callout-title" tabindex="-1"&gt;
&lt;i aria-hidden="true" class="kg-callout-type fas fa-book"&gt;&lt;/i&gt;
3.97 definition: &lt;em&gt;translate&lt;/em&gt;
&lt;/summary&gt;
&lt;div class="kg-callout-content"&gt;
Suppose &lt;code&gt;$v \in V$&lt;/code&gt; and &lt;code&gt;$U \subseteq V$&lt;/code&gt;, the set &lt;code&gt;$v + U$&lt;/code&gt; is said to be a &lt;em&gt;translate&lt;/em&gt; of &lt;code&gt;$U$&lt;/code&gt;.
&lt;/div&gt;
&lt;/details&gt;
&lt;p&gt;Quotient space is a set of all translates (set of sets):&lt;/p&gt;
&lt;details open disabled class="kg-card kg-callout kg-callout-definition" data-callout-type="definition"&gt;
&lt;summary class="kg-callout-title" tabindex="-1"&gt;
&lt;i aria-hidden="true" class="kg-callout-type fas fa-book"&gt;&lt;/i&gt;
3.99 definition: &lt;em&gt;quotient space&lt;/em&gt;, $V/U$
&lt;/summary&gt;
&lt;div class="kg-callout-content"&gt;
&lt;p&gt;Suppose &lt;code&gt;$U$&lt;/code&gt; is a subspace of &lt;code&gt;$V$&lt;/code&gt;. Then the &lt;em&gt;quotient space&lt;/em&gt; &lt;code&gt;$V/U$&lt;/code&gt; is the set of all translates of &lt;code&gt;$U$&lt;/code&gt;. Thus&lt;/p&gt;
&lt;pre&gt;&lt;code class="language-katex"&gt;\[V/U = \{v + U : v \in V\}.\]
&lt;/code&gt;&lt;/pre&gt;
&lt;/div&gt;
&lt;/details&gt;
&lt;p&gt;Quotient space is a set of sets. There are duplicates for each &lt;code&gt;$v \in V$&lt;/code&gt; because for some &lt;code&gt;$v_1, v_2 \in V$&lt;/code&gt;, &lt;code&gt;$v_1 + U$&lt;/code&gt; and &lt;code&gt;$v_2 + U$&lt;/code&gt; can be identical set.&lt;/p&gt;
&lt;p&gt;A quotient space &lt;code&gt;$V/U$&lt;/code&gt; is formed by &amp;ldquo;collapsing&amp;rdquo; a subspace &lt;code&gt;$U$&lt;/code&gt; to zero within a larger vector space &lt;code&gt;$V$&lt;/code&gt;. This construction is based on an equivalence relation where two vectors &lt;code&gt;$x, y \in V$&lt;/code&gt; are considered equivalent if their difference lies in &lt;code&gt;$U$&lt;/code&gt;—that is, &lt;code&gt;$x \sim y$&lt;/code&gt; if and only if &lt;code&gt;$x - y \in U$&lt;/code&gt;. &lt;a href="https://en.wikipedia.org/wiki/Quotient_space_%28linear_algebra%29"&gt;wikipedia&lt;/a&gt;&lt;/p&gt;
&lt;h2 id="lemmas"&gt;Lemmas&lt;/h2&gt;
&lt;details open disabled class="kg-card kg-callout kg-callout-definition" data-callout-type="definition"&gt;
&lt;summary class="kg-callout-title" tabindex="-1"&gt;
&lt;i aria-hidden="true" class="kg-callout-type fas fa-book"&gt;&lt;/i&gt;
3.101 &lt;em&gt;two translates of a subspace are equal or disjoint&lt;/em&gt;
&lt;/summary&gt;
&lt;div class="kg-callout-content"&gt;
&lt;p&gt;Suppose &lt;code&gt;$U$&lt;/code&gt; is a subspace of &lt;code&gt;$V$&lt;/code&gt; and &lt;code&gt;$v, w \in V$&lt;/code&gt;. Then&lt;/p&gt;
&lt;pre&gt;&lt;code class="language-katex"&gt;\[
v - w \in U \iff v + U = w + U \iff (v + U) \cap (w + U) \neq \emptyset
\]
&lt;/code&gt;&lt;/pre&gt;
&lt;/div&gt;
&lt;/details&gt;
&lt;p&gt;If two translates are not disjoint (the union set is not empty), they must be equal. So they are equal or disjoint.&lt;/p&gt;
&lt;p&gt;All distinct translates of a subspace are disjoint. Given any &lt;code&gt;$v \in V$&lt;/code&gt;, it belongs to only one translate.&lt;/p&gt;
&lt;p&gt;Since the quotient space &lt;code&gt;$V/U$&lt;/code&gt; is a set of translates of a subspace, it is like a disjoint partition of values in &lt;code&gt;$V$&lt;/code&gt;. By using the definition of quotient map&lt;/p&gt;
&lt;details open disabled class="kg-card kg-callout kg-callout-definition" data-callout-type="definition"&gt;
&lt;summary class="kg-callout-title" tabindex="-1"&gt;
&lt;i aria-hidden="true" class="kg-callout-type fas fa-book"&gt;&lt;/i&gt;
3.104 definition: &lt;em&gt;quotient map&lt;/em&gt;, $\pi$
&lt;/summary&gt;
&lt;div class="kg-callout-content"&gt;
&lt;p&gt;Suppose &lt;code&gt;$U$&lt;/code&gt; is a subspace of &lt;code&gt;$V$&lt;/code&gt;. The &lt;em&gt;quotient map&lt;/em&gt; &lt;code&gt;$\pi : V \to V/U$&lt;/code&gt; is the linear map defined by&lt;/p&gt;
&lt;pre&gt;&lt;code class="language-katex"&gt;\[\pi(v) = v + U\]
&lt;/code&gt;&lt;/pre&gt;
&lt;p&gt;for each &lt;code&gt;$v \in V$&lt;/code&gt;.&lt;/p&gt;
&lt;/div&gt;
&lt;/details&gt;
&lt;p&gt;We can write that&lt;/p&gt;
&lt;pre&gt;&lt;code class="language-katex"&gt;\[
\pi(v_1) = \pi(v_2) \iff v_1 - v_2 \in U
\]
&lt;/code&gt;&lt;/pre&gt;
&lt;p&gt;The quotient map has two essential properties:&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;The &lt;strong&gt;null space&lt;/strong&gt; of &lt;code&gt;$\pi$&lt;/code&gt; is exactly the subspace &lt;code&gt;$U$&lt;/code&gt;, because &lt;code&gt;$v+U=0+U \iff v-0 \in U \iff v \in U$&lt;/code&gt;&lt;/li&gt;
&lt;li&gt;The &lt;strong&gt;range&lt;/strong&gt; of &lt;code&gt;$\pi$&lt;/code&gt; is the entire quotient space &lt;code&gt;$V/U$&lt;/code&gt;&lt;/li&gt;
&lt;/ul&gt;
&lt;h2 id="quotient-space-is-a-vector-space"&gt;Quotient Space Is a Vector Space&lt;/h2&gt;
&lt;p&gt;First define the addition and scalar multiplication operations:&lt;/p&gt;
&lt;details open disabled class="kg-card kg-callout kg-callout-definition" data-callout-type="definition"&gt;
&lt;summary class="kg-callout-title" tabindex="-1"&gt;
&lt;i aria-hidden="true" class="kg-callout-type fas fa-book"&gt;&lt;/i&gt;
3.102 definition: &lt;em&gt;addition and scalar multiplication on&lt;/em&gt; $V/U$
&lt;/summary&gt;
&lt;div class="kg-callout-content"&gt;
&lt;p&gt;Suppose &lt;code&gt;$U$&lt;/code&gt; is a subspace of &lt;code&gt;$V$&lt;/code&gt;. Then addition and scalar multiplication are defined on &lt;code&gt;$V/U$&lt;/code&gt; by&lt;/p&gt;
&lt;pre&gt;&lt;code class="language-katex"&gt;\[\begin{align*}
(v + U) + (w + U) &amp;amp;= (v + w) + U \\
\lambda(v + U) &amp;amp;= (\lambda v) + U
\end{align*}\]
&lt;/code&gt;&lt;/pre&gt;
&lt;p&gt;for all &lt;code&gt;$v, w \in V$&lt;/code&gt; and &lt;code&gt;$\lambda \in \mathbf{F}$&lt;/code&gt;.&lt;/p&gt;
&lt;/div&gt;
&lt;/details&gt;
&lt;p&gt;&lt;code&gt;$v+U$&lt;/code&gt; is not the unique way to represent a member in &lt;code&gt;$V/U$&lt;/code&gt;, because there may exist &lt;code&gt;$v'\ne v$&lt;/code&gt; that &lt;code&gt;$u + U = v' + U$&lt;/code&gt;. The operations make sense only when the choice of &lt;code&gt;$v$&lt;/code&gt; to represent a translate makes no differences.&lt;/p&gt;
&lt;p&gt;Specifically, suppose &lt;code&gt;$v_1, v_2, w_1, w_2 \in V$&lt;/code&gt; such that&lt;/p&gt;
&lt;pre&gt;&lt;code class="language-katex"&gt;\[
v_1 + U = v_2 + U \quad\textrm{and}\quad w_1 + U = w_2 + U
\]
&lt;/code&gt;&lt;/pre&gt;
&lt;p&gt;From the addition definition:&lt;/p&gt;
&lt;pre&gt;&lt;code class="language-katex"&gt;\[
\begin{align*}
(v_1+U) + (w_1+U) &amp;amp;= (v_1 + w_1) + U \\
(v_2+U) + (w_2+U) &amp;amp;= (v_2 + w_2) + U
\end{align*}
\]
&lt;/code&gt;&lt;/pre&gt;
&lt;p&gt;The left side of the two equations indeed are the different representation of the same equation, so we must show that the right side equal: &lt;code&gt;$(v_1 + w_1)+U=(v2+w2)+U$&lt;/code&gt;.&lt;/p&gt;
&lt;p&gt;This applies to scalar multiplication as well:&lt;/p&gt;
&lt;pre&gt;&lt;code class="language-katex"&gt;\[
\begin{align*}
\lambda(v_1 + U) &amp;amp;= (\lambda v_1) + U \\
\lambda(v_2 + U) &amp;amp;= (\lambda v_2) + U
\end{align*}
\]
&lt;/code&gt;&lt;/pre&gt;
&lt;p&gt;We must show that &lt;code&gt;$(\lambda v_1) + U = (\lambda v_2) + U$&lt;/code&gt;.&lt;/p&gt;
&lt;h2 id="dimension"&gt;Dimension&lt;/h2&gt;
&lt;p&gt;The dimension of the quotient space is given by a simple subtraction, relating the dimension of &lt;code&gt;$V/U$&lt;/code&gt; to the &amp;ldquo;lost&amp;rdquo; dimension of &lt;code&gt;$U$&lt;/code&gt;:&lt;/p&gt;
&lt;details open disabled class="kg-card kg-callout kg-callout-definition" data-callout-type="definition"&gt;
&lt;summary class="kg-callout-title" tabindex="-1"&gt;
&lt;i aria-hidden="true" class="kg-callout-type fas fa-book"&gt;&lt;/i&gt;
3.105 &lt;em&gt;dimension of quotient space&lt;/em&gt;
&lt;/summary&gt;
&lt;div class="kg-callout-content"&gt;
&lt;p&gt;Suppose &lt;code&gt;$V$&lt;/code&gt; is finite-dimensional and &lt;code&gt;$U$&lt;/code&gt; is a subspace of V. Then&lt;/p&gt;
&lt;pre&gt;&lt;code class="language-katex"&gt;\[\text{dim } V/U = \text{dim }V - \text{dim }U.\]
&lt;/code&gt;&lt;/pre&gt;
&lt;/div&gt;
&lt;/details&gt;
&lt;h2 id="linear-map-from-vnull-t-to-w"&gt;Linear Map from V/(null T) to W&lt;/h2&gt;
&lt;details open disabled class="kg-card kg-callout kg-callout-definition" data-callout-type="definition"&gt;
&lt;summary class="kg-callout-title" tabindex="-1"&gt;
&lt;i aria-hidden="true" class="kg-callout-type fas fa-book"&gt;&lt;/i&gt;
3.106 notation: $\widetilde{T}$
&lt;/summary&gt;
&lt;div class="kg-callout-content"&gt;
&lt;p&gt;Suppose &lt;code&gt;$T \in \mathcal{L}(V, W)$&lt;/code&gt;. Define &lt;code&gt;$\widetilde{T}: V/(\text{null } T) \to W$&lt;/code&gt; by&lt;/p&gt;
&lt;pre&gt;&lt;code class="language-katex"&gt;\[\widetilde{T}(v + \text{null } T) = Tv.\]
&lt;/code&gt;&lt;/pre&gt;
&lt;/div&gt;
&lt;/details&gt;
&lt;p&gt;Think of merging inputs having the same output. These inputs will be the same input in the quotient space &lt;code&gt;$V/(\text{null } T)$&lt;/code&gt;.&lt;/p&gt;
&lt;p&gt;For any &lt;code&gt;$v_1, v_2 \in V$&lt;/code&gt; that &lt;code&gt;$Tv_1 = Tv_2$&lt;/code&gt;, &lt;code&gt;$v_1 + \mathrm{null}\, T$&lt;/code&gt; and &lt;code&gt;$v_2 + \mathrm{null}\, T$&lt;/code&gt; are the same value in &lt;code&gt;$V/(\mathrm{null}\, T)$&lt;/code&gt;. This makes &lt;code&gt;$\widetilde{T}$&lt;/code&gt; injective. Because &lt;code&gt;$\mathrm{range}\,\widetilde{T}=\mathrm{range}\, T$&lt;/code&gt;, &lt;code&gt;$\widetilde{T}$&lt;/code&gt; is also surjective on to &lt;code&gt;$\mathrm{range}\, T$&lt;/code&gt;.&lt;/p&gt;
&lt;details open disabled class="kg-card kg-callout kg-callout-definition" data-callout-type="definition"&gt;
&lt;summary class="kg-callout-title" tabindex="-1"&gt;
&lt;i aria-hidden="true" class="kg-callout-type fas fa-book"&gt;&lt;/i&gt;
3.63 &lt;em&gt;invertibility&lt;/em&gt; $\iff$ &lt;em&gt;injectivity and surjectivity&lt;/em&gt;
&lt;/summary&gt;
&lt;div class="kg-callout-content"&gt;
A linear map is invertible if and only if it is injective and surjective.
&lt;/div&gt;
&lt;/details&gt;
&lt;p&gt;3.63 shows us that &lt;code&gt;$\widetilde{T}$&lt;/code&gt; is invertible, and according to the definition of isomorphic, &lt;code&gt;$V/(\mathrm{null}\, T)$&lt;/code&gt; and &lt;code&gt;$\mathrm{range}\,T$&lt;/code&gt; are isomorphic vector spaces and &lt;code&gt;$\widetilde{T}$&lt;/code&gt; is their isomorphism.&lt;/p&gt;
&lt;details open disabled class="kg-card kg-callout kg-callout-definition" data-callout-type="definition"&gt;
&lt;summary class="kg-callout-title" tabindex="-1"&gt;
&lt;i aria-hidden="true" class="kg-callout-type fas fa-book"&gt;&lt;/i&gt;
3.69 definition: &lt;em&gt;isomorphism, isomorphic&lt;/em&gt;
&lt;/summary&gt;
&lt;div class="kg-callout-content"&gt;
&lt;ul&gt;
&lt;li&gt;An &lt;em&gt;isomorphism&lt;/em&gt; is an invertible linear map.&lt;/li&gt;
&lt;li&gt;Two vector spaces are called isomorphic if there is an isomorphism from one vector space onto the other one.&lt;/li&gt;
&lt;/ul&gt;
&lt;/div&gt;
&lt;/details&gt;
&lt;p&gt;One of the key uses of &lt;code&gt;$\widetilde{T}$&lt;/code&gt; is demonstrating a canonical isomorphism. For any linear map &lt;code&gt;$T \in \mathcal{L}(V, W)$&lt;/code&gt;, the quotient space &lt;code&gt;$V/(\text{null } T)$&lt;/code&gt; is isomorphic to the image space &lt;code&gt;$\text{range } T$&lt;/code&gt;. This shows that the quotient space &lt;code&gt;$V/(\text{null } T)$&lt;/code&gt; serves as a way to &amp;ldquo;mod out&amp;rdquo; the non-injective part of &lt;code&gt;$T$&lt;/code&gt;.&lt;/p&gt;</description><category domain="https://blog.iany.me/post/">Posts</category><category domain="https://blog.iany.me/tags/math/">Math</category><category domain="https://blog.iany.me/tags/linear-algebra/">Linear Algebra</category></item></channel></rss>