<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    <title>Lean on Randy Lai</title>
    <link>https://randylai.info/tags/lean/</link>
    <description>Recent content in Lean on Randy Lai</description>
    <generator>Hugo</generator>
    <language>en-us</language>
    <lastBuildDate>Wed, 21 Oct 2026 00:00:00 +0000</lastBuildDate>
    <atom:link href="https://randylai.info/tags/lean/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>MSE of sample standard deviation (Lean by AI)</title>
      <link>https://randylai.info/post/2026/mse_of_sample_sd_lean/</link>
      <pubDate>Wed, 21 Oct 2026 00:00:00 +0000</pubDate>
      <guid>https://randylai.info/post/2026/mse_of_sample_sd_lean/</guid>
      <description>&lt;p&gt;Back in 2023, I wrote a &lt;a href=&#34;https://randylai.info/post/2023/mse_of_sample_sd_cont/&#34;&gt;post&lt;/a&gt; using SymPy to compute the second order expansion of the mean squared error (MSE) of the sample standard deviation up to $O(n^{-2})$. Earlier this year, I revisited the problem in &lt;a href=&#34;https://randylai.info/post/2026/mse_of_sample_sd_gen_ai/&#34;&gt;MSE of sample standard deviation (Gen AI)&lt;/a&gt; and showed that a modern LLM can derive the entire second order expansion directly from a prompt.&lt;/p&gt;
&lt;p&gt;When an AI produces a long asymptotic derivation with dozens of polynomial moment terms, how can we trust that every coefficient is right and that no terms of order $n^{-2}$ were dropped? To check the derivation rigorously, I formalized and verified the entire proof in &lt;a href=&#34;https://lean-lang.org/&#34;&gt;Lean 4&lt;/a&gt; with &lt;a href=&#34;https://github.com/leanprover-community/mathlib4&#34;&gt;Mathlib&lt;/a&gt;.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
