All checks were successful
CI / lint (push) Successful in 44s
CI / notebooks-smoke (push) Successful in 2m5s
Deploy / changes (push) Successful in 17s
Deploy / notebooks (push) Has been skipped
Deploy / zotero (push) Has been skipped
Deploy / docs (push) Has been skipped
Deploy / api (push) Has been skipped
Deploy / bcda (push) Has been skipped
Deploy / llm (push) Has been skipped
Deploy / mc (push) Has been skipped
Deploy / report (push) Successful in 14s
CI / test (push) Successful in 4m50s
Apache-2.0 textbook, HTML, and MIL exercises from leanprover-community/mathematics_in_lean (Lean 4.34.0). Editor and CI scaffolding stays upstream. Mathlib stays a lake dependency, not a copy.
403 lines
36 KiB
HTML
403 lines
36 KiB
HTML
|
|
|
|
<!DOCTYPE html>
|
|
<html class="writer-html5" lang="en" data-content_root="./">
|
|
<head>
|
|
<meta charset="utf-8" /><meta name="viewport" content="width=device-width, initial-scale=1" />
|
|
|
|
<meta name="viewport" content="width=device-width, initial-scale=1.0" />
|
|
<title>1. Introduction — Mathematics in Lean v4.34.0 documentation</title>
|
|
<link rel="stylesheet" type="text/css" href="_static/pygments.css?v=b86133f3" />
|
|
<link rel="stylesheet" type="text/css" href="_static/css/theme.css?v=e59714d7" />
|
|
<link rel="stylesheet" type="text/css" href="_static/css/custom.css?v=0731ccc3" />
|
|
|
|
|
|
<link rel="shortcut icon" href="_static/favicon.ico"/>
|
|
<script src="_static/jquery.js?v=5d32c60e"></script>
|
|
<script src="_static/_sphinx_javascript_frameworks_compat.js?v=2cd50e6c"></script>
|
|
<script src="_static/documentation_options.js?v=007da34f"></script>
|
|
<script src="_static/doctools.js?v=9bcbadda"></script>
|
|
<script src="_static/sphinx_highlight.js?v=dc90522c"></script>
|
|
<script src="_static/js/theme.js"></script>
|
|
<link rel="index" title="Index" href="genindex.html" />
|
|
<link rel="search" title="Search" href="search.html" />
|
|
<link rel="next" title="2. Basics" href="C02_Basics.html" />
|
|
<link rel="prev" title="Mathematics in Lean" href="index.html" />
|
|
</head>
|
|
|
|
<body class="wy-body-for-nav">
|
|
<div class="wy-grid-for-nav">
|
|
<nav data-toggle="wy-nav-shift" class="wy-nav-side">
|
|
<div class="wy-side-scroll">
|
|
<div class="wy-side-nav-search" >
|
|
|
|
|
|
|
|
<a href="index.html" class="icon icon-home">
|
|
Mathematics in Lean
|
|
</a>
|
|
<div role="search">
|
|
<form id="rtd-search-form" class="wy-form" action="search.html" method="get">
|
|
<input type="text" name="q" placeholder="Search docs" aria-label="Search docs" />
|
|
<input type="hidden" name="check_keywords" value="yes" />
|
|
<input type="hidden" name="area" value="default" />
|
|
</form>
|
|
</div>
|
|
</div><div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Navigation menu">
|
|
<ul class="current">
|
|
<li class="toctree-l1 current"><a class="current reference internal" href="#">1. Introduction</a><ul>
|
|
<li class="toctree-l2"><a class="reference internal" href="#getting-started">1.1. Getting Started</a></li>
|
|
<li class="toctree-l2"><a class="reference internal" href="#overview">1.2. Overview</a></li>
|
|
</ul>
|
|
</li>
|
|
<li class="toctree-l1"><a class="reference internal" href="C02_Basics.html">2. Basics</a></li>
|
|
<li class="toctree-l1"><a class="reference internal" href="C03_Logic.html">3. Logic</a></li>
|
|
<li class="toctree-l1"><a class="reference internal" href="C04_Sets_and_Functions.html">4. Sets and Functions</a></li>
|
|
<li class="toctree-l1"><a class="reference internal" href="C05_Elementary_Number_Theory.html">5. Elementary Number Theory</a></li>
|
|
<li class="toctree-l1"><a class="reference internal" href="C06_Discrete_Mathematics.html">6. Discrete Mathematics</a></li>
|
|
<li class="toctree-l1"><a class="reference internal" href="C07_Structures.html">7. Structures</a></li>
|
|
<li class="toctree-l1"><a class="reference internal" href="C08_Hierarchies.html">8. Hierarchies</a></li>
|
|
<li class="toctree-l1"><a class="reference internal" href="C09_Groups_and_Rings.html">9. Groups and Rings</a></li>
|
|
<li class="toctree-l1"><a class="reference internal" href="C10_Linear_Algebra.html">10. Linear algebra</a></li>
|
|
<li class="toctree-l1"><a class="reference internal" href="C11_Topology.html">11. Topology</a></li>
|
|
<li class="toctree-l1"><a class="reference internal" href="C12_Differential_Calculus.html">12. Differential Calculus</a></li>
|
|
<li class="toctree-l1"><a class="reference internal" href="C13_Integration_and_Measure_Theory.html">13. Integration and Measure Theory</a></li>
|
|
</ul>
|
|
<ul>
|
|
<li class="toctree-l1"><a class="reference internal" href="genindex.html">Index</a></li>
|
|
</ul>
|
|
|
|
</div>
|
|
</div>
|
|
</nav>
|
|
|
|
<section data-toggle="wy-nav-shift" class="wy-nav-content-wrap"><nav class="wy-nav-top" aria-label="Mobile navigation menu" >
|
|
<i data-toggle="wy-nav-top" class="fa fa-bars"></i>
|
|
<a href="index.html">Mathematics in Lean</a>
|
|
</nav>
|
|
|
|
<div class="wy-nav-content">
|
|
<div class="rst-content">
|
|
<div role="navigation" aria-label="Page navigation">
|
|
<ul class="wy-breadcrumbs">
|
|
<li><a href="index.html" class="icon icon-home" aria-label="Home"></a></li>
|
|
<li class="breadcrumb-item active"><span class="section-number">1. </span>Introduction</li>
|
|
<li class="wy-breadcrumbs-aside">
|
|
<a href="_sources/C01_Introduction.rst.txt" rel="nofollow"> View page source</a>
|
|
</li>
|
|
</ul>
|
|
<hr/>
|
|
</div>
|
|
<div role="main" class="document" itemscope="itemscope" itemtype="http://schema.org/Article">
|
|
<div itemprop="articleBody">
|
|
|
|
<section id="introduction">
|
|
<span id="id1"></span><h1><span class="section-number">1. </span>Introduction<a class="headerlink" href="#introduction" title="Link to this heading"></a></h1>
|
|
<section id="getting-started">
|
|
<h2><span class="section-number">1.1. </span>Getting Started<a class="headerlink" href="#getting-started" title="Link to this heading"></a></h2>
|
|
<p>The goal of this book is to teach you to formalize mathematics using the
|
|
Lean 4 interactive proof assistant.
|
|
It assumes that you know some mathematics, but it does not require much.
|
|
Although we will cover examples ranging from number theory
|
|
to measure theory and analysis,
|
|
we will focus on elementary aspects of those fields,
|
|
in the hopes that if they are not familiar to you,
|
|
you can pick them up as you go.
|
|
We also don’t presuppose any background with formal methods.
|
|
Formalization can be seen as a kind of computer programming:
|
|
we will write mathematical definitions, theorems, and proofs in
|
|
a regimented language, like a programming language,
|
|
that Lean can understand.
|
|
In return, Lean provides feedback and information,
|
|
interprets expressions and guarantees that they are well-formed,
|
|
and ultimately certifies the correctness of our proofs.</p>
|
|
<p>You can learn more about Lean from the
|
|
<a class="reference external" href="https://lean-lang.org">Lean project page</a>
|
|
and the
|
|
<a class="reference external" href="https://leanprover-community.github.io/">Lean community web pages</a>.
|
|
This tutorial is based on Lean’s large and ever-growing library, <em>Mathlib</em>.
|
|
We also strongly recommend joining the
|
|
<a class="reference external" href="https://leanprover.zulipchat.com/">Lean Zulip online chat group</a>
|
|
if you haven’t already.
|
|
You’ll find a lively and welcoming community of Lean enthusiasts there,
|
|
happy to answer questions and offer moral support.</p>
|
|
<p>Although you can read a pdf or html version of this book online,
|
|
it is designed to be read interactively,
|
|
running Lean from inside the VS Code editor.
|
|
To get started:</p>
|
|
<ol class="arabic simple">
|
|
<li><p>Install Lean 4 and VS Code following
|
|
these <a class="reference external" href="https://lean-lang.org/install/">installation instructions</a>.</p></li>
|
|
<li><p>Fetch the repository by clicking on the forall symbol in the upper right corner of VS Code,
|
|
and choose <cite>Open Project</cite>, <cite>Download Project</cite>, and <cite>Mathematics in Lean</cite>.</p></li>
|
|
<li><p>Each section in this book has an associated Lean file with examples and exercises.
|
|
You can find them in the folder <code class="docutils literal notranslate"><span class="pre">MIL</span></code>, organized by chapter.
|
|
We strongly recommend making a copy of that folder and experimenting and doing the
|
|
exercises in that copy.
|
|
This leaves the originals intact, and it also makes it easier to update the repository as it changes (see below).
|
|
You can call the copy <code class="docutils literal notranslate"><span class="pre">my_files</span></code> or whatever you want and use it to create
|
|
your own Lean files as well.</p></li>
|
|
</ol>
|
|
<p>At that point, you can open the textbook in a side panel in VS Code as follows:</p>
|
|
<ol class="arabic simple">
|
|
<li><p>Type <code class="docutils literal notranslate"><span class="pre">ctrl-shift-P</span></code> (<code class="docutils literal notranslate"><span class="pre">command-shift-P</span></code> in macOS).</p></li>
|
|
<li><p>Type <code class="docutils literal notranslate"><span class="pre">Lean</span> <span class="pre">4:</span> <span class="pre">Docs:</span> <span class="pre">Show</span> <span class="pre">Documentation</span> <span class="pre">Resources</span></code> in the bar that appears, and then
|
|
press return. (You can press return to select it as soon as it is highlighted
|
|
in the menu.)</p></li>
|
|
<li><p>In the window that opens, click on <code class="docutils literal notranslate"><span class="pre">Mathematics</span> <span class="pre">in</span> <span class="pre">Lean</span></code>.</p></li>
|
|
</ol>
|
|
<p>Alternatively, you can run Lean and VS Code in the cloud,
|
|
using <a class="reference external" href="https://github.com/codespaces">Codespaces</a>.
|
|
You can find instructions as to how to do that on the Mathematics in Lean
|
|
<a class="reference external" href="https://github.com/leanprover-community/mathematics_in_lean">project page</a>
|
|
on Github. We still recommend working in a copy of the <cite>MIL</cite> folder,
|
|
as described above.</p>
|
|
<p>This textbook and the associated repository are still a work in progress.
|
|
You can update the repository by typing <code class="docutils literal notranslate"><span class="pre">git</span> <span class="pre">pull</span></code>
|
|
followed by <code class="docutils literal notranslate"><span class="pre">lake</span> <span class="pre">exe</span> <span class="pre">cache</span> <span class="pre">get</span></code> inside the <code class="docutils literal notranslate"><span class="pre">mathematics_in_lean</span></code> folder.
|
|
(This assumes that you have not changed the contents of the <code class="docutils literal notranslate"><span class="pre">MIL</span></code> folder,
|
|
which is why we suggested making a copy.)</p>
|
|
<p>We intend for you to work on the exercises in the <code class="docutils literal notranslate"><span class="pre">MIL</span></code> folder while reading the
|
|
textbook, which contains explanations, instructions, and hints.
|
|
The text will often include examples, like this one:</p>
|
|
<div class="highlight-lean notranslate"><div class="highlight"><pre><span></span><span class="k">#eval</span><span class="w"> </span><span class="s2">"Hello, World!"</span>
|
|
</pre></div>
|
|
</div>
|
|
<p>You should be able to find the corresponding example in the associated
|
|
Lean file.
|
|
If you click on the line, VS Code will show you Lean’s feedback in
|
|
the <code class="docutils literal notranslate"><span class="pre">Lean</span> <span class="pre">InfoView</span></code> window, and if you hover
|
|
your cursor over the <code class="docutils literal notranslate"><span class="pre">#eval</span></code> command VS Code will show you Lean’s response
|
|
to this command in a pop-up window.
|
|
You are encouraged to edit the file and try examples of your own.</p>
|
|
<p>This book moreover provides lots of challenging exercises for you to try.
|
|
Don’t rush past these!
|
|
Lean is about <em>doing</em> mathematics interactively, not just reading about it.
|
|
Working through the exercises is central to the experience.
|
|
You don’t have to do all of them; when you feel comfortable that you have mastered
|
|
the relevant skills, feel free to move on.
|
|
You can always compare your solutions to the ones in the <code class="docutils literal notranslate"><span class="pre">solutions</span></code>
|
|
folder associated with each section.</p>
|
|
</section>
|
|
<section id="overview">
|
|
<h2><span class="section-number">1.2. </span>Overview<a class="headerlink" href="#overview" title="Link to this heading"></a></h2>
|
|
<p>Put simply, Lean is a tool for building complex expressions in a formal language
|
|
known as <em>dependent type theory</em>.</p>
|
|
<p id="index-0">Every expression has a <em>type</em>, and you can use the <cite>#check</cite> command to
|
|
print it.
|
|
Some expressions have types like <cite>ℕ</cite> or <cite>ℕ → ℕ</cite>.
|
|
These are mathematical objects.</p>
|
|
<div class="highlight-lean notranslate"><div class="highlight"><pre><span></span><span class="k">#check</span><span class="w"> </span><span class="mi">2</span><span class="w"> </span><span class="bp">+</span><span class="w"> </span><span class="mi">2</span>
|
|
|
|
<span class="kd">def</span><span class="w"> </span><span class="n">f</span><span class="w"> </span><span class="o">(</span><span class="n">x</span><span class="w"> </span><span class="o">:</span><span class="w"> </span><span class="n">ℕ</span><span class="o">)</span><span class="w"> </span><span class="o">:=</span>
|
|
<span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="bp">+</span><span class="w"> </span><span class="mi">3</span>
|
|
|
|
<span class="k">#check</span><span class="w"> </span><span class="n">f</span>
|
|
</pre></div>
|
|
</div>
|
|
<p>Some expressions have type <cite>Prop</cite>.
|
|
These are mathematical statements.</p>
|
|
<div class="highlight-lean notranslate"><div class="highlight"><pre><span></span><span class="k">#check</span><span class="w"> </span><span class="mi">2</span><span class="w"> </span><span class="bp">+</span><span class="w"> </span><span class="mi">2</span><span class="w"> </span><span class="bp">=</span><span class="w"> </span><span class="mi">4</span>
|
|
|
|
<span class="kd">def</span><span class="w"> </span><span class="n">FermatLastTheorem</span><span class="w"> </span><span class="o">:=</span>
|
|
<span class="w"> </span><span class="bp">∀</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="n">z</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="o">:</span><span class="w"> </span><span class="n">ℕ</span><span class="o">,</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="bp">></span><span class="w"> </span><span class="mi">2</span><span class="w"> </span><span class="bp">∧</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="bp">*</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="bp">*</span><span class="w"> </span><span class="n">z</span><span class="w"> </span><span class="bp">≠</span><span class="w"> </span><span class="mi">0</span><span class="w"> </span><span class="bp">→</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="bp">^</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="bp">+</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="bp">^</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="bp">≠</span><span class="w"> </span><span class="n">z</span><span class="w"> </span><span class="bp">^</span><span class="w"> </span><span class="n">n</span>
|
|
|
|
<span class="k">#check</span><span class="w"> </span><span class="n">FermatLastTheorem</span>
|
|
</pre></div>
|
|
</div>
|
|
<p>Some expressions have a type, <cite>P</cite>, where <cite>P</cite> itself has type <cite>Prop</cite>.
|
|
Such an expression is a proof of the proposition <cite>P</cite>.</p>
|
|
<div class="highlight-lean notranslate"><div class="highlight"><pre><span></span><span class="kd">theorem</span><span class="w"> </span><span class="n">easy</span><span class="w"> </span><span class="o">:</span><span class="w"> </span><span class="mi">2</span><span class="w"> </span><span class="bp">+</span><span class="w"> </span><span class="mi">2</span><span class="w"> </span><span class="bp">=</span><span class="w"> </span><span class="mi">4</span><span class="w"> </span><span class="o">:=</span>
|
|
<span class="w"> </span><span class="n">rfl</span>
|
|
|
|
<span class="k">#check</span><span class="w"> </span><span class="n">easy</span>
|
|
|
|
<span class="kd">theorem</span><span class="w"> </span><span class="n">hard</span><span class="w"> </span><span class="o">:</span><span class="w"> </span><span class="n">FermatLastTheorem</span><span class="w"> </span><span class="o">:=</span>
|
|
<span class="w"> </span><span class="gr">sorry</span>
|
|
|
|
<span class="k">#check</span><span class="w"> </span><span class="n">hard</span>
|
|
</pre></div>
|
|
</div>
|
|
<p>If you manage to construct an expression of type <code class="docutils literal notranslate"><span class="pre">FermatLastTheorem</span></code> and
|
|
Lean accepts it as a term of that type,
|
|
you have done something very impressive.
|
|
(Using <code class="docutils literal notranslate"><span class="pre">sorry</span></code> is cheating, and Lean knows it.)
|
|
So now you know the game.
|
|
All that is left to learn is the rules.</p>
|
|
<p>This book is complementary to a companion tutorial,
|
|
<a class="reference external" href="https://lean-lang.org/theorem_proving_in_lean4/">Theorem Proving in Lean</a>,
|
|
which provides a more thorough introduction to the underlying logical framework
|
|
and core syntax of Lean.
|
|
<em>Theorem Proving in Lean</em> is for people who prefer to read a user manual cover to cover before
|
|
using a new dishwasher.
|
|
If you are the kind of person who prefers to hit the <em>start</em> button and
|
|
figure out how to activate the potscrubber feature later,
|
|
it makes more sense to start here and refer back to
|
|
<em>Theorem Proving in Lean</em> as necessary.</p>
|
|
<p>Another thing that distinguishes <em>Mathematics in Lean</em> from
|
|
<em>Theorem Proving in Lean</em> is that here we place a much greater
|
|
emphasis on the use of <em>tactics</em>.
|
|
Given that we are trying to build complex expressions,
|
|
Lean offers two ways of going about it:
|
|
we can write down the expressions themselves
|
|
(that is, suitable text descriptions thereof),
|
|
or we can provide Lean with <em>instructions</em> as to how to construct them.
|
|
For example, the following expression represents a proof of the fact that
|
|
if <code class="docutils literal notranslate"><span class="pre">n</span></code> is even then so is <code class="docutils literal notranslate"><span class="pre">m</span> <span class="pre">*</span> <span class="pre">n</span></code>:</p>
|
|
<div class="highlight-lean notranslate"><div class="highlight"><pre><span></span><span class="kd">example</span><span class="w"> </span><span class="o">:</span><span class="w"> </span><span class="bp">∀</span><span class="w"> </span><span class="n">m</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="o">:</span><span class="w"> </span><span class="n">Nat</span><span class="o">,</span><span class="w"> </span><span class="n">Even</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="bp">→</span><span class="w"> </span><span class="n">Even</span><span class="w"> </span><span class="o">(</span><span class="n">m</span><span class="w"> </span><span class="bp">*</span><span class="w"> </span><span class="n">n</span><span class="o">)</span><span class="w"> </span><span class="o">:=</span><span class="w"> </span><span class="k">fun</span><span class="w"> </span><span class="n">m</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="o">⟨</span><span class="n">k</span><span class="o">,</span><span class="w"> </span><span class="o">(</span><span class="n">hk</span><span class="w"> </span><span class="o">:</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="bp">=</span><span class="w"> </span><span class="n">k</span><span class="w"> </span><span class="bp">+</span><span class="w"> </span><span class="n">k</span><span class="o">)⟩</span><span class="w"> </span><span class="bp">↦</span>
|
|
<span class="w"> </span><span class="k">have</span><span class="w"> </span><span class="n">hmn</span><span class="w"> </span><span class="o">:</span><span class="w"> </span><span class="n">m</span><span class="w"> </span><span class="bp">*</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="bp">=</span><span class="w"> </span><span class="n">m</span><span class="w"> </span><span class="bp">*</span><span class="w"> </span><span class="n">k</span><span class="w"> </span><span class="bp">+</span><span class="w"> </span><span class="n">m</span><span class="w"> </span><span class="bp">*</span><span class="w"> </span><span class="n">k</span><span class="w"> </span><span class="o">:=</span><span class="w"> </span><span class="kd">by</span><span class="w"> </span><span class="n">rw</span><span class="w"> </span><span class="o">[</span><span class="n">hk</span><span class="o">,</span><span class="w"> </span><span class="n">mul_add</span><span class="o">]</span>
|
|
<span class="w"> </span><span class="k">show</span><span class="w"> </span><span class="bp">∃</span><span class="w"> </span><span class="n">l</span><span class="o">,</span><span class="w"> </span><span class="n">m</span><span class="w"> </span><span class="bp">*</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="bp">=</span><span class="w"> </span><span class="n">l</span><span class="w"> </span><span class="bp">+</span><span class="w"> </span><span class="n">l</span><span class="w"> </span><span class="k">from</span><span class="w"> </span><span class="o">⟨</span><span class="n">_</span><span class="o">,</span><span class="w"> </span><span class="n">hmn</span><span class="o">⟩</span>
|
|
</pre></div>
|
|
</div>
|
|
<p>The <em>proof term</em> can be compressed to a single line:</p>
|
|
<div class="highlight-lean notranslate"><div class="highlight"><pre><span></span><span class="kd">example</span><span class="w"> </span><span class="o">:</span><span class="w"> </span><span class="bp">∀</span><span class="w"> </span><span class="n">m</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="o">:</span><span class="w"> </span><span class="n">Nat</span><span class="o">,</span><span class="w"> </span><span class="n">Even</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="bp">→</span><span class="w"> </span><span class="n">Even</span><span class="w"> </span><span class="o">(</span><span class="n">m</span><span class="w"> </span><span class="bp">*</span><span class="w"> </span><span class="n">n</span><span class="o">)</span><span class="w"> </span><span class="o">:=</span>
|
|
<span class="k">fun</span><span class="w"> </span><span class="n">m</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="o">⟨</span><span class="n">k</span><span class="o">,</span><span class="w"> </span><span class="n">hk</span><span class="o">⟩</span><span class="w"> </span><span class="bp">↦</span><span class="w"> </span><span class="o">⟨</span><span class="n">m</span><span class="w"> </span><span class="bp">*</span><span class="w"> </span><span class="n">k</span><span class="o">,</span><span class="w"> </span><span class="kd">by</span><span class="w"> </span><span class="n">rw</span><span class="w"> </span><span class="o">[</span><span class="n">hk</span><span class="o">,</span><span class="w"> </span><span class="n">mul_add</span><span class="o">]⟩</span>
|
|
</pre></div>
|
|
</div>
|
|
<p>The following is, instead, a <em>tactic-style</em> proof of the same theorem, where lines
|
|
starting with <code class="docutils literal notranslate"><span class="pre">--</span></code> are comments, hence ignored by Lean:</p>
|
|
<div class="highlight-lean notranslate"><div class="highlight"><pre><span></span><span class="kd">example</span><span class="w"> </span><span class="o">:</span><span class="w"> </span><span class="bp">∀</span><span class="w"> </span><span class="n">m</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="o">:</span><span class="w"> </span><span class="n">Nat</span><span class="o">,</span><span class="w"> </span><span class="n">Even</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="bp">→</span><span class="w"> </span><span class="n">Even</span><span class="w"> </span><span class="o">(</span><span class="n">m</span><span class="w"> </span><span class="bp">*</span><span class="w"> </span><span class="n">n</span><span class="o">)</span><span class="w"> </span><span class="o">:=</span><span class="w"> </span><span class="kd">by</span>
|
|
<span class="w"> </span><span class="c1">-- Say `m` and `n` are natural numbers, and assume `n = 2 * k`.</span>
|
|
<span class="w"> </span><span class="n">rintro</span><span class="w"> </span><span class="n">m</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="o">⟨</span><span class="n">k</span><span class="o">,</span><span class="w"> </span><span class="n">hk</span><span class="o">⟩</span>
|
|
<span class="w"> </span><span class="c1">-- We need to prove `m * n` is twice a natural number. Let's show it's twice `m * k`.</span>
|
|
<span class="w"> </span><span class="n">use</span><span class="w"> </span><span class="n">m</span><span class="w"> </span><span class="bp">*</span><span class="w"> </span><span class="n">k</span>
|
|
<span class="w"> </span><span class="c1">-- Substitute for `n`,</span>
|
|
<span class="w"> </span><span class="n">rw</span><span class="w"> </span><span class="o">[</span><span class="n">hk</span><span class="o">]</span>
|
|
<span class="w"> </span><span class="c1">-- and now it's obvious.</span>
|
|
<span class="w"> </span><span class="n">ring</span>
|
|
</pre></div>
|
|
</div>
|
|
<p>As you enter each line of such a proof in VS Code,
|
|
Lean displays the <em>proof state</em> in a separate window,
|
|
telling you what facts you have already established and what
|
|
tasks remain to prove your theorem.
|
|
You can replay the proof by stepping through the lines,
|
|
since Lean will continue to show you the state of the proof
|
|
at the point where the cursor is.
|
|
In this example, you will then see that
|
|
the first line of the proof introduces <code class="docutils literal notranslate"><span class="pre">m</span></code> and <code class="docutils literal notranslate"><span class="pre">n</span></code>
|
|
(we could have renamed them at that point, if we wanted to),
|
|
and also decomposes the hypothesis <code class="docutils literal notranslate"><span class="pre">Even</span> <span class="pre">n</span></code> to
|
|
a <code class="docutils literal notranslate"><span class="pre">k</span></code> and the assumption that <code class="docutils literal notranslate"><span class="pre">n</span> <span class="pre">=</span> <span class="pre">2</span> <span class="pre">*</span> <span class="pre">k</span></code>.
|
|
The second line, <code class="docutils literal notranslate"><span class="pre">use</span> <span class="pre">m</span> <span class="pre">*</span> <span class="pre">k</span></code>,
|
|
declares that we are going to show that <code class="docutils literal notranslate"><span class="pre">m</span> <span class="pre">*</span> <span class="pre">n</span></code> is even by
|
|
showing <code class="docutils literal notranslate"><span class="pre">m</span> <span class="pre">*</span> <span class="pre">n</span> <span class="pre">=</span> <span class="pre">2</span> <span class="pre">*</span> <span class="pre">(m</span> <span class="pre">*</span> <span class="pre">k)</span></code>.
|
|
The next line uses the <code class="docutils literal notranslate"><span class="pre">rw</span></code> tactic
|
|
to replace <code class="docutils literal notranslate"><span class="pre">n</span></code> by <code class="docutils literal notranslate"><span class="pre">2</span> <span class="pre">*</span> <span class="pre">k</span></code> in the goal (<code class="docutils literal notranslate"><span class="pre">rw</span></code> stands for “rewrite”),
|
|
and the <code class="docutils literal notranslate"><span class="pre">ring</span></code> tactic solves the resulting goal <code class="docutils literal notranslate"><span class="pre">m</span> <span class="pre">*</span> <span class="pre">(2</span> <span class="pre">*</span> <span class="pre">k)</span> <span class="pre">=</span> <span class="pre">2</span> <span class="pre">*</span> <span class="pre">(m</span> <span class="pre">*</span> <span class="pre">k)</span></code>.</p>
|
|
<p>The ability to build a proof in small steps with incremental feedback
|
|
is extremely powerful. For that reason,
|
|
tactic proofs are often easier and quicker to write than
|
|
proof terms.
|
|
There isn’t a sharp distinction between the two:
|
|
tactic proofs can be inserted in proof terms,
|
|
as we did with the phrase <code class="docutils literal notranslate"><span class="pre">by</span> <span class="pre">rw</span> <span class="pre">[hk,</span> <span class="pre">mul_add]</span></code> in the example above.
|
|
We will also see that, conversely,
|
|
it is often useful to insert a short proof term in the middle of a tactic proof.
|
|
That said, in this book, our emphasis will be on the use of tactics.</p>
|
|
<p>In our example, the tactic proof can also be reduced to a one-liner:</p>
|
|
<div class="highlight-lean notranslate"><div class="highlight"><pre><span></span><span class="kd">example</span><span class="w"> </span><span class="o">:</span><span class="w"> </span><span class="bp">∀</span><span class="w"> </span><span class="n">m</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="o">:</span><span class="w"> </span><span class="n">Nat</span><span class="o">,</span><span class="w"> </span><span class="n">Even</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="bp">→</span><span class="w"> </span><span class="n">Even</span><span class="w"> </span><span class="o">(</span><span class="n">m</span><span class="w"> </span><span class="bp">*</span><span class="w"> </span><span class="n">n</span><span class="o">)</span><span class="w"> </span><span class="o">:=</span><span class="w"> </span><span class="kd">by</span>
|
|
<span class="w"> </span><span class="n">rintro</span><span class="w"> </span><span class="n">m</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="o">⟨</span><span class="n">k</span><span class="o">,</span><span class="w"> </span><span class="n">hk</span><span class="o">⟩</span><span class="bp">;</span><span class="w"> </span><span class="n">use</span><span class="w"> </span><span class="n">m</span><span class="w"> </span><span class="bp">*</span><span class="w"> </span><span class="n">k</span><span class="bp">;</span><span class="w"> </span><span class="n">rw</span><span class="w"> </span><span class="o">[</span><span class="n">hk</span><span class="o">]</span><span class="bp">;</span><span class="w"> </span><span class="n">ring</span>
|
|
</pre></div>
|
|
</div>
|
|
<p>Here we have used tactics to carry out small proof steps.
|
|
But they can also provide substantial automation,
|
|
and justify longer calculations and bigger inferential steps.
|
|
For example, we can invoke Lean’s simplifier with
|
|
specific rules for simplifying statements about parity to
|
|
prove our theorem automatically.</p>
|
|
<div class="highlight-lean notranslate"><div class="highlight"><pre><span></span><span class="kd">example</span><span class="w"> </span><span class="o">:</span><span class="w"> </span><span class="bp">∀</span><span class="w"> </span><span class="n">m</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="o">:</span><span class="w"> </span><span class="n">Nat</span><span class="o">,</span><span class="w"> </span><span class="n">Even</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="bp">→</span><span class="w"> </span><span class="n">Even</span><span class="w"> </span><span class="o">(</span><span class="n">m</span><span class="w"> </span><span class="bp">*</span><span class="w"> </span><span class="n">n</span><span class="o">)</span><span class="w"> </span><span class="o">:=</span><span class="w"> </span><span class="kd">by</span>
|
|
<span class="w"> </span><span class="n">intros</span><span class="bp">;</span><span class="w"> </span><span class="n">simp</span><span class="w"> </span><span class="o">[</span><span class="bp">*</span><span class="o">,</span><span class="w"> </span><span class="n">parity_simps</span><span class="o">]</span>
|
|
</pre></div>
|
|
</div>
|
|
<p>Another big difference between the two introductions is that
|
|
<em>Theorem Proving in Lean</em> depends only on core Lean and its built-in
|
|
tactics, whereas <em>Mathematics in Lean</em> is built on top of Lean’s
|
|
powerful and ever-growing library, <em>Mathlib</em>.
|
|
As a result, we can show you how to use some of the mathematical
|
|
objects and theorems in the library,
|
|
and some of the very useful tactics.
|
|
This book is not meant to be used as an complete overview of the library;
|
|
the <a class="reference external" href="https://leanprover-community.github.io/">community</a>
|
|
web pages contain extensive documentation.
|
|
Rather, our goal is to introduce you to the style of thinking that
|
|
underlies that formalization, and point out basic entry points
|
|
so that you are comfortable browsing the library and
|
|
finding things on your own.</p>
|
|
<p>Interactive theorem proving can be frustrating,
|
|
and the learning curve is steep.
|
|
But the Lean community is very welcoming to newcomers,
|
|
and people are available on the
|
|
<a class="reference external" href="https://leanprover.zulipchat.com/">Lean Zulip chat group</a> round the clock
|
|
to answer questions.
|
|
We hope to see you there, and have no doubt that
|
|
soon enough you, too, will be able to answer such questions
|
|
and contribute to the development of <em>Mathlib</em>.</p>
|
|
<p>So here is your mission, should you choose to accept it:
|
|
dive in, try the exercises, come to Zulip with questions, and have fun.
|
|
But be forewarned:
|
|
interactive theorem proving will challenge you to think about
|
|
mathematics and mathematical reasoning in fundamentally new ways.
|
|
Your life may never be the same.</p>
|
|
<p><em>Acknowledgments.</em> We are grateful to Gabriel Ebner for setting up the
|
|
infrastructure for running this tutorial in VS Code,
|
|
and to Kim Morrison and Mario Carneiro for help porting it from Lean 4.
|
|
We are also grateful for help and corrections from
|
|
Takeshi Abe,
|
|
Julian Berman, Alex Best, Axel Boldt, Thomas Browning,
|
|
Bulwi Cha, Hanson Char, Bryan Gin-ge Chen, Steven Clontz, Mauricio Collaris, Johan Commelin,
|
|
Mark Czubin,
|
|
Alexandru Duca,
|
|
Pierpaolo Frasa,
|
|
Denis Gorbachev, Winston de Greef, Darij Grinberg, Mathieu Guay-Paquet,
|
|
Rik Heurter, Marc Huisinga,
|
|
Benjamin Jones,
|
|
Julian Külshammer,
|
|
Victor Liu, Jimmy Lu,
|
|
Martin C. Martin, Giovanni Mascellani, John McDowell, Joseph McKinsey, Bhavik Mehta, Sebastian Miele, Isaiah Mindich,
|
|
Kabelo Moiloa, Hunter Monroe, Pietro Monticone,
|
|
Oliver Nash, Emanuelle Natale, Filippo A. E. Nuccio,
|
|
Pim Otte,
|
|
Nicolas Rolland, Keith Rush,
|
|
Yannick Seurin, Guilherme Silva, Bernardo Subercaseaux,
|
|
Pedro Sánchez Terraf, Matthew Toohey, Alistair Tucker,
|
|
Floris van Doorn, Veniamin Viflyantsev,
|
|
Eric Wieser,
|
|
and others.
|
|
Our work has been partially supported by the Hoskinson Center for
|
|
Formal Mathematics.</p>
|
|
</section>
|
|
</section>
|
|
|
|
|
|
</div>
|
|
</div>
|
|
<footer><div class="rst-footer-buttons" role="navigation" aria-label="Footer">
|
|
<a href="index.html" class="btn btn-neutral float-left" title="Mathematics in Lean" accesskey="p" rel="prev"><span class="fa fa-arrow-circle-left" aria-hidden="true"></span> Previous</a>
|
|
<a href="C02_Basics.html" class="btn btn-neutral float-right" title="2. Basics" accesskey="n" rel="next">Next <span class="fa fa-arrow-circle-right" aria-hidden="true"></span></a>
|
|
</div>
|
|
|
|
<hr/>
|
|
|
|
<div role="contentinfo">
|
|
<p>© Copyright 2020-2025, Jeremy Avigad, Patrick Massot. Text licensed under CC BY 4.0.</p>
|
|
</div>
|
|
|
|
Built with <a href="https://www.sphinx-doc.org/">Sphinx</a> using a
|
|
<a href="https://github.com/readthedocs/sphinx_rtd_theme">theme</a>
|
|
provided by <a href="https://readthedocs.org">Read the Docs</a>.
|
|
|
|
|
|
</footer>
|
|
</div>
|
|
</div>
|
|
</section>
|
|
</div>
|
|
<script>
|
|
jQuery(function () {
|
|
SphinxRtdTheme.Navigation.enable(true);
|
|
});
|
|
</script>
|
|
|
|
</body>
|
|
</html> |