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-0201 | pr_completion | easy | 2.12 | leanprover-community/physlib | 990 | feat(Momentum): prove `momentumOperatorSchwartz_isSymmetric` | https://github.com/leanprover-community/physlib/pull/990 | ready-to-merge | c1cdc445375e57aa1b9f557a5d151cf5485889c0 | d607e4f113b5c240b023a20a4ea0855cc71cd590 | PhysLean/QuantumMechanics/DDimensions/Operators/Momentum.lean | PhysLean/QuantumMechanics/DDimensions/Operators/Momentum.lean | # Task: feat(Momentum): prove `momentumOperatorSchwartz_isSymmetric`
## Context
This PR adds proofs autoformalised by @Aristotle-Harmonic.
Co-authored-by: Aristotle (Harmonic) <aristotle-harmonic@harmonic.fun>
## Files affected
- PhysLean/QuantumMechanics/DDimensions/Operators/Momentum.lean (+29/-17)
## Definitions... | diff --git a/PhysLean/QuantumMechanics/DDimensions/Operators/Momentum.lean b/PhysLean/QuantumMechanics/DDimensions/Operators/Momentum.lean
--- a/PhysLean/QuantumMechanics/DDimensions/Operators/Momentum.lean
+++ b/PhysLean/QuantumMechanics/DDimensions/Operators/Momentum.lean
@@ -9,6 +9,7 @@ public import PhysLean.Quantu... | 29 | 17 | 46 | 8 | diff_derived | false | 130 | 1 | 0 | 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:41Z | extraction_pipeline_v2 |
LB-0202 | pr_completion | medium | 6.6 | leanprover-community/physlib | 983 | feat: mfderiv for Space | https://github.com/leanprover-community/physlib/pull/983 | ready-to-merge,t-space-time | 4379792b945c8a3270e2b7c907dd4997685771dd | 6168857d2ceda5c0713b2443d02957f68079adc6 | PhysLean/SpaceAndTime/Space/Basic.lean,PhysLean/SpaceAndTime/Space/Derivatives/Basic.lean,PhysLean/SpaceAndTime/Space/Module.lean | PhysLean/SpaceAndTime/Space/Basic.lean | # Task: feat: mfderiv for Space
## Context
Add a new formula for derivatives on space in terms of the origin-independent manifold structure on `Space`. Added a number of other small lemmas needed along the way.
## Files affected
- PhysLean/SpaceAndTime/Space/Basic.lean (+31/-0)
- PhysLean/SpaceAndTime/Space/Derivativ... | diff --git a/PhysLean/SpaceAndTime/Space/Basic.lean b/PhysLean/SpaceAndTime/Space/Basic.lean
--- a/PhysLean/SpaceAndTime/Space/Basic.lean
+++ b/PhysLean/SpaceAndTime/Space/Basic.lean
@@ -12,6 +12,7 @@ public import Mathlib.Topology.ContinuousMap.CompactlySupported
public import Mathlib.Geometry.Manifold.IsManifold.Bas... | 161 | 3 | 164 | 8 | diff_derived | false | 167 | 3 | 0 | 14 | 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:41Z | extraction_pipeline_v2 |
LB-0203 | pr_completion | easy | 1.08 | leanprover-community/physlib | 995 | feat: Add `gradSchwartz` | https://github.com/leanprover-community/physlib/pull/995 | ready-to-merge,RFC,t-space-time | c1cdc445375e57aa1b9f557a5d151cf5485889c0 | b1bead701a414b21aa6e082164ce3f6521b8962b | PhysLean/SpaceAndTime/Space/Derivatives/Grad.lean | PhysLean/SpaceAndTime/Space/Derivatives/Grad.lean | # Task: feat: Add `gradSchwartz`
## Files affected
- PhysLean/SpaceAndTime/Space/Derivatives/Grad.lean (+19/-0)
## Supporting lemmas
- `gradSchwartz_apply_eq_grad` in `PhysLean/SpaceAndTime/Space/Derivatives/Grad.lean`
```lean
lemma gradSchwartz_apply_eq_grad {d} (η : 𝓢(Space d, ℝ)) (x : Space d):
```
## Veri... | diff --git a/PhysLean/SpaceAndTime/Space/Derivatives/Grad.lean b/PhysLean/SpaceAndTime/Space/Derivatives/Grad.lean
--- a/PhysLean/SpaceAndTime/Space/Derivatives/Grad.lean
+++ b/PhysLean/SpaceAndTime/Space/Derivatives/Grad.lean
@@ -45,6 +45,7 @@ of the input function with respect to each spatial coordinate.
- B.3. Th... | 19 | 0 | 19 | 7.5 | diff_derived | false | 31 | 1 | 0 | 1 | 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:41Z | extraction_pipeline_v2 |
LB-0204 | pr_completion | easy | 2.7 | google-deepmind/formal-conjectures | 3,665 | feat(ErdosProblems/125): additional variants | https://github.com/google-deepmind/formal-conjectures/pull/3665 | erdos-problems | 0257dab7870e909c1024d1e1e63a96ec391cda62 | e1e26e7239a9e33c76756ce4e0bbdf72ea6fff01 | FormalConjectures/ErdosProblems/125.lean | FormalConjectures/ErdosProblems/125.lean | # Task: feat(ErdosProblems/125): additional variants
## Files affected
- FormalConjectures/ErdosProblems/125.lean (+60/-17)
## Theorems to prove
### `erdos_125.variants.zero_density` in `FormalConjectures/ErdosProblems/125.lean`
```lean
theorem erdos_125.variants.zero_density :
```
### `erdos_125.variants.zero_lowe... | diff --git a/FormalConjectures/ErdosProblems/125.lean b/FormalConjectures/ErdosProblems/125.lean
--- a/FormalConjectures/ErdosProblems/125.lean
+++ b/FormalConjectures/ErdosProblems/125.lean
@@ -20,54 +20,97 @@ import FormalConjectures.Util.ProblemImports
# Erdős Problem 125
*Reference:* [erdosproblems.com/125](htt... | 60 | 17 | 77 | 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:41Z | extraction_pipeline_v2 |
LB-0205 | pr_completion | easy | 0.6 | leanprover-community/physlib | 989 | feat(Commutation): prove `angularMomentumSqr_commutation_angularMomentum` | https://github.com/leanprover-community/physlib/pull/989 | ready-to-merge | c1cdc445375e57aa1b9f557a5d151cf5485889c0 | 55cf337847c4dc0b04d10e0cf0baf5b35bab5551 | PhysLean/QuantumMechanics/DDimensions/Operators/Commutation.lean | PhysLean/QuantumMechanics/DDimensions/Operators/Commutation.lean | # Task: feat(Commutation): prove `angularMomentumSqr_commutation_angularMomentum`
## Context
This PR adds proofs autoformalised by @Aristotle-Harmonic.
Co-authored-by: Aristotle (Harmonic) <aristotle-harmonic@harmonic.fun>
## Files affected
- PhysLean/QuantumMechanics/DDimensions/Operators/Commutation.lean (+18/-2)
... | diff --git a/PhysLean/QuantumMechanics/DDimensions/Operators/Commutation.lean b/PhysLean/QuantumMechanics/DDimensions/Operators/Commutation.lean
--- a/PhysLean/QuantumMechanics/DDimensions/Operators/Commutation.lean
+++ b/PhysLean/QuantumMechanics/DDimensions/Operators/Commutation.lean
@@ -406,10 +406,26 @@ lemma angul... | 18 | 2 | 20 | 6.5 | diff_derived | false | 130 | 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:41Z | extraction_pipeline_v2 |
LB-0206 | pr_completion | medium | 6.2 | leanprover-community/physlib | 993 | feat(QM): unbounded operator inequalities | https://github.com/leanprover-community/physlib/pull/993 | ready-to-merge,t-quantum-mechanics | c1cdc445375e57aa1b9f557a5d151cf5485889c0 | 3b36ebe15f85ab1e0bf9beb2a8e2ec945aba6d84 | PhysLean/QuantumMechanics/DDimensions/Operators/Unbounded.lean | PhysLean/QuantumMechanics/DDimensions/Operators/Unbounded.lean | # Task: feat(QM): unbounded operator inequalities
## Context
- Defines `IsSymmetric` for unbounded operators and shows this is equivalent to having `⟪Tx, x⟫` real.
- Adds inequalities satisfied by all unbounded operators (`le_adjoint_adjoint`, `adjoint_ge_adjoint_of_le` and `closure_mono`).
- Adds inequality charact... | diff --git a/PhysLean/QuantumMechanics/DDimensions/Operators/Unbounded.lean b/PhysLean/QuantumMechanics/DDimensions/Operators/Unbounded.lean
--- a/PhysLean/QuantumMechanics/DDimensions/Operators/Unbounded.lean
+++ b/PhysLean/QuantumMechanics/DDimensions/Operators/Unbounded.lean
@@ -12,22 +12,33 @@ public import PhysLea... | 130 | 27 | 157 | 8.5 | diff_derived | false | 351 | 1 | 0 | 16 | 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:42Z | extraction_pipeline_v2 |
LB-0207 | pr_completion | easy | 1.56 | leanprover-community/physlib | 997 | fix(Perm): correct `isFull_of_isFull` and `perm_uncontractedList` | https://github.com/leanprover-community/physlib/pull/997 | ready-to-merge | 7fac4dd118ae7962023b4b321c4bbedb7265e5da | 6a71a62581e43b295e5f6e8e7ddc75eb27ee0ce0 | PhysLean/QFT/PerturbationTheory/WickContraction/Perm.lean | PhysLean/QFT/PerturbationTheory/WickContraction/Perm.lean | # Task: fix(Perm): correct `isFull_of_isFull` and `perm_uncontractedList`
## Context
Adds `GradingCompliant` hypotheses to `isFull_of_isFull` and `perm_uncontractedList`, which were false without them.
Closes #992
Co-authored-by: Aristotle (Harmonic) <aristotle-harmonic@harmonic.fun>
## Files affected
- PhysLean/QF... | diff --git a/PhysLean/QFT/PerturbationTheory/WickContraction/Perm.lean b/PhysLean/QFT/PerturbationTheory/WickContraction/Perm.lean
--- a/PhysLean/QFT/PerturbationTheory/WickContraction/Perm.lean
+++ b/PhysLean/QFT/PerturbationTheory/WickContraction/Perm.lean
@@ -65,18 +65,20 @@ lemma trans (h12 : Perm φsΛ₁ φsΛ₂) (h23 :... | 10 | 8 | 18 | 8 | diff_derived | false | 201 | 1 | 0 | 2 | 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:42Z | extraction_pipeline_v2 |
LB-0208 | pr_completion | easy | 1.4 | leanprover-community/physlib | 988 | feat: remove `unfold deriv` | https://github.com/leanprover-community/physlib/pull/988 | easy,t-space-time | 60cb2c51b1569b83f1eec6459e027b5be229eb94 | 7fac4dd118ae7962023b4b321c4bbedb7265e5da | PhysLean/SpaceAndTime/Space/Derivatives/Basic.lean,PhysLean/SpaceAndTime/Space/Derivatives/Curl.lean | PhysLean/SpaceAndTime/Space/Derivatives/Basic.lean | # Task: feat: remove `unfold deriv`
## Context
Removing the use of `unfold deriv` in PhysLib. This is to make the API more robust against changes in definitions.
## Files affected
- PhysLean/SpaceAndTime/Space/Derivatives/Basic.lean (+11/-10)
- PhysLean/SpaceAndTime/Space/Derivatives/Curl.lean (+2/-2)
## Supporting ... | diff --git a/PhysLean/SpaceAndTime/Space/Derivatives/Basic.lean b/PhysLean/SpaceAndTime/Space/Derivatives/Basic.lean
--- a/PhysLean/SpaceAndTime/Space/Derivatives/Basic.lean
+++ b/PhysLean/SpaceAndTime/Space/Derivatives/Basic.lean
@@ -79,6 +79,10 @@ lemma deriv_eq [AddCommGroup M] [Module ℝ M] [TopologicalSpace M]
... | 13 | 12 | 25 | 7.5 | diff_derived | false | 114 | 2 | 0 | 1 | 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:42Z | extraction_pipeline_v2 |
LB-0209 | pr_completion | medium | 6.6 | leanprover-community/physlib | 982 | feat: Unbounded operator poset | https://github.com/leanprover-community/physlib/pull/982 | ready-to-merge,t-quantum-mechanics | 4379792b945c8a3270e2b7c907dd4997685771dd | 3256e1b141c7a9dd2c1b441e44d63e29e51e47ba | PhysLean/QuantumMechanics/DDimensions/Operators/Momentum.lean,PhysLean/QuantumMechanics/DDimensions/Operators/Position.lean,PhysLean/QuantumMechanics/DDimensions/Operators/Unbounded.lean | PhysLean/QuantumMechanics/DDimensions/Operators/Momentum.lean | # Task: feat: Unbounded operator poset
## Context
Adds the poset structure for unbounded operators, inherited from `LinearPMap`. This will allow, for example, for the simple characterization of symmetric operators as those for which `U ≤ U†`. Two inequalities, `le_closure` and `le_adjoint_adjoint` follow immediately f... | diff --git a/PhysLean/QuantumMechanics/DDimensions/Operators/Momentum.lean b/PhysLean/QuantumMechanics/DDimensions/Operators/Momentum.lean
--- a/PhysLean/QuantumMechanics/DDimensions/Operators/Momentum.lean
+++ b/PhysLean/QuantumMechanics/DDimensions/Operators/Momentum.lean
@@ -121,8 +121,7 @@ lemma momentumOperatorSch... | 94 | 67 | 161 | 8.5 | diff_derived | false | 505 | 3 | 0 | 7 | 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:42Z | extraction_pipeline_v2 |
LB-0210 | pr_completion | easy | 0.46 | google-deepmind/formal-conjectures | 3,666 | feat(ErdosProblems/125): solution for `positive_lower_density` | https://github.com/google-deepmind/formal-conjectures/pull/3666 | erdos-problems | 9ae988b398e823cea45955e5cf23e87e33244b2f | 0257dab7870e909c1024d1e1e63a96ec391cda62 | FormalConjectures/ErdosProblems/125.lean | FormalConjectures/ErdosProblems/125.lean | # Task: feat(ErdosProblems/125): solution for `positive_lower_density`
## Files affected
- FormalConjectures/ErdosProblems/125.lean (+10/-3)
## Verification
The patched repository must compile with `lake build`. | diff --git a/FormalConjectures/ErdosProblems/125.lean b/FormalConjectures/ErdosProblems/125.lean
--- a/FormalConjectures/ErdosProblems/125.lean
+++ b/FormalConjectures/ErdosProblems/125.lean
@@ -31,9 +31,12 @@ Let $A = {∑ ε_{k} 3^{k} : ε_{k} ∈ {0,1}}$ be the set of integers which
have only the digits $0, 1$ when writt... | 10 | 3 | 13 | 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:42Z | extraction_pipeline_v2 |
LB-0211 | pr_completion | medium | 6.6 | leanprover-community/physlib | 979 | feat: Kronecker delta api | https://github.com/leanprover-community/physlib/pull/979 | ready-to-merge,t-mathematics | 4379792b945c8a3270e2b7c907dd4997685771dd | 23b65a34db5286172926ac02d81bdde50ccbb55c | PhysLean/Mathematics/KroneckerDelta.lean,PhysLean/QuantumMechanics/DDimensions/Hydrogen/LaplaceRungeLenzVector.lean,PhysLean/QuantumMechanics/DDimensions/Operators/Commutation.lean | PhysLean/Mathematics/KroneckerDelta.lean | # Task: feat: Kronecker delta api
## Context
Introduces a basic api for the Kronecker delta function.
- I've kept to lemmas which adhere to the Einstein summation rules that indices occur at most twice in each term and free indices match across `=` (unless one side is zero). Hence no `δ[i,j] • f i j = δ[i,j] • f i i`... | diff --git a/PhysLean/Mathematics/KroneckerDelta.lean b/PhysLean/Mathematics/KroneckerDelta.lean
--- a/PhysLean/Mathematics/KroneckerDelta.lean
+++ b/PhysLean/Mathematics/KroneckerDelta.lean
@@ -5,33 +5,130 @@ Authors: Gregory J. Loges
-/
module
-public import Mathlib.Algebra.Ring.Basic
-public import PhysLean.Meta... | 159 | 104 | 263 | 8.5 | diff_derived | false | 467 | 3 | 0 | 18 | 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:42Z | extraction_pipeline_v2 |
LB-0212 | pr_completion | easy | 0.4 | leanprover/lean4 | 13,290 | fix: add checkInterrupted to Core.withIncRecDepth | https://github.com/leanprover/lean4/pull/13290 | toolchain-available,changelog-no | c4a664eb5db2648780fa3c7a4be6d439e7233a72 | d48863fc2bb15ffbb9b393fba4b5b0bd767fe391 | src/Lean/CoreM.lean | src/Lean/CoreM.lean | # Task: fix: add checkInterrupted to Core.withIncRecDepth
## Context
This PR adds a `checkInterrupted` call to `Core.withIncRecDepth`, so that all recursive CoreM-based operations (inferType, whnf, isDefEq, simp, …) check for cancellation on each recursion step. Previously, these operations could run for seconds witho... | diff --git a/src/Lean/CoreM.lean b/src/Lean/CoreM.lean
--- a/src/Lean/CoreM.lean
+++ b/src/Lean/CoreM.lean
@@ -446,10 +446,6 @@ Note that the value of `ctx.initHeartbeats` is ignored and replaced with `IO.get
@[inline] def CoreM.toIO' (x : CoreM α) (ctx : Context) (s : State) : IO α :=
(·.1) <$> x.toIO ctx s
-/--... | 6 | 4 | 10 | 7 | diff_derived | false | 702 | 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:42Z | extraction_pipeline_v2 |
LB-0213 | pr_completion | medium | 6.8 | leanprover-community/physlib | 978 | feat: Unbounded operators from H1 to H2 | https://github.com/leanprover-community/physlib/pull/978 | ready-to-merge,t-mathematics | 3b16e1b45d2e3cd498658895415703688361a3ff | 5e102b588a6c78d65a91c2e91f46f7d11ecbd6e0 | PhysLean/Mathematics/InnerProductSpace/Submodule.lean,PhysLean/QuantumMechanics/DDimensions/Operators/Momentum.lean,PhysLean/QuantumMechanics/DDimensions/Operators/Position.lean,PhysLean/QuantumMechanics/DDimensions/Operators/Unbounded.lean | PhysLean/Mathematics/InnerProductSpace/Submodule.lean | # Task: feat: Unbounded operators from H1 to H2
## Context
Generalizes the definition of unbounded operators to allow for different domain and codomain (cf. #957).
## Files affected
- PhysLean/Mathematics/InnerProductSpace/Submodule.lean (+20/-18)
- PhysLean/QuantumMechanics/DDimensions/Operators/Momentum.lean (+2/-2... | diff --git a/PhysLean/Mathematics/InnerProductSpace/Submodule.lean b/PhysLean/Mathematics/InnerProductSpace/Submodule.lean
--- a/PhysLean/Mathematics/InnerProductSpace/Submodule.lean
+++ b/PhysLean/Mathematics/InnerProductSpace/Submodule.lean
@@ -6,12 +6,12 @@ Authors: Gregory J. Loges
import Mathlib.Analysis.InnerPro... | 82 | 52 | 134 | 7.5 | diff_derived | false | 104 | 4 | 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:42Z | extraction_pipeline_v2 |
LB-0214 | pr_completion | easy | 0.48 | leanprover/lean4 | 13,231 | fix: add checkSystem to LCNF compiler passes | https://github.com/leanprover/lean4/pull/13231 | toolchain-available,changelog-no,changelog-compiler | 0cd6dbaad297021c43b906ec247de446d056056f | c4a664eb5db2648780fa3c7a4be6d439e7233a72 | src/Lean/Compiler/LCNF/PassManager.lean,src/Lean/Compiler/LCNF/Simp/Main.lean | src/Lean/Compiler/LCNF/PassManager.lean | # Task: fix: add checkSystem to LCNF compiler passes
## Context
This PR adds checkSystem calls to the LCNF compiler to improve IDE cancellation responsiveness during compilation of large declarations.
Two changes:
1. `Pass.mkPerDeclaration` now calls `checkSystem` before processing each declaration, allowing interrup... | diff --git a/src/Lean/Compiler/LCNF/PassManager.lean b/src/Lean/Compiler/LCNF/PassManager.lean
--- a/src/Lean/Compiler/LCNF/PassManager.lean
+++ b/src/Lean/Compiler/LCNF/PassManager.lean
@@ -121,7 +121,7 @@ def mkPerDeclaration (name : Name) (phase : Phase)
occurrence := occurrence
phase := phase
name := name
... | 3 | 1 | 4 | 6.5 | diff_derived | false | 1,036 | 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:43Z | extraction_pipeline_v2 |
LB-0215 | pr_completion | hard | 7 | leanprover-community/physlib | 972 | feat: AddTorsor instance on space | https://github.com/leanprover-community/physlib/pull/972 | ready-to-merge,t-space-time | 3b16e1b45d2e3cd498658895415703688361a3ff | 740742fa875c92659f390b9acc40ff791b2e3d62 | PhysLean.lean,PhysLean/QuantumMechanics/DDimensions/SpaceDHilbertSpace/Basic.lean,PhysLean/SpaceAndTime/Space/Basic.lean,PhysLean/SpaceAndTime/Space/Integrals/Basic.lean,PhysLean/SpaceAndTime/Space/Module.lean | PhysLean.lean | # Task: feat: AddTorsor instance on space
## Context
Added an `AddTorsor` instance on `Space d` along with a number of other little results which are required to define this
## Files affected
- PhysLean.lean (+1/-0)
- PhysLean/QuantumMechanics/DDimensions/SpaceDHilbertSpace/Basic.lean (+1/-1)
- PhysLean/SpaceAndTime/... | diff --git a/PhysLean.lean b/PhysLean.lean
--- a/PhysLean.lean
+++ b/PhysLean.lean
@@ -352,6 +352,7 @@ import PhysLean.SpaceAndTime.Space.Integrals.Basic
import PhysLean.SpaceAndTime.Space.Integrals.RadialAngularMeasure
import PhysLean.SpaceAndTime.Space.IsDistBounded
import PhysLean.SpaceAndTime.Space.LengthUnit
+i... | 685 | 564 | 1,249 | 5.5 | diff_derived | false | 120 | 5 | 0 | 61 | 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:43Z | extraction_pipeline_v2 |
LB-0216 | pr_completion | easy | 0.9 | leanprover-community/physlib | 974 | feat: Space deriv in terms of mfderiv | https://github.com/leanprover-community/physlib/pull/974 | easy,ready-to-merge,t-space-time | 120e2202041fd7cf90fac61a8a4b985315c044a3 | 3b16e1b45d2e3cd498658895415703688361a3ff | PhysLean/SpaceAndTime/Space/Derivatives/Basic.lean | PhysLean/SpaceAndTime/Space/Derivatives/Basic.lean | # Task: feat: Space deriv in terms of mfderiv
## Context
Adding a lemma to rewrite `Space.deriv` in terms of `mfderiv`.
## Files affected
- PhysLean/SpaceAndTime/Space/Derivatives/Basic.lean (+10/-0)
## Supporting lemmas
- `deriv_eq_mfderiv` in `PhysLean/SpaceAndTime/Space/Derivatives/Basic.lean`
```lean
lemma d... | diff --git a/PhysLean/SpaceAndTime/Space/Derivatives/Basic.lean b/PhysLean/SpaceAndTime/Space/Derivatives/Basic.lean
--- a/PhysLean/SpaceAndTime/Space/Derivatives/Basic.lean
+++ b/PhysLean/SpaceAndTime/Space/Derivatives/Basic.lean
@@ -6,6 +6,7 @@ Authors: Zhi Kai Pong, Joseph Tooby-Smith, Lode Vermeulen
import Mathlib... | 10 | 0 | 10 | 7.5 | diff_derived | false | 62 | 1 | 0 | 1 | 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:43Z | extraction_pipeline_v2 |
LB-0217 | pr_completion | hard | 7 | leanprover-community/physlib | 963 | feat: Position & momentum unbounded operators | https://github.com/leanprover-community/physlib/pull/963 | ready-to-merge,t-quantum-mechanics | 6286c6b614977a8d6a83086aa6e0c52d7975e4af | 120e2202041fd7cf90fac61a8a4b985315c044a3 | PhysLean/QuantumMechanics/DDimensions/Operators/Commutation.lean,PhysLean/QuantumMechanics/DDimensions/Operators/Momentum.lean,PhysLean/QuantumMechanics/DDimensions/Operators/Position.lean,PhysLean/QuantumMechanics/DDimensions/Operators/Unbounded.lean,PhysLean/QuantumMechanics/DDimensions/SpaceDHilbertSpace/SchwartzSub... | PhysLean/QuantumMechanics/DDimensions/Operators/Commutation.lean | # Task: feat: Position & momentum unbounded operators
## Context
Continues on from #957 and makes progress on #851.
Introduces `schwartzEquiv`, the `LinearEquiv` between Schwartz functions and their image in the Hilbert space, along with some basic properties. This bijection is then used to define three symmetric u... | diff --git a/PhysLean/QuantumMechanics/DDimensions/Operators/Commutation.lean b/PhysLean/QuantumMechanics/DDimensions/Operators/Commutation.lean
--- a/PhysLean/QuantumMechanics/DDimensions/Operators/Commutation.lean
+++ b/PhysLean/QuantumMechanics/DDimensions/Operators/Commutation.lean
@@ -126,8 +126,10 @@ lemma positi... | 175 | 60 | 235 | 8 | diff_derived | false | 779 | 5 | 0 | 18 | 11 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | algebra | 2026-04-28T12:40:44Z | extraction_pipeline_v2 |
LB-0218 | pr_completion | easy | 1.9 | leanprover/lean4 | 13,280 | feat: add `backward.isDefEq.respectTransparency.types` option | https://github.com/leanprover/lean4/pull/13280 | changelog-language | 3770b3dcb8b1b3340e0252760dc68e8e61daef06 | 9f49ea63e2f3434c7bec208dc435486df530d60f | src/Lean/CoreM.lean,src/Lean/Meta/ExprDefEq.lean | src/Lean/CoreM.lean | # Task: feat: add `backward.isDefEq.respectTransparency.types` option
## Context
This PR adds a new option `backward.isDefEq.respectTransparency.types` that controls the transparency used when checking whether the type of a metavariable matches the type of the term being assigned to it during `checkTypesAndAssign`. Pr... | diff --git a/src/Lean/CoreM.lean b/src/Lean/CoreM.lean
--- a/src/Lean/CoreM.lean
+++ b/src/Lean/CoreM.lean
@@ -20,6 +20,8 @@ register_builtin_option diagnostics : Bool := {
descr := "collect diagnostic information"
}
+builtin_initialize registerTraceClass `diagnostics
+
register_builtin_option diagnostics.thr... | 49 | 14 | 63 | 8 | diff_derived | false | 1,287 | 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:45Z | extraction_pipeline_v2 |
LB-0219 | pr_completion | hard | 7 | leanprover-community/physlib | 957 | feat: Hilbert space & unbounded operators on Space | https://github.com/leanprover-community/physlib/pull/957 | ready-to-merge,t-quantum-mechanics | c901c54dfab7b9e733a780b842072b47d0ab2aec | 6286c6b614977a8d6a83086aa6e0c52d7975e4af | PhysLean.lean,PhysLean/Mathematics/InnerProductSpace/Submodule.lean,PhysLean/QuantumMechanics/DDimensions/Operators/Unbounded.lean,PhysLean/QuantumMechanics/DDimensions/SpaceDHilbertSpace/Basic.lean,PhysLean/QuantumMechanics/DDimensions/SpaceDHilbertSpace/SchwartzSubmodule.lean | PhysLean.lean | # Task: feat: Hilbert space & unbounded operators on Space
## Context
Initial progress for single-particle QM on `Space d`, addressing #851.
`SpaceDHilbertSpace` and `SchwartzSubmodule` carry over from 1d with only minor changes (cf. [OneDimension/HilbertSpace](https://github.com/lean-phys-community/PhysLean/tree/m... | diff --git a/PhysLean.lean b/PhysLean.lean
--- a/PhysLean.lean
+++ b/PhysLean.lean
@@ -57,6 +57,7 @@ import PhysLean.Mathematics.Geometry.Metric.Riemannian.Defs
import PhysLean.Mathematics.InnerProductSpace.Adjoint
import PhysLean.Mathematics.InnerProductSpace.Basic
import PhysLean.Mathematics.InnerProductSpace.Calc... | 529 | 0 | 529 | 7 | diff_derived | false | 857 | 5 | 0 | 44 | 10 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | algebra | 2026-04-28T12:40:45Z | extraction_pipeline_v2 |
LB-0220 | pr_completion | medium | 6 | leanprover/lean4 | 13,273 | feat: add `mkAppNS`, `mkAppRevS`, `betaRevS`, `betaS`, and related `Sym` functions | https://github.com/leanprover/lean4/pull/13273 | changelog-library | 608e0d06a86b7e805aeab4862539675d073a7bf5 | 3c6ea49d0e4ff3a924452809ca5aeb41b0611bef | src/Lean/Meta/Sym/AbstractS.lean,src/Lean/Meta/Sym/AlphaShareBuilder.lean,src/Lean/Meta/Sym/InstantiateS.lean,src/Lean/Meta/Tactic/Cbv/Main.lean,src/Lean/Meta/Tactic/Cbv/Util.lean | src/Lean/Meta/Sym/AbstractS.lean | # Task: feat: add `mkAppNS`, `mkAppRevS`, `betaRevS`, `betaS`, and related `Sym` functions
## Context
This PR adds a comprehensive public API for constructing maximally shared
expression applications and performing beta reduction in the `Sym` framework.
These functions were previously defined locally in the VC generat... | diff --git a/src/Lean/Meta/Sym/AbstractS.lean b/src/Lean/Meta/Sym/AbstractS.lean
--- a/src/Lean/Meta/Sym/AbstractS.lean
+++ b/src/Lean/Meta/Sym/AbstractS.lean
@@ -97,4 +97,16 @@ public def mkLambdaFVarsS (xs : Array Expr) (e : Expr) : SymM Expr := do
let type ← abstractFVarsRange decl.type i xs
mkLambdaS decl... | 74 | 20 | 94 | 8 | diff_derived | false | 975 | 5 | 0 | 0 | 8 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:40:45Z | extraction_pipeline_v2 |
LB-0221 | pr_completion | easy | 3.16 | leanprover-community/physlib | 967 | Prove energy dissipation rate for damped harmonic oscillator | https://github.com/leanprover-community/physlib/pull/967 | ready-to-merge,t-classical-mechanics | 993eb6937c488f5018e804cd5ce1311ab6bf0cc9 | 899e38ad20b8ba893baab289662cf9455b95f77d | PhysLean/ClassicalMechanics/DampedHarmonicOscillator/Basic.lean | PhysLean/ClassicalMechanics/DampedHarmonicOscillator/Basic.lean | # Task: Prove energy dissipation rate for damped harmonic oscillator
## Context
Builds on #891 by adding proofs of the energy dissipation rate for a damped harmonic oscillator.
## Files affected
- PhysLean/ClassicalMechanics/DampedHarmonicOscillator/Basic.lean (+41/-7)
## Supporting lemmas
- `kineticEnergy_eq` in `P... | diff --git a/PhysLean/ClassicalMechanics/DampedHarmonicOscillator/Basic.lean b/PhysLean/ClassicalMechanics/DampedHarmonicOscillator/Basic.lean
--- a/PhysLean/ClassicalMechanics/DampedHarmonicOscillator/Basic.lean
+++ b/PhysLean/ClassicalMechanics/DampedHarmonicOscillator/Basic.lean
@@ -61,13 +61,8 @@ References for the... | 41 | 7 | 48 | 8 | diff_derived | false | 96 | 1 | 0 | 4 | 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:45Z | extraction_pipeline_v2 |
LB-0222 | pr_completion | easy | 1.6 | leanprover/lean4 | 13,272 | fix: extend sym canonicalizer reductions to value positions | https://github.com/leanprover/lean4/pull/13272 | changelog-tactics | 5fdeaf0d5a8d81aa3c931e9071e4d7f17293feab | 608e0d06a86b7e805aeab4862539675d073a7bf5 | src/Lean/Meta/Sym/Canon.lean,tests/elab/grind_11124.lean,tests/elab/grind_lia_regression.lean | src/Lean/Meta/Sym/Canon.lean | # Task: fix: extend sym canonicalizer reductions to value positions
## Context
This PR extends the sym canonicalizer to apply reductions (projection, match/ite/cond, Nat
arithmetic) in all positions, not just inside types. Previously, a value `v` appearing in a
type `T(v)` could remain unreduced while `T(v)` was norma... | diff --git a/src/Lean/Meta/Sym/Canon.lean b/src/Lean/Meta/Sym/Canon.lean
--- a/src/Lean/Meta/Sym/Canon.lean
+++ b/src/Lean/Meta/Sym/Canon.lean
@@ -24,21 +24,29 @@ builtin_initialize registerTraceClass `sym.debug.canon
Canonicalizes expressions by normalizing types and instances. At the top level, it traverses
appli... | 59 | 38 | 97 | 6.5 | diff_derived | false | 1,105 | 3 | 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:46Z | extraction_pipeline_v2 |
LB-0223 | pr_completion | easy | 0.72 | leanprover-community/physlib | 960 | feat(Generalized): prove `generalizedBoost_timeComponent_eq` | https://github.com/leanprover-community/physlib/pull/960 | t-relativity | c901c54dfab7b9e733a780b842072b47d0ab2aec | 6d5baa16232274422b9602794d88b876462d1547 | PhysLean/Relativity/LorentzGroup/Boosts/Generalized.lean | PhysLean/Relativity/LorentzGroup/Boosts/Generalized.lean | # Task: feat(Generalized): prove `generalizedBoost_timeComponent_eq`
## Context
This PR adds proofs autoformalised by @Aristotle-Harmonic.
The original statement used `‖...‖` (norm) but the correct formula uses `‖...‖ ^ 2`
(norm squared). A numerical counterexample for the original: u = (1,0), v = (cosh 1, sinh 1)
gi... | diff --git a/PhysLean/Relativity/LorentzGroup/Boosts/Generalized.lean b/PhysLean/Relativity/LorentzGroup/Boosts/Generalized.lean
--- a/PhysLean/Relativity/LorentzGroup/Boosts/Generalized.lean
+++ b/PhysLean/Relativity/LorentzGroup/Boosts/Generalized.lean
@@ -451,25 +451,27 @@ lemma generalizedBoost_inv (u v : Velocity ... | 14 | 12 | 26 | 6.5 | diff_derived | false | 363 | 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:46Z | extraction_pipeline_v2 |
LB-0224 | pr_completion | easy | 1.8 | leanprover/lean4 | 13,271 | fix: handle propositional and decidable instances in sym canonicalizer | https://github.com/leanprover/lean4/pull/13271 | changelog-tactics | da91aed2e2cc13d8c9463511b2f1833f7c961cc4 | 5fdeaf0d5a8d81aa3c931e9071e4d7f17293feab | src/Lean/Meta/Sym/Canon.lean,src/Lean/Meta/Sym/SymM.lean,tests/elab/grind_indexmap_trace.lean,tests/elab/grind_prop_inst.lean | src/Lean/Meta/Sym/Canon.lean | # Task: fix: handle propositional and decidable instances in sym canonicalizer
## Context
This PR refactors instance canonicalization in the sym canonicalizer to properly handle
\`Grind.nestedProof\` and \`Grind.nestedDecidable\` markers. Previously, the canonicalizer
would report an issue when it failed to resynthesi... | diff --git a/src/Lean/Meta/Sym/Canon.lean b/src/Lean/Meta/Sym/Canon.lean
--- a/src/Lean/Meta/Sym/Canon.lean
+++ b/src/Lean/Meta/Sym/Canon.lean
@@ -27,6 +27,10 @@ applications, foralls, lambdas, and let-bindings, classifying each argument as a
implicit, or value using `shouldCanon`. Values are recursively visited but n... | 193 | 70 | 263 | 6 | diff_derived | false | 1,007 | 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:46Z | extraction_pipeline_v2 |
LB-0225 | pr_completion | easy | 2.02 | leanprover/lean4 | 13,266 | fix: show missing match cases in declaration order | https://github.com/leanprover/lean4/pull/13266 | toolchain-available,changelog-language | 772b5663d2234b4bedf647ec119c1246c98e8f33 | e57d84bba015aae7d3d1809d7a34a1403b61d56b | src/Lean/Elab/Match.lean,src/Lean/Meta/Match/Basic.lean,src/Lean/Meta/Match/Match.lean,tests/elab/matchMissingCase.lean,tests/elab/nested_match_slowdown.lean | src/Lean/Elab/Match.lean | # Task: fix: show missing match cases in declaration order
## Context
This PR changes the counter-example accumulator in the match compiler from
a `List` (built with cons, producing reverse order) to an `Array` (built
with push, preserving declaration order). Missing cases are now reported in
the order constructors ap... | diff --git a/src/Lean/Elab/Match.lean b/src/Lean/Elab/Match.lean
--- a/src/Lean/Elab/Match.lean
+++ b/src/Lean/Elab/Match.lean
@@ -1044,7 +1044,7 @@ def reportMatcherResultErrors (altLHSS : List AltLHS) (result : MatcherResult) :
unless result.counterExamples.isEmpty do
let maxCEx := Meta.Match.match.maxCounter... | 13 | 13 | 26 | 7.5 | diff_derived | false | 428 | 5 | 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:47Z | extraction_pipeline_v2 |
LB-0226 | pr_completion | easy | 2.6 | leanprover/lean4 | 13,222 | perf: limit counter-example generation in match compiler | https://github.com/leanprover/lean4/pull/13222 | builds-mathlib,toolchain-available,mathlib4-nightly-available | acae2b44fd8bb0c0009b4428529da9da6212df08 | c7983a8c6504a534daf147ccf9829e0e9ef41fb9 | src/Lean/Elab/Match.lean,src/Lean/Meta/Match/Match.lean,tests/elab/nested_match_slowdown.lean | src/Lean/Elab/Match.lean | # Task: perf: limit counter-example generation in match compiler
## Context
This PR adds a `match.maxCounterExamples` option (default 5) to bound the
number of "missing cases" counter-examples the match compiler generates.
When the match compiler runs out of alternatives for a variable, it
case-splits to explore miss... | diff --git a/src/Lean/Elab/Match.lean b/src/Lean/Elab/Match.lean
--- a/src/Lean/Elab/Match.lean
+++ b/src/Lean/Elab/Match.lean
@@ -1042,7 +1042,16 @@ def mkRedundantAlternativeMsg (altName? : Option Name) (altMsg? : Option Message
def reportMatcherResultErrors (altLHSS : List AltLHS) (result : MatcherResult) : TermE... | 102 | 5 | 107 | 8 | diff_derived | false | 970 | 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:47Z | extraction_pipeline_v2 |
LB-0227 | pr_completion | easy | 3.3 | leanprover/lean4 | 13,243 | feat: no default values for structure instance notation patterns | https://github.com/leanprover/lean4/pull/13243 | builds-mathlib,toolchain-available,changelog-language,builds-manual,mathlib4-nightly-available | 097f3ebdbc8e320aaa617475dd21e4fb8d209767 | acae2b44fd8bb0c0009b4428529da9da6212df08 | src/Lean/Elab/PatternVar.lean,src/Lean/Elab/StructInst.lean,src/Lean/PrettyPrinter/Delaborator/Builtins.lean,tests/elab/10753.lean | src/Lean/Elab/PatternVar.lean | # Task: feat: no default values for structure instance notation patterns
## Context
This PR changes elaboration of structure instance notation when used in patterns (e.g. `s matches { x := 1, y := [] }`) so that the structure's default values are not used to elaborate the pattern. The motivation is that default values... | diff --git a/src/Lean/Elab/PatternVar.lean b/src/Lean/Elab/PatternVar.lean
--- a/src/Lean/Elab/PatternVar.lean
+++ b/src/Lean/Elab/PatternVar.lean
@@ -320,7 +320,7 @@ where
if f.getKind == ``Parser.Term.dotIdent then
let namedArgsNew ← namedArgs.mapM fun
-- We must ensure that `ref[1]` remains orig... | 118 | 59 | 177 | 8 | diff_derived | false | 1,208 | 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:48Z | extraction_pipeline_v2 |
LB-0228 | pr_completion | easy | 2.8 | leanprover/lean4 | 13,255 | feat: add `letConfig` support to `do` block `let`/`have` | https://github.com/leanprover/lean4/pull/13255 | toolchain-available,changelog-language | 5bf590e710d55e43d188a47310c8112d43b88da6 | aaf0f6e7f5b925d983c6893be62866232e28280d | src/Lean/Elab/BuiltinDo/Let.lean,src/Lean/Elab/Do/InferControlInfo.lean,src/Lean/Elab/Do/Legacy.lean,tests/elab/doLetConfig.lean | src/Lean/Elab/BuiltinDo/Let.lean | # Task: feat: add `letConfig` support to `do` block `let`/`have`
## Context
This PR adds support for let configuration options (`(eq := h)`, `+nondep`, `+usedOnly`, `+zeta`) in `do` block `let` and `have` declarations, matching the behavior available in term-level `let`/`have`. Configuration options are rejected with ... | diff --git a/src/Lean/Elab/BuiltinDo/Let.lean b/src/Lean/Elab/BuiltinDo/Let.lean
--- a/src/Lean/Elab/BuiltinDo/Let.lean
+++ b/src/Lean/Elab/BuiltinDo/Let.lean
@@ -81,8 +81,15 @@ private def pushTypeIntoReassignment (letOrReassign : LetOrReassign) (decl : TSy
else
pure decl
-partial def elabDoLetOrReassign (le... | 201 | 81 | 282 | 7.5 | diff_derived | false | 650 | 4 | 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:49Z | extraction_pipeline_v2 |
LB-0229 | pr_completion | easy | 1.9 | leanprover/lean4 | 13,257 | test: add empty-by completion tests and column-0 test marker | https://github.com/leanprover/lean4/pull/13257 | changelog-server | 5bf590e710d55e43d188a47310c8112d43b88da6 | f7ec39d6a164820200fc971fe675eb02e6b30591 | src/Lean/Server/Test/Runner.lean,tests/server_interactive/completionEmptyBy.lean | src/Lean/Server/Test/Runner.lean | # Task: test: add empty-by completion tests and column-0 test marker
## Context
This PR adds test infrastructure and tests for tactic completion in empty `by` blocks.
**Test runner improvements (`src/Lean/Server/Test/Runner.lean`):**
- Add `--⬑` marker variant that targets the column of `--` itself, enabling column 0... | diff --git a/src/Lean/Server/Test/Runner.lean b/src/Lean/Server/Test/Runner.lean
--- a/src/Lean/Server/Test/Runner.lean
+++ b/src/Lean/Server/Test/Runner.lean
@@ -641,13 +641,13 @@ def processGenericRequest : RunnerM Unit := do
let params := params.setObjVal! "position" (toJson s.pos)
logResponse s.method params
... | 131 | 4 | 135 | 8 | diff_derived | false | 792 | 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:49Z | extraction_pipeline_v2 |
LB-0230 | pr_completion | easy | 1.18 | leanprover/lean4 | 13,242 | fix: correct `String` cases codegen to use `String.toByteArray` | https://github.com/leanprover/lean4/pull/13242 | breaks-mathlib,toolchain-available,changelog-compiler,mathlib4-nightly-available | 097f3ebdbc8e320aaa617475dd21e4fb8d209767 | 8dc4c16fce958530bec47314b1adec926a0d7b07 | src/Lean/Compiler/LCNF/ToMono.lean,tests/elab/string_cases.lean | src/Lean/Compiler/LCNF/ToMono.lean | # Task: fix: correct `String` cases codegen to use `String.toByteArray`
## Context
This PR fixes the compiler handling of pattern matching on the `String` constructor to conform to the new `String` representation.
## Files affected
- src/Lean/Compiler/LCNF/ToMono.lean (+2/-2)
- tests/elab/string_cases.lean (+10/-0)
... | diff --git a/src/Lean/Compiler/LCNF/ToMono.lean b/src/Lean/Compiler/LCNF/ToMono.lean
--- a/src/Lean/Compiler/LCNF/ToMono.lean
+++ b/src/Lean/Compiler/LCNF/ToMono.lean
@@ -279,13 +279,13 @@ partial def casesFloatArrayToMono (c : Cases .pure) (_ : c.typeName == ``FloatAr
let k ← k.toMono
return .let decl k
-/-- E... | 12 | 2 | 14 | 7.5 | diff_derived | false | 130 | 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:51Z | extraction_pipeline_v2 |
LB-0231 | pr_completion | easy | 3.3 | leanprover/lean4 | 13,245 | feat: allow dotted function notation to use `@` and explicit universes | https://github.com/leanprover/lean4/pull/13245 | builds-mathlib,toolchain-available,changelog-language,builds-manual,mathlib4-nightly-available | 8f1c18d9f4d9fd5042bec7710c5f57da0216aa93 | 861bc19e0c1c45b5766cc5c9ef0488568368b236 | src/Lean/Elab/App.lean,src/Lean/Elab/Term/TermElabM.lean,src/Lean/Parser/Term.lean,tests/elab/10984.lean | src/Lean/Elab/App.lean | # Task: feat: allow dotted function notation to use `@` and explicit universes
## Context
This PR extends Lean syntax for dotted function notation (`.f`) to add support for explicit mode (`@.f`), explicit universes (`.f.{u,v}`), and both simultaneously (`@.f.{u,v}`). This also includes a fix for a bug involving overlo... | diff --git a/src/Lean/Elab/App.lean b/src/Lean/Elab/App.lean
--- a/src/Lean/Elab/App.lean
+++ b/src/Lean/Elab/App.lean
@@ -1832,13 +1832,15 @@ To infer a namespace from the expected type, we do the following operations:
- if the type is of the form `c x₁ ... xₙ` with `c` a constant, then try using `c` as the namespace... | 153 | 21 | 174 | 7.5 | diff_derived | false | 373 | 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:51Z | extraction_pipeline_v2 |
LB-0232 | pr_completion | easy | 2.9 | leanprover/lean4 | 13,235 | perf: use memcmp for ByteArray equality | https://github.com/leanprover/lean4/pull/13235 | toolchain-available,changelog-library | eac93159622ac6527ea698da4351d65b03abdfd4 | 097f3ebdbc8e320aaa617475dd21e4fb8d209767 | src/Init/Data/ByteArray/Basic.lean,tests/elab/bytearray_eq.lean | src/Init/Data/ByteArray/Basic.lean | # Task: perf: use memcmp for ByteArray equality
## Context
This PR uses `std::memcmp` for `ByteArray` `BEq` and `DecidableEq`.
Implementation is done in the same way as `String` but adapted to scalar arrays.
## Files affected
- src/Init/Data/ByteArray/Basic.lean (+11/-3)
- tests/elab/bytearray_eq.lean (+59/-0)
## D... | diff --git a/src/Init/Data/ByteArray/Basic.lean b/src/Init/Data/ByteArray/Basic.lean
--- a/src/Init/Data/ByteArray/Basic.lean
+++ b/src/Init/Data/ByteArray/Basic.lean
@@ -20,12 +20,20 @@ universe u
namespace ByteArray
-deriving instance BEq for ByteArray
+@[extern "lean_sarray_dec_eq"]
+def beq (lhs rhs : @& ByteA... | 70 | 3 | 73 | 8 | diff_derived | false | 149 | 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:52Z | extraction_pipeline_v2 |
LB-0233 | pr_completion | easy | 1.98 | leanprover/lean4 | 13,232 | fix: handle multi-discriminant casesOn in WF unfold equation generation | https://github.com/leanprover/lean4/pull/13232 | builds-mathlib,toolchain-available,changelog-language,builds-manual,mathlib4-nightly-available | 8b52f4e8f701a9b56a76e6e0e118ef587621c3e0 | 861f7228445dd92c38e08ba33842030a53cc7bca | src/Lean/Elab/PreDefinition/WF/Unfold.lean,tests/elab/issue13015.lean | src/Lean/Elab/PreDefinition/WF/Unfold.lean | # Task: fix: handle multi-discriminant casesOn in WF unfold equation generation
## Context
This PR fixes a panic when compiling mutually recursive definitions that use `casesOn` on indexed inductive types (e.g. `Vect`). The `splitMatchOrCasesOn` function in `WF.Unfold` asserted `matcherInfo.numDiscrs = 1`, but for ind... | diff --git a/src/Lean/Elab/PreDefinition/WF/Unfold.lean b/src/Lean/Elab/PreDefinition/WF/Unfold.lean
--- a/src/Lean/Elab/PreDefinition/WF/Unfold.lean
+++ b/src/Lean/Elab/PreDefinition/WF/Unfold.lean
@@ -73,8 +73,9 @@ def splitMatchOrCasesOn (mvarId : MVarId) (e : Expr) (matcherInfo : MatcherInfo)
if (← isMatcherApp ... | 27 | 2 | 29 | 8 | diff_derived | false | 510 | 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:52Z | extraction_pipeline_v2 |
LB-0234 | pr_completion | easy | 0.32 | leanprover/lean4 | 13,202 | fix: avoid heartbeat timeout in `symbolFrequencyExt` export | https://github.com/leanprover/lean4/pull/13202 | builds-mathlib,toolchain-available,changelog-tactics,mathlib4-nightly-available | fc0cf68539ad3b481a1802414c22c44506519c9d | 1aa860af33e1aa30fb8aff6339816999e89f921b | src/Lean/LibrarySuggestions/SymbolFrequency.lean | src/Lean/LibrarySuggestions/SymbolFrequency.lean | # Task: fix: avoid heartbeat timeout in `symbolFrequencyExt` export
## Context
This PR fixes a heartbeat timeout from an environment extension at the end of the file that cannot be avoided by raising the limit.
Fixes #12989
## Files affected
- src/Lean/LibrarySuggestions/SymbolFrequency.lean (+5/-1)
## Verificati... | diff --git a/src/Lean/LibrarySuggestions/SymbolFrequency.lean b/src/Lean/LibrarySuggestions/SymbolFrequency.lean
--- a/src/Lean/LibrarySuggestions/SymbolFrequency.lean
+++ b/src/Lean/LibrarySuggestions/SymbolFrequency.lean
@@ -66,7 +66,11 @@ Helper function for running `MetaM` code during module export, when there is n... | 5 | 1 | 6 | 6.5 | diff_derived | false | 147 | 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:53Z | extraction_pipeline_v2 |
LB-0235 | pr_completion | easy | 0.62 | leanprover/lean4 | 13,205 | fix: make `FirstTokens.seq (.optTokens _) .unknown` return `.unkown` | https://github.com/leanprover/lean4/pull/13205 | changelog-language | 48800e438c625b4066449d817acd355f078c12a4 | 8b52f4e8f701a9b56a76e6e0e118ef587621c3e0 | src/Lean/Parser/Types.lean,tests/elab/13203.lean | src/Lean/Parser/Types.lean | # Task: fix: make `FirstTokens.seq (.optTokens _) .unknown` return `.unkown`
## Context
This PR fixes `FirstTokens.seq (.optTokens s) .unknown` to return `.unknown`. This occurs e.g. when an optional (with first tokens `.optTokens s`) is followed by a parser category (with first tokens `.unknown`). Previously `FirstTo... | diff --git a/src/Lean/Parser/Types.lean b/src/Lean/Parser/Types.lean
--- a/src/Lean/Parser/Types.lean
+++ b/src/Lean/Parser/Types.lean
@@ -469,6 +469,7 @@ def seq : FirstTokens → FirstTokens → FirstTokens
| epsilon, tks => tks
| optTokens s₁, optTokens s₂ => optTokens (s₁ ++ s₂)
| optTokens s₁, t... | 11 | 0 | 11 | 6.5 | diff_derived | false | 491 | 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:53Z | extraction_pipeline_v2 |
LB-0236 | pr_completion | medium | 4.3 | leanprover/lean4 | 13,210 | test: lazy let-binding unfolding in sym mvcgen | https://github.com/leanprover/lean4/pull/13210 | toolchain-available,changelog-no | 48800e438c625b4066449d817acd355f078c12a4 | 504e099c5d61a1d5702a75a15485263e7617d1c9 | tests/bench/mvcgen/sym/cases/Cases.lean,tests/bench/mvcgen/sym/cases/Cases/LetBinding.lean,tests/bench/mvcgen/sym/lib/VCGen.lean,tests/bench/mvcgen/sym/test_vcgen.lean | tests/bench/mvcgen/sym/cases/Cases.lean | # Task: test: lazy let-binding unfolding in sym mvcgen
## Context
This PR replaces eager let-expression zeta-reduction in the sym-based mvcgen with on-demand unfolding that mirrors the production mvcgen's behavior.
Previously, all let-expressions in the program head were immediately zeta-reduced. Now, let-expressio... | diff --git a/tests/bench/mvcgen/sym/cases/Cases.lean b/tests/bench/mvcgen/sym/cases/Cases.lean
--- a/tests/bench/mvcgen/sym/cases/Cases.lean
+++ b/tests/bench/mvcgen/sym/cases/Cases.lean
@@ -3,6 +3,7 @@ import Cases.AddSubCancelDeep
import Cases.AddSubCancelSimp
import Cases.DiteSplit
import Cases.GetThrowSet
+impor... | 91 | 6 | 97 | 8 | diff_derived | false | 579 | 4 | 2 | 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:54Z | extraction_pipeline_v2 |
LB-0237 | pr_completion | easy | 0.32 | leanprover/lean4 | 13,172 | fix: missing borrow annotations in `Std.Internal.UV.System` | https://github.com/leanprover/lean4/pull/13172 | toolchain-available,changelog-library | 96dbc324f363d94f39373c9998773c59001d0b85 | 17795b02eebb6e1f83ce25fb71c53acf401708d8 | src/Std/Internal/UV/System.lean | src/Std/Internal/UV/System.lean | # Task: fix: missing borrow annotations in `Std.Internal.UV.System`
## Context
This PR adds borrow annotations in `Std.Internal.UV.System`.
## Files affected
- src/Std/Internal/UV/System.lean (+3/-3)
## Verification
The patched repository must compile with `lake build`. | diff --git a/src/Std/Internal/UV/System.lean b/src/Std/Internal/UV/System.lean
--- a/src/Std/Internal/UV/System.lean
+++ b/src/Std/Internal/UV/System.lean
@@ -174,19 +174,19 @@ opaque osEnviron : IO (Array (String × String))
Gets the value of an environment variable.
-/
@[extern "lean_uv_os_getenv"]
-opaque osGetenv... | 3 | 3 | 6 | 6 | diff_derived | false | 60 | 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:55Z | extraction_pipeline_v2 |
LB-0238 | pr_completion | medium | 6.8 | leanprover/lean4 | 13,188 | feat: `missingDocs` linter warns about empty doc strings | https://github.com/leanprover/lean4/pull/13188 | toolchain-available,changelog-language | 51e87865c598fcc34209f96f77dc23206f43b88b | f395593ffce1b94cdd025ba51c23aa5eeef7e353 | src/Lean/Elab/DocString.lean,src/Lean/Linter/MissingDocs.lean,tests/elab/linterCoe.lean,tests/elab/linterMissingDocs.lean | src/Lean/Elab/DocString.lean | # Task: feat: `missingDocs` linter warns about empty doc strings
## Context
This PR extends the `missingDocs` linter to detect and warn about empty doc strings (e.g. `/
## Files affected
- src/Lean/Elab/DocString.lean (+4/-0)
- src/Lean/Linter/MissingDocs.lean (+105/-44)
- tests/elab/linterCoe.lean (+1/-1)
- tests/el... | diff --git a/src/Lean/Elab/DocString.lean b/src/Lean/Elab/DocString.lean
--- a/src/Lean/Elab/DocString.lean
+++ b/src/Lean/Elab/DocString.lean
@@ -85,6 +85,10 @@ structure State where
-/
lctx : LocalContext
/--
+ The local instances.
+
+ The `MonadLift TermElabM DocM` instance runs the lifted action with the... | 144 | 45 | 189 | 7 | diff_derived | false | 92 | 4 | 0 | 0 | 12 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | algebra | 2026-04-28T12:40:55Z | extraction_pipeline_v2 |
LB-0239 | pr_completion | easy | 1.72 | leanprover/lean4 | 13,192 | fix: `if _ : p ...` syntax in new do elaborator | https://github.com/leanprover/lean4/pull/13192 | toolchain-available,changelog-language | 22308dbaaaf5763a2298a72c0f5d60a59f0fde01 | 313abdb49f640b54058168ac47d453a2222bc3ac | src/Lean/Elab/BuiltinDo/If.lean,tests/elab/doDepIfAnon.lean | src/Lean/Elab/BuiltinDo/If.lean | # Task: fix: `if _ : p ...` syntax in new do elaborator
## Context
This PR fixes the handling of anonymous dependent `if` (`if _ : cond then ... else ...`) inside `do` blocks when using the new do elaborator.
The `_%$tk` binder pattern was incorrectly quoted as `$(⟨tk⟩):hole` in the generated `dite` syntax, causing "... | diff --git a/src/Lean/Elab/BuiltinDo/If.lean b/src/Lean/Elab/BuiltinDo/If.lean
--- a/src/Lean/Elab/BuiltinDo/If.lean
+++ b/src/Lean/Elab/BuiltinDo/If.lean
@@ -63,6 +63,6 @@ where
doElabToSyntax "else branch of if with condition {cond}" (elabDiteBranch false) fun else_ => do
let mγ ← mkMonadicType (← read).doB... | 15 | 1 | 16 | 8 | diff_derived | false | 491 | 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:56Z | extraction_pipeline_v2 |
LB-0240 | pr_completion | medium | 6.2 | leanprover-community/physlib | 927 | feat(2HDM): Prove that arxiv:hep-ph/0605184 is invalid | https://github.com/leanprover-community/physlib/pull/927 | t-particles | a4145c963a6804668f4211ef1e5bb0197779d87d | 3aea6556b146b0b31bd9981a7e67de98de836138 | PhysLean/Particles/BeyondTheStandardModel/TwoHDM/Potential.lean | PhysLean/Particles/BeyondTheStandardModel/TwoHDM/Potential.lean | # Task: feat(2HDM): Prove that arxiv:hep-ph/0605184 is invalid
## Context
In this PR, we give the properties of the 2HDM potential in Lean, including stability conditions.
## Files affected
- PhysLean/Particles/BeyondTheStandardModel/TwoHDM/Potential.lean (+578/-82)
## Definitions to add
- `stabilityCounterExample` ... | diff --git a/PhysLean/Particles/BeyondTheStandardModel/TwoHDM/Potential.lean b/PhysLean/Particles/BeyondTheStandardModel/TwoHDM/Potential.lean
--- a/PhysLean/Particles/BeyondTheStandardModel/TwoHDM/Potential.lean
+++ b/PhysLean/Particles/BeyondTheStandardModel/TwoHDM/Potential.lean
@@ -6,18 +6,67 @@ Authors: Joseph Too... | 578 | 82 | 660 | 7 | diff_derived | false | 97 | 1 | 0 | 24 | 2 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | logic | 2026-04-28T12:40:57Z | extraction_pipeline_v2 |
LB-0241 | pr_completion | easy | 1.84 | leanprover-community/physlib | 936 | feat(2HDM): add eta and xi for stabilityCounterExample | https://github.com/leanprover-community/physlib/pull/936 | t-particles | 5656416627e54038bbee90e9c35294c8bf048d51 | 0f0ea1cf8232f3c183f057042d25d2c439a792bc | PhysLean/Particles/BeyondTheStandardModel/TwoHDM/Potential.lean | PhysLean/Particles/BeyondTheStandardModel/TwoHDM/Potential.lean | # Task: feat(2HDM): add eta and xi for stabilityCounterExample
## Context
Adding some results about a specific 2HDM potential which is of relevance to the stability condition.
## Files affected
- PhysLean/Particles/BeyondTheStandardModel/TwoHDM/Potential.lean (+32/-0)
## Supporting lemmas
- `stabilityCounterExample_... | diff --git a/PhysLean/Particles/BeyondTheStandardModel/TwoHDM/Potential.lean b/PhysLean/Particles/BeyondTheStandardModel/TwoHDM/Potential.lean
--- a/PhysLean/Particles/BeyondTheStandardModel/TwoHDM/Potential.lean
+++ b/PhysLean/Particles/BeyondTheStandardModel/TwoHDM/Potential.lean
@@ -216,6 +216,38 @@ def stabilityCou... | 32 | 0 | 32 | 8 | diff_derived | false | 101 | 1 | 0 | 2 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | logic | 2026-04-28T12:40:57Z | extraction_pipeline_v2 |
LB-0242 | pr_completion | hard | 7.2 | leanprover/cslib | 518 | feat: Tagged InferenceSystem | https://github.com/leanprover/cslib/pull/518 | logic | bd9df6cb3efb5205fca35b904b5ff16db6c2951f | b81a06ebc63ff4e6c06a1f11b993fd1174693e98 | Cslib/Foundations/Logic/InferenceSystem.lean,Cslib/Logics/LinearLogic/CLL/Basic.lean,Cslib/Logics/LinearLogic/CLL/CutElimination.lean,Cslib/Logics/LinearLogic/CLL/MLL.lean,CslibTests.lean,CslibTests/MLL.lean | Cslib/Foundations/Logic/InferenceSystem.lean | # Task: feat: Tagged InferenceSystem
## Context
Adds a tagged version of `InferenceSystem`, so that multiple inference systems for the same type can be instantiated and distinguished by means of a tag. Usage is exemplified with the multiplicative fragment of classical linear logic.
## Files affected
- Cslib/Foundatio... | diff --git a/Cslib/Foundations/Logic/InferenceSystem.lean b/Cslib/Foundations/Logic/InferenceSystem.lean
--- a/Cslib/Foundations/Logic/InferenceSystem.lean
+++ b/Cslib/Foundations/Logic/InferenceSystem.lean
@@ -14,38 +14,52 @@ namespace Cslib.Logic
/--
The notation typeclass for inference systems.
-This enables the... | 203 | 90 | 293 | 6 | diff_derived | false | 234 | 6 | 4 | 0 | 9 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | logic | 2026-04-28T12:40:58Z | extraction_pipeline_v2 |
LB-0243 | pr_completion | easy | 3.4 | leanprover-community/physlib | 937 | feat(2HDM): Add a couple of auxiliary lemmas & clean up code | https://github.com/leanprover-community/physlib/pull/937 | t-particles | 0f0ea1cf8232f3c183f057042d25d2c439a792bc | 08d3f3388230601397afab0b3a2ce4e64cc1eaae | PhysLean/Particles/BeyondTheStandardModel/TwoHDM/GramMatrix.lean,PhysLean/Particles/BeyondTheStandardModel/TwoHDM/Potential.lean | PhysLean/Particles/BeyondTheStandardModel/TwoHDM/GramMatrix.lean | # Task: feat(2HDM): Add a couple of auxiliary lemmas & clean up code
## Context
Add a small lemma to the 2HDM, and clean up the code.
## Files affected
- PhysLean/Particles/BeyondTheStandardModel/TwoHDM/GramMatrix.lean (+16/-0)
- PhysLean/Particles/BeyondTheStandardModel/TwoHDM/Potential.lean (+51/-42)
## Supporting... | diff --git a/PhysLean/Particles/BeyondTheStandardModel/TwoHDM/GramMatrix.lean b/PhysLean/Particles/BeyondTheStandardModel/TwoHDM/GramMatrix.lean
--- a/PhysLean/Particles/BeyondTheStandardModel/TwoHDM/GramMatrix.lean
+++ b/PhysLean/Particles/BeyondTheStandardModel/TwoHDM/GramMatrix.lean
@@ -322,6 +322,10 @@ lemma gramMa... | 67 | 42 | 109 | 7.5 | diff_derived | false | 53 | 2 | 0 | 4 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | logic | 2026-04-28T12:40:58Z | extraction_pipeline_v2 |
LB-0244 | pr_completion | easy | 1 | leanprover/cslib | 516 | feat(LocallyNameless/Untyped): generalize `swap_open_fvars` | https://github.com/leanprover/cslib/pull/516 | bd9df6cb3efb5205fca35b904b5ff16db6c2951f | f908775100fc8def08cd54f9846e654dce852fc7 | Cslib/Languages/LambdaCalculus/LocallyNameless/Untyped/Properties.lean | Cslib/Languages/LambdaCalculus/LocallyNameless/Untyped/Properties.lean | # Task: feat(LocallyNameless/Untyped): generalize `swap_open_fvars`
## Context
Generalize `swap_open_fvars` to `swap_open`
Remove `swap_open_fvars`
## Files affected
- Cslib/Languages/LambdaCalculus/LocallyNameless/Untyped/Properties.lean (+8/-7)
## Supporting lemmas
- `swap_open` in `Cslib/Languages/LambdaCalculus... | diff --git a/Cslib/Languages/LambdaCalculus/LocallyNameless/Untyped/Properties.lean b/Cslib/Languages/LambdaCalculus/LocallyNameless/Untyped/Properties.lean
--- a/Cslib/Languages/LambdaCalculus/LocallyNameless/Untyped/Properties.lean
+++ b/Cslib/Languages/LambdaCalculus/LocallyNameless/Untyped/Properties.lean
@@ -25,11... | 8 | 7 | 15 | 7.5 | diff_derived | false | 69 | 1 | 0 | 1 | 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:58Z | extraction_pipeline_v2 | |
LB-0245 | pr_completion | hard | 7.6 | leanprover/cslib | 504 | feat: recipe for logical fragments and multiplicative linear logic | https://github.com/leanprover/cslib/pull/504 | logic | 86a28164b3b6c4462d28bc6cb8aac6e69444f871 | f2951fda20fc4902276c22ceb8439286da381193 | Cslib.lean,Cslib/Logics/LinearLogic/CLL/Basic.lean,Cslib/Logics/LinearLogic/CLL/CutElimination.lean,Cslib/Logics/LinearLogic/CLL/EtaExpansion.lean,Cslib/Logics/LinearLogic/CLL/MLL.lean,Cslib/Logics/LinearLogic/CLL/PhaseSemantics/Basic.lean,CslibTests/CLL.lean,CslibTests/GrindLint.lean | Cslib.lean | # Task: feat: recipe for logical fragments and multiplicative linear logic
## Context
This PR:
- Adds multiplicative linear logic (MLL) as an example of how a fragment can be derived from a larger inference system (CLL), using Subtype and local recursive functions to eliminate irrelevant cases (see the example in the... | diff --git a/Cslib.lean b/Cslib.lean
--- a/Cslib.lean
+++ b/Cslib.lean
@@ -125,5 +125,6 @@ public import Cslib.Logics.HML.LogicalEquivalence
public import Cslib.Logics.LinearLogic.CLL.Basic
public import Cslib.Logics.LinearLogic.CLL.CutElimination
public import Cslib.Logics.LinearLogic.CLL.EtaExpansion
+public impor... | 171 | 79 | 250 | 6 | diff_derived | false | 364 | 8 | 4 | 0 | 10 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | logic | 2026-04-28T12:40:58Z | extraction_pipeline_v2 |
LB-0246 | pr_completion | medium | 6.8 | leanprover/cslib | 470 | feat: update operation for FinFun | https://github.com/leanprover/cslib/pull/470 | 86a28164b3b6c4462d28bc6cb8aac6e69444f871 | 1a7d871d39a61fe271d59e2964d29cab344a41e3 | Cslib.lean,Cslib/Foundations/Data/DecidableEqZero.lean,Cslib/Foundations/Data/FinFun/Basic.lean,Cslib/Foundations/Data/FinFun/Update.lean | Cslib.lean | # Task: feat: update operation for FinFun
## Context
This PR adds `FinFun.update` and proves some basic results about the functional interface and support of the resulting function.
## Files affected
- Cslib.lean (+3/-1)
- Cslib/Foundations/Data/DecidableEqZero.lean (+18/-0)
- Cslib/Foundations/Data/FinFun/Basic.lean... | diff --git a/Cslib.lean b/Cslib.lean
--- a/Cslib.lean
+++ b/Cslib.lean
@@ -48,7 +48,9 @@ public import Cslib.Foundations.Control.Monad.Free
public import Cslib.Foundations.Control.Monad.Free.Effects
public import Cslib.Foundations.Control.Monad.Free.Fold
public import Cslib.Foundations.Data.BiTape
-public import Csl... | 90 | 3 | 93 | 7.5 | diff_derived | false | 128 | 4 | 8 | 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:58Z | extraction_pipeline_v2 | |
LB-0247 | pr_completion | hard | 7.6 | leanprover/cslib | 464 | feat(Cryptography): formalise perfect secrecy and the one-time pad | https://github.com/leanprover/cslib/pull/464 | 0d37cc7fcc985cfc53b155e7eef2453f846c6da2 | 906574d376632467fd84a2a404efbe58a95fc13c | Cslib.lean,Cslib/Crypto/Protocols/PerfectSecrecy/Basic.lean,Cslib/Crypto/Protocols/PerfectSecrecy/Defs.lean,Cslib/Crypto/Protocols/PerfectSecrecy/Encryption.lean,Cslib/Crypto/Protocols/PerfectSecrecy/Internal/OneTimePad.lean,Cslib/Crypto/Protocols/PerfectSecrecy/Internal/PerfectSecrecy.lean,Cslib/Crypto/Protocols/Perfe... | Cslib.lean | # Task: feat(Cryptography): formalise perfect secrecy and the one-time pad
## Context
Adds `Cslib.Cryptography.PerfectSecrecy` with information-theoretic private-key encryption schemes and perfect secrecy following Katz-Lindell, Chapter 2:
- `EncScheme`: private-key encryption (Definition 2.1)
- `PerfectlySecret`:... | diff --git a/Cslib.lean b/Cslib.lean
--- a/Cslib.lean
+++ b/Cslib.lean
@@ -36,6 +36,13 @@ public import Cslib.Computability.URM.Defs
public import Cslib.Computability.URM.Execution
public import Cslib.Computability.URM.StandardForm
public import Cslib.Computability.URM.StraightLine
+public import Cslib.Crypto.Protoc... | 513 | 0 | 513 | 5.5 | diff_derived | false | 719 | 8 | 16 | 2 | 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:58Z | extraction_pipeline_v2 | |
LB-0248 | pr_completion | hard | 7.4 | leanprover-community/physlib | 947 | feat: Laplace-Runge-Lenz vector | https://github.com/leanprover-community/physlib/pull/947 | ready-to-merge | 0f0ea1cf8232f3c183f057042d25d2c439a792bc | 6ceec54fa801d5f04078c721548bd673ea41a4b2 | PhysLean.lean,PhysLean/Mathematics/KroneckerDelta.lean,PhysLean/QuantumMechanics/DDimensions/Hydrogen/Basic.lean,PhysLean/QuantumMechanics/DDimensions/Hydrogen/LaplaceRungeLenzVector.lean,PhysLean/QuantumMechanics/DDimensions/Operators/AngularMomentum.lean,PhysLean/QuantumMechanics/DDimensions/Operators/Commutation.lea... | PhysLean.lean | # Task: feat: Laplace-Runge-Lenz vector
## Context
Refactors `positionOperator` using new `SchwartzMap.smulLeftCLM` and adds...
1. Definition of regularized radius operators, `r(ε)ˢ` which map `ψ` to `(‖x‖² + ε²) ^ (s/2) ψ`.
2. Definition of regularized d-dim hydrogen Hamiltonian operator and corresponding LRL vec... | diff --git a/PhysLean.lean b/PhysLean.lean
--- a/PhysLean.lean
+++ b/PhysLean.lean
@@ -226,6 +226,8 @@ import PhysLean.QFT.QED.AnomalyCancellation.Odd.Parameterization
import PhysLean.QFT.QED.AnomalyCancellation.Permutations
import PhysLean.QFT.QED.AnomalyCancellation.Sorts
import PhysLean.QFT.QED.AnomalyCancellatio... | 1,214 | 231 | 1,445 | 4.5 | diff_derived | false | 625 | 7 | 0 | 37 | 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:58Z | extraction_pipeline_v2 |
LB-0249 | pr_completion | easy | 3.54 | leanprover/cslib | 490 | feat(Free/Effects): add missing run_bind lemmas | https://github.com/leanprover/cslib/pull/490 | f22a2413a471f4ede14853aaa2afeabdd145fca0 | d3a900658f191f4dba19ccd49a3afea61095560e | Cslib/Foundations/Control/Monad/Free/Effects.lean | Cslib/Foundations/Control/Monad/Free/Effects.lean | # Task: feat(Free/Effects): add missing run_bind lemmas
## Files affected
- Cslib/Foundations/Control/Monad/Free/Effects.lean (+42/-0)
## Supporting lemmas
- `run_bind` in `Cslib/Foundations/Control/Monad/Free/Effects.lean`
```lean
lemma run_bind (x : FreeState σ α) (f : α → FreeState σ β) (s₀ : σ) :
```
- `run... | diff --git a/Cslib/Foundations/Control/Monad/Free/Effects.lean b/Cslib/Foundations/Control/Monad/Free/Effects.lean
--- a/Cslib/Foundations/Control/Monad/Free/Effects.lean
+++ b/Cslib/Foundations/Control/Monad/Free/Effects.lean
@@ -119,6 +119,15 @@ lemma run_get (k : σ → FreeState σ α) (s₀ : σ) :
lemma run_set (s' : σ)... | 42 | 0 | 42 | 8 | diff_derived | false | 0 | 1 | 0 | 5 | 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:58Z | extraction_pipeline_v2 | |
LB-0250 | pr_completion | easy | 2.96 | leanprover/cslib | 439 | fix: missing `pure`s in the `Id` monad | https://github.com/leanprover/cslib/pull/439 | 48e29fde33e1d1650a1615ba4d1440a1c36a23c3 | f22a2413a471f4ede14853aaa2afeabdd145fca0 | Cslib/Foundations/Control/Monad/Free/Effects.lean | Cslib/Foundations/Control/Monad/Free/Effects.lean | # Task: fix: missing `pure`s in the `Id` monad
## Context
This fixes some statements that were type incorrect; their LHS was `Id X` and their RHS `X`. The latter can be cast to the former with `pure`.
## Files affected
- Cslib/Foundations/Control/Monad/Free/Effects.lean (+19/-19)
## Theorems to prove
### `run_toSta... | diff --git a/Cslib/Foundations/Control/Monad/Free/Effects.lean b/Cslib/Foundations/Control/Monad/Free/Effects.lean
--- a/Cslib/Foundations/Control/Monad/Free/Effects.lean
+++ b/Cslib/Foundations/Control/Monad/Free/Effects.lean
@@ -100,9 +100,8 @@ The canonical interpreter `toStateM` derived from `liftM` agrees with the... | 19 | 19 | 38 | 8.5 | diff_derived | false | 142 | 1 | 4 | 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:59Z | extraction_pipeline_v2 | |
LB-0251 | pr_completion | easy | 2.9 | leanprover/cslib | 391 | feat: define the category of LTSs | https://github.com/leanprover/cslib/pull/391 | d1dbe1ec53e08957ff4cb893d82f3e0f7eaa4b00 | 48e29fde33e1d1650a1615ba4d1440a1c36a23c3 | Cslib.lean,Cslib/Foundations/Semantics/LTS/LTSCat/Basic.lean | Cslib.lean | # Task: Define the category of LTSs
## Issue
As discussed with @chenson2018 on Zulip.
# Task: feat: define the category of LTSs
## Files affected
- Cslib.lean (+1/-0)
- Cslib/Foundations/Semantics/LTS/LTSCat/Basic.lean (+100/-0)
## Definitions to add
- `LTS.withIdle` in `Cslib/Foundations/Semantics/LTS/LTSCat/Basic... | diff --git a/Cslib.lean b/Cslib.lean
--- a/Cslib.lean
+++ b/Cslib.lean
@@ -65,6 +65,7 @@ public import Cslib.Foundations.Semantics.LTS.Bisimulation
public import Cslib.Foundations.Semantics.LTS.Divergence
public import Cslib.Foundations.Semantics.LTS.Execution
public import Cslib.Foundations.Semantics.LTS.HasTau
+pu... | 101 | 0 | 101 | 9 | linked_issue | true | 22 | 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:59Z | extraction_pipeline_v2 | |
LB-0252 | pr_completion | medium | 6.4 | leanprover/cslib | 89 | feat(Logics/Propositional): definitions | https://github.com/leanprover/cslib/pull/89 | 7643ee4fba05fe7c53dc87f179e0da58e49d102d | 6178564385020c1b9ce5d97bc6d2ce5cfc401d61 | Cslib.lean,Cslib/Logics/Propositional/Defs.lean | Cslib.lean | # Task: feat(Logics/Propositional): definitions
## Context
This PR defines propositions for propositional logic, including notation for the logical connectives. A `Theory` is a set of `Proposition`. Also defines minimal, intuitionistic and classical theories, and extensions of maps `Atom → Atom'` to maps `Proposition ... | diff --git a/Cslib.lean b/Cslib.lean
--- a/Cslib.lean
+++ b/Cslib.lean
@@ -118,3 +118,4 @@ public import Cslib.Logics.LinearLogic.CLL.Basic
public import Cslib.Logics.LinearLogic.CLL.CutElimination
public import Cslib.Logics.LinearLogic.CLL.EtaExpansion
public import Cslib.Logics.LinearLogic.CLL.PhaseSemantics.Basic... | 159 | 0 | 159 | 8 | diff_derived | false | 319 | 2 | 4 | 0 | 16 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | logic | 2026-04-28T12:40:59Z | extraction_pipeline_v2 | |
LB-0253 | pr_completion | easy | 0.86 | leanprover/cslib | 466 | feat(FinFun): Implement the decidable equality for FinFun | https://github.com/leanprover/cslib/pull/466 | 0d37cc7fcc985cfc53b155e7eef2453f846c6da2 | 3875bc924771d63b97c02076c37529a7d4773d44 | Cslib/Foundations/Data/FinFun.lean | Cslib/Foundations/Data/FinFun.lean | # Task: feat(FinFun): Implement the decidable equality for FinFun
## Context
Add the implementation of `DecidableEq` for `FinFun`
## Files affected
- Cslib/Foundations/Data/FinFun.lean (+8/-0)
## Definitions to add
- `instDecidableEq` in `Cslib/Foundations/Data/FinFun.lean`: Decidable equality
## Verification
The p... | diff --git a/Cslib/Foundations/Data/FinFun.lean b/Cslib/Foundations/Data/FinFun.lean
--- a/Cslib/Foundations/Data/FinFun.lean
+++ b/Cslib/Foundations/Data/FinFun.lean
@@ -133,6 +133,14 @@ theorem fromFun_comm [Zero β] [DecidableEq α]
(f ↾₀ support1) ↾₀ support2 = (f ↾₀ support2) ↾₀ support1 := by
grind only [= ... | 8 | 0 | 8 | 7.5 | diff_derived | false | 52 | 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:59Z | extraction_pipeline_v2 | |
LB-0254 | pr_completion | easy | 0.32 | leanprover-community/physlib | 961 | feat(Basic): prove `linSolsIncl_injective` | https://github.com/leanprover-community/physlib/pull/961 | c901c54dfab7b9e733a780b842072b47d0ab2aec | c6d3cf5747f30274944fa652f7b0b96c87949a39 | PhysLean/QFT/AnomalyCancellation/Basic.lean | PhysLean/QFT/AnomalyCancellation/Basic.lean | # Task: feat(Basic): prove `linSolsIncl_injective`
## Context
This PR adds proofs autoformalised by @Aristotle-Harmonic.
Co-authored-by: Aristotle (Harmonic) <aristotle-harmonic@harmonic.fun>
## Files affected
- PhysLean/QFT/AnomalyCancellation/Basic.lean (+1/-5)
## Verification
The patched repository must compile ... | diff --git a/PhysLean/QFT/AnomalyCancellation/Basic.lean b/PhysLean/QFT/AnomalyCancellation/Basic.lean
--- a/PhysLean/QFT/AnomalyCancellation/Basic.lean
+++ b/PhysLean/QFT/AnomalyCancellation/Basic.lean
@@ -273,10 +273,8 @@ def linSolsIncl (χ : ACCSystemLinear) : χ.LinSols →ₗ[ℚ] χ.Charges where
map_add' _ _ := rfl
... | 1 | 5 | 6 | 6.5 | diff_derived | false | 130 | 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:59Z | extraction_pipeline_v2 | |
LB-0255 | pr_completion | medium | 6.8 | leanprover-community/physlib | 876 | feat: Started working on GHI 846 | https://github.com/leanprover-community/physlib/pull/876 | ready-to-merge,t-classical-mechanics | 1dd3e1b2ba6b0a9a4a33377fd3557def273167d1 | 08a92619449f20f5c6c38960470267b0410887f5 | PhysLean.lean,PhysLean/ClassicalMechanics/HarmonicOscillator/Basic.lean,PhysLean/ClassicalMechanics/HarmonicOscillator/ConfigurationSpace.lean,PhysLean/ClassicalMechanics/HarmonicOscillator/Solution.lean | PhysLean.lean | # Task: feat: Started working on GHI 846
## Files affected
- PhysLean.lean (+1/-0)
- PhysLean/ClassicalMechanics/HarmonicOscillator/Basic.lean (+198/-151)
- PhysLean/ClassicalMechanics/HarmonicOscillator/ConfigurationSpace.lean (+265/-0)
- PhysLean/ClassicalMechanics/HarmonicOscillator/Solution.lean (+35/-40)
## Defi... | diff --git a/PhysLean.lean b/PhysLean.lean
--- a/PhysLean.lean
+++ b/PhysLean.lean
@@ -3,6 +3,7 @@ import PhysLean.ClassicalMechanics.DampedHarmonicOscillator.Basic
import PhysLean.ClassicalMechanics.EulerLagrange
import PhysLean.ClassicalMechanics.HamiltonsEquations
import PhysLean.ClassicalMechanics.HarmonicOscill... | 499 | 191 | 690 | 6 | diff_derived | false | 23 | 4 | 0 | 42 | 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:59Z | extraction_pipeline_v2 |
LB-0256 | pr_completion | hard | 7.6 | leanprover-community/physlib | 930 | feat: QM operator commutators | https://github.com/leanprover-community/physlib/pull/930 | 3d53039de7709f76d4114e007cef596c436b8a3d | 6efb852164a59d24eef93cb3d3f15ca6d5f12536 | PhysLean.lean,PhysLean/Mathematics/KroneckerDelta.lean,PhysLean/QuantumMechanics/DDimensions/Operators/AngularMomentum.lean,PhysLean/QuantumMechanics/DDimensions/Operators/Commutation.lean,PhysLean/QuantumMechanics/DDimensions/Operators/Position.lean,PhysLean/SpaceAndTime/Space/Derivatives/Basic.lean,PhysLean/SpaceAndT... | PhysLean.lean | # Task: feat: QM operator commutators
## Context
Continuing from #926:
1. positionOperator made sorry-free
2. deriv_smul is replaced by two related lemmas (deriv_const_smul is needed in momentum commutator proof)
3. Proofs added for commutators
## Files affected
- PhysLean.lean (+1/-0)
- PhysLean/Mathematics/Krone... | diff --git a/PhysLean.lean b/PhysLean.lean
--- a/PhysLean.lean
+++ b/PhysLean.lean
@@ -56,6 +56,7 @@ import PhysLean.Mathematics.Geometry.Metric.Riemannian.Defs
import PhysLean.Mathematics.InnerProductSpace.Adjoint
import PhysLean.Mathematics.InnerProductSpace.Basic
import PhysLean.Mathematics.InnerProductSpace.Calc... | 300 | 95 | 395 | 5 | diff_derived | false | 198 | 8 | 0 | 10 | 1 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | analysis | 2026-04-28T12:41:00Z | extraction_pipeline_v2 | |
LB-0257 | pr_completion | easy | 2.9 | leanprover-community/physlib | 948 | Remove sorry: prove realLorentzTensor.evalT_toComplex | https://github.com/leanprover-community/physlib/pull/948 | f86c41afd23f2491adfcd3896d76be27ddc2a715 | 9b240de5bc880ea640ead22c207e79ad2cf50fb8 | PhysLean/Relativity/Tensors/Evaluation.lean,PhysLean/Relativity/Tensors/RealTensor/ToComplex.lean | PhysLean/Relativity/Tensors/Evaluation.lean | # Task: Remove sorry: prove realLorentzTensor.evalT_toComplex
## Files affected
- PhysLean/Relativity/Tensors/Evaluation.lean (+9/-0)
- PhysLean/Relativity/Tensors/RealTensor/ToComplex.lean (+75/-2)
## Supporting lemmas
- `evalT_pure` in `PhysLean/Relativity/Tensors/Evaluation.lean`
```lean
lemma evalT_pure {n : ... | diff --git a/PhysLean/Relativity/Tensors/Evaluation.lean b/PhysLean/Relativity/Tensors/Evaluation.lean
--- a/PhysLean/Relativity/Tensors/Evaluation.lean
+++ b/PhysLean/Relativity/Tensors/Evaluation.lean
@@ -117,6 +117,15 @@ noncomputable def evalT {n : ℕ} {c : Fin (n + 1) → C} (i : Fin (n + 1))
Tensor S c →ₗ[k] Te... | 84 | 2 | 86 | 7.5 | diff_derived | false | 0 | 2 | 0 | 3 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:41:00Z | extraction_pipeline_v2 | |
LB-0258 | pr_completion | easy | 3.4 | leanprover-community/physlib | 944 | Remove sorry: Prove realLorentzTensor.contrT_toComplex | https://github.com/leanprover-community/physlib/pull/944 | 0f0ea1cf8232f3c183f057042d25d2c439a792bc | f86c41afd23f2491adfcd3896d76be27ddc2a715 | PhysLean/Relativity/Tensors/RealTensor/ToComplex.lean,PhysLean/Relativity/Tensors/TensorSpecies/Basic.lean | PhysLean/Relativity/Tensors/RealTensor/ToComplex.lean | # Task: Remove sorry: Prove realLorentzTensor.contrT_toComplex
## Files affected
- PhysLean/Relativity/Tensors/RealTensor/ToComplex.lean (+144/-5)
- PhysLean/Relativity/Tensors/TensorSpecies/Basic.lean (+4/-0)
## Supporting lemmas
- `toComplex_map_smul` in `PhysLean/Relativity/Tensors/RealTensor/ToComplex.lean`
```... | diff --git a/PhysLean/Relativity/Tensors/RealTensor/ToComplex.lean b/PhysLean/Relativity/Tensors/RealTensor/ToComplex.lean
--- a/PhysLean/Relativity/Tensors/RealTensor/ToComplex.lean
+++ b/PhysLean/Relativity/Tensors/RealTensor/ToComplex.lean
@@ -123,7 +123,7 @@ lemma ComponentIdx.complexify_toFun_apply {n} {c : Fin n ... | 148 | 5 | 153 | 7.5 | diff_derived | false | 0 | 2 | 0 | 4 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:41:01Z | extraction_pipeline_v2 | |
LB-0259 | pr_completion | easy | 3.7 | leanprover-community/physlib | 935 | Remove sorry: Prove realLorentzTensor.prodT_toComplex | https://github.com/leanprover-community/physlib/pull/935 | 5656416627e54038bbee90e9c35294c8bf048d51 | ce250da39d6582249b2ea3c4a0b8ce048d18edb6 | PhysLean/Relativity/Tensors/RealTensor/ToComplex.lean | PhysLean/Relativity/Tensors/RealTensor/ToComplex.lean | # Task: Remove sorry: Prove realLorentzTensor.prodT_toComplex
## Files affected
- PhysLean/Relativity/Tensors/RealTensor/ToComplex.lean (+286/-9)
## Supporting lemmas
- `ComponentIdx.complexify_apply` in `PhysLean/Relativity/Tensors/RealTensor/ToComplex.lean`
```lean
lemma ComponentIdx.complexify_apply {n} {c : F... | diff --git a/PhysLean/Relativity/Tensors/RealTensor/ToComplex.lean b/PhysLean/Relativity/Tensors/RealTensor/ToComplex.lean
--- a/PhysLean/Relativity/Tensors/RealTensor/ToComplex.lean
+++ b/PhysLean/Relativity/Tensors/RealTensor/ToComplex.lean
@@ -7,9 +7,53 @@ import PhysLean.Meta.Linters.Sorry
import PhysLean.Relativi... | 286 | 9 | 295 | 8 | diff_derived | false | 0 | 1 | 0 | 5 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:41:02Z | extraction_pipeline_v2 | |
LB-0260 | pr_completion | easy | 1.7 | leanprover-community/physlib | 934 | Remove sorry: Prove realLorentzTensor.permT_toComplex | https://github.com/leanprover-community/physlib/pull/934 | 3d53039de7709f76d4114e007cef596c436b8a3d | 5656416627e54038bbee90e9c35294c8bf048d51 | PhysLean/Relativity/Tensors/RealTensor/ToComplex.lean | PhysLean/Relativity/Tensors/RealTensor/ToComplex.lean | # Task: Remove sorry: Prove realLorentzTensor.permT_toComplex
## Files affected
- PhysLean/Relativity/Tensors/RealTensor/ToComplex.lean (+76/-2)
## Supporting lemmas
- `toComplex_basis` in `PhysLean/Relativity/Tensors/RealTensor/ToComplex.lean`
```lean
lemma toComplex_basis {n} {c : Fin n → realLorentzTensor.Colo... | diff --git a/PhysLean/Relativity/Tensors/RealTensor/ToComplex.lean b/PhysLean/Relativity/Tensors/RealTensor/ToComplex.lean
--- a/PhysLean/Relativity/Tensors/RealTensor/ToComplex.lean
+++ b/PhysLean/Relativity/Tensors/RealTensor/ToComplex.lean
@@ -76,6 +76,24 @@ lemma toComplex_eq_sum_basis {n} (c : Fin n → realLorentzT... | 76 | 2 | 78 | 7.5 | diff_derived | false | 0 | 1 | 0 | 1 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:41:02Z | extraction_pipeline_v2 | |
LB-0261 | pr_completion | hard | 7 | leanprover-community/physlib | 926 | feat: Initial progress with d-dimensional QM operators | https://github.com/leanprover-community/physlib/pull/926 | d127ae0f9184cd4fe24d13f9adbe94c65e1308fb | a4145c963a6804668f4211ef1e5bb0197779d87d | PhysLean.lean,PhysLean/QuantumMechanics/DDimensions/Operators/AngularMomentum.lean,PhysLean/QuantumMechanics/DDimensions/Operators/Commutation.lean,PhysLean/QuantumMechanics/DDimensions/Operators/Momentum.lean,PhysLean/QuantumMechanics/DDimensions/Operators/Position.lean | PhysLean.lean | # Task: feat: Initial progress with d-dimensional QM operators
## Context
Position, momentum and angular momentum operators are defined (component-wise) as continuous linear maps acting on Schwartz maps. Also a beginning "wish-list" of commutators.
## Files affected
- PhysLean.lean (+4/-0)
- PhysLean/QuantumMechanics... | diff --git a/PhysLean.lean b/PhysLean.lean
--- a/PhysLean.lean
+++ b/PhysLean.lean
@@ -225,6 +225,10 @@ import PhysLean.QFT.QED.AnomalyCancellation.Odd.Parameterization
import PhysLean.QFT.QED.AnomalyCancellation.Permutations
import PhysLean.QFT.QED.AnomalyCancellation.Sorts
import PhysLean.QFT.QED.AnomalyCancellati... | 443 | 0 | 443 | 6.5 | diff_derived | false | 174 | 5 | 0 | 22 | 7 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:41:03Z | extraction_pipeline_v2 | |
LB-0262 | pr_completion | easy | 1.42 | leanprover-community/physlib | 924 | feat: Linting and small lemma | https://github.com/leanprover-community/physlib/pull/924 | 2bad08ecd2d92f9b42716cd08d04d82759ead466 | d127ae0f9184cd4fe24d13f9adbe94c65e1308fb | PhysLean/CondensedMatter/TightBindingChain/Basic.lean,PhysLean/Particles/BeyondTheStandardModel/TwoHDM/Potential.lean,PhysLean/Relativity/Tensors/RealTensor/ToComplex.lean | PhysLean/CondensedMatter/TightBindingChain/Basic.lean | # Task: feat: Linting and small lemma
## Files affected
- PhysLean/CondensedMatter/TightBindingChain/Basic.lean (+1/-1)
- PhysLean/Particles/BeyondTheStandardModel/TwoHDM/Potential.lean (+11/-0)
- PhysLean/Relativity/Tensors/RealTensor/ToComplex.lean (+1/-2)
## Supporting lemmas
- `massTermReduced_pos_of_quarticTermR... | diff --git a/PhysLean/CondensedMatter/TightBindingChain/Basic.lean b/PhysLean/CondensedMatter/TightBindingChain/Basic.lean
--- a/PhysLean/CondensedMatter/TightBindingChain/Basic.lean
+++ b/PhysLean/CondensedMatter/TightBindingChain/Basic.lean
@@ -538,7 +538,7 @@ lemma energyEigenstate_orthogonal :
simp only [Nat.c... | 13 | 3 | 16 | 7 | diff_derived | false | 0 | 3 | 0 | 1 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | logic | 2026-04-28T12:41:03Z | extraction_pipeline_v2 | |
LB-0263 | pr_completion | hard | 7.2 | leanprover/cslib | 456 | feat: prove confluence for βη-reduction | https://github.com/leanprover/cslib/pull/456 | 1aff4606333b49723e3782938b3670bf56197ab1 | 225c4b167dad1631d62ac75c90c99fb9dec7847d | Cslib.lean,Cslib/Languages/LambdaCalculus/LocallyNameless/Untyped/FullBeta.lean,Cslib/Languages/LambdaCalculus/LocallyNameless/Untyped/FullBetaEtaConfluence.lean,Cslib/Languages/LambdaCalculus/LocallyNameless/Untyped/FullEta.lean,Cslib/Languages/LambdaCalculus/LocallyNameless/Untyped/FullEtaConfluence.lean,Cslib/Langua... | Cslib.lean | # Task: feat: prove confluence for βη-reduction
## Context
Depends on #455. Adds $\eta$-reduction properties and proves confluence for $\beta \eta$-reduction.
## Files affected
- Cslib.lean (+1/-0)
- Cslib/Languages/LambdaCalculus/LocallyNameless/Untyped/FullBeta.lean (+20/-1)
- Cslib/Languages/LambdaCalculus/Locally... | diff --git a/Cslib.lean b/Cslib.lean
--- a/Cslib.lean
+++ b/Cslib.lean
@@ -94,6 +94,7 @@ public import Cslib.Languages.LambdaCalculus.LocallyNameless.Untyped.Basic
public import Cslib.Languages.LambdaCalculus.LocallyNameless.Untyped.Congruence
public import Cslib.Languages.LambdaCalculus.LocallyNameless.Untyped.FullB... | 221 | 6 | 227 | 5.5 | diff_derived | false | 99 | 6 | 4 | 12 | 2 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:41:06Z | extraction_pipeline_v2 | |
LB-0264 | pr_completion | easy | 3.1 | leanprover/cslib | 329 | feat: prove that omega-regular languages are closed under complementation | https://github.com/leanprover/cslib/pull/329 | 3b47a7b3f382feede251c6335aff19e8b2278fdd | 1aff4606333b49723e3782938b3670bf56197ab1 | Cslib/Computability/Languages/Congruences/BuchiCongruence.lean,Cslib/Computability/Languages/OmegaRegularLanguage.lean,Cslib/Foundations/Data/OmegaSequence/InfOcc.lean | Cslib/Computability/Languages/Congruences/BuchiCongruence.lean | # Task: feat: prove that omega-regular languages are closed under complementation
## Context
This PR reaches a major milestone by proving that omega-regular languages are closed under complementation, using W. Thomas's presentation of R. Büchi's original proof. Most of the groundwork has been laid in previous PRs an... | diff --git a/Cslib/Computability/Languages/Congruences/BuchiCongruence.lean b/Cslib/Computability/Languages/Congruences/BuchiCongruence.lean
--- a/Cslib/Computability/Languages/Congruences/BuchiCongruence.lean
+++ b/Cslib/Computability/Languages/Congruences/BuchiCongruence.lean
@@ -7,8 +7,7 @@ Authors: Ching-Tsun Chou
... | 47 | 4 | 51 | 8 | diff_derived | false | 372 | 3 | 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:41:06Z | extraction_pipeline_v2 | |
LB-0265 | pr_completion | easy | 1.34 | leanprover/cslib | 393 | feat: change context notation to ·<[·] | https://github.com/leanprover/cslib/pull/393 | 0ee36ae1372034f8274813fa4f622499661ed724 | 5a72d6afa3b6a25434e37e92267fe39eda5c0129 | Cslib/Foundations/Syntax/Congruence.lean,Cslib/Foundations/Syntax/Context.lean,Cslib/Languages/CCS/Basic.lean | Cslib/Foundations/Syntax/Congruence.lean | # Task: feat: change context notation to ·<[·]
## Context
This PR updates the notation for filling contexts from c[t] to c<[t], as discussed on Zulip.
## Files affected
- Cslib/Foundations/Syntax/Congruence.lean (+1/-1)
- Cslib/Foundations/Syntax/Context.lean (+1/-1)
- Cslib/Languages/CCS/Basic.lean (+4/-4)
## Theor... | diff --git a/Cslib/Foundations/Syntax/Congruence.lean b/Cslib/Foundations/Syntax/Congruence.lean
--- a/Cslib/Foundations/Syntax/Congruence.lean
+++ b/Cslib/Foundations/Syntax/Congruence.lean
@@ -15,6 +15,6 @@ namespace Cslib
/-- An equivalence relation preserved by all contexts. -/
class Congruence (α : Type*) [Has... | 6 | 6 | 12 | 7 | diff_derived | false | 92 | 3 | 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:41:06Z | extraction_pipeline_v2 | |
LB-0266 | pr_completion | easy | 2.54 | leanprover/cslib | 431 | fix: add a missing `where` to correct a vacuous class | https://github.com/leanprover/cslib/pull/431 | ea86c67aa593ed776a4fe364dd52105af6599159 | 3746532ffd38a93500b1e9d739930eb85cd3a5dd | Cslib/Foundations/Semantics/LTS/Basic.lean | Cslib/Foundations/Semantics/LTS/Basic.lean | # Task: fix: add a missing `where` to correct a vacuous class
## Context
Previously this class said "Given an LTS with finite image and finite outgoing labels, we say it is finitely branching if \<empty condition\>`. This was nonsense, and also made it impossible to state that something was _not_ finitely branching.
... | diff --git a/Cslib/Foundations/Semantics/LTS/Basic.lean b/Cslib/Foundations/Semantics/LTS/Basic.lean
--- a/Cslib/Foundations/Semantics/LTS/Basic.lean
+++ b/Cslib/Foundations/Semantics/LTS/Basic.lean
@@ -641,8 +641,7 @@ theorem LTS.mem_foldl_setImage (lts : LTS State Label) :
exact LTS.mem_setImageMultistep
/-- An... | 8 | 9 | 17 | 9 | diff_derived | false | 408 | 1 | 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:41:06Z | extraction_pipeline_v2 | |
LB-0267 | pr_completion | easy | 3.4 | leanprover/cslib | 444 | feat: tauSTr (restart) | https://github.com/leanprover/cslib/pull/444 | 2d9ad57fa681bb6111c10fcb4c288eed53a9b3b5 | c76f85fbeab308ffd414f14a55ca0e43529b7838 | Cslib/Foundations/Semantics/LTS/Basic.lean,Cslib/Foundations/Semantics/LTS/Bisimulation.lean | Cslib/Foundations/Semantics/LTS/Basic.lean | # Task: feat: tauSTr (restart)
## Context
Introducing a saturated tau transition to make the definition of weak bisimulation closer to the definition of branching bisimulation (which is a todo still). Also, it removes the need for STrN, since inductive proofs on weak bisimulation can now simply follow the inductive de... | diff --git a/Cslib/Foundations/Semantics/LTS/Basic.lean b/Cslib/Foundations/Semantics/LTS/Basic.lean
--- a/Cslib/Foundations/Semantics/LTS/Basic.lean
+++ b/Cslib/Foundations/Semantics/LTS/Basic.lean
@@ -747,10 +747,14 @@ class HasTau (Label : Type v) where
/-- The internal transition label, also known as τ. -/
τ ... | 109 | 183 | 292 | 8.5 | diff_derived | false | 715 | 2 | 3 | 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:41:06Z | extraction_pipeline_v2 | |
LB-0268 | pr_completion | medium | 6.2 | leanprover/cslib | 445 | feat(CombinatoryLogic): SKI terms for Nat.sqrt, Nat.pair, and Nat.unpair | https://github.com/leanprover/cslib/pull/445 | 2d9ad57fa681bb6111c10fcb4c288eed53a9b3b5 | d2d33ffd063fc3428cf4a11ed62d518214c10d3a | Cslib/Languages/CombinatoryLogic/Recursion.lean | Cslib/Languages/CombinatoryLogic/Recursion.lean | # Task: feat(CombinatoryLogic): SKI terms for Nat.sqrt, Nat.pair, and Nat.unpair
## Context
Implement SKI combinator terms for Nat.sqrt, Nat.pair, and Nat.unpair with correctness proofs against Mathlib definitions.
Split out from #403 to make review easier.
## Files affected
- Cslib/Languages/CombinatoryLogic/Recurs... | diff --git a/Cslib/Languages/CombinatoryLogic/Recursion.lean b/Cslib/Languages/CombinatoryLogic/Recursion.lean
--- a/Cslib/Languages/CombinatoryLogic/Recursion.lean
+++ b/Cslib/Languages/CombinatoryLogic/Recursion.lean
@@ -1,12 +1,13 @@
/-
Copyright (c) 2025 Thomas Waring. All rights reserved.
Released under Apache ... | 160 | 1 | 161 | 8.5 | diff_derived | false | 166 | 1 | 9 | 0 | 10 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | logic | 2026-04-28T12:41:06Z | extraction_pipeline_v2 | |
LB-0269 | pr_completion | easy | 0.3 | leanprover/cslib | 437 | fix: namespacing for `reduction_sys` | https://github.com/leanprover/cslib/pull/437 | 4f2b2d237f1588cb2f5716b5f854d64ea9dc54af | cf466f872b57a2191fcaa1e48c37cad144f4340e | Cslib/Foundations/Data/Relation.lean | Cslib/Foundations/Data/Relation.lean | # Task: fix: namespacing for `reduction_sys`
## Context
Similar to the changes made in #432, use `getCurrNamespace` in `reduction_sys`. Note that there is no corresponding command to `create_lts`, so those changes do not apply.
## Files affected
- Cslib/Foundations/Data/Relation.lean (+3/-2)
## Verification
The patc... | diff --git a/Cslib/Foundations/Data/Relation.lean b/Cslib/Foundations/Data/Relation.lean
--- a/Cslib/Foundations/Data/Relation.lean
+++ b/Cslib/Foundations/Data/Relation.lean
@@ -473,17 +473,18 @@ initialize Lean.registerBuiltinAttribute {
name := `reduction_sys
descr := "Register notation for a relation and its ... | 3 | 2 | 5 | 6.5 | diff_derived | false | 171 | 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:41:06Z | extraction_pipeline_v2 | |
LB-0270 | pr_completion | hard | 7.2 | leanprover/cslib | 325 | feat: prove that the Buchi congruence has the saturation property | https://github.com/leanprover/cslib/pull/325 | b39710e78e7ce033ad65c437139fbeaab70ccdf8 | 042218cedc7713e1625da9d571fc0704672b1b36 | Cslib/Computability/Automata/NA/Concat.lean,Cslib/Computability/Automata/NA/Loop.lean,Cslib/Computability/Languages/Congruences/BuchiCongruence.lean,Cslib/Foundations/Data/OmegaSequence/InfOcc.lean,Cslib/Foundations/Data/OmegaSequence/Init.lean,Cslib/Foundations/Semantics/LTS/Basic.lean | Cslib/Computability/Automata/NA/Concat.lean | # Task: feat: prove that the Buchi congruence has the saturation property
## Context
This PR proves that the Buchi congruence introduced in #278 has the saturation property defined in `Cslib.Foundations.Data.Set.Saturation`. More precisely, the family of omega-languages of the form `U * V^ω`, where `U` and `V` are eq... | diff --git a/Cslib/Computability/Automata/NA/Concat.lean b/Cslib/Computability/Automata/NA/Concat.lean
--- a/Cslib/Computability/Automata/NA/Concat.lean
+++ b/Cslib/Computability/Automata/NA/Concat.lean
@@ -99,7 +99,7 @@ theorem concat_run_exists {xs1 : List Symbol} {xs2 : ωSequence Symbol} {ss2 :
· obtain ⟨rfl⟩ : ... | 187 | 21 | 208 | 6.5 | diff_derived | false | 619 | 6 | 10 | 2 | 1 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:41:06Z | extraction_pipeline_v2 | |
LB-0271 | pr_completion | easy | 1.36 | leanprover/cslib | 432 | fix: make the `@[lts]` attribute attach hover info correctly | https://github.com/leanprover/cslib/pull/432 | ea86c67aa593ed776a4fe364dd52105af6599159 | 4f2b2d237f1588cb2f5716b5f854d64ea9dc54af | Cslib/Foundations/Semantics/LTS/Basic.lean,Cslib/Languages/CCS/Semantics.lean,CslibTests/LTS.lean | Cslib/Foundations/Semantics/LTS/Basic.lean | # Task: fix: make the `@[lts]` attribute attach hover info correctly
## Context
Hovering over `foo` in `@[lts foo]` now shows the resulting `LTS` declaration.
Also corrects the name resolution to respect `_root_` and similar.
## Files affected
- Cslib/Foundations/Semantics/LTS/Basic.lean (+13/-13)
- Cslib/Language... | diff --git a/Cslib/Foundations/Semantics/LTS/Basic.lean b/Cslib/Foundations/Semantics/LTS/Basic.lean
--- a/Cslib/Foundations/Semantics/LTS/Basic.lean
+++ b/Cslib/Foundations/Semantics/LTS/Basic.lean
@@ -917,6 +917,7 @@ open Lean Elab Meta Command Term
elab "create_lts" lt:ident name:ident : command => do
liftTermEl... | 19 | 19 | 38 | 6 | diff_derived | false | 148 | 3 | 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:41:06Z | extraction_pipeline_v2 | |
LB-0272 | pr_completion | easy | 2.72 | leanprover/cslib | 423 | feat: monadic lemmas for `FreeM.liftM` | https://github.com/leanprover/cslib/pull/423 | 9a159ac9ab187d193682664d39b3aa7669875619 | 4f3737aa0893b31e5f787b06776c9655725575ea | Cslib/Foundations/Control/Monad/Free.lean | Cslib/Foundations/Control/Monad/Free.lean | # Task: feat: monadic lemmas for `FreeM.liftM`
## Files affected
- Cslib/Foundations/Control/Monad/Free.lean (+25/-1)
## Supporting lemmas
- `liftM_map` in `Cslib/Foundations/Control/Monad/Free.lean`
```lean
lemma liftM_map [LawfulMonad m]
```
- `liftM_seq` in `Cslib/Foundations/Control/Monad/Free.lean`
```le... | diff --git a/Cslib/Foundations/Control/Monad/Free.lean b/Cslib/Foundations/Control/Monad/Free.lean
--- a/Cslib/Foundations/Control/Monad/Free.lean
+++ b/Cslib/Foundations/Control/Monad/Free.lean
@@ -216,13 +216,37 @@ lemma liftM_lift [LawfulMonad m] (interp : {ι : Type u} → F ι → m ι) (op
@[simp]
lemma liftM_bind [La... | 25 | 1 | 26 | 8 | diff_derived | false | 0 | 1 | 0 | 4 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:41:06Z | extraction_pipeline_v2 | |
LB-0273 | pr_completion | medium | 4.8 | leanprover/cslib | 425 | feat: prove strong confluence of eta-reduction | https://github.com/leanprover/cslib/pull/425 | 9a159ac9ab187d193682664d39b3aa7669875619 | a915db9c37f16640942645b19b4bf5295af2d454 | Cslib.lean,Cslib/Languages/LambdaCalculus/LocallyNameless/Untyped/FullEta.lean,Cslib/Languages/LambdaCalculus/LocallyNameless/Untyped/FullEtaConfluence.lean,Cslib/Languages/LambdaCalculus/LocallyNameless/Untyped/Properties.lean | Cslib.lean | # Task: feat: prove strong confluence of eta-reduction
## Context
This PR formalizes the strong confluence of full η-reduction (`stronglyConfluent_eta`) for the locally nameless untyped λ-calculus.
## Files affected
- Cslib.lean (+1/-0)
- Cslib/Languages/LambdaCalculus/LocallyNameless/Untyped/FullEta.lean (+31/-1)
- ... | diff --git a/Cslib.lean b/Cslib.lean
--- a/Cslib.lean
+++ b/Cslib.lean
@@ -93,6 +93,7 @@ public import Cslib.Languages.LambdaCalculus.LocallyNameless.Untyped.Basic
public import Cslib.Languages.LambdaCalculus.LocallyNameless.Untyped.FullBeta
public import Cslib.Languages.LambdaCalculus.LocallyNameless.Untyped.FullBet... | 113 | 1 | 114 | 7.5 | diff_derived | false | 131 | 4 | 0 | 6 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:41:07Z | extraction_pipeline_v2 | |
LB-0274 | pr_completion | medium | 6.6 | leanprover/cslib | 411 | feat: StrongNormalizationUntypedAndStlc | https://github.com/leanprover/cslib/pull/411 | 9a159ac9ab187d193682664d39b3aa7669875619 | b39710e78e7ce033ad65c437139fbeaab70ccdf8 | Cslib.lean,Cslib/Languages/LambdaCalculus/LocallyNameless/Stlc/StrongNorm.lean,Cslib/Languages/LambdaCalculus/LocallyNameless/Untyped/StrongNorm.lean | Cslib.lean | # Task: feat: StrongNormalizationUntypedAndStlc
## Context
This pull request adds general strong normalization lemmas and strong normalization via saturated sets for locally nameless stlc.
## Files affected
- Cslib.lean (+2/-0)
- Cslib/Languages/LambdaCalculus/LocallyNameless/Stlc/StrongNorm.lean (+124/-0)
- Cslib/La... | diff --git a/Cslib.lean b/Cslib.lean
--- a/Cslib.lean
+++ b/Cslib.lean
@@ -89,6 +89,7 @@ public import Cslib.Languages.LambdaCalculus.LocallyNameless.Fsub.Typing
public import Cslib.Languages.LambdaCalculus.LocallyNameless.Fsub.WellFormed
public import Cslib.Languages.LambdaCalculus.LocallyNameless.Stlc.Basic
public... | 279 | 0 | 279 | 8 | diff_derived | false | 129 | 3 | 1 | 15 | 3 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:41:07Z | extraction_pipeline_v2 | |
LB-0275 | pr_completion | easy | 2.4 | leanprover/cslib | 414 | feat: Add η-reduction definition | https://github.com/leanprover/cslib/pull/414 | ef87c067bacd33c37ec2e4f6ac604e9ae2ee9a66 | 9a159ac9ab187d193682664d39b3aa7669875619 | Cslib.lean,Cslib/Languages/LambdaCalculus/LocallyNameless/Untyped/FullEta.lean | Cslib.lean | # Task: feat: Add η-reduction definition
## Context
This PR introduces the definition of $\eta$-reduction for the untyped lambda calculus using the locally nameless representation.
This is the first PR aimed at formalizing the confluence of $\beta \cup \eta$.
## Files affected
- Cslib.lean (+1/-0)
- Cslib/Languag... | diff --git a/Cslib.lean b/Cslib.lean
--- a/Cslib.lean
+++ b/Cslib.lean
@@ -92,6 +92,7 @@ public import Cslib.Languages.LambdaCalculus.LocallyNameless.Stlc.Safety
public import Cslib.Languages.LambdaCalculus.LocallyNameless.Untyped.Basic
public import Cslib.Languages.LambdaCalculus.LocallyNameless.Untyped.FullBeta
pu... | 62 | 0 | 62 | 7.5 | diff_derived | false | 211 | 2 | 0 | 2 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:41:07Z | extraction_pipeline_v2 | |
LB-0276 | pr_completion | medium | 6.4 | leanprover/cslib | 410 | feat: multiSubst | https://github.com/leanprover/cslib/pull/410 | 89a116b47d6fd2ef0adf5ee86b24b06c866d2607 | 6593225ce7d0c9b802e2396f0ae846c898bf41ac | Cslib.lean,Cslib/Languages/LambdaCalculus/LocallyNameless/Untyped/MultiSubst.lean | Cslib.lean | # Task: feat: multiSubst
## Context
This PR adds multiple substitution and corresponding lemmas to be used in future Strong norm pull request.
## Files affected
- Cslib.lean (+1/-0)
- Cslib/Languages/LambdaCalculus/LocallyNameless/Untyped/MultiSubst.lean (+88/-0)
## Definitions to add
- `Env` in `Cslib/Languages/Lam... | diff --git a/Cslib.lean b/Cslib.lean
--- a/Cslib.lean
+++ b/Cslib.lean
@@ -94,6 +94,7 @@ public import Cslib.Languages.LambdaCalculus.LocallyNameless.Untyped.FullBeta
public import Cslib.Languages.LambdaCalculus.LocallyNameless.Untyped.FullBetaConfluence
public import Cslib.Languages.LambdaCalculus.LocallyNameless.Un... | 89 | 0 | 89 | 8 | diff_derived | false | 106 | 2 | 0 | 6 | 4 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:41:07Z | extraction_pipeline_v2 | |
LB-0277 | pr_completion | medium | 6.6 | leanprover/cslib | 405 | feat: MultiAppForStrongNorm | https://github.com/leanprover/cslib/pull/405 | 5a72d6afa3b6a25434e37e92267fe39eda5c0129 | e47d496991dc9a2da8b9fb913e95d94ed0ab7500 | Cslib.lean,Cslib/Languages/LambdaCalculus/LocallyNameless/Untyped/MultiApp.lean,CslibTests/GrindLint.lean | Cslib.lean | # Task: feat: MultiAppForStrongNorm
## Context
Added an operation that allows a list of arguments to be applied to a term and corresponding lemmas. This operation is required for strong normalization in a future pull request.
## Files affected
- Cslib.lean (+1/-0)
- Cslib/Languages/LambdaCalculus/LocallyNameless/Unty... | diff --git a/Cslib.lean b/Cslib.lean
--- a/Cslib.lean
+++ b/Cslib.lean
@@ -91,6 +91,7 @@ public import Cslib.Languages.LambdaCalculus.LocallyNameless.Untyped.Basic
public import Cslib.Languages.LambdaCalculus.LocallyNameless.Untyped.FullBeta
public import Cslib.Languages.LambdaCalculus.LocallyNameless.Untyped.FullBet... | 144 | 0 | 144 | 8 | diff_derived | false | 178 | 3 | 0 | 9 | 1 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:41:07Z | extraction_pipeline_v2 | |
LB-0278 | pr_completion | medium | 6.4 | leanprover/cslib | 381 | feat: helper lemmas for use in the planned strong norm proof | https://github.com/leanprover/cslib/pull/381 | 0ee36ae1372034f8274813fa4f622499661ed724 | 11957b88065874a4be8f30c817fddfbab89ee368 | Cslib/Languages/LambdaCalculus/LocallyNameless/Untyped/FullBeta.lean,Cslib/Languages/LambdaCalculus/LocallyNameless/Untyped/LcAt.lean | Cslib/Languages/LambdaCalculus/LocallyNameless/Untyped/FullBeta.lean | # Task: feat: helper lemmas for use in the planned strong norm proof
## Context
Added helper lemmas to existing files that are necessary for additional pull requests with the goal of proving strong normalization for Stlc.
## Files affected
- Cslib/Languages/LambdaCalculus/LocallyNameless/Untyped/FullBeta.lean (+83/-1... | diff --git a/Cslib/Languages/LambdaCalculus/LocallyNameless/Untyped/FullBeta.lean b/Cslib/Languages/LambdaCalculus/LocallyNameless/Untyped/FullBeta.lean
--- a/Cslib/Languages/LambdaCalculus/LocallyNameless/Untyped/FullBeta.lean
+++ b/Cslib/Languages/LambdaCalculus/LocallyNameless/Untyped/FullBeta.lean
@@ -74,17 +74,21 ... | 94 | 10 | 104 | 8 | diff_derived | false | 141 | 2 | 1 | 10 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:41:07Z | extraction_pipeline_v2 | |
LB-0279 | pr_completion | hard | 7 | leanprover/cslib | 269 | feat: Single Tape Turing Machines | https://github.com/leanprover/cslib/pull/269 | 18b4b74c4fbd303707e4e4ab94f27e820a25c74c | 2a1f434249bff7e88b1504ec52b96eee9e84e669 | Cslib.lean,Cslib/Computability/Machines/SingleTapeTuring/Basic.lean,Cslib/Foundations/Data/BiTape.lean,Cslib/Foundations/Data/RelatesInSteps.lean,Cslib/Foundations/Data/StackTape.lean | Cslib.lean | # Task: feat: Single Tape Turing Machines
## Context
I have now marked this ready for review but it's quite a large PR, reviewers please tell me if I should reorganize things or submit in a different way.
This PR adds a model of Single Tape Turing machines, which inputs and outputs `List α` for a finite alphabet ty... | diff --git a/Cslib.lean b/Cslib.lean
--- a/Cslib.lean
+++ b/Cslib.lean
@@ -29,6 +29,7 @@ public import Cslib.Computability.Languages.Language
public import Cslib.Computability.Languages.OmegaLanguage
public import Cslib.Computability.Languages.OmegaRegularLanguage
public import Cslib.Computability.Languages.RegularL... | 845 | 8 | 853 | 6 | diff_derived | false | 1,357 | 5 | 0 | 27 | 26 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | algebra | 2026-04-28T12:41:07Z | extraction_pipeline_v2 | |
LB-0280 | pr_completion | hard | 7 | leanprover/cslib | 319 | feat: Hennessy-Milner logic | https://github.com/leanprover/cslib/pull/319 | 9afdb6ad6c4e0257d46f4515667d89fb50c434e7 | 329a0dc3468cc380e7abd6101b6968306d104052 | Cslib.lean,Cslib/Logics/HML/Basic.lean,CslibTests.lean,CslibTests/GrindLint.lean,CslibTests/HML.lean | Cslib.lean | # Task: feat: Hennessy-Milner logic
## Context
This PR adds Hennessy-Milner Logic (HML) in its general form (parameterised over any LTS). We have proven the correctness of denotational semantics and its key result (the Hennessy-Milner theorem, stating that theory equivalence coincides with bisimilarity).
## Files aff... | diff --git a/Cslib.lean b/Cslib.lean
--- a/Cslib.lean
+++ b/Cslib.lean
@@ -79,6 +79,7 @@ public import Cslib.Languages.LambdaCalculus.LocallyNameless.Untyped.FullBeta
public import Cslib.Languages.LambdaCalculus.LocallyNameless.Untyped.FullBetaConfluence
public import Cslib.Languages.LambdaCalculus.LocallyNameless.Un... | 289 | 0 | 289 | 7.5 | diff_derived | false | 258 | 5 | 12 | 3 | 6 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | logic | 2026-04-28T12:41:16Z | extraction_pipeline_v2 | |
LB-0281 | pr_completion | easy | 0.28 | leanprover/cslib | 362 | fix: generalize time_tick and ret_tick | https://github.com/leanprover/cslib/pull/362 | b00648a4fe741981bb586a3cc845258ab1583f61 | e44860253830e916c0db3035af126ab99d6a5453 | Cslib/Algorithms/Lean/TimeM.lean | Cslib/Algorithms/Lean/TimeM.lean | # Task: fix: generalize time_tick and ret_tick
## Files affected
- Cslib/Algorithms/Lean/TimeM.lean (+2/-2)
## Verification
The patched repository must compile with `lake build`. | diff --git a/Cslib/Algorithms/Lean/TimeM.lean b/Cslib/Algorithms/Lean/TimeM.lean
--- a/Cslib/Algorithms/Lean/TimeM.lean
+++ b/Cslib/Algorithms/Lean/TimeM.lean
@@ -125,8 +125,8 @@ instance [AddMonoid T] : LawfulMonad (TimeM T) := .mk'
/-- Creates a `TimeM` computation with a time cost. -/
def tick (c : T) : TimeM T PU... | 2 | 2 | 4 | 6 | diff_derived | false | 29 | 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:41:16Z | extraction_pipeline_v2 | |
LB-0282 | pr_completion | easy | 2.9 | leanprover/cslib | 357 | feat: generalize `TimeM` to arbitrary cost types providing `AddZero` | https://github.com/leanprover/cslib/pull/357 | 18b4b74c4fbd303707e4e4ab94f27e820a25c74c | b00648a4fe741981bb586a3cc845258ab1583f61 | Cslib/Algorithms/Lean/MergeSort/MergeSort.lean,Cslib/Algorithms/Lean/TimeM.lean | Cslib/Algorithms/Lean/MergeSort/MergeSort.lean | # Task: feat: generalize `TimeM` to arbitrary cost types providing `AddZero`
## Context
This also fixes some insufficiently-general `simp` lemmas about `seqLeft`, `seqRight`, and `seq`.
Discussed in [#CSLib > Lightweight algorithms in CSLib :Cslib#275 @ 💬](https://leanprover.zulipchat.com/#narrow/channel/513188-CS... | diff --git a/Cslib/Algorithms/Lean/MergeSort/MergeSort.lean b/Cslib/Algorithms/Lean/MergeSort/MergeSort.lean
--- a/Cslib/Algorithms/Lean/MergeSort/MergeSort.lean
+++ b/Cslib/Algorithms/Lean/MergeSort/MergeSort.lean
@@ -17,7 +17,7 @@ public import Mathlib.Data.Nat.Log
# MergeSort on a list
In this file we introduce ... | 66 | 34 | 100 | 8.5 | diff_derived | false | 569 | 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:41:16Z | extraction_pipeline_v2 | |
LB-0283 | pr_completion | easy | 2.4 | leanprover/cslib | 281 | feat: prove the Ramsey theorem for infinite graphs | https://github.com/leanprover/cslib/pull/281 | 1bb3a546874e8d68bcb3205cbbbc84d6d8884cda | 18b4b74c4fbd303707e4e4ab94f27e820a25c74c | Cslib.lean,Cslib/Foundations/Combinatorics/InfiniteGraphRamsey.lean | Cslib.lean | # Task: feat: prove the Ramsey theorem for infinite graphs
## Context
This PR proves the Ramsey theorem for infinite graphs, which will be needed in Buchi's proof that omega-regular languages are closed under complementation.
Ideally, this result should be in mathlib, but it is not and I don't know when it will be:... | diff --git a/Cslib.lean b/Cslib.lean
--- a/Cslib.lean
+++ b/Cslib.lean
@@ -35,6 +35,7 @@ public import Cslib.Computability.URM.Defs
public import Cslib.Computability.URM.Execution
public import Cslib.Computability.URM.StandardForm
public import Cslib.Computability.URM.StraightLine
+public import Cslib.Foundations.Co... | 150 | 0 | 150 | 8 | diff_derived | false | 465 | 2 | 2 | 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:41:17Z | extraction_pipeline_v2 | |
LB-0284 | pr_completion | easy | 2.2 | leanprover/cslib | 353 | feat: deterministic relations | https://github.com/leanprover/cslib/pull/353 | 24899be067eb4375432007278e7236683d8d7144 | 800c94bbcaa6126cbe749e7b721a70e13233433b | Cslib/Computability/URM/Execution.lean,Cslib/Foundations/Data/Relation.lean | Cslib/Computability/URM/Execution.lean | # Task: feat: deterministic relations
## Context
... aka `Relator.RightUnique`. The proof pattern of deterministic -> confluent in `URM/Execution` seemed common enough to deserve generalisation. If appropriate this predicate could get a cslib-specific abbrev to improve discoverability.
## Files affected
- Cslib/Compu... | diff --git a/Cslib/Computability/URM/Execution.lean b/Cslib/Computability/URM/Execution.lean
--- a/Cslib/Computability/URM/Execution.lean
+++ b/Cslib/Computability/URM/Execution.lean
@@ -84,8 +84,7 @@ namespace Step
variable {p : Program}
/-- The step relation is deterministic: each state has at most one successor.... | 13 | 27 | 40 | 7.5 | diff_derived | false | 237 | 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:41:17Z | extraction_pipeline_v2 | |
LB-0285 | pr_completion | medium | 6.8 | leanprover/cslib | 331 | feat(CombinatoryLogic): add Church-encoded list infrastructure for SKI terms | https://github.com/leanprover/cslib/pull/331 | f87b4e84a22b1c2d32d2ad51d9a916539f082f99 | b13a67207c489f4b3f816cf96fcd3d38855db80f | Cslib.lean,Cslib/Languages/CombinatoryLogic/Basic.lean,Cslib/Languages/CombinatoryLogic/List.lean,Cslib/Languages/CombinatoryLogic/Recursion.lean | Cslib.lean | # Task: feat(CombinatoryLogic): add Church-encoded list infrastructure for SKI terms
## Context
Adds Church-encoded list operations (nil, cons, head, tail) for SKI combinatory logic, along with conversions to/from Church numerals and helper combinators (PrependZero, SuccHead).
Head is defined via a general HeadD that... | diff --git a/Cslib.lean b/Cslib.lean
--- a/Cslib.lean
+++ b/Cslib.lean
@@ -71,6 +71,7 @@ public import Cslib.Languages.CombinatoryLogic.Basic
public import Cslib.Languages.CombinatoryLogic.Confluence
public import Cslib.Languages.CombinatoryLogic.Defs
public import Cslib.Languages.CombinatoryLogic.Evaluation
+public... | 320 | 3 | 323 | 7 | diff_derived | false | 402 | 4 | 24 | 4 | 17 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | logic | 2026-04-28T12:41:18Z | extraction_pipeline_v2 | |
LB-0286 | pr_completion | medium | 5.2 | google-deepmind/formal-conjectures | 3,431 | feat(Wikipedia): Add Buchi's Problem | https://github.com/google-deepmind/formal-conjectures/pull/3431 | wikipedia,new conjecture | 75573bb6ae02bcb7008714e2bdb11ee09a52d142 | 17753c53afa67dfe5efcd4b825bc2d572a207f4c | FormalConjectures/Wikipedia/Buchi.lean | FormalConjectures/Wikipedia/Buchi.lean | # Task: feat(Wikipedia): Add Buchi's Problem
## Context
# Description
Does there exist a positive integer $M$ such that for all integers $x$ and $a$, the quantity $( x + n )^2 + a$ cannot be a perfect square for more than $M$ consecutive values of $n$, unless $a=0$?
This is my first commit so please review and let... | diff --git a/FormalConjectures/Wikipedia/Buchi.lean b/FormalConjectures/Wikipedia/Buchi.lean
--- /dev/null
+++ b/FormalConjectures/Wikipedia/Buchi.lean
@@ -0,0 +1,110 @@
+/-
+Copyright 2026 The Formal Conjectures Authors.
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file exce... | 110 | 0 | 110 | 9 | diff_derived | false | 466 | 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:41:18Z | extraction_pipeline_v2 |
LB-0287 | pr_completion | hard | 7.6 | leanprover/cslib | 278 | feat: define BuchiCongruence and prove that it is a right congruence of finite index | https://github.com/leanprover/cslib/pull/278 | 939bd13108ef482e217efda27fd01d9f57fe8a1b | a79f1c20da314c8fb0875356fc74828ea49e1fcc | Cslib.lean,Cslib/Computability/Automata/DA/Congr.lean,Cslib/Computability/Automata/NA/Pair.lean,Cslib/Computability/Languages/Congruences/BuchiCongruence.lean,Cslib/Computability/Languages/Congruences/RightCongruence.lean,Cslib/Computability/Languages/RegularLanguage.lean,Cslib/Foundations/Semantics/FLTS/Basic.lean,Csl... | Cslib.lean | # Task: feat: define BuchiCongruence and prove that it is a right congruence of finite index
## Context
This PR defines the notion of a "right congruence", which is an equivalence relation between finite words that is preserved by concatenation on the right, and proves its basic properties:
- There is a natural det... | diff --git a/Cslib.lean b/Cslib.lean
--- a/Cslib.lean
+++ b/Cslib.lean
@@ -6,6 +6,7 @@ public import Cslib.Computability.Automata.Acceptors.Acceptor
public import Cslib.Computability.Automata.Acceptors.OmegaAcceptor
public import Cslib.Computability.Automata.DA.Basic
public import Cslib.Computability.Automata.DA.Buc... | 321 | 27 | 348 | 5.5 | diff_derived | false | 921 | 8 | 16 | 1 | 4 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:41:18Z | extraction_pipeline_v2 | |
LB-0288 | pr_completion | medium | 4.7 | google-deepmind/formal-conjectures | 2,398 | feat(ErdosProblems/686): prove a solved variant and add some open variants | https://github.com/google-deepmind/formal-conjectures/pull/2398 | erdos-problems,new conjecture,awaiting-author | 3fa66ccbd6ffc45d14721bc6d10393021135b66c | 35aabe285d0163d13283d43bf063f2386c360471 | FormalConjectures/ErdosProblems/686.lean | FormalConjectures/ErdosProblems/686.lean | # Task: feat(ErdosProblems/686): prove a solved variant and add some open variants
## Context
Includes a AlphaProof formal proof for the solved non-square variant. It is cleaned up for maintainability, but the raw output is in the PR history.
This PR also adds several new open variants and fixes a casting bug.
J... | diff --git a/FormalConjectures/ErdosProblems/686.lean b/FormalConjectures/ErdosProblems/686.lean
--- a/FormalConjectures/ErdosProblems/686.lean
+++ b/FormalConjectures/ErdosProblems/686.lean
@@ -30,10 +30,153 @@ for some $k≥2$ and $m≥n+k$?
-/
@[category research open, AMS 11]
theorem erdos_686 :
- answer(sorry) ↔... | 144 | 1 | 145 | 8.5 | diff_derived | false | 247 | 1 | 7 | 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:41:18Z | extraction_pipeline_v2 |
LB-0289 | pr_completion | medium | 4.9 | leanprover/cslib | 336 | feat: An Alternative Definition of the Locally Closed Term of Locally Nameless LC Using `LcAt` | https://github.com/leanprover/cslib/pull/336 | 939bd13108ef482e217efda27fd01d9f57fe8a1b | ba0fb9d5e48cd2d920e69ac6fc49a4e6f954dbed | Cslib.lean,Cslib/Languages/LambdaCalculus/LocallyNameless/Untyped/LcAt.lean | Cslib.lean | # Task: feat: An Alternative Definition of the Locally Closed Term of Locally Nameless LC Using `LcAt`
## Context
In [A. Chargueraud, The Locally Nameless Representation](https://chargueraud.org/research/2009/ln/main.pdf), which is the primary reference of implementation, several different definitions of “locally cl... | diff --git a/Cslib.lean b/Cslib.lean
--- a/Cslib.lean
+++ b/Cslib.lean
@@ -76,6 +76,7 @@ public import Cslib.Languages.LambdaCalculus.LocallyNameless.Stlc.Safety
public import Cslib.Languages.LambdaCalculus.LocallyNameless.Untyped.Basic
public import Cslib.Languages.LambdaCalculus.LocallyNameless.Untyped.FullBeta
pu... | 90 | 0 | 90 | 8.5 | diff_derived | false | 523 | 2 | 4 | 1 | 2 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:41:19Z | extraction_pipeline_v2 | |
LB-0290 | pr_completion | easy | 3.2 | google-deepmind/formal-conjectures | 2,288 | fix(ErdosProblems): 193 | https://github.com/google-deepmind/formal-conjectures/pull/2288 | erdos-problems,new conjecture | 8f1403ada112fb2f75e3cff11ed50556ebe35736 | 75573bb6ae02bcb7008714e2bdb11ee09a52d142 | FormalConjectures/ErdosProblems/193.lean | FormalConjectures/ErdosProblems/193.lean | # Task: fix(ErdosProblems): 193
## Context
# Description
> Let $S \subseteq \mathbb{Z}^3$ be a finite set and let $A = \lbrace a_1, a_2,\ldots \rbrace$ be an infinite $S$-walk, so that $a_{i+1} - a_i \in S$ for all $i$. Must $A$ contain three collinear points?
I am not so confident about this implementation, the... | diff --git a/FormalConjectures/ErdosProblems/193.lean b/FormalConjectures/ErdosProblems/193.lean
--- /dev/null
+++ b/FormalConjectures/ErdosProblems/193.lean
@@ -0,0 +1,75 @@
+/-
+Copyright 2026 The Formal Conjectures Authors.
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file... | 75 | 0 | 75 | 9 | diff_derived | false | 1,153 | 1 | 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:41:19Z | extraction_pipeline_v2 |
LB-0291 | pr_completion | medium | 4.7 | leanprover-community/physlib | 923 | feat: More properties of the two Higgs doublet model potential | https://github.com/leanprover-community/physlib/pull/923 | 7ba876c3f5fcd9f67fa2ee9326dd5d0b1e70079a | 2bad08ecd2d92f9b42716cd08d04d82759ead466 | PhysLean/Particles/BeyondTheStandardModel/TwoHDM/Potential.lean | PhysLean/Particles/BeyondTheStandardModel/TwoHDM/Potential.lean | # Task: feat: More properties of the two Higgs doublet model potential
## Context
Adding more properties of the two Higgs doublet model potential,
## Files affected
- PhysLean/Particles/BeyondTheStandardModel/TwoHDM/Potential.lean (+254/-0)
## Supporting lemmas
- `potentialIsBounded_iff_forall_euclid` in `PhysLean/P... | diff --git a/PhysLean/Particles/BeyondTheStandardModel/TwoHDM/Potential.lean b/PhysLean/Particles/BeyondTheStandardModel/TwoHDM/Potential.lean
--- a/PhysLean/Particles/BeyondTheStandardModel/TwoHDM/Potential.lean
+++ b/PhysLean/Particles/BeyondTheStandardModel/TwoHDM/Potential.lean
@@ -184,4 +184,258 @@ lemma potential... | 254 | 0 | 254 | 8 | diff_derived | false | 64 | 1 | 0 | 7 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | logic | 2026-04-28T12:41:19Z | extraction_pipeline_v2 | |
LB-0292 | pr_completion | easy | 3.2 | leanprover-community/physlib | 922 | 7RKGK: Replaced informal with sorryful | https://github.com/leanprover-community/physlib/pull/922 | 6cd4ff17bab069314e067c014d91003fbd7fae7c | 7ba876c3f5fcd9f67fa2ee9326dd5d0b1e70079a | PhysLean/Relativity/Tensors/RealTensor/ToComplex.lean | PhysLean/Relativity/Tensors/RealTensor/ToComplex.lean | # Task: 7RKGK: Replaced informal with sorryful
## Files affected
- PhysLean/Relativity/Tensors/RealTensor/ToComplex.lean (+46/-4)
## Definitions to add
- `evalIdxToComplex` in `PhysLean/Relativity/Tensors/RealTensor/ToComplex.lean`: Convert an evaluation index from the real repDim to the complex repDim.
## Supportin... | diff --git a/PhysLean/Relativity/Tensors/RealTensor/ToComplex.lean b/PhysLean/Relativity/Tensors/RealTensor/ToComplex.lean
--- a/PhysLean/Relativity/Tensors/RealTensor/ToComplex.lean
+++ b/PhysLean/Relativity/Tensors/RealTensor/ToComplex.lean
@@ -177,9 +177,51 @@ informal_lemma contrT_toComplex where
deps := [``cont... | 46 | 4 | 50 | 8 | diff_derived | false | 0 | 1 | 0 | 3 | 1 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:41:19Z | extraction_pipeline_v2 | |
LB-0293 | pr_completion | easy | 3.7 | google-deepmind/formal-conjectures | 2,139 | feat(ErdosProblems): 50 | https://github.com/google-deepmind/formal-conjectures/pull/2139 | erdos-problems,new conjecture,awaiting-author | 4feab040c31badc88e52c4a90f0a00e20d9b7484 | f2d0d593895fc3a005a7a4e8d5e9f3bea8f15979 | FormalConjectures/ErdosProblems/50.lean | FormalConjectures/ErdosProblems/50.lean | # Task: feat(ErdosProblems): 50
## Context
fixes #270.
Note: I'm using Claude + Opus for supervised formalization tasks. Claude has no permission to use git on my machine.
## Files affected
- FormalConjectures/ErdosProblems/50.lean (+79/-0)
## Theorems to prove
### `erdos_50_schoenberg` in `FormalConjectures/Erd... | diff --git a/FormalConjectures/ErdosProblems/50.lean b/FormalConjectures/ErdosProblems/50.lean
--- /dev/null
+++ b/FormalConjectures/ErdosProblems/50.lean
@@ -0,0 +1,79 @@
+/-
+Copyright 2026 The Formal Conjectures Authors.
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file ex... | 79 | 0 | 79 | 8.5 | diff_derived | false | 131 | 1 | 3 | 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:41:19Z | extraction_pipeline_v2 |
LB-0294 | pr_completion | easy | 2.46 | leanprover/cslib | 322 | fix: do not redefine clog2 | https://github.com/leanprover/cslib/pull/322 | f7ab865da0e3643bcfdfad61aa93f4aa9eb2e02a | 4b23820ee63bab9dfb506d63139ac6ea2f0ac787 | Cslib/Algorithms/Lean/MergeSort/MergeSort.lean | Cslib/Algorithms/Lean/MergeSort/MergeSort.lean | # Task: fix: do not redefine clog2
## Files affected
- Cslib/Algorithms/Lean/MergeSort/MergeSort.lean (+15/-23)
## Definitions to add
- `T` in `Cslib/Algorithms/Lean/MergeSort/MergeSort.lean`
```lean
abbrev T (n : ℕ) : ℕ := n * clog 2 n
```
## Supporting lemmas
- `clog2_half_le` in `Cslib/Algorithms/Lean/Merge... | diff --git a/Cslib/Algorithms/Lean/MergeSort/MergeSort.lean b/Cslib/Algorithms/Lean/MergeSort/MergeSort.lean
--- a/Cslib/Algorithms/Lean/MergeSort/MergeSort.lean
+++ b/Cslib/Algorithms/Lean/MergeSort/MergeSort.lean
@@ -130,48 +130,40 @@ def timeMergeSortRec : ℕ → ℕ
| 1 => 0
| n@(_+2) => timeMergeSortRec (n/2) + timeM... | 15 | 23 | 38 | 8 | diff_derived | false | 30 | 1 | 0 | 2 | 1 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:41:20Z | extraction_pipeline_v2 | |
LB-0295 | pr_completion | easy | 0.24 | google-deepmind/formal-conjectures | 3,616 | fix(Answer): restore strict type-checking for answer() in alwaysTrue … | https://github.com/google-deepmind/formal-conjectures/pull/3616 | fix | c86899be13f39b54fc7d9921a046290aa40f4bda | 2fdb47d94a8df681de5e0181e012acfa75a2b7fd | FormalConjectures/Util/Answer.lean | FormalConjectures/Util/Answer.lean | # Task: fix(Answer): restore strict type-checking for answer() in alwaysTrue …
## Context
…mode
The refactoring of `answerElab` to support AnswerSetting modes inadvertently changed the `alwaysTrue` non-`sorry` path from `postponeElabTerm (strict)` to `elabTerm (permissive)`.
This caused `answer(wrong_type)` to sil... | diff --git a/FormalConjectures/Util/Answer.lean b/FormalConjectures/Util/Answer.lean
--- a/FormalConjectures/Util/Answer.lean
+++ b/FormalConjectures/Util/Answer.lean
@@ -103,7 +103,7 @@ def answerElab : TermElab := fun stx expectedType? => do
if expectedType? == some (Expr.sort .zero) && a == (← `(term| sorry))... | 1 | 1 | 2 | 6.5 | diff_derived | false | 368 | 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:41:20Z | extraction_pipeline_v2 |
LB-0296 | pr_completion | easy | 1.7 | leanprover-community/physlib | 921 | 7RKFR: Replaced informal with sorryful | https://github.com/leanprover-community/physlib/pull/921 | 0e4ace1bfb3748542ca12d58e885769c41d86417 | 9aa1f3142e8d101f1e172a36e7e880ef2c4953b4 | PhysLean/Relativity/Tensors/RealTensor/ToComplex.lean | PhysLean/Relativity/Tensors/RealTensor/ToComplex.lean | # Task: 7RKFR: Replaced informal with sorryful
## Files affected
- PhysLean/Relativity/Tensors/RealTensor/ToComplex.lean (+22/-3)
## Supporting lemmas
- `tau_colorToComplex` in `PhysLean/Relativity/Tensors/RealTensor/ToComplex.lean`
```lean
lemma tau_colorToComplex (x : realLorentzTensor.Color) :
```
- `contrT_... | diff --git a/PhysLean/Relativity/Tensors/RealTensor/ToComplex.lean b/PhysLean/Relativity/Tensors/RealTensor/ToComplex.lean
--- a/PhysLean/Relativity/Tensors/RealTensor/ToComplex.lean
+++ b/PhysLean/Relativity/Tensors/RealTensor/ToComplex.lean
@@ -143,10 +143,29 @@ informal_lemma prodT_toComplex where
deps := [``prod... | 22 | 3 | 25 | 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 | general | 2026-04-28T12:41:20Z | extraction_pipeline_v2 | |
LB-0297 | pr_completion | easy | 1.2 | leanprover-community/physlib | 903 | Remove sorry: prove ClassicalMechanics.Lagrangian.isTotalTimeDerivativeVelocity | https://github.com/leanprover-community/physlib/pull/903 | 4adeb42cb879d6ca4d6f97a8f93ad6af2df6523c | 901256f34bada179a80d0ab2633bf8a852490e52 | PhysLean/ClassicalMechanics/Lagrangian/TotalDerivativeEquivalence.lean | PhysLean/ClassicalMechanics/Lagrangian/TotalDerivativeEquivalence.lean | # Task: Remove sorry: prove ClassicalMechanics.Lagrangian.isTotalTimeDerivativeVelocity
## Files affected
- PhysLean/ClassicalMechanics/Lagrangian/TotalDerivativeEquivalence.lean (+57/-2)
## Verification
The patched repository must compile with `lake build`. | diff --git a/PhysLean/ClassicalMechanics/Lagrangian/TotalDerivativeEquivalence.lean b/PhysLean/ClassicalMechanics/Lagrangian/TotalDerivativeEquivalence.lean
--- a/PhysLean/ClassicalMechanics/Lagrangian/TotalDerivativeEquivalence.lean
+++ b/PhysLean/ClassicalMechanics/Lagrangian/TotalDerivativeEquivalence.lean
@@ -102,1... | 57 | 2 | 59 | 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 | analysis | 2026-04-28T12:41:20Z | extraction_pipeline_v2 | |
LB-0298 | pr_completion | medium | 6.4 | leanprover/cslib | 304 | feat(Foundations/Semantics/ReductionSystem): extend `ReductionSystem` | https://github.com/leanprover/cslib/pull/304 | 08b04cac3641843c319002ca0812f58c9f8464cf | da56240ae7fc460fbd19226988b3bcf9a6493c3b | Cslib/Foundations/Data/Relation.lean,Cslib/Foundations/Semantics/ReductionSystem/Basic.lean | Cslib/Foundations/Data/Relation.lean | # Task: feat(Foundations/Semantics/ReductionSystem): extend `ReductionSystem`
## Context
- Add more definitions and theorems about reduction systems
- Use namespace `ReductionSystem`
- Add sections
## Files affected
- Cslib/Foundations/Data/Relation.lean (+69/-0)
- Cslib/Foundations/Semantics/ReductionSystem/Basic.... | diff --git a/Cslib/Foundations/Data/Relation.lean b/Cslib/Foundations/Data/Relation.lean
--- a/Cslib/Foundations/Data/Relation.lean
+++ b/Cslib/Foundations/Data/Relation.lean
@@ -128,12 +128,27 @@ theorem Confluent_iff_ChurchRosser : Confluent r ↔ ChurchRosser r :=
theorem Confluent_iff_SemiConfluent : Confluent r ↔ S... | 204 | 56 | 260 | 8 | diff_derived | false | 110 | 2 | 49 | 0 | 17 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:41:21Z | extraction_pipeline_v2 | |
LB-0299 | pr_completion | easy | 1.7 | leanprover-community/physlib | 902 | Remove sorry: prove ClassicalMechanics.HarmonicOscillator.InitialConditions.trajectories_unique | https://github.com/leanprover-community/physlib/pull/902 | df9f0918de92cb953f56e17dcd0262368e724cab | 4adeb42cb879d6ca4d6f97a8f93ad6af2df6523c | PhysLean/ClassicalMechanics/HarmonicOscillator/Solution.lean | PhysLean/ClassicalMechanics/HarmonicOscillator/Solution.lean | # Task: Remove sorry: prove ClassicalMechanics.HarmonicOscillator.InitialConditions.trajectories_unique
## Context
Add prove for ClassicalMechanics.HarmonicOscillator.InitialConditions.trajectories_unique
## Files affected
- PhysLean/ClassicalMechanics/HarmonicOscillator/Solution.lean (+173/-4)
## Supporting lemmas
... | diff --git a/PhysLean/ClassicalMechanics/HarmonicOscillator/Solution.lean b/PhysLean/ClassicalMechanics/HarmonicOscillator/Solution.lean
--- a/PhysLean/ClassicalMechanics/HarmonicOscillator/Solution.lean
+++ b/PhysLean/ClassicalMechanics/HarmonicOscillator/Solution.lean
@@ -54,7 +54,7 @@ References for the classical ha... | 173 | 4 | 177 | 7.5 | diff_derived | false | 89 | 1 | 0 | 1 | 0 | pr_merge | false | leanprover/lean4:v4.29.0 | leanbench/lean4-env:4.29.0 | lake build | 600 | lean_compiler | general | 2026-04-28T12:41:21Z | extraction_pipeline_v2 | |
LB-0300 | pr_completion | easy | 3.9 | leanprover/cslib | 302 | feat: add linear logic tests/benchmark | https://github.com/leanprover/cslib/pull/302 | 6132eb0c4684848ea6f945d6cad34cea23372aad | 8a926ae1a9af8c3905e773b5c6f7cc8256aca500 | CslibTests.lean,CslibTests/CLL.lean | CslibTests.lean | # Task: feat: add linear logic tests/benchmark
## Context
For all logics that are likely to be implemented, it would be interesting to have a test suite that not only demonstrates how the definitions of syntax and semantics work, but also serves a didactic purpose through concrete instantiations of the logic.
In th... | diff --git a/CslibTests.lean b/CslibTests.lean
--- a/CslibTests.lean
+++ b/CslibTests.lean
@@ -2,6 +2,7 @@ module -- shake: keep-all
public import CslibTests.Bisimulation
public import CslibTests.CCS
+public import CslibTests.CLL
public import CslibTests.DFA
public import CslibTests.FreeMonad
public import Csli... | 219 | 0 | 219 | 8.5 | diff_derived | false | 1,087 | 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:41:21Z | extraction_pipeline_v2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.