https://0art0.github.io/lambda-cube/tags/lean4/ Recent content in lean4 on λ-cube Hugo -- gohugo.io Sun, 29 Jan 2023 21:53:54 +0530 https://0art0.github.io/lambda-cube/posts/seemingly-impossible-lean-programs/ Sun, 29 Jan 2023 21:53:54 +0530 https://0art0.github.io/lambda-cube/posts/seemingly-impossible-lean-programs/ Introduction - Infinite search in finite time It should come as no surprise that an exhaustive search over a finite set can be performed algorithmically by enumeration. On the other hand, it is impossible to perform such an exhaustive enumeration over the natural numbers or the integers, as these sets are infinite. However, somewhat paradoxically, there are infinite sets that can be exhaustively searched in finite time. More precisely, there is at least one infinite set $X$ with the property that for any given Boolean-valued function $p$ on $X$, it is possible to algorithmically verify within finite time whether $p$ holds for all elements of $X$ or to produce a counter-example if one exists. https://0art0.github.io/lambda-cube/posts/solving-equations-in-abelian-groups/ Sun, 18 Sep 2022 16:30:00 +0530 https://0art0.github.io/lambda-cube/posts/solving-equations-in-abelian-groups/ A general equality problem for Abelian groups Consider the problem of deciding whether of deciding whether an equation, such as $$ (x + y) + z + -(x + z) = y$$ is true in all Abelian groups. This means that for any Abelian group $A$, and for any chosen values $x$, $y$ and $z$ in $A$, the equation should be true. This hardly poses a problem, for humans atleast - by "expanding", "cancelling", "rearranging" and "grouping", anyone well-versed in high-school algebra can solve an arbitrary instance of this problem without much thought. https://0art0.github.io/lambda-cube/posts/formalising-gardams-disproof-of-kaplanskys-unit-conjecture/ Wed, 08 Jun 2022 12:41:57 +0530 https://0art0.github.io/lambda-cube/posts/formalising-gardams-disproof-of-kaplanskys-unit-conjecture/ The Unit Conjecture The Unit Conjecture is a fundamental and well-known question about group rings that goes back to Graham Higman and Irving Kaplansky in the mid-twentieth century. It is a part of a collection of several conjectures posed by Kaplansky - most notably the Zero-divisor conjecture and the Idempotent conjecture. These are collectively known as Kaplansky's conjectures. The statement Consider a field $K$ and a group $G$. In the group ring $K[G]$, the elements of the form $k \cdot g$, where $k \in K \backslash \{0\}$ and $g \in G$, are clearly invertible - with the inverse being $k^{-1} \cdot g^{-1}$. https://0art0.github.io/lambda-cube/posts/function-finder-tactic/ Mon, 25 Apr 2022 10:22:24 +0530 https://0art0.github.io/lambda-cube/posts/function-finder-tactic/ Introduction The Lean theorem prover is one of several that supports constructing proofs using tactics - commands that allow users to build up proofs step-by-step interactively at a high level of abstraction, usually interspersed with automation (for a demonstration of tactics and an introduction to Lean in general, consult the Natural Number Game). One of the appealing aspects of Lean, especially Lean4, is that there is a robust framework in place for users to write custom tactics within the language, making Lean its own metaprogramming language.