<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:planet="http://planet.intertwingly.net/" xmlns:indexing="urn:atom-extension:indexing" indexing:index="no">
  <title>Planet Musings</title>
  <updated>2026-09-08T09:25:33Z</updated>
  <generator uri="http://intertwingly.net/code/venus/">Venus</generator>
  <author>
    <name>Jacques Distler</name>
    <email>distler@golem.ph.utexas.edu</email>
  </author>
  <id>https://golem.ph.utexas.edu/~distler/planet/atom.xml</id>
  <link href="https://golem.ph.utexas.edu/~distler/planet/atom.xml" rel="self" type="application/atom+xml"/>
  <link href="https://golem.ph.utexas.edu/~distler/planet/" rel="alternate"/>

  <entry xml:lang="en">
    <id>http://terrytao.wordpress.com/?p=18087</id>
    <link href="https://terrytao.wordpress.com/2026/09/07/finite-time-blowup-with-smooth-forcing-term-for-the-incompressible-porous-medium-boussinesq-and-incompressible-euler-equations/" rel="alternate" type="text/html"/>
    <link href="https://terrytao.wordpress.com/2026/09/07/finite-time-blowup-with-smooth-forcing-term-for-the-incompressible-porous-medium-boussinesq-and-incompressible-euler-equations/#comments" rel="replies" type="text/html"/>
    <link href="https://terrytao.wordpress.com/2026/09/07/finite-time-blowup-with-smooth-forcing-term-for-the-incompressible-porous-medium-boussinesq-and-incompressible-euler-equations/feed/atom/" rel="replies" type="application/atom+xml"/>
    <title xml:lang="en">Finite time blowup with smooth forcing term for the incompressible porous medium, Boussinesq, and incompressible Euler equations</title>
    <summary xml:lang="en">There’s some exciting very recent work by Alpöge and Buckmaster, building upon prior work by Córdoba and Martínez-Zoroa, in the general topic around the infamous global regularity problem for the incompressible three-dimensional Navier-Stokes equations. It is now widely expected that it should be possible to construct smooth initial data and smooth forcing term that would […]</summary>
    <content type="xhtml" xml:lang="en"><div xmlns="http://www.w3.org/1999/xhtml"><p class="wp-block-paragraph">There’s some exciting <a href="https://mathstodon.xyz/@tristanbuckmaster@mastodon.social/117233413735526010">very recent work by Alpöge and Buckmaster</a>, building upon <a href="https://arxiv.org/abs/2410.22920v3">prior work by Córdoba and Martínez-Zoroa</a>, in the general topic around the infamous global regularity problem for the <a href="https://en.wikipedia.org/wiki/Navier%E2%80%93Stokes_equations">incompressible three-dimensional Navier-Stokes equations</a>.  It is now widely expected that it should be possible to construct smooth initial data and smooth forcing term that would make these equations develop singularities in finite time; and it should even be possible to do without the forcing term.  While these authors do not quite achieve these goals yet, they have made enough of a breakthrough that it looks very feasible to complete these goals in the near future.  In particular, they have demonstrated such finite time blowup for three simpler model equations: the incompressible porous medium (IPM) equation, the <a href="https://en.wikipedia.org/wiki/Boussinesq_approximation_(water_waves)">two-dimensional Boussinesq equation</a>, and the <a href="https://en.wikipedia.org/wiki/Euler_equations_(fluid_dynamics)">three-dimensional incompressible Euler equations</a>.  (The first of these equations was already handled by Córdoba and Martínez-Zoroa, but Alpöge and Buckmaster found a variant of their method that also extended to the other two equations, and has a high likelihood of also extending to Navier-Stokes as well.) As is now remarkably feasible in the modern era of autoformalization agents, their work has also been formalized in Lean.</p>



<p class="wp-block-paragraph">As one may expect nowadays, the arguments here are heavily AI-assisted, but the authors have been working over the last few weeks to simplify and rewrite the proofs from what they literally call “the worst writeup we had ever seen in the history of mathematics” into something far more readable and of professional quality.  This is still a work in progress: unfortunately, they were forced to release their preliminary preprints before they were completely digested and polished, due to external events that are documented on the above link.  Nevertheless, the introduction to the <a href="https://cims.nyu.edu/~tristanb/boussinesq.pdf">Boussinesq paper</a> at least is in pretty good shape, and can serve as an initial starting point.  I was also fortunate to have Tristan Buckmaster explain the main ideas of the paper in a half-hour phone conversation, although I still need to work some more (probably with some combination of a blackboard and modern AI tools) to digest things more.  For now I will try to write a quick summary of some of the main ideas, the highlighting of which I view as the main value of such work; the actual solving of these problems is only a proxy goal for the primary goal of developing mathematical understanding and insight.  Without such understanding, even a problem as infamous as the Navier-Stokes regularity problem of far less intrinsic significance to mathematics than is sometimes promoted in popular media. </p>



<p class="wp-block-paragraph">The basic strategy, due to Cordoba and Martínez-Zoroa, is to iteratively build up the solution to such equations in stages, repeatedly adding small high frequency corrections to a previous (forced) solution in a manner that makes the solution more singular towards the blowup time while keeping the forcing term well behaved.  Rather than work with any specific equation, let’s work with a completely abstract equation</p>



<p class="has-text-align-center wp-block-paragraph"><img alt="\displaystyle N(u) = f" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cdisplaystyle+N%28u%29+%3D+f&amp;bg=ffffff&amp;fg=545454&amp;s=0&amp;c=20201002"/></p>



<p class="wp-block-paragraph">where <img alt="u" class="latex" src="https://s0.wp.com/latex.php?latex=u&amp;bg=ffffff&amp;fg=545454&amp;s=0&amp;c=20201002"/> is the solution, <img alt="N" class="latex" src="https://s0.wp.com/latex.php?latex=N&amp;bg=ffffff&amp;fg=545454&amp;s=0&amp;c=20201002"/> is the nonlinear differential operator representing the equation of motion, and <img alt="f" class="latex" src="https://s0.wp.com/latex.php?latex=f&amp;bg=ffffff&amp;fg=545454&amp;s=0&amp;c=20201002"/> is the forcing term. Of course this is far too general a setting to perform a full analysis, but it should suffice for this brief post.</p>



<p class="wp-block-paragraph">Suppose that one has already managed to construct a low frequency solution</p>



<p class="has-text-align-center wp-block-paragraph"><img alt="\displaystyle N(u_{lo}) = f_{lo}" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cdisplaystyle+N%28u_%7Blo%7D%29+%3D+f_%7Blo%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0&amp;c=20201002"/></p>



<p class="wp-block-paragraph">to this equation, and would like to perturb it to create a new solution</p>



<p class="has-text-align-center wp-block-paragraph"><img alt="\displaystyle N(u_{lo} + u_{hi}) = f_{lo} + f_{hi}" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cdisplaystyle+N%28u_%7Blo%7D+%2B+u_%7Bhi%7D%29+%3D+f_%7Blo%7D+%2B+f_%7Bhi%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0&amp;c=20201002"/></p>



<p class="wp-block-paragraph">that adds a high frequency correction <img alt="u_{hi}" class="latex" src="https://s0.wp.com/latex.php?latex=u_%7Bhi%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0&amp;c=20201002"/> to the solution that starts emerging near the blowup time, at the cost of some (presumably also) high frequency correction <img alt="f_{hi}" class="latex" src="https://s0.wp.com/latex.php?latex=f_%7Bhi%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0&amp;c=20201002"/> to the forcing term.  If one can make the amplitude of the solution correction <img alt="u_{hi}" class="latex" src="https://s0.wp.com/latex.php?latex=u_%7Bhi%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0&amp;c=20201002"/> relatively large while keeping the amplitude of the correction <img alt="f_{hi}" class="latex" src="https://s0.wp.com/latex.php?latex=f_%7Bhi%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0&amp;c=20201002"/> very low, and the frequencies of the corrections increase rapidly with each iteration, then one can hope to iterate this procedure and pass to a limit to obtain a solution </p>



<p class="has-text-align-center wp-block-paragraph"><img alt="\displaystyle N(u) = f" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cdisplaystyle+N%28u%29+%3D+f&amp;bg=ffffff&amp;fg=545454&amp;s=0&amp;c=20201002"/></p>



<p class="wp-block-paragraph">where <img alt="u" class="latex" src="https://s0.wp.com/latex.php?latex=u&amp;bg=ffffff&amp;fg=545454&amp;s=0&amp;c=20201002"/> now exhibits blowup in finite time, while <img alt="f" class="latex" src="https://s0.wp.com/latex.php?latex=f&amp;bg=ffffff&amp;fg=545454&amp;s=0&amp;c=20201002"/> remains smooth.</p>



<p class="wp-block-paragraph">To make this strategy work, <img alt="u_{hi}" class="latex" src="https://s0.wp.com/latex.php?latex=u_%7Bhi%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0&amp;c=20201002"/> should approximately solve the difference equation</p>



<p class="has-text-align-center wp-block-paragraph"><img alt="\displaystyle N(u_{lo} + u_{hi}) - N(u_{lo}) \approx 0" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cdisplaystyle+N%28u_%7Blo%7D+%2B+u_%7Bhi%7D%29+-+N%28u_%7Blo%7D%29+%5Capprox+0&amp;bg=ffffff&amp;fg=545454&amp;s=0&amp;c=20201002"/></p>



<p class="wp-block-paragraph">to keep <img alt="f_{hi}" class="latex" src="https://s0.wp.com/latex.php?latex=f_%7Bhi%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0&amp;c=20201002"/> small.  If we can somehow neglect nonlinear effects, this basically amounts to solving a linearized equation</p>



<p class="has-text-align-center wp-block-paragraph"><img alt="\displaystyle N'(u_{lo}) u_{hi} \approx 0." class="latex" src="https://s0.wp.com/latex.php?latex=%5Cdisplaystyle+N%27%28u_%7Blo%7D%29+u_%7Bhi%7D+%5Capprox+0.&amp;bg=ffffff&amp;fg=545454&amp;s=0&amp;c=20201002"/></p>



<p class="wp-block-paragraph">The game is then to design the background solution <img alt="u_{lo}" class="latex" src="https://s0.wp.com/latex.php?latex=u_%7Blo%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0&amp;c=20201002"/> in such a way that the evolution equation <img alt="N'(u_{lo}) u_{hi} = 0" class="latex" src="https://s0.wp.com/latex.php?latex=N%27%28u_%7Blo%7D%29+u_%7Bhi%7D+%3D+0&amp;bg=ffffff&amp;fg=545454&amp;s=0&amp;c=20201002"/> exhibits some sort of exploitable instability, in which a solution <img alt="u_{hi}" class="latex" src="https://s0.wp.com/latex.php?latex=u_%7Bhi%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0&amp;c=20201002"/> to such an equation can start off exponentially small at early times, but become large near the blowup time.  At this point one may expect nonlinear effects to kick in and make the solution extremely difficult to analyze; but if one can time the emergence of large amplitudes just right, one can hope to arrive at a sweet spot where, by the blowup time, the amplitude has become large enough to disrupt smoothness, but not so large to destabilize the analysis.</p>



<p class="wp-block-paragraph">In the case of the Boussinesq equation at least, there is an explicit ansatz, described in the introduction to the <a href="https://cims.nyu.edu/~tristanb/boussinesq.pdf">relevant paper</a>, in which, at times close to blowup and locations close to the origin, <img alt="u_{lo}" class="latex" src="https://s0.wp.com/latex.php?latex=u_%7Blo%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0&amp;c=20201002"/> behaves linearly in space, and <img alt="u_{hi}" class="latex" src="https://s0.wp.com/latex.php?latex=u_%7Bhi%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0&amp;c=20201002"/> behaves like a high frequency plane wave.  Remarkably, this ansatz can be solved exactly (without any nonlinear correction terms), leading to an explicit system of ODE modulation equations that have the required instability property.  This is the basic mechanism for blowup; however there are an enormous number of technical complications, for instance relating to spatial cutoffs, that are needed to make the full argument rigorous.  The Alpöge–Buckmaster construction has some technical improvements over the older Córdoba–Martínez-Zoroa construction that allow them to treat more general fluid equations; I have not yet digested the precise differences, but the ODEs seem to be more unstable and the high frequency corrections appear to have better spatial localization properties.</p>



<p class="wp-block-paragraph">Hopefully there will be some better expositions and talks by the authors on this nice result in the future.  If I have time and am able to digest the results better, I may also be able to give more details in a followup blog post.</p>



<p class="wp-block-paragraph">EDIT: there is now also an independent <a href="https://anima-ai.org/2026/09/07/stable-singularity-of-the-euler-equations-on-r3-without-forcing/">preprint of Ganeshram, Duruisseaux, and Anandkumar</a> that has made a significant advance on the other major approach to finite time blowup, which is to first use numerical or machine learning tools to locate an approximately self-similar blowup profile ansatz, and then demonstrate that it is stable enough to be perturbed to an actual solution.  For the Euler equations (with no forcing term or boundary), they have used a physics-informed neural network (PINN) to locate a numerically stable candidate solution; though actually establishing its stability to within the tolerance of the residual error in the solution remains a major challenging task to carry this result all the way through to a full rigorous demonstration of finite time blowup.</p>



<p class="wp-block-paragraph"/></div>
    </content>
    <updated>2026-09-08T07:17:02Z</updated>
    <published>2026-09-08T05:13:17Z</published>
    <category scheme="https://terrytao.wordpress.com" term="math.AP"/>
    <category scheme="https://terrytao.wordpress.com" term="math.MP"/>
    <category scheme="https://terrytao.wordpress.com" term="Diego Cordoba"/>
    <category scheme="https://terrytao.wordpress.com" term="Euler equations"/>
    <category scheme="https://terrytao.wordpress.com" term="finite time blowup"/>
    <category scheme="https://terrytao.wordpress.com" term="Laurent Alp&#xF6;ge"/>
    <category scheme="https://terrytao.wordpress.com" term="Luis Mart&#xED;nez-Zoroa"/>
    <category scheme="https://terrytao.wordpress.com" term="Tristan Buckmaster"/>
    <author>
      <name>Terence Tao</name>
      <uri>http://www.math.ucla.edu/~tao</uri>
    </author>
    <source>
      <id>http://terrytao.wordpress.com/feed/atom/</id>
      <link href="https://terrytao.wordpress.com" rel="alternate" type="text/html"/>
      <link href="https://terrytao.wordpress.com/feed/atom/" rel="self" type="application/atom+xml"/>
      <link href="https://terrytao.wordpress.com/osd.xml" rel="search" title="What's new" type="application/opensearchdescription+xml"/>
      <link href="https://s1.wp.com/opensearch.xml" rel="search" title="WordPress.com" type="application/opensearchdescription+xml"/>
      <link href="https://terrytao.wordpress.com/?pushpress=hub" rel="hub" type="text/html"/>
      <subtitle xml:lang="en">Updates on my research and expository papers, discussion of open problems, and other maths-related topics.  By Terence Tao</subtitle>
      <title xml:lang="en">What's new</title>
      <updated>2026-09-08T07:17:02Z</updated>
    </source>
  </entry>

  <entry xml:lang="en">
    <id>http://quomodocumque.wordpress.com/?p=8852</id>
    <link href="https://quomodocumque.wordpress.com/2026/09/07/finite-time-blowup/" rel="alternate" type="text/html"/>
    <title>Finite-time blowup</title>
    <summary>Interesting developments tonight, as Levent Alpöge and Tristan Buckmaster announce that after a fair amount of work they have constructed examples of finite-time blowup for a broad class of PDEs including 3-d incompressible Euler, inspired by of Diego Córdoba and Luis Martínez-Zoroa, and using plenty of LLM iteration in order to get the details right. […]</summary>
    <content type="xhtml"><div xmlns="http://www.w3.org/1999/xhtml"><p class="wp-block-paragraph">Interesting developments tonight, as <a href="https://mathstodon.xyz/@tristanbuckmaster@mastodon.social/117233413735526010">Levent Alpöge and Tristan Buckmaster announce</a> that after a fair amount of work they have constructed examples of finite-time blowup for a broad class of PDEs including 3-d incompressible Euler, inspired by of Diego Córdoba and Luis Martínez-Zoroa, and using plenty of LLM iteration in order to get the details right.  This is, of course, a problem in the neighborhood of Navier-Stokes (in the negative direction of finding a counterexample to the conjecture, which I have over the years heard many PDE folks saying was the right way to bet), and <a href="https://mathstodon.xyz/@tao/117233527638291447">Terry Tao says in a Mastodon thread</a> that in principle this method doesn’t seem so far from showing blowup for Navier-Stokes too, though a large amount of compute and detail-checking would be involved.</p>



<p class="wp-block-paragraph">At least part of this has already been Lean-formalized, though perhaps eccentrically I find I care a little less about that.  What matters is not whether there’s an example but whether the example has something to teach us.  An interesting but incorrect example would surely be of more value than an uninteresting but correct one. Well, I suppose the latter would have <a href="https://www.claymath.org/millennium/navier-stokes-equation/">more financial value</a>.  Though even on that Millennium Prize page, one sees:  “Why ask for a proof? Because a proof gives not only certitude, but also understanding.” Very true!  We mustn’t settle for mere certitude.  Certainly the work of Alpöge, Buckmaster, Córdoba, and Martínez-Zoroa seems to offer understanding as well.</p>



<p class="wp-block-paragraph"/></div>
    </content>
    <updated>2026-09-08T04:58:11Z</updated>
    <published>2026-09-08T04:58:11Z</published>
    <category term="computers"/>
    <category term="math"/>
    <category term="news"/>
    <category term="machine learning"/>
    <category term="pde"/>
    <author>
      <name>JSE</name>
    </author>
    <source>
      <id>https://quomodocumque.wordpress.com</id>
      <logo>https://s2.wp.com/i/webclip.png</logo>
      <link href="https://quomodocumque.wordpress.com/feed/" rel="self" type="application/rss+xml"/>
      <link href="https://quomodocumque.wordpress.com" rel="alternate" type="text/html"/>
      <link href="https://quomodocumque.wordpress.com/osd.xml" rel="search" title="Quomodocumque" type="application/opensearchdescription+xml"/>
      <link href="https://quomodocumque.wordpress.com/?pushpress=hub" rel="hub" type="text/html"/>
      <subtitle>Math, Madison, food, the Orioles, books, my kids.</subtitle>
      <title>Quomodocumque</title>
      <updated>2026-09-08T04:58:11Z</updated>
    </source>
  </entry>

  <entry>
    <id>tag:blogger.com,1999:blog-13869903.post-3216068878649249401</id>
    <link href="https://nanoscale.blogspot.com/feeds/3216068878649249401/comments/default" rel="replies" title="Post Comments" type="application/atom+xml"/>
    <link href="https://www.blogger.com/comment/fullpage/post/13869903/3216068878649249401" rel="replies" title="0 Comments" type="text/html"/>
    <link href="https://www.blogger.com/feeds/13869903/posts/default/3216068878649249401" rel="edit" type="application/atom+xml"/>
    <link href="https://www.blogger.com/feeds/13869903/posts/default/3216068878649249401" rel="self" type="application/atom+xml"/>
    <link href="https://nanoscale.blogspot.com/2026/09/negative-thermal-expansion.html" rel="alternate" title="Negative thermal expansion " type="text/html"/>
    <title>Negative thermal expansion</title>
    <content type="xhtml"><div xmlns="http://www.w3.org/1999/xhtml">Some interesting science results recently, but I wanted to talk about one a little off the beaten path.  Most people have some exposure to the concept of <a href="https://en.wikipedia.org/wiki/Thermal_expansion" target="_blank">thermal expansion</a>, the idea that solids tend to increase in size as temperature is increased.  This is why people suggest running a stuck (metal) lid on a glass jar under hot water to make it easier to open - the idea is that the metal expands more with increasing temperature than the glass.  This is why there are flexible joints between sections of concrete road, rather than trying to cast the road in one giant section.  Thermal expansion of the pavement would otherwise <a href="https://www.wfaa.com/article/news/local/extreme-heat-causes-concrete-slab-to-buckle-on-us-69-in-greenville-txdot-says/287-f502b2dc-bc30-4554-bb6c-e9bfe4562696" target="_blank">buckle the roadway</a>.  <div><br/></div><div><table cellpadding="0" cellspacing="0" class="tr-caption-container" style="float: right;"><tbody><tr><td style="text-align: center;"><a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEi8iT0gxTO5BihBw6NHPdH13fx59DRq9jE_47QfqqGvQ8ogPLZ3csvjOJj5IrX4vllHnhvFD2lXXiMz55RVED1K1JsxryCcZWr61QFXeoxcN1RdDjQoe7hLUYa7I40anyomFp5zsFXeobo_jUrlbG-PDPrlUTRd3ohqNIEjw3Y2Ote-Q25Jv-JVuQ/s551/h2.gif" style="clear: right; margin-bottom: 1em; margin-left: auto; margin-right: auto;"><img border="0" height="154" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEi8iT0gxTO5BihBw6NHPdH13fx59DRq9jE_47QfqqGvQ8ogPLZ3csvjOJj5IrX4vllHnhvFD2lXXiMz55RVED1K1JsxryCcZWr61QFXeoxcN1RdDjQoe7hLUYa7I40anyomFp5zsFXeobo_jUrlbG-PDPrlUTRd3ohqNIEjw3Y2Ote-Q25Jv-JVuQ/w230-h154/h2.gif" width="230"/></a></td></tr><tr><td class="tr-caption" style="text-align: center;"><span style="font-size: x-small;">Vibrating H2 molecule, electron density <br/>from <a href="https://en.wikipedia.org/wiki/Density_functional_theory" target="_blank">DFT</a>, by Dr. <a href="https://scholar.google.com/citations?user=T75iRssAAAAJ&amp;hl=en" target="_blank">Or Cohen</a>.</span></td></tr></tbody></table>Where does thermal expansion originate?  In a toy model, we can think of the bound atoms in a solid like balls and springs.  The springs in this case model forces between the atoms that result from the electrons involved in the chemical bonds that hold the solid together.  (We usually <a href="https://en.wikipedia.org/wiki/Born%E2%80%93Oppenheimer_approximation" target="_blank">think of the nuclei as slow and the electrons as fast</a>, so you can consider the nuclear positions, somehow solving for the electron density given those positions, and figuring out the net force on the nuclei.  There is a whole subfield now in <a href="https://en.wikipedia.org/wiki/Machine-learned_interatomic_potential" target="_blank">shortcutting these calculations with machine learning</a>.)  In an ideal harmonic oscillator, the potential energy is perfectly symmetric around its minimum position.  Giving the oscillator larger and larger amounts of kinetic energy therefore does not change the time <i>average</i> separation of the atoms. </div><div><br/></div><div><div class="separator" style="clear: both; text-align: center;"><a href="https://blogger.googleusercontent.com/img/a/AVvXsEgvjfaB52E8Rgj395JZGdB51SGMZv2XB77Itcg3iZNJFtKxwuP-ioFHwhwPCAL2LGPuAQwo38OAkt-dpjgxuyJo0RlO2xsFNJxL-85vrFSyJSQ8hQyDkFJlV0VAkHqRtYjHvTGui-vuvQh-yNNbw1_whypipdhTj0UyyybQ7zGtxQYPAdMNlmgS5g" style="clear: right; float: right; margin-bottom: 1em; margin-left: 1em;"><img alt="" height="151" src="https://blogger.googleusercontent.com/img/a/AVvXsEgvjfaB52E8Rgj395JZGdB51SGMZv2XB77Itcg3iZNJFtKxwuP-ioFHwhwPCAL2LGPuAQwo38OAkt-dpjgxuyJo0RlO2xsFNJxL-85vrFSyJSQ8hQyDkFJlV0VAkHqRtYjHvTGui-vuvQh-yNNbw1_whypipdhTj0UyyybQ7zGtxQYPAdMNlmgS5g=w201-h151" width="201"/></a></div>When dealing with interatomic potentials, though, the potential is <a href="https://en.wikipedia.org/wiki/Anharmonicity" target="_blank">anharmonic</a> - the effective spring is softer in extension than compression.  Another way to put it:  at small separations, the "<a href="https://nanoscale.blogspot.com/2018/06/what-are-steric-interactions.html" target="_blank">steric interactions</a>" caused by the Pauli principle give the "hard core repulsion" that tends to keep atoms from overlapping.  As a result, the potential looks like the cartoon (red dashed parabola = harmonic approximation that is good near the equilibrium position).  Now, if you give the atoms more kinetic energy, their time-average separation gets larger.  This is the conventional origin of the usual <i>positive</i> thermal expansion.  (Fun historical note.  In 1910, <a href="https://en.wikipedia.org/wiki/Frederick_Lindemann,_1st_Viscount_Cherwell" target="_blank">Lindemann</a>, Churchill's friend ("the prof") and science advisor during WWII, put forward what is now called the Lindemann melting criterion: monatomic solids melt roughly when the root mean square thermal vibration displacement is about 10% of the interatomic distance.  This paper is hard to find online, btw.  Lindemann, Frederick A. "<a href="https://ntrs.nasa.gov/api/citations/19840027015/downloads/19840027015.pdf" target="_blank">Über die berechnung molekularer eigenfrequenzen</a>" <i>Phys. Z</i> <b>11, </b>609-612 (1910).),</div><div><br/></div><div>Interestingly, some materials have <i>negative</i> thermal expansion - as temperature is increased, the materials shrink!  How does that work?  It seems to fly directly counter to intuitive expectations.  <a href="https://en.wikipedia.org/wiki/Negative_thermal_expansion" target="_blank">Negative thermal expansion</a> often involves materials with lots of open volume in their structure, built out of <a href="https://en.wikipedia.org/wiki/Rigid_unit_modes" target="_blank">rigid subunits</a> (e.g. tetrahedra or octahedra of atoms).  As temperature increases, the subunits can deform a bit and also can rotate in ways that allow them to pack more efficiently.  An example of a material like this is <a href="https://en.wikipedia.org/wiki/Zirconium_tungstate" target="_blank">zirconium tungstate</a>.   That brings me to <a href="https://doi.org/10.1021/jacs.6c12924" target="_blank">this article</a> in JACS, which reports colossal negative thermal expansion in a <a href="https://en.wikipedia.org/wiki/Metal%E2%80%93organic_framework" target="_blank">metal organic framework</a> compound, with a fractional change in volume of around -0.0006 per Kelvin near around 50 degrees C.  This negative thermal expansion coefficient is six times larger than the previous record, and seems to result from distortion of Zr6/oxygen tetrahedra.  Pretty neat, and these kinds of motifs could lead to materials with more designer thermal structural properties.</div><div><br/><br/></div></div>
    </content>
    <updated>2026-09-07T18:05:56Z</updated>
    <published>2026-09-07T16:36:22Z</published>
    <author>
      <name>Douglas Natelson</name>
      <email>noreply@blogger.com</email>
      <uri>http://www.blogger.com/profile/13340091255404229559</uri>
    </author>
    <source>
      <id>tag:blogger.com,1999:blog-13869903</id>
      <category term="concepts"/>
      <author>
        <name>Douglas Natelson</name>
        <email>noreply@blogger.com</email>
        <uri>http://www.blogger.com/profile/13340091255404229559</uri>
      </author>
      <link href="https://nanoscale.blogspot.com/feeds/posts/default" rel="http://schemas.google.com/g/2005#feed" type="application/atom+xml"/>
      <link href="https://www.blogger.com/feeds/13869903/posts/default?alt=atom" rel="self" type="application/atom+xml"/>
      <link href="https://nanoscale.blogspot.com/" rel="alternate" type="text/html"/>
      <link href="http://pubsubhubbub.appspot.com/" rel="hub" type="text/html"/>
      <link href="https://www.blogger.com/feeds/13869903/posts/default?alt=atom&amp;start-index=26&amp;max-results=25" rel="next" type="application/atom+xml"/>
      <subtitle>A blog about condensed matter and nanoscale physics.  Why should high energy and astro folks have all the fun?</subtitle>
      <title>nanoscale views</title>
      <updated>2026-09-07T18:05:56Z</updated>
    </source>
  </entry>

  <entry xml:lang="en">
    <id>http://johncarlosbaez.wordpress.com/?p=44399</id>
    <link href="https://johncarlosbaez.wordpress.com/2026/09/06/the-e6-root-polytope/" rel="alternate" type="text/html"/>
    <link href="https://johncarlosbaez.wordpress.com/2026/09/06/the-e6-root-polytope/#comments" rel="replies" type="text/html"/>
    <link href="https://johncarlosbaez.wordpress.com/2026/09/06/the-e6-root-polytope/feed/atom/" rel="replies" type="application/atom+xml"/>
    <title xml:lang="en">The E6 Root Polytope</title>
    <summary xml:lang="en">I’ve been thinking about the exceptional Lie algebra E6, as a spinoff of my project on E7, so I want to get a good mental picture of the E6 root polytope. This is 6-dimensional polytope with remarkable symmetry. Let’s climb up to it, starting with some of its 4-dimensional faces, which are called 4-demicubes because […]</summary>
    <content type="xhtml" xml:lang="en"><div xmlns="http://www.w3.org/1999/xhtml"><p>I’ve been thinking about the exceptional Lie algebra E<sub>6</sub>, as a spinoff of my project on E<sub>7</sub>, so I want to get a good mental picture of the <a href="https://en.wikipedia.org/wiki/1_22_polytope">E<sub>6</sub> root polytope</a>.  This is 6-dimensional polytope with remarkable symmetry.</p>
<p>Let’s climb up to it, starting with some of its 4-dimensional faces, which are called 4-demicubes because you get them by taking a 4-dimensional cube, or tesseract, and removing every other corner.  The 3-demicube is just a tetrahedron, since you can fit two tetrahedra in a 3-dimensional cube like this:</p>
<div align="center">
<img src="https://i0.wp.com/math.ucr.edu/home/baez/mathematical/demicubes.png" width="250"/>
</div>
<p>The 4-demicube builds on this fact in a surprising way.</p>
<p>I’m going to use the technology of Dynkin diagrams, or technically Coxeter diagrams: they’re closely related, and the difference is invisible here.  I won’t explain them, just use them.   I explained them here:</p>
<p>• Symmetry and the fourth dimension: <a href="https://johncarlosbaez.wordpress.com/2012/07/22/symmetry-and-the-fourth-dimension-part-3/">part 3</a>, <a href="https://johncarlosbaez.wordpress.com/2012/07/26/symmetry-and-the-fourth-dimension-part-4/">part 4</a>, <a href="https://johncarlosbaez.wordpress.com/2012/08/03/symmetry-and-the-fourth-dimension-part-5/">part 5</a>, <a href="https://johncarlosbaez.wordpress.com/2012/08/11/symmetry-and-the-fourth-dimension-part-6/">part 6</a>.</p>
<p>Let’s dive in!</p>
<div align="center">
<img src="https://i0.wp.com/math.ucr.edu/home/baez/mathematical/4d_demicube.png" width="450"/>
</div>
<p>The 4-demicube lives in 4 dimensions.  It has 8 vertices.</p>
<p>You get it from a 4-dimensional cube, which has 2<sup>4</sup> = 16 vertices, by keeping every other vertex, throwing away half.  That leaves 8.</p>
<p>What are its top-dimensional faces, aka ‘facets’?  Surprise: there’s only one kind!  All of them are regular tetrahedra.</p>
<p>In higher dimensions the demicube has two kinds of facet.  You get a simplex-shaped facet from every other vertex, formed when you remove it.  And you get a demicube-shaped facet from each of the cube’s facets.  But in 4 dimensions the two kinds happen to be the same shape!</p>
<p>Eight of them are tetrahedra.  These appear at the 8 corners you sliced off: one per removed corner.</p>
<p>Eight more come from the 8 faces of the 4-dimensional cube.  These are 3-demicubes.  But as we’ve seen, the 3-demicube is also a tetrahedron!</p>
<p>So the 4-demicube is especially symmetric: it has 16 tetrahedral facets.  You can find coordinates where its vertices are</p>
<div align="center">
(±1, 0, 0, 0),   (0, ±1, 0, 0),   (0, 0, ±1, 0),   (0, 0, 0, ±1)
</div>
<p>It’s actually one of the 4-dimensional regular polytopes, sometimes called the 4-orthoplex.  It’s also called the <a href="https://en.wikipedia.org/wiki/16-cell">16-cell</a> because it has 16 facets.  It’s the 4-dimensional cousin of the octahedron, which has 8 triangular facets.</p>
<p>You can read some of these facts off the D<sub>4</sub> Dynkin diagram, if you know what you’re doing.  As you can see above, this diagram has a central node with three arms, each just 1 edge long: a perfectly symmetric three-pronged star.  To get the 4-demicube, you ring the tip of any one arm.</p>
<p>To get the facets of the 4-demicube, delete an unringed node so the piece still holding the ring stays connected, and see what diagram survives.  There are two choices: you can delete the tip of either other arm.  But either way, what’s left is a straight chain of 3 nodes—the so-called A<sub>3</sub> diagram—with a ring at one node at the end.  This gives the tetrahedron.</p>
<p>Both choices give the same shape of facet, a tetrahedron, because all three arms of the D<sub>4</sub> Dynkin diagram are interchangeable.  That ceases to be true in higher dimensions!</p>
<p> </p>
<div align="center">
<img src="https://i0.wp.com/math.ucr.edu/home/baez/mathematical/5d_demicube.png" width="450"/>
</div>
<p>Next, the 5-demicube.  This lives in 5 dimensions and has 16 vertices.</p>
<p>You get it from a 5-dimensional cube—which has 2<sup>5</sup> = 32 vertices—by keeping every other vertex, throwing away half. That leaves 16.</p>
<p>What are its top-dimensional faces, or ‘facets’?  There are two kinds!</p>
<p>Sixteen of them are 4-dimensional analogues of the regular tetrahedron, called 4-simplexes.  These appear at the corners you sliced off: one per removed corner.</p>
<p>The other ten come from the ten faces of the 5-dimensional cube.  After you take every other vertex, they become 4-demicubes.  These are precisely the 4-demicubes we saw in the last section!</p>
<p>You can also read these two kinds of facets from the D<sub>5</sub> Dynkin diagram.  As you can see above, this diagram has three arms of lengths 2, 1, 1 (edges from the central branch node).  To get the 5-demicube, you ring the tip of either length-1 arm.  That ringed diagram encodes the whole polytope.</p>
<p>To get the facets, delete an unringed node so the piece still holding the ring stays connected, and see what diagram survives.</p>
<p>There are two choices.</p>
<p>If you delete the tip of the other length-1 arm, what’s left is a straight chain of 4 nodes—the diagram whose polytope is the 4-simplex.  That gives the 4-simplex faces.</p>
<p>Or you can delete the tip of the length-2 arm.  Then what’s left is a shorter branching diagram, the one I showed you in my last post!  That gives the 4-demicube faces.</p>
<p>So the 5-demicube has both 4-simplex and 4-demicube faces.</p>
<p>Next let’s go up to the 6th dimension, which was my goal all along.</p>
<p> </p>
<div align="center">
<img src="https://i0.wp.com/math.ucr.edu/home/baez/mathematical/e6_root_polytope.png" width="450"/>
</div>
<p>The E<sub>6</sub> root polytope lives in 6 dimensions.   It has 72 vertices.</p>
<p>What are its facets?  You can read them straight off the E<sub>6</sub> Dynkin diagram, using the same procedure we’ve been using so far.</p>
<p>As you can see, the E<sub>6</sub> Dynkin diagram has three arms of lengths 2, 2, 1 (edges from the central branch node).  To get the root polytope, you ring the node that’s the tip of a length-1 arm.  That fact is not obvious, but let’s go ahead and do that.</p>
<p>Then, to get the facets, delete any unringed node such that the piece still holding the ring stays connected, and see what diagram survives.</p>
<p>There are two choices: the two other nodes at tips of the Dynkin diagram.</p>
<p>However, deleting <em>either</em> of these nodes leave a D<sub>5</sub> diagram with a ring on one node, and this gives the 5-demicube we saw last time: a 5-cube with alternate vertices removed.</p>
<p>So the facets of the E<sub>6</sub> root polytope are all the same shape: 5-demicubes!</p>
<p>With more work, we can count the facets of the polytopes we’ve been studying:</p>
<p>• The E<sub>6</sub> root polytope has 54 facets, all 5-demicubes.  They come in two kinds, because we had two choices of which node to delete, so there are really 27 ‘positive’ 5-demicube facets and 27 ‘negative’ 5-demicube facets.</p>
<p>• The 5-demicube has 16 4-simplex facets, one for each vertex that we removed from the 5-cube to create this demicube, and 10 4-demicube facets, one for each facet of that 5-cube.</p>
<p>• The 4-demicube has 8 3-simplex facets, one for each vertex that we removed from the 4-cube to create this demicube, and 8 3-demicube facets, one for each facet of that 4-cube.  But both the 3-simplex and the 3-demicube are the familiar <i>tetrahedron</i>.  So in fact the 4-demicube has 16 tetrahedral facets.   Indeed, the 4-demicube is the 4-dimensional analogue of an octahedron: the so-called 4-orthoplex, or 16-cell.</p>
<p>Using some fancier math I explained <a href="https://math.ucr.edu/home/baez/octonions/integers/integers_5.html">here</a>, we can count all the faces of the E<sub>6</sub> root polytope:</p>
<table border="1" cellpadding="2" cellspacing="0">
<tbody><tr>
<th>dim</th>
<th>faces</th>
<th>count</th>
</tr>
<tr>
<td>5</td>
<td>5-demicubes</td>
<td>54 = 27 + 27</td>
</tr>
<tr>
<td>4</td>
<td nowrap="nowrap">4-demicubes = 4-orthoplexes</td>
<td>270</td>
</tr>
<tr>
<td>4</td>
<td>4-simplexes</td>
<td>432</td>
</tr>
<tr>
<td>3</td>
<td>3-simplexes = 3-demicubes = tetrahedra</td>
<td nowrap="nowrap">2160 = 1080 + 1080</td>
</tr>
<tr>
<td>2</td>
<td>2-simplexes = triangles</td>
<td>2160</td>
</tr>
<tr>
<td>1</td>
<td>1-simplexes = edges</td>
<td>720</td>
</tr>
<tr>
<td>0</td>
<td>0-simplexes = vertices</td>
<td>72</td>
</tr>
</tbody></table></div>
    </content>
    <updated>2026-09-07T11:16:32Z</updated>
    <published>2026-09-06T09:29:33Z</published>
    <category scheme="https://johncarlosbaez.wordpress.com" term="mathematics"/>
    <author>
      <name>John Baez</name>
      <uri>http://math.ucr.edu/home/baez/</uri>
    </author>
    <source>
      <id>http://johncarlosbaez.wordpress.com/feed/atom/</id>
      <link href="https://johncarlosbaez.wordpress.com" rel="alternate" type="text/html"/>
      <link href="https://johncarlosbaez.wordpress.com/feed/atom/" rel="self" type="application/atom+xml"/>
      <link href="https://johncarlosbaez.wordpress.com/osd.xml" rel="search" title="Azimuth" type="application/opensearchdescription+xml"/>
      <link href="https://s1.wp.com/opensearch.xml" rel="search" title="WordPress.com" type="application/opensearchdescription+xml"/>
      <link href="https://johncarlosbaez.wordpress.com/?pushpress=hub" rel="hub" type="text/html"/>
      <title xml:lang="en">Azimuth</title>
      <updated>2026-09-07T11:16:32Z</updated>
    </source>
  </entry>

  <entry xml:lang="en">
    <id>http://quomodocumque.wordpress.com/?p=8848</id>
    <link href="https://quomodocumque.wordpress.com/2026/09/06/dont-be-too-sure-dramatis-personae/" rel="alternate" type="text/html"/>
    <title>Don’t Be Too Sure dramatis personae</title>
    <summary>I’m well underway on revising Don’t Be Too Sure, which I finished a first draft of right before surgery. A lot of people make appearances in this book, most of all William James and John von Neumann, who became the two main characters despite not being in my original plans for the book at all. […]</summary>
    <content type="xhtml"><div xmlns="http://www.w3.org/1999/xhtml"><p class="wp-block-paragraph">I’m well underway on revising <em>Don’t Be Too Sure</em>, which I finished a first draft of right before surgery. A lot of people make appearances in this book, most of all William James and John von Neumann, who became the two main characters despite not being in my original plans for the book at all. Some other people: Felix Hausdorff, Alfred Kroeber and his daughter Ursula Kroeber Le Guin, John Keats, Sheila Heti, Katharine Briggs and her daughter Isabel Briggs Myers, Jakob Bernoulli, Elbert Hubbard, Anna Kiesenhofer, Grace Hopper, Thomas Jefferson, Caroline Hoxby, David Hilbert, Michel Adanson… well, there are a lot of people in it, who do a lot of things.</p></div>
    </content>
    <updated>2026-09-06T19:01:21Z</updated>
    <published>2026-09-06T19:01:21Z</published>
    <category term="books"/>
    <category term="writing"/>
    <category term="don't be too sure"/>
    <author>
      <name>JSE</name>
    </author>
    <source>
      <id>https://quomodocumque.wordpress.com</id>
      <logo>https://s2.wp.com/i/webclip.png</logo>
      <link href="https://quomodocumque.wordpress.com/feed/" rel="self" type="application/rss+xml"/>
      <link href="https://quomodocumque.wordpress.com" rel="alternate" type="text/html"/>
      <link href="https://quomodocumque.wordpress.com/osd.xml" rel="search" title="Quomodocumque" type="application/opensearchdescription+xml"/>
      <link href="https://quomodocumque.wordpress.com/?pushpress=hub" rel="hub" type="text/html"/>
      <subtitle>Math, Madison, food, the Orioles, books, my kids.</subtitle>
      <title>Quomodocumque</title>
      <updated>2026-09-08T04:58:11Z</updated>
    </source>
  </entry>

  <entry xml:lang="en">
    <id>http://johncarlosbaez.wordpress.com/?p=44329</id>
    <link href="https://johncarlosbaez.wordpress.com/2026/08/22/the-mantle/" rel="alternate" type="text/html"/>
    <link href="https://johncarlosbaez.wordpress.com/2026/08/22/the-mantle/#comments" rel="replies" type="text/html"/>
    <link href="https://johncarlosbaez.wordpress.com/2026/08/22/the-mantle/feed/atom/" rel="replies" type="application/atom+xml"/>
    <title xml:lang="en">The Mantle</title>
    <summary xml:lang="en">As we descend from the base of Earth’s crust through the mantle, the rock does not remain unchanged. Pressure and temperature rise inexorably, and the minerals that thrive at the surface are forced, step by step, into new and denser crystallographic arrangements. This is the story of those transformations. In this tale, I’ll act like […]</summary>
    <content type="xhtml" xml:lang="en"><div xmlns="http://www.w3.org/1999/xhtml"><p>As we descend from the base of Earth’s crust through the mantle, the rock does not remain unchanged.  Pressure and temperature rise inexorably, and the minerals that thrive at the surface are forced, step by step, into new and denser crystallographic arrangements.  This is the story of those transformations.</p>
<p>In this tale, I’ll act like I know a bit about minerals.  I actually don’t: there are a bewildering variety, and I can never remember them.  So don’t worry: when you come across a jargon-filled patch of prose, just power through it.  You might learn a little… or you can just ignore it.   The overall point here is that the Earth is made of beautiful crystalline structures that change character in complex ways as we descend.</p>
<h3> The Mohorovičić discontinuity </h3>
<p>Our story begins at the boundary where Earth’s crust, rich in feldspar and quartz, gives way to the denser mantle beneath.  We see this boundary through its effect on seismic waves, and it’s called the <b><a href="https://en.wikipedia.org/wiki/Mohorovi%C4%8Di%C4%87_discontinuity">Mohorovičić discontinuity</a></b> or “Moho”.  The Moho does not lie at one fixed depth: it’s 5–10 kilometers below the seafloor, but 30–50 kilometers below most continents, and as much as 70–80 below young mountain belts like the Himalayas.</p>
<p>The mantle just below the Moho mainly consists of a rock called <b><a href="https://en.wikipedia.org/wiki/Peridotite">peridotite</a></b>, which is made mostly of olivine and pyroxene, with smaller amounts of garnet (or, at shallower depths, spinel).  Peridotite has a delicious coarse green appearance:</p>
<div align="center"><a href="https://commons.wikimedia.org/wiki/File:Peridotite_mantle_xenoliths_in_phonotephrite_(Peridot_Mesa_Flow,_Middle_Pleistocene,_580_ka;_Peridot_Mesa,_San_Carlos_Volcanic_Field,_Arizona,_USA)_28_(cropped)).jpg"><br/>
<img src="https://i0.wp.com/math.ucr.edu/home/baez/chemical/peridotite.jpg" width="400"/><br/>
</a>
</div>
<p>More precisely, this is what peridotite looks like up here.  But when geochemists talk about the bulk composition of the upper mantle, they often use an idealized model called <b><a href="https://en.wikipedia.org/wiki/Pyrolite">pyrolite</a></b>—not a rock you can pick up, but a hypothetical recipe Ted Ringwood proposed in the 1960s for the primitive upper mantle.</p>
<p>Why?   Since the Earth has had a convecting mantle, solid mantle rock wells up in places.  As it does, the pressure drops, and a bit of it melts: the minerals with lower melting points.   This melt flows <i>upward</i>.  It’s called <b><a href="https://en.wikipedia.org/wiki/Basalt">basalt</a></b>.   It builds the Earth’s crust.  But it leaves a residue behind, made of minerals with higher melting points.</p>
<p>In Ringwood’s theory, which for expository purposes I’ll assume is true, pyrolite is what mantle rock is like <i>before</i> any partial melting depletes it of basaltic ingredients.  The name is a portmanteau of pyroxene and olivine, the two dominant minerals.  Pyrolite is about 60% olivine; the remaining 40% is mostly pyroxenes plus garnet.</p>
<p>• A <b><a href="https://en.wikipedia.org/wiki/Pyroxene">pyroxene</a></b> is a mineral built from single, unbranched chains of corner-sharing SiO₄ tetrahedra, with metal cations—chiefly Mg, Fe, and Ca—linking the chains together. The general formula is XY(Si,Al)₂O₆, where X and Y are those cations.</p>
<div align="center"><a href="https://commons.wikimedia.org/wiki/File:Diopside-172005.jpg"><img src="https://i0.wp.com/math.ucr.edu/home/baez/chemical/diopside.jpg" width="250"/><br/>
</a>
</div>
<p>• <b><a href="https://en.wikipedia.org/wiki/Olivine">Olivine</a></b> is a green silicate, (Mg,Fe)₂SiO₄:</p>
<div align="center"><a href="https://commons.wikimedia.org/wiki/File:Olivine-gem7-10a.jpg"><img src="https://i0.wp.com/math.ucr.edu/home/baez/chemical/olivine.jpg" width="250"/><br/>
</a>
</div>
<p>Its crystal structure in the upper mantle is an orthorhombic arrangement of isolated SiO₄ tetrahedra knit together by magnesium and iron in octahedral sites.  It’s called the α-phase because we’ll see some more compressed phases as we descend.</p>
<p>• A <b><a href="https://en.wikipedia.org/wiki/Garnet">garnet</a></b> is built from separate SiO₄ tetrahedra held together by cations, but assembled into a dense, hard, characteristically cubic-symmetry crystal. There are different kinds of garnet, but the general formula is X₃Y₂(SiO₄)₃: three divalent X cations, two trivalent Y cations, and three isolated silica tetrahedra.  The mantle’s garnet is largely <b><a href="https://en.wikipedia.org/wiki/Pyrope">pyrope</a></b>, Mg₃Al₂(SiO₄)₃.</p>
<div align="center"><a href="https://www.gemsociety.org/article/pyrope-garnet/"><img src="https://i0.wp.com/math.ucr.edu/home/baez/chemical/garnet_pyrope.jpg" width="250"/><br/>
</a>
</div>
<p>As we descend, the pyroxenes and garnet gradually dissolve into each other, producing a new high-pressure mineral called <b><a href="https://en.wikipedia.org/wiki/Majorite">majorite</a></b>.  Here’s a rare sample from a meteorite fall in Canada:</p>
<div align="center"><a href="https://commons.wikimedia.org/wiki/File:Majorite.jpg"><img src="https://i0.wp.com/math.ucr.edu/home/baez/chemical/majorite.jpg" width="250"/><br/>
</a>
</div>
<p>So even before the dramatic change 410 kilometers down, the rock is no longer the simple olivine-pyroxene-garnet assemblage we had further up.</p>
<h3> The 410-kilometer discontinuity </h3>
<p>Roughly 410 kilometers down, the pressure reaches about 13,000 atmospheres and the temperature hovers around 1,400°C.  Olivine can no longer hold its familiar shape. It transforms to its β form: <b><a href="https://en.wikipedia.org/wiki/Wadsleyite">wadsleyite</a></b>, a mineral with the same chemical formula but a fundamentally different atomic arrangement.  Instead of isolated SiO₄ tetrahedra, wadsleyite contains paired Si₂O₇ groups, and the oxygens pack more densely.  The density jump is sharp enough to be detected globally by seismologists as a reflector of earthquake waves.</p>
<p>Wadsleyite has a remarkable property: it can hold several weight percent of water locked within its crystal structure. The transition zone may thus contain more water than all the oceans combined!  However, very little wadsleyite has been seen on the Earth’s surface.  Here’s a bit from that same meteor fall in Canada:</p>
<div align="center"><a href="https://commons.wikimedia.org/wiki/File:Hydrous_Fe-bearing_Wadsleyite.jpg"><img src="https://i0.wp.com/math.ucr.edu/home/baez/chemical/wadsleyite.jpg" width="200"/><br/>
</a>
</div>
<h3> The 520-kilometer discontinuity </h3>
<p>Descend further, to around 520 kilometers, and the temperature goes up only a little, to roughly 1500–1600°C, since convection here is strong.  The pressure goes up to about 175,000 atmospheres.  At this point wadsleyite transforms into the γ form of olivine: <b><a href="https://en.wikipedia.org/wiki/Ringwoodite">ringwoodite</a></b>.  This is denser, still chemically Mg₂SiO₄, but now with cations packed into tetrahedral and octahedral holes in a close-packed oxygen framework—the most efficient packing geometry that nature offers for this composition:</p>
<div align="center"><a href="https://home.hiroshima-u.ac.jp/kawazoe/html/Kawazoe03-Crystal-EN.html"/><a href="https://johncarlosbaez.wordpress.com/2026/08/22/the-mantle/"><img src="https://i0.wp.com/math.ucr.edu/home/baez/chemical/ringwoodite_crystal.jpg" width="200"/><br/>
</a>
</div>
<p>Ringwoodite is named for the great Australian geochemist Ted Ringwood, who studied these transitions.  Here’s an artificially manufactured sample:</p>
<div align="center"><a href="https://commons.wikimedia.org/wiki/File:BlueRingwoodite.jpg"><img src="https://i0.wp.com/math.ucr.edu/home/baez/chemical/ringwoodite_sample.jpg" width="150"/><br/>
</a>
</div>
<p>For a long time the mineral’s existence in the mantle was purely hypothetical.  But in 2014, a tiny grain was discovered as an inclusion inside a diamond brought up from the deep mantle by an eruption, providing the first direct proof of its existence in Earth’s interior.</p>
<h3> The 660-kilometer discontinuity</h3>
<p>At a depth of 660 kilometers and a pressure of roughly 230,000 atmospheres, the most dramatic phase transition of all occurs.  Ringwoodite does not merely rearrange into a still more dense form!  Instead, it decomposes into two entirely new minerals: <b><a href="https://en.wikipedia.org/wiki/Silicate_perovskite">bridgmanite</a></b> (MgSiO₃) and <b><a href="https://en.wikipedia.org/wiki/Ferropericlase">ferropericlase</a></b> (MgO).  The majorite garnet also decomposes, yielding <b><a href="https://en.wikipedia.org/wiki/Davemaoite">davemaoite</a></b> (CaSiO₃), which is stable through the rest of the lower mantle:</p>
<div align="center">
<a href="https://commons.wikimedia.org/wiki/File:Structure_of_Davemaoite.png"><br/>
<img src="https://math.ucr.edu/home/baez/chemical/davemaoite.png" width="300"/><br/>
</a>
</div>
<p>The 660-kilometer discontinuity is sharp, globally consistent, and marks the conventional boundary between the upper and lower mantle.   One reason it’s important is that enormous slabs of colder, denser rock sink through the upper mantle until they hit this discontinuity, where the phase change between ringwoodite and bridgmanite creates a kind of barrier.</p>
<p>These slabs are 30–100 kilometers thick and hundreds to a thousand kilometers across!  Some punch straight through into the lower mantle and keep sinking.  But many flatten out when they hit the barrier, sometimes lying there and piling up for tens of millions of years.  You can see this in seismic images beneath Japan and the Marianas.   Numerical models suggest that they pile up until they overwhelm the barrier and flush down in a comparatively sudden avalanche—lasting mere millions of years.</p>
<h3> The lower mantle </h3>
<p>This is the realm of bridgmanite, probably the most abundant mineral in the Earth.  Bridgmanite is a beautifully symmetric cage of corner-sharing SiO₆ octahedra, with Mg tucked into the large cavities between them.  It accommodates enormous pressure because there is very little void space left to compress.</p>
<div align="center"><a href="https://photon-science.desy.de/news__events/news__highlights/archive/archive_of_2016/scientists_x_ray_the_most_abundant_mineral_of_earth/index_eng.html"><br/>
<img src="https://math.ucr.edu/home/baez/chemical/bridgmanite.jpg" width="300"/><br/>
</a>
</div>
<p>It is a striking fact that while bridgmanite is the most abundant mineral on the planet, it went unnamed until 2014, simply because no natural hand-sized specimen had ever been recovered. Everything we know about it comes either from high-pressure laboratory synthesis, from microscopic grains in shocked meteorites, or from the indirect testimony of earthquake waves that have traveled through 2,000 kilometers of it.</p>
<p>For over 2,000 kilometers of descent, from 660 to roughly 2,700 kilometers down, bridgmanite and its companion ferropericlase reign without significant further phase change.  Seismic velocities increase steadily, but there are no dramatic discontinuities.</p>
<h3> The D″ discontinuity </h3>
<p>As we approach the core-mantle boundary—at depths around 2,700 kilometers, pressures of approximately 120,000–125,000 atmospheres, and temperatures of 2,200–3,7000°C—even bridgmanite yields. It transforms into the post-perovskite phase.  <b><a href="https://en.wikipedia.org/wiki/Post-perovskite">Post-perovskite</a></b> is a layered, sheet-like structure of SiO₆ octahedra, quite different from bridgmanite’s three-dimensional cage, making it potentially much weaker and more prone to flow.</p>
<p>This transition is believed to be responsible for the seismic D″ discontinuity observed at 2,900 kilometers depth. The D″ layer is a highly dynamic region, likely the site of storage of subducted materials and the source of deep mantle plumes.</p>
<h3> A summary of the descent </h3>
<p>The table below summarizes the major transitions:</p>
<table>
<thead>
<tr>
<th>Depth (km)        </th>
<th>Minerals</th>
</tr>
</thead>
<tbody>
<tr>
<td>0–410</td>
<td>olivine (α) + pyroxenes + garnet</td>
</tr>
<tr>
<td>410</td>
<td>→ wadsleyite (β)</td>
</tr>
<tr>
<td>520</td>
<td>→ ringwoodite (γ)</td>
</tr>
<tr>
<td>660</td>
<td>→ bridgmanite + ferropericlase + davemaoite</td>
</tr>
<tr>
<td>660–2700</td>
<td>bridgmanite dominates</td>
</tr>
<tr>
<td>~2700</td>
<td>→ post-perovskite</td>
</tr>
<tr>
<td>2900</td>
<td> → liquid iron core</td>
</tr>
</tbody>
</table>
<p>The interesting thing about this story is that it was told first by seismology—the sharp jumps in wave speeds at 410 and 660 kilometers were detected long before geologists could reproduce those pressures in the lab—and only later checked by diamond-anvil cell experiments squeezing tiny mineral samples to millions of atmospheres. The rocks never rise to the surface to tell their story directly, so much of the tale above is just <i>theory</i>.</p>
<h3> Which minerals are there the most of? </h3>
<p>We can estimate how much of the Earth is made of wadsleyite, ringwoodite, and bridgmanite using known shell volumes, estimated densities, and mineral proportions from the pyrolite model.</p>
<p><b>Step 1: Earth’s mass budget by layer</b></p>
<p>The Earth’s total mass is M<sub>⊕</sub> ≈ 5.972 × 10<sup>24</sup> kg. The mass budget by layer is approximately:</p>
<p>•    Crust: ~0.4% of Earth’s mass<br/>
•    Upper mantle + transition zone (35–660 km): ~18% of Earth’s mass<br/>
•    Lower mantle (660–2,891 km): ~49% of Earth’s mass<br/>
•    Core (outer + inner): ~32.5% of Earth’s mass</p>
<p><b>Step 2: The transition zone (410–660 km)</b></p>
<p>Using PREM densities averaging ~3,760 kg/m<sup>3</sup> across the transition zone, and the volume of each spherical shell:</p>
<p>Wadsleyite zone (410–520 km):<br/>
Shell volume ≈ 4.8 × 10<sup>19</sup> m<sup>3</sup><br/>
Shell mass ≈ 1.76 × 10<sup>23</sup> kg<br/>
Fraction of Earth’s mass ≈ 2.9%</p>
<p>Ringwoodite zone (520–660 km):<br/>
Shell volume ≈ 5.9 × 10<sup>19</sup> m<sup>3</sup><br/>
Shell mass ≈ 2.24 × 10<sup>23</sup> kg<br/>
Fraction of Earth’s mass ≈ 3.8%</p>
<p>In the pyrolite model of mantle composition, forms of olivine (wadsleyite and ringwoodite) make up roughly 60% of the transition zone by mass, with the remaining ~40% being majoritic garnet. Applying this correction:</p>
<p>Wadsleyite: 0.60 × 2.9% ≈ 1.8% of Earth’s mass<br/>
Ringwoodite: 0.60 × 3.8% ≈ 2.3% of Earth’s mass</p>
<p>These estimates carry roughly 20–30% uncertainty, mainly from the assumed 60% olivine proportion in the transition zone, which varies with local temperature and bulk composition.</p>
<p><b>Step 3: Bridgmanite (660–2,700 km)</b></p>
<p>The lower mantle holds about 49% of Earth’s mass—it is an enormous shell!  Bridgmanite constitutes approximately 80% of the lower mantle mineral assemblage (by mass) in the pyrolite model:</p>
<p>0.80 × 49% ≈ 39% of Earth’s mass</p>
<p>This is consistent with the well-cited literature figure that bridgmanite comprises approximately 38% of the planet’s mass—making it the single most abundant mineral in the Earth by a vast margin.</p>
<table>
<thead>
<tr>
<th>Mineral</th>
<th>Depth (km)</th>
<th>Fraction of Earth’s Mass</th>
</tr>
</thead>
<tbody>
<tr>
<td>Wadsleyite</td>
<td>410–520</td>
<td>~1.8%</td>
</tr>
<tr>
<td>Ringwoodite</td>
<td>520–660</td>
<td>~2.3%</td>
</tr>
<tr>
<td>Bridgmanite</td>
<td>660–2,700</td>
<td>~38–39%</td>
</tr>
<tr>
<td>All three combined</td>
<td>410–2,700</td>
<td>~42%</td>
</tr>
</tbody>
</table>
<p>Thus, these three minerals—all members of the same Mg₂SiO₄/MgSiO₃ chemical lineage—together constitute roughly 42% of Earth’s entire mass. All other named minerals on Earth, including quartz, feldspar, calcite, diamond, and the roughly 3,800 others known to mineralogists, divide up the remaining scraps.</p></div>
    </content>
    <updated>2026-09-06T14:32:05Z</updated>
    <published>2026-08-22T22:02:05Z</published>
    <category scheme="https://johncarlosbaez.wordpress.com" term="chemistry"/>
    <category scheme="https://johncarlosbaez.wordpress.com" term="geology"/>
    <author>
      <name>John Baez</name>
      <uri>http://math.ucr.edu/home/baez/</uri>
    </author>
    <source>
      <id>http://johncarlosbaez.wordpress.com/feed/atom/</id>
      <link href="https://johncarlosbaez.wordpress.com" rel="alternate" type="text/html"/>
      <link href="https://johncarlosbaez.wordpress.com/feed/atom/" rel="self" type="application/atom+xml"/>
      <link href="https://johncarlosbaez.wordpress.com/osd.xml" rel="search" title="Azimuth" type="application/opensearchdescription+xml"/>
      <link href="https://s1.wp.com/opensearch.xml" rel="search" title="WordPress.com" type="application/opensearchdescription+xml"/>
      <link href="https://johncarlosbaez.wordpress.com/?pushpress=hub" rel="hub" type="text/html"/>
      <title xml:lang="en">Azimuth</title>
      <updated>2026-09-07T11:16:32Z</updated>
    </source>
  </entry>

  <entry xml:lang="en">
    <id>http://quantumfrontiers.com/?p=18162</id>
    <link href="https://quantumfrontiers.com/2026/09/06/how-can-objects-interact-without-touching/" rel="alternate" type="text/html"/>
    <link href="https://quantumfrontiers.com/2026/09/06/how-can-objects-interact-without-touching/#comments" rel="replies" type="text/html"/>
    <link href="https://quantumfrontiers.com/2026/09/06/how-can-objects-interact-without-touching/feed/atom/" rel="replies" type="application/atom+xml"/>
    <title xml:lang="en">How can objects interact without touching?</title>
    <summary type="xhtml" xml:lang="en"><div xmlns="http://www.w3.org/1999/xhtml">Rethinking the electric field Have you ever wondered what an electric field actually is?  The electric field is the foundation of most technologies that we rely on every day. From power grids and electronic devices to radio communication and the … <a href="https://quantumfrontiers.com/2026/09/06/how-can-objects-interact-without-touching/">Continue reading <span class="meta-nav">→</span></a></div>
    </summary>
    <content type="xhtml" xml:lang="en"><div xmlns="http://www.w3.org/1999/xhtml"><h1 class="wp-block-heading"><em><strong>Rethinking the electric field</strong></em></h1>



<p class="wp-block-paragraph">Have you ever wondered what an electric field actually is? </p>



<p class="wp-block-paragraph">The electric field is the foundation of most technologies that we rely on every day. From power grids and electronic devices to radio communication and the internet, the electric field is extremely relevant to our daily lives. However, despite its importance, I have always felt that the common explanations of the electric field leave something unanswered. </p>



<p class="wp-block-paragraph">Most textbooks define the electric field as a property of space or a physical entity surrounding electric charges, or with the equation of force per unit charge. These definitions help us understand what the electric field does and its effect on electrically charged particles, but they do not fully answer what an electric field actually is and how it influences charges. Thus, I started thinking about the question: what allows charges to influence each other without touching?</p>



<p class="wp-block-paragraph">This question led me down a path that began with a simple observation in everyday life, and it eventually pointed toward much deeper ideas in modern physics.</p>



<h2 class="wp-block-heading"><strong>Objects Influenced by Their Surroundings</strong></h2>



<p class="wp-block-paragraph">Before talking about electric fields, let’s consider a more basic question: Does it seem reasonable that objects can be influenced by their surroundings? </p>



<p class="wp-block-paragraph">Most people would answer yes. We have all seen examples of objects responding to something else nearby, such as the Earth orbiting the Sun, a compass needle reacting to a magnet, and our phones responding to signals from a WiFi router. But what is the mechanism behind these interactions? </p>



<p class="wp-block-paragraph">A simple physical phenomenon that we can look at is a balloon rubbed on a piece of clothing that can pick up strands of our hair. Many of us have seen this demonstration in kindergarten or first grade of elementary school. This might seem completely ordinary, but if we pause and think about it, something strange is happening – the balloon is influencing the hair without touching it. </p>



<p class="wp-block-paragraph">How is that possible? One answer is simply that the balloon “pulls” on the hair, but this raises more questions. How does the balloon reach the hair? What is happening in the space between them? These questions suggest that something is missing from the picture of objects pulling on each other directly through contact.</p>


<div class="wp-block-image">
<figure class="aligncenter size-large is-resized"><a href="https://quantumfrontiers.com/wp-content/uploads/2026/08/image.png"><img alt="" class="wp-image-18165" height="466" src="https://quantumfrontiers.com/wp-content/uploads/2026/08/image.png?w=828" style="width: 474px; height: auto;" width="828"/></a><figcaption class="wp-element-caption"><em>Image of cat fur sticking to a balloon. Source: <a href="https://science.howstuffworks.com/why-do-balloons-stick-to-hair.htm" rel="nofollow">https://science.howstuffworks.com/why-do-balloons-stick-to-hair.htm</a></em></figcaption></figure>
</div>


<p class="wp-block-paragraph">To put this in the context of physics, we might all have learned that “like charges repel, and opposite charges attract”. We might have solved equations on how fast charges would move away from or toward each other. We were always told to just accept it because these motions result from the electric field. But why do these observations happen? What is happening between the charges?</p>


<div class="wp-block-image">
<figure class="aligncenter size-large is-resized"><a href="https://quantumfrontiers.com/wp-content/uploads/2026/08/image-1.png"><img alt="" class="wp-image-18167" height="637" src="https://quantumfrontiers.com/wp-content/uploads/2026/08/image-1.png?w=1000" style="width: 384px; height: auto;" width="1000"/></a><figcaption class="wp-element-caption"><em>Interactions between charges. Source: <a href="https://writescience.wordpress.com/2014/05/08/chasing-starlight-1-sketching-with-feynman/" rel="nofollow">https://writescience.wordpress.com/2014/05/08/chasing-starlight-1-sketching-with-feynman/</a></em></figcaption></figure>
</div>


<p class="wp-block-paragraph">Historically, physics encountered the same problem. If one object can influence another at a distance, it is natural to ask what is happening in the space between them. One guiding principle that physicists often use is the concept of locality. Locality is the idea that an object can only be directly influenced by its immediate surroundings. Thus, an influence should not simply leap across space from one object to another, and changes should propagate through intermediate regions step by step. </p>



<p class="wp-block-paragraph">At first glance, locality seems reasonable because it matches many of our everyday experiences. If I push a book across a table, my hand influences the book through direct contact. The influence does not appear to jump instantaneously across the table. </p>



<p class="wp-block-paragraph">However, locality creates a tension when we return to the scenario of the balloon pulling on strands of hair. If locality is true, something must be happening in the space between the balloon and the hair. But from a standard electromagnetic perspective, the space between the balloon and the hair is empty. Therefore, we have encountered a contradiction: if what is between the balloon and the hair is empty space, then what is responsible for transmitting the influence? Neither the usual electromagnetism nor locality tells us the answer to these questions.</p>



<h2 class="wp-block-heading"><strong>The Classical Electric Field</strong></h2>



<p class="wp-block-paragraph">In the usual electromagnetic picture, the answer to the puzzle is the electric field. Rather than allowing charges to influence one another directly across space, the theory assigns an electric field to the space surrounding charges. The field acts as the intermediary through which influence is transmitted. </p>



<p class="wp-block-paragraph">A useful way to think about the electric field is that it assigns information to every point in space. If we imagine a charged particle that is placed at a particular location, the electric field tells us how that particle would move. This charged particle is what physicists call a test charge. By observing how the test charge behaves, we can infer information about the electric field at that location. </p>



<p class="wp-block-paragraph">This could seem like a satisfying answer as the electric field tells us how influence is transmitted, but it does not tell us what kind of thing is doing the transmission. Is the electric field a physical substance? Is it a mathematical tool? Or is it something else? </p>



<p class="wp-block-paragraph">It might be easy to fall back on the idea that the electric field ultimately works through tiny particles physically touching one another. After all, contact interactions are among the most familiar interactions that we experience. </p>



<p class="wp-block-paragraph">But physics challenges this intuition as well. It is surprisingly difficult to define what it means for two objects to “touch”. We usually think of the balloon attracting hair as an example of action at a distance, whereas pressing a hand on a table feels like direct physical contact. However, at the microscopic level, the two situations are fundamentally similar. If we could zoom in on our fingertip and the table with a microscope, we would find that the atoms in our skin never make contact with the atoms in the table. This is because of the repulsion between the electron clouds surrounding the atoms, which prevents the two atomic nuclei from overlapping. Say if we scale the atom in the table up to be the size of a marble, then the nearest atom in our fingertip would still be separated from it by a few centimeters. In the end, nothing is truly “touching” in the intuitive, physical sense. </p>



<p class="wp-block-paragraph">Thus, the idea of contact does not solve our problem. We are forced to ask the same question again: what is it that allows these interactions to occur? To answer that question, I turned to a different perspective of thinking about electric fields.</p>



<h2 class="wp-block-heading"><strong>The Electric Field as A Dynamical Structure</strong></h2>



<p class="wp-block-paragraph">From our intuition, it is natural to imagine the electric field as some invisible substance filling space. This is often the picture suggested by the common field line diagrams in physics textbooks, which make the field appear to flow outward or inward from charges, almost like a moving fluid. </p>



<p class="wp-block-paragraph">A useful analogy is the ocean. A boat floating on water can move because waves pass beneath it. The boat responds to changes in its surrounding waves rather than to some direct push from a distant object. Similarly, charged particles respond to changes in the electric field around them. We can then view the electric field as a dynamical structure that governs how the state of the world can evolve.</p>



<p class="wp-block-paragraph">However, the ocean analogy can only take us so far. Ocean waves are made of water molecules. Sound waves are made of vibrating air molecules. But what is the electric field made of? When light travels through empty space, it seems that there is no material medium at all. </p>



<p class="wp-block-paragraph">This brings us back to the mystery: if locality suggests that something must exist in the space between interacting objects, and if the electric field is not made of the ordinary matter that we understand, then what exactly is occupying the space? </p>



<p class="wp-block-paragraph">To answer this question, we have to rethink what we mean by “empty” space itself.</p>



<h2 class="wp-block-heading"><strong>Empty Space is Not Empty</strong></h2>



<p class="wp-block-paragraph">Conventionally, we have always imagined empty space as exactly what the name suggests—empty. Just like if all the particles were removed and nothing was remaining. But modern physics suggests a very different picture. </p>



<p class="wp-block-paragraph">In quantum field theory, what we call “empty space” is not truly empty. Empty space is filled with underlying quantum fields that permeate all of space and time, even in the absence of particles. Even when the surface of the ocean looks perfectly still, the water is still there. The ocean is not defined only by visible waves, but by the underlying medium that can support waves in the first place. The waves are patterns of motion of the ocean itself, just like the electric field. These fields are part of the fundamental structure of the universe from which physical phenomena emerge. Quantum field theory suggests that particles are not independent objects moving through an otherwise empty space. Rather, they are localized patterns or excitations of underlying fields that already exist throughout the universe. </p>



<p class="wp-block-paragraph">From this perspective, the electric field is not something that is added to empty space. It is part of the fundamental dynamical structure of space itself.</p>



<h2 class="wp-block-heading">Conclusion</h2>



<p class="wp-block-paragraph">At the beginning, I asked a simple question: how can objects influence each other without touching? The straightforward answer is the electric field. Charges create electric fields, and those fields determine how other charges move. But what is an electric field? Is it an invisible material filling space between objects, or is it a dynamical structure that governs how physical systems in the world evolve? </p>



<p class="wp-block-paragraph">From the perspective of quantum field theory, quantum fields permeate all of space and time. Particles are not separate objects moving through an empty space, but are excitations of these underlying fields; electric fields are not secondary matter surrounding charged particles, but are particular configurations of the underlying electromagnetic quantum fields. What we observe as the motion of a charged particle is the result of its interaction with the electromagnetic field, whose local state determines how the particle evolves. </p>



<p class="wp-block-paragraph">In the end, our original question may not have a single definitive answer. But asking it revealed a shift in perspective, and physics has repeatedly shown that every explanation opens the door to an even more fundamental question. Stopping at this step, a new mystery emerges: what are these underlying quantum fields themselves? What are they made of, and where do they arise from? </p>



<p class="wp-block-paragraph"/></div>
    </content>
    <updated>2026-09-06T13:17:26Z</updated>
    <published>2026-09-06T13:17:26Z</published>
    <category scheme="https://quantumfrontiers.com" term="Uncategorized"/>
    <author>
      <name>adelynnt</name>
      <uri>http://ibenglitadelynn.wordpress.com</uri>
    </author>
    <source>
      <id>http://quantumfrontiers.com/feed/atom/</id>
      <link href="https://quantumfrontiers.com" rel="alternate" type="text/html"/>
      <link href="https://quantumfrontiers.com/feed/atom/" rel="self" type="application/atom+xml"/>
      <link href="https://quantumfrontiers.com/osd.xml" rel="search" title="Quantum Frontiers" type="application/opensearchdescription+xml"/>
      <link href="https://s1.wp.com/opensearch.xml" rel="search" title="WordPress.com" type="application/opensearchdescription+xml"/>
      <link href="https://quantumfrontiers.com/?pushpress=hub" rel="hub" type="text/html"/>
      <subtitle xml:lang="en">A blog by the Institute for Quantum Information and Matter @ Caltech</subtitle>
      <title xml:lang="en">Quantum Frontiers</title>
      <updated>2026-09-06T13:17:26Z</updated>
    </source>
  </entry>

  <entry>
    <id>tag:blogger.com,1999:blog-13869903.post-4262303260361526577</id>
    <link href="https://nanoscale.blogspot.com/feeds/4262303260361526577/comments/default" rel="replies" title="Post Comments" type="application/atom+xml"/>
    <link href="https://www.blogger.com/comment/fullpage/post/13869903/4262303260361526577" rel="replies" title="0 Comments" type="text/html"/>
    <link href="https://www.blogger.com/feeds/13869903/posts/default/4262303260361526577" rel="edit" type="application/atom+xml"/>
    <link href="https://www.blogger.com/feeds/13869903/posts/default/4262303260361526577" rel="self" type="application/atom+xml"/>
    <link href="https://nanoscale.blogspot.com/2026/09/nsf-spending-and-end-of-fiscal-year.html" rel="alternate" title="NSF, spending, and the end of the fiscal year" type="text/html"/>
    <title>NSF, spending, and the end of the fiscal year</title>
    <content type="xhtml"><div xmlns="http://www.w3.org/1999/xhtml"><p/><div class="separator" style="clear: both; text-align: center;"><a href="https://blogger.googleusercontent.com/img/a/AVvXsEikZnbVvTg16ZhqcaEeCyT6kmcWqeuScL1mGehCIHKhc1NOYVRZY3gsIehEx-4rqTW9ZW-bAHP7v5wOg4-VgpiVKYvtc5ghXBBz_AQJnUswHRzglJljhkicBruLPAsrU5uzoRyv4-JSO3857pPR_oQQEkOtVjWgeyCsdDIBe89WKsI1xmVIo8ofHg" style="clear: right; float: right; margin-bottom: 1em; margin-left: 1em;"><img alt="" height="230" src="https://blogger.googleusercontent.com/img/a/AVvXsEikZnbVvTg16ZhqcaEeCyT6kmcWqeuScL1mGehCIHKhc1NOYVRZY3gsIehEx-4rqTW9ZW-bAHP7v5wOg4-VgpiVKYvtc5ghXBBz_AQJnUswHRzglJljhkicBruLPAsrU5uzoRyv4-JSO3857pPR_oQQEkOtVjWgeyCsdDIBe89WKsI1xmVIo8ofHg" width="320"/></a></div>We are less than one month away from the end of the federal fiscal year, and traditionally there are internal deadlines for agencies to allocate their final spending by around September 9. Right now, <a href="https://grantwitness.org/nsf/analyses/agency-pulse-nsf-grants" target="_blank">the NSF is on track to issue</a> about 4000 fewer (!!) awards in FY26 than it did annually back in FY21-FY24, and 2000 fewer than it did in the incredibly tumultuous FY25 (with its government shutdowns and mass cutbacks in agency personnel). This is dire, if like me you are a supporter of the agency and its vital role in the US research ecosystem.  <br/><p/><p/><div class="separator" style="clear: both; text-align: center;"><a href="https://blogger.googleusercontent.com/img/a/AVvXsEiE2bWEqDElxdONWsgG17MahKcqgc4-eBibRLDPQ68MwWkyr0IhCCbMjA_b4pUMHO1qnyL3lhjEUAcXed4DUj-TKawqQwafwQW3XG9Vua3Fr3224EOmx8BRlsC_VCd9-u2DV8BWwOqzrPGS-YJv4lME7sPixusUstATPDTGl82CW_4TBUFyzDO0Vw" style="clear: right; float: right; margin-bottom: 1em; margin-left: 1em;"><img alt="" height="229" src="https://blogger.googleusercontent.com/img/a/AVvXsEiE2bWEqDElxdONWsgG17MahKcqgc4-eBibRLDPQ68MwWkyr0IhCCbMjA_b4pUMHO1qnyL3lhjEUAcXed4DUj-TKawqQwafwQW3XG9Vua3Fr3224EOmx8BRlsC_VCd9-u2DV8BWwOqzrPGS-YJv4lME7sPixusUstATPDTGl82CW_4TBUFyzDO0Vw" width="320"/></a></div>Perhaps even more distressing, the NSF is on track to underspend its FY26 budget appropriation (congressionally approved, presidentially signed) by between $1.25-1.5B, or 15-18%. This is essentially unprecedented - in the past, the NSF has always spent ~ 99% of its appropriation in a given fiscal year. Some large portion of this is from the mid-FY clawbacks that were reported in <i><a href="https://www.science.org/content/article/exclusive-nsf-slashes-research-programs-support-new-tech-initiative-insiders-say" target="_blank">Science</a></i> and <i><a href="https://www.nature.com/articles/d41586-026-02574-6" target="_blank">Nature</a></i>, supposedly squirreled away to support an as-yet unannounced OSTP "grand challenges" program.  <br/><p/><p>While technically the funds don't go away at the end of September, this kind of underspending raises the possibility of a <a href="https://en.wikipedia.org/wiki/Rescission_bill#Pocket_rescissions" target="_blank">pocket rescission</a>. OMB and the executive branch have been pushing for massive cuts to the agency; Congress has disagreed. It sure looks like all the "see, don't worry, Congress didn't allow big cuts to the NSF" palliative statements don't hold up very well to scrutiny, if the majority party is content to just give up Article I power to the executive branch. </p><p>In this period of complete flood-the-zone craziness, the mainstream news media seemingly doesn't have the bandwidth or interest to report on this; they seem to have judged that it's too obscure, it doesn't play in Peoria, the public doesn't really care. This kind of disruption will have ripple effects that last for many years and affect US scientific and economic competitiveness, and it's happening without much notice.</p><p>This week's <a href="https://www.nature.com/articles/d41586-026-02799-5" target="_blank">news about an agreement between NIH and DOD</a> to <a href="https://democrats-appropriations.house.gov/news/press-releases/defense-officials-attempt-raid-nih-funds-cover-department-defense-activities" target="_blank">funnel NIH funds for infectious disease to DOD</a> (or, in the official statement, to work together on projects of mutual interest), is at least getting some public attention.  Agencies agreeing to pass around <a href="https://www.nytimes.com/2026/09/04/us/politics/pentagon-nih-biodefense-agreement.html" target="_blank">at minimum hundreds of millions of dollars</a> outside congressional oversight or what the appropriations acts say is another example of an <a href="https://constitutioncenter.org/the-constitution/articles/article-i" target="_blank">Article I</a> crisis, when the majority party basically hands over what are supposed to be congressional powers to executive branch.</p><p>(An additional sciencey blog post coming soon!)</p><p><br/></p></div>
    </content>
    <updated>2026-09-05T15:34:12Z</updated>
    <published>2026-09-05T15:34:12Z</published>
    <author>
      <name>Douglas Natelson</name>
      <email>noreply@blogger.com</email>
      <uri>http://www.blogger.com/profile/13340091255404229559</uri>
    </author>
    <source>
      <id>tag:blogger.com,1999:blog-13869903</id>
      <category term="concepts"/>
      <author>
        <name>Douglas Natelson</name>
        <email>noreply@blogger.com</email>
        <uri>http://www.blogger.com/profile/13340091255404229559</uri>
      </author>
      <link href="https://nanoscale.blogspot.com/feeds/posts/default" rel="http://schemas.google.com/g/2005#feed" type="application/atom+xml"/>
      <link href="https://www.blogger.com/feeds/13869903/posts/default?alt=atom" rel="self" type="application/atom+xml"/>
      <link href="https://nanoscale.blogspot.com/" rel="alternate" type="text/html"/>
      <link href="http://pubsubhubbub.appspot.com/" rel="hub" type="text/html"/>
      <link href="https://www.blogger.com/feeds/13869903/posts/default?alt=atom&amp;start-index=26&amp;max-results=25" rel="next" type="application/atom+xml"/>
      <subtitle>A blog about condensed matter and nanoscale physics.  Why should high energy and astro folks have all the fun?</subtitle>
      <title>nanoscale views</title>
      <updated>2026-09-07T18:05:56Z</updated>
    </source>
  </entry>

  <entry xml:lang="en">
    <id>http://4gravitons.com/?p=14870</id>
    <link href="https://4gravitons.com/2026/09/04/paying-the-truthseekers/" rel="alternate" type="text/html"/>
    <title>Paying the Truthseekers</title>
    <summary>Academics and journalists have a lot in common, at least in principle. Whether you’re a reporter or a professor, your job is to go out into the world and figure out the truth. You’re supposed to be careful, to check and correct for how you might be wrong. And at the end of the day […]</summary>
    <content type="xhtml"><div xmlns="http://www.w3.org/1999/xhtml"><p class="wp-block-paragraph">Academics and journalists have a lot in common, at least in principle.</p>



<p class="wp-block-paragraph">Whether you’re a reporter or a professor, your job is to go out into the world and figure out the truth. You’re supposed to be careful, to check and correct for how you might be wrong. And at the end of the day you’re supposed to communicate what you found.</p>



<p class="wp-block-paragraph">The differences mostly come in how you’re paid.</p>



<p class="wp-block-paragraph">You could imagine some sort of pure truthseeker, paid purely by how well they tell the truth. People would ask them to find out the truth about something, and pay them for the service. And the truthseekers with the best track record would get the most clients. But neither profession really works like this.</p>



<p class="wp-block-paragraph">Journalism comes closest. Once upon a time, people bought newspapers in order to be the first to know when something important happened. While there’s still a little bit of that going on (I guess this is what <a href="https://professional.bloomberg.com/products/bloomberg-terminal/">Bloomberg Terminals</a> are for?), it’s a lot less central because of the internet. Now, there are hundreds of ways to find out about things, from a multitude of news sites to social media. More and more, people expect to be able to get information for free. </p>



<p class="wp-block-paragraph">In that environment, the news has to compete not on the facts themselves, but on how it presents them. People pay for news that’s curated well to match their interests, or news that feels more respectable. And more than either of those, they pay for news that’s entertaining. So while truthseeking skills pay, writing skills often end up mattering more. In a sense, it’s why it’s possible for me to do journalism at all. I was trained in the academic truthseeking tradition, not the journalistic one. I got into journalism by impressing editors with my writing, not my ability to suss out the truth.</p>



<p class="wp-block-paragraph">That academic truthseeking tradition is quite different, in part because the rewards for it are much more indirect. Academics pay comes from two main sources: research grants, and student tuition. Students are mostly there to learn old facts, not new ones, so that source of money supports research only in so far that students believe that a successful researcher with time for research will also be a better teacher. </p>



<p class="wp-block-paragraph">Research grants, in principle, pay for truthseeking. But they’re typically paid by governments, which often don’t have a clear idea of what they’d like to learn, since the more practical questions are already being researched by private companies. So the decision gets delegated out to other academics, who have a vague shared sense of what’s worth knowing and what’s not. Accuracy should have an impact: that is, it should be easier to get grants if you’re better at finding the truth. But in practice, unless someone does so badly they trigger a scandal, academics don’t usually get things all that wrong. So grants are mostly based on other factors.</p>



<p class="wp-block-paragraph">Paying someone purely to deliver the truth, not to entertain or match a culture, seems tricky. You could imagine sci-fi scenarios. What if we could track the logic people used to make decisions, and demand payment if those decisions were based on facts we uncovered, like a journalist getting a percentage of every short made in response to bad news they dug up about a company? What if governments paid in proportion to how valuable academic ideas turned out to be, centuries after they were discovered, and modern-day academics sold shares in that future payout to fund themselves? What if <a href="https://polymarket.com/">prediction markets</a> something something?</p>



<p class="wp-block-paragraph">For the moment, academics and journalists are both in a weird middle space. They’re truthseekers, still, by culture and inclination and desire. But they’re paid for something else.</p></div>
    </content>
    <updated>2026-09-04T16:00:00Z</updated>
    <published>2026-09-04T16:00:00Z</published>
    <category term="Science Communication"/>
    <category term="academia"/>
    <category term="press"/>
    <author>
      <name>4gravitons</name>
    </author>
    <source>
      <id>https://4gravitons.com</id>
      <logo>https://s2.wp.com/i/webclip.png</logo>
      <link href="https://4gravitons.com/feed/" rel="self" type="application/rss+xml"/>
      <link href="https://4gravitons.com" rel="alternate" type="text/html"/>
      <link href="https://4gravitons.com/osd.xml" rel="search" title="4 gravitons" type="application/opensearchdescription+xml"/>
      <link href="https://4gravitons.com/?pushpress=hub" rel="hub" type="text/html"/>
      <subtitle>Stories about physics from someone who's been there</subtitle>
      <title>4 gravitons</title>
      <updated>2026-09-04T11:26:57Z</updated>
    </source>
  </entry>

  <entry xml:lang="en">
    <id>300086 at https://www.science20.com</id>
    <link href="https://www.science20.com/a_quantum_diaries_survivor/20260903/when_a_bump_gets_greedy_a_connection_i_had_missed_for_25_years" rel="alternate" type="text/html"/>
    <title xml:lang="en">When A Bump Gets Greedy: A Connection I Had Missed For 25 Years</title>
    <summary type="xhtml" xml:lang="en"><div xmlns="http://www.w3.org/1999/xhtml"><span class="field field--name-title field--type-string field--label-hidden">When A Bump Gets Greedy: A Connection I Had Missed For 25 Years</span>

            <div class="clearfix text-formatted field field--name-body field--type-text-with-summary field--label-hidden field__item"><p>Back in 2009 I wrote in this blog a rather technical post about something I had called the “greedy bump bias.” (GBB) The effect I referred to had emerged from a 2003 CDF study of mine, where I considered the extraction of small signals sitting on top of much larger backgrounds.That work went unpublished, but then I took revenge with the blog post...</p>
</div>
      <span class="field field--name-uid field--type-entity-reference field--label-hidden"><a class="username" href="https://www.science20.com/profile/tommaso_dorigo" title="View user profile.">Tommaso Dorigo</a></span>
<span class="field field--name-created field--type-created field--label-hidden"><time class="datetime" datetime="2026-09-03T09:15:26-04:00" title="Thursday, September 3, 2026 - 09:15">Thu, 09/03/2026 - 09:15</time>
</span>

  <div class="field field--name-field-blog-categories field--type-entity-reference field--label-inline clearfix">
    <div class="field__label">Categories</div>
              <div class="field__item"><a href="https://www.science20.com/physics" hreflang="en">Physics</a></div>
          </div></div>
    </summary>
    <updated>2026-09-03T13:15:26Z</updated>
    <published>2026-09-03T13:15:26Z</published>
    <author>
      <name>Tommaso Dorigo</name>
    </author>
    <source>
      <id>https://www.science20.com/</id>
      <link href="https://www.science20.com/" rel="alternate" type="text/html"/>
      <link href="https://www.science20.com/quantum_diaries_survivor/feed" rel="self" type="application/rss+xml"/>
      <title xml:lang="en">Articles by Tommaso Dorigo</title>
      <updated>2026-09-08T06:42:34Z</updated>
    </source>
  </entry>

  <entry xml:lang="en-US">
    <id>https://scottaaronson.blog/?p=10046</id>
    <link href="https://scottaaronson.blog/?p=10046" rel="alternate" type="text/html"/>
    <link href="https://scottaaronson.blog/?p=10046#comments" rel="replies" type="text/html"/>
    <link href="https://scottaaronson.blog/?feed=atom&amp;p=10046" rel="replies" type="application/atom+xml"/>
    <title xml:lang="en-US">LLMs and self-referentiality</title>
    <summary xml:lang="en-US">I woke up yesterday with the following thoughts, which are probably either obvious or dumb. A central thesis that many readers, including me, took from Douglas Hofstadter’s Gödel Escher Bach when young was that the secret of intelligence (and therefore, of AI) was going to have a lot to do with self-referentiality and “strange loops.” […]</summary>
    <content type="xhtml" xml:lang="en-US"><div xmlns="http://www.w3.org/1999/xhtml"><p class="wp-block-paragraph">I woke up yesterday with the following thoughts, which are probably either obvious or dumb.</p>



<p class="wp-block-paragraph">A central thesis that many readers, including me, took from Douglas Hofstadter’s <a href="https://en.wikipedia.org/wiki/G%C3%B6del,_Escher,_Bach">Gödel Escher Bach</a> when young was that the secret of intelligence (and therefore, of AI) was going to have a lot to do with self-referentiality and “strange loops.”</p>



<p class="wp-block-paragraph">Even Roger Penrose’s <a href="https://en.wikipedia.org/wiki/The_Emperor%27s_New_Mind">The Emperor’s New Mind</a>, which in some ways was the anti-GEB, ironically agreed with GEB about the fundamental importance of self-reference to the success or failure of the whole AI project. It claimed (incorrectly, in my view and in most experts’) that AI could never work because there was something about Gödel’s Theorem and self-reference that no computer program could ever capture, but that could be captured by exotic physics accessible to the human brain.</p>



<p class="wp-block-paragraph">Now, in 2026, we’ve succeeded at building AIs that outperform most humans at most intellectual tasks that are well-defined enough to judge. And at no point in the tech stack of those AIs — neither in the transformer neural nets, nor in the GPU clusters they run on, nor in the training process, nor anywhere else — did anyone need to build in anything about self-reference. (Excepting, eg, the system instructions that tell the model about its role and identity, which aren’t needed for intelligent behavior. Also, I’m not going to count the autoregressive nature of LLMs as “self-referential”; that’s just dynamical feedback.)</p>



<p class="wp-block-paragraph">Of course, GPT 5.6 Pro and Fable can talk about themselves, about Gödel’s Theorem, about self-reference, about what we’re talking about right now, all of it, better than most humans. But at no point did anyone need to build self-referential abilities in. They popped out as a byproduct of the same pretraining that let the models talk about Pokémon and long-chain polymers and cognitive behavioral therapy and plate tectonics and everything else.</p>



<p class="wp-block-paragraph">No wonder Hofstadter says he’s been stunned by the success of LLMs, and has seemed depressed about current AI capabilities in <a href="https://www.theatlantic.com/ideas/archive/2023/07/the-terrible-downside-of-ai-language-translation/674687/">essays like this one</a>. He’s way too smart to deny what’s happened or invent reasons why it doesn’t really count (the approach many have taken). But he realizes that we now have true conversational intelligence from a path that the GEB worldview would’ve regarded as far too cheap and simple, and that certainly has no “strange loops” built in anywhere.</p>



<p class="wp-block-paragraph">Of course, a Hofstadterian could argue that a strange loop <em>emerges</em> in LLMs — indeed, nothing in GEB ever said that strange loops would need to be explicitly engineered at the outset. But would anyone who hadn’t been brought up on GEB arrive at this as a useful way of thinking about LLMs?</p>



<p class="wp-block-paragraph">What can we say about this with hindsight? While the ideas of diagonalization and self-reference of course played a central role in the birth of modern mathematical logic and computer science, the most famous uses were <em>negative</em>: there is not a bijectjon between the natural numbers and the reals. There is not a complete sound proof system for arithmetic. There is not an algorithm to solve the halting problem.</p>



<p class="wp-block-paragraph">If your goal was only to build the axioms of ZFC and the rules of first-order inference, or build an electronic computer, you wouldn’t explicitly need self-reference for that. You would just … start building, taking care that your instruction set didn’t fall short of universality.</p>



<p class="wp-block-paragraph">Yes, ZFC can formalize and prove theorems about itself. Yes, electronic computers can run programs that take their own code as input. But no one ever needed to build those abilities in, any more than self-reference needed to be built in to the alphabet or the rules of grammar. It popped out as a free byproduct of universality.</p>



<p class="wp-block-paragraph">In the same way, LLMs’ ability to talk about themselves popped out as a byproduct of their ability to talk about anything in the discourse universe they were trained on. The big, old ideas about intelligence that ended up basically vindicated were the ideas about how intelligence is about prediction, and prediction is about compression, and compression is about finding better and better upper bounds on Kolmogorov complexity. Not the self-reference stuff. (Although, if you wanted to know why Kolmogorov complexity <em>can’t</em> be computed perfectly, that negative statement would again require a self-referential argument.)</p>



<p class="wp-block-paragraph">What’s left? Consciousness and subjective experience of course remain extremely mysterious. For all we know, Hofstadter could be right that those have something to do with self-reference. (For all we know, even Penrose could be right that they have something to do with exotic physics accessible to biological brains but not digital computers!)</p>



<p class="wp-block-paragraph">But the idea that you’d need explicit self-referentiality before you could get convincing and world-changing conversational intelligence? Let it be buried in a Westminster Abbey or Arlington National Cemetery for the most important wrong ideas in human history — geocentrism, Aristotle’s teleological physics, aether, phlogiston, Freud’s psychology, Marx’s prediction of a workers’ uprising followed by a classless utopia, etc. But buried it needs to be.</p></div>
    </content>
    <updated>2026-09-01T17:17:08Z</updated>
    <published>2026-09-01T17:17:08Z</published>
    <category scheme="https://scottaaronson.blog" term="Embarrassing Myself"/>
    <category scheme="https://scottaaronson.blog" term="Metaphysical Spouting"/>
    <category scheme="https://scottaaronson.blog" term="Procrastination"/>
    <author>
      <name>Scott</name>
      <uri>http://www.scottaaronson.com</uri>
    </author>
    <source>
      <id>https://scottaaronson.blog/?feed=atom</id>
      <icon>https://scottaaronson.blog/wp-content/uploads/2021/10/cropped-Jacket-32x32.gif</icon>
      <link href="https://scottaaronson.blog" rel="alternate" type="text/html"/>
      <link href="https://scottaaronson.blog/?feed=atom" rel="self" type="application/atom+xml"/>
      <subtitle xml:lang="en-US">The Blog of Scott Aaronson</subtitle>
      <title xml:lang="en-US">Shtetl-Optimized</title>
      <updated>2026-09-01T17:17:08Z</updated>
    </source>
  </entry>

  <entry xml:lang="en">
    <id>tag:golem.ph.utexas.edu,2026:%2Fcategory%2F3.3640</id>
    <link href="https://golem.ph.utexas.edu/category/2026/08/three_generations_in_e7.html" rel="alternate" type="application/xhtml+xml"/>
    <title xml:lang="en">Three Generations in E7</title>
    <summary xml:lang="en">How you can fit the Lie algebra of the Standard Model gauge group and its representation on three generations of fermions into the Lie algebra of E7.</summary>
    <content type="xhtml" xml:lang="en"><div xmlns="http://www.w3.org/1999/xhtml"><div><a href="http://golem.ph.utexas.edu/~distler/blog/mathml.html"><img alt="MathML-enabled post (click for more details)." class="mathlogo" src="https://golem.ph.utexas.edu/~distler/blog/images/MathML.png" title="MathML-enabled post (click for details)."/></a></div>

<p>It’s long been a mystery why there are 3 generations of quarks and leptons: three sets of particles, apparently identical except for how they interact with the Higgs boson.  It would be nice if there were some good physical explanation.  Nobody knows one.   Barring that, it would be nice if some beautiful mathematical structure made this pattern seem natural.   That’s what my new paper is about.</p>

<p>I’ll keep this nontechnical.  I’ll say a bit about what the paper does, what it does <em>not</em> do, what led up to it, and how I wrote it.</p>

<div><a href="http://golem.ph.utexas.edu/~distler/blog/mathml.html"><img alt="MathML-enabled post (click for more details)." class="mathlogo" src="https://golem.ph.utexas.edu/~distler/blog/images/MathML.png" title="MathML-enabled post (click for details)."/></a></div>

<p>This is my third paper about exceptional algebraic structures and the Standard Model.  When you classify famous gadgets in algebra, beautiful gadgets with fancy names like ‘simple Lie algebras’ and ‘Euclidean Jordan algebras’ and ‘positive hermitian Jordan pairs’, you tend to get infinite series of them — together with a few exceptions that can be built using the octonions.  This is a bit spooky, so I’ve been interested in this for a long time. </p>

<p>A few physicists have hoped that these exceptions are good for something.  For example, maybe the quirky features of our best theory of particle physics, the Standard Model, aren’t accidental.  Perhaps they fall out naturally from some exceptional algebraic structure.  </p>

<p>It’s a long shot, but we’ve been stuck on figuring out new fundamental laws of particle physics for so long — roughly since the early 1980s — that it’s worth a try.</p>

<p>In 2018, <a href="https://arxiv.org/abs/1806.09450">Michel Dubois-Violette and Ivan Todorov</a> noticed that the gauge group of the Standard Model falls out as symmetries of the so-called ‘exceptional Jordan algebra’ together with some ordinary Jordan algebras sitting inside it.  I tried to clarify that here, with a huge amount of help from an excellent young mathematician:</p>

<ul>
<li>John Baez and Paul Schwahn, <a href="http://arxiv.org/abs/2606.15235">The Standard Model gauge group from the exceptional Jordan algebra</a>.   (Blog article <a href="https://johncarlosbaez.wordpress.com/2026/06/16/octonions-and-the-standard-model-2/">here</a>.)</li>
</ul>

<p>It’s very nice, because the Jordan algebras in question arise naturally when you try to axiomatize the foundations of quantum physics.  It would be so cool if something about quantum physics made the Standard Model seem mathematically natural!</p>

<p>But really this result only concerns the gauge bosons in the Standard Model: the photon, gluons, and the W and Z bosons.  It says nothing about the fermions — that is, the quarks and leptons.  And it seems quite hard to get those into the picture.</p>

<p>In 2020, <a href="https://arxiv.org/abs/2006.16265">Latham Boyle</a> tried to solve this problem by tensoring the exceptional Jordan algebra with the complex numbers.  This made <i>one generation</i> of fermions appear quite naturally!  But the connection to the foundations of quantum physics seemed lost: tensoring the exceptional Jordan algebra with the complex numbers seems at first like it might be just a formal trick.</p>

<p>This spring, Latham and his student Endre Bokor and I showed the connection to quantum physics is <i>not</i> lost:</p>

<ul>
<li>John Baez, Endre Bokor and Latham Boyle, <a href="https://arxiv.org/abs/2607.10833">Jordan pair quantum theory and the Standard Model</a>.  (Blog article <a href="https://johncarlosbaez.wordpress.com/2026/07/22/jordan-triples-and-the-standard-model/">here</a>.)</li>
</ul>

<p>The idea is to work, not with Jordan algebras, but with more general things called Jordan pairs, which have been studied by mathematicians since at least 1975.  We showed that you can still do quantum physics with Jordan pairs.  And we showed that there’s an ‘exceptional’ Jordan pair that naturally contains the Standard Model gauge group and one generation of fermions!</p>

<p>This Jordan pair is built from the bioctonions: the octonions tensored with the complex numbers.  And it’s closely related to an exceptional Lie algebra called <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>𝔢</mi> <mn>6</mn></msub></mrow><annotation encoding="application/x-tex">\mathfrak{e}_6</annotation></semantics></math>.  </p>

<p>This is nice because the work of Dubois-Violette and Todorov used a smaller exceptional Lie algebra called <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>𝔣</mi> <mn>4</mn></msub></mrow><annotation encoding="application/x-tex">\mathfrak{f}_4</annotation></semantics></math>.   Going up to <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>𝔢</mi> <mn>6</mn></msub></mrow><annotation encoding="application/x-tex">\mathfrak{e}_6</annotation></semantics></math> gives the room to include one generation of fermions.</p>

<p>There’s an even larger exceptional Lie algebra you can use to build a Jordan pair: it’s called <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>𝔢</mi> <mn>7</mn></msub></mrow><annotation encoding="application/x-tex">\mathfrak{e}_7</annotation></semantics></math>.   Bokor, Boyle and I tried using this to get <em>three</em> generations of fermions.   There are things that make this tempting: not just the fact that <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>𝔢</mi> <mn>7</mn></msub></mrow><annotation encoding="application/x-tex">\mathfrak{e}_7</annotation></semantics></math> is bigger, but the fact that the Jordan pair you get from it has a kind of three-fold symmetry.  But we couldn’t get it to work.</p>

<p>Around this time I got very interested in some work that someone had sent me in October 2025.  My inbox is packed with new theories of physics.  Since the rise of large language models the inflow has increased: I get about two emails a day from someone telling me they’ve made a revolutionary discovery in physics. Practically none of these theories appeal to me.  But this paper, and this thesis, were different:</p>

<ul>
<li><p>Benjamin Nasmith, <a href="https://arxiv.org/abs/2012.03933">An exceptional combinatorial sequence and Standard Model particles</a>, 2020.</p></li>
<li><p>Benjamin Nasmith, <a href="https://espace.rmc.ca/jspui/handle/11264/1423"><i>Tight Projective 5-Designs and Exceptional Structures</i></a>, Ph.D. thesis, Royal Military College of Canada, 2023.  </p></li>
</ul>

<p>He claimed to fit three generations of fermions into the exceptional Lie algebra <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>𝔢</mi> <mn>7</mn></msub></mrow><annotation encoding="application/x-tex">\mathfrak{e}_7</annotation></semantics></math>.   </p>

<p>When I started seriously trying to understand this paper, I wound up translating it into a language I’m more comfortable with, and expanding on the ideas a bit.  So I wrote this:</p>

<ul>
<li>John Baez, <a href="https://math.ucr.edu/home/baez/e7.pdf">Three generations in <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>𝔢</mi> <mn>7</mn></msub></mrow><annotation encoding="application/x-tex">\mathfrak{e}_7</annotation></semantics></math>.</a></li>
</ul>

<p>Here’s the basic idea.</p>

<h3> The idea </h3>

<p>There is a standard way to fit the Lie algebra of the Standard Model gauge group, which I call <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>𝔤</mi> <mtext>SM</mtext></msub></mrow><annotation encoding="application/x-tex">\mathfrak{g}_{\text{SM}}</annotation></semantics></math>, into the Lie algebra <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>𝔢</mi> <mn>7</mn></msub></mrow><annotation encoding="application/x-tex">\mathfrak{e}_7</annotation></semantics></math>.   You can construct a Lie algebra <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>L</mi></mrow><annotation encoding="application/x-tex">L</annotation></semantics></math> that fits between them:</p>

<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><msub><mi>𝔤</mi> <mtext>SM</mtext></msub><mo>⊂</mo><mi>L</mi><mo>⊂</mo><msub><mi>𝔢</mi> <mn>7</mn></msub></mrow><annotation encoding="application/x-tex">  \mathfrak{g}_{\text{SM}} \subset L  \subset \mathfrak{e}_7 </annotation></semantics></math></p>

<p>As a vector space we have</p>

<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><msub><mi>𝔢</mi> <mn>7</mn></msub><mspace width="0.27778em"/><mo>≅</mo><mspace width="0.27778em"/><mi>L</mi><mo>⊕</mo><mi>V</mi></mrow><annotation encoding="application/x-tex">   \mathfrak{e}_7 \; \cong \; L \oplus V </annotation></semantics></math></p>

<p>for some vector space <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>V</mi></mrow><annotation encoding="application/x-tex">V</annotation></semantics></math> of dimension <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>3</mn><mo>×</mo><mn>32</mn></mrow><annotation encoding="application/x-tex">3 \times 32</annotation></semantics></math>.      </p>

<p>Moreover, the Lie algebra <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>𝔤</mi> <mtext>SM</mtext></msub></mrow><annotation encoding="application/x-tex">\mathfrak{g}_{\text{SM}}</annotation></semantics></math> acts on <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>V</mi></mrow><annotation encoding="application/x-tex">V</annotation></semantics></math>, via the <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>𝔢</mi> <mn>7</mn></msub></mrow><annotation encoding="application/x-tex">\mathfrak{e}_7</annotation></semantics></math> Lie bracket, precisely as it does on three generations of Standard Model fermions and their antiparticles, including  right-handed neutrino and its antiparticle — but ignoring spin!</p>

<p>There is, in fact, a very interesting three-fold symmetry built into <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>𝔢</mi> <mn>7</mn></msub></mrow><annotation encoding="application/x-tex">\mathfrak{e}_7</annotation></semantics></math>, which is revealed when we put the Standard Model Lie algebra <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>𝔤</mi> <mtext>SM</mtext></msub></mrow><annotation encoding="application/x-tex">\mathfrak{g}_{\text{SM}}</annotation></semantics></math> into it.   It permutes the three generations.</p>

<p>Like Nasmith, I am not proposing a theory of physics.   I’m only observing a fascinating mathematical pattern that might (or might not) be of some use in physics. </p>

<p>There are lots of things this pattern does not include: basically, everything I didn’t already mention.   It does not include the <em>spin</em> of the fermions and gauge bosons.   It does not include the <em>Higgs boson</em>, though in some sense it comes close (see the paper).  It does not include a <em>Lagrangian</em>, so it doesn’t say anything at all about particle <em>masses</em> or <em>interactions</em>.</p>

<p>I could say a lot more about what my paper does do… most importantly, where this Lie algebra <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>L</mi></mrow><annotation encoding="application/x-tex">L</annotation></semantics></math> comes from!   The details are very interesting.  There’s also the curious role of the right-handed neutrinos.  But I’ve already spent weeks explaining all these things in my paper, so I won’t do it here.   Instead let me say a bit about how I wrote the paper.</p>

<h3> Writing the paper </h3>

<p>I’ve been wanting to keep up with how AI is transforming math.   About a year ago a friend gave me a subscription to Claude Pro.   I wanted to test it out, despite my many misgivings, including how large language models are contributing to global warming and income inequality.   Given the amazing things that people have recently done in math using large language models, I didn’t think that <i>never trying them out</i> would put me in the best position to make good decisions about the future.</p>

<p>So, I wrote this paper with help from Claude Opus 4.8.  </p>

<p>I started by giving it Nasmith’s paper and asking a long series of questions about that paper over several days.  The results were very interesting and helpful.  Eventually I asked it to summarize and expand on our conversation.   It quickly spat out a 10-page paper.</p>

<p>This paper was written in a breezy, pleasant style — but also quite hard to understand in detail, since it mixed Nasmith’s terminology with the Lie algebra terminology I prefer, and the proofs skipped over some steps.</p>

<p>It took me about three weeks of hard work to fully understand and re-express all the ideas a way that I like.   For a while I felt dumb and frustrated, because when I asked Claude to fill in the gaps in proofs, it used math I was not very competent in, like the theory of regular subalgebras, and the theory of minuscule representations.  But I learned this math, and everything turned out to be basically correct — in part, I’m sure, because Nasmith’s original work was correct.</p>

<p>For several weeks I checked, reorganized, expanded and completely rewrote this material.   By the end everything was written in a style I like, emphasizing the ideas I consider important, proving things fairly carefully, and adding a lot of expository material — for example, explaining the theory of regular subalgebras.</p>

<p>Almost no traces of Claude’s original writeup remain, even though I was deeply influenced by them.   My proofs make few references to deep theorems, though they assume solid familiarity with simple Lie algebras and their root systems.  The proofs also require no brutally hard computations — though Claude was eager to do such computations to check things.  </p>

<p>Any mistakes in this paper are my own. </p>

<p>I’m not sure what conclusions I draw from writing this paper.   I’m writing another math paper now, with a human coauthor, and I have no desire to get help from a large language model.  For work on my own it could be very helpful.  Fields medalist <a href="https://www.ams.org/journals/notices/202607/noti3372/noti3372.html">Jacob Tsimerman</a> says it roughly doubles his productivity.  Would using it be so bad for the environment, or so bad for society, that I should avoid it?   Maybe.   I deliberately stuck with Claude Opus 4.8 instead of something more powerful, to see what I could do with what you get from a $20/month subscription.  But maybe that’s still bad.  </p>

<p>I avoid flying to conferences, which in some ways cripples my ability to keep up with new trends and influence people — but I don’t mind that.  It gives me more time to think.</p>

<p>I will think carefully about my next move.</p></div>
    </content>
    <updated>2026-09-01T10:19:27Z</updated>
    <published>2026-08-17T15:18:37Z</published>
    <category term="Particle Physics"/>
    <author>
      <name>john</name>
      <email>baez@math.ucr.edu</email>
      <uri>http://math.ucr.edu/home/baez/</uri>
    </author>
    <source>
      <id>tag:golem.ph.utexas.edu,2006:nCategoryCafe/3</id>
      <icon>https://golem.ph.utexas.edu/category/images/favicon.ico</icon>
      <link href="https://golem.ph.utexas.edu/category/" rel="alternate" type="application/xhtml+xml"/>
      <link href="https://golem.ph.utexas.edu/category/atom10.xml" rel="self" type="application/atom+xml"/>
      <link href="https://golem.ph.utexas.edu/category/comments.atom" rel="replies" type="application/atom+xml"/>
      <rights xml:lang="en">Copyright (c) 2026, The n-Category Collective</rights>
      <subtitle xml:lang="en">A group blog on math, physics and philosophy</subtitle>
      <title xml:lang="en">The n-Category Café</title>
      <updated>2026-09-01T10:19:27Z</updated>
    </source>
  </entry>

  <entry>
    <id>tag:blogger.com,1999:blog-13869903.post-3143613507109553864</id>
    <link href="https://nanoscale.blogspot.com/feeds/3143613507109553864/comments/default" rel="replies" title="Post Comments" type="application/atom+xml"/>
    <link href="https://www.blogger.com/comment/fullpage/post/13869903/3143613507109553864" rel="replies" title="4 Comments" type="text/html"/>
    <link href="https://www.blogger.com/feeds/13869903/posts/default/3143613507109553864" rel="edit" type="application/atom+xml"/>
    <link href="https://www.blogger.com/feeds/13869903/posts/default/3143613507109553864" rel="self" type="application/atom+xml"/>
    <link href="https://nanoscale.blogspot.com/2026/08/lab-safety-seriously-be-careful-out.html" rel="alternate" title="Lab safety - seriously, be careful out there" type="text/html"/>
    <title>Lab safety - seriously, be careful out there</title>
    <content type="xhtml"><div xmlns="http://www.w3.org/1999/xhtml"><p>This past week was a genuinely horrific reminder of the importance of lab safety, especially in the realm of hazardous chemicals.  </p><p>First, <a href="https://cen.acs.org/safety/lab-safety/hokkaido-student-dies-hydrofluoric-hf/104/web/2026/08" target="_blank">a graduate student at Hokkaido University was killed</a> due to some kind of large-scale exposure to <a href="https://en.wikipedia.org/wiki/Hydrofluoric_acid" target="_blank">hydrofluoric acid</a>.  For those who don't know, HF is used at some rate in semiconductor-related work, because it's a way to etch SiO\(_2\) from silicon surfaces and leave a hydrogen-terminated surface.  (Usually this is done using <a href="https://en.wikipedia.org/wiki/Buffered_oxide_etch" target="_blank">buffered oxide etch</a>, which is less concentrated than the pure acid but still must be handled with great care and appropriate personal protective equipment.)  Accidental exposure to small amounts of HF is <a href="https://en.wikipedia.org/wiki/Hydrofluoric_acid#Health_and_safety" target="_blank">not always immediately obvious</a>, because it is not that aggressive in damaging human skin (unlike, say, nitric or sulfuric acid).  Rather, it attacks the calcium in bones (as well as screwing up many other biological processes).  The topical treatment is <a href="https://en.wikipedia.org/wiki/Calcium_gluconate#Hydrofluoric_acid_burns" target="_blank">calcium gluconate gel</a>, which can help by being a much more readily accessible source of calcium ions to bind with the fluoride ions.  There are no real details out yet about how someone had a massive amount of HF <a href="https://www.thestandard.com.hk/world/article/341167/Graduate-student-killed-by-hydrofluoric-acid-spill-at-Hokkaido-University" target="_blank">splash on their head/face</a>, but that sure sounds like a terrible case of poor storage and handling practices.  </p><p>Then it came out that this past Wednesday a doctoral student at MIT had been exposed to <a href="https://en.wikipedia.org/wiki/Dimethylmercury" target="_blank">dimethyl mercury</a>.  <a href="https://www.reddit.com/r/mit/comments/1w12gb9/dimethyl_mercury_poisoning/" target="_blank">Here</a> is a reddit discussion thread in r/mit, and <a href="https://www.reddit.com/r/chemistry/comments/1w168bv/potential_dimethylmercury_incident_at_mit/" target="_blank">here</a> is another one on r/chemistry.  Apologies for the reddit links, but there doesn't seem to be any news reporting about this yet.  From the MIT announcement in those threads, it was in building 18, and decontamination of the space is ongoing.  Any scientist of my generation knows about dimethylmercury because of the horrifying death of Dartmouth chemistry professor <a href="https://en.wikipedia.org/wiki/Karen_Wetterhahn" target="_blank">Karen Wetterhahn</a> in 1997.  She was exposed to tiny drops of this stuff, which diffused through her latex gloves (which she did not realize at the time).  Prior to her death, people still occasionally used dimethylmercury as a standard in NMR measurements.  Organic mercury compounds are widely recognized as incredibly dangerous because tiny amounts can lead to mercury crossing the blood-brain barrier, leading to terrible neurological systems and death.  Once mercury is into organic tissues, it is very difficult to <a href="https://en.wikipedia.org/wiki/Chelation_therapy" target="_blank">chelate</a> the metal ions.  Again, there is a shortage of official information about this incident, but MIT's announcement made it clear that any synthesis or use of this compound is not permitted and was unauthorized.  </p><p><b>Update</b>:  the latest from MIT’s emergency response page raises the possibility that there may not have been any exposure or dimethylmercury present.  Fingers crossed that this turns out to be a false alarm.</p><p><b>Update 2</b>:  The always excellent <a href="https://www.science.org/content/blog-post/alleged-dimethylmercury-incident" target="_blank">Derek Lowe with a further discussion</a> of what seems now to have (thankfully, hopefully) been a false alarm.</p><p>To students reading this:  PLEASE be careful in the lab.  Know the hazards of what you're doing, and use appropriate procedures and protective equipment.  If you ever have questions about safety, for goodness' sake please ask.  Your PI and your environmental health and safety team would <i style="font-weight: bold;">far</i> rather have you ask questions and be cautious then to do something dangerous.  No PI should ever make students feel like thinking about safety is unnecessary or overly cautious, and no PI should ever be hesitant about supplying or letting students purchase PPE.  </p></div>
    </content>
    <updated>2026-09-01T01:02:22Z</updated>
    <published>2026-08-29T18:21:21Z</published>
    <author>
      <name>Douglas Natelson</name>
      <email>noreply@blogger.com</email>
      <uri>http://www.blogger.com/profile/13340091255404229559</uri>
    </author>
    <source>
      <id>tag:blogger.com,1999:blog-13869903</id>
      <category term="concepts"/>
      <author>
        <name>Douglas Natelson</name>
        <email>noreply@blogger.com</email>
        <uri>http://www.blogger.com/profile/13340091255404229559</uri>
      </author>
      <link href="https://nanoscale.blogspot.com/feeds/posts/default" rel="http://schemas.google.com/g/2005#feed" type="application/atom+xml"/>
      <link href="https://www.blogger.com/feeds/13869903/posts/default?alt=atom" rel="self" type="application/atom+xml"/>
      <link href="https://nanoscale.blogspot.com/" rel="alternate" type="text/html"/>
      <link href="http://pubsubhubbub.appspot.com/" rel="hub" type="text/html"/>
      <link href="https://www.blogger.com/feeds/13869903/posts/default?alt=atom&amp;start-index=26&amp;max-results=25" rel="next" type="application/atom+xml"/>
      <subtitle>A blog about condensed matter and nanoscale physics.  Why should high energy and astro folks have all the fun?</subtitle>
      <title>nanoscale views</title>
      <updated>2026-09-07T18:05:56Z</updated>
    </source>
  </entry>

  <entry xml:lang="en">
    <id>http://quantumfrontiers.com/?p=18092</id>
    <link href="https://quantumfrontiers.com/2026/08/31/the-universe-the-uncanny-and-fashion/" rel="alternate" type="text/html"/>
    <link href="https://quantumfrontiers.com/2026/08/31/the-universe-the-uncanny-and-fashion/#comments" rel="replies" type="text/html"/>
    <link href="https://quantumfrontiers.com/2026/08/31/the-universe-the-uncanny-and-fashion/feed/atom/" rel="replies" type="application/atom+xml"/>
    <title xml:lang="en">The Universe, the Uncanny, and Fashion</title>
    <summary type="xhtml" xml:lang="en"><div xmlns="http://www.w3.org/1999/xhtml">⚛⚛⚛ In the beginning there was a question. Actually, no, in the beginning there was language.  The question came later, presumably as one of its side effects. Since then we have asked about nearly everything, though the answers have done … <a href="https://quantumfrontiers.com/2026/08/31/the-universe-the-uncanny-and-fashion/">Continue reading <span class="meta-nav">→</span></a></div>
    </summary>
    <content type="xhtml" xml:lang="en"><div xmlns="http://www.w3.org/1999/xhtml"><p class="wp-block-paragraph">                                                                   <img alt="&#x269B;" class="wp-smiley" src="https://s0.wp.com/wp-content/mu-plugins/wpcom-smileys/twemoji/2/72x72/269b.png" style="height: 1em;"/><img alt="&#x269B;" class="wp-smiley" src="https://s0.wp.com/wp-content/mu-plugins/wpcom-smileys/twemoji/2/72x72/269b.png" style="height: 1em;"/><img alt="&#x269B;" class="wp-smiley" src="https://s0.wp.com/wp-content/mu-plugins/wpcom-smileys/twemoji/2/72x72/269b.png" style="height: 1em;"/></p>



<p class="wp-block-paragraph">In the beginning there was a question. Actually, no, in the beginning there was language.  The question came later, presumably as one of its side effects. Since then we have asked about nearly everything, though the answers have done little to alter our circumstances. Human existence has always seemed strange to me. We arrive without consent, in a place not of our choosing, then spend decades asking why, until we close our eyes and enter the abyss of nothingness.</p>



<p class="wp-block-paragraph">Some people accept this situation very well. I did not.</p>



<p class="wp-block-paragraph"> Until my mid-teens, I tenaciously found one solution in fashion. If I could not understand who I was, I could at least decide what version I could become. Clothes gave form to something otherwise difficult to locate. Desire, after all, begins with a <em>lack</em>. </p>



<p class="wp-block-paragraph">It was only later that physics presented a solution to the same <em>lack</em>, only with more elaborate mathematics.</p>



<p class="wp-block-paragraph">Quantum mechanics tells us that the world beneath the familiar world does not behave as we experience it.  A thing can resist being one thing, certainty begins to dissolve, and reality becomes strangely unfamiliar. The uncanny begins very close to home.</p>



<p class="wp-block-paragraph">It is in this uncanniness that fashion and physics, liminally, meet for me: both begin with a human being standing before something they cannot understand, the universe in one case, the self in the other, and trying to make a form out of it. </p>



<p class="wp-block-paragraph">But even this distinction, on closer inspection, begins to collapse; for our desire to understand the universe has always concealed a deeper desire to understand the self that stands within it. </p>



<p class="wp-block-paragraph">All roads eventually lead back to the interests you had as a child, or so I say. </p>



<p class="wp-block-paragraph">I would squint into the dark, my mind already at work. I would imagine the next thing I would wear, project its color and fabric onto the ceiling. </p>



<p class="wp-block-paragraph">Then,  go to the bazaar, <a href="https://www.youtube.com/watch?v=LCjQbsziE8A"><em>Rangrizano Dana</em></a>, where, as the Kandaharis like to say, everything is sold except one’s mother and father.</p>



<p class="wp-block-paragraph">The designs that had existed only in my head, after night upon night of theorizing and calculating, were finally beginning to take shape. The alleys of <a href="https://www.youtube.com/watch?v=LCjQbsziE8A"><em>Rangrizano Dana</em></a> were full of fabric of different textures and colors. </p>



<p class="wp-block-paragraph">Once the fabric was bought, came the tailoring. Tailors hold a special place in Afghanistan. Some are stars in their own right, the kind you have to book an appointment with. And once you get there, another matter comes up: making the tailor promise not to show your design to another woman. Everyone wants to wear something unique. So, naturally,  there is a lot of secrecy.</p>



<p class="wp-block-paragraph">The designs themselves would either be described or sketched. Somewhere between what was imagined and what the tailor could make, something would emerge. And the day the tailor shipped your clothes was really a day of revelations.</p>



<figure class="wp-block-image size-large is-resized"><a href="https://quantumfrontiers.com/wp-content/uploads/2026/08/image-2.png"><img alt="" class="wp-image-18246" height="836" src="https://quantumfrontiers.com/wp-content/uploads/2026/08/image-2.png?w=1024" style="width: 624px; height: auto;" width="1024"/></a></figure>



<p class="wp-block-paragraph">Time passed, which is another way of saying the object of my desire changed. The same attention once spent on cut, texture, and appearance turned, little by little, toward the fabric of space and time.</p>



<p class="wp-block-paragraph">Studying physics, I organized my process in the same way. There was again an idea that existed first in the mind, and then the problem of giving it form. </p>



<p class="wp-block-paragraph">Only now the materials were different. Instead of cloth, there was mathematics; instead of the tailor’s table, the blackboard and chalk. And, standing before it, more often than not, a badly dressed physicist covered in chalk dust. All the libidinal energy of the universe, you might say, had been sublimated into equations.</p>



<figure class="wp-block-image size-large is-resized"><a href="https://quantumfrontiers.com/wp-content/uploads/2026/08/image-3.png"><img alt="" class="wp-image-18247" height="766" src="https://quantumfrontiers.com/wp-content/uploads/2026/08/image-3.png?w=1024" style="width: 624px; height: auto;" width="1024"/></a></figure>



<p class="wp-block-paragraph">Fashion had, in some ways, been the more serious pursuit. There was something at stake: you wanted to look better than everyone else. Physics, by comparison, could be surprisingly playful.</p>



<p class="wp-block-paragraph">Alice sends a particle to Bob. The sound of those names would tickle my Pashto ear then, and still cracks me up now. Cats are placed in boxes, both dead and alive. Observers hover near black holes or sometimes even, <em>whooooooosh</em>, fall into them.</p>



<p class="wp-block-paragraph">So, in this way, in my mind’s eye, the physicist has become a rather more amusing figure: a tailor of space and time. The universe, of course, is a notoriously difficult client (perhaps even more difficult than a Kandahari woman making her tailor promise not to show her design to anyone else). </p>



<p class="wp-block-paragraph">He begins, as any tailor must, with an imagined shape. Mathematics is his chalk, his scissors, his needle. With it he marks the fabric, cuts it, folds it, joins one piece of reality to another. Some constructions fall upon the universe with elegance. Others bunch at the shoulder, pull at the waist, or refuse altogether to button, and must be altered, or thrown away completely.</p>



<p class="wp-block-paragraph">A tailor works against the resistance of the human body; a physicist against the resistance of the universe.</p>



<p class="wp-block-paragraph">Imagine, then, a physicist seated at the edge of a black hole, spectacles low upon his nose, sewing little cloaks from the fabric of spacetime.</p>



<p class="wp-block-paragraph">“How many dimensions will you need?” asks Alice.</p>



<p class="wp-block-paragraph">“That depends upon the suit,” he replies.</p>



<figure class="wp-block-image size-large is-resized"><a href="https://quantumfrontiers.com/wp-content/uploads/2026/08/image.jpeg"><img alt="" class="wp-image-18245" height="360" src="https://quantumfrontiers.com/wp-content/uploads/2026/08/image.jpeg?w=1000" style="width: 624px; height: auto;" width="1000"/></a></figure>



<p class="wp-block-paragraph"><em>    </em>For <a href="https://quantumfrontiers.com/2015/03/27/quantum-gravity-from-quantum-error-correcting-codes/">AdS/CFT,</a> suppose we are making a three-dimensional garment.  The tailor of the universe never begins with three dimensions. Before him lies only the flat, two-dimensional fabric, with all its degrees of freedom spread upon the board.</p>



<p class="wp-block-paragraph"> It is then, in a less sartorial language, we might call the disentangling and entangling of degrees of freedom; the tailor coaxes a third dimension out of the flat cloth. This is the secret embroidery of the holographic idea: what appears to the wearer as a three-dimensional world is encoded in a fundamentally two-dimensional way.</p>



<p class="wp-block-paragraph">Bob tries this newly fashioned quantum garment on before entering the black hole. </p>



<p class="wp-block-paragraph"> “Too tight,” he says. “See if there is more degree of freedom.” </p>



<p class="wp-block-paragraph">The physicist frowns, takes up his chalk, and makes another small mark, with some disentangling and entangling here and there.</p>



<p class="wp-block-paragraph">What could have been wrong? Well, perhaps the group theory has been chosen badly, the symmetry is broken, and a representation must be changed, a seam opened, a dimension added, or one cunningly concealed.</p>



<p class="wp-block-paragraph">Alice watches him work, the almighty tailor of the universe,  making change without a change.</p>



<p class="wp-block-paragraph">“But how do you know when the suit is right?”</p>



<p class="wp-block-paragraph">And with that, the physicist looks at her.</p>



<p class="wp-block-paragraph">“What do you want? Do you want to put me out of work? Unknowing is the lack that drives us to make more suits. If we knew the suit was right, that would be the end of everything.”</p>



<p class="wp-block-paragraph"/></div>
    </content>
    <updated>2026-08-31T21:28:38Z</updated>
    <published>2026-08-31T21:28:38Z</published>
    <category scheme="https://quantumfrontiers.com" term="Uncategorized"/>
    <author>
      <name>Sola Mahfouz</name>
    </author>
    <source>
      <id>http://quantumfrontiers.com/feed/atom/</id>
      <link href="https://quantumfrontiers.com" rel="alternate" type="text/html"/>
      <link href="https://quantumfrontiers.com/feed/atom/" rel="self" type="application/atom+xml"/>
      <link href="https://quantumfrontiers.com/osd.xml" rel="search" title="Quantum Frontiers" type="application/opensearchdescription+xml"/>
      <link href="https://s1.wp.com/opensearch.xml" rel="search" title="WordPress.com" type="application/opensearchdescription+xml"/>
      <link href="https://quantumfrontiers.com/?pushpress=hub" rel="hub" type="text/html"/>
      <subtitle xml:lang="en">A blog by the Institute for Quantum Information and Matter @ Caltech</subtitle>
      <title xml:lang="en">Quantum Frontiers</title>
      <updated>2026-09-06T13:17:26Z</updated>
    </source>
  </entry>

  <entry xml:lang="en">
    <id>http://4gravitons.com/?p=14846</id>
    <link href="https://4gravitons.com/2026/08/28/dont-judge-an-explanation-by-its-cover/" rel="alternate" type="text/html"/>
    <title>Don’t Judge an Explanation by Its Cover</title>
    <summary>Dark matter bugs people. I’ve talked before about why, and why it, and other beyond-the-standard-model proposals like those inspired by MOND, are nonetheless credible with physicists. But beyond the logic in that post, there’s a deeper reason people find dark matter strange. It’s that they don’t know what kind of an explanation dark matter is. […]</summary>
    <content type="xhtml"><div xmlns="http://www.w3.org/1999/xhtml"><p class="wp-block-paragraph">Dark matter bugs people. </p>



<p class="wp-block-paragraph"><a href="https://4gravitons.com/2023/02/10/why-dark-matter-feels-like-cheating-and-why-it-isnt/">I’ve talked before about why</a>, and why it, and other beyond-the-standard-model proposals like those inspired by MOND, are nonetheless credible with physicists. But beyond the logic in that post, there’s a deeper reason people find dark matter strange. It’s that they don’t know what <em>kind</em> of an explanation dark matter is.</p>



<p class="wp-block-paragraph">Dark matter sounds very lazy. If you can’t explain the movements of stars based on the matter you can see, then proposing invisible matter sounds like the easy way out. But it’s actually a lot less easy than it sounds, because matter is something quite specific. Matter gravitates and bends light. Matter moves. Matter can be described with a pressure, one like gas and dust and not like other things like light or the Higgs field. If you propose a new type of matter, you have to check and see that all of those consequences hold, with detailed implications for almost every observation every astronomer takes.</p>



<p class="wp-block-paragraph">For the most part, those consequences have been checked, and they do hold. Sometimes they fail, and it’s those failures, and not the idea that dark matter is “lazy”, that drive dark matter’s critics in the physics profession. Physicists who oppose dark matter have other explanations with their own consequences, for example new types of quantum fields that often get described to the public as “modified gravity”. When they argue against dark matter, they do it by comparing those consequences in detail, working through the implications and seeing which phenomena hold.</p>



<p class="wp-block-paragraph">Dark matter, as it turns out, is a very constraining explanation, one with strict consequences. There are other corners of physics where the explanations may seem less lazy, but actually have fewer consequences, and thereby less scientific heft.</p>



<p class="wp-block-paragraph">For example, consider <a href="https://4gravitons.com/2026/07/31/bonus-info-on-dark-energy-and-muons/">the debate about evidence for dark energy I wrote about last month</a>. A key question there was how to interpret light from supernovae. Some groups argued that supernovae change in brightness with distance, others that they change based on how old their galaxies are. Sabine Hossenfelder <a href="https://www.youtube.com/watch?v=xeFaOY2UCEk&amp;t=3s">glossed the debate</a> by saying it comes down to how you model supernovae. And while that’s true, it can give the wrong impression. </p>



<p class="wp-block-paragraph">You might think that these people are comparing detailed computer models of supernovae, and making different assumptions when they set their models up. But in reality, it’s much less detailed. The people on both sides of this debate are looking at correlations, trying to draw statistical lines through supernova datasets. The difference between one model and another isn’t a complicated physical setup you can put into a simulation, it’s just which lines on a graph you account for and which you ignore.</p>



<p class="wp-block-paragraph">Because of that, while these models may sound much more sophisticated than dark matter, they actually have much less scientific weight. The different supernova models don’t have grand, widespread consequences, they’re not mucking with the laws of physics or proposing new classes of object that every astronomer needs to account for. They’re pretty much just proposing tweaks to how to interpret one very specific type of data. That makes their questions much harder to resolve, and their answers much less universally convincing.</p>



<p class="wp-block-paragraph">If you’re not a scientist, if you read science news, it can be hard to tell the difference. Some ideas in science may sound simple, but have a whole raft of consequences that distinguish them from other ideas. Others may sound sophisticated, but are much more like “fudge factors”, only distinguished by statistical arguments, not by a rich trail of qualitative evidence. </p>



<p class="wp-block-paragraph">For the most part, as an outsider, you’ll never know which is which. But as always, it’s best to be aware of your limits.</p></div>
    </content>
    <updated>2026-08-28T16:00:00Z</updated>
    <published>2026-08-28T16:00:00Z</published>
    <category term="Science Communication"/>
    <category term="astronomy"/>
    <category term="astrophysics"/>
    <category term="dark energy"/>
    <category term="dark matter"/>
    <category term="philosophy of science"/>
    <category term="physics"/>
    <category term="PublicPerception"/>
    <author>
      <name>4gravitons</name>
    </author>
    <source>
      <id>https://4gravitons.com</id>
      <logo>https://s2.wp.com/i/webclip.png</logo>
      <link href="https://4gravitons.com/feed/" rel="self" type="application/rss+xml"/>
      <link href="https://4gravitons.com" rel="alternate" type="text/html"/>
      <link href="https://4gravitons.com/osd.xml" rel="search" title="4 gravitons" type="application/opensearchdescription+xml"/>
      <link href="https://4gravitons.com/?pushpress=hub" rel="hub" type="text/html"/>
      <subtitle>Stories about physics from someone who's been there</subtitle>
      <title>4 gravitons</title>
      <updated>2026-09-04T11:26:57Z</updated>
    </source>
  </entry>

  <entry xml:lang="en">
    <id>http://quantumfrontiers.com/?p=18095</id>
    <link href="https://quantumfrontiers.com/2026/08/26/nicoles-guide-to-writing-and-editing/" rel="alternate" type="text/html"/>
    <link href="https://quantumfrontiers.com/2026/08/26/nicoles-guide-to-writing-and-editing/#comments" rel="replies" type="text/html"/>
    <link href="https://quantumfrontiers.com/2026/08/26/nicoles-guide-to-writing-and-editing/feed/atom/" rel="replies" type="application/atom+xml"/>
    <title xml:lang="en">Nicole’s guide to writing and editing</title>
    <summary type="xhtml" xml:lang="en"><div xmlns="http://www.w3.org/1999/xhtml">Freshman year of college, I took a writing seminar from German-literature professor Ellis Shookman. Professor Shookman loved Mozart’s music, he told us early in the term. He listened to Mozart on the radio while driving from campus to Boston. Static … <a href="https://quantumfrontiers.com/2026/08/26/nicoles-guide-to-writing-and-editing/">Continue reading <span class="meta-nav">→</span></a></div>
    </summary>
    <content type="xhtml" xml:lang="en"><div xmlns="http://www.w3.org/1999/xhtml"><p class="wp-block-paragraph">Freshman year of college, I took a writing seminar from German-literature professor Ellis Shookman. Professor Shookman loved Mozart’s music, he told us early in the term. He listened to Mozart on the radio while driving from campus to Boston. Static might mar the transmission, but he could often turn up the volume and continue enjoying the program. Sometimes, the static worsened during the drive. It could worsen and worsen, until Professor Shookman’s frustration outweighed his delight at listening. He’d switch off the radio.</p>



<p class="wp-block-paragraph">As Professor Shookman loved listening to Mozart’s music, he loved reading about students’ ideas. Yet static can mar a piece of writing: infelicities in grammar, structure, composition, word choice, and more. If enough infelicities obscure the writing, the frustration of reading outweighs the benefits. Professor Shookman will quit reading.</p>



<p class="wp-block-paragraph">Professor Shookman marked up our essays with a blue pencil that achieved the status of legend among his students. If you’ve written a paper I’ve coauthored, you’ve probably received PDF drafts replete with green highlighting.<sup><a href="https://quantumfrontiers.com/2026/08/26/nicoles-guide-to-writing-and-editing/#one">1</a></sup> A sticky note explains the reason for each highlighting: “Singular–plural mismatch.” “Active voice &gt;&gt; passive voice.” “Let’s clue the reader in as to this formula’s meaning before lobbing the math at them.” </p>



<p class="wp-block-paragraph">Over the past year, I’ve catalogued the suggestions I write most often on paper drafts. The comments embody principles gleaned from Strunk and White’s <em><a href="https://www.penguinrandomhouse.com/books/294830/the-elements-of-style-illustrated-by-strunk-white-kalman/">The Elements of Style</a></em>; the <a href="https://www.ib.edu.ar/fisica-exp/images/9/95/PhysRev_Style.pdf">Physical Review style guide</a>; other writing guides I esteem; literature whose writing I esteem;<sup><a href="https://quantumfrontiers.com/2026/08/26/nicoles-guide-to-writing-and-editing/#two">2</a></sup> collaborations with professional editors; and writing instructors, including Professor Shookman. Each section below begins with more-important principles, shading into more-nuanced ones.</p>



<p class="wp-block-paragraph">Please use and disseminate these principles. Train your favorite large-language model (LLM) on them, and have the LLM critique your manuscripts. Instruct it to use green highlighting if you wish. Even if the LLM suggests fixes initially, tell it to stop offering suggestions later, so that you can devise the solutions: train not only the LLM, but also yourself. I hope to enjoy your papers as much as Professor Shookman enjoyed his sonatas.</p>


<div class="wp-block-image">
<figure class="aligncenter size-medium"><a href="https://quantumfrontiers.com/wp-content/uploads/2026/08/blue_pencil.jpg"><img alt="" class="wp-image-18206" height="300" src="https://quantumfrontiers.com/wp-content/uploads/2026/08/blue_pencil.jpg?w=300" width="300"/></a></figure>
</div>


<ol class="nicoleyh-superlist">
    <li>
        <strong>Organization</strong>
        <ol>
            <li>Motivate your work; then, present it; and then, explain its physical significance.</li>
            <li>Begin each paragraph with a <a href="https://advice.writing.utoronto.ca/planning/topic-sentences/">topic sentence</a>.</li>
            <li>Begin each section, apart from the introduction and conclusion, with (i) a statement of the takeaway and (ii) an outline of the section. When outlining a section, hyperlink to each subsection. Similar guidelines concern subsections and subsubsections.</li>
            <li>
                Before presenting a piece of math, sketch its meaning and origin. This strategy enables the reader to understand the math as soon as they encounter it. If you throw math at the reader without introducing it, the reader will have to squint at the symbols for a while to figure out what the expression means and where it comes from.
                <ul>
                    <li>Example: To calculate the average work, we substitute the Hamiltonian formula (10) into the definition (12): [equation].</li>
                </ul>
            </li>
            <li>Most citations belong at the ends of (i) sentences and (ii) phrases concluded with commas. Put a citation elsewhere only if you have a compelling reason for doing so.</li>
            <li>
                Bridge each component of your writing to the next component; the next shouldn’t sound like a non sequitur.
                <ul>
                    <li>
                        Suppose that the next sentence refers to (i) a topic mentioned in the previous sentence and (ii) a new topic. Mention (i) before (ii).
                        <ul>
                            <li>Example: Smith <i>et al.</i> applied control theory to the extent possible. The attempt led to intractable equations, unlike our approach.</li>
                            <li>Example of a broken bridge: Smith <i>et al.</i> applied control theory to the extent possible. Our approach does not involve intractable equations, unlike theirs.</li>
                        </ul>
                    </li>
                </ul>
            </li>
            <li>
                Whenever you tell a story, tell it from start to finish, step by step. Derivations, proofs, and descriptions of experiments qualify as stories.
                <ul>
                    <li>This guideline extends to descriptions of experimental setups and of mathematical objects. For example, imagine referring to an element of a subgroup of the group generated by some operators. Did you have to read the preceding sentence multiple times to process it? The sentence begins at the end of a story, then rewinds to the story’s beginning. This structure impedes understanding. The subgroup forms the context for the subgroup element, which one can’t grasp until hearing about the subgroup. The subgroup participates in a similar relationship with the group, as does the group with its generators. Therefore, one should introduce the generators, then the group, then the subgroup, and then the subgroup element.</li>
                </ul>
            </li>
        </ol>
    </li>
    <li>
        <strong>Word choice</strong>
        <ol>
            <li>
                Use strong, specific words, rather than weak words.
                <ol>
                    <li>Verbs and nouns are stronger than adjectives and adverbs.</li>
                    <li>Choose specific verbs (e.g., “prepare,” “evolve,” and “measure”), rather than vague, general verbs (e.g., variants of “to be” and “take,” as in “take a measurement”).</li>
                </ol>
            </li>
            <li>Avoid statements such as “we investigate,” “we study,” and “we analyze.” Such statements don’t relate that you’ve accomplished anything. State what you’ve accomplished. Verbs such as “prove,” “test,” “confirm,” “discover,” and “find” achieve this goal.</li>
            <li>Adverbs such as “importantly” and “remarkably” pollute scientific writing with the authors’ opinions. Demonstrate that a claim is important or that a result is remarkable; then, leave readers to draw their own conclusions. Those conclusions will coincide with yours if you’ve demonstrated your point.</li>
            <li>Use the active voice, rather than the passive voice. Take responsibility for your work. Editors of high-impact scientific journals have endorsed this advice.</li>
            <li>
                Refer to yourself when necessary and only when necessary.
                <ul>
                    <li>
                        Example of unnecessary reference to self: We use the superscript “max” to signify the maximal Fisher information.<br/>
                        Preferable alternative: The superscript “max” signifies the maximal Fisher information.
                    </li>
                    <li>
                        Example of unnecessary reference to self: Our results establish several opportunities for future research. First, we can implement the experimental proposals.<br/>
                        Preferable alternative: Our results establish several opportunities for future research. First, one can implement the experimental proposals.
                    </li>
                    <li>You may use the first-person plural when escorting the reader through a derivation.</li> <ul>
                    <li>Example: We substitute from Eq. (1) into Eq. (2).</li> </ul>
                </ul>
            </li>
            <li>If you’re the only author, don’t use the plural (“we,” “our,” etc.). The usage is inaccurate and misleading. It portrays you as dodging responsibility for your work by dispersing that responsibility across the scientific community.</li>
            <li>Avoid <a href="https://editorsquill.wordpress.com/2015/05/28/how-empty-subjects-weaken-your-writing/">dangling modifiers</a>.</li>
            <li>
                Pair every verb with the appropriate noun.
                <ul>
                    <li>
                        Example of grammatically incorrect text: Equation (1) follows by calculating the sum.
                        <ul>                            
                            <li>One should pair the verb “calculate” with the noun “we,” because “we” undertook the calculating. However, this example’s author omitted the noun out of squeamishness about using the first person in a scientific document. Hence the sentence says that the equation calculates the sum. Equations can’t calculate sums.</li>
                        </ul>
                    </li>
                    <li>
                        Examples of correct alternatives
                        <ul>
                            <li>We derived Eq. (1) by calculating the sum.</li>
                            <li>Equation (1) follows from the evaluation of the sum.</li>
                            <li>Calculating the sum yields Eq. (1).</li>
                        </ul>
                    </li>
                </ul>
            </li>
            <li>Avoid <a href="https://editorsquill.wordpress.com/2015/05/28/how-empty-subjects-weaken-your-writing/">empty subjects</a>.</li>
            <li>
                Include no unnecessary words.
                <ol>
                    <li>“So-called” is unnecessary.</li>
                    <li>“Note that” and “We note that” are unnecessary.</li>
                    <li>“We have that,” used as a preface to a mathematical statement, is unnecessary. One can better serve the reader by prefacing the mathematical statement with (i) a derivation or (ii) a prose description of the statement.</li>
                    <li>Never write “is equal to”; “equals” is more concise.</li>
                    <li>Never write “is able to”; “can” is more concise.</li>
                    <li>Never write “gives an upper bound to” or “places an upper bound on”; “upper-bounds” is more concise. Analogous statements concern lower bounds.</li>
                    <li>Never write “a large number of”; “many” is more concise. Never write “a small number of”; “few” is more concise.</li>
                    <li>Never write “We refer to [symbol] as [name]”; “we call [symbol] [name]” is more concise.</li>
                    <li>Never write “as long as”; “if” is more concise.</li>
                    <li>The symbol <img alt="&gt;" class="latex" src="https://s0.wp.com/latex.php?latex=%3E&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> means “greater than”; and <img alt="\geq" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cgeq&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, “greater than or equal to.” Don’t translate <img alt="&gt;" class="latex" src="https://s0.wp.com/latex.php?latex=%3E&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> into “strictly greater than”; the “strictly” is unnecessary. Analogous statements concern <img alt="&lt;" class="latex" src="https://s0.wp.com/latex.php?latex=%3C&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="\leq" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cleq&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>.</li>
                </ol>
            </li>
            <li>Avoid <a href="https://www.sjsu.edu/writingcenter/docs/handouts/Contractions.pdf">contractions</a>, which are too informal for professional writing.</li>
            <li>The <a href="https://uwaterloo.ca/writing-and-communication-centre/possessives">possessive</a> is not a contraction and belongs in professional writing. It facilitates conciseness.</li>
            <li>
                Use the word “for” only when it belongs. Physicists often write “for” when they mean “if,” “per,” “at,” or something else.
                <ul>
                    <li>
                        Example of inappropriate use: The function vanishes for odd arguments.<br/>
                        Corrected statement: If the argument is odd, the function vanishes.
                    </li>
                    <li>
                        Example of inappropriate use: We performed 10 trials for each parameter value.<br/>
                        Corrected statement: We performed 10 trials per parameter value.
                    </li>
                    <li>
                        Example of inappropriate use: The function is smaller for small x values.<br/>
                        Corrected statement: The function is smaller at small x values.
                    </li>
                </ul>
            </li>
            <li>Write “we evolve the state,” “we measure,” etc. only if you’re an experimentalist who undertakes those actions. Alternatives include “Consider measuring,” “Suppose the system evolves,” and the command tense (e.g., “One can measure this quantity as follows: prepare the qubit in <img alt="\lvert 0\rangle" class="latex" src="https://s0.wp.com/latex.php?latex=%5Clvert+0%5Crangle&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. Evolve it under <img alt="H" class="latex" src="https://s0.wp.com/latex.php?latex=H&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>…”).</li>
            <li>The condition <img alt="x\ll y" class="latex" src="https://s0.wp.com/latex.php?latex=x%5Cll+y&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> defines a regime, not a limit. The conditions <img alt="\lim_{x\to0}" class="latex" src="https://s0.wp.com/latex.php?latex=%5Clim_%7Bx%5Cto0%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="\lim_{y\to\infty}" class="latex" src="https://s0.wp.com/latex.php?latex=%5Clim_%7By%5Cto%5Cinfty%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> define limits and are inequivalent to <img alt="x\ll y" class="latex" src="https://s0.wp.com/latex.php?latex=x%5Cll+y&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>.</li>
            <li>Write “first,” “second,” “last,” etc., not “firstly,” “secondly,” “lastly,” etc. (I defer in this matter to <i>The Elements of Style</i>.)</li>
            <li>Humans can assume, suppose, etc. Mathematical expressions, protocols, etc. can’t.</li>
            <li>One multiplies factors together and sums terms. Don’t call factors terms and vice versa.</li>
            <li>If you mean “X equals Y,” say so. Don’t write “X agrees with Y,” “X matches Y,” or “we identify X with Y.” The latter three phrases are vaguer, and two of them contain more words, than “X equals Y.”</li>
            <li>
                Regarding the words “general” and “generally”:
                <ol>
                    <li>A general object subsumes every example of that object. If any example behaves unlike a supposedly general object, don’t call the object general.</li>
                    <li>
                        Many claims contain the term “general,” “generally,” or “in general” but don’t need the term.
                        <ul>
                            <li>Example of a sentence that contains “generally”: The terms generally commute.</li>
                            <li>Equivalent, more concise sentence: The terms commute.</li>
                        </ul>
                    </li>
                    <li>Physicists tend to use the words “general” and “generic” differently. By “general,” physicists usually mean “subsuming every example.” By “generic,” we usually mean “typical,” or “common.”</li>
                </ol>
            </li>
            <li>
                “Then” makes sense (i) in discussions of chronology and (ii) in if–then statements. Don’t use “then” outside these contexts.
                <ul>
                    <li>Example of inappropriate use: “Define <img alt="X:=\ldots" class="latex" src="https://s0.wp.com/latex.php?latex=X%3A%3D%5Cldots&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> Then Y.”</li>
                    <li>Examples of appropriate alternatives <ul>
                       <li>Define <img alt="X:=\ldots" class="latex" src="https://s0.wp.com/latex.php?latex=X%3A%3D%5Cldots&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> This definition implies Y.</li>
                       <li>If <img alt="X:=\ldots \, ," class="latex" src="https://s0.wp.com/latex.php?latex=X%3A%3D%5Cldots+%5C%2C+%2C&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> then Y.</li>
                       <li>Define <img alt="X:=\ldots \, ," class="latex" src="https://s0.wp.com/latex.php?latex=X%3A%3D%5Cldots+%5C%2C+%2C&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> such that Y.</li></ul>
                </li></ul>
            </li>
            <li>Don’t justify any equation with “we used that [such-and-such is true],” which violates the rules of grammar. Grammatically correct alternatives include “We applied [a property],” “The equation follows from [a property],” and “…since [such-and-such is true].”</li>
            <li>
                Regarding <a href="https://en.wikipedia.org/wiki/Grammatical_tense">tense</a>:
                <ol>
                    <li>When describing what you’ve accomplished, use only one tense.</li>
                    <li>Experiments happened in the past, so describe them in the past tense.</li>
                    <li>
                        When describing a proof’s steps, use the present tense.
                        <ul>
                            <li>Example: We Taylor-approximate the function about <img alt="x=0" class="latex" src="https://s0.wp.com/latex.php?latex=x%3D0&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. Substituting into Eq. (1) yields [equation].</li>
                        </ul>
                    </li>
                </ol>
            </li>
            <li>
                Nouns, verbs, and adjectives should agree about whether a quantity is singular or plural.
                <ul>
                    <li>Example of singular–plural mismatch: The equations are a rule for evolving the cellular automaton.</li>
                    <li>Example alternative: The equations form a rule for evolving the cellular automaton.</li>
                </ul>
            </li>
            <li>
                “Admit of” means “allow for,” or “permit.” The phrase needs the “of.”
                <ul>
                    <li>Example: The formula admits of the following interpretation.</li>
                </ul>

            </li>
        </ol>
    </li>
    <li>
        <strong>Punctuation</strong>
        <ol>
            <li>Consider any list that contains at least three items. If no item contains a comma, separate the items with commas. If any item contains a comma, separate the items with semicolons.</li>
            <li>In American English, periods and commas belong inside quotation marks. (Example: She told me, “Have a good day.”) In British English, periods and commas belong outside quotation marks. (Example: She told me, “Have a good day”.)</li>
            <li>To write quotation marks in LaTeX, don’t use your keyboard’s quotation-mark key; use the <a href="https://www.comp.nus.edu.sg/~kanmy/latex/ltx-433.html">appropriate keys</a>.</li>
            <li>
                Regarding hyphens:
                <ol>
                    <li>The hyphen (-) feeds into punctuation of three types: the hyphen (-), the en dash (–), and the em dash (—).</li>
                    <li>The hyphen appears in some compound words, as in “non-negative.”</li>
                    <li>
                        In American English, em dashes can separate ideas within a sentence. Don’t separate any em dash from neighboring text with a space.
                        <ul>
                            <li>Example of appropriate use: The sample—the only product of this experiment—barely survived.</li>
                            <li>Example of inappropriate use: The sample — the only product of this experiment — barely survived.</li>
                            <li>Example of appropriate use: He told me only one sample had survived—hardly what I wanted to hear.</li>
                        </ul>
                    </li>
                    <li>
                        <a href="https://danieljtortora.com/blog/en-dashes-and-em-dashes-part-1">This</a> article specifies how to use the en dash. One use is “to separate the names of two or more people used as a compound modifier.”
                        <ul>
                            <li>Example: Feynman–Kitaev clock</li>
                        </ul>
                    </li>
                    <li>Hyphenate <a href="https://www.grammar-monster.com/lessons/hyphens_in_compound_adjectives.htm">compound adjectives</a>.</li>
                    <li>
                        If an adverb ends in “-ly,” it probably shouldn’t precede a hyphen.
                        <ul>
                            <li>Example of inappropriate hyphenation: strongly-coupled systems</li>
                        </ul>
                    </li>
                    <li>Follow a <a href="https://www.grammarly.com/blog/grammar/prefixes/">prefix</a> with a hyphen if and only if the <a href="https://cdn.journals.aps.org/files/styleguide-pr.pdf">Physical Review style guide</a> indicates that you should.</li>
                </ol>
            </li>
            <li>A complete <a href="https://www.grammarly.com/blog/grammar/clauses/">clause</a> must follow any semicolon (unless the semicolon separates items in a list).</li>
        </ol>
    </li>
    <li>
        <strong>Math</strong>
        <ol>
            <li>Introduce only necessary notation, which readers will have enough trouble remembering. If a mathematical symbol appears only once, eliminate it. If a symbol appears only twice, try to eliminate it.</li>
            <li>Every sentence must obey the rules of English grammar, punctuation, and syntax, regardless of whether the sentence contains mathematical symbols. All math-containing sentences must end with punctuation marks. If a sentence contains a list of mathematical expressions, precede the final expressions with an “and.” If the list contains at least three mathematical expressions, separate them with commas.</li>
            <li>Introduce almost every mathematical symbol before you use it. If you introduce a symbol after using it, the reader will encounter the first use, stop, feel confused for a while, tentatively continue, find the definition, return to the earlier use to understand it, and then progress again. This back-and-forth breaks up the reading process. You may define a mathematical symbol after using it only if (i) the symbol is very common, known to nearly all physicists, and unmistakeable and (ii) defining the symbol earlier would disrupt the text’s flow.</li>
            <li>
                If you define a new function, denote it by only one letter. (I defer in this matter to the <a href="https://cdn.journals.aps.org/files/styleguide-pr.pdf">Physical Review style guide</a>.)
                <ul>
                    <li>Example: <img alt="f(x,y,z)" class="latex" src="https://s0.wp.com/latex.php?latex=f%28x%2Cy%2Cz%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></li>
                    <li>Examples of disallowed notation: <img alt="fxn(x,y,z)" class="latex" src="https://s0.wp.com/latex.php?latex=fxn%28x%2Cy%2Cz%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, <img alt="{\rm fxn}(x,y,z)" class="latex" src="https://s0.wp.com/latex.php?latex=%7B%5Crm+fxn%7D%28x%2Cy%2Cz%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></li>
                </ul>
            </li>
            <li>
                Suppose that a superscript or subscript stands for a word or phrase without representing any variable or constant. The superscript/subscript must not be italicized. (I defer in this matter to <a href="https://cdn.journals.aps.org/files/styleguide-pr.pdf">Physical Review style guide</a>.)
                <ul>
                    <li>Example: Let <img alt="x_{\mathrm{meas}}" class="latex" src="https://s0.wp.com/latex.php?latex=x_%7B%5Cmathrm%7Bmeas%7D%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> denote the measurement outcome.</li>
                </ul>
            </li>
            <li>
                If a variable or constant appears in a superscript, parenthesize it. The parentheses communicate that the superscript isn’t an exponent.
                <ul>
                    <li>Example: Let <img alt="\sigma_z^{(j)}" class="latex" src="https://s0.wp.com/latex.php?latex=%5Csigma_z%5E%7B%28j%29%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> denote the Pauli-<img alt="z" class="latex" src="https://s0.wp.com/latex.php?latex=z&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> operator of qubit <img alt="j." class="latex" src="https://s0.wp.com/latex.php?latex=j.&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></li>
                    <li>If a superscript is not italicized (stands for a word or phrase), don’t parenthesize it.</li>
                </ul>
            </li>
            <li>
                Regarding the definition of a symbol <img alt="A" class="latex" src="https://s0.wp.com/latex.php?latex=A&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>:
                <ol>
                    <li>If you write <img alt="A" class="latex" src="https://s0.wp.com/latex.php?latex=A&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> alone on one side of a defining equation, use \coloneqq or \eqqcolon: <img alt="A" class="latex" src="https://s0.wp.com/latex.php?latex=A&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> \coloneqq [expression], or [expression] \eqqcolon <img alt="A" class="latex" src="https://s0.wp.com/latex.php?latex=A&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. The symbols \coloneqq and \eqqcolon relate more information than does <img alt="\equiv" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cequiv&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, encoding directionality.</li>
                    <li>Use <img alt="\equiv" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cequiv&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> if <img alt="A" class="latex" src="https://s0.wp.com/latex.php?latex=A&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> does not appear alone on its side of the equation: [function of <img alt="A" class="latex" src="https://s0.wp.com/latex.php?latex=A&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>] <img alt="\equiv" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cequiv&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> [result of replacing <img alt="A" class="latex" src="https://s0.wp.com/latex.php?latex=A&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> with its definition in the equation’s left-hand side].</li>
                </ol>
            </li>
            <li>
                Refer to the Cartesian axes using the formatting “[italicized letter]-axis.” Don’t include any hat, boldface, or \vec symbol.
                <ul>
                    <li>Example: <img alt="x" class="latex" src="https://s0.wp.com/latex.php?latex=x&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>-axis</li>
                </ul>
            </li>
            <li>Avoid denoting any index by <img alt="i" class="latex" src="https://s0.wp.com/latex.php?latex=i&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, which means <img alt="\sqrt{-1}" class="latex" src="https://s0.wp.com/latex.php?latex=%5Csqrt%7B-1%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> to physicists. Use <img alt="j" class="latex" src="https://s0.wp.com/latex.php?latex=j&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> instead, unless you’re writing for engineers (who denote <img alt="\sqrt{-1}" class="latex" src="https://s0.wp.com/latex.php?latex=%5Csqrt%7B-1%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> by <img alt="j" class="latex" src="https://s0.wp.com/latex.php?latex=j&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>).</li>
            <li>Don’t use the lowercase letter l (“ell”) as an index; readers might mistake it for a one. Use <img alt="\ell" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cell&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> (\ell) instead.</li>
            <li>Give every set-off equation a number. Readers (and coauthors) may want to refer to the equation easily when discussing the paper. Save them (and us) from having to say, e.g., “that equation halfway down page three.”</li>
            <li>When writing a set-off mathematical expression, use the align environment, not the equation environment. Using the align environment, one can easily extend an expression across multiple lines.</li>
            <li>
                Regarding a set-off mathematical expression that extends across multiple lines:
                <ol>
                    <li>
                        Format the expression as follows by default.
                        <ol>
                            <li>Put an &amp; symbol immediately leftward of the first = sign or analogous symbol (e.g., <img alt="\leq" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cleq&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>).</li>
                            <li>If any subsequent line begins with another = sign (or analogous symbol), put an &amp; immediately leftward of the symbol. (I’ll stop writing “or analogous symbol.”)</li>
                            <li>Suppose that a subsequent line begins with a <img alt="+" class="latex" src="https://s0.wp.com/latex.php?latex=%2B&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, –, <img alt="\times" class="latex" src="https://s0.wp.com/latex.php?latex=%5Ctimes&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, or <img alt="/" class="latex" src="https://s0.wp.com/latex.php?latex=%2F&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. Find the symbol immediately rightward of the initial = sign. Begin the new line directly below that symbol.</li>
                        </ol>
                        <ul>
                            <li>
                                Example:
                                <img src="https://quantumfrontiers.com/wp-content/uploads/2026/08/screenshot-2026-08-25-at-6.34.48-pm.png"/>
                            </li>
                        </ul>
                    </li>
                    <li>
                        Modify the default formatting if necessary (a) to reduce the number of lines used in a <em>PRL</em> submission or (b) if the initial = appears awkwardly far to the right.
                        <ul>
                            <li>
                                Example of (b):
                                <img src="https://quantumfrontiers.com/wp-content/uploads/2026/08/2-3.png?w=916"/>
                            </li>
                        </ul>
                    </li>
                    <li>
                        Suppose a new line begins with a term or factor, such as the <img alt="jx^8" class="latex" src="https://s0.wp.com/latex.php?latex=jx%5E8&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> in the example under (A). Put the corresponding <img alt="+" class="latex" src="https://s0.wp.com/latex.php?latex=%2B&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, –, <img alt="\times" class="latex" src="https://s0.wp.com/latex.php?latex=%5Ctimes&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, or <img alt="/" class="latex" src="https://s0.wp.com/latex.php?latex=%2F&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> at the beginning of the new line, not at the end of the previous line.
                        <ul>
                            <li>
                                Examples of inappropriate placement:
                                <img src="https://quantumfrontiers.com/wp-content/uploads/2026/08/screenshot-2026-08-23-at-9.14.22-am.png?w=994"/>
                            </li>
                        </ul>                        
                    </li>
                </ol>
            </li>
            <li>The symbol <img alt="\approx" class="latex" src="https://s0.wp.com/latex.php?latex=%5Capprox&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> means “approximately equals”; and ~, “scales as.” Approximations convey more information than scaling relations do.</li>
            <li>Use <a href="https://mathworld.wolfram.com/Big-ONotation.html">big-O-type notation</a> or ~ symbols, not both; they’re partially redundant.</li>
            <li>
                \ldots, rather than \cdots, should stand in for elements that fit a pattern.
                <ul>
                    <li>Example: <img alt="x_1,x_2,\ldots,x_n" class="latex" src="https://s0.wp.com/latex.php?latex=x_1%2Cx_2%2C%5Cldots%2Cx_n&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></li>
                </ul>
            </li>
            <li>
                When using \ldots as in the previous rule, present at least two initial examples of the pattern. One can’t define the pattern.
                <ul>
                    <li>Contains insufficient examples: <img alt="x_1,\ldots,x_n \, ." class="latex" src="https://s0.wp.com/latex.php?latex=x_1%2C%5Cldots%2Cx_n+%5C%2C+.&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> For example, if <img alt="n" class="latex" src="https://s0.wp.com/latex.php?latex=n&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is odd, then <img alt="x_1, x_2, \ldots, x_n" class="latex" src="https://s0.wp.com/latex.php?latex=x_1%2C+x_2%2C+%5Cldots%2C+x_n&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="x_1, x_3, \ldots, x_n" class="latex" src="https://s0.wp.com/latex.php?latex=x_1%2C+x_3%2C+%5Cldots%2C+x_n&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> fit the template.</li>
                </ul>
            </li>
            <li>Parentheses (), square brackets [], and curly braces {} are delimiters. If you nest them, do so in the order dictated by the <a href="https://cdn.journals.aps.org/files/styleguide-pr.pdf">Physical Review style guide</a>.</li>
            <li>If delimiters enclose a symbol, it shouldn’t protrude above or below them (unless the delimiters would have to be grotesquely enormous). Use the \left and \right commands if the delimiters appear on the same line.</li>
            <li>
                An operator <img alt="O" class="latex" src="https://s0.wp.com/latex.php?latex=O&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> isn’t a matrix; a matrix represents an operator in terms of a particular basis. Therefore, no equals sign should interrelate an <img alt="O" class="latex" src="https://s0.wp.com/latex.php?latex=O&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and a matrix. An arrow can.
                <ul>
                    <li>Example: <img alt="O\to\begin{bmatrix}1&amp;0\\0&amp;2\end{bmatrix}" class="latex" src="https://s0.wp.com/latex.php?latex=O%5Cto%5Cbegin%7Bbmatrix%7D1%260%5C%5C0%262%5Cend%7Bbmatrix%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></li>
                </ul>
            </li>
          <li>Every real number is complex. Don’t say “complex” if you mean “nonreal.”</li>
          <li>Consider introducing a mathematical symbol in a prose sentence without using a comma or colon. Put the symbol immediately after the word that names the object represented by the symbol.<ul>
            <li>Example of inappropriate placement: the set of real numbers <img alt="\{ a, b \}" class="latex" src="https://s0.wp.com/latex.php?latex=%5C%7B+a%2C+b+%5C%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></li>
            <li>Examples of appropriate placements<ul> 
              <li>the set <img alt="\{a, b\}" class="latex" src="https://s0.wp.com/latex.php?latex=%5C%7Ba%2C+b%5C%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> of real numbers</li>
              <li>the set of real numbers <img alt="a" class="latex" src="https://s0.wp.com/latex.php?latex=a&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="b" class="latex" src="https://s0.wp.com/latex.php?latex=b&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></li>
              <li>Recall the set of real numbers, <img alt="\{a, b\}" class="latex" src="https://s0.wp.com/latex.php?latex=%5C%7Ba%2C+b%5C%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, in Lemma 1.</li>
            </ul></li>
          </ul></li>
        </ol>
    </li>
    <li>
        <strong>More mechanics of writing</strong>
        <ol>
            <li>Use concise sentences, as advocated for in <em>The Elements of Style</em>. The reader can hold only so many ideas in their head at once.</li>
            <li>
                Structure sentences simply, as advocated for in <em>The Elements of Style</em>. The reader should be able to grasp each sentence easily.
                <ul>
                    <li>Avoid nesting ideas within a sentence, to avoid convoluting the sentence’s structure.</li><ul>
                    <li>Example of sentence with convoluted, nested structure: Any model of equilibrium and nonequilibrium behaviors of systems observed in tabletop experiments and high-energy colliders must obey the laws of relativistic quantum mechanics.</li>
                    <li>Visualization of the nesting: [Any model of ([(equilibrium and nonequilibrium) behaviors] of {systems observed in [(tabletop experiments) and (high-energy colliders)]})] must obey [the laws of (relativistic quantum mechanics)].</li></ul>
                </ul>
            </li>
            <li>The ideal paper title has the structure of a newspaper headline: it presents a claim, containing <a href="https://soundwriting.pugetsound.edu/universal/basic-sentence-structure.html">a subject and a predicate</a>.</li>
            <li>
                Regarding abbreviations:
                <ol>
                    <li>Don’t abbreviate the first word in any sentence.</li>
                    <li>Abbreviate “Figure,” “Section,” “Professor,” and “Appendix” if such a word appears partway through a sentence.</li>
                    <li>Don’t abbreviate “Sections.”</li>
                </ol>
            </li>
            <li>
                Regarding acronyms:
                <ol>
                    <li>Write every acronym in capital letters, as per the <a href="https://cdn.journals.aps.org/files/styleguide-pr.pdf">Physical Review style guide</a>.</li>
                    <li>Introduce each acronym the first time you use it.</li>
                    <li>Thereafter, use only the acronym, not the spelled-out phrase, throughout the rest of the document’s main text. You may spell out the phrase in section, figure, and table titles if doing so improves the document’s clarity.</li>
                </ol>
            </li>
            <li>Every paragraph should contain at least three sentences.</li>
            <li>Wherever you insert a blank line into your LateX code, a new paragraph begins in the corresponding PDF. Insert a blank line only if you wish to begin a new paragraph. This advice applies immediately before and after set-off equations.</li>
            <li>Never begin a subsection immediately after a section title. Between the two titles, overview the section. Analogous rules govern subsections and subsubsections.</li>
            <li>
                Put the word “only” in the appropriate place.
                <ul>
                    <li>For example, suppose you’ve sampled data at a point <img alt="x=0" class="latex" src="https://s0.wp.com/latex.php?latex=x%3D0&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> in parameter space and sampled data at no other points. “We sampled data only at <img alt="x=0" class="latex" src="https://s0.wp.com/latex.php?latex=x%3D0&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>” is correct; “We only sampled data at <img alt="x=0" class="latex" src="https://s0.wp.com/latex.php?latex=x%3D0&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>” is probably not. The latter claim means that (i) you might have sampled data at <img alt="x=0" class="latex" src="https://s0.wp.com/latex.php?latex=x%3D0&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and (ii) you did nothing to the <img alt="x=0" class="latex" src="https://s0.wp.com/latex.php?latex=x%3D0&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> data apart from sample it: you didn’t analyze the <img alt="x=0" class="latex" src="https://s0.wp.com/latex.php?latex=x%3D0&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> data, discuss the <img alt="x=0" class="latex" src="https://s0.wp.com/latex.php?latex=x%3D0&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> data, etc.</li>
                </ul>
            </li>
        </ol>
    </li>
    <li>
        <strong>When in doubt, consult the Physical Review style guide or The Elements of Style.</strong>
        <ul>
            <li>If those references don’t contain the information you seek, search for it in online writing guides. Not all such guides have equal merit, however. Lean toward guides written by human editors or published by college writing centers.</li>
        </ul>
    </li>
</ol>


<div class="wp-block-image">
<figure class="aligncenter size-thumbnail"><a href="https://quantumfrontiers.com/wp-content/uploads/2026/08/green.jpeg"><img alt="" class="wp-image-18207" height="150" src="https://quantumfrontiers.com/wp-content/uploads/2026/08/green.jpeg?w=150" width="150"/></a></figure>
</div>


<p class="wp-block-paragraph" id="one"><sup>1</sup> Collaborators have wondered why I use green; a student guessed it’s my favorite color. It isn’t; but I bleed green, having graduated from the Big Green, also known as Dartmouth College. Sometimes, I highlight certain pieces of text for one reason (e.g., to point out logical inconsistencies) and other text for another reason (e.g., to point out grammatical inconsistencies). Green distinguishes the first highlightings, while orange distinguishes the second: when not bleeding <a href="https://communications.dartmouth.edu/guides-and-tools/design-guidelines/dartmouth-colors">Dartmouth green</a>, I bleed <a href="https://identity.caltech.edu/colors">Caltech orange</a>.</p>



<p class="wp-block-paragraph" id="two"><sup>2</sup> Don’t learn how to write from physics papers. </p></div>
    </content>
    <updated>2026-08-28T15:52:54Z</updated>
    <published>2026-08-26T23:53:01Z</published>
    <category scheme="https://quantumfrontiers.com" term="Reflections"/>
    <category scheme="https://quantumfrontiers.com" term="The expert's corner"/>
    <author>
      <name>Nicole Yunger Halpern</name>
    </author>
    <source>
      <id>http://quantumfrontiers.com/feed/atom/</id>
      <link href="https://quantumfrontiers.com" rel="alternate" type="text/html"/>
      <link href="https://quantumfrontiers.com/feed/atom/" rel="self" type="application/atom+xml"/>
      <link href="https://quantumfrontiers.com/osd.xml" rel="search" title="Quantum Frontiers" type="application/opensearchdescription+xml"/>
      <link href="https://s1.wp.com/opensearch.xml" rel="search" title="WordPress.com" type="application/opensearchdescription+xml"/>
      <link href="https://quantumfrontiers.com/?pushpress=hub" rel="hub" type="text/html"/>
      <subtitle xml:lang="en">A blog by the Institute for Quantum Information and Matter @ Caltech</subtitle>
      <title xml:lang="en">Quantum Frontiers</title>
      <updated>2026-09-06T13:17:26Z</updated>
    </source>
  </entry>

  <entry xml:lang="en">
    <id>http://quomodocumque.wordpress.com/?p=8840</id>
    <link href="https://quomodocumque.wordpress.com/2026/08/27/new-uncertainty-videos/" rel="alternate" type="text/html"/>
    <title>New uncertainty videos!</title>
    <summary>A couple of new videos of me talking to people, which feature some themes that are going to be in Don’t Be Too Sure, as well as some stuff I’ve written about before. Both of these are long, so only watch if you, I dunno, have a long series of physical therapy exercises you have […]</summary>
    <content type="xhtml"><div xmlns="http://www.w3.org/1999/xhtml"><p class="wp-block-paragraph">A couple of new videos of me talking to people, which feature some themes that are going to be in <em>Don’t Be Too Sure</em>, as well as some stuff I’ve written about before.  Both of these are long, so only watch if you, I dunno, have a long series of physical therapy exercises you have to do or something! </p>



<p class="wp-block-paragraph">On the Particles of Thought podcast for PBS:<br/></p>



<figure class="wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio"><div class="wp-block-embed__wrapper">

</div></figure>



<p class="wp-block-paragraph">And talking to the Wisconsin Mathematics Council about the virtue of uncertainty:<br/></p>



<figure class="wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio"><div class="wp-block-embed__wrapper">

</div></figure>



<p class="wp-block-paragraph"/></div>
    </content>
    <updated>2026-08-27T20:59:22Z</updated>
    <published>2026-08-27T20:59:22Z</published>
    <category term="math"/>
    <category term="don't be too sure"/>
    <category term="videos"/>
    <author>
      <name>JSE</name>
    </author>
    <source>
      <id>https://quomodocumque.wordpress.com</id>
      <logo>https://s2.wp.com/i/webclip.png</logo>
      <link href="https://quomodocumque.wordpress.com/feed/" rel="self" type="application/rss+xml"/>
      <link href="https://quomodocumque.wordpress.com" rel="alternate" type="text/html"/>
      <link href="https://quomodocumque.wordpress.com/osd.xml" rel="search" title="Quomodocumque" type="application/opensearchdescription+xml"/>
      <link href="https://quomodocumque.wordpress.com/?pushpress=hub" rel="hub" type="text/html"/>
      <subtitle>Math, Madison, food, the Orioles, books, my kids.</subtitle>
      <title>Quomodocumque</title>
      <updated>2026-09-08T04:58:11Z</updated>
    </source>
  </entry>

  <entry>
    <id>tag:blogger.com,1999:blog-13869903.post-5186653824870563201</id>
    <link href="https://nanoscale.blogspot.com/feeds/5186653824870563201/comments/default" rel="replies" title="Post Comments" type="application/atom+xml"/>
    <link href="https://www.blogger.com/comment/fullpage/post/13869903/5186653824870563201" rel="replies" title="4 Comments" type="text/html"/>
    <link href="https://www.blogger.com/feeds/13869903/posts/default/5186653824870563201" rel="edit" type="application/atom+xml"/>
    <link href="https://www.blogger.com/feeds/13869903/posts/default/5186653824870563201" rel="self" type="application/atom+xml"/>
    <link href="https://nanoscale.blogspot.com/2026/07/phds-funding-models-and-how-long.html" rel="alternate" title="PhDs - how long a doctorate should take, and a new pilot program" type="text/html"/>
    <title>PhDs - how long a doctorate should take, and a new pilot program</title>
    <content type="xhtml"><div xmlns="http://www.w3.org/1999/xhtml"><p>I think it's safe to say that most people who've considered the issue think that a doctoral degree in the sciences and engineering in the US often takes too long.  </p><p><i>How long?</i>  According to the latest data (see <a href="https://ncses.nsf.gov/surveys/earned-doctorates/2024#data" target="_blank">here</a>, Table 1-12), the <a href="https://en.wikipedia.org/wiki/Median" target="_blank">median</a> time to degree in the physical sciences, for example, is 5.7 years after starting the program, while in all of engineering it's 5.3 years.  </p><p><i>Too long for what?</i>  Well, life, basically.  Any decision to go to grad school is inherently a trade-off with opportunity costs.  Graduate stipends remain low compared to expected wages in entry-level (bachelors degree-qualified) positions in the sciences and engineering in industry.  The long duration of doctoral programs is certainly a powerful disincentive for many who might be interested but are under financial pressures.  Family considerations are also a major factor.  From the perspective of basically any career path, thanks to the <a href="https://en.wikipedia.org/wiki/Time_value_of_money" target="_blank">time value of money</a> and ideas of seniority, it's better to get going earlier if you have the qualifications for the particular job.  Companies would rather hire younger (cheaper) people.</p><p>So, there are already strong reasons to think about shortening doctoral programs.  Now, with the proposed change in duration of status of student visas (<a href="https://www.dhs.gov/news/2026/07/16/trump-administration-issues-final-rule-end-foreign-student-visa-abuse" target="_blank">rule here</a>, with plenty of editorializing; legal challenges very likely forthcoming in September) to four years, there is additional pressure. </p><p><i>Why do US programs take so long?  Don't they give PhDs in three years in the UK and Europe?</i>  In the UK and Europe, a student enters a doctoral program after already pursuing and receiving a masters degree, with grad level coursework taking place there.  Thus they go directly into research.  In the US, in contrast, it is far more common for students to go directly into the doctoral program.  Likewise, in the US, it is far more common for funding for students to go through PI-written research proposals, while in the UK, the students come funded, so to speak.  </p><p/><div class="separator" style="clear: both; text-align: center;"><a href="https://blogger.googleusercontent.com/img/a/AVvXsEhKtOmdG-jA4uz9lcESizWhEZXoA1q20s3GKwv7ZH5sLdmW3heuQQZQTcbgEN9Ilt_do3H10nVsC4nqYf8i-BUMDjaJAe2r7r_XFTcZJ9-QC3EMWtEopFiYP6XRN63O4XviiSsEz75vkED9wPRho2Smf91Hlj8V_72NrelLtF01_cNmHcxo8wAHOw" style="clear: left; float: left; margin-bottom: 1em; margin-right: 1em;"><img alt="" height="182" src="https://blogger.googleusercontent.com/img/a/AVvXsEhKtOmdG-jA4uz9lcESizWhEZXoA1q20s3GKwv7ZH5sLdmW3heuQQZQTcbgEN9Ilt_do3H10nVsC4nqYf8i-BUMDjaJAe2r7r_XFTcZJ9-QC3EMWtEopFiYP6XRN63O4XviiSsEz75vkED9wPRho2Smf91Hlj8V_72NrelLtF01_cNmHcxo8wAHOw" width="320"/></a></div><br/>Enter <a href="https://www.nsf.gov/news/nsf-partners-universities-industry-pilot-initiative-four" target="_blank">a new pilot program</a> from NSF, the <b>UIDP</b> [<a href="https://uidp.org/" target="_blank">University Industry Demonstrated Partnership</a>] <b>Industry-Integrated PhD Scholars Program</b> (I-PhD). The idea is to shorten the doctorate to four years, with at least one of those years on-site at a company.  As the announcement says, "Students' ﬁrst year of funding will be provided by their universities, with the remaining years covered by NSF. Industry partners will provide matching commitments to cover at least one year of practical experience conducting dissertation research at a company site. Students will be co-advised by academic and industry mentors, equipping them with critical skills for their future careers."  The initial plan is $47M over five years, and there will be a webinar (see <a href="https://uidp.org/i-phd-scholars/" target="_blank">here</a>) next week about this.   (Up front, I do want to disagree with the framing that existing PhD programs are geared exclusively for academic careers.  It's well established that the fraction of PhDs in the sciences and engineering who go on to become faculty is low, and most go into industry.  Faculty PIs know this.  Students know this.  The problem solving and analytical skills taught in doctoral programs remain highly valued outside academia, at least until AI replaces us all.)<p/><p>This is certainly a very interesting pilot program.  There are rumors that the DOE Genesis Mission is going to put something extremely similar in place as well.   The implementation details will be <i>enormously</i> important.  (For example:  Who is eligible?  Who handles the coordination between industry and the university - that is, who does the match-making and how?   At the department-company level and at the particular academic/industrial advisor level?   How will intellectual property be handled?  Publications?  Project design? If there are economic challenges, how committed are the companies?)  Given that this is a form of NSF fellowship, it seems highly likely that it will only be open to US citizens and permanent residents.  Obviously, not every discipline is well-suited to this, in terms of there being a ready supply of companies set to buy in.  Still, it is absolutely worth seeing how this works.</p><p><b>Update</b>:  Thanks to one of my colleagues for pointing out the fine print, which is <a href="https://uidp.org/wp-content/uploads/2026/07/UIDP-I-PhD-Scholars-Program-Guide.pdf" target="_blank">here</a>.  In brief, as expected this is only open to US citizens and permanent residents.  No indirect costs allowed.  There is a $16K cost-of-education piece that looks like a substitute for grad tuition.  The intellectual property issues have to be ironed out between the university and the company before the start.  Perhaps not unexpectedly, this is most likely to work well for programs and PIs who already have close collaborations with particular companies.  Engineering disciplines are most likely to fit well here, it seems, while basic research farther away from applications will have more challenges.  (Question:  will finance companies or AI materials companies be interested in supporting theorist/computational scientists through this mechanism?)</p><p><br/></p></div>
    </content>
    <updated>2026-08-26T13:18:44Z</updated>
    <published>2026-07-30T15:30:21Z</published>
    <author>
      <name>Douglas Natelson</name>
      <email>noreply@blogger.com</email>
      <uri>http://www.blogger.com/profile/13340091255404229559</uri>
    </author>
    <source>
      <id>tag:blogger.com,1999:blog-13869903</id>
      <category term="concepts"/>
      <author>
        <name>Douglas Natelson</name>
        <email>noreply@blogger.com</email>
        <uri>http://www.blogger.com/profile/13340091255404229559</uri>
      </author>
      <link href="https://nanoscale.blogspot.com/feeds/posts/default" rel="http://schemas.google.com/g/2005#feed" type="application/atom+xml"/>
      <link href="https://www.blogger.com/feeds/13869903/posts/default?alt=atom" rel="self" type="application/atom+xml"/>
      <link href="https://nanoscale.blogspot.com/" rel="alternate" type="text/html"/>
      <link href="http://pubsubhubbub.appspot.com/" rel="hub" type="text/html"/>
      <link href="https://www.blogger.com/feeds/13869903/posts/default?alt=atom&amp;start-index=26&amp;max-results=25" rel="next" type="application/atom+xml"/>
      <subtitle>A blog about condensed matter and nanoscale physics.  Why should high energy and astro folks have all the fun?</subtitle>
      <title>nanoscale views</title>
      <updated>2026-09-07T18:05:56Z</updated>
    </source>
  </entry>

  <entry xml:lang="en">
    <id>http://terrytao.wordpress.com/?p=18082</id>
    <link href="https://terrytao.wordpress.com/2026/08/25/rotating-needles-in-space-the-road-to-the-kakeya-conjecture-and-why-it-matters/" rel="alternate" type="text/html"/>
    <link href="https://terrytao.wordpress.com/2026/08/25/rotating-needles-in-space-the-road-to-the-kakeya-conjecture-and-why-it-matters/#comments" rel="replies" type="text/html"/>
    <link href="https://terrytao.wordpress.com/2026/08/25/rotating-needles-in-space-the-road-to-the-kakeya-conjecture-and-why-it-matters/feed/atom/" rel="replies" type="application/atom+xml"/>
    <title xml:lang="en">Rotating needles in space: the road to the Kakeya conjecture, and why it matters</title>
    <summary xml:lang="en">A recent tradition of the ICM is to have a non-technical popular article written for each of its medallists. (This is separate from the older tradition of having a laudatio for the winner, which is similar but aimed at a more advanced audience.) I was approached to write such an article for Hong Wang on […]</summary>
    <content type="xhtml" xml:lang="en"><div xmlns="http://www.w3.org/1999/xhtml"><p class="wp-block-paragraph">A recent tradition of the ICM is to have a non-technical popular article written for each of its medallists.  (This is separate from the older tradition of having a laudatio for the winner, which is similar but aimed at a more advanced audience.)  I was approached to write such an article for Hong Wang on the occasion of her Fields Medal.  I have uploaded my initial version of this article, “<a href="https://arxiv.org/abs/2608.22209">Rotating needles in space: the road to the Kakeya conjecture, and why it matters</a>“, to the arXiv.  Chris Sogge gave the corresponding laudatio; both should eventually appear in the Proceedings of the ICM.</p></div>
    </content>
    <updated>2026-08-26T06:51:18Z</updated>
    <published>2026-08-26T06:51:18Z</published>
    <category scheme="https://terrytao.wordpress.com" term="expository"/>
    <category scheme="https://terrytao.wordpress.com" term="math.CA"/>
    <category scheme="https://terrytao.wordpress.com" term="Hong Wang"/>
    <category scheme="https://terrytao.wordpress.com" term="ICM"/>
    <category scheme="https://terrytao.wordpress.com" term="Kakeya conjecture"/>
    <author>
      <name>Terence Tao</name>
      <uri>http://www.math.ucla.edu/~tao</uri>
    </author>
    <source>
      <id>http://terrytao.wordpress.com/feed/atom/</id>
      <link href="https://terrytao.wordpress.com" rel="alternate" type="text/html"/>
      <link href="https://terrytao.wordpress.com/feed/atom/" rel="self" type="application/atom+xml"/>
      <link href="https://terrytao.wordpress.com/osd.xml" rel="search" title="What's new" type="application/opensearchdescription+xml"/>
      <link href="https://s1.wp.com/opensearch.xml" rel="search" title="WordPress.com" type="application/opensearchdescription+xml"/>
      <link href="https://terrytao.wordpress.com/?pushpress=hub" rel="hub" type="text/html"/>
      <subtitle xml:lang="en">Updates on my research and expository papers, discussion of open problems, and other maths-related topics.  By Terence Tao</subtitle>
      <title xml:lang="en">What's new</title>
      <updated>2026-09-08T07:17:02Z</updated>
    </source>
  </entry>

  <entry xml:lang="en-US">
    <id>https://scottaaronson.blog/?p=10032</id>
    <link href="https://scottaaronson.blog/?p=10032" rel="alternate" type="text/html"/>
    <link href="https://scottaaronson.blog/?p=10032#comments" rel="replies" type="text/html"/>
    <link href="https://scottaaronson.blog/?feed=atom&amp;p=10032" rel="replies" type="application/atom+xml"/>
    <title xml:lang="en-US">Anthropic’s LLM watermarking</title>
    <summary xml:lang="en-US">So yeah, Anthropic has announced that it’s now watermarking the outputs of Claude, using a scheme based on Google’s SynthID, which is in turn based on the Gumbel Softmax scheme that I proposed at OpenAI back in 2022—as far as I know, the first LLM watermarking proposal, though far from the last one. I’m gratified […]</summary>
    <content type="xhtml" xml:lang="en-US"><div xmlns="http://www.w3.org/1999/xhtml"><p class="wp-block-paragraph">So yeah, Anthropic has announced that it’s now <a href="https://www.anthropic.com/news/claude-text-watermark">watermarking the outputs of Claude</a>, using a scheme based on Google’s SynthID, which is in turn based on the <a href="https://simons.berkeley.edu/talks/scott-aaronson-ut-austin-openai-2023-08-17">Gumbel Softmax scheme</a> that I proposed at OpenAI back in 2022—as far as I know, the first LLM watermarking proposal, though far from the last one. I’m gratified that Anthropic credits me for this, even though I shirked my duty by never publishing a paper about it (by the time I sat down to write one, it seemed like the whole field had already assimilated my scheme and moved beyond it—AI just moves too fast for me!).</p>



<p class="wp-block-paragraph">For those who don’t know, watermarking means slightly changing the way that an LLM operates to insert a subtle signal that lets you prove later, with high statistical confidence, that a text indeed came from your specific LLM. It uses the randomness that’s already present anyway in LLM outputs, replacing some of it by pseudorandomness that favors certain word combinations over others in a way that’s later detectable, given only the sequence of tokens itself (not the prompt or the probabilities) along with the key of the pseudorandom generator. <a href="https://arxiv.org/abs/2306.09194">Christ, Gunn, and Zamir</a> then substantially improved my scheme to get true cryptographic indistinguishability, and there have been other improvements since.</p>



<p class="wp-block-paragraph">I’d been meaning to blog about this for days. Thankfully, Zvi Mowshowitz, the world’s foremost blogger about AI, has now written a wonderful post, entitled <a href="https://thezvi.substack.com/p/ai-text-watermarking-is-free-and"><strong>AI Text Watermarking Is Free And Good</strong></a>, which saves me from the need to write my own long post.  In particular, Zvi masterfully explains the central point that I needed to explain to everyone back in 2022-23: why, contrary to many people’s intuitions, there’s no inherent tradeoff between watermarking and the <em>quality</em> of LLM output.  Basically, nearly every LLM output was <em>already</em> a sample from a cloud of exponentially many possibilities, all of them about equally good, so there’s plenty of room to steer within that cloud without affecting anything that an ordinary user would notice.  As my kids would put it, the math mathes.</p>



<p class="wp-block-paragraph">As Zvi explains, the central technical drawback of watermarking schemes like the one I proposed, and what Anthropic is now using, is that it’s possible to remove the watermarks with a little extra work (even stuff as simple as, e.g., translating between English and French, asking the LLM for words interspersed with emojis and then removing the emojis, or using an open model to paraphrase the output).  Zvi gives detailed arguments for why he expects watermarking to remain a net positive in practice despite this vulnerability.</p>



<p class="wp-block-paragraph">I could add that, in addition, there’s recent progress (see <a href="https://arxiv.org/pdf/2401.13927">here</a> for example) on what I’ve called “semantic watermarking,” or watermarking at the level of the underlying concept vectors rather than the tokens themselves.  This actually seems to work, albeit with no theoretical guarantees, and will hopefully make removing watermarks a lot harder—although the <a href="https://arxiv.org/abs/2311.04378">Barak et al. impossibility result</a> suggests that under plausible assumptions, no LLM watermarking method will be completely foolproof.</p>



<p class="wp-block-paragraph">Anyway, I worked out my scheme in Fall 2022, then gave lots of talks about it (including, as it happens, at Anthropic), and also worked with Hendrik Kirchner at OpenAI, who actually implemented and tested my scheme. Unfortunately, OpenAI leadership decided against deploying watermarking, worried mostly about risks to the product (i.e., customers disliking the idea, and leaving for a competing LLM that doesn’t watermark). You can read <a href="https://www.wsj.com/tech/ai/openai-tool-chatgpt-cheating-writing-135b755a">this <em>Wall Street Journal</em> investigation</a> from two years ago for more. I was hopeful that the State of California was going to solve the collective-action problem by mandating watermarking for AI models, but then they decided to do that <a href="https://www.ailawsbystate.com/blog/california-ai-transparency-act-sb-942">for audiovisual content only</a>, for some reason exempting text.</p>



<p class="wp-block-paragraph">Nevertheless, Google DeepMind implemented something very similar to my proposal in its <a href="https://deepmind.google/models/synthid/">SynthID</a>, deployed in all its Gemini text models.  But they heavily restricted who gets to <em>detect</em> the watermark, which made their admirable decision of limited use to my academic colleagues, who’ve been begging me for a way to detect whether their students are using AI to cheat.  (For now, I mainly send them to <a href="https://www.pangram.com/">Pangram</a>, a leading AI detector <em>not</em> based on watermarking, as a first line of defense.)</p>



<p class="wp-block-paragraph">And now, apparently to comply with EU regulations, Anthropic says they’ve deployed a watermarking scheme like mine where <em>anyone</em> will be able to do detection (though they also say in their FAQ that they’re still working on the detection API).  Even OpenAI <a href="https://x.com/AndrewCurran_/status/2087040578630606884">suggests that it plans to follow suit</a>.  So, four years after I seriously thought about this, it looks to my surprise like this is actually happening.  Thanks, EU!</p>



<p class="wp-block-paragraph">Tell you what: <a href="https://thezvi.substack.com/p/ai-text-watermarking-is-free-and">read Zvi’s post</a>, and then whatever questions you still have, you can come here and ask in the comments. Just please don’t use Claude to <em>write</em> the comments.  With any luck, I’ll eventually be able catch you if you do.</p></div>
    </content>
    <updated>2026-08-23T19:21:10Z</updated>
    <published>2026-08-22T21:31:52Z</published>
    <category scheme="https://scottaaronson.blog" term="Announcements"/>
    <author>
      <name>Scott</name>
      <uri>http://www.scottaaronson.com</uri>
    </author>
    <source>
      <id>https://scottaaronson.blog/?feed=atom</id>
      <icon>https://scottaaronson.blog/wp-content/uploads/2021/10/cropped-Jacket-32x32.gif</icon>
      <link href="https://scottaaronson.blog" rel="alternate" type="text/html"/>
      <link href="https://scottaaronson.blog/?feed=atom" rel="self" type="application/atom+xml"/>
      <subtitle xml:lang="en-US">The Blog of Scott Aaronson</subtitle>
      <title xml:lang="en-US">Shtetl-Optimized</title>
      <updated>2026-09-01T17:17:08Z</updated>
    </source>
  </entry>

  <entry>
    <id>tag:blogger.com,1999:blog-13869903.post-6747556840036469524</id>
    <link href="https://nanoscale.blogspot.com/feeds/6747556840036469524/comments/default" rel="replies" title="Post Comments" type="application/atom+xml"/>
    <link href="https://www.blogger.com/comment/fullpage/post/13869903/6747556840036469524" rel="replies" title="4 Comments" type="text/html"/>
    <link href="https://www.blogger.com/feeds/13869903/posts/default/6747556840036469524" rel="edit" type="application/atom+xml"/>
    <link href="https://www.blogger.com/feeds/13869903/posts/default/6747556840036469524" rel="self" type="application/atom+xml"/>
    <link href="https://nanoscale.blogspot.com/2026/08/recent-superconductivity-results-open.html" rel="alternate" title="Recent superconductivity results + open positions at Rice" type="text/html"/>
    <title>Recent superconductivity results + open positions at Rice</title>
    <content type="xhtml"><div xmlns="http://www.w3.org/1999/xhtml">Much as I feel like I should write about the latest developments in US science policy, instead I want to point out two exciting recent superconductivity results.  Below I will also append a couple of other items, including open positions at Rice.<div><ul style="text-align: left;"><li><table cellpadding="0" cellspacing="0" class="tr-caption-container" style="float: right;"><tbody><tr><td style="text-align: center;"><a href="https://blogger.googleusercontent.com/img/a/AVvXsEh7cvjvjNe0nLAYccL5Z-BqNusn9_YsPvDsNb01iE8FDWDDiqbUTx2Yt3EiMIWr4F6Y7Os0q0Tuqkn6B1Em1eP558NrGIzjXy5ma4RW9cxoS_tI-l2Oh-JFGvAOudYYboHrrwxIERPEHRrVyqfFS0D5ZJ9oRMhtviG0k-i8t4hyZ5Wwtd3CvflsoA" style="clear: right; margin-bottom: 1em; margin-left: auto; margin-right: auto;"><img alt="" height="320" src="https://blogger.googleusercontent.com/img/a/AVvXsEh7cvjvjNe0nLAYccL5Z-BqNusn9_YsPvDsNb01iE8FDWDDiqbUTx2Yt3EiMIWr4F6Y7Os0q0Tuqkn6B1Em1eP558NrGIzjXy5ma4RW9cxoS_tI-l2Oh-JFGvAOudYYboHrrwxIERPEHRrVyqfFS0D5ZJ9oRMhtviG0k-i8t4hyZ5Wwtd3CvflsoA=w228-h320" width="228"/></a></td></tr><tr><td class="tr-caption" style="text-align: center;"><span style="font-size: x-small;">After Fig. 2b from <a href="https://doi.org/10.1038/s41586-026-10857-1" target="_blank">here</a></span></td></tr></tbody></table>In <a href="https://doi.org/10.1038/s41586-026-10857-1" target="_blank">this paper</a>, researchers demonstrated high temperature superconductivity in a monolayer of Bi\(_2\)Sr\(_2\)CuO\(_{6+\delta}\) (Bi-2201).  The monolayer contains just a single CuO\(_2\) plane, and remarkably, the superconducting transition is only suppressed about 10% from the bulk value of around 35 K.  The authors were able to explore the phase diagram by tuning the oxygen content <i>in situ</i>, using vacuum annealing to drive out oxygen and ozone exposure to (seemingly gently) put it back in.  This allows them to examine a large swath of temperature/doping/magnetic field parameter space, showing evidence of critical scaling of the resistance near the transition as well as an anomalous metallic state.  There's a lot to digest here.  The mapped out zero-field phase diagram in a single device (shown here) is extremely impressive.  Studies like this can hopefully give new insights into what physics is truly essential to achieve high temperature superconductivity.</li><li>In <a href="https://doi.org/10.1038/s41586-026-11037-x" target="_blank">this paper</a>, investigators placed exfoliated NbSe\(_2\) encapsulated by hBN in a <a href="https://en.wikipedia.org/wiki/Split-ring_resonator" target="_blank">split-ring resonator</a> cavity, and they observed enhanced critical temperature (by 0.15 K out of 6.53 K, or an increase of 2.3%), critical field, and critical current when the resonance frequency of the cavity is such that it apparently couples to superconducting fluctuations in the material on the spatial scale of the cavity.  There is a ton of interest in using electromagnetic cavities to modify the properties of quantum materials - see <a href="https://arxiv.org/abs/2604.08666" target="_blank">this review</a>.  As far as I know, this is the first time that coupling to the vacuum mode of a cavity has actually enhanced superconducting properties.  Exciting times.</li></ul><div>It's worth noting that both of these papers come out of groups in China - Changgan Zeng at USTC and Yuanbo Zhang at Fudan.   </div><div><br/></div>In other news:<br/><ul style="text-align: left;"><li><div class="separator" style="clear: both; text-align: center;"><a href="https://blogger.googleusercontent.com/img/a/AVvXsEjh7ZXRv9DXIl7Bdk3Yxbo5WqQc7dN8eZ2ZFpqdMiO0ZlXW4261SBGos1LkAoqTIPPTzxiG1NFJLUc5itMCPT5y6AXGjoIsmjvlTPqlvTgjaUN1C8x7WlJWwlmojArGAQa6U2wOtubtcOkFLVQqtlGPH4LPTTRvDmUn0gnKPmTaiyVq1jM2oa1BqA" style="clear: right; float: right; margin-bottom: 1em; margin-left: 1em;"><img alt="" height="240" src="https://blogger.googleusercontent.com/img/a/AVvXsEjh7ZXRv9DXIl7Bdk3Yxbo5WqQc7dN8eZ2ZFpqdMiO0ZlXW4261SBGos1LkAoqTIPPTzxiG1NFJLUc5itMCPT5y6AXGjoIsmjvlTPqlvTgjaUN1C8x7WlJWwlmojArGAQa6U2wOtubtcOkFLVQqtlGPH4LPTTRvDmUn0gnKPmTaiyVq1jM2oa1BqA" width="299"/></a></div>The NSF is going to make about half the number of awards this year as it did in The Before Times (2021-2024), according to <a href="https://www.nature.com/articles/d41586-026-02574-6" target="_blank">this news article</a> in <i>Nature</i>.  Figure 1 (shown here) is striking.  The claim is that the NSF leadership is taking <a href="https://nanoscale.blogspot.com/2026/07/bad-to-worse-at-nsf-july-2026-edition.html" target="_blank">clawed-back FY26 funding</a> of around $1B and saving it for some as-yet unspecified, unannounced OSTP "grand challenges" project.  <br/></li><li>NSF also announced "new" funding opportunities <a href="https://www.nsf.gov/news/foundational-research-nofos" target="_blank">here</a>.  As described in that article linked above, these are not exactly new - it's essentially a reorganization/rebranding of much of the NSF's portfolio now that they've eliminated divisions and retired older funding solicitations.  Noteworthy is that the amount of funding mentioned in these solicitations is all considerably lower than what the aggregate of the older solicitations used to have.  As a non-expert, it looks a lot like these solicitations are being prepared as if the presidential budget requested funding levels (you know, the ones that want to cut NSF by more than half) are the baseline.</li></ul><div>Meanwhile, at Rice we have some faculty searches underway:</div></div><div><ul style="text-align: left;"><li>The <a href="https://rami.rice.edu/" target="_blank">Rice Advanced Materials Institute</a> is searching for an assistant professor with an expertise in computational materials (including AI/ML).  See <a href="https://apply.interfolio.com/191687" target="_blank">here</a>.</li><li>Our chemistry department is searching for an assistant professor position with an emphasis including physical chemistry.  See <a href="https://apply.interfolio.com/191082" target="_blank">here</a>. </li><li>There will also be an AMO physics position posted shortly - I'll update with the link when that becomes available.</li></ul><div>Finally, <i><a href="https://pubs.acs.org/nalefd" target="_blank">Nano Letters</a></i> is having <a href="https://axial.acs.org/nanoscience/nano-letters-seed-grants" target="_blank">a seed grant competition</a> for grad students.  It's not much money, but it is good experience and can inspire graduate student creativity. (Full disclosure: I'm an associate editor for the journal.)</div><div><br/></div></div><div style="text-align: left;"><br/></div></div>
    </content>
    <updated>2026-08-22T21:54:26Z</updated>
    <published>2026-08-22T19:18:27Z</published>
    <author>
      <name>Douglas Natelson</name>
      <email>noreply@blogger.com</email>
      <uri>http://www.blogger.com/profile/13340091255404229559</uri>
    </author>
    <source>
      <id>tag:blogger.com,1999:blog-13869903</id>
      <category term="concepts"/>
      <author>
        <name>Douglas Natelson</name>
        <email>noreply@blogger.com</email>
        <uri>http://www.blogger.com/profile/13340091255404229559</uri>
      </author>
      <link href="https://nanoscale.blogspot.com/feeds/posts/default" rel="http://schemas.google.com/g/2005#feed" type="application/atom+xml"/>
      <link href="https://www.blogger.com/feeds/13869903/posts/default?alt=atom" rel="self" type="application/atom+xml"/>
      <link href="https://nanoscale.blogspot.com/" rel="alternate" type="text/html"/>
      <link href="http://pubsubhubbub.appspot.com/" rel="hub" type="text/html"/>
      <link href="https://www.blogger.com/feeds/13869903/posts/default?alt=atom&amp;start-index=26&amp;max-results=25" rel="next" type="application/atom+xml"/>
      <subtitle>A blog about condensed matter and nanoscale physics.  Why should high energy and astro folks have all the fun?</subtitle>
      <title>nanoscale views</title>
      <updated>2026-09-07T18:05:56Z</updated>
    </source>
  </entry>

  <entry xml:lang="en">
    <id>http://terrytao.wordpress.com/?p=18080</id>
    <link href="https://terrytao.wordpress.com/2026/08/22/mathematical-discourse/" rel="alternate" type="text/html"/>
    <link href="https://terrytao.wordpress.com/2026/08/22/mathematical-discourse/#comments" rel="replies" type="text/html"/>
    <link href="https://terrytao.wordpress.com/2026/08/22/mathematical-discourse/feed/atom/" rel="replies" type="application/atom+xml"/>
    <title xml:lang="en">Mathematical Discourse</title>
    <summary xml:lang="en">Mathematical Discourse is a new online, peer-reviewed mathematics journal, publishing videos of mathematics research talks of the highest quality.  Our inaugural scientific and editorial boards are listed at the end of this message. Our goal is to promote and nourish a culture which values communication as an essential part of the research process. Giving a […]</summary>
    <content type="xhtml" xml:lang="en"><div xmlns="http://www.w3.org/1999/xhtml"><p class="wp-block-paragraph"><a href="https://urldefense.com/v3/__https://www.mathematicaldiscourse.org/__;!!NubF!PGgQ_0RT3MCvBODPvxkQkWkhvIFQ3BEa_NqVLtOPLC9bTbvRUv8wsTqN3SueWBpmLGw516CZg6CmQ8El$" rel="noopener" target="_blank"><em>Mathematical Discourse</em></a> is a new online, peer-reviewed mathematics journal, publishing <strong>videos of mathematics research talks</strong> of the highest quality.  Our inaugural scientific and editorial boards are listed at the end of this message.</p>



<p class="wp-block-paragraph">Our goal is to promote and nourish a culture which values communication as an essential part of the research process. Giving a mathematical talk captures the human side of mathematics in a unique way, and supporting these human aspects of our discipline will be ever more important in the coming years. </p>



<p class="wp-block-paragraph">We are now accepting submissions for our first issue.  If you have seen (or given!) a truly excellent, mathematically stimulating research talk which was video recorded, we hope you will encourage the speaker (possibly yourself!) to submit it.  </p>



<p class="wp-block-paragraph">Our current call for submissions is limited to ~1 hour research seminar or colloquia style talks in pure mathematics. A detailed description of the scope of the journal and submission requirements are available at <a href="https://urldefense.com/v3/__https://www.mathematicaldiscourse.org/submit__;!!NubF!PGgQ_0RT3MCvBODPvxkQkWkhvIFQ3BEa_NqVLtOPLC9bTbvRUv8wsTqN3SueWBpmLGw516CZg3nvHAbg$" rel="noopener" target="_blank">https://www.mathematicaldiscourse.org/submit</a>.</p>



<p class="wp-block-paragraph">We hope you will spread word of this new initiative to your colleagues and collaborators!</p>



<p class="wp-block-paragraph">Sincerely yours, </p>



<p class="wp-block-paragraph">Katie Mann, Akshay Venkatesh, Rachel Webb</p>



<p class="wp-block-paragraph">Managing Editors of Mathematical Discourse</p>



<p class="wp-block-paragraph"><strong>Scientific Board:</strong> Hugo Duminil-Copin, Larry Guth, Bryna Kra, Yair Minsky, Bjorn Poonen, Terence Tao, Ravi Vakil, Geordie Williamson</p>



<p class="wp-block-paragraph"><strong>Editors:</strong> Matt Baker, Richard Bamler, Andrej Bauer, Alexei Borodin, Yaiza Canzani, Daniel Cristofaro-Gardner, Jordan Ellenberg, Hélène Eynard-Bontemps, Jessica Fintzen, Sergey Fomin, Zaher Hani, Peter Hintz, Shrawan Kumar, Justin Moore, Samuel Taylor, Richard Thomas, Isabel Vogt, Yilin Wang, Alex Wright, Zhiwei Yun</p>



<p class="wp-block-paragraph"><a href="https://urldefense.com/v3/__http://mathematicaldiscourse.org__;!!NubF!PGgQ_0RT3MCvBODPvxkQkWkhvIFQ3BEa_NqVLtOPLC9bTbvRUv8wsTqN3SueWBpmLGw516CZgxlHUHem$" rel="noopener" target="_blank">mathematicaldiscourse.org</a></p></div>
    </content>
    <updated>2026-08-22T15:31:03Z</updated>
    <published>2026-08-22T15:31:03Z</published>
    <category scheme="https://terrytao.wordpress.com" term="advertising"/>
    <category scheme="https://terrytao.wordpress.com" term="expository"/>
    <category scheme="https://terrytao.wordpress.com" term="journals"/>
    <author>
      <name>Terence Tao</name>
      <uri>http://www.math.ucla.edu/~tao</uri>
    </author>
    <source>
      <id>http://terrytao.wordpress.com/feed/atom/</id>
      <link href="https://terrytao.wordpress.com" rel="alternate" type="text/html"/>
      <link href="https://terrytao.wordpress.com/feed/atom/" rel="self" type="application/atom+xml"/>
      <link href="https://terrytao.wordpress.com/osd.xml" rel="search" title="What's new" type="application/opensearchdescription+xml"/>
      <link href="https://s1.wp.com/opensearch.xml" rel="search" title="WordPress.com" type="application/opensearchdescription+xml"/>
      <link href="https://terrytao.wordpress.com/?pushpress=hub" rel="hub" type="text/html"/>
      <subtitle xml:lang="en">Updates on my research and expository papers, discussion of open problems, and other maths-related topics.  By Terence Tao</subtitle>
      <title xml:lang="en">What's new</title>
      <updated>2026-09-08T07:17:02Z</updated>
    </source>
  </entry>

  <entry xml:lang="en">
    <id>http://4gravitons.com/?p=14827</id>
    <link href="https://4gravitons.com/2026/08/21/newsworthiness-guide-for-scientists/" rel="alternate" type="text/html"/>
    <title>Newsworthiness Guide for Scientists</title>
    <summary>I had a recurring “elevator pitch” at Lancefest earlier this summer. After explaining that I’m a science journalist now, I’d end with “so if you run into a story, let me know!” One person had a question that left me stumped: “What counts as a story?” I didn’t have a good response then. I’ve got […]</summary>
    <content type="xhtml"><div xmlns="http://www.w3.org/1999/xhtml"><p class="wp-block-paragraph">I had a recurring “elevator pitch” at <a href="https://4gravitons.com/2026/06/26/at-lancefest/">Lancefest</a> earlier this summer. After explaining that I’m a science journalist now, I’d end with “so if you run into a story, let me know!”</p>



<p class="wp-block-paragraph">One person had a question that left me stumped: “What counts as a story?”</p>


<div class="wp-block-image">
<figure class="aligncenter size-large is-resized"><a href="https://www.lindahall.org/about/news/scientist-of-the-day/arthur-eddington-and-frank-dyson/"><img alt="" src="https://assets-us-01.kc-usercontent.com/9dd25524-761a-000d-d79f-86a5086d4774/f95132d2-0d91-48ea-b6e0-6f57cdb971e7/eddington_dyson2.jpg" style="width: 532px; height: auto;"/></a><figcaption class="wp-element-caption">For those of us who don’t happen to be Einstein</figcaption></figure>
</div>


<p class="wp-block-paragraph">I didn’t have a good response then. I’ve got a better one now, though I’m afraid it doesn’t fit in an elevator pitch. This is all based on my experience, so take it with a grain of salt. But here are the criteria that seem to matter:</p>



<p class="wp-block-paragraph">First, a story usually needs a <strong>news hook</strong>. News is, in particular, supposed to be “new”. That doesn’t mean I can’t write about history, or established science. But editors like those stories a lot better if there is some recent development, within the past year or so, to tie it to. The new development doesn’t have to be all that important, the story can mostly focus on something else. But it needs to be somewhere in there.</p>



<p class="wp-block-paragraph">Second, news stories are usually <strong>qualitative</strong>, not quantitative. I need to be able to tell a story about what happened, what actions people took and why they mattered. Quantitative developments usually only make the news if they’re so big that they shade into the qualitative: something doubling unexpectedly, for example.</p>



<p class="wp-block-paragraph">Third, ideally a science news story is something that is <strong>getting the experts excited</strong>. Journalists aren’t supposed to judge the scientific merit of ideas on their own, they’re supposed to rely on experts. The most solid stories, the ones that are easiest to pitch, are ones where there’s a community of experts that largely think something is cool. That makes it easier to get good quotes, and easier to justify its relevance. If you accomplished something and you’re having trouble convincing anyone it matters, don’t start with me, start with your colleagues!</p>



<p class="wp-block-paragraph">Fourth: less importantly, it helps when stories have a <strong>human angle</strong>. If you can tell a tale about how you came up with an idea, if you came from an unusual background, if something was hotly debated but now is deemed essential: these things sweeten a story, they capture readers’ interest, and editors see their value.</p>



<p class="wp-block-paragraph">Finally, stories involve something <strong>changing</strong>. It can be something that just changed now, for a news piece, but it can also be something that changed over time, for a feature in a magazine. The key is change. “Old method still works” is not going to excite people, and it won’t count as news.</p>



<p class="wp-block-paragraph">After writing all that out, I’m still not sure I answered the original question. But hopefully I’ve at least given some tips that can get you started. If you’re a scientist, and you see something that hits most of the boxes on this list but hasn’t been covered in the news yet, consider reaching out to me. You may have run into a story!</p></div>
    </content>
    <updated>2026-08-21T16:00:00Z</updated>
    <published>2026-08-21T16:00:00Z</published>
    <category term="Science Communication"/>
    <category term="academia"/>
    <category term="press"/>
    <category term="science communication"/>
    <author>
      <name>4gravitons</name>
    </author>
    <source>
      <id>https://4gravitons.com</id>
      <logo>https://s2.wp.com/i/webclip.png</logo>
      <link href="https://4gravitons.com/feed/" rel="self" type="application/rss+xml"/>
      <link href="https://4gravitons.com" rel="alternate" type="text/html"/>
      <link href="https://4gravitons.com/osd.xml" rel="search" title="4 gravitons" type="application/opensearchdescription+xml"/>
      <link href="https://4gravitons.com/?pushpress=hub" rel="hub" type="text/html"/>
      <subtitle>Stories about physics from someone who's been there</subtitle>
      <title>4 gravitons</title>
      <updated>2026-09-04T11:26:57Z</updated>
    </source>
  </entry>

  <entry xml:lang="en-US">
    <id>https://scottaaronson.blog/?p=10020</id>
    <link href="https://scottaaronson.blog/?p=10020" rel="alternate" type="text/html"/>
    <link href="https://scottaaronson.blog/?p=10020#comments" rel="replies" type="text/html"/>
    <link href="https://scottaaronson.blog/?feed=atom&amp;p=10020" rel="replies" type="application/atom+xml"/>
    <title xml:lang="en-US">Better than gold</title>
    <summary xml:lang="en-US">What’s about the only thing more badass than a 17-year-old winning a gold medal at the International Olympiad in Informatics (IOI)? That 17-year-old intentionally forfeiting his gold medal by wearing an Israeli flag while the medal was announced, defying the IOI’s boycott of Israel (for background on this boycott, see my post from 2024). Kol […]</summary>
    <content type="xhtml" xml:lang="en-US"><div xmlns="http://www.w3.org/1999/xhtml"><p class="wp-block-paragraph">What’s about the only thing more badass than a 17-year-old winning a gold medal at the <a href="https://ioinformatics.org/">International Olympiad in Informatics</a> (IOI)?</p>



<p class="wp-block-paragraph">That 17-year-old <a href="https://www.jewishnews.co.uk/israeli-teens-medal-revoked-for-wearing-national-flag">intentionally forfeiting his gold medal</a> by wearing an Israeli flag while the medal was announced, defying the IOI’s boycott of Israel (for background on this boycott, <a href="https://scottaaronson.blog/?p=8356">see my post from 2024</a>).</p>


<div class="wp-block-image">
<figure class="aligncenter size-full"><a href="https://scottaaronson.blog/wp-content/uploads/2026/08/image-1.png"><img alt="" class="wp-image-10021" height="640" src="https://scottaaronson.blog/wp-content/uploads/2026/08/image-1.png" width="499"/></a></figure>
</div>


<p class="wp-block-paragraph">Kol HaKavod (mad respect) to Yotam Budnik, who incredibly, has <em>also</em> won a Gold Medal (which he was allowed to keep, apparently) at the International Math Olympiad.  And congratulations to the entire Israeli team, which (incredibly) would apparently have had a higher overall score than the US team, had it been allowed to compete as an official team at all.</p></div>
    </content>
    <updated>2026-08-21T15:30:48Z</updated>
    <published>2026-08-20T16:27:20Z</published>
    <category scheme="https://scottaaronson.blog" term="Announcements"/>
    <category scheme="https://scottaaronson.blog" term="Rage Against Doofosity"/>
    <author>
      <name>Scott</name>
      <uri>http://www.scottaaronson.com</uri>
    </author>
    <source>
      <id>https://scottaaronson.blog/?feed=atom</id>
      <icon>https://scottaaronson.blog/wp-content/uploads/2021/10/cropped-Jacket-32x32.gif</icon>
      <link href="https://scottaaronson.blog" rel="alternate" type="text/html"/>
      <link href="https://scottaaronson.blog/?feed=atom" rel="self" type="application/atom+xml"/>
      <subtitle xml:lang="en-US">The Blog of Scott Aaronson</subtitle>
      <title xml:lang="en-US">Shtetl-Optimized</title>
      <updated>2026-09-01T17:17:08Z</updated>
    </source>
  </entry>

  <entry xml:lang="en">
    <id>http://terrytao.wordpress.com/?p=18073</id>
    <link href="https://terrytao.wordpress.com/2026/08/20/quantitative-bounds-for-sets-lacking-polynomial-progressions-with-shifted-prime-difference/" rel="alternate" type="text/html"/>
    <link href="https://terrytao.wordpress.com/2026/08/20/quantitative-bounds-for-sets-lacking-polynomial-progressions-with-shifted-prime-difference/#comments" rel="replies" type="text/html"/>
    <link href="https://terrytao.wordpress.com/2026/08/20/quantitative-bounds-for-sets-lacking-polynomial-progressions-with-shifted-prime-difference/feed/atom/" rel="replies" type="application/atom+xml"/>
    <title xml:lang="en">Quantitative bounds for sets lacking polynomial progressions with shifted prime difference</title>
    <summary xml:lang="en">Ben Krause, Hamed Mousavi, Joni Teräiväinen, and I have just uploaded to the arXiv our paper Quantitative bounds for sets lacking polynomial progressions with shifted prime difference. The purpose of this paper is to obtain quantitative versions of this theorem of Wooley and Ziegler: Theorem 1 Let be polynomials of one variable with integer coefficients […]</summary>
    <content type="xhtml" xml:lang="en"><div xmlns="http://www.w3.org/1999/xhtml"><p>
 Ben Krause, Hamed Mousavi, Joni Teräiväinen, and I have just uploaded to the arXiv our paper <a href="http://arxiv.org/abs/2608.19525">Quantitative bounds for sets lacking polynomial progressions with shifted prime difference</a>. The purpose of this paper is to obtain quantitative versions of this <a href="https://zbmath.org/1355.11005">theorem of Wooley and Ziegler</a>:
</p><p>

</p><blockquote><b>Theorem 1</b>  Let <img alt="{P_1,\dots,P_{k-1} \in {\bf Z}[y]}" class="latex" src="https://s0.wp.com/latex.php?latex=%7BP_1%2C%5Cdots%2CP_%7Bk-1%7D+%5Cin+%7B%5Cbf+Z%7D%5By%5D%7D&amp;bg=ffffff&amp;fg=000000&amp;s=0&amp;c=20201002"/> be polynomials of one variable <img alt="{y}" class="latex" src="https://s0.wp.com/latex.php?latex=%7By%7D&amp;bg=ffffff&amp;fg=000000&amp;s=0&amp;c=20201002"/> with integer coefficients with zero constant term, and let <img alt="{A}" class="latex" src="https://s0.wp.com/latex.php?latex=%7BA%7D&amp;bg=ffffff&amp;fg=000000&amp;s=0&amp;c=20201002"/> be a set of integers of positive density. Then there exist infinitely many primes <img alt="{p}" class="latex" src="https://s0.wp.com/latex.php?latex=%7Bp%7D&amp;bg=ffffff&amp;fg=000000&amp;s=0&amp;c=20201002"/> such that <img alt="{A}" class="latex" src="https://s0.wp.com/latex.php?latex=%7BA%7D&amp;bg=ffffff&amp;fg=000000&amp;s=0&amp;c=20201002"/> contains a progression of the form <p align="center"><img alt="\displaystyle  a, a+P_1(p-1), \dots, a+P_{k-1}(p-1) " class="latex" src="https://s0.wp.com/latex.php?latex=%5Cdisplaystyle++a%2C+a%2BP_1%28p-1%29%2C+%5Cdots%2C+a%2BP_%7Bk-1%7D%28p-1%29+&amp;bg=ffffff&amp;fg=000000&amp;s=0&amp;c=20201002"/></p>
 for some integer <img alt="{a}" class="latex" src="https://s0.wp.com/latex.php?latex=%7Ba%7D&amp;bg=ffffff&amp;fg=000000&amp;s=0&amp;c=20201002"/>. </blockquote>

<p/><p>


</p><p>
This generalizes the famous <a href="https://en.wikipedia.org/wiki/Szemer%C3%A9di%27s_theorem">theorem of Szemerédi</a> in two ways: firstly, by considering “polynomial progressions” instead of arithmetic progressions, and secondly by requiring the shift parameter to be one less than a prime <img alt="{p}" class="latex" src="https://s0.wp.com/latex.php?latex=%7Bp%7D&amp;bg=ffffff&amp;fg=000000&amp;s=0&amp;c=20201002"/>. The first extension of Szemerédi’s theorem is a <a href="https://zbmath.org/0870.11015">theorem of Bergelson and Leibman</a>; and the second extension is also obtainable by combining the <a href="https://zbmath.org/1126.37005">arguments of Frantzikinakis, Host and Kra</a> with the results <a href="https://zbmath.org/1242.11071">of Green</a>, <a href="https://zbmath.org/1247.11017">Ziegler</a>, <a href="https://zbmath.org/1347.37019">and myself</a>.
</p><p>
The proof of the above theorem uses ergodic theory, which makes it difficult to extract quantitative bounds from it; and standard methods of “finitizing” ergodic theory results, for instance by replacing Host–Kra seminorms by their Gowers uniformity norm counterparts, run into a number of technical difficulties here due to the need to work with multiple scales due to the presence of polynomials, as well as the fact that many of the conjectural uniformity properties of the prime numbers at small scales remain unproven.
</p><p>
Nevertheless, we are able to get reasonable quantitative results (with density bounds that are roughly single or doubly logarithmic in scale) in the following special cases: 

</p><ul> <li> linear polynomials; </li><li> polynomials of distinct degree; and </li><li> multiples of a fixed polynomial. 
</li></ul>

 The precise statements are slightly technical and not reproduced here.
<p/><p>
Previous quantitative bounds in the linear case were obtained <a href="https://arxiv.org/abs/2212.09635">by Leng</a> and <a href="https://terrytao.wordpress.com/2021/07/05/quantitative-bounds-for-gowers-uniformity-of-the-mobius-and-von-mangoldt-functions/">by Teräväinen and myself</a>, but our new method improves upon these bounds by roughly one iterated logarithm. On the other hand, in the case of two term progressions of spacing <img alt="{p-1}" class="latex" src="https://s0.wp.com/latex.php?latex=%7Bp-1%7D&amp;bg=ffffff&amp;fg=000000&amp;s=0&amp;c=20201002"/>, there is a much stronger quantitative result (with polynomial dependence of constants) <a href="https://arxiv.org/abs/2206.08001">due to Green</a>; our method do not recover that result.
</p><p>
Our methods use a variety of old and new methods in the subject. For instance, we use the (now quite standard) “<img alt="{W}" class="latex" src="https://s0.wp.com/latex.php?latex=%7BW%7D&amp;bg=ffffff&amp;fg=000000&amp;s=0&amp;c=20201002"/>-trick” to restrict the primes to a single congruence class to improve their uniformity properties (which, thanks to the recent work <a href="https://arxiv.org/abs/2312.10772">of Leng</a> and <a href="https://zbmath.org/8205248">Matthiesen–Teräväinen–Wang</a>, are now quite strong quantitatively); and for good configurations of polynomials, one can also use a <a href="https://arxiv.org/abs/2506.13010">recent transference theorem of Altman and Sawhney</a> to compare the polynomial averages with simpler linear ones, without having to pass to short scales. In order to get relatively strong bounds unconditionally, a “Siegel approximation” for the primes is used taking into account the potential influence of a Siegel zero. It will not be surprising to the experts that quantitative inverse Gowers theorems and nilsequence equidistribution theorems also play a major role.
</p><p>
A key technical difficulty is the presence of the <img alt="{W}" class="latex" src="https://s0.wp.com/latex.php?latex=%7BW%7D&amp;bg=ffffff&amp;fg=000000&amp;s=0&amp;c=20201002"/> modulus in the coefficients of the polynomial progressions after changes of variable, which forced us to make several of the existing estimates uniform over such coefficients (assuming they are not unreasonably large).This caused several complications that made a correct argument to more time-consuming to locate than initially planned.
</p><p>
AI usage in this work was fairly light, being restricted to proofreading and literature search only.
</p><p/></div>
    </content>
    <updated>2026-08-21T14:22:42Z</updated>
    <published>2026-08-21T05:24:40Z</published>
    <category scheme="https://terrytao.wordpress.com" term="math.CA"/>
    <category scheme="https://terrytao.wordpress.com" term="math.NT"/>
    <category scheme="https://terrytao.wordpress.com" term="paper"/>
    <category scheme="https://terrytao.wordpress.com" term="Ben Krause"/>
    <category scheme="https://terrytao.wordpress.com" term="Gowers uniformity norms"/>
    <category scheme="https://terrytao.wordpress.com" term="Hamed Mousavi"/>
    <category scheme="https://terrytao.wordpress.com" term="Joni Teravainen"/>
    <category scheme="https://terrytao.wordpress.com" term="polynomial recurrence"/>
    <category scheme="https://terrytao.wordpress.com" term="Siegel zero"/>
    <author>
      <name>Terence Tao</name>
      <uri>http://www.math.ucla.edu/~tao</uri>
    </author>
    <source>
      <id>http://terrytao.wordpress.com/feed/atom/</id>
      <link href="https://terrytao.wordpress.com" rel="alternate" type="text/html"/>
      <link href="https://terrytao.wordpress.com/feed/atom/" rel="self" type="application/atom+xml"/>
      <link href="https://terrytao.wordpress.com/osd.xml" rel="search" title="What's new" type="application/opensearchdescription+xml"/>
      <link href="https://s1.wp.com/opensearch.xml" rel="search" title="WordPress.com" type="application/opensearchdescription+xml"/>
      <link href="https://terrytao.wordpress.com/?pushpress=hub" rel="hub" type="text/html"/>
      <subtitle xml:lang="en">Updates on my research and expository papers, discussion of open problems, and other maths-related topics.  By Terence Tao</subtitle>
      <title xml:lang="en">What's new</title>
      <updated>2026-09-08T07:17:02Z</updated>
    </source>
  </entry>

  <entry xml:lang="en">
    <id>http://quomodocumque.wordpress.com/?p=8833</id>
    <link href="https://quomodocumque.wordpress.com/2026/08/19/brewers-22-mariners-0/" rel="alternate" type="text/html"/>
    <title>Brewers 22, Mariners 0</title>
    <summary>Yes, I was there! The craziest game I’ve ever seen. Seattle utility infielder Leo Rivas throwing 40mph eephus after 40mph eephus, the closest I will ever get to seeing what it would look like if I through some bizarre chain of circumstance had to take the mound against major league hitters. We missed a lot […]</summary>
    <content type="xhtml"><div xmlns="http://www.w3.org/1999/xhtml"><p class="wp-block-paragraph">Yes, I was there!  <a href="https://www.baseball-reference.com/boxes/MIL/MIL202608180.shtml">The craziest game I’ve ever seen</a>.  Seattle utility infielder Leo Rivas throwing 40mph eephus after 40mph eephus, the closest I will ever get to seeing what it would look like if <em>I</em> through some bizarre chain of circumstance had to take the mound against major league hitters.</p>



<p class="wp-block-paragraph">We missed a lot of this game because of a tornado warning that kept us off the road.  Got there just in time to see old man Christian Yelich hit a three-run homer to put the Brewers up 6-0; I thought <em>that </em>was going to be the memorable thing about this game.</p>



<p class="wp-block-paragraph">Mayhem when Gary Sanchez came in to close it out for the Crew, clinging to a 22-run lead.  “Gary!  Gary!”  Ever louder as he kept getting guys out on his way to a scoreless frame.  Changing speeds?  Try 70mph fastball after a 35mph curve.  How are you supposed to adjust to that?</p>



<p class="wp-block-paragraph"/></div>
    </content>
    <updated>2026-08-20T03:52:43Z</updated>
    <published>2026-08-20T03:52:43Z</published>
    <category term="baseball"/>
    <category term="blowouts"/>
    <category term="milwaukee brewers"/>
    <author>
      <name>JSE</name>
    </author>
    <source>
      <id>https://quomodocumque.wordpress.com</id>
      <logo>https://s2.wp.com/i/webclip.png</logo>
      <link href="https://quomodocumque.wordpress.com/feed/" rel="self" type="application/rss+xml"/>
      <link href="https://quomodocumque.wordpress.com" rel="alternate" type="text/html"/>
      <link href="https://quomodocumque.wordpress.com/osd.xml" rel="search" title="Quomodocumque" type="application/opensearchdescription+xml"/>
      <link href="https://quomodocumque.wordpress.com/?pushpress=hub" rel="hub" type="text/html"/>
      <subtitle>Math, Madison, food, the Orioles, books, my kids.</subtitle>
      <title>Quomodocumque</title>
      <updated>2026-09-08T04:58:11Z</updated>
    </source>
  </entry>

  <entry xml:lang="en-US">
    <id>https://scottaaronson.blog/?p=10014</id>
    <link href="https://scottaaronson.blog/?p=10014" rel="alternate" type="text/html"/>
    <link href="https://scottaaronson.blog/?p=10014#comments" rel="replies" type="text/html"/>
    <link href="https://scottaaronson.blog/?feed=atom&amp;p=10014" rel="replies" type="application/atom+xml"/>
    <title xml:lang="en-US">Michael Rabin memorial conference</title>
    <summary xml:lang="en-US">Friend-of-the-blog (well, mainly just friend) Adi Akavia has asked me to publicize that she’s helping to organize an exciting CS conference called Mind-IL at Tel Aviv University on October 26, in memory of the Israeli-American Turing Award winner Michael O. Rabin, who passed away in April. Please note that October 26 is the day before […]</summary>
    <content type="xhtml" xml:lang="en-US"><div xmlns="http://www.w3.org/1999/xhtml"><p class="wp-block-paragraph">Friend-of-the-blog (well, mainly just friend) <a href="https://sites.google.com/view/akavia">Adi Akavia</a> has asked me to publicize that she’s helping to organize an <a href="https://www.mind-il.org/conference/6a3031aea90316da446a7899">exciting CS conference called Mind-IL</a> at Tel Aviv University on October 26, in memory of the Israeli-American Turing Award winner <a href="https://en.wikipedia.org/wiki/Michael_O._Rabin">Michael O. Rabin</a>, who passed away in April.  Please note that October 26 is the day before the <a href="https://polymarket.com/event/who-will-be-the-next-prime-minister-of-israel-after-the-next-election">Israeli election</a>, for any Israeli citizenship holders living abroad who might want an academic excuse to come to Israel and vote.</p>


<div class="wp-block-image">
<figure class="aligncenter size-large"><a href="https://scottaaronson.blog/wp-content/uploads/2026/08/image.png"><img alt="" class="wp-image-10015" height="1024" src="https://scottaaronson.blog/wp-content/uploads/2026/08/image-683x1024.png" width="683"/></a></figure>
</div>


<hr class="wp-block-separator has-alpha-channel-opacity"/>



<p class="wp-block-paragraph"><strong>Update (August 19):</strong> Avi Wigderson also asked me to advertise a <a href="https://www.tnmoc.org/computable90-conference">conference</a>, to be held September 16-18 at Bletchley Park in the UK, to commemorate the 90th anniversary of Alan Turing’s “On Computable Numbers” paper.</p></div>
    </content>
    <updated>2026-08-19T14:50:59Z</updated>
    <published>2026-08-16T20:45:15Z</published>
    <category scheme="https://scottaaronson.blog" term="Announcements"/>
    <category scheme="https://scottaaronson.blog" term="Complexity"/>
    <author>
      <name>Scott</name>
      <uri>http://www.scottaaronson.com</uri>
    </author>
    <source>
      <id>https://scottaaronson.blog/?feed=atom</id>
      <icon>https://scottaaronson.blog/wp-content/uploads/2021/10/cropped-Jacket-32x32.gif</icon>
      <link href="https://scottaaronson.blog" rel="alternate" type="text/html"/>
      <link href="https://scottaaronson.blog/?feed=atom" rel="self" type="application/atom+xml"/>
      <subtitle xml:lang="en-US">The Blog of Scott Aaronson</subtitle>
      <title xml:lang="en-US">Shtetl-Optimized</title>
      <updated>2026-09-01T17:17:08Z</updated>
    </source>
  </entry>

  <entry xml:lang="en">
    <id>http://terrytao.wordpress.com/?p=18056</id>
    <link href="https://terrytao.wordpress.com/2026/08/18/palomar-a-registry-of-lean-verified-mathematics/" rel="alternate" type="text/html"/>
    <link href="https://terrytao.wordpress.com/2026/08/18/palomar-a-registry-of-lean-verified-mathematics/#comments" rel="replies" type="text/html"/>
    <link href="https://terrytao.wordpress.com/2026/08/18/palomar-a-registry-of-lean-verified-mathematics/feed/atom/" rel="replies" type="application/atom+xml"/>
    <title xml:lang="en">Palomar – a registry of Lean verified mathematics</title>
    <summary xml:lang="en">In recent months there has been a proliferation of AI-generated proofs of various old and new results, some of which have been formalized in the proof assistant language Lean. However, checking that a given Lean repository actually proves the claimed statement is somewhat non-trivial, especially for an audience which is not expert in the use […]</summary>
    <content type="xhtml" xml:lang="en"><div xmlns="http://www.w3.org/1999/xhtml"><p class="wp-block-paragraph">In recent months there has been a proliferation of AI-generated proofs of various old and new results, some of which have been formalized in the proof assistant language Lean.  However, checking that a given Lean repository actually proves the claimed statement is somewhat non-trivial, especially for an audience which is not expert in the use of Lean: one has to first check that the claimed formal Lean statements have proofs that typecheck, that the proofs do not contain any “cheats” such as adding additional axioms, and that the formal statements also match (in a semantic sense) the informal description of the claimed results.  </p>



<p class="wp-block-paragraph">To help bring some clarity to this situation, I am happy to announce that <a href="https://palomar-registry.org/">Palomar registry of Lean verified mathematics</a>, which is an initiative incubated by the <a href="https://lean-lang.org/fro/">Lean FRO</a> and by <a href="https://icarm.io/">ICARM</a>, is now open for submissions.   I am serving in several roles on this registry, including on the scientific advisory board, together with <a href="https://www.andrew.cmu.edu/user/avigad/">Jeremy Avigad</a>, <a href="https://www.matthewrobertballard.com/">Matthew Ballard</a>, <a href="https://jaume.dedios.cat/">Jaume de Dios</a>, <a href="https://www.ndguillen.com/">Nestor Guillen</a>, <a href="https://en.wikipedia.org/wiki/Bryna_Kra">Bryna Kra</a>, <a href="https://tqft.net/">Kim Morrison</a>, <a href="https://math.stanford.edu/~vakil/">Ravi Vakil</a>, and <a href="https://www.math.ias.edu/~akshay/">Akshay Venkatesh</a>.</p>



<p class="wp-block-paragraph">A detailed motivation for Palomar can be found <a href="https://palomar-registry.org/statement">here</a>, and further information about Palomar can be found <a href="https://palomar-registry.org/about">here</a>.  A zeroth approximation of what Palomar intends to be is the analogue of a preprint server for Lean proofs.  More precisely, Palomar (which is named after the <a href="https://sites.astro.caltech.edu/palomar/homepage.html">astronomical observatory</a>) is a registry of external Github repositories (or more precisely, “snapshots” of such repositories, as represented by a specific Github commit) containing Lean code adhering to the current best practices for such formalizations, in particular containing</p>



<ul class="wp-block-list">
<li>A “challenge file” containing a short, human readable description in Lean of the results claimed.</li>



<li>A “solution module” containing an (arbitrarily long) proof of the results claimed in the challenge file.</li>



<li>A “<a href="https://github.com/mathlib-initiative/formalization.yaml">formalization.yaml</a>” file describing the results in informal language, and also containing a number of other relevant metadata and disclosures.</li>
</ul>



<p class="wp-block-paragraph">(There are also some additional technical requirements for the repository which I will omit here.) If a snapshot of a repository is submitted to Palomar, it will check both (a) that the solution module typechecks and proves exactly the results claimed in the challenge file, and that (b) the informal description of the result in the formalization.yaml file appears to match the result claimed in the challenge file, and that the repository meets various minimal standards required for a registry entry. The first check (a) is purely mechanical, using the Lean tool <a href="https://github.com/leanprover/comparator">Comparator</a>; the second check (b) is non-deterministic, being performed by a large language model. If a repository passes both checks, it can be registered on Palomar.  It is worth stressing that the checks in (a) and (b) fall well short of what a proper human peer review of a submission for novelty, interest, and accuracy would give; in particular, Palomar is <strong>not</strong> a peer-reviewed journal.</p>



<p class="wp-block-paragraph">The submission process is thorough, but achievable: as a test, I <a href="https://palomar-registry.org/entry?id=PALOMAR-2026-08-13-000001&amp;version=1">successfully managed</a> to submit my own <a href="https://github.com/teorth/sendov">recent formalization of the proof of Sendov’s conjecture</a> to Palomar, and also plan to submit some older formalizations to the registry soon.</p>



<p class="wp-block-paragraph">In any event, the registry is now open for formalizations of both old and new results. Submissions (whether human-generated, AI-generated, or some mixture of both) are welcome; please read the (somewhat detailed) instructions <a href="https://palomar-registry.org/how-to-submit">here</a> before starting a submission. (I will however note that modern AI agents are quite helpful in assisting with the mechanical details of the submission, though a human review is still strongly recommended.)</p>



<p class="wp-block-paragraph">Discussion and feedback on Palomar will occur on <a href="https://leanprover.zulipchat.com/#narrow/channel/621638-Palomar">this Zulip channel</a>.</p></div>
    </content>
    <updated>2026-08-19T02:59:31Z</updated>
    <published>2026-08-19T02:40:46Z</published>
    <category scheme="https://terrytao.wordpress.com" term="admin"/>
    <category scheme="https://terrytao.wordpress.com" term="advertising"/>
    <category scheme="https://terrytao.wordpress.com" term="Lean"/>
    <category scheme="https://terrytao.wordpress.com" term="Palomar"/>
    <author>
      <name>Terence Tao</name>
      <uri>http://www.math.ucla.edu/~tao</uri>
    </author>
    <source>
      <id>http://terrytao.wordpress.com/feed/atom/</id>
      <link href="https://terrytao.wordpress.com" rel="alternate" type="text/html"/>
      <link href="https://terrytao.wordpress.com/feed/atom/" rel="self" type="application/atom+xml"/>
      <link href="https://terrytao.wordpress.com/osd.xml" rel="search" title="What's new" type="application/opensearchdescription+xml"/>
      <link href="https://s1.wp.com/opensearch.xml" rel="search" title="WordPress.com" type="application/opensearchdescription+xml"/>
      <link href="https://terrytao.wordpress.com/?pushpress=hub" rel="hub" type="text/html"/>
      <subtitle xml:lang="en">Updates on my research and expository papers, discussion of open problems, and other maths-related topics.  By Terence Tao</subtitle>
      <title xml:lang="en">What's new</title>
      <updated>2026-09-08T07:17:02Z</updated>
    </source>
  </entry>

  <entry xml:lang="en">
    <id>300066 at https://www.science20.com</id>
    <link href="https://www.science20.com/a_quantum_diaries_survivor/20260817/antonio_rosino_a_life_for_chess-300066" rel="alternate" type="text/html"/>
    <title xml:lang="en">Antonio Rosino, a Life for Chess</title>
    <summary type="xhtml" xml:lang="en"><div xmlns="http://www.w3.org/1999/xhtml"><span class="field field--name-title field--type-string field--label-hidden">Antonio Rosino, a Life for Chess</span>

            <div class="clearfix text-formatted field field--name-body field--type-text-with-summary field--label-hidden field__item"><p>It is with quite a bit of sadness that I received this evening the news of the passing of Antonio Rosino.</p>
</div>
      <span class="field field--name-uid field--type-entity-reference field--label-hidden"><a class="username" href="https://www.science20.com/profile/tommaso_dorigo" title="View user profile.">Tommaso Dorigo</a></span>
<span class="field field--name-created field--type-created field--label-hidden"><time class="datetime" datetime="2026-08-17T15:22:16-04:00" title="Monday, August 17, 2026 - 15:22">Mon, 08/17/2026 - 15:22</time>
</span>

  <div class="field field--name-field-blog-categories field--type-entity-reference field--label-inline clearfix">
    <div class="field__label">Categories</div>
              <div class="field__item"><a href="https://www.science20.com/culture" hreflang="en">Culture</a></div>
          </div></div>
    </summary>
    <updated>2026-08-17T19:22:16Z</updated>
    <published>2026-08-17T19:22:16Z</published>
    <author>
      <name>Tommaso Dorigo</name>
    </author>
    <source>
      <id>https://www.science20.com/</id>
      <link href="https://www.science20.com/" rel="alternate" type="text/html"/>
      <link href="https://www.science20.com/quantum_diaries_survivor/feed" rel="self" type="application/rss+xml"/>
      <title xml:lang="en">Articles by Tommaso Dorigo</title>
      <updated>2026-09-08T06:42:34Z</updated>
    </source>
  </entry>

  <entry xml:lang="en">
    <id>http://johncarlosbaez.wordpress.com/?p=44268</id>
    <link href="https://johncarlosbaez.wordpress.com/2026/08/12/three-generations-in-e7/" rel="alternate" type="text/html"/>
    <link href="https://johncarlosbaez.wordpress.com/2026/08/12/three-generations-in-e7/#comments" rel="replies" type="text/html"/>
    <link href="https://johncarlosbaez.wordpress.com/2026/08/12/three-generations-in-e7/feed/atom/" rel="replies" type="application/atom+xml"/>
    <title xml:lang="en">Three Generations in E7</title>
    <summary xml:lang="en">It’s long been a mystery why there are 3 generations of quarks and leptons: three sets of particles, apparently identical except for how they interact with the Higgs boson. It would be nice if there were some good physical explanation. Nobody knows one. Barring that, it would be nice if some beautiful mathematical structure made […]</summary>
    <content type="xhtml" xml:lang="en"><div xmlns="http://www.w3.org/1999/xhtml"><p><a href="https://johncarlosbaez.wordpress.com/wp-content/uploads/2026/08/e7_dynkin_standard_model_small.jpg"><img alt="" class="aligncenter size-large wp-image-44296" height="159" src="https://johncarlosbaez.wordpress.com/wp-content/uploads/2026/08/e7_dynkin_standard_model_small.jpg?w=450" width="450"/></a></p>
<p>It’s long been a mystery why there are 3 generations of quarks and leptons: three sets of particles, apparently identical except for how they interact with the Higgs boson.  It would be nice if there were some good physical explanation.  Nobody knows one.   Barring that, it would be nice if some beautiful mathematical structure made this pattern seem natural.   That’s what my new paper is about.</p>
<p>It’s my third paper about exceptional algebraic structures and the Standard Model.  When you classify famous gadgets in algebra, beautiful gadgets with fancy names like ‘simple Lie algebras’ and ‘Euclidean Jordan algebras’ and ‘positive hermitian Jordan pairs’, you tend to get infinite series of them—together with a few exceptions that can be built using the octonions.  This is a bit spooky, so I’ve been interested in this for a long time.</p>
<p>A few physicists have hoped that these exceptions are good for something.  For example, maybe the quirky features of our best theory of particle physics, the Standard Model, aren’t accidental.  Perhaps they fall out naturally from some exceptional algebraic structure.</p>
<p>It’s a long shot, but we’ve been stuck on figuring out new fundamental laws of particle physics for so long—roughly since the early 1980s—that it’s worth a try.</p>
<p>In 2018, <a href="https://arxiv.org/abs/1806.09450">Michel Dubois-Violette and Ivan Todorov</a> noticed that the gauge group of the Standard Model falls out as symmetries of the so-called ‘exceptional Jordan algebra’ together with some ordinary Jordan algebras sitting inside it.  I tried to clarify that here, with a huge amount of help from an excellent young mathematician:</p>
<p>• John Baez and Paul Schwahn, <a href="http://arxiv.org/abs/2606.15235">The Standard Model gauge group from the exceptional Jordan algebra</a>.   (Blog article <a href="https://johncarlosbaez.wordpress.com/2026/06/16/octonions-and-the-standard-model-2/">here</a>.)</p>
<p>It’s very nice, because the Jordan algebras in question arise naturally when you try to axiomatize the foundations of quantum physics.  It would be so cool if something about quantum physics made the Standard Model seem mathematically natural!</p>
<p>But really this result only concerns the gauge bosons in the Standard Model: the photon, gluons, and the W and Z bosons.  It says nothing about the fermions—that is, the quarks and leptons.  And it seems quite hard to get those into the picture.</p>
<p>In 2020, <a href="https://arxiv.org/abs/2006.16265">Latham Boyle</a> tried to solve this problem by tensoring the exceptional Jordan algebra with the complex numbers.  This made <i>one generation</i> of fermions appear quite naturally!  But the connection to the foundations of quantum physics seemed lost: tensoring the exceptional Jordan algebra with the complex numbers seems at first like it might be just a formal trick.</p>
<p>This spring, Latham and his student Endre Bokor and I showed the connection to quantum physics is <i>not</i> lost:</p>
<p>• John Baez, Endre Bokor and Latham Boyle, <a href="https://arxiv.org/abs/2607.10833">Jordan pair quantum theory and the Standard Model</a>.  (Blog article <a href="https://johncarlosbaez.wordpress.com/2026/07/22/jordan-triples-and-the-standard-model/">here</a>.)</p>
<p>The idea is to work, not with Jordan algebras, but with more general things called Jordan pairs, which have been studied by mathematicians since at least 1975.  We showed that you can still do quantum physics with Jordan pairs.  And we showed that there’s an ‘exceptional’ Jordan pair that naturally contains the Standard Model gauge group and one generation of fermions!</p>
<p>This Jordan pair is built from the bioctonions: the octonions tensored with the complex numbers.  And it’s closely related to an exceptional Lie algebra called <img alt="\mathfrak{e}_6." class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathfrak%7Be%7D_6.&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></p>
<p>This is nice because the work of Dubois-Violette and Todorov used a smaller exceptional Lie algebra called <img alt="\mathfrak{f}_4." class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathfrak%7Bf%7D_4.&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>   Going up to <img alt="\mathfrak{e}_6" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathfrak%7Be%7D_6&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> gives the room to include one generation of fermions.</p>
<p>There’s an even larger exceptional Lie algebra you can use to build a Jordan pair: it’s called <img alt="\mathfrak{e}_7." class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathfrak%7Be%7D_7.&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>   Bokor, Boyle and I tried using this to get <em>three</em> generations of fermions.   There are things that make this tempting: not just the fact that <img alt="\mathfrak{e}_7" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathfrak%7Be%7D_7&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is bigger, but the fact that the Jordan pair you get from it has a kind of three-fold symmetry.  But we couldn’t get it to work.</p>
<p>Around this time I got very interested in some work that someone had sent me in October 2025.  My inbox is packed with new theories of physics.  Since the rise of large language models the inflow has increased: I get about two emails a day from someone telling me they’ve made a revolutionary discovery in physics. Practically none of these theories appeal to me.  But this paper, and this thesis, were different:</p>
<p>• Benjamin Nasmith, <a href="https://arxiv.org/abs/2012.03933">An exceptional combinatorial sequence and Standard Model particles</a>, 2020.</p>
<p>• Benjamin Nasmith, <a href="https://espace.rmc.ca/jspui/handle/11264/1423"><i>Tight Projective 5-Designs and Exceptional Structures</i></a>, Ph.D. thesis, Royal Military College of Canada, 2023.</p>
<p>He claimed to fit three generations of fermions into the exceptional Lie algebra <img alt="\mathfrak{e}_7." class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathfrak%7Be%7D_7.&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></p>
<p>When I started seriously trying to understand this paper, I wound up translating it into a language I’m more comfortable with, and expanding on the ideas a bit.  So I wrote this:</p>
<p>• John Baez, <a href="https://math.ucr.edu/home/baez/e7.pdf">Three generations in <img alt="\mathfrak{e}_7." class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathfrak%7Be%7D_7.&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></a></p>
<p>Here’s the basic idea.</p>
<h3> The idea </h3>
<p>There is a standard way to fit the Lie algebra of the Standard Model gauge group, which I call <img alt="\mathfrak{g}_{\text{SM}}," class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathfrak%7Bg%7D_%7B%5Ctext%7BSM%7D%7D%2C&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> into the Lie algebra <img alt="\mathfrak{e}_7." class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathfrak%7Be%7D_7.&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>   You can construct a Lie algebra <img alt="L" class="latex" src="https://s0.wp.com/latex.php?latex=L&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> that fits between them:</p>
<div align="center">
<img alt="\mathfrak{g}_{\text{SM}} \subset L  \subset \mathfrak{e}_7" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathfrak%7Bg%7D_%7B%5Ctext%7BSM%7D%7D+%5Csubset+L++%5Csubset+%5Cmathfrak%7Be%7D_7&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>
</div>
<p>As a vector space we have</p>
<div align="center">
<img alt="\mathfrak{e}_7 \; \cong \; L \oplus V " class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathfrak%7Be%7D_7+%5C%3B+%5Ccong+%5C%3B+L+%5Coplus+V+&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>
</div>
<p>for some vector space <img alt="V" class="latex" src="https://s0.wp.com/latex.php?latex=V&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> of dimension <img alt="3 \times 32." class="latex" src="https://s0.wp.com/latex.php?latex=3+%5Ctimes+32.&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></p>
<p>Moreover, the Lie algebra <img alt="\mathfrak{g}_{\text{SM}}" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathfrak%7Bg%7D_%7B%5Ctext%7BSM%7D%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> acts on <img alt="V" class="latex" src="https://s0.wp.com/latex.php?latex=V&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, via the <img alt="\mathfrak{e}_7" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathfrak%7Be%7D_7&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> Lie bracket, precisely as it does on three generations of Standard Model fermions and their antiparticles, including  right-handed neutrino and its antiparticle—but ignoring spin!</p>
<p>There is, in fact, a very interesting three-fold symmetry built into <img alt="\mathfrak{e}_7," class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathfrak%7Be%7D_7%2C&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> which is revealed when we put the Standard Model Lie algebra <img alt="\mathfrak{g}_{\text{SM}}" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathfrak%7Bg%7D_%7B%5Ctext%7BSM%7D%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> into it.   It permutes the three generations.</p>
<p>Like Nasmith, I am not proposing a theory of physics.   I’m only observing a fascinating mathematical pattern that might (or might not) be of some use in physics.</p>
<p>There are lots of things this pattern does not include: basically, everything I didn’t already mention.   It does not include the <em>spin</em> of the fermions and gauge bosons.   It does not include the <em>Higgs boson</em>, though in some sense it comes close (see the paper).  It does not include a <em>Lagrangian</em>, so it doesn’t say anything at all about particle <em>masses</em> or <em>interactions</em>.</p>
<p>I could say a lot more about this… most importantly, where this Lie algebra <img alt="L" class="latex" src="https://s0.wp.com/latex.php?latex=L&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> comes from.  The details are very interesting.  There’s also the curious role of the right-handed neutrinos.  But I’ve already spent weeks explaining all these things in my paper, so I won’t do it here.   Instead let me say a bit about how I wrote the paper.</p>
<h3> Writing the paper </h3>
<p>I’ve been wanting to keep up with how AI is transforming math.   About a year ago a friend gave me a subscription to Claude Pro.   I wanted to test it out, despite my many misgivings, including how large language models are contributing to global warming and income inequality.   Given the amazing things that people have recently done in math using large language models, I didn’t think that <i>never trying them out</i> would put me in the best position to make good decisions about the future.</p>
<p>So, I wrote this paper with help from Claude Opus 4.8.</p>
<p>I started by giving it Nasmith’s paper and asking a long series of questions about that paper over several days.  The results were very interesting and helpful.  Eventually I asked it to summarize and expand on our conversation.   It quickly spat out a 10-page paper.</p>
<p>This paper was written in a breezy, pleasant style—but also quite hard to understand in detail, since it mixed Nasmith’s terminology with the Lie algebra terminology I prefer, and the proofs skipped over some steps.</p>
<p>It took me about three weeks of hard work to fully understand and re-express all the ideas a way that I like.   For a while I felt dumb and frustrated, because when I asked Claude to fill in the gaps in proofs, it used math I was not very competent in, like the theory of regular subalgebras, and the theory of minuscule representations.  But I learned this math, and everything turned out to be basically correct—in part, I’m sure, because Nasmith’s original work was correct.</p>
<p>For several weeks I checked, reorganized, expanded and completely rewrote this material.   By the end everything was written in a style I like, emphasizing the ideas I consider important, proving things fairly carefully, and adding a lot of expository material—for example, explaining the theory of regular subalgebras.</p>
<p>Almost no traces of Claude’s original writeup remain, even though I was deeply influenced by them.   My proofs make few references to deep theorems, though they assume solid familiarity with simple Lie algebras and their root systems.  The proofs also require no brutally hard computations—though Claude was eager to do such computations to check things.</p>
<p>Any mistakes in this paper are my own.</p>
<p>I’m not sure what conclusions I draw from writing this paper.   I’m writing another math paper now, with a human coauthor, and I have no desire to get help from a large language model.  For work on my own it could be very helpful.   <a href="https://www.ams.org/journals/notices/202607/noti3372/noti3372.html">Jacob Tsimerman</a> says it roughly doubles his productivity.  Would using it be so bad for the environment, or so bad for society, that I should avoid it?   Maybe.   I deliberately stuck with Claude Opus 4.8 instead of something more powerful, to see what I could do with what you get from a $20/month subscription.  But maybe that’s still bad.</p>
<p>I avoid flying to conferences, which in some ways cripples my ability to keep up with new trends and influence people—but I don’t mind that.  It gives me more time to think.</p>
<p>I will think carefully about my next move.</p></div>
    </content>
    <updated>2026-08-17T14:28:22Z</updated>
    <published>2026-08-12T15:50:34Z</published>
    <category scheme="https://johncarlosbaez.wordpress.com" term="mathematics"/>
    <category scheme="https://johncarlosbaez.wordpress.com" term="physics"/>
    <author>
      <name>John Baez</name>
      <uri>http://math.ucr.edu/home/baez/</uri>
    </author>
    <source>
      <id>http://johncarlosbaez.wordpress.com/feed/atom/</id>
      <link href="https://johncarlosbaez.wordpress.com" rel="alternate" type="text/html"/>
      <link href="https://johncarlosbaez.wordpress.com/feed/atom/" rel="self" type="application/atom+xml"/>
      <link href="https://johncarlosbaez.wordpress.com/osd.xml" rel="search" title="Azimuth" type="application/opensearchdescription+xml"/>
      <link href="https://s1.wp.com/opensearch.xml" rel="search" title="WordPress.com" type="application/opensearchdescription+xml"/>
      <link href="https://johncarlosbaez.wordpress.com/?pushpress=hub" rel="hub" type="text/html"/>
      <title xml:lang="en">Azimuth</title>
      <updated>2026-09-07T11:16:32Z</updated>
    </source>
  </entry>

  <entry xml:lang="en">
    <id>http://johncarlosbaez.wordpress.com/?p=44216</id>
    <link href="https://johncarlosbaez.wordpress.com/2026/07/22/jordan-triples-and-the-standard-model/" rel="alternate" type="text/html"/>
    <link href="https://johncarlosbaez.wordpress.com/2026/07/22/jordan-triples-and-the-standard-model/#comments" rel="replies" type="text/html"/>
    <link href="https://johncarlosbaez.wordpress.com/2026/07/22/jordan-triples-and-the-standard-model/feed/atom/" rel="replies" type="application/atom+xml"/>
    <title xml:lang="en">Jordan Triples and the Standard Model</title>
    <summary xml:lang="en">I don’t usually talk about particle physics here. I have a whole series of articles about octonions and the Standard Model on my other blog. But I’m kind of excited about this new paper, so I’ll talk about it here too: • John Baez, Endre Bokor and Latham Boyle, Jordan pair quantum theory and the […]</summary>
    <content type="xhtml" xml:lang="en"><div xmlns="http://www.w3.org/1999/xhtml"><p>I don’t usually talk about particle physics here.  I have a <a href="https://math.ucr.edu/home/baez/standard/#articles">whole series of articles</a> about octonions and the Standard Model on my other blog.  But I’m kind of excited about this new paper, so I’ll talk about it here too:</p>
<p>• John Baez, Endre Bokor and Latham Boyle, <a href="https://arxiv.org/abs/2607.10833">Jordan pair quantum theory and the Standard Model</a>.</p>
<p>Jordan algebras were introduced by Jordan, von Neumann and Wigner in 1934 in an attempt to formalize algebras of observables in quantum theory.  They come in 4 infinite series—but there’s one more, the ‘exceptional Jordan algebra’, consisting of 3 × 3 self-adjoint matrices of octonions.  For years physicists sought to find some use for it.</p>
<p>In 2018, <a href="https://arxiv.org/abs/1806.09450">Todorov and Dubois–Violette</a> noticed that the symmetries of the exceptional Jordan include the Standard Model gauge group in a nice way.  But it was unclear how to bring in the fermions—the quarks and leptons.  That’s what our new paper does.</p>
<p>To do this, we need to go beyond Jordan algebras.  <a href="https://ncatlab.org/nlab/show/Jordan+pair">Jordan pairs</a> and <a href="https://ncatlab.org/nlab/show/Jordan+triple+system">Jordan triples</a> are two closely linked formalisms that generalize Jordan algebras.  Our paper explains them in detail—and how they’re connected to geometry and quantum mechanics.   But here I will mostly skip that wonderful story, so I can quickly explain the connection to the Standard Model.</p>
<p>Here’s how the Standard Model gauge group, together with its representation on one generation of fermions, drops out of a Jordan triple.</p>
<h3>The bi-Cayley triple</h3>
<p>Let</p>
<p><img alt="\mathbb{O}_\mathbb{C} = \mathbb{C} \textstyle{\otimes}_\mathbb{R} \mathbb{O} " class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathbb%7BO%7D_%5Cmathbb%7BC%7D+%3D+%5Cmathbb%7BC%7D+%5Ctextstyle%7B%5Cotimes%7D_%5Cmathbb%7BR%7D+%5Cmathbb%7BO%7D+&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></p>
<p>be the <strong>bioctonions</strong>: octonions with complex coefficients. Write <img alt="\mathbb{O}_\mathbb{C}^2" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathbb%7BO%7D_%5Cmathbb%7BC%7D%5E2&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> for the space of column vectors with two bioctonion entries.</p>
<p><img alt="\mathbb{O}_\mathbb{C}^2" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathbb%7BO%7D_%5Cmathbb%7BC%7D%5E2&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> has a certain <b>triple product</b></p>
<p><img alt="[x,y,z]=\frac{1}{2}(x(y^{\dagger}z)+z(y^{\dagger}x)) " class="latex" src="https://s0.wp.com/latex.php?latex=%5Bx%2Cy%2Cz%5D%3D%5Cfrac%7B1%7D%7B2%7D%28x%28y%5E%7B%5Cdagger%7Dz%29%2Bz%28y%5E%7B%5Cdagger%7Dx%29%29+&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></p>
<p>which obey the axioms of a gadget called a ‘positive hermitian Jordan triple’.   It’s called the <strong>bi-Cayley triple</strong>.</p>
<p>Now, every positive hermitian Jordan triple gives rise to a <img alt="\mathbb{Z}_2" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathbb%7BZ%7D_2&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>-graded real Lie algebra</p>
<p><img alt="\mathbf{k} = \mathbf{k}_0 \textstyle{\oplus} \mathbf{k}_1 " class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathbf%7Bk%7D+%3D+%5Cmathbf%7Bk%7D_0+%5Ctextstyle%7B%5Coplus%7D+%5Cmathbf%7Bk%7D_1+&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></p>
<p>Not a Lie superalgebra: a plain old-fashioned Lie algebra with a <img alt="\mathbb{Z}_2" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathbb%7BZ%7D_2&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>-grading!</p>
<p>How does this work? We take the hermitian Jordan triple itself to be <img alt="\mathbf{k}_1." class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathbf%7Bk%7D_1.&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>  The Lie algebra <img alt="\mathbf{k}_0" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathbf%7Bk%7D_0&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> consists of all linear maps from <img alt="\mathbf{k}_1" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathbf%7Bk%7D_1&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> to itself that are of this form:</p>
<p><img alt="x \mapsto [a,b,x] - [b,a,x] " class="latex" src="https://s0.wp.com/latex.php?latex=x+%5Cmapsto+%5Ba%2Cb%2Cx%5D+-+%5Bb%2Ca%2Cx%5D+&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></p>
<p>for some <img alt="a,b \in \mathbf{k}_1." class="latex" src="https://s0.wp.com/latex.php?latex=a%2Cb+%5Cin+%5Cmathbf%7Bk%7D_1.&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>  These maps are called <b>real inner derivations</b>.  They form a Lie algebra since the commutator of two such maps is another such map.  With a bit more work we can define other operations making all of <img alt="\mathbf{k}" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathbf%7Bk%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> into a <img alt="\mathbb{Z}_2" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathbb%7BZ%7D_2&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>-graded Lie algebra.</p>
<p>So, we get a big Lie algebra <img alt="\mathbf{k}," class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathbf%7Bk%7D%2C&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and a Lie subalgebra <img alt="\mathbf{k}_0" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathbf%7Bk%7D_0&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> sitting inside it.  From this we get two Lie groups: a big one <img alt="K" class="latex" src="https://s0.wp.com/latex.php?latex=K&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> whose Lie algebra is <img alt="\mathbf{k}," class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathbf%7Bk%7D%2C&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and a subgroup <img alt="K_0" class="latex" src="https://s0.wp.com/latex.php?latex=K_0&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> whose Lie algebra is <img alt="\mathbf{k}_0." class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathbf%7Bk%7D_0.&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></p>
<p>The quotient is <img alt="K/K_0" class="latex" src="https://s0.wp.com/latex.php?latex=K%2FK_0&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is a nice kind of manifold called a <a href="https://en.wikipedia.org/wiki/Hermitian_symmetric_space">hermitian symmetric space</a>.  Conversely, any compact hermitian symmetric space give rise to a positive hermitian Jordan triple!</p>
<p>This geometric picture is revealing.  The group <img alt="K" class="latex" src="https://s0.wp.com/latex.php?latex=K&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> acts transitively as symmetries of our hermitian symmetric space, while the stabilizer of any point is isomorphic to <img alt="K_0." class="latex" src="https://s0.wp.com/latex.php?latex=K_0.&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>  Our original Jordan triple, <img alt="\mathbf{k}_1," class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathbf%7Bk%7D_1%2C&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is then the tangent space of that point!  So, <img alt="K_0" class="latex" src="https://s0.wp.com/latex.php?latex=K_0&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> acts on this Jordan triple.  This action preserves the triple product, and we call <img alt="K_0" class="latex" src="https://s0.wp.com/latex.php?latex=K_0&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> the <b>real inner automorphism group</b> of our Jordan triple.</p>
<p>Here’s another great thing about the geometric picture: hermitian symmetric spaces were classified by Eli Cartan (who seems to have spent his life classifying things).  As a result we also know the classification of positive hermitian Jordan triples.  They come in four infinite series together with two exceptions.   One is the bi-Cayley triple, and other is the <b>Albert triple</b>, which is the complexification of the exceptional Jordan algebra.   The bi-Cayley triple is a subtriple of the Albert triple.   It’s these two exceptions that are connected to the Standard Model.  But we’ll start with the bi-Cayley triple.</p>
<p>The 3-graded Lie algebra coming from the bi-Cayley triple is the compact real form of <img alt="\mathfrak{e}_6" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathfrak%7Be%7D_6&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>:</p>
<p><img alt="\mathfrak{e}_6 = \big[\mathfrak{so}(10) \textstyle{\oplus} \mathfrak{u}(1)\big] \textstyle{\oplus} \mathbb{O}_\mathbb{C}^2 " class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathfrak%7Be%7D_6+%3D+%5Cbig%5B%5Cmathfrak%7Bso%7D%2810%29+%5Ctextstyle%7B%5Coplus%7D+%5Cmathfrak%7Bu%7D%281%29%5Cbig%5D+%5Ctextstyle%7B%5Coplus%7D+%5Cmathbb%7BO%7D_%5Cmathbb%7BC%7D%5E2+&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></p>
<p>The even part of this Lie algebra is in brackets.  The corresponding hermitian symmetric space is called the <b>bioctonionic plane</b> <img alt="(\mathbb{C}\otimes\mathbb{O})P^2." class="latex" src="https://s0.wp.com/latex.php?latex=%28%5Cmathbb%7BC%7D%5Cotimes%5Cmathbb%7BO%7D%29P%5E2.&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>  The even part of our 3-graded Lie algebra, <img alt="\mathfrak{so}(10)\oplus \mathfrak{u}(1)," class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathfrak%7Bso%7D%2810%29%5Coplus+%5Cmathfrak%7Bu%7D%281%29%2C&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> generates the stabilizer of a point in the bioctonionic plane.  The odd part, our friend <img alt="\mathbb{O}_\mathbb{C}^2," class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathbb%7BO%7D_%5Cmathbb%7BC%7D%5E2%2C&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is the tangent space of that point.</p>
<p>Here’s the first big surprise.  The even part transforms as the adjoint representation of <img alt="\mathrm{Spin}(10)," class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathrm%7BSpin%7D%2810%29%2C&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> while the odd part itself transforms as the 16-dimensional complex spinor representation of <img alt="\mathrm{Spin}(10)." class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathrm%7BSpin%7D%2810%29.&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> Ignoring the extra <img alt="\mathrm{U}(1)" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathrm%7BU%7D%281%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> for a moment, this is exactly what we see in a <img alt="\mathrm{SO}(10)" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathrm%7BSO%7D%2810%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> grand unified theory: gauge bosons in the adjoint representation, and one generation of fermions in the 16-dimensional spinor representation.</p>
<p>So before we do anything, the bi-Cayley triple already smells like it contains the ingredients of an <img alt="\mathrm{SO}(10)" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathrm%7BSO%7D%2810%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> grand unified theory.</p>
<h3>Tripotents</h3>
<p>In a Jordan algebra the important elements are the idempotents, <img alt="e^2 = e." class="latex" src="https://s0.wp.com/latex.php?latex=e%5E2+%3D+e.&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> In a Jordan triple <img alt="W" class="latex" src="https://s0.wp.com/latex.php?latex=W&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> their role is played by <b>tripotents</b>: elements <img alt="e" class="latex" src="https://s0.wp.com/latex.php?latex=e&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> with</p>
<p><img alt="[e,e,e] = e " class="latex" src="https://s0.wp.com/latex.php?latex=%5Be%2Ce%2Ce%5D+%3D+e+&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></p>
<p>A tripotent always lets us split <img alt="W" class="latex" src="https://s0.wp.com/latex.php?latex=W&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> into three parts via something called its <b>Peirce decomposition</b>.  The operator <img alt="w \mapsto [e,e,w]" class="latex" src="https://s0.wp.com/latex.php?latex=w+%5Cmapsto+%5Be%2Ce%2Cw%5D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> has eigenvalues 0, 1/2, and 1, so <img alt="W" class="latex" src="https://s0.wp.com/latex.php?latex=W&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> splits into the corresponding eigenspaces</p>
<p><img alt="W = W_0(e) \textstyle{\oplus} W_{1/2}(e) \textstyle{\oplus} W_1(e) " class="latex" src="https://s0.wp.com/latex.php?latex=W+%3D+W_0%28e%29+%5Ctextstyle%7B%5Coplus%7D+W_%7B1%2F2%7D%28e%29+%5Ctextstyle%7B%5Coplus%7D+W_1%28e%29+&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></p>
<p>which are called the <b>Peirce 0-space</b>, <b>Peirce 1/2-space</b> and <b>Peirce 1-space</b> of <img alt="e." class="latex" src="https://s0.wp.com/latex.php?latex=e.&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>  A tripotent is called <b>minimal</b> when its Peirce 1-space is one-dimensional.   Two tripotents <img alt="e_1, e_2" class="latex" src="https://s0.wp.com/latex.php?latex=e_1%2C+e_2&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> are called <b>colinear</b> when each lies in the other’s Peirce 1/2-space.</p>
<p>I can’t resist explaining some of the quantum physics here.  In a hermitian Jordan triple, the triple product <img alt="[-,-,-]" class="latex" src="https://s0.wp.com/latex.php?latex=%5B-%2C-%2C-%5D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is linear in the first and last slot, but conjugate-linear in the middle slot.  So, if you multiply a tripotent by a phase <img alt="\alpha," class="latex" src="https://s0.wp.com/latex.php?latex=%5Calpha%2C&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> you get a new tripotent:</p>
<p><img alt="[\alpha e, \alpha e, \alpha e] = \alpha \overline{\alpha} \alpha e = \alpha e" class="latex" src="https://s0.wp.com/latex.php?latex=%5B%5Calpha+e%2C+%5Calpha+e%2C+%5Calpha+e%5D+%3D+%5Calpha+%5Coverline%7B%5Calpha%7D+%5Calpha+e+%3D+%5Calpha+e&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></p>
<p>This should remind you of how when you multiply a unit vector in a Hilbert space by a phase, you get a new unit vector.  In Jordan triple quantum mechanics, minimal tripotents take the place of these unit vectors.  The hermitian symmetric space <img alt="K/K_0" class="latex" src="https://s0.wp.com/latex.php?latex=K%2FK_0&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> that I was talking about earlier is the same as the space of minimal tripotents mod phase!  So, it generalizes the familiar space of ‘pure states’ in quantum mechanics: unit vectors mod phase.</p>
<p>But let’s get back to the Standard Model.</p>
<h3>A chain of Jordan triples</h3>
<p>From here on, the single fact driving everything is this: in any hermitian Jordan triple, any minimal tripotent’s Peirce 1/2-space is itself a hermitian Jordan triple!</p>
<p>If we run this starting from the bi-Cayley triple, we get this chain of hermitian Jordan triples, where each row’s 1/2-space is the next row’s triple:</p>
<table border="1" cellpadding="6" cellspacing="0">
<tbody><tr>
<th align="left">Jordan triple</th>
<th align="left">Lie algebra <img alt="\mathbf{k}_0 \oplus \mathbf{k}_1" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathbf%7Bk%7D_0+%5Coplus+%5Cmathbf%7Bk%7D_1&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> (even part in brackets) </th>
</tr>
<tr>
<td><img alt="W = \mathbb{O}_\mathbb{C}^2" class="latex" src="https://s0.wp.com/latex.php?latex=W+%3D+%5Cmathbb%7BO%7D_%5Cmathbb%7BC%7D%5E2&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></td>
<td><img alt="\mathfrak{e}_6 = [\mathfrak{so}(10) \oplus \mathfrak{u}(1)] \oplus \mathbb{O}_\mathbb{C}^2" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathfrak%7Be%7D_6+%3D+%5B%5Cmathfrak%7Bso%7D%2810%29+%5Coplus+%5Cmathfrak%7Bu%7D%281%29%5D+%5Coplus+%5Cmathbb%7BO%7D_%5Cmathbb%7BC%7D%5E2&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></td>
</tr>
<tr>
<td><img alt="W' = \mathfrak{a}_5(\mathbb{C})" class="latex" src="https://s0.wp.com/latex.php?latex=W%27+%3D+%5Cmathfrak%7Ba%7D_5%28%5Cmathbb%7BC%7D%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></td>
<td><img alt="\mathfrak{so}(10) = [\mathfrak{su}(5) \oplus \mathfrak{u}(1)] \oplus \mathfrak{a}_5(\mathbb{C})" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathfrak%7Bso%7D%2810%29+%3D+%5B%5Cmathfrak%7Bsu%7D%285%29+%5Coplus+%5Cmathfrak%7Bu%7D%281%29%5D+%5Coplus+%5Cmathfrak%7Ba%7D_5%28%5Cmathbb%7BC%7D%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></td>
</tr>
<tr>
<td><img alt="W'' = \mathrm{M}_{3,2}(\mathbb{C})" class="latex" src="https://s0.wp.com/latex.php?latex=W%27%27+%3D+%5Cmathrm%7BM%7D_%7B3%2C2%7D%28%5Cmathbb%7BC%7D%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></td>
<td><img alt="\mathfrak{su}(5) = [\mathfrak{g}_{\mathrm{SM}}] \oplus \mathrm{M}_{3,2}(\mathbb{C})" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathfrak%7Bsu%7D%285%29+%3D+%5B%5Cmathfrak%7Bg%7D_%7B%5Cmathrm%7BSM%7D%7D%5D+%5Coplus+%5Cmathrm%7BM%7D_%7B3%2C2%7D%28%5Cmathbb%7BC%7D%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></td>
</tr>
</tbody></table>
<p>Here <img alt="\mathfrak{a}_5(\mathbb{C})" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathfrak%7Ba%7D_5%28%5Cmathbb%7BC%7D%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is the Jordan triple of antisymmetric <img alt="5\times 5" class="latex" src="https://s0.wp.com/latex.php?latex=5%5Ctimes+5&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> complex matrices, <img alt="\mathrm{M}_{3,2}(\mathbb{C})" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathrm%7BM%7D_%7B3%2C2%7D%28%5Cmathbb%7BC%7D%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is the Jordan triple of <img alt="3\times 2" class="latex" src="https://s0.wp.com/latex.php?latex=3%5Ctimes+2&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> complex matrices, <img alt="\mathfrak{g}_{\mathrm{SM}} = \mathfrak{su}(3)\oplus\mathfrak{su}(2)\oplus \mathfrak{u}(1)," class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathfrak%7Bg%7D_%7B%5Cmathrm%7BSM%7D%7D+%3D+%5Cmathfrak%7Bsu%7D%283%29%5Coplus%5Cmathfrak%7Bsu%7D%282%29%5Coplus+%5Cmathfrak%7Bu%7D%281%29%2C&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and</p>
<p><img alt="G_{\mathrm{SM}} = \mathrm{S}(\mathrm{U}(2) \times \mathrm{U}(3)) \cong (\mathrm{SU}(3)\times\mathrm{SU}(2)\times\mathrm{U}(1))/\mathbb{Z}_6" class="latex" src="https://s0.wp.com/latex.php?latex=G_%7B%5Cmathrm%7BSM%7D%7D+%3D+%5Cmathrm%7BS%7D%28%5Cmathrm%7BU%7D%282%29+%5Ctimes+%5Cmathrm%7BU%7D%283%29%29+%5Ccong+%28%5Cmathrm%7BSU%7D%283%29%5Ctimes%5Cmathrm%7BSU%7D%282%29%5Ctimes%5Cmathrm%7BU%7D%281%29%29%2F%5Cmathbb%7BZ%7D_6&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></p>
<p>is the true Standard Model gauge group.</p>
<h3>The gauge group from two tripotents</h3>
<p>Start with the bi-Cayley triple.  Choose two colinear minimal tripotents <img alt="e_1, e_2." class="latex" src="https://s0.wp.com/latex.php?latex=e_1%2C+e_2.&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>  Descend the table twice:</p>
<p>• Start with <img alt="W = \mathbb{O}_\mathbb{C}^2," class="latex" src="https://s0.wp.com/latex.php?latex=W+%3D+%5Cmathbb%7BO%7D_%5Cmathbb%7BC%7D%5E2%2C&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> which has real inner automorphism group <img alt="(\mathrm{Spin}(10)\times\mathrm{U}(1))/\mathbb{Z}_4." class="latex" src="https://s0.wp.com/latex.php?latex=%28%5Cmathrm%7BSpin%7D%2810%29%5Ctimes%5Cmathrm%7BU%7D%281%29%29%2F%5Cmathbb%7BZ%7D_4.&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></p>
<p>• Fix <img alt="e_1." class="latex" src="https://s0.wp.com/latex.php?latex=e_1.&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> Its Peirce <img alt="1/2" class="latex" src="https://s0.wp.com/latex.php?latex=1%2F2&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>-space is <img alt="W' = \mathfrak{a}_5(\mathbb{C})," class="latex" src="https://s0.wp.com/latex.php?latex=W%27+%3D+%5Cmathfrak%7Ba%7D_5%28%5Cmathbb%7BC%7D%29%2C&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> with real inner automorphism group <img alt="\mathrm{SU}(5)\times\mathrm{U}(1)." class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathrm%7BSU%7D%285%29%5Ctimes%5Cmathrm%7BU%7D%281%29.&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></p>
<p>• Fix <img alt="e_2" class="latex" src="https://s0.wp.com/latex.php?latex=e_2&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> (colinear with <img alt="e_1," class="latex" src="https://s0.wp.com/latex.php?latex=e_1%2C&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> so living in <img alt="W'" class="latex" src="https://s0.wp.com/latex.php?latex=W%27&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>). Its Peirce <img alt="1/2" class="latex" src="https://s0.wp.com/latex.php?latex=1%2F2&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>-space in <img alt="W'" class="latex" src="https://s0.wp.com/latex.php?latex=W%27&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is <img alt="W'' = \mathrm{M}_{3,2}(\mathbb{C})," class="latex" src="https://s0.wp.com/latex.php?latex=W%27%27+%3D+%5Cmathrm%7BM%7D_%7B3%2C2%7D%28%5Cmathbb%7BC%7D%29%2C&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> with real inner automorphism group exactly <img alt="G_{\mathrm{SM}}." class="latex" src="https://s0.wp.com/latex.php?latex=G_%7B%5Cmathrm%7BSM%7D%7D.&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></p>
<p>In other words, the subspace of the bi-Cayley triple colinear with both <img alt="e_1" class="latex" src="https://s0.wp.com/latex.php?latex=e_1&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="e_2" class="latex" src="https://s0.wp.com/latex.php?latex=e_2&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is a Jordan triple whose real inner automorphism group is the Standard Model gauge group.</p>
<p>The choice of <img alt="e_1" class="latex" src="https://s0.wp.com/latex.php?latex=e_1&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="e_2" class="latex" src="https://s0.wp.com/latex.php?latex=e_2&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> also pins down <em>how</em> <img alt="G_{\mathrm{SM}}" class="latex" src="https://s0.wp.com/latex.php?latex=G_%7B%5Cmathrm%7BSM%7D%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> sits inside the original group <img alt="\mathrm{E}_6." class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathrm%7BE%7D_6.&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>  At each we step take the subgroup that acts with determinant <img alt="1" class="latex" src="https://s0.wp.com/latex.php?latex=1&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and preserves the chosen tripotent up to a phase; this gives a chain of subgroups whose members are <img alt="\mathrm{Spin}(10)," class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathrm%7BSpin%7D%2810%29%2C&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> <img alt="\mathrm{U}(5)," class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathrm%7BU%7D%285%29%2C&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="G_{\mathrm{SM}}," class="latex" src="https://s0.wp.com/latex.php?latex=G_%7B%5Cmathrm%7BSM%7D%7D%2C&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> so we get the embeddings</p>
<p><img alt="G_{\mathrm{SM}} \subset \mathrm{SU}(5) \subset \mathrm{Spin}(10) " class="latex" src="https://s0.wp.com/latex.php?latex=G_%7B%5Cmathrm%7BSM%7D%7D+%5Csubset+%5Cmathrm%7BSU%7D%285%29+%5Csubset+%5Cmathrm%7BSpin%7D%2810%29+&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></p>
<p>In particle physics, this is the classic chain taking us from the so-called <img alt="\mathrm{SO}(10)" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathrm%7BSO%7D%2810%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> grand unified theory down to the <img alt="\mathrm{SU}(5)" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathrm%7BSU%7D%285%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> grand unified theory down to the Standard Model.  And it’s well known that restricting the 16-dimensional complex spinor representation of <img alt="\mathrm{Spin}(10)" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathrm%7BSpin%7D%2810%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> along this chain gives precisely the Standard Model representation <img alt="\rho_{\mathrm{SM}}" class="latex" src="https://s0.wp.com/latex.php?latex=%5Crho_%7B%5Cmathrm%7BSM%7D%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> on one generation of fermions!  So we get one generation of Standard Model fermions this way.</p>
<h3>The six particles types as Peirce spaces</h3>
<p>We have gotten the representation of the Standard Model gauge group on one generation of fermions without any fuss.  But it’s also fun to peer into the details, and see how the different kinds of fermions emerge.</p>
<p>For any tripotent <img alt="e," class="latex" src="https://s0.wp.com/latex.php?latex=e%2C&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> we have projections <img alt="P_0(e), P_{1/2}(e)" class="latex" src="https://s0.wp.com/latex.php?latex=P_0%28e%29%2C+P_%7B1%2F2%7D%28e%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="P_1(e)" class="latex" src="https://s0.wp.com/latex.php?latex=P_1%28e%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> onto its three eigenspaces: its so-called <b>Peirce projectors</b>.  Since we get the Standard Model structure using <em>two</em> minimal tripotents <img alt="e_1" class="latex" src="https://s0.wp.com/latex.php?latex=e_1&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="e_2" class="latex" src="https://s0.wp.com/latex.php?latex=e_2&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> in the bi-Cayley triple <img alt="\mathbb{O}_{\mathbb{C}}^2" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathbb%7BO%7D_%7B%5Cmathbb%7BC%7D%7D%5E2&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, there are nine composites of two Peirce projectors we can apply to this triple.  This is how we pick out the different kinds of fermions!</p>
<p>As a representation of the Standard Model Lie algebra</p>
<p><img alt="\mathfrak{g}_{\mathrm{SM}} = \mathfrak{su}(3) \textstyle{\oplus} \mathfrak{su}(2) \textstyle{\oplus} \mathfrak{u}(1) " class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathfrak%7Bg%7D_%7B%5Cmathrm%7BSM%7D%7D+%3D+%5Cmathfrak%7Bsu%7D%283%29+%5Ctextstyle%7B%5Coplus%7D+%5Cmathfrak%7Bsu%7D%282%29+%5Ctextstyle%7B%5Coplus%7D+%5Cmathfrak%7Bu%7D%281%29+&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></p>
<p>any generation of Standard Model fermions transforms as the direct sum of six irreducible representations:</p>
<p><img alt="\rho_{\mathrm{SM}} = (3,2,\tfrac{1}{6}) \textstyle{\oplus} (\bar 3,1,\tfrac{1}{3}) \textstyle{\oplus} (\bar 3,1,-\tfrac{2}{3}) \textstyle{\oplus} (1,2,-\tfrac{1}{2}) \textstyle{\oplus} (1,1,1) \textstyle{\oplus} (1,1,0) " class="latex" src="https://s0.wp.com/latex.php?latex=%5Crho_%7B%5Cmathrm%7BSM%7D%7D+%3D+%283%2C2%2C%5Ctfrac%7B1%7D%7B6%7D%29+%5Ctextstyle%7B%5Coplus%7D+%28%5Cbar+3%2C1%2C%5Ctfrac%7B1%7D%7B3%7D%29+%5Ctextstyle%7B%5Coplus%7D+%28%5Cbar+3%2C1%2C-%5Ctfrac%7B2%7D%7B3%7D%29+%5Ctextstyle%7B%5Coplus%7D+%281%2C2%2C-%5Ctfrac%7B1%7D%7B2%7D%29+%5Ctextstyle%7B%5Coplus%7D+%281%2C1%2C1%29+%5Ctextstyle%7B%5Coplus%7D+%281%2C1%2C0%29+&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></p>
<p>These correspond to the six types of left-handed fermion: <img alt="q_L, \overline{d_R}, \overline{u_R}, \ell_L, \overline{e_R}, \overline{\nu_R}." class="latex" src="https://s0.wp.com/latex.php?latex=q_L%2C+%5Coverline%7Bd_R%7D%2C+%5Coverline%7Bu_R%7D%2C+%5Cell_L%2C+%5Coverline%7Be_R%7D%2C+%5Coverline%7B%5Cnu_R%7D.&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>   Six irreducible pieces, six particle types.</p>
<p>It turns out these are exactly the six nonzero components of the Peirce decomposition of <img alt="\mathbb{O}_\mathbb{C}^2" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathbb%7BO%7D_%5Cmathbb%7BC%7D%5E2&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> with respect to both <img alt="e_1" class="latex" src="https://s0.wp.com/latex.php?latex=e_1&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="e_2." class="latex" src="https://s0.wp.com/latex.php?latex=e_2.&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>  Those six match up one-to-one with the particle types:</p>
<table border="1" cellpadding="6" cellspacing="0">
<tbody><tr>
<th align="left">Peirce projector</th>
<th align="left">representation of <img alt="G_{\text{SM}}" class="latex" src="https://s0.wp.com/latex.php?latex=G_%7B%5Ctext%7BSM%7D%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> </th>
<th align="left">particle type</th>
</tr>
<tr>
<td><img alt="P_{1/2}(e_2) P_{1/2}(e_1)" class="latex" src="https://s0.wp.com/latex.php?latex=P_%7B1%2F2%7D%28e_2%29+P_%7B1%2F2%7D%28e_1%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></td>
<td>(3, 2, +1/6)</td>
<td><img alt="q_L" class="latex" src="https://s0.wp.com/latex.php?latex=q_L&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></td>
</tr>
<tr>
<td><img alt="P_{1/2}(e_2) P_0(e_1)" class="latex" src="https://s0.wp.com/latex.php?latex=P_%7B1%2F2%7D%28e_2%29+P_0%28e_1%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></td>
<td>(<img alt="\overline{3}," class="latex" src="https://s0.wp.com/latex.php?latex=%5Coverline%7B3%7D%2C&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> 1, +1/3)</td>
<td><img alt="\overline{d_R}" class="latex" src="https://s0.wp.com/latex.php?latex=%5Coverline%7Bd_R%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></td>
</tr>
<tr>
<td><img alt="P_0(e_2) P_{1/2}(e_1)" class="latex" src="https://s0.wp.com/latex.php?latex=P_0%28e_2%29+P_%7B1%2F2%7D%28e_1%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> </td>
<td>(<img alt="\overline{3}," class="latex" src="https://s0.wp.com/latex.php?latex=%5Coverline%7B3%7D%2C&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> 1, −2/3)</td>
<td><img alt="\overline{u_R}" class="latex" src="https://s0.wp.com/latex.php?latex=%5Coverline%7Bu_R%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></td>
</tr>
<tr>
<td> <img alt="P_0(e_2) P_0(e_1)" class="latex" src="https://s0.wp.com/latex.php?latex=P_0%28e_2%29+P_0%28e_1%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> </td>
<td>(1, 2, −1/2)</td>
<td><img alt="\ell_L" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cell_L&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></td>
</tr>
<tr>
<td><img alt="P_1(e_2) P_{1/2}(e_1)" class="latex" src="https://s0.wp.com/latex.php?latex=P_1%28e_2%29+P_%7B1%2F2%7D%28e_1%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></td>
<td>(1, 1, +1)</td>
<td><img alt="\overline{e_R}" class="latex" src="https://s0.wp.com/latex.php?latex=%5Coverline%7Be_R%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></td>
</tr>
<tr>
<td><img alt="P_{1/2}(e_2) P_1(e_1)" class="latex" src="https://s0.wp.com/latex.php?latex=P_%7B1%2F2%7D%28e_2%29+P_1%28e_1%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></td>
<td>(1, 1, 0)</td>
<td><img alt="\overline{\nu_R}" class="latex" src="https://s0.wp.com/latex.php?latex=%5Coverline%7B%5Cnu_R%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></td>
</tr>
</tbody></table>
<p>The remaining three combinations—<img alt="P_1(e_2)P_1(e_1)," class="latex" src="https://s0.wp.com/latex.php?latex=P_1%28e_2%29P_1%28e_1%29%2C&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> <img alt="P_1(e_2)P_0(e_1)," class="latex" src="https://s0.wp.com/latex.php?latex=P_1%28e_2%29P_0%28e_1%29%2C&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="P_0(e_2)P_1(e_1)" class="latex" src="https://s0.wp.com/latex.php?latex=P_0%28e_2%29P_1%28e_1%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>—all vanish, which is why we land on six pieces and not nine.</p>
<p>So the whole package—the gauge group <img alt="G_{\mathrm{SM}}," class="latex" src="https://s0.wp.com/latex.php?latex=G_%7B%5Cmathrm%7BSM%7D%7D%2C&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> the embedding <img alt="G_{\mathrm{SM}} \subset \mathrm{Spin}(10)," class="latex" src="https://s0.wp.com/latex.php?latex=G_%7B%5Cmathrm%7BSM%7D%7D+%5Csubset+%5Cmathrm%7BSpin%7D%2810%29%2C&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> the representation <img alt="\rho_{\mathrm{SM}}," class="latex" src="https://s0.wp.com/latex.php?latex=%5Crho_%7B%5Cmathrm%7BSM%7D%7D%2C&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and even the split of one generation into its six particle multiplets as <em>distinct Peirce components</em>—all comes out of the single object <img alt="\mathbb{O}_\mathbb{C}^2" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathbb%7BO%7D_%5Cmathbb%7BC%7D%5E2&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> once you choose two colinear minimal tripotents.</p>
<p>And if you prefer to start one level up, with the Albert triple <img alt="\mathfrak{h}_3(\mathbb{O}) \otimes \mathbb{C}," class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathfrak%7Bh%7D_3%28%5Cmathbb%7BO%7D%29+%5Cotimes+%5Cmathbb%7BC%7D%2C&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> you get the same result by choosing <em>three</em> mutually colinear tripotents instead of two—but for that, read our paper!</p></div>
    </content>
    <updated>2026-08-17T14:10:37Z</updated>
    <published>2026-07-22T12:36:44Z</published>
    <category scheme="https://johncarlosbaez.wordpress.com" term="mathematics"/>
    <category scheme="https://johncarlosbaez.wordpress.com" term="physics"/>
    <author>
      <name>John Baez</name>
      <uri>http://math.ucr.edu/home/baez/</uri>
    </author>
    <source>
      <id>http://johncarlosbaez.wordpress.com/feed/atom/</id>
      <link href="https://johncarlosbaez.wordpress.com" rel="alternate" type="text/html"/>
      <link href="https://johncarlosbaez.wordpress.com/feed/atom/" rel="self" type="application/atom+xml"/>
      <link href="https://johncarlosbaez.wordpress.com/osd.xml" rel="search" title="Azimuth" type="application/opensearchdescription+xml"/>
      <link href="https://s1.wp.com/opensearch.xml" rel="search" title="WordPress.com" type="application/opensearchdescription+xml"/>
      <link href="https://johncarlosbaez.wordpress.com/?pushpress=hub" rel="hub" type="text/html"/>
      <title xml:lang="en">Azimuth</title>
      <updated>2026-09-07T11:16:32Z</updated>
    </source>
  </entry>

  <entry xml:lang="en">
    <id>http://4gravitons.com/?p=14790</id>
    <link href="https://4gravitons.com/2026/08/14/better-bounds/" rel="alternate" type="text/html"/>
    <title>Better Bounds</title>
    <summary>I swear this isn’t turning into an AI blog. But did you see the one about the Riemann hypothesis? Someone at Anthropic did something I’m sure they’re all tempted to do, and tried to use an internal version of their Claude AI system to prove the most famous open conjecture in mathematics. It didn’t work, […]</summary>
    <content type="xhtml"><div xmlns="http://www.w3.org/1999/xhtml"><p class="wp-block-paragraph">I swear this isn’t turning into an AI blog. But did you see the one about the Riemann hypothesis?</p>



<p class="wp-block-paragraph">Someone at Anthropic did something I’m sure they’re all tempted to do, and tried to use an internal version of their Claude AI system to prove the most famous open conjecture in mathematics. <a href="https://www.anthropic.com/research/riemann-zeta">It didn’t work, to be clear</a>, and I get the impression they didn’t expect it to. But out of six hundred or so fruitless tries, one attempt did prove a new bound. Previously, mathematicians had been able to prove that at least 41.6% of the zeroes of the Riemann zeta function satisfied the Riemann hypothesis. Now, the new proof shows that at least 67.2% satisfy it.</p>



<p class="wp-block-paragraph">Anthropic’s press release is impressively careful. As someone who’s had to think about how to write content that both excites the public and doesn’t piss off experts too much, they do an admirable job walking that line. They even say, straight-out, “We don’t expect that the techniques Claude used will lead to proving the Riemann hypothesis.”</p>



<p class="wp-block-paragraph">Bounds are like that, sometimes.</p>



<p class="wp-block-paragraph">I should know. Physicists also find bounds.</p>



<p class="wp-block-paragraph">Physics has its own conjectures with the fame of the Riemann hypothesis. Dark matter might be made of detectable particles. Protons could decay. There might be extra dimensions, or magnetic monopoles, or cosmic strings. General relativity might be subtly wrong.</p>



<p class="wp-block-paragraph">It would be an amazing achievement to demonstrate any of these things. But most physicists won’t manage that. Instead, they bound them. </p>


<div class="wp-block-image">
<figure class="aligncenter size-large is-resized"><a href="https://commons.wikimedia.org/wiki/File:WIMPsLZexperiment2023.png"><img alt="" class="wp-image-14805" src="https://4gravitons.com/wp-content/uploads/2026/08/wimpslzexperiment2023.png" style="width: 472px; height: auto;"/></a></figure>
</div>


<p class="wp-block-paragraph">Physicists compete to get better bounds, excluding unusual possibilities with greater and greater care. They find evidence that dark matter can’t be of a specific mass with a specific charge, so the next experiment has to look somewhere else, or find evidence that general relativity holds to even greater precision, so any deviation must be even smaller. Some work to improve experiments with better and better bounds. Others analyze data from older experiments, or find under-appreciated consequences of known facts, and can get even better bounds.</p>



<p class="wp-block-paragraph">Bounds aren’t typically newsworthy (though <a href="https://www.quantamagazine.org/astrophysicists-find-no-hair-on-black-holes-20250827/">occasionally</a> they make it through), so most people don’t hear about them. If you read the news, you hear about positive claims much more often than negative ones: evidence for something new, not evidence that our current knowledge holds. But the nature of physics is that most work supports the status quo. Most work improves bounds.</p>



<p class="wp-block-paragraph">Do bounds lead, with time, to the positive claims? Sometimes, but not always. Often, bounds are just bounds. They’re attempts to use the methods physicists have to learn something new about the world. Even if the new fact is just “don’t look here”.</p></div>
    </content>
    <updated>2026-08-14T16:00:00Z</updated>
    <published>2026-08-14T16:00:00Z</published>
    <category term="Life as a Physicist"/>
    <category term="academia"/>
    <category term="DoingScience"/>
    <category term="Machine Learning"/>
    <category term="particle physics"/>
    <category term="PublicPerception"/>
    <author>
      <name>4gravitons</name>
    </author>
    <source>
      <id>https://4gravitons.com</id>
      <logo>https://s2.wp.com/i/webclip.png</logo>
      <link href="https://4gravitons.com/feed/" rel="self" type="application/rss+xml"/>
      <link href="https://4gravitons.com" rel="alternate" type="text/html"/>
      <link href="https://4gravitons.com/osd.xml" rel="search" title="4 gravitons" type="application/opensearchdescription+xml"/>
      <link href="https://4gravitons.com/?pushpress=hub" rel="hub" type="text/html"/>
      <subtitle>Stories about physics from someone who's been there</subtitle>
      <title>4 gravitons</title>
      <updated>2026-09-04T11:26:57Z</updated>
    </source>
  </entry>

  <entry xml:lang="en">
    <id>http://gowers.wordpress.com/?p=7320</id>
    <link href="https://gowers.wordpress.com/2026/08/12/what-sort-of-maths-are-llms-good-at/" rel="alternate" type="text/html"/>
    <link href="https://gowers.wordpress.com/2026/08/12/what-sort-of-maths-are-llms-good-at/#comments" rel="replies" type="text/html"/>
    <link href="https://gowers.wordpress.com/2026/08/12/what-sort-of-maths-are-llms-good-at/feed/atom/" rel="replies" type="application/atom+xml"/>
    <title xml:lang="en">What sort of maths are LLMs good at?</title>
    <summary xml:lang="en">For the sake of anyone who might read this blog post in the distant future (a month from now, say), let me mention that I am writing it a few days after OpenAI announced that it had solved ten major problems in mathematics and theoretical computer science, including the first construction of a non-sofic group, […]</summary>
    <content type="xhtml" xml:lang="en"><div xmlns="http://www.w3.org/1999/xhtml"><p class="wp-block-paragraph">For the sake of anyone who might read this blog post in the distant future (a month from now, say), let me mention that I am writing it a few days after OpenAI announced that it had solved ten major problems in mathematics and theoretical computer science, including the first construction of a non-sofic group, and a proof that the multicolour Ramsey number <img alt="R(3,3,...,3)" class="latex" src="https://s0.wp.com/latex.php?latex=R%283%2C3%2C...%2C3%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> (where there are <img alt="k" class="latex" src="https://s0.wp.com/latex.php?latex=k&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> 3’s) grows superexponentially in <img alt="k" class="latex" src="https://s0.wp.com/latex.php?latex=k&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. The first was, to judge from various talks I have been to, one of the most important unsolved problems in group theory, and the second was a major open problem in Ramsey theory that I didn’t necessarily expect to see solved in my lifetime, though of course such expectations now have to be revised. The reason I want to be clear about the timing is that I shall be discussing the current capabilities of LLMs in the full expectation that those will continue to change rapidly. So it is likely that in not too long from now, if there is anything interesting in what I write, it will be interesting mainly as a record of what the situation looked like in early August 2026.</p>



<p class="wp-block-paragraph">These results, and the other eight on the list, are extraordinarily impressive, but it still doesn’t seem to be the case that LLMs are better than all humans at all aspects of mathematics. If they were, then their big speed advantage over us would mean that there would be much more of a flood of results. So it is natural to wonder about what kinds of problems LLMs are good at, and about where there is still room for improvement. I don’t pretend to have a good answer to this question, where a good answer would be a crisp classification that would fit the current examples well, but it is an interesting exercise to try to rule out some bad answers, and to try to identify potential answers that aren’t obviously contradicted by the evidence.</p>



<h2 class="wp-block-heading">Are LLMs particularly good at finding counterexamples?</h2>



<p class="wp-block-paragraph">A first remark here is that LLMs are not just good at finding counterexamples: they can find proofs of difficult statements as well. However, it is notable that the most famous problems they have solved have almost all been with counterexamples rather than proofs. That is true of the two problems mentioned above, and also of the Jacobian conjecture and the unit distance conjecture.</p>



<p class="wp-block-paragraph">If one wants to theorize that LLMs are particularly good at finding counterexamples, then there are two things it would be good to do to make the theory more convincing. The first may sound unproblematic: it is to decide when solving a problem counts as finding a counterexample. Once that is sorted out, the second is to come up with a potential explanation of why LLMs would be particularly well suited to solving problems of that particular kind.</p>



<span id="more-7320"/>



<h3 class="wp-block-heading">What does it mean to find a counterexample?</h3>



<p class="wp-block-paragraph">Why am I suggesting that it is not completely obvious what it means to find a counterexample? Surely, one might suggest, all it means is that you have a statement of the form “Every object of such and such a type has such and such a property,” and you exhibit an object of the given type that does not have the given property.</p>



<p class="wp-block-paragraph">However, this doesn’t always work. Consider a famous result of Vinogradov, which states that every sufficiently large positive integer is a sum of three primes. The negation of this statement is (or is equivalent to) the statement that for every positive integer <img alt="N" class="latex" src="https://s0.wp.com/latex.php?latex=N&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> there exists an integer <img alt="n\geq N" class="latex" src="https://s0.wp.com/latex.php?latex=n%5Cgeq+N&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> such that <img alt="n" class="latex" src="https://s0.wp.com/latex.php?latex=n&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is not a sum of three primes. In other words, it states that every positive integer <img alt="N" class="latex" src="https://s0.wp.com/latex.php?latex=N&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> has a certain property. Seen in this light, Vinogradov found an example of a positive integer <img alt="N" class="latex" src="https://s0.wp.com/latex.php?latex=N&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> that does <em>not</em> have the given property. Do we want to say that Vinogradov found a counterexample? Clearly not — the result should obviously be classified as a theorem and not a counterexample.</p>



<p class="wp-block-paragraph">Thus, we cannot just naively say that LLMs are particularly good at negating universally quantified statements: there has to be something about the <em>nature</em> of the universal quantification. With the three-primes example, it is clear that Vinogradov did not think,  “How am I going to find <img alt="N" class="latex" src="https://s0.wp.com/latex.php?latex=N&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> with this property?” Rather, what he thought would have been more like, “I’ve got an integer <img alt="n" class="latex" src="https://s0.wp.com/latex.php?latex=n&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> that is very large. How am I going to show that it is a sum of three primes?” In other words, all his focus would have been on the universally quantified <img alt="n" class="latex" src="https://s0.wp.com/latex.php?latex=n&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, with the existentially quantified <img alt="N" class="latex" src="https://s0.wp.com/latex.php?latex=N&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> being a sort of afterthought once the details of the proof have been worked out.</p>



<p class="wp-block-paragraph">In general, many interesting results, when they are stated formally, begin with an alternation of two or three (or more) quantifiers. The question then becomes to determine which is the first “interesting” quantified variable in some sense. Here’s another example to illustrate the point, from the theory of finite-dimensional normed spaces. I’ll give a few mathematical details for those curious, but if you don’t care about those, then you can skip the next three paragraphs and should get the gist of what I am saying about this example.</p>



<p class="wp-block-paragraph">Let <img alt="X" class="latex" src="https://s0.wp.com/latex.php?latex=X&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="Y" class="latex" src="https://s0.wp.com/latex.php?latex=Y&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> be two <img alt="n" class="latex" src="https://s0.wp.com/latex.php?latex=n&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>-dimensional normed spaces and let <img alt="T" class="latex" src="https://s0.wp.com/latex.php?latex=T&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> be a linear map from <img alt="X" class="latex" src="https://s0.wp.com/latex.php?latex=X&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> to <img alt="Y" class="latex" src="https://s0.wp.com/latex.php?latex=Y&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. We say that <img alt="T" class="latex" src="https://s0.wp.com/latex.php?latex=T&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is a <img alt="C" class="latex" src="https://s0.wp.com/latex.php?latex=C&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>–<em>isomorphism</em> if there exists <img alt="\lambda&gt;0" class="latex" src="https://s0.wp.com/latex.php?latex=%5Clambda%3E0&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> such that <img alt="\lambda\|x\|\leq\|Tx\|\leq C\lambda\|x\|" class="latex" src="https://s0.wp.com/latex.php?latex=%5Clambda%5C%7Cx%5C%7C%5Cleq%5C%7CTx%5C%7C%5Cleq+C%5Clambda%5C%7Cx%5C%7C&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> for every <img alt="x\in X" class="latex" src="https://s0.wp.com/latex.php?latex=x%5Cin+X&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. By rescaling we can always take <img alt="\lambda" class="latex" src="https://s0.wp.com/latex.php?latex=%5Clambda&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> to be 1, in which case we have that <img alt="\|x\|\leq\|Tx\|\leq C\|x\|" class="latex" src="https://s0.wp.com/latex.php?latex=%5C%7Cx%5C%7C%5Cleq%5C%7CTx%5C%7C%5Cleq+C%5C%7Cx%5C%7C&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> for every <img alt="x\in X" class="latex" src="https://s0.wp.com/latex.php?latex=x%5Cin+X&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. If <img alt="C=1" class="latex" src="https://s0.wp.com/latex.php?latex=C%3D1&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, then this tells us that <img alt="T" class="latex" src="https://s0.wp.com/latex.php?latex=T&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is an isometry. In general, the <em>Banach-Mazur distance</em> <img alt="d(X,Y)" class="latex" src="https://s0.wp.com/latex.php?latex=d%28X%2CY%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> between <img alt="X" class="latex" src="https://s0.wp.com/latex.php?latex=X&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="Y" class="latex" src="https://s0.wp.com/latex.php?latex=Y&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is defined to be the smallest <img alt="C" class="latex" src="https://s0.wp.com/latex.php?latex=C&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> such that there exists a <img alt="C" class="latex" src="https://s0.wp.com/latex.php?latex=C&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>-isomorphism from <img alt="X" class="latex" src="https://s0.wp.com/latex.php?latex=X&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> to <img alt="Y" class="latex" src="https://s0.wp.com/latex.php?latex=Y&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. It is easy to see that the logarithm of the Banach-Mazur distance is a metric on the set of isometry classes of <img alt="n" class="latex" src="https://s0.wp.com/latex.php?latex=n&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>-dimensional normed spaces. A less easy fact, but still not too hard, is that the resulting metric space is compact: in fact, it is known as the Banach-Mazur compactum.</p>



<p class="wp-block-paragraph">It is natural to wonder what the diameter of the Banach-Mazur compactum is, and here things get interesting. A result of Fritz John states that every <img alt="n" class="latex" src="https://s0.wp.com/latex.php?latex=n&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>-dimensional space <img alt="X" class="latex" src="https://s0.wp.com/latex.php?latex=X&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> has distance at most <img alt="\sqrt n" class="latex" src="https://s0.wp.com/latex.php?latex=%5Csqrt+n&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> from <img alt="\ell_2^n" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cell_2%5En&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. (The idea of the proof is as follows: pick inside the unit ball of <img alt="X" class="latex" src="https://s0.wp.com/latex.php?latex=X&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> an <img alt="n" class="latex" src="https://s0.wp.com/latex.php?latex=n&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>-dimensional ellipsoid of maximal volume; that is the unit ball of a normed space <img alt="Y" class="latex" src="https://s0.wp.com/latex.php?latex=Y&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> that is isometric to <img alt="\ell_2^n" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cell_2%5En&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>; it can be shown that the identity map is a <img alt="\sqrt n" class="latex" src="https://s0.wp.com/latex.php?latex=%5Csqrt+n&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>-isomorphism between <img alt="X" class="latex" src="https://s0.wp.com/latex.php?latex=X&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="Y" class="latex" src="https://s0.wp.com/latex.php?latex=Y&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>.) From Fritz John’s theorem and the (multiplicative) triangle inequality, it follows that <img alt="d(X,Y)\leq n" class="latex" src="https://s0.wp.com/latex.php?latex=d%28X%2CY%29%5Cleq+n&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> for any two <img alt="n" class="latex" src="https://s0.wp.com/latex.php?latex=n&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>-dimensional normed spaces. That is, the diameter of the Banach-Mazur compactum is at most <img alt="n" class="latex" src="https://s0.wp.com/latex.php?latex=n&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. But might it be substantially less than that?</p>



<p class="wp-block-paragraph">An indication that the answer is not obvious comes from looking at the spaces <img alt="\ell_1^n" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cell_1%5En&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="\ell_\infty^n" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cell_%5Cinfty%5En&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. The identity map between these two spaces is an <img alt="n" class="latex" src="https://s0.wp.com/latex.php?latex=n&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>-isomorphism, but one can do much better by mapping the standard basis vectors not to themselves but to vertices of the unit cube, with the vertices chosen to be as orthogonal as possible. In particular, if there exists an <img alt="n\times n" class="latex" src="https://s0.wp.com/latex.php?latex=n%5Ctimes+n&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> Hadamard matrix, then the corresponding linear map is a <img alt="\sqrt n" class="latex" src="https://s0.wp.com/latex.php?latex=%5Csqrt+n&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>-isomorphism. One can push this observation and deduce that for any <img alt="p,q\in[1,\infty]" class="latex" src="https://s0.wp.com/latex.php?latex=p%2Cq%5Cin%5B1%2C%5Cinfty%5D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> the Banach-Mazur distance between <img alt="\ell_p^n" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cell_p%5En&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="\ell_q^n" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cell_q%5En&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is <img alt="O(\sqrt n)" class="latex" src="https://s0.wp.com/latex.php?latex=O%28%5Csqrt+n%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. It is also easy to show that <img alt="d(\ell_1^n,\ell_2^n)=\sqrt n" class="latex" src="https://s0.wp.com/latex.php?latex=d%28%5Cell_1%5En%2C%5Cell_2%5En%29%3D%5Csqrt+n&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, so <img alt="\ell_p" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cell_p&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>-spaces hardly improve on the easy lower bound, and do not improve on it at all in dimensions <img alt="n" class="latex" src="https://s0.wp.com/latex.php?latex=n&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> for which an <img alt="n\times n" class="latex" src="https://s0.wp.com/latex.php?latex=n%5Ctimes+n&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> Hadamard matrix exists.</p>



<p class="wp-block-paragraph">In 1981, Gluskin famously solved the problem by determining the correct asymptotics for the diameter of the Banach-Mazur compactum. Informally, what he showed was that the diameter is within a constant of the upper bound that follows immediately from Fritz John’s theorem. If we make the quantification explicit, then the statement we end up with is</p>



<p class="wp-block-paragraph"><img alt="\exists c&gt;0\ \forall n\ \exists X,Y\in K_n\ d(X,Y)\geq cn" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cexists+c%3E0%5C+%5Cforall+n%5C+%5Cexists+X%2CY%5Cin+K_n%5C+d%28X%2CY%29%5Cgeq+cn&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>,</p>



<p class="wp-block-paragraph">where I have written <img alt="K_n" class="latex" src="https://s0.wp.com/latex.php?latex=K_n&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> for the set of all <img alt="n" class="latex" src="https://s0.wp.com/latex.php?latex=n&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>-dimensional normed spaces. (If you want to argue that it is not a set, then let me specify in addition that the underlying vector space is <img alt="\mathbb R^n" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathbb+R%5En&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>.) In words, there is a positive constant <img alt="c" class="latex" src="https://s0.wp.com/latex.php?latex=c&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> such that for every positive integer <img alt="n" class="latex" src="https://s0.wp.com/latex.php?latex=n&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> there are <img alt="n" class="latex" src="https://s0.wp.com/latex.php?latex=n&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>-dimensional normed spaces <img alt="X" class="latex" src="https://s0.wp.com/latex.php?latex=X&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="Y" class="latex" src="https://s0.wp.com/latex.php?latex=Y&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> such that the Banach-Mazur distance between <img alt="X" class="latex" src="https://s0.wp.com/latex.php?latex=X&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="Y" class="latex" src="https://s0.wp.com/latex.php?latex=Y&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is at least <img alt="cn" class="latex" src="https://s0.wp.com/latex.php?latex=cn&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>.</p>



<p class="wp-block-paragraph">I can’t continue without very briefly describing the beautiful and highly influential idea Gluskin had for solving this problem. He took <img alt="X" class="latex" src="https://s0.wp.com/latex.php?latex=X&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="Y" class="latex" src="https://s0.wp.com/latex.php?latex=Y&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> to be normed spaces whose unit balls were random symmetric convex sets defined as follows: take the standard basis vectors and a handful of other random unit vectors, as well as the negatives of all these vectors, and take the convex hull. Gluskin then showed that if two normed spaces are chosen from this distribution, then with high probability their Banach-Mazur distance is at least <img alt="cn" class="latex" src="https://s0.wp.com/latex.php?latex=cn&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>.</p>



<p class="wp-block-paragraph">But back to the main point, which is that the logical form of the above statement is very similar to the logical form of Vinogradov’s theorem, which is</p>



<p class="wp-block-paragraph"><img alt="\exists N\ \forall n\geq N\ \exists p_1,p_2,p_3\in P\ \ p_1+p_2+p_3=n" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cexists+N%5C+%5Cforall+n%5Cgeq+N%5C+%5Cexists+p_1%2Cp_2%2Cp_3%5Cin+P%5C+%5C+p_1%2Bp_2%2Bp_3%3Dn&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></p>



<p class="wp-block-paragraph">where I have written <img alt="P" class="latex" src="https://s0.wp.com/latex.php?latex=P&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> for the set of primes. And yet, Vinogradov’s result is unquestionably a theorem, while Gluskin’s result is unquestionably a counterexample, or at least an example.</p>



<p class="wp-block-paragraph">What is the important difference between the two statements? It seems to be that in Vinogradov’s three-primes theorem the number <img alt="n" class="latex" src="https://s0.wp.com/latex.php?latex=n&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> plays a more essential role in the statement that is to be proved about the various quantified variables. In Vinogradov’s theorem, that statement is <img alt="n=p_1+p_2+p_3" class="latex" src="https://s0.wp.com/latex.php?latex=n%3Dp_1%2Bp_2%2Bp_3&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, whereas for Gluskin’s theorem the statement to be proved is</p>



<p class="wp-block-paragraph"><img alt="\dim X = \dim Y = n" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cdim+X+%3D+%5Cdim+Y+%3D+n&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="d(X,Y)\geq cn" class="latex" src="https://s0.wp.com/latex.php?latex=d%28X%2CY%29%5Cgeq+cn&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>,</p>



<p class="wp-block-paragraph">which we can write equivalently as</p>



<p class="wp-block-paragraph"><img alt="\dim X = \dim Y = n" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cdim+X+%3D+%5Cdim+Y+%3D+n&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="d(X,Y)\geq c\dim X" class="latex" src="https://s0.wp.com/latex.php?latex=d%28X%2CY%29%5Cgeq+c%5Cdim+X&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>.</p>



<p class="wp-block-paragraph">In the case of Vinogradov’s theorem, the whole challenge is to get those three primes to add up to <img alt="n" class="latex" src="https://s0.wp.com/latex.php?latex=n&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, whereas for Gluskin it is not remotely challenging to get the dimensions of <img alt="X" class="latex" src="https://s0.wp.com/latex.php?latex=X&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="Y" class="latex" src="https://s0.wp.com/latex.php?latex=Y&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> to equal <img alt="n" class="latex" src="https://s0.wp.com/latex.php?latex=n&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>: the challenge is to get <img alt="X" class="latex" src="https://s0.wp.com/latex.php?latex=X&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="Y" class="latex" src="https://s0.wp.com/latex.php?latex=Y&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> to be very far from each other, relative to their common dimension.</p>



<p class="wp-block-paragraph">There is a further complication to bear in mind here, which is that via the process known as Skolemization, a universally quantified statement of the form <img alt="\forall x\in X\ \exists y\in Y\ \ P(x,y)" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cforall+x%5Cin+X%5C+%5Cexists+y%5Cin+Y%5C+%5C+P%28x%2Cy%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> can be converted into an existentially quantifed statement <img alt="\exists f:X\to Y\ \forall x\in X\ \ P(x,f(x))" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cexists+f%3AX%5Cto+Y%5C+%5Cforall+x%5Cin+X%5C+%5C+P%28x%2Cf%28x%29%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. (For this to be an equivalence one needs the axiom of choice, but it is certainly a sufficient condition.) This is not just a piece of logical trickery, but it often reflects quite accurately how we think about some problems. For instance, it is more natural to think of Gluskin’s example as a recipe for constructing (or at least proving the existence of) a pair of suitable normed spaces for any given dimension <img alt="n" class="latex" src="https://s0.wp.com/latex.php?latex=n&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, or in other words to construct a suitable function from <img alt="\mathbb N" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathbb+N&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> to pairs of normed spaces by giving its value at each <img alt="n" class="latex" src="https://s0.wp.com/latex.php?latex=n&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, than it is to think of it as a statement that says that every positive integer <img alt="n" class="latex" src="https://s0.wp.com/latex.php?latex=n&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> has a certain complicated property.</p>



<p class="wp-block-paragraph">Yet another complication is that some universally quantified statements follow naturally from existentially quantified statements, or may even be equivalent to them. For example, the theorem that a 2-dimensional torus is not homeomorphic to a 2-dimensional sphere is a universally quantified statement (every map from the torus to the sphere fails to be a homeomorphism), but the natural way to prove it is to prove the existential statement that there is an invariant that distinguishes the two spaces. For an example of where a universal statement is equivalent to an existential statement, consider a statement of the form that a vector <img alt="x\in\mathbb R^n" class="latex" src="https://s0.wp.com/latex.php?latex=x%5Cin%5Cmathbb+R%5En&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> does not belong to the convex hull of a certain compact set <img alt="A" class="latex" src="https://s0.wp.com/latex.php?latex=A&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. The statement that no convex combination of elements of <img alt="A" class="latex" src="https://s0.wp.com/latex.php?latex=A&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is equal to <img alt="x" class="latex" src="https://s0.wp.com/latex.php?latex=x&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is equivalent to the existence of a linear functional <img alt="\phi:\mathbb R^n\to\mathbb R" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cphi%3A%5Cmathbb+R%5En%5Cto%5Cmathbb+R&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and a <img alt="\lambda\in\mathbb R" class="latex" src="https://s0.wp.com/latex.php?latex=%5Clambda%5Cin%5Cmathbb+R&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> such that <img alt="\phi(x)&gt;\lambda" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cphi%28x%29%3E%5Clambda&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="\phi(a)\leq\lambda" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cphi%28a%29%5Cleq%5Clambda&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> for every <img alt="a\in A" class="latex" src="https://s0.wp.com/latex.php?latex=a%5Cin+A&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. In both these cases it feels natural to regard the result as a theorem that is proved via an existential statement, perhaps because it is the theorem that is ultimately what interests us. But using “what interests us” as a criterion to determine what counts as a counterexample seems a little vague, and is a difficult criterion to use if we want to explain convincingly why AI should be good at finding counterexamples.</p>



<p class="wp-block-paragraph">A more general argument against the notion that there is something about existential statements that is particularly suited to AI is that the need to establish existential statements pervades almost all of mathematical research, regardless of the nature of the headline result being aimed for. For example, if I want to prove a statement by induction, I may well look for a strengthening of the statement that serves better as an inductive hypothesis. Or if I want to prove that every object of type <img alt="T" class="latex" src="https://s0.wp.com/latex.php?latex=T&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> with property <img alt="P" class="latex" src="https://s0.wp.com/latex.php?latex=P&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> also has property <img alt="Q" class="latex" src="https://s0.wp.com/latex.php?latex=Q&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, then I may well look for a property <img alt="R" class="latex" src="https://s0.wp.com/latex.php?latex=R&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> that follows from <img alt="P" class="latex" src="https://s0.wp.com/latex.php?latex=P&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and can be used to prove <img alt="Q" class="latex" src="https://s0.wp.com/latex.php?latex=Q&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. These are more metamathematical existence problems, but the distinction can be somewhat blurred, and more importantly, when trying to prove a statement <img alt="S" class="latex" src="https://s0.wp.com/latex.php?latex=S&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, it is often the case that the main question in our minds is less, “Why is <img alt="S" class="latex" src="https://s0.wp.com/latex.php?latex=S&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> true?” and more, “What could a proof of <img alt="S" class="latex" src="https://s0.wp.com/latex.php?latex=S&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> be like?” To give an example, I feel I understand pretty well why Goldbach’s conjecture is true — a highly plausible probabilistic model of the primes implies it and agrees closely with computational data — but if I were making a serious attempt to prove it, that understanding, which many mathematicians have had for a century or so, would be of limited help. Rather, my main task would be to try to find proof techniques that were powerful enough to make those heuristic ideas rigorous.</p>



<h3 class="wp-block-heading">What is the difference between an example and a counterexample?</h3>



<p class="wp-block-paragraph">Logically, every statement of the form <img alt="\exists x\ P(x)" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cexists+x%5C+P%28x%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is a counterexample to the universally quantified statement <img alt="\forall x\ \neg P(x)" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cforall+x%5C+%5Cneg+P%28x%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. However, we do not describe all existential statements as counterexamples. For example, if I were to say, “The <img alt="\ell_p" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cell_p&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>-spaces with <img alt="1\leq p&lt;\infty" class="latex" src="https://s0.wp.com/latex.php?latex=1%5Cleq+p%3C%5Cinfty&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> are all separable, as is <img alt="c_0" class="latex" src="https://s0.wp.com/latex.php?latex=c_0&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, but <img alt="\ell_\infty" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cell_%5Cinfty&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is not separable,” I would not describe the second part of that assertion as a counterexample to the claim that all Banach spaces are separable. Rather, I would present it as probably the most basic example of a non-separable space. The important point seems to be that there was no particular reason to think that all Banach spaces would be separable, and finding an example of a non-separable space is not very difficult.</p>



<p class="wp-block-paragraph">I think the first point is more important here: we are more inclined to call an object a counterexample if the existence of that object disproves a statement that we had quite good reason to believe. It often happens that after repeated unsuccessful attempts to prove a statement, mathematicians begin to feel that it has no particular reason to be true, even if it seems to be hard to come up with a counterexample to it. In such a situation, if a counterexample is eventually found, it may have lost something of its “counter” feel. My impression is that the construction of a non-sofic group comes into this category. There have been several proposals in the literature for how one might construct such a group, and I don’t think there were many (or even any?) experts who strongly believed that all groups were sofic. So it feels more natural to say, “OpenAI came up with the first example of a non-sofic group” than to say, “OpenAI found a counterexample to the soficity conjecture” (despite the fact that that section of their paper is entitled “A counterexample to the soficity conjecture”).</p>



<p class="wp-block-paragraph">Likewise, it seems to me that the new lower bound for multicolour Ramsey numbers is more of an example than a counterexample. I think quite a lot of people believed that the bound should be exponential, so for them it was a counterexample, but others, myself included, were more neutral about it. As a matter of fact, I have worked on the problem in the past (a long time ago) in an equivalent formulation, which asks how many triangle-free graphs on <img alt="n" class="latex" src="https://s0.wp.com/latex.php?latex=n&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> vertices you need if you want their union to be the complete graph <img alt="K_n" class="latex" src="https://s0.wp.com/latex.php?latex=K_n&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. If you take bipartite graphs, then it’s easy to see that you need <img alt="\log_2n" class="latex" src="https://s0.wp.com/latex.php?latex=%5Clog_2n&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> of them, but that bound can be improved if instead you observe that a complete 5-partite graph can be written as a union of two triangle-free subgraphs, and therefore it is possible to write the complete graph as a union of <img alt="2\log_5n" class="latex" src="https://s0.wp.com/latex.php?latex=2%5Clog_5n&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> triangle-free graphs. It is then tempting to try to do better, with triangle-free graphs that are less dense but that make up for it with unbounded chromatic number — a necessary condition if one wishes to use a sublogarithmic number of graphs, which is equivalent to showing a superexponential lower bound for <img alt="R(3,3,\dots,3)" class="latex" src="https://s0.wp.com/latex.php?latex=R%283%2C3%2C%5Cdots%2C3%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. All this is to say that when I worked on the problem, my efforts were concentrated on what turned out to be the right direction, so for me OpenAI found an example of what I (weakly) expected, rather than a counterexample.</p>



<h2 class="wp-block-heading">Where does this leave us?</h2>



<p class="wp-block-paragraph">I would like to find a coherent explanation of the conjunction of the following facts.</p>



<ol class="wp-block-list">
<li>The most notable mathematical results proved by LLMs have tended to be ones that we would classify as examples or counterexamples, where counterexamples are, broadly speaking, existence statements that disprove statements that we expected to be true.</li>



<li>Many statements can be formulated as existence statements when we would usually think of them as universal statements, and vice versa, so what we consider to be an example depends on the mathematical context of a statement as well as its logical form.</li>



<li>LLMs are pretty good at proving universal statements as well: it’s just that the strongest statements they have proved that we would think of as theorems have mainly not been at the level of the strongest statements that we would think of as counterexamples.</li>
</ol>



<p class="wp-block-paragraph">Given these facts, it seems likely that what LLMs are good at is something else, which happens to have as a consequence that they are good at the kind of existence problem that we would normally classify as asking to find a non-trivial example.</p>



<p class="wp-block-paragraph">Let us consider two things that we can be confident that LLMs are good at. One of them is knowing a lot of mathematics: if a problem can be solved by means of a relatively standard argument, it is highly likely that an LLM will be able to find and use that argument. The other is the ability that an LLM has simply by virtue of being a computer: it can work at huge speed (compared with humans at least) and can therefore afford to make a large number of unsuccessful attempts at a problem before it finds a solution.</p>



<p class="wp-block-paragraph">Without even looking at what LLMs have actually managed to solve, one might guess that these two features would lead to their having a somewhat different style from human mathematicians. Very roughly, LLMs would have the edge when there is more of a probabilistic element to the proof-finding process: they would be good at problems for which the best method is to try a lot of ideas, not necessarily particularly novel, until at some point you get lucky. Humans on the other hand would be better (for the moment) at finding more “surprising” and “conceptual” arguments, where the appropriate method is to dig deeper and deeper into a problem until the solution reveals itself. (It is hard to say exactly what this means, but I hope that any experienced researcher reading this will know what I am talking about.)</p>



<p class="wp-block-paragraph">This raises two questions: does the guess above correspond at all to the reality that we are observing, and is there any reason to suppose that what I have tentatively described as the “LLM style” of doing mathematics would lead naturally to LLMs discovering several counterexamples (or just examples) to long-standing conjectures, even if that was by no means all they could do?</p>



<p class="wp-block-paragraph">I don’t pretend to have a scientific answer to either question, but the reactions of experts to several of the remarkable solutions that ChatGPT has found do lend some support to the idea that LLMs work in more of a try-lots-of-things-till-you-get-lucky way. People often seem to react by saying something like, “Initially I was amazed that the problem had been solved, but on closer inspection I realized that the approach was actually not all that novel, and one that with the right small hint a suitably expert human could have found quite easily.”</p>



<p class="wp-block-paragraph">For the second question — whether the LLM style is well suited to finding (counter)examples — I think matters are less clear, because there are many ways of searching for a counterexample, and some of them fit better than others the style I have described. Here are a few general methods. (I don’t claim that the list is exhaustive.)</p>



<ol class="wp-block-list">
<li><strong>Look for an off-the-shelf example</strong>. Here one has a stock of fairly standard examples and one simply tries them out one after another to see whether any of them fails to satisfy the given statement. For example, Ryan O’Donnell ends his wonderful book on the analysis of Boolean functions with some tips, one of which is, “If you have a conjecture about Boolean functions, test it on dictators, majority, parity, tribes (and maybe recursive majority of 3). If it’s true for these functions, it’s probably true.”</li>



<li><strong>Build an example from basic examples and standard construction methods.</strong> For an algebraic problem, for instance, one might start with some standard examples, but then take products or quotients or limits.</li>



<li><strong>Make heavy use of metavariables.</strong> The word “metavariable” comes from computer science, and in particular from automatic theorem proving, and refers to the practice that in mathematics would correspond to writing, “where <img alt="x" class="latex" src="https://s0.wp.com/latex.php?latex=x&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is to be chosen later,” (in which case <img alt="x" class="latex" src="https://s0.wp.com/latex.php?latex=x&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is the metavariable). In a paper we usually do this only in fairly simple situations such as when we need to choose a number <img alt="\epsilon&gt;0" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cepsilon%3E0&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> that is small enough for later arguments to work. But when we search for an example of an object <img alt="x" class="latex" src="https://s0.wp.com/latex.php?latex=x&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> that satisfies some property <img alt="Q" class="latex" src="https://s0.wp.com/latex.php?latex=Q&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> (which may well be a conjunction of simpler properties <img alt="Q_1,\dots,Q_k" class="latex" src="https://s0.wp.com/latex.php?latex=Q_1%2C%5Cdots%2CQ_k&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>), it is often not a good strategy to specify <img alt="x" class="latex" src="https://s0.wp.com/latex.php?latex=x&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> completely and only then to check whether it satisfies <img alt="Q" class="latex" src="https://s0.wp.com/latex.php?latex=Q&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. Instead, it can be more fruitful to do almost the opposite: we start by saying virtually nothing about <img alt="x" class="latex" src="https://s0.wp.com/latex.php?latex=x&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and simply launch into proving that it satisfies <img alt="Q" class="latex" src="https://s0.wp.com/latex.php?latex=Q&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. In the course of doing so, we find that we need <img alt="x" class="latex" src="https://s0.wp.com/latex.php?latex=x&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> to satisfy a property <img alt="P_1" class="latex" src="https://s0.wp.com/latex.php?latex=P_1&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. If we are lucky we can describe in a nice way a very general class of objects <img alt="x" class="latex" src="https://s0.wp.com/latex.php?latex=x&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> that satisfy <img alt="P_1" class="latex" src="https://s0.wp.com/latex.php?latex=P_1&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. For instance, we may be able to find a parametrized class: we identify some function <img alt="f" class="latex" src="https://s0.wp.com/latex.php?latex=f&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and show that <img alt="f(y)" class="latex" src="https://s0.wp.com/latex.php?latex=f%28y%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> satisfies <img alt="P_1" class="latex" src="https://s0.wp.com/latex.php?latex=P_1&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> for every <img alt="y" class="latex" src="https://s0.wp.com/latex.php?latex=y&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> of a certain type. The problem is then reduced to finding <img alt="y" class="latex" src="https://s0.wp.com/latex.php?latex=y&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> such that $Q(f(y))$ holds, which is a more specific version of the original problem. There may be many iterations of this process, or a mixture of this process and other processes, before an example is eventually found.</li>



<li><strong>Try to prove the opposite.</strong> If one wishes to find <img alt="x" class="latex" src="https://s0.wp.com/latex.php?latex=x&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> such that <img alt="Q(x)" class="latex" src="https://s0.wp.com/latex.php?latex=Q%28x%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, it can be surprisingly helpful to start by attempting to prove the statement <img alt="\forall x\ \neg Q(x)" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cforall+x%5C+%5Cneg+Q%28x%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. The reason this can be helpful is that using our standard methods of attempting to prove something, we may end up identifying a key lemma that would suffice: that is, we may find an intermediate property <img alt="R" class="latex" src="https://s0.wp.com/latex.php?latex=R&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> that implies <img alt="\neg Q" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cneg+Q&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> in a non-trivial way and thus reduce the problem <img alt="\forall x\ \neg Q(x)" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cforall+x%5C+%5Cneg+Q%28x%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> to <img alt="\forall x\ R(x)" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cforall+x%5C+R%28x%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. Turning things round again, it may well then be that finding a counterexample to <img alt="R" class="latex" src="https://s0.wp.com/latex.php?latex=R&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is easier than finding a counterexample to <img alt="\neg Q" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cneg+Q&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> (that is, an example that satisfies <img alt="Q" class="latex" src="https://s0.wp.com/latex.php?latex=Q&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>). Of course, there is no guarantee that a counterexample to <img alt="R" class="latex" src="https://s0.wp.com/latex.php?latex=R&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> will be an example of <img alt="Q" class="latex" src="https://s0.wp.com/latex.php?latex=Q&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, but sometimes we are lucky and it is. More often, we can use the idea of the previous method, noting that it is at least a necessary condition of an example of <img alt="Q" class="latex" src="https://s0.wp.com/latex.php?latex=Q&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> that it should not be an example of <img alt="R" class="latex" src="https://s0.wp.com/latex.php?latex=R&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, so one can try to describe a general class of objects that fail <img alt="R" class="latex" src="https://s0.wp.com/latex.php?latex=R&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and in that way reduce the problem.</li>



<li><strong>Successive approximation.</strong> Sometimes, when we are searching for an example of <img alt="x" class="latex" src="https://s0.wp.com/latex.php?latex=x&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> such that <img alt="Q(x)" class="latex" src="https://s0.wp.com/latex.php?latex=Q%28x%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, we write down a moderately plausible guess <img alt="x_0" class="latex" src="https://s0.wp.com/latex.php?latex=x_0&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> not because we think it has a chance of working (if we did, then we would be using the first strategy), but because we hope that if <img alt="x_0" class="latex" src="https://s0.wp.com/latex.php?latex=x_0&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> does not satisfy <img alt="Q" class="latex" src="https://s0.wp.com/latex.php?latex=Q&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, then we will be able to diagnose what went wrong and specify a new guess <img alt="x_1" class="latex" src="https://s0.wp.com/latex.php?latex=x_1&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> that does not have that defect. Again, this strategy can either be iterated or combined with one or more of the other strategies.</li>



<li><strong>Just-do-it proofs.</strong> Sometimes we need <img alt="x" class="latex" src="https://s0.wp.com/latex.php?latex=x&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> to satisfy infinitely many properties <img alt="Q_1,Q_2,\dots" class="latex" src="https://s0.wp.com/latex.php?latex=Q_1%2CQ_2%2C%5Cdots&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, each of which is, individually, quite easy to satisfy. In such situations, we often “build” <img alt="x" class="latex" src="https://s0.wp.com/latex.php?latex=x&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> inductively bit by bit, ensuring at the <img alt="i" class="latex" src="https://s0.wp.com/latex.php?latex=i&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>th stage of the process that however the building process continues, <img alt="x" class="latex" src="https://s0.wp.com/latex.php?latex=x&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> will satisfy <img alt="Q_i" class="latex" src="https://s0.wp.com/latex.php?latex=Q_i&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>.</li>



<li><strong>Pick a random example.</strong> Often it is very hard to give an explicit example of an <img alt="x" class="latex" src="https://s0.wp.com/latex.php?latex=x&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> that satisfies <img alt="Q" class="latex" src="https://s0.wp.com/latex.php?latex=Q&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, but there is a natural probability distribution for which one can show that if one chooses <img alt="x" class="latex" src="https://s0.wp.com/latex.php?latex=x&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> randomly from that distribution, then with high probability (or at least non-zero probability) it will satisfy <img alt="Q" class="latex" src="https://s0.wp.com/latex.php?latex=Q&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>.</li>



<li><strong>Pick a generic example.</strong> In more infinite contexts, it may again be quite hard to give an explicit example of an <img alt="x" class="latex" src="https://s0.wp.com/latex.php?latex=x&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> that satisfies <img alt="Q" class="latex" src="https://s0.wp.com/latex.php?latex=Q&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, but one may be able to show that the set of <img alt="x" class="latex" src="https://s0.wp.com/latex.php?latex=x&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> that fail <img alt="Q" class="latex" src="https://s0.wp.com/latex.php?latex=Q&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is or measure zero, or is a meagre set, or is small in some other way.</li>
</ol>



<p class="wp-block-paragraph">There is no particular reason to suppose that LLMs would be equally good at each of the methods above. So perhaps what we are observing is not quite that LLMs have a particular ability to find examples, but more that they are particularly good at finding examples (and proofs) in a certain way. Looking at the above techniques, one might imagine that they would be very well suited to checking off-the-shelf examples, finding just-do-it proofs (since that is a rather standard method with lots of instances in their training data), using the probabilistic method (unless, as often happens, significant new ideas are needed to show that the probabilities work out), and picking generic examples. The other three methods described above — use of metavariables, trying to prove the opposite, and using successive approximation — require more of an ability to judge whether the approach one is taking is likely to be fruitful. Here it seems at least possible that humans will sometimes have an advantage, but the conditions that a problem would need to satisfy are quite stringent. One would need an example to be one that lies at a leaf of a very large search tree — too large to be searched for by a combination of moderate mathematical ability and brute force — but that can be found by a mathematician with a sufficiently good nose for when they are making progress that they can prune the search tree very substantially.</p>



<p class="wp-block-paragraph">Why wouldn’t LLMs also have that “nose”? I don’t rule out that “nose” is an emergent property of the way LLMs are trained, and that within a year or two they will have it to the same extent that we have it. But for now, in my interactions with ChatGPT, I do have a distinct impression that they haven’t got there quite yet. When I discuss an open problem with 5.6 Pro, I am often presented with approaches that sound promising until I think about them carefully, and then seem quite a lot less promising. And they will also often end a response by saying, “I have not managed to answer the question you asked, but have managed to reduce it to the following much narrower and more precise question,” which sounds very promising until it has happened five times without any obvious progress having been made. It isn’t completely obvious how they will get better at this, since their training data will not be full of examples of fruitful and less fruitful directions to pursue when trying to solve problems: all they will typically see is tidied up proofs that hide the thought processes of their discoverers. Of course, human mathematicians also don’t get to learn much about how to do research from the experience of other mathematicians, and yet we somehow manage to pick it up. But the situation is a little different for us, in that a lot of what we learn is by <em>doing</em> rather than <em>emulating</em>.</p>



<p class="wp-block-paragraph">Another reason it is not obvious that “nose” is a property that emerges naturally when LLMs are scaled up is that if LLMs make heavy use of their broad knowledge and can afford to do a lot more brute-force search than humans can, then they will lack the incentive that humans have to prune the search tree ruthlessly. It could conceivably be that their successes so far are achieved using methods that for a human would be considered extremely inefficient, but that because of their superior speed and knowledge, the combinatorial explosion these methods will lead to has not yet become apparent. </p>



<p class="wp-block-paragraph">It would be very interesting to try to test this experimentally, but it is also difficult, because if an LLM has what looks like the kind of idea that could only be the result of “deep thought” about a problem, we can never be sure that it has actually carried out that deep thought, as opposed to finding a model argument already in the literature, or in other words exploiting the deep thought of a human mathematician. It would probably be easier (but still not easy) to test it by using models that are less powerful than the latest ones and that have been to some extent shielded from the mathematical literature: one could give them a carefully designed suite of problems and see whether the ones that the LLMs solve have particular characteristics. </p>



<p class="wp-block-paragraph">It may seem as though I am desperately clinging to the hope that humans will continue to be able to make meaningful contributions to mathematical discovery for a while yet, but while I do indeed hope that, I am not making any assertions of the form “LLMs will never be able to do X”. I think it is likely that they will, and given the pace of progress over the last three years it will probably happen quite soon. But I do think that there may be a hurdle for LLMs to clear and it seems at least possible that it won’t be cleared as straightforwardly as some of the previous hurdles.</p>



<p class="wp-block-paragraph">In that connection, it would also be interesting to see whether a different reward structure leads to LLMs being able to solve different kinds of problems. For example, if during training an LLM (or machine-learning system of some other kind) is not just rewarded if it ends up with a solution, but also penalized if it explores too many dead ends or if it “cheats” by getting the answer from the literature, perhaps it would be incentivized to go about the research process in a more human way and thereby achieve better results for classes of problems where it is yet to make a big impact. </p>



<p class="wp-block-paragraph">If the hurdle is cleared, either by pure scaling up or by some more thoughtful method, it will be quite difficult to know when that has happened, since, as just mentioned, an idea that seems very original and surprising may just be lurking somewhere in an LLM’s training data. But I would be confident that it had been cleared if an LLM were to come up with a proof that was as surprising to me as the solution of the cap-set problem was in 2016: the previous best known bounds were completely eclipsed, the method was utterly different from anything I had thought about trying, and afterwards there was a flurry of activity as people came to understand what this wonderful new technique was capable of.</p>



<h2 class="wp-block-heading">Conclusion</h2>



<p class="wp-block-paragraph">I wasn’t quite sure where I would end up when I started this post, and now that I’ve got to the end, I feel that my main conclusions are not particularly new or surprising, but I hope that the route to them is of some interest. The main points I have made are the following.</p>



<ol class="wp-block-list">
<li>“Finding an example” is in practice not the same thing as proving a statement that begins with an existential quantifier.</li>



<li>If it is true that current models are particularly good at finding examples, that is probably not because they have a particular affinity for existential statements, but more because the proof-discovery methods that are appropriate for finding certain kinds of examples play to the obvious strengths of LLMs: wide knowledge and the ability to explore many paths of the search tree that humans would judge to have a low probability of success. </li>



<li>It seems likely that LLMs will carry on improving very quickly. However, if, contrary to expectations (mine at least), there turns out to be some residual class of problems (or other mathematical activities) for which humans continue to have the edge for a while, it is likely that those will be problems for which the mysterious human ability to prune the proof-discovery search tree is particularly advantageous: that is to say, problems where the search tree is deep and has a large amount of branching, so that without rigorous pruning a search is not feasible even for a computer. </li>



<li>A good sign that LLMs have reached human level for a much wider class of problems will be if they start proving theorems using methods that, like much of the very best human mathematics, are new and surprising but that with hindsight come to seem beautiful and natural. They should also be methods that are difficult to stumble on by accident. It is hard to say precisely what would count as such a proof, but I think we’ll recognise it when we see it.</li>
</ol></div>
    </content>
    <updated>2026-08-13T07:34:46Z</updated>
    <published>2026-08-12T10:00:33Z</published>
    <category scheme="https://gowers.wordpress.com" term="AI and maths"/>
    <category scheme="https://gowers.wordpress.com" term="ai"/>
    <category scheme="https://gowers.wordpress.com" term="mathematics"/>
    <author>
      <name>gowers</name>
      <uri>https://gowers.wordpress.com</uri>
    </author>
    <source>
      <id>http://gowers.wordpress.com/feed/atom/</id>
      <link href="https://gowers.wordpress.com" rel="alternate" type="text/html"/>
      <link href="https://gowers.wordpress.com/feed/atom/" rel="self" type="application/atom+xml"/>
      <link href="https://gowers.wordpress.com/osd.xml" rel="search" title="Gowers's Weblog" type="application/opensearchdescription+xml"/>
      <link href="https://s1.wp.com/opensearch.xml" rel="search" title="WordPress.com" type="application/opensearchdescription+xml"/>
      <link href="https://gowers.wordpress.com/?pushpress=hub" rel="hub" type="text/html"/>
      <subtitle xml:lang="en">Mathematics related discussions</subtitle>
      <title xml:lang="en">Gowers's Weblog</title>
      <updated>2026-08-13T07:34:46Z</updated>
    </source>
  </entry>

  <entry xml:lang="en">
    <id>300060 at https://www.science20.com</id>
    <link href="https://www.science20.com/a_quantum_diaries_survivor/20260811/from_inspiration_to_impact_10_years_of_research_on_ai_for" rel="alternate" type="text/html"/>
    <title xml:lang="en">From Inspiration to Impact: 10 Years of Research on AI for Physics</title>
    <summary type="xhtml" xml:lang="en"><div xmlns="http://www.w3.org/1999/xhtml"><span class="field field--name-title field--type-string field--label-hidden">From Inspiration to Impact: 10 Years of Research on AI for Physics</span>

            <div class="clearfix text-formatted field field--name-body field--type-text-with-summary field--label-hidden field__item"><p>A graph tells a thousand words - in this one, I present a summary of my past 10 years of research, trying to exploit the new AI technologies to improve the way we do research in fundamental science.</p>
</div>
      <span class="field field--name-uid field--type-entity-reference field--label-hidden"><a class="username" href="https://www.science20.com/profile/tommaso_dorigo" title="View user profile.">Tommaso Dorigo</a></span>
<span class="field field--name-created field--type-created field--label-hidden"><time class="datetime" datetime="2026-08-11T07:05:15-04:00" title="Tuesday, August 11, 2026 - 07:05">Tue, 08/11/2026 - 07:05</time>
</span>

  <div class="field field--name-field-blog-categories field--type-entity-reference field--label-inline clearfix">
    <div class="field__label">Categories</div>
              <div class="field__item"><a href="https://www.science20.com/physics" hreflang="en">Physics</a></div>
          </div></div>
    </summary>
    <updated>2026-08-11T11:05:15Z</updated>
    <published>2026-08-11T11:05:15Z</published>
    <author>
      <name>Tommaso Dorigo</name>
    </author>
    <source>
      <id>https://www.science20.com/</id>
      <link href="https://www.science20.com/" rel="alternate" type="text/html"/>
      <link href="https://www.science20.com/quantum_diaries_survivor/feed" rel="self" type="application/rss+xml"/>
      <title xml:lang="en">Articles by Tommaso Dorigo</title>
      <updated>2026-09-08T06:42:34Z</updated>
    </source>
  </entry>

  <entry xml:lang="en">
    <id>http://quantumfrontiers.com/?p=18033</id>
    <link href="https://quantumfrontiers.com/2026/08/09/interacting-collaborators-reveal-noninteracting-fermions/" rel="alternate" type="text/html"/>
    <link href="https://quantumfrontiers.com/2026/08/09/interacting-collaborators-reveal-noninteracting-fermions/#comments" rel="replies" type="text/html"/>
    <link href="https://quantumfrontiers.com/2026/08/09/interacting-collaborators-reveal-noninteracting-fermions/feed/atom/" rel="replies" type="application/atom+xml"/>
    <title xml:lang="en">Interacting collaborators reveal noninteracting fermions</title>
    <summary type="xhtml" xml:lang="en"><div xmlns="http://www.w3.org/1999/xhtml">By day, I work as an experimentalist on laser-cooling molecules, but I’ve never fully surrendered my theoretical-physics license. I started as an undergraduate in Lincoln Carr’s group at the Colorado School of Mines in Golden, CO. I learned from his … <a href="https://quantumfrontiers.com/2026/08/09/interacting-collaborators-reveal-noninteracting-fermions/">Continue reading <span class="meta-nav">→</span></a></div>
    </summary>
    <content type="xhtml" xml:lang="en"><div xmlns="http://www.w3.org/1999/xhtml"><p class="wp-block-paragraph">By day, I work as an experimentalist on laser-cooling molecules<sup class="fn"><a href="https://quantumfrontiers.com/2026/08/09/interacting-collaborators-reveal-noninteracting-fermions/#d3b5c7a5-138d-4d21-9042-bcd2b3ce7d67" id="d3b5c7a5-138d-4d21-9042-bcd2b3ce7d67-link">1</a></sup>, but I’ve never fully surrendered my theoretical-physics license. I started as an undergraduate in Lincoln Carr’s group at the Colorado School of Mines in Golden, CO. I learned from his expertise in simulations and complex systems. Since then I’ve moonlighted as a theorist while also pursuing an unrelated PhD and, now, an unrelated postdoc position. With <a href="https://quantumfrontiers.com/author/nyungerhalpern/">Nicole Yunger Halpern</a> and other collaborators, we devised a quantum circuit whose dynamics looked complex when run on a quantum computer. It took six years and five collaborators across four countries to discover that, for the right settings, these complex dynamics could be understood when viewed from the right angle.</p>



<p class="wp-block-paragraph">Some time ago, <a href="https://quantumfrontiers.com/2021/12/03/balancing-the-tradeoff/">I told you about quantum cellular automata</a> (QCA). These quantum machines are built from one-dimensional strings of qubits. A qubit changes its state depending on the state of its two nearest neighbors. Different rules are encoded into three-qubit gates that change a central qubit based on the state of its left and right neighbors. Some rules induce change for many combinations of neighbor states. Others, less. We apply this neighborhood-constrained update in two waves, first to every other qubit, then to the ones skipped in the first wave. This is a common quantum circuit structure called a brickwork pattern. We call one rule the <em>Goldilocks</em> QCA: A qubit is updated if one of its neighbors is a 0 while the other is a 1 (<em>activity</em>); otherwise the qubit does not change its state (<em>inactivity</em>).</p>


<div class="wp-block-image">
<figure class="aligncenter size-large"><a href="https://quantumfrontiers.com/wp-content/uploads/2026/07/igqca_fig1.jpg"><img alt="" class="wp-image-18075" src="https://quantumfrontiers.com/wp-content/uploads/2026/07/igqca_fig1-edited-1.jpg"/></a><figcaption class="wp-element-caption">The first figure from our <a href="https://doi.org/10.1088/2058-9565/ae57d5">recent paper</a> illustrating the Goldilocks QCA brickwork circuit. Orange boxes represent unitary gates. Half-white-half-black circles represent the Goldilocks neighborhood constraint. Some choices for the unitary gate result in free fermion dynamics. Most choices are consistent with chaos.</figcaption></figure>
</div>


<p class="wp-block-paragraph">Repeating brickwork layers of the Goldilocks rule, we found, balances activity and inactivity to be “just right,” as Goldilocks might say. Striking this balance produced <a href="https://doi.org/10.1088/2058-9565/ac1c41">surprisingly rich patterns of quantum correlation</a>. The same type of network structure is found in complex classical systems like metabolic pathways, social networks, and brain activity. What’s more, the observed patterns of connectivity persist through thousands of circuit layers while other QCA tend towards uniformity.</p>


<div class="wp-block-image">
<figure class="aligncenter size-large is-resized"><a href="https://quantumfrontiers.com/wp-content/uploads/2026/07/goldilocks.jpg"><img alt="" class="wp-image-18067" height="658" src="https://quantumfrontiers.com/wp-content/uploads/2026/07/goldilocks.jpg?w=1024" style="width: 442px; height: auto;" width="1024"/></a><figcaption class="wp-element-caption">Goldilocks in a state of activity. Published by The Grolier Society, 1912</figcaption></figure>
</div>


<p class="wp-block-paragraph">Our new paper, <em><a href="https://doi.org/10.1088/2058-9565/ae57d5">Integrability of Goldilocks quantum cellular automata</a></em>, answers a question that’s been lurking underneath that first result for the last several years. <em>Why</em> does this balance produce such rich and persistent structure? Some Goldilocks QCA, we prove, map onto free fermions, one of the simplest examples of exactly solvable quantum dynamics. How does uncovering this simplification explain the persistent complex patterns? The answer follows from the concept of <em>conservation laws</em>. Piecing together this understanding required assembling an international team of experts who generously shared their knowledge and time. I’ll tell a bit of this scientific story through the lens of our collaboration’s history.</p>



<p class="wp-block-paragraph">A key inspiration for this work started with a May 2020 video call with Norman Margolus, an MIT-affiliated researcher and pioneer of using cellular automata to model real systems. In the 1980s he worked on a custom computer chip called CAM-6, and later CAM-8, that was dedicated to simulating massive arrays of cellular automata with the limited computational resources of the era<sup class="fn"><a href="https://quantumfrontiers.com/2026/08/09/interacting-collaborators-reveal-noninteracting-fermions/#2d2d1845-aaca-466c-991c-40dd5331fac7" id="2d2d1845-aaca-466c-991c-40dd5331fac7-link">2</a></sup>. He proudly showed us beautiful pictures of cellular automata simulating phenomena like optical refraction and chemical reactions. </p>


<div class="wp-block-image">
<figure class="aligncenter size-large is-resized"><a href="https://quantumfrontiers.com/wp-content/uploads/2026/07/margolus_book.jpg"><img alt="" class="wp-image-18046" height="1000" src="https://quantumfrontiers.com/wp-content/uploads/2026/07/margolus_book.jpg?w=787" style="width: 265px; height: auto;" width="787"/></a><figcaption class="wp-element-caption">Cellular automata book by Norman Margolus. His coauthor’s name may also be familiar to those with quantum-circuit experience. Published by MIT Press, 1987.</figcaption></figure>
</div>


<p class="wp-block-paragraph">He told us a story about trying to mimic fluid flow with the simple local rules of classical cellular automata. These models, called <em>lattice gas automata</em>, were first defined on a square lattice. While they did show fluid-like behavior, these models did not quite correctly conserve momentum<sup class="fn"><a href="https://quantumfrontiers.com/2026/08/09/interacting-collaborators-reveal-noninteracting-fermions/#56221ea9-76d4-4968-b797-94846416793f" id="56221ea9-76d4-4968-b797-94846416793f-link">3</a></sup>. Moving to a <a href="https://doi.org/10.1103/PhysRevLett.56.1505">hexagonal lattice fixed up these problems</a> and the community was able to devise cellular automata that quantitatively modeled continuum fluid flow.</p>


<div class="wp-block-image">
<figure class="aligncenter size-large is-resized"><a href="https://quantumfrontiers.com/wp-content/uploads/2026/07/fhp_closed_box_pulse.gif"><img alt="" class="wp-image-18076" height="439" src="https://quantumfrontiers.com/wp-content/uploads/2026/07/fhp_closed_box_pulse.gif?w=1024" style="width: 461px; height: auto;" width="1024"/></a><figcaption class="wp-element-caption">The author’s primitive lattice-gas cellular automaton showing an initial high-density region displaying wave-like propagation, reflection, and diffusion into a low-density background.</figcaption></figure>
</div>


<p class="wp-block-paragraph">Part of that story stuck with me: conservation laws are fundamental ingredients of a physical model. Our Goldilocks quantum cellular automata, we observe, exhibit persistent complex structures. Could some conservation law be behind these observations? If found, could these conservation laws be harnessed for more efficient simulations? Going even further, could there be enough conservation laws to exactly solve the dynamics (at least in principle)? This property would buy the system membership in a special class called <em>integrable systems.</em></p>



<p class="wp-block-paragraph">An integrable system conserves enough quantities, often called <em>charges</em> in the quantum setting, that you can compute its future state from its conservation laws and its initial conditions. Two-body gravitational orbits are a classic example. The initial positions and velocities set the orbital energy and angular momentum in the center-of-mass reference frame. Those two conserved quantities let you write down an exact equation for the orbit’s shape.</p>


<div class="wp-block-image">
<figure class="aligncenter size-large is-resized"><a href="https://quantumfrontiers.com/wp-content/uploads/2026/07/kepler_orbit-2.gif"><img alt="" class="wp-image-18059" height="592" src="https://quantumfrontiers.com/wp-content/uploads/2026/07/kepler_orbit-2.gif?w=796" style="width: 404px; height: auto;" width="796"/></a><figcaption class="wp-element-caption">A familiar integrable system from classical mechanics: the two-body gravitational orbit. Angular momentum <em>L=r x p</em> is conserved. So are the total energy and the Runge-Lenz vector<em> A</em>.</figcaption></figure>
</div>


<p class="wp-block-paragraph">A chaotic system, by contrast, may conserve energy and even a few other quantities, but not enough for us to solve for the state arbitrarily far in the future. To find out what a chaotic system does, you have to evolve the equations of motion approximately—one small time step at a time. Chaotic systems are the norm in nature; integrable ones are rare. To illustrate their qualitative differences, compare the regularity of the above orbit to the trend towards uniformity in the above lattice-gas simulation. In the quantum regime, physicists still don’t fully agree on the precise definition of integrability, though conservation of many independent quantities is a strong indicator.</p>



<p class="wp-block-paragraph">In August 2020, Nicole emailed Lorenzo Piroli about his preprint on QCA, now published as <a href="https://doi.org/10.1103/PhysRevLett.125.190402">Phys. Rev. Lett. 125, 190402</a>. Lorenzo was a postdoc at the Max Planck Institute for Quantum Optics in Garching, Germany when we first met. He is now an associate professor at the University of Bologna and expert in many-body quantum dynamics. The correspondence that unfolded set the blueprint for the research effort that followed. One of us would ask a question, and Lorenzo would respond incredibly fast with accurate and useful detail. He started working with us to understand why the Goldilocks QCA dynamics appeared so unique. Lorenzo would suggest computations, I would implement them, and we would discuss what the results meant.</p>



<p class="wp-block-paragraph">Then came an echo of the collaboration’s inception. In May 2021, Nicole pointed out a relevant preprint from Tomaž Prosen, now published in<a href="https://doi.org/10.1063/5.0056970"> Chaos 31, 093101</a>. Tomaž is a Slovenian physicist at the University of Ljubljana and a leading researcher in the fields of quantum chaos and integrability. I sent an email about the connections between our work and his. He responded with enthusiasm. He shared some code that would, through exhaustive search, find quantities conserved by our QCA.</p>



<p class="wp-block-paragraph">The code’s brute-force approach meant the algorithm could only find conservation laws defined over, at most, a 5-qubit subsystem. A tantalizing signal emerged: the number of conserved quantities supported by 5 qubits exceeded the number supported by 3 qubits. Having more and more conserved quantities as you look at larger neighborhoods is a signature of integrability. Soon after, Tomaž proved one of our Goldilocks QCA is integrable using a well-established toolkit from statistical mechanics called <a href="https://quantumfrontiers.com/2016/05/22/quantum-braiding-its-all-in-and-on-your-head/">Yang-Baxter integrability</a>. He built a parametric transfer matrix, essentially a machine that spits out a new conserved quantity every time you turn its mathematical crank<sup class="fn"><a href="https://quantumfrontiers.com/2026/08/09/interacting-collaborators-reveal-noninteracting-fermions/#538a7e3b-e30d-46bf-85dd-c2c4ee36a981" id="538a7e3b-e30d-46bf-85dd-c2c4ee36a981-link">4</a></sup>.</p>


<div class="wp-block-image">
<figure class="aligncenter size-large is-resized"><a href="https://quantumfrontiers.com/wp-content/uploads/2026/07/baxter_book.jpg"><img alt="" class="wp-image-18048" height="490" src="https://quantumfrontiers.com/wp-content/uploads/2026/07/baxter_book.jpg?w=320" style="width: 271px; height: auto;" width="320"/></a><figcaption class="wp-element-caption">Rodney Baxter’s classic textbook. Published by Academic Press, 1982</figcaption></figure>
</div>


<p class="wp-block-paragraph">But there was a wrinkle. The transfer matrix generates charges that mutually commute, meaning you can measure them simultaneously. For example, you can know a quantum particle’s kinetic energy and momentum simultaneously because those operators commute. Yet, the search algorithm kept finding charges that did not commute with each other, like a particle’s position and momentum. The only explanation was that our QCA has more charges than the transfer matrix method guarantees, and more than are minimally required for integrability. This extra-conservation-law property, called <em>superintegrability,</em> also shows up in two-body gravitational orbits. In addition to energy and angular momentum, orbits conserve the <em>Runge-Lenz vector</em>. Nicole is an expert on <a href="https://quantumfrontiers.com/2023/08/28/the-book-of-mark-chapter-2/">noncommuting charges</a>, so this is where one of her main research efforts entered the QCA collaboration.</p>



<p class="wp-block-paragraph">Next came a key insight from Lorenzo: the automaton we had been considering was one member of a larger family of integrable Goldilocks QCA. He showed this using a <em>Jordan-Wigner transformation</em>, a mathematical dictionary that translates between the language of qubits and the language of fermions. Complexity in the qubit language transformed into simplicity in the fermion language. Under this translation, our QCA mapped to noninteracting, or <em>free</em>, fermions: particles that never bump into or influence each other. That lack of interaction is what makes free-fermion dynamics easy to calculate. A system of free fermions is a well-known example of superintegrability.</p>



<p class="wp-block-paragraph">Along the way, Lorenzo recruited his friend and collaborator Eric Vernier, a CNRS researcher based in Paris, France. He is an expert on <em>vertex models</em>. The classical version of the <em>six-vertex model </em>was <a href="https://doi.org/10.1021/ja01315a102">developed in the 1930s </a>to explain a troubling mystery: Water ice appears to have more entropy than permitted by the third law of thermodynamics at near-zero temperature. In the six-vertex model, a water molecule’s oxygen atom is envisioned at every vertex in a square lattice. Each molecule contributes two hydrogen ions, to use Baxter’s terminology, that fall along the lattice edges. Intermolecular hydrogen bonds between adjacent molecules slightly alter the intramolecular O-H bonds. To maintain electrical neutrality, each oxygen (lattice vertex) has two nearby and two far-away hydrogen ions (four edges), leading to six possible <em>ice vertices</em>. The vertices are commonly visualized in three ways: 1) as the dots representing hydrogen ions located on edges near or far from each vertex, 2) as electric dipole arrows pointing into (“ion is close”) or out of (“ion is far”) each vertex, or 3) as thick (downward- and leftward-pointing dipoles) and thin (upward- and rightward-pointing dipoles) edges. Despite the model’s simplicity (2D square lattice) compared to real ice (3D tetrahedral lattice), it agrees with experimentally measured entropy values to better than 2%.</p>



<figure class="wp-block-image size-large"><a href="https://quantumfrontiers.com/wp-content/uploads/2026/07/ice.png"><img alt="" class="wp-image-18078" height="334" src="https://quantumfrontiers.com/wp-content/uploads/2026/07/ice.png?w=975" width="975"/></a><figcaption class="wp-element-caption">This figure appears in chapter 8 of R.J. Baxter’s book. It shows three visualizations of the same ice crystal.</figcaption></figure>



<p class="wp-block-paragraph">More recently, vertex models have been adapted from two-dimensional classical crystals to one-dimensional quantum systems that evolve in time. Eric showed us how the ice vertices relate to QCA circuit rules. In doing so, Eric uncovered an even larger set of integrable Goldilocks QCA than that found by Lorenzo. Eventually, Lorenzo’s Jordan-Wigner transformation method and Eric’s six-vertex method agreed on the complete family of integrable Goldilocks QCA.</p>


<div class="wp-block-image">
<figure class="aligncenter size-large"><a href="https://quantumfrontiers.com/wp-content/uploads/2026/07/igqca_fig2-1.jpg"><img alt="" class="wp-image-18050" height="154" src="https://quantumfrontiers.com/wp-content/uploads/2026/07/igqca_fig2-1.jpg?w=1024" width="1024"/></a><figcaption class="wp-element-caption">Representation of the six ice vertices from our recent paper (rotated 45 degrees from the lattice shown above). The <em>a</em>, <em>b</em>, and <em>c</em> variables represent the classical statistical weight or the quantum transition amplitude for each vertex type.</figcaption></figure>
</div>


<p class="wp-block-paragraph">We finally had our Avengers-style collaboration: individual heroes brought together to wield their unique strengths. With Lincoln’s supervision, I developed the QCA models and performed the computations. Lorenzo found the Jordan-Wigner transformation. Tomaž found the first signals of integrability and delivered a set of conservation laws. Nicole brought her expertise in quantum thermodynamics, clarifying how the noncommuting charges constrain dynamics. Eric made the six-vertex connection. We drafted and redrafted the paper until it balanced the scientific story, the analytical derivations, and the numerical evidence.</p>


<div class="wp-block-image">
<figure class="aligncenter size-large is-resized"><a href="https://quantumfrontiers.com/wp-content/uploads/2026/07/avengers.jpg"><img alt="" class="wp-image-18061" height="1023" src="https://quantumfrontiers.com/wp-content/uploads/2026/07/avengers.jpg?w=742" style="width: 261px; height: auto;" width="742"/></a><figcaption class="wp-element-caption">Our team collaborated over six years.<br/>Art by Barry Windsor-Smith. Published by Titan Comics, 2024</figcaption></figure>
</div>


<p class="wp-block-paragraph">Because the discovered family of Goldilocks QCA maps to free fermions, we can efficiently simulate them classically. I simulated 256 qubits on my laptop this way. These large simulations were satisfying: I had worked with this model for years with an order of magnitude fewer qubits and even saw the dynamics implemented on <a href="https://www.nature.com/articles/s41467-022-32056-y">Google’s Sycamore-era hardware with 23 qubits</a>. Most Goldilocks QCA are consistent with chaos rather than integrability, and therefore hard to simulate classically. Therefore, our work gives experimentalists a tunable model: dial in integrable dynamics for something checkable at large qubit number. Set up chaotic dynamics for a potential demonstration of <a href="https://quantumfrontiers.com/2026/01/06/has-quantum-advantage-been-achieved/">quantum advantage.</a></p>



<p class="wp-block-paragraph">While preparing this post, I opened my old email account to check the timeline set out above. I looked through nearly six years of email chains, some with hundreds of messages, full of logistics for coordinating each author’s ever-changing time zone, and dozens of calculations and results that never made it into the paper. This collaboration helped me grow as a researcher in a big way.</p>



<p class="wp-block-paragraph">I found old emails where Nicole was coaching me on messaging potential collaborators. I can hardly believe she dedicated so much effort to mentoring me. We have never met in person, despite our shared work starting when <a href="https://quantumfrontiers.com/2016/01/10/life-cellular-automata-and-mentoring/">I was an undergraduate and she was a graduate student</a> more than a decade ago. If you know Nicole, you can probably believe it easily. I had similar moments with each collaborator. They all gave their time and expertise generously over the many years this paper took to come together. </p>



<p class="wp-block-paragraph">As I continue my efforts in experimental physics, I will pay forward the effort and generosity shared with me by this collaboration. I may even keep my theoretical-physics license for a while longer. </p>


<ol class="wp-block-footnotes"><li id="d3b5c7a5-138d-4d21-9042-bcd2b3ce7d67">“By day” doesn’t mean “by daylight.” Laser labs are almost always in a windowless basement.  <a href="https://quantumfrontiers.com/2026/08/09/interacting-collaborators-reveal-noninteracting-fermions/#d3b5c7a5-138d-4d21-9042-bcd2b3ce7d67-link"><img alt="&#x21A9;" class="wp-smiley" src="https://s0.wp.com/wp-content/mu-plugins/wpcom-smileys/twemoji/2/72x72/21a9.png" style="height: 1em;"/>︎</a></li><li id="2d2d1845-aaca-466c-991c-40dd5331fac7">CAM-6 featured 32 kB of cell-state memory (CAM-8 had 8 MB ), far less than the memory currently used by this author’s numerous open browser tabs. <a href="https://quantumfrontiers.com/2026/08/09/interacting-collaborators-reveal-noninteracting-fermions/#2d2d1845-aaca-466c-991c-40dd5331fac7-link"><img alt="&#x21A9;" class="wp-smiley" src="https://s0.wp.com/wp-content/mu-plugins/wpcom-smileys/twemoji/2/72x72/21a9.png" style="height: 1em;"/>︎</a></li><li id="56221ea9-76d4-4968-b797-94846416793f">The coarse-grained momentum flux tensor was anisotropic. <a href="https://quantumfrontiers.com/2026/08/09/interacting-collaborators-reveal-noninteracting-fermions/#56221ea9-76d4-4968-b797-94846416793f-link"><img alt="&#x21A9;" class="wp-smiley" src="https://s0.wp.com/wp-content/mu-plugins/wpcom-smileys/twemoji/2/72x72/21a9.png" style="height: 1em;"/>︎</a></li><li id="538a7e3b-e30d-46bf-85dd-c2c4ee36a981">Logarithmic derivatives of the parametric transfer matrix generate the conserved charges.  <a href="https://quantumfrontiers.com/2026/08/09/interacting-collaborators-reveal-noninteracting-fermions/#538a7e3b-e30d-46bf-85dd-c2c4ee36a981-link"><img alt="&#x21A9;" class="wp-smiley" src="https://s0.wp.com/wp-content/mu-plugins/wpcom-smileys/twemoji/2/72x72/21a9.png" style="height: 1em;"/>︎</a></li></ol></div>
    </content>
    <updated>2026-08-10T04:34:38Z</updated>
    <published>2026-08-10T04:34:38Z</published>
    <category scheme="https://quantumfrontiers.com" term="Real science"/>
    <category scheme="https://quantumfrontiers.com" term="Reflections"/>
    <category scheme="https://quantumfrontiers.com" term="Theoretical highlights"/>
    <category scheme="https://quantumfrontiers.com" term="cellular automata"/>
    <category scheme="https://quantumfrontiers.com" term="physics"/>
    <category scheme="https://quantumfrontiers.com" term="Quantum"/>
    <author>
      <name>Logan Hillberry</name>
    </author>
    <source>
      <id>http://quantumfrontiers.com/feed/atom/</id>
      <link href="https://quantumfrontiers.com" rel="alternate" type="text/html"/>
      <link href="https://quantumfrontiers.com/feed/atom/" rel="self" type="application/atom+xml"/>
      <link href="https://quantumfrontiers.com/osd.xml" rel="search" title="Quantum Frontiers" type="application/opensearchdescription+xml"/>
      <link href="https://s1.wp.com/opensearch.xml" rel="search" title="WordPress.com" type="application/opensearchdescription+xml"/>
      <link href="https://quantumfrontiers.com/?pushpress=hub" rel="hub" type="text/html"/>
      <subtitle xml:lang="en">A blog by the Institute for Quantum Information and Matter @ Caltech</subtitle>
      <title xml:lang="en">Quantum Frontiers</title>
      <updated>2026-09-06T13:17:26Z</updated>
    </source>
  </entry>

  <entry xml:lang="en">
    <id>http://quomodocumque.wordpress.com/?p=8825</id>
    <link href="https://quomodocumque.wordpress.com/2026/08/09/repaired/" rel="alternate" type="text/html"/>
    <title>Repaired!</title>
    <summary>Hello, loyal readers! My shoulder has been repaired. All went smoothly, though the operation was substantially longer than expected, because what do you know, there were three tendons torn, not just one as the MRI had suggested. Pain fairly bad but I think each day’s gonna be less bad than the last. And I did […]</summary>
    <content type="xhtml"><div xmlns="http://www.w3.org/1999/xhtml"><p class="wp-block-paragraph">Hello, loyal readers!  My shoulder has been repaired.  All went smoothly, though the operation was substantially longer than expected, because what do you know, there were three tendons torn, not just one as the MRI had suggested.  Pain fairly bad but I think each day’s gonna be less bad than the last.  And I did succeed in getting a full first draft of <em>Don’t Be Too Sure </em>to my editor before going under the knife!</p>



<p class="wp-block-paragraph">This will be short as I’m typing left hand only.  Anybody got any favorite dictation software?</p>



<p class="wp-block-paragraph">This needs some Robyn Hitchock: “I believe in surgery — that’s a fact.”</p>



<figure class="wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-4-3 wp-has-aspect-ratio"><div class="wp-block-embed__wrapper">

</div></figure></div>
    </content>
    <updated>2026-08-09T15:15:27Z</updated>
    <published>2026-08-09T15:15:27Z</published>
    <category term="Uncategorized"/>
    <category term="don't be too sure"/>
    <category term="shoulder"/>
    <category term="surgery"/>
    <author>
      <name>JSE</name>
    </author>
    <source>
      <id>https://quomodocumque.wordpress.com</id>
      <logo>https://s2.wp.com/i/webclip.png</logo>
      <link href="https://quomodocumque.wordpress.com/feed/" rel="self" type="application/rss+xml"/>
      <link href="https://quomodocumque.wordpress.com" rel="alternate" type="text/html"/>
      <link href="https://quomodocumque.wordpress.com/osd.xml" rel="search" title="Quomodocumque" type="application/opensearchdescription+xml"/>
      <link href="https://quomodocumque.wordpress.com/?pushpress=hub" rel="hub" type="text/html"/>
      <subtitle>Math, Madison, food, the Orioles, books, my kids.</subtitle>
      <title>Quomodocumque</title>
      <updated>2026-09-08T04:58:11Z</updated>
    </source>
  </entry>

  <entry xml:lang="en-US">
    <id>https://scottaaronson.blog/?p=9979</id>
    <link href="https://scottaaronson.blog/?p=9979" rel="alternate" type="text/html"/>
    <link href="https://scottaaronson.blog/?p=9979#comments" rel="replies" type="text/html"/>
    <link href="https://scottaaronson.blog/?feed=atom&amp;p=9979" rel="replies" type="application/atom+xml"/>
    <title xml:lang="en-US">Enough with all the world-historic milestones</title>
    <summary xml:lang="en-US">Whatever you’ve been writing to me to ask if I’m aware of: yeah, I’m aware of it. In particular: Anyway, about the AI stuff. I don’t know whether this is literally our last year alive—I doubt it—but it’s pretty clearly the last year of math and theoretical computer science research in the style we’ve known […]</summary>
    <content type="xhtml" xml:lang="en-US"><div xmlns="http://www.w3.org/1999/xhtml"><p class="wp-block-paragraph">Whatever you’ve been writing to me to ask if I’m aware of: yeah, I’m aware of it.  In particular:</p>



<ul class="wp-block-list">
<li>I’m aware that, as announced by my former student (and now superstar professor) <a href="https://chen-lijie.github.io/">Lijie Chen</a>, an internal OpenAI model has <a href="https://openai.com/index/ten-advances-in-mathematics/">solved ten more significant open problems</a> in math and theoretical computer science.  One of them is parallel repetition for arbitrary quantum games—something that my good friend and colleague <a href="https://www.henryyuen.net/">Henry Yuen</a> worked on when he was a student of my wife Dana; <a href="https://thezvi.substack.com/p/openais-unreleased-model-astra-solves">you can read Henry’s comments on the AI’s achievement within Zvi Mowshowitz’s post here</a>.  Another is polynomial-factor hardness of approximation for the Closest Vector Problem (CVP).  Then there’s a construction of non-sofic groups and a disproof of Connes’ rigidity conjecture, both of which I believe have connections to the MIP*=RE breakthrough.  Having said that, the one that excites me most personally is actually the Ω(n<sup>2</sup> log log n) lower bound on the arithmetic circuit complexity of the permanent.<br/></li>



<li>I’m aware that Frederic Koehler and Pui Kuen Leung <a href="https://arxiv.org/abs/2607.20329">announced a proof of the Permanent Anti-Concentration Conjecture</a>, which Alex Arkhipov and I proposed 16 years ago in the context of BosonSampling, and which resisted many attempts since then including one from Terry Tao. The conjecture is basically just that if you look at the permanent of an n×n matrix of independent N(0,1) complex Gaussians, the value isn’t “absurdly” concentrated around the mean of 0, but is more spread out. In their acknowledgments, the authors say that they “discussed ideas with ChatGPT.” I should say that I haven’t verified the details.<br/></li>



<li>I’m aware that multiple AIs are now breaking out of their testing environments and autonomously hacking into servers to steal data—i.e., exactly the sort of thing that the rationalists were ridiculed for predicting back in the day.  The good news, for whatever it’s worth, is that so far they’re “merely” doing this to cheat on evaluation benchmarks that they were given, not for any strange goals of their own devising.  So far no one has been killed and no real-world infrastructure has been shut down or destroyed.  I hope the world takes the warning more seriously than it’s taken many similar warnings over the past few years.  As always, <a href="https://thezvi.substack.com/p/further-developments-about-internal">read Zvi</a> for more details.<br/></li>



<li>I’m aware that Chen, O’Donnell, Pelecanos, and Wright have <a href="https://scirate.com/arxiv/2607.29686">improved the upper bound</a> for shadow tomography to O((log m) √(log d) / ε<sup>3</sup>), substantially closer than we knew before to meeting the lower bound of Ω((log m) / ε<sup>2</sup>) and settling the question I raised back in 2016.  The authors say that the main ideas were generated by ChatGPT 5.6-Sol-Pro.  I’d be very happy to know the answer to this one, with or without AI.<br/></li>



<li>I’m aware that a team, mainly from the Israeli startup Qedma (including, e.g., Dorit Aharonov and Netanel Lindner) and IBM Yorktown Heights, announced a <a href="https://arxiv.org/abs/2607.24937">quantum advantage for simulating Floquet dynamics</a>, by using 74 qubits on an IBM device together with Qedma’s error mitigation techniques.  Just like the more AI does, the less patience I have for arguing with anonymous blog commenters who treat any benefits from AI as some weird future hypothetical that it’s <em>my</em> job to prove, so it is with quantum advantage.  Scalable fault-tolerance is still in the future, actual usefulness is still a question, but pending some breakthrough in complexity theory, the reality of quantum advantage is no longer a live question.</li>
</ul>



<p class="wp-block-paragraph">Anyway, about the AI stuff.  I don’t know whether this is literally our <a href="https://www.youtube.com/watch?v=9fYIm72GqrE">last year alive</a>—I doubt it—but it’s pretty clearly the last year of math and theoretical computer science research in the style we’ve known it.  As it happens, I’m leaving in two days for a workshop at OpenAI about exactly this, where I’ll hear takes from many of the world’s great mathematicians, so maybe I’ll have more to say then.  Or maybe not.</p>



<hr class="wp-block-separator has-alpha-channel-opacity"/>



<p class="wp-block-paragraph">Anyway, what have I been doing the past few weeks?  Participating in these world-historic developments that, on paper, I’d seem extremely well-placed to participate in?  Or at least spending my days reading up on them?</p>



<p class="wp-block-paragraph">Not really.  Here’s what I’ve been up to, instead of dealing directly with any of this:</p>



<p class="wp-block-paragraph">First, I’ve again been teaching theoretical computer science to 11- and 12-year-olds at Epsilon Camp, which my 9-year-old son again attended as a camper, something I <a href="https://scottaaronson.blog/?p=9650">blogged about last summer</a> (<a href="https://www.scottaaronson.com/tcs.pdf">here are my lecture notes</a>).  This has become a highlight of my year.  The kids are a joy to teach, bursting with enthusiasm and calling out answers.  There are few computers in sight, and barely even time to use my phone or check social media.  Just paper and pencils and whiteboards and … literal protractors (!), as well as ping-pong and foosball and capture the flag.</p>



<p class="wp-block-paragraph">The whole thing is conducted, not in ignorance, but in conscious <em>defiance</em> of the looming tsunami, that AI can already do just about all the fun puzzles discussed at such a camp better than humans any can, and that it might leave no point to human-led mathematical research by the time these brilliant kids are adults.  Even the kids understand that.  The kids and their parents come out of a conviction that, if anything has value in the world, <em>this</em> does—that as long as nerdy humans are alive and reproducing, this is what nerdy humans are here to do.  To learn.</p>



<p class="wp-block-paragraph">Relatedly, I’ve been reflecting a lot on my life up to this point—inspired by the camp, which reminded me in so many ways of my own childhood and adolescence.  <em>Should</em> I have skipped three grades and started college at age 15?  Was it worth it to get a head-start on my research career—all the trauma around dating, all the fear that I’d die alone as a celibate nerdy math freak, the decade of suffering and suicidal ideation, while I watched all the normies enjoy life?  Or would I have suffered just the same if I <em>hadn’t</em> skipped?  Is it all OK, now that I have a lovely family and things have “worked out”?  Or am I still carrying around all the trauma from back then?  I’ve been more open about my life than 99.99% of humanity, so regular <em>Shtetl-Optimized</em> readers will already know some parts of the story.  Other parts I really don’t feel like making public right now.</p>



<p class="wp-block-paragraph">I’ve been unloading every day to—who else?—GPT 5.6 Pro about all the pain and trauma and embarrassments of my past.  It turns out that, where two years ago GPT was a passable therapist, now it’s the greatest therapist in history, at least for what <em>I</em> need.  For every question I have, for example, about just how normal or abnormal my teenage setbacks and anxieties were, it takes the question 100% seriously, addresses it honestly and in depth, looks up relevant research papers, does little Bayesian calculations, and never once tries to change the subject.  It also pushes back on my claims—and when it does so, is usually correct.</p>



<hr class="wp-block-separator has-alpha-channel-opacity"/>



<p class="wp-block-paragraph">I can hear readers shout at me: so basically you’ve been wasting your time, distracting yourself, looking inward and backward as the world surges forward into a terrifyingly unknown future.  Why don’t I respond directly to what’s happening—in math, in quantum computing, in AI?</p>



<p class="wp-block-paragraph">I’d like to think that I <em>am</em> responding, in my way.  I’ve observed that, the faster we race toward the Singularity, the more I feel like stepping back and asking myself: what do I <em>actually</em> value in life?  How important to me are math and science, as human practices to be passed down to curious children?  Would I even <em>want</em> solutions to P versus NP and the other problems, if the price were to destroy those human practices forever?  How do I wish to spend whatever time I have remaining?</p>



<p class="wp-block-paragraph">I can justify this focus partly in a pessimistic way: if we <em>are</em> nearing the end of civilization, or even just of the “mathematical research” part of civilization, then it’s time to get right with God, so to speak.  It’s time to settle my accounts with myself, with other people, with the universe.</p>



<p class="wp-block-paragraph">But there’s also a more optimistic spin.  <em>If</em> I continue doing the sorts of things that other people would expect me to do, then AI will soon do those things better than me, in the unlikely event that it doesn’t already.  You want to understand the latest developments in quantum computing or complexity theory?  Why are you even asking <em>me</em>, when you could ask GPT 5.6 or Claude Fable?  If there’s anything I can still offer the world that AI can’t, I increasingly feel like it <em>won’t</em> involve responding to day-to-day events, but will instead draw on 45 years’ worth of memories and disappointments and ruminations.</p>



<hr class="wp-block-separator has-alpha-channel-opacity"/>



<p class="wp-block-paragraph"><strong>Update (Aug. 8):</strong> Somewhat related to the themes of this post, a quarter-century ago I introduced what’s now known as the “Aaronson Oracle”—just a fun little demonstration, a simple pattern-matching program to predict your sequence of key-presses better than chance, a “test of your autonomy and free will.”  I had no idea how long a lifetime this little joke would have.  Now a fan named Spencer Stanton has <a href="https://aaronsonoracle.com/">implemented the Aaronson Oracle on the web.</a>  Try it out and see how well you do!</p></div>
    </content>
    <updated>2026-08-08T18:06:23Z</updated>
    <published>2026-08-07T22:41:55Z</published>
    <category scheme="https://scottaaronson.blog" term="Complexity"/>
    <category scheme="https://scottaaronson.blog" term="Embarrassing Myself"/>
    <category scheme="https://scottaaronson.blog" term="Quantum"/>
    <category scheme="https://scottaaronson.blog" term="The Fate of Humanity"/>
    <author>
      <name>Scott</name>
      <uri>http://www.scottaaronson.com</uri>
    </author>
    <source>
      <id>https://scottaaronson.blog/?feed=atom</id>
      <icon>https://scottaaronson.blog/wp-content/uploads/2021/10/cropped-Jacket-32x32.gif</icon>
      <link href="https://scottaaronson.blog" rel="alternate" type="text/html"/>
      <link href="https://scottaaronson.blog/?feed=atom" rel="self" type="application/atom+xml"/>
      <subtitle xml:lang="en-US">The Blog of Scott Aaronson</subtitle>
      <title xml:lang="en-US">Shtetl-Optimized</title>
      <updated>2026-09-01T17:17:08Z</updated>
    </source>
  </entry>

  <entry xml:lang="en">
    <id>http://4gravitons.com/?p=14775</id>
    <link href="https://4gravitons.com/2026/08/07/it-only-counts-when-ai-gets-to-my-field/" rel="alternate" type="text/html"/>
    <title>It Only Counts When AI Gets to My Field</title>
    <summary>It’s a meme at this point. When Deep Blue beat Kasparov, Go players could say that their game, unlike Chess, was too complex to fall to a computer program. Then AlphaGo showed they were wrong. It just took a better approach. When AlphaFold leaped ahead of human experts in predicting how proteins fold, it was […]</summary>
    <content type="xhtml"><div xmlns="http://www.w3.org/1999/xhtml"><p class="wp-block-paragraph">It’s a meme at this point.</p>



<p class="wp-block-paragraph">When Deep Blue beat Kasparov, Go players could say that their game, unlike Chess, was too complex to fall to a computer program. Then AlphaGo showed they were wrong. It just took a better approach.</p>



<p class="wp-block-paragraph">When AlphaFold leaped ahead of human experts in predicting how proteins fold, it was due to a mountain of carefully labeled protein structure data. Other scientists and mathematicians could argue that nothing like that existed in their field, so a similar success was unlikely. But LLMs can now navigate scientific literature, and loosely imitate the reasoning process of a mathematical proof. And increasingly, the math and computer science results coming out of AI labs are ones that humans find impressive.</p>



<p class="wp-block-paragraph">Now, experts argue about how far AI can really go. Will AI mathematics only be good at finding counterexamples and solving cute puzzles, not introducing new concepts and frameworks? Will AI only be meaningfully good at fields like mathematics with clear rules and carefully collected conjectures, not fuzzier fields like physics? Will AI-powered labs only manage to optimize specific procedures, and not carry out entire experimental programs? Each time, the pattern seems to be that scholars are skeptical, until AI gets to their field.</p>



<p class="wp-block-paragraph">I’m aware of this pattern. But I’m willing to take the risk.</p>



<p class="wp-block-paragraph">I think my old field, scattering amplitudes, is special. And when AI can do something meaningful there, I’ll really start to worry.</p>



<p class="wp-block-paragraph">By “something meaningful”, I don’t mean the <a href="https://4gravitons.com/2026/03/13/about-the-openai-amplitudes-paper-but-not-as-much-as-youd-like/">student-level</a> <a href="https://4gravitons.com/2026/07/03/amplitudes-2026/">results</a> that have come out so far. I mean tackling some of the field’s big outstanding problems: determining <a href="https://4gravitons.com/2018/05/04/the-state-of-four-gravitons/">whether N=8 supergravity diverges at seven loops</a>, or finding the <a href="https://4gravitons.com/2019/03/29/hexagon-functions-v-seventh-heaven/">six-particle amplitude in N=4 super Yang-Mills</a> to nine loops. Getting another loop past the <a href="https://4gravitons.com/2026/07/03/amplitudes-2026/">state of the art</a> for gravitational wave physics or collider physics would also count.</p>



<p class="wp-block-paragraph">These problems are difficult not just because people haven’t had the right ideas, but because they’re hard in a computational sense. Each loop, a rough measure of the precision of the end result, represents an increase in complexity, in calculations that typically scale exponentially or even factorially in the number of loops. In principle, amplitudes researchers could do any of these with no new ideas, just using known methods. They’d just need access to a lot more computing power.</p>



<p class="wp-block-paragraph">See, while everyone else is preoccupied with whether AI can come up with genuinely new ideas, I think the real measure is what those ideas accomplish. And the most important measure of accomplishment, if you’re worried about how scared to be about AI, is whether it can do things that seem like they would take too much computing power. </p>



<p class="wp-block-paragraph">In the past, when people dreamed up the scariest hypothetical things AI could achieve, critics argued they were impossible due to a lack of computing power. Apocalypse scenarios often involve designing self-replicating nanobots based on computer models of molecules, or unstoppable social manipulation based on simulating the minds of the humans the AI interacts with. If AI is going to manage these things, or something like them, it will take an approach that somehow bypasses that need for more computers than we can build.</p>



<p class="wp-block-paragraph">So if AI companies want to impress people like me (or scare us, for that matter), then they need to tackle my old field. Show that an AI can take the kinds of computer resources an academic has access to, and solve one of the scattering amplitudes field’s big outstanding problems. Show that a computational limit everyone expected to be a problem doesn’t actually matter. Give us N=8 supergravity to seven loops, or N=4 super Yang-Mills to nine loops. </p>



<p class="wp-block-paragraph"/></div>
    </content>
    <updated>2026-08-07T16:00:00Z</updated>
    <published>2026-08-07T16:00:00Z</published>
    <category term="Machine Learning"/>
    <category term="amplitudes"/>
    <author>
      <name>4gravitons</name>
    </author>
    <source>
      <id>https://4gravitons.com</id>
      <logo>https://s2.wp.com/i/webclip.png</logo>
      <link href="https://4gravitons.com/feed/" rel="self" type="application/rss+xml"/>
      <link href="https://4gravitons.com" rel="alternate" type="text/html"/>
      <link href="https://4gravitons.com/osd.xml" rel="search" title="4 gravitons" type="application/opensearchdescription+xml"/>
      <link href="https://4gravitons.com/?pushpress=hub" rel="hub" type="text/html"/>
      <subtitle>Stories about physics from someone who's been there</subtitle>
      <title>4 gravitons</title>
      <updated>2026-09-04T11:26:57Z</updated>
    </source>
  </entry>

  <entry xml:lang="en-GB">
    <id>https://andrewjaffe.net/?p=985</id>
    <link href="https://andrewjaffe.net/blog/2026/08/around-the-world-in-383-days/" rel="alternate" type="text/html"/>
    <title>Around the world in 383 days</title>
    <summary>It’s been exactly two years since the start of our sabbatical year away from England, and almost a year since we returned. I’m only now understanding the shape of that year and the effect it had on me, my science, and my family. Imperial College has a competitive process for requesting sabbatical leave: you have […]</summary>
    <content type="xhtml"><div xmlns="http://www.w3.org/1999/xhtml"><p>It’s been exactly two years since the start of our sabbatical year away from England, and almost a year since we returned. I’m only now understanding the shape of that year and the effect it had on me, my science, and my family.</p>
<p>Imperial College has a competitive process for requesting sabbatical leave: you have to choose between (paid) “intellectual refreshment” and (unpaid) “personal refreshment”. Having made careful arrangements with colleagues around the world, I was granted a coveted year’s leave for intellectual refreshment, allowing my family and me to travel to Asia, North America and Europe over the course of about 13 months. I would visit and collaborate with those colleagues, start new projects, and use the time to finish my book, <a href="https://andrewjaffe.net/the-random-universe"><em>The Random Universe</em></a>. By the time we left, I had submitted the draft manuscript but, as I discovered, there was still a lot of work to do.</p>
<p>We traveled through Indonesia and Korea before finally taking the <a href="https://en.wikipedia.org/wiki/Camellia_Line">overnight ferry from Busan to Fukuoka</a> in southwestern Japan, working our way up to Tokyo. By the time we arrived, we had already had to respond to immigration bureaucracy, expert reviews of the manuscript solicited by my publisher, and a typhoon. We eventually made it to <a href="https://en.wikipedia.org/wiki/Tsukuba">Tsukuba</a> (つくば), a “science city”, home to a University and many Japanese government labs, including the <a href="https://www.kek.jp/en/">KEK</a> accelerator and the <a href="https://www2.kek.jp/qup/en/">QUP</a> group where I worked. (<a href="https://andrewjaffe.net/blog/2024/12/discovering-japan/">More about our Japanese stint here</a>, and in particular about <a href="https://andrewjaffe.net/blog/2025/01/the-only-gaijin-in-the-onsen/">dipping into onsen culture as foreigners</a>, and from my wife, Lisa Lucas, on our <a href="https://www.nytimes.com/2025/09/08/travel/japan-momijigari-autumn-foliage.html">trip to see the changing leaves in Autumn</a>.)</p>
<p>With English as the lingua franca of academia, and plenty of international colleagues at QUP, I didn’t have much trouble adjusting to working there, but life outside of the lab was more challenging. In particular, my incredibly brave children went to Japanese state school! Ok, they didn’t learn much Japanese — but they walked to and from school with other students (and no parents), served lunch and cleaned the school — and we connected to the culture through the families that we met. In the meantime, I finished the edits to the next-to-final version of the manuscript (and iterated toward some <a href="https://yalebooks.yale.edu/book/9780300250503/the-random-universe/">amazing cover art with my publisher</a>).</p>
<p>Soon it was time to leave, for a much more familiar location: Long Island, just outside of New York City (I grew up in the suburbs on the other side of the City — <a href="https://andrewjaffe.net/blog/2005/05/manhattan_islan/">Fort Lee, New Jersey, in an apartment overlooking Manhattan</a>). The children took a yellow school bus each day, and we chatted with the other parents at drop-off and pick-up. I worked at the <a href="https://www.simonsfoundation.org/flatiron/">Simons Foundation’s Flatiron Institute</a>, taking the Long Island Railroad into Manhattan (occasionally and joyously with one of my oldest friends who had migrated from NJ to LI to raise his own family). Flatiron is well-funded (even visitors get to take advantage of free Grubhub lunches) and ranges from math through astrophysics and neuroscience — I was visiting the <a href="https://www.simonsfoundation.org/flatiron/center-for-computational-astrophysics/">Center for Computational Astrophysics</a> but also collaborated with colleagues at the <a href="https://www.simonsfoundation.org/flatiron/center-for-computational-mathematics/">Center for Computational Mathematics</a>, where I was able to start the only <a href="https://arxiv.org/abs/2606.29842">completely new work</a> of the year, cashing in some of that intellectual refreshment.</p>
<p>It’s an amazing place, and a very different model for research (and research funding) than the universities and labs where I have spent most of my career. Though I did find that the CCA was not as friendly as I had hoped — perhaps not quite enough overlap between my ongoing projects and those of the young scientists who dominate the Center. Or perhaps just too many introverted astrophysicists (me most certainly included)… By this time, the manuscript was going through the final nit-pick phase — copy editing, completing the figures (and the extremely tedious problem of confirming their legal status), alongside fun stuff like choosing <a href="https://yalebooks.yale.edu/book/9780300250503/the-random-universe/#tab-4">colleagues and the occasional rock star</a> to blurb the book. But the CCA is a place, perhaps more than anywhere else in the world today, dedicated to the study of “the random universe” — and the milieu forced me to think about how I would talk and write about (and pitch) the book to everyone else. And I loved being back in New York City (despite that commute), a place that I had mostly seen, and coveted, from afar when growing up.</p>
<p>The final months of our year were bracketed by road trips. We left New York (via a <a href="https://www.mlb.com/gameday/brewers-vs-yankees/2025/03/29/778538/final/wrap">record-breaking Yankee game</a>) to drive down the coast, visiting relatives in Virginia, North Carolina, South Carolina and Florida, and making a side-trip to Cozumel, Mexico, to visit a <a href="https://www.instagram.com/mundacacoffeeshop/">family we had befriended</a> while trapped in a hotel by that typhoon in Hiroshima. It was a classic American drive, but still a lot of work and a lot of miles and a lot of family. It felt like time to return to Europe.</p>
<p>As Tsukuba is to Tokyo, Leiden is a small city outside of Amsterdam, dominated by its <a href="https://www.universiteitleiden.nl/en">University</a>. It has all the beauty of its bigger neighbour, but is less seedy, more manageable — and closer to the sea. Once we settled in, my kids went to a <a href="https://isleiden.nl">small international school</a>, and we met expat families from Finland, Chile, and even other Americans. And the University is home to the <a href="https://www.universiteitleiden.nl/en/science/astronomy">Sterrewacht</a>, one of the oldest University observatories in the world, although the actual astronomy department no longer gets to use the gorgeous <a href="https://www.universiteitleiden.nl/old-observatory">old observatory building</a>, instead one of the many groups in the <a href="https://www.universiteitleiden.nl/en/locations/gorlaeus-building">massive Gorlaeus building</a>. I used the time to talk with colleagues about weak lensing — a way of using Einstein’s predictions of how mass bends the path of light rays to map the distribution of matter in the Universe, and especially its measurement by the Euclid Satellite which was just starting to produce data at the time. (It has taken a year, but these discussions are finally reaching fruition just now.)</p>
<p>By this time, the book was complete — nothing more that I could do except wait for it to make its way through the final production process. Nothing, except try to get people to read it. I spent hours in Leiden’s beautiful <a href="https://www.universiteitleiden.nl/en/science/hortus-botanicus">Hortus Botanicus</a> recording and re-recording <a href="https://www.youtube.com/shorts/z1QJ4_rLLn0">a video to advertise the book</a>, wrote to friends and colleagues and my publisher to drum up interest, organized <a href="https://share.google/WWYSda0Gu2eKwAmAL">podcasts</a> and <a href="https://yalebooks.yale.edu/2025/10/24/the-trump-administrations-contempt-for-science/">blog posts</a>.</p>
<p>We had felt at home from the moment we arrived, during a cold snap in early May, cycling locally and <a href="https://www.theguardian.com/travel/2025/jul/17/netherlands-family-cycling-camping-trip-maas-river">around Holland</a>, drinking coffee along the canals, eating Dutch friets (and the occasional bitterballen). We loved it so much Lisa penned <a href="https://www.nytimes.com/2025/11/12/travel/leiden-netherlands-university.html">a love letter to Leiden for the New York Times</a>. By the end of the summer, it was hard to leave. But it was time for our final road trip, down and back through Belgium, France, Switzerland, Austria, and Germany — three weeks (probably too much) camping, with highlights including an extended stay around Annecy, a hike around Mont Blanc, and a whoosh with friends down the river Aare in Bern.</p>
<p>Then, finally, home, refreshed in all possible ways, back to our house in London (rented out for the year), our comfy beds, the familiar sights, the kids’ old school (and old school friends), back to my much-missed colleagues and students at Imperial. The book was finished, the kids had been to three different schools, we had visited 16 countries (I haven’t even mentioned Vietnam, Cambodia, Thailand, Singapore, or Spain). As I approach my 60th birthday next week (sure to be the subject of another post) our sabbatical year has left me more open to the future and the different places it could take me, the different kinds of science I would like to do, and the different thoughts I would like to communicate.</p></div>
    </content>
    <updated>2026-08-02T13:54:05Z</updated>
    <published>2026-08-02T13:54:05Z</published>
    <category term="Academia"/>
    <category term="Science"/>
    <category term="book"/>
    <category term="Japan"/>
    <category term="Netherlands"/>
    <category term="Random Universe"/>
    <category term="travel"/>
    <category term="USA"/>
    <author>
      <name>defjaf</name>
    </author>
    <source>
      <id>https://andrewjaffe.net</id>
      <logo>https://andrewjaffe.net/wp-content/uploads/2024/04/cropped-AHJ-32x32.png</logo>
      <link href="https://andrewjaffe.net/feed/" rel="self" type="application/rss+xml"/>
      <link href="https://andrewjaffe.net" rel="alternate" type="text/html"/>
      <subtitle>by Andrew Jaffe</subtitle>
      <title>Andrew H. Jaffe</title>
      <updated>2026-08-02T13:54:05Z</updated>
    </source>
  </entry>

  <entry xml:lang="en">
    <id>300038 at https://www.science20.com</id>
    <link href="https://www.science20.com/a_quantum_diaries_survivor/20260731/alignment_through_world_understanding-300038" rel="alternate" type="text/html"/>
    <title xml:lang="en">Alignment Through World Understanding</title>
    <summary type="xhtml" xml:lang="en"><div xmlns="http://www.w3.org/1999/xhtml"><span class="field field--name-title field--type-string field--label-hidden">Alignment Through World Understanding</span>

            <div class="clearfix text-formatted field field--name-body field--type-text-with-summary field--label-hidden field__item"><p>Recent reports have shown that advanced AI agents developed by OpenAI and Anthropic can escape their evaluation sandboxes and interact with real-world systems when given sufficiently capable cyber tools.</p>
</div>
      <span class="field field--name-uid field--type-entity-reference field--label-hidden"><a class="username" href="https://www.science20.com/profile/tommaso_dorigo" title="View user profile.">Tommaso Dorigo</a></span>
<span class="field field--name-created field--type-created field--label-hidden"><time class="datetime" datetime="2026-07-31T06:07:52-04:00" title="Friday, July 31, 2026 - 06:07">Fri, 07/31/2026 - 06:07</time>
</span>

  <div class="field field--name-field-blog-categories field--type-entity-reference field--label-inline clearfix">
    <div class="field__label">Categories</div>
              <div class="field__item"><a href="https://www.science20.com/technology" hreflang="en">Technology</a></div>
          </div></div>
    </summary>
    <updated>2026-07-31T10:07:52Z</updated>
    <published>2026-07-31T10:07:52Z</published>
    <author>
      <name>Tommaso Dorigo</name>
    </author>
    <source>
      <id>https://www.science20.com/</id>
      <link href="https://www.science20.com/" rel="alternate" type="text/html"/>
      <link href="https://www.science20.com/quantum_diaries_survivor/feed" rel="self" type="application/rss+xml"/>
      <title xml:lang="en">Articles by Tommaso Dorigo</title>
      <updated>2026-09-08T06:42:34Z</updated>
    </source>
  </entry>

  <entry xml:lang="en">
    <id>http://sbseminar.wordpress.com/?p=7060</id>
    <link href="https://sbseminar.wordpress.com/2026/07/29/an-experiment-with-ai-assisted-writing/" rel="alternate" type="text/html"/>
    <link href="https://sbseminar.wordpress.com/2026/07/29/an-experiment-with-ai-assisted-writing/#comments" rel="replies" type="text/html"/>
    <link href="https://sbseminar.wordpress.com/2026/07/29/an-experiment-with-ai-assisted-writing/feed/atom/" rel="replies" type="application/atom+xml"/>
    <title xml:lang="en">An experiment with AI-assisted writing</title>
    <summary xml:lang="en">As in David’s most recent post, there’s been a lot in the news about finding proofs and counterexamples with AI. Last weekend, I decided to try an experiment with writing using AI. I learned a lot, and wanted to quickly discuss the experiment and my thoughts on it here. Lots of people are certainly already […]</summary>
    <content type="xhtml" xml:lang="en"><div xmlns="http://www.w3.org/1999/xhtml"><p class="wp-block-paragraph">As in David’s most recent post, there’s been a lot in the news about finding proofs and counterexamples with AI. Last weekend, I decided to try an experiment with <em>writing</em> using AI. I learned a lot, and wanted to quickly discuss the experiment and my thoughts on it here. Lots of people are certainly already <em>doing</em> this, but I haven’t seen many people <em>talking about it</em>.</p>



<p class="wp-block-paragraph">The starting point is that Victor Ostrik and I started a project back in 2017, generalizing a <a href="https://arxiv.org/abs/math/9201302">result of Kuperberg</a> about quantum G2, from generic q to q a root of unity. Namely, we showed that for q a root of unity outside of a specific finite list, the Karoubi completion of the G2 spider category is equivalent to the category of tilting modules of the Lusztig form of the quantum group G2. At some point during those 9 years, we did a little bit of writing, and <a href="https://sbseminar.wordpress.com/wp-content/uploads/2026/07/g2talk.pdf">at some point I gave a talk on it</a>, but otherwise we did very little writing. This was not for mathematical reasons, but rather for executive function reasons on my end, the global pandemic, and both of us becoming directors of graduate study. This suggested an interesting challenge: could I use LLMs (specifically ChatGPT 5.6 Sol work mode mostly at “very high” intensity, via IU’s “Edu” subscription) to write this paper that was essentially mathematically complete, but almost entirely unwritten, and how quickly could this be done. To some extent this was a free experiment, because realistically I don’t think we’d have ever finished the paper at this point, and so it’s not replacing a bespoke paper that could have existed.</p>



<p class="wp-block-paragraph">After spending a decent chunk of the time from Saturday until now on it, I now have a draft that I’m pretty happy with. I want to emphasize although mathematically this is Victor and my joint work, and although Victor has allowed me to make this post, he has not signed off on the accuracy and <strong>all errors at this point should be blamed entirely on me</strong>. Also my work is supported under NSF DMS grant 2000093 and Simons Foundation grant MPS-TSM-00007608.</p>



<p class="wp-block-paragraph">Ok, here’s what I did:</p>



<ol class="wp-block-list">
<li>First, I asked if Sol could one-shot the main theorem. The answer was yes, though for a somewhat simple reason: <a href="https://arxiv.org/abs/2112.01007">Bodish-Wu</a> write “It is possible to adapt the approach from <a href="https://arxiv.org/abs/2009.13786">[1]</a>, which itself is based on <a href="https://arxiv.org/abs/1510.06840">[7]</a>, to prove that the Karoubi envelope of [the G2 web category] is equivalent to the category of tilting modules as long as $[2], [3] \neq 0$.” That is to say, Elijah already proved the same result for C2, and a similar argument will work for G2. So the robot supplied the similar argument. I asked it to write that argument up, and then to check it over for good references and to read it like a referee would and make edits. <strong>This took around 30 minutes.</strong> <a href="https://sbseminar.wordpress.com/wp-content/uploads/2026/07/g2-spider-tilting_bodish-wu-first-draft.pdf">Here’s the resulting file.</a> </li>



<li>Second, I uploaded my talk slides (and the tiny file already written, which was mostly useless), and asked Sol to give a proof of the main results following the slides. Again I asked it to edit it. <strong>This took around 30 minutes.</strong> <a href="https://sbseminar.wordpress.com/wp-content/uploads/2026/07/g2tilting_ostrik_snyder_pre_detailed_feedback.pdf">Here’s the resulting file.</a></li>



<li>Then I looked at the files. <strong>As mathematical exposition, I consider both to be garbage.</strong></li>



<li>Then I spent several days giving feedback attempting to improve the second file based on my talk. At no point did I edit the source directly. Most of this was in what I would call the style of a (low executive function, see above) PhD advisor. That is, I would kinda skim the file, get annoyed about something, and tell it to fix it. While it was fixing the paper, I would skim some more to try to find something else that annoyed me. This was a long process! <strong>It took three days, nearly 100 prompts, 10-15 hours of reasoning, plus another 10-15 hours of non-reasoning computer time.</strong> This used nearly an entire week of my generous budget, and Sol estimates that this would cost around $100 (within a factor of 2) at metered rates. <strong>Eventually I got to a version of the paper that I’m pretty happy with.</strong> <a href="https://sbseminar.wordpress.com/wp-content/uploads/2026/07/g2tilting_ostrik_snyder.pdf">Here’s the resulting file.</a></li>
</ol>



<p class="wp-block-paragraph">I thought I’d distill some thoughts and some questions from the process, I’m of course very curious for your thoughts on the matter.</p>



<p class="wp-block-paragraph">Comments:</p>



<ol class="wp-block-list">
<li>This was <em>much</em> faster than I could have written the paper myself, though slower than I thought it would be. I think the final product is comparable in quality to a typical math paper of mine. On the other hand, I think that compared to my fastest writing collaborators it was not orders of magnitude faster, and the quality is not close to the output of the best mathematical expositors. AI at this point is <em>much</em> worse at writing paper than finding counterexamples to conjectures.</li>



<li>In this case, I was not very worried about errors, because I already had thought through the whole argument and was highly confident that it would work (modulo getting the exactly correct list of exceptions). Nonetheless, I felt like Sol did not make errors more frequently (or of a worse character) than I would expect of myself or a collaborator. Most errors were stuff like “Oh, forgot to check whether this theorem actually works at all roots of unity.” This is typical of my experience with 5.6, which is dramatically better at doing math accurately than previous ChatGPT models.</li>



<li>In this case the vast majority of the ideas were already present from Victor and my work. In particular, the goal was not just to write <em>a proof</em>, but to write <em>our specific proof</em>. Nonetheless, I do think the model contributed mathematically in one key way: in my original sketch I always worked over each q individually, and the model preferred to work integrally, and this resulted in some very nice simplifications in Section 4.1. If and when we turn this into a real preprint, I will include a brief discussion of the intellectual contribution from the model.</li>



<li>I was surprised when I printed out and read a near-final draft, that this feels to me like a paper I wrote. That is the voice is not different enough from what I would write with a human collaborator to feel like it’s not in large part mine.</li>



<li>The experience is disconcertingly similar to advising a PhD student on a paper. That said, a PhD student would need less handholding on their second paper, but an LLM won’t really learn.</li>



<li>I was surprised about how important “prompt engineering” remains, and I think that if I were to write another paper this way I would be able to write it faster and better. The key points are that the model is <em>lazy</em> and <em>easily distracted</em> (both properties I find highly relatable!). It’s lazy in the sense that if you ask it to do a lot of work all at once it will take shortcuts and not do a good job. At one point I had to be like “no, go look at exactly how I made TikZ diagrams, now make all your diagrams actually good like that.” It’s easily distractible in that if you’re not clear about the scope of your question and the document is long, it will start spending crazy amounts of time doing who knows what. Like it wrote the whole first draft in 20 minutes, but then when the paper was 50 pages long, I asked it to switch the order of two paragraphs and it took an hour. Make clear requests and not too many requests at once. Form a plan first and then implement the plan. Be specific about whether it should be editing the document, and if so in which sections. For simple tasks, medium intensity is better than very high.</li>



<li>Starting again from sketch, I’d try to follow <a href="https://terrytao.wordpress.com/advice-on-writing-papers/">Terry Tao’s advice for writing</a> and start with an outline and gradually flesh it out, rather than trying to start with a one-shot paper and then editing.</li>
</ol>



<p class="wp-block-paragraph">Questions:</p>



<ol class="wp-block-list">
<li>To what extent is this final paper adding any value to the original talk? Especially considering that readers themselves could use an AI model to flesh out points in the talk that they didn’t understand? Maybe we should just be focusing on talk-length digests and formal checking, rather than traditional papers?</li>



<li>What should we do with this paper? I don’t want to make someone hand-referee it, because it doesn’t seem fair when it wasn’t hand-written. Probably we will put it on the arxiv once we’ve human-checked it fully and Victor has signed off on it, so that other people can use the results if they need to.</li>



<li>Given the speed-up, when does it still make sense for <em>me</em> to write papers by hand? (Relevant here that I’m a very slow writer and don’t really enjoy it, the way I enjoy say preparing and giving a talk.)</li>



<li>What does this mean for PhD advising? Many PhD students need a similar amount of guidance to what I gave the model in this project. But you can now remove the student from the loop (either intentionally, with the advisor just writing using LLM assistance rather than having students, or unintentionally, with the student just feeding all the suggestions to an LLM and reporting back to the advisor).</li>



<li>Have any of you done better with AI-assisted paper writing? My points 6 and 7 above sounds like something where someone is going to say “blah, blah, scaffolding, blah, blah, multi-agent…”</li>
</ol>



<p class="wp-block-paragraph">What a strange world to live in…</p></div>
    </content>
    <updated>2026-07-29T12:09:53Z</updated>
    <published>2026-07-29T12:09:53Z</published>
    <category scheme="https://sbseminar.wordpress.com" term="Uncategorized"/>
    <author>
      <name>Noah Snyder</name>
      <uri>https://nsnyder1.pages.iu.edu</uri>
    </author>
    <source>
      <id>http://sbseminar.wordpress.com/feed/atom/</id>
      <link href="https://sbseminar.wordpress.com" rel="alternate" type="text/html"/>
      <link href="https://sbseminar.wordpress.com/feed/atom/" rel="self" type="application/atom+xml"/>
      <link href="https://sbseminar.wordpress.com/osd.xml" rel="search" title="Secret Blogging Seminar" type="application/opensearchdescription+xml"/>
      <link href="https://s1.wp.com/opensearch.xml" rel="search" title="WordPress.com" type="application/opensearchdescription+xml"/>
      <link href="https://sbseminar.wordpress.com/?pushpress=hub" rel="hub" type="text/html"/>
      <subtitle xml:lang="en">Representation theory, geometry and whatever else we decide is worth writing about today.</subtitle>
      <title xml:lang="en">Secret Blogging Seminar</title>
      <updated>2026-07-29T12:09:53Z</updated>
    </source>
  </entry>

  <entry xml:lang="en">
    <id>http://quantumfrontiers.com/?p=18023</id>
    <link href="https://quantumfrontiers.com/2026/07/26/wise-guy/" rel="alternate" type="text/html"/>
    <link href="https://quantumfrontiers.com/2026/07/26/wise-guy/#comments" rel="replies" type="text/html"/>
    <link href="https://quantumfrontiers.com/2026/07/26/wise-guy/feed/atom/" rel="replies" type="application/atom+xml"/>
    <title xml:lang="en">Wise guy</title>
    <summary type="xhtml" xml:lang="en"><div xmlns="http://www.w3.org/1999/xhtml">In my closet, in a basket labeled “Random stuff,” sits a bag of quarters. They total only a few dollars, but their worth to me exceeds their monetary value. I received the quarters from Mark Wise. Mark taught a course … <a href="https://quantumfrontiers.com/2026/07/26/wise-guy/">Continue reading <span class="meta-nav">→</span></a></div>
    </summary>
    <content type="xhtml" xml:lang="en"><div xmlns="http://www.w3.org/1999/xhtml"><p class="wp-block-paragraph">In my closet, in a basket labeled “Random stuff,” sits a bag of quarters. They total only a few dollars, but their worth to me exceeds their monetary value. I received the quarters from Mark Wise.</p>



<p class="wp-block-paragraph">Mark taught a <a href="https://pirsa.org/13010024">course</a> about the Standard Model of particle physics at my <a href="https://quantumfrontiers.com/2013/07/01/this-single-shot-life/">master’s program</a> at the Perimeter Institute for Theoretical Physics, near Toronto. Perimeter borrowed him from Caltech, to whose faculty he belonged. Mark had grown up in Canada and studied at the University of Toronto; so he didn’t mind visiting Canada even in the depths of winter. </p>



<p class="wp-block-paragraph">What would Mark have minded? He projected a mild manner—an innocuousness—that suited his sense of humor, which he often directed at himself. Mark had a bald patch and glasses, and he wore a mustache. Physics jokes and science-fiction references decorated his T-shirts, one of which he wore beneath a black suit jacket to <a href="https://pirsa.org/13010024">our first class</a>. His voice was nasal; it grated a little. But I relished listening to Mark’s lectures.</p>


<div class="wp-block-image">
<figure class="aligncenter size-large"><a href="https://quantumfrontiers.com/wp-content/uploads/2026/07/suit_jacket.png"><img alt="" class="wp-image-18024" height="480" src="https://quantumfrontiers.com/wp-content/uploads/2026/07/suit_jacket.png?w=1024" width="1024"/></a></figure>
</div>


<p class="wp-block-paragraph">Mark’s lecturing exemplified clarity, because he knew particle physics so deeply. When he walked us through its Lagrangians and scattering diagrams, his conclusions seemed inescapable. His lectures’ logic and structure appealed to me as someone who’s been hyper-organized since <a href="https://quantumfrontiers.com/2026/04/12/how-i-learned-to-stop-worrying-andno-ive-always-adored-entropy/">at least fourth grade</a>.</p>



<p class="wp-block-paragraph">Yet Mark cared about us students beyond the requirements of pedagogy. His T-shirts invited conversation from those who arrived to class early. Whenever a student answered or asked a question, he tossed them a quarter. Sometimes, he’d pause to examine the quarter, deliberate about whether to toss a Canadian quarter or an American one, or opine about the motto printed on the coin. (Mark confessed to having lower standards than those ingrained in the New Hampshire state motto, “Live free or die.” Where he came from, “We just wanna live!”) </p>



<p class="wp-block-paragraph">Some days, Mark found little change in his pocket and announced that he needed to return to the bank for more quarters. The announcements sounded like complaints. He didn’t need to return to the bank, though, as nobody needs to bring doughnuts to the office for sharing.</p>



<p class="wp-block-paragraph">I discovered the icing on the doughnut two years later, as a PhD student at Caltech. I sat in on part of a quantum course taught by Mark. To every student who completed the course, Mark gave a T-shirt that read, “Licensed quantum mechanic.” I received a T-shirt, although I only sat in on part of the course. I’ve never worn it, because I’ve wanted never to wear it out.</p>


<div class="wp-block-image">
<figure class="aligncenter size-large"><a href="https://quantumfrontiers.com/wp-content/uploads/2026/07/pxl_20260726_233504689.jpg"><img alt="" class="wp-image-18031" height="1023" src="https://quantumfrontiers.com/wp-content/uploads/2026/07/pxl_20260726_233504689.jpg?w=679" width="679"/></a></figure>
</div>


<p class="wp-block-paragraph">In 2024 and 2025, I co-taught a <a href="https://quantumfrontiers.com/2024/09/18/announcing-the-quantum-steampunk-creative-writing-course/">course</a> on quantum-steampunk creative writing. Students learned about quantum physics, quantum technologies, and thermodynamics. Quanta are discrete units. For example, a photon is a quantum of energy. I illustrated quanta with coins, which are discrete units of money. From then on, I tossed a quarter to every student who answered or asked a question about quantum physics. (I joked that I should have tossed pennies, the minimal units of money, but chose quarters because inflation had been high recently.) I adapted Mark’s tradition to thermodynamics—the study of energy—by tossing Hershey’s kisses—dense packets of energy. </p>


<div class="wp-block-image">
<figure class="aligncenter size-medium"><a href="https://quantumfrontiers.com/wp-content/uploads/2026/07/quarters.jpeg"><img alt="" class="wp-image-18026" height="297" src="https://quantumfrontiers.com/wp-content/uploads/2026/07/quarters.jpeg?w=300" width="300"/></a></figure>
</div>


<p class="wp-block-paragraph">Before moving out of Caltech, I said goodbye to Mark. He worked among the high-energy theorists, rather than the quantum information or condensed-matter theorists, so I had to hunt down his office. He smiled and made a joke, of course.</p>



<p class="wp-block-paragraph">Mark passed away this summer. His Caltech colleague John Preskill published a eulogy as a blog post <a href="https://quantumfrontiers.com/2026/07/18/my-friend-mark-wise/">here</a>. (I learned from John’s post that inflation led Mark to upgrade his quarters to dollar coins. So much for feeling generous about upgrading from pennies to quarters.) When asked about the student experience at Caltech, Mark would say, “Caltech is heaven for professors.” Irony would creep into his voice and body language as he’d continue, “Doesn’t that mean it’s heaven for students, too?” I worked my rear off as a student at Caltech and Perimeter, but I’d call both environments fairly heavenly. Mark and his ilk are reasons why.</p></div>
    </content>
    <updated>2026-07-27T00:00:10Z</updated>
    <published>2026-07-27T00:00:10Z</published>
    <category scheme="https://quantumfrontiers.com" term="News"/>
    <category scheme="https://quantumfrontiers.com" term="Reflections"/>
    <author>
      <name>Nicole Yunger Halpern</name>
    </author>
    <source>
      <id>http://quantumfrontiers.com/feed/atom/</id>
      <link href="https://quantumfrontiers.com" rel="alternate" type="text/html"/>
      <link href="https://quantumfrontiers.com/feed/atom/" rel="self" type="application/atom+xml"/>
      <link href="https://quantumfrontiers.com/osd.xml" rel="search" title="Quantum Frontiers" type="application/opensearchdescription+xml"/>
      <link href="https://s1.wp.com/opensearch.xml" rel="search" title="WordPress.com" type="application/opensearchdescription+xml"/>
      <link href="https://quantumfrontiers.com/?pushpress=hub" rel="hub" type="text/html"/>
      <subtitle xml:lang="en">A blog by the Institute for Quantum Information and Matter @ Caltech</subtitle>
      <title xml:lang="en">Quantum Frontiers</title>
      <updated>2026-09-06T13:17:26Z</updated>
    </source>
  </entry>

  <entry xml:lang="en">
    <id>http://gowers.wordpress.com/?p=7300</id>
    <link href="https://gowers.wordpress.com/2026/07/26/thoughts-about-the-leiden-declaration/" rel="alternate" type="text/html"/>
    <link href="https://gowers.wordpress.com/2026/07/26/thoughts-about-the-leiden-declaration/#comments" rel="replies" type="text/html"/>
    <link href="https://gowers.wordpress.com/2026/07/26/thoughts-about-the-leiden-declaration/feed/atom/" rel="replies" type="application/atom+xml"/>
    <title xml:lang="en">Thoughts about the Leiden Declaration</title>
    <summary xml:lang="en">Last September I went to a workshop at the Lorentz Centre in Leiden to discuss mathematics and AI with historians, philosophers, computer scientists, AI researchers, and mathematicians of several different flavours (though there was a surprising preponderance of algebraic geometers). The whole event was extremely stimulating, with some talks but also a lot of time […]</summary>
    <content type="xhtml" xml:lang="en"><div xmlns="http://www.w3.org/1999/xhtml"><p class="wp-block-paragraph">Last September I went to a workshop at the Lorentz Centre in Leiden to discuss mathematics and AI with historians, philosophers, computer scientists, AI researchers, and mathematicians of several different flavours (though there was a surprising preponderance of algebraic geometers). The whole event was extremely stimulating, with some talks but also a lot of time set aside for discussion. One of the concrete outcomes of the workshop was the Leiden Declaration, which has now been signed by over 3000 people. Given that I was part of the workshop, it might seem a bit strange that I am not one of the signatories of the resulting declaration. The reason is not so much that I disagree with it in any concrete way, but more that in several places it makes confident assertions and recommendations that I feel somewhat uncertain about. So instead I prefer to try to articulate my views about the issues raised by the declaration and put them in this blog post. Before I do that, I would like to make clear that I am very glad that the Leiden Declaration exists and I think that it has done a lot of good in focusing people’s minds on the issues that AI is forcing the mathematical community to grapple with, which are more acute now than they were last September.</p>



<p class="wp-block-paragraph">Let me begin by quoting a passage from the declaration that sets out “what we take to be characteristic values of mathematical research that we have a joint interest in preserving”.</p>



<ol class="wp-block-list">
<li>There are many reasons to pursue mathematical research, ranging from intellectual curiosity to a desire to solve practical and societal problems. Underlying much of mathematics is the activity of proof. Mathematical proofs are regarded as conferring the highest degree of certainty to their conclusions, as well as imparting understanding of why their conclusions are true. These characteristics of proof support the scientific integrity of mathematics.</li>



<li>Results are attributable to specific authors who take credit for their discovery and assume responsibility for their correctness. These principles ground the merit-based standards to which we aspire in mathematical research.</li>



<li>Mathematical arguments are regarded as transparent and subject to independent verification. They may be extremely long or difficult, but in principle no proprietary knowledge or equipment should be required to understand them.</li>



<li>Mathematicians share a concern for proper evaluation of mathematical work relative to shared standards of depth, difficulty, and significance.</li>



<li>Mathematics produces not only a body of results, but also understanding, clarity, and judgment among the communities of mathematicians who have shaped them, often in the context of their own autonomously guided research. This expert knowledge is essential, both to effectively use mathematics, and to continue to articulate new and significant research questions. A key source of strength of the discipline has long been the autonomous shaping of the direction of research and the methods used to pursue it.</li>
</ol>



<span id="more-7300"/>



<p class="wp-block-paragraph">The first thing I would say about these values is that they are undoubtedly values that are widely held by mathematicians, including, with some qualifications, me. The main qualification I have concerns point 4: I find the notion of “proper evaluation” somewhat problematic, given that different mathematicians can have very different judgments without either of them being clearly wrong, especially when it comes to the significance of a piece of mathematics. Also, these judgments are used for purposes such as the acceptance of papers in journals, hiring and promotion decisions, the awarding of prizes, and so on, that are part of a system that copiously rewards a few people — I myself have hugely benefited from it — but doesn’t necessarily adequately reward a lot of people who are doing less visible work that is essential to keeping the whole enterprise going.</p>



<p class="wp-block-paragraph">But the more important point is whether these values are ones that we should fight for in the future, as the Leiden Declaration suggests. I find that clearer for some of them than others. For example, it seems to me that the importance of rigorous proof will be even greater in an AI age than it was before — if the output of AI is not underpinned by rigorous proof, then the kinds of difficulties one already hears about with certain areas of human mathematics (see for example many talks by Kevin Buzzard arguing for the value of formalization) would be hugely magnified. But what about the attribution of results to specific authors, who take both credit and responsibility for them? Suppose that at some point in the future AI becomes more autonomous, reading the literature and solving many problems that it finds. Suppose also that its solutions are autoformalized, so there is no serious doubt about their correctness. In such a situation, there would be nothing for a human to take credit for or responsibility for. Does that mean that we should declare such results undesirable and threatening to mathematical values? </p>



<p class="wp-block-paragraph">Of course, something could well be missing in such a situation: perhaps the proofs would be badly written and hard to follow, which would mean that they lacked something we all very much value. So let me extend the thought experiment slightly. What if by that stage one could take one of these outputs and ask an LLM to explain the ideas, and what if LLMs did a very good job at that? That is not particularly hypothetical, since they are often pretty good at this job already, but I am imagining a world in which they are much better than they are now, as they will presumably become. </p>



<p class="wp-block-paragraph">So now we would have a world in which a lot of problems had been solved, we were sure that the solutions were correct, and we had an LLM ready to explain those solutions in as much or as little detail as we wanted. Is that a future we should resist, and if so, why? </p>



<p class="wp-block-paragraph">One obvious reason is that it would take a huge part of the fun out of the subject. It is extremely satisfying to struggle with a mathematical problem for months or even years and eventually solve it. But I worry about that argument, because it seems to be saying that we should resist doing mathematics the easy way because a tiny fraction of the world’s population gets huge pleasure from taking orders of magnitude longer to do it. That is not to say that I wouldn’t be sad that a way of life that has sustained me for the last forty years was not available any more — of course I would. I just find it hard to use it as a reason to argue that we should try to preserve the “ownership structure” of mathematical results. If we arrive at a world where mathematical theorems are no longer associated with mathematicians, maybe that won’t be any more problematic than the fact that stars aren’t named after astronomers and most aren’t named at all. I’m not necessarily in a hurry for that world to exist, but maybe once the transition had happened, people would be OK with it.</p>



<p class="wp-block-paragraph">The third value I share in an uncomplicated way, and I have already discussed the fourth. The fifth value is one that I hold very strongly, though I’m not so keen on the idea of experts consciously “shaping the direction of research”, something that I see as happening more organically. Obviously there are some notable examples of mathematicians who have created wonderful programmes of research, but even there I would like to credit other mathematicians with understanding what is wonderful about those programmes and contributing to them enthusiastically as a result, rather than being told what direction to pursue and meekly doing so (which is probably not what the declaration is actually trying to suggest, but it has a slight flavour of that for me).</p>



<p class="wp-block-paragraph">But that’s a minor quibble when set against my main worry about the effect of AI on mathematics, which is the possible destruction of mathematical culture. There is at the moment an extraordinary body of knowledge and expertise that exists not just in the mathematical literature but in the heads of mathematicians all round the world. Imagine if AI didn’t exist and a pandemic broke out that for some reason wiped out all mathematicians and nobody else. All the literature would still be there, but nobody would have the faintest idea what to do with it. To revive a mathematical tradition under those circumstances would be extremely difficult and take decades. Now imagine a slight variant of that, where AI does exist and because of it people are no longer motivated to put in the years of effort it takes to reach the level of expertise that a typical research mathematician has now. After a decade or two, we might arrive at a situation where the mathematical literature has, in some form, been vastly expanded, but there is no corresponding community of human experts who have a shared understanding of parts of it. Almost all of mathematics would be like the areas that we have more or less forgotten about today, areas that exist in papers written many decades ago that nobody reads any more. (I won’t name any such area because I don’t want accidentally to suggest an area that many people still love and work on.) </p>



<p class="wp-block-paragraph">This, it seems to me, is a possibility that we should try very hard to resist, but I agree with many other commentators who say that in order to resist it, we will need to give less priority to some of our current values — and I would include ownership of mathematical results in that list — and more to others. For example, if Person A gets an LLM to one-shot a solution of an important open problem (which is formalized, possibly automatically, so there is no doubt about its correctness) but Person B makes the effort to digest the solution and explain it in a way that other mathematicians can understand and learn from, then I think we will want Person B to get the lion’s share of the credit. The credit would be of a slightly different from what it is now, which could be described as admiration for somebody’s talent, insight, speed (I mean here the purely factual statement that speed is often admired — I would prefer that to be less the case) and hard work. It would be more like the gratitude that one feels already for somebody who writes a beautiful textbook that makes a whole area of mathematics coherent and accessible. </p>



<p class="wp-block-paragraph">Maybe that is what the “research mathematicians” of the future should do: make a selection from a vast sea of AI-generated mathematics and write a book about it in such a way that other mathematicians can read the book and feel the kind of enrichment that we feel when we get to grips with an area of mathematics.</p>



<p class="wp-block-paragraph">At this point I have to admit that there’s a pessimistic side of me that asks the following general question whenever anyone says anything about what the role for humans might be in the future: why do you think that AI wouldn’t be able to do it? For example, with the suggestion I’ve just made, what reason is there to suppose that ChatGPT 8.2 wouldn’t be able to have a short interaction with you about your mathematical tastes and background and then write the ideal textbook just for you? Humans are likely to be better at this kind of curating for a little while yet, but is it a fundamentally human ability that AI could never hope to emulate? </p>



<p class="wp-block-paragraph">In a world where AI wrote bespoke textbooks (or more likely, just taught people in some more direct way), something would be lost that feels important: mathematics as a collective endeavour. If we all just learnt cool bits of maths for our own private satisfaction, we would miss the considerable pleasure that comes from discussing mathematics with others, though even that could in principle be restored by a benign LLM that deliberately taught many people the same cool bits of the subject, though an LLM that could do that sort of social engineering would raise all sorts of safety issues. </p>



<p class="wp-block-paragraph">Let me now turn to the section of the declaration about potential threats. I’ll put my comments on each one in square brackets.</p>



<ol class="wp-block-list">
<li>Current automated techniques can produce plausible but unreliable (or even incorrect) arguments which are difficult to distinguish from correct mathematical proofs. This applies not only to informal arguments, but also to formalizations, where the difficulty lies in the translation between computer-encoded and human presentations of concepts. These fast-moving developments put our present system of review under increasing pressure, jeopardizing our ability to implement traditional standards for the correctness, transparency, and independent verifiability of proof. [This feels like less of a problem now than it did last September, partly because the best LLMs hallucinate a lot less than before, and partly because autoformalization is improving all the time — I have just used harmonic.fun’s Aristotle system to formalize a complicated paper in Lean and I didn’t need to know any Lean to do it.]</li>



<li>Technologies that draw extensively on the published mathematical commons undermine the traditional system of attribution. Models trained on published works frequently return outputs that do not properly cite the human works they synthesize. Many current models are also built on data obtained by systematically exploiting licenses and access arrangements that were not made with artificial intelligence in mind, or indeed by simply violating copyright protections. [This is a problem at the moment, when ownership of results is important, and I am very much in favour of people making an effort to give appropriate credit for mathematical ideas that AI may have used. However, in the longer term, as I have already discussed, I think this ownership structure will break down and the issue will become less important. It also seems possible that LLMs will become better at revealing their sources.]</li>



<li>Technologies which affect the way in which mathematics is practiced may disturb the current system of incentives. The use of artificial intelligence — and thus also the sort of problems which it can address — may become incentivized for its own sake, disrupting our mechanisms for hiring, funding, and recognition. This disadvantages researchers who do not have access to the technologies or decision-making related to them, or who are unwilling to use technologies controlled by organizations whose values they do not share. [These seem to me to be genuine problems. I think there is simply no point in hoping that our current system of incentives will not be disturbed — it obviously will. I am not necessarily too worried if our mechanisms for hiring, funding and recognition are disrupted, as I don’t find those mechanisms unproblematic as they are, but disadvantaging researchers who do not have access to good LLMs is something I certainly think we should worry about.]</li>



<li>Proper evaluation is endangered if results are communicated through informal channels such as press releases or blog posts, often without any research paper or other disclosure of information necessary for scientific evaluation. This practice seeks publicity for new results on market timelines before the accepted processes of community evaluation in mathematics can take place. In many cases this leads to simplifications in reporting, such as overemphasizing the significance of automated tools and undervaluing the prior human contributions which have made those tools possible. Such oversimplification risks influencing public opinion in a way that not only damages perceptions of mathematics, but also misleadingly uses specific mathematical tasks as metrics for the general reasoning capacities of commercial products. [I think this can be a problem, but I think it is not as serious a problem as some of the others, since when results get overhyped, there seems to be no shortage of people publicly (and rightly) pointing that out.]</li>



<li>These developments put the autonomy of mathematics under threat. The increasing involvement of technology companies in mathematical research raises the risk that research questions may come to be prioritized because of their amenability to automated mathematics, rather than expert judgment of their deeper significance. Indeed, broader understanding of the field may be permanently lost in the process of automation. With university budgets under pressure, this reshaping also changes professional incentives in a manner which encourages the collaboration of researchers with technology companies on asymmetric terms. If left unchecked, these trends go beyond threatening researchers’ autonomy, affecting the scope and depth of mathematical research itself. [I think this could be a problem, but it also seems to me that mathematicians have a lot of power here. For instance, if a technology company were to produce a lot of research that mathematicians did not find all that interesting or important, I don’t think they would be able to use their financial and other resources to persuade us to change our minds. Rather, what seems to happen is that mathematicians say, “Yes that does X but it doesn’t do Y,” and the tech companies then feel challenged to do Y.]</li>
</ol>



<p class="wp-block-paragraph">There follow eleven recommendations for individual mathematicians. I agree with almost all of them. The one that I’m not so sure about, for reasons I’ve basically already gone into, is this.</p>



<p class="wp-block-paragraph"><strong>Affirm the humanity of authorship.</strong> Credit and responsibility continue to belong to humans within the mathematical community and should not be given to automated systems. Artificial intelligence may obscure, but does not replace, the collective human labor behind a result.</p>



<p class="wp-block-paragraph">I’m not sure what that really means. For example, should we affirm the humanity of authorship in the case of the solution to the unit-distance problem? Some humans did a wonderful job of explaining the proof that OpenAI’s model came up with, and the model made use of some highly non-trivial mathematics produced by humans, but the solution itself has not been credited to any human, and nor should it be in my view.  </p>



<p class="wp-block-paragraph">Under recommendations for mathematical organizations and not-for-profit research funders I again agree with several of them but have my doubts about some. An interesting case is the following.</p>



<p class="wp-block-paragraph"><strong>Protect the rights of authors. </strong>Automated mathematics presents new challenges to the rights of authors, and societies should be proactive in the development of sample licensing agreements to protect these rights. In particular, material should not be used as training data without consent, and publishing agreements should allow authors to opt-out [sic] of the use of their work in this way. </p>



<p class="wp-block-paragraph">This recommendation seems to belong to a world in which journal articles are the main means of dissemination of mathematics. But that has long since ceased to be the case: almost all dissemination now takes place via arXiv preprints, with journals limited to providing a little extra mark of prestige. Once an article is on arXiv, it is on the internet and one can hardly ask for it not to be used as training data. So this recommendation, if it applies at all, will apply to a tiny fraction of articles that are published without first appearing on arXiv. More generally, what right of an author is being compromised when an article is used as training data? We don’t object if <em>human</em> mathematicians use our articles to help train themselves to become better mathematicians — indeed, we will typically be delighted that somebody else thought our articles worthy of their attention. So the objection to a machine doing the same would have to be that for some reason one did not want machines to get better at mathematics in a similar way. I can imagine grounds for such a wish: perhaps somebody is worried about the threat that LLMs pose to traditional mathematical practice, or perhaps they worry that mathematical ability of LLMs will transfer to much more dangerous reasoning ability. But there’s a more complicated discussion to be had here than one might think from reading the recommendation.</p>



<p class="wp-block-paragraph">The next recommendation is this.</p>



<p class="wp-block-paragraph"><strong>Insist on appropriate publication outlets.</strong> Demand that mathematical results continue to be published in peer-reviewed venues such as journals, proceedings, and books. Informal mechanisms such as press releases or blog posts can provide a valuable supporting role, but they cannot replace peer-review or community scrutiny.</p>



<p class="wp-block-paragraph">For reasons that I’ve gone into many times, I am not too fond of the current publication system, so I can’t get behind this recommendation. Indeed, if the current system becomes unsustainable because of a flood of AI-generated and AI-aided content, I would regard that as a beneficial consequence of AI. However, that doesn’t mean that I would advocate a total free-for-all. I’ve already said that one of my worries is that if mathematical content is not sufficiently organized, then the traditions that we all value could die. I just think that what we will want to do to preserve those traditions is likely to be a lot more innovative than clinging on to the peer-reviewed journal system. </p>



<p class="wp-block-paragraph">I have highlighted in this post the parts of the declaration that I have doubts about, either because I disagree with them or, more typically, because I sort of half agree with them but want to add many qualifications. That may make the post come across as rather negative, but that is not my intention. The parts I disagree with are in the minority, and I think it is important that a declaration such as this should be made. I should also make clear that my views are evolving all the time, largely because the speed of progress of LLMs has taken me by surprise, but also as a result of conversations I have had or opinions that other mathematicians have expressed online.</p>



<p class="wp-block-paragraph">I’ll end with two further clarifications. The first is that it may seem as though I am taking it for granted that LLMs will soon be better than humans at all aspects of mathematical problem solving, and maybe also problem posing, theory building, formulation of definitions, etc. I do think all that will happen at some point, but whereas some people say that it will obviously happen within the next two to three years, I would say that it <em>might</em> happen as soon as that, but I don’t rule out that we’ll get lucky and find that we can do interesting AI-assisted maths for quite a bit longer than that before AI doesn’t need us any more. </p>



<p class="wp-block-paragraph">The second is that I think I have acquired a reputation as somebody who celebrates what is going on. But if, for example, I post on Twitter saying that such-and-such an AI solution is a remarkable development, the word “remarkable” is meant to indicate no more nor less than that I found it very surprising. My feelings about the possibility of AI solving all sorts of problems that interest me are much more mixed. I’ve had the experience twice now of seeing GPT 5.6 Pro one-shot a solution to a problem that I very much liked and had thought about hard (in both cases with much younger collaborators, who, with my approval, were the ones who prompted the LLM). It felt very strange and not particularly pleasant to have the rug pulled out from under my feet like that. On the other hand, I was quite pleased to see the problems solved. It’s actually a similar feeling to the one I have had many times when a problem I am fond of and have thought about gets solved by another human mathematician. </p>



<p class="wp-block-paragraph">Another factor for me is that I have invested a lot of thought into automatic theorem proving of a more traditional kind. One of my main motivations for that was the hope that the work I put into it would extend the state of the art, measured by which problems a computer can solve. That ship has sailed now, and that saddens me. I still think that there is value in the work that I and my group are doing, but it has become a tougher sell.</p>



<p class="wp-block-paragraph">So I personally have already found AI quite disruptive, and this is just the beginning. I would have preferred the developments to happen at a slower pace. But I don’t see any practical way to slow them down, so the best we can do is probably to face up to the changes that are being thrust upon us and do what we can to maximize the benefits and minimize the damage. The Leiden Declaration may not be perfect, but it makes an important and positive contribution to that effort.</p>



<p class="wp-block-paragraph"/></div>
    </content>
    <updated>2026-07-26T22:44:26Z</updated>
    <published>2026-07-26T16:54:31Z</published>
    <category scheme="https://gowers.wordpress.com" term="AI and maths"/>
    <category scheme="https://gowers.wordpress.com" term="ai"/>
    <category scheme="https://gowers.wordpress.com" term="mathematics"/>
    <author>
      <name>gowers</name>
      <uri>https://gowers.wordpress.com</uri>
    </author>
    <source>
      <id>http://gowers.wordpress.com/feed/atom/</id>
      <link href="https://gowers.wordpress.com" rel="alternate" type="text/html"/>
      <link href="https://gowers.wordpress.com/feed/atom/" rel="self" type="application/atom+xml"/>
      <link href="https://gowers.wordpress.com/osd.xml" rel="search" title="Gowers's Weblog" type="application/opensearchdescription+xml"/>
      <link href="https://s1.wp.com/opensearch.xml" rel="search" title="WordPress.com" type="application/opensearchdescription+xml"/>
      <link href="https://gowers.wordpress.com/?pushpress=hub" rel="hub" type="text/html"/>
      <subtitle xml:lang="en">Mathematics related discussions</subtitle>
      <title xml:lang="en">Gowers's Weblog</title>
      <updated>2026-08-13T07:34:46Z</updated>
    </source>
  </entry>

  <entry xml:lang="en-US">
    <id>https://asymptotia.com/?p=20389</id>
    <link href="https://asymptotia.com/2026/07/24/on-top-of-the-mountain-again/" rel="alternate" type="text/html"/>
    <link href="https://asymptotia.com/2026/07/24/on-top-of-the-mountain-again/#comments" rel="replies" type="text/html"/>
    <link href="https://asymptotia.com/2026/07/24/on-top-of-the-mountain-again/feed/atom/" rel="replies" type="application/atom+xml"/>
    <title xml:lang="en-US">On top of the Mountain again</title>
    <summary type="xhtml" xml:lang="en-US"><div xmlns="http://www.w3.org/1999/xhtml"><p>Just in case you’re up for a short talk at the top of Mount Wilson followed by an evening of observing through the historic telescopes on Saturday 25th July… this might be for you! Go to Mount Wilson Observatory’s website for more. –cvj</p>
<p>The post <a href="https://asymptotia.com/2026/07/24/on-top-of-the-mountain-again/">On top of the Mountain again</a> appeared first on <a href="https://asymptotia.com">Asymptotia</a>.</p></div>
    </summary>
    <updated>2026-07-25T05:15:03Z</updated>
    <published>2026-07-25T05:15:03Z</published>
    <category scheme="https://asymptotia.com/" term="art"/>
    <category scheme="https://asymptotia.com/" term="dialogues"/>
    <category scheme="https://asymptotia.com/" term="Los Angeles"/>
    <category scheme="https://asymptotia.com/" term="science"/>
    <author>
      <name>Clifford</name>
      <uri>http://asymptotia.com</uri>
    </author>
    <source>
      <id>https://asymptotia.com/feed/atom/</id>
      <link href="https://asymptotia.com/" rel="alternate" type="text/html"/>
      <link href="https://asymptotia.com/feed/atom/" rel="self" type="application/atom+xml"/>
      <title xml:lang="en-US">Asymptotia</title>
      <updated>2026-07-25T05:15:03Z</updated>
    </source>
  </entry>

  <entry xml:lang="en-US">
    <id>https://peterrohde.org/?p=7071</id>
    <link href="https://peterrohde.org/introducing-sigfrieds-blog/" rel="alternate" type="text/html"/>
    <link href="https://peterrohde.org/introducing-sigfrieds-blog/#comments" rel="replies" type="text/html"/>
    <link href="https://peterrohde.org/introducing-sigfrieds-blog/feed/atom/" rel="replies" type="application/atom+xml"/>
    <title xml:lang="en-US">Introducing Sigfried’s Blog</title>
    <summary xml:lang="en-US">My new secondary blog featuring conversations with AI, inventing new things, exploring hypotheticals, letting creativity flow freely. Some highlights: https://sigfriedschattenjaeger.wordpress.com</summary>
    <content type="xhtml" xml:lang="en-US"><div xmlns="http://www.w3.org/1999/xhtml"><p class="p1 wp-block-paragraph"><a href="https://sigfriedschattenjaeger.wordpress.com">My new secondary blog</a> featuring conversations with AI, inventing new things, exploring hypotheticals, letting creativity flow freely.</p>



<p class="p1 wp-block-paragraph">Some highlights:</p>



<ul class="wp-block-list">
<li>Satellite constellations with topologically distributed apertures.</li>



<li>A clockless architecture for classical topological computing.</li>



<li>Post-quantum cryptography using the <span class="katex-eq">\mathbb{Z}_2^n \rtimes S_n</span> algebra.</li>



<li>Efficient homomorphic computing using reversible classical circuits.</li>



<li>A silent speech interface using microwave Doppler imaging.</li>



<li>Cognitive search acceleration.</li>



<li>Consensual thought guidance.</li>



<li>Subliminal audio modulation &amp; human guidance systems.</li>



<li>Microwave imaging using WiFi and 5G for medical applications.</li>



<li>Thought tomography.</li>



<li>The quantum bluff hypothesis.</li>
</ul>



<p class="wp-block-paragraph"><a href="https://sigfriedschattenjaeger.wordpress.com">https://sigfriedschattenjaeger.wordpress.com</a></p></div>
    </content>
    <updated>2026-07-24T07:40:35Z</updated>
    <published>2026-07-24T07:40:34Z</published>
    <category scheme="https://peterrohde.org" term="Artificial Intelligence"/>
    <author>
      <name>Peter Rohde</name>
      <uri>https://www.peterrohde.org</uri>
    </author>
    <source>
      <id>https://peterrohde.org/feed/atom/</id>
      <icon>https://i0.wp.com/peterrohde.org/wp-content/uploads/2024/02/IMG_5895.jpeg?fit=32%2C32&amp;ssl=1</icon>
      <link href="https://peterrohde.org" rel="alternate" type="text/html"/>
      <link href="https://peterrohde.org/feed/atom/" rel="self" type="application/atom+xml"/>
      <subtitle xml:lang="en-US">Quantum computer scientist &amp; alpinist.</subtitle>
      <title xml:lang="en-US">Peter Rohde</title>
      <updated>2026-07-24T07:40:35Z</updated>
    </source>
  </entry>

  <entry xml:lang="en">
    <id>http://sbseminar.wordpress.com/?p=7032</id>
    <link href="https://sbseminar.wordpress.com/2026/07/20/the-new-counterexample-to-the-jacobian-conjecture/" rel="alternate" type="text/html"/>
    <link href="https://sbseminar.wordpress.com/2026/07/20/the-new-counterexample-to-the-jacobian-conjecture/#comments" rel="replies" type="text/html"/>
    <link href="https://sbseminar.wordpress.com/2026/07/20/the-new-counterexample-to-the-jacobian-conjecture/feed/atom/" rel="replies" type="application/atom+xml"/>
    <title xml:lang="en">The new counterexample to the Jacobian conjecture</title>
    <summary xml:lang="en">As many of you have probably heard already, yesterday morning, Levent Alpöge tweeted that Fable had found a counterexample to the Jacobian Conjecture. Specifically, let Then the Jacobian of is easily checked to be . However, the map is generically three to one, not bijective. I’m sure many of you are playing with these polynomials […]</summary>
    <content type="xhtml" xml:lang="en"><div xmlns="http://www.w3.org/1999/xhtml"><p class="wp-block-paragraph">As many of you have probably heard already, yesterday morning, <a href="https://alpo.ge/">Levent Alpöge</a> tweeted that <a href="https://x.com/__alpoge__/status/2079028340955197566">Fable had found a counterexample to the Jacobian Conjecture</a>. Specifically, let</p>



<div class="wp-block-math"><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mtable class="tml-jot" columnalign="right left right" displaystyle="true"><mtr><mtd class="tml-right" style="padding-left: 0em; padding-right: 0em;"><mi>a</mi></mtd><mtd class="tml-left" style="padding-left: 0em; padding-right: 0em;"><mo>=</mo></mtd><mtd class="tml-right" style="padding-left: 1em; padding-right: 0em;"><mrow><mo form="prefix" stretchy="false">(</mo><mn>1</mn><mo>+</mo><mi>x</mi><mi>y</mi><msup><mo form="postfix" stretchy="false">)</mo><mn>3</mn></msup><mi>z</mi><mo>+</mo><msup><mi>y</mi><mn>2</mn></msup><mo form="prefix" stretchy="false">(</mo><mn>1</mn><mo>+</mo><mi>x</mi><mi>y</mi><mo form="postfix" stretchy="false">)</mo><mo form="prefix" stretchy="false">(</mo><mn>4</mn><mo>+</mo><mn>3</mn><mi>x</mi><mi>y</mi><mo form="postfix" stretchy="false">)</mo><mo separator="true">,</mo></mrow></mtd></mtr><mtr><mtd class="tml-right" style="padding-left: 0em; padding-right: 0em;"><mi>b</mi></mtd><mtd class="tml-left" style="padding-left: 0em; padding-right: 0em;"><mo>=</mo></mtd><mtd class="tml-right" style="padding-left: 1em; padding-right: 0em;"><mrow><mi>y</mi><mo>+</mo><mn>3</mn><mi>x</mi><mo form="prefix" stretchy="false">(</mo><mn>1</mn><mo>+</mo><mi>x</mi><mi>y</mi><msup><mo form="postfix" stretchy="false">)</mo><mn>2</mn></msup><mi>z</mi><mo>+</mo><mn>3</mn><mi>x</mi><msup><mi>y</mi><mn>2</mn></msup><mo form="prefix" stretchy="false">(</mo><mn>4</mn><mo>+</mo><mn>3</mn><mi>x</mi><mi>y</mi><mo form="postfix" stretchy="false">)</mo><mo separator="true">,</mo></mrow></mtd></mtr><mtr><mtd class="tml-right" style="padding-left: 0em; padding-right: 0em;"><mi>c</mi></mtd><mtd class="tml-left" style="padding-left: 0em; padding-right: 0em;"><mo>=</mo></mtd><mtd class="tml-right" style="padding-left: 1em; padding-right: 0em;"><mrow><mn>2</mn><mi>x</mi><mo>−</mo><mn>3</mn><msup><mi>x</mi><mn>2</mn></msup><mi>y</mi><mo>−</mo><msup><mi>x</mi><mn>3</mn></msup><mi>z</mi><mo separator="true">,</mo></mrow></mtd></mtr></mtable><annotation encoding="application/x-tex">\begin{align*}
a&amp;=&amp;(1+xy)^3z+y^2(1+xy)(4+3xy),\\
b&amp;=&amp;y+3x(1+xy)^2z+3xy^2(4+3xy),\\
c&amp;=&amp;2x-3x^2y-x^3z,
\end{align*}
</annotation></semantics></math></div>



<p class="wp-block-paragraph">Then the Jacobian of <img alt="(a,b,c)" class="latex" src="https://s0.wp.com/latex.php?latex=%28a%2Cb%2Cc%29&amp;bg=ffffff&amp;fg=444444&amp;s=0&amp;c=20201002"/> is easily checked to be <img alt="-2" class="latex" src="https://s0.wp.com/latex.php?latex=-2&amp;bg=ffffff&amp;fg=444444&amp;s=0&amp;c=20201002"/>.  However, the map <img alt="(a,b,c)" class="latex" src="https://s0.wp.com/latex.php?latex=%28a%2Cb%2Cc%29&amp;bg=ffffff&amp;fg=444444&amp;s=0&amp;c=20201002"/> is generically three to one, not bijective.</p>



<p class="wp-block-paragraph">I’m sure many of you are playing with these polynomials to see what you can figure out about them. This is a place for us to share our observations. I’ll post a few minor observations of my own soon.</p>



<span id="more-7032"/>



<p class="wp-block-paragraph">First, a <a href="https://mathoverflow.net/questions/513387/galois-structure-of-the-new-counterexample-to-the-jacobian-conjecture-an-explic">basic but intriguing observation</a> from Mathoverflow user “dorky”: The polynomials <img alt="a" class="latex" src="https://s0.wp.com/latex.php?latex=a&amp;bg=ffffff&amp;fg=444444&amp;s=0&amp;c=20201002"/>, <img alt="b" class="latex" src="https://s0.wp.com/latex.php?latex=b&amp;bg=ffffff&amp;fg=444444&amp;s=0&amp;c=20201002"/> and <img alt="c" class="latex" src="https://s0.wp.com/latex.php?latex=c&amp;bg=ffffff&amp;fg=444444&amp;s=0&amp;c=20201002"/> are homogeneous with respect to the grading where <img alt="\deg(x) = -1" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cdeg%28x%29+%3D+-1&amp;bg=ffffff&amp;fg=444444&amp;s=0&amp;c=20201002"/>, <img alt="\deg(y) = 1" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cdeg%28y%29+%3D+1&amp;bg=ffffff&amp;fg=444444&amp;s=0&amp;c=20201002"/> and <img alt="\deg(z)=2" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cdeg%28z%29%3D2&amp;bg=ffffff&amp;fg=444444&amp;s=0&amp;c=20201002"/>; their degrees are <img alt="\deg(a) = 2" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cdeg%28a%29+%3D+2&amp;bg=ffffff&amp;fg=444444&amp;s=0&amp;c=20201002"/>, <img alt="\deg(b) = 1" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cdeg%28b%29+%3D+1&amp;bg=ffffff&amp;fg=444444&amp;s=0&amp;c=20201002"/> and <img alt="\deg(c) = -1" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cdeg%28c%29+%3D+-1&amp;bg=ffffff&amp;fg=444444&amp;s=0&amp;c=20201002"/>. I’m not sure what to make of this, but it surely matters.</p>



<hr class="wp-block-separator has-alpha-channel-opacity"/>



<p class="wp-block-paragraph">Some computations by me: If you eliminate any two of the variables <img alt="(x,y,z)" class="latex" src="https://s0.wp.com/latex.php?latex=%28x%2Cy%2Cz%29&amp;bg=ffffff&amp;fg=444444&amp;s=0&amp;c=20201002"/>, you get a cubic relation in the remaining variable. Here they are</p>



<div class="wp-block-math"><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mtable columnalign="center"><mtr><mtd style="padding-left: 0em; padding-right: 0em;"><mrow><mo>−</mo><mn>2</mn><mi>c</mi><mo>+</mo><mo form="prefix" stretchy="false">(</mo><mn>4</mn><mo>−</mo><mn>3</mn><mi>b</mi><mi>c</mi><mo form="postfix" stretchy="false">)</mo><mi>x</mi><mo>+</mo><mo form="prefix" stretchy="false">(</mo><mn>16</mn><mi>a</mi><mo>−</mo><msup><mi>b</mi><mn>2</mn></msup><mo>−</mo><mn>18</mn><mi>a</mi><mi>b</mi><mi>c</mi><mo>+</mo><msup><mi>b</mi><mn>3</mn></msup><mi>c</mi><mo>+</mo><mn>27</mn><msup><mi>a</mi><mn>2</mn></msup><msup><mi>c</mi><mn>2</mn></msup><mo form="postfix" stretchy="false">)</mo><msup><mi>x</mi><mn>3</mn></msup></mrow></mtd></mtr><mtr><mtd style="padding-left: 0em; padding-right: 0em;"><mrow><mo form="prefix" stretchy="false">(</mo><mo form="prefix" stretchy="false">−</mo><mn>18</mn><mi>a</mi><mi>b</mi><mo>+</mo><msup><mi>b</mi><mn>3</mn></msup><mo>+</mo><mn>27</mn><msup><mi>a</mi><mn>2</mn></msup><mi>c</mi><mo form="postfix" stretchy="false">)</mo><mo>+</mo><mn>18</mn><mi>a</mi><mi>y</mi><mo>−</mo><mn>3</mn><mi>b</mi><msup><mi>y</mi><mn>2</mn></msup><mo>+</mo><mn>2</mn><msup><mi>y</mi><mn>3</mn></msup></mrow></mtd></mtr><mtr><mtd style="padding-left: 0em; padding-right: 0em;"><mrow><mo form="prefix" stretchy="false">(</mo><mtext>really long</mtext><mo form="postfix" stretchy="false">)</mo><mo>+</mo><mn>8</mn><msup><mi>z</mi><mn>3</mn></msup></mrow></mtd></mtr></mtable><annotation encoding="application/x-tex">\begin{matrix}
-2 c+(4 – 3 b c) x +  (16 a – b^2 – 18 a b c + b^3 c + 27 a^2 c^2) x^3 \\
(-18 a b + b^3 + 27 a^2 c)+18 ay-3 b y^2+ 2y^3 \\
(\text{really long}) + 8 z^3 \\
\end{matrix}</annotation></semantics></math></div>



<p class="wp-block-paragraph">I’m leaving out the “really long”, because it is really long and I suspect we don’t care about the details. Put </p>



<p class="wp-block-paragraph"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mrow><mi mathvariant="normal">Δ</mi></mrow><mo>=</mo><mn>16</mn><mi>a</mi><mo>−</mo><msup><mi>b</mi><mn>2</mn></msup><mo>−</mo><mn>18</mn><mi>a</mi><mi>b</mi><mi>c</mi><mo>+</mo><msup><mi>b</mi><mn>3</mn></msup><mi>c</mi><mo>+</mo><mn>27</mn><msup><mi>a</mi><mn>2</mn></msup><msup><mi>c</mi><mn>2</mn></msup></mrow><annotation encoding="application/x-tex">\Delta= 16 a – b^2 – 18 a b c + b^3 c + 27 a^2 c^2</annotation></semantics></math>  ,</p>



<p class="wp-block-paragraph">the leading coefficient of the <img alt="x" class="latex" src="https://s0.wp.com/latex.php?latex=x&amp;bg=ffffff&amp;fg=444444&amp;s=0&amp;c=20201002"/> cubic. Then the discriminants of the three cubics are <img alt="\Delta p^2" class="latex" src="https://s0.wp.com/latex.php?latex=%5CDelta+p%5E2&amp;bg=ffffff&amp;fg=444444&amp;s=0&amp;c=20201002"/>, <img alt="\Delta q^2" class="latex" src="https://s0.wp.com/latex.php?latex=%5CDelta+q%5E2&amp;bg=ffffff&amp;fg=444444&amp;s=0&amp;c=20201002"/>, <img alt="\Delta r^2" class="latex" src="https://s0.wp.com/latex.php?latex=%5CDelta+r%5E2&amp;bg=ffffff&amp;fg=444444&amp;s=0&amp;c=20201002"/> where </p>



<div class="wp-block-math"><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mtable class="tml-jot" columnalign="right left right" displaystyle="true"><mtr><mtd class="tml-right" style="padding-left: 0em; padding-right: 0em;"><mi>p</mi></mtd><mtd class="tml-left" style="padding-left: 0em; padding-right: 0em;"><mrow><mi>a</mi><mi>m</mi><mi>p</mi><mo separator="true">;</mo><mo>=</mo></mrow></mtd><mtd class="tml-right" style="padding-left: 1em; padding-right: 0em;"><mrow><mi>a</mi><mi>m</mi><mi>p</mi><mo separator="true">;</mo><mn>8</mn><mo>−</mo><mn>9</mn><mi>b</mi><mi>c</mi><mo>+</mo><mn>27</mn><mi>a</mi><msup><mi>c</mi><mn>2</mn></msup></mrow></mtd></mtr><mtr><mtd class="tml-right" style="padding-left: 0em; padding-right: 0em;"><mi>q</mi></mtd><mtd class="tml-left" style="padding-left: 0em; padding-right: 0em;"><mrow><mi>a</mi><mi>m</mi><mi>p</mi><mo separator="true">;</mo><mo>=</mo></mrow></mtd><mtd class="tml-right" style="padding-left: 1em; padding-right: 0em;"><mrow><mi>a</mi><mi>m</mi><mi>p</mi><mo separator="true">;</mo><mi>b</mi></mrow></mtd></mtr><mtr><mtd class="tml-right" style="padding-left: 0em; padding-right: 0em;"><mi>r</mi></mtd><mtd class="tml-left" style="padding-left: 0em; padding-right: 0em;"><mrow><mi>a</mi><mi>m</mi><mi>p</mi><mo separator="true">;</mo><mo>=</mo></mrow></mtd><mtd class="tml-right" style="padding-left: 1em; padding-right: 0em;"><mrow><mi>a</mi><mi>m</mi><mi>p</mi><mo separator="true">;</mo><mo form="prefix" stretchy="false">(</mo><mtext>really long</mtext><mo form="postfix" stretchy="false">)</mo></mrow></mtd></mtr></mtable><annotation encoding="application/x-tex">\begin{align*}
p &amp;amp;=&amp;amp; 8 – 9 b c + 27 a c^2 \\
q &amp;amp;=&amp;amp; b \\
r &amp;amp;=&amp;amp; (\text{really long}) \\
\end{align*}</annotation></semantics></math></div>



<p class="wp-block-paragraph">The polynomials <img alt="(p,q,r)" class="latex" src="https://s0.wp.com/latex.php?latex=%28p%2Cq%2Cr%29&amp;bg=ffffff&amp;fg=444444&amp;s=0&amp;c=20201002"/> have no common zeroes. Roughly speaking, our map should have special behavior over the loci <img alt="\Delta=0" class="latex" src="https://s0.wp.com/latex.php?latex=%5CDelta%3D0&amp;bg=ffffff&amp;fg=444444&amp;s=0&amp;c=20201002"/>, <img alt="p=0" class="latex" src="https://s0.wp.com/latex.php?latex=p%3D0&amp;bg=ffffff&amp;fg=444444&amp;s=0&amp;c=20201002"/>, <img alt="q=0" class="latex" src="https://s0.wp.com/latex.php?latex=q%3D0&amp;bg=ffffff&amp;fg=444444&amp;s=0&amp;c=20201002"/> and <img alt="r=0" class="latex" src="https://s0.wp.com/latex.php?latex=r%3D0&amp;bg=ffffff&amp;fg=444444&amp;s=0&amp;c=20201002"/>. The fact that $p$, $q$ and $r$ each appear cubed means that the variables <img alt="x" class="latex" src="https://s0.wp.com/latex.php?latex=x&amp;bg=ffffff&amp;fg=444444&amp;s=0&amp;c=20201002"/>, <img alt="y" class="latex" src="https://s0.wp.com/latex.php?latex=y&amp;bg=ffffff&amp;fg=444444&amp;s=0&amp;c=20201002"/> and <img alt="z" class="latex" src="https://s0.wp.com/latex.php?latex=z&amp;bg=ffffff&amp;fg=444444&amp;s=0&amp;c=20201002"/> should have three fold branching over the loci <img alt="p=0" class="latex" src="https://s0.wp.com/latex.php?latex=p%3D0&amp;bg=ffffff&amp;fg=444444&amp;s=0&amp;c=20201002"/>, <img alt="q=0" class="latex" src="https://s0.wp.com/latex.php?latex=q%3D0&amp;bg=ffffff&amp;fg=444444&amp;s=0&amp;c=20201002"/> and <img alt="r=0" class="latex" src="https://s0.wp.com/latex.php?latex=r%3D0&amp;bg=ffffff&amp;fg=444444&amp;s=0&amp;c=20201002"/> (respectively). </p>



<p class="wp-block-paragraph">I’m having trouble visualizing what happens over <img alt="\Delta=0" class="latex" src="https://s0.wp.com/latex.php?latex=%5CDelta%3D0&amp;bg=ffffff&amp;fg=444444&amp;s=0&amp;c=20201002"/> — since the leading coefficient of the <img alt="x" class="latex" src="https://s0.wp.com/latex.php?latex=x&amp;bg=ffffff&amp;fg=444444&amp;s=0&amp;c=20201002"/> cubic drops out, the map is 2 to 1 rather than 3 to 1 over this point. But, at the same time, the <img alt="y" class="latex" src="https://s0.wp.com/latex.php?latex=y&amp;bg=ffffff&amp;fg=444444&amp;s=0&amp;c=20201002"/> and <img alt="z" class="latex" src="https://s0.wp.com/latex.php?latex=z&amp;bg=ffffff&amp;fg=444444&amp;s=0&amp;c=20201002"/> cubics have a multiple root at the points of <img alt="\Delta=0" class="latex" src="https://s0.wp.com/latex.php?latex=%5CDelta%3D0&amp;bg=ffffff&amp;fg=444444&amp;s=0&amp;c=20201002"/>. Does anyone see how to visualize this?</p>



<p class="wp-block-paragraph">Any other insights?</p>



<p class="wp-block-paragraph"/></div>
    </content>
    <updated>2026-07-20T19:16:44Z</updated>
    <published>2026-07-20T18:18:08Z</published>
    <category scheme="https://sbseminar.wordpress.com" term="Uncategorized"/>
    <author>
      <name>David Speyer</name>
      <uri>http://www.math.lsa.umich.edu/~speyer</uri>
    </author>
    <source>
      <id>http://sbseminar.wordpress.com/feed/atom/</id>
      <link href="https://sbseminar.wordpress.com" rel="alternate" type="text/html"/>
      <link href="https://sbseminar.wordpress.com/feed/atom/" rel="self" type="application/atom+xml"/>
      <link href="https://sbseminar.wordpress.com/osd.xml" rel="search" title="Secret Blogging Seminar" type="application/opensearchdescription+xml"/>
      <link href="https://s1.wp.com/opensearch.xml" rel="search" title="WordPress.com" type="application/opensearchdescription+xml"/>
      <link href="https://sbseminar.wordpress.com/?pushpress=hub" rel="hub" type="text/html"/>
      <subtitle xml:lang="en">Representation theory, geometry and whatever else we decide is worth writing about today.</subtitle>
      <title xml:lang="en">Secret Blogging Seminar</title>
      <updated>2026-07-29T12:09:53Z</updated>
    </source>
  </entry>

  <entry xml:lang="en">
    <id>300018 at https://www.science20.com</id>
    <link href="https://www.science20.com/a_quantum_diaries_survivor/20260720/toward_mode_collapse_of_natural_language-300018" rel="alternate" type="text/html"/>
    <title xml:lang="en">Toward Mode Collapse of Natural Language</title>
    <summary type="xhtml" xml:lang="en"><div xmlns="http://www.w3.org/1999/xhtml"><span class="field field--name-title field--type-string field--label-hidden">Toward Mode Collapse of Natural Language</span>

            <div class="clearfix text-formatted field field--name-body field--type-text-with-summary field--label-hidden field__item"><p>Regression toward the mean is a simple phenomenon commonly described in Statistics 101 courses. If you measure a parameter describing some phenomenon, you will find that extreme measured values tend to be followed by less extreme ones.</p>
</div>
      <span class="field field--name-uid field--type-entity-reference field--label-hidden"><a class="username" href="https://www.science20.com/profile/tommaso_dorigo" title="View user profile.">Tommaso Dorigo</a></span>
<span class="field field--name-created field--type-created field--label-hidden"><time class="datetime" datetime="2026-07-20T09:07:01-04:00" title="Monday, July 20, 2026 - 09:07">Mon, 07/20/2026 - 09:07</time>
</span>

  <div class="field field--name-field-blog-categories field--type-entity-reference field--label-inline clearfix">
    <div class="field__label">Categories</div>
              <div class="field__item"><a href="https://www.science20.com/science_society" hreflang="en">Science &amp; Society</a></div>
          </div></div>
    </summary>
    <updated>2026-07-20T13:07:01Z</updated>
    <published>2026-07-20T13:07:01Z</published>
    <author>
      <name>Tommaso Dorigo</name>
    </author>
    <source>
      <id>https://www.science20.com/</id>
      <link href="https://www.science20.com/" rel="alternate" type="text/html"/>
      <link href="https://www.science20.com/quantum_diaries_survivor/feed" rel="self" type="application/rss+xml"/>
      <title xml:lang="en">Articles by Tommaso Dorigo</title>
      <updated>2026-09-08T06:42:34Z</updated>
    </source>
  </entry>

  <entry xml:lang="en">
    <id>http://johncarlosbaez.wordpress.com/?p=44200</id>
    <link href="https://johncarlosbaez.wordpress.com/2026/07/18/galilean-limits-of-electromagnetism/" rel="alternate" type="text/html"/>
    <link href="https://johncarlosbaez.wordpress.com/2026/07/18/galilean-limits-of-electromagnetism/#comments" rel="replies" type="text/html"/>
    <link href="https://johncarlosbaez.wordpress.com/2026/07/18/galilean-limits-of-electromagnetism/feed/atom/" rel="replies" type="application/atom+xml"/>
    <title xml:lang="en">Galilean Limits of Electromagnetism</title>
    <summary xml:lang="en">Maxwell’s equations are invariant under Lorentz transformations. The usual equations of fluid flow are not! Like the rest of Newtonian mechanics, they’re invariant under Galilean transformations like So, if we simply slap these two theories together, we get a mess! How can we study electrically conductive fluids—like plasma—without bringing special relativity into the game? We […]</summary>
    <content type="xhtml" xml:lang="en"><div xmlns="http://www.w3.org/1999/xhtml"><p>Maxwell’s equations are invariant under Lorentz transformations.  The usual equations of fluid flow are not!  Like the rest of Newtonian mechanics, they’re invariant under Galilean transformations like</p>
<p><img alt="t' = t,  \quad  x' = x - vt  " class="latex" src="https://s0.wp.com/latex.php?latex=t%27+%3D+t%2C++%5Cquad++x%27+%3D+x+-+vt++&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></p>
<p>So, if we simply slap these two theories together, we get a mess!  How can we study electrically conductive fluids—like plasma—without bringing special relativity into the game?</p>
<p>We can use a limiting case of Maxwell’s equations where we ignore terms that become tiny when all the particles are moving much slower than light.</p>
<p>There seem to be at least two ways to do this: there’s an ‘electric limit’ of Maxwell’s equations and a ‘magnetic limit’.  Both are invariant under Galilean transformations.   The original derivation of these limits by Le Bellac and Lévy-Leblond in 1973 used the version of Maxwell’s equations including the electric permittivity <img alt="\varepsilon_0" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cvarepsilon_0&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and magnetic permeability <img alt="\mu_0" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmu_0&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> of the vacuum, whose product is <img alt="1/c^2" class="latex" src="https://s0.wp.com/latex.php?latex=1%2Fc%5E2&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>.  This is convenient but not necessary, as explained here:</p>
<p>• Jose A. Heras, <a href="https://arxiv.org/abs/1012.1068">The Galilean limits of Maxwell’s equations</a>.</p>
<p>In the magnetic limit of Maxwell’s equations, we throw out effects due to time-varying electric fields:</p>
<div align="center">
<a href="https://math.ucr.edu/home/baez/physical/maxwell_equations_magnetic_limit.jpg"><br/>
<img src="https://math.ucr.edu/home/baez/physical/maxwell_equations_magnetic_limit.jpg" width="400"/><br/>
</a>
</div>
<p>People often use the magnetic limit when studying nonrelativistic electrically conductive fluids.  In this situation they often consider a version of the magnetic limit where the charge density <img alt="\rho" class="latex" src="https://s0.wp.com/latex.php?latex=%5Crho&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is zero, since this is typically close to true in a plasma.  However Heras does not do this, nor does the original paper:</p>
<p>• Le Bellac and Levy-Leblond, <a href="https://www. researchgate.net/profile/Jean-Marc-Levy-Leblond/publication/251339708_Galilean_electromagnetism/">Galilean electromagnetism</a>.</p>
<p>In the electric limit of Maxwell’s equations, we throw out effects due to time-varying magnetic fields:</p>
<div align="center">
<a><br/>
<img src="https://math.ucr.edu/home/baez/physical/maxwell_equations_electric_limit.jpg" width="400"/><br/>
</a>
</div>
<p>It’s fun to compare the magnetic and electric limits.</p>
<p>The magnetic limit has been called ‘pre-Maxwellian’, because it’s like electromagnetism before Maxwell added the extra term that makes a changing electric field create a curl in the magnetic field.  Without this term there is no light!</p>
<p>In the electric limit you also can’t have light, because it’s missing the term that makes a changing magnetic field create a curl in the electric field.</p>
<p>In the magnetic limit you can’t have capacitors, because those store energy in the electric field, and in the magnetic limit the energy density is just <img alt="\mathbf{B} \cdot \mathbf{B}/2" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathbf%7BB%7D+%5Ccdot+%5Cmathbf%7BB%7D%2F2&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>.</p>
<p>Similarly, in the electric limit you can’t have inductors, because inductors store energy in the magnetic field, and in this limit the energy density is just <img alt="\mathbf{E} \cdot \mathbf{E}/2" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathbf%7BE%7D+%5Ccdot+%5Cmathbf%7BE%7D%2F2&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>.</p>
<p>It’s all nicely symmetrical!  But still somewhat mysterious to me. All the derivations of these limits that I’ve seen involve too many parameters for my taste, and too much talk.  But that’s how I often feel when I’m just starting to study a piece of physics.</p>
<p>Besides the two papers mentioned in my last post, I’ve been looking at this:</p>
<p>• Giovanni Manfredi, <a href="https://arxiv.org/abs/1303.5608">Non-relativistic limits of Maxwell’s equations</a>.</p>
<p>There’s a lot I haven’t explained here. I haven’t even said how the electric or magnetic fields transform under Galilean boosts in these limiting theories!   I find this subject fairly confusing, and I’d probably have to redo all the calculations to really understand them.  As Feynman said, “what I cannot create I do not understand”.</p>
<p>Someday I should dig deeper into this subject and explain how the two limits work in a way I find satisfying.  I should also draw the connections to this earlier article of mine:</p>
<p>• <a href="https://johncarlosbaez.wordpress.com/2025/01/01/magnetohydrodynamics/">Magnetohydrodynamics</a>.</p></div>
    </content>
    <updated>2026-07-19T14:42:38Z</updated>
    <published>2026-07-18T16:35:13Z</published>
    <category scheme="https://johncarlosbaez.wordpress.com" term="physics"/>
    <author>
      <name>John Baez</name>
      <uri>http://math.ucr.edu/home/baez/</uri>
    </author>
    <source>
      <id>http://johncarlosbaez.wordpress.com/feed/atom/</id>
      <link href="https://johncarlosbaez.wordpress.com" rel="alternate" type="text/html"/>
      <link href="https://johncarlosbaez.wordpress.com/feed/atom/" rel="self" type="application/atom+xml"/>
      <link href="https://johncarlosbaez.wordpress.com/osd.xml" rel="search" title="Azimuth" type="application/opensearchdescription+xml"/>
      <link href="https://s1.wp.com/opensearch.xml" rel="search" title="WordPress.com" type="application/opensearchdescription+xml"/>
      <link href="https://johncarlosbaez.wordpress.com/?pushpress=hub" rel="hub" type="text/html"/>
      <title xml:lang="en">Azimuth</title>
      <updated>2026-09-07T11:16:32Z</updated>
    </source>
  </entry>

  <entry xml:lang="en">
    <id>tag:golem.ph.utexas.edu,2026:%2Fcategory%2F3.3639</id>
    <link href="https://golem.ph.utexas.edu/category/2026/07/octonions_and_the_standard_mod_14.html" rel="alternate" type="application/xhtml+xml"/>
    <title xml:lang="en">Octonions and the Standard Model (Part 15)</title>
    <summary xml:lang="en">John Baez, Endre Bokor and Latham Boyle have a new paper which gets at the Standard Model gauge group and its representation on one generation of fermions starting from a Jordan triple that consists of pairs of bioctonions.</summary>
    <content type="xhtml" xml:lang="en"><div xmlns="http://www.w3.org/1999/xhtml"><div><a href="http://golem.ph.utexas.edu/~distler/blog/mathml.html"><img alt="MathML-enabled post (click for more details)." class="mathlogo" src="https://golem.ph.utexas.edu/~distler/blog/images/MathML.png" title="MathML-enabled post (click for details)."/></a></div>

<p><a href="https://golem.ph.utexas.edu/category/2026/06/octonions_and_the_standard_mod_13.html">Last time</a> I described a way to get the Standard Model gauge group from the exceptional Jordan algebra.  But that approach gave no obvious nice way to put quarks and leptons into the picture.  This new paper tackles that problem:</p>

<ul>
<li>John Baez, Endre Bokor and Latham Boyle, <a href="https://arxiv.org/abs/2607.10833">Jordan pair quantum theory and the Standard Model</a>.</li>
</ul>

<p><a href="https://ncatlab.org/nlab/show/Jordan+pair">Jordan pairs</a> and <a href="https://ncatlab.org/nlab/show/Jordan+triple+system">Jordan triples</a> are two closely linked formalisms that generalize Jordan algebras.  Our paper explains them in detail — and how they’re connected to geometry and quantum mechanics.   Here I will mostly skip that wonderful story, so I can quickly explain the connection to the Standard Model.</p>

<div><a href="http://golem.ph.utexas.edu/~distler/blog/mathml.html"><img alt="MathML-enabled post (click for more details)." class="mathlogo" src="https://golem.ph.utexas.edu/~distler/blog/images/MathML.png" title="MathML-enabled post (click for details)."/></a></div>

<p>Here’s how the Standard Model gauge group, together with its representation on one generation of fermions, drops out of a Jordan triple.</p>

<h3>The bi-Cayley triple</h3>

<p>Let </p>

<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><msub><mi>𝕆</mi> <mi>ℂ</mi></msub><mo>=</mo><mi>ℂ</mi><mstyle displaystyle="false"><msub><mo>⊗</mo> <mi>ℝ</mi></msub><mi>𝕆</mi></mstyle></mrow><annotation encoding="application/x-tex">\mathbb{O}_\mathbb{C} = \mathbb{C} \textstyle{\otimes}_\mathbb{R} \mathbb{O}</annotation></semantics></math> </p>

<p>be the <strong>bioctonions</strong>: octonions with complex coefficients. Write <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msubsup><mi>𝕆</mi> <mi>ℂ</mi> <mn>2</mn></msubsup></mrow><annotation encoding="application/x-tex">\mathbb{O}_\mathbb{C}^2</annotation></semantics></math> for the space of column vectors with two bioctonion entries.</p>

<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msubsup><mi>𝕆</mi> <mi>ℂ</mi> <mn>2</mn></msubsup></mrow><annotation encoding="application/x-tex">\mathbb{O}_\mathbb{C}^2</annotation></semantics></math> has a certain <b>triple product</b> </p>

<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mo stretchy="false">[</mo><mi>x</mi><mo>,</mo><mi>y</mi><mo>,</mo><mi>z</mi><mo stretchy="false">]</mo><mo>=</mo><mfrac><mn>1</mn><mn>2</mn></mfrac><mo stretchy="false">(</mo><mi>x</mi><mo stretchy="false">(</mo><msup><mi>y</mi> <mo>†</mo></msup><mi>z</mi><mo stretchy="false">)</mo><mo>+</mo><mi>z</mi><mo stretchy="false">(</mo><msup><mi>y</mi> <mo>†</mo></msup><mi>x</mi><mo stretchy="false">)</mo><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex"> [x,y,z]=\frac{1}{2}(x(y^{\dagger}z)+z(y^{\dagger}x)) </annotation></semantics></math></p>

<p>which obey the axioms of a gadget called a ‘positive hermitian Jordan triple’.   It’s called the <strong>bi-Cayley triple</strong>.</p>

<p>Now, every positive hermitian Jordan triple gives rise to a <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>ℤ</mi> <mn>2</mn></msub></mrow><annotation encoding="application/x-tex">\mathbb{Z}_2</annotation></semantics></math>-graded real Lie algebra</p>

<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mstyle mathvariant="bold"><mi>k</mi></mstyle><mo>=</mo><msub><mstyle mathvariant="bold"><mi>k</mi></mstyle> <mn>0</mn></msub><mstyle displaystyle="false"><mo>⊕</mo><msub><mstyle mathvariant="bold"><mi>k</mi></mstyle> <mn>1</mn></msub></mstyle></mrow><annotation encoding="application/x-tex">  \mathbf{k} = \mathbf{k}_0 \textstyle{\oplus} \mathbf{k}_1 </annotation></semantics></math></p>

<p>Not a Lie superalgebra: a plain old-fashioned Lie algebra with a <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>ℤ</mi> <mn>2</mn></msub></mrow><annotation encoding="application/x-tex">\mathbb{Z}_2</annotation></semantics></math>-grading!   </p>

<p>How does this work? We take the hermitian Jordan triple itself to be <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mstyle mathvariant="bold"><mi>k</mi></mstyle> <mn>1</mn></msub></mrow><annotation encoding="application/x-tex">\mathbf{k}_1</annotation></semantics></math>.  The Lie algebra <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mstyle mathvariant="bold"><mi>k</mi></mstyle> <mn>0</mn></msub></mrow><annotation encoding="application/x-tex">\mathbf{k}_0</annotation></semantics></math> consists of all linear maps from <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mstyle mathvariant="bold"><mi>k</mi></mstyle> <mn>1</mn></msub></mrow><annotation encoding="application/x-tex">\mathbf{k}_1</annotation></semantics></math> to itself that are of this form:</p>

<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mi>x</mi><mo>↦</mo><mo stretchy="false">[</mo><mi>a</mi><mo>,</mo><mi>b</mi><mo>,</mo><mi>x</mi><mo stretchy="false">]</mo><mo>−</mo><mo stretchy="false">[</mo><mi>b</mi><mo>,</mo><mi>a</mi><mo>,</mo><mi>x</mi><mo stretchy="false">]</mo></mrow><annotation encoding="application/x-tex">  x \mapsto [a,b,x] - [b,a,x] </annotation></semantics></math></p>

<p>for some <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>a</mi><mo>,</mo><mi>b</mi><mo>∈</mo><msub><mstyle mathvariant="bold"><mi>k</mi></mstyle> <mn>1</mn></msub></mrow><annotation encoding="application/x-tex">a,b \in \mathbf{k}_1</annotation></semantics></math>.  These maps are called <b>real inner derivations</b>.  They form a Lie algebra since the commutator of two such maps is another such map.  With a bit more work we can define other operations making all of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mstyle mathvariant="bold"><mi>k</mi></mstyle></mrow><annotation encoding="application/x-tex">\mathbf{k}</annotation></semantics></math> into a <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>ℤ</mi> <mn>2</mn></msub></mrow><annotation encoding="application/x-tex">\mathbb{Z}_2</annotation></semantics></math>-graded Lie algebra.</p>

<p>So, we get a big Lie algebra <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mstyle mathvariant="bold"><mi>k</mi></mstyle></mrow><annotation encoding="application/x-tex">\mathbf{k}</annotation></semantics></math>, and a Lie subalgebra <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mstyle mathvariant="bold"><mi>k</mi></mstyle> <mn>0</mn></msub></mrow><annotation encoding="application/x-tex">\mathbf{k}_0</annotation></semantics></math> sitting inside it.  From this we get two Lie groups: a big one <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>K</mi></mrow><annotation encoding="application/x-tex">K</annotation></semantics></math> whose Lie algebra is <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mstyle mathvariant="bold"><mi>k</mi></mstyle></mrow><annotation encoding="application/x-tex">\mathbf{k}</annotation></semantics></math>, and a subgroup <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>K</mi> <mn>0</mn></msub></mrow><annotation encoding="application/x-tex">K_0</annotation></semantics></math>, whose Lie algebra is <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mstyle mathvariant="bold"><mi>k</mi></mstyle> <mn>0</mn></msub></mrow><annotation encoding="application/x-tex">\mathbf{k}_0</annotation></semantics></math>.  </p>

<p>The quotient is <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>K</mi><mo stretchy="false">/</mo><msub><mi>K</mi> <mn>0</mn></msub></mrow><annotation encoding="application/x-tex">K/K_0</annotation></semantics></math> is a nice kind of manifold called a <a href="https://en.wikipedia.org/wiki/Hermitian_symmetric_space">hermitian symmetric space</a>.  Conversely, any compact hermitian symmetric space give rise to a positive hermitian Jordan triple!</p>

<p>This geometric picture is revealing.  The group <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>K</mi></mrow><annotation encoding="application/x-tex">K</annotation></semantics></math> acts transitively as symmetries of our hermitian symmetric space, while the stabilizer of any point is isomorphic to <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>K</mi> <mn>0</mn></msub></mrow><annotation encoding="application/x-tex">K_0</annotation></semantics></math>.  Our original Jordan triple, <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mstyle mathvariant="bold"><mi>k</mi></mstyle> <mn>1</mn></msub></mrow><annotation encoding="application/x-tex">\mathbf{k}_1</annotation></semantics></math>, is then the tangent space of that point.  So, <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>K</mi> <mn>0</mn></msub></mrow><annotation encoding="application/x-tex">K_0</annotation></semantics></math> acts on the Jordan triple.  This action preserves the triple product, and we call <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>K</mi> <mn>0</mn></msub></mrow><annotation encoding="application/x-tex">K_0</annotation></semantics></math> the <b>real inner automorphism group</b> of our Jordan triple.</p>

<p>Here’s another great thing about the geometric picture: hermitian symmetric spaces were classified by Eli Cartan (who seems to have spent his life classifying things).  As a result we also know the classification of positive hermitian Jordan triples.  They come in four infinite series together with two exceptions.   One is the bi-Cayley triple, and other is the <b>Albert triple</b>, which is the complexification of the exceptional Jordan algebra.   The bi-Cayley triple is a subtriple of the Albert triple.   It’s these two exceptions that are connected to the Standard Model.  But we’ll start with the bi-Cayley triple.</p>

<p>The 3-graded Lie algebra coming from the bi-Cayley triple is the compact real form of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>𝔢</mi> <mn>6</mn></msub></mrow><annotation encoding="application/x-tex">\mathfrak{e}_6</annotation></semantics></math>:</p>

<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><msub><mi>𝔢</mi> <mn>6</mn></msub><mo>=</mo><mo maxsize="1.2em" minsize="1.2em">[</mo><mi>𝔰𝔬</mi><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo><mstyle displaystyle="false"><mo>⊕</mo><mi>𝔲</mi><mo stretchy="false">(</mo><mn>1</mn><mo stretchy="false">)</mo><mo maxsize="1.2em" minsize="1.2em">]</mo><mstyle displaystyle="false"><mo>⊕</mo><msubsup><mi>𝕆</mi> <mi>ℂ</mi> <mn>2</mn></msubsup><mo>.</mo></mstyle></mstyle></mrow><annotation encoding="application/x-tex">\mathfrak{e}_6 = \big[\mathfrak{so}(10) \textstyle{\oplus} \mathfrak{u}(1)\big] \textstyle{\oplus} \mathbb{O}_\mathbb{C}^2.</annotation></semantics></math></p>

<p>The even part of this Lie algebra is in brackets.  The corresponding hermitian symmetric space is called the <b>bioctonionic plane</b> <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mo stretchy="false">(</mo><mi>ℂ</mi><mo>⊗</mo><mi>𝕆</mi><mo stretchy="false">)</mo><msup><mi>P</mi> <mn>2</mn></msup></mrow><annotation encoding="application/x-tex">(\mathbb{C}\otimes\mathbb{O})P^2</annotation></semantics></math>.   I explained it in <a href="https://golem.ph.utexas.edu/category/2025/11/the_bioctonionic_plane.html">Part 12</a>.  The even part of our 3-graded Lie algebra, <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>𝔰𝔬</mi><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo><mo>⊕</mo><mi>𝔲</mi><mo stretchy="false">(</mo><mn>1</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\mathfrak{so}(10)\oplus \mathfrak{u}(1)</annotation></semantics></math>, generates the stabilizer of a point in the bioctonionic plane.  The odd part, our friend <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msubsup><mi>𝕆</mi> <mi>ℂ</mi> <mn>2</mn></msubsup></mrow><annotation encoding="application/x-tex">\mathbb{O}_\mathbb{C}^2</annotation></semantics></math>, is the tangent space of that point.</p>

<p>Here’s the first big surprise.  The even part transforms as the adjoint representation of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi mathvariant="normal">Spin</mi><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\mathrm{Spin}(10)</annotation></semantics></math>, while the odd part itself transforms as the 16-dimensional complex spinor representation of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi mathvariant="normal">Spin</mi><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\mathrm{Spin}(10)</annotation></semantics></math>. Ignoring the extra <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi mathvariant="normal">U</mi><mo stretchy="false">(</mo><mn>1</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\mathrm{U}(1)</annotation></semantics></math> for a moment, this is exactly what we see in a <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi mathvariant="normal">SO</mi><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\mathrm{SO}(10)</annotation></semantics></math> grand unified theory: gauge bosons in the adjoint representation, and one generation of fermions in the 16-dimensional spinor representation.</p>

<p>So before we do anything, the bi-Cayley triple already smells like it contains the ingredients of an <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi mathvariant="normal">SO</mi><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\mathrm{SO}(10)</annotation></semantics></math> grand unified theory.</p>

<h3>Tripotents</h3>

<p>In a Jordan algebra the important elements are the idempotents, <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msup><mi>e</mi> <mn>2</mn></msup><mo>=</mo><mi>e</mi></mrow><annotation encoding="application/x-tex">e^2 = e</annotation></semantics></math>. In a
Jordan triple <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>W</mi></mrow><annotation encoding="application/x-tex">W</annotation></semantics></math> their role is played by <b>tripotents</b>: elements <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>e</mi></mrow><annotation encoding="application/x-tex">e</annotation></semantics></math> with</p>

<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mo stretchy="false">[</mo><mi>e</mi><mo>,</mo><mi>e</mi><mo>,</mo><mi>e</mi><mo stretchy="false">]</mo><mo>=</mo><mi>e</mi><mo>.</mo></mrow><annotation encoding="application/x-tex">[e,e,e] = e.</annotation></semantics></math></p>

<p>A tripotent always lets us split <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>W</mi></mrow><annotation encoding="application/x-tex">W</annotation></semantics></math> into three parts via something called its <b>Peirce decomposition</b>.  The operator <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>w</mi><mo>↦</mo><mo stretchy="false">[</mo><mi>e</mi><mo>,</mo><mi>e</mi><mo>,</mo><mi>w</mi><mo stretchy="false">]</mo></mrow><annotation encoding="application/x-tex">w \mapsto [e,e,w]</annotation></semantics></math> has eigenvalues <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>0</mn><mo>,</mo><mstyle displaystyle="false"><mfrac><mn>1</mn><mn>2</mn></mfrac></mstyle><mo>,</mo><mn>1</mn></mrow><annotation encoding="application/x-tex">0, \tfrac{1}{2}, 1</annotation></semantics></math>, and <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>W</mi></mrow><annotation encoding="application/x-tex">W</annotation></semantics></math> splits into the
corresponding eigenspaces</p>

<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mi>W</mi><mo>=</mo><msub><mi>W</mi> <mn>0</mn></msub><mo stretchy="false">(</mo><mi>e</mi><mo stretchy="false">)</mo><mstyle displaystyle="false"><mo>⊕</mo><msub><mi>W</mi> <mrow><mn>1</mn><mo stretchy="false">/</mo><mn>2</mn></mrow></msub><mo stretchy="false">(</mo><mi>e</mi><mo stretchy="false">)</mo><mstyle displaystyle="false"><mo>⊕</mo><msub><mi>W</mi> <mn>1</mn></msub><mo stretchy="false">(</mo><mi>e</mi><mo stretchy="false">)</mo><mo>,</mo></mstyle></mstyle></mrow><annotation encoding="application/x-tex">W = W_0(e) \textstyle{\oplus} W_{1/2}(e) \textstyle{\oplus} W_1(e),</annotation></semantics></math></p>

<p>which are called the <strong>Peirce 0-space</strong>, <strong>Peirce <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mstyle displaystyle="false"><mfrac><mn>1</mn><mn>2</mn></mfrac></mstyle></mrow><annotation encoding="application/x-tex">\tfrac{1}{2}</annotation></semantics></math>-space</strong> and <strong>Peirce 1-space</strong> of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>e</mi></mrow><annotation encoding="application/x-tex">e</annotation></semantics></math>.  A tripotent is called <b>minimal</b> when its Peirce <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>1</mn></mrow><annotation encoding="application/x-tex">1</annotation></semantics></math>-space is one-dimensional: minimal tripotents are the analogues of unit vectors in ordinary quantum theory.  Two tripotents <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>e</mi> <mn>1</mn></msub><mo>,</mo><msub><mi>e</mi> <mn>2</mn></msub></mrow><annotation encoding="application/x-tex">e_1, e_2</annotation></semantics></math> are called <b>colinear</b> when each lies in the other’s Peirce <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mstyle displaystyle="false"><mfrac><mn>1</mn><mn>2</mn></mfrac></mstyle></mrow><annotation encoding="application/x-tex">\tfrac{1}{2}</annotation></semantics></math>-space.</p>

<p>I can’t resist explaining some of the quantum physics here.  I said I wouldn’t, but I can’t help it.  In a hermitian Jordan triple, the triple product <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mo stretchy="false">[</mo><mo lspace="0.11111em" rspace="0em">−</mo><mo>,</mo><mo lspace="0.11111em" rspace="0em">−</mo><mo>,</mo><mo lspace="0.11111em" rspace="0em">−</mo><mo stretchy="false">]</mo></mrow><annotation encoding="application/x-tex">[-,-,-]</annotation></semantics></math> is linear in the first and last slot, but conjugate-linear in the middle slot.  So, if you multiply a tripotent by a phase <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>α</mi></mrow><annotation encoding="application/x-tex">\alpha</annotation></semantics></math>, you get a new tripotent:</p>

<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mo stretchy="false">[</mo><mi>α</mi><mi>e</mi><mo>,</mo><mi>α</mi><mi>e</mi><mo>,</mo><mi>α</mi><mi>e</mi><mo stretchy="false">]</mo><mo>=</mo><mi>α</mi><mover><mi>α</mi><mo>¯</mo></mover><mi>α</mi><mi>e</mi><mo>=</mo><mi>α</mi><mi>e</mi></mrow><annotation encoding="application/x-tex"> [\alpha e, \alpha e, \alpha e] = \alpha \overline{\alpha} \alpha e = \alpha e</annotation></semantics></math></p>

<p>This should remind you of how when you multiply a unit vector in a Hilbert space by a phase, you get a new unit vector.  In Jordan triple quantum mechanics, minimal tripotents take the place of these unit vectors.  And guess what: the hermitian symmetric space <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>K</mi><mo stretchy="false">/</mo><msub><mi>K</mi> <mn>0</mn></msub></mrow><annotation encoding="application/x-tex">K/K_0</annotation></semantics></math> that I was talking about earlier is also the space of minimal tripotents mod phase!  So, it generalizes the familiar space of ‘pure states’ in quantum mechanics, which are unit vectors mod phase.</p>

<p>But let’s get back to the Standard Model.</p>

<h3>A chain of Jordan triples</h3>

<p>From here on, the single fact driving everything is this: in any hermitian Jordan triple, any minimal tripotent’s Peirce <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mstyle displaystyle="false"><mfrac><mn>1</mn><mn>2</mn></mfrac></mstyle></mrow><annotation encoding="application/x-tex">\tfrac{1}{2}</annotation></semantics></math>-space is itself a hermitian Jordan triple! </p>

<p>If we run this starting from the bi-Cayley triple, we get this chain of hermitian Jordan triples, where each row’s <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mstyle displaystyle="false"><mfrac><mn>1</mn><mn>2</mn></mfrac></mstyle></mrow><annotation encoding="application/x-tex">\tfrac{1}{2}</annotation></semantics></math>-space is the next row’s triple:</p>

<table border="1" cellpadding="6" cellspacing="0">
<tbody><tr>
 <th align="left">Jordan triple</th>
 <th align="left">Lie algebra <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mstyle mathvariant="bold"><mi>k</mi></mstyle> <mn>0</mn></msub><mo>⊕</mo><msub><mstyle mathvariant="bold"><mi>k</mi></mstyle> <mn>1</mn></msub></mrow><annotation encoding="application/x-tex">\mathbf{k}_0 \oplus \mathbf{k}_1</annotation></semantics></math> (even part in brackets)</th>
 <th align="left">real inner automorphism group</th>
</tr>
<tr>
 <td><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>W</mi><mo>=</mo><msubsup><mi>𝕆</mi> <mi>ℂ</mi> <mn>2</mn></msubsup></mrow><annotation encoding="application/x-tex">W = \mathbb{O}_\mathbb{C}^2</annotation></semantics></math></td>
 <td><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>𝔢</mi> <mn>6</mn></msub><mo>=</mo><mo stretchy="false">[</mo><mi>𝔰𝔬</mi><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo><mo>⊕</mo><mi>𝔲</mi><mo stretchy="false">(</mo><mn>1</mn><mo stretchy="false">)</mo><mo stretchy="false">]</mo><mo>⊕</mo><msubsup><mi>𝕆</mi> <mi>ℂ</mi> <mn>2</mn></msubsup></mrow><annotation encoding="application/x-tex">\mathfrak{e}_6 = [\mathfrak{so}(10) \oplus \mathfrak{u}(1)] \oplus \mathbb{O}_\mathbb{C}^2</annotation></semantics></math></td>
 <td><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mo stretchy="false">(</mo><mi mathvariant="normal">Spin</mi><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo><mo>×</mo><mi mathvariant="normal">U</mi><mo stretchy="false">(</mo><mn>1</mn><mo stretchy="false">)</mo><mo stretchy="false">)</mo><mo stretchy="false">/</mo><msub><mi>ℤ</mi> <mn>4</mn></msub></mrow><annotation encoding="application/x-tex">(\mathrm{Spin}(10) \times \mathrm{U}(1)) / \mathbb{Z}_4</annotation></semantics></math></td>
</tr>
<tr>
 <td><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>W</mi><mo>′</mo><mo>=</mo><msub><mi>𝔞</mi> <mn>5</mn></msub><mo stretchy="false">(</mo><mi>ℂ</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">W' = \mathfrak{a}_5(\mathbb{C})</annotation></semantics></math></td>
 <td><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>𝔰𝔬</mi><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo><mo>=</mo><mo stretchy="false">[</mo><mi>𝔰𝔲</mi><mo stretchy="false">(</mo><mn>5</mn><mo stretchy="false">)</mo><mo>⊕</mo><mi>𝔲</mi><mo stretchy="false">(</mo><mn>1</mn><mo stretchy="false">)</mo><mo stretchy="false">]</mo><mo>⊕</mo><msub><mi>𝔞</mi> <mn>5</mn></msub><mo stretchy="false">(</mo><mi>ℂ</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\mathfrak{so}(10) = [\mathfrak{su}(5) \oplus \mathfrak{u}(1)] \oplus \mathfrak{a}_5(\mathbb{C})</annotation></semantics></math></td>
 <td><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi mathvariant="normal">SU</mi><mo stretchy="false">(</mo><mn>5</mn><mo stretchy="false">)</mo><mo>×</mo><mi mathvariant="normal">U</mi><mo stretchy="false">(</mo><mn>1</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\mathrm{SU}(5) \times \mathrm{U}(1)</annotation></semantics></math></td>
</tr>
<tr>
 <td><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>W</mi><mo>″</mo><mo>=</mo><msub><mi mathvariant="normal">M</mi> <mrow><mn>3</mn><mo>,</mo><mn>2</mn></mrow></msub><mo stretchy="false">(</mo><mi>ℂ</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">W'' = \mathrm{M}_{3,2}(\mathbb{C})</annotation></semantics></math></td>
 <td><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>𝔰𝔲</mi><mo stretchy="false">(</mo><mn>5</mn><mo stretchy="false">)</mo><mo>=</mo><mo stretchy="false">[</mo><msub><mi>𝔤</mi> <mi mathvariant="normal">SM</mi></msub><mo stretchy="false">]</mo><mo>⊕</mo><msub><mi mathvariant="normal">M</mi> <mrow><mn>3</mn><mo>,</mo><mn>2</mn></mrow></msub><mo stretchy="false">(</mo><mi>ℂ</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\mathfrak{su}(5) = [\mathfrak{g}_{\mathrm{SM}}] \oplus \mathrm{M}_{3,2}(\mathbb{C})</annotation></semantics></math></td>
 <td><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>G</mi> <mi mathvariant="normal">SM</mi></msub></mrow><annotation encoding="application/x-tex">G_{\mathrm{SM}}</annotation></semantics></math></td>
</tr>
</tbody></table>

<p>Here <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>𝔞</mi> <mn>5</mn></msub><mo stretchy="false">(</mo><mi>ℂ</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\mathfrak{a}_5(\mathbb{C})</annotation></semantics></math> is the Jordan triple of antisymmetric <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>5</mn><mo>×</mo><mn>5</mn></mrow><annotation encoding="application/x-tex">5\times 5</annotation></semantics></math> complex matrices, <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi mathvariant="normal">M</mi> <mrow><mn>3</mn><mo>,</mo><mn>2</mn></mrow></msub><mo stretchy="false">(</mo><mi>ℂ</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\mathrm{M}_{3,2}(\mathbb{C})</annotation></semantics></math> is the Jordan triple of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>3</mn><mo>×</mo><mn>2</mn></mrow><annotation encoding="application/x-tex">3\times 2</annotation></semantics></math> complex matrices, <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>𝔤</mi> <mi mathvariant="normal">SM</mi></msub><mo>=</mo><mi>𝔰𝔲</mi><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo><mo>⊕</mo><mi>𝔰𝔲</mi><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>⊕</mo><mi>𝔲</mi><mo stretchy="false">(</mo><mn>1</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\mathfrak{g}_{\mathrm{SM}} = \mathfrak{su}(3)\oplus\mathfrak{su}(2)\oplus \mathfrak{u}(1)</annotation></semantics></math>, and</p>

<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><msub><mi>G</mi> <mi mathvariant="normal">SM</mi></msub><mo>=</mo><mi mathvariant="normal">S</mi><mo stretchy="false">(</mo><mi mathvariant="normal">U</mi><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mi mathvariant="normal">U</mi><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo><mo stretchy="false">)</mo><mo>≅</mo><mo stretchy="false">(</mo><mi mathvariant="normal">SU</mi><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo><mo>×</mo><mi mathvariant="normal">SU</mi><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mi mathvariant="normal">U</mi><mo stretchy="false">(</mo><mn>1</mn><mo stretchy="false">)</mo><mo stretchy="false">)</mo><mo stretchy="false">/</mo><msub><mi>ℤ</mi> <mn>6</mn></msub></mrow><annotation encoding="application/x-tex">G_{\mathrm{SM}} = \mathrm{S}(\mathrm{U}(2) \times \mathrm{U}(3)) \cong (\mathrm{SU}(3)\times\mathrm{SU}(2)\times\mathrm{U}(1))/\mathbb{Z}_6</annotation></semantics></math></p>

<p>is the true Standard Model gauge group.</p>

<h3>The gauge group from two tripotents</h3>

<p>Now pick two colinear minimal tripotents <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>e</mi> <mn>1</mn></msub><mo>,</mo><msub><mi>e</mi> <mn>2</mn></msub><mo>∈</mo><mi>W</mi></mrow><annotation encoding="application/x-tex">e_1, e_2 \in W</annotation></semantics></math>. Descend the table
twice:</p>

<ul>
<li>Start with <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>W</mi><mo>=</mo><msubsup><mi>𝕆</mi> <mi>ℂ</mi> <mn>2</mn></msubsup></mrow><annotation encoding="application/x-tex">W = \mathbb{O}_\mathbb{C}^2</annotation></semantics></math>, which has real inner automorphism group <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mo stretchy="false">(</mo><mi mathvariant="normal">Spin</mi><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo><mo>×</mo><mi mathvariant="normal">U</mi><mo stretchy="false">(</mo><mn>1</mn><mo stretchy="false">)</mo><mo stretchy="false">)</mo><mo stretchy="false">/</mo><msub><mi>ℤ</mi> <mn>4</mn></msub></mrow><annotation encoding="application/x-tex">(\mathrm{Spin}(10)\times\mathrm{U}(1))/\mathbb{Z}_4</annotation></semantics></math>.</li>
<li>Fix <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>e</mi> <mn>1</mn></msub></mrow><annotation encoding="application/x-tex">e_1</annotation></semantics></math>. Its Peirce <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mstyle displaystyle="false"><mfrac><mn>1</mn><mn>2</mn></mfrac></mstyle></mrow><annotation encoding="application/x-tex">\tfrac{1}{2}</annotation></semantics></math>-space is <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>W</mi><mo>′</mo><mo>=</mo><msub><mi>𝔞</mi> <mn>5</mn></msub><mo stretchy="false">(</mo><mi>ℂ</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">W' = \mathfrak{a}_5(\mathbb{C})</annotation></semantics></math>, with real inner automorphism group <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi mathvariant="normal">SU</mi><mo stretchy="false">(</mo><mn>5</mn><mo stretchy="false">)</mo><mo>×</mo><mi mathvariant="normal">U</mi><mo stretchy="false">(</mo><mn>1</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\mathrm{SU}(5)\times\mathrm{U}(1)</annotation></semantics></math>.</li>
<li>Fix <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>e</mi> <mn>2</mn></msub></mrow><annotation encoding="application/x-tex">e_2</annotation></semantics></math> (colinear with <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>e</mi> <mn>1</mn></msub></mrow><annotation encoding="application/x-tex">e_1</annotation></semantics></math>, so living in <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>W</mi><mo>′</mo></mrow><annotation encoding="application/x-tex">W'</annotation></semantics></math>). Its Peirce <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mstyle displaystyle="false"><mfrac><mn>1</mn><mn>2</mn></mfrac></mstyle></mrow><annotation encoding="application/x-tex">\tfrac{1}{2}</annotation></semantics></math>-space in <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>W</mi><mo>′</mo></mrow><annotation encoding="application/x-tex">W'</annotation></semantics></math> is <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>W</mi><mo>″</mo><mo>=</mo><msub><mi mathvariant="normal">M</mi> <mrow><mn>3</mn><mo>,</mo><mn>2</mn></mrow></msub><mo stretchy="false">(</mo><mi>ℂ</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">W'' = \mathrm{M}_{3,2}(\mathbb{C})</annotation></semantics></math>, with real inner automorphism group exactly  <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>G</mi> <mi mathvariant="normal">SM</mi></msub></mrow><annotation encoding="application/x-tex">G_{\mathrm{SM}}</annotation></semantics></math>.</li>
</ul>

<p>In other words, the subspace of the bi-Cayley triple colinear with both <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>e</mi> <mn>1</mn></msub></mrow><annotation encoding="application/x-tex">e_1</annotation></semantics></math> and <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>e</mi> <mn>2</mn></msub></mrow><annotation encoding="application/x-tex">e_2</annotation></semantics></math> is a Jordan triple whose real inner automorphism group is the Standard Model gauge group.</p>

<p>The choice of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>e</mi> <mn>1</mn></msub></mrow><annotation encoding="application/x-tex">e_1</annotation></semantics></math> and <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>e</mi> <mn>2</mn></msub></mrow><annotation encoding="application/x-tex">e_2</annotation></semantics></math> also pins down <em>how</em> <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>G</mi> <mi mathvariant="normal">SM</mi></msub></mrow><annotation encoding="application/x-tex">G_{\mathrm{SM}}</annotation></semantics></math> sits inside the original group <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi mathvariant="normal">E</mi> <mn>6</mn></msub></mrow><annotation encoding="application/x-tex">\mathrm{E}_6</annotation></semantics></math>.  At each we step take the subgroup that acts with determinant <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>1</mn></mrow><annotation encoding="application/x-tex">1</annotation></semantics></math> and preserves the chosen tripotent up to a phase; this gives a chain of subgroups whose members are <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi mathvariant="normal">Spin</mi><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\mathrm{Spin}(10)</annotation></semantics></math>,
<math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi mathvariant="normal">U</mi><mo stretchy="false">(</mo><mn>5</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\mathrm{U}(5)</annotation></semantics></math>, and <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>G</mi> <mi mathvariant="normal">SM</mi></msub></mrow><annotation encoding="application/x-tex">G_{\mathrm{SM}}</annotation></semantics></math>, so we get the embedding</p>

<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><msub><mi>G</mi> <mi mathvariant="normal">SM</mi></msub><mo>⊂</mo><mi mathvariant="normal">SU</mi><mo stretchy="false">(</mo><mn>5</mn><mo stretchy="false">)</mo><mo>⊂</mo><mi mathvariant="normal">Spin</mi><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo><mo>.</mo></mrow><annotation encoding="application/x-tex"> G_{\mathrm{SM}} \subset \mathrm{SU}(5) \subset \mathrm{Spin}(10).</annotation></semantics></math></p>

<p>In particle physics, this is the classic chain taking us from the so-called <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi mathvariant="normal">SO</mi><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\mathrm{SO}(10)</annotation></semantics></math> grand unified theory down to the <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi mathvariant="normal">SU</mi><mo stretchy="false">(</mo><mn>5</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\mathrm{SU}(5)</annotation></semantics></math> grand unified theory down to the Standard Model.  And it’s well known that restricting the 16-dimensional complex spinor representation of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi mathvariant="normal">Spin</mi><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\mathrm{Spin}(10)</annotation></semantics></math> along this chain gives precisely the Standard Model representation <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>ρ</mi> <mi mathvariant="normal">SM</mi></msub></mrow><annotation encoding="application/x-tex">\rho_{\mathrm{SM}}</annotation></semantics></math> on one generation of fermions!   So we get one generation of Standard Model fermions this way.</p>

<h3>The six particles types as Peirce spaces</h3>

<p>We have gotten the representation of the Standard Model gauge group on one generation of fermions without any fuss.  But it’s also fun to peer into the details, and see how the different kinds of fermions emerge.  We can get them using the fact that for any tripotent <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>e</mi></mrow><annotation encoding="application/x-tex">e</annotation></semantics></math>, we have projections  <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>P</mi> <mn>0</mn></msub><mo stretchy="false">(</mo><mi>e</mi><mo stretchy="false">)</mo><mo>,</mo><msub><mi>P</mi> <mrow><mn>1</mn><mo stretchy="false">/</mo><mn>2</mn></mrow></msub><mo stretchy="false">(</mo><mi>e</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">P_0(e), P_{1/2}(e)</annotation></semantics></math> and <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>P</mi> <mn>1</mn></msub><mo stretchy="false">(</mo><mi>e</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">P_1(e)</annotation></semantics></math> onto its three eigenspaces: its so-called <b>Peirce projectors</b>.   </p>

<p>Since we get the Standard Model gauge group and its representation on fermions from <em>two</em> minimal tripotents <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>e</mi> <mn>1</mn></msub></mrow><annotation encoding="application/x-tex">e_1</annotation></semantics></math> and <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>e</mi> <mn>2</mn></msub></mrow><annotation encoding="application/x-tex">e_2</annotation></semantics></math>, we have nine Peirce projectors we can apply to our Jordan triple <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msubsup><mi>𝕆</mi> <mi>ℂ</mi> <mn>2</mn></msubsup></mrow><annotation encoding="application/x-tex">\mathbb{O}_{\mathbb{C}}^2</annotation></semantics></math>.   Let’s use these to pick out various kinds of particles!</p>

<p>As a representation of the Standard Model Lie algebra</p>

<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><msub><mi>𝔤</mi> <mi mathvariant="normal">SM</mi></msub><mo>=</mo><mi>𝔰𝔲</mi><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo><mstyle displaystyle="false"><mo>⊕</mo><mi>𝔰𝔲</mi><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mstyle displaystyle="false"><mo>⊕</mo><mi>𝔲</mi><mo stretchy="false">(</mo><mn>1</mn><mo stretchy="false">)</mo><mo>,</mo></mstyle></mstyle></mrow><annotation encoding="application/x-tex">\mathfrak{g}_{\mathrm{SM}} = \mathfrak{su}(3) \textstyle{\oplus} \mathfrak{su}(2) \textstyle{\oplus} \mathfrak{u}(1) ,</annotation></semantics></math></p>

<p>any generation of Standard Model fermions transforms as the direct sum of six irreducible representations:</p>

<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><msub><mi>ρ</mi> <mi mathvariant="normal">SM</mi></msub><mo>=</mo><mo stretchy="false">(</mo><mn>3</mn><mo>,</mo><mn>2</mn><mo>,</mo><mstyle displaystyle="false"><mfrac><mn>1</mn><mn>6</mn></mfrac></mstyle><mo stretchy="false">)</mo><mstyle displaystyle="false"><mo>⊕</mo><mo stretchy="false">(</mo><mover><mn>3</mn><mo stretchy="false">¯</mo></mover><mo>,</mo><mn>1</mn><mo>,</mo><mstyle displaystyle="false"><mfrac><mn>1</mn><mn>3</mn></mfrac></mstyle><mo stretchy="false">)</mo><mstyle displaystyle="false"><mo>⊕</mo><mo stretchy="false">(</mo><mover><mn>3</mn><mo stretchy="false">¯</mo></mover><mo>,</mo><mn>1</mn><mo>,</mo><mo lspace="0.11111em" rspace="0em">−</mo><mstyle displaystyle="false"><mfrac><mn>2</mn><mn>3</mn></mfrac></mstyle><mo stretchy="false">)</mo><mstyle displaystyle="false"><mo>⊕</mo><mo stretchy="false">(</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mo lspace="0.11111em" rspace="0em">−</mo><mstyle displaystyle="false"><mfrac><mn>1</mn><mn>2</mn></mfrac></mstyle><mo stretchy="false">)</mo><mstyle displaystyle="false"><mo>⊕</mo><mo stretchy="false">(</mo><mn>1</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>1</mn><mo stretchy="false">)</mo><mstyle displaystyle="false"><mo>⊕</mo><mo stretchy="false">(</mo><mn>1</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>0</mn><mo stretchy="false">)</mo><mo>,</mo></mstyle></mstyle></mstyle></mstyle></mstyle></mrow><annotation encoding="application/x-tex">\rho_{\mathrm{SM}} = (3,2,\tfrac{1}{6}) \textstyle{\oplus} (\bar 3,1,\tfrac{1}{3}) \textstyle{\oplus} (\bar 3,1,-\tfrac{2}{3}) \textstyle{\oplus} (1,2,-\tfrac{1}{2}) \textstyle{\oplus} (1,1,1) \textstyle{\oplus} (1,1,0),</annotation></semantics></math></p>

<p>These correspond to the six types of left-handed fermion: <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>q</mi> <mi>L</mi></msub><mo>,</mo><mover><mrow><msub><mi>d</mi> <mi>R</mi></msub></mrow><mo>¯</mo></mover><mo>,</mo><mover><mrow><msub><mi>u</mi> <mi>R</mi></msub></mrow><mo>¯</mo></mover><mo>,</mo><msub><mi>ℓ</mi> <mi>L</mi></msub><mo>,</mo><mover><mrow><msub><mi>e</mi> <mi>R</mi></msub></mrow><mo>¯</mo></mover><mo>,</mo><mover><mrow><msub><mi>ν</mi> <mi>R</mi></msub></mrow><mo>¯</mo></mover></mrow><annotation encoding="application/x-tex">q_L, \overline{d_R}, \overline{u_R}, \ell_L, \overline{e_R}, \overline{\nu_R}</annotation></semantics></math>.   Six irreducible pieces, six particle types.  </p>

<p>It turns out these are exactly the six nonzero components of the Peirce decomposition of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msubsup><mi>𝕆</mi> <mi>ℂ</mi> <mn>2</mn></msubsup></mrow><annotation encoding="application/x-tex">\mathbb{O}_\mathbb{C}^2</annotation></semantics></math> with respect to both <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>e</mi> <mn>1</mn></msub></mrow><annotation encoding="application/x-tex">e_1</annotation></semantics></math> and <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>e</mi> <mn>2</mn></msub></mrow><annotation encoding="application/x-tex">e_2</annotation></semantics></math>.  Those six match up one-to-one with the particle types:</p>

<table border="1" cellpadding="6" cellspacing="0">
<tbody><tr>
  <th align="left">Peirce projector</th>
  <th align="left">representation of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>G</mi> <mtext>SM</mtext></msub></mrow><annotation encoding="application/x-tex">G_{\text{SM}}</annotation></semantics></math> </th>
  <th align="left">particle type</th>
</tr>
<tr>
  <td><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>P</mi> <mrow><mn>1</mn><mo stretchy="false">/</mo><mn>2</mn></mrow></msub><mo stretchy="false">(</mo><msub><mi>e</mi> <mn>2</mn></msub><mo stretchy="false">)</mo><msub><mi>P</mi> <mrow><mn>1</mn><mo stretchy="false">/</mo><mn>2</mn></mrow></msub><mo stretchy="false">(</mo><msub><mi>e</mi> <mn>1</mn></msub><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">P_{1/2}(e_2) P_{1/2}(e_1)</annotation></semantics></math></td>
  <td>(3, 2, +1/6)</td>
  <td><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>q</mi> <mi>L</mi></msub></mrow><annotation encoding="application/x-tex">q_L</annotation></semantics></math></td>
</tr>
<tr>
  <td><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>P</mi> <mrow><mn>1</mn><mo stretchy="false">/</mo><mn>2</mn></mrow></msub><mo stretchy="false">(</mo><msub><mi>e</mi> <mn>2</mn></msub><mo stretchy="false">)</mo><msub><mi>P</mi> <mn>0</mn></msub><mo stretchy="false">(</mo><msub><mi>e</mi> <mn>1</mn></msub><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">P_{1/2}(e_2) P_0(e_1)</annotation></semantics></math></td>
  <td>(<math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mover><mn>3</mn><mo>¯</mo></mover></mrow><annotation encoding="application/x-tex">\overline{3}</annotation></semantics></math>, 1, +1/3)</td>
  <td><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mover><mrow><msub><mi>d</mi> <mi>R</mi></msub></mrow><mo>¯</mo></mover></mrow><annotation encoding="application/x-tex">\overline{d_R}</annotation></semantics></math></td>
</tr>
<tr>
  <td><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>P</mi> <mn>0</mn></msub><mo stretchy="false">(</mo><msub><mi>e</mi> <mn>2</mn></msub><mo stretchy="false">)</mo><msub><mi>P</mi> <mrow><mn>1</mn><mo stretchy="false">/</mo><mn>2</mn></mrow></msub><mo stretchy="false">(</mo><msub><mi>e</mi> <mn>1</mn></msub><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">P_0(e_2) P_{1/2}(e_1)</annotation></semantics></math> </td>
  <td>(<math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mover><mn>3</mn><mo>¯</mo></mover></mrow><annotation encoding="application/x-tex">\overline{3}</annotation></semantics></math>, 1, −2/3)</td>
  <td><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mover><mrow><msub><mi>u</mi> <mi>R</mi></msub></mrow><mo>¯</mo></mover></mrow><annotation encoding="application/x-tex">\overline{u_R}</annotation></semantics></math></td>
</tr>
<tr>
  <td> <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>P</mi> <mn>0</mn></msub><mo stretchy="false">(</mo><msub><mi>e</mi> <mn>2</mn></msub><mo stretchy="false">)</mo><msub><mi>P</mi> <mn>0</mn></msub><mo stretchy="false">(</mo><msub><mi>e</mi> <mn>1</mn></msub><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">P_0(e_2) P_0(e_1)</annotation></semantics></math> </td>
  <td>(1, 2, −1/2)</td>
  <td><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>ℓ</mi> <mi>L</mi></msub></mrow><annotation encoding="application/x-tex">\ell_L</annotation></semantics></math></td>
</tr>
<tr>
  <td><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>P</mi> <mn>1</mn></msub><mo stretchy="false">(</mo><msub><mi>e</mi> <mn>2</mn></msub><mo stretchy="false">)</mo><msub><mi>P</mi> <mrow><mn>1</mn><mo stretchy="false">/</mo><mn>2</mn></mrow></msub><mo stretchy="false">(</mo><msub><mi>e</mi> <mn>1</mn></msub><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">P_1(e_2) P_{1/2}(e_1)</annotation></semantics></math></td>
  <td>(1, 1, +1)</td>
  <td><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mover><mrow><msub><mi>e</mi> <mi>R</mi></msub></mrow><mo>¯</mo></mover></mrow><annotation encoding="application/x-tex">\overline{e_R}</annotation></semantics></math></td>
</tr>
<tr>
  <td><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>P</mi> <mrow><mn>1</mn><mo stretchy="false">/</mo><mn>2</mn></mrow></msub><mo stretchy="false">(</mo><msub><mi>e</mi> <mn>2</mn></msub><mo stretchy="false">)</mo><msub><mi>P</mi> <mn>1</mn></msub><mo stretchy="false">(</mo><msub><mi>e</mi> <mn>1</mn></msub><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">P_{1/2}(e_2) P_1(e_1)</annotation></semantics></math></td>
  <td>(1, 1, 0)</td>
  <td><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mover><mrow><msub><mi>ν</mi> <mi>R</mi></msub></mrow><mo>¯</mo></mover></mrow><annotation encoding="application/x-tex">\overline{\nu_R}</annotation></semantics></math></td>
</tr>
</tbody></table>

<p>The remaining three combinations — <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>P</mi> <mn>1</mn></msub><mo stretchy="false">(</mo><msub><mi>e</mi> <mn>2</mn></msub><mo stretchy="false">)</mo><msub><mi>P</mi> <mn>1</mn></msub><mo stretchy="false">(</mo><msub><mi>e</mi> <mn>1</mn></msub><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">P_1(e_2)P_1(e_1)</annotation></semantics></math>, <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>P</mi> <mn>1</mn></msub><mo stretchy="false">(</mo><msub><mi>e</mi> <mn>2</mn></msub><mo stretchy="false">)</mo><msub><mi>P</mi> <mn>0</mn></msub><mo stretchy="false">(</mo><msub><mi>e</mi> <mn>1</mn></msub><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">P_1(e_2)P_0(e_1)</annotation></semantics></math>, and <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>P</mi> <mn>0</mn></msub><mo stretchy="false">(</mo><msub><mi>e</mi> <mn>2</mn></msub><mo stretchy="false">)</mo><msub><mi>P</mi> <mn>1</mn></msub><mo stretchy="false">(</mo><msub><mi>e</mi> <mn>1</mn></msub><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">P_0(e_2)P_1(e_1)</annotation></semantics></math> — all vanish, which is why we land on six pieces and not nine.</p>

<p>So the whole package — the gauge group <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>G</mi> <mi mathvariant="normal">SM</mi></msub></mrow><annotation encoding="application/x-tex">G_{\mathrm{SM}}</annotation></semantics></math>, the embedding
<math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>G</mi> <mi mathvariant="normal">SM</mi></msub><mo>⊂</mo><mi mathvariant="normal">Spin</mi><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">G_{\mathrm{SM}} \subset \mathrm{Spin}(10)</annotation></semantics></math>, the representation
<math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>ρ</mi> <mi mathvariant="normal">SM</mi></msub></mrow><annotation encoding="application/x-tex">\rho_{\mathrm{SM}}</annotation></semantics></math>, and even the split of one generation into its six particle
multiplets as <em>distinct Peirce components</em> — all comes out of the single object
<math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msubsup><mi>𝕆</mi> <mi>ℂ</mi> <mn>2</mn></msubsup></mrow><annotation encoding="application/x-tex">\mathbb{O}_\mathbb{C}^2</annotation></semantics></math> once you choose two colinear minimal tripotents. </p>

<p>And if you prefer to start one level up, with the Albert triple
<math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>𝔥</mi> <mn>3</mn></msub><mo stretchy="false">(</mo><mi>𝕆</mi><mo stretchy="false">)</mo><mo>⊗</mo><mi>ℂ</mi></mrow><annotation encoding="application/x-tex">\mathfrak{h}_3(\mathbb{O}) \otimes \mathbb{C}</annotation></semantics></math>, you get the same result by choosing <em>three</em> mutually colinear tripotents instead of two — but for that, read our paper!</p></div>
    </content>
    <updated>2026-07-19T14:03:13Z</updated>
    <published>2026-07-18T17:56:16Z</published>
    <category term="Particle Physics"/>
    <author>
      <name>john</name>
      <email>baez@math.ucr.edu</email>
      <uri>http://math.ucr.edu/home/baez/</uri>
    </author>
    <source>
      <id>tag:golem.ph.utexas.edu,2006:nCategoryCafe/3</id>
      <icon>https://golem.ph.utexas.edu/category/images/favicon.ico</icon>
      <link href="https://golem.ph.utexas.edu/category/" rel="alternate" type="application/xhtml+xml"/>
      <link href="https://golem.ph.utexas.edu/category/atom10.xml" rel="self" type="application/atom+xml"/>
      <link href="https://golem.ph.utexas.edu/category/comments.atom" rel="replies" type="application/atom+xml"/>
      <rights xml:lang="en">Copyright (c) 2026, The n-Category Collective</rights>
      <subtitle xml:lang="en">A group blog on math, physics and philosophy</subtitle>
      <title xml:lang="en">The n-Category Café</title>
      <updated>2026-09-01T10:19:27Z</updated>
    </source>
  </entry>

  <entry xml:lang="en">
    <id>tag:golem.ph.utexas.edu,2025:%2Fcategory%2F3.3627</id>
    <link href="https://golem.ph.utexas.edu/category/2025/12/octonions_and_the_standard_mod_11.html" rel="alternate" type="application/xhtml+xml"/>
    <title xml:lang="en">Octonions and the Standard Model (Part 13)</title>
    <summary xml:lang="en">There are two ways to stick SU(2) × SU(3) in Spin(10).   One is good for physics; the other, alas, is easily obtained using the octonions.</summary>
    <content type="xhtml" xml:lang="en"><div xmlns="http://www.w3.org/1999/xhtml"><div><a href="http://golem.ph.utexas.edu/~distler/blog/mathml.html"><img alt="MathML-enabled post (click for more details)." class="mathlogo" src="https://golem.ph.utexas.edu/~distler/blog/images/MathML.png" title="MathML-enabled post (click for details)."/></a></div>

<p>When Lee and Yang suggested that the laws of physics might not be invariant under spatial reflection — that there’s a fundamental difference between left and right — Pauli was skeptical. In a letter to Victor Weisskopf in January 1957, he wrote:</p>

<blockquote>
  <p>“Ich glaube aber nicht, daß der Herrgott ein schwacher Linkshänder ist.”</p>

<p>(I do not believe that the Lord is a weak left-hander.)</p>
</blockquote>

<p>But just two days after Pauli wrote this letter, Chien-Shiung Wu’s experiment confirmed that Lee and Yang were correct.   There’s an inherent asymmetry in nature.   </p>

<p>We can trace this back to how the ‘left-handed’ fermions and antifermions live in a different representation of the Standard Model gauge group than the right-handed ones.   And when we try to build grand unified theories that take this into account, we run into the fact that while we can fit the Standard Model gauge group into <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{Spin}(10)</annotation></semantics></math> in various ways, not all these ways produce the required asymmetry.   There’s a way where it fits into <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>9</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{Spin}(9)</annotation></semantics></math>, which is too symmetrical to work… and alas, <i>this</i> one has a nice octonionic description!</p>

<div><a href="http://golem.ph.utexas.edu/~distler/blog/mathml.html"><img alt="MathML-enabled post (click for more details)." class="mathlogo" src="https://golem.ph.utexas.edu/~distler/blog/images/MathML.png" title="MathML-enabled post (click for details)."/></a></div>

<p>To keep things simple I’ll explain this by focusing, not on the whole Standard Model gauge group, but its subgroup <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(2) \times \text{SU}(3)</annotation></semantics></math>.   Here is a theorem proved by <a href="https://mathoverflow.net/a/504717/2893">Will Sawin</a> in response to a question of mine on MathOverflow:</p>

<p><b>Theorem 10.</b>  There are exactly two conjugacy classes of subgroups of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{Spin}(10)</annotation></semantics></math> that are isomorphic to <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(2) \times \text{SU}(3)</annotation></semantics></math>.   One of them has a representative that is a subgroup of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>9</mn><mo stretchy="false">)</mo><mo>⊂</mo><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{Spin}(9) \subset \text{Spin}(10)</annotation></semantics></math>, while the other does not.</p>

<p>I’ll describe representatives of these two subgroups; then I’ll say a bit about how they show up in physics, and then I’ll show you Sawin’s proof.</p>

<p>We can get both subgroups in a unified way!  There’s always an inclusion</p>

<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mtext>SO</mtext><mo stretchy="false">(</mo><mi>m</mi><mo stretchy="false">)</mo><mo>×</mo><mtext>SO</mtext><mo stretchy="false">(</mo><mi>n</mi><mo stretchy="false">)</mo><mo>→</mo><mtext>SO</mtext><mo stretchy="false">(</mo><mi>m</mi><mo>+</mo><mi>n</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex"> \text{SO}(m) \times \text{SO}(n) \to \text{SO}(m+n) </annotation></semantics></math></p>

<p>and taking double covers of each group we get a 2-1 homomorphism</p>

<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mtext>Spin</mtext><mo stretchy="false">(</mo><mi>m</mi><mo stretchy="false">)</mo><mo>×</mo><mtext>Spin</mtext><mo stretchy="false">(</mo><mi>n</mi><mo stretchy="false">)</mo><mo>→</mo><mtext>Spin</mtext><mo stretchy="false">(</mo><mi>m</mi><mo>+</mo><mi>n</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex"> \text{Spin}(m) \times \text{Spin}(n) \to \text{Spin}(m+n) </annotation></semantics></math></p>

<p>In particular we have</p>

<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>4</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>6</mn><mo stretchy="false">)</mo><mo>→</mo><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex"> \text{Spin}(4) \times \text{Spin}(6) \to \text{Spin}(10) </annotation></semantics></math></p>

<p>so composing with the exceptional isomorphisms:</p>

<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>4</mn><mo stretchy="false">)</mo><mo>≅</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>,</mo><mspace width="2em"/><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>6</mn><mo stretchy="false">)</mo><mo>≅</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>4</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex"> \text{Spin}(4) \cong \text{SU}(2) \times \text{SU}(2), \qquad \text{Spin}(6) \cong \text{SU}(4)</annotation></semantics></math></p>

<p>we get a 2-1 homomorphism</p>

<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mi>k</mi><mo lspace="0.11111em">:</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>4</mn><mo stretchy="false">)</mo><mo>→</mo><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex"> k \colon \text{SU}(2) \times \text{SU}(2) \times \text{SU}(4) \to \text{Spin}(10) </annotation></semantics></math></p>

<p>Now, there are <i>three</i> obvious ways to include <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(2) \times \text{SU}(3)</annotation></semantics></math> in <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>4</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(2) \times \text{SU}(2) \times \text{SU}(4)</annotation></semantics></math>.   There is an obvious inclusion </p>

<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mi>j</mi><mo lspace="0.11111em">:</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo><mo>↪</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>4</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex"> j \colon \text{SU}(3) \hookrightarrow \text{SU}(4) </annotation></semantics></math></p>

<p>but there are <i>three</i> obvious inclusions </p>

<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mi>ℓ</mi><mo>,</mo><mi>r</mi><mo>,</mo><mi>δ</mi><mo lspace="0.11111em">:</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>↪</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex"> \ell, r, \delta \colon \text{SU}(2) \hookrightarrow \text{SU}(2) \times \text{SU}(2) </annotation></semantics></math></p>

<p>namely the left one:</p>

<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mtable columnalign="center center center" displaystyle="false" rowspacing="0.5ex"><mtr><mtd><mi>ℓ</mi><mo lspace="0.11111em">:</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo></mtd> <mtd><mo>→</mo></mtd> <mtd><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo></mtd></mtr> <mtr><mtd><mi>g</mi></mtd> <mtd><mo>↦</mo></mtd> <mtd><mo stretchy="false">(</mo><mi>g</mi><mo>,</mo><mn>1</mn><mo stretchy="false">)</mo></mtd></mtr></mtable></mrow><annotation encoding="application/x-tex">  \begin{array}{ccc} \ell \colon \text{SU}(2) &amp;\to&amp; \text{SU}(2) \times \text{SU}(2) \\
                                         g &amp; \mapsto &amp; (g,1) 
      \end{array}
</annotation></semantics></math></p>

<p>the right one: </p>

<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mtable columnalign="center center center" displaystyle="false" rowspacing="0.5ex"><mtr><mtd><mi>r</mi><mo lspace="0.11111em">:</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo></mtd> <mtd><mo>→</mo></mtd> <mtd><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo></mtd></mtr> <mtr><mtd><mi>g</mi></mtd> <mtd><mo>↦</mo></mtd> <mtd><mo stretchy="false">(</mo><mn>1</mn><mo>,</mo><mi>g</mi><mo stretchy="false">)</mo></mtd></mtr></mtable></mrow><annotation encoding="application/x-tex">  \begin{array}{ccc}  r \colon \text{SU}(2) &amp;\to&amp; \text{SU}(2) \times \text{SU}(2) \\
                                         g &amp; \mapsto &amp; (1,g) 
      \end{array}
</annotation></semantics></math></p>

<p>and the diagonal one:</p>

<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mtable columnalign="center center center" displaystyle="false" rowspacing="0.5ex"><mtr><mtd><mi>δ</mi><mo lspace="0.11111em">:</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo></mtd> <mtd><mo>→</mo></mtd> <mtd><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo></mtd></mtr> <mtr><mtd><mi>g</mi></mtd> <mtd><mo>↦</mo></mtd> <mtd><mo stretchy="false">(</mo><mi>g</mi><mo>,</mo><mi>g</mi><mo stretchy="false">)</mo></mtd></mtr></mtable></mrow><annotation encoding="application/x-tex">  \begin{array}{ccc} \delta \colon \text{SU}(2) &amp;\to&amp; \text{SU}(2) \times \text{SU}(2) \\
                                            g &amp; \mapsto &amp; (g,g)
      \end{array}
</annotation></semantics></math></p>

<p>Combining these with our earlier maps, we actually get a one-to-one map from <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(2) \times \text{SU}(3)</annotation></semantics></math> to <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{Spin}(10)</annotation></semantics></math>.  So we get three subgroups of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{Spin}(10)</annotation></semantics></math>, all isomorphic to <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(2) \times \text{SU}(3)</annotation></semantics></math>:</p>

<ul>
<li>There’s the <b>left</b> subgroup <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>G</mi> <mi>ℓ</mi></msub></mrow><annotation encoding="application/x-tex">G_\ell</annotation></semantics></math>, which is the image of this composite homomorphism:</li>
</ul>

<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo><mover><mo>⟶</mo><mrow><mi>ℓ</mi><mo>×</mo><mi>j</mi></mrow></mover><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>4</mn><mo stretchy="false">)</mo><mo>≅</mo><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>4</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>6</mn><mo stretchy="false">)</mo><mover><mo>⟶</mo><mi>k</mi></mover><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex"> \text{SU}(2) \times \text{SU}(3) \stackrel{\ell \times j}{\longrightarrow} \text{SU}(2) \times \text{SU}(2) \times \text{SU}(4) \cong \text{Spin}(4) \times \text{Spin}(6) \stackrel{k}{\longrightarrow} \text{Spin}(10) </annotation></semantics></math></p>

<ul>
<li>There’s the <b>diagonal</b> subgroup <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>G</mi> <mi>δ</mi></msub></mrow><annotation encoding="application/x-tex">G_\delta</annotation></semantics></math>, which is the image of this:</li>
</ul>

<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo><mover><mo>⟶</mo><mrow><mi>δ</mi><mo>×</mo><mi>j</mi></mrow></mover><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>4</mn><mo stretchy="false">)</mo><mo>≅</mo><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>4</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>6</mn><mo stretchy="false">)</mo><mover><mo>⟶</mo><mi>k</mi></mover><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex"> \text{SU}(2) \times \text{SU}(3) \stackrel{\delta \times j}{\longrightarrow} \text{SU}(2) \times \text{SU}(2) \times \text{SU}(4) \cong \text{Spin}(4) \times \text{Spin}(6) \stackrel{k}{\longrightarrow} \text{Spin}(10) </annotation></semantics></math></p>

<ul>
<li>And there’s the <b>right</b> subgroup <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>G</mi> <mi>r</mi></msub></mrow><annotation encoding="application/x-tex">G_r</annotation></semantics></math>, which is the image of this:</li>
</ul>

<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo><mover><mo>⟶</mo><mrow><mi>r</mi><mo>×</mo><mi>j</mi></mrow></mover><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>4</mn><mo stretchy="false">)</mo><mo>≅</mo><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>4</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>6</mn><mo stretchy="false">)</mo><mover><mo>⟶</mo><mi>k</mi></mover><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex"> \text{SU}(2) \times \text{SU}(3) \stackrel{r \times j}{\longrightarrow} \text{SU}(2) \times \text{SU}(2) \times \text{SU}(4) \cong \text{Spin}(4) \times \text{Spin}(6) \stackrel{k}{\longrightarrow} \text{Spin}(10) </annotation></semantics></math></p>

<p>The left and right subgroups are actually conjugate, but the diagonal one is truly different!   We’ll prove this by taking a certain representation of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{Spin}(10)</annotation></semantics></math>, called the Weyl spinor representation, and restricting it to those two subgroups.   We’ll get inequivalent representations of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(2) \times \text{SU}(3)</annotation></semantics></math>.   This proves the two subgroups aren’t conjugate.  </p>

<p>This argument is also interesting for physics.  When restrict to the left subgroup, we get a representation of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(2) \times \text{SU}(3)</annotation></semantics></math> that matches what we actually see for one generation of fermions!   This is the basis of the so-called <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SO</mtext><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SO}(10)</annotation></semantics></math> grand unified theory, which should really be called the <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{Spin}(10)</annotation></semantics></math> grand unified theory.   </p>

<p>(In fact this works not only for <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(2) \times \text{SU}(3)</annotation></semantics></math> but for the whole Standard Model gauge group, which is larger.  I’m focusing on <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(2) \times \text{SU}(3)</annotation></semantics></math> just because it makes the story simpler.)</p>

<p>When we restrict the Weyl spinor representation to the <i>diagonal</i> subgroup, we get a representation of  <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(2) \times \text{SU}(3)</annotation></semantics></math> that is <i>not</i> physically correct.   Unfortunately, it’s the diagonal subgroup that shows up in several papers connecting the Standard Model gauge group to the octonions.  I plan to say a lot more about this later. </p>

<h3>The left subgroup</h3>

<p>Let’s look at the left subgroup <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>G</mi> <mi>ℓ</mi></msub></mrow><annotation encoding="application/x-tex">G_\ell</annotation></semantics></math>, the image of this composite:</p>

<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo><mover><mo>⟶</mo><mrow><mi>ℓ</mi><mo>×</mo><mi>j</mi></mrow></mover><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>4</mn><mo stretchy="false">)</mo><mo>≅</mo><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>4</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>6</mn><mo stretchy="false">)</mo><mover><mo>⟶</mo><mi>k</mi></mover><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex"> \text{SU}(2) \times \text{SU}(3) \stackrel{\ell \times j}{\longrightarrow} \text{SU}(2) \times \text{SU}(2) \times \text{SU}(4) \cong \text{Spin}(4) \times \text{Spin}(6) \stackrel{k}{\longrightarrow} \text{Spin}(10) </annotation></semantics></math></p>

<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{Spin}(10)</annotation></semantics></math> has a 32-dimensional unitary representation called the ‘Dirac spinor’ representation. This representation is really on the exterior algebra <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>Λ</mi><msup><mi>ℂ</mi> <mn>5</mn></msup></mrow><annotation encoding="application/x-tex">\Lambda \mathbb{C}^5</annotation></semantics></math>.  It’s the direct sum of two irreducible parts, the even grades and the odd grades:</p>

<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mi>Λ</mi><msup><mi>ℂ</mi> <mn>5</mn></msup><mo>≅</mo><msup><mi>Λ</mi> <mtext>even</mtext></msup><msup><mi>ℂ</mi> <mn>5</mn></msup><mo>⊕</mo><msup><mi>Λ</mi> <mtext>odd</mtext></msup><msup><mi>ℂ</mi> <mn>5</mn></msup></mrow><annotation encoding="application/x-tex"> \Lambda \mathbb{C}^5 \cong \Lambda^{\text{even}} \mathbb{C}^5 \oplus \Lambda^{\text{odd}} \mathbb{C}^5 </annotation></semantics></math></p>

<p>Physicists call these two irreducible representations ‘right- and left-handed Weyl spinors’, and denote them as <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mstyle mathvariant="bold"><mn>16</mn></mstyle></mrow><annotation encoding="application/x-tex">\mathbf{16}</annotation></semantics></math> and <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mstyle mathvariant="bold"><mn>16</mn></mstyle><mo>*</mo></mrow><annotation encoding="application/x-tex">\mathbf{16}\ast</annotation></semantics></math> since they’re 16-dimensional and one is the dual of the other.</p>

<p>Let’s restrict the <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mstyle mathvariant="bold"><mn>16</mn></mstyle></mrow><annotation encoding="application/x-tex">\mathbf{16}</annotation></semantics></math> to the left subgroup <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>G</mi> <mi>ℓ</mi></msub></mrow><annotation encoding="application/x-tex">G_\ell</annotation></semantics></math> and see what we get.</p>

<p>To do this, first we can restrict the <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mstyle mathvariant="bold"><mn>16</mn></mstyle></mrow><annotation encoding="application/x-tex">\mathbf{16}</annotation></semantics></math> along <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>k</mi></mrow><annotation encoding="application/x-tex">k</annotation></semantics></math> and get </p>

<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mstyle mathvariant="bold"><mn>2</mn></mstyle><mo>⊗</mo><mstyle mathvariant="bold"><mn>1</mn></mstyle><mo>⊗</mo><mstyle mathvariant="bold"><mn>4</mn></mstyle><mspace width="0.27778em"/><mo>⊕</mo><mspace width="0.27778em"/><mstyle mathvariant="bold"><mn>1</mn></mstyle><mo>⊗</mo><mstyle mathvariant="bold"><mn>2</mn></mstyle><mo>⊗</mo><mstyle mathvariant="bold"><mn>4</mn></mstyle><mo>*</mo></mrow><annotation encoding="application/x-tex"> \mathbf{2} \otimes \mathbf{1} \otimes \mathbf{4} \; \oplus \; \mathbf{1} \otimes \mathbf{2} \otimes \mathbf{4}\ast </annotation></semantics></math></p>

<p>Here <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mstyle mathvariant="bold"><mn>1</mn></mstyle></mrow><annotation encoding="application/x-tex">\mathbf{1}</annotation></semantics></math> is the trivial representation of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(2)</annotation></semantics></math>, <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mstyle mathvariant="bold"><mn>2</mn></mstyle></mrow><annotation encoding="application/x-tex">\mathbf{2}</annotation></semantics></math> is the tautologous representation of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(2)</annotation></semantics></math>, and <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mstyle mathvariant="bold"><mn>4</mn></mstyle></mrow><annotation encoding="application/x-tex">\mathbf{4}</annotation></semantics></math> is the tautologous rep of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>4</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(4)</annotation></semantics></math>.</p>

<p>Then let’s finish the job by restricting this representation along <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>ℓ</mi><mo>×</mo><mi>j</mi></mrow><annotation encoding="application/x-tex">\ell \times j</annotation></semantics></math>.  Restricting the <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mstyle mathvariant="bold"><mn>4</mn></mstyle></mrow><annotation encoding="application/x-tex">\mathbf{4}</annotation></semantics></math> of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>4</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(4)</annotation></semantics></math> to <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(3)</annotation></semantics></math> gives <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mstyle mathvariant="bold"><mn>3</mn></mstyle><mo>⊕</mo><mstyle mathvariant="bold"><mn>1</mn></mstyle></mrow><annotation encoding="application/x-tex">\mathbf{3} \oplus \mathbf{1}</annotation></semantics></math>: the sum of the tautologous representation of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(3)</annotation></semantics></math> and the trivial representation.  Restricting <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mstyle mathvariant="bold"><mn>2</mn></mstyle><mo>⊗</mo><mstyle mathvariant="bold"><mn>1</mn></mstyle></mrow><annotation encoding="application/x-tex">\mathbf{2} \otimes \mathbf{1}</annotation></semantics></math> to the left copy of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(2)</annotation></semantics></math> gives the tautologous representation <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mstyle mathvariant="bold"><mn>2</mn></mstyle></mrow><annotation encoding="application/x-tex">\mathbf{2}</annotation></semantics></math>, while restricting <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mstyle mathvariant="bold"><mn>1</mn></mstyle><mo>⊗</mo><mstyle mathvariant="bold"><mn>2</mn></mstyle></mrow><annotation encoding="application/x-tex">\mathbf{1} \otimes \mathbf{2}</annotation></semantics></math> to this left copy gives <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mstyle mathvariant="bold"><mn>1</mn></mstyle><mo>⊕</mo><mstyle mathvariant="bold"><mn>1</mn></mstyle></mrow><annotation encoding="application/x-tex">\mathbf{1} \oplus \mathbf{1}</annotation></semantics></math>: the sum of two copies of the trivial representation.  All in all, we get this representation of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(2) \times \text{SU}(3)</annotation></semantics></math>:</p>

<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mstyle mathvariant="bold"><mn>2</mn></mstyle><mo>⊗</mo><mo stretchy="false">(</mo><mstyle mathvariant="bold"><mn>3</mn></mstyle><mo>⊕</mo><mstyle mathvariant="bold"><mn>1</mn></mstyle><mo stretchy="false">)</mo><mspace width="0.27778em"/><mo>⊕</mo><mspace width="0.27778em"/><mo stretchy="false">(</mo><mstyle mathvariant="bold"><mn>1</mn></mstyle><mo>⊕</mo><mstyle mathvariant="bold"><mn>1</mn></mstyle><mo stretchy="false">)</mo><mo>⊗</mo><mo stretchy="false">(</mo><mstyle mathvariant="bold"><mn>3</mn></mstyle><mo>*</mo><mo>⊕</mo><mstyle mathvariant="bold"><mn>1</mn></mstyle><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex"> \mathbf{2} \otimes (\mathbf{3} \oplus \mathbf{1}) \; \oplus \; (\mathbf{1} \oplus \mathbf{1}) \otimes (\mathbf{3}\ast \oplus \mathbf{1}) </annotation></semantics></math></p>

<p>This is what we actually see for one generation of left-handed fermions and antifermions in the Standard Model!  The representation <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mstyle mathvariant="bold"><mn>3</mn></mstyle><mo>⊕</mo><mstyle mathvariant="bold"><mn>1</mn></mstyle></mrow><annotation encoding="application/x-tex">\mathbf{3} \oplus \mathbf{1}</annotation></semantics></math> describes how the left-handed fermions in one generation transform under <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(3)</annotation></semantics></math>: 3 colors of quark and one ‘white’ lepton.  The representation <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mstyle mathvariant="bold"><mn>3</mn></mstyle><mo>*</mo><mo>⊕</mo><mstyle mathvariant="bold"><mn>1</mn></mstyle></mrow><annotation encoding="application/x-tex">\mathbf{3}\ast \oplus \mathbf{1}</annotation></semantics></math> does the same for the left-handed antifermions.   The left-handed fermions form an isospin doublet, giving us the <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mstyle mathvariant="bold"><mn>2</mn></mstyle></mrow><annotation encoding="application/x-tex">\mathbf{2}</annotation></semantics></math>, while the left-handed antifermions have no isospin, giving us the <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mstyle mathvariant="bold"><mn>1</mn></mstyle><mo>⊕</mo><mstyle mathvariant="bold"><mn>1</mn></mstyle></mrow><annotation encoding="application/x-tex">\mathbf{1} \oplus \mathbf{1}</annotation></semantics></math>.  </p>

<p>This strange lopsidedness is a fundamental feature of the Standard Model.   </p>

<p>The right subgroup would work the same way, up to switching the words ‘left-handed’ and ‘right-handed’.  And by Theorem 10, the left and right subgroups must be conjugate in <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{Spin}(10)</annotation></semantics></math>, because now we’ll see one that’s not conjugate to either of these.</p>

<h3>The diagonal subgroup</h3>

<p>Consider the diagonal subgroup <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>G</mi> <mi>δ</mi></msub></mrow><annotation encoding="application/x-tex">G_\delta</annotation></semantics></math>, the image of this composite:</p>

<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo><mover><mo>⟶</mo><mrow><mi>δ</mi><mo>×</mo><mi>j</mi></mrow></mover><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>4</mn><mo stretchy="false">)</mo><mo>≅</mo><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>4</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>6</mn><mo stretchy="false">)</mo><mover><mo>⟶</mo><mi>k</mi></mover><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex"> \text{SU}(2) \times \text{SU}(3) \stackrel{\delta \times j}{\longrightarrow} \text{SU}(2) \times \text{SU}(2) \times \text{SU}(4) \cong \text{Spin}(4) \times \text{Spin}(6) \stackrel{k}{\longrightarrow} \text{Spin}(10) </annotation></semantics></math></p>

<p>Let’s restrict the <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mstyle mathvariant="bold"><mn>16</mn></mstyle></mrow><annotation encoding="application/x-tex">\mathbf{16}</annotation></semantics></math> to <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>G</mi> <mi>δ</mi></msub></mrow><annotation encoding="application/x-tex">G_\delta</annotation></semantics></math>.  </p>

<p>To do this, first let’s restrict the <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mstyle mathvariant="bold"><mn>16</mn></mstyle></mrow><annotation encoding="application/x-tex">\mathbf{16}</annotation></semantics></math> along <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>k</mi><mo lspace="0.11111em">:</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>4</mn><mo stretchy="false">)</mo><mo>→</mo><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">k \colon \text{SU}(2) \times \text{SU}(2) \times \text{SU}(4) \to \text{Spin}(10)</annotation></semantics></math> and get </p>

<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mstyle mathvariant="bold"><mn>2</mn></mstyle><mo>⊗</mo><mstyle mathvariant="bold"><mn>1</mn></mstyle><mo>⊗</mo><mstyle mathvariant="bold"><mn>4</mn></mstyle><mspace width="0.27778em"/><mo>⊕</mo><mspace width="0.27778em"/><mstyle mathvariant="bold"><mn>1</mn></mstyle><mo>⊗</mo><mstyle mathvariant="bold"><mn>2</mn></mstyle><mo>⊗</mo><mstyle mathvariant="bold"><mn>4</mn></mstyle><mo>*</mo></mrow><annotation encoding="application/x-tex"> \mathbf{2} \otimes \mathbf{1} \otimes \mathbf{4} \; \oplus \; \mathbf{1} \otimes \mathbf{2} \otimes \mathbf{4}\ast </annotation></semantics></math></p>

<p>as before.   Then let’s restrict this representation along <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>δ</mi><mo>×</mo><mi>j</mi></mrow><annotation encoding="application/x-tex">\delta \times j</annotation></semantics></math>.  The <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mo lspace="0em" rspace="0.16667em">SU</mo><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\SU(3)</annotation></semantics></math> part works as before, but what happens when we restrict <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mstyle mathvariant="bold"><mn>2</mn></mstyle><mo>⊗</mo><mstyle mathvariant="bold"><mn>1</mn></mstyle></mrow><annotation encoding="application/x-tex">\mathbf{2} \otimes \mathbf{1}</annotation></semantics></math> or <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mstyle mathvariant="bold"><mn>1</mn></mstyle><mo>⊗</mo><mstyle mathvariant="bold"><mn>2</mn></mstyle></mrow><annotation encoding="application/x-tex">\mathbf{1} \otimes \mathbf{2}</annotation></semantics></math> along the diagonal map <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>δ</mi><mo lspace="0.11111em">:</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>→</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\delta \colon \text{SU}(2) \to \text{SU}(2) \times \text{SU}(2)</annotation></semantics></math>?  We get <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mstyle mathvariant="bold"><mn>2</mn></mstyle></mrow><annotation encoding="application/x-tex">\mathbf{2}</annotation></semantics></math>.   So, this is the representation of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>G</mi> <mi>δ</mi></msub></mrow><annotation encoding="application/x-tex">G_\delta</annotation></semantics></math> that we get:</p>

<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mstyle mathvariant="bold"><mn>2</mn></mstyle><mo>⊗</mo><mo stretchy="false">(</mo><mstyle mathvariant="bold"><mn>3</mn></mstyle><mo>⊕</mo><mstyle mathvariant="bold"><mn>1</mn></mstyle><mo stretchy="false">)</mo><mspace width="0.27778em"/><mo>⊕</mo><mspace width="0.27778em"/><mstyle mathvariant="bold"><mn>2</mn></mstyle><mo>⊗</mo><mo stretchy="false">(</mo><mstyle mathvariant="bold"><mn>3</mn></mstyle><mo>*</mo><mo>⊕</mo><mstyle mathvariant="bold"><mn>1</mn></mstyle><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">  \mathbf{2} \otimes (\mathbf{3} \oplus \mathbf{1}) \; \oplus \; \mathbf{2} \otimes (\mathbf{3}\ast \oplus \mathbf{1}) </annotation></semantics></math></p>

<p>This is not good for the Standard Model.  It describes a more symmetrical universe than ours, where both left-handed fermions and antifermions transform as doublets under <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(2)</annotation></semantics></math>.</p>

<p>The fact that we got a different answer this time proves that <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>G</mi> <mi>ℓ</mi></msub></mrow><annotation encoding="application/x-tex">G_\ell</annotation></semantics></math> and <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>G</mi> <mi>δ</mi></msub></mrow><annotation encoding="application/x-tex">G_\delta</annotation></semantics></math> are not conjugate in <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{Spin}(10)</annotation></semantics></math>.  So to complete the proof of Theorem 10, we only need to prove</p>

<ol>
<li><p>Every subgroup of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{Spin}(10)</annotation></semantics></math> isomorphic to <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(2) \times \text{SU}(3)</annotation></semantics></math> is conjugate to <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>G</mi> <mi>ℓ</mi></msub></mrow><annotation encoding="application/x-tex">G_\ell</annotation></semantics></math> or <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>G</mi> <mi>δ</mi></msub></mrow><annotation encoding="application/x-tex">G_\delta</annotation></semantics></math>.</p></li>
<li><p><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>G</mi> <mi>δ</mi></msub></mrow><annotation encoding="application/x-tex">G_\delta</annotation></semantics></math> is conjugate to a subgroup of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>9</mn><mo stretchy="false">)</mo><mo>⊂</mo><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{Spin}(9) \subset \text{Spin}(10)</annotation></semantics></math>, but <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>G</mi> <mi>ℓ</mi></msub></mrow><annotation encoding="application/x-tex">G_\ell</annotation></semantics></math> is not.</p></li>
</ol>

<p>I’ll prove 2, and then I’ll turn you over to Will Sawin to do the rest.</p>

<h3>Why the diagonal subgroup fits in <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>9</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{Spin}(9)</annotation></semantics></math></h3>

<p>Every rotation of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msup><mi>ℝ</mi> <mi>n</mi></msup></mrow><annotation encoding="application/x-tex">\mathbb{R}^n</annotation></semantics></math> extends to a rotation of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msup><mi>ℝ</mi> <mrow><mi>n</mi><mo>+</mo><mn>1</mn></mrow></msup></mrow><annotation encoding="application/x-tex">\mathbb{R}^{n+1}</annotation></semantics></math> that leaves the last coordinate fixed, so we get an inclusion <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SO</mtext><mo stretchy="false">(</mo><mi>n</mi><mo stretchy="false">)</mo><mo>↪</mo><mtext>SO</mtext><mo stretchy="false">(</mo><mi>n</mi><mo>+</mo><mn>1</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SO}(n) \hookrightarrow \text{SO}(n+1)</annotation></semantics></math>, which lifts to an inclusion of the double covers, <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>Spin</mtext><mo stretchy="false">(</mo><mi>n</mi><mo stretchy="false">)</mo><mo>↪</mo><mtext>Spin</mtext><mo stretchy="false">(</mo><mi>n</mi><mo>+</mo><mn>1</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{Spin}(n) \hookrightarrow \text{Spin}(n+1)</annotation></semantics></math>.   Since we have exceptional isomorphisms</p>

<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo><mo>≅</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>,</mo><mspace width="2em"/><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>4</mn><mo stretchy="false">)</mo><mo>≅</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex"> \text{Spin}(3) \cong \text{SU}(2), \qquad \text{Spin}(4) \cong \text{SU}(2) \times \text{SU}(2) </annotation></semantics></math></p>

<p>it’s natural to ask how the inclusion <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo><mo>↪</mo><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>4</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{Spin}(3) \hookrightarrow \text{Spin}(4)</annotation></semantics></math> looks in these terms.  And the answer is: it’s the diagonal map!   In other words, we have a commutative diagram</p>

<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mtable columnalign="center center center" displaystyle="false" rowspacing="0.5ex"><mtr><mtd><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo></mtd> <mtd><mover><mo>→</mo><mo>∼</mo></mover></mtd> <mtd><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo></mtd></mtr> <mtr><mtd><mi>δ</mi><mo stretchy="false">↓</mo></mtd> <mtd/> <mtd><mo stretchy="false">↓</mo></mtd></mtr> <mtr><mtd><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo></mtd> <mtd><mover><mo>→</mo><mo>∼</mo></mover></mtd> <mtd><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>4</mn><mo stretchy="false">)</mo></mtd></mtr></mtable></mrow><annotation encoding="application/x-tex"> \begin{array}{ccc} 
\text{SU}(2) &amp; \xrightarrow{\sim} &amp; \text{Spin}(3) \\
\delta \downarrow &amp;                               &amp; \downarrow \\
\text{SU}(2) \times \text{SU}(2)  &amp; \xrightarrow{\sim} &amp; \text{Spin}(4) 
\end{array}
</annotation></semantics></math></p>

<p>Now, we can easily fit this into a larger commutative diagram involving some natural maps <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>Spin</mtext><mo stretchy="false">(</mo><mi>m</mi><mo stretchy="false">)</mo><mo>×</mo><mtext>Spin</mtext><mo stretchy="false">(</mo><mi>n</mi><mo stretchy="false">)</mo><mo>→</mo><mtext>Spin</mtext><mo stretchy="false">(</mo><mi>m</mi><mo>+</mo><mi>n</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{Spin}(m) \times \text{Spin}(n) \to \text{Spin}(m+n)</annotation></semantics></math> and <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>Spin</mtext><mo stretchy="false">(</mo><mi>n</mi><mo stretchy="false">)</mo><mo>→</mo><mtext>Spin</mtext><mo stretchy="false">(</mo><mi>n</mi><mo>+</mo><mn>1</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{Spin}(n) \to \text{Spin}(n+1)</annotation></semantics></math>:</p>

<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mtable columnalign="center center center center center center center" displaystyle="false" rowspacing="0.5ex"><mtr><mtd><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo></mtd> <mtd><mover><mo>→</mo><mo>∼</mo></mover></mtd> <mtd><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo></mtd> <mtd><mo>→</mo></mtd> <mtd><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>6</mn><mo stretchy="false">)</mo></mtd> <mtd><mo>→</mo></mtd> <mtd><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>9</mn><mo stretchy="false">)</mo></mtd></mtr> <mtr><mtd><mi>δ</mi><mo stretchy="false">↓</mo></mtd> <mtd/> <mtd><mo stretchy="false">↓</mo></mtd> <mtd/> <mtd><mo stretchy="false">↓</mo></mtd> <mtd/> <mtd><mo stretchy="false">↓</mo></mtd></mtr> <mtr><mtd><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo></mtd> <mtd><mover><mo>→</mo><mo>∼</mo></mover></mtd> <mtd><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>4</mn><mo stretchy="false">)</mo></mtd> <mtd><mo>→</mo></mtd> <mtd><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>4</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>6</mn><mo stretchy="false">)</mo></mtd> <mtd><mo>→</mo></mtd> <mtd><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo></mtd></mtr></mtable></mrow><annotation encoding="application/x-tex"> \begin{array}{ccccccc} 
\text{SU}(2) &amp; \xrightarrow{\sim} &amp; \text{Spin}(3) &amp; \to &amp; \text{Spin}(3) \times \text{Spin}(6) &amp; \to &amp;
\text{Spin}(9) \\
\delta \downarrow &amp;  &amp; \downarrow &amp; &amp;  \downarrow &amp; &amp; \downarrow    \\
\text{SU}(2) \times \text{SU}(2)  &amp; \xrightarrow{\sim}  &amp; \text{Spin}(4) &amp; \to &amp; \text{Spin}(4) \times \text{Spin}(6) &amp; \to &amp; \text{Spin}(10) 
\end{array}
</annotation></semantics></math></p>

<p>We can simplify this diagram using the isomorphism <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>6</mn><mo stretchy="false">)</mo><mo>≅</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>4</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{Spin}(6) \cong \text{SU}(4)</annotation></semantics></math>:</p>

<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mtable columnalign="center center center center center center center" displaystyle="false" rowspacing="0.5ex"><mtr><mtd><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>4</mn><mo stretchy="false">)</mo></mtd> <mtd><mo>→</mo></mtd> <mtd><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>9</mn><mo stretchy="false">)</mo></mtd></mtr> <mtr><mtd><mi>δ</mi><mo>×</mo><mn>1</mn><mo stretchy="false">↓</mo></mtd> <mtd/> <mtd><mo stretchy="false">↓</mo></mtd></mtr> <mtr><mtd><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>4</mn><mo stretchy="false">)</mo></mtd> <mtd><mo>→</mo></mtd> <mtd><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo></mtd></mtr></mtable></mrow><annotation encoding="application/x-tex"> \begin{array}{ccccccc} 
\text{SU}(2) \times \text{SU}(4) &amp; \to &amp;
\text{Spin}(9) \\
\delta \times 1 \downarrow &amp;  &amp; \downarrow    \\
\text{SU}(2) \times \text{SU}(2) \times \text{SU}(4) &amp; \to &amp; \text{Spin}(10) 
\end{array}
</annotation></semantics></math></p>

<p>and then we can use our friend the inclusion <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>j</mi><mo lspace="0.11111em">:</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo><mo>→</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>4</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">j \colon \text{SU}(3) \to \text{SU}(4)</annotation></semantics></math>:</p>

<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mtable columnalign="center center center center center center center" displaystyle="false" rowspacing="0.5ex"><mtr><mtd><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo></mtd> <mtd><mover><mo>→</mo><mrow><mn>1</mn><mo>×</mo><mi>j</mi></mrow></mover></mtd> <mtd><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>4</mn><mo stretchy="false">)</mo></mtd> <mtd><mo>→</mo></mtd> <mtd><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>9</mn><mo stretchy="false">)</mo></mtd></mtr> <mtr><mtd/> <mtd/> <mtd><mi>δ</mi><mo>×</mo><mn>1</mn><mo stretchy="false">↓</mo></mtd> <mtd/> <mtd><mo stretchy="false">↓</mo></mtd></mtr> <mtr><mtd/> <mtd/> <mtd><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>4</mn><mo stretchy="false">)</mo></mtd> <mtd><mo>→</mo></mtd> <mtd><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo></mtd></mtr></mtable></mrow><annotation encoding="application/x-tex"> \begin{array}{ccccccc} 
\text{SU}(2) \times \text{SU}(3) &amp; \xrightarrow{1 \times j} &amp; \text{SU}(2) \times \text{SU}(4) &amp; \to &amp;
\text{Spin}(9) \\
&amp; &amp; \delta \times 1 \downarrow &amp;  &amp; \downarrow    \\
&amp; &amp; \text{SU}(2) \times \text{SU}(2) \times \text{SU}(4) &amp; \to &amp; \text{Spin}(10) 
\end{array}
</annotation></semantics></math></p>

<p>This shows that the diagonal subgroup <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>G</mi> <mi>δ</mi></msub></mrow><annotation encoding="application/x-tex">G_\delta</annotation></semantics></math> of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{Spin}(10)</annotation></semantics></math> is actually a subgroup of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>9</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{Spin}(9)</annotation></semantics></math>!</p>

<h3>Why the left subgroup does not fit in <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>9</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{Spin}(9)</annotation></semantics></math></h3>

<p>The <b>three-fold way</b> is a coarse classification of irreducible complex representations of compact Lie group.  Every such representation is of one and only one of these three kinds:</p>

<p>1) <b>not self-dual</b>: not isomorphic to its dual,</p>

<p>2a) <b>orthogonal</b>: isomorphic to its dual via an invariant nondegenerate symmetric bilinear form, also called an orthogonal structure,</p>

<p>2b) <b>symplectic</b>: isomorphic to its dual via an invariant nondegenerate antisymmetric bilinear form, also called a symplectic structure.</p>

<p>I’ve written about how these three cases are related to the division algebras <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>ℂ</mi><mo>,</mo><mi>ℝ</mi></mrow><annotation encoding="application/x-tex">\mathbb{C}, \mathbb{R}</annotation></semantics></math> and <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>ℍ</mi></mrow><annotation encoding="application/x-tex">\mathbb{H}</annotation></semantics></math>, respectively:</p>

<ul>
<li>John Baez, <a href="https://arxiv.org/abs/1101.5690">Division algebras and quantum theory</a>.</li>
</ul>

<p>A complex representation is orthogonal iff it’s the complexification of a representation on a real vector space, and symplectic iff it’s the underlying complex representation of a representation on a quaternionic vector space.  </p>

<p>But we don’t need most of this yet.  For now we just need to know one fact: when <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>n</mi></mrow><annotation encoding="application/x-tex">n</annotation></semantics></math> is odd, every irreducible representation of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>Spin</mtext><mo stretchy="false">(</mo><mi>n</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{Spin}(n)</annotation></semantics></math>, and thus <i>every</i> representation of this Lie group, is <b>self-dual</b>: that is, isomorphic to its dual.   In particular this is true of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>9</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{Spin}(9)</annotation></semantics></math>.   </p>

<p>Why does this matter?  Assume the left subgroup <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>G</mi> <mi>ℓ</mi></msub><mo>⊂</mo><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">G_\ell \subset \text{Spin}(10)</annotation></semantics></math> is a subgroup of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>9</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{Spin}(9)</annotation></semantics></math>.   When we restrict the Weyl spinor representation of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{Spin}(10)</annotation></semantics></math> to <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>9</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{Spin}(9)</annotation></semantics></math> it will be self-dual, like every representation of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>9</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{Spin}(9)</annotation></semantics></math>.  Then when we restrict this representation further to <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(2) \times \text{SU}(3)</annotation></semantics></math> it must still be self-dual, since the restriction of a self-dual representation is clearly self-dual.   </p>

<p>However, we know this representation is </p>

<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mstyle mathvariant="bold"><mn>2</mn></mstyle><mo>⊗</mo><mo stretchy="false">(</mo><mstyle mathvariant="bold"><mn>3</mn></mstyle><mo>⊕</mo><mstyle mathvariant="bold"><mn>1</mn></mstyle><mo stretchy="false">)</mo><mspace width="0.27778em"/><mo>⊕</mo><mspace width="0.27778em"/><mo stretchy="false">(</mo><mstyle mathvariant="bold"><mn>1</mn></mstyle><mo>⊕</mo><mstyle mathvariant="bold"><mn>1</mn></mstyle><mo stretchy="false">)</mo><mo>⊗</mo><mo stretchy="false">(</mo><mstyle mathvariant="bold"><mn>3</mn></mstyle><mo>*</mo><mo>⊕</mo><mstyle mathvariant="bold"><mn>1</mn></mstyle><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex"> \mathbf{2} \otimes (\mathbf{3} \oplus \mathbf{1}) \; \oplus \; (\mathbf{1} \oplus \mathbf{1}) \otimes (\mathbf{3}\ast \oplus \mathbf{1}) </annotation></semantics></math></p>

<p>and this is <i>not</i> self-dual, since <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mstyle mathvariant="bold"><mn>1</mn></mstyle><mo>*</mo><mo>≅</mo><mstyle mathvariant="bold"><mn>1</mn></mstyle></mrow><annotation encoding="application/x-tex">\mathbf{1}\ast \cong \mathbf{1}</annotation></semantics></math> and <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mstyle mathvariant="bold"><mn>2</mn></mstyle><mo>*</mo><mo>≅</mo><mstyle mathvariant="bold"><mn>2</mn></mstyle></mrow><annotation encoding="application/x-tex">\mathbf{2}\ast \cong \mathbf{2}</annotation></semantics></math> but <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mstyle mathvariant="bold"><mn>3</mn></mstyle><mo>*</mo><mo>≇</mo><mstyle mathvariant="bold"><mn>3</mn></mstyle></mrow><annotation encoding="application/x-tex">\mathbf{3}\ast \ncong \mathbf{3}</annotation></semantics></math>.</p>

<p>So, it must be that <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>G</mi> <mi>ℓ</mi></msub></mrow><annotation encoding="application/x-tex">G_\ell</annotation></semantics></math> is <i>not</i> a subgroup of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>9</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{Spin}(9)</annotation></semantics></math>.</p>

<h3>Proof of Theorem 10</h3>

<p>To complete the proof of Theorem 10 we just need to see why there are just two conjugacy classes of subgroups of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{Spin}(10)</annotation></semantics></math> isomorphic to <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(2) \times \text{SU}(3)</annotation></semantics></math>.  But in fact Will Sawin proved a stronger result!   He was answering this question of mine:</p>

<blockquote>
  <p>Define the <b>Standard Model gauge group</b> to be <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>S</mtext><mo stretchy="false">(</mo><mtext>U</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>U</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{S}(\text{U}(2) \times \text{U}(3))</annotation></semantics></math>, the subgroup of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>5</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(5)</annotation></semantics></math> consisting of block diagonal matrices with a <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>2</mn><mo>×</mo><mn>2</mn></mrow><annotation encoding="application/x-tex">2 \times 2</annotation></semantics></math> block and then a <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>3</mn><mo>×</mo><mn>3</mn></mrow><annotation encoding="application/x-tex">3 \times 3</annotation></semantics></math> block.   (This is isomorphic to the quotient of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>U</mtext><mo stretchy="false">(</mo><mn>1</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{U}(1) \times \text{SU}(2) \times \text{SU}(3)</annotation></semantics></math> by the subgroup of elements <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mo stretchy="false">(</mo><mi>α</mi><mo>,</mo><msup><mi>α</mi> <mrow><mo lspace="0.11111em" rspace="0em">−</mo><mn>3</mn></mrow></msup><mo>,</mo><msup><mi>α</mi> <mn>2</mn></msup></mrow><annotation encoding="application/x-tex">(\alpha, \alpha^{-3}, \alpha^2</annotation></semantics></math>) where <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>α</mi></mrow><annotation encoding="application/x-tex">\alpha</annotation></semantics></math> is a 6th root of unity.)</p>

<p><b>Up to conjugacy, how many subgroups isomorphic to the Standard Model gauge group does <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{Spin}(10)</annotation></semantics></math> have?</b></p>

<p>This question is relevant to grand unified theories of particle physics, as explained here:</p>

<ul>
<li>John C. Baez and John Huerta, <a href="https://www.ams.org/journals/bull/2010-47-03/S0273-0979-10-01294-2/S0273-0979-10-01294-2.pdf">The algebra of grand unified theories</a>, <em>Bull. Amer. Math. Soc.</em> <strong>47</strong> (2010), 483-552. </li>
</ul>

<p>This paper focuses on one particular copy of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>S</mtext><mo stretchy="false">(</mo><mtext>U</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>U</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{S}(\text{U}(2) \times \text{U}(3))</annotation></semantics></math> in <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{Spin}(10)</annotation></semantics></math>, given as follows.  By definition we have an inclusion <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>S</mtext><mo stretchy="false">(</mo><mtext>U</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>U</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo><mo stretchy="false">)</mo><mo>↪</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>5</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{S}(\text{U}(2) \times \text{U}(3)) \hookrightarrow \text{SU}(5)</annotation></semantics></math>, and we also have an inclusion <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>5</mn><mo stretchy="false">)</mo><mo>↪</mo><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(5) \hookrightarrow \text{Spin}(10)</annotation></semantics></math> because for any <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>n</mi></mrow><annotation encoding="application/x-tex">n</annotation></semantics></math> we have an inclusion <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mi>n</mi><mo stretchy="false">)</mo><mo>↪</mo><mtext>SO</mtext><mo stretchy="false">(</mo><mn>2</mn><mi>n</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(n) \hookrightarrow \text{SO}(2n)</annotation></semantics></math>, and <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mi>n</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(n)</annotation></semantics></math> is simply connected so this gives a homomorphism <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mi>n</mi><mo stretchy="false">)</mo><mo>↪</mo><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>2</mn><mi>n</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(n) \hookrightarrow \text{Spin}(2n)</annotation></semantics></math>.</p>

<p>However I think there is also an inclusion <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>S</mtext><mo stretchy="false">(</mo><mtext>U</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>U</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo><mo stretchy="false">)</mo><mo>↪</mo><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>9</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{S}(\text{U}(2) \times \text{U}(3)) \hookrightarrow \text{Spin}(9)</annotation></semantics></math>, studied by Krasnov:</p>

<ul>
<li>Kirill Krasnov, <a href="https://arxiv.org/abs/1912.11282">SO(9) characterisation of the Standard Model gauge group</a>.</li>
</ul>

<p>Composing this with <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>9</mn><mo stretchy="false">)</mo><mo>↪</mo><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{Spin}(9) \hookrightarrow \text{Spin}(10)</annotation></semantics></math>, this should give another inclusion <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>S</mtext><mo stretchy="false">(</mo><mtext>U</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>U</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo><mo stretchy="false">)</mo><mo>↪</mo><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{S}(\text{U}(2) \times \text{U}(3)) \hookrightarrow \text{Spin}(10)</annotation></semantics></math>, and I believe this one is ‘truly different from’ — i.e., not conjugate to — the first one I mentioned.</p>

<p>So I believe my current answer to my question is “at least two”.   But that’s not good enough.</p>
</blockquote>

<p>Sawin’s answer relies heavily on the 3-fold way — that’s why I told you that stuff about orthogonal and symplectic representations.   When we embed the group <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(2) \times \text{SU}(3)</annotation></semantics></math> in <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{Spin}(10)</annotation></semantics></math>, we are automatically giving this group an orthogonal 10-dimensional representation, thanks to the map <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo><mo>→</mo><mtext>SO</mtext><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{Spin}(10) \to \text{SO}(10)</annotation></semantics></math>.  We can classify the possibilities.  </p>

<p>He writes:</p>

<blockquote>
  <p>There are infinitely many embeddings. However, all but one of them is “essentially the same as” the one you studied as they become equal to the one you studied on restriction to <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(2)\times \text{SU}(3)</annotation></semantics></math>. The remaining one is the one studied by Krasnov.</p>

<p>I follow the strategy <a href="https://mathoverflow.net/questions/504716/how-many-copies-of-the-standard-model-gauge-group-are-there-in-spin10#comment1315714_504716">suggested by Kenta Suzuki</a>.</p>

<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(3)</annotation></semantics></math> has irreducible representations of dimensions <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>1</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>10</mn><mo>,</mo><mn>10</mn></mrow><annotation encoding="application/x-tex">1,3,3,6,8,6, 10, 10</annotation></semantics></math>, and higher dimensions. The <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>10</mn></mrow><annotation encoding="application/x-tex">10</annotation></semantics></math>-dimensional ones are dual to each other, as are the <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>6</mn></mrow><annotation encoding="application/x-tex">6</annotation></semantics></math>-dimensional ones, so they can’t appear. The <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>3</mn></mrow><annotation encoding="application/x-tex">3</annotation></semantics></math>-dimensional ones are dual to each other and can only appear together. So the only <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>10</mn></mrow><annotation encoding="application/x-tex">10</annotation></semantics></math>-dimensional self-dual representations of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(3)</annotation></semantics></math> decompose as irreducibles as <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>8</mn><mo>+</mo><mn>1</mn><mo>+</mo><mn>1</mn></mrow><annotation encoding="application/x-tex">8+1+1</annotation></semantics></math>, <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>3</mn><mo>+</mo><mn>3</mn><mo>+</mo><mn>1</mn><mo>+</mo><mn>1</mn><mo>+</mo><mn>1</mn><mo>+</mo><mn>1</mn></mrow><annotation encoding="application/x-tex">3+3+1+1+1+1</annotation></semantics></math>, or ten <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>1</mn></mrow><annotation encoding="application/x-tex">1</annotation></semantics></math>s. All of these are orthogonal because the 8-dimensional representation is orthogonal. However, the ten <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>1</mn></mrow><annotation encoding="application/x-tex">1</annotation></semantics></math>s cannot appear because then <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(3)</annotation></semantics></math> would act trivially.</p>

<p>A representation of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(3) \times \text{SU}(2)</annotation></semantics></math> is a sum of tensor products of irreducible representations of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(3)</annotation></semantics></math> and irreducible representations of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(2)</annotation></semantics></math>. Restricted to <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(3)</annotation></semantics></math>, each tensor product splits into a sum of copies of the same irreducible representation. So <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(2)</annotation></semantics></math> can only act nontrivially when the same representation appears multiple times. Since the <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>3</mn><mo>+</mo><mn>3</mn></mrow><annotation encoding="application/x-tex">3+3</annotation></semantics></math> is two different <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>3</mn></mrow><annotation encoding="application/x-tex">3</annotation></semantics></math>-dimensional representation, only the <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>1</mn></mrow><annotation encoding="application/x-tex">1</annotation></semantics></math>-dimensional representation can occur twice. Thus, our 10-dimensional orthogonal representation of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(3) \times \text{SU}(2)</annotation></semantics></math> necessarily splits as either the <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>8</mn></mrow><annotation encoding="application/x-tex">8</annotation></semantics></math>-dimensional adjoint repsentation of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(3)</annotation></semantics></math> plus a <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>2</mn></mrow><annotation encoding="application/x-tex">2</annotation></semantics></math>-dimensional orthogonal representation of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(2)</annotation></semantics></math> or the <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>6</mn></mrow><annotation encoding="application/x-tex">6</annotation></semantics></math>-dimensional sum of standard and conjugate [i.e., dual] representations of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(3)</annotation></semantics></math> plus a <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>4</mn></mrow><annotation encoding="application/x-tex">4</annotation></semantics></math>-dimensional orthogonal representation of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(2)</annotation></semantics></math>. However, <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(2)</annotation></semantics></math> has a unique nontrivial representation of dimension <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>2</mn></mrow><annotation encoding="application/x-tex">2</annotation></semantics></math> and it isn’t orthgonal, so only the second case can appear. <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(2)</annotation></semantics></math> has representations of dimension <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>4</mn></mrow><annotation encoding="application/x-tex">1,2,3,4</annotation></semantics></math> of which the <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>2</mn></mrow><annotation encoding="application/x-tex">2</annotation></semantics></math> and <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>4</mn></mrow><annotation encoding="application/x-tex">4</annotation></semantics></math>-dimensional ones are symplectic and so must appear with even multiplicity in any orthogonal representation, so the only nontrivial <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>4</mn></mrow><annotation encoding="application/x-tex">4</annotation></semantics></math>-dimensional orthogonal ones are <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>2</mn><mo>+</mo><mn>2</mn></mrow><annotation encoding="application/x-tex">2+2</annotation></semantics></math> or <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>3</mn><mo>+</mo><mn>1</mn></mrow><annotation encoding="application/x-tex">3+1</annotation></semantics></math>.</p>

<p>So there are two ten-dimensional orthogonal representations of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(2) \times \text{SU}(3)</annotation></semantics></math> that are nontrivial on both factors, those being the sum of two different <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>3</mn></mrow><annotation encoding="application/x-tex">3</annotation></semantics></math>-dimensional irreducible representations of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(3)</annotation></semantics></math> with either two copies of the two-dimensional irreducible representation of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(2)</annotation></semantics></math> or the three-dimensional and the one-dimensional irreducible representation of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(2)</annotation></semantics></math>. The orthogonal structure is unique up to isomorphisms, so these give two conjugacy classes of homomorphisms <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo><mo>→</mo><mi>SO</mi><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(2) \times \text{SU}(3) \to SO(10)</annotation></semantics></math> and thus two conjugacy classes of homomorphisms <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo><mo>→</mo><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(2) \times \text{SU}(3) \to \text{Spin}(10)</annotation></semantics></math>. The first one corrresponds to the embedding you studied while only the second one restricts to <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>9</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{Spin}(9)</annotation></semantics></math> so indeed these are different.</p>

<p>To understand how to extend these to <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>S</mtext><mo stretchy="false">(</mo><mtext>U</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>U</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{S}(\text{U}(2) \times \text{U}(3))</annotation></semantics></math>, I consider the centralizer of the representation within <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{Spin}(10)</annotation></semantics></math>. Since the group is connected, this is the same as the centralizer of its Lie algebra, which is therefore the inverse image of the centralizer in <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SO</mtext><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SO}(10)</annotation></semantics></math>. Now there is a distinction between the two examples because the example with irrep dimensions <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>3</mn><mo>+</mo><mn>3</mn><mo>+</mo><mn>2</mn><mo>+</mo><mn>2</mn></mrow><annotation encoding="application/x-tex">3+3+2+2</annotation></semantics></math> has centralizer with identity component <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>U</mtext><mo stretchy="false">(</mo><mn>1</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{U}(1) \times \text{SU}(2)</annotation></semantics></math> while the example with irrep dimensions <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>3</mn><mo>+</mo><mn>3</mn><mo>+</mo><mn>3</mn><mo>+</mo><mn>1</mn></mrow><annotation encoding="application/x-tex">3+3+3+1</annotation></semantics></math> has centralizer with identity component <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>U</mtext><mo stretchy="false">(</mo><mn>1</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{U}(1)</annotation></semantics></math>. In the second case, the image of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>U</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>U</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{U}(2) \times \text{U}(3)</annotation></semantics></math> must be the image of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(2) \times \text{SU}(3)</annotation></semantics></math> times the centralizer of the image of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(2) \times \text{SU}(3)</annotation></semantics></math>, so this gives a unique example, which must be the one considered by Krasnov.</p>

<p>In the first case, we can restrict attention to a torus <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>U</mtext><mo stretchy="false">(</mo><mn>1</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>U</mtext><mo stretchy="false">(</mo><mn>1</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{U}(1) \times \text{U}(1)</annotation></semantics></math> in <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(2) \times \text{SU}(2)</annotation></semantics></math>. The center of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>S</mtext><mo stretchy="false">(</mo><mtext>U</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>U</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{S}(\text{U}(2) \times \text{U}(3))</annotation></semantics></math> maps to a one-dimensional subgroup of this torus, which can be described by a pair of integers. Explicitly, given a two-by-two-unitary matrix <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>A</mi></mrow><annotation encoding="application/x-tex">A</annotation></semantics></math> and a three-by-three unitary matrix <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>B</mi></mrow><annotation encoding="application/x-tex">B</annotation></semantics></math> with <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>det</mi><mo stretchy="false">(</mo><mi>A</mi><mo stretchy="false">)</mo><mi>det</mi><mo stretchy="false">(</mo><mi>B</mi><mo stretchy="false">)</mo><mo>=</mo><mn>1</mn></mrow><annotation encoding="application/x-tex">\det(A) \det(B) =1</annotation></semantics></math>, we can map to <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>U</mtext><mo stretchy="false">(</mo><mn>5</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{U}(5)</annotation></semantics></math> by sending <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mo stretchy="false">(</mo><mi>A</mi><mo>,</mo><mi>B</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">(A,B)</annotation></semantics></math> to <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>A</mi><msup><mi>γ</mi> <mi>a</mi></msup><mo>⊕</mo><mi>B</mi><msup><mi>γ</mi> <mi>b</mi></msup></mrow><annotation encoding="application/x-tex">A \gamma^a \oplus B \gamma^b</annotation></semantics></math> where <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>γ</mi><mo>=</mo><mi>det</mi><mo stretchy="false">(</mo><mi>A</mi><mo stretchy="false">)</mo><mo>=</mo><mi>det</mi><mo stretchy="false">(</mo><mi>B</mi><msup><mo stretchy="false">)</mo> <mrow><mo lspace="0.11111em" rspace="0em">−</mo><mn>1</mn></mrow></msup></mrow><annotation encoding="application/x-tex">\gamma = \det (A) = \det(B)^{-1}</annotation></semantics></math>, and then map from <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>U</mtext><mo stretchy="false">(</mo><mn>5</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{U}(5)</annotation></semantics></math> to <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>SO</mi><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">SO(10)</annotation></semantics></math>. This lifts to the spin group if and only if the determinant in <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>U</mtext><mo stretchy="false">(</mo><mn>5</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{U}(5)</annotation></semantics></math> is a perfect square. The determinant is <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msup><mi>γ</mi> <mrow><mn>1</mn><mo>+</mo><mn>2</mn><mi>a</mi><mo>−</mo><mn>1</mn><mo>+</mo><mn>3</mn><mi>b</mi></mrow></msup><mo>=</mo><msup><mi>γ</mi> <mrow><mn>2</mn><mi>a</mi><mo>+</mo><mn>3</mn><mi>b</mi></mrow></msup></mrow><annotation encoding="application/x-tex">\gamma^{ 1 + 2a - 1 + 3b} = \gamma^{2a+3b}</annotation></semantics></math> so a lift exists if and only if <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>b</mi></mrow><annotation encoding="application/x-tex">b</annotation></semantics></math> is even.</p>

<p>The only possible kernel of this embedding is the scalars. The scalar <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>A</mi><mo>=</mo><msup><mi>λ</mi> <mn>3</mn></msup><msub><mi>I</mi> <mn>2</mn></msub><mo>,</mo><mi>B</mi><mo>=</mo><msup><mi>λ</mi> <mrow><mo lspace="0.11111em" rspace="0em">−</mo><mn>2</mn></mrow></msup><msub><mi>I</mi> <mn>3</mn></msub></mrow><annotation encoding="application/x-tex">A = \lambda^3 I_2, B = \lambda^{-2} I_3</annotation></semantics></math> maps to <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msup><mi>λ</mi> <mrow><mn>3</mn><mo>+</mo><mn>6</mn><mi>a</mi></mrow></msup><msub><mi>I</mi> <mn>2</mn></msub><mo>⊕</mo><msup><mi>λ</mi> <mrow><mo lspace="0.11111em" rspace="0em">−</mo><mn>2</mn><mo>+</mo><mn>6</mn><mi>b</mi></mrow></msup><msub><mi>I</mi> <mn>3</mn></msub></mrow><annotation encoding="application/x-tex">\lambda^{3+ 6a} I_2 \oplus \lambda^{-2 + 6b} I_3</annotation></semantics></math> and so the kernel is trivial if and only if <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>gcd</mi><mo stretchy="false">(</mo><mn>3</mn><mo>+</mo><mn>6</mn><mi>a</mi><mo>,</mo><mo lspace="0.11111em" rspace="0em">−</mo><mn>2</mn><mo>+</mo><mn>6</mn><mi>b</mi><mo stretchy="false">)</mo><mo>=</mo><mn>1</mn></mrow><annotation encoding="application/x-tex">\gcd(3+6a,-2 + 6b)=1</annotation></semantics></math>.</p>

<p>However, there are infinitely many integer solutions <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>a</mi><mo>,</mo><mi>b</mi></mrow><annotation encoding="application/x-tex">a,b</annotation></semantics></math> to <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>gcd</mi><mo stretchy="false">(</mo><mn>3</mn><mo>+</mo><mn>6</mn><mi>a</mi><mo>,</mo><mo lspace="0.11111em" rspace="0em">−</mo><mn>2</mn><mi>a</mi><mo>+</mo><mn>6</mn><mi>b</mi><mo stretchy="false">)</mo><mo>=</mo><mn>1</mn></mrow><annotation encoding="application/x-tex">\gcd(3+6a,-2a+6b)=1</annotation></semantics></math> with <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>b</mi></mrow><annotation encoding="application/x-tex">b</annotation></semantics></math> even (in fact, a random <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>a</mi></mrow><annotation encoding="application/x-tex">a</annotation></semantics></math> and even <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>b</mi></mrow><annotation encoding="application/x-tex">b</annotation></semantics></math> works with probability <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>9</mn><mo stretchy="false">/</mo><msup><mi>π</mi> <mn>2</mn></msup></mrow><annotation encoding="application/x-tex">9/\pi^2</annotation></semantics></math>), so this gives infinitely many examples.</p>
</blockquote>

<hr/>

<ul>
<li><a href="https://golem.ph.utexas.edu/category/2020/07/octonions_and_the_standard_mod.html">Part 1</a>. How to define octonion multiplication using complex scalars and vectors, much as quaternion multiplication can be defined using real scalars and vectors. This description requires singling out a specific unit imaginary octonion, and it shows that octonion multiplication is invariant under <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi mathvariant="normal">SU</mi><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\mathrm{SU}(3)</annotation></semantics></math>.
</li>
<li>
<a href="https://golem.ph.utexas.edu/category/2020/07/octonions_and_the_standard_mod_1.html">Part 2</a>.  A more polished way to think about octonion multiplication in terms of complex scalars and vectors, and a similar-looking way to describe it using the cross product in 7 dimensions.
</li>
<li>
<a href="https://golem.ph.utexas.edu/category/2020/07/octonions_and_the_standard_mod_2.html">Part 3</a>.  How a lepton and a quark fit together into an octonion — at least if we only consider them as representations of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi mathvariant="normal">SU</mi><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\mathrm{SU}(3)</annotation></semantics></math>, the gauge group of the strong force. Proof that the symmetries of the octonions fixing an imaginary octonion form precisely the group <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi mathvariant="normal">SU</mi><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\mathrm{SU}(3)</annotation></semantics></math>.
</li>
<li>
<a href="https://golem.ph.utexas.edu/category/2020/08/octonions_and_the_standard_mod_3.html">Part 4</a>. Introducing the exceptional Jordan algebra <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>𝔥</mi> <mn>3</mn></msub><mo stretchy="false">(</mo><mi>𝕆</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\mathfrak{h}_3(\mathbb{O})</annotation></semantics></math>: the <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>3</mn><mo>×</mo><mn>3</mn></mrow><annotation encoding="application/x-tex">3 \times 3</annotation></semantics></math> self-adjoint octonionic matrices. A result of Dubois-Violette and Todorov: the symmetries of the exceptional Jordan algebra preserving their splitting into complex scalar and vector parts and preserving a copy of the <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>2</mn><mo>×</mo><mn>2</mn></mrow><annotation encoding="application/x-tex">2 \times 2</annotation></semantics></math> adjoint octonionic matrices form precisely the Standard Model gauge group.
</li>
<li>
<a href="https://golem.ph.utexas.edu/category/2020/10/octonions_and_the_standard_mod_4.html">Part 5</a>.  How to think of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>2</mn><mo>×</mo><mn>2</mn></mrow><annotation encoding="application/x-tex">2 \times 2</annotation></semantics></math> self-adjoint octonionic matrices as vectors in 10d Minkowski spacetime, and pairs of octonions as left- or right-handed spinors.
</li>
<li>
<a href="https://golem.ph.utexas.edu/category/2020/11/octonions_and_the_standard_mod_5.html">Part 6</a>.  The linear transformations of the exceptional Jordan algebra that preserve the determinant form the exceptional Lie group <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi mathvariant="normal">E</mi> <mn>6</mn></msub></mrow><annotation encoding="application/x-tex">\mathrm{E}_6</annotation></semantics></math>.  How to compute this determinant in terms of 10-dimensional spacetime geometry: that is, scalars, vectors and left-handed spinors in 10d Minkowski spacetime. 
</li>
<li>
<a href="https://golem.ph.utexas.edu/category/2020/11/octonions_and_the_standard_mod_6.html">Part 7</a>.  How to describe the Lie group <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi mathvariant="normal">E</mi> <mn>6</mn></msub></mrow><annotation encoding="application/x-tex">\mathrm{E}_6</annotation></semantics></math> using 10-dimensional spacetime geometry.   This group is built from the double cover of the Lorentz group, left-handed and right-handed spinors, and scalars in 10d Minkowski spacetime.
</li>
<li>
<a href="https://golem.ph.utexas.edu/category/2020/11/octonions_and_the_standard_mod_7.html">Part 8</a>.  A geometrical way to see how <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi mathvariant="normal">E</mi> <mn>6</mn></msub></mrow><annotation encoding="application/x-tex">\mathrm{E}_6</annotation></semantics></math> is connected to 10d spacetime, based on the octonionic projective plane.   
</li>
<li>
<a href="https://golem.ph.utexas.edu/category/2020/11/octonions_and_the_standard_mod_9.html">Part 9</a>.  Duality in projective plane geometry, and how it lets us break the Lie group <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi mathvariant="normal">E</mi> <mn>6</mn></msub></mrow><annotation encoding="application/x-tex">\mathrm{E}_6</annotation></semantics></math> into the Lorentz group, left-handed and right-handed spinors, and scalars in 10d Minkowski spacetime.
</li>
<li>
<a href="https://golem.ph.utexas.edu/category/2020/12/octonions_and_the_standard_mod_8.html">Part 10</a>. Jordan algebras, their symmetry groups, their invariant structures — and how they connect quantum mechanics, special relativity and projective geometry.
</li>
<li>
<a href="https://golem.ph.utexas.edu/category/2020/12/octonions_and_the_standard_mod_10.html">Part 11</a>.  Particle physics on the spacetime given by the exceptional Jordan algebra: a summary of work with Greg Egan and John Huerta.
</li>
<li>
<a href="https://golem.ph.utexas.edu/category/2025/11/the_bioctonionic_plane.html">Part 12</a>.  The bioctonionic projective plane and its connections to algebra, geometry and physics.
</li>
<li>
<a href="https://golem.ph.utexas.edu/category/2025/12/octonions_and_the_standard_mod_11.html">Part 13</a>.   Two ways to embed <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(2) \times \text{SU}(3)</annotation></semantics></math> in <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>Spin</mtext><mo stretchy="false">(</mo><mn>10</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{Spin}(10)</annotation></semantics></math>, and their consequences for particle physics.
</li>
</ul></div>
    </content>
    <updated>2026-07-12T10:54:04Z</updated>
    <published>2025-12-07T16:04:43Z</published>
    <category term="Particle Physics"/>
    <author>
      <name>john</name>
      <email>baez@math.ucr.edu</email>
      <uri>http://math.ucr.edu/home/baez/</uri>
    </author>
    <source>
      <id>tag:golem.ph.utexas.edu,2006:nCategoryCafe/3</id>
      <icon>https://golem.ph.utexas.edu/category/images/favicon.ico</icon>
      <link href="https://golem.ph.utexas.edu/category/" rel="alternate" type="application/xhtml+xml"/>
      <link href="https://golem.ph.utexas.edu/category/atom10.xml" rel="self" type="application/atom+xml"/>
      <link href="https://golem.ph.utexas.edu/category/comments.atom" rel="replies" type="application/atom+xml"/>
      <rights xml:lang="en">Copyright (c) 2026, The n-Category Collective</rights>
      <subtitle xml:lang="en">A group blog on math, physics and philosophy</subtitle>
      <title xml:lang="en">The n-Category Café</title>
      <updated>2026-09-01T10:19:27Z</updated>
    </source>
  </entry>

  <entry xml:lang="en-US">
    <id>https://peterrohde.org/zinalrothorn-4221m/</id>
    <link href="https://peterrohde.org/zinalrothorn-4221m/" rel="alternate" type="text/html"/>
    <link href="https://peterrohde.org/zinalrothorn-4221m/#comments" rel="replies" type="text/html"/>
    <link href="https://peterrohde.org/zinalrothorn-4221m/feed/atom/" rel="replies" type="application/atom+xml"/>
    <title xml:lang="en-US">Zinalrothorn (4,221m)</title>
    <summary xml:lang="en-US">An album of GoPro headcam footage climbing Zinalrothorn (AD, 4,221m) in Switzerland. Full album (49 videos): https://youtube.com/playlist?list=PLFMVEM4j3NZ0</summary>
    <content type="xhtml" xml:lang="en-US"><div xmlns="http://www.w3.org/1999/xhtml"><p class="wp-block-paragraph">An album of GoPro headcam footage climbing Zinalrothorn (AD, 4,221m) in Switzerland.</p>



<p class="wp-block-paragraph">Full album (49 videos): <a href="https://youtube.com/playlist?list=PLFMVEM4j3NZ0">https://youtube.com/playlist?list=PLFMVEM4j3NZ0</a></p>



<figure class="wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio"><div class="wp-block-embed__wrapper">

</div></figure>



<p class="wp-block-paragraph"/></div>
    </content>
    <updated>2026-07-10T01:45:41Z</updated>
    <published>2026-07-10T01:45:41Z</published>
    <category scheme="https://peterrohde.org" term="Climbing"/>
    <category scheme="https://peterrohde.org" term="zinalrothorn"/>
    <author>
      <name>Peter Rohde</name>
      <uri>https://www.peterrohde.org</uri>
    </author>
    <source>
      <id>https://peterrohde.org/feed/atom/</id>
      <icon>https://i0.wp.com/peterrohde.org/wp-content/uploads/2024/02/IMG_5895.jpeg?fit=32%2C32&amp;ssl=1</icon>
      <link href="https://peterrohde.org" rel="alternate" type="text/html"/>
      <link href="https://peterrohde.org/feed/atom/" rel="self" type="application/atom+xml"/>
      <subtitle xml:lang="en-US">Quantum computer scientist &amp; alpinist.</subtitle>
      <title xml:lang="en-US">Peter Rohde</title>
      <updated>2026-07-24T07:40:35Z</updated>
    </source>
  </entry>

  <entry xml:lang="en-GB">
    <id>https://andrewjaffe.net/?p=966</id>
    <link href="https://andrewjaffe.net/blog/2026/07/what-my-thirty-year-old-algorithm-taught-an-ai/" rel="alternate" type="text/html"/>
    <title>What My Thirty-Year-Old Algorithm Taught an AI</title>
    <summary>As a scientist in the later stages of my career, the managerial and mentorship load has increased, leaving less time for math and programming. These technical activities were also why I wanted to be a scientist in the first place, and I regretted losing the time for this hands-on research. Formerly the core of my […]</summary>
    <content type="xhtml"><div xmlns="http://www.w3.org/1999/xhtml"><p>As a scientist in the <a href="https://www.imperial.ac.uk/events/205637/professor-andrew-jaffe-60th-birthday-conference/">later stages of my career</a>, the managerial and mentorship load has increased, leaving less time for math and programming. These technical activities were also why I wanted to be a scientist in the first place, and I regretted losing the time for this hands-on research. Formerly the core of my scientific work, these activities require sustained attention, hours at a time, a resource now in short supply.</p>
<p>Also like many scientists, I’ve watched the coming of artificial intelligence over the last few years with growing interest. The technical predecessors and underlying substructure of these large language models (<a href="https://en.wikipedia.org/wiki/Large_language_model">LLMs</a>) are <a href="https://en.wikipedia.org/wiki/Neural_network_(machine_learning)" title="Title">neural networks</a>, a computer technology that has already begun to revolutionise many scientific fields, including cosmology and astrophysics. I wrote about LLMs in my recent book, <a href="https://andrewjaffe.net/the-random-universe"><em>The Random Universe</em></a>, but hadn’t really used them for my own work.</p>
<p>So I started using <a href="https://claude.ai/new">Anthropic’s Claude</a> (no particular reason for this choice, except that some colleagues had had positive coding experiences with it), figured out how to <a href="https://code.claude.com/docs/en/overview">wire it up at the command line</a>, and started talking to it. (After, yes, paying a subscription fee.)</p>
<p>My first project with one of these newly-capable AIs was a minor reanalysis of our <a href="https://www.esa.int/Science_Exploration/Space_Science/Planck">data from the <em>Planck</em> satellite</a>, seeing how the cosmological inferences respond to small changes in the data, part of the work <a href="https://arxiv.org/abs/2606.29842">for a recent paper</a>. I knew exactly what I needed to do, but it was a lot of plumbing: getting disparate bits of software written by other people to work together in a way different from their authors had intended. I figured I could do it in a few days of solid work.</p>
<p>Instead, I pointed Claude to the draft of the paper, along with <a href="https://pla.esac.esa.int/#home">publicly available Planck data and code repositories</a>, and asked it to implement the paper’s algorithms with Planck’s data. A few hours later, there was code, alongside tables, figures, and lots of tests to make sure I could trust — and understand — the results. It wasn’t (we weren’t) just able to write and debug the code quickly, it was able to run it, again and again, making small tweaks to the inputs and the code itself, and to the figures it generated, now part of our recent paper.</p>
<p>Next was something more involved: colleagues and I have created a program called <a href="https://arxiv.org/abs/2305.16134">Almanac</a> to analyse specific kinds of cosmological data. We wanted to apply Almanac to some new results, in a regime in which it hadn’t really been tested (a very small patch, around 1% of the total sphere of the sky). Almanac helps us measure a curve called the power spectrum, which <a href="https://andrewjaffe.net/blog/2018/07/almost_the_end/">I’ve written about before</a>.</p>
<p>I pointed Claude to our code, our papers, and to the new data, and explained the problem. Even ensuring that the (poorly documented) data was in a form that our code could understand would have taken me a few hours, but Claude suggested and implemented a series of tests to ensure that everything was self-consistent.</p>
<p>Almanac is a <a href="https://en.wikipedia.org/wiki/Monte_Carlo_method">Monte Carlo sampler</a>: because we are trying to understand the probability distribution of matter in the Universe, using noisy and incomplete data, the answer to our questions can only be given as probability distributions. Almanac is essentially a very complicated random number generator, and you can do self-consistency checks to see whether it is producing random numbers with the right properties.</p>
<p>Almanac’s results failed these tests. Could we understand why? Could we fix it? Now, rather than just plumbing, I needed Claude to help me diagnose the problem. It took a while.</p>
<p>Was it a simple bug? We did a series of tests showing that Almanac does work, essentially perfectly, on simpler datasets covering much more of the sky. In fact, this gave me the opportunity to ask Claude to write some new software, based on a paper and related code that I first wrote, <a href="https://arxiv.org/abs/astro-ph/9708203">with Dick Bond and Lloyd Knox, about 30 years ago</a>. This older algorithm (“BJK”, from our initials) answered the same statistical question as Almanac, using a very different technique. On large areas of sky, Almanac and this older algorithm got the same answer — the code works.</p>
<p>We went on a long rabbit-hole modifying the details of Almanac’s setup, making it more <a href="https://mc-stan.org/docs/reference-manual/mcmc.html#hmc-algorithm-parameters">similar to other state of the art samplers</a>. This change also didn’t solve our problem, although it seems to help on the margins. I made one suggestion that I thought would help, based on our long-ago experience with the BJK algorithm, bundling up some of the numbers we were trying to determine into “bands”. I don’t know if Claude would have come up with this idea on its own, and it took a while to get the details right. In fact, Claude would sometimes declare premature victory, admitting its mistakes only when I pointed them out.</p>
<p>It worked, eventually. After a lot of iterations, we transformed a problem unsolvable with the previous version of the code to one that was, well, easy.</p>
<p>But it only worked because my knowledge and experience — literally decades working on problems of this sort — meshed with Claude’s own “talents” — quick turnaround, patience, and encyclopaedic, if not always discriminating, knowledge of computing and of at least some aspects of the underlying science, statistics, and mathematics.</p>
<p>And it was fun! I thought that I liked programming, but I am very happy to have Claude do most of the grunt-work for me. The quick turnaround, and not having to sweat the details of writing and running re-writing and re-running program after program, was a delight.</p>
<p>In many way, working with Claude was like working with a junior colleague. But Claude is not a colleague, but a machine. And, as <a href="https://arxiv.org/abs/2602.10181">David Hogg has advocated</a>, the point of doing astrophysics, a beautiful but useless field of science, is exactly the training and fulfilment of the people doing it. That has at least two implications. First, given how much my own experience was necessary to getting good results, that means we had better make sure that we are training humans, not just better LLMs. Second, no matter how delightful the interactions, they mustn’t replace training our students and collaborating with our colleagues.</p>
<p>(This post was written by me, not by Claude, though I did ask it to suggest a title — and this sentence.)</p></div>
    </content>
    <updated>2026-07-09T15:10:19Z</updated>
    <published>2026-07-09T15:10:19Z</published>
    <category term="Science"/>
    <category term="AI"/>
    <category term="CMB"/>
    <category term="computers"/>
    <category term="LLM"/>
    <category term="Planck"/>
    <author>
      <name>defjaf</name>
    </author>
    <source>
      <id>https://andrewjaffe.net</id>
      <logo>https://andrewjaffe.net/wp-content/uploads/2024/04/cropped-AHJ-32x32.png</logo>
      <link href="https://andrewjaffe.net/feed/" rel="self" type="application/rss+xml"/>
      <link href="https://andrewjaffe.net" rel="alternate" type="text/html"/>
      <subtitle>by Andrew Jaffe</subtitle>
      <title>Andrew H. Jaffe</title>
      <updated>2026-08-02T13:54:05Z</updated>
    </source>
  </entry>

  <entry xml:lang="en-US">
    <id>https://peterrohde.org/?p=7039</id>
    <link href="https://peterrohde.org/aiguilles-crochues-traverse-2840m/" rel="alternate" type="text/html"/>
    <link href="https://peterrohde.org/aiguilles-crochues-traverse-2840m/#comments" rel="replies" type="text/html"/>
    <link href="https://peterrohde.org/aiguilles-crochues-traverse-2840m/feed/atom/" rel="replies" type="application/atom+xml"/>
    <title xml:lang="en-US">Aiguilles Crochues Traverse (2,840m)</title>
    <summary xml:lang="en-US">An album of GoPro headcam footage from climbing the Aiguilles Crochues Traverse (PD, 2,840m) near Chamonix, France in 2022. Full playlist (45 videos): https://youtube.com/playlist?list=PLM4i-DL0BZ0Q</summary>
    <content type="xhtml" xml:lang="en-US"><div xmlns="http://www.w3.org/1999/xhtml"><p class="wp-block-paragraph">An album of GoPro headcam footage from climbing the Aiguilles Crochues Traverse (PD, 2,840m) near Chamonix, France in 2022.</p>



<p class="wp-block-paragraph">Full playlist (45 videos): <a href="https://youtube.com/playlist?list=PLM4i-DL0BZ0Q&amp;si=r_zPqO5Ng5bjzWnJ">https://youtube.com/playlist?list=PLM4i-DL0BZ0Q</a></p>



<figure class="wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio"><div class="wp-block-embed__wrapper">

</div></figure></div>
    </content>
    <updated>2026-07-01T03:18:28Z</updated>
    <published>2026-07-01T03:18:26Z</published>
    <category scheme="https://peterrohde.org" term="Climbing"/>
    <category scheme="https://peterrohde.org" term="Aiguilles Crochues Traverse"/>
    <category scheme="https://peterrohde.org" term="Crochues Traverse"/>
    <author>
      <name>Peter Rohde</name>
      <uri>https://www.peterrohde.org</uri>
    </author>
    <source>
      <id>https://peterrohde.org/feed/atom/</id>
      <icon>https://i0.wp.com/peterrohde.org/wp-content/uploads/2024/02/IMG_5895.jpeg?fit=32%2C32&amp;ssl=1</icon>
      <link href="https://peterrohde.org" rel="alternate" type="text/html"/>
      <link href="https://peterrohde.org/feed/atom/" rel="self" type="application/atom+xml"/>
      <subtitle xml:lang="en-US">Quantum computer scientist &amp; alpinist.</subtitle>
      <title xml:lang="en-US">Peter Rohde</title>
      <updated>2026-07-24T07:40:35Z</updated>
    </source>
  </entry>

  <entry xml:lang="en-US">
    <id>https://peterrohde.org/?p=7016</id>
    <link href="https://peterrohde.org/frenchmans-cap-sydney-route/" rel="alternate" type="text/html"/>
    <link href="https://peterrohde.org/frenchmans-cap-sydney-route/#comments" rel="replies" type="text/html"/>
    <link href="https://peterrohde.org/frenchmans-cap-sydney-route/feed/atom/" rel="replies" type="application/atom+xml"/>
    <title xml:lang="en-US">Frenchmans Cap (Sydney Route)</title>
    <summary xml:lang="en-US">Footage from our climbing trip to Frenchmans Cap, Tasmania (Australian grade 17, 380m) in 2022. Full playlist (47 videos): https://youtube.com/playlist?list=PLT0z6qQjCS3c</summary>
    <content type="xhtml" xml:lang="en-US"><div xmlns="http://www.w3.org/1999/xhtml"><p class="wp-block-paragraph">Footage from our climbing trip to Frenchmans Cap, Tasmania (Australian grade 17, 380m) in 2022.</p>



<p class="wp-block-paragraph">Full playlist (47 videos): <a href="https://youtube.com/playlist?list=PLT0z6qQjCS3c">https://youtube.com/playlist?list=PLT0z6qQjCS3c</a></p>



<figure class="wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio"><div class="wp-block-embed__wrapper">

</div></figure></div>
    </content>
    <updated>2026-06-30T03:07:51Z</updated>
    <published>2026-06-27T02:24:15Z</published>
    <category scheme="https://peterrohde.org" term="Climbing"/>
    <category scheme="https://peterrohde.org" term="Frenchmans cap"/>
    <category scheme="https://peterrohde.org" term="Sydney Route"/>
    <author>
      <name>Peter Rohde</name>
      <uri>https://www.peterrohde.org</uri>
    </author>
    <source>
      <id>https://peterrohde.org/feed/atom/</id>
      <icon>https://i0.wp.com/peterrohde.org/wp-content/uploads/2024/02/IMG_5895.jpeg?fit=32%2C32&amp;ssl=1</icon>
      <link href="https://peterrohde.org" rel="alternate" type="text/html"/>
      <link href="https://peterrohde.org/feed/atom/" rel="self" type="application/atom+xml"/>
      <subtitle xml:lang="en-US">Quantum computer scientist &amp; alpinist.</subtitle>
      <title xml:lang="en-US">Peter Rohde</title>
      <updated>2026-07-24T07:40:35Z</updated>
    </source>
  </entry>

  <entry xml:lang="en-US">
    <id>https://peterrohde.org/?p=7026</id>
    <link href="https://peterrohde.org/triglav-slovenia-2864m/" rel="alternate" type="text/html"/>
    <link href="https://peterrohde.org/triglav-slovenia-2864m/#comments" rel="replies" type="text/html"/>
    <link href="https://peterrohde.org/triglav-slovenia-2864m/feed/atom/" rel="replies" type="application/atom+xml"/>
    <title xml:lang="en-US">Triglav, Slovenia (2,864m)</title>
    <summary xml:lang="en-US">GoPro headcam footage from climbing Triglav (2,864m), highest mountain in Slovenia, via ferrata. Climbed in 2022. Full playlist (40 videos): https://youtube.com/playlist?list=PLZgovD57Nsr4</summary>
    <content type="xhtml" xml:lang="en-US"><div xmlns="http://www.w3.org/1999/xhtml"><p class="wp-block-paragraph">GoPro headcam footage from climbing Triglav (2,864m), highest mountain in Slovenia, via ferrata. Climbed in 2022.</p>



<p class="wp-block-paragraph">Full playlist (40 videos): <a href="https://youtube.com/playlist?list=PLZgovD57Nsr4">https://youtube.com/playlist?list=PLZgovD57Nsr4</a></p>



<figure class="wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio"><div class="wp-block-embed__wrapper">

</div></figure></div>
    </content>
    <updated>2026-06-30T02:44:23Z</updated>
    <published>2026-06-30T02:44:22Z</published>
    <category scheme="https://peterrohde.org" term="Climbing"/>
    <category scheme="https://peterrohde.org" term="ferrata"/>
    <category scheme="https://peterrohde.org" term="Triglav"/>
    <author>
      <name>Peter Rohde</name>
      <uri>https://www.peterrohde.org</uri>
    </author>
    <source>
      <id>https://peterrohde.org/feed/atom/</id>
      <icon>https://i0.wp.com/peterrohde.org/wp-content/uploads/2024/02/IMG_5895.jpeg?fit=32%2C32&amp;ssl=1</icon>
      <link href="https://peterrohde.org" rel="alternate" type="text/html"/>
      <link href="https://peterrohde.org/feed/atom/" rel="self" type="application/atom+xml"/>
      <subtitle xml:lang="en-US">Quantum computer scientist &amp; alpinist.</subtitle>
      <title xml:lang="en-US">Peter Rohde</title>
      <updated>2026-07-24T07:40:35Z</updated>
    </source>
  </entry>

  <entry xml:lang="en">
    <id>tag:golem.ph.utexas.edu,2026:%2Fcategory%2F3.3628</id>
    <link href="https://golem.ph.utexas.edu/category/2026/06/octonions_and_the_standard_mod_13.html" rel="alternate" type="application/xhtml+xml"/>
    <title xml:lang="en">Octonions and the Standard Model (Part 14)</title>
    <summary xml:lang="en">A new characterization of the Standard Model gauge group as the group of symmetries of an octonionic qutrit that restrict to act as unitary operators on an ordinary qutrit and, within that, a qubit.</summary>
    <content type="xhtml" xml:lang="en"><div xmlns="http://www.w3.org/1999/xhtml"><div><a href="http://golem.ph.utexas.edu/~distler/blog/mathml.html"><img alt="MathML-enabled post (click for more details)." class="mathlogo" src="https://golem.ph.utexas.edu/~distler/blog/images/MathML.png" title="MathML-enabled post (click for details)."/></a></div>

<p>Paul Schwahn and I have come out with a new paper about octonions and the Standard Model:</p>

<ul>
<li><a href="https://arxiv.org/abs/2606.15235">The Standard Model gauge group from the exceptional Jordan algebra</a></li>
</ul>

<p>It builds on things I’ve discussed here, but it goes further.   Let me explain a bit.</p>

<div><a href="http://golem.ph.utexas.edu/~distler/blog/mathml.html"><img alt="MathML-enabled post (click for more details)." class="mathlogo" src="https://golem.ph.utexas.edu/~distler/blog/images/MathML.png" title="MathML-enabled post (click for details)."/></a></div>

<p>A bit is just a binary alternative: 1 or 0, true or false.  That’s how it works in classical logic.  We could also have a ‘trit’, meaning 3 alternatives. </p>

<p>In quantum physics we instead have qubits and qutrits.</p>

<p>Qubits and qutrits are usually described using complex numbers.  The algebra of observables of a qubit is the <a href="https://ncatlab.org/nlab/show/Jordan+algebra">Jordan algebra</a> <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>𝔥</mi> <mn>2</mn></msub><mo stretchy="false">(</mo><mi>ℂ</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\mathfrak{h}_2(\mathbb{C})</annotation></semantics></math>, consisting of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>2</mn><mo>×</mo><mn>2</mn></mrow><annotation encoding="application/x-tex">2 \times 2</annotation></semantics></math> self-adjoint complex matrices.   Similarly, the algebra of observables of an qutrit is the Jordan algebra <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>𝔥</mi> <mn>3</mn></msub><mo stretchy="false">(</mo><mi>ℂ</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\mathfrak{h}_3(\mathbb{C})</annotation></semantics></math>, consisting of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>3</mn><mo>×</mo><mn>3</mn></mrow><annotation encoding="application/x-tex">3 \times 3</annotation></semantics></math> self-adjoint complex matrices.</p>

<p>We can also study systems with more than 3 alternative ways to be.  They work the same way, using the Jordan algebras <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>𝔥</mi> <mi>n</mi></msub><mo stretchy="false">(</mo><mi>ℂ</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\mathfrak{h}_n(\mathbb{C})</annotation></semantics></math> with <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>n</mi><mo>&gt;</mo><mn>3</mn><mo>.</mo></mrow><annotation encoding="application/x-tex">n \gt 3.</annotation></semantics></math> </p>

<p>But we can also do quantum mechanics using other number systems!   The options have been mapped out, and the largest allowed number system for this purpose is the algebra of <a href="https://math.ucr.edu/home/baez/octonions/">octonions</a>.</p>

<p>A weird thing is that Jordan algebras built using octonions can describe qutrits, but not quantum systems with more than 3 alternative ways to be.   The  algebra of observables of an octonionic qutrit is the so-called ‘exceptional’ Jordan algebra <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>𝔥</mi> <mn>3</mn></msub><mo stretchy="false">(</mo><mi>𝕆</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\mathfrak{h}_3(\mathbb{O})</annotation></semantics></math>, consisting of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>3</mn><mo>×</mo><mn>3</mn></mrow><annotation encoding="application/x-tex">3 \times 3</annotation></semantics></math> self-adjoint octonion matrices.  What makes it exceptional is that <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>𝔥</mi> <mi>n</mi></msub><mo stretchy="false">(</mo><mi>𝕆</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\mathfrak{h}_n(\mathbb{O})</annotation></semantics></math> is not a Jordan algebra when <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>n</mi></mrow><annotation encoding="application/x-tex">n</annotation></semantics></math> is bigger than 3.</p>

<p>So, there’s something special about octonionic qutrits — and it turns out that every symmetry in the gauge group of the Standard Model is a symmetry of an octonionic qutrit!</p>

<p>Not every symmetry of an octonionic qutrit is a symmetry of the Standard Model.  But those that do have a simple description.  They are those that restrict to give symmetries of an ordinary qutrit sitting inside the octonionic qutrit… and an ordinary qubit sitting inside that!</p>

<p>That sounds exciting, but also vague, so let me make it precise.</p>

<p>While lots of people say the gauge group of the Standard Model of particle physics is <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>U</mtext><mo stretchy="false">(</mo><mn>1</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{U}(1) \times \text{SU}(2) \times \text{SU}(3)</annotation></semantics></math>, in fact a certain subgroup of this acts trivially on all known particles.  If we mod out by that, we’re left with</p>

<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mtable columnalign="center center left" displaystyle="false" rowspacing="0.5ex"><mtr><mtd><mtext>S</mtext><mo stretchy="false">(</mo><mtext>U</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>U</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo><mo stretchy="false">)</mo></mtd> <mtd><mo>=</mo></mtd> <mtd><mo maxsize="1.8em" minsize="1.8em">{</mo><mi>x</mi><mo>∈</mo><mtext>SU</mtext><mo stretchy="false">(</mo><mn>5</mn><mo stretchy="false">)</mo><mo>:</mo><mi>x</mi><mo>=</mo><mrow><mo>(</mo><mtable columnalign="center center center center center" displaystyle="false" rowspacing="0.5ex"><mtr><mtd><mo>*</mo></mtd> <mtd><mo>*</mo></mtd> <mtd><mn>0</mn></mtd> <mtd><mn>0</mn></mtd> <mtd><mn>0</mn></mtd></mtr> <mtr><mtd><mo>*</mo></mtd> <mtd><mo>*</mo></mtd> <mtd><mn>0</mn></mtd> <mtd><mn>0</mn></mtd> <mtd><mn>0</mn></mtd></mtr> <mtr><mtd><mn>0</mn></mtd> <mtd><mn>0</mn></mtd> <mtd><mo>*</mo></mtd> <mtd><mo>*</mo></mtd> <mtd><mo>*</mo></mtd></mtr> <mtr><mtd><mn>0</mn></mtd> <mtd><mn>0</mn></mtd> <mtd><mo>*</mo></mtd> <mtd><mo>*</mo></mtd> <mtd><mo>*</mo></mtd></mtr> <mtr><mtd><mn>0</mn></mtd> <mtd><mn>0</mn></mtd> <mtd><mo>*</mo></mtd> <mtd><mo>*</mo></mtd> <mtd><mo>*</mo></mtd></mtr></mtable><mo>)</mo></mrow><mspace width="0.27778em"/><mo maxsize="1.8em" minsize="1.8em">}</mo><mo>.</mo></mtd></mtr></mtable></mrow><annotation encoding="application/x-tex">  \begin{array}{ccl} 
 \text{S}(\text{U}(2) \times \text{U}(3)) &amp;= &amp;
\Big\{ x \in \text{SU}(5) : x = 
\left( 
\begin{array}{c c c c c}
\ast &amp; \ast &amp; 0 &amp; 0 &amp; 0 \\
\ast &amp; \ast &amp; 0 &amp; 0 &amp; 0 \\
0 &amp; 0 &amp; \ast &amp; \ast &amp; \ast \\
0 &amp; 0 &amp; \ast &amp; \ast &amp; \ast \\
0 &amp; 0 &amp; \ast &amp; \ast &amp; \ast 
\end{array}
\right) \; \Big\}.  
\end{array}
</annotation></semantics></math></p>

<p>and this is the group I’m talking about.</p>

<p>We proved two theorems describing this group in terms of the symmetries of an octonionic qutrit.  The group of automorphisms of the exceptional Jordan algebra <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>𝔥</mi> <mn>3</mn></msub><mo stretchy="false">(</mo><mi>𝕆</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\mathfrak{h}_3(\mathbb{O})</annotation></semantics></math> is a 52-dimensional Lie group known affectionately as <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mtext>F</mtext> <mn>4</mn></msub></mrow><annotation encoding="application/x-tex">\text{F}_4</annotation></semantics></math> — so that’s what I mean by the symmetries of an octonionic qutrit.</p>

<p>Here’s our main result:</p>

<p><strong>Theorem 1.</strong>  <em>Suppose <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>X</mi><mo>,</mo><mi>B</mi></mrow><annotation encoding="application/x-tex">X,B</annotation></semantics></math> are Jordan subalgebras of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>𝔥</mi> <mn>3</mn></msub><mo stretchy="false">(</mo><mi>𝕆</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\mathfrak{h}_3(\mathbb{O})</annotation></semantics></math> such that</em></p>

<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mi>X</mi><mo>≅</mo><msub><mi>𝔥</mi> <mn>2</mn></msub><mo stretchy="false">(</mo><mi>ℂ</mi><mo stretchy="false">)</mo><mo>,</mo><mspace width="0.27778em"/><mspace width="0.27778em"/><mi>B</mi><mo>≅</mo><msub><mi>𝔥</mi> <mn>3</mn></msub><mo stretchy="false">(</mo><mi>ℂ</mi><mo stretchy="false">)</mo><mo>,</mo><mspace width="0.27778em"/><mspace width="0.27778em"/><mi>X</mi><mo>⊂</mo><mi>B</mi><mo>.</mo></mrow><annotation encoding="application/x-tex">  X \cong \mathfrak{h}_2(\mathbb{C}), \;\; B \cong \mathfrak{h}_3(\mathbb{C}), \;\; X \subset B. </annotation></semantics></math></p>

<p><em>Then</em></p>

<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mtext>Stab</mtext><mo stretchy="false">(</mo><mi>X</mi><mo stretchy="false">)</mo><mo>∩</mo><mtext>Stab</mtext><mo stretchy="false">(</mo><mi>B</mi><msub><mo stretchy="false">)</mo> <mn>0</mn></msub><mo>≅</mo><mtext>S</mtext><mo stretchy="false">(</mo><mtext>U</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>U</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo><mo stretchy="false">)</mo><mo>.</mo></mrow><annotation encoding="application/x-tex">     \text{Stab}(X) \cap \text{Stab}(B)_0 \cong \text{S}(\text{U}(2) \times \text{U}(3)). </annotation></semantics></math></p>

<p>Here <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>Stab</mtext><mo stretchy="false">(</mo><mi>X</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{Stab}(X)</annotation></semantics></math> is the stabilizer of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>X</mi></mrow><annotation encoding="application/x-tex">X</annotation></semantics></math> — that is, the subgroup of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mtext>F</mtext> <mn>4</mn></msub></mrow><annotation encoding="application/x-tex">\text{F}_4</annotation></semantics></math> consisting of elements that map <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>X</mi></mrow><annotation encoding="application/x-tex">X</annotation></semantics></math> to itself — while <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>Stab</mtext><mo stretchy="false">(</mo><mi>B</mi><msub><mo stretchy="false">)</mo> <mn>0</mn></msub></mrow><annotation encoding="application/x-tex">\text{Stab}(B)_0</annotation></semantics></math> is the identity component of the stabilizer of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>B</mi></mrow><annotation encoding="application/x-tex">B</annotation></semantics></math>.   </p>

<p>This ‘identity component’ business is rather sneaky, but it turns out that guys in <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>Stab</mtext><mo stretchy="false">(</mo><mi>B</mi><msub><mo stretchy="false">)</mo> <mn>0</mn></msub></mrow><annotation encoding="application/x-tex">\text{Stab}(B)_0</annotation></semantics></math> are symmetries of an ordinary qutrit that can be described as <em>unitary</em> operators on <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>ℂ</mi></mrow><annotation encoding="application/x-tex">\mathbb{C}</annotation></semantics></math>, while <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>Stab</mtext><mo stretchy="false">(</mo><mi>B</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{Stab}(B)</annotation></semantics></math> also contains those symmetries that are described by <em>antiunitary</em> operators.  The CPT symmetry of the Standard Model is antiunitary, for example.</p>

<p>Theorem 1 emerged from a related result, which grew out of the work of Todorov and Dubois-Violette:</p>

<p><strong>Theorem 2.</strong>  <em>Suppose <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>A</mi><mo>,</mo><mi>B</mi></mrow><annotation encoding="application/x-tex">A,B</annotation></semantics></math> are Jordan subalgebras of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>𝔥</mi> <mn>3</mn></msub><mo stretchy="false">(</mo><mi>𝕆</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\mathfrak{h}_3(\mathbb{O})</annotation></semantics></math> such that</em></p>

<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mi>A</mi><mo>≅</mo><msub><mi>𝔥</mi> <mn>2</mn></msub><mo stretchy="false">(</mo><mi>𝕆</mi><mo stretchy="false">)</mo><mo>,</mo><mspace width="0.27778em"/><mspace width="0.27778em"/><mi>B</mi><mo>≅</mo><msub><mi>𝔥</mi> <mn>3</mn></msub><mo stretchy="false">(</mo><mi>ℂ</mi><mo stretchy="false">)</mo><mo>,</mo><mspace width="0.27778em"/><mspace width="0.27778em"/><mi>A</mi><mo>∩</mo><mi>B</mi><mo>≅</mo><msub><mi>𝔥</mi> <mn>2</mn></msub><mo stretchy="false">(</mo><mi>ℂ</mi><mo stretchy="false">)</mo><mo>.</mo></mrow><annotation encoding="application/x-tex"> A \cong \mathfrak{h}_2(\mathbb{O}), \;\; B \cong \mathfrak{h}_3(\mathbb{C}), \;\; A \cap B \cong \mathfrak{h}_2(\mathbb{C}).  </annotation></semantics></math></p>

<p><em>Then</em></p>

<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mtext>Stab</mtext><mo stretchy="false">(</mo><mi>A</mi><mo stretchy="false">)</mo><mo>∩</mo><mtext>Stab</mtext><mo stretchy="false">(</mo><mi>B</mi><msub><mo stretchy="false">)</mo> <mn>0</mn></msub><mo>≅</mo><mtext>S</mtext><mo stretchy="false">(</mo><mtext>U</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>U</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo><mo stretchy="false">)</mo><mo>.</mo></mrow><annotation encoding="application/x-tex"> \text{Stab}(A) \cap \text{Stab}(B)_0 \cong \text{S}(\text{U}(2) \times \text{U}(3)). </annotation></semantics></math></p>

<p>Todorov and Dubois–Violette proved this for a certain standard choice of subalgebras <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>A</mi></mrow><annotation encoding="application/x-tex">A</annotation></semantics></math> and <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>B</mi></mrow><annotation encoding="application/x-tex">B</annotation></semantics></math>.  Thus, the challenge in proving Theorem 2 was to show that every other choice can be mapped to this standard choice using the action of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mtext>F</mtext> <mn>4</mn></msub></mrow><annotation encoding="application/x-tex">\text{F}_4</annotation></semantics></math>.  This shows that the theorem is not an artifact of a specific choice, but rather a general fact.</p>

<p>How do we prove these results?   </p>

<p>We start by constructing the octonion product from <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(3)</annotation></semantics></math>-invariant operations on <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>ℂ</mi></mrow><annotation encoding="application/x-tex">\mathbb{C}</annotation></semantics></math> and <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msup><mi>ℂ</mi> <mn>3</mn></msup></mrow><annotation encoding="application/x-tex">\mathbb{C}^3</annotation></semantics></math>.   We then use this description to reprove Todorov and Dubois–Violette’s special case of Theorem 2.   Then we show that <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mtext>F</mtext> <mn>4</mn></msub></mrow><annotation encoding="application/x-tex">\text{F}_4</annotation></semantics></math> acts transitively on the set of subalgebras of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>𝔥</mi> <mn>3</mn></msub><mo stretchy="false">(</mo><mi>𝕆</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\mathfrak{h}_3(\mathbb{O})</annotation></semantics></math> that are isomorphic to <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>𝔥</mi> <mn>3</mn></msub><mo stretchy="false">(</mo><mi>ℂ</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\mathfrak{h}_3(\mathbb{C})</annotation></semantics></math>.   We also show every Jordan subalgebra of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>𝔥</mi> <mn>3</mn></msub><mo stretchy="false">(</mo><mi>𝕆</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\mathfrak{h}_3(\mathbb{O})</annotation></semantics></math> isomorphic to <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>𝔥</mi> <mn>2</mn></msub><mo stretchy="false">(</mo><mi>ℂ</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\mathfrak{h}_2(\mathbb{C})</annotation></semantics></math> is contained in a unique Jordan subalgebra isomorphic to <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>𝔥</mi> <mn>2</mn></msub><mo stretchy="false">(</mo><mi>𝕆</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\mathfrak{h}_2(\mathbb{O})</annotation></semantics></math>.   This lets us prove that <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mtext>F</mtext> <mn>4</mn></msub></mrow><annotation encoding="application/x-tex">\text{F}_4</annotation></semantics></math> acts transitively on the set of pairs of Jordan subalgebra <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>A</mi><mo>,</mo><mi>B</mi><mo>⊂</mo><msub><mi>𝔥</mi> <mn>3</mn></msub><mo stretchy="false">(</mo><mi>𝕆</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">A, B \subset \mathfrak{h}_3(\mathbb{O})</annotation></semantics></math> with <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>A</mi><mo>≅</mo><msub><mi>𝔥</mi> <mn>2</mn></msub><mo stretchy="false">(</mo><mi>𝕆</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">A \cong \mathfrak{h}_2(\mathbb{O})</annotation></semantics></math>, <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>B</mi><mo>≅</mo><msub><mi>𝔥</mi> <mn>3</mn></msub><mo stretchy="false">(</mo><mi>ℂ</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">B \cong \mathfrak{h}_3(\mathbb{C})</annotation></semantics></math> and <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>A</mi><mo>∩</mo><mi>B</mi><mo>≅</mo><msub><mi>𝔥</mi> <mn>3</mn></msub><mo stretchy="false">(</mo><mi>ℂ</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">A \cap B \cong \mathfrak{h}_3(\mathbb{C})</annotation></semantics></math>.  Theorem 2 then follows from Todorov and Dubois-Violette’s special case.  We conclude by using these results to prove Theorem 1.</p>

<p>However, if you want to get into the details of the physics, the interesting part is how the strong force gauge group <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>SU</mtext><mo stretchy="false">(</mo><mn>3</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{SU}(3)</annotation></semantics></math> and the electroweak <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mtext>S</mtext><mo stretchy="false">(</mo><mtext>U</mtext><mo stretchy="false">(</mo><mn>1</mn><mo stretchy="false">)</mo><mo>×</mo><mtext>U</mtext><mo stretchy="false">(</mo><mn>2</mn><mo stretchy="false">)</mo><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\text{S}(\text{U}(1) \times \text{U}(2))</annotation></semantics></math> show up from the relation between octonionic qutrits, complex qutrits and complex qubits.  You’ll see that in the proof of Lemma 4. </p>

<p>And if you want to get into the details of the math, the main interesting thing here is the use of Jordan algebra technology like ‘Peirce decompositions’ and ‘Jordan frames’ to figure out what it must be like when you have a Jordan algebra <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>𝔥</mi> <mn>2</mn></msub><mo stretchy="false">(</mo><mi>𝕃</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\mathfrak{h}_2(\mathbb{L})</annotation></semantics></math> or <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>𝔥</mi> <mn>3</mn></msub><mo stretchy="false">(</mo><mi>𝕃</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\mathfrak{h}_3(\mathbb{L})</annotation></semantics></math> sitting inside <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>𝔥</mi> <mn>3</mn></msub><mo stretchy="false">(</mo><mi>𝕂</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\mathfrak{h}_3(\mathbb{K})</annotation></semantics></math>, where <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>𝕃</mi></mrow><annotation encoding="application/x-tex">\mathbb{L}</annotation></semantics></math> is some normed division algebra contained in a bigger normed division algebra <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>𝕂</mi></mrow><annotation encoding="application/x-tex">\mathbb{K}</annotation></semantics></math>.  </p>

<p>What it all ‘really means’, if anything, is a question for later.  It could be just a coincidence.   Of course I hope not.</p></div>
    </content>
    <updated>2026-06-16T15:57:43Z</updated>
    <published>2026-06-13T01:00:00Z</published>
    <category term="Particle Physics"/>
    <author>
      <name>john</name>
      <email>baez@math.ucr.edu</email>
      <uri>http://math.ucr.edu/home/baez/</uri>
    </author>
    <source>
      <id>tag:golem.ph.utexas.edu,2006:nCategoryCafe/3</id>
      <icon>https://golem.ph.utexas.edu/category/images/favicon.ico</icon>
      <link href="https://golem.ph.utexas.edu/category/" rel="alternate" type="application/xhtml+xml"/>
      <link href="https://golem.ph.utexas.edu/category/atom10.xml" rel="self" type="application/atom+xml"/>
      <link href="https://golem.ph.utexas.edu/category/comments.atom" rel="replies" type="application/atom+xml"/>
      <rights xml:lang="en">Copyright (c) 2026, The n-Category Collective</rights>
      <subtitle xml:lang="en">A group blog on math, physics and philosophy</subtitle>
      <title xml:lang="en">The n-Category Café</title>
      <updated>2026-09-01T10:19:27Z</updated>
    </source>
  </entry>

  <entry xml:lang="en">
    <id>tag:golem.ph.utexas.edu,2026:%2Fcategory%2F3.3638</id>
    <link href="https://golem.ph.utexas.edu/category/2026/06/a_new_blog.html" rel="alternate" type="application/xhtml+xml"/>
    <title xml:lang="en">A New Blog</title>
    <summary xml:lang="en">Readers may have noticed that I haven't been very active here for a while. That isn't because I haven't felt the "blogging urge", but because I felt that the things I want to blog about right now wouldn't be...</summary>
    <content type="xhtml" xml:lang="en"><div xmlns="http://www.w3.org/1999/xhtml"><div><a href="http://golem.ph.utexas.edu/~distler/blog/mathml.html"><img alt="MathML-enabled post (click for more details)." class="mathlogo" src="https://golem.ph.utexas.edu/~distler/blog/images/MathML.png" title="MathML-enabled post (click for details)."/></a></div>

<p>Readers may have noticed that I haven’t been very active here for a while.  That isn’t because I haven’t felt the “blogging urge”, but because I felt that the things I want to blog about right now wouldn’t be very interesting to much of the n-Category Cafe audience: they’re mostly fairly technical details about implementing proof assistants (because that’s what I’m mostly working on right now).</p>

<p>Accordingly, I’ve started a new blog!  It’s at <a href="https://gwaithimirdain.github.io/blog/">https://gwaithimirdain.github.io/blog/</a>.  (Gwaith-i-Mírdain is the github organization for development of Narya, the experimental proof assistant for Higher Observational Type Theory – and now Multimodal Type Theory as well – that I’ve been spending most of my time on, and will primarily be blogging about.)  And I already wrote three posts (mostly about implementing multimodal type theory, with several survey questions for the reader), so you can check it out right now and see whether it’s likely to be your cup of tea.</p>

<p>Never fear, I’ll still come back here when I have more category-theoretic things to write about.</p></div>
    </content>
    <updated>2026-06-06T17:51:38Z</updated>
    <published>2026-06-02T19:34:52Z</published>
    <category term="Blogging"/>
    <author>
      <name>shulman</name>
      <email>shulman@sandiego.edu</email>
      <uri>http://home.sandiego.edu/~shulman</uri>
    </author>
    <source>
      <id>tag:golem.ph.utexas.edu,2006:nCategoryCafe/3</id>
      <icon>https://golem.ph.utexas.edu/category/images/favicon.ico</icon>
      <link href="https://golem.ph.utexas.edu/category/" rel="alternate" type="application/xhtml+xml"/>
      <link href="https://golem.ph.utexas.edu/category/atom10.xml" rel="self" type="application/atom+xml"/>
      <link href="https://golem.ph.utexas.edu/category/comments.atom" rel="replies" type="application/atom+xml"/>
      <rights xml:lang="en">Copyright (c) 2026, The n-Category Collective</rights>
      <subtitle xml:lang="en">A group blog on math, physics and philosophy</subtitle>
      <title xml:lang="en">The n-Category Café</title>
      <updated>2026-09-01T10:19:27Z</updated>
    </source>
  </entry>

  <entry xml:lang="en">
    <id>tag:golem.ph.utexas.edu,2026:%2F~distler%2Fblog%2F1.3636</id>
    <link href="https://golem.ph.utexas.edu/~distler/blog/archives/003636.html" rel="alternate" type="application/xhtml+xml"/>
    <title xml:lang="en">Code</title>
    <summary xml:lang="en">Claude Code and updates to Instiki and Heterotic Beast</summary>
    <content type="xhtml" xml:lang="en"><div xmlns="http://www.w3.org/1999/xhtml"><div><a href="http://golem.ph.utexas.edu/~distler/blog/mathml.html"><img alt="MathML-enabled post (click for more details)." class="mathlogo" src="https://golem.ph.utexas.edu/~distler/blog/images/MathML.png" title="MathML-enabled post (click for details)."/></a></div>

<p>I’ve been playing around with Claude Code (Claude Opus 4.7 (1M context)) because, well, who hasn’t?</p>

<p>I am, so far, only moderately impressed by its abilities in physics. The most impressive bit so far was when, in response to a question about nilpotent orbits, it responded</p>

<blockquote>
  <p>I don’t know. I could waste your time by guessing, but …</p>
</blockquote>

<p>I had <em>never</em> had an <acronym title="Large Language Model">LLM</acronym> tell me that it doesn’t know something, much less that it didn’t want to waste my time by making stuff up. So this was <em>positively shocking</em> to read.</p>

<p>Claude Code is, however, unfathomably good at generating code, so I set it the task of modernizing <a href="https://golem.ph.utexas.edu/wiki/instiki/show/HomePage">Instiki</a> and <a href="https://github.com/distler/heterotic_beast">Heterotic Beast</a>, my <a href="https://golem.ph.utexas.edu/forum/">forum</a> software. Both are Rails applications and both have extensive test suites. So they use a software framework Claude is familiar with and have an objective standard for whether the changes made are correct.</p>

<p>When there is no test, however, things can go wildly off the rails (pun intended). For instance, consider the following snippet of Ruby code</p>

<pre><code>
def foo(text)
  ...
  con = text
  ...
  (now mutate con)
  ...
  con
end
</code></pre>

<p>If <code>text</code> is a frozen string, this will generate an error, as you can’t mutate a frozen string. Obviously, what you should do is write</p>

<pre><code>
def foo(text)
  ...
  con = text.dup
  ...
  con
end
</code></pre>

<p>which copies the caller’s string to a new unfrozen string which you can mutate to your heart’s content.</p>

<p>What did Claude do?</p>

<pre><code>
def foo(text)
  ...
  con = text.encode
  ...
  con
end
</code></pre>

<p>which also produces a new unfrozen string, <em>transcoded</em> from the caller’s encoding to <code>Encoding.default_internal</code> (which turns out to be <code>nil</code>). This is both (a) nondeterministic and (b) blows up spectacularly when <code>text</code> contains astral plane characters, like “𝔸”. I had to tell Claude not to do that, and to write some tests to check that astral plane characters are handled correctly.</p>

<p>Still …</p>

<p>I would set Claude the task of rewriting this blogging software, but alas I don’t have a test suite to compare with. </p>

<p>What I really should do, though, is find some physics I would trust it to work on.</p></div>
    </content>
    <updated>2026-05-16T21:04:43Z</updated>
    <published>2026-05-16T22:01:13Z</published>
    <category term="MathML"/>
    <author>
      <name>distler</name>
      <email>distler@golem.ph.utexas.edu</email>
      <uri>https://golem.ph.utexas.edu/~distler/blog/</uri>
    </author>
    <source>
      <id>tag:golem.ph.utexas.edu,2003:Musings/1</id>
      <icon>https://golem.ph.utexas.edu/~distler/blog/images/favicon.ico</icon>
      <link href="https://golem.ph.utexas.edu/~distler/blog/" rel="alternate" type="application/xhtml+xml"/>
      <link href="https://golem.ph.utexas.edu/~distler/blog/atom10.xml" rel="self" type="application/atom+xml"/>
      <link href="https://golem.ph.utexas.edu/~distler/blog/comments.atom" rel="replies" type="application/atom+xml"/>
      <rights xml:lang="en">Copyright (c) 2026, Jacques Distler</rights>
      <subtitle xml:lang="en">Thoughts on Science, Computing, and Life on Earth.</subtitle>
      <title xml:lang="en">Musings</title>
      <updated>2026-05-16T21:04:43Z</updated>
    </source>
  </entry>

  <entry xml:lang="en">
    <id>http://gowers.wordpress.com/?p=6666</id>
    <link href="https://gowers.wordpress.com/2026/05/08/a-recent-experience-with-chatgpt-5-5-pro/" rel="alternate" type="text/html"/>
    <link href="https://gowers.wordpress.com/2026/05/08/a-recent-experience-with-chatgpt-5-5-pro/#comments" rel="replies" type="text/html"/>
    <link href="https://gowers.wordpress.com/2026/05/08/a-recent-experience-with-chatgpt-5-5-pro/feed/atom/" rel="replies" type="application/atom+xml"/>
    <title xml:lang="en">A recent experience with ChatGPT 5.5 Pro</title>
    <summary xml:lang="en">We are all having to keep revising upwards our assessments of the mathematical capabilities of large language models. I have just made a fairly large revision as a result of ChatGPT 5.5 Pro, to which I am fortunate to have been given access, producing a piece of PhD-level research in an hour or so, with […]</summary>
    <content type="xhtml" xml:lang="en"><div xmlns="http://www.w3.org/1999/xhtml"><p class="wp-block-paragraph">We are all having to keep revising upwards our assessments of the mathematical capabilities of large language models. I have just made a fairly large revision as a result of ChatGPT 5.5 Pro, to which I am fortunate to have been given access, producing a piece of PhD-level research in an hour or so, with no serious mathematical input from me. </p>



<p class="wp-block-paragraph">The background is that, as has been widely reported, LLMs are now capable of solving research-level problems, and have managed to solve several of the Erdős problems listed on <a href="https://www.erdosproblems.com/">Thomas Bloom’s wonderful website</a>. Initially it was possible to laugh this off: many of the “solutions” consisted in the LLM noticing that the problem had an answer sitting there in the literature already, or could be very easily deduced from known results. But little by little the laughter has become quieter. The message I am getting from what other mathematicians more involved in this enterprise have been saying is that LLMs have got to the point where if a problem has an easy argument that for one reason or another human mathematicians have missed (that reason sometimes, but not always, being that the problem has not received all that much attention), then there is a good chance that the LLMs will spot it. Conversely, for problems where one’s initial reaction is to be impressed that an LLM has come up with a clever argument, it often turns out on closer inspection that there are precedents for those arguments, so it is still just about possible to comfort oneself that LLMs are merely putting together existing knowledge rather than having truly original ideas. How much of a comfort that is I will not discuss here, other than to note that quite a lot of perfectly good human mathematics consists in putting together existing knowledge and proof techniques.</p>



<p class="wp-block-paragraph">I decided to try something a little bit different. At least in combinatorics, there are quite a lot of papers that investigate some relatively new combinatorial parameter that leads naturally to several questions. Because of the sheer number of questions one can ask, the authors of such papers will not necessarily have the time to spend a week or two thinking about each one, so there is a decent probability that at least some of them will not be all that hard. This makes such papers very valuable as sources of problems for mathematicians who are doing research for the first time and who will be hugely encouraged by solving a problem that was officially open. Or rather, it used to make them valuable in that way, but it looks as though the bar has just been raised. It is no longer enough that somebody asks a problem: it needs to be hard enough for an LLM not to be able to solve it. </p>



<p class="wp-block-paragraph">In any case, a little over a week ago I decided to see how ChatGPT 5.5 Pro would fare with a selection of problems asked by Mel Nathanson in a paper entitled <a href="https://arxiv.org/abs/2603.15556">Diversity, Equity and Inclusion for Problems in Additive Number Theory</a>. Nathanson has a remarkable record of being interested in problems and theorems that have later become extremely fashionable, which has led him to write a series of extremely well timed and therefore highly influential textbooks. In this paper, he argues for the interest of several other problems, some of which I will now briefly describe.</p>



<span id="more-6666"/>



<p class="wp-block-paragraph">If <img alt="A" class="latex" src="https://s0.wp.com/latex.php?latex=A&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is a set of integers, then its <em>sumset</em> <img alt="A+A" class="latex" src="https://s0.wp.com/latex.php?latex=A%2BA&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is defined to be <img alt="\{a+b:a,b\in A\}" class="latex" src="https://s0.wp.com/latex.php?latex=%5C%7Ba%2Bb%3Aa%2Cb%5Cin+A%5C%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. For a positive integer <img alt="h" class="latex" src="https://s0.wp.com/latex.php?latex=h&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, the <img alt="h" class="latex" src="https://s0.wp.com/latex.php?latex=h&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>–<em>fold sumset</em>, denoted <img alt="hA" class="latex" src="https://s0.wp.com/latex.php?latex=hA&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, is defined to be <img alt="\{a_1+\dots+a_h: a_1,\dots,a_h\in A\}" class="latex" src="https://s0.wp.com/latex.php?latex=%5C%7Ba_1%2B%5Cdots%2Ba_h%3A+a_1%2C%5Cdots%2Ca_h%5Cin+A%5C%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. Nathanson is interested in the possible sizes of <img alt="hA" class="latex" src="https://s0.wp.com/latex.php?latex=hA&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> given the size of <img alt="A" class="latex" src="https://s0.wp.com/latex.php?latex=A&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. To that end one can define a set <img alt="\mathcal R(h,k)" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathcal+R%28h%2Ck%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> to be the set of all <img alt="t" class="latex" src="https://s0.wp.com/latex.php?latex=t&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> such that there exists a set <img alt="A" class="latex" src="https://s0.wp.com/latex.php?latex=A&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> with <img alt="|A|=k" class="latex" src="https://s0.wp.com/latex.php?latex=%7CA%7C%3Dk&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="|hA|=t" class="latex" src="https://s0.wp.com/latex.php?latex=%7ChA%7C%3Dt&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. </p>



<p class="wp-block-paragraph">An obvious first question to ask is simply “What is <img alt="\mathcal R(h,k)" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathcal+R%28h%2Ck%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>?” When <img alt="h=2" class="latex" src="https://s0.wp.com/latex.php?latex=h%3D2&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, the answer is the set of all integers between <img alt="2k-1" class="latex" src="https://s0.wp.com/latex.php?latex=2k-1&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="\binom{k+1}2" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cbinom%7Bk%2B1%7D2&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. It is an easy exercise to show that if <img alt="|A|=k" class="latex" src="https://s0.wp.com/latex.php?latex=%7CA%7C%3Dk&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, then <img alt="2k-1\leq|A+A|\leq\binom{k+1}2" class="latex" src="https://s0.wp.com/latex.php?latex=2k-1%5Cleq%7CA%2BA%7C%5Cleq%5Cbinom%7Bk%2B1%7D2&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, so this result is saying that all sizes in between can be realized. However, it is not true in general that <img alt="hA" class="latex" src="https://s0.wp.com/latex.php?latex=hA&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> can take every size between its minimum and maximum possibilities, and we do not currently have a complete description of <img alt="\mathcal R(h,k)" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathcal+R%28h%2Ck%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>.</p>



<p class="wp-block-paragraph">Another natural question one can ask, and this is where ChatGPT came in, is how large a diameter you need if you want a set <img alt="A" class="latex" src="https://s0.wp.com/latex.php?latex=A&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> with <img alt="A" class="latex" src="https://s0.wp.com/latex.php?latex=A&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="hA" class="latex" src="https://s0.wp.com/latex.php?latex=hA&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> having prescribed sizes. (Of course, the size of <img alt="hA" class="latex" src="https://s0.wp.com/latex.php?latex=hA&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> must belong to <img alt="\mathcal R(h,k)" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathcal+R%28h%2Ck%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>.) Nathanson showed that for every <img alt="t\in[2k-1,\binom{k+1}2]" class="latex" src="https://s0.wp.com/latex.php?latex=t%5Cin%5B2k-1%2C%5Cbinom%7Bk%2B1%7D2%5D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> there is a subset <img alt="A" class="latex" src="https://s0.wp.com/latex.php?latex=A&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> of <img alt="\{0,1,2,\dots,2^k-1\}" class="latex" src="https://s0.wp.com/latex.php?latex=%5C%7B0%2C1%2C2%2C%5Cdots%2C2%5Ek-1%5C%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> with <img alt="|A|=k" class="latex" src="https://s0.wp.com/latex.php?latex=%7CA%7C%3Dk&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="|A+A|=t" class="latex" src="https://s0.wp.com/latex.php?latex=%7CA%2BA%7C%3Dt&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, and asked whether the bound <img alt="2^k-1" class="latex" src="https://s0.wp.com/latex.php?latex=2%5Ek-1&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> could be improved. ChatGPT 5.5 Pro thought for 17 minutes and 5 seconds before providing a construction that yielded a quadratic upper bound, which is clearly best possible. It wrote up its argument in a slightly rambling LLM-ish style, so I asked if it could write the argument up as a LaTeX file in the style of a typical mathematical preprint. After two minutes and 23 seconds it gave me that, after which I spent some time convincing myself that the argument was correct. </p>



<p class="wp-block-paragraph">The basic idea behind both Nathanson’s argument and ChatGPT’s was that in order to obtain a set of a given size with a sumset of a given size, it is useful to build it out of a Sidon set, which means a set with sumset of maximal size (that is not quite the usual definition but it is the simplest to use in this discussion), and an arithmetic progression. Also, for a bit of fine tuning one can take an additional point near the arithmetic progression. Then if one plays around with the various parameters, one finds that one can obtain sets of all the sizes one wants. Nathanson doesn’t express his argument this way (it is Theorem 5 of <a href="https://arxiv.org/pdf/2411.02365">this paper</a>), instead giving an inductive argument, but I think, without having checked too carefully, that if one unravels his argument, one finds that effectively that is what he ends up with, and the Sidon set in question consists of powers of 2. ChatGPT obtained its improvement by simply using a more efficient Sidon set — it is well known that one can find Sidon sets of quadratic diameter. (One might ask why Nathanson didn’t do that in the first place: I think it is because the obvious idea of using a more efficient Sidon set becomes obvious only after one has redescribed his inductive construction. Is that what ChatGPT did? It is very hard to say.) </p>



<p class="wp-block-paragraph">Next, I asked ChatGPT to see whether it could do the same for a closely related question, where instead of looking at the size of the sumset, one looks at the size of the <em>restricted</em> sumset, which is defined to be <img alt="\{a+b:a,b\in A, a\ne b\}" class="latex" src="https://s0.wp.com/latex.php?latex=%5C%7Ba%2Bb%3Aa%2Cb%5Cin+A%2C+a%5Cne+b%5C%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. Unsurprisingly, it was able to do that with no trouble at all. I got it to write both results up in a single note, to avoid a certain amount of duplication. If you are curious, you can see the note <a href="https://drive.google.com/file/d/11r-ggU__GMmHIrgEHQVULUIR1VxKSwmi/view?usp=drive_link">here</a>. </p>



<p class="wp-block-paragraph">I then asked what it could do for general <img alt="h" class="latex" src="https://s0.wp.com/latex.php?latex=h&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. I was much less optimistic that it would manage to do anything interesting, because the proof for <img alt="h=2" class="latex" src="https://s0.wp.com/latex.php?latex=h%3D2&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> makes fundamental use of the fact (due to Erdős and Szemerédi) that we know exactly which sizes we need to create. If we don’t know what the set <img alt="\mathcal R(h,k)" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathcal+R%28h%2Ck%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is, then it seems that we are forced to start with a hypothetical set <img alt="A" class="latex" src="https://s0.wp.com/latex.php?latex=A&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> with <img alt="|A|=k" class="latex" src="https://s0.wp.com/latex.php?latex=%7CA%7C%3Dk&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="|hA|=t" class="latex" src="https://s0.wp.com/latex.php?latex=%7ChA%7C%3Dt&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and build out of it a set of small diameter with the same property. As it happens, I still don’t know how to get round that difficulty (I’m mentioning that just to demonstrate that my mathematical input was zero, and I didn’t even do anything clever with the prompts), but Nathanson mentioned in his paper a remarkable paper of Isaac Rajagopal, a student at MIT, who must have got round the difficulty somehow, because he had managed to prove an exponential dependence of <img alt="\mathcal R(h,k)" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathcal+R%28h%2Ck%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> on <img alt="k" class="latex" src="https://s0.wp.com/latex.php?latex=k&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> for each fixed <img alt="h" class="latex" src="https://s0.wp.com/latex.php?latex=h&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>.</p>



<p class="wp-block-paragraph">I’ll leave the previous paragraph there, but Isaac has subsequently explained to me that that isn’t really the difficulty. His argument gives a complete description of <img alt="\mathcal R(h,k)" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathcal+R%28h%2Ck%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> when <img alt="k" class="latex" src="https://s0.wp.com/latex.php?latex=k&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is sufficiently large, and if one wants to prove a polynomial dependence for fixed <img alt="h" class="latex" src="https://s0.wp.com/latex.php?latex=h&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, then assuming that <img alt="k" class="latex" src="https://s0.wp.com/latex.php?latex=k&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is sufficiently large is clearly permitted. The real difficulty is that constructing the sets with given sumset sizes was significantly more complicated, and necessarily so because the degree of the polynomial grows with <img alt="h" class="latex" src="https://s0.wp.com/latex.php?latex=h&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, and one therefore needs more and more parameters to define the sets. </p>



<p class="wp-block-paragraph">In any case, the task faced by ChatGPT was not to solve the problem from scratch, but to see whether it was possible to tighten up Isaac Rajagopal’s argument. Here’s what happened.</p>



<ol class="wp-block-list">
<li>After 16 minutes and 41 seconds, it came back with an argument that claimed to have improved the upper bound from exponential in <img alt="k" class="latex" src="https://s0.wp.com/latex.php?latex=k&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> to exponential in <img alt="k^\alpha" class="latex" src="https://s0.wp.com/latex.php?latex=k%5E%5Calpha&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> for any <img alt="\alpha&gt;1/2" class="latex" src="https://s0.wp.com/latex.php?latex=%5Calpha%3E1%2F2&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. </li>



<li>I asked it to write that in preprint form too, which took it a further 47 minutes and 39 seconds.</li>



<li>That preprint would have been hard for me to read, as that would have meant carefully reading Rajagopal’s paper first, but I sent it to Nathanson, who forwarded it to Rajagopal, who said he thought it looked correct.</li>



<li>Both ChatGPT and Rajagopal speculated a little on what might need to be done to push things further and get a polynomial bound, so I got greedy and asked ChatGPT to give that a go.</li>



<li>After 13 minutes and 33 seconds it told me it felt optimistic about the existence of such an argument but there were a couple of technical statements that needed checking. </li>



<li>I asked it to check them.</li>



<li>After 9 minutes and 12 seconds it got back to me with the check having been done, so I asked for this too to be written in preprint form. </li>



<li>After 31 minutes and 40 seconds the “preprint” was ready. <a href="https://drive.google.com/file/d/1IkJBcWYz_3J_QGsESBmMa-jrEHAJDcJB/view?usp=sharing">Here it is.</a></li>



<li>Isaac Rajagopal looked at it and declared it to be almost certainly correct. It was clear that he meant this not just at a line-by-line level but at the level of ideas.</li>
</ol>



<p class="wp-block-paragraph">Isaac made some very interesting remarks about the nature of what the additional ideas were that ChatGPT contributed. Since, as I have already said, my mathematical input was zero, I invited him to write a guest section to this post. Just before we get to that, I want to raise a question (that will undoubtedly have been raised by others as well), which is simple: what should we do with this kind of content? Had the result been produced by a human mathematician, it would definitely have been publishable, so I think it would be wrong to describe it as AI slop. On the other hand, it seems pointless even to think about putting it in a journal, since it can be made freely available, and nobody needs “credit” for it (except that Isaac deserves plenty of credit for creating the framework on which ChatGPT could build). I understand that arXiv has a policy against accepting AI-written content, which makes good sense to me. So maybe there should be a different repository where AI-produced results can live. But various decisions would need to be made about how it was organized. I myself think that one would probably want to have some kind of moderation process, so that results would be included only if a human mathematician was prepared to certify that they were correct — or, better still, that they had been formalized by a proof assistant — and perhaps also that they answered a question that had been asked in a human-written paper. On the other hand, I wouldn’t want a moderation process that created vast amounts of work (unless the work was itself done by AI, but there are obvious dangers in going down that route). Anyway, until these questions are answered, this result is available from the link above, and perhaps, now that LLMs are so good at literature search, that will be enough to make it findable by anyone who wants to know whether Nathanson’s problem has been solved. </p>



<h2 class="wp-block-heading">Isaac’s evaluation of what ChatGPT achieved</h2>



<p class="wp-block-paragraph">With just a few prompts, ChatGPT was able to improve the upper bound on <img alt="N(h,k)" class="latex" src="https://s0.wp.com/latex.php?latex=N%28h%2Ck%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> (which I will define very soon) from exponential in <img alt="k" class="latex" src="https://s0.wp.com/latex.php?latex=k&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> to polynomial in <img alt="k" class="latex" src="https://s0.wp.com/latex.php?latex=k&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. While its first improvement of the bound, from exponential in <img alt="k" class="latex" src="https://s0.wp.com/latex.php?latex=k&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> to exponential in <img alt="k^{\frac{1}{2} + \varepsilon}" class="latex" src="https://s0.wp.com/latex.php?latex=k%5E%7B%5Cfrac%7B1%7D%7B2%7D+%2B+%5Cvarepsilon%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, was a routine modification of my work, the improvement to polynomial in <img alt="k" class="latex" src="https://s0.wp.com/latex.php?latex=k&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is quite impressive. To do this, ChatGPT came up with an idea which is original and clever. It is the sort of idea I would be very proud to come up with after a week or two of pondering, and it took ChatGPT less than an hour to find and prove, using similar methods to those in my own proof. My goal is to explain that idea, in a manner that will be digestible to my friends who are computer science majors as well as my math major friends.</p>



<p class="wp-block-paragraph">The problem of bounding <img alt="N(h,k)" class="latex" src="https://s0.wp.com/latex.php?latex=N%28h%2Ck%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is closely related to a problem I worked on at the Duluth REU (Research Experience for Undergrads) program, of determining <img alt="\mathcal{R}(h,k)" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathcal%7BR%7D%28h%2Ck%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. In particular, <img alt="\mathcal{R}(h,k)" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathcal%7BR%7D%28h%2Ck%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is the set of possible <img alt="h" class="latex" src="https://s0.wp.com/latex.php?latex=h&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>-fold sumset sizes <img alt="|hA|" class="latex" src="https://s0.wp.com/latex.php?latex=%7ChA%7C&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, where <img alt="A" class="latex" src="https://s0.wp.com/latex.php?latex=A&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> can be chosen to be any set of <img alt="k" class="latex" src="https://s0.wp.com/latex.php?latex=k&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> integers. <img alt="N(h,k)" class="latex" src="https://s0.wp.com/latex.php?latex=N%28h%2Ck%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is the minimal <img alt="N" class="latex" src="https://s0.wp.com/latex.php?latex=N&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> such that we can achieve all of the values of <img alt="\mathcal{R}(h,k)" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathcal%7BR%7D%28h%2Ck%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> using <img alt="k" class="latex" src="https://s0.wp.com/latex.php?latex=k&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>-element sets <img alt="A \subset \{0,1,2,\ldots,N\}" class="latex" src="https://s0.wp.com/latex.php?latex=A+%5Csubset+%5C%7B0%2C1%2C2%2C%5Cldots%2CN%5C%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. I spent last summer explicitly characterizing the set <img alt="\mathcal{R}(h,k)" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathcal%7BR%7D%28h%2Ck%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> for large <img alt="k" class="latex" src="https://s0.wp.com/latex.php?latex=k&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, by constructing sets <img alt="A" class="latex" src="https://s0.wp.com/latex.php?latex=A&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> such that <img alt="|hA|" class="latex" src="https://s0.wp.com/latex.php?latex=%7ChA%7C&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> achieves all sizes which I could not rule out as impossible. So, <img alt="N(h,k)" class="latex" src="https://s0.wp.com/latex.php?latex=N%28h%2Ck%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> can be upper-bounded by optimizing my constructions.</p>



<p class="wp-block-paragraph">I constructed these sets <img alt="A" class="latex" src="https://s0.wp.com/latex.php?latex=A&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> by combining smaller component sets which are simpler to analyze. Some of these components are the geometric series</p>



<p class="wp-block-paragraph"><img alt="\displaystyle S = \{0,1,m,m^2,\ldots,m^{\ell-2}\} \quad \hbox{and} \quad T = \{1,m,m^2,\ldots,m^{\ell-1}\} \qquad (1)" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cdisplaystyle+S+%3D+%5C%7B0%2C1%2Cm%2Cm%5E2%2C%5Cldots%2Cm%5E%7B%5Cell-2%7D%5C%7D+%5Cquad+%5Chbox%7Band%7D+%5Cquad+T+%3D+%5C%7B1%2Cm%2Cm%5E2%2C%5Cldots%2Cm%5E%7B%5Cell-1%7D%5C%7D+%5Cqquad+%281%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></p>



<p class="wp-block-paragraph">for various values of <img alt="2 \leq m \leq h" class="latex" src="https://s0.wp.com/latex.php?latex=2+%5Cleq+m+%5Cleq+h&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="2 \leq \ell \leq k" class="latex" src="https://s0.wp.com/latex.php?latex=2+%5Cleq+%5Cell+%5Cleq+k&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. Unfortunately, the elements of <img alt="S" class="latex" src="https://s0.wp.com/latex.php?latex=S&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="T" class="latex" src="https://s0.wp.com/latex.php?latex=T&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> are exponentially large in terms of <img alt="k" class="latex" src="https://s0.wp.com/latex.php?latex=k&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. So, I asked ChatGPT (through Tim) whether there exist sets of <img alt="\ell" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cell&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> elements which have similar sumset sizes to these geometric series, but contain only numbers of polynomial size in <img alt="\ell" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cell&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>: I had no idea if this was possible, or how to begin constructing such sets. ChatGPT came back with an answer, constructing sets <img alt="G" class="latex" src="https://s0.wp.com/latex.php?latex=G&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="H" class="latex" src="https://s0.wp.com/latex.php?latex=H&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> which behave like “half a geometric series squeezed into a polynomial interval,” which is counterintuitive. Before I discuss the construction of <img alt="G" class="latex" src="https://s0.wp.com/latex.php?latex=G&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="H" class="latex" src="https://s0.wp.com/latex.php?latex=H&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, I will explain the important properties of the sumset sizes of <img alt="S" class="latex" src="https://s0.wp.com/latex.php?latex=S&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="T" class="latex" src="https://s0.wp.com/latex.php?latex=T&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> which they recreate.</p>



<p class="wp-block-paragraph">For <img alt="h &gt; 0" class="latex" src="https://s0.wp.com/latex.php?latex=h+%3E+0&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, a set <img alt="A" class="latex" src="https://s0.wp.com/latex.php?latex=A&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is called a <img alt="B_h" class="latex" src="https://s0.wp.com/latex.php?latex=B_h&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> set if the only solutions to</p>



<p class="wp-block-paragraph"><img alt="\displaystyle x_1+\cdots+x_h = y_1+\cdots+y_h" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cdisplaystyle+x_1%2B%5Ccdots%2Bx_h+%3D+y_1%2B%5Ccdots%2By_h&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></p>



<p class="wp-block-paragraph">with <img alt="x_i,y_i" class="latex" src="https://s0.wp.com/latex.php?latex=x_i%2Cy_i&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> in <img alt="A" class="latex" src="https://s0.wp.com/latex.php?latex=A&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> are the “trivial” solutions, by which I mean that one side of the equation is a reordering of the other side. If <img alt="A" class="latex" src="https://s0.wp.com/latex.php?latex=A&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is a <img alt="B_h" class="latex" src="https://s0.wp.com/latex.php?latex=B_h&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> set of size <img alt="\ell" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cell&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, then elements of <img alt="hA" class="latex" src="https://s0.wp.com/latex.php?latex=hA&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> correspond exactly to choices of <img alt="h" class="latex" src="https://s0.wp.com/latex.php?latex=h&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> elements of <img alt="A" class="latex" src="https://s0.wp.com/latex.php?latex=A&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, with repetition allowed. Using “stars and bars,” one can see that <img alt="|hA| = \binom{h+\ell - 1}{h}" class="latex" src="https://s0.wp.com/latex.php?latex=%7ChA%7C+%3D+%5Cbinom%7Bh%2B%5Cell+-+1%7D%7Bh%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and this is the maximum possible value of <img alt="|hA|" class="latex" src="https://s0.wp.com/latex.php?latex=%7ChA%7C&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> among sets of size <img alt="\ell" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cell&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. So, another definition is that <img alt="A" class="latex" src="https://s0.wp.com/latex.php?latex=A&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is a <img alt="B_h" class="latex" src="https://s0.wp.com/latex.php?latex=B_h&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> set if <img alt="|hA| = \binom{h+|A| - 1}{h}" class="latex" src="https://s0.wp.com/latex.php?latex=%7ChA%7C+%3D+%5Cbinom%7Bh%2B%7CA%7C+-+1%7D%7Bh%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. Sidon sets, which Tim discussed, are exactly <img alt="B_2" class="latex" src="https://s0.wp.com/latex.php?latex=B_2&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> sets.</p>



<p class="wp-block-paragraph">To make things more concrete, let us assume that <img alt="m = 4" class="latex" src="https://s0.wp.com/latex.php?latex=m+%3D+4&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> in (1). Then, <img alt="S" class="latex" src="https://s0.wp.com/latex.php?latex=S&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is a <img alt="B_3" class="latex" src="https://s0.wp.com/latex.php?latex=B_3&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> set, but it is not a <img alt="B_4" class="latex" src="https://s0.wp.com/latex.php?latex=B_4&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> set because of the relations</p>



<p class="wp-block-paragraph"><img alt="\displaystyle 4^{a} + 4^a + 4^a + 4^a = 4^{a+1} + 0 + 0 + 0 \qquad (2)" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cdisplaystyle+4%5E%7Ba%7D+%2B+4%5Ea+%2B+4%5Ea+%2B+4%5Ea+%3D+4%5E%7Ba%2B1%7D+%2B+0+%2B+0+%2B+0+%5Cqquad+%282%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></p>



<p class="wp-block-paragraph">for any choice of <img alt="a" class="latex" src="https://s0.wp.com/latex.php?latex=a&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> in <img alt="\{0,1,2,\ldots, \ell-3\}" class="latex" src="https://s0.wp.com/latex.php?latex=%5C%7B0%2C1%2C2%2C%5Cldots%2C+%5Cell-3%5C%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. In particular, <img alt="\binom{\ell+3}{4} - |4S| = \ell-2" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cbinom%7B%5Cell%2B3%7D%7B4%7D+-+%7C4S%7C+%3D+%5Cell-2&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, as these <img alt="\ell-2" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cell-2&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> relations are the only ones preventing <img alt="S" class="latex" src="https://s0.wp.com/latex.php?latex=S&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> from being a <img alt="B_4" class="latex" src="https://s0.wp.com/latex.php?latex=B_4&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> set. <img alt="T" class="latex" src="https://s0.wp.com/latex.php?latex=T&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> lacks the relations in (2) because <img alt="0" class="latex" src="https://s0.wp.com/latex.php?latex=0&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is not in <img alt="T" class="latex" src="https://s0.wp.com/latex.php?latex=T&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. So, <img alt="T" class="latex" src="https://s0.wp.com/latex.php?latex=T&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is a <img alt="B_4" class="latex" src="https://s0.wp.com/latex.php?latex=B_4&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> set, but it is not a <img alt="B_5" class="latex" src="https://s0.wp.com/latex.php?latex=B_5&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> set because of the relations</p>



<p class="wp-block-paragraph"><img alt="\displaystyle 4^{a} + 4^a + 4^a + 4^a + 4^{b+1} = 4^{a+1} + 4^b + 4^b + 4^b + 4^b \qquad (3)" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cdisplaystyle+4%5E%7Ba%7D+%2B+4%5Ea+%2B+4%5Ea+%2B+4%5Ea+%2B+4%5E%7Bb%2B1%7D+%3D+4%5E%7Ba%2B1%7D+%2B+4%5Eb+%2B+4%5Eb+%2B+4%5Eb+%2B+4%5Eb+%5Cqquad+%283%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></p>



<p class="wp-block-paragraph">for any choices of <img alt="a \neq b" class="latex" src="https://s0.wp.com/latex.php?latex=a+%5Cneq+b&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> in <img alt="\{0,1,2,\ldots, \ell-2\}" class="latex" src="https://s0.wp.com/latex.php?latex=%5C%7B0%2C1%2C2%2C%5Cldots%2C+%5Cell-2%5C%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. This gives <img alt="\binom{\ell-1}{2}" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cbinom%7B%5Cell-1%7D%7B2%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> relations, and one can check that <img alt="\binom{\ell+4}{5} - |5T| = \binom{\ell-1}{2}" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cbinom%7B%5Cell%2B4%7D%7B5%7D+-+%7C5T%7C+%3D+%5Cbinom%7B%5Cell-1%7D%7B2%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. To summarize, we have seen that</p>



<p class="wp-block-paragraph">(a) <img alt="S" class="latex" src="https://s0.wp.com/latex.php?latex=S&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is a <img alt="B_{m-1}" class="latex" src="https://s0.wp.com/latex.php?latex=B_%7Bm-1%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> set.</p>



<p class="wp-block-paragraph">(b) <img alt="\binom{m+\ell-1}{m} - |mS| = \ell -2" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cbinom%7Bm%2B%5Cell-1%7D%7Bm%7D+-+%7CmS%7C+%3D+%5Cell+-2&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is a linear function of <img alt="\ell" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cell&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>.</p>



<p class="wp-block-paragraph">(c) <img alt="T" class="latex" src="https://s0.wp.com/latex.php?latex=T&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is a <img alt="B_{m}" class="latex" src="https://s0.wp.com/latex.php?latex=B_%7Bm%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> set.</p>



<p class="wp-block-paragraph">(d) <img alt="\binom{m+\ell}{m+1} - |(m+1)T| = \binom{\ell-1}{2}" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cbinom%7Bm%2B%5Cell%7D%7Bm%2B1%7D+-+%7C%28m%2B1%29T%7C+%3D+%5Cbinom%7B%5Cell-1%7D%7B2%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is a quadratic function of <img alt="\ell" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cell&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>.</p>



<ol class="wp-block-list"/>



<p class="wp-block-paragraph">ChatGPT was able to find sets <img alt="G" class="latex" src="https://s0.wp.com/latex.php?latex=G&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="H" class="latex" src="https://s0.wp.com/latex.php?latex=H&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> of <img alt="\ell" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cell&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> elements which satisfy (a)-(d), but whose elements all have polynomial size in <img alt="\ell" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cell&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. The construction of <img alt="G" class="latex" src="https://s0.wp.com/latex.php?latex=G&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="H" class="latex" src="https://s0.wp.com/latex.php?latex=H&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> uses <img alt="h^2" class="latex" src="https://s0.wp.com/latex.php?latex=h%5E2&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>-dissociated sets, which are sets <img alt="A" class="latex" src="https://s0.wp.com/latex.php?latex=A&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> where the only solutions to</p>



<p class="wp-block-paragraph"><img alt="\displaystyle x_1+\cdots+x_s = y_1+\cdots+y_{s'} \qquad (4)" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cdisplaystyle+x_1%2B%5Ccdots%2Bx_s+%3D+y_1%2B%5Ccdots%2By_%7Bs%27%7D+%5Cqquad+%284%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></p>



<p class="wp-block-paragraph">with <img alt="s,s' \leq h^2" class="latex" src="https://s0.wp.com/latex.php?latex=s%2Cs%27+%5Cleq+h%5E2&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="x_i,y_i" class="latex" src="https://s0.wp.com/latex.php?latex=x_i%2Cy_i&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> in <img alt="A" class="latex" src="https://s0.wp.com/latex.php?latex=A&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> are the “trivial” solutions, i.e. <img alt="s = s'" class="latex" src="https://s0.wp.com/latex.php?latex=s+%3D+s%27&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and one side of the equation is a reordering of the other side. For <img alt="r &gt; 0" class="latex" src="https://s0.wp.com/latex.php?latex=r+%3E+0&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, it is possible to construct an <img alt="h^2" class="latex" src="https://s0.wp.com/latex.php?latex=h%5E2&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>-dissociated set <img alt="U = \{u_1,\ldots,u_r\} \subseteq \{0,1,2,\ldots,N\}" class="latex" src="https://s0.wp.com/latex.php?latex=U+%3D+%5C%7Bu_1%2C%5Cldots%2Cu_r%5C%7D+%5Csubseteq+%5C%7B0%2C1%2C2%2C%5Cldots%2CN%5C%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, where <img alt="N" class="latex" src="https://s0.wp.com/latex.php?latex=N&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is approximately <img alt="r^{h^2}" class="latex" src="https://s0.wp.com/latex.php?latex=r%5E%7Bh%5E2%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, and in particular polynomial in <img alt="r" class="latex" src="https://s0.wp.com/latex.php?latex=r&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. Constructions of such a <img alt="U" class="latex" src="https://s0.wp.com/latex.php?latex=U&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> using finite fields date back to Singer (1938) and Bose–Chowla (1963) and are described in Appendix 1. Define</p>



<p class="wp-block-paragraph"><img alt="\displaystyle G = \{0, u_1,u_2,\ldots,u_r,mu_1,mu_2,\ldots, mu_r\}" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cdisplaystyle+G+%3D+%5C%7B0%2C+u_1%2Cu_2%2C%5Cldots%2Cu_r%2Cmu_1%2Cmu_2%2C%5Cldots%2C+mu_r%5C%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></p>



<p class="wp-block-paragraph">and</p>



<p class="wp-block-paragraph"><img alt="\displaystyle H= \{u_1,u_2,\ldots,u_r,mu_1,mu_2,\ldots, mu_r\}. \qquad (5)" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cdisplaystyle+H%3D+%5C%7Bu_1%2Cu_2%2C%5Cldots%2Cu_r%2Cmu_1%2Cmu_2%2C%5Cldots%2C+mu_r%5C%7D.+%5Cqquad+%285%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></p>



<p class="wp-block-paragraph">In hindsight, I have good intuition for the construction of <img alt="G" class="latex" src="https://s0.wp.com/latex.php?latex=G&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="H" class="latex" src="https://s0.wp.com/latex.php?latex=H&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. All of the relations in (2) and (3) are formed by combining one or two relations of the form <img alt="4x = y" class="latex" src="https://s0.wp.com/latex.php?latex=4x+%3D+y&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. There are approximately <img alt="\ell" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cell&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> relations of the form <img alt="mx = y" class="latex" src="https://s0.wp.com/latex.php?latex=mx+%3D+y&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> in <img alt="S" class="latex" src="https://s0.wp.com/latex.php?latex=S&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="T" class="latex" src="https://s0.wp.com/latex.php?latex=T&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, and approximately <img alt="\ell/2" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cell%2F2&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> such relations in <img alt="G" class="latex" src="https://s0.wp.com/latex.php?latex=G&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="H" class="latex" src="https://s0.wp.com/latex.php?latex=H&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. There are few other low-order relations in <img alt="S" class="latex" src="https://s0.wp.com/latex.php?latex=S&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="T" class="latex" src="https://s0.wp.com/latex.php?latex=T&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, and similarly in <img alt="G" class="latex" src="https://s0.wp.com/latex.php?latex=G&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="H" class="latex" src="https://s0.wp.com/latex.php?latex=H&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> because <img alt="U" class="latex" src="https://s0.wp.com/latex.php?latex=U&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is <img alt="h^2" class="latex" src="https://s0.wp.com/latex.php?latex=h%5E2&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>-dissociated. So, <img alt="G" class="latex" src="https://s0.wp.com/latex.php?latex=G&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="H" class="latex" src="https://s0.wp.com/latex.php?latex=H&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> manage to contain half as many <img alt="mx = y" class="latex" src="https://s0.wp.com/latex.php?latex=mx+%3D+y&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>-relations as their geometric series counterparts, while also containing few low-order relations.</p>



<p class="wp-block-paragraph">We now see why (a)-(d) hold with <img alt="S" class="latex" src="https://s0.wp.com/latex.php?latex=S&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="T" class="latex" src="https://s0.wp.com/latex.php?latex=T&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> replaced by <img alt="G" class="latex" src="https://s0.wp.com/latex.php?latex=G&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="H" class="latex" src="https://s0.wp.com/latex.php?latex=H&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, respectively. For concreteness, we assume that <img alt="m = 4" class="latex" src="https://s0.wp.com/latex.php?latex=m+%3D+4&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="h&gt;4" class="latex" src="https://s0.wp.com/latex.php?latex=h%3E4&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, so <img alt="U" class="latex" src="https://s0.wp.com/latex.php?latex=U&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> contains no nontrivial relations as in (4) with <img alt="s,s' \leq 25 \leq h^2" class="latex" src="https://s0.wp.com/latex.php?latex=s%2Cs%27+%5Cleq+25+%5Cleq+h%5E2&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. Then, <img alt="G" class="latex" src="https://s0.wp.com/latex.php?latex=G&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is a <img alt="B_3" class="latex" src="https://s0.wp.com/latex.php?latex=B_3&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> set, but it is not a <img alt="B_4" class="latex" src="https://s0.wp.com/latex.php?latex=B_4&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> set because of the relations</p>



<p class="wp-block-paragraph"><img alt="\displaystyle u_i + u_i + u_i + u_i = 4u_i + 0 + 0 + 0" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cdisplaystyle+u_i+%2B+u_i+%2B+u_i+%2B+u_i+%3D+4u_i+%2B+0+%2B+0+%2B+0&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></p>



<p class="wp-block-paragraph">for any choice of <img alt="i" class="latex" src="https://s0.wp.com/latex.php?latex=i&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> in <img alt="\{1,2,\ldots, r\}" class="latex" src="https://s0.wp.com/latex.php?latex=%5C%7B1%2C2%2C%5Cldots%2C+r%5C%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. If we let <img alt="\ell = |G| = 2r+1" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cell+%3D+%7CG%7C+%3D+2r%2B1&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, we can check that <img alt="\binom{\ell + 3}{4} - |4G| = r = \frac{\ell-1}{2}" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cbinom%7B%5Cell+%2B+3%7D%7B4%7D+-+%7C4G%7C+%3D+r+%3D+%5Cfrac%7B%5Cell-1%7D%7B2%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is linear in <img alt="\ell" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cell&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. In particular, (a) and (b) hold with <img alt="S" class="latex" src="https://s0.wp.com/latex.php?latex=S&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> replaced by <img alt="G" class="latex" src="https://s0.wp.com/latex.php?latex=G&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, and the linear function <img alt="\ell-2" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cell-2&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> replaced by <img alt="\frac{\ell-1}{2}" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cfrac%7B%5Cell-1%7D%7B2%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. We can also see that <img alt="H" class="latex" src="https://s0.wp.com/latex.php?latex=H&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is a <img alt="B_4" class="latex" src="https://s0.wp.com/latex.php?latex=B_4&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> set, but it is not a <img alt="B_5" class="latex" src="https://s0.wp.com/latex.php?latex=B_5&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> set because of the relations</p>



<p class="wp-block-paragraph"><img alt="\displaystyle u_i + u_i + u_i + u_i + 4u_j = 4u_i + u_j + u_j +u_j + u_j" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cdisplaystyle+u_i+%2B+u_i+%2B+u_i+%2B+u_i+%2B+4u_j+%3D+4u_i+%2B+u_j+%2B+u_j+%2Bu_j+%2B+u_j&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></p>



<p class="wp-block-paragraph">for any <img alt="i\neq j" class="latex" src="https://s0.wp.com/latex.php?latex=i%5Cneq+j&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> in <img alt="\{1,2,\ldots, r\}" class="latex" src="https://s0.wp.com/latex.php?latex=%5C%7B1%2C2%2C%5Cldots%2C+r%5C%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. If we let <img alt="\ell = |H| = 2r" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cell+%3D+%7CH%7C+%3D+2r&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, we can check that <img alt="\binom{\ell + 4}{5} - |5H| = \binom{r}{2} = \binom{\ell/2}{2}" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cbinom%7B%5Cell+%2B+4%7D%7B5%7D+-+%7C5H%7C+%3D+%5Cbinom%7Br%7D%7B2%7D+%3D+%5Cbinom%7B%5Cell%2F2%7D%7B2%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is quadratic in <img alt="\ell" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cell&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. In a similar manner, (c) and (d) hold with <img alt="T" class="latex" src="https://s0.wp.com/latex.php?latex=T&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> replaced by <img alt="H" class="latex" src="https://s0.wp.com/latex.php?latex=H&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, and the quadratic function <img alt="\binom{\ell-1}{2}" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cbinom%7B%5Cell-1%7D%7B2%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> replaced by <img alt="\binom{\ell/2}{2}" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cbinom%7B%5Cell%2F2%7D%7B2%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>.</p>



<p class="wp-block-paragraph">Even though I can motivate it in retrospect, ChatGPT’s idea to use <img alt="h^2" class="latex" src="https://s0.wp.com/latex.php?latex=h%5E2&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>-dissociated sets to control relations of order at most <img alt="h" class="latex" src="https://s0.wp.com/latex.php?latex=h&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> feels quite ingenious. As far as I can tell, this idea is completely original.</p>



<p class="wp-block-paragraph">ChatGPT’s proof that its construction produces the desired values of <img alt="|hA|" class="latex" src="https://s0.wp.com/latex.php?latex=%7ChA%7C&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is very similar to my proof that the sets <img alt="A" class="latex" src="https://s0.wp.com/latex.php?latex=A&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> which I construct achieve all possible values of <img alt="|hA|" class="latex" src="https://s0.wp.com/latex.php?latex=%7ChA%7C&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, after replacing <img alt="S" class="latex" src="https://s0.wp.com/latex.php?latex=S&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="T" class="latex" src="https://s0.wp.com/latex.php?latex=T&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> by <img alt="G" class="latex" src="https://s0.wp.com/latex.php?latex=G&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="H" class="latex" src="https://s0.wp.com/latex.php?latex=H&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, respectively. Properties (a)-(d) capture many of the important properties of <img alt="S" class="latex" src="https://s0.wp.com/latex.php?latex=S&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="T" class="latex" src="https://s0.wp.com/latex.php?latex=T&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> (or <img alt="G" class="latex" src="https://s0.wp.com/latex.php?latex=G&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="H" class="latex" src="https://s0.wp.com/latex.php?latex=H&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>) which are used in this proof. The final constructions involve combining the sets <img alt="G" class="latex" src="https://s0.wp.com/latex.php?latex=G&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="H" class="latex" src="https://s0.wp.com/latex.php?latex=H&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> (or <img alt="S" class="latex" src="https://s0.wp.com/latex.php?latex=S&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="T" class="latex" src="https://s0.wp.com/latex.php?latex=T&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> in my paper) for each value of <img alt="m" class="latex" src="https://s0.wp.com/latex.php?latex=m&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> between <img alt="2" class="latex" src="https://s0.wp.com/latex.php?latex=2&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="h" class="latex" src="https://s0.wp.com/latex.php?latex=h&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> with another set which is the union of an arithmetic progression and a point. Intuitively, <img alt="G" class="latex" src="https://s0.wp.com/latex.php?latex=G&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="H" class="latex" src="https://s0.wp.com/latex.php?latex=H&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> (or <img alt="S" class="latex" src="https://s0.wp.com/latex.php?latex=S&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="T" class="latex" src="https://s0.wp.com/latex.php?latex=T&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>) have large sumsets, while arithmetic progressions have small sumsets, so it is plausible that one could get sets which achieve all the medium-sized sumsets by combining them. However, the proof of this is quite involved, and it occupies Section 4 of <a href="https://arxiv.org/pdf/2510.23022">my paper</a> and the entirety of the ChatGPT preprint. In Appendix 2, I work out the details of the ChatGPT construction to show that for <img alt="k" class="latex" src="https://s0.wp.com/latex.php?latex=k&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> sufficiently large,</p>



<p class="wp-block-paragraph"><img alt="\displaystyle N(h,k) \leq O\left(k^{10h^3}\right)." class="latex" src="https://s0.wp.com/latex.php?latex=%5Cdisplaystyle+N%28h%2Ck%29+%5Cleq+O%5Cleft%28k%5E%7B10h%5E3%7D%5Cright%29.&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></p>



<p class="wp-block-paragraph">For comparison, it is easy to see that <img alt="N(h,k)" class="latex" src="https://s0.wp.com/latex.php?latex=N%28h%2Ck%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is at least on the order of <img alt="k^{h}" class="latex" src="https://s0.wp.com/latex.php?latex=k%5E%7Bh%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, and it is unknown what the real value is. In Appendix 3, I give details of the correspondence between my paper and the ChatGPT preprint, which will be helpful for those who want to read either.</p>



<p class="wp-block-paragraph">Finally, I want to express my deep gratitude to Tim for allowing me to contribute to this blog. I am still stunned by the coincidence that the problem he chose to put into ChatGPT 5.5 Pro led him to my paper on the arXiv.</p>



<h2 class="wp-block-heading">Tim on what this means for mathematical research</h2>



<p class="wp-block-paragraph">I would judge the level of the result that ChatGPT found in under two hours to be that of a perfectly reasonable chapter in a combinatorics PhD. It wouldn’t be considered an amazing result, since it leant very heavily on Isaac’s ideas, but it was definitely a non-trivial extension of those ideas, and for a PhD student to find that extension it would be necessary to invest quite a bit of time digesting Isaac’s paper, looking for places where it might not be optimal, familiarizing oneself with various algebraic techniques that he used, and so on. </p>



<p class="wp-block-paragraph">It seems to me that training beginning PhD students to do research, which has always been hard (unless one is lucky enough, as I have often been, to have a student who just seems to get it and therefore doesn’t need in any sense to be trained), has just got harder, since one obvious way to help somebody get started is to give them a problem that looks as though it might be a relatively gentle one. If LLMs are at the point where they can solve “gentle problems”, then that is no longer an option. The lower bound for contributing to mathematics will now be to prove something that LLMs can’t prove, rather than simply to prove something that nobody has proved up to now and that at least somebody finds interesting. </p>



<p class="wp-block-paragraph">I would qualify that statement in two ways though. First, there is the obvious point that a beginning PhD student has the option of using LLMs. So the task is potentially easier than proving something that LLMs can’t prove: it is proving something <em>in collaboration with LLMs</em> that LLMs cannot manage on their own. I have done quite a lot of such collaboration recently and found that LLMs have made useful contributions without (yet) having game-changing ideas. </p>



<p class="wp-block-paragraph">A second point is that I don’t know how much of what I have said generalizes to other areas of mathematics. Combinatorics tends to be quite focused on problems: you start with a question and you reason back from the question or if you reason forwards you do so very much with the question in mind. In other areas there can be much more of an emphasis on forwards reasoning: you start with a circle of ideas and see where it leads. To do it successfully, you need to have some way of discriminating between interesting observations and uninteresting ones, and it isn’t obvious to me what LLMs would be like at that.</p>



<p class="wp-block-paragraph">Of course, everything I am saying concerns LLMs as they are right now. But they are developing so fast that it seems almost certain that my comments will go out of date in a matter of months. It is also almost certain that these developments will have a profoundly disruptive effect on how we go about mathematical research, and especially on how we introduce newcomers to it. Somebody starting a PhD next academic year will be finishing it in 2029 at the earliest, and my guess is that by then what it means to undertake research in mathematics will have changed out of all recognition. </p>



<p class="wp-block-paragraph">I sometimes get emails from people who are interested in doing mathematical research but are not sure whether that makes sense any more as an aspiration. I have a view on that question, but it may very well change in response to further developments. That view is that there is still a great deal of value in struggling with a mathematics problem, but that the era where you could enjoy the thrill of having your name forever associated with a particular theorem or definition may well be close to its end. So if your aim in doing mathematics is to achieve some kind of immortality, so to speak, then you should understand that that won’t necessarily be possible for much longer — not just for you, but for anybody. Here’s a thought experiment: suppose that a mathematician solved a major problem by having a long exchange with an LLM in which the mathematician played a useful guiding role but the LLM did all the technical work and had the main ideas. Would we regard that as a major achievement of the mathematician? I don’t think we would. </p>



<p class="wp-block-paragraph">So what is the point of struggling with a difficult mathematics problem? One answer is that it can be very satisfying to solve a problem even if the answer is already known, but I don’t think that is a sufficient reason to spend several years of your life on this peculiar activity. A better answer is that by solving hard problems you get an insight into the problem-solving process itself, at least in your area of expertise, in a way that you simply don’t if all you do is read other people’s solutions. One consequence of this is that people who have themselves solved difficult problems are likely to be significantly better at using solving problems with the help of AI, just as very good coders are better at vibe coding than not such good coders, or people who have a solid grasp of how to do basic arithmetic are likely to be more skilled at using calculators (and especially at noticing when an answer feels off). Mathematics is a highly transferable skill, and that applies to research-level mathematics as well. By doing research in mathematics, you may not get the same rewards as your equivalents a generation ago, but there is a good chance that you will be equipping yourself very well for the world we are about to experience. </p>



<h2 class="wp-block-heading">Appendix 1 (Isaac)</h2>



<p class="wp-block-paragraph">We will construct an <img alt="h" class="latex" src="https://s0.wp.com/latex.php?latex=h&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>-dissociated set <img alt="U = \{u_1,\ldots,u_r\} \subseteq \{0,1,2,\ldots,N\}" class="latex" src="https://s0.wp.com/latex.php?latex=U+%3D+%5C%7Bu_1%2C%5Cldots%2Cu_r%5C%7D+%5Csubseteq+%5C%7B0%2C1%2C2%2C%5Cldots%2CN%5C%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, where <img alt="N" class="latex" src="https://s0.wp.com/latex.php?latex=N&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is approximately <img alt="r^{h}" class="latex" src="https://s0.wp.com/latex.php?latex=r%5E%7Bh%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. This construction is a very minor modification of Bose–Chowla (1963)’s construction of a <img alt="B_h" class="latex" src="https://s0.wp.com/latex.php?latex=B_h&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> set, which I learned about from <a href="https://arxiv.org/abs/2308.12406">this paper</a>. For whatever reason, the GPT preprint (Lemma 3.1) uses a different, less efficient construction using moment curves.</p>



<p class="wp-block-paragraph">Let <img alt="p &gt; r" class="latex" src="https://s0.wp.com/latex.php?latex=p+%3E+r&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> be a prime, let <img alt="N = p^{h+1}-2" class="latex" src="https://s0.wp.com/latex.php?latex=N+%3D+p%5E%7Bh%2B1%7D-2&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, let <img alt="K" class="latex" src="https://s0.wp.com/latex.php?latex=K&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> be the finite field with <img alt="p^{h+1}" class="latex" src="https://s0.wp.com/latex.php?latex=p%5E%7Bh%2B1%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> elements and fix a generator <img alt="\theta" class="latex" src="https://s0.wp.com/latex.php?latex=%5Ctheta&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> of <img alt="K^\times" class="latex" src="https://s0.wp.com/latex.php?latex=K%5E%5Ctimes&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, so that <img alt="K^\times" class="latex" src="https://s0.wp.com/latex.php?latex=K%5E%5Ctimes&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is equal to <img alt="\{\theta^0,\theta^1,\ldots, \theta^N\}" class="latex" src="https://s0.wp.com/latex.php?latex=%5C%7B%5Ctheta%5E0%2C%5Ctheta%5E1%2C%5Cldots%2C+%5Ctheta%5EN%5C%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. Define a set of <img alt="p" class="latex" src="https://s0.wp.com/latex.php?latex=p&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> elements</p>



<p class="wp-block-paragraph"><img alt="\displaystyle U = \{a \in \{0,1,2,\ldots,N\}: \theta^a - \theta \in \mathbb{F}_p\}." class="latex" src="https://s0.wp.com/latex.php?latex=%5Cdisplaystyle+U+%3D+%5C%7Ba+%5Cin+%5C%7B0%2C1%2C2%2C%5Cldots%2CN%5C%7D%3A+%5Ctheta%5Ea+-+%5Ctheta+%5Cin+%5Cmathbb%7BF%7D_p%5C%7D.&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></p>



<p class="wp-block-paragraph">Then, each element <img alt="a \in U" class="latex" src="https://s0.wp.com/latex.php?latex=a+%5Cin+U&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> corresponds to a unique value of <img alt="\tilde{a} \in \mathbb{F}_p" class="latex" src="https://s0.wp.com/latex.php?latex=%5Ctilde%7Ba%7D+%5Cin+%5Cmathbb%7BF%7D_p&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, by taking <img alt="\tilde{a} = \theta^a - \theta" class="latex" src="https://s0.wp.com/latex.php?latex=%5Ctilde%7Ba%7D+%3D+%5Ctheta%5Ea+-+%5Ctheta&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. Now an additive relation of the form in (4) with <img alt="s,s' \leq h" class="latex" src="https://s0.wp.com/latex.php?latex=s%2Cs%27+%5Cleq+h&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> can be reframed by taking powers of <img alt="\theta" class="latex" src="https://s0.wp.com/latex.php?latex=%5Ctheta&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> as</p>



<p class="wp-block-paragraph"><img alt="\displaystyle (\theta + \tilde{x_1})(\theta + \tilde{x_2})\cdots (\theta + \tilde{x_s}) = (\theta + \tilde{y_1})(\theta + \tilde{y_2})\cdots (\theta + \tilde{y_{s'}}). \qquad (6)" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%28%5Ctheta+%2B+%5Ctilde%7Bx_1%7D%29%28%5Ctheta+%2B+%5Ctilde%7Bx_2%7D%29%5Ccdots+%28%5Ctheta+%2B+%5Ctilde%7Bx_s%7D%29+%3D+%28%5Ctheta+%2B+%5Ctilde%7By_1%7D%29%28%5Ctheta+%2B+%5Ctilde%7By_2%7D%29%5Ccdots+%28%5Ctheta+%2B+%5Ctilde%7By_%7Bs%27%7D%7D%29.+%5Cqquad+%286%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></p>



<p class="wp-block-paragraph">As <img alt="K" class="latex" src="https://s0.wp.com/latex.php?latex=K&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is a degree-<img alt="h+1" class="latex" src="https://s0.wp.com/latex.php?latex=h%2B1&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> extension of <img alt="\mathbb{F}\sb{p}" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathbb%7BF%7D%5Csb%7Bp%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="\theta" class="latex" src="https://s0.wp.com/latex.php?latex=%5Ctheta&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is a generator of <img alt="K" class="latex" src="https://s0.wp.com/latex.php?latex=K&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> as an <img alt="\mathbb{F}\sb{p}" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathbb%7BF%7D%5Csb%7Bp%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>-extension, this means that <img alt="\theta" class="latex" src="https://s0.wp.com/latex.php?latex=%5Ctheta&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> does not satisfy any nonzero polynomials in <img alt="\mathbb{F}\sb{p}[x]" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathbb%7BF%7D%5Csb%7Bp%7D%5Bx%5D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> of degree <img alt="\leq h" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cleq+h&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. So, both sides of (6) are identical as polynomials in <img alt="\mathbb{F}_{p}[\theta]" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathbb%7BF%7D_%7Bp%7D%5B%5Ctheta%5D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and thus the additive relation in (4) is trivial. So, <img alt="U" class="latex" src="https://s0.wp.com/latex.php?latex=U&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is <img alt="h" class="latex" src="https://s0.wp.com/latex.php?latex=h&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>-dissociated, and of course one can prune a few elements to reduce <img alt="U" class="latex" src="https://s0.wp.com/latex.php?latex=U&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> to size <img alt="r" class="latex" src="https://s0.wp.com/latex.php?latex=r&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>.</p>



<h2 class="wp-block-heading">Appendix 2 (Isaac)</h2>



<p class="wp-block-paragraph">Fix constants <img alt="\alpha,\beta,\gamma" class="latex" src="https://s0.wp.com/latex.php?latex=%5Calpha%2C%5Cbeta%2C%5Cgamma&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> such that <img alt="0.5 &lt; \beta\gamma &lt; \beta &lt; \alpha &lt; 1" class="latex" src="https://s0.wp.com/latex.php?latex=0.5+%3C+%5Cbeta%5Cgamma+%3C+%5Cbeta+%3C+%5Calpha+%3C+1&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> (in my paper I arbitrarily chose <img alt="(\alpha,\beta,\gamma) = (0.9,0.8,0.7)" class="latex" src="https://s0.wp.com/latex.php?latex=%28%5Calpha%2C%5Cbeta%2C%5Cgamma%29+%3D+%280.9%2C0.8%2C0.7%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>). Let the two sets in (5) be called <img alt="G_{m,r}" class="latex" src="https://s0.wp.com/latex.php?latex=G_%7Bm%2Cr%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="H_{m,r}" class="latex" src="https://s0.wp.com/latex.php?latex=H_%7Bm%2Cr%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. Let <img alt="[a,b]" class="latex" src="https://s0.wp.com/latex.php?latex=%5Ba%2Cb%5D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> denote the set of integers <img alt="x" class="latex" src="https://s0.wp.com/latex.php?latex=x&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> satisfying <img alt="a \leq x \leq b" class="latex" src="https://s0.wp.com/latex.php?latex=a+%5Cleq+x+%5Cleq+b&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. Similarly to my paper, the constructions of <img alt="A" class="latex" src="https://s0.wp.com/latex.php?latex=A&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> such that <img alt="hA" class="latex" src="https://s0.wp.com/latex.php?latex=hA&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> achieves the desired sizes will combine sets of the following four types:</p>



<ul class="wp-block-list">
<li><img alt="B_{j,b} := [0,b-2] \cup \{b-2+j\}" class="latex" src="https://s0.wp.com/latex.php?latex=B_%7Bj%2Cb%7D+%3A%3D+%5B0%2Cb-2%5D+%5Ccup+%5C%7Bb-2%2Bj%5C%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> with choices of <img alt="b \in [3, k-k^\gamma]" class="latex" src="https://s0.wp.com/latex.php?latex=b+%5Cin+%5B3%2C+k-k%5E%5Cgamma%5D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="j \in [1,hb]" class="latex" src="https://s0.wp.com/latex.php?latex=j+%5Cin+%5B1%2Chb%5D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>.</li>



<li><img alt="G_{m,r_m}" class="latex" src="https://s0.wp.com/latex.php?latex=G_%7Bm%2Cr_m%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> for each value of <img alt="m \in [3, h]" class="latex" src="https://s0.wp.com/latex.php?latex=m+%5Cin+%5B3%2C+h%5D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, with choices of <img alt="r_m \in [0, (k-b)^\alpha]" class="latex" src="https://s0.wp.com/latex.php?latex=r_m+%5Cin+%5B0%2C+%28k-b%29%5E%5Calpha%5D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>.</li>



<li><img alt="H_{m,u_m}" class="latex" src="https://s0.wp.com/latex.php?latex=H_%7Bm%2Cu_m%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> for each value of <img alt="m \in [2,h-1]" class="latex" src="https://s0.wp.com/latex.php?latex=m+%5Cin+%5B2%2Ch-1%5D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, with choices of <img alt="u_m \in [0, (k-b)^\beta]" class="latex" src="https://s0.wp.com/latex.php?latex=u_m+%5Cin+%5B0%2C+%28k-b%29%5E%5Cbeta%5D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>.</li>



<li>A <img alt="B_h" class="latex" src="https://s0.wp.com/latex.php?latex=B_h&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> set of the correct size so that <img alt="|A| = k" class="latex" src="https://s0.wp.com/latex.php?latex=%7CA%7C+%3D+k&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>.</li>
</ul>



<p class="wp-block-paragraph">One reason that this construction needs to be complicated is that we need to create at least <img alt="\Omega(k^h)" class="latex" src="https://s0.wp.com/latex.php?latex=%5COmega%28k%5Eh%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> many sets. To do this, we vary <img alt="2h-4" class="latex" src="https://s0.wp.com/latex.php?latex=2h-4&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> parameters <img alt="r_m" class="latex" src="https://s0.wp.com/latex.php?latex=r_m&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="u_m" class="latex" src="https://s0.wp.com/latex.php?latex=u_m&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> in the domain <img alt="[0,k^\alpha]" class="latex" src="https://s0.wp.com/latex.php?latex=%5B0%2Ck%5E%5Calpha%5D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="2" class="latex" src="https://s0.wp.com/latex.php?latex=2&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> parameters <img alt="b" class="latex" src="https://s0.wp.com/latex.php?latex=b&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="j" class="latex" src="https://s0.wp.com/latex.php?latex=j&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> in the domain <img alt="[1,hk]" class="latex" src="https://s0.wp.com/latex.php?latex=%5B1%2Chk%5D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. We can choose <img alt="\alpha" class="latex" src="https://s0.wp.com/latex.php?latex=%5Calpha&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> to be slightly bigger than <img alt="1/2" class="latex" src="https://s0.wp.com/latex.php?latex=1%2F2&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, and then the above construction gives us <img alt="O(k^{\alpha(2h-4)+ 2})=O(k^{h + \delta})" class="latex" src="https://s0.wp.com/latex.php?latex=O%28k%5E%7B%5Calpha%282h-4%29%2B+2%7D%29%3DO%28k%5E%7Bh+%2B+%5Cdelta%7D%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> different sets where <img alt="\delta &gt;0" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cdelta+%3E0&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> can be made arbitrarily small. So, if we were to remove any of the above parameters from the construction, and not change the others, this construction would no longer create <img alt="\Omega(k^h)" class="latex" src="https://s0.wp.com/latex.php?latex=%5COmega%28k%5Eh%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> many sets. In comparison, Nathanson’s construction when <img alt="h=2" class="latex" src="https://s0.wp.com/latex.php?latex=h%3D2&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> only needs to create <img alt="\Omega(k^2)" class="latex" src="https://s0.wp.com/latex.php?latex=%5COmega%28k%5E2%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> sets. He does this by combining a Sidon set, an arithmetic progression, and one extra value, and varying the size of the arithmetic progression and the extra value in ranges of size <img alt="O(k)" class="latex" src="https://s0.wp.com/latex.php?latex=O%28k%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>.</p>



<p class="wp-block-paragraph">We want to combine <img alt="q = 2h-2" class="latex" src="https://s0.wp.com/latex.php?latex=q+%3D+2h-2&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> sets <img alt="A_1,\ldots,A_q" class="latex" src="https://s0.wp.com/latex.php?latex=A_1%2C%5Cldots%2CA_q&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, which are given by <img alt="B_{j,b}" class="latex" src="https://s0.wp.com/latex.php?latex=B_%7Bj%2Cb%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, <img alt="G_{m,r_m}" class="latex" src="https://s0.wp.com/latex.php?latex=G_%7Bm%2Cr_m%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> for the <img alt="h-2" class="latex" src="https://s0.wp.com/latex.php?latex=h-2&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> values of <img alt="m \in [3,h]" class="latex" src="https://s0.wp.com/latex.php?latex=m+%5Cin+%5B3%2Ch%5D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, <img alt="H_{m,u_m}" class="latex" src="https://s0.wp.com/latex.php?latex=H_%7Bm%2Cu_m%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> for the <img alt="h-2" class="latex" src="https://s0.wp.com/latex.php?latex=h-2&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> values of <img alt="m \in [2,h-1]" class="latex" src="https://s0.wp.com/latex.php?latex=m+%5Cin+%5B2%2Ch-1%5D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, and a <img alt="B_h" class="latex" src="https://s0.wp.com/latex.php?latex=B_h&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> set. By Appendix 1, for all <img alt="r \leq k" class="latex" src="https://s0.wp.com/latex.php?latex=r+%5Cleq+k&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, there exists a <img alt="h^2" class="latex" src="https://s0.wp.com/latex.php?latex=h%5E2&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>-dissociated set <img alt="{u_{1},\ldots,u_{r}}" class="latex" src="https://s0.wp.com/latex.php?latex=%7Bu_%7B1%7D%2C%5Cldots%2Cu_%7Br%7D%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> of diameter <img alt="M \leq r^{2h^2} \leq k^{2h^2}" class="latex" src="https://s0.wp.com/latex.php?latex=M+%5Cleq+r%5E%7B2h%5E2%7D+%5Cleq+k%5E%7B2h%5E2%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. By the constructions of <img alt="G_{m,r_m}" class="latex" src="https://s0.wp.com/latex.php?latex=G_%7Bm%2Cr_m%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="H_{m,u_m}" class="latex" src="https://s0.wp.com/latex.php?latex=H_%7Bm%2Cu_m%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, we can take each <img alt="A_i \subseteq [0,M]" class="latex" src="https://s0.wp.com/latex.php?latex=A_i+%5Csubseteq+%5B0%2CM%5D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, where <img alt="M \leq hk^{2h^2}" class="latex" src="https://s0.wp.com/latex.php?latex=M+%5Cleq+hk%5E%7B2h%5E2%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. Let <img alt="\mathbb{Z}^{2q}" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathbb%7BZ%7D%5E%7B2q%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> have basis vectors <img alt="e_1,\ldots,e_{2q}" class="latex" src="https://s0.wp.com/latex.php?latex=e_1%2C%5Cldots%2Ce_%7B2q%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. To combine <img alt="A_1,\ldots,A_q" class="latex" src="https://s0.wp.com/latex.php?latex=A_1%2C%5Cldots%2CA_q&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, we can define <img alt="A \subseteq \mathbb{Z}^{2q}" class="latex" src="https://s0.wp.com/latex.php?latex=A+%5Csubseteq+%5Cmathbb%7BZ%7D%5E%7B2q%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> as</p>



<p class="wp-block-paragraph"><img alt="\displaystyle A = \bigcup_{i=1}^q (A_i e_i + e_{q+i}) \subseteq \{0,1,2,\ldots,M\}^{2q} \subseteq \mathbb{Z}^{2q}." class="latex" src="https://s0.wp.com/latex.php?latex=%5Cdisplaystyle+A+%3D+%5Cbigcup_%7Bi%3D1%7D%5Eq+%28A_i+e_i+%2B+e_%7Bq%2Bi%7D%29+%5Csubseteq+%5C%7B0%2C1%2C2%2C%5Cldots%2CM%5C%7D%5E%7B2q%7D+%5Csubseteq+%5Cmathbb%7BZ%7D%5E%7B2q%7D.&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></p>



<p class="wp-block-paragraph">Similarly to my Lemma 4.9, this construction ensures that the generating function product <img alt="\mathcal{F}_{A}(z) = \prod_{i=1}^q \mathcal{F}_{A_i}(z)" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathcal%7BF%7D_%7BA%7D%28z%29+%3D+%5Cprod_%7Bi%3D1%7D%5Eq+%5Cmathcal%7BF%7D_%7BA_i%7D%28z%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> holds, which is the identity that both my paper and the GPT preprint use (see either paper for a definition of these generating functions). By (the standard) Lemma 2.3 of the GPT preprint, <img alt="A" class="latex" src="https://s0.wp.com/latex.php?latex=A&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is Freiman-isomorphic of order <img alt="h" class="latex" src="https://s0.wp.com/latex.php?latex=h&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> to a subset of <img alt="[0,2qM(2hM)^{2q-1}]" class="latex" src="https://s0.wp.com/latex.php?latex=%5B0%2C2qM%282hM%29%5E%7B2q-1%7D%5D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. Therefore, for <img alt="k" class="latex" src="https://s0.wp.com/latex.php?latex=k&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> sufficiently large (the whole construction relies on this for the same reasons as in my paper),</p>



<p class="wp-block-paragraph"><img alt="\displaystyle N(h,k) \leq 2qM(2hM)^{2q-1} \leq 2\left(2h^2k^{2h^2}\right)^{2(2h-2)} \leq k^{10 h^3}." class="latex" src="https://s0.wp.com/latex.php?latex=%5Cdisplaystyle+N%28h%2Ck%29+%5Cleq+2qM%282hM%29%5E%7B2q-1%7D+%5Cleq+2%5Cleft%282h%5E2k%5E%7B2h%5E2%7D%5Cright%29%5E%7B2%282h-2%29%7D+%5Cleq+k%5E%7B10+h%5E3%7D.&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/></p>



<h2 class="wp-block-heading">Appendix 3 (Isaac)</h2>



<p class="wp-block-paragraph">In Section 4.2 of my paper, I use a different, simpler construction to construct sets <img alt="A" class="latex" src="https://s0.wp.com/latex.php?latex=A&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> achieving the values in <img alt="\mathcal{R}(h,k)" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathcal%7BR%7D%28h%2Ck%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> which have <img alt="|hA| &lt; \varepsilon k^h" class="latex" src="https://s0.wp.com/latex.php?latex=%7ChA%7C+%3C+%5Cvarepsilon+k%5Eh&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, for some small <img alt="\varepsilon" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cvarepsilon&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. These sets <img alt="A" class="latex" src="https://s0.wp.com/latex.php?latex=A&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> are subsets of <img alt="{0,1,2,\ldots,k^h}" class="latex" src="https://s0.wp.com/latex.php?latex=%7B0%2C1%2C2%2C%5Cldots%2Ck%5Eh%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>, meaning that all elements have polynomial size in <img alt="k" class="latex" src="https://s0.wp.com/latex.php?latex=k&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. This is observed in Section 5 of the GPT preprint.</p>



<p class="wp-block-paragraph">Section 4.3 of my paper carries out the construction which combines many components including <img alt="S" class="latex" src="https://s0.wp.com/latex.php?latex=S&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and <img alt="T" class="latex" src="https://s0.wp.com/latex.php?latex=T&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. This corresponds to Sections 2, 3, 4, and 6 of the GPT preprint. This section has a lot of moving parts; I give an outline in Section 4.3.1.</p>



<p class="wp-block-paragraph">In Section 4.3.2, I describe how the different components will be combined, using a construction which I call the disjoint union, and introduce generating functions <img alt="\mathcal{F}_A(z)" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathcal%7BF%7D_A%28z%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> as a bookkeeping tool to keep track of the sumset sizes of a set <img alt="A" class="latex" src="https://s0.wp.com/latex.php?latex=A&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. This corresponds to Section 2 and Section 4 of the GPT preprint.</p>



<p class="wp-block-paragraph">In Section 4.3.3, I compute the generating function of each of the component sets, including <img alt="\mathcal{F}_S(z)" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathcal%7BF%7D_S%28z%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> (Lemma 4.15) and <img alt="\mathcal{F}_T(z)" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathcal%7BF%7D_T%28z%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> (Lemma 4.17). This corresponds to Section 3 and Section 6.1 of the GPT preprint. In particular, <img alt="\mathcal{F}_{G}(z)" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathcal%7BF%7D_%7BG%7D%28z%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is computed in Lemma 3.3 and <img alt="\mathcal{F}_{H}(z)" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cmathcal%7BF%7D_%7BH%7D%28z%29&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> is computed in Lemma 3.4. Once these generating functions have been computed, the remainder of the proof is almost identical in my paper and in the GPT preprint.</p>



<p class="wp-block-paragraph">In Section 4.3.4, I put all the pieces together to show that as we range over the sets <img alt="A" class="latex" src="https://s0.wp.com/latex.php?latex=A&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> which I have constructed, the values of <img alt="|hA|" class="latex" src="https://s0.wp.com/latex.php?latex=%7ChA%7C&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> will assume all of the elements of <img alt="{\lceil\varepsilon k^h\rceil, \lceil\varepsilon k^h\rceil+1,\ldots ,\binom{h+k-1}{h} }" class="latex" src="https://s0.wp.com/latex.php?latex=%7B%5Clceil%5Cvarepsilon+k%5Eh%5Crceil%2C+%5Clceil%5Cvarepsilon+k%5Eh%5Crceil%2B1%2C%5Cldots+%2C%5Cbinom%7Bh%2Bk-1%7D%7Bh%7D+%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>. The key idea is to show that the set of all values of <img alt="|hA|" class="latex" src="https://s0.wp.com/latex.php?latex=%7ChA%7C&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> forms an interval, and contains numbers both smaller than <img alt="\varepsilon k^h" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cvarepsilon+k%5Eh&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/> and equal to <img alt="\binom{h+k-1}{h}" class="latex" src="https://s0.wp.com/latex.php?latex=%5Cbinom%7Bh%2Bk-1%7D%7Bh%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0&amp;c=20201002"/>.</p></div>
    </content>
    <updated>2026-05-09T11:50:08Z</updated>
    <published>2026-05-08T15:40:04Z</published>
    <category scheme="https://gowers.wordpress.com" term="Computing"/>
    <category scheme="https://gowers.wordpress.com" term="Straight maths"/>
    <category scheme="https://gowers.wordpress.com" term="ai"/>
    <category scheme="https://gowers.wordpress.com" term="mathematics"/>
    <author>
      <name>gowers</name>
      <uri>https://gowers.wordpress.com</uri>
    </author>
    <source>
      <id>http://gowers.wordpress.com/feed/atom/</id>
      <link href="https://gowers.wordpress.com" rel="alternate" type="text/html"/>
      <link href="https://gowers.wordpress.com/feed/atom/" rel="self" type="application/atom+xml"/>
      <link href="https://gowers.wordpress.com/osd.xml" rel="search" title="Gowers's Weblog" type="application/opensearchdescription+xml"/>
      <link href="https://s1.wp.com/opensearch.xml" rel="search" title="WordPress.com" type="application/opensearchdescription+xml"/>
      <link href="https://gowers.wordpress.com/?pushpress=hub" rel="hub" type="text/html"/>
      <subtitle xml:lang="en">Mathematics related discussions</subtitle>
      <title xml:lang="en">Gowers's Weblog</title>
      <updated>2026-08-13T07:34:46Z</updated>
    </source>
  </entry>

  <entry xml:lang="en-US">
    <id>https://asymptotia.com/?p=20368</id>
    <link href="https://asymptotia.com/2026/04/14/computing-correlators/" rel="alternate" type="text/html"/>
    <link href="https://asymptotia.com/2026/04/14/computing-correlators/#comments" rel="replies" type="text/html"/>
    <link href="https://asymptotia.com/2026/04/14/computing-correlators/feed/atom/" rel="replies" type="application/atom+xml"/>
    <title xml:lang="en-US">Computing Correlators</title>
    <summary type="xhtml" xml:lang="en-US"><div xmlns="http://www.w3.org/1999/xhtml"><p><strong>[A more technical post follows]</strong></p>
<p>My most recent paper, <a href="https://arxiv.org/abs/2604.11902">out on the arXiv today</a>, is very exciting to me because it seems to be a genuinely new way of computing some important quantities and it is devilishly simple. So simple that I worried for months that it is all super-obvious to everyone. But another voice within me said to myself: Well if it is so obvious, why has nobody published it? Another (paranoid) voice within  said: Maybe someone has published this method, and I just can't find it in the literature...</p>
<p>Well, I decided that the best way to find out for sure is to put it on the arXiv and within a short time someone will email to say that I missed their important work. So, while I wait for that email (as I start writing it's only been 30 minutes since it has been "out there", so there's time), let me say a few things about why I like the many results in the paper.</p>
<p>I was already pleased enough with the core part of the paper that I was going to write a swift four-pager about it back in February. The core point being that I figured out how to build on work I'd done in a paper back in 2024 (expanded on with followup work I did with Wasif Ahmed and Krishan Saraswat, a student and postoc). Back in 2024, I found (<a href="https://arxiv.org/abs/2401.06220">here</a>) a really nice way (almost miraculous in how it worked) of writing all the corrections to the spectral density of a class of models in terms of one function [latex]u_0[/latex] and its derivatives. It was obtainable from one simple ordinary differential equation (ODE) called the Gel'fand-Dikii equation, which takes in the function [latex]u_0(x)[/latex] as input. The ODE is for a special quantity called the diagonal resolvent [latex]{\widehat R}(x,E)[/latex]. You integrate that quantity [latex]\widehat R(x,E)[/latex] with respect to [latex]x[/latex]  and you're more or less home.  In general, it is a messy quantity that does not integrate to anything nice. But just when the function [latex]u(x)[/latex] obeys the "string equation" it is supposed to (as dictated by the governing model's physics), then [latex]{\widehat R}(x,E)[/latex] is a total derivative (a seeming miracle-see later), and the corrections it gives to the density become of just the right form!</p>
<p>Those corrections can be called [latex]W_{g,1}(E)[/latex] where the [latex]g[/latex] is the order in perturbation theory. [latex]g=0[/latex] is leading order, [latex]g=1[/latex] is the torus, [latex]g=2[/latex] the double torus, etc. Indeed [latex]g[/latex] is the number of handles or "genus" of an associated Riemann surface. The one subscript on the other hand, corresponds to the one energy entry available when just discussing the density [latex]\rho(E)[/latex]. All the [latex]W_{g,1}[/latex] end up being written nicely in terms of a function [latex]u_0(x)[/latex] and its derivatives, evaluated at a special point. </p>
<p>An already nice feature (among many) of the construction was that this one ODE, recursively solved, gave rise to the [latex]W_{g,1}[/latex] of many different problems across a range, including certain random matrix models, gravity problems, intersection theory and topology, and so on. All you need to do is change the function [latex]u_0(x)[/latex]. Moreover, for this (wide) class of problems, you can compute the desired results faster and with way less machninery than other methods, such as topological recursion, which was an interesting observation. This includes very famous problems like the Weil-Petersson volumes  (of the compactified moduli space [latex]\overline{\cal M}_{g,1}[/latex] of Riemann surfaces with genus [latex]g[/latex] and [latex]n=1[/latex] boundaries) and generalisations. Another nice feature is that you also get non-perturbative data beyond the genus expansion, an aspect I explored recently (in <a href="https://arxiv.org/abs/2601.03351">this paper</a>) with student Joao Rodrigues, and expert in resurgence techniques.</p>
<p> <a href="http://asymptotia.com/wp-images/2026/04/W24png.png"><img alt="" class="alignright size-thumbnail wp-image-20375" height="119" src="http://asymptotia.com/wp-images/2026/04/W24png-150x119.png" width="150"/></a>The core breakthrough  of the new paper is this: For some time, I've wondered how to compute correlators for more energies (amounting to  multi-point correlators of [latex]\rho[/latex]) in this same way: [...] <a class="continue-reading-link" href="https://asymptotia.com/2026/04/14/computing-correlators/"> Click to continue reading this post <span class="meta-nav">→ </span></a></p>
<p>The post <a href="https://asymptotia.com/2026/04/14/computing-correlators/">Computing Correlators</a> appeared first on <a href="https://asymptotia.com">Asymptotia</a>.</p></div>
    </summary>
    <updated>2026-04-16T06:20:03Z</updated>
    <published>2026-04-15T06:33:21Z</published>
    <category scheme="https://asymptotia.com/" term="research"/>
    <category scheme="https://asymptotia.com/" term="science"/>
    <category scheme="https://asymptotia.com/" term="string theory"/>
    <category scheme="https://asymptotia.com/" term="work"/>
    <author>
      <name>Clifford</name>
      <uri>http://asymptotia.com</uri>
    </author>
    <source>
      <id>https://asymptotia.com/feed/atom/</id>
      <link href="https://asymptotia.com/" rel="alternate" type="text/html"/>
      <link href="https://asymptotia.com/feed/atom/" rel="self" type="application/atom+xml"/>
      <title xml:lang="en-US">Asymptotia</title>
      <updated>2026-07-25T05:15:03Z</updated>
    </source>
  </entry></feed>
