<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	
	xmlns:georss="http://www.georss.org/georss"
	xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#"
	>

<channel>
	<title>graph &#8211; Problems in Mathematics</title>
	<atom:link href="https://yutsumura.com/tag/graph/feed/" rel="self" type="application/rss+xml" />
	<link>https://yutsumura.com</link>
	<description></description>
	<lastBuildDate>Sat, 18 Nov 2017 17:05:30 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=5.3.4</generator>

<image>
	<url>https://i2.wp.com/yutsumura.com/wp-content/uploads/2016/12/cropped-question-logo.jpg?fit=32%2C32&#038;ssl=1</url>
	<title>graph &#8211; Problems in Mathematics</title>
	<link>https://yutsumura.com</link>
	<width>32</width>
	<height>32</height>
</image> 
<site xmlns="com-wordpress:feed-additions:1">114989322</site>	<item>
		<title>Given Graphs of Characteristic Polynomial of Diagonalizable Matrices, Determine the Rank of Matrices</title>
		<link>https://yutsumura.com/given-graphs-of-characteristic-polynomial-of-diagonal-matrices-determine-the-rank-of-matrices/</link>
				<comments>https://yutsumura.com/given-graphs-of-characteristic-polynomial-of-diagonal-matrices-determine-the-rank-of-matrices/#respond</comments>
				<pubDate>Tue, 13 Dec 2016 03:25:01 +0000</pubDate>
		<dc:creator><![CDATA[Yu]]></dc:creator>
				<category><![CDATA[Linear Algebra]]></category>
		<category><![CDATA[algebraic multiplicity]]></category>
		<category><![CDATA[characteristic polynomial]]></category>
		<category><![CDATA[diagonalizable]]></category>
		<category><![CDATA[diagonalizable matrix]]></category>
		<category><![CDATA[eigenspace]]></category>
		<category><![CDATA[eigenvalue]]></category>
		<category><![CDATA[figure]]></category>
		<category><![CDATA[geometric multiplicity]]></category>
		<category><![CDATA[graph]]></category>
		<category><![CDATA[linear algebra]]></category>
		<category><![CDATA[matrix]]></category>
		<category><![CDATA[null space]]></category>
		<category><![CDATA[nullity]]></category>
		<category><![CDATA[nullity of a matrix]]></category>
		<category><![CDATA[rank]]></category>
		<category><![CDATA[rank of a matrix]]></category>
		<category><![CDATA[rank-nullity theorem]]></category>

		<guid isPermaLink="false">https://yutsumura.com/?p=1549</guid>
				<description><![CDATA[<p>Let $A, B, C$ are $2\times 2$ diagonalizable matrices. The graphs of characteristic polynomials of $A, B, C$ are shown below. The red graph is for $A$, the blue one for $B$, and the&#46;&#46;&#46;</p>
<p>The post <a href="https://yutsumura.com/given-graphs-of-characteristic-polynomial-of-diagonal-matrices-determine-the-rank-of-matrices/" target="_blank">Given Graphs of Characteristic Polynomial of Diagonalizable Matrices, Determine the Rank of Matrices</a> first appeared on <a href="https://yutsumura.com/" target="_blank">Problems in Mathematics</a>.</p>]]></description>
								<content:encoded><![CDATA[<h2> Problem 217</h2>
<p>Let $A, B, C$ are $2\times 2$ diagonalizable matrices. </p>
<p>The graphs of characteristic polynomials of $A, B, C$ are shown below. The red graph is for $A$, the blue one for $B$, and the green one for $C$.</p>
<p>From this information, determine the rank of the matrices $A, B,$ and $C$.</p>
<div id="attachment_1550" style="width: 743px" class="wp-caption alignnone"><img aria-describedby="caption-attachment-1550" src="https://i1.wp.com/yutsumura.com/wp-content/uploads/2016/12/graphs-of-characteristic-polynomials.jpg?resize=733%2C464" alt="Graphs of characteristic polynomials" width="733" height="464" class="size-full wp-image-1550" srcset="https://i1.wp.com/yutsumura.com/wp-content/uploads/2016/12/graphs-of-characteristic-polynomials.jpg?w=733&amp;ssl=1 733w, https://i1.wp.com/yutsumura.com/wp-content/uploads/2016/12/graphs-of-characteristic-polynomials.jpg?resize=300%2C190&amp;ssl=1 300w" sizes="(max-width: 733px) 100vw, 733px" data-recalc-dims="1" /><p id="caption-attachment-1550" class="wp-caption-text">Graphs of characteristic polynomials</p></div>
&nbsp;<br />
<span id="more-1549"></span><br />

<h2>Hint.</h2>
<p>Observe that a null space a matrix $M$ is the same as the eigenspace $E_0$ corresponding to the eigenvalue $\lambda=0$ (if 0 is an eigenvalue).<br />
So what you need to see is whether the graphs pass though the origin.</p>
<p>Also, since the matrices are diagonalizable, the algebraic multiplicities are the same as the geometric multiplicities (the dimension of the eigenspace).<br />
You can determine the algebraic multiplicities from the graph by looking at whether the graphs are tangential to $x$-axis or not.</p>
<h2>Solution.</h2>
<p>	We first determine the nullities of the matrices, and then using the rank-nullity theorem we obtain the ranks.</p>
<p>	In general the nullity of any matrix $M$ is the dimension of the null space<br />
\[\calN(M)=\{\mathbf{x}\in \R^2 \mid M\mathbf{x}=\mathbf{0}\}\]
and the null space is the same as the eigenspace<br />
\[E_{0}=\{\mathbf{x}\in \R^2\mid M\mathbf{x}=0\mathbf{x}=\mathbf{0}\}\]
 corresponding to the eigenvalue $\lambda=0$ (if any).</p>
<p>From this observation, we see that the nullity of a matrix $M$ is the geometric multiplicity of the eigenspace $E_0$ associated to the eigenvalue $0$ (if any).</p>
<h3>The Nullity of the Matrix $A$</h3>
<p>Now we determine the nullity of the matrix $A$.<br />
The graph of the characteristic polynomial $p_A(\lambda)$ of $A$ passes through the origin $(0,0)$.</p>
<p>Thus $\lambda=0$ is a root of $p_A(\lambda)$ and hence $\lambda=0$ is an eigenvalue.<br />
Since the $x$-axis is tangential to the graph of $p_A(\lambda)$, the algebraic multiplicity of $\lambda=0$ is $2$. Since the matrix $A$ is diagonalizable, the geometric multiplicity is the same as the algebraic multiplicity. Therefore the nullity of $A$ is $2$.</p>
<h3>The Nullity of the Matrix $B$</h3>
<p>Next, the graph of characteristic polynomial $p_B(\lambda)$ of $B$ does not pass through the origin $(0,0)$. Thus $\lambda=0$ is not an eigenvalue of $B$. This yields that the matrix $B=B-0I$ is nonsingular matrix, and hence we have the null space $\calN(B)=\{0\}$ and the nullity of $B$ is zero.</p>
<h3>The Nullity of the Matrix $C$</h3>
<p>Third, the origin $(0,0)$ is on the graphs of characteristic polynomial $p_C(\lambda)$ of $C$, but the $x$-axis is not tangential to the graph of $p_C(\lambda)$.<br />
Therefore the algebraic (hence geometric) multiplicity of $\lambda=0$ is $1$. Thus the nullity of $C$ is $1$. </p>
<h3>Ranks by the Rank-Nullity Theorem</h3>
<p>Finally, using the rank-nullity theorem<br />
\[\text{rank}+\text{nullity}=2,\]
we obtain the rank of $A, B, C$ are $0, 2, 1$, respectively.</p>
<button class="simplefavorite-button has-count" data-postid="1549" data-siteid="1" data-groupid="1" data-favoritecount="7" style="">Click here if solved <i class="sf-icon-star-empty"></i><span class="simplefavorite-button-count" style="">7</span></button><p>The post <a href="https://yutsumura.com/given-graphs-of-characteristic-polynomial-of-diagonal-matrices-determine-the-rank-of-matrices/" target="_blank">Given Graphs of Characteristic Polynomial of Diagonalizable Matrices, Determine the Rank of Matrices</a> first appeared on <a href="https://yutsumura.com/" target="_blank">Problems in Mathematics</a>.</p>]]></content:encoded>
							<wfw:commentRss>https://yutsumura.com/given-graphs-of-characteristic-polynomial-of-diagonal-matrices-determine-the-rank-of-matrices/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
						<post-id xmlns="com-wordpress:feed-additions:1">1549</post-id>	</item>
	</channel>
</rss>
