<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="assets/xml/rss.xsl" media="all"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Lean community blog</title><link>https://leanprover-community.github.io/blog/</link><description>This is the blog of the Lean prover community.</description><atom:link href="https://leanprover-community.github.io/blog/rss.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2026 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Wed, 15 Apr 2026 15:35:44 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>The Sphere Packing Project | Post 1 - The Story</title><link>https://leanprover-community.github.io/blog/posts/SpherePacking-1/</link><dc:creator>Chris Birkbeck, Sidharth Hariharan, Seewoo Lee</dc:creator><description>&lt;div&gt;&lt;p&gt;The Sphere Packing Project maintainers tell the story of the project, up to the recent autoformalisation.&lt;/p&gt;
&lt;p&gt;&lt;a href="https://leanprover-community.github.io/blog/posts/SpherePacking-1/"&gt;Read more…&lt;/a&gt; (10 min remaining to read)&lt;/p&gt;&lt;/div&gt;</description><guid>https://leanprover-community.github.io/blog/posts/SpherePacking-1/</guid><pubDate>Tue, 03 Mar 2026 03:35:00 GMT</pubDate></item><item><title>Fantastic Simprocs and How to Write Them</title><link>https://leanprover-community.github.io/blog/posts/simprocs-tutorial/</link><dc:creator>Yaël Dillies, Paul Lezeau</dc:creator><description>&lt;div&gt;&lt;p&gt;This is the final post in our simproc series.
In our first two posts, we gave an informal introduction to the concept of a &lt;em&gt;simproc&lt;/em&gt;,
and a brief overview of the inner workings of the &lt;code&gt;simp&lt;/code&gt; tactic.
The aim of this final post is to build on this by demonstrating how Lean users can write their own simprocs.&lt;/p&gt;
&lt;p&gt;&lt;a href="https://leanprover-community.github.io/blog/posts/simprocs-tutorial/"&gt;Read more…&lt;/a&gt; (12 min remaining to read)&lt;/p&gt;&lt;/div&gt;</description><category>meta</category><category>simp</category><category>simproc</category><guid>https://leanprover-community.github.io/blog/posts/simprocs-tutorial/</guid><pubDate>Fri, 27 Feb 2026 11:00:00 GMT</pubDate></item><item><title>Tradeoffs of defining types as subobjects</title><link>https://leanprover-community.github.io/blog/posts/tradeoff-of-defining-types-as-subobjects/</link><dc:creator>Yaël Dillies</dc:creator><description>&lt;div&gt;&lt;p&gt;It often happens in formalisation that a type of interest is a subobject of another type of interest.
For example, the unit circle in the complex plane is naturally a submonoid&lt;sup id="fnref:1"&gt;&lt;a class="footnote-ref" href="https://leanprover-community.github.io/blog/posts/tradeoff-of-defining-types-as-subobjects/#fn:1"&gt;1&lt;/a&gt;&lt;/sup&gt;.&lt;/p&gt;
&lt;p&gt;What is the best way of defining this unit circle on top of &lt;code&gt;Complex&lt;/code&gt;?
This blog post examines the pros and cons of the available designs.&lt;/p&gt;
&lt;p&gt;&lt;a href="https://leanprover-community.github.io/blog/posts/tradeoff-of-defining-types-as-subobjects/"&gt;Read more…&lt;/a&gt; (3 min remaining to read)&lt;/p&gt;&lt;/div&gt;</description><guid>https://leanprover-community.github.io/blog/posts/tradeoff-of-defining-types-as-subobjects/</guid><pubDate>Tue, 13 Jan 2026 12:00:00 GMT</pubDate></item><item><title>Simp, made simple.</title><link>https://leanprover-community.github.io/blog/posts/simp-made-simple/</link><dc:creator>Yaël Dillies, Paul Lezeau</dc:creator><description>&lt;div&gt;&lt;p&gt;This is the second blog post in a series of three.
In &lt;a href="https://leanprover-community.github.io/blog/posts/simprocs-for-the-working-mathematician/"&gt;the first blog post&lt;/a&gt;, we introduced the notion of a &lt;em&gt;simproc&lt;/em&gt;, which can be thought of as a form of "modular" simp lemma.
In this sequel, we give a more detailed exposition of the inner workings of the simp tactic in preparation of our third post, where we will see how to write new simprocs.&lt;/p&gt;
&lt;p&gt;&lt;a href="https://leanprover-community.github.io/blog/posts/simp-made-simple/"&gt;Read more…&lt;/a&gt; (12 min remaining to read)&lt;/p&gt;&lt;/div&gt;</description><category>meta</category><category>simp</category><category>simproc</category><guid>https://leanprover-community.github.io/blog/posts/simp-made-simple/</guid><pubDate>Tue, 02 Dec 2025 11:00:00 GMT</pubDate></item><item><title>Formalizing Class Field Theory</title><link>https://leanprover-community.github.io/blog/posts/cmi-class-field-theory-workshop/</link><dc:creator>Georgia Harbor-Collins and Mohit Hulse</dc:creator><description>&lt;div&gt;&lt;p&gt;This is a brief report on the &lt;a href="https://www.claymath.org/events/formalizing-class-field-theory/"&gt;CMI HIMR Summer School on Formalizing Class Field Theory&lt;/a&gt;, held at the Mathematical Institute, University of Oxford on 21–25 July, 2025.&lt;/p&gt;
&lt;p&gt;&lt;a href="https://leanprover-community.github.io/blog/posts/cmi-class-field-theory-workshop/"&gt;Read more…&lt;/a&gt; (3 min remaining to read)&lt;/p&gt;&lt;/div&gt;</description><guid>https://leanprover-community.github.io/blog/posts/cmi-class-field-theory-workshop/</guid><pubDate>Fri, 22 Aug 2025 17:00:00 GMT</pubDate></item><item><title>Simons Foundation Lean Workshop</title><link>https://leanprover-community.github.io/blog/posts/simons-lean-workshop/</link><dc:creator>Antoine Chambert-Loir, Alex Kontorovich, and Heather MacBeth</dc:creator><description>&lt;div&gt;&lt;p&gt;This is a report on the Simons Foundation's 2025 MPS (Mathematics and Physical Sciences) &lt;a href="https://www.simonsfoundation.org/event/2025-mps-workshop-on-lean/"&gt;Workshop on Lean&lt;/a&gt;, held in New York City on June 16 - 25, 2025.&lt;/p&gt;
&lt;p&gt;&lt;a href="https://leanprover-community.github.io/blog/posts/simons-lean-workshop/"&gt;Read more…&lt;/a&gt; (13 min remaining to read)&lt;/p&gt;&lt;/div&gt;</description><guid>https://leanprover-community.github.io/blog/posts/simons-lean-workshop/</guid><pubDate>Sun, 03 Aug 2025 17:00:00 GMT</pubDate></item><item><title>Searching for Theorems in Mathlib</title><link>https://leanprover-community.github.io/blog/posts/searching-for-theorems-in-mathlib/</link><dc:creator>Bolton Bailey</dc:creator><description>&lt;div&gt;&lt;p&gt;A post for beginners on the different ways to search for theorems in mathlib, inspired by &lt;a href="https://www.youtube.com/watch?v=UJrYKR01QwU"&gt;this talk&lt;/a&gt; from Jireh Loreaux.&lt;/p&gt;
&lt;p&gt;&lt;a href="https://leanprover-community.github.io/blog/posts/searching-for-theorems-in-mathlib/"&gt;Read more…&lt;/a&gt; (9 min remaining to read)&lt;/p&gt;&lt;/div&gt;</description><guid>https://leanprover-community.github.io/blog/posts/searching-for-theorems-in-mathlib/</guid><pubDate>Wed, 25 Jun 2025 09:26:31 GMT</pubDate></item><item><title>The correspondence between affine group schemes and Hopf algebras</title><link>https://leanprover-community.github.io/blog/posts/affine-group-schemes-hopf-algebra/</link><dc:creator>Yaël Dillies, Michał Mrugała, Andrew Yang</dc:creator><description>&lt;div&gt;&lt;p&gt;This February saw the birth of the &lt;a href="https://github.com/YaelDillies/Toric"&gt;&lt;strong&gt;Toric&lt;/strong&gt;&lt;/a&gt; project,
whose aim is to build the theory of toric varieties
following &lt;em&gt;Toric Varieties&lt;/em&gt; by Cox, Little and Schenck.&lt;/p&gt;
&lt;p&gt;We soon discovered that toric varieties contained tori, and that Mathlib didn't.&lt;/p&gt;
&lt;p&gt;This blog post is a double announcement:&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;The unexpected prerequisite of algebraic tori was recently cleared;&lt;/li&gt;
&lt;li&gt;We are looking for contributors to help with the second phase of the project,
  i.e. toric geometry and its relation to convex geometry.&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;&lt;a href="https://leanprover-community.github.io/blog/posts/affine-group-schemes-hopf-algebra/"&gt;Read more…&lt;/a&gt; (9 min remaining to read)&lt;/p&gt;&lt;/div&gt;</description><category>algebraic geometry</category><category>Toric</category><guid>https://leanprover-community.github.io/blog/posts/affine-group-schemes-hopf-algebra/</guid><pubDate>Tue, 24 Jun 2025 16:40:00 GMT</pubDate></item><item><title>Theorems about abelian categories</title><link>https://leanprover-community.github.io/blog/posts/abelian-categories/</link><dc:creator>Markus Himmel and Joël Riou</dc:creator><description>&lt;div&gt;&lt;p&gt;Two significant results about abelian categories have recently been
added to mathlib. The first is that any Grothendieck
abelian category has enough injectives, and it follows from a
general construction known as the small object argument. The second
is the Freyd-Mitchell theorem which states that any abelian
category admits a fully faithful exact functor to a category
of modules.&lt;/p&gt;
&lt;p&gt;&lt;a href="https://leanprover-community.github.io/blog/posts/abelian-categories/"&gt;Read more…&lt;/a&gt; (14 min remaining to read)&lt;/p&gt;&lt;/div&gt;</description><guid>https://leanprover-community.github.io/blog/posts/abelian-categories/</guid><pubDate>Tue, 17 Jun 2025 09:15:00 GMT</pubDate></item><item><title>Simprocs for the Working Mathematician</title><link>https://leanprover-community.github.io/blog/posts/simprocs-for-the-working-mathematician/</link><dc:creator>Yaël Dillies, Paul Lezeau</dc:creator><description>&lt;div&gt;&lt;p&gt;Lean v4.6.0 (back in February 2024!) added support for custom simplification procedures, aka &lt;em&gt;simprocs&lt;/em&gt;.
This blog post is the first in a series of three aimed at explaining what a simproc is, what kind of problems can be solved with simprocs, and what tools we have to write them.
Here is &lt;a href="https://leanprover-community.github.io/blog/posts/simp-made-simple/"&gt;the second blog post&lt;/a&gt;.&lt;/p&gt;
&lt;p&gt;&lt;a href="https://leanprover-community.github.io/blog/posts/simprocs-for-the-working-mathematician/"&gt;Read more…&lt;/a&gt; (9 min remaining to read)&lt;/p&gt;&lt;/div&gt;</description><category>meta</category><category>simp</category><category>simproc</category><guid>https://leanprover-community.github.io/blog/posts/simprocs-for-the-working-mathematician/</guid><pubDate>Mon, 26 May 2025 14:00:00 GMT</pubDate></item></channel></rss>