<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
<channel>
  <title>Kim Morrison</title>
  <description>Notes on Lean, tactics, and making the theorem prover do more work.</description>
  <link>https://kim-em.github.io</link>
  <atom:link href="https://kim-em.github.io/feed.xml" rel="self" type="application/rss+xml" />
  <lastBuildDate>Thu, 12 Nov 2026 00:00:00 +0000</lastBuildDate>
  <item>
    <title>Computational permutation groups in Lean</title>
    <link>https://kim-em.github.io/blog/2026-11-12-computational-permutation-groups-in-lean/</link>
    <guid isPermaLink="true">https://kim-em.github.io/blog/2026-11-12-computational-permutation-groups-in-lean/</guid>
    <pubDate>Thu, 12 Nov 2026 00:00:00 +0000</pubDate>
    <category>computer algebra</category>
    <category>lean</category>
    <category>tactics</category>
    <description>Hex now has a perm_group tactic, which uses the Schreier-Sims algorithm to answer many questions about permutation groups. Here we calculate the order of the Mathieu group M11 (defined as a group generated by two permutations). HexPermGroup contains the tactic, and HexPermGroupTheory contains additional glue that teaches the tactic how to work with Mathlib&apos;s permutations.</description>
  </item>
  <item>
    <title>Axiom&apos;s formalization of the Stacks project</title>
    <link>https://kim-em.github.io/blog/2026-11-5-axioms-formalization-of-the-stacks-project/</link>
    <guid isPermaLink="true">https://kim-em.github.io/blog/2026-11-5-axioms-formalization-of-the-stacks-project/</guid>
    <pubDate>Thu, 05 Nov 2026 00:00:00 +0000</pubDate>
    <category>lean</category>
    <description>Axiom Math announced today that they&apos;ve formalized the entire Stacks project in Lean. This is really awesome. The Stacks project is a beautiful contribution to modern mathematics, that a generation of algebraic geometers have used for learning and for reference. Having the whole thing formalized (but see below!) in Lean will unlock lots of new work, and help accelerate research.</description>
  </item>
  <item>
    <title>All 100 theorems in Lean</title>
    <link>https://kim-em.github.io/blog/2026-10-30-all-100-theorems-in-lean/</link>
    <guid isPermaLink="true">https://kim-em.github.io/blog/2026-10-30-all-100-theorems-in-lean/</guid>
    <pubDate>Fri, 30 Oct 2026 00:00:00 +0000</pubDate>
    <category>lean</category>
    <description>Freek Wiedijk has for many years maintained a list of 100 significant theorems in mathematics, and kept track of which interactive theorem proving languages have checked proofs of these theorems. For the first time, a single language now has proofs of all 100 theorems: Lean! And I&apos;m very pleased to report that the 100th theorem completed in Lean was a strong formulation of Green&apos;s theorem, which landed in Tau Ceti, the library of all mathematics that we&apos;re autoformalizing with the Lean FRO and M…</description>
  </item>
  <item>
    <title>Exact algebraic numbers and number fields in Lean</title>
    <link>https://kim-em.github.io/blog/2026-9-8-exact-algebraic-numbers-and-number-fields-in-lean/</link>
    <guid isPermaLink="true">https://kim-em.github.io/blog/2026-9-8-exact-algebraic-numbers-and-number-fields-in-lean/</guid>
    <pubDate>Tue, 08 Sep 2026 00:00:00 +0000</pubDate>
    <category>computer algebra</category>
    <category>lean</category>
    <description>I&apos;m happy to announce the release of further packages for Hex, the computer algebra library for Lean, following lattice basis reduction, certified integer polynomial factorization and certified graph isomorphism. Today we have exact algebraic numbers, and arithmetic and factorization in number fields. Everything below is compiled as part of building this page, against the released v0.10.0; the Hex manual covers these libraries and the rest of Hex in full. To follow along, add to your lakefile.to…</description>
  </item>
  <item>
    <title>Certified graph isomorphism in Lean</title>
    <link>https://kim-em.github.io/blog/2026-9-5-certified-graph-isomorphism-in-lean/</link>
    <guid isPermaLink="true">https://kim-em.github.io/blog/2026-9-5-certified-graph-isomorphism-in-lean/</guid>
    <pubDate>Sat, 05 Sep 2026 00:00:00 +0000</pubDate>
    <category>computer algebra</category>
    <category>lean</category>
    <category>tactics</category>
    <description>I&apos;m very excited to release HexGraphIso, a new sublibrary of Hex, which implements (a subset of) Brendan McKay&apos;s nauty in Lean, proves it correct, and provides a tactic layer.</description>
  </item>
  <item>
    <title>Announcing the Palomar Registry</title>
    <link>https://kim-em.github.io/blog/2026-8-19-announcing-the-palomar-registry/</link>
    <guid isPermaLink="true">https://kim-em.github.io/blog/2026-8-19-announcing-the-palomar-registry/</guid>
    <pubDate>Wed, 19 Aug 2026 00:00:00 +0000</pubDate>
    <category>lean</category>
    <description>Today we&apos;re launching the Palomar Registry, an index of formalized mathematics repositories with a valid #comparator setup and #formalization.yaml metadata. Limited automatic review rejects submissions with obvious discrepancies between the informal and formal statements, and errors in the metadata. This is jointly incubated by the Lean FRO and ICARM, and the initial advisory board consists of Jeremy Avigad, Matthew Ballard, Jaume de Dios, Nestor Guillen, Bryna Kra, Kim Morrison, Terence Tao, Ra…</description>
  </item>
  <item>
    <title>Tau Ceti: ten theorems from the first month</title>
    <link>https://kim-em.github.io/blog/2026-8-19-tau-ceti-ten-theorems-from-the-first-month/</link>
    <guid isPermaLink="true">https://kim-em.github.io/blog/2026-8-19-tau-ceti-ten-theorems-from-the-first-month/</guid>
    <pubDate>Wed, 19 Aug 2026 00:00:00 +0000</pubDate>
    <category>lean</category>
    <description>It&apos;s been a month since we launched, so I&apos;d like to make a brief post highlighting some of the results that have landed in Tau Ceti. We&apos;re ready for more contributors at this point. Please come to the #Tau Ceti channel to discuss contributing to the roadmaps, or if you have existing material you would like to migrate into Tau Ceti. If you&apos;d just like to point your AI at Tau Ceti, it can be as simple as uv tool install git+https://github.com/TauCetiProject/TauCetiWorker tauceti --loop</description>
  </item>
  <item>
    <title>Certified integer polynomial factorization in Lean</title>
    <link>https://kim-em.github.io/blog/2026-8-10-certified-integer-polynomial-factorization-in-lean/</link>
    <guid isPermaLink="true">https://kim-em.github.io/blog/2026-8-10-certified-integer-polynomial-factorization-in-lean/</guid>
    <pubDate>Mon, 10 Aug 2026 00:00:00 +0000</pubDate>
    <category>computer algebra</category>
    <category>lean</category>
    <category>tactics</category>
    <description>I&apos;m happy to announce the release of further packages for Hex, the computer algebra library for Lean. Today we have an integer polynomial factorization library, including tactics for factorizing and irreducibility. To get started, add to your lakefile.toml: [[require]] name = &quot;hex&quot; git = &quot;https://github.com/leanprover/hex.git&quot; rev = &quot;main&quot; and then:</description>
  </item>
  <item>
    <title>Why Lean is faster than Rust</title>
    <link>https://kim-em.github.io/blog/2026-7-24-why-lean-is-faster-than-rust/</link>
    <guid isPermaLink="true">https://kim-em.github.io/blog/2026-7-24-why-lean-is-faster-than-rust/</guid>
    <pubDate>Fri, 24 Jul 2026 00:00:00 +0000</pubDate>
    <category>performance</category>
    <category>lean</category>
    <description>I can&apos;t possibly be serious, can I, claiming that Lean is faster than Rust? Let me show you something: # silesia.tar: the 212 MB standard corpus. Each tool compresses at level 6 # and prints the resulting size in bytes; `time` reports wall-clock. $ time deflate-rust silesia.tar # miniz_oxide (pure Rust, no &apos;unsafe&apos;) 68112144 real 0m5.77s $ time deflate-lean silesia.tar # lean-zip 68054183 real 0m4.57s What&apos;s going on here? This is the lean-zip implementation of DEFLATE compressing the standard s…</description>
  </item>
  <item>
    <title>Lattice basis reduction using the Hex Lean library</title>
    <link>https://kim-em.github.io/blog/2026-7-7-lattice-basis-reduction-using-the-hex-lean-library/</link>
    <guid isPermaLink="true">https://kim-em.github.io/blog/2026-7-7-lattice-basis-reduction-using-the-hex-lean-library/</guid>
    <pubDate>Tue, 07 Jul 2026 00:00:00 +0000</pubDate>
    <category>computer algebra</category>
    <category>lean</category>
    <description>We&apos;re starting work on a computational algebra library for Lean, called Hex. We&apos;ve just released the first collection of packages, providing dense matrices, row reduction, Gram-Schmidt, and lattice basis reduction. These packages have a primarily computational focus (i.e. calculations on concrete inputs, rather than symbolic algebra), and are optimized first for runtime performance, and secondarily for performance during kernel reduction.</description>
  </item>
  <item>
    <title>Verified linear programming</title>
    <link>https://kim-em.github.io/blog/2026-6-14-verified-linear-programming/</link>
    <guid isPermaLink="true">https://kim-em.github.io/blog/2026-6-14-verified-linear-programming/</guid>
    <pubDate>Sun, 14 Jun 2026 00:00:00 +0000</pubDate>
    <category>tactics</category>
    <category>lean</category>
    <description>I&apos;ve released leanprover/lp: verified linear programming in Lean 4. It&apos;s two things at once — a proof-carrying solver you can call from your own algorithms, and a tactic frontend that behaves a bit like linarith but reaches some goals linarith can&apos;t. The examples below are all elaborated by Lean when this page is built, using the actual tactic. Nothing here is a screenshot.</description>
  </item>
  <item>
    <title>A sum of squares tactic</title>
    <link>https://kim-em.github.io/blog/2026-5-13-a-sum-of-squares-tactic/</link>
    <guid isPermaLink="true">https://kim-em.github.io/blog/2026-5-13-a-sum-of-squares-tactic/</guid>
    <pubDate>Wed, 13 May 2026 00:00:00 +0000</pubDate>
    <category>tactics</category>
    <category>lean</category>
    <description>I&apos;ve put together an sos tactic: a sum-of-squares decision procedure for nonlinear real arithmetic, closely following John Harrison&apos;s implementation in HOL Light. It closes a range of polynomial-inequality goals over the reals that we don&apos;t otherwise have good tactics for. Every example below is elaborated by Lean when this page is built — the tactic really runs, CSDP and all.</description>
  </item>
</channel>
</rss>
