Skip to content
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.

Commit 7b7c3d7

Browse files
committedJul 2, 2024
deploy site from 106b212
1 parent 9e67dcf commit 7b7c3d7

35 files changed

+156
-152
lines changed
 

‎docs/authors/adam-topaz.xml‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
<?xml version="1.0" encoding="utf-8"?>
2-
<?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 (Posts by Adam Topaz)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/authors/adam-topaz.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:42:36 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>Definitions in the liquid tensor experiment</title><link>https://leanprover-community.github.io/blog/posts/lte-examples/</link><dc:creator>Adam Topaz</dc:creator><description>&lt;div&gt;&lt;p&gt;A few weeks ago, we announced the &lt;a href="https://leanprover-community.github.io/blog/posts/lte-final/"&gt;completion of the liquid tensor experiment&lt;/a&gt; (&lt;strong&gt;LTE&lt;/strong&gt; for short).
2+
<?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 (Posts by Adam Topaz)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/authors/adam-topaz.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:44:34 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>Definitions in the liquid tensor experiment</title><link>https://leanprover-community.github.io/blog/posts/lte-examples/</link><dc:creator>Adam Topaz</dc:creator><description>&lt;div&gt;&lt;p&gt;A few weeks ago, we announced the &lt;a href="https://leanprover-community.github.io/blog/posts/lte-final/"&gt;completion of the liquid tensor experiment&lt;/a&gt; (&lt;strong&gt;LTE&lt;/strong&gt; for short).
33
What this means is that we stated and (completely) proved the following result in Lean:&lt;/p&gt;
44
&lt;pre class="code literal-block"&gt;&lt;span class="kd"&gt;variables&lt;/span&gt; &lt;span class="o"&gt;(&lt;/span&gt;&lt;span class="n"&gt;p'&lt;/span&gt; &lt;span class="n"&gt;p&lt;/span&gt; &lt;span class="o"&gt;:&lt;/span&gt; &lt;span class="n"&gt;ℝ&lt;/span&gt;&lt;span class="bp"&gt;≥&lt;/span&gt;&lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="o"&gt;)&lt;/span&gt; &lt;span class="o"&gt;[&lt;/span&gt;&lt;span class="n"&gt;fact&lt;/span&gt; &lt;span class="o"&gt;(&lt;/span&gt;&lt;span class="mi"&gt;0&lt;/span&gt; &lt;span class="bp"&gt;&amp;lt;&lt;/span&gt; &lt;span class="n"&gt;p'&lt;/span&gt;&lt;span class="o"&gt;)]&lt;/span&gt; &lt;span class="o"&gt;[&lt;/span&gt;&lt;span class="n"&gt;fact&lt;/span&gt; &lt;span class="o"&gt;(&lt;/span&gt;&lt;span class="n"&gt;p'&lt;/span&gt; &lt;span class="bp"&gt;&amp;lt;&lt;/span&gt; &lt;span class="n"&gt;p&lt;/span&gt;&lt;span class="o"&gt;)]&lt;/span&gt; &lt;span class="o"&gt;[&lt;/span&gt;&lt;span class="n"&gt;fact&lt;/span&gt; &lt;span class="o"&gt;(&lt;/span&gt;&lt;span class="n"&gt;p&lt;/span&gt; &lt;span class="bp"&gt;≤&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="o"&gt;)]&lt;/span&gt;
55

‎docs/authors/anne-baanen.xml‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
<?xml version="1.0" encoding="utf-8"?>
2-
<?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 (Posts by Anne Baanen)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/authors/anne-baanen.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:42:36 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>Dedekind domains and class number in Lean</title><link>https://leanprover-community.github.io/blog/posts/dedekind-domains-and-class-number-in-lean/</link><dc:creator>Anne Baanen</dc:creator><description>&lt;div&gt;&lt;p&gt;Pull request &lt;a href="https://github.com/leanprover-community/mathlib/pull/9071"&gt;#9701&lt;/a&gt; marks the completion of a string of additions to mathlib centered around formalizing Dedekind domains and class groups of global fields (those words will be explained below). Previous PRs had shown that nonzero ideals of a Dedekind domain factor uniquely into prime ideals, and had defined class groups in some generality. The main result in this PR is the finiteness of the class group of a global field (and in particular of the ring of integers of a number field).
2+
<?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 (Posts by Anne Baanen)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/authors/anne-baanen.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:44:35 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>Dedekind domains and class number in Lean</title><link>https://leanprover-community.github.io/blog/posts/dedekind-domains-and-class-number-in-lean/</link><dc:creator>Anne Baanen</dc:creator><description>&lt;div&gt;&lt;p&gt;Pull request &lt;a href="https://github.com/leanprover-community/mathlib/pull/9071"&gt;#9701&lt;/a&gt; marks the completion of a string of additions to mathlib centered around formalizing Dedekind domains and class groups of global fields (those words will be explained below). Previous PRs had shown that nonzero ideals of a Dedekind domain factor uniquely into prime ideals, and had defined class groups in some generality. The main result in this PR is the finiteness of the class group of a global field (and in particular of the ring of integers of a number field).
33
Formalizing these subjects has been one of my long-term goals for mathlib,
44
and as far as we are aware, Lean is the first system in which this level of algebraic number theory is available.
55
These formalizations have been joint work:

‎docs/authors/chris-birkbeck.xml‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,3 @@
11
<?xml version="1.0" encoding="utf-8"?>
2-
<?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 (Posts by Chris Birkbeck)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/authors/chris-birkbeck.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:42:36 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>Modular forms</title><link>https://leanprover-community.github.io/blog/posts/modular-forms/</link><dc:creator>Chris Birkbeck</dc:creator><description>&lt;div&gt;&lt;p&gt;In &lt;a href="https://github.com/leanprover-community/mathlib/pull/13250"&gt;PR# 13250&lt;/a&gt; we define modular forms and cusp forms, and prove that they form complex vector spaces. These are analytic functions of number theoretic interest with strong links to geometry, representation theory and analysis. Most famously they are a key ingredient in the proof of Fermat's Last Theorem. In this post we discuss the formalization process, motivate some design choices and map out some future work.&lt;/p&gt;
2+
<?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 (Posts by Chris Birkbeck)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/authors/chris-birkbeck.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:44:34 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>Modular forms</title><link>https://leanprover-community.github.io/blog/posts/modular-forms/</link><dc:creator>Chris Birkbeck</dc:creator><description>&lt;div&gt;&lt;p&gt;In &lt;a href="https://github.com/leanprover-community/mathlib/pull/13250"&gt;PR# 13250&lt;/a&gt; we define modular forms and cusp forms, and prove that they form complex vector spaces. These are analytic functions of number theoretic interest with strong links to geometry, representation theory and analysis. Most famously they are a key ingredient in the proof of Fermat's Last Theorem. In this post we discuss the formalization process, motivate some design choices and map out some future work.&lt;/p&gt;
33
&lt;p&gt;&lt;a href="https://leanprover-community.github.io/blog/posts/modular-forms/"&gt;Read more…&lt;/a&gt; (7 min remaining to read)&lt;/p&gt;&lt;/div&gt;</description><guid>https://leanprover-community.github.io/blog/posts/modular-forms/</guid><pubDate>Wed, 21 Dec 2022 11:41:21 GMT</pubDate></item></channel></rss>

‎docs/authors/david-chanin.xml‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
11
<?xml version="1.0" encoding="utf-8"?>
2-
<?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 (Posts by David Chanin)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/authors/david-chanin.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:42:36 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>Introducing Mathlib Changelog</title><link>https://leanprover-community.github.io/blog/posts/mathlib-changelog/</link><dc:creator>David Chanin</dc:creator><description>&lt;div&gt;&lt;p&gt;&lt;img alt="mathlib-changelog sample page" src="https://leanprover-community.github.io/blog/images/changelog_lemma.png"&gt;&lt;/p&gt;
2+
<?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 (Posts by David Chanin)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/authors/david-chanin.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:44:34 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>Introducing Mathlib Changelog</title><link>https://leanprover-community.github.io/blog/posts/mathlib-changelog/</link><dc:creator>David Chanin</dc:creator><description>&lt;div&gt;&lt;p&gt;&lt;img alt="mathlib-changelog sample page" src="https://leanprover-community.github.io/blog/images/changelog_lemma.png"&gt;&lt;/p&gt;
33
&lt;p&gt;Tldr; check out &lt;a href="https://mathlib-changelog.org"&gt;mathlib-changelog.org&lt;/a&gt; to explore the historical changes to mathlib, and find out what happened to that lemma you were using.&lt;/p&gt;
44
&lt;p&gt;&lt;a href="https://leanprover-community.github.io/blog/posts/mathlib-changelog/"&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/mathlib-changelog/</guid><pubDate>Thu, 28 Jul 2022 07:35:23 GMT</pubDate></item></channel></rss>

‎docs/authors/frederic-dupuis.xml‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,3 @@
11
<?xml version="1.0" encoding="utf-8"?>
2-
<?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 (Posts by Frédéric Dupuis)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/authors/frederic-dupuis.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:42:36 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>Semilinear maps</title><link>https://leanprover-community.github.io/blog/posts/semilinear-maps/</link><dc:creator>Frédéric Dupuis</dc:creator><description>&lt;div&gt;&lt;p&gt;Since linear maps appear everywhere in mathematics, it comes as no surprise that they have been part of mathlib for quite some time. However, as we were working on adding the basics of functional analysis to mathlib, a drawback quickly became apparent: conjugate-linear maps could not directly be expressed as linear maps. This meant that some constructions could not be formulated in their most natural way: for example, the map that takes an operator to its adjoint on a complex Hilbert space is a conjugate linear map, and so is the Riesz representation that maps a vector to its dual. This was also preventing us from developing the orthogonal group, the unitary group, etc, properly.&lt;/p&gt;
2+
<?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 (Posts by Frédéric Dupuis)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/authors/frederic-dupuis.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:44:34 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>Semilinear maps</title><link>https://leanprover-community.github.io/blog/posts/semilinear-maps/</link><dc:creator>Frédéric Dupuis</dc:creator><description>&lt;div&gt;&lt;p&gt;Since linear maps appear everywhere in mathematics, it comes as no surprise that they have been part of mathlib for quite some time. However, as we were working on adding the basics of functional analysis to mathlib, a drawback quickly became apparent: conjugate-linear maps could not directly be expressed as linear maps. This meant that some constructions could not be formulated in their most natural way: for example, the map that takes an operator to its adjoint on a complex Hilbert space is a conjugate linear map, and so is the Riesz representation that maps a vector to its dual. This was also preventing us from developing the orthogonal group, the unitary group, etc, properly.&lt;/p&gt;
33
&lt;p&gt;&lt;a href="https://leanprover-community.github.io/blog/posts/semilinear-maps/"&gt;Read more…&lt;/a&gt; (4 min remaining to read)&lt;/p&gt;&lt;/div&gt;</description><guid>https://leanprover-community.github.io/blog/posts/semilinear-maps/</guid><pubDate>Sat, 11 Dec 2021 11:00:00 GMT</pubDate></item></channel></rss>

‎docs/authors/heather-macbeth.xml‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
<?xml version="1.0" encoding="utf-8"?>
2-
<?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 (Posts by Heather Macbeth)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/authors/heather-macbeth.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:42:36 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>Classification of one-dimensional isocrystals</title><link>https://leanprover-community.github.io/blog/posts/classification-of-one-dimensional-isocrystals/</link><dc:creator>Robert Y. Lewis, Heather Macbeth</dc:creator><description>&lt;div&gt;&lt;p&gt;Last year, there was a &lt;a href="https://leanprover-community.github.io/blog/posts/semilinear-maps"&gt;big mathlib refactor&lt;/a&gt; to replace linear maps throughout the library with &lt;em&gt;semilinear maps&lt;/em&gt;,
2+
<?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 (Posts by Heather Macbeth)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/authors/heather-macbeth.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:44:34 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>Classification of one-dimensional isocrystals</title><link>https://leanprover-community.github.io/blog/posts/classification-of-one-dimensional-isocrystals/</link><dc:creator>Robert Y. Lewis, Heather Macbeth</dc:creator><description>&lt;div&gt;&lt;p&gt;Last year, there was a &lt;a href="https://leanprover-community.github.io/blog/posts/semilinear-maps"&gt;big mathlib refactor&lt;/a&gt; to replace linear maps throughout the library with &lt;em&gt;semilinear maps&lt;/em&gt;,
33
a more abstract concept which, importantly, unifies linear and conjugate-linear maps.&lt;/p&gt;
44
&lt;p&gt;But this is not the full extent of the generalization! Our number theorist friends here in mathlib told us that we should
55
make sure we chose this full generality of &lt;em&gt;semilinear&lt;/em&gt; maps, maps $f:M \to N$ such that $f(ax)=\sigma(a)f(x)$ for some ring homomorphism $\sigma$ between the scalar rings of the modules $M$ and $N$. So we and our coauthor Frédéric Dupuis implemented this full generality, and then asked them for an example to illustrate their need for this more abstract definition. This blog post tells the story of our little adventure in number theory.&lt;/p&gt;

‎docs/authors/jana-goken.xml‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
11
<?xml version="1.0" encoding="utf-8"?>
2-
<?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 (Posts by Jana Göken)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/authors/jana-goken.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:42:36 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>My Experience at the Machine-Checked Mathematics workshop</title><link>https://leanprover-community.github.io/blog/posts/lorentz-center-meeting/</link><dc:creator>Jana Göken</dc:creator><description>&lt;div&gt;&lt;p&gt;Hello, everyone! My name is Jana Göken, a master's student in mathematics from Bremen. Today, I want to share with you my experiences at the &lt;a href="https://www.lorentzcenter.nl/machine-checked-mathematics.html"&gt;Machine-Checked Mathematics workshop&lt;/a&gt; that introduced me to the world of proof assistants, specifically Lean.
2+
<?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 (Posts by Jana Göken)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/authors/jana-goken.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:44:34 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>My Experience at the Machine-Checked Mathematics workshop</title><link>https://leanprover-community.github.io/blog/posts/lorentz-center-meeting/</link><dc:creator>Jana Göken</dc:creator><description>&lt;div&gt;&lt;p&gt;Hello, everyone! My name is Jana Göken, a master's student in mathematics from Bremen. Today, I want to share with you my experiences at the &lt;a href="https://www.lorentzcenter.nl/machine-checked-mathematics.html"&gt;Machine-Checked Mathematics workshop&lt;/a&gt; that introduced me to the world of proof assistants, specifically Lean.
33
The workshop took place in Leiden from July 10th to July 14th 2023, and it was an amazing and educational journey.&lt;/p&gt;
44
&lt;p&gt;&lt;a href="https://leanprover-community.github.io/blog/posts/lorentz-center-meeting/"&gt;Read more…&lt;/a&gt; (4 min remaining to read)&lt;/p&gt;&lt;/div&gt;</description><guid>https://leanprover-community.github.io/blog/posts/lorentz-center-meeting/</guid><pubDate>Sat, 26 Aug 2023 14:30:00 GMT</pubDate></item></channel></rss>

‎docs/authors/jeremy-avigad.xml‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
<?xml version="1.0" encoding="utf-8"?>
2-
<?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 (Posts by Jeremy Avigad)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/authors/jeremy-avigad.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:42:36 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>Hoskinson Center announced</title><link>https://leanprover-community.github.io/blog/posts/hoskinson-center-announced/</link><dc:creator>Jeremy Avigad</dc:creator><description>&lt;div&gt;&lt;p&gt;On September 22, 2021, Carnegie Mellon University announced that a $20 million gift
2+
<?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 (Posts by Jeremy Avigad)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/authors/jeremy-avigad.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:44:35 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>Hoskinson Center announced</title><link>https://leanprover-community.github.io/blog/posts/hoskinson-center-announced/</link><dc:creator>Jeremy Avigad</dc:creator><description>&lt;div&gt;&lt;p&gt;On September 22, 2021, Carnegie Mellon University announced that a $20 million gift
33
from blockchain entrepreneur Charles C. Hoskinson will be used to establish the Hoskinson
44
Center for Formal Mathematics, housed in the Department of Philosophy.
55
You can read the &lt;a href="https://www.cmu.edu/news/stories/archives/2021/september/hoskinson-center-for-formal-mathematics.html"&gt;university press release&lt;/a&gt; and

‎docs/authors/johan-commelin.xml‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
<?xml version="1.0" encoding="utf-8"?>
2-
<?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 (Posts by Johan Commelin)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/authors/johan-commelin.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:42:36 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>Backstage with Yakov Pechersky</title><link>https://leanprover-community.github.io/blog/posts/backstage-with-pechersky/</link><dc:creator>Johan Commelin</dc:creator><description>&lt;div&gt;&lt;p&gt;&lt;a href="https://leanprover-community.github.io/blog/images/yakov_pechersky.png" class="image-reference"&gt;&lt;img src="https://leanprover-community.github.io/blog/images/yakov_pechersky.thumbnail.png" class=" align-right"&gt;&lt;/a&gt;&lt;/p&gt;
2+
<?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 (Posts by Johan Commelin)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/authors/johan-commelin.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:44:34 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>Backstage with Yakov Pechersky</title><link>https://leanprover-community.github.io/blog/posts/backstage-with-pechersky/</link><dc:creator>Johan Commelin</dc:creator><description>&lt;div&gt;&lt;p&gt;&lt;a href="https://leanprover-community.github.io/blog/images/yakov_pechersky.png" class="image-reference"&gt;&lt;img src="https://leanprover-community.github.io/blog/images/yakov_pechersky.thumbnail.png" class=" align-right"&gt;&lt;/a&gt;&lt;/p&gt;
33
&lt;p&gt;The next installment in the series of
44
backstage interviews with mathlib's active contributors!&lt;/p&gt;
55
&lt;p&gt;Today, Johan Commelin interviews Yakov Pechersky.

‎docs/authors/kevin-buzzard.xml‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
11
<?xml version="1.0" encoding="utf-8"?>
2-
<?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 (Posts by Kevin Buzzard)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/authors/kevin-buzzard.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:42:37 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>The Fermat's Last Theorem Project</title><link>https://leanprover-community.github.io/blog/posts/FLT-announcement/</link><dc:creator>Kevin Buzzard</dc:creator><description>&lt;div&gt;&lt;p&gt;Kevin Buzzard discusses the project to prove Fermat's Last Theorem in Lean.&lt;/p&gt;
2+
<?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 (Posts by Kevin Buzzard)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/authors/kevin-buzzard.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:44:35 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>The Fermat's Last Theorem Project</title><link>https://leanprover-community.github.io/blog/posts/FLT-announcement/</link><dc:creator>Kevin Buzzard</dc:creator><description>&lt;div&gt;&lt;p&gt;Kevin Buzzard discusses the project to prove Fermat's Last Theorem in Lean.&lt;/p&gt;
33
&lt;p&gt;&lt;a href="https://leanprover-community.github.io/blog/posts/FLT-announcement/"&gt;Read more…&lt;/a&gt; (5 min remaining to read)&lt;/p&gt;&lt;/div&gt;</description><guid>https://leanprover-community.github.io/blog/posts/FLT-announcement/</guid><pubDate>Tue, 30 Apr 2024 18:00:00 GMT</pubDate></item><item><title>Formalising cohomology theories</title><link>https://leanprover-community.github.io/blog/posts/banff-cohomology/</link><dc:creator>Kevin Buzzard</dc:creator><description>&lt;div&gt;&lt;p&gt;Kevin Buzzard rounds up the BIRS conference on formalising cohomology theories.&lt;/p&gt;
44
&lt;p&gt;&lt;a href="https://leanprover-community.github.io/blog/posts/banff-cohomology/"&gt;Read more…&lt;/a&gt; (6 min remaining to read)&lt;/p&gt;&lt;/div&gt;</description><guid>https://leanprover-community.github.io/blog/posts/banff-cohomology/</guid><pubDate>Mon, 12 Jun 2023 07:42:45 GMT</pubDate></item></channel></rss>

‎docs/authors/kexing-ying.xml‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
<?xml version="1.0" encoding="utf-8"?>
2-
<?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 (Posts by Kexing Ying)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/authors/kexing-ying.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:42:37 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>The Radon-Nikodym theorem in Lean</title><link>https://leanprover-community.github.io/blog/posts/the-radon-nikodym-theorem-in-lean/</link><dc:creator>Kexing Ying</dc:creator><description>&lt;div&gt;&lt;p&gt;I have for the past two months been working on formalising the Radon-Nikodym theorem
2+
<?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 (Posts by Kexing Ying)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/authors/kexing-ying.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:44:34 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>The Radon-Nikodym theorem in Lean</title><link>https://leanprover-community.github.io/blog/posts/the-radon-nikodym-theorem-in-lean/</link><dc:creator>Kexing Ying</dc:creator><description>&lt;div&gt;&lt;p&gt;I have for the past two months been working on formalising the Radon-Nikodym theorem
33
in Lean, and with &lt;a href="https://github.com/leanprover-community/mathlib/pull/9065"&gt;PR #9065&lt;/a&gt;
44
merged into mathlib, this journey seems to have finally come to an end. &lt;/p&gt;
55
&lt;p&gt;&lt;a href="https://leanprover-community.github.io/blog/posts/the-radon-nikodym-theorem-in-lean/"&gt;Read more…&lt;/a&gt; (5 min remaining to read)&lt;/p&gt;&lt;/div&gt;</description><guid>https://leanprover-community.github.io/blog/posts/the-radon-nikodym-theorem-in-lean/</guid><pubDate>Wed, 22 Sep 2021 10:51:14 GMT</pubDate></item></channel></rss>

‎docs/authors/mathlib-community.xml‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
<?xml version="1.0" encoding="utf-8"?>
2-
<?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 (Posts by Mathlib community)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/authors/mathlib-community.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:42:37 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>This month in Mathlib (May 2024)</title><link>https://leanprover-community.github.io/blog/posts/month-in-mathlib/2024/month-in-mathlib-may-2024/</link><dc:creator>Mathlib community</dc:creator><description>&lt;div&gt;&lt;p&gt;The last Month in Mathlib posts date from before the port started, in November 2022. We apologise for the momentary disappearance. We aim to keep it a monthly occurrence from now on.&lt;/p&gt;
2+
<?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 (Posts by Mathlib community)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/authors/mathlib-community.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:44:34 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>This month in Mathlib (May 2024)</title><link>https://leanprover-community.github.io/blog/posts/month-in-mathlib/2024/month-in-mathlib-may-2024/</link><dc:creator>Mathlib community</dc:creator><description>&lt;div&gt;&lt;p&gt;The last Month in Mathlib posts date from before the port started, in November 2022. We apologise for the momentary disappearance. We aim to keep it a monthly occurrence from now on.&lt;/p&gt;
33
&lt;p&gt;There were 667 PRs merged in May 2024.&lt;/p&gt;
44
&lt;p&gt;&lt;a href="https://leanprover-community.github.io/blog/posts/month-in-mathlib/2024/month-in-mathlib-may-2024/"&gt;Read more…&lt;/a&gt; (11 min remaining to read)&lt;/p&gt;&lt;/div&gt;</description><guid>https://leanprover-community.github.io/blog/posts/month-in-mathlib/2024/month-in-mathlib-may-2024/</guid><pubDate>Mon, 01 Jul 2024 12:00:00 GMT</pubDate></item><item><title>This month in mathlib (Sep 2022)</title><link>https://leanprover-community.github.io/blog/posts/month-in-mathlib/2022/month-in-mathlib-sep-2022/</link><dc:creator>Mathlib community</dc:creator><description>&lt;div&gt;&lt;p&gt;In September 2022 there were 361 PRs merged into mathlib. We list some of the highlights below.&lt;/p&gt;
55
&lt;p&gt;&lt;a href="https://leanprover-community.github.io/blog/posts/month-in-mathlib/2022/month-in-mathlib-sep-2022/"&gt;Read more…&lt;/a&gt; (1 min remaining to read)&lt;/p&gt;&lt;/div&gt;</description><guid>https://leanprover-community.github.io/blog/posts/month-in-mathlib/2022/month-in-mathlib-sep-2022/</guid><pubDate>Sat, 08 Oct 2022 06:01:27 GMT</pubDate></item><item><title>This month in mathlib (Aug 2022)</title><link>https://leanprover-community.github.io/blog/posts/month-in-mathlib/2022/month-in-mathlib-aug-2022/</link><dc:creator>Mathlib community</dc:creator><description>&lt;div&gt;&lt;p&gt;In August 2022 there were 506 PRs merged into mathlib. We list some of the highlights below.&lt;/p&gt;

‎docs/authors/patrick-massot.xml‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
<?xml version="1.0" encoding="utf-8"?>
2-
<?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 (Posts by Patrick Massot)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/authors/patrick-massot.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:42:37 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>Alex Best’s type class generalization paper</title><link>https://leanprover-community.github.io/blog/posts/alex-bests-type-class-generalization-paper/</link><dc:creator>Patrick Massot</dc:creator><description>&lt;div&gt;&lt;p&gt;Alex J. Best wrote a
2+
<?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 (Posts by Patrick Massot)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/authors/patrick-massot.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:44:34 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>Alex Best’s type class generalization paper</title><link>https://leanprover-community.github.io/blog/posts/alex-bests-type-class-generalization-paper/</link><dc:creator>Patrick Massot</dc:creator><description>&lt;div&gt;&lt;p&gt;Alex J. Best wrote a
33
&lt;a href="https://easychair.org/publications/preprint/KLfT"&gt;paper about type class generalization&lt;/a&gt; for the
44
&lt;a href="https://cicm-conference.org/2021/"&gt;CICM 2021&lt;/a&gt; conference on intelligent computer
55
mathematics. &lt;/p&gt;

‎docs/authors/riccardo-brasca.xml‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
<?xml version="1.0" encoding="utf-8"?>
2-
<?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 (Posts by Riccardo Brasca)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/authors/riccardo-brasca.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:42:36 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>The ring of integers of a cyclotomic field</title><link>https://leanprover-community.github.io/blog/posts/the-ring-of-integers-of-a-cyclotomic-field/</link><dc:creator>Riccardo Brasca</dc:creator><description>&lt;div&gt;&lt;p&gt;In &lt;a href="https://github.com/leanprover-community/mathlib/pull/13585"&gt;PR #13585&lt;/a&gt; we compute the
2+
<?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 (Posts by Riccardo Brasca)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/authors/riccardo-brasca.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:44:34 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>The ring of integers of a cyclotomic field</title><link>https://leanprover-community.github.io/blog/posts/the-ring-of-integers-of-a-cyclotomic-field/</link><dc:creator>Riccardo Brasca</dc:creator><description>&lt;div&gt;&lt;p&gt;In &lt;a href="https://github.com/leanprover-community/mathlib/pull/13585"&gt;PR #13585&lt;/a&gt; we compute the
33
discriminant of cyclotomic fields. This is an important result, usually treated in a first year
44
graduate course in number theory. In this post we would like to explain why it is an important
55
result, and briefly explain how we proved it.&lt;/p&gt;

‎docs/authors/robert-y-lewis.xml‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
<?xml version="1.0" encoding="utf-8"?>
2-
<?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 (Posts by Robert Y. Lewis)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/authors/robert-y-lewis.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:42:36 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>Classification of one-dimensional isocrystals</title><link>https://leanprover-community.github.io/blog/posts/classification-of-one-dimensional-isocrystals/</link><dc:creator>Robert Y. Lewis, Heather Macbeth</dc:creator><description>&lt;div&gt;&lt;p&gt;Last year, there was a &lt;a href="https://leanprover-community.github.io/blog/posts/semilinear-maps"&gt;big mathlib refactor&lt;/a&gt; to replace linear maps throughout the library with &lt;em&gt;semilinear maps&lt;/em&gt;,
2+
<?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 (Posts by Robert Y. Lewis)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/authors/robert-y-lewis.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:44:34 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>Classification of one-dimensional isocrystals</title><link>https://leanprover-community.github.io/blog/posts/classification-of-one-dimensional-isocrystals/</link><dc:creator>Robert Y. Lewis, Heather Macbeth</dc:creator><description>&lt;div&gt;&lt;p&gt;Last year, there was a &lt;a href="https://leanprover-community.github.io/blog/posts/semilinear-maps"&gt;big mathlib refactor&lt;/a&gt; to replace linear maps throughout the library with &lt;em&gt;semilinear maps&lt;/em&gt;,
33
a more abstract concept which, importantly, unifies linear and conjugate-linear maps.&lt;/p&gt;
44
&lt;p&gt;But this is not the full extent of the generalization! Our number theorist friends here in mathlib told us that we should
55
make sure we chose this full generality of &lt;em&gt;semilinear&lt;/em&gt; maps, maps $f:M \to N$ such that $f(ax)=\sigma(a)f(x)$ for some ring homomorphism $\sigma$ between the scalar rings of the modules $M$ and $N$. So we and our coauthor Frédéric Dupuis implemented this full generality, and then asked them for an example to illustrate their need for this more abstract definition. This blog post tells the story of our little adventure in number theory.&lt;/p&gt;

‎docs/authors/scott-morrison.xml‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
<?xml version="1.0" encoding="utf-8"?>
2-
<?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 (Posts by Scott Morrison)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/authors/scott-morrison.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:42:37 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>The first official release of Lean 4</title><link>https://leanprover-community.github.io/blog/posts/first-lean-release/</link><dc:creator>Scott Morrison</dc:creator><description>&lt;div&gt;&lt;p&gt;Lean 4 has just made its first official stable release, with the arrival of &lt;a href="https://github.com/leanprover/lean4/releases/tag/v4.0.0"&gt;&lt;code&gt;v4.0.0&lt;/code&gt;&lt;/a&gt;.
2+
<?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 (Posts by Scott Morrison)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/authors/scott-morrison.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:44:34 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>The first official release of Lean 4</title><link>https://leanprover-community.github.io/blog/posts/first-lean-release/</link><dc:creator>Scott Morrison</dc:creator><description>&lt;div&gt;&lt;p&gt;Lean 4 has just made its first official stable release, with the arrival of &lt;a href="https://github.com/leanprover/lean4/releases/tag/v4.0.0"&gt;&lt;code&gt;v4.0.0&lt;/code&gt;&lt;/a&gt;.
33
We're excited to transition from only providing nightly releases to having regular stable releases.&lt;/p&gt;
44
&lt;p&gt;&lt;a href="https://leanprover-community.github.io/blog/posts/first-lean-release/"&gt;Read more…&lt;/a&gt; (1 min remaining to read)&lt;/p&gt;&lt;/div&gt;</description><guid>https://leanprover-community.github.io/blog/posts/first-lean-release/</guid><pubDate>Fri, 08 Sep 2023 05:58:40 GMT</pubDate></item><item><title>Update on mathport (Dec 2021)</title><link>https://leanprover-community.github.io/blog/posts/intro-to-mathport/</link><dc:creator>Scott Morrison</dc:creator><description>&lt;div&gt;&lt;p&gt;&lt;code&gt;mathport&lt;/code&gt; is the tool we're planning on using to help us port &lt;code&gt;mathlib&lt;/code&gt; to Lean 4.
55
It has mostly been written by Mario Carneiro and Daniel Selsam,

‎docs/authors/the-lean-prover-community.xml‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
<?xml version="1.0" encoding="utf-8"?>
2-
<?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 (Posts by The Lean prover community)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/authors/the-lean-prover-community.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:42:36 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>This month in mathlib (Oct and Nov 2022)</title><link>https://leanprover-community.github.io/blog/posts/month-in-mathlib/2022/month-in-mathlib-oct-and-nov-2022/</link><dc:creator>The Lean prover community</dc:creator><description>&lt;div&gt;&lt;p&gt;In October and November 2022 there were 512 and 453 PRs merged into mathlib. We list some of the highlights below.&lt;/p&gt;
2+
<?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 (Posts by The Lean prover community)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/authors/the-lean-prover-community.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:44:34 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>This month in mathlib (Oct and Nov 2022)</title><link>https://leanprover-community.github.io/blog/posts/month-in-mathlib/2022/month-in-mathlib-oct-and-nov-2022/</link><dc:creator>The Lean prover community</dc:creator><description>&lt;div&gt;&lt;p&gt;In October and November 2022 there were 512 and 453 PRs merged into mathlib. We list some of the highlights below.&lt;/p&gt;
33
&lt;ul&gt;
44
&lt;li&gt;
55
&lt;p&gt;Measure theory.&lt;/p&gt;

‎docs/authors/yury-kudryashov.xml‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
<?xml version="1.0" encoding="utf-8"?>
2-
<?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 (Posts by Yury Kudryashov)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/authors/yury-kudryashov.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:42:36 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>Adventure 10000</title><link>https://leanprover-community.github.io/blog/posts/adventure-10000/</link><dc:creator>Yury Kudryashov</dc:creator><description>&lt;div&gt;&lt;p&gt;About a month ago, the &lt;a href="https://en.wikipedia.org/wiki/Cauchy%27s_integral_theorem"&gt;Cauchy integral
2+
<?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 (Posts by Yury Kudryashov)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/authors/yury-kudryashov.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:44:34 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>Adventure 10000</title><link>https://leanprover-community.github.io/blog/posts/adventure-10000/</link><dc:creator>Yury Kudryashov</dc:creator><description>&lt;div&gt;&lt;p&gt;About a month ago, the &lt;a href="https://en.wikipedia.org/wiki/Cauchy%27s_integral_theorem"&gt;Cauchy integral
33
theorem&lt;/a&gt;
44
for some simple domains
55
&lt;a href="https://github.com/leanprover-community/mathlib/pull/10000"&gt;landed&lt;/a&gt;

‎docs/categories/backstage.xml‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
<?xml version="1.0" encoding="utf-8"?>
2-
<?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 (Posts about backstage)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/categories/backstage.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:42:37 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>Backstage with Yakov Pechersky</title><link>https://leanprover-community.github.io/blog/posts/backstage-with-pechersky/</link><dc:creator>Johan Commelin</dc:creator><description>&lt;div&gt;&lt;p&gt;&lt;a href="https://leanprover-community.github.io/blog/images/yakov_pechersky.png" class="image-reference"&gt;&lt;img src="https://leanprover-community.github.io/blog/images/yakov_pechersky.thumbnail.png" class=" align-right"&gt;&lt;/a&gt;&lt;/p&gt;
2+
<?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 (Posts about backstage)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/categories/backstage.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:44:34 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>Backstage with Yakov Pechersky</title><link>https://leanprover-community.github.io/blog/posts/backstage-with-pechersky/</link><dc:creator>Johan Commelin</dc:creator><description>&lt;div&gt;&lt;p&gt;&lt;a href="https://leanprover-community.github.io/blog/images/yakov_pechersky.png" class="image-reference"&gt;&lt;img src="https://leanprover-community.github.io/blog/images/yakov_pechersky.thumbnail.png" class=" align-right"&gt;&lt;/a&gt;&lt;/p&gt;
33
&lt;p&gt;The next installment in the series of
44
backstage interviews with mathlib's active contributors!&lt;/p&gt;
55
&lt;p&gt;Today, Johan Commelin interviews Yakov Pechersky.
Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
11
<?xml version="1.0" encoding="utf-8"?>
2-
<?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 (Posts about announcement)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/categories/cat_announcement.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:42:37 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>The first official release of Lean 4</title><link>https://leanprover-community.github.io/blog/posts/first-lean-release/</link><dc:creator>Scott Morrison</dc:creator><description>&lt;div&gt;&lt;p&gt;Lean 4 has just made its first official stable release, with the arrival of &lt;a href="https://github.com/leanprover/lean4/releases/tag/v4.0.0"&gt;&lt;code&gt;v4.0.0&lt;/code&gt;&lt;/a&gt;.
2+
<?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 (Posts about announcement)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/categories/cat_announcement.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:44:34 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>The first official release of Lean 4</title><link>https://leanprover-community.github.io/blog/posts/first-lean-release/</link><dc:creator>Scott Morrison</dc:creator><description>&lt;div&gt;&lt;p&gt;Lean 4 has just made its first official stable release, with the arrival of &lt;a href="https://github.com/leanprover/lean4/releases/tag/v4.0.0"&gt;&lt;code&gt;v4.0.0&lt;/code&gt;&lt;/a&gt;.
33
We're excited to transition from only providing nightly releases to having regular stable releases.&lt;/p&gt;
44
&lt;p&gt;&lt;a href="https://leanprover-community.github.io/blog/posts/first-lean-release/"&gt;Read more…&lt;/a&gt; (1 min remaining to read)&lt;/p&gt;&lt;/div&gt;</description><guid>https://leanprover-community.github.io/blog/posts/first-lean-release/</guid><pubDate>Fri, 08 Sep 2023 05:58:40 GMT</pubDate></item></channel></rss>

‎docs/categories/cat_announcements.xml‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
<?xml version="1.0" encoding="utf-8"?>
2-
<?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 (Posts about Announcements)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/categories/cat_announcements.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:42:36 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>Hoskinson Center announced</title><link>https://leanprover-community.github.io/blog/posts/hoskinson-center-announced/</link><dc:creator>Jeremy Avigad</dc:creator><description>&lt;div&gt;&lt;p&gt;On September 22, 2021, Carnegie Mellon University announced that a $20 million gift
2+
<?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 (Posts about Announcements)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/categories/cat_announcements.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:44:35 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>Hoskinson Center announced</title><link>https://leanprover-community.github.io/blog/posts/hoskinson-center-announced/</link><dc:creator>Jeremy Avigad</dc:creator><description>&lt;div&gt;&lt;p&gt;On September 22, 2021, Carnegie Mellon University announced that a $20 million gift
33
from blockchain entrepreneur Charles C. Hoskinson will be used to establish the Hoskinson
44
Center for Formal Mathematics, housed in the Department of Philosophy.
55
You can read the &lt;a href="https://www.cmu.edu/news/stories/archives/2021/september/hoskinson-center-for-formal-mathematics.html"&gt;university press release&lt;/a&gt; and

‎docs/categories/cat_community-projects.xml‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
<?xml version="1.0" encoding="utf-8"?>
2-
<?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 (Posts about Community projects)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/categories/cat_community-projects.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:42:36 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>Definitions in the liquid tensor experiment</title><link>https://leanprover-community.github.io/blog/posts/lte-examples/</link><dc:creator>Adam Topaz</dc:creator><description>&lt;div&gt;&lt;p&gt;A few weeks ago, we announced the &lt;a href="https://leanprover-community.github.io/blog/posts/lte-final/"&gt;completion of the liquid tensor experiment&lt;/a&gt; (&lt;strong&gt;LTE&lt;/strong&gt; for short).
2+
<?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 (Posts about Community projects)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/categories/cat_community-projects.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:44:34 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>Definitions in the liquid tensor experiment</title><link>https://leanprover-community.github.io/blog/posts/lte-examples/</link><dc:creator>Adam Topaz</dc:creator><description>&lt;div&gt;&lt;p&gt;A few weeks ago, we announced the &lt;a href="https://leanprover-community.github.io/blog/posts/lte-final/"&gt;completion of the liquid tensor experiment&lt;/a&gt; (&lt;strong&gt;LTE&lt;/strong&gt; for short).
33
What this means is that we stated and (completely) proved the following result in Lean:&lt;/p&gt;
44
&lt;pre class="code literal-block"&gt;&lt;span class="kd"&gt;variables&lt;/span&gt; &lt;span class="o"&gt;(&lt;/span&gt;&lt;span class="n"&gt;p'&lt;/span&gt; &lt;span class="n"&gt;p&lt;/span&gt; &lt;span class="o"&gt;:&lt;/span&gt; &lt;span class="n"&gt;ℝ&lt;/span&gt;&lt;span class="bp"&gt;≥&lt;/span&gt;&lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="o"&gt;)&lt;/span&gt; &lt;span class="o"&gt;[&lt;/span&gt;&lt;span class="n"&gt;fact&lt;/span&gt; &lt;span class="o"&gt;(&lt;/span&gt;&lt;span class="mi"&gt;0&lt;/span&gt; &lt;span class="bp"&gt;&amp;lt;&lt;/span&gt; &lt;span class="n"&gt;p'&lt;/span&gt;&lt;span class="o"&gt;)]&lt;/span&gt; &lt;span class="o"&gt;[&lt;/span&gt;&lt;span class="n"&gt;fact&lt;/span&gt; &lt;span class="o"&gt;(&lt;/span&gt;&lt;span class="n"&gt;p'&lt;/span&gt; &lt;span class="bp"&gt;&amp;lt;&lt;/span&gt; &lt;span class="n"&gt;p&lt;/span&gt;&lt;span class="o"&gt;)]&lt;/span&gt; &lt;span class="o"&gt;[&lt;/span&gt;&lt;span class="n"&gt;fact&lt;/span&gt; &lt;span class="o"&gt;(&lt;/span&gt;&lt;span class="n"&gt;p&lt;/span&gt; &lt;span class="bp"&gt;≤&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="o"&gt;)]&lt;/span&gt;
55

‎docs/categories/cat_interviews.xml‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
<?xml version="1.0" encoding="utf-8"?>
2-
<?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 (Posts about Interviews)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/categories/cat_interviews.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:42:36 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>Backstage with Yakov Pechersky</title><link>https://leanprover-community.github.io/blog/posts/backstage-with-pechersky/</link><dc:creator>Johan Commelin</dc:creator><description>&lt;div&gt;&lt;p&gt;&lt;a href="https://leanprover-community.github.io/blog/images/yakov_pechersky.png" class="image-reference"&gt;&lt;img src="https://leanprover-community.github.io/blog/images/yakov_pechersky.thumbnail.png" class=" align-right"&gt;&lt;/a&gt;&lt;/p&gt;
2+
<?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 (Posts about Interviews)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/categories/cat_interviews.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:44:34 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>Backstage with Yakov Pechersky</title><link>https://leanprover-community.github.io/blog/posts/backstage-with-pechersky/</link><dc:creator>Johan Commelin</dc:creator><description>&lt;div&gt;&lt;p&gt;&lt;a href="https://leanprover-community.github.io/blog/images/yakov_pechersky.png" class="image-reference"&gt;&lt;img src="https://leanprover-community.github.io/blog/images/yakov_pechersky.thumbnail.png" class=" align-right"&gt;&lt;/a&gt;&lt;/p&gt;
33
&lt;p&gt;The next installment in the series of
44
backstage interviews with mathlib's active contributors!&lt;/p&gt;
55
&lt;p&gt;Today, Johan Commelin interviews Yakov Pechersky.

‎docs/categories/cat_mathport.xml‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
<?xml version="1.0" encoding="utf-8"?>
2-
<?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 (Posts about mathport)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/categories/cat_mathport.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:42:36 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>Update on mathport (Dec 2021)</title><link>https://leanprover-community.github.io/blog/posts/intro-to-mathport/</link><dc:creator>Scott Morrison</dc:creator><description>&lt;div&gt;&lt;p&gt;&lt;code&gt;mathport&lt;/code&gt; is the tool we're planning on using to help us port &lt;code&gt;mathlib&lt;/code&gt; to Lean 4.
2+
<?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 (Posts about mathport)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/categories/cat_mathport.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:44:34 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>Update on mathport (Dec 2021)</title><link>https://leanprover-community.github.io/blog/posts/intro-to-mathport/</link><dc:creator>Scott Morrison</dc:creator><description>&lt;div&gt;&lt;p&gt;&lt;code&gt;mathport&lt;/code&gt; is the tool we're planning on using to help us port &lt;code&gt;mathlib&lt;/code&gt; to Lean 4.
33
It has mostly been written by Mario Carneiro and Daniel Selsam,
44
and Gabriel Ebner and I have been making some fixes.&lt;/p&gt;
55
&lt;p&gt;To provide some context, &lt;a href="https://github.com/leanprover-community/mathlib"&gt;mathlib&lt;/a&gt;
Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
<?xml version="1.0" encoding="utf-8"?>
2-
<?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 (Posts about meeting report)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/categories/cat_meeting-report.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:42:37 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>My Experience at the Machine-Checked Mathematics workshop</title><link>https://leanprover-community.github.io/blog/posts/lorentz-center-meeting/</link><dc:creator>Jana Göken</dc:creator><description>&lt;div&gt;&lt;p&gt;Hello, everyone! My name is Jana Göken, a master's student in mathematics from Bremen. Today, I want to share with you my experiences at the &lt;a href="https://www.lorentzcenter.nl/machine-checked-mathematics.html"&gt;Machine-Checked Mathematics workshop&lt;/a&gt; that introduced me to the world of proof assistants, specifically Lean.
2+
<?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 (Posts about meeting report)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/categories/cat_meeting-report.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:44:34 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>My Experience at the Machine-Checked Mathematics workshop</title><link>https://leanprover-community.github.io/blog/posts/lorentz-center-meeting/</link><dc:creator>Jana Göken</dc:creator><description>&lt;div&gt;&lt;p&gt;Hello, everyone! My name is Jana Göken, a master's student in mathematics from Bremen. Today, I want to share with you my experiences at the &lt;a href="https://www.lorentzcenter.nl/machine-checked-mathematics.html"&gt;Machine-Checked Mathematics workshop&lt;/a&gt; that introduced me to the world of proof assistants, specifically Lean.
33
The workshop took place in Leiden from July 10th to July 14th 2023, and it was an amazing and educational journey.&lt;/p&gt;
44
&lt;p&gt;&lt;a href="https://leanprover-community.github.io/blog/posts/lorentz-center-meeting/"&gt;Read more…&lt;/a&gt; (4 min remaining to read)&lt;/p&gt;&lt;/div&gt;</description><guid>https://leanprover-community.github.io/blog/posts/lorentz-center-meeting/</guid><pubDate>Sat, 26 Aug 2023 14:30:00 GMT</pubDate></item><item><title>Formalising cohomology theories</title><link>https://leanprover-community.github.io/blog/posts/banff-cohomology/</link><dc:creator>Kevin Buzzard</dc:creator><description>&lt;div&gt;&lt;p&gt;Kevin Buzzard rounds up the BIRS conference on formalising cohomology theories.&lt;/p&gt;
55
&lt;p&gt;&lt;a href="https://leanprover-community.github.io/blog/posts/banff-cohomology/"&gt;Read more…&lt;/a&gt; (6 min remaining to read)&lt;/p&gt;&lt;/div&gt;</description><guid>https://leanprover-community.github.io/blog/posts/banff-cohomology/</guid><pubDate>Mon, 12 Jun 2023 07:42:45 GMT</pubDate></item></channel></rss>

‎docs/categories/cat_month-in-mathlib.xml‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
<?xml version="1.0" encoding="utf-8"?>
2-
<?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 (Posts about month-in-mathlib)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/categories/cat_month-in-mathlib.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:42:37 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>This month in Mathlib (May 2024)</title><link>https://leanprover-community.github.io/blog/posts/month-in-mathlib/2024/month-in-mathlib-may-2024/</link><dc:creator>Mathlib community</dc:creator><description>&lt;div&gt;&lt;p&gt;The last Month in Mathlib posts date from before the port started, in November 2022. We apologise for the momentary disappearance. We aim to keep it a monthly occurrence from now on.&lt;/p&gt;
2+
<?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 (Posts about month-in-mathlib)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/categories/cat_month-in-mathlib.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:44:34 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>This month in Mathlib (May 2024)</title><link>https://leanprover-community.github.io/blog/posts/month-in-mathlib/2024/month-in-mathlib-may-2024/</link><dc:creator>Mathlib community</dc:creator><description>&lt;div&gt;&lt;p&gt;The last Month in Mathlib posts date from before the port started, in November 2022. We apologise for the momentary disappearance. We aim to keep it a monthly occurrence from now on.&lt;/p&gt;
33
&lt;p&gt;There were 667 PRs merged in May 2024.&lt;/p&gt;
44
&lt;p&gt;&lt;a href="https://leanprover-community.github.io/blog/posts/month-in-mathlib/2024/month-in-mathlib-may-2024/"&gt;Read more…&lt;/a&gt; (11 min remaining to read)&lt;/p&gt;&lt;/div&gt;</description><guid>https://leanprover-community.github.io/blog/posts/month-in-mathlib/2024/month-in-mathlib-may-2024/</guid><pubDate>Mon, 01 Jul 2024 12:00:00 GMT</pubDate></item><item><title>This month in mathlib (Oct and Nov 2022)</title><link>https://leanprover-community.github.io/blog/posts/month-in-mathlib/2022/month-in-mathlib-oct-and-nov-2022/</link><dc:creator>The Lean prover community</dc:creator><description>&lt;div&gt;&lt;p&gt;In October and November 2022 there were 512 and 453 PRs merged into mathlib. We list some of the highlights below.&lt;/p&gt;
55
&lt;ul&gt;

‎docs/categories/cat_new-in-mathlib.xml‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
<?xml version="1.0" encoding="utf-8"?>
2-
<?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 (Posts about New in mathlib)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/categories/cat_new-in-mathlib.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:42:37 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>Modular forms</title><link>https://leanprover-community.github.io/blog/posts/modular-forms/</link><dc:creator>Chris Birkbeck</dc:creator><description>&lt;div&gt;&lt;p&gt;In &lt;a href="https://github.com/leanprover-community/mathlib/pull/13250"&gt;PR# 13250&lt;/a&gt; we define modular forms and cusp forms, and prove that they form complex vector spaces. These are analytic functions of number theoretic interest with strong links to geometry, representation theory and analysis. Most famously they are a key ingredient in the proof of Fermat's Last Theorem. In this post we discuss the formalization process, motivate some design choices and map out some future work.&lt;/p&gt;
2+
<?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 (Posts about New in mathlib)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/categories/cat_new-in-mathlib.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:44:34 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>Modular forms</title><link>https://leanprover-community.github.io/blog/posts/modular-forms/</link><dc:creator>Chris Birkbeck</dc:creator><description>&lt;div&gt;&lt;p&gt;In &lt;a href="https://github.com/leanprover-community/mathlib/pull/13250"&gt;PR# 13250&lt;/a&gt; we define modular forms and cusp forms, and prove that they form complex vector spaces. These are analytic functions of number theoretic interest with strong links to geometry, representation theory and analysis. Most famously they are a key ingredient in the proof of Fermat's Last Theorem. In this post we discuss the formalization process, motivate some design choices and map out some future work.&lt;/p&gt;
33
&lt;p&gt;&lt;a href="https://leanprover-community.github.io/blog/posts/modular-forms/"&gt;Read more…&lt;/a&gt; (7 min remaining to read)&lt;/p&gt;&lt;/div&gt;</description><guid>https://leanprover-community.github.io/blog/posts/modular-forms/</guid><pubDate>Wed, 21 Dec 2022 11:41:21 GMT</pubDate></item><item><title>Classification of one-dimensional isocrystals</title><link>https://leanprover-community.github.io/blog/posts/classification-of-one-dimensional-isocrystals/</link><dc:creator>Robert Y. Lewis, Heather Macbeth</dc:creator><description>&lt;div&gt;&lt;p&gt;Last year, there was a &lt;a href="https://leanprover-community.github.io/blog/posts/semilinear-maps"&gt;big mathlib refactor&lt;/a&gt; to replace linear maps throughout the library with &lt;em&gt;semilinear maps&lt;/em&gt;,
44
a more abstract concept which, importantly, unifies linear and conjugate-linear maps.&lt;/p&gt;
55
&lt;p&gt;But this is not the full extent of the generalization! Our number theorist friends here in mathlib told us that we should

‎docs/categories/cat_overview.xml‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
<?xml version="1.0" encoding="utf-8"?>
2-
<?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 (Posts about overview)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/categories/cat_overview.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:42:36 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>2021 - The Bottom Line</title><link>https://leanprover-community.github.io/blog/posts/2021-the-bottom-line/</link><dc:creator>Mathlib community</dc:creator><description>&lt;div&gt;&lt;p&gt;Since the mathlib repository was created in summer 2017,
2+
<?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 (Posts about overview)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/categories/cat_overview.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:44:34 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>2021 - The Bottom Line</title><link>https://leanprover-community.github.io/blog/posts/2021-the-bottom-line/</link><dc:creator>Mathlib community</dc:creator><description>&lt;div&gt;&lt;p&gt;Since the mathlib repository was created in summer 2017,
33
each year has been bigger than the last.
44
As an end-of-year retrospective, we look at how the mathlib library and community have developed in 2021.&lt;/p&gt;
55
&lt;p&gt;&lt;a href="https://leanprover-community.github.io/blog/posts/2021-the-bottom-line/"&gt;Read more…&lt;/a&gt; (5 min remaining to read)&lt;/p&gt;&lt;/div&gt;</description><guid>https://leanprover-community.github.io/blog/posts/2021-the-bottom-line/</guid><pubDate>Sat, 08 Jan 2022 19:35:59 GMT</pubDate></item></channel></rss>

‎docs/categories/cat_papers.xml‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
<?xml version="1.0" encoding="utf-8"?>
2-
<?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 (Posts about Papers)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/categories/cat_papers.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:42:36 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>Alex Best’s type class generalization paper</title><link>https://leanprover-community.github.io/blog/posts/alex-bests-type-class-generalization-paper/</link><dc:creator>Patrick Massot</dc:creator><description>&lt;div&gt;&lt;p&gt;Alex J. Best wrote a
2+
<?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 (Posts about Papers)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/categories/cat_papers.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:44:34 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>Alex Best’s type class generalization paper</title><link>https://leanprover-community.github.io/blog/posts/alex-bests-type-class-generalization-paper/</link><dc:creator>Patrick Massot</dc:creator><description>&lt;div&gt;&lt;p&gt;Alex J. Best wrote a
33
&lt;a href="https://easychair.org/publications/preprint/KLfT"&gt;paper about type class generalization&lt;/a&gt; for the
44
&lt;a href="https://cicm-conference.org/2021/"&gt;CICM 2021&lt;/a&gt; conference on intelligent computer
55
mathematics. &lt;/p&gt;
Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,3 @@
11
<?xml version="1.0" encoding="utf-8"?>
2-
<?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 (Posts about project announcement)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/categories/cat_project-announcement.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:42:37 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>The Fermat's Last Theorem Project</title><link>https://leanprover-community.github.io/blog/posts/FLT-announcement/</link><dc:creator>Kevin Buzzard</dc:creator><description>&lt;div&gt;&lt;p&gt;Kevin Buzzard discusses the project to prove Fermat's Last Theorem in Lean.&lt;/p&gt;
2+
<?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 (Posts about project announcement)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/categories/cat_project-announcement.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:44:34 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>The Fermat's Last Theorem Project</title><link>https://leanprover-community.github.io/blog/posts/FLT-announcement/</link><dc:creator>Kevin Buzzard</dc:creator><description>&lt;div&gt;&lt;p&gt;Kevin Buzzard discusses the project to prove Fermat's Last Theorem in Lean.&lt;/p&gt;
33
&lt;p&gt;&lt;a href="https://leanprover-community.github.io/blog/posts/FLT-announcement/"&gt;Read more…&lt;/a&gt; (5 min remaining to read)&lt;/p&gt;&lt;/div&gt;</description><guid>https://leanprover-community.github.io/blog/posts/FLT-announcement/</guid><pubDate>Tue, 30 Apr 2024 18:00:00 GMT</pubDate></item></channel></rss>

‎docs/posts/month-in-mathlib/2024/month-in-mathlib-may-2024/index.html‎

Lines changed: 5 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -121,10 +121,12 @@
121121
<a href="https://github.com/leanprover-community/mathlib4/pull/12701">PR #12701</a> redefines sets without arithmetic progressions of length 3 (aka 3AP-free sets) so that they behave correctly in characteristic two. <a href="https://github.com/leanprover-community/mathlib4/pull/12546">PR #12546</a> refactors Freiman homomorphisms and isomorphisms from a bundled design to unbundled predicates. This makes them much easier to use. <a href="https://github.com/leanprover-community/mathlib4/pull/12551">PR #12551</a> then proves the no wrap-around principle stating that additive structure in sets is independent of the ambient group so long as torsion is much bigger than the diameter of the sets.</li>
122122
<li>Building up on thoses two series of PRs, <a href="https://github.com/leanprover-community/mathlib4/pull/13074">PR #13074</a> defines corners and corner-free set and <a href="https://github.com/leanprover-community/mathlib4/pull/9000">PR #9000</a> finally proves the Corners theorem and Roth's theorem. They respectively state that a corner-free set in <code>[N] × [N]</code> and a 3AP-free set in <code>[N]</code> have vanishingly small density as <code>N</code> goes to infinity.</li>
123123
</ul>
124-
<p><a href="https://github.com/YaelDillies/LeanAPAP">APAP</a> already contains the stronger result that the density goes to zero as <code>1/log log N</code>, and will soon prove the state of the art bound of <code>exp(-(log N)^1/9)</code>.
125-
* <a href="https://github.com/leanprover-community/mathlib4/pull/10555">PR #10555</a> defines dissociation of sets, a sort of "local" version of linear independence obtained by restricting the scalars to <code>{-1, 0, 1}</code>. This will soon be used to prove important results in additive combinatorics.
126-
* Mathlib finally knows about Hamiltonian paths and cycles thanks to a team effort started at Lean for the Curious Mathematician 2023 in Düsseldorf by Rishi Mehta and Linus Sommer under the supervision of Bhavik Mehta, and recently continued by Lode Vermeulen in <a href="https://github.com/leanprover-community/mathlib4/pull/7102">PR #7102</a>.</p>
124+
<p><a href="https://github.com/YaelDillies/LeanAPAP">APAP</a> already contains the stronger result that the density goes to zero as <code>1/log log N</code>, and will soon prove the state of the art bound of <code>exp(-(log N)^1/9)</code>.</p>
127125
</li>
126+
<li>
127+
<p><a href="https://github.com/leanprover-community/mathlib4/pull/10555">PR #10555</a> defines dissociation of sets, a sort of "local" version of linear independence obtained by restricting the scalars to <code>{-1, 0, 1}</code>. This will soon be used to prove important results in additive combinatorics.</p>
128+
</li>
129+
<li>Mathlib finally knows about Hamiltonian paths and cycles thanks to a team effort started at Lean for the Curious Mathematician 2023 in Düsseldorf by Rishi Mehta and Linus Sommer under the supervision of Bhavik Mehta, and recently continued by Lode Vermeulen in <a href="https://github.com/leanprover-community/mathlib4/pull/7102">PR #7102</a>.</li>
128130
</ul>
129131
</li>
130132
<li>

‎docs/posts/month-in-mathlib/2024/month-in-mathlib-may-2024/index.md‎

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -46,11 +46,13 @@ There were 667 PRs merged in May 2024.
4646

4747
* Combinatorics.
4848
* Thanks to the reviews by Thomas Bloom, a long sequence of three years old material by Yaël Dillies and Bhavik Mehta culminating in Roth's theorem on arithmetic progressions was finally merged:
49+
4950
* [PR #12526](https://github.com/leanprover-community/mathlib4/pull/12526) defines locally linear graphs, [PR #12570](https://github.com/leanprover-community/mathlib4/pull/12570) constructs such graphs from a set of specified triangles respecting some conditions, [PR #12523](https://github.com/leanprover-community/mathlib4/pull/12523) uses that construction to deduce the Triangle removal lemma from the Regularity lemma.
5051
* [PR #12701](https://github.com/leanprover-community/mathlib4/pull/12701) redefines sets without arithmetic progressions of length 3 (aka 3AP-free sets) so that they behave correctly in characteristic two. [PR #12546](https://github.com/leanprover-community/mathlib4/pull/12546) refactors Freiman homomorphisms and isomorphisms from a bundled design to unbundled predicates. This makes them much easier to use. [PR #12551](https://github.com/leanprover-community/mathlib4/pull/12551) then proves the no wrap-around principle stating that additive structure in sets is independent of the ambient group so long as torsion is much bigger than the diameter of the sets.
5152
* Building up on thoses two series of PRs, [PR #13074](https://github.com/leanprover-community/mathlib4/pull/13074) defines corners and corner-free set and [PR #9000](https://github.com/leanprover-community/mathlib4/pull/9000) finally proves the Corners theorem and Roth's theorem. They respectively state that a corner-free set in `[N] × [N]` and a 3AP-free set in `[N]` have vanishingly small density as `N` goes to infinity.
5253

5354
[APAP](https://github.com/YaelDillies/LeanAPAP) already contains the stronger result that the density goes to zero as `1/log log N`, and will soon prove the state of the art bound of `exp(-(log N)^1/9)`.
55+
5456
* [PR #10555](https://github.com/leanprover-community/mathlib4/pull/10555) defines dissociation of sets, a sort of "local" version of linear independence obtained by restricting the scalars to `{-1, 0, 1}`. This will soon be used to prove important results in additive combinatorics.
5557
* Mathlib finally knows about Hamiltonian paths and cycles thanks to a team effort started at Lean for the Curious Mathematician 2023 in Düsseldorf by Rishi Mehta and Linus Sommer under the supervision of Bhavik Mehta, and recently continued by Lode Vermeulen in [PR #7102](https://github.com/leanprover-community/mathlib4/pull/7102).
5658

‎docs/rss.xml‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
<?xml version="1.0" encoding="utf-8"?>
2-
<?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 © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:42:36 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>This month in Mathlib (May 2024)</title><link>https://leanprover-community.github.io/blog/posts/month-in-mathlib/2024/month-in-mathlib-may-2024/</link><dc:creator>Mathlib community</dc:creator><description>&lt;div&gt;&lt;p&gt;The last Month in Mathlib posts date from before the port started, in November 2022. We apologise for the momentary disappearance. We aim to keep it a monthly occurrence from now on.&lt;/p&gt;
2+
<?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 © 2024 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Tue, 02 Jul 2024 16:44:34 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>This month in Mathlib (May 2024)</title><link>https://leanprover-community.github.io/blog/posts/month-in-mathlib/2024/month-in-mathlib-may-2024/</link><dc:creator>Mathlib community</dc:creator><description>&lt;div&gt;&lt;p&gt;The last Month in Mathlib posts date from before the port started, in November 2022. We apologise for the momentary disappearance. We aim to keep it a monthly occurrence from now on.&lt;/p&gt;
33
&lt;p&gt;There were 667 PRs merged in May 2024.&lt;/p&gt;
44
&lt;p&gt;&lt;a href="https://leanprover-community.github.io/blog/posts/month-in-mathlib/2024/month-in-mathlib-may-2024/"&gt;Read more…&lt;/a&gt; (11 min remaining to read)&lt;/p&gt;&lt;/div&gt;</description><guid>https://leanprover-community.github.io/blog/posts/month-in-mathlib/2024/month-in-mathlib-may-2024/</guid><pubDate>Mon, 01 Jul 2024 12:00:00 GMT</pubDate></item><item><title>The Fermat's Last Theorem Project</title><link>https://leanprover-community.github.io/blog/posts/FLT-announcement/</link><dc:creator>Kevin Buzzard</dc:creator><description>&lt;div&gt;&lt;p&gt;Kevin Buzzard discusses the project to prove Fermat's Last Theorem in Lean.&lt;/p&gt;
55
&lt;p&gt;&lt;a href="https://leanprover-community.github.io/blog/posts/FLT-announcement/"&gt;Read more…&lt;/a&gt; (5 min remaining to read)&lt;/p&gt;&lt;/div&gt;</description><guid>https://leanprover-community.github.io/blog/posts/FLT-announcement/</guid><pubDate>Tue, 30 Apr 2024 18:00:00 GMT</pubDate></item><item><title>The first official release of Lean 4</title><link>https://leanprover-community.github.io/blog/posts/first-lean-release/</link><dc:creator>Scott Morrison</dc:creator><description>&lt;div&gt;&lt;p&gt;Lean 4 has just made its first official stable release, with the arrival of &lt;a href="https://github.com/leanprover/lean4/releases/tag/v4.0.0"&gt;&lt;code&gt;v4.0.0&lt;/code&gt;&lt;/a&gt;.

‎docs/sitemap.xml‎

Lines changed: 86 additions & 86 deletions
Large diffs are not rendered by default.

‎docs/sitemapindex.xml‎

Lines changed: 32 additions & 32 deletions
Original file line numberDiff line numberDiff line change
@@ -7,130 +7,130 @@
77
http://www.sitemaps.org/schemas/sitemap/0.9/sitemap.xsd">
88
<sitemap>
99
<loc>https://leanprover-community.github.io/blog/authors/adam-topaz.xml</loc>
10-
<lastmod>2024-07-02T16:42:00Z</lastmod>
10+
<lastmod>2024-07-02T16:44:00Z</lastmod>
1111
</sitemap>
1212
<sitemap>
1313
<loc>https://leanprover-community.github.io/blog/authors/anne-baanen.xml</loc>
14-
<lastmod>2024-07-02T16:42:00Z</lastmod>
14+
<lastmod>2024-07-02T16:44:00Z</lastmod>
1515
</sitemap>
1616
<sitemap>
1717
<loc>https://leanprover-community.github.io/blog/authors/chris-birkbeck.xml</loc>
18-
<lastmod>2024-07-02T16:42:00Z</lastmod>
18+
<lastmod>2024-07-02T16:44:00Z</lastmod>
1919
</sitemap>
2020
<sitemap>
2121
<loc>https://leanprover-community.github.io/blog/authors/david-chanin.xml</loc>
22-
<lastmod>2024-07-02T16:42:00Z</lastmod>
22+
<lastmod>2024-07-02T16:44:00Z</lastmod>
2323
</sitemap>
2424
<sitemap>
2525
<loc>https://leanprover-community.github.io/blog/authors/frederic-dupuis.xml</loc>
26-
<lastmod>2024-07-02T16:42:00Z</lastmod>
26+
<lastmod>2024-07-02T16:44:00Z</lastmod>
2727
</sitemap>
2828
<sitemap>
2929
<loc>https://leanprover-community.github.io/blog/authors/heather-macbeth.xml</loc>
30-
<lastmod>2024-07-02T16:42:00Z</lastmod>
30+
<lastmod>2024-07-02T16:44:00Z</lastmod>
3131
</sitemap>
3232
<sitemap>
3333
<loc>https://leanprover-community.github.io/blog/authors/jana-goken.xml</loc>
34-
<lastmod>2024-07-02T16:42:00Z</lastmod>
34+
<lastmod>2024-07-02T16:44:00Z</lastmod>
3535
</sitemap>
3636
<sitemap>
3737
<loc>https://leanprover-community.github.io/blog/authors/jeremy-avigad.xml</loc>
38-
<lastmod>2024-07-02T16:42:00Z</lastmod>
38+
<lastmod>2024-07-02T16:44:00Z</lastmod>
3939
</sitemap>
4040
<sitemap>
4141
<loc>https://leanprover-community.github.io/blog/authors/johan-commelin.xml</loc>
42-
<lastmod>2024-07-02T16:42:00Z</lastmod>
42+
<lastmod>2024-07-02T16:44:00Z</lastmod>
4343
</sitemap>
4444
<sitemap>
4545
<loc>https://leanprover-community.github.io/blog/authors/kevin-buzzard.xml</loc>
46-
<lastmod>2024-07-02T16:42:00Z</lastmod>
46+
<lastmod>2024-07-02T16:44:00Z</lastmod>
4747
</sitemap>
4848
<sitemap>
4949
<loc>https://leanprover-community.github.io/blog/authors/kexing-ying.xml</loc>
50-
<lastmod>2024-07-02T16:42:00Z</lastmod>
50+
<lastmod>2024-07-02T16:44:00Z</lastmod>
5151
</sitemap>
5252
<sitemap>
5353
<loc>https://leanprover-community.github.io/blog/authors/mathlib-community.xml</loc>
54-
<lastmod>2024-07-02T16:42:00Z</lastmod>
54+
<lastmod>2024-07-02T16:44:00Z</lastmod>
5555
</sitemap>
5656
<sitemap>
5757
<loc>https://leanprover-community.github.io/blog/authors/patrick-massot.xml</loc>
58-
<lastmod>2024-07-02T16:42:00Z</lastmod>
58+
<lastmod>2024-07-02T16:44:00Z</lastmod>
5959
</sitemap>
6060
<sitemap>
6161
<loc>https://leanprover-community.github.io/blog/authors/riccardo-brasca.xml</loc>
62-
<lastmod>2024-07-02T16:42:00Z</lastmod>
62+
<lastmod>2024-07-02T16:44:00Z</lastmod>
6363
</sitemap>
6464
<sitemap>
6565
<loc>https://leanprover-community.github.io/blog/authors/robert-y-lewis.xml</loc>
66-
<lastmod>2024-07-02T16:42:00Z</lastmod>
66+
<lastmod>2024-07-02T16:44:00Z</lastmod>
6767
</sitemap>
6868
<sitemap>
6969
<loc>https://leanprover-community.github.io/blog/authors/scott-morrison.xml</loc>
70-
<lastmod>2024-07-02T16:42:00Z</lastmod>
70+
<lastmod>2024-07-02T16:44:00Z</lastmod>
7171
</sitemap>
7272
<sitemap>
7373
<loc>https://leanprover-community.github.io/blog/authors/the-lean-prover-community.xml</loc>
74-
<lastmod>2024-07-02T16:42:00Z</lastmod>
74+
<lastmod>2024-07-02T16:44:00Z</lastmod>
7575
</sitemap>
7676
<sitemap>
7777
<loc>https://leanprover-community.github.io/blog/authors/yury-kudryashov.xml</loc>
78-
<lastmod>2024-07-02T16:42:00Z</lastmod>
78+
<lastmod>2024-07-02T16:44:00Z</lastmod>
7979
</sitemap>
8080
<sitemap>
8181
<loc>https://leanprover-community.github.io/blog/categories/backstage.xml</loc>
82-
<lastmod>2024-07-02T16:42:00Z</lastmod>
82+
<lastmod>2024-07-02T16:44:00Z</lastmod>
8383
</sitemap>
8484
<sitemap>
8585
<loc>https://leanprover-community.github.io/blog/categories/cat_announcement.xml</loc>
86-
<lastmod>2024-07-02T16:42:00Z</lastmod>
86+
<lastmod>2024-07-02T16:44:00Z</lastmod>
8787
</sitemap>
8888
<sitemap>
8989
<loc>https://leanprover-community.github.io/blog/categories/cat_announcements.xml</loc>
90-
<lastmod>2024-07-02T16:42:00Z</lastmod>
90+
<lastmod>2024-07-02T16:44:00Z</lastmod>
9191
</sitemap>
9292
<sitemap>
9393
<loc>https://leanprover-community.github.io/blog/categories/cat_community-projects.xml</loc>
94-
<lastmod>2024-07-02T16:42:00Z</lastmod>
94+
<lastmod>2024-07-02T16:44:00Z</lastmod>
9595
</sitemap>
9696
<sitemap>
9797
<loc>https://leanprover-community.github.io/blog/categories/cat_interviews.xml</loc>
98-
<lastmod>2024-07-02T16:42:00Z</lastmod>
98+
<lastmod>2024-07-02T16:44:00Z</lastmod>
9999
</sitemap>
100100
<sitemap>
101101
<loc>https://leanprover-community.github.io/blog/categories/cat_mathport.xml</loc>
102-
<lastmod>2024-07-02T16:42:00Z</lastmod>
102+
<lastmod>2024-07-02T16:44:00Z</lastmod>
103103
</sitemap>
104104
<sitemap>
105105
<loc>https://leanprover-community.github.io/blog/categories/cat_meeting-report.xml</loc>
106-
<lastmod>2024-07-02T16:42:00Z</lastmod>
106+
<lastmod>2024-07-02T16:44:00Z</lastmod>
107107
</sitemap>
108108
<sitemap>
109109
<loc>https://leanprover-community.github.io/blog/categories/cat_month-in-mathlib.xml</loc>
110-
<lastmod>2024-07-02T16:42:00Z</lastmod>
110+
<lastmod>2024-07-02T16:44:00Z</lastmod>
111111
</sitemap>
112112
<sitemap>
113113
<loc>https://leanprover-community.github.io/blog/categories/cat_new-in-mathlib.xml</loc>
114-
<lastmod>2024-07-02T16:42:00Z</lastmod>
114+
<lastmod>2024-07-02T16:44:00Z</lastmod>
115115
</sitemap>
116116
<sitemap>
117117
<loc>https://leanprover-community.github.io/blog/categories/cat_overview.xml</loc>
118-
<lastmod>2024-07-02T16:42:00Z</lastmod>
118+
<lastmod>2024-07-02T16:44:00Z</lastmod>
119119
</sitemap>
120120
<sitemap>
121121
<loc>https://leanprover-community.github.io/blog/categories/cat_papers.xml</loc>
122-
<lastmod>2024-07-02T16:42:00Z</lastmod>
122+
<lastmod>2024-07-02T16:44:00Z</lastmod>
123123
</sitemap>
124124
<sitemap>
125125
<loc>https://leanprover-community.github.io/blog/categories/cat_project-announcement.xml</loc>
126-
<lastmod>2024-07-02T16:42:00Z</lastmod>
126+
<lastmod>2024-07-02T16:44:00Z</lastmod>
127127
</sitemap>
128128
<sitemap>
129129
<loc>https://leanprover-community.github.io/blog/rss.xml</loc>
130-
<lastmod>2024-07-02T16:42:00Z</lastmod>
130+
<lastmod>2024-07-02T16:44:00Z</lastmod>
131131
</sitemap>
132132
<sitemap>
133133
<loc>https://leanprover-community.github.io/blog/sitemap.xml</loc>
134-
<lastmod>2024-07-02T16:42:00Z</lastmod>
134+
<lastmod>2024-07-02T16:44:00Z</lastmod>
135135
</sitemap>
136136
</sitemapindex>

0 commit comments

Comments
 (0)
Please sign in to comment.