<?xml version="1.0" encoding="utf-8"?><feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en-US"><generator uri="https://jekyllrb.com/" version="4.4.1">Jekyll</generator><link href="https://ulysseszh.github.io/feed/tags/lattice.xml" rel="self" type="application/atom+xml" /><link href="https://ulysseszh.github.io/" rel="alternate" type="text/html" hreflang="en-US" /><updated>2026-04-30T17:49:58-07:00</updated><id>https://ulysseszh.github.io/feed/tags/lattice.xml</id><title type="html"><![CDATA[Ulysses’ trip]]></title><subtitle>Here we are at the awesome (awful) blog written by UlyssesZhan!</subtitle><author><name>UlyssesZhan</name><email>ulysseszhan@gmail.com</email></author><entry><title type="html"><![CDATA[Rotational symmetry of plane lattices as a simple example of algebraic number theory]]></title><link href="https://ulysseszh.github.io/math/2023/11/09/lattice-algebraic.html" rel="alternate" type="text/html" title="Rotational symmetry of plane lattices as a simple example of algebraic number theory" /><published>2023-11-09T23:53:41-08:00</published><updated>2023-11-09T23:53:41-08:00</updated><id>https://ulysseszh.github.io/math/2023/11/09/lattice-algebraic</id><content type="html" xml:base="https://ulysseszh.github.io/math/2023/11/09/lattice-algebraic.html"><![CDATA[<p>Here is an exercise problem from <em>Modern Condensed Matter Physics</em> (Girvin and Yang, 2019):<sup>©</sup></p>
<blockquote>
<strong>Exercise 3.9.</strong> Show that five-fold rotation symmetry is inconsistent with lattice translation symmetry in 2D. Since 3D lattices can be formed by stacking 2D lattices, this conclusion holds in 3D as well.
</blockquote>
<p class="no-indent">
Before I saw this problem, I had never thought about whether a plane lattice can have <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>m</mi></mrow><annotation encoding="application/x-tex">m</annotation></semantics></math></span></span>-fold symmetry for any positive integer <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>m</mi></mrow><annotation encoding="application/x-tex">m</annotation></semantics></math></span></span>. I was surprised at first that I cannot have a translationally symmetric lattice with 5-fold symmetry. After some thinking, I did realize that I cannot imagine a 5-fold symmetric plane lattice, so such a lattice cannot exist intuitively.
</p>
<p>Actually, the only allowed rotational symmetries are 2-fold, 3-fold, 4-fold, and 6-fold. This result is known as the <a href="https://en.wikipedia.org/wiki/Crystallographic_restriction_theorem" target="_blank" rel="external">crystallographic restriction theorem</a>. Then, how to prove it?</p>
<p>After jiggling around the possible structure of the symmetry group of a plane lattice, I finally proved it. I found that this proof is actually a simple and good example of how algebraic number theory can be used in physics.</p>
<p>Before diving into the proof, we need to first prove a simple lemma about real analysis:</p>
<p class="no-indent">
<strong>Lemma 1.</strong> If <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>G</mi></mrow><annotation encoding="application/x-tex">G</annotation></semantics></math></span></span> is a subgroup of <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mo stretchy="false">(</mo><msup><mi mathvariant="double-struck">R</mi><mn>2</mn></msup><mo separator="true">,</mo><mo>+</mo><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">(\mathbb R^2,+)</annotation></semantics></math></span></span> that is discrete and spans <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msup><mi mathvariant="double-struck">R</mi><mn>2</mn></msup></mrow><annotation encoding="application/x-tex">\mathbb R^2</annotation></semantics></math></span></span>, then there exist two linearly independent elements in <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msup><mi mathvariant="double-struck">R</mi><mn>2</mn></msup></mrow><annotation encoding="application/x-tex">\mathbb R^2</annotation></semantics></math></span></span> that generate <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>G</mi></mrow><annotation encoding="application/x-tex">G</annotation></semantics></math></span></span>.
</p>
<p class="no-indent">
<em>Proof.</em> Because <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>G</mi></mrow><annotation encoding="application/x-tex">G</annotation></semantics></math></span></span> spans <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msup><mi mathvariant="double-struck">R</mi><mn>2</mn></msup></mrow><annotation encoding="application/x-tex">\mathbb R^2</annotation></semantics></math></span></span>, there exist two linearly independent elements <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>g</mi><mn>1</mn></msub><mo separator="true">,</mo><msub><mi>g</mi><mn>2</mn></msub><mo>∈</mo><mi>G</mi></mrow><annotation encoding="application/x-tex">g_1,g_2\in G</annotation></semantics></math></span></span>.
</p>
<p>Consider the vector subspace <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>V</mi><mn>1</mn></msub><mo><mi mathvariant="normal">≔</mi></mo><msub><mi>g</mi><mn>1</mn></msub><mi mathvariant="double-struck">R</mi></mrow><annotation encoding="application/x-tex">V_1\coloneqq g_1\mathbb R</annotation></semantics></math></span></span> and the subgroup <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>G</mi><mn>1</mn></msub><mo><mi mathvariant="normal">≔</mi></mo><mi>G</mi><mo>∩</mo><msub><mi>V</mi><mn>1</mn></msub></mrow><annotation encoding="application/x-tex">G_1\coloneqq G\cap V_1</annotation></semantics></math></span></span>. Obviously, <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>G</mi><mn>1</mn></msub></mrow><annotation encoding="application/x-tex">G_1</annotation></semantics></math></span></span> should be generated by some element <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>h</mi><mn>1</mn></msub><mo>∈</mo><msub><mi>G</mi><mn>1</mn></msub></mrow><annotation encoding="application/x-tex">h_1\in G_1</annotation></semantics></math></span></span> (this is because <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>V</mi><mn>1</mn></msub><mo>≃</mo><mi mathvariant="double-struck">R</mi></mrow><annotation encoding="application/x-tex">V_1\simeq\mathbb R</annotation></semantics></math></span></span>, and <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>G</mi><mn>1</mn></msub></mrow><annotation encoding="application/x-tex">G_1</annotation></semantics></math></span></span> as a discrete set must have a smallest positive element under that isomorphism, which must be the generator of
<span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>G</mi><mn>0</mn></msub></mrow><annotation encoding="application/x-tex">G_0</annotation></semantics></math></span></span> because it would otherwise not be the smallest positive element). Therefore, <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>G</mi><mn>1</mn></msub><mo>=</mo><msub><mi>h</mi><mn>1</mn></msub><mi mathvariant="double-struck">Z</mi></mrow><annotation encoding="application/x-tex">G_1=h_1\mathbb Z</annotation></semantics></math></span></span>. Also, because <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>h</mi><mn>1</mn></msub><mo mathvariant="normal">≠</mo><mn>0</mn></mrow><annotation encoding="application/x-tex">h_1\ne0</annotation></semantics></math></span></span>, <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mo fence="true">{</mo><msub><mi>h</mi><mn>1</mn></msub><mo separator="true">,</mo><msub><mi>g</mi><mn>2</mn></msub><mo fence="true">}</mo></mrow><annotation encoding="application/x-tex">\left\{h_1,g_2\right\}</annotation></semantics></math></span></span> must span <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msup><mi mathvariant="double-struck">R</mi><mn>2</mn></msup></mrow><annotation encoding="application/x-tex">\mathbb R^2</annotation></semantics></math></span></span>.</p>
<p>Let <span class="katex-display"><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mi>T</mi><mo><mi mathvariant="normal">≔</mi></mo><mrow><mo fence="true">{</mo><mi>a</mi><msub><mi>h</mi><mn>1</mn></msub><mo>+</mo><mi>b</mi><msub><mi>g</mi><mn>2</mn></msub><mo>∈</mo><mi>G</mi><mtext> </mtext><mo fence="true" lspace="0.05em" rspace="0.05em">|</mo><mtext> </mtext><mi>a</mi><mo>∈</mo><mrow><mo fence="true">[</mo><mn>0</mn><mo separator="true">,</mo><mn>1</mn><mo fence="true">)</mo></mrow><mo separator="true">,</mo><mi>b</mi><mo>∈</mo><mrow><mo fence="true">[</mo><mn>0</mn><mo separator="true">,</mo><mn>1</mn><mo fence="true">]</mo></mrow><mo fence="true">}</mo></mrow><mi mathvariant="normal">.</mi></mrow><annotation encoding="application/x-tex">T\coloneqq\left\{ah_1+bg_2\in G\,\middle|\,a\in\left[0,1\right),b\in\left[0,1\right]\right\}.</annotation></semantics></math></span></span></span> Then, <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>T</mi></mrow><annotation encoding="application/x-tex">T</annotation></semantics></math></span></span> must be discrete (because <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>G</mi></mrow><annotation encoding="application/x-tex">G</annotation></semantics></math></span></span> is) and bounded, and contains at least the element <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>g</mi><mn>2</mn></msub></mrow><annotation encoding="application/x-tex">g_2</annotation></semantics></math></span></span>. Express every element in <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>T</mi></mrow><annotation encoding="application/x-tex">T</annotation></semantics></math></span></span> as <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>a</mi><msub><mi>h</mi><mn>1</mn></msub><mo>+</mo><mi>b</mi><msub><mi>g</mi><mn>2</mn></msub></mrow><annotation encoding="application/x-tex">ah_1+bg_2</annotation></semantics></math></span></span> and pick out the one element with the smallest non-zero <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>b</mi></mrow><annotation encoding="application/x-tex">b</annotation></semantics></math></span></span>, and denote it as
<span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>h</mi><mn>2</mn></msub><mo>=</mo><msup><mi>a</mi><mo>⋆</mo></msup><msub><mi>h</mi><mn>1</mn></msub><mo>+</mo><msup><mi>b</mi><mo>⋆</mo></msup><msub><mi>g</mi><mn>2</mn></msub></mrow><annotation encoding="application/x-tex">h_2=a^\star h_1+b^\star g_2</annotation></semantics></math></span></span>. Certainly, <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mo fence="true">{</mo><msub><mi>h</mi><mn>1</mn></msub><mo separator="true">,</mo><msub><mi>h</mi><mn>2</mn></msub><mo fence="true">}</mo></mrow><annotation encoding="application/x-tex">\left\{h_1,h_2\right\}</annotation></semantics></math></span></span> span <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msup><mi mathvariant="double-struck">R</mi><mn>2</mn></msup></mrow><annotation encoding="application/x-tex">\mathbb R^2</annotation></semantics></math></span></span>.</p>
<p>Now, for any <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>g</mi><mo>∈</mo><mi>G</mi></mrow><annotation encoding="application/x-tex">g\in G</annotation></semantics></math></span></span>, we can express it uniquely as <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>g</mi><mo>=</mo><mi>a</mi><msub><mi>h</mi><mn>1</mn></msub><mo>+</mo><mi>b</mi><msub><mi>g</mi><mn>2</mn></msub></mrow><annotation encoding="application/x-tex">g=ah_1+bg_2</annotation></semantics></math></span></span>. Define <span class="katex-display"><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><msub><mi>c</mi><mn>2</mn></msub><mo><mi mathvariant="normal">≔</mi></mo><mrow><mo fence="true">⌊</mo><mfrac><mi>b</mi><msup><mi>b</mi><mo>⋆</mo></msup></mfrac><mo fence="true">⌋</mo></mrow><mo separator="true">,</mo><mspace width="1em"/><msub><mi>c</mi><mn>1</mn></msub><mo><mi mathvariant="normal">≔</mi></mo><mrow><mo fence="true">⌊</mo><mi>a</mi><mo>−</mo><msup><mi>a</mi><mo>⋆</mo></msup><msub><mi>c</mi><mn>2</mn></msub><mo fence="true">⌋</mo></mrow><mo separator="true">,</mo><mspace width="1em"/><msup><mi>g</mi><mo mathvariant="normal" lspace="0em" rspace="0em">′</mo></msup><mo><mi mathvariant="normal">≔</mi></mo><mi>g</mi><mo>−</mo><msub><mi>c</mi><mn>1</mn></msub><msub><mi>h</mi><mn>1</mn></msub><mo>−</mo><msub><mi>c</mi><mn>2</mn></msub><msub><mi>h</mi><mn>2</mn></msub><mi mathvariant="normal">.</mi></mrow><annotation encoding="application/x-tex">c_2\coloneqq\left\lfloor\frac{b}{b^\star}\right\rfloor,\quad
c_1\coloneqq\left\lfloor a-a^\star c_2\right\rfloor,\quad
g'\coloneqq g-c_1h_1-c_2h_2.</annotation></semantics></math></span></span></span> Then,
<span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msup><mi>g</mi><mo mathvariant="normal" lspace="0em" rspace="0em">′</mo></msup><mo>∈</mo><mi>T</mi></mrow><annotation encoding="application/x-tex">g'\in T</annotation></semantics></math></span></span>, and if we express it as <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msup><mi>g</mi><mo mathvariant="normal" lspace="0em" rspace="0em">′</mo></msup><mo>=</mo><msup><mi>a</mi><mo mathvariant="normal" lspace="0em" rspace="0em">′</mo></msup><msub><mi>h</mi><mn>1</mn></msub><mo>+</mo><msup><mi>b</mi><mo mathvariant="normal" lspace="0em" rspace="0em">′</mo></msup><msub><mi>g</mi><mn>2</mn></msub></mrow><annotation encoding="application/x-tex">g'=a'h_1+b'g_2</annotation></semantics></math></span></span>, then <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msup><mi>b</mi><mo mathvariant="normal" lspace="0em" rspace="0em">′</mo></msup></mrow><annotation encoding="application/x-tex">b'</annotation></semantics></math></span></span> is smaller than <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msup><mi>b</mi><mo>⋆</mo></msup></mrow><annotation encoding="application/x-tex">b^\star</annotation></semantics></math></span></span>. By definition of <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msup><mi>b</mi><mo>⋆</mo></msup></mrow><annotation encoding="application/x-tex">b^\star</annotation></semantics></math></span></span>, <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msup><mi>b</mi><mo mathvariant="normal" lspace="0em" rspace="0em">′</mo></msup><mo>=</mo><mn>0</mn></mrow><annotation encoding="application/x-tex">b'=0</annotation></semantics></math></span></span>, so
<span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msup><mi>g</mi><mo mathvariant="normal" lspace="0em" rspace="0em">′</mo></msup><mo>∈</mo><msub><mi>G</mi><mn>1</mn></msub></mrow><annotation encoding="application/x-tex">g'\in G_1</annotation></semantics></math></span></span>. Hence, <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mo fence="true">{</mo><msub><mi>h</mi><mn>1</mn></msub><mo separator="true">,</mo><msub><mi>h</mi><mn>2</mn></msub><mo fence="true">}</mo></mrow><annotation encoding="application/x-tex">\left\{h_1,h_2\right\}</annotation></semantics></math></span></span> generates <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>G</mi></mrow><annotation encoding="application/x-tex">G</annotation></semantics></math></span></span>. <span class="qed-wrapper qed-normal"><span class="qed qed-normal"><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi mathvariant="normal">□</mi></mrow><annotation encoding="application/x-tex">\square</annotation></semantics></math></span></span></span></span></p>
<p>Now, we are ready to prove our main result:</p>
<p class="no-indent">
<strong>Theorem.</strong> There is a discrete subset of <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msup><mi mathvariant="double-struck">R</mi><mn>2</mn></msup></mrow><annotation encoding="application/x-tex">\mathbb R^2</annotation></semantics></math></span></span> that has both translational symmetry and <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>m</mi></mrow><annotation encoding="application/x-tex">m</annotation></semantics></math></span></span>-fold symmetry iff <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>φ</mi><mo stretchy="false">(</mo><mi>m</mi><mo stretchy="false">)</mo><mo>≤</mo><mn>2</mn></mrow><annotation encoding="application/x-tex">\varphi(m)\le2</annotation></semantics></math></span></span>, where <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>φ</mi></mrow><annotation encoding="application/x-tex">\varphi</annotation></semantics></math></span></span> is <a href="https://en.wikipedia.org/wiki/Euler%27s_totient_function" target="_blank" rel="external">Euler’s totient function</a>.
</p>
<p class="no-indent">
<em>Proof.</em> For the neccessity, prove by contradiction. I instead prove that a set that has the said symmetries must not be discrete.
</p>
<p>Denote the plane as <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi mathvariant="double-struck">C</mi></mrow><annotation encoding="application/x-tex">\mathbb C</annotation></semantics></math></span></span>. Assume that there is an <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>m</mi></mrow><annotation encoding="application/x-tex">m</annotation></semantics></math></span></span>-fold symmetry around point <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mn>0</mn></mrow><annotation encoding="application/x-tex">0</annotation></semantics></math></span></span>. Then, for any lattice site <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>z</mi></mrow><annotation encoding="application/x-tex">z</annotation></semantics></math></span></span>, the point <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>R</mi><mi>z</mi><mo><mi mathvariant="normal">≔</mi></mo><mi>α</mi><mi>z</mi></mrow><annotation encoding="application/x-tex">Rz\coloneqq\alpha z</annotation></semantics></math></span></span> (where <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>α</mi><mo><mi mathvariant="normal">≔</mi></mo><msup><mi mathvariant="normal">e</mi><mrow><mn>2</mn><mi>π</mi><mi mathvariant="normal">i</mi><mi mathvariant="normal">/</mi><mi>m</mi></mrow></msup></mrow><annotation encoding="application/x-tex">\alpha\coloneqq\mathrm e^{2\pi\mathrm i/m}</annotation></semantics></math></span></span>) is also a lattice site. Assume that there is a translational symmetry with translation <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>a</mi></mrow><annotation encoding="application/x-tex">a</annotation></semantics></math></span></span>, then the point <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>T</mi><mi>z</mi><mo><mi mathvariant="normal">≔</mi></mo><mi>z</mi><mo>+</mo><mi>a</mi></mrow><annotation encoding="application/x-tex">Tz\coloneqq z+a</annotation></semantics></math></span></span> is also a lattice site. Without loss of generality, we can adjust the orientation of our coordinate system and the length unit so that <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>a</mi><mo>=</mo><mn>1</mn></mrow><annotation encoding="application/x-tex">a=1</annotation></semantics></math></span></span>.</p>
<p>The group <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>G</mi></mrow><annotation encoding="application/x-tex">G</annotation></semantics></math></span></span> generated by <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mo stretchy="false">{</mo><mi>R</mi><mo separator="true">,</mo><mi>T</mi><mo stretchy="false">}</mo></mrow><annotation encoding="application/x-tex">\{R,T\}</annotation></semantics></math></span></span> is a subgroup of the symmetry group of the lattice. Its action <span class="katex-display"><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mi>S</mi><mo><mi mathvariant="normal">≔</mi></mo><mrow><mo fence="true">{</mo><mi>g</mi><mn>0</mn><mtext> </mtext><mo fence="true" lspace="0.05em" rspace="0.05em">|</mo><mtext> </mtext><mi>g</mi><mo>∈</mo><mi>G</mi><mo fence="true">}</mo></mrow></mrow><annotation encoding="application/x-tex">S\coloneqq\left\{g0\,\middle|\,g\in G\right\}</annotation></semantics></math></span></span></span> on the point <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mn>0</mn></mrow><annotation encoding="application/x-tex">0</annotation></semantics></math></span></span> is a subset of all the lattice sites (this is only true when <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mn>0</mn></mrow><annotation encoding="application/x-tex">0</annotation></semantics></math></span></span> is a lattice site; I will discuss later the other case). Notice that for any <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>z</mi><mo>∈</mo><mi>S</mi><mo separator="true">,</mo><mi>n</mi><mo>∈</mo><mi mathvariant="double-struck">Z</mi></mrow><annotation encoding="application/x-tex">z\in S,n\in\mathbb Z</annotation></semantics></math></span></span>, we have <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msup><mi>T</mi><mi>n</mi></msup><mi>R</mi><mi>z</mi><mo>=</mo><mi>n</mi><mo>+</mo><mi>α</mi><mi>z</mi><mo>∈</mo><mi>S</mi></mrow><annotation encoding="application/x-tex">T^nRz=n+\alpha z\in S</annotation></semantics></math></span></span>. Therefore, by expanding any polynomial with integer coefficients using <a href="https://en.wikipedia.org/wiki/Horner%27s_method" target="_blank" rel="external">Horner’s rule</a>, we can see that <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi mathvariant="double-struck">Z</mi><mo stretchy="false">[</mo><mi>α</mi><mo stretchy="false">]</mo><mo>⊆</mo><mi>S</mi></mrow><annotation encoding="application/x-tex">\mathbb Z[\alpha]\subseteq S</annotation></semantics></math></span></span>.</p>
<p>Because <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>α</mi></mrow><annotation encoding="application/x-tex">\alpha</annotation></semantics></math></span></span> is an algebraic integer of degree <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>φ</mi><mo stretchy="false">(</mo><mi>m</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\varphi(m)</annotation></semantics></math></span></span> (the minimal polynomial of <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>α</mi></mrow><annotation encoding="application/x-tex">\alpha</annotation></semantics></math></span></span> is known as the <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>m</mi></mrow><annotation encoding="application/x-tex">m</annotation></semantics></math></span></span>th <a href="https://en.wikipedia.org/wiki/Cyclotomic_polynomial" target="_blank" rel="external">cyclotomic polynomial</a>), the generating set of <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi mathvariant="double-struck">Z</mi><mo stretchy="false">[</mo><mi>α</mi><mo stretchy="false">]</mo></mrow><annotation encoding="application/x-tex">\mathbb Z[\alpha]</annotation></semantics></math></span></span> must have at least <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>φ</mi><mo stretchy="false">(</mo><mi>m</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\varphi(m)</annotation></semantics></math></span></span> elements. Therefore, according to Lemma 1, <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi mathvariant="double-struck">Z</mi><mo stretchy="false">[</mo><mi>α</mi><mo stretchy="false">]</mo></mrow><annotation encoding="application/x-tex">\mathbb Z[\alpha]</annotation></semantics></math></span></span> is discrete iff <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>φ</mi><mo stretchy="false">(</mo><mi>m</mi><mo stretchy="false">)</mo><mo>≤</mo><mn>2</mn></mrow><annotation encoding="application/x-tex">\varphi(m)\le2</annotation></semantics></math></span></span>.</p>
<p>For the case where <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mn>0</mn></mrow><annotation encoding="application/x-tex">0</annotation></semantics></math></span></span> is not a lattice site, we can generate <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>S</mi></mrow><annotation encoding="application/x-tex">S</annotation></semantics></math></span></span> by acting <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>G</mi></mrow><annotation encoding="application/x-tex">G</annotation></semantics></math></span></span> on any lattice site <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>z</mi><mn>0</mn></msub></mrow><annotation encoding="application/x-tex">z_0</annotation></semantics></math></span></span>. We can then easily prove that <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>z</mi><mn>0</mn></msub><mo>+</mo><mi mathvariant="double-struck">Z</mi><mo stretchy="false">[</mo><mi>α</mi><mo stretchy="false">]</mo><mo>⊆</mo><mi>S</mi></mrow><annotation encoding="application/x-tex">z_0+\mathbb Z[\alpha]\subseteq S</annotation></semantics></math></span></span>. To prove this, we just need to see that we can act <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msup><mi>R</mi><mrow><mo>−</mo><mi>k</mi></mrow></msup></mrow><annotation encoding="application/x-tex">R^{-k}</annotation></semantics></math></span></span> on <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>z</mi><mn>0</mn></msub></mrow><annotation encoding="application/x-tex">z_0</annotation></semantics></math></span></span> before further acting <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msup><mi>T</mi><mi>n</mi></msup><mi>R</mi></mrow><annotation encoding="application/x-tex">T^nR</annotation></semantics></math></span></span> on it for <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>k</mi></mrow><annotation encoding="application/x-tex">k</annotation></semantics></math></span></span> times. All the other steps are the same and still valid.</p>
<p>For the sufficiency, because there are only finitely many <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>m</mi></mrow><annotation encoding="application/x-tex">m</annotation></semantics></math></span></span>’s that satisfy <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>φ</mi><mtext> ⁣</mtext><mrow><mo fence="true">(</mo><mi>m</mi><mo fence="true">)</mo></mrow><mo>≤</mo><mn>2</mn></mrow><annotation encoding="application/x-tex">\varphi\!\left(m\right)\le2</annotation></semantics></math></span></span>. Therefore, we can enumerate these <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>m</mi></mrow><annotation encoding="application/x-tex">m</annotation></semantics></math></span></span>’s and see that we can easily construct a plane lattice with both translational symmetry and <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>m</mi></mrow><annotation encoding="application/x-tex">m</annotation></semantics></math></span></span>-fold symmetry for each <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>m</mi></mrow><annotation encoding="application/x-tex">m</annotation></semantics></math></span></span>. <span class="qed-wrapper qed-normal"><span class="qed qed-normal"><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi mathvariant="normal">□</mi></mrow><annotation encoding="application/x-tex">\square</annotation></semantics></math></span></span></span></span></p>
<p>I know the original problem in the book was probably not intended to be solved in this way, but it is really amazing how some seemingly purely mathematical areas can have their applications in physics, especially in an exercise problem of a physics textbook where pure mathematics is pretty unexpected.</p>
<p>Unfortunately, this proof, which is based on algebraic properties of certain complex numbers, does not generalize to higher dimensions because we cannot use the complex plane to represent a high-dimensional space.</p>]]></content><author><name>UlyssesZhan</name><email>ulysseszhan@gmail.com</email></author><category term="math" /><category term="complex" /><category term="condensed matter physics" /><category term="algebraic number theory" /><category term="lattice" /><category term="mathematical physics" /><summary type="html"><![CDATA[For a plane lattice, there is only a finite number of different rotational symmetries that are compatible with the discrete translational symmetry. For example, the 5-fold rotational symmetry is not one of them. Why is that? It turns out that whether an <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>m</mi></mrow><annotation encoding="application/x-tex">m</annotation></semantics></math></span></span>-fold symmetry is compatible with translational symmetry is the same as whether <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>φ</mi><mo stretchy="false">(</mo><mi>m</mi><mo stretchy="false">)</mo><mo>≤</mo><mn>2</mn></mrow><annotation encoding="application/x-tex">\varphi(m)\le2</annotation></semantics></math></span></span>.]]></summary><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://ulysseszh.github.io/assets/images/covers/2023-11-09-lattice-algebraic.png" /><media:content medium="image" url="https://ulysseszh.github.io/assets/images/covers/2023-11-09-lattice-algebraic.png" xmlns:media="http://search.yahoo.com/mrss/" /></entry></feed>