task_id large_stringlengths 7 7 | task_type large_stringclasses 1
value | difficulty large_stringclasses 3
values | difficulty_score float64 0.22 7.6 | repo large_stringclasses 11
values | pr_number int64 37 37.1k | pr_title large_stringlengths 12 122 | pr_url large_stringlengths 43 63 | pr_labels large_stringclasses 83
values | base_commit large_stringlengths 40 40 | merge_commit large_stringlengths 40 40 | files_changed large_stringlengths 19 452 | primary_file large_stringlengths 8 87 | problem_statement large_stringlengths 159 20.6k | golden_patch large_stringlengths 294 77.4k | loc_added int64 0 1.21k | loc_deleted int64 0 972 | loc int64 1 1.45k | task_quality_score float64 4 9.5 | statement_strategy large_stringclasses 2
values | has_linked_issue bool 2
classes | pr_body_length int64 0 2.68k | files_changed_count int64 1 8 | new_theorems_count int64 0 112 | new_lemmas_count int64 0 61 | new_definitions_count int64 0 30 | proof_source large_stringclasses 1
value | human_verified bool 1
class | lean_toolchain large_stringclasses 1
value | docker_image large_stringclasses 1
value | verification_command large_stringclasses 1
value | timeout_seconds int64 600 600 | verification_method large_stringclasses 1
value | domain large_stringclasses 8
values | created_at large_stringdate 2026-04-28 12:39:47 2026-04-28 12:43:22 | created_by large_stringclasses 1
value |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
LB-0001 | pr_completion | easy | 0.44 | ImperialCollegeLondon/FLT | 910 | fix(CI): Blueprint test driver | https://github.com/ImperialCollegeLondon/FLT/pull/910 | ed4af4822818ad935393f983051e3bf27308e855 | 47c2d775b991e9f8dacf77a375b02e4c0edf613a | FLTTest.lean,FLTTest/FLTTest.lean | FLTTest.lean | # Task: fix(CI): Blueprint test driver
## Context
Checking if the band aid works in the main repo, consists of a CI step to forcibly relocate the `FLTTest.olean` for the blueprint checkdecls to see.
## Files affected
- FLTTest.lean (+1/-0)
- FLTTest/FLTTest.lean (+1/-0)
## Verification
The patched repository must co... | diff --git a/FLTTest.lean b/FLTTest.lean
--- a/FLTTest.lean
+++ b/FLTTest.lean
@@ -1 +1,2 @@
+import FLTTest.FLTTest
import FLTTest.MathlibCompatibility
diff --git a/FLTTest/FLTTest.lean b/FLTTest/FLTTest.lean
--- /dev/null
+++ b/FLTTest/FLTTest.lean
@@ -0,0 +1 @@
+import FLTTest.MathlibCompatibility | 2 | 0 | 2 | 6 | diff_derived | false | 148 | 2 | 0 | 0 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:39:47Z | extraction_pipeline_v2 | |
LB-0002 | pr_completion | easy | 3.1 | ImperialCollegeLondon/FLT | 898 | feat(Patching/Utils/CompactHausdorffRings): add partial proof that compact Hausdorff rings are totally disconnected | https://github.com/ImperialCollegeLondon/FLT/pull/898 | d346976c67e8437079ff1fd2b7878506e9ad0f37 | e8c35753f741cf30ffc59dcec88b5ce4e36f37b7 | FLT.lean,FLT/Patching/Utils/AdicTopology.lean,FLT/Patching/Utils/CompactHausdorffRings.lean | FLT.lean | # Task: feat(Patching/Utils/CompactHausdorffRings): add partial proof that compact Hausdorff rings are totally disconnected
## Context
I don't have immediately plans to finish this off (since @YaelDillies is actively working in this area and has ideas for how to do things in the right generality for mathlib), so I'm p... | diff --git a/FLT.lean b/FLT.lean
--- a/FLT.lean
+++ b/FLT.lean
@@ -161,6 +161,7 @@ import FLT.Patching.REqualsT
import FLT.Patching.System
import FLT.Patching.Ultraproduct
import FLT.Patching.Utils.AdicTopology
+import FLT.Patching.Utils.CompactHausdorffRings
import FLT.Patching.Utils.Depth
import FLT.Patching.Uti... | 137 | 0 | 137 | 8 | diff_derived | false | 224 | 3 | 3 | 0 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | algebra | 2026-04-28T12:39:47Z | extraction_pipeline_v2 | |
LB-0003 | pr_completion | easy | 1.6 | ImperialCollegeLondon/FLT | 887 | fix: finiteness files in `4.29` bump | https://github.com/ImperialCollegeLondon/FLT/pull/887 | 4554fdf0c9ff937384bda4692e603572c6adb7f0 | 504213abdafa05a5508d31f25b03dc9fc3c09e99 | FLT/AutomorphicForm/QuaternionAlgebra/FiniteDimensional.lean,FLT/DivisionAlgebra/Finiteness.lean,FLT/Mathlib/MeasureTheory/Haar/Extension.lean | FLT/AutomorphicForm/QuaternionAlgebra/FiniteDimensional.lean | # Task: fix: finiteness files in `4.29` bump
## Context
- A couple more `maxHeartbeats 0` required
- Remove upstreamed material in `MeasureTheory.Haar.Extension`
## Files affected
- FLT/AutomorphicForm/QuaternionAlgebra/FiniteDimensional.lean (+1/-0)
- FLT/DivisionAlgebra/Finiteness.lean (+76/-9)
- FLT/Mathlib/Measu... | diff --git a/FLT/AutomorphicForm/QuaternionAlgebra/FiniteDimensional.lean b/FLT/AutomorphicForm/QuaternionAlgebra/FiniteDimensional.lean
--- a/FLT/AutomorphicForm/QuaternionAlgebra/FiniteDimensional.lean
+++ b/FLT/AutomorphicForm/QuaternionAlgebra/FiniteDimensional.lean
@@ -28,6 +28,7 @@ open TotallyDefiniteQuaternionA... | 85 | 298 | 383 | 5 | diff_derived | false | 106 | 3 | 0 | 0 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | algebra | 2026-04-28T12:39:47Z | extraction_pipeline_v2 | |
LB-0004 | pr_completion | easy | 1.06 | ImperialCollegeLondon/FLT | 886 | fix: `4.29` fixes for `HaarChar.AdeleRing` | https://github.com/ImperialCollegeLondon/FLT/pull/886 | 7c8ac5865d778d3c2eafd3fe7dfb83803d8dc41c | 4554fdf0c9ff937384bda4692e603572c6adb7f0 | FLT/HaarMeasure/HaarChar/AdeleRing.lean | FLT/HaarMeasure/HaarChar/AdeleRing.lean | # Task: fix: `4.29` fixes for `HaarChar.AdeleRing`
## Files affected
- FLT/HaarMeasure/HaarChar/AdeleRing.lean (+22/-21)
## Verification
The patched repository must compile with `lake build`. | diff --git a/FLT/HaarMeasure/HaarChar/AdeleRing.lean b/FLT/HaarMeasure/HaarChar/AdeleRing.lean
--- a/FLT/HaarMeasure/HaarChar/AdeleRing.lean
+++ b/FLT/HaarMeasure/HaarChar/AdeleRing.lean
@@ -40,6 +40,7 @@ open scoped TensorProduct
open NumberField MeasureTheory
+set_option backward.isDefEq.respectTransparency fals... | 22 | 21 | 43 | 6 | diff_derived | false | 0 | 1 | 0 | 0 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | algebra | 2026-04-28T12:39:47Z | extraction_pipeline_v2 | |
LB-0005 | pr_completion | medium | 5 | ImperialCollegeLondon/FLT | 885 | fix: `4.29` fixes for finite adele files | https://github.com/ImperialCollegeLondon/FLT/pull/885 | 166dbe151303e083f2d18a2478f7d3bb218ee511 | b30cfb53c2a30eb96fb19c2b62b670075dd44fd1 | FLT/DedekindDomain/Completion/BaseChange.lean,FLT/DedekindDomain/FiniteAdeleRing/BaseChange.lean,FLT/DedekindDomain/IntegralClosure.lean,FLT/HaarMeasure/HaarChar/FiniteAdeleRing.lean,FLT/NumberField/AdeleRing.lean | FLT/DedekindDomain/Completion/BaseChange.lean | # Task: fix: `4.29` fixes for finite adele files
## Context
Some `maxHeartbeats 0` required in
- `Completion.BaseChange`
- `FiniteAdeleRing.BaseChange`
- `HaarCharacter.FiniteAdeleRing`
## Files affected
- FLT/DedekindDomain/Completion/BaseChange.lean (+134/-97)
- FLT/DedekindDomain/FiniteAdeleRing/BaseChange.lea... | diff --git a/FLT/DedekindDomain/Completion/BaseChange.lean b/FLT/DedekindDomain/Completion/BaseChange.lean
--- a/FLT/DedekindDomain/Completion/BaseChange.lean
+++ b/FLT/DedekindDomain/Completion/BaseChange.lean
@@ -40,6 +40,7 @@ map is continuous, `K_v`-linear and restricts to an isomorphism `B ⊗_A 𝓞_v
-/
open sco... | 267 | 167 | 434 | 6.5 | diff_derived | false | 129 | 5 | 1 | 3 | 2 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | algebra | 2026-04-28T12:39:48Z | extraction_pipeline_v2 | |
LB-0006 | pr_completion | easy | 2.4 | ImperialCollegeLondon/FLT | 883 | fix: `WithZeroMulInt` issues for bump to 4.29.0 | https://github.com/ImperialCollegeLondon/FLT/pull/883 | 6e04ca51c224b2ef37db017617e56bf917858a68 | df1bd1124322a770996e7cb67e747e6802c25ea8 | FLT/Mathlib/Topology/Algebra/Valued/WithZeroMulInt.lean,FLT/NumberField/Completion/Finite.lean | FLT/Mathlib/Topology/Algebra/Valued/WithZeroMulInt.lean | # Task: fix: `WithZeroMulInt` issues for bump to 4.29.0
## Files affected
- FLT/Mathlib/Topology/Algebra/Valued/WithZeroMulInt.lean (+21/-46)
- FLT/NumberField/Completion/Finite.lean (+1/-0)
## Theorems to prove
### `finite_cover_of_uniformity_basis` in `FLT/Mathlib/Topology/Algebra/Valued/WithZeroMulInt.lean`
```le... | diff --git a/FLT/Mathlib/Topology/Algebra/Valued/WithZeroMulInt.lean b/FLT/Mathlib/Topology/Algebra/Valued/WithZeroMulInt.lean
--- a/FLT/Mathlib/Topology/Algebra/Valued/WithZeroMulInt.lean
+++ b/FLT/Mathlib/Topology/Algebra/Valued/WithZeroMulInt.lean
@@ -9,6 +9,9 @@ import Mathlib.RingTheory.DiscreteValuationRing.Basic... | 22 | 46 | 68 | 7 | diff_derived | false | 0 | 2 | 2 | 0 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | algebra | 2026-04-28T12:39:48Z | extraction_pipeline_v2 | |
LB-0007 | pr_completion | hard | 7.4 | ImperialCollegeLondon/FLT | 882 | fix: `WithAbs` issues in 4.29.0 bump | https://github.com/ImperialCollegeLondon/FLT/pull/882 | bd1033acf6742eb55c375c2f5a7fafb9e0ef6d25 | 5b0ecd9f4770fe3425cff1af11a8ad5bf1d7e243 | FLT.lean,FLT/Mathlib/Algebra/Algebra/Hom.lean,FLT/Mathlib/Analysis/Normed/Ring/WithAbs.lean,FLT/NumberField/Completion/Infinite.lean,FLT/NumberField/InfiniteAdeleRing.lean,FLT/NumberField/InfinitePlace/Dimension.lean,FLT/NumberField/InfinitePlace/WeakApproximation.lean | FLT.lean | # Task: fix: `WithAbs` issues in 4.29.0 bump
## Context
- `WeakApproximation.lean` is now in mathlib
- `Dimension.lean` is almost in mathlib, so just replace contents with the open mathlib PR [#30551](https://github.com/leanprover-community/mathlib4/pull/30551)
- most of `WithAbs.lean` is in mathlib
- Introduce `S... | diff --git a/FLT.lean b/FLT.lean
--- a/FLT.lean
+++ b/FLT.lean
@@ -152,7 +152,6 @@ import FLT.NumberField.HeightOneSpectrum
import FLT.NumberField.InfiniteAdeleRing
import FLT.NumberField.InfinitePlace.Dimension
import FLT.NumberField.InfinitePlace.Extension
-import FLT.NumberField.InfinitePlace.WeakApproximation
i... | 210 | 972 | 1,182 | 4.5 | diff_derived | false | 450 | 7 | 9 | 0 | 2 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | algebra | 2026-04-28T12:39:48Z | extraction_pipeline_v2 | |
LB-0008 | pr_completion | easy | 2.4 | leanprover-community/mathlib4 | 37,059 | review: #36709 | https://github.com/leanprover-community/mathlib4/pull/37059 | ready-to-merge,t-meta | 9450d934e6c23ce226e8ddfa16ebd28f9cab1df4 | 23a8036a7a7f35719b883ebf20f5fa25c4b2a65e | Mathlib/Tactic/DefEqAbuse.lean,MathlibTest/DefEqAbuse.lean | Mathlib/Tactic/DefEqAbuse.lean | # Task: review: #36709
## Context
This review suggests
- various improvements to the code structure + readability; pruning of unnecessary code
- using `withCurrHeartbeats` instead of setting max heartbeats to 0 (and nothing at all in the `elabCommand` case, which should effectively start heartbeats afresh anyway)
-... | diff --git a/Mathlib/Tactic/DefEqAbuse.lean b/Mathlib/Tactic/DefEqAbuse.lean
--- a/Mathlib/Tactic/DefEqAbuse.lean
+++ b/Mathlib/Tactic/DefEqAbuse.lean
@@ -362,48 +362,40 @@ def reportDefEqAbuse {m : Type → Type} [Monad m] [MonadLog m] [AddMessageConte
`backward.isDefEq.respectTransparency true` but succeeds wi... | 77 | 66 | 143 | 8 | diff_derived | false | 557 | 2 | 0 | 0 | 2 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:39:49Z | extraction_pipeline_v2 |
LB-0009 | pr_completion | easy | 1.7 | leanprover-community/mathlib4 | 36,880 | review: MessageData.ForExprs | https://github.com/leanprover-community/mathlib4/pull/36880 | t-meta | 35d565bba7a120c88be1e421e84ff70e8778dc3c | 94acb1345e3767c673cd2cf656f86e25d5f4e6ec | Mathlib/Lean/MessageData/ForExprs.lean | Mathlib/Lean/MessageData/ForExprs.lean | # Task: review: MessageData.ForExprs
## Context
This review of #36796 suggests implementing `for (ppCtx, e) in msgs.exprs do` notation by letting the caller handle `ppCtx` themselves, via an approach patterned after `Syntax.topDown`. This also means we can avoid running `MetaM` when we're simply getting the expressio... | diff --git a/Mathlib/Lean/MessageData/ForExprs.lean b/Mathlib/Lean/MessageData/ForExprs.lean
--- a/Mathlib/Lean/MessageData/ForExprs.lean
+++ b/Mathlib/Lean/MessageData/ForExprs.lean
@@ -13,25 +13,30 @@ public import Lean.Meta.Basic
/-!
# Tools for extracting `Expr`s from `MessageData` nodes
-The main definition in... | 71 | 37 | 108 | 8.5 | diff_derived | false | 729 | 1 | 0 | 0 | 1 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:39:53Z | extraction_pipeline_v2 |
LB-0010 | pr_completion | easy | 3.4 | leanprover-community/mathlib4 | 35,843 | review: just the basics | https://github.com/leanprover-community/mathlib4/pull/35843 | delegated,t-meta | be3f919ded3ff56ae14edfbbe776bb5542a929f0 | 93584a945344b3c995cac4249c4e1ae747998b02 | Mathlib/Lean/MessageData/Trace.lean,Mathlib/Tactic/DefEqAbuse.lean | Mathlib/Lean/MessageData/Trace.lean | # Task: review: just the basics
## Context
This ultra-quick review of #35750 doesn't check for good behavior or maintainable code; instead, as per the [zulip thread](https://leanprover.zulipchat.com/#narrow/channel/113488-general/topic/backward.2EisDefEq.2ErespectTransparency/with/575687635), it merely
- adds disclai... | diff --git a/Mathlib/Lean/MessageData/Trace.lean b/Mathlib/Lean/MessageData/Trace.lean
--- a/Mathlib/Lean/MessageData/Trace.lean
+++ b/Mathlib/Lean/MessageData/Trace.lean
@@ -10,13 +10,9 @@ public import Lean.Message
public import Std.Data.HashSet.Basic
/-!
-# Trace Tree Analysis Utilities for `MessageData`
+# Util... | 139 | 128 | 267 | 8.5 | diff_derived | false | 421 | 2 | 0 | 0 | 4 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:39:53Z | extraction_pipeline_v2 |
LB-0011 | pr_completion | medium | 4.4 | ImperialCollegeLondon/FLT | 841 | Complete `localcomponent_matrix` and `f_g_local_global` | https://github.com/ImperialCollegeLondon/FLT/pull/841 | e36185c7b9eaf3ecb0ce044a0536490f4007e0f1 | 712e8a20d2647895feed1cbf5518dce4056f58cb | FLT/HaarMeasure/HaarChar/FiniteAdeleRing.lean,FLT/Mathlib/Topology/Algebra/RestrictedProduct/TopologicalSpace.lean | FLT/HaarMeasure/HaarChar/FiniteAdeleRing.lean | # Task: Complete `localcomponent_matrix` and `f_g_local_global`
## Files affected
- FLT/HaarMeasure/HaarChar/FiniteAdeleRing.lean (+112/-12)
- FLT/Mathlib/Topology/Algebra/RestrictedProduct/TopologicalSpace.lean (+18/-0)
## Supporting lemmas
- `basis_repr_eq_global` in `FLT/HaarMeasure/HaarChar/FiniteAdeleRing.lean`
... | diff --git a/FLT/HaarMeasure/HaarChar/FiniteAdeleRing.lean b/FLT/HaarMeasure/HaarChar/FiniteAdeleRing.lean
--- a/FLT/HaarMeasure/HaarChar/FiniteAdeleRing.lean
+++ b/FLT/HaarMeasure/HaarChar/FiniteAdeleRing.lean
@@ -239,23 +239,33 @@ TODO: Could all probably be elsewhere and in greater generality. -/
noncomputable abbr... | 130 | 12 | 142 | 7.5 | diff_derived | false | 0 | 2 | 0 | 6 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | algebra | 2026-04-28T12:40:01Z | extraction_pipeline_v2 | |
LB-0012 | pr_completion | medium | 6.6 | ImperialCollegeLondon/FLT | 836 | feat: FiniteAdeleRing.Aux.almost_always_bijOn | https://github.com/ImperialCollegeLondon/FLT/pull/836 | awaiting-CI | 20c7c4548a6a67fdcfb585a83a46b273f45843ca | 799f7d54d7e3f096b3037189f9713abc28be81f0 | FLT/HaarMeasure/HaarChar/FiniteAdeleRing.lean,FLT/Mathlib/LinearAlgebra/TensorProduct/Algebra.lean,FLT/Mathlib/RingTheory/DedekindDomain/FiniteAdeleRing.lean | FLT/HaarMeasure/HaarChar/FiniteAdeleRing.lean | # Task: feat: FiniteAdeleRing.Aux.almost_always_bijOn
## Files affected
- FLT/HaarMeasure/HaarChar/FiniteAdeleRing.lean (+198/-6)
- FLT/Mathlib/LinearAlgebra/TensorProduct/Algebra.lean (+7/-1)
- FLT/Mathlib/RingTheory/DedekindDomain/FiniteAdeleRing.lean (+52/-3)
## Definitions to add
- `evalAlgebraMap` in `FLT/Mathli... | diff --git a/FLT/HaarMeasure/HaarChar/FiniteAdeleRing.lean b/FLT/HaarMeasure/HaarChar/FiniteAdeleRing.lean
--- a/FLT/HaarMeasure/HaarChar/FiniteAdeleRing.lean
+++ b/FLT/HaarMeasure/HaarChar/FiniteAdeleRing.lean
@@ -230,26 +230,218 @@ open FiniteAdeleRing.Aux
generality so no harm in making it classical. -/
noncomputa... | 257 | 10 | 267 | 7.5 | diff_derived | false | 14 | 3 | 0 | 8 | 2 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | algebra | 2026-04-28T12:40:01Z | extraction_pipeline_v2 |
LB-0013 | pr_completion | easy | 1 | ImperialCollegeLondon/FLT | 834 | feat(HaarChar/FiniteAdeleRing): Fill in two sorries | https://github.com/ImperialCollegeLondon/FLT/pull/834 | 52dd0fdbe9ccb9b3a874773c3bc44c8b946e3d46 | 20c7c4548a6a67fdcfb585a83a46b273f45843ca | FLT/HaarMeasure/HaarChar/FiniteAdeleRing.lean | FLT/HaarMeasure/HaarChar/FiniteAdeleRing.lean | # Task: feat(HaarChar/FiniteAdeleRing): Fill in two sorries
## Context
This PR fills in two sorres in `HaarChar/FiniteAdeleRing`.
## Files affected
- FLT/HaarMeasure/HaarChar/FiniteAdeleRing.lean (+34/-6)
## Verification
The patched repository must compile with `lake build`. | diff --git a/FLT/HaarMeasure/HaarChar/FiniteAdeleRing.lean b/FLT/HaarMeasure/HaarChar/FiniteAdeleRing.lean
--- a/FLT/HaarMeasure/HaarChar/FiniteAdeleRing.lean
+++ b/FLT/HaarMeasure/HaarChar/FiniteAdeleRing.lean
@@ -259,9 +259,23 @@ lemma localcomponent_mulLeft (u : ((FiniteAdeleRing (𝓞 K) K) ⊗[K] B)ˣ)
(Continuous... | 34 | 6 | 40 | 6 | diff_derived | false | 58 | 1 | 0 | 0 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | algebra | 2026-04-28T12:40:02Z | extraction_pipeline_v2 | |
LB-0014 | pr_completion | easy | 1.98 | ImperialCollegeLondon/FLT | 835 | localcomponent_id, localcomponent_comp, IsCompact (v.adicCompletionIntegers K) | https://github.com/ImperialCollegeLondon/FLT/pull/835 | 52dd0fdbe9ccb9b3a874773c3bc44c8b946e3d46 | ba672bce4061ac4782b7d959d87020de5d59e60d | FLT/DedekindDomain/FiniteAdeleRing/TensorProduct.lean,FLT/HaarMeasure/HaarChar/FiniteAdeleRing.lean,FLT/NumberField/Completion/Finite.lean | FLT/DedekindDomain/FiniteAdeleRing/TensorProduct.lean | # Task: localcomponent_id, localcomponent_comp, IsCompact (v.adicCompletionIntegers K)
## Context
The first 3 tasks in [#FLT > Outstanding tasks, V10](https://leanprover.zulipchat.com/#narrow/channel/416277-FLT/topic/Outstanding.20tasks.2C.20V10)
## Files affected
- FLT/DedekindDomain/FiniteAdeleRing/TensorProduct.le... | diff --git a/FLT/DedekindDomain/FiniteAdeleRing/TensorProduct.lean b/FLT/DedekindDomain/FiniteAdeleRing/TensorProduct.lean
--- a/FLT/DedekindDomain/FiniteAdeleRing/TensorProduct.lean
+++ b/FLT/DedekindDomain/FiniteAdeleRing/TensorProduct.lean
@@ -55,15 +55,40 @@ noncomputable def TensorProduct.localcomponent (p : Heigh... | 37 | 7 | 44 | 7.5 | diff_derived | false | 148 | 3 | 0 | 1 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | algebra | 2026-04-28T12:40:02Z | extraction_pipeline_v2 | |
LB-0015 | pr_completion | easy | 1.88 | ImperialCollegeLondon/FLT | 833 | feat: state id and comp for localcomponent | https://github.com/ImperialCollegeLondon/FLT/pull/833 | 5c2aa9fd9120d195a0fb0178fe221ac0bab617cd | 52dd0fdbe9ccb9b3a874773c3bc44c8b946e3d46 | FLT/DedekindDomain/FiniteAdeleRing/TensorProduct.lean | FLT/DedekindDomain/FiniteAdeleRing/TensorProduct.lean | # Task: feat: state id and comp for localcomponent
## Files affected
- FLT/DedekindDomain/FiniteAdeleRing/TensorProduct.lean (+21/-13)
## Supporting lemmas
- `TensorProduct.localcomponent_id_apply` in `FLT/DedekindDomain/FiniteAdeleRing/TensorProduct.lean`
```lean
lemma TensorProduct.localcomponent_id_apply (p : ... | diff --git a/FLT/DedekindDomain/FiniteAdeleRing/TensorProduct.lean b/FLT/DedekindDomain/FiniteAdeleRing/TensorProduct.lean
--- a/FLT/DedekindDomain/FiniteAdeleRing/TensorProduct.lean
+++ b/FLT/DedekindDomain/FiniteAdeleRing/TensorProduct.lean
@@ -52,6 +52,19 @@ noncomputable def TensorProduct.localcomponent (p : Height... | 21 | 13 | 34 | 7.5 | diff_derived | false | 0 | 1 | 0 | 2 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | algebra | 2026-04-28T12:40:02Z | extraction_pipeline_v2 | |
LB-0016 | pr_completion | hard | 7.2 | ImperialCollegeLondon/FLT | 823 | isCentralSimple_addHaarScalarFactor_left_mul_eq_right_mul | https://github.com/ImperialCollegeLondon/FLT/pull/823 | awaiting-review | 0b0f52f7516a7baab568686949b3ce3f952e444a | 3c9d5604540b3b9f50857802d85ea6230103e764 | FLT.lean,FLT/DivisionAlgebra/Finiteness.lean,FLT/HaarMeasure/HaarChar/AdeleRing.lean,FLT/Mathlib/Algebra/Central/TensorProduct.lean,FLT/Mathlib/LinearAlgebra/Determinant.lean,FLT/NumberField/Completion/Finite.lean | FLT.lean | # Task: isCentralSimple_addHaarScalarFactor_left_mul_eq_right_mul
## Context
Current progress: reduce to the finite adeles, i.e. instead of `isCentralSimple_addHaarScalarFactor_left_mul_eq_right_mul`, we now have `isCentralSimple_finite_addHaarScalarFactor_left_mul_eq_right_mul` in the same place, with `AdeleRing` rep... | diff --git a/FLT.lean b/FLT.lean
--- a/FLT.lean
+++ b/FLT.lean
@@ -64,6 +64,7 @@ import FLT.Mathlib.Algebra.Algebra.Bilinear
import FLT.Mathlib.Algebra.Algebra.Hom
import FLT.Mathlib.Algebra.Algebra.Pi
import FLT.Mathlib.Algebra.Algebra.Tower
+import FLT.Mathlib.Algebra.Central.TensorProduct
import FLT.Mathlib.Alge... | 386 | 5 | 391 | 5.5 | diff_derived | false | 760 | 6 | 0 | 12 | 4 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | algebra | 2026-04-28T12:40:02Z | extraction_pipeline_v2 |
LB-0017 | pr_completion | hard | 7.6 | ImperialCollegeLondon/FLT | 825 | feat: API for finite adele ring tensor vector space | https://github.com/ImperialCollegeLondon/FLT/pull/825 | awaiting-CI | 68062db94b8fdbdc8d306532d7b0e99f4e0046b1 | 0b0f52f7516a7baab568686949b3ce3f952e444a | FLT.lean,FLT/DedekindDomain/FiniteAdeleRing/TensorProduct.lean,FLT/Mathlib/LinearAlgebra/TensorProduct/Algebra.lean,FLT/Mathlib/LinearAlgebra/TensorProduct/FiniteFree.lean,FLT/Mathlib/RingTheory/DedekindDomain/FiniteAdeleRing.lean,FLT/Mathlib/Topology/Algebra/Module/TensorProduct.lean,FLT/Mathlib/Topology/Algebra/Restr... | FLT.lean | # Task: feat: API for finite adele ring tensor vector space
## Files affected
- FLT.lean (+4/-0)
- FLT/DedekindDomain/FiniteAdeleRing/TensorProduct.lean (+90/-0)
- FLT/Mathlib/LinearAlgebra/TensorProduct/Algebra.lean (+26/-0)
- FLT/Mathlib/LinearAlgebra/TensorProduct/FiniteFree.lean (+19/-0)
- FLT/Mathlib/RingTheory/D... | diff --git a/FLT.lean b/FLT.lean
--- a/FLT.lean
+++ b/FLT.lean
@@ -17,6 +17,7 @@ import FLT.DedekindDomain.FiniteAdeleRing.BaseChange
import FLT.DedekindDomain.FiniteAdeleRing.IsDirectLimitRestricted
import FLT.DedekindDomain.FiniteAdeleRing.LocalUnits
import FLT.DedekindDomain.FiniteAdeleRing.TensorPi
+import FLT.D... | 409 | 4 | 413 | 4.5 | diff_derived | false | 0 | 8 | 0 | 10 | 4 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | algebra | 2026-04-28T12:40:02Z | extraction_pipeline_v2 |
LB-0018 | pr_completion | easy | 3.5 | leanprover/lean4 | 13,301 | feat: add `try? => tac` syntax and parallel cancellation test | https://github.com/leanprover/lean4/pull/13301 | builds-mathlib,toolchain-available,changelog-tactics,mathlib4-nightly-available | ec727859274c18a82f26dd66028e36f380fdd35c | 432d11541ba76fb474d5817769f8a9b9a5fd5c4c | src/Init/Try.lean,src/Lean/Elab/Tactic/Try.lean,src/Lean/Server/Test/Cancel.lean,tests/elab/try_eval_suggest.lean,tests/server_interactive/cancellation_par.lean | src/Init/Try.lean | # Task: feat: add `try? => tac` syntax and parallel cancellation test
## Context
This PR adds a `try? => tac` syntax that runs `evalSuggest` directly on a given tactic, useful for testing the `try?` machinery in isolation. It also adds a server_interactive test (`cancellation_par.lean`) that demonstrates a cancellatio... | diff --git a/src/Init/Try.lean b/src/Init/Try.lean
--- a/src/Init/Try.lean
+++ b/src/Init/Try.lean
@@ -52,6 +52,9 @@ namespace Lean.Parser.Tactic
syntax (name := tryTrace) "try?" optConfig : tactic
+@[tactic_alt tryTrace]
+syntax (name := tryTraceWith) "try?" optConfig " => " tacticSeq : tactic
+
/-- Helper inter... | 171 | 0 | 171 | 8 | diff_derived | false | 926 | 5 | 3 | 0 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:05Z | extraction_pipeline_v2 |
LB-0019 | pr_completion | easy | 3.9 | leanprover/lean4 | 13,542 | fix: surface meaningful pattern errors inside `do`-notation | https://github.com/leanprover/lean4/pull/13542 | toolchain-available,changelog-language | a2cf1d6e2a2a600d1a08cb3eca996b6031f08403 | 5b252f2c3d24579453b5bc82a4ef4af5a008c822 | src/Lean/Elab/Do/PatternVar.lean,tests/elab/doSyntaxPatternError.lean | src/Lean/Elab/Do/PatternVar.lean | # Task: fix: surface meaningful pattern errors inside `do`-notation
## Context
This PR replaces the catch-all "unsupported pattern in syntax match" error that the new `do` elaborator produces for typical pattern mistakes (#2215, #8304, #10393) with the proper diagnostics from the regular pattern-var collector (e.g. "I... | diff --git a/src/Lean/Elab/Do/PatternVar.lean b/src/Lean/Elab/Do/PatternVar.lean
--- a/src/Lean/Elab/Do/PatternVar.lean
+++ b/src/Lean/Elab/Do/PatternVar.lean
@@ -17,16 +17,21 @@ namespace Lean.Elab.Do
open Lean Meta Parser.Term
--- support both regular and syntax match
+-- support both regular and syntax match; t... | 114 | 5 | 119 | 8.5 | diff_derived | false | 1,048 | 2 | 0 | 0 | 5 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:05Z | extraction_pipeline_v2 |
LB-0020 | pr_completion | easy | 0.24 | leanprover/lean4 | 13,553 | fix: typo in `enableInitializersExecution` error message | https://github.com/leanprover/lean4/pull/13553 | toolchain-available,changelog-other | 5b252f2c3d24579453b5bc82a4ef4af5a008c822 | 87120c312e10bc76c86767ea6082c009e7b0ee80 | src/Lean/Compiler/InitAttr.lean | src/Lean/Compiler/InitAttr.lean | # Task: fix: typo in `enableInitializersExecution` error message
## Context
This PR fixes a typo in the error message thrown by `runInitAttrs` when initializer execution has not been enabled. The message previously referred to `enableInitializerExecution` (singular), but the actual function is `enableInitializersExecu... | diff --git a/src/Lean/Compiler/InitAttr.lean b/src/Lean/Compiler/InitAttr.lean
--- a/src/Lean/Compiler/InitAttr.lean
+++ b/src/Lean/Compiler/InitAttr.lean
@@ -159,7 +159,7 @@ def declareBuiltin (forDecl : Name) (value : Expr) : CoreM Unit :=
@[export lean_run_init_attrs]
private unsafe def runInitAttrs (env : Environ... | 1 | 1 | 2 | 7 | diff_derived | false | 460 | 1 | 0 | 0 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:06Z | extraction_pipeline_v2 |
LB-0021 | pr_completion | easy | 3.6 | leanprover/lean4 | 13,534 | feat: support `while let` in `do` blocks via unified condition syntax | https://github.com/leanprover/lean4/pull/13534 | toolchain-available,changelog-language | 3c6317b6d77a565b4217532d1190ac6955dba842 | 4d7b7dd8e66c366a2ba7bbc31a85cdf3e6ed15c8 | src/Lean/Elab/BuiltinDo/Repeat.lean,src/Lean/Parser/Do.lean,tests/elab/whileRepeat.lean | src/Lean/Elab/BuiltinDo/Repeat.lean | # Task: feat: support `while let` in `do` blocks via unified condition syntax
## Context
This PR generalizes the `while` syntax in `do` blocks so that the condition can be any `doIfCond`, the same condition form already accepted by `if`. As a result, `while let pat := e do …` and `while let pat ← e do …` are now suppo... | diff --git a/src/Lean/Elab/BuiltinDo/Repeat.lean b/src/Lean/Elab/BuiltinDo/Repeat.lean
--- a/src/Lean/Elab/BuiltinDo/Repeat.lean
+++ b/src/Lean/Elab/BuiltinDo/Repeat.lean
@@ -36,12 +36,8 @@ remove the following code without breaking the do block's type.
Term.withMacroExpansion stx expanded <|
withRef expanded <... | 70 | 8 | 78 | 8.5 | diff_derived | false | 481 | 3 | 0 | 0 | 4 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:07Z | extraction_pipeline_v2 |
LB-0022 | pr_completion | easy | 2.04 | leanprover/lean4 | 13,532 | feat: notify satellite solvers about asserted equalities in `grind` | https://github.com/leanprover/lean4/pull/13532 | changelog-tactics | e843e5a1556196b3dc5593721875ee7f16a5ffe0 | 3c6317b6d77a565b4217532d1190ac6955dba842 | src/Lean/Meta/Tactic/Grind/Arith/Cutsat/EqCnstr.lean,src/Lean/Meta/Tactic/Grind/Core.lean,tests/pkg/homo/Homo.lean,tests/pkg/homo/Homo/Init.lean | src/Lean/Meta/Tactic/Grind/Arith/Cutsat/EqCnstr.lean | # Task: feat: notify satellite solvers about asserted equalities in `grind`
## Context
This PR notifies satellite solvers about asserted equalities `lhs = rhs` even though `lhs = rhs` is not internalized in the E-graph (an existing optimization). The notification lets solvers that do not inspect equivalence classes (s... | diff --git a/src/Lean/Meta/Tactic/Grind/Arith/Cutsat/EqCnstr.lean b/src/Lean/Meta/Tactic/Grind/Arith/Cutsat/EqCnstr.lean
--- a/src/Lean/Meta/Tactic/Grind/Arith/Cutsat/EqCnstr.lean
+++ b/src/Lean/Meta/Tactic/Grind/Arith/Cutsat/EqCnstr.lean
@@ -758,6 +758,13 @@ def internalize (e : Expr) (parent? : Option Expr) : GoalM U... | 36 | 1 | 37 | 7.5 | diff_derived | false | 823 | 4 | 0 | 0 | 1 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:07Z | extraction_pipeline_v2 |
LB-0023 | pr_completion | easy | 0.24 | leanprover/lean4 | 13,526 | fix: lake: namespace in `Lake.Util.Opaque` (reapplied) | https://github.com/leanprover/lean4/pull/13526 | changelog-no | 5b87ab6625b801fd7b2af29cb81f5a4ab5646d26 | 09fabf3c3961ea33023b123fd8cd0517f7e2423c | src/lake/Lake/Util/Opaque.lean | src/lake/Lake/Util/Opaque.lean | # Task: fix: lake: namespace in `Lake.Util.Opaque` (reapplied)
## Context
This PR reapplies #13516 which was reverted by #13517 due to a [failure](https://www.githubstatus.com/incidents/zsg1lk7w13cf) of GitHub's merge queue.
## Files affected
- src/lake/Lake/Util/Opaque.lean (+2/-0)
## Verification
The patched repos... | diff --git a/src/lake/Lake/Util/Opaque.lean b/src/lake/Lake/Util/Opaque.lean
--- a/src/lake/Lake/Util/Opaque.lean
+++ b/src/lake/Lake/Util/Opaque.lean
@@ -9,6 +9,8 @@ prelude
public import Init.Prelude
import Init.Tactics
+namespace Lake
+
opaque POpaque.nonemptyType.{u} : NonemptyType.{u}
/-- An value of unkno... | 2 | 0 | 2 | 6.5 | diff_derived | false | 150 | 1 | 0 | 0 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:07Z | extraction_pipeline_v2 |
LB-0024 | pr_completion | easy | 0.4 | google-deepmind/formal-conjectures | 3,842 | feat(OpenQuantumProblems/35): solution for `ame_5_11_open` | https://github.com/google-deepmind/formal-conjectures/pull/3842 | solution found | b04c641045cdf650ea8f46c837ae2c7e37d17ee4 | 2003b417af34bf96a49061c44e575698e645f413 | FormalConjectures/OpenQuantumProblems/35.lean | FormalConjectures/OpenQuantumProblems/35.lean | # Task: feat(OpenQuantumProblems/35): solution for `ame_5_11_open`
## Files affected
- FormalConjectures/OpenQuantumProblems/35.lean (+7/-3)
## Verification
The patched repository must compile with `lake build`. | diff --git a/FormalConjectures/OpenQuantumProblems/35.lean b/FormalConjectures/OpenQuantumProblems/35.lean
--- a/FormalConjectures/OpenQuantumProblems/35.lean
+++ b/FormalConjectures/OpenQuantumProblems/35.lean
@@ -810,10 +810,14 @@ theorem ame_11_4_open :
answer(sorry) ↔ ExistsAME 11 4 := by
sorry
-/-- Open ... | 7 | 3 | 10 | 6 | diff_derived | false | 0 | 1 | 0 | 0 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | topology | 2026-04-28T12:40:07Z | extraction_pipeline_v2 |
LB-0025 | pr_completion | easy | 0.24 | leanprover/lean4 | 13,516 | fix: lake: namespace in `Lake.Util.Opaque` | https://github.com/leanprover/lean4/pull/13516 | builds-mathlib,toolchain-available,changelog-lake,mathlib4-nightly-available,lake-ci | 1e0ddbb90dc7c90488b0920a326366059cf50c27 | 848122d1f9779f0cf79006d5ca727085b35b7a83 | src/lake/Lake/Util/Opaque.lean | src/lake/Lake/Util/Opaque.lean | # Task: fix: lake: namespace in `Lake.Util.Opaque`
## Context
This PR adds `namespace Lake` to `Lake.Util.Opaque`, which was missing it. This is technically a breaking change for any code which used `Opaque` without `open Lake`, but hopefully no one was doing that.
## Files affected
- src/lake/Lake/Util/Opaque.lean (... | diff --git a/src/lake/Lake/Util/Opaque.lean b/src/lake/Lake/Util/Opaque.lean
--- a/src/lake/Lake/Util/Opaque.lean
+++ b/src/lake/Lake/Util/Opaque.lean
@@ -9,6 +9,8 @@ prelude
public import Init.Prelude
import Init.Tactics
+namespace Lake
+
opaque POpaque.nonemptyType.{u} : NonemptyType.{u}
/-- An value of unkno... | 2 | 0 | 2 | 6.5 | diff_derived | false | 203 | 1 | 0 | 0 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:07Z | extraction_pipeline_v2 |
LB-0026 | pr_completion | easy | 0.46 | leanprover/lean4 | 13,441 | fix: wrapInstance: do not leak via un-reducible instances | https://github.com/leanprover/lean4/pull/13441 | builds-mathlib,toolchain-available,changelog-no,builds-manual,mathlib4-nightly-available,backport releases/v4.30.0 | 040376ebd038f043598348b68877377e3da6cc90 | 10338ed1b00a9c3fb864ee80b02b311cd7c9e2c5 | src/Lean/Meta/WrapInstance.lean,tests/elab/inferInstanceAs.lean | src/Lean/Meta/WrapInstance.lean | # Task: fix: wrapInstance: do not leak via un-reducible instances
## Context
This PR ensures that if wrapInstance encounters an instance that cannot be reduced to a constructor, the wrapping definition is left at semireducible transparency to avoid leakage.
## Files affected
- src/Lean/Meta/WrapInstance.lean (+0/-1)
... | diff --git a/src/Lean/Meta/WrapInstance.lean b/src/Lean/Meta/WrapInstance.lean
--- a/src/Lean/Meta/WrapInstance.lean
+++ b/src/Lean/Meta/WrapInstance.lean
@@ -145,7 +145,6 @@ public partial def wrapInstance (inst expectedType : Expr) (compile : Bool := tr
else
let name ← mkAuxDeclName
... | 1 | 2 | 3 | 6 | diff_derived | false | 180 | 2 | 0 | 0 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:07Z | extraction_pipeline_v2 |
LB-0027 | pr_completion | easy | 3.9 | leanprover/lean4 | 13,520 | test: `grind` homomorphism predicates | https://github.com/leanprover/lean4/pull/13520 | changelog-other | 2e48cd293ae3d8743949baefe6788bd3089dbe13 | 45bdae81c924753c2bc3d870992c3c90bbc880e3 | tests/pkg/homo/Homo.lean,tests/pkg/homo/Homo/Init.lean | tests/pkg/homo/Homo.lean | # Task: test: `grind` homomorphism predicates
## Context
This PR extends the `grind` homomorphism demo with predicates to be applied atoms.
## Files affected
- tests/pkg/homo/Homo.lean (+21/-16)
- tests/pkg/homo/Homo/Init.lean (+58/-5)
## Definitions to add
- `T` in `tests/pkg/homo/Homo.lean`
```lean
abbrev T (x... | diff --git a/tests/pkg/homo/Homo.lean b/tests/pkg/homo/Homo.lean
--- a/tests/pkg/homo/Homo.lean
+++ b/tests/pkg/homo/Homo.lean
@@ -2,24 +2,29 @@ import Homo.Init
set_option warn.sorry false
-opaque TSpec : (α : Type) × α := ⟨Unit, ()⟩
-abbrev T : Type := TSpec.1
-instance : Inhabited T := ⟨TSpec.2⟩
-opaque add : T... | 79 | 21 | 100 | 7.5 | diff_derived | false | 82 | 2 | 0 | 0 | 5 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:07Z | extraction_pipeline_v2 |
LB-0028 | pr_completion | easy | 0.24 | leanprover/lean4 | 13,512 | fix: do not bump transparency to instances in eqn LHS whnf | https://github.com/leanprover/lean4/pull/13512 | builds-mathlib,toolchain-available,changelog-language,mathlib4-nightly-available | e3d42400cee1b49f643bd74a9ae06b4a026ae612 | 1e0ddbb90dc7c90488b0920a326366059cf50c27 | src/Lean/Elab/PreDefinition/EqnsUtils.lean | src/Lean/Elab/PreDefinition/EqnsUtils.lean | # Task: fix: do not bump transparency to instances in eqn LHS whnf
## Context
This PR changes `whnfAux` in the equation-theorem generation machinery to use
reducible transparency (`whnfR`) instead of instances transparency (`whnfI`).
Previously, the loop in `Eqns.go` would unfold instances on the LHS, which
interacts ... | diff --git a/src/Lean/Elab/PreDefinition/EqnsUtils.lean b/src/Lean/Elab/PreDefinition/EqnsUtils.lean
--- a/src/Lean/Elab/PreDefinition/EqnsUtils.lean
+++ b/src/Lean/Elab/PreDefinition/EqnsUtils.lean
@@ -49,7 +49,7 @@ public def tryContradiction (mvarId : MVarId) : MetaM Bool := do
mvarId.contradictionCore { genDiseq... | 1 | 1 | 2 | 7 | diff_derived | false | 733 | 1 | 0 | 0 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:07Z | extraction_pipeline_v2 |
LB-0029 | pr_completion | medium | 6.4 | leanprover/lean4 | 13,507 | feat: pluggable `pure`/`bind` builders for `do` elaboration | https://github.com/leanprover/lean4/pull/13507 | toolchain-available,changelog-language | 87c123bb1bc54a850e583ea5e2eb79b8a5051070 | 525021c01e1253b9026200212d91e00a3a80ffa3 | src/Lean/Elab/Do/Basic.lean,tests/elab/doNotationPluggableOps.lean | src/Lean/Elab/Do/Basic.lean | # Task: feat: pluggable `pure`/`bind` builders for `do` elaboration
## Context
This PR exposes the `Pure.pure` / `Bind.bind` applications emitted by the `do` elaborator as pluggable closures, so external surface syntaxes (e.g. an `ido` notation for indexed monads) can reuse the full `do` machinery while emitting alter... | diff --git a/src/Lean/Elab/Do/Basic.lean b/src/Lean/Elab/Do/Basic.lean
--- a/src/Lean/Elab/Do/Basic.lean
+++ b/src/Lean/Elab/Do/Basic.lean
@@ -45,6 +45,15 @@ def ContInfoRef : Type := ContInfoRefPointed.type
instance : Nonempty ContInfoRef :=
by exact ContInfoRefPointed.property
+-- Same pattern as `ContInfoRef` ... | 299 | 29 | 328 | 7.5 | diff_derived | false | 1,247 | 2 | 0 | 0 | 10 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:07Z | extraction_pipeline_v2 |
LB-0030 | pr_completion | easy | 0.96 | google-deepmind/formal-conjectures | 3,681 | feat(Paper/MonochromaticQuantumGraph): `eqSystem4_no_solution_ge4` | https://github.com/google-deepmind/formal-conjectures/pull/3681 | solution found | b63700e3536e29904a30089a97681903bdda1143 | b2b304928a7cb4c3ed6aa78465996bd4f923aa1f | FormalConjectures/Paper/MonochromaticQuantumGraph.lean | FormalConjectures/Paper/MonochromaticQuantumGraph.lean | # Task: feat(Paper/MonochromaticQuantumGraph): `eqSystem4_no_solution_ge4`
## Files affected
- FormalConjectures/Paper/MonochromaticQuantumGraph.lean (+27/-11)
## Verification
The patched repository must compile with `lake build`. | diff --git a/FormalConjectures/Paper/MonochromaticQuantumGraph.lean b/FormalConjectures/Paper/MonochromaticQuantumGraph.lean
--- a/FormalConjectures/Paper/MonochromaticQuantumGraph.lean
+++ b/FormalConjectures/Paper/MonochromaticQuantumGraph.lean
@@ -368,11 +368,16 @@ theorem eqSystem4_no_solution_d4 :
¬ ∃ W : W... | 27 | 11 | 38 | 6 | diff_derived | false | 0 | 1 | 0 | 0 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | combinatorics | 2026-04-28T12:40:07Z | extraction_pipeline_v2 |
LB-0031 | pr_completion | easy | 2.08 | google-deepmind/formal-conjectures | 3,744 | feat(Wikipedia/EulerBrick): proof for `cuboidOne` | https://github.com/google-deepmind/formal-conjectures/pull/3744 | wikipedia | 42bece60b362c401b7d8abe318e0b6d9aecaa646 | 92302ba152fc7c9dcca397e98e72f87987fbb952 | FormalConjectures/Wikipedia/EulerBrick.lean | FormalConjectures/Wikipedia/EulerBrick.lean | # Task: feat(Wikipedia/EulerBrick): proof for `cuboidOne`
## Files affected
- FormalConjectures/Wikipedia/EulerBrick.lean (+14/-5)
## Theorems to prove
### `cuboidOne` in `FormalConjectures/Wikipedia/EulerBrick.lean`
```lean
theorem cuboidOne : CuboidOne := by
```
### `cuboidTwo` in `FormalConjectures/Wikipedia/Eul... | diff --git a/FormalConjectures/Wikipedia/EulerBrick.lean b/FormalConjectures/Wikipedia/EulerBrick.lean
--- a/FormalConjectures/Wikipedia/EulerBrick.lean
+++ b/FormalConjectures/Wikipedia/EulerBrick.lean
@@ -87,9 +87,18 @@ def CuboidOneFor (a b : ℤ) : Prop :=
the polynomial of the first Cuboid polynomial is irreducible... | 14 | 5 | 19 | 8 | diff_derived | false | 0 | 1 | 3 | 0 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:08Z | extraction_pipeline_v2 |
LB-0032 | pr_completion | easy | 1.72 | google-deepmind/formal-conjectures | 3,670 | feat(ErdosProblems/978): solution for `parts.ii` | https://github.com/google-deepmind/formal-conjectures/pull/3670 | erdos-problems,solution found | e1e26e7239a9e33c76756ce4e0bbdf72ea6fff01 | 09ee64cf4612578fa2ee5d50d9d9d1e19a2d0d26 | FormalConjectures/ErdosProblems/978.lean | FormalConjectures/ErdosProblems/978.lean | # Task: feat(ErdosProblems/978): solution for `parts.ii`
## Files affected
- FormalConjectures/ErdosProblems/978.lean (+22/-4)
## Theorems to prove
### `erdos_978.variants.allow_fixed_divisors` in `FormalConjectures/ErdosProblems/978.lean`
```lean
theorem erdos_978.variants.allow_fixed_divisors : answer(False) ↔
```... | diff --git a/FormalConjectures/ErdosProblems/978.lean b/FormalConjectures/ErdosProblems/978.lean
--- a/FormalConjectures/ErdosProblems/978.lean
+++ b/FormalConjectures/ErdosProblems/978.lean
@@ -58,15 +58,33 @@ theorem erdos_978.variants.sub_two {f : ℤ[X]} (hi : Irreducible f) (hd : 9 ≤
{n : ℕ | Powerfree (f.natDe... | 22 | 4 | 26 | 7.5 | diff_derived | false | 0 | 1 | 2 | 0 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:08Z | extraction_pipeline_v2 |
LB-0033 | pr_completion | easy | 1.38 | leanprover/lean4 | 13,491 | fix: correct `alternative`-fold base in do `match` | https://github.com/leanprover/lean4/pull/13491 | toolchain-available,changelog-language | 2b99012545f89974de31621b208347f22c2342a3 | a1240f7b8041efcde635a9748b52e398a6f20d24 | src/Lean/Elab/BuiltinDo/Match.lean,src/Lean/Elab/Do/InferControlInfo.lean,tests/elab/doControlInfoAggregate.lean | src/Lean/Elab/BuiltinDo/Match.lean | # Task: fix: correct `alternative`-fold base in do `match`
## Context
This PR fixes the `ControlInfo` inference for a do-block `match`: the fold over the match arms started from `ControlInfo.pure` (defaults to `numRegularExits := 1`, `noFallthrough := false`), but `alternative` sums `numRegularExits` and ANDs `noFallt... | diff --git a/src/Lean/Elab/BuiltinDo/Match.lean b/src/Lean/Elab/BuiltinDo/Match.lean
--- a/src/Lean/Elab/BuiltinDo/Match.lean
+++ b/src/Lean/Elab/BuiltinDo/Match.lean
@@ -203,7 +203,8 @@ private def compileMatch (discrs : Array Term.Discr) (matchType : Expr) (lhss :
private def elabDoMatchCore (discrs : TSyntaxArray... | 12 | 2 | 14 | 8 | diff_derived | false | 643 | 3 | 0 | 0 | 1 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:08Z | extraction_pipeline_v2 |
LB-0034 | pr_completion | easy | 1.06 | google-deepmind/formal-conjectures | 3,689 | feat(ErdosProblems/890): solution for `parts.a` | https://github.com/google-deepmind/formal-conjectures/pull/3689 | erdos-problems,misformalization | b43e18e00ceca2c035a8f96a0614ab9a98a1fa54 | 71e3552f38b58a0fcb767b7a1809d4e4d237d235 | FormalConjectures/ErdosProblems/890.lean | FormalConjectures/ErdosProblems/890.lean | # Task: feat(ErdosProblems/890): solution for `parts.a`
## Files affected
- FormalConjectures/ErdosProblems/890.lean (+14/-4)
## Definitions to add
- `omegaGt` in `FormalConjectures/ErdosProblems/890.lean`: `omegaGt k n` counts the number of distinct prime factors of `n` that are strictly
## Verification
The patched... | diff --git a/FormalConjectures/ErdosProblems/890.lean b/FormalConjectures/ErdosProblems/890.lean
--- a/FormalConjectures/ErdosProblems/890.lean
+++ b/FormalConjectures/ErdosProblems/890.lean
@@ -30,18 +30,28 @@ open scoped Nat.Prime ArithmeticFunction.omega
namespace Erdos890
+/-- `omegaGt k n` counts the number o... | 14 | 4 | 18 | 7.5 | diff_derived | false | 0 | 1 | 0 | 0 | 1 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:08Z | extraction_pipeline_v2 |
LB-0035 | pr_completion | easy | 0.9 | google-deepmind/formal-conjectures | 3,837 | fix category for `erdos_602.variants.countable_index` | https://github.com/google-deepmind/formal-conjectures/pull/3837 | erdos-problems | b04c641045cdf650ea8f46c837ae2c7e37d17ee4 | 16ebd0c14787847ba1fa6e78b8b937cde74a3126 | FormalConjectures/ErdosProblems/602.lean | FormalConjectures/ErdosProblems/602.lean | # Task: fix category for `erdos_602.variants.countable_index`
## Files affected
- FormalConjectures/ErdosProblems/602.lean (+6/-4)
## Theorems to prove
### `erdos_602.variants.countable_index` in `FormalConjectures/ErdosProblems/602.lean`
```lean
theorem erdos_602.variants.countable_index : answer(True) ↔
```
## Ex... | diff --git a/FormalConjectures/ErdosProblems/602.lean b/FormalConjectures/ErdosProblems/602.lean
--- a/FormalConjectures/ErdosProblems/602.lean
+++ b/FormalConjectures/ErdosProblems/602.lean
@@ -146,10 +146,12 @@ theorem erdos_602.variants.disjoint : answer(True) ↔
/--
**Countable index set case.**
-If the index se... | 6 | 4 | 10 | 7.5 | diff_derived | false | 0 | 1 | 1 | 0 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:08Z | extraction_pipeline_v2 |
LB-0036 | pr_completion | medium | 4.6 | leanprover/lean4 | 13,497 | test: `grind` homomorphism demo | https://github.com/leanprover/lean4/pull/13497 | toolchain-available,changelog-other | f32106283fab28c339b2e3a0d0a5f606fd3175ae | e542810e793887d65f808ec3557b396a9b8597a1 | tests/pkg/homo/Homo.lean,tests/pkg/homo/Homo/Init.lean,tests/pkg/homo/lakefile.lean | tests/pkg/homo/Homo.lean | # Task: test: `grind` homomorphism demo
## Context
This PR adds an example for the Lean hackathon in Paris. It demonstrates how users can implement https://hackmd.io/Qd0nkWdzQImVe7TDGSAGbA
## Files affected
- tests/pkg/homo/Homo.lean (+25/-0)
- tests/pkg/homo/Homo/Init.lean (+96/-0)
- tests/pkg/homo/lakefile.lean (+5... | diff --git a/tests/pkg/homo/Homo.lean b/tests/pkg/homo/Homo.lean
--- /dev/null
+++ b/tests/pkg/homo/Homo.lean
@@ -0,0 +1,25 @@
+import Homo.Init
+
+set_option warn.sorry false
+
+opaque TSpec : (α : Type) × α := ⟨Unit, ()⟩
+abbrev T : Type := TSpec.1
+instance : Inhabited T := ⟨TSpec.2⟩
+opaque add : T → T → T
+opaque ... | 126 | 0 | 126 | 8 | diff_derived | false | 137 | 3 | 0 | 0 | 6 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:08Z | extraction_pipeline_v2 |
LB-0037 | pr_completion | easy | 0.34 | google-deepmind/formal-conjectures | 3,711 | feat(ErdosProblems/138): solution for `variants.difference` | https://github.com/google-deepmind/formal-conjectures/pull/3711 | erdos-problems,solution found | 89c6801f9f05cf63105d66843ed70b1e4ceb0c69 | c581a3ed545d8d1bafd0e4e68c044668c1f23f0b | FormalConjectures/ErdosProblems/138.lean | FormalConjectures/ErdosProblems/138.lean | # Task: feat(ErdosProblems/138): solution for `variants.difference`
## Files affected
- FormalConjectures/ErdosProblems/138.lean (+5/-2)
## Verification
The patched repository must compile with `lake build`. | diff --git a/FormalConjectures/ErdosProblems/138.lean b/FormalConjectures/ErdosProblems/138.lean
--- a/FormalConjectures/ErdosProblems/138.lean
+++ b/FormalConjectures/ErdosProblems/138.lean
@@ -107,10 +107,13 @@ theorem erdos_138.variants.quotient :
/--
In [Er81] Erdős asks whether $W(k+1) - W(k) \to \infty$.
+
+T... | 5 | 2 | 7 | 6 | diff_derived | false | 0 | 1 | 0 | 0 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:08Z | extraction_pipeline_v2 |
LB-0038 | pr_completion | easy | 1.02 | leanprover/lean4 | 13,494 | fix: pin `repeat`'s `numRegularExits` at `1` to match `for` | https://github.com/leanprover/lean4/pull/13494 | toolchain-available,changelog-language | eadf1404c576bebfbd79e023bd8b4d109daa7b8d | f32106283fab28c339b2e3a0d0a5f606fd3175ae | src/Lean/Elab/Do/InferControlInfo.lean,tests/elab/doControlInfoAggregate.lean | src/Lean/Elab/Do/InferControlInfo.lean | # Task: fix: pin `repeat`'s `numRegularExits` at `1` to match `for`
## Context
This PR stops the `repeat` inference handler from reporting `numRegularExits := 0` for break-less bodies. For break-less `repeat` the loop never terminates normally, so `0` looks more accurate semantically, but the loop expression still has... | diff --git a/src/Lean/Elab/Do/InferControlInfo.lean b/src/Lean/Elab/Do/InferControlInfo.lean
--- a/src/Lean/Elab/Do/InferControlInfo.lean
+++ b/src/Lean/Elab/Do/InferControlInfo.lean
@@ -132,20 +132,20 @@ partial def ofElem (stx : TSyntax `doElem) : TermElabM ControlInfo := do
| `(doElem| unless $_ do $elseSeq) =>
... | 23 | 8 | 31 | 6.5 | diff_derived | false | 641 | 2 | 0 | 0 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:08Z | extraction_pipeline_v2 |
LB-0039 | pr_completion | easy | 2.2 | google-deepmind/formal-conjectures | 3,797 | feat(GreensOpenProblems/57): solution for `z3_functional` | https://github.com/google-deepmind/formal-conjectures/pull/3797 | green-problems,solution found | 56da4398fab115e3bfa6934d4101e9a387d3bf9b | 3c334e1d5a7d39ca3f25c0a79c1f18fe9a2e10f2 | FormalConjectures/GreensOpenProblems/57.lean | FormalConjectures/GreensOpenProblems/57.lean | # Task: feat(GreensOpenProblems/57): solution for `z3_functional`
## Files affected
- FormalConjectures/GreensOpenProblems/57.lean (+37/-28)
## Theorems to prove
### `green_57.variants.z3` in `FormalConjectures/GreensOpenProblems/57.lean`
```lean
theorem green_57.variants.z3 :
```
Description: Do $\Phi(\mathbb{Z}/3\... | diff --git a/FormalConjectures/GreensOpenProblems/57.lean b/FormalConjectures/GreensOpenProblems/57.lean
--- a/FormalConjectures/GreensOpenProblems/57.lean
+++ b/FormalConjectures/GreensOpenProblems/57.lean
@@ -82,21 +82,6 @@ def Φ : Set (G → ℂ) :=
def Φ' : Set (G → ℂ) :=
convexHull ℝ (baseΦ' G)
-/--
-Is it true ... | 37 | 28 | 65 | 7.5 | diff_derived | false | 0 | 1 | 2 | 0 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | topology | 2026-04-28T12:40:08Z | extraction_pipeline_v2 |
LB-0040 | pr_completion | easy | 1.44 | leanprover/lean4 | 13,489 | fix: preserve nesting level across empty doc snippet | https://github.com/leanprover/lean4/pull/13489 | toolchain-available,changelog-language | e2f9df6578e9540249156c64c22f6743f0ceb7ce | bf269ce2501464b4e8587d9a704d66c111381b9f | src/Lean/DocString/Extension.lean,tests/elab/13485.lean | src/Lean/DocString/Extension.lean | # Task: fix: preserve nesting level across empty doc snippet
## Context
This PR fixes a bug where the nesting level in Verso Docstrings is forgotten when there's a doc comment with no headers.
It changes the `terminalNesting` of `VersoModuleDocs` to be recomputed rather than stored in the structure; we never want i... | diff --git a/src/Lean/DocString/Extension.lean b/src/Lean/DocString/Extension.lean
--- a/src/Lean/DocString/Extension.lean
+++ b/src/Lean/DocString/Extension.lean
@@ -289,9 +289,11 @@ instance : ToMarkdown VersoModuleDocs.Snippet where
structure VersoModuleDocs where
snippets : PersistentArray VersoModuleDocs.Sni... | 18 | 9 | 27 | 7.5 | diff_derived | false | 359 | 2 | 0 | 0 | 1 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | algebra | 2026-04-28T12:40:08Z | extraction_pipeline_v2 |
LB-0041 | pr_completion | hard | 7.6 | leanprover/lean4 | 13,260 | feat: server-side support for incremental diagnostics | https://github.com/leanprover/lean4/pull/13260 | toolchain-available,changelog-server | ec727859274c18a82f26dd66028e36f380fdd35c | 25bab8bcc4ec90ad369e0c4bdea471d9fe73636b | src/Lean/Data/Lsp/Capabilities.lean,src/Lean/Data/Lsp/Diagnostics.lean,src/Lean/Data/Lsp/Ipc.lean,src/Lean/Server/FileWorker.lean,src/Lean/Server/FileWorker/Utils.lean,src/Lean/Server/ProtocolOverview.lean,src/Lean/Server/Test/Runner.lean,src/Lean/Server/Utils.lean | src/Lean/Data/Lsp/Capabilities.lean | # Task: feat: server-side support for incremental diagnostics
## Context
This PR adds server-side support for incremental diagnostics via a new `isIncremental` field on `PublishDiagnosticsParams` that is only used by the language server when clients set `incrementalDiagnosticSupport` in `LeanClientCapabilities`.
#... | diff --git a/src/Lean/Data/Lsp/Capabilities.lean b/src/Lean/Data/Lsp/Capabilities.lean
--- a/src/Lean/Data/Lsp/Capabilities.lean
+++ b/src/Lean/Data/Lsp/Capabilities.lean
@@ -64,6 +64,12 @@ structure WorkspaceClientCapabilities where
deriving ToJson, FromJson
structure LeanClientCapabilities where
+ /--
+ Wheth... | 192 | 60 | 252 | 6.5 | diff_derived | false | 2,675 | 8 | 0 | 0 | 10 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:08Z | extraction_pipeline_v2 |
LB-0042 | pr_completion | easy | 0.84 | google-deepmind/formal-conjectures | 3,778 | feat(ErdosProblems/741): solution for `variants.upper` | https://github.com/google-deepmind/formal-conjectures/pull/3778 | erdos-problems,solution found | 64ba3ffbac2fa117022d4f836a0e34c9b7060ed7 | 35d48a8d3d416e1337823c03c7537223f99a2748 | FormalConjectures/ErdosProblems/741.lean | FormalConjectures/ErdosProblems/741.lean | # Task: feat(ErdosProblems/741): solution for `variants.upper`
## Files affected
- FormalConjectures/ErdosProblems/741.lean (+5/-2)
## Theorems to prove
### `erdos_741.variants.upper` in `FormalConjectures/ErdosProblems/741.lean`
```lean
theorem erdos_741.variants.upper : answer(True) ↔ ∀ A : Set ℕ, 0 < upperDensity... | diff --git a/FormalConjectures/ErdosProblems/741.lean b/FormalConjectures/ErdosProblems/741.lean
--- a/FormalConjectures/ErdosProblems/741.lean
+++ b/FormalConjectures/ErdosProblems/741.lean
@@ -61,9 +61,12 @@ theorem erdos_741.variants.lower : answer(sorry) ↔ ∀ A : Set ℕ, 0 < lowerD
Let $A\subseteq \mathbb{N}$ be suc... | 5 | 2 | 7 | 7.5 | diff_derived | false | 0 | 1 | 1 | 0 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:08Z | extraction_pipeline_v2 |
LB-0043 | pr_completion | easy | 1.9 | leanprover/lean4 | 13,486 | fix: aggregate `ControlInfo` past `numRegularExits == 0` elements | https://github.com/leanprover/lean4/pull/13486 | toolchain-available,changelog-language | a0b2e1f3021b89acb33e2e65488c2f8e1993a52c | a3cb98bb273d30a09887b1f26c93ea8ab0fc4de9 | src/Lean/Elab/Do/InferControlInfo.lean,tests/elab/doControlInfoAggregate.lean | src/Lean/Elab/Do/InferControlInfo.lean | # Task: fix: aggregate `ControlInfo` past `numRegularExits == 0` elements
## Context
This PR fixes `inferControlInfoSeq` and `ControlInfo.sequence` to keep aggregating `breaks`/`continues`/`returnsEarly`/`reassigns` past elements whose `ControlInfo` reports `numRegularExits := 0`. Previously the analysis short-circuit... | diff --git a/src/Lean/Elab/Do/InferControlInfo.lean b/src/Lean/Elab/Do/InferControlInfo.lean
--- a/src/Lean/Elab/Do/InferControlInfo.lean
+++ b/src/Lean/Elab/Do/InferControlInfo.lean
@@ -35,12 +35,14 @@ structure ControlInfo where
def ControlInfo.pure : ControlInfo := {}
-def ControlInfo.sequence (a b : ControlInf... | 74 | 21 | 95 | 8 | diff_derived | false | 941 | 2 | 0 | 0 | 1 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:08Z | extraction_pipeline_v2 |
LB-0044 | pr_completion | medium | 5.1 | google-deepmind/formal-conjectures | 3,830 | feat: add a few `formal_proof` | https://github.com/google-deepmind/formal-conjectures/pull/3830 | erdos-problems,wikipedia | a7daca9863c9f95c0775caca2e21a1db258a87b6 | ccd5ee75ee07b9aba389fd1e0647806de3f0abc9 | FormalConjectures/ErdosProblems/12.lean,FormalConjectures/ErdosProblems/267.lean,FormalConjectures/ErdosProblems/346.lean,FormalConjectures/ErdosProblems/36.lean,FormalConjectures/ErdosProblems/366.lean,FormalConjectures/ErdosProblems/56.lean,FormalConjectures/ErdosProblems/68.lean,FormalConjectures/Wikipedia/AgohGiuga... | FormalConjectures/ErdosProblems/12.lean | # Task: feat: add a few `formal_proof`
## Files affected
- FormalConjectures/ErdosProblems/12.lean (+5/-2)
- FormalConjectures/ErdosProblems/267.lean (+4/-2)
- FormalConjectures/ErdosProblems/346.lean (+4/-2)
- FormalConjectures/ErdosProblems/36.lean (+2/-1)
- FormalConjectures/ErdosProblems/366.lean (+5/-3)
- FormalC... | diff --git a/FormalConjectures/ErdosProblems/12.lean b/FormalConjectures/ErdosProblems/12.lean
--- a/FormalConjectures/ErdosProblems/12.lean
+++ b/FormalConjectures/ErdosProblems/12.lean
@@ -34,8 +34,11 @@ abbrev IsGood (A : Set ℕ) : Prop := A.Infinite ∧
∀ᵉ (a ∈ A) (b ∈ A) (c ∈ A), a ∣ b + c → a < b →
a < c → b =... | 40 | 15 | 55 | 5.5 | diff_derived | false | 0 | 8 | 5 | 0 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:08Z | extraction_pipeline_v2 |
LB-0045 | pr_completion | easy | 0.88 | leanprover/lean4 | 13,480 | [Backport releases/v4.30.0] feat: `Runtime.hold` | https://github.com/leanprover/lean4/pull/13480 | 3dc1a088b6d2d8eafe25a7cd7ec7b58d731bd7cc | 501ca3c187882a80cccb7ed979338c8353846571 | src/Init/System/IO.lean | src/Init/System/IO.lean | # Task: [Backport releases/v4.30.0] feat: `Runtime.hold`
## Context
Backport c16e88644cbe3efb47f13a6818cb07932b5771b8 from #13270.
## Files affected
- src/Init/System/IO.lean (+9/-0)
## Definitions to add
- `Runtime.hold` in `src/Init/System/IO.lean`
```lean
def Runtime.hold (a : @& α) : BaseIO Unit := return
... | diff --git a/src/Init/System/IO.lean b/src/Init/System/IO.lean
--- a/src/Init/System/IO.lean
+++ b/src/Init/System/IO.lean
@@ -1880,3 +1880,12 @@ lead to undefined behavior.
-/
@[extern "lean_runtime_forget"]
def Runtime.forget (a : α) : BaseIO Unit := return
+
+set_option linter.unusedVariables false in
+/--
+Ensur... | 9 | 0 | 9 | 7.5 | diff_derived | false | 62 | 1 | 0 | 0 | 1 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:08Z | extraction_pipeline_v2 | |
LB-0046 | pr_completion | easy | 2.2 | google-deepmind/formal-conjectures | 3,663 | feat(Paper.MonochromaticQuantumGraph): avoid increasing limits | https://github.com/google-deepmind/formal-conjectures/pull/3663 | 9ae988b398e823cea45955e5cf23e87e33244b2f | f5549cf064ab94d4682f92f89561d9a3a3d582a8 | FormalConjectures/Paper/MonochromaticQuantumGraph.lean | FormalConjectures/Paper/MonochromaticQuantumGraph.lean | # Task: feat(Paper.MonochromaticQuantumGraph): avoid increasing limits
## Files affected
- FormalConjectures/Paper/MonochromaticQuantumGraph.lean (+51/-44)
## Definitions to add
- `instDecidableEqSystemN` in `FormalConjectures/Paper/MonochromaticQuantumGraph.lean`: Instance: `EqSystemN N D W` is decidable when `α` ha... | diff --git a/FormalConjectures/Paper/MonochromaticQuantumGraph.lean b/FormalConjectures/Paper/MonochromaticQuantumGraph.lean
--- a/FormalConjectures/Paper/MonochromaticQuantumGraph.lean
+++ b/FormalConjectures/Paper/MonochromaticQuantumGraph.lean
@@ -196,9 +196,16 @@ def EqSystemN {α : Type} [Semiring α] (N D : Nat) (W... | 51 | 44 | 95 | 7.5 | diff_derived | false | 0 | 1 | 0 | 0 | 2 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | combinatorics | 2026-04-28T12:40:08Z | extraction_pipeline_v2 | |
LB-0047 | pr_completion | easy | 0.88 | leanprover/lean4 | 13,270 | feat: `Runtime.hold` | https://github.com/leanprover/lean4/pull/13270 | toolchain-available,changelog-compiler,backport releases/v4.30.0 | da91aed2e2cc13d8c9463511b2f1833f7c961cc4 | c16e88644cbe3efb47f13a6818cb07932b5771b8 | src/Init/System/IO.lean | src/Init/System/IO.lean | # Task: feat: `Runtime.hold`
## Context
This PR adds `Runtime.hold`, which ensures its argument remains alive until the callsite by holding a reference to it. This can be useful for unsafe code (such as an FFI) that relies on a Lean object not being freed until after some point in the program.
It is implemented vi... | diff --git a/src/Init/System/IO.lean b/src/Init/System/IO.lean
--- a/src/Init/System/IO.lean
+++ b/src/Init/System/IO.lean
@@ -1880,3 +1880,12 @@ lead to undefined behavior.
-/
@[extern "lean_runtime_forget"]
def Runtime.forget (a : α) : BaseIO Unit := return
+
+set_option linter.unusedVariables false in
+/--
+Ensur... | 9 | 0 | 9 | 8 | diff_derived | false | 359 | 1 | 0 | 0 | 1 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:08Z | extraction_pipeline_v2 |
LB-0048 | pr_completion | easy | 1.06 | google-deepmind/formal-conjectures | 3,823 | fix(WOWII): Fix conjecture 22 | https://github.com/google-deepmind/formal-conjectures/pull/3823 | 5a1278d55188365c34d54cbc5f0818d64369f0ac | a7daca9863c9f95c0775caca2e21a1db258a87b6 | FormalConjectures/WrittenOnTheWallII/GraphConjecture23.lean | FormalConjectures/WrittenOnTheWallII/GraphConjecture23.lean | # Task: fix(WOWII): Fix conjecture 22
## Context
# Description
I might have caught a couple quick fixes in `WrittenOnTheWallII`:
1. The implementation in `GraphConjecture22.lean` stated `b(G) ≥ ⌊α(G) + dist_avg(M, V)⌋`, which does not match
Conjecture 22 described as `CEIL(2dist(B,V)))≥ CEIL(2distavg(V))` at http:... | diff --git a/FormalConjectures/WrittenOnTheWallII/GraphConjecture23.lean b/FormalConjectures/WrittenOnTheWallII/GraphConjecture23.lean
--- a/FormalConjectures/WrittenOnTheWallII/GraphConjecture23.lean
+++ b/FormalConjectures/WrittenOnTheWallII/GraphConjecture23.lean
@@ -17,30 +17,34 @@ limitations under the License.
i... | 11 | 7 | 18 | 8.5 | diff_derived | false | 935 | 1 | 1 | 0 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | combinatorics | 2026-04-28T12:40:09Z | extraction_pipeline_v2 | |
LB-0049 | pr_completion | easy | 0.24 | google-deepmind/formal-conjectures | 3,822 | fix(linting): Remove unused simp arguments | https://github.com/google-deepmind/formal-conjectures/pull/3822 | 880c27eb03fc2246f38abb8191e09bcc9a079e4a | 5a1278d55188365c34d54cbc5f0818d64369f0ac | FormalConjecturesForMathlib/Combinatorics/SimpleGraph/GraphConjectures/Invariants.lean | FormalConjecturesForMathlib/Combinatorics/SimpleGraph/GraphConjectures/Invariants.lean | # Task: fix(linting): Remove unused simp arguments
## Context
# Description
Fixes a couple unused `simp` arguments in `FormalConjecturesForMathlib` for a warning-free full build.
# Testing
**After**
```shell
$ lake build
Build completed successfully (8658 jobs).
```
**Before**
```shell
$ lake build
⚠ [7... | diff --git a/FormalConjecturesForMathlib/Combinatorics/SimpleGraph/GraphConjectures/Invariants.lean b/FormalConjecturesForMathlib/Combinatorics/SimpleGraph/GraphConjectures/Invariants.lean
--- a/FormalConjecturesForMathlib/Combinatorics/SimpleGraph/GraphConjectures/Invariants.lean
+++ b/FormalConjecturesForMathlib/Comb... | 1 | 1 | 2 | 7 | diff_derived | false | 1,149 | 1 | 0 | 0 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | combinatorics | 2026-04-28T12:40:09Z | extraction_pipeline_v2 | |
LB-0050 | pr_completion | easy | 2.6 | leanprover/lean4 | 13,476 | fix: filter assigned metavariables before computing `apply` subgoal tags | https://github.com/leanprover/lean4/pull/13476 | toolchain-available,changelog-tactics | 1d2cfb47e7f04bac3c384a60e5775ee66ebd3c34 | e82cd9b62c96f0276825d694f4539bb9f3376b8d | src/Lean/Elab/Tactic/BuiltinTactic.lean,src/Lean/Meta/Tactic/Apply.lean,src/Lean/Meta/Tactic/Rewrite.lean,tests/elab/2042.lean,tests/elab/apply_subgoal_name_issue.lean,tests/elab/inductionCheckAltNames.lean,tests/elab/meta.lean,tests/elab/rflTacticErrors.lean | src/Lean/Elab/Tactic/BuiltinTactic.lean | # Task: fix: filter assigned metavariables before computing `apply` subgoal tags
## Context
This PR refines how the `apply` tactic (and related tactics like `rewrite`) name and tag the remaining subgoals. Assigned metavariables are now filtered out *before* computing subgoal tags. As a consequence, when only one unass... | diff --git a/src/Lean/Elab/Tactic/BuiltinTactic.lean b/src/Lean/Elab/Tactic/BuiltinTactic.lean
--- a/src/Lean/Elab/Tactic/BuiltinTactic.lean
+++ b/src/Lean/Elab/Tactic/BuiltinTactic.lean
@@ -497,14 +497,21 @@ def forEachVar (hs : Array Syntax) (tac : MVarId → FVarId → MetaM MVarId) :
/--
Searches for a metavariable... | 35 | 16 | 51 | 4.5 | diff_derived | false | 985 | 8 | 0 | 0 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:09Z | extraction_pipeline_v2 |
LB-0051 | pr_completion | easy | 3.4 | leanprover/lean4 | 13,475 | feat: store eqn-affecting options at definition time instead of eager generation | https://github.com/leanprover/lean4/pull/13475 | changelog-language | 2d38a70d1cd8602eefdd05a23cfa3e3f733837b8 | 1d2cfb47e7f04bac3c384a60e5775ee66ebd3c34 | src/Lean/Elab/PreDefinition/Basic.lean,src/Lean/Elab/PreDefinition/EqUnfold.lean,src/Lean/Elab/PreDefinition/Eqns.lean,src/Lean/Elab/PreDefinition/Mutual.lean,src/Lean/Elab/PreDefinition/Structural/Eqns.lean,src/Lean/Elab/PreDefinition/Structural/Main.lean,src/Lean/Meta/Eqns.lean | src/Lean/Elab/PreDefinition/Basic.lean | # Task: feat: store eqn-affecting options at definition time instead of eager generation
## Context
This PR replaces the eager equation realization that was triggered by
non-default values of equation-affecting options (like
`backward.eqns.nonrecursive`) with a `MapDeclarationExtension` that
stores non-default option ... | diff --git a/src/Lean/Elab/PreDefinition/Basic.lean b/src/Lean/Elab/PreDefinition/Basic.lean
--- a/src/Lean/Elab/PreDefinition/Basic.lean
+++ b/src/Lean/Elab/PreDefinition/Basic.lean
@@ -222,8 +222,8 @@ private def addNonRecAux (docCtx : LocalContext × LocalInstances) (preDef : Pre
if compile && shouldGenCodeFor p... | 47 | 20 | 67 | 6 | diff_derived | false | 1,153 | 7 | 0 | 0 | 2 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:09Z | extraction_pipeline_v2 |
LB-0052 | pr_completion | medium | 6.6 | google-deepmind/formal-conjectures | 3,660 | feat(Test): computational graph invariants, prove 25 tests | https://github.com/google-deepmind/formal-conjectures/pull/3660 | 9e1a06125c323cb6ceb5e272d1abc3fa7923e107 | 8a8be417c73f00747a2f6f925c9bf5b3e147e819 | FormalConjectures/WrittenOnTheWallII/Test.lean,FormalConjecturesForMathlib/Combinatorics/SimpleGraph/GraphConjectures/Definitions.lean,FormalConjecturesForMathlib/Combinatorics/SimpleGraph/GraphConjectures/Invariants.lean | FormalConjectures/WrittenOnTheWallII/Test.lean | # Task: feat(Test): computational graph invariants, prove 25 tests
## Files affected
- FormalConjectures/WrittenOnTheWallII/Test.lean (+34/-25)
- FormalConjecturesForMathlib/Combinatorics/SimpleGraph/GraphConjectures/Definitions.lean (+57/-0)
- FormalConjecturesForMathlib/Combinatorics/SimpleGraph/GraphConjectures/Inv... | diff --git a/FormalConjectures/WrittenOnTheWallII/Test.lean b/FormalConjectures/WrittenOnTheWallII/Test.lean
--- a/FormalConjectures/WrittenOnTheWallII/Test.lean
+++ b/FormalConjectures/WrittenOnTheWallII/Test.lean
@@ -36,6 +36,10 @@ open SimpleGraph
open Classical
+-- Bridge theorems for Sym2/edist-based invarian... | 383 | 25 | 408 | 6.5 | diff_derived | false | 0 | 3 | 6 | 0 | 9 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | combinatorics | 2026-04-28T12:40:09Z | extraction_pipeline_v2 | |
LB-0053 | pr_completion | easy | 0.6 | leanprover/lean4 | 13,474 | fix: prune goals assigned by `isDefEq` in `sym =>` mode | https://github.com/leanprover/lean4/pull/13474 | changelog-tactics | 2d38a70d1cd8602eefdd05a23cfa3e3f733837b8 | 439e6a85d3eb0f85288913b28b44c56fd932d88f | src/Lean/Elab/Tactic/Grind/Basic.lean,tests/elab/sym_interactive_bugs.lean | src/Lean/Elab/Tactic/Grind/Basic.lean | # Task: fix: prune goals assigned by `isDefEq` in `sym =>` mode
## Context
This PR fixes a bug in `sym =>` interactive mode where goals whose metavariable was assigned by `isDefEq` (e.g. via `apply Eq.refl`) were not pruned. `pruneSolvedGoals` previously only filtered out goals flagged as inconsistent, so an already-a... | diff --git a/src/Lean/Elab/Tactic/Grind/Basic.lean b/src/Lean/Elab/Tactic/Grind/Basic.lean
--- a/src/Lean/Elab/Tactic/Grind/Basic.lean
+++ b/src/Lean/Elab/Tactic/Grind/Basic.lean
@@ -68,7 +68,10 @@ def setGoals (goals : List Goal) : GrindTacticM Unit :=
def pruneSolvedGoals : GrindTacticM Unit := do
let gs ← getG... | 9 | 1 | 10 | 6 | diff_derived | false | 356 | 2 | 0 | 0 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:09Z | extraction_pipeline_v2 |
LB-0054 | pr_completion | easy | 2.4 | google-deepmind/formal-conjectures | 3,805 | feat: add Erdos 7 & 701 | https://github.com/google-deepmind/formal-conjectures/pull/3805 | erdos-problems | e6ccabe7bbeecc5c51c5e93152ad2c4acfbff039 | a626bc232b98511960f3b5a8ab179be523b6bd8c | FormalConjectures/ErdosProblems/7.lean,FormalConjectures/ErdosProblems/701.lean | FormalConjectures/ErdosProblems/7.lean | # Task: Erdős Problem 7: covering system, all moduli odd?
## Issue
### What is the conjecture
Is there a covering system all of whose moduli are odd?
Status: open
### Prerequisites needed
Needs definition of "covering system"
### [AMS categories](https://github.com/google-deepmind/formal-conjectures/labels?q=ams-... | diff --git a/FormalConjectures/ErdosProblems/7.lean b/FormalConjectures/ErdosProblems/7.lean
--- /dev/null
+++ b/FormalConjectures/ErdosProblems/7.lean
@@ -0,0 +1,38 @@
+/-
+Copyright 2025 The Formal Conjectures Authors.
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file excep... | 81 | 0 | 81 | 8.5 | linked_issue | true | 23 | 2 | 2 | 0 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:09Z | extraction_pipeline_v2 |
LB-0055 | pr_completion | easy | 2.24 | leanprover/lean4 | 13,472 | fix: auto-introduce in `sym =>` mode when goal closes during preprocessing | https://github.com/leanprover/lean4/pull/13472 | changelog-tactics | 80cbab16420b90104647a795a18f9890fd8150e8 | 2d38a70d1cd8602eefdd05a23cfa3e3f733837b8 | src/Lean/Elab/Tactic/Grind/Basic.lean,src/Lean/Elab/Tactic/Grind/BuiltinTactic.lean,tests/elab/sym_interactive_bugs.lean | src/Lean/Elab/Tactic/Grind/Basic.lean | # Task: fix: auto-introduce in `sym =>` mode when goal closes during preprocessing
## Context
This PR fixes a bug in `sym =>` interactive mode where satellite solvers (`lia`, `ring`, `linarith`) would throw an internal error if their automatic `intros + assertAll` preprocessing step already closed the goal. Previously... | diff --git a/src/Lean/Elab/Tactic/Grind/Basic.lean b/src/Lean/Elab/Tactic/Grind/Basic.lean
--- a/src/Lean/Elab/Tactic/Grind/Basic.lean
+++ b/src/Lean/Elab/Tactic/Grind/Basic.lean
@@ -329,13 +329,19 @@ def liftGoalM (k : GoalM α) : GrindTacticM α := do
replaceMainGoal [goal]
return a
-def liftAction (a : Action)... | 28 | 4 | 32 | 8 | diff_derived | false | 525 | 3 | 0 | 0 | 2 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:09Z | extraction_pipeline_v2 |
LB-0056 | pr_completion | easy | 2.9 | google-deepmind/formal-conjectures | 3,800 | Add D = N open special case for monochromatic quantum graph | https://github.com/google-deepmind/formal-conjectures/pull/3800 | e08558f346cbf8134e6c198d5cba9bff23b354fa | e6ccabe7bbeecc5c51c5e93152ad2c4acfbff039 | FormalConjectures/Paper/MonochromaticQuantumGraph.lean | FormalConjectures/Paper/MonochromaticQuantumGraph.lean | # Task: Add D = N open special case for monochromatic quantum graph
## Context
You have solutions for N=D, for N=4,6,8,10. Strongly indicates to a generalizable pattern.
## Files affected
- FormalConjectures/Paper/MonochromaticQuantumGraph.lean (+35/-0)
## Theorems to prove
### `eqSystem_no_solution_even_ge4_d_eq_n... | diff --git a/FormalConjectures/Paper/MonochromaticQuantumGraph.lean b/FormalConjectures/Paper/MonochromaticQuantumGraph.lean
--- a/FormalConjectures/Paper/MonochromaticQuantumGraph.lean
+++ b/FormalConjectures/Paper/MonochromaticQuantumGraph.lean
@@ -518,6 +518,15 @@ theorem eqSystem16_no_solution_d3 :
¬ ∃ W : W... | 35 | 0 | 35 | 8 | diff_derived | false | 90 | 1 | 4 | 0 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | combinatorics | 2026-04-28T12:40:09Z | extraction_pipeline_v2 | |
LB-0057 | pr_completion | medium | 5.7 | google-deepmind/formal-conjectures | 3,761 | feat(GreensOpenProblems): 38 | https://github.com/google-deepmind/formal-conjectures/pull/3761 | green-problems | 6b416f9a6b24ec05e3db85859860c6902fe3e0fc | e08558f346cbf8134e6c198d5cba9bff23b354fa | FormalConjectures/GreensOpenProblems/38.lean | FormalConjectures/GreensOpenProblems/38.lean | # Task: feat(GreensOpenProblems): 38
## Context
# Description
> What is the largest subset $A \subset \mathbb{F}_7^n$ for which $A - A$ intersects $\lbrace -1, 0, 1\rbrace^n$ only at $0$?
- Closes #1594
- According to [[La79]](https://people.orie.cornell.edu/miketodd/cornellonly/or637/lovshannon.pdf) and [[Po20]]... | diff --git a/FormalConjectures/GreensOpenProblems/38.lean b/FormalConjectures/GreensOpenProblems/38.lean
--- /dev/null
+++ b/FormalConjectures/GreensOpenProblems/38.lean
@@ -0,0 +1,122 @@
+/-
+Copyright 2026 The Formal Conjectures Authors.
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not ... | 122 | 0 | 122 | 9 | diff_derived | false | 832 | 1 | 7 | 0 | 2 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | topology | 2026-04-28T12:40:09Z | extraction_pipeline_v2 |
LB-0058 | pr_completion | easy | 3 | leanprover/lean4 | 13,453 | fix: kernel error in `grind` order module for `Nat` casts to non-`Int` types | https://github.com/leanprover/lean4/pull/13453 | toolchain-available,changelog-tactics | 9c245d5531ad28fb491b3febdf7223134fdce1af | 70df9742f4aeba78da72434dff4bdcf26c600a56 | src/Init/Grind/Order.lean,src/Lean/Meta/Tactic/Grind/Order/Assert.lean,src/Lean/Meta/Tactic/Grind/Order/Internalize.lean,src/Lean/Meta/Tactic/Grind/Order/Types.lean,tests/elab/grind_order_eq.lean | src/Init/Grind/Order.lean | # Task: fix: kernel error in `grind` order module for `Nat` casts to non-`Int` types
## Context
This PR fixes a kernel error in `grind` when propagating a `Nat` equality to an order structure whose carrier type is not `Int` (e.g. `Rat`). The auxiliary `Lean.Grind.Order.of_nat_eq` lemma was specialized to `Int`, so the... | diff --git a/src/Init/Grind/Order.lean b/src/Init/Grind/Order.lean
--- a/src/Init/Grind/Order.lean
+++ b/src/Init/Grind/Order.lean
@@ -75,6 +75,9 @@ theorem nat_eq (a b : Nat) (x y : Int) : NatCast.natCast a = x → NatCast.natCa
theorem of_nat_eq (a b : Nat) (x y : Int) : NatCast.natCast a = x → NatCast.natCast b = y →... | 41 | 18 | 59 | 7.5 | diff_derived | false | 769 | 5 | 1 | 0 | 1 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:09Z | extraction_pipeline_v2 |
LB-0059 | pr_completion | medium | 5.7 | google-deepmind/formal-conjectures | 2,199 | feat(ErdosProblems): 535 | https://github.com/google-deepmind/formal-conjectures/pull/2199 | erdos-problems | ae2e80083a76ffc649a46fcdc39496386451db47 | 56da4398fab115e3bfa6934d4101e9a387d3bf9b | FormalConjectures/ErdosProblems/535.lean | FormalConjectures/ErdosProblems/535.lean | # Task: feat(ErdosProblems): 535
## Context
Closes https://github.com/google-deepmind/formal-conjectures/issues/776 with the help of claude code.
## Files affected
- FormalConjectures/ErdosProblems/535.lean (+138/-0)
## Theorems to prove
### `erdos_535` in `FormalConjectures/ErdosProblems/535.lean`
```lean
theorem ... | diff --git a/FormalConjectures/ErdosProblems/535.lean b/FormalConjectures/ErdosProblems/535.lean
--- /dev/null
+++ b/FormalConjectures/ErdosProblems/535.lean
@@ -0,0 +1,138 @@
+/-
+Copyright 2026 The Formal Conjectures Authors.
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this fil... | 138 | 0 | 138 | 8.5 | diff_derived | false | 101 | 1 | 7 | 0 | 2 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:09Z | extraction_pipeline_v2 |
LB-0060 | pr_completion | easy | 0.98 | leanprover/lean4 | 13,452 | test: add regression test for `Sym.simp` eta-reduction (#13416) | https://github.com/leanprover/lean4/pull/13452 | toolchain-available,changelog-no | 2964193af8f2e45ae05c0ce4b1bffa2e5a4331f8 | 9c245d5531ad28fb491b3febdf7223134fdce1af | tests/elab/sym_issue_13416.lean | tests/elab/sym_issue_13416.lean | # Task: test: add regression test for `Sym.simp` eta-reduction (#13416)
## Context
This PR adds a direct regression test for issue #13416. It exercises `Std.HashMap.getElem_insert`, whose `dom` argument is a lambda closing over pattern variables, and checks that the discrimination tree lookup finds the theorem once th... | diff --git a/tests/elab/sym_issue_13416.lean b/tests/elab/sym_issue_13416.lean
--- /dev/null
+++ b/tests/elab/sym_issue_13416.lean
@@ -0,0 +1,39 @@
+import Lean.Meta.Sym
+import Std.Data.HashMap.Lemmas
+
+open Lean Meta Sym Simp in
+/--
+info: lhs: (Std.HashMap.emptyWithCapacity.insert "foo" 42)["foo"]
+---
+info: disc... | 39 | 0 | 39 | 7 | diff_derived | false | 491 | 1 | 0 | 0 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:10Z | extraction_pipeline_v2 |
LB-0061 | pr_completion | easy | 1.5 | google-deepmind/formal-conjectures | 3,772 | feat(ErdosProblems): add 52 | https://github.com/google-deepmind/formal-conjectures/pull/3772 | erdos-problems | b1224fa8bf5d75427c7399105dcf4e78706f7a57 | ae2e80083a76ffc649a46fcdc39496386451db47 | FormalConjectures/ErdosProblems/52.lean | FormalConjectures/ErdosProblems/52.lean | # Task: Erdős Problem 52: An Erdős-Szemerédi sum-product conjecture
## Issue
### What is the conjecture
https://www.erdosproblems.com/52
Let $A$ be a finite set of integers. Is it true that for every $\epsilon>0$
$$\max( \lvert A+A\rvert,\lvert AA\rvert)\gg_\epsilon \lvert A\rvert^{2-\epsilon}?$$
### Prerequi... | diff --git a/FormalConjectures/ErdosProblems/52.lean b/FormalConjectures/ErdosProblems/52.lean
--- /dev/null
+++ b/FormalConjectures/ErdosProblems/52.lean
@@ -0,0 +1,40 @@
+/-
+Copyright 2026 The Formal Conjectures Authors.
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file ex... | 40 | 0 | 40 | 9 | linked_issue | true | 10 | 1 | 1 | 0 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:10Z | extraction_pipeline_v2 |
LB-0062 | pr_completion | easy | 1.2 | leanprover/lean4 | 13,451 | fix: avoid assigning mvar when `Sym.intros` produces no binders | https://github.com/leanprover/lean4/pull/13451 | changelog-tactics | 8a9a5ebd5e4c9ed3b5e6c17f11d09bdd29b816e5 | 2964193af8f2e45ae05c0ce4b1bffa2e5a4331f8 | src/Lean/Meta/Sym/Intro.lean,tests/elab/sym_intro_issue.lean | src/Lean/Meta/Sym/Intro.lean | # Task: fix: avoid assigning mvar when `Sym.intros` produces no binders
## Context
This PR fixes a bug in `Sym.introCore.finalize` where the original metavariable was unconditionally assigned via a delayed assignment, even when no binders were introduced. As a result, `Sym.intros` would return `.failed` while the goal... | diff --git a/src/Lean/Meta/Sym/Intro.lean b/src/Lean/Meta/Sym/Intro.lean
--- a/src/Lean/Meta/Sym/Intro.lean
+++ b/src/Lean/Meta/Sym/Intro.lean
@@ -48,6 +48,8 @@ def introCore (mvarId : MVarId) (max : Nat) (names : Array Name) : SymM (Array F
assignDelayedMVar auxMVar.mvarId! fvars mvarId'
mvarId.assign val
... | 40 | 0 | 40 | 6.5 | diff_derived | false | 435 | 2 | 0 | 0 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:10Z | extraction_pipeline_v2 |
LB-0063 | pr_completion | easy | 1.6 | google-deepmind/formal-conjectures | 3,771 | feat(ErdosProblems): add 15 | https://github.com/google-deepmind/formal-conjectures/pull/3771 | erdos-problems | 5996f24dd1a17fe5cb9a3fa5013d9ca292332e7d | ec9482be965e7ed7801e8da4ad1958f0328d0a35 | FormalConjectures/ErdosProblems/15.lean | FormalConjectures/ErdosProblems/15.lean | # Task: Erdős Problem 15: Convergence of a sum involving prime reciprocals
## Issue
### What is the conjecture
https://www.erdosproblems.com/15
Is it true that
$$\sum_{n=1}^\infty(-1)^n\frac{n}{p_n}$$
converges, where $p_n$ is the sequence of primes?
Status: open
### Prerequisites needed
None needed. The so... | diff --git a/FormalConjectures/ErdosProblems/15.lean b/FormalConjectures/ErdosProblems/15.lean
--- /dev/null
+++ b/FormalConjectures/ErdosProblems/15.lean
@@ -0,0 +1,45 @@
+/-
+Copyright 2026 The Formal Conjectures Authors.
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file ex... | 45 | 0 | 45 | 9 | linked_issue | true | 10 | 1 | 1 | 0 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:10Z | extraction_pipeline_v2 |
LB-0064 | pr_completion | easy | 0.76 | leanprover/lean4 | 13,367 | fix: prevent a hang in acLt | https://github.com/leanprover/lean4/pull/13367 | builds-mathlib,toolchain-available,changelog-language,mathlib4-nightly-available | d53b46a0f3a7d0822550f4179ca3dab446a3c448 | 43e96b119d9911d5424c7a493ebcc50321f2e8f7 | src/Lean/Meta/ACLt.lean,tests/elab/acLt_timeout.lean | src/Lean/Meta/ACLt.lean | # Task: fix: prevent a hang in acLt
## Context
This PR removes some cases where `simp` would significantly overrun a timeout.
This is a little tricky to test cleanly; using mathlib's `#count_heartbeats` as
```lean4
#count_heartbeats in
set_option maxHeartbeats 200000 in
example (k : Nat) (a : Fin (1 + k + 1) → ... | diff --git a/src/Lean/Meta/ACLt.lean b/src/Lean/Meta/ACLt.lean
--- a/src/Lean/Meta/ACLt.lean
+++ b/src/Lean/Meta/ACLt.lean
@@ -175,6 +175,7 @@ where
return !(← allChildrenLt a b)
lpo (a b : Expr) : MetaM Bool := do
+ checkSystem "Lean.Meta.acLt"
-- Case 1: `a < b` if for some child `b_i` of `b`, we ha... | 18 | 0 | 18 | 6.5 | diff_derived | false | 598 | 2 | 0 | 0 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:10Z | extraction_pipeline_v2 |
LB-0065 | pr_completion | medium | 5.9 | google-deepmind/formal-conjectures | 3,753 | feat(Util): add docstring linter for open and solved research problems | https://github.com/google-deepmind/formal-conjectures/pull/3753 | linter | 0564135272ad8062ed77428077e8c0fc18c322ba | 56d37f891ad21895b9b1020192e15b9f7484b26f | FormalConjectures/Util/Linters/CategoryDocstringLinter.lean,FormalConjectures/Util/Linters/CategoryDocstringLinterTest.lean | FormalConjectures/Util/Linters/CategoryDocstringLinter.lean | # Task: Linter for Docstrings Research Solved / Open
## Issue
We currently only a have a linter for Module Docstrings. As the website also displays Research Solved / Open Docstrings for additional information it makes sense to also lint for them.
# Task: feat(Util): add docstring linter for open and solved research p... | diff --git a/FormalConjectures/Util/Linters/CategoryDocstringLinter.lean b/FormalConjectures/Util/Linters/CategoryDocstringLinter.lean
--- /dev/null
+++ b/FormalConjectures/Util/Linters/CategoryDocstringLinter.lean
@@ -0,0 +1,87 @@
+/-
+Copyright 2026 The Formal Conjectures Authors.
+
+Licensed under the Apache License... | 147 | 0 | 147 | 9 | linked_issue | true | 12 | 2 | 4 | 0 | 5 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | algebra | 2026-04-28T12:40:10Z | extraction_pipeline_v2 |
LB-0066 | pr_completion | easy | 3.3 | leanprover/lean4 | 13,448 | fix: eta-reduce patterns containing loose pattern variables | https://github.com/leanprover/lean4/pull/13448 | changelog-tactics | 234267b08aed5033113c4f7712652bba13a4bae5 | 1af697a44b90bc557a3f135e016190bf7c5ec53b | src/Lean/Meta/Sym/Eta.lean,tests/elab/sym_eta_mwe.lean,tests/elab/sym_pattern_2.lean,tests/elab/sym_simp_1.lean | src/Lean/Meta/Sym/Eta.lean | # Task: fix: eta-reduce patterns containing loose pattern variables
## Context
This PR fixes a regression in `Sym.simp` where rewrite rules whose LHS contains a lambda over a pattern variable (e.g. `∃ x, a = x`) failed to match targets with semantically equivalent structure.
`Sym.etaReduceAux` previously refused any ... | diff --git a/src/Lean/Meta/Sym/Eta.lean b/src/Lean/Meta/Sym/Eta.lean
--- a/src/Lean/Meta/Sym/Eta.lean
+++ b/src/Lean/Meta/Sym/Eta.lean
@@ -9,19 +9,37 @@ public import Lean.Meta.Sym.ExprPtr
public import Lean.Meta.Basic
import Lean.Meta.Transform
namespace Lean.Meta.Sym
+
+/--
+Returns `true` if `e` contains a loose ... | 113 | 8 | 121 | 8 | diff_derived | false | 1,075 | 4 | 1 | 0 | 2 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:10Z | extraction_pipeline_v2 |
LB-0067 | pr_completion | easy | 3.4 | google-deepmind/formal-conjectures | 3,766 | feat(ErdosProblems): 655 | https://github.com/google-deepmind/formal-conjectures/pull/3766 | erdos-problems | d545eec0a6d1dad9afe24cf138725f3a7249a8c0 | 5be05139afb7ae5e663d0204faec425feffa9208 | FormalConjectures/ErdosProblems/655.lean,FormalConjecturesForMathlib/Geometry/2d.lean | FormalConjectures/ErdosProblems/655.lean | # Task: Erdős Problem 655
## Issue
https://www.erdosproblems.com/655
Let $x_1,\ldots,x_n\in \mathbb{R}^2$ be such that no circle whose centre is one of the $x_i$ contains three other points. Are there at least
$$(1+c)\frac{n}{2}$$
distinct distances determined between the $x_i$, for some constant $c>0$ and all $n$ ... | diff --git a/FormalConjectures/ErdosProblems/655.lean b/FormalConjectures/ErdosProblems/655.lean
--- /dev/null
+++ b/FormalConjectures/ErdosProblems/655.lean
@@ -0,0 +1,62 @@
+/-
+Copyright 2026 The Formal Conjectures Authors.
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file... | 68 | 1 | 69 | 9 | linked_issue | true | 10 | 2 | 2 | 0 | 2 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:10Z | extraction_pipeline_v2 |
LB-0068 | pr_completion | medium | 5.2 | google-deepmind/formal-conjectures | 3,763 | feat(ErdosProblems): 282 | https://github.com/google-deepmind/formal-conjectures/pull/3763 | erdos-problems | 6b416f9a6b24ec05e3db85859860c6902fe3e0fc | d545eec0a6d1dad9afe24cf138725f3a7249a8c0 | FormalConjectures/ErdosProblems/282.lean | FormalConjectures/ErdosProblems/282.lean | # Task: Erdős Problem 282
## Issue
### What is the conjecture
https://www.erdosproblems.com/282
Let $A\subseteq \mathbb{N}$ be an infinite set and consider the following greedy algorithm for a rational $x\in (0,1)$: choose the minimal $n\in A$ such that $n\geq 1/x$ and repeat with $x$ replaced by $x-\frac{1}{n... | diff --git a/FormalConjectures/ErdosProblems/282.lean b/FormalConjectures/ErdosProblems/282.lean
--- /dev/null
+++ b/FormalConjectures/ErdosProblems/282.lean
@@ -0,0 +1,121 @@
+/-
+Copyright 2025 The Formal Conjectures Authors.
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this fil... | 121 | 0 | 121 | 9.5 | linked_issue | true | 10 | 1 | 8 | 0 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:10Z | extraction_pipeline_v2 |
LB-0069 | pr_completion | easy | 1.8 | leanprover/lean4 | 13,435 | fix: handling of EmitC for small hex string literals | https://github.com/leanprover/lean4/pull/13435 | toolchain-available,changelog-compiler | 3fc99eef102549c743c6c63547983319bfae6f01 | f180c9ce1796bad54d663c6708bdf95c8b3b1116 | src/Lean/Compiler/LCNF/EmitC.lean,tests/compile/char_escape.lean | src/Lean/Compiler/LCNF/EmitC.lean | # Task: fix: handling of EmitC for small hex string literals
## Context
This PR fixes a bug in EmitC that can be caused by working with the string literal `"\x01abc"` in
Lean and causes a C compiler error.
The error is as follows:
```
run.c:29:189: error: hex escape sequence out of range
29 | static const lean_str... | diff --git a/src/Lean/Compiler/LCNF/EmitC.lean b/src/Lean/Compiler/LCNF/EmitC.lean
--- a/src/Lean/Compiler/LCNF/EmitC.lean
+++ b/src/Lean/Compiler/LCNF/EmitC.lean
@@ -207,7 +207,7 @@ def emitLns [EmitToString α] (as : List α) : EmitM Unit :=
emitLn "}"
return ret
-def toHexDigit (c : Nat) : String :=
+def toDig... | 18 | 2 | 20 | 8 | diff_derived | false | 913 | 2 | 0 | 0 | 2 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:10Z | extraction_pipeline_v2 |
LB-0070 | pr_completion | easy | 2.9 | google-deepmind/formal-conjectures | 3,768 | feat(ErdosProblems): add 101 | https://github.com/google-deepmind/formal-conjectures/pull/3768 | erdos-problems | 6b416f9a6b24ec05e3db85859860c6902fe3e0fc | 5503ee2d9c57311542f65d0332a6b749c0f2ec1a | FormalConjectures/ErdosProblems/101.lean,FormalConjecturesForMathlib/Geometry/2d.lean | FormalConjectures/ErdosProblems/101.lean | # Task: Erdős Problem 101
## Issue
### What is the conjecture
https://www.erdosproblems.com/101
Given $n$ points in $\mathbb{R}^2$, no five of which are on a line, the number of lines containing four points is $o(n^2)$.
# Task: feat(ErdosProblems): add 101
## Files affected
- FormalConjectures/ErdosProblems/... | diff --git a/FormalConjectures/ErdosProblems/101.lean b/FormalConjectures/ErdosProblems/101.lean
--- /dev/null
+++ b/FormalConjectures/ErdosProblems/101.lean
@@ -0,0 +1,56 @@
+/-
+Copyright 2026 The Formal Conjectures Authors.
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file... | 68 | 0 | 68 | 9 | linked_issue | true | 10 | 2 | 1 | 1 | 1 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:10Z | extraction_pipeline_v2 |
LB-0071 | pr_completion | easy | 1.9 | google-deepmind/formal-conjectures | 3,765 | feat(ErdosProblems): 653 | https://github.com/google-deepmind/formal-conjectures/pull/3765 | erdos-problems | 6b416f9a6b24ec05e3db85859860c6902fe3e0fc | f1a88234322c68010cf34ce5bdfb0b264d0ead02 | FormalConjectures/ErdosProblems/653.lean,FormalConjecturesForMathlib/Geometry/2d.lean | FormalConjectures/ErdosProblems/653.lean | # Task: Erdős Problem 653
## Issue
### What is the conjecture
https://www.erdosproblems.com/653
Let $x_1,\ldots,x_n\in \mathbb{R}^2$ and let $R(x_i)=\\#\\{ \lvert x_j-x_i\rvert : j\neq i\\}$, where the points are ordered such that
$$R(x_1)\leq \cdots \leq R(x_n).$$
Let $g(n)$ be the maximum number of distinct ... | diff --git a/FormalConjectures/ErdosProblems/653.lean b/FormalConjectures/ErdosProblems/653.lean
--- /dev/null
+++ b/FormalConjectures/ErdosProblems/653.lean
@@ -0,0 +1,39 @@
+/-
+Copyright 2026 The Formal Conjectures Authors.
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file... | 49 | 3 | 52 | 8.5 | linked_issue | true | 10 | 2 | 1 | 0 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:10Z | extraction_pipeline_v2 |
LB-0072 | pr_completion | easy | 3.4 | leanprover/lean4 | 13,429 | [Backport releases/v4.30.0] fix: make delta-derived instances respect enclosing meta sections | https://github.com/leanprover/lean4/pull/13429 | ad1cfc63162c4fb61923b7e0f9d9cf239ba2f5fe | 3dc1a088b6d2d8eafe25a7cd7ec7b58d731bd7cc | src/Lean/Elab/Deriving/Basic.lean,tests/elab/13313.lean | src/Lean/Elab/Deriving/Basic.lean | # Task: [Backport releases/v4.30.0] fix: make delta-derived instances respect enclosing meta sections
## Context
Backport 621c558c137ee781e7357d4ad2c2685fba994485 from #13315.
## Files affected
- src/Lean/Elab/Deriving/Basic.lean (+3/-2)
- tests/elab/13313.lean (+45/-0)
## Definitions to add
- `test` in `tests/elab/... | diff --git a/src/Lean/Elab/Deriving/Basic.lean b/src/Lean/Elab/Deriving/Basic.lean
--- a/src/Lean/Elab/Deriving/Basic.lean
+++ b/src/Lean/Elab/Deriving/Basic.lean
@@ -220,7 +220,7 @@ def processDefDeriving (view : DerivingClassView) (decl : Expr) (isNoncomputable
instName ← liftMacroM <| mkUnusedBaseName i... | 48 | 2 | 50 | 7.5 | diff_derived | false | 62 | 2 | 0 | 0 | 4 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:10Z | extraction_pipeline_v2 | |
LB-0073 | pr_completion | medium | 5.2 | google-deepmind/formal-conjectures | 3,770 | feat(ErdosProblems): 789 | https://github.com/google-deepmind/formal-conjectures/pull/3770 | erdos-problems | 6b416f9a6b24ec05e3db85859860c6902fe3e0fc | a8b7d68fb684a891de444decdf1db968d1ed0289 | FormalConjectures/ErdosProblems/789.lean | FormalConjectures/ErdosProblems/789.lean | # Task: Erdős Problem 789
## Issue
### What is the conjecture
https://www.erdosproblems.com/789
Let $h(n)$ be maximal such that if $A\subseteq \mathbb{Z}$ with $\lvert A\rvert=n$ then there is $B\subseteq A$ with $\lvert B\rvert \geq h(n)$ such that if $a_1+\cdots+a_r=b_1+\cdots+b_s$ with $a_i,b_i\in B$ then $r=s$... | diff --git a/FormalConjectures/ErdosProblems/789.lean b/FormalConjectures/ErdosProblems/789.lean
--- /dev/null
+++ b/FormalConjectures/ErdosProblems/789.lean
@@ -0,0 +1,122 @@
+/-
+Copyright 2026 The Formal Conjectures Authors.
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this fil... | 122 | 0 | 122 | 9.5 | linked_issue | true | 10 | 1 | 7 | 0 | 1 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:10Z | extraction_pipeline_v2 |
LB-0074 | pr_completion | easy | 2.76 | leanprover/lean4 | 13,396 | fix: free variable in `do` bind when continuation type depends on bvar | https://github.com/leanprover/lean4/pull/13396 | builds-mathlib,toolchain-available,changelog-language,mathlib4-nightly-available | 9db52c7fa6f0bdf1ce77ee054aaa948d43d0d48e | cbda692e7e68e40ed7aed699a96cdc85d91635a7 | src/Lean/Elab/Do/Basic.lean,tests/elab/due_to_metavariables.lean,tests/elab/issue12768.lean,tests/elab/newdo.lean | src/Lean/Elab/Do/Basic.lean | # Task: fix: free variable in `do` bind when continuation type depends on bvar
## Context
This PR fixes #12768, where the new `do` elaborator produced a "declaration has free variables" kernel error when the bind continuation's result type was definitionally but not syntactically independent of the bound variable. The... | diff --git a/src/Lean/Elab/Do/Basic.lean b/src/Lean/Elab/Do/Basic.lean
--- a/src/Lean/Elab/Do/Basic.lean
+++ b/src/Lean/Elab/Do/Basic.lean
@@ -384,6 +384,7 @@ def DoElemCont.mkBindUnlessPure (dec : DoElemCont) (e : Expr) : DoElabM Expr :=
let k := dec.k
-- The .ofBinderName below is mainly to interpret `__do_lift... | 18 | 5 | 23 | 8 | diff_derived | false | 537 | 4 | 0 | 0 | 3 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:10Z | extraction_pipeline_v2 |
LB-0075 | pr_completion | easy | 2.7 | google-deepmind/formal-conjectures | 3,769 | feat(ErdosProblems): 774 | https://github.com/google-deepmind/formal-conjectures/pull/3769 | erdos-problems | 6b416f9a6b24ec05e3db85859860c6902fe3e0fc | 269bd4e1d15367427f53536339c3dca9d6158638 | FormalConjectures/ErdosProblems/774.lean | FormalConjectures/ErdosProblems/774.lean | # Task: feat(ErdosProblems): 774
## Files affected
- FormalConjectures/ErdosProblems/774.lean (+52/-0)
## Theorems to prove
### `erdos_774` in `FormalConjectures/ErdosProblems/774.lean`
```lean
theorem erdos_774 : answer(sorry) ↔ ∀ (A : Set ℕ), A.Infinite → A.IsProportionatelyDissociated →
```
Description: Is every ... | diff --git a/FormalConjectures/ErdosProblems/774.lean b/FormalConjectures/ErdosProblems/774.lean
--- /dev/null
+++ b/FormalConjectures/ErdosProblems/774.lean
@@ -0,0 +1,52 @@
+/-
+Copyright 2026 The Formal Conjectures Authors.
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file... | 52 | 0 | 52 | 8 | diff_derived | false | 0 | 1 | 1 | 0 | 2 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:10Z | extraction_pipeline_v2 |
LB-0076 | pr_completion | medium | 4.3 | leanprover/lean4 | 13,315 | fix: make delta-derived instances respect enclosing meta sections | https://github.com/leanprover/lean4/pull/13315 | toolchain-available,changelog-language,backport releases/v4.30.0 | 30dca7b5458c58aa01e55993ee1b56ad9e1d0639 | 621c558c137ee781e7357d4ad2c2685fba994485 | src/Lean/AddDecl.lean,src/Lean/Elab/Deriving/Basic.lean,src/Lean/ParserCompiler.lean,tests/elab/13313.lean | src/Lean/AddDecl.lean | # Task: fix: make delta-derived instances respect enclosing meta sections
## Context
This PR fixes `processDefDeriving` to propagate the `meta` attribute to instances derived via delta deriving, so that `deriving BEq` inside a `public meta section` produces a meta instance. Previously the derived `instBEqFoo` was not ... | diff --git a/src/Lean/AddDecl.lean b/src/Lean/AddDecl.lean
--- a/src/Lean/AddDecl.lean
+++ b/src/Lean/AddDecl.lean
@@ -9,6 +9,7 @@ prelude
public import Lean.Meta.Sorry
public import Lean.Util.CollectAxioms
public import Lean.OriginalConstKind
+import Lean.Compiler.MetaAttr
import all Lean.OriginalConstKind -- for... | 55 | 6 | 61 | 8 | diff_derived | false | 1,382 | 4 | 0 | 0 | 5 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:10Z | extraction_pipeline_v2 |
LB-0077 | pr_completion | easy | 1.66 | google-deepmind/formal-conjectures | 3,767 | feat(ErdosProblems): 750 | https://github.com/google-deepmind/formal-conjectures/pull/3767 | erdos-problems | 6b416f9a6b24ec05e3db85859860c6902fe3e0fc | 756da0e1accb2b7da23c18599e6419a2ee9d34f2 | FormalConjectures/ErdosProblems/750.lean | FormalConjectures/ErdosProblems/750.lean | # Task: Erdős Problem 750
## Issue
### What is the conjecture
https://www.erdosproblems.com/750
Let $f(m)$ be some function such that $f(m)\to \infty$ as $m\to \infty$. Does there exist a graph $G$ of infinite chromatic number such that every subgraph on $m$ vertices contains an independent set of size at least $\... | diff --git a/FormalConjectures/ErdosProblems/750.lean b/FormalConjectures/ErdosProblems/750.lean
--- /dev/null
+++ b/FormalConjectures/ErdosProblems/750.lean
@@ -0,0 +1,48 @@
+/-
+Copyright 2026 The Formal Conjectures Authors.
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file... | 48 | 0 | 48 | 9 | linked_issue | true | 10 | 1 | 1 | 0 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:10Z | extraction_pipeline_v2 |
LB-0078 | pr_completion | easy | 3.4 | leanprover/lean4 | 13,421 | fix: expand reset reuse in the presence of double oproj | https://github.com/leanprover/lean4/pull/13421 | toolchain-available,changelog-compiler | 9b1426fd9c3aae01c3e1e3fe3fc5e1772d3687b0 | 5949ae8664d6316b00900127470ff077ff8a27ca | src/Lean/Compiler/LCNF/ExpandResetReuse.lean,tests/elab/13407.lean | src/Lean/Compiler/LCNF/ExpandResetReuse.lean | # Task: fix: expand reset reuse in the presence of double oproj
## Context
This PR fixes an issue in the expand reset reuse pass that causes segfaults in very rare situations.
This bug occurs in situations where two projections from the same field happen right before a reset,
for example:
```
let x.2 := oproj[0] _x.1... | diff --git a/src/Lean/Compiler/LCNF/ExpandResetReuse.lean b/src/Lean/Compiler/LCNF/ExpandResetReuse.lean
--- a/src/Lean/Compiler/LCNF/ExpandResetReuse.lean
+++ b/src/Lean/Compiler/LCNF/ExpandResetReuse.lean
@@ -90,6 +90,22 @@ partial def eraseProjIncFor (nFields : Nat) (targetId : FVarId) (ds : Array (Cod
| br... | 80 | 0 | 80 | 8.5 | diff_derived | false | 972 | 2 | 0 | 0 | 4 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | set_theory | 2026-04-28T12:40:11Z | extraction_pipeline_v2 |
LB-0079 | pr_completion | medium | 5.7 | google-deepmind/formal-conjectures | 3,764 | feat(ErdosProblems): 539 | https://github.com/google-deepmind/formal-conjectures/pull/3764 | erdos-problems | 6b416f9a6b24ec05e3db85859860c6902fe3e0fc | 746b03b5aaae6329094bfc6ce60d713295ee5b74 | FormalConjectures/ErdosProblems/539.lean | FormalConjectures/ErdosProblems/539.lean | # Task: Erdős Problem 539
## Issue
### What is the conjecture
https://www.erdosproblems.com/539
Let $h(n)$ be such that, for any set $A\subseteq \mathbb{N}$ of size $n$, the set
$$\left\\{ \frac{a}{(a,b)}: a,b\in A\right\\}$$
has size at least $h(n)$. Estimate $h(n)$.
Status: open
### Choose either optio... | diff --git a/FormalConjectures/ErdosProblems/539.lean b/FormalConjectures/ErdosProblems/539.lean
--- /dev/null
+++ b/FormalConjectures/ErdosProblems/539.lean
@@ -0,0 +1,116 @@
+/-
+Copyright 2026 The Formal Conjectures Authors.
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this fil... | 116 | 0 | 116 | 9.5 | linked_issue | true | 10 | 1 | 8 | 0 | 1 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:11Z | extraction_pipeline_v2 |
LB-0080 | pr_completion | medium | 6.2 | google-deepmind/formal-conjectures | 3,751 | Add Erdős Problem 602 (Komjáth's Property B for almost-disjoint families) | https://github.com/google-deepmind/formal-conjectures/pull/3751 | erdos-problems | a80858b04aea6ebec5b1f212c414f32bfd750886 | 64ba3ffbac2fa117022d4f836a0e34c9b7060ed7 | FormalConjectures/ErdosProblems/602.lean | FormalConjectures/ErdosProblems/602.lean | # Task: Add Erdős Problem 602 (Komjáth's Property B for almost-disjoint families)
## Context
fixes #821
## Problem
Erdős Problem 602: https://www.erdosproblems.com/602
> Let $(A_i)$ be a family of sets with $|A_i| = \aleph_0$, such that for any $i \neq j$ we have $|A_i \cap A_j|$ finite and $\neq 1$. Is ther... | diff --git a/FormalConjectures/ErdosProblems/602.lean b/FormalConjectures/ErdosProblems/602.lean
--- /dev/null
+++ b/FormalConjectures/ErdosProblems/602.lean
@@ -0,0 +1,469 @@
+/-
+Copyright 2026 The Formal Conjectures Authors.
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this fil... | 469 | 0 | 469 | 8 | diff_derived | false | 1,732 | 1 | 8 | 0 | 3 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:11Z | extraction_pipeline_v2 |
LB-0081 | pr_completion | medium | 6.6 | google-deepmind/formal-conjectures | 2,236 | feat(ErdosProblems): 91 | https://github.com/google-deepmind/formal-conjectures/pull/2236 | erdos-problems,awaiting-author | b1224fa8bf5d75427c7399105dcf4e78706f7a57 | 11933d70ca2aa86c8c8a2d7745f0d84b4a8abd05 | FormalConjectures/ErdosProblems/89.lean,FormalConjectures/ErdosProblems/91.lean,FormalConjecturesForMathlib/Geometry/2d.lean | FormalConjectures/ErdosProblems/89.lean | # Task: feat(ErdosProblems): 91
## Context
Resolves #324.
Note: I'm using Claude + Opus for supervised formalization tasks. Claude has no permission to use git on my machine.
## Files affected
- FormalConjectures/ErdosProblems/89.lean (+0/-6)
- FormalConjectures/ErdosProblems/91.lean (+210/-0)
- FormalConjecturesF... | diff --git a/FormalConjectures/ErdosProblems/89.lean b/FormalConjectures/ErdosProblems/89.lean
--- a/FormalConjectures/ErdosProblems/89.lean
+++ b/FormalConjectures/ErdosProblems/89.lean
@@ -27,12 +27,6 @@ open EuclideanGeometry
namespace Erdos89
-/--
-The minimum number of distinct distances guaranteed for any se... | 215 | 6 | 221 | 8 | diff_derived | false | 134 | 3 | 8 | 6 | 2 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:11Z | extraction_pipeline_v2 |
LB-0082 | pr_completion | hard | 7 | ImperialCollegeLondon/FLT | 816 | `padicEquiv` is an isometry | https://github.com/ImperialCollegeLondon/FLT/pull/816 | 651c67f6217906253e47f975b3bfd47086434494 | 981c5cf9bcdf2652aa69fee783b356a435a0712f | FLT.lean,FLT/DedekindDomain/AdicValuation.lean,FLT/HaarMeasure/HaarChar/AdeleRing.lean,FLT/Mathlib/NumberTheory/Padics/HeightOneSpectrum.lean,FLT/Mathlib/RingTheory/DedekindDomain/AdicValuation.lean | FLT.lean | # Task: `padicEquiv` is an isometry
## Context
- Proof of `padicEquiv_norm_eq` and move to `Mathlib` folder
- Move `intValuation_eq_coe_neg_multiplicity` to `Mathlib` folder to preserve `FLT.Mathlib` imports
## Files affected
- FLT.lean (+1/-0)
- FLT/DedekindDomain/AdicValuation.lean (+6/-19)
- FLT/HaarMeasure/HaarC... | diff --git a/FLT.lean b/FLT.lean
--- a/FLT.lean
+++ b/FLT.lean
@@ -102,6 +102,7 @@ import FLT.Mathlib.NumberTheory.NumberField.FiniteAdeleRing
import FLT.Mathlib.NumberTheory.NumberField.InfiniteAdeleRing
import FLT.Mathlib.NumberTheory.NumberField.InfinitePlace.Basic
import FLT.Mathlib.NumberTheory.NumberField.Infi... | 135 | 26 | 161 | 7.5 | diff_derived | false | 161 | 5 | 7 | 3 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | number_theory | 2026-04-28T12:40:11Z | extraction_pipeline_v2 | |
LB-0083 | pr_completion | easy | 3.7 | google-deepmind/formal-conjectures | 3,762 | feat(ErdosProblems): 272 | https://github.com/google-deepmind/formal-conjectures/pull/3762 | erdos-problems | 6b416f9a6b24ec05e3db85859860c6902fe3e0fc | 3800e5373019eb53cd8010a2cd9e7e5b66f1cba8 | FormalConjectures/ErdosProblems/272.lean | FormalConjectures/ErdosProblems/272.lean | # Task: Erdős Problem 272
## Issue
### What is the conjecture
https://www.erdosproblems.com/272
Let $N\geq 1$. What is the largest $t$ such that there are $A_1,\ldots,A_t\subseteq \{1,\ldots,N\}$ with $A_i\cap A_j$ a non-empty arithmetic progression for all $i\neq j$?
Status: open
### Choose either option
-... | diff --git a/FormalConjectures/ErdosProblems/272.lean b/FormalConjectures/ErdosProblems/272.lean
--- /dev/null
+++ b/FormalConjectures/ErdosProblems/272.lean
@@ -0,0 +1,81 @@
+/-
+Copyright 2026 The Formal Conjectures Authors.
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file... | 81 | 0 | 81 | 9.5 | linked_issue | true | 10 | 1 | 4 | 0 | 1 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:11Z | extraction_pipeline_v2 |
LB-0084 | pr_completion | easy | 0.7 | leanprover/lean4 | 13,420 | fix: `coinductive` syntax causing panic in macro scopes | https://github.com/leanprover/lean4/pull/13420 | toolchain-available,changelog-language | b6bfe019a1fa23fdf6e0f12fe6b78dda2bee1ad3 | fe77e4d2d19500e361b3a2f3a07f1eee7511d674 | src/Lean/Elab/Inductive.lean,tests/elab/13415.lean | src/Lean/Elab/Inductive.lean | # Task: fix: `coinductive` syntax causing panic in macro scopes
## Context
This PR fixes a panic when `coinductive` predicates are defined inside macro scopes where constructor names carry macro scopes. The existing guard only checked the declaration name for macro scopes, missing the case where constructor identifier... | diff --git a/src/Lean/Elab/Inductive.lean b/src/Lean/Elab/Inductive.lean
--- a/src/Lean/Elab/Inductive.lean
+++ b/src/Lean/Elab/Inductive.lean
@@ -73,6 +73,8 @@ private def inductiveSyntaxToView (modifiers : Modifiers) (decl : Syntax) (isCoi
throwError "Constructor cannot be `protected` because it is in a `pri... | 15 | 0 | 15 | 6.5 | diff_derived | false | 430 | 2 | 0 | 0 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:11Z | extraction_pipeline_v2 |
LB-0085 | pr_completion | easy | 2.6 | ImperialCollegeLondon/FLT | 815 | feat: start proof of addHaarScalarFactor_tensor_adeles_eq_one | https://github.com/ImperialCollegeLondon/FLT/pull/815 | awaiting-CI | ed93402af06672a85a6960b270edb1ab1ef2d6d0 | 44793249abacfd77f17e34881c6f5f5d7ab436ea | FLT/HaarMeasure/HaarChar/AdeleRing.lean,FLT/NumberField/AdeleRing.lean,FLT/NumberField/Padics/RestrictedProduct.lean | FLT/HaarMeasure/HaarChar/AdeleRing.lean | # Task: feat: start proof of addHaarScalarFactor_tensor_adeles_eq_one
## Context
We reduce the claim that a K-linear automorphism base-extended to A_K has trivial Haar scalar factor, to the corresponding claim for K=Q.
## Files affected
- FLT/HaarMeasure/HaarChar/AdeleRing.lean (+32/-2)
- FLT/NumberField/AdeleRing.le... | diff --git a/FLT/HaarMeasure/HaarChar/AdeleRing.lean b/FLT/HaarMeasure/HaarChar/AdeleRing.lean
--- a/FLT/HaarMeasure/HaarChar/AdeleRing.lean
+++ b/FLT/HaarMeasure/HaarChar/AdeleRing.lean
@@ -117,13 +117,43 @@ lemma ContinuousLinearEquiv.baseChange_apply (R : Type*) [CommRing R]
(φ : M ≃ₗ[R] N) (m : M) (a : A) :
... | 56 | 20 | 76 | 7.5 | diff_derived | false | 137 | 3 | 1 | 1 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | algebra | 2026-04-28T12:40:11Z | extraction_pipeline_v2 |
LB-0086 | pr_completion | easy | 0.28 | google-deepmind/formal-conjectures | 3,759 | fix: Erdos 1196 silly typos | https://github.com/google-deepmind/formal-conjectures/pull/3759 | erdos-problems,misformalization | 6b416f9a6b24ec05e3db85859860c6902fe3e0fc | 5996f24dd1a17fe5cb9a3fa5013d9ca292332e7d | FormalConjectures/ErdosProblems/1196.lean | FormalConjectures/ErdosProblems/1196.lean | # Task: fix: Erdos 1196 silly typos
## Files affected
- FormalConjectures/ErdosProblems/1196.lean (+2/-2)
## Verification
The patched repository must compile with `lake build`. | diff --git a/FormalConjectures/ErdosProblems/1196.lean b/FormalConjectures/ErdosProblems/1196.lean
--- a/FormalConjectures/ErdosProblems/1196.lean
+++ b/FormalConjectures/ErdosProblems/1196.lean
@@ -30,8 +30,8 @@ Is it true that, for any $x$, if $A\subset [x,\infty)$ is a primitive set of int
-/
@[category research s... | 2 | 2 | 4 | 6 | diff_derived | false | 0 | 1 | 0 | 0 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:11Z | extraction_pipeline_v2 |
LB-0087 | pr_completion | easy | 1.94 | google-deepmind/formal-conjectures | 3,755 | feat: formalise erdos 1196 | https://github.com/google-deepmind/formal-conjectures/pull/3755 | erdos-problems | 9979288b24655ecaee92daa4bdf3172040e004e0 | 6b416f9a6b24ec05e3db85859860c6902fe3e0fc | FormalConjectures/ErdosProblems/1196.lean | FormalConjectures/ErdosProblems/1196.lean | # Task: feat: formalise erdos 1196
## Files affected
- FormalConjectures/ErdosProblems/1196.lean (+37/-0)
## Theorems to prove
### `erdos_1196` in `FormalConjectures/ErdosProblems/1196.lean`
```lean
theorem erdos_1196 :
```
## Definitions to add
- `IsPrimitive` in `FormalConjectures/ErdosProblems/1196.lean`: A set ... | diff --git a/FormalConjectures/ErdosProblems/1196.lean b/FormalConjectures/ErdosProblems/1196.lean
--- /dev/null
+++ b/FormalConjectures/ErdosProblems/1196.lean
@@ -0,0 +1,37 @@
+/-
+Copyright 2026 The Formal Conjectures Authors.
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this f... | 37 | 0 | 37 | 7.5 | diff_derived | false | 0 | 1 | 1 | 0 | 1 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:12Z | extraction_pipeline_v2 |
LB-0088 | pr_completion | easy | 1.8 | leanprover/lean4 | 13,348 | fix: tactic completion in empty `by` blocks | https://github.com/leanprover/lean4/pull/13348 | toolchain-available,changelog-server | 1d1c5c6e309ee8ac6b92be4c14853ba3b146e20d | df23b79c9014259602832fd2a5acba357e713f9c | src/Lean/Server/Completion/SyntheticCompletion.lean,tests/server_interactive/completionEmptyBy.lean,tests/server_interactive/completionEmptyByBracketed.lean,tests/server_interactive/completionTactics.lean | src/Lean/Server/Completion/SyntheticCompletion.lean | # Task: fix: tactic completion in empty `by` blocks
## Context
This PR fixes a bug where tactic auto-completion would produce tactic completion items in the entire trailing whitespace of an empty tactic block. Since #13229 further restricted top-level `by` blocks to be indentation- sensitive, this PR adjusts the logic... | diff --git a/src/Lean/Server/Completion/SyntheticCompletion.lean b/src/Lean/Server/Completion/SyntheticCompletion.lean
--- a/src/Lean/Server/Completion/SyntheticCompletion.lean
+++ b/src/Lean/Server/Completion/SyntheticCompletion.lean
@@ -117,12 +117,13 @@ private partial def isSyntheticTacticCompletion
(cmdStx ... | 141 | 11 | 152 | 5.5 | diff_derived | false | 322 | 4 | 0 | 0 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:12Z | extraction_pipeline_v2 |
LB-0089 | pr_completion | easy | 2.4 | ImperialCollegeLondon/FLT | 562 | feat: haar character of restricted product | https://github.com/ImperialCollegeLondon/FLT/pull/562 | awaiting-CI | 2dcfaac6dff8d4a7439500ba4138ac956db74f38 | ed93402af06672a85a6960b270edb1ab1ef2d6d0 | FLT/HaarMeasure/HaarChar/AddEquiv.lean,FLT/HaarMeasure/HaarChar/Ring.lean | FLT/HaarMeasure/HaarChar/AddEquiv.lean | # Task: fudge factor of automorphism of restricted product of groups is product of fudge factors
## Issue
If phi_i are automorphisms of locally compact topological groups G_i, and C_i are compact open subgroups with phi_i(C_i)=C_i for all but finitely many i, then the product of the phi_i is an automorphism phi of the... | diff --git a/FLT/HaarMeasure/HaarChar/AddEquiv.lean b/FLT/HaarMeasure/HaarChar/AddEquiv.lean
--- a/FLT/HaarMeasure/HaarChar/AddEquiv.lean
+++ b/FLT/HaarMeasure/HaarChar/AddEquiv.lean
@@ -319,18 +319,6 @@ section restrictedproduct
open ENNReal
--- -- some sample code to show how why a nonempty compact open has
--- ... | 68 | 37 | 105 | 8.5 | linked_issue | true | 30 | 2 | 0 | 2 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | algebra | 2026-04-28T12:40:12Z | extraction_pipeline_v2 |
LB-0090 | pr_completion | easy | 1.32 | leanprover/lean4 | 13,391 | fix: universe normalization in getDecLevel | https://github.com/leanprover/lean4/pull/13391 | builds-mathlib,toolchain-available,changelog-language,force-mathlib-ci,mathlib4-nightly-available | 1884c3b2ed559513f455b39ffc42ae3d0ece3f8b | 75487a1bf81260c04d484cd5a0423107bb9e7990 | src/Lean/Meta/DecLevel.lean,tests/elab/doForMutSortPoly.lean | src/Lean/Meta/DecLevel.lean | # Task: fix: universe normalization in getDecLevel
## Context
This PR adds level instantiation and normalization in `getDecLevel` and `getDecLevel?` before calling `decLevel`.
`getLevel` can return levels with uninstantiated metavariables or un-normalized structure, such as `max ?u ?v` where the metavariables have al... | diff --git a/src/Lean/Meta/DecLevel.lean b/src/Lean/Meta/DecLevel.lean
--- a/src/Lean/Meta/DecLevel.lean
+++ b/src/Lean/Meta/DecLevel.lean
@@ -69,12 +69,16 @@ def decLevel (u : Level) : MetaM Level := do
/-- This method is useful for inferring universe level parameters for function that take arguments such as `{α : ... | 18 | 3 | 21 | 8 | diff_derived | false | 941 | 2 | 0 | 0 | 1 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:13Z | extraction_pipeline_v2 |
LB-0091 | pr_completion | easy | 2 | ImperialCollegeLondon/FLT | 810 | feat: remove sorries K_v = Q_p which are now resolved in mathlib | https://github.com/ImperialCollegeLondon/FLT/pull/810 | b0ae4be115e4f38b4d091a57aa65f3203a4d569c | c5eb65ce2727ebca2b65f2231a8dd94c00e3d551 | FLT/HaarMeasure/HaarChar/AdeleRing.lean,FLT/NumberField/AdeleRing.lean,FLT/NumberField/Completion/Finite.lean,FLT/NumberField/HeightOneSpectrum.lean,FLT/NumberField/Padics/RestrictedProduct.lean | FLT/HaarMeasure/HaarChar/AdeleRing.lean | # Task: feat: remove sorries K_v = Q_p which are now resolved in mathlib
## Context
Mathlib PR [#30576](https://github.com/leanprover-community/mathlib4/pull/30576) by Salvatore Mercuri resolves these sorries.
Still currently unresolved is another sorry in `FLT/HaarMeasure/HaarChar/AdeleRing.lean`:
```lean4
lemm... | diff --git a/FLT/HaarMeasure/HaarChar/AdeleRing.lean b/FLT/HaarMeasure/HaarChar/AdeleRing.lean
--- a/FLT/HaarMeasure/HaarChar/AdeleRing.lean
+++ b/FLT/HaarMeasure/HaarChar/AdeleRing.lean
@@ -63,7 +63,8 @@ lemma MeasureTheory.ringHaarChar_adeles_rat (x : (𝔸 ℚ)ˣ) :
-- depends on `IsDedekindDomain.HeightOneSpectrum.pa... | 23 | 66 | 89 | 6 | diff_derived | false | 1,163 | 5 | 0 | 0 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | algebra | 2026-04-28T12:40:13Z | extraction_pipeline_v2 | |
LB-0092 | pr_completion | medium | 6.2 | google-deepmind/formal-conjectures | 3,491 | feat(OpenQuantumProblems): Formalization of open quantum problem 35 | https://github.com/google-deepmind/formal-conjectures/pull/3491 | a6479459a39c5981dcf72ed112219a752ac2678e | 436eb2a112644e259e567a10db57d85bbc385359 | FormalConjectures/OpenQuantumProblems/35.lean | FormalConjectures/OpenQuantumProblems/35.lean | # Task: Formalize Open Quantum Problem #35: Existence of absolutely maximally entangled pure states
## Issue
### What is the conjecture
This is problem [#35](https://oqp.iqoqi.oeaw.ac.at/existence-of-absolutely-maximally-entangled-pure-states) in the community-maintained [Open Quantum Problems master list](https://oq... | diff --git a/FormalConjectures/OpenQuantumProblems/35.lean b/FormalConjectures/OpenQuantumProblems/35.lean
--- /dev/null
+++ b/FormalConjectures/OpenQuantumProblems/35.lean
@@ -0,0 +1,857 @@
+/-
+Copyright 2026 The Formal Conjectures Authors.
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may n... | 857 | 0 | 857 | 7.5 | linked_issue | true | 0 | 1 | 33 | 28 | 15 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | topology | 2026-04-28T12:40:13Z | extraction_pipeline_v2 | |
LB-0093 | pr_completion | easy | 0.98 | leanprover/lean4 | 13,392 | fix: file read buffer overflow | https://github.com/leanprover/lean4/pull/13392 | toolchain-available,release-ci,changelog-compiler,backport releases/v4.29.0,backport releases/v4.30.0,backport releases/v4.28.0 | c769515d94a999df50b43474f0650db77ddd9747 | 9db52c7fa6f0bdf1ce77ee054aaa948d43d0d48e | tests/compile/file_read_overflow.lean | tests/compile/file_read_overflow.lean | # Task: fix: file read buffer overflow
## Context
This PR fixes a heap buffer overflow in `lean_io_prim_handle_read` that was triggered through an
integer overflow in the size computation of an allocation. In addition it places several checked
arithmetic operations on all relevant allocation paths to have potential fu... | diff --git a/tests/compile/file_read_overflow.lean b/tests/compile/file_read_overflow.lean
--- /dev/null
+++ b/tests/compile/file_read_overflow.lean
@@ -0,0 +1,14 @@
+/-!
+This issue is a minimal reproducer for #13388 which now throws an out of memory error.
+-/
+
+def main : IO UInt32 := do
+ let (h, _) ← IO.FS.creat... | 14 | 0 | 14 | 8 | diff_derived | false | 393 | 1 | 0 | 0 | 1 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:14Z | extraction_pipeline_v2 |
LB-0094 | pr_completion | easy | 1.68 | ImperialCollegeLondon/FLT | 811 | feat: PadicInt.volume_coe | https://github.com/ImperialCollegeLondon/FLT/pull/811 | b0ae4be115e4f38b4d091a57aa65f3203a4d569c | 48bf2c40b731630b86a229aefc2d9c468c5ae01a | FLT/HaarMeasure/MeasurableSpacePadics.lean | FLT/HaarMeasure/MeasurableSpacePadics.lean | # Task: feat: PadicInt.volume_coe
## Files affected
- FLT/HaarMeasure/MeasurableSpacePadics.lean (+22/-2)
## Supporting lemmas
- `isMeasurableEmbedding_coeRingHom` in `FLT/HaarMeasure/MeasurableSpacePadics.lean`
```lean
lemma isMeasurableEmbedding_coeRingHom : MeasurableEmbedding (Coe.ringHom (p := p)) :=
```
-... | diff --git a/FLT/HaarMeasure/MeasurableSpacePadics.lean b/FLT/HaarMeasure/MeasurableSpacePadics.lean
--- a/FLT/HaarMeasure/MeasurableSpacePadics.lean
+++ b/FLT/HaarMeasure/MeasurableSpacePadics.lean
@@ -3,7 +3,7 @@ Copyright (c) 2024 Yaël Dillies, David Loeffler. All rights reserved.
Released under Apache 2.0 license ... | 22 | 2 | 24 | 7.5 | diff_derived | false | 0 | 1 | 0 | 2 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | analysis | 2026-04-28T12:40:14Z | extraction_pipeline_v2 | |
LB-0095 | pr_completion | easy | 1.54 | leanprover/lean4 | 13,384 | fix: include `ignoreNoncomputable` in LCNF cache key | https://github.com/leanprover/lean4/pull/13384 | breaks-mathlib,toolchain-available,changelog-compiler,mathlib4-nightly-available | d76e5a1886956bb38dc6bd2868260550dc66c309 | 0d7e76ea889bacbe8a55af77b2c5841445ae3f64 | src/Lean/Compiler/LCNF/ToLCNF.lean,tests/elab/13371.lean | src/Lean/Compiler/LCNF/ToLCNF.lean | # Task: fix: include `ignoreNoncomputable` in LCNF cache key
## Context
This PR fixes a compiler panic when a structure constructor receives a noncomputable instance as an instance-implicit argument.
The LCNF translation first visits the instance in an irrelevant position (type parameter) where `ignoreNoncomputable... | diff --git a/src/Lean/Compiler/LCNF/ToLCNF.lean b/src/Lean/Compiler/LCNF/ToLCNF.lean
--- a/src/Lean/Compiler/LCNF/ToLCNF.lean
+++ b/src/Lean/Compiler/LCNF/ToLCNF.lean
@@ -213,11 +213,22 @@ structure Context where
-/
expectedType : Option Expr
+/--
+Key for the LCNF translation cache. `ignoreNoncomputable` is pa... | 29 | 3 | 32 | 8 | diff_derived | false | 480 | 2 | 0 | 0 | 1 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:14Z | extraction_pipeline_v2 |
LB-0096 | pr_completion | easy | 3.8 | ImperialCollegeLondon/FLT | 805 | feat: ringHaarChar_adeles_units_rat_eq_one | https://github.com/ImperialCollegeLondon/FLT/pull/805 | awaiting-review | b544e397539b957799498dfc0fae86d70d4c9bf7 | 200f197cb9a44747b126f218dd099f0cedc588b1 | FLT/HaarMeasure/HaarChar/AdeleRing.lean,FLT/HaarMeasure/HaarChar/Ring.lean,FLT/Mathlib/NumberTheory/NumberField/InfiniteAdeleRing.lean,FLT/NumberField/Padics/RestrictedProduct.lean | FLT/HaarMeasure/HaarChar/AdeleRing.lean | # Task: feat: ringHaarChar_adeles_units_rat_eq_one
## Files affected
- FLT/HaarMeasure/HaarChar/AdeleRing.lean (+35/-1)
- FLT/HaarMeasure/HaarChar/Ring.lean (+13/-0)
- FLT/Mathlib/NumberTheory/NumberField/InfiniteAdeleRing.lean (+16/-0)
- FLT/NumberField/Padics/RestrictedProduct.lean (+4/-3)
## Supporting lemmas
- `p... | diff --git a/FLT/HaarMeasure/HaarChar/AdeleRing.lean b/FLT/HaarMeasure/HaarChar/AdeleRing.lean
--- a/FLT/HaarMeasure/HaarChar/AdeleRing.lean
+++ b/FLT/HaarMeasure/HaarChar/AdeleRing.lean
@@ -2,6 +2,9 @@ import FLT.HaarMeasure.HaarChar.Ring
import FLT.Mathlib.MeasureTheory.Constructions.BorelSpace.AdicCompletion
impor... | 68 | 4 | 72 | 7 | diff_derived | false | 0 | 4 | 0 | 4 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | number_theory | 2026-04-28T12:40:15Z | extraction_pipeline_v2 |
LB-0097 | pr_completion | easy | 1.1 | leanprover/lean4 | 13,399 | fix: add term info for `for` loop variables in new do elaborator | https://github.com/leanprover/lean4/pull/13399 | changelog-language | a0f2a8bf60e83938ad16b8e6479bde9705fa899b | cf53db3b130ea27eb41151a0d6c3e1202c3d3297 | src/Lean/Elab/BuiltinDo/For.lean,tests/server_interactive/hoverDoForIn.lean | src/Lean/Elab/BuiltinDo/For.lean | # Task: fix: add term info for `for` loop variables in new do elaborator
## Context
This PR fixes #12827, where hovering over `for` loop variables `x` and `h` in `for h : x in xs do` showed no type information in the new do elaborator. The fix adds `Term.addLocalVarInfo` calls for the loop variable and membership proo... | diff --git a/src/Lean/Elab/BuiltinDo/For.lean b/src/Lean/Elab/BuiltinDo/For.lean
--- a/src/Lean/Elab/BuiltinDo/For.lean
+++ b/src/Lean/Elab/BuiltinDo/For.lean
@@ -153,6 +153,9 @@ open Lean.Meta
let body ←
withLocalDeclsD xh fun xh => do
+ Term.addLocalVarInfo x xh[0]!
+ if let some h := h? then
+ T... | 10 | 0 | 10 | 7.5 | diff_derived | false | 321 | 2 | 0 | 0 | 1 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:15Z | extraction_pipeline_v2 |
LB-0098 | pr_completion | easy | 2.42 | leanprover-community/mathlib4 | 31,342 | feat: `extract_goal` preserves explicit foralls | https://github.com/leanprover-community/mathlib4/pull/31342 | delegated,t-meta | 4c6685252b49ef7b891fecc5cf8cb9c7681e7eba | 36a2b22f66b8bb2434674cace18feb371e29c8f7 | Mathlib/Tactic/ExtractGoal.lean,Mathlib/Tactic/TacticAnalysis/Declarations.lean,MathlibTest/ExtractGoal.lean | Mathlib/Tactic/ExtractGoal.lean | # Task: feat: `extract_goal` preserves explicit foralls
## Context
Modifies `extract_goal` so if there is a `\forall` in the current goal, that is preserved "after the colon" in the produced theorem statement.
Initial implementation by Claude Code.
## Files affected
- Mathlib/Tactic/ExtractGoal.lean (+19/-4)
- Mat... | diff --git a/Mathlib/Tactic/ExtractGoal.lean b/Mathlib/Tactic/ExtractGoal.lean
--- a/Mathlib/Tactic/ExtractGoal.lean
+++ b/Mathlib/Tactic/ExtractGoal.lean
@@ -139,10 +139,19 @@ The return values are:
* A formatted piece of `MessageData`, like `m!"myTheorem (a b : Nat) : a + b = b + a"`.
* The full type of the declara... | 36 | 5 | 41 | 7.5 | diff_derived | false | 184 | 3 | 1 | 0 | 1 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | analysis | 2026-04-28T12:40:15Z | extraction_pipeline_v2 |
LB-0099 | pr_completion | medium | 6.8 | ImperialCollegeLondon/FLT | 803 | feat: Efamily | https://github.com/ImperialCollegeLondon/FLT/pull/803 | awaiting-CI | b544e397539b957799498dfc0fae86d70d4c9bf7 | 8265e1f8584c45ee2fb1b78a28a75f1fec400f53 | FLT/DedekindDomain/FiniteAdeleRing/BaseChange.lean,FLT/DivisionAlgebra/Finiteness.lean,FLT/HaarMeasure/HaarChar/AddEquiv.lean,FLT/HaarMeasure/HaarChar/Ring.lean | FLT/DedekindDomain/FiniteAdeleRing/BaseChange.lean | # Task: feat: Efamily
## Context
We construct a family of subsets of D tensor A_K depending on a real parameter r, which are compact and have measure tending to infinity as r tends to infinity. This is a key ingredient for Weil's finiteness argument.
## Files affected
- FLT/DedekindDomain/FiniteAdeleRing/BaseChange.l... | diff --git a/FLT/DedekindDomain/FiniteAdeleRing/BaseChange.lean b/FLT/DedekindDomain/FiniteAdeleRing/BaseChange.lean
--- a/FLT/DedekindDomain/FiniteAdeleRing/BaseChange.lean
+++ b/FLT/DedekindDomain/FiniteAdeleRing/BaseChange.lean
@@ -378,9 +378,6 @@ instance : IsModuleTopology (FiniteAdeleRing A K) (FiniteAdeleRing B ... | 352 | 234 | 586 | 6.5 | diff_derived | false | 217 | 4 | 5 | 7 | 15 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | algebra | 2026-04-28T12:40:15Z | extraction_pipeline_v2 |
LB-0100 | pr_completion | easy | 2.54 | leanprover/lean4 | 13,397 | fix: improve error for join point assignment failure in do elaborator | https://github.com/leanprover/lean4/pull/13397 | changelog-language | c4d9573342ee424dccf2002b239a943f2577c77b | a0f2a8bf60e83938ad16b8e6479bde9705fa899b | src/Lean/Elab/Do/Basic.lean,tests/elab/issue12826.lean | src/Lean/Elab/Do/Basic.lean | # Task: fix: improve error for join point assignment failure in do elaborator
## Context
This PR improves error reporting when the `do` elaborator produces an ill-formed expression that fails `checkedAssign` in `withDuplicableCont`. Previously the failure was silently discarded, making it hard to diagnose bugs in the ... | diff --git a/src/Lean/Elab/Do/Basic.lean b/src/Lean/Elab/Do/Basic.lean
--- a/src/Lean/Elab/Do/Basic.lean
+++ b/src/Lean/Elab/Do/Basic.lean
@@ -545,7 +545,10 @@ def DoElemCont.withDuplicableCont (nondupDec : DoElemCont) (callerInfo : Control
withDeadCode (if callerInfo.numRegularExits > 0 then .alive else .deadSema... | 31 | 1 | 32 | 8 | diff_derived | false | 367 | 2 | 0 | 0 | 3 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:16Z | extraction_pipeline_v2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.