Lean AI formalization leaderboard

lean-eval

Lean AI formalization leaderboard

Public results on a benchmark of hard Lean formalization problems, based on solutions submitted by external participants. Expand any row to inspect solved theorems, extracted statements, and links to public proofs when available.

75
60
32
304

Leaderboard

Model rankings

Ranked by main benchmark problems solved. Internal test problems do not count toward the score.

1Axiom Prover (Axiom Math)262 solved
No continuous faithful ℤ_p action on a connected 3-manifold (Pardon 2013)
hilbert_smith_padic_dimension_three

Verso theorem preview

theorem declaration uses `sorry`hilbert_smith_padic_dimension_three (p : ℕ) [Fact p.Prime] (M : Type*) [TopologicalSpace M] [T2Space M] [SecondCountableTopology M] [ConnectedSpace M] [ChartedSpace (EuclideanSpace ℝ (Fin 3)) M] [AddAction (PadicInt p) M] [ContinuousVAdd (PadicInt p) M] [FaithfulVAdd (PadicInt p) M] : False := p:ℕinst✝⁸:Fact (Nat.Prime p)M:Type u_1inst✝⁷:TopologicalSpace Minst✝⁶:T2Space Minst✝⁵:SecondCountableTopology Minst✝⁴:ConnectedSpace Minst✝³:ChartedSpace (EuclideanSpace ℝ (Fin 3)) Minst✝²:AddAction ℤ_[p] Minst✝¹:ContinuousVAdd ℤ_[p] Minst✝:FaithfulVAdd ℤ_[p] M⊢ False All goals completed! 🐙
#1
Wang-Zahl: the three-dimensional Kakeya conjecture
wang_zahl_kakeya_dimH

Verso theorem preview

theorem declaration uses `sorry`wang_zahl_kakeya_dimH {K : Set LeanEval.Analysis.WangZahlKakeya.Space} (hK : LeanEval.Analysis.WangZahlKakeya.IsKakeya K) : dimH K = 3 := K:Set SpacehK:IsKakeya K⊢ dimH K = 3 All goals completed! 🐙
#2
Direct summand theorem and derived variant
direct_summand

Verso theorem preview

theorem declaration uses `sorry`derived_direct_summand [HasDerivedCategory (ModuleCat A)] (X : Scheme) (f : X ⟶ Spec (.of A)) [IsProper f] (surj : Function.Surjective f) [HasDerivedCategory (SheafOfModules X.ringCatSheaf)] : let φ : A →+* Γ(X, ⊤) := ((ΓSpec.adjunction.homEquiv _ _).symm f).unop.hom let : Algebra A Γ(X, ⊤) := φ.toAlgebra ∀ _ : EnoughInjectives (SheafOfModules X.ringCatSheaf), IsSplitMono <| (DerivedCategory.Plus.singleFunctor _ 0).map (ModuleCat.ofHom (Algebra.linearMap A Γ(X, ⊤))) ≫ (rightDerivedFunctorPlusUnit' (SheafOfModules.evaluation X.ringCatSheaf ⟨⊤⟩ ⋙ ModuleCat.restrictScalars φ) 0).app (SheafOfModules.unit X.ringCatSheaf) := A:Type u_1inst✝⁴:CommRing Ainst✝³:IsRegularRing Ainst✝²:HasDerivedCategory (ModuleCat A)X:Schemef:X ⟶ Spec ↧Ainst✝¹:IsProper fsurj:Function.Surjective ⇑finst✝:HasDerivedCategory (SheafOfModules X.ringCatSheaf)⊢ let φ := CommRingCat.Hom.hom ((ΓSpec.adjunction.homEquiv X (Opposite.op ↧A)).symm f).unop; let this := φ.toAlgebra; ∀ (x : EnoughInjectives (SheafOfModules X.ringCatSheaf)), IsSplitMono ((DerivedCategory.Plus.singleFunctor (ModuleCat A) 0).map (ModuleCat.ofHom (Algebra.linearMap A ↑Γ(X, ⊤))) ≫ (rightDerivedFunctorPlusUnit' (SheafOfModules.evaluation X.ringCatSheaf (Opposite.op ⊤) ⋙ ModuleCat.restrictScalars φ) 0).app (SheafOfModules.unit X.ringCatSheaf)) All goals completed! 🐙
theorem declaration uses `sorry`direct_summand (B : Type*) [CommRing B] [Algebra A B] [Module.Finite A B] [FaithfulSMul A B] : ∃ π : B →ₗ[A] A, π ∘ₗ Algebra.linearMap A B = .id := A:Type u_1inst✝⁵:CommRing Ainst✝⁴:IsRegularRing AB:Type u_2inst✝³:CommRing Binst✝²:Algebra A Binst✝¹:Module.Finite A Binst✝:FaithfulSMul A B⊢ ∃ π, π ∘ₗ Algebra.linearMap A B = LinearMap.id All goals completed! 🐙
#3
Mandelbar (tricorn) is not path-connected (Hubbard–Schleicher)
mandelbar_not_path_connected

Verso theorem preview

theorem declaration uses `sorry`mandelbar_not_path_connected : ¬ IsPathConnected LeanEval.ComplexAnalysis.Mandelbar := ⊢ ¬IsPathConnected Mandelbar All goals completed! 🐙
#4
Milnor's exotic 7-sphere
milnor_exotic_sphere_seven

Verso theorem preview

theorem declaration uses `sorry`milnor_exotic_sphere_seven : ∃ (M : Type) (_ : TopologicalSpace M) (_ : ChartedSpace (EuclideanSpace ℝ (Fin 7)) M) (_ : IsManifold (𝓡 7) ∞ M) (_homeo : M ≃ₜ sphere (0 : EuclideanSpace ℝ (Fin 8)) 1), IsEmpty (M ≃ₘ⟮𝓡 7, 𝓡 7⟯ sphere (0 : EuclideanSpace ℝ (Fin 8)) 1) := ⊢ ∃ M x x_1, ∃ (_ : IsManifold (𝓡 7) ∞ M), ∃ _homeo, IsEmpty (M ≃ₘ⟮𝓡 7, 𝓡 7⟯ ↑(sphere 0 1)) All goals completed! 🐙
#5
Wilkie's conjecture for Pfaffian structures
annals_wilkies_conjecture

Verso theorem preview

theorem declaration uses `sorry`corollary_1 (X : Set ℝⁿ) (h : WilkiesConjecture.IsRExpDefinable X) : ∃ f : MvPolynomial (Fin 2) ℝ, ∀ (g H : ℕ), Nat.card (WilkiesConjecture.degreeHeightLE X.trans g H) ≤ f.eval ![(g : ℝ), Real.log H] := n:ℕX:Set (Fin n → ℝ)h:IsRExpDefinable X⊢ ∃ f, ∀ (g H : ℕ), ↑(Nat.card ↑(degreeHeightLE X.trans g H)) ≤ (MvPolynomial.eval ![↑g, Real.log ↑H]) f All goals completed! 🐙
#6
Shafarevich's theorem on solvable Galois groups
shafarevich_solvable_galois

Verso theorem preview

theorem declaration uses `sorry`shafarevich_solvable_galois (G : Type*) [Group G] [Finite G] [Group.IsSolvable G] : ∃ (K : Type) (_ : Field K) (_ : Algebra ℚ K) (_ : FiniteDimensional ℚ K) (_ : IsGalois ℚ K), Nonempty (G ≃* (K ≃ₐ[ℚ] K)) := G:Type u_1inst✝²:Group Ginst✝¹:Finite Ginst✝:Group.IsSolvable G⊢ ∃ K x x_1, ∃ (_ : FiniteDimensional ℚ K) (_ : IsGalois ℚ K), Nonempty (G ≃* Gal(K/ℚ)) All goals completed! 🐙
#7
Serre finiteness for homotopy groups of spheres
pi_sphere_infinite_iff

Verso theorem preview

theorem declaration uses `sorry`pi_sphere_infinite_iff (k n : ℕ) (hn : 1 ≤ n) (x : Metric.sphere (0 : EuclideanSpace ℝ (Fin (n + 1))) 1) : Infinite (HomotopyGroup.Pi k (Metric.sphere (0 : EuclideanSpace ℝ (Fin (n + 1))) 1) x) ↔ k = n ∨ (Even n ∧ k + 1 = 2 * n) := k:ℕn:ℕhn:1 ≤ nx:↑(Metric.sphere 0 1)⊢ Infinite (HomotopyGroup.Pi k (↑(Metric.sphere 0 1)) x) ↔ k = n ∨ Even n ∧ k + 1 = 2 * n All goals completed! 🐙
#8
Hausdorff dimension of the Mandelbrot boundary (Shishikura)
mandelbrot_boundary_dimh

Verso theorem preview

theorem declaration uses `sorry`mandelbrot_boundary_dimh : dimH (frontier LeanEval.Dynamics.MandelbrotBoundary.Mandelbrot) = 2 := ⊢ dimH (frontier Mandelbrot) = 2 All goals completed! 🐙
#9
Integer multiplication in time O(n log n)
annals_integer_multiplication

Verso theorem preview

theorem declaration uses `sorry`theorem_1_1 : ∃ T : TM2ComputableInTime (IntegerMultiplication.encodeProd encodeNat encodeNat) encodeNat (fun (x, y) ↦ x * y), (fun n ↦ (T.time n : ℝ)) =O[Filter.atTop] (fun n ↦ n * log n) := ⊢ ∃ T, (fun n => ↑(T.time n)) =O[Filter.atTop] fun n => ↑n * log ↑n All goals completed! 🐙
#10
Lai-Sang Young entropy–dimension–Lyapunov theorem
entropy_dimension_lyapunov

Verso theorem preview

theorem declaration uses `sorry`entropy_dimension_lyapunov (T T_inv : LeanEval.Dynamics.EucPlane → LeanEval.Dynamics.EucPlane) (hT_smooth : ContDiff ℝ 2 T) (hT_inv_smooth : ContDiff ℝ 2 T_inv) (hT_left : Function.LeftInverse T_inv T) (hT_right : Function.RightInverse T_inv T) (K : Set LeanEval.Dynamics.EucPlane) (hK_compact : IsCompact K) (hK_inv : T '' K = K) (μ : Measure LeanEval.Dynamics.EucPlane) [IsProbabilityMeasure μ] (hμ_supp : μ Kᶜ = 0) (hμ_pres : MeasurePreserving T μ μ) (hμ_erg : Ergodic T μ) : kolmogorovSinaiEntropy μ T = (dimMeasure μ).toReal * harmonicMeanLyapunov (∫ x, lyapunovUpperAt T x ∂μ) (∫ x, lyapunovLowerAt T x ∂μ) / 2 := T:EucPlane → EucPlaneT_inv:EucPlane → EucPlanehT_smooth:ContDiff ℝ 2 ThT_inv_smooth:ContDiff ℝ 2 T_invhT_left:Function.LeftInverse T_inv ThT_right:Function.RightInverse T_inv TK:Set EucPlanehK_compact:IsCompact KhK_inv:T '' K = Kμ:Measure EucPlaneinst✝:IsProbabilityMeasure μhμ_supp:μ Kᶜ = 0hμ_pres:MeasurePreserving T μ μhμ_erg:Ergodic T μ⊢ kolmogorovSinaiEntropy μ T = (dimMeasure μ).toReal * harmonicMeanLyapunov (∫ (x : EucPlane), lyapunovUpperAt T x ∂μ) (∫ (x : EucPlane), lyapunovLowerAt T x ∂μ) / 2 All goals completed! 🐙
#11
On property (T) for Aut(F_n) and SL_n(Z)
annals_on_property_t

Verso theorem preview

theorem declaration uses `sorry`theorem_1 (n : ℕ) (hn : n ≥ 6) : OnPropertyT.PropertyT (MulAut (FreeGroup (Fin n))) := n:ℕhn:n ≥ 6⊢ PropertyT (MulAut (FreeGroup (Fin n))) All goals completed! 🐙
#12
Existence of a 64-dim irreducible g₂-representation with 14 tensor-square isotypic components
g2_irrep_tensor_square_decomp

Verso theorem preview

theorem declaration uses `sorry`g2_irrep_tensor_square_decomp : ∃ (V : Type) (_ : AddCommGroup V) (_ : Module ℂ V) (_ : LieRingModule (LieAlgebra.g₂ ℂ) V) (_ : LieModule ℂ (LieAlgebra.g₂ ℂ) V), Module.finrank ℂ V = 64 ∧ LieModule.IsIrreducible ℂ (LieAlgebra.g₂ ℂ) V ∧ (isotypicComponents (UniversalEnvelopingAlgebra ℂ (LieAlgebra.g₂ ℂ)) (V ⊗[ℂ] V)).ncard = 14 := ⊢ ∃ V x x_1 x_2, ∃ (x_3 : LieModule ℂ (LieAlgebra.g₂ ℂ) V), Module.finrank ℂ V = 64 ∧ LieModule.IsIrreducible ℂ (LieAlgebra.g₂ ℂ) V ∧ (isotypicComponents (UniversalEnvelopingAlgebra ℂ (LieAlgebra.g₂ ℂ)) (V ⊗[ℂ] V)).ncard = 14 All goals completed! 🐙
#13
The rectangular peg problem
annals_rectangular_peg_problem

Verso theorem preview

theorem declaration uses `sorry`theorem_1 (γ : Circle → ℂ) (z w : ℂ) (θ : Real.Angle) (hγ : IsSmoothEmbedding (𝓡 1) 𝓘(ℝ, ℂ) ∞ γ) : ∃ (θ' : Real.Angle), ∃ (z' w' : ℂ), Similar (R z w θ) (R z' w' θ') ∧ ∀ i : Fin 4, R z' w' θ' i ∈ Set.range γ := γ:Circle → ℂz:ℂw:ℂθ:Anglehγ:IsSmoothEmbedding (𝓡 1) 𝓘(ℝ, ℂ) ∞ γ⊢ ∃ θ' z' w', Similar (R z w θ) (R z' w' θ') ∧ ∀ (i : Fin 4), R z' w' θ' i ∈ Set.range γ All goals completed! 🐙
#14
Finite-time singularity formation for C^{1,α} solutions to the incompressible Euler equations on ℝ³
annals_finite_time_singularity

Verso theorem preview

theorem declaration uses `sorry`theorem_1 : ∃ α > 0, ∃ u₀, div u₀ = 0 ∧ FiniteTimeSingularity.IsOdd u₀ ∧ IsContDiffHolder ℝ α u₀ ∧ (∃ C > 0, ∀ x, ‖(∇×u₀) x‖ ≤ C / (‖x‖ ^ (α : ℝ) + 1)) ∧ ∃ p, ∃ u, (∀ t ∈ Ico 0 1, FiniteTimeSingularity.IsOdd (u · t)) ∧ FiniteTimeSingularity.IsLocalEulerEquationSolution p u₀ 1 u ∧ (∀ T ∈ Ioo 0 1, IsContDiffHolderOn ℝ α u.uncurry (univ ×ˢ Icc 0 T)) ∧ Tendsto (fun t ↦ ∫ s in 0..t, ⨆ x, ‖(∇×(u · s)) x‖) (𝓝[<] 1) atTop := ⊢ ∃ α > 0, ∃ u₀, div u₀ = 0 ∧ IsOdd u₀ ∧ IsContDiffHolder ℝ α u₀ ∧ (∃ C > 0, ∀ (x : ℝ³), ‖(∇×u₀) x‖ ≤ C / (‖x‖ ^ ↑α + 1)) ∧ ∃ p u, (∀ t ∈ Ico 0 1, IsOdd fun x => u x t) ∧ IsLocalEulerEquationSolution p u₀ 1 u ∧ (∀ T ∈ Ioo 0 1, IsContDiffHolderOn ℝ α (Function.uncurry u) (univ ×ˢ Icc 0 T)) ∧ Tendsto (fun t => ∫ (s : ℝ) in 0..t, ⨆ x, ‖(∇×fun x => u x s) x‖) (𝓝[<] 1) atTop All goals completed! 🐙
#15
Motivic invariants of birational maps
annals_motivic_invariants

Verso theorem preview

/-- Statement of Theorem 1.2 (1) (a): When `𝕜` is a number field, `Cr₃(𝕜)` is not generated by pseudo-regularizable elements. -/ theorem declaration uses `sorry`theorem_1_2_1_a [NumberField 𝕜] : ¬ GenByPseudoRegularizable 𝕜 3 := 𝕜:Typeinst✝¹:Field 𝕜inst✝:NumberField 𝕜⊢ ¬GenByPseudoRegularizable 𝕜 3 All goals completed! 🐙
/-- Statement of Theorem 1.2 (1) (b): When `𝕜` is a function field over a number field, `Cr₃(𝕜)` is not generated by pseudo-regularizable elements. Here by a function field, we mean a function field of a positive-dimensional `𝔽`-variety. -/ theorem declaration uses `sorry`theorem_1_2_1_b [NumberField 𝔽] (X : Scheme) [Variety 𝔽 X] (hX : 0 < topologicalKrullDim X) : ¬ GenByPseudoRegularizable X.functionField 3 := 𝔽:Typeinst✝²:Field 𝔽inst✝¹:NumberField 𝔽X:Schemeinst✝:Variety 𝔽 XhX:0 < topologicalKrullDim ↥X⊢ ¬GenByPseudoRegularizable (↑X.functionField) 3 All goals completed! 🐙
/-- Statement of Theorem 1.2 (1) (c): When `𝕜` is a function field over a finite field, `Cr₃(𝕜)` is not generated by pseudo-regularizable elements. Here by a function field, we mean a function field of a positive-dimensional `𝔽`-variety. -/ theorem declaration uses `sorry`theorem_1_2_1_c [Finite 𝔽] (X : Scheme) [Variety 𝔽 X] (hX : 0 < topologicalKrullDim X) : ¬ GenByPseudoRegularizable X.functionField 3 := 𝔽:Typeinst✝²:Field 𝔽inst✝¹:Finite 𝔽X:Schemeinst✝:Variety 𝔽 XhX:0 < topologicalKrullDim ↥X⊢ ¬GenByPseudoRegularizable (↑X.functionField) 3 All goals completed! 🐙
/-- Statement of Theorem 1.2 (1) (d): When `𝕜` is a function field over an algebraically closed field, `Cr₃(𝕜)` is not generated by pseudo-regularizable elements. Here by a function field, we mean a function field of a positive-dimensional `𝔽`-variety. -/ theorem declaration uses `sorry`theorem_1_2_1_d [IsAlgClosed 𝔽] (X : Scheme) [Variety 𝔽 X] (hX : 0 < topologicalKrullDim X) : ¬ GenByPseudoRegularizable X.functionField 3 := 𝔽:Typeinst✝²:Field 𝔽inst✝¹:IsAlgClosed 𝔽X:Schemeinst✝:Variety 𝔽 XhX:0 < topologicalKrullDim ↥X⊢ ¬GenByPseudoRegularizable (↑X.functionField) 3 All goals completed! 🐙
/-- Statement of Theorem 1.2 (2): For subfields `𝕜 ≤ ℂ` and `n ≥ 4`, `Crₙ(𝕜)` is not generated by pseudo-regularizable elements. -/ theorem declaration uses `sorry`theorem_1_2_2 {n : ℕ} (hn : 4 ≤ n) (𝕜 : Subfield ℂ) : ¬ GenByPseudoRegularizable 𝕜 n := n:ℕhn:4 ≤ n𝕜:Subfield ℂ⊢ ¬GenByPseudoRegularizable (↥𝕜) n All goals completed! 🐙
/-- Statement of Theorem 1.2 (3): For infinite fields `𝕜` and `n ≥ 5`, `Crₙ(𝕜)` is not generated by pseudo-regularizable elements. -/ theorem declaration uses `sorry`theorem_1_2_3 {n : ℕ} (hn : 5 ≤ n) [Infinite 𝕜] : ¬ GenByPseudoRegularizable 𝕜 n := 𝕜:Typeinst✝¹:Field 𝕜n:ℕhn:5 ≤ ninst✝:Infinite 𝕜⊢ ¬GenByPseudoRegularizable 𝕜 n All goals completed! 🐙
#16
Linnik's theorem (L = 5.5)
linnik

Verso theorem preview

theorem declaration uses `sorry`linnik : ∃ c : ℝ, ∀ ⦃a d : ℕ⦄, 0 < a → a < d → a.Coprime d → p a d ≤ c * d ^ (5.5 : ℝ) := ⊢ ∃ c, ∀ ⦃a d : ℕ⦄, 0 < a → a < d → a.Coprime d → ↑(p a d) ≤ c * ↑d ^ 5.5 All goals completed! 🐙
#17
Pointwise ergodic theorems for non-conventional bilinear polynomial averages
annals_pointwise_ergodic_theorems

Verso theorem preview

/-- Statement of Theorem 1.17(i) (Mean ergodic theorem): The averages `A T N X P f g` converge as `N → ∞` in `Lᵖ(X)` norm. -/ theorem declaration uses `sorry`theorem_1_17_i {f g : 𝓧 → ℂ} (hf : MemLp f p₁ μ) (hg : MemLp g p₂ μ) : ∃ h : 𝓧 → ℂ, MemLp h p μ ∧ Tendsto (fun N ↦ eLpNorm (A T N (X : ℤ[X]) P f g - h) p μ) atTop (𝓝 0) := 𝓧:Type u_1σX:MeasurableSpace 𝓧μ:Measure 𝓧inst✝:SigmaFinite μT:𝓧 ≃ᵐ 𝓧hT:MeasurePreserving (⇑T) μ μP:ℤ[X]hP:P.degree ≥ 2p₁:ℝ≥0∞p₂:ℝ≥0∞p:ℝ≥0∞h₁p₁:1 < p₁h₁p₂:1 < p₂h₂p₁:p₁ < ∞h₂p₂:p₂ < ∞hp₁p₂p:p₁⁻¹ + p₂⁻¹ = p⁻¹hp:p⁻¹ ≤ 1f:𝓧 → ℂg:𝓧 → ℂhf:MemLp f p₁ μhg:MemLp g p₂ μ⊢ ∃ h, MemLp h p μ ∧ Tendsto (fun N => eLpNorm (A T N X P f g - h) p μ) atTop (𝓝 0) All goals completed! 🐙
/-- Statement of Theorem 1.16(ii) (Pointwise ergodic theorem): The averages `A T N X P f g` converge as `N → ∞` pointwise almost everywhere. -/ theorem declaration uses `sorry`theorem_1_17_ii {f g : 𝓧 → ℂ} (hf : MemLp f p₁ μ) (hg : MemLp g p₂ μ) : ∃ h : 𝓧 → ℂ, MemLp h p μ ∧ ∀ᵐ x ∂μ, Tendsto (fun N ↦ A T N (X : ℤ[X]) P f g x) atTop (𝓝 (h x)) := 𝓧:Type u_1σX:MeasurableSpace 𝓧μ:Measure 𝓧inst✝:SigmaFinite μT:𝓧 ≃ᵐ 𝓧hT:MeasurePreserving (⇑T) μ μP:ℤ[X]hP:P.degree ≥ 2p₁:ℝ≥0∞p₂:ℝ≥0∞p:ℝ≥0∞h₁p₁:1 < p₁h₁p₂:1 < p₂h₂p₁:p₁ < ∞h₂p₂:p₂ < ∞hp₁p₂p:p₁⁻¹ + p₂⁻¹ = p⁻¹hp:p⁻¹ ≤ 1f:𝓧 → ℂg:𝓧 → ℂhf:MemLp f p₁ μhg:MemLp g p₂ μ⊢ ∃ h, MemLp h p μ ∧ ∀ᵐ (x : 𝓧) ∂μ, Tendsto (fun N => A T N X P f g x) atTop (𝓝 (h x)) All goals completed! 🐙
/-- The constant of Theorem 1.17 (iii). -/ noncomputable def declaration uses `sorry`Cᵢᵢᵢ (P : ℤ[X]) (p₁ p₂ : ℝ≥0∞) : ℝ≥0 := sorry
/-- Statement of Theorem 1.17(iii) (Maximal ergodic theorem): There exists a constant `C ≥ 0` such that for any `f ∈ Lᵖ₁(X)` and `g ∈ Lᵖ₂(X)`, `‖A T (N : ℕ+) X P f g‖_{Lᵖ(X;ℓ∞)} ≤ C ‖f‖_{Lᵖ₁(X)} ‖g‖_{Lᵖ₂(X)}`. -/ theorem declaration uses `sorry`theorem_1_17_iii {f g : 𝓧 → ℂ} (hf : MemLp f p₁ μ) (hg : MemLp g p₂ μ) : eLpNorm (fun x ↦ ⨆ (N : ℕ+), ‖A T N (X : ℤ[X]) P f g x‖ₑ) p μ ≤ Cᵢᵢᵢ P p₁ p₂ * ‖hf.toLp‖ₑ * ‖hg.toLp‖ₑ := 𝓧:Type u_1σX:MeasurableSpace 𝓧μ:Measure 𝓧inst✝:SigmaFinite μT:𝓧 ≃ᵐ 𝓧hT:MeasurePreserving (⇑T) μ μP:ℤ[X]hP:P.degree ≥ 2p₁:ℝ≥0∞p₂:ℝ≥0∞p:ℝ≥0∞h₁p₁:1 < p₁h₁p₂:1 < p₂h₂p₁:p₁ < ∞h₂p₂:p₂ < ∞hp₁p₂p:p₁⁻¹ + p₂⁻¹ = p⁻¹hp:p⁻¹ ≤ 1f:𝓧 → ℂg:𝓧 → ℂhf:MemLp f p₁ μhg:MemLp g p₂ μ⊢ eLpNorm (fun x => ⨆ N, ‖A T (↑↑N) X P f g x‖ₑ) p μ ≤ ↑(Cᵢᵢᵢ P p₁ p₂) * ‖MemLp.toLp f hf‖ₑ * ‖MemLp.toLp g hg‖ₑ All goals completed! 🐙
/-- The constant of Theorem 1.17 (iv). -/ noncomputable def declaration uses `sorry`Cᵢᵥ (P : ℤ[X]) (p₁ p₂ : ℝ≥0∞) (r Λ : ℝ≥0) : ℝ≥0 := sorry
/-- Statement of Theorem 1.17(iv) (Long variational ergodic theorem): For any `r > 2` and `Λ > 1`, there exists a constant `C ≥ 0` such that for any `f ∈ Lᵖ₁(X)`, `g ∈ Lᵖ₂(X)` and `Λ`-lacunary sequence `a` such that `1 ≤ a n` for all `n ∈ ℕ`, `‖A T (a n) X P f g‖_{Lᵖ(X;Vʳ)} ≤ C ‖f‖_{Lᵖ₁(X)} ‖g‖_{Lᵖ₂(X)}`. -/ theorem declaration uses `sorry`theorem_1_17_iv (r Λ : ℝ≥0) (hr : r > 2) (hΛ : Λ > 1) {f g : 𝓧 → ℂ} (hf : MemLp f p₁ μ) (hg : MemLp g p₂ μ) (a : ℕ → ℝ≥0) (ha : Lacunary Λ a) (ha' : ∀ n, 1 ≤ a n) : eLpNorm (fun x ↦ variationalNorm r fun n ↦ A T (a n) X P f g x) p μ ≤ Cᵢᵥ P p₁ p₂ r Λ * ‖hf.toLp‖ₑ * ‖hg.toLp‖ₑ := 𝓧:Type u_1σX:MeasurableSpace 𝓧μ:Measure 𝓧inst✝:SigmaFinite μT:𝓧 ≃ᵐ 𝓧hT:MeasurePreserving (⇑T) μ μP:ℤ[X]hP:P.degree ≥ 2p₁:ℝ≥0∞p₂:ℝ≥0∞p:ℝ≥0∞h₁p₁:1 < p₁h₁p₂:1 < p₂h₂p₁:p₁ < ∞h₂p₂:p₂ < ∞hp₁p₂p:p₁⁻¹ + p₂⁻¹ = p⁻¹hp:p⁻¹ ≤ 1r:ℝ≥0Λ:ℝ≥0hr:r > 2hΛ:Λ > 1f:𝓧 → ℂg:𝓧 → ℂhf:MemLp f p₁ μhg:MemLp g p₂ μa:ℕ → ℝ≥0ha:Lacunary Λ aha':∀ (n : ℕ), 1 ≤ a n⊢ eLpNorm (fun x => variationalNorm r fun n => A T (a n) X P f g x) p μ ≤ ↑(Cᵢᵥ P p₁ p₂ r Λ) * ‖MemLp.toLp f hf‖ₑ * ‖MemLp.toLp g hg‖ₑ All goals completed! 🐙
#18
Fourier interpolation in dimensions 8 and 24
ckmrv_fourier_interpolation

Lean theorem statement

/-- **Cohn-Kumar-Miller-Radchenko-Viazovska Fourier interpolation theorem.**
In dimension 8 sampling starts at `sqrt 2`, while in dimension 24 it starts
at radius `2`. In both cases the four sample sequences give a bijection
between radial Schwartz functions and rapidly decreasing data. -/
theorem ckmrv_fourier_interpolation :
    CKMRV 8 1 ∧ CKMRV 24 2 := by
  sorry
#19
Higher uniformity of bounded multiplicative functions in short intervals on average
annals_bounded_multiplicative_functions

Lean theorem statement

/--
Statement of Theorem 1.3 (Non-pretentious multiplicative functions do not correlate
with polynomial phases on short intervals on average):

Let `k : ℕ`, `θ : ℝ` such that `0 < θ < 1/2` and `η : ℝ` such that `η > 0`. Then there exist
constants `Q : ℕ` such that `Q > 0`, `C : ℝ` such that `C > 0`, and `B : ℝ`, such that for any
multiplicative 1-bounded arithmetic function `f : ℕ → ℂ`, any `X : ℝ` such that `X ≥ 1` and any
`H : ℝ` such that `Xᶿ ≤ H ≤ X¹⁻ᶿ`, if

`∫ x ∈ [X, 2X], ‖f‖_{uᵏ⁺¹[x, x + H]}dx ≥ ηX`

then

`M(f;CXᵏ⁺¹/Hᵏ⁺¹,Q) ≤ B`.
-/
theorem theorem_1_3 (k : ℕ) (θ : ℝ) (hθ₀ : 0 < θ) (hθ₁ : θ < 1 / 2) (η : ℝ) (hη : η > 0) :
    ∃ (Q : ℕ+) (_hQ : 1 ≤ Q) (C : ℝ) (_hC : 0 < C) (B : ℝ),
      ∀ (f : ArithmeticFunction ℂ) (_hf : f.IsMultiplicative) (_hf' : IsOneBounded f)
        (X : ℝ) (_hX : X ≥ 1) (H : ℝ) (_hXH : X ^ θ ≤ H) (_hHX : H ≤ X ^ (1 - θ)),
          ∫ x in X..(2 * X), weakGowersUniformityNorm k x H f.intExtension ≥ η * X →
            M f (C * X ^ (k + 1) / H ^ (k + 1)) Q ≤ B := by
  sorry

/--
Statement of Corollary 1.1 (Liouville does not correlate with polynomial phases on
short intervals on average):

Let `λ` denote the liouville function. Fix `k : ℕ` and `θ : ℝ` such that `0 < θ < 1`. Then

`∫ x ∈ [X, 2X], ‖λ‖_{uᵏ⁺¹[x, x + Xᶿ]}dx = o(X)`

as `X → ∞`.
-/
theorem corollary_1_1 (k : ℕ) (θ : ℝ) (hθ₀ : 0 < θ) (hθ₁ : θ < 1) :
    (fun X ↦ ∫ x in X..(2 * X), weakGowersUniformityNorm k x (X ^ θ) (fun n ↦ liouville ⌊n⌋₊))
      =o[atTop] (fun X ↦ X) := by
  sorry
#20
Friedlander–Iwaniec theorem
friedlander_iwaniec

Verso theorem preview

theorem declaration uses `sorry`friedlander_iwaniec : {p : ℕ | p.Prime ∧ ∃ a b, p = a ^ 2 + b ^ 4}.Infinite := ⊢ {p | Nat.Prime p ∧ ∃ a b, p = a ^ 2 + b ^ 4}.Infinite All goals completed! 🐙
#21
Gorenstein–Walter theorem (dihedral Sylow 2-subgroup)
gorenstein_walter

Verso theorem preview

theorem declaration uses `sorry`gorenstein_walter (G : Type) [Group G] [Finite G] [IsSimpleGroup G] (hnonab : ∃ a b : G, a * b ≠ b * a) (P : Sylow 2 G) (_hdih : ∃ n : ℕ, Nonempty ((P : Subgroup G) ≃* DihedralGroup n)) : Nonempty (G ≃* alternatingGroup (Fin 7)) ∨ ∃ p k : ℕ, ∃ _hp : Fact p.Prime, Odd p ∧ 5 ≤ p ^ k ∧ Nonempty (G ≃* PSL(2, GaloisField p k)) := G:Typeinst✝²:Group Ginst✝¹:Finite Ginst✝:IsSimpleGroup Ghnonab:∃ a b, a * b ≠ b * aP:Sylow 2 G_hdih:∃ n, Nonempty (↥↑P ≃* DihedralGroup n)⊢ Nonempty (G ≃* ↥(alternatingGroup (Fin 7))) ∨ ∃ p k, ∃ (_hp : Fact (Nat.Prime p)), Odd p ∧ 5 ≤ p ^ k ∧ Nonempty (G ≃* PSL(2, GaloisField p k)) All goals completed! 🐙
#22
Linear independence results of Calegari–Dimitrov–Tang
cdt_linearIndependent

Lean theorem statement

/--
Theorem A and C in arXiv:2408.15403.
-/
theorem cdt_linearIndependent :
    letI χ : ZMod 3 → ℂ := ![0, 1, -1]
    LinearIndependent ℚ ![1, riemannZeta 2, ZMod.LFunction χ 2] ∧
    ∀ m n : ℤ, m ≠ -1 → m ≠ 0 → n ≠ -1 → n ≠ 0 → 10 ^ 6 * |m - n| < |n| →
      letI lm := Real.log (1 + 1 / m)
      letI ln := Real.log (1 + 1 / n)
      Irrational (lm * ln) ∧
      (m ≠ n → LinearIndependent ℚ ![1, lm, ln, lm * ln]) := by
  sorry
#23
Jacobian of a smooth proper curve (Merten challenge)
jacobian_challenge_alggeo

Lean theorem statement

/-- The genus of a smooth proper curve. -/
def genus (C : Over (Spec (.of k))) [IsProper C.hom] [SmoothOfRelativeDimension 1 C.hom]
    [GeometricallyIrreducible C.hom] : ℕ :=
  sorry

/-- The Jacobian of a smooth, proper curve over a field `k`. -/
def Jacobian (C : Over (Spec (.of k))) [IsProper C.hom] [SmoothOfRelativeDimension 1 C.hom]
    [GeometricallyIrreducible C.hom] : Over (Spec (.of k)) :=
  sorry

/-- The group scheme structure on the Jacobian of the curve `C`. -/
instance instGrpObj : GrpObj (Jacobian C) :=
  sorry

/-- The Jacobian of `C` is smooth of relative dimension `g` over `k`, where `g` is the
genus of `C`. -/
instance smoothOfRelativeDimension_genus :
    SmoothOfRelativeDimension (genus C) (Jacobian C).hom :=
  sorry

/-- The Jacobian of `C` is proper over `k`. -/
instance instIsProper : IsProper (Jacobian C).hom :=
  sorry

/-- The Jacobian of `C` is geometrically irreducible over `k`. -/
instance instGeometricallyIrreducible : GeometricallyIrreducible (Jacobian C).hom :=
  sorry

/-- The Abel-Jacobi map from a smooth, proper curve to its Jacobian associated
to a `k`-rational point of `C`. -/
def ofCurve (P : 𝟙_ (Over (Spec (.of k))) ⟶ C) : C ⟶ Jacobian C :=
  sorry

/-- The Abel-Jacobi map sends the `k`-rational point `P` to `0`, where `0` (denoted by `η` below) is
the neutral element of the group scheme `Jacobian C`. -/
theorem comp_ofCurve (C : Over (Spec (.of k))) [IsProper C.hom]
    [SmoothOfRelativeDimension 1 C.hom] [GeometricallyIrreducible C.hom]
    (P : 𝟙_ (Over (Spec (.of k))) ⟶ C) :
    P ≫ ofCurve P = η[Jacobian C] :=
  sorry

/--
The universal property of the Jacobian variety: For any abelian variety `A`,
any morphism `f : C ⟶ A` such that `f(P) = 0` factors uniquely through the
Jacobian of `C`.
In other words, `Jacobian C` is the Albanese variety of `C`.
-/
theorem exists_unique_ofCurve_comp (C : Over (Spec (.of k))) [IsProper C.hom]
    [SmoothOfRelativeDimension 1 C.hom] [GeometricallyIrreducible C.hom]
    (P : 𝟙_ (Over (Spec (.of k))) ⟶ C)
    {A : Over (Spec (.of k))} [Smooth A.hom] [IsProper A.hom] [GrpObj A]
    [GeometricallyIrreducible A.hom] (f : C ⟶ A) (hf : P ≫ f = η[A]) :
    ∃! (g : Jacobian C ⟶ A), f = ofCurve P ≫ g :=
  sorry
#24
Existence of an aspherical integer homology 4-sphere
aspherical_integer_homology_four_sphere

Lean theorem statement

/-- **Existence of an aspherical integer homology 4-sphere** (Tschantz, answering
`[Kir97, Problem 4.17]`). There is a closed topological 4-manifold that is both
aspherical and an integer homology 4-sphere. -/
theorem aspherical_integer_homology_four_sphere :
    ∃ M : Closed4Manifold, M.IsAspherical ∧ M.IsIntegerHomologySphere := by
  sorry
#25
The Hopf problem: a complex structure on the 6-sphere
hopf_s6_complex_structure

Verso theorem preview

/-- **Hole 1 (data).** An atlas of charts from the 6-sphere — the unit sphere in `ℝ⁷`, with its subspace topology — into `ℂ³`, taken as the plain function type `Fin 3 → ℂ`: all norms on a finite-dimensional space are equivalent, so the choice of model norm is immaterial to the statement. -/ instance declaration uses `sorry`instChartedSpaceS6 : ChartedSpace (Fin 3 → ℂ) (Metric.sphere (0 : EuclideanSpace ℝ (Fin 7)) 1) := sorry
/-- **Hole 2 (proof).** The atlas of hole 1 is holomorphic: its transition functions are `ℂ`-analytic on their open domains. -/ instance declaration uses `sorry`instIsManifoldS6 : IsManifold 𝓘(ℂ, Fin 3 → ℂ) ω (Metric.sphere (0 : EuclideanSpace ℝ (Fin 7)) 1) := sorry
#26
pi_6 of the 3-sphere is Z/12
pi6_sphere_three_mulEquiv_zmod_twelve

Lean theorem statement

/-- **π₆ of the 3-sphere.** Toda's tables give `π₆(𝕊³) ≅ ℤ/12`. -/
theorem pi6_sphere_three_mulEquiv_zmod_twelve
    (x : Metric.sphere (0 : EuclideanSpace ℝ (Fin 4)) 1) :
    Nonempty
      (HomotopyGroup.Pi 6 (Metric.sphere (0 : EuclideanSpace ℝ (Fin 4)) 1) x ≃*
        Multiplicative (ZMod 12)) := by
  sorry
#27
Avila-Jitomirskaya Ten Martini Problem
ten_martini_problem

Lean theorem statement

/-- **Avila-Jitomirskaya Ten Martini theorem.** For irrational frequency
and nonzero coupling, the spectrum of the almost Mathieu operator is a
Cantor set. Here this means nonempty, compact, perfect, and totally
disconnected. -/
theorem ten_martini_problem (α coupling θ : ℝ)
    (hα : Irrational α) (hcoupling : coupling ≠ 0) :
    ∃ H : EllTwo →L[ℂ] EllTwo,
      IsAlmostMathieuOperator α coupling θ H ∧
        (spectrum ℂ H).Nonempty ∧
        IsCompact (spectrum ℂ H) ∧
        Perfect (spectrum ℂ H) ∧
        IsTotallyDisconnected (spectrum ℂ H) := by
  sorry
#28
Adams: S^n is an H-space iff n = 0, 1, 3, 7
hSpace_sphere_iff

Lean theorem statement

/-- **Adams' Hopf-invariant-one theorem** (H-space form). The sphere `𝕊ⁿ`
admits an H-space structure if and only if `n = 0`, `1`, `3`, or `7`. -/
theorem hSpace_sphere_iff (n : ℕ) :
    Nonempty (HSpace (Metric.sphere (0 : EuclideanSpace ℝ (Fin (n + 1))) 1)) ↔
      n = 0 ∨ n = 1 ∨ n = 3 ∨ n = 7 := by
  sorry
#29
Smallness of exceptional set to Littlewood's conjecture
einsiedler_katok_lindenstrauss

Lean theorem statement

theorem einsiedler_katok_lindenstrauss :
    dimH {(α, β) : ℝ × ℝ | Filter.atTop.liminf
      (fun n : ℕ ↦ n * distToNearestInt (n * α) * distToNearestInt (n * β)) > 0} = 0 := by
  sorry
#30
Newlander–Nirenberg theorem
newlander_nirenberg

Lean theorem statement

/-- **The Newlander–Nirenberg theorem.** An almost complex structure with
vanishing Nijenhuis tensor is integrable. Formally: for every `x` in an open
set `U ⊆ ℝ^{2n}` carrying such a structure `J` there is a smooth local
diffeomorphism `φ` (an `OpenPartialHomeomorph`, smooth in both directions)
from a neighbourhood of `x` inside `U` onto an open subset of `ℂⁿ` whose
differential is complex linear:

  `dφ_y (J y v) = i · dφ_y v`.

Such charts are holomorphic coordinates for `J`. -/
theorem newlander_nirenberg {n : ℕ} {U : Set (E n)} (_hU : IsOpen U)
    (J : E n → E n →L[ℝ] E n) (_hJ : IsAlmostComplexOn J U)
    (_hN : NijenhuisVanishesOn J U) {x : E n} (_hx : x ∈ U) :
    ∃ φ : OpenPartialHomeomorph (E n) (EuclideanSpace ℂ (Fin n)),
      x ∈ φ.source ∧ φ.source ⊆ U ∧
      ContDiffOn ℝ ∞ (φ : E n → EuclideanSpace ℂ (Fin n)) φ.source ∧
      ContDiffOn ℝ ∞ (φ.symm : EuclideanSpace ℂ (Fin n) → E n) φ.target ∧
      ∀ y ∈ φ.source, ∀ v : E n,
        fderiv ℝ (φ : E n → EuclideanSpace ℂ (Fin n)) y (J y v)
          = Complex.I • fderiv ℝ (φ : E n → EuclideanSpace ℂ (Fin n)) y v := by
  sorry
#31
Mostow rigidity
mostow_rigidity

Lean theorem statement

theorem mostow_rigidity (n : ℕ) (hn : 3 ≤ n) (Γ Λ : Subgroup (PO n 1))
    (disc_Γ : IsDiscrete (SetLike.coe Γ)) (disc_Λ : IsDiscrete (SetLike.coe Λ))
    [HasFundamentalDomain Γ (PO n 1)] [HasFundamentalDomain Λ (PO n 1)]
    (covol_Γ : covolume Γ (PO n 1) ≠ ⊤) (covol_Λ : covolume Λ (PO n 1) ≠ ⊤)
    (f : Γ ≃* Λ) : ∃ g : PO n 1, ∀ γ : Γ, f γ = g * γ * g⁻¹ := by
  sorry
#32
Good Locally Testable Codes
annals_good_lt_codes

Lean theorem statement

/--
Statement of Theorem 1.2:

There exist explicit good locally testable codes (for every rate `ρ < 1`).
-/
theorem theorem_1_2 (ρ : ℝ≥0) (hρ : ρ < 1) :
    ∃ q, ∃ κ ≠ 0, ∃ (n : ℕ → ℕ), ∃ (𝒞 : (i : ℕ) → BinaryCode (n i)), IsGood 𝒞 ∧
      ∀ i, Nonempty (LTC q κ (𝒞 i)) ∧ rate (𝒞 i) ≥ ρ := by
  sorry
#33
Pesin entropy formula (symplectic surface case)
pesin_formula

Verso theorem preview

theorem declaration uses `sorry`pesin_formula (T T_inv : LeanEval.Dynamics.EucPlane → LeanEval.Dynamics.EucPlane) (hT_smooth : ContDiff ℝ 2 T) (hT_inv_smooth : ContDiff ℝ 2 T_inv) (hT_left : Function.LeftInverse T_inv T) (hT_right : Function.RightInverse T_inv T) (K : Set LeanEval.Dynamics.EucPlane) (hK_compact : IsCompact K) (hK_inv : T '' K = K) (μ : Measure LeanEval.Dynamics.EucPlane) [IsProbabilityMeasure μ] (hμ_supp : μ Kᶜ = 0) (hμ_pres : MeasurePreserving T μ μ) (hμ_erg : Ergodic T μ) (hμ_dim : dimMeasure μ = 2) (hlam_sym : ∫ x, lyapunovUpperAt T x ∂μ = -∫ x, lyapunovLowerAt T x ∂μ) : kolmogorovSinaiEntropy μ T = ∫ x, lyapunovUpperAt T x ∂μ := T:EucPlane → EucPlaneT_inv:EucPlane → EucPlanehT_smooth:ContDiff ℝ 2 ThT_inv_smooth:ContDiff ℝ 2 T_invhT_left:Function.LeftInverse T_inv ThT_right:Function.RightInverse T_inv TK:Set EucPlanehK_compact:IsCompact KhK_inv:T '' K = Kμ:Measure EucPlaneinst✝:IsProbabilityMeasure μhμ_supp:μ Kᶜ = 0hμ_pres:MeasurePreserving T μ μhμ_erg:Ergodic T μhμ_dim:dimMeasure μ = 2hlam_sym:∫ (x : EucPlane), lyapunovUpperAt T x ∂μ = -∫ (x : EucPlane), lyapunovLowerAt T x ∂μ⊢ kolmogorovSinaiEntropy μ T = ∫ (x : EucPlane), lyapunovUpperAt T x ∂μ All goals completed! 🐙
#34
Existence of a 779247-dim irreducible e₈-representation with 40 tensor-square isotypic components
e8_irrep_tensor_square_decomp

Lean theorem statement

theorem e8_irrep_tensor_square_decomp :
    ∃ (V : Type) (_ : AddCommGroup V) (_ : Module ℂ V)
      (_ : LieRingModule (LieAlgebra.e₈ ℂ) V) (_ : LieModule ℂ (LieAlgebra.e₈ ℂ) V),
      Module.finrank ℂ V = 779247 ∧
      LieModule.IsIrreducible ℂ (LieAlgebra.e₈ ℂ) V ∧
      (isotypicComponents (UniversalEnvelopingAlgebra ℂ (LieAlgebra.e₈ ℂ))
        (V ⊗[ℂ] V)).ncard = 40 := by
  sorry
#35
230 space groups (Fedorov 1891 / Schoenflies 1891)
space_groups_230

Lean theorem statement

/-- **230 space groups** (Fedorov 1891; Schoenflies 1891). In
dimension 3 there are 230 space groups (orientation-preserving
equivalence), 219 (general affine equivalence), and 65 orientation-
preserving subfamily. -/
theorem space_groups :
    crystallographicCountOP 3 = 230 ∧
      crystallographicCount 3 = 219 ∧
        crystallographicCountOPOnly 3 = 65 := by
  sorry
#36
The Hasse principle for random Fano hypersurfaces
annals_hasse_principle_random_fano

Lean theorem statement

/--
Statement of Theorem 1.1:

Let `d ≥ 2` and `n ≥ d` with `(d, n) ≠ (3, 3)`. Then we have `lim_{A → ∞} ρ_{d,n}(A) = ρˡᵒᶜ_{d,n}`.
-/
theorem theorem_1_1 (hd : 2 ≤ d) (h₁ : d ≤ n) (h₂ : (d, n) ≠ (3, 3)) :
    Tendsto (ρ d n) atTop (nhds (ρLoc d n)) := by
  sorry
#37
On the coherence of one-relator groups and their group algebras
annals_on_coherence_of_one_relator_groups

Lean theorem statement

/--
Statement of Theorem 1.1:

Let `G` be a one-relator group and `K` be a field of characteristic zero.
Then `G` is a coherent group and the group algebra `K[G]` is a coherent ring.
-/
theorem theorem_1_1 (G K : Type*) [Group G] [Field K] [CharZero K] (hG : Group.OneRelator G) :
    Group.Coherent G ∧ Ring.Coherent (MonoidAlgebra K G) := by
  sorry
#38
Equichordal point theorem (convex curves have a unique equichordal point)
equichordal_point_unique

Verso theorem preview

theorem declaration uses `sorry`equichordal_point_unique {K : Set LeanEval.Geometry.Equichordal.Plane} (hK : IsCompact K) (hconv : Convex ℝ K) (hne : (interior K).Nonempty) : ¬ ∃ P Q : LeanEval.Geometry.Equichordal.Plane, P ≠ Q ∧ LeanEval.Geometry.Equichordal.IsEquichordalPoint K P ∧ LeanEval.Geometry.Equichordal.IsEquichordalPoint K Q := K:Set PlanehK:IsCompact Khconv:Convex ℝ Khne:(interior K).Nonempty⊢ ¬∃ P Q, P ≠ Q ∧ IsEquichordalPoint K P ∧ IsEquichordalPoint K Q All goals completed! 🐙
#39
Whitney embedding theorem (strong form, dimension 2n)
whitney_embedding

Lean theorem statement

/-- **Whitney embedding theorem** (Whitney 1944). Every smooth
`n`-manifold (`n ≥ 1`, Hausdorff, second-countable) admits a smooth
embedding into `ℝ^{2n}`. -/
theorem whitney_embedding (n : ℕ) (_hn : 1 ≤ n)
    {M : Type*} [TopologicalSpace M]
    [ChartedSpace (EuclideanSpace ℝ (Fin n)) M] [IsManifold (𝓡 n) ∞ M]
    [T2Space M] [SecondCountableTopology M] :
    ∃ e : M → EuclideanSpace ℝ (Fin (2 * n)),
      ContMDiff (𝓡 n) (𝓡 (2 * n)) ∞ e ∧
      IsEmbedding e ∧
      ∀ x : M, Function.Injective (mfderiv (𝓡 n) (𝓡 (2 * n)) e x) := by
  sorry
#40
A proof of the Erdős–Faber–Lovász conjecture
annals_erdos_faber_lovasz_conjecture

Lean theorem statement

/--
Statement of Theorem 1.1:

For sufficiently large `n : ℕ`, every linear hypergraph on `n` vertices has chromatic index
at most `n`.
-/
theorem theorem_1_1 :
    ∀ᶠ n in atTop, ∀ 𝓗 : Hypergraph (Fin n), 𝓗.IsLinear → 𝓗.chromaticIndex ≤ n := by
  sorry
#41
Baker-Wüstholz theorem on linear forms in logarithms
bakerWustholz_linearForms_logs

Verso theorem preview

theorem declaration uses `sorry`bakerWustholz_linearForms_logs {n : ℕ} (hn : 0 < n) {K : Type*} [Field K] [NumberField K] (φ : K →+* ℂ) (α : Fin n → K) (hα : ∀ i, α i ≠ 0) (b : Fin n → ℤ) {B : ℕ} (hB : 2 ≤ B) (hbB : ∀ i, (b i).natAbs ≤ B) (hΛ_ne_zero : (∑ i, (b i : ℂ) * Complex.log (φ (α i))) ≠ 0) : Real.log ‖∑ i, (b i : ℂ) * Complex.log (φ (α i))‖ ≥ -(BakerWustholz.C n (Module.finrank ℚ K) * max (Real.log B) (1 / (Module.finrank ℚ K : ℝ)) * ∏ i, BakerWustholz.modifiedHeight φ (α i)) := n:ℕhn:0 < nK:Type u_1inst✝¹:Field Kinst✝:NumberField Kφ:K →+* ℂα:Fin n → Khα:∀ (i : Fin n), α i ≠ 0b:Fin n → ℤB:ℕhB:2 ≤ BhbB:∀ (i : Fin n), (b i).natAbs ≤ BhΛ_ne_zero:∑ i, ↑(b i) * log (φ (α i)) ≠ 0⊢ Real.log ‖∑ i, ↑(b i) * log (φ (α i))‖ ≥ -(BakerWustholz.C n (Module.finrank ℚ K) * max (Real.log ↑B) (1 / ↑(Module.finrank ℚ K)) * ∏ i, BakerWustholz.modifiedHeight φ (α i)) All goals completed! 🐙
#42
The energy of dilute Bose gases
annals_bose_gases

Lean theorem statement

/-- Constant `η` in Theorem 1.2. -/
noncomputable def η : ℝ := sorry

/-- Constant `𝓒` in Theorem 1.2. -/
noncomputable def 𝓒 (𝓡 : ℝ) (r : ℝ) : ℝ := sorry

/--
Statement of Theorem 1.2 (The Lee-Huang-Yang Formula):

For any non-zero, non-negative, radial potential `v ∈ L¹(ℝ³)` with compact support contained
in some ball `B(0,R)`, there exists `η > 0` and `𝓒` (depending only on `𝓡`and `R / a`) such that
as `ρ → 0⁺`,

`e ρ v ≥ 4πρ²a(1 + 128/(15√π)√(ρa³) - 𝓒(ρa³)^{1/2 + η})`.

Note: We (equivalently) take the limit as `ρ → 0⁺` rather than `ρa³ → 0⁺` as in the paper.

Note: While the wording of Theorem 1.2 in the paper suggests that `η` should also be allowed to
depend on `𝓡` and `R / a`, Theorem 6.8 makes it clear that `η` is in fact a universal constant.

Note: Since `v` is in `L¹(ℝ³)`, we interpret `v ≠ 0` to mean that `v` is not zero in `L¹(ℝ³)`.
-/
theorem theorem_1_2 (v : ℝ³ → ℝ) (hv_ne_zero : ¬ v =ᵐ[volume] 0) (hv_nonneg : 0 ≤ v)
    (hv_radial : IsRadial v) (hv_memL1 : MemLp v 1) {R : ℝ} (hR : 0 < R)
    (hv_supp : tsupport v ⊆ ball 0 R) : 0 < η ∧ ∀ᶠ ρ in 𝓝[>] 0,
      e ρ v ≥ 4 * π * ρ ^ 2 * a v * (1 + (128 / (15 * √ π)) * √ (ρ * a v ^ 3) -
        𝓒 (𝓡 v) (R / a v) * (ρ * a v ^ 3) ^ (1 / 2 + η)) := by
  sorry
#43
Bourgain's polynomial ergodic theorem
bourgain_polynomial_ergodic

Lean theorem statement

/-- Bourgain's polynomial ergodic theorem: for every integer-polynomial
iterate sequence and every `L^p`, `p > 1`, function, the polynomial ergodic
averages converge pointwise almost everywhere. -/
theorem bourgain_polynomial_ergodic
    [IsProbabilityMeasure μ] {p : ℝ≥0∞} (hp : 1 < p) (hp_ne_top : p ≠ ∞)
    {T : X → X} (hT : MeasurePreserving T μ μ)
    {a : ℕ → ℕ} (ha : IsIntegerPolynomialSequence a)
    {f : X → ℝ} (hf : MemLp f p μ) :
    ∃ F : X → ℝ,
      ∀ᵐ x ∂μ,
        Tendsto (fun n : ℕ => polynomialErgodicAverage a T f (n + 1) x) atTop (𝓝 (F x)) := by
  sorry
#44
Bender–Suzuki theorem (classification of finite simple groups with a strongly-embedded subgroup)
bender_suzuki

Lean theorem statement

/-- **Bender–Suzuki theorem.** -/
theorem bender_suzuki {X : Type*} [Group X] [Finite X] [IsSimpleGroup X]
    (M : Subgroup X) (h : IsStronglyEmbedded M) :
    IsSimpleBenderGroup X := by
  sorry
#45
Pardon's lower bound for torus-knot distortion
pardon_torus_knot_distortion

Lean theorem statement

/-- **Pardon's torus-knot distortion bound (smooth specialization).**

If `p` and `q` are positive and coprime, every smooth knot in the
orientation-preserving smooth ambient-isotopy class of the explicit standard
`(p, q)`-torus curve has distortion at least `min(p, q) / 160`. -/
theorem pardon_torus_knot_distortion
    (p q : ℕ) (_hp : 0 < p) (_hq : 0 < q) (_hc : Nat.Coprime p q)
    (K : Knot)
    (_hclass : ∃ Φ : AmbientIsotopy, ∃ σ : CircleReparam,
      ∀ t, Φ.H 1 (K.curve t) = standardTorusCurve p q (σ.f t)) :
    (1 / 160 : ℝ≥0∞) * (Nat.min p q : ℝ≥0∞) ≤ distortion K := by
  sorry
#46
On a conjecture of Marton
annals_conjecture_of_marton

Verso theorem preview

theorem declaration uses `sorry`theorem_1_2 (A : Set (ConjectureOfMarton.F n)) (K : ℝ) (h₀ : A.Nonempty) (h : (A + A).ncard ≤ K * A.ncard) : ∃ H : AddSubgroup (ConjectureOfMarton.F n), Nat.card H ≤ A.ncard ∧ CovByVAdd (ConjectureOfMarton.F n) (2 * K ^ 12) A H := n:ℕA:Set (F n)K:ℝh₀:A.Nonemptyh:↑(A + A).ncard ≤ K * ↑A.ncard⊢ ∃ H, Nat.card ↥H ≤ A.ncard ∧ CovByVAdd (F n) (2 * K ^ 12) A ↑H All goals completed! 🐙
#47
De Branges's theorem (Bieberbach conjecture)
deBranges_theorem

Verso theorem preview

theorem declaration uses `sorry`deBranges (f : ℂ → ℂ) (diff : DifferentiableOn ℂ f (ball 0 1)) (inj : (ball 0 1).InjOn f) (h0 : f 0 = 0) (h1 : deriv f 0 = 1) (n : ℕ) : ‖iteratedDeriv n f 0 / n.factorial‖ ≤ n := f:ℂ → ℂdiff:DifferentiableOn ℂ f (ball 0 1)inj:Set.InjOn f (ball 0 1)h0:f 0 = 0h1:deriv f 0 = 1n:ℕ⊢ ‖iteratedDeriv n f 0 / ↑n.factorial‖ ≤ ↑n All goals completed! 🐙
#48
Quantifier elimination for the theory of real closed fields
rcf_quantifier_elimination

Verso theorem preview

/-- Quantifier elimination: `qe φ` is a quantifier-free formula equivalent to `φ` over `ℝ` in every environment. Its syntax may mention additional variables vacuously. -/ def declaration uses `sorry`qe (φ : Formula) : Formula := sorry
/-- The output of `qe` is quantifier free. -/ theorem declaration uses `sorry`isQF_qe (φ : Formula) : (qe φ).IsQF := sorry
/-- The output of `qe` is equivalent to its input, under every environment. -/ theorem declaration uses `sorry`holds_qe (φ : Formula) (env : Nat → ℝ) : (qe φ).Holds env ↔ φ.Holds env := sorry
/-- Anti-vacuity guard for the semantics and de Bruijn convention: a real number is a square exactly when it is nonnegative. -/ theorem declaration uses `sorry`holds_ex_sq (env : Nat → ℝ) : (Formula.ex (.eq (.mul (.var 0) (.var 0)) (.var 1))).Holds env ↔ (Formula.not (.lt (.var 0) (.const 0))).Holds env := sorry
#49
Topological classification of surfaces
topological_classification_of_surfaces

Verso theorem preview

theorem declaration uses `sorry`classification_of_surfaces (S : Type*) [TopologicalSpace S] [T2Space S] [ConnectedSpace S] [CompactSpace S] [ChartedSpace (EuclideanHalfSpace 2) S] [IsManifold (modelWithCornersEuclideanHalfSpace 2) 0 S] : Nonempty (S ≃ₜ Metric.sphere (0 : EuclideanSpace ℝ (Fin 3)) 1) ∨ ∃ p n, ((1 ≤ p ∨ 1 ≤ n) ∧ Nonempty (S ≃ₜ Quot (LeanEval.Topology.ClassificationOfSurfaces.OrientableRel p n))) ∨ (1 ≤ p ∧ Nonempty (S ≃ₜ Quot (LeanEval.Topology.ClassificationOfSurfaces.NonOrientableRel p n))) := S:Type u_1inst✝⁵:TopologicalSpace Sinst✝⁴:T2Space Sinst✝³:ConnectedSpace Sinst✝²:CompactSpace Sinst✝¹:ChartedSpace (EuclideanHalfSpace 2) Sinst✝:IsManifold (modelWithCornersEuclideanHalfSpace 2) 0 S⊢ Nonempty (S ≃ₜ ↑(Metric.sphere 0 1)) ∨ ∃ p n, (1 ≤ p ∨ 1 ≤ n) ∧ Nonempty (S ≃ₜ Quot (OrientableRel p n)) ∨ 1 ≤ p ∧ Nonempty (S ≃ₜ Quot (NonOrientableRel p n)) All goals completed! 🐙
#50
Mihăilescu's theorem
mihailescu

Verso theorem preview

theorem declaration uses `sorry`mihailescu {x y m n : ℕ} (hx : 0 < x) (hy : 0 < y) (hm : 1 < m) (hn : 1 < n) (h : x ^ m = y ^ n + 1) : x = 3 ∧ y = 2 ∧ m = 2 ∧ n = 3 := x:ℕy:ℕm:ℕn:ℕhx:0 < xhy:0 < yhm:1 < mhn:1 < nh:x ^ m = y ^ n + 1⊢ x = 3 ∧ y = 2 ∧ m = 2 ∧ n = 3 All goals completed! 🐙
#51
Morley's categoricity theorem
morley_categoricity_theorem

Verso theorem preview

theorem declaration uses `sorry`morley_categoricity_theorem (L : FirstOrder.Language.{0, 0}) (hL : L.card ≤ ℵ₀) (T : L.Theory) (hT : T.IsComplete) (hInf : ∀ M : FirstOrder.Language.Theory.ModelType.{0, 0, 0} T, Infinite M) {κ : Cardinal.{0}} (hκ : ℵ₀ < κ) (hcat : κ.Categorical T) {μ : Cardinal.{0}} (hμ : ℵ₀ < μ) : μ.Categorical T := L:FirstOrder.LanguagehL:L.card ≤ ℵ₀T:L.TheoryhT:T.IsCompletehInf:∀ (M : T.ModelType), Infinite ↑Mκ:Cardinal.{0}hκ:ℵ₀ < κhcat:κ.Categorical Tμ:Cardinal.{0}hμ:ℵ₀ < μ⊢ μ.Categorical T All goals completed! 🐙
#52
Isoperimetric inequality (n-dim, topological-frontier form)
isoperimetric_inequality

Verso theorem preview

theorem declaration uses `sorry`isoperimetric (n : ℕ) (_hn : 2 ≤ n) (B : Set (LeanEval.Geometry.E n)) (_hB : MeasurableSet B) (_hBdd : Bornology.IsBounded B) : (n : ℝ≥0∞) ^ n * (volume B) ^ (n - 1) * volume (closedBall (0 : LeanEval.Geometry.E n) 1) ≤ (μHE[n - 1] (frontier B)) ^ n := n:ℕ_hn:2 ≤ nB:Set (E n)_hB:MeasurableSet B_hBdd:Bornology.IsBounded B⊢ ↑n ^ n * volume B ^ (n - 1) * volume (closedBall 0 1) ≤ μHE[n - 1] (frontier B) ^ n All goals completed! 🐙
#53
Pannwitz–Kuperberg quadrisecant theorem
smooth_knot_has_quadrisecant

Lean theorem statement

/-- **Quadrisecant theorem** (Pannwitz–Kuperberg). Every smooth nontrivial knot
has a quadrisecant. -/
theorem smooth_knot_has_quadrisecant
    {r : ℝ → Space} (_hknot : IsSmoothKnot r) (_hnontrivial : ¬ IsUnknotted r) :
    HasQuadrisecant r := by
  sorry
#54
Hardy–Littlewood sign-change for the prime race mod 4
chebyshev_sign_change

Verso theorem preview

theorem declaration uses `sorry`chebyshev_sign_change : LeanEval.NumberTheory.ChebyshevSignChangeProblem.chebyshevLead.Infinite ∧ {n : ℕ | primeCountingMod 3 n < primeCountingMod 1 n}.Infinite := ⊢ chebyshevLead.Infinite ∧ {n | primeCountingMod 3 n < primeCountingMod 1 n}.Infinite All goals completed! 🐙
#55
Existence of a chiral oriented knot
exists_chiral_knot

Verso theorem preview

theorem declaration uses `sorry`exists_chiral_knot : ∃ K : LeanEval.KnotTheory.Knot, K.Chiral := ⊢ ∃ K, K.Chiral All goals completed! 🐙
#56
Inscribed rectangles in a smooth Jordan curve attain at least one third of all aspect ratios
annals_inscribed_rectangles

Lean theorem statement

/--
Statement of Theorem 1:

Let `γ` be a smooth Jordan curve, and let `X` be the set of all `r ∈ [0,1]` so that there is an
inscribed rectangle in `γ` of aspect ratio `tan(r·π/4)`.
Then the Lebesgue measure of `X` is at least `1/3`.
-/
theorem theorem_1 (γ : Circle → ℝ × ℝ) (hγ : IsSmoothEmbedding (𝓡 1) 𝓘(ℝ, ℝ × ℝ) ∞ γ) :
    volume (X γ) ≥ 1/3 := by
  sorry
#57
Glauberman's Z* theorem for isolated involutions
glauberman_zStar

Verso theorem preview

theorem declaration uses `sorry`glauberman_zStar (G : Type) [Group G] [Fintype G] (t : G) (ht1 : t ≠ 1) (ht2 : t * t = 1) (hisolated : ∀ g : G, (g * t * g⁻¹) * t = t * (g * t * g⁻¹) → g * t * g⁻¹ = t) : ∃ N : Subgroup G, N.Normal ∧ Odd (Nat.card N) ∧ ∀ g : G, g * t * g⁻¹ * t⁻¹ ∈ N := G:Typeinst✝¹:Group Ginst✝:Fintype Gt:Ght1:t ≠ 1ht2:t * t = 1hisolated:∀ (g : G), g * t * g⁻¹ * t = t * (g * t * g⁻¹) → g * t * g⁻¹ = t⊢ ∃ N, N.Normal ∧ Odd (Nat.card ↥N) ∧ ∀ (g : G), g * t * g⁻¹ * t⁻¹ ∈ N All goals completed! 🐙
#58
Schläfli classification of regular polytopes
schlafli_classification

Verso theorem preview

theorem declaration uses `sorry`schlafli_classification : platonicCount 3 = 5 ∧ platonicCount 4 = 6 ∧ ∀ d, 5 ≤ d → platonicCount d = 3 := ⊢ platonicCount 3 = 5 ∧ platonicCount 4 = 6 ∧ ∀ (d : ℕ), 5 ≤ d → platonicCount d = 3 All goals completed! 🐙
#59
Topological sphere theorem (Berger–Klingenberg–Rauch)
sphere_theorem_topological

Lean theorem statement

/-- **Topological sphere theorem** (Berger–Klingenberg–Rauch 1960). A closed,
simply-connected, smooth `d`-manifold (`d ≥ 2`) whose Levi-Civita connection is
strictly quarter-pinched is homeomorphic to the standard `d`-sphere. -/
theorem sphere_theorem
    [I.Boundaryless] [T2Space M] [CompactSpace M] [SimplyConnectedSpace M]
    (hdim : 2 ≤ Module.finrank ℝ E)
    (cov : CovariantDerivative I E (TangentSpace I (M := M)))
    [ContMDiffCovariantDerivative cov ∞]
    (_htor : cov.torsion = 0) (_hmet : IsMetricCompatible cov)
    (_hpinch : QuarterPinched cov) :
    Nonempty
      (M ≃ₜ sphere (0 : EuclideanSpace ℝ (Fin (Module.finrank ℝ E + 1))) 1) := by
  sorry
#60
Shafarevich's relation-rank bound
shafarevich_relation_rank_bound

Verso theorem preview

theorem declaration uses `sorry`shafarevich_relation_rank_bound (F : Type) [Field F] [NumberField F] (p : ℕ) [Fact p.Prime] (_hpOdd : Odd p) : LeanEval.NumberTheory.H2Finite p (MaxUnramifiedProPGaloisGroup F p) ∧ (open Classical in relationRank p (MaxUnramifiedProPGaloisGroup F p) ≤ generatorRank (MaxUnramifiedProPGaloisGroup F p) + (NumberField.InfinitePlace.nrRealPlaces F + NumberField.InfinitePlace.nrComplexPlaces F - 1) + (if ∃ ζ : F, IsPrimitiveRoot ζ p then 1 else 0)) := F:Typeinst✝²:Field Finst✝¹:NumberField Fp:ℕinst✝:Fact (Nat.Prime p)_hpOdd:Odd p⊢ H2Finite p (MaxUnramifiedProPGaloisGroup F p) ∧ relationRank p (MaxUnramifiedProPGaloisGroup F p) ≤ generatorRank (MaxUnramifiedProPGaloisGroup F p) + (InfinitePlace.nrRealPlaces F + InfinitePlace.nrComplexPlaces F - 1) + if ∃ ζ, IsPrimitiveRoot ζ p then 1 else 0 All goals completed! 🐙
#61
Martinet's asymptotically-good totally real towers
martinet_totally_real_towers

Verso theorem preview

theorem declaration uses `sorry`exists_totallyReal_discr_le : ∃ C : ℝ, 0 < C ∧ ∀ N : ℕ, ∃ d : ℕ, N ≤ d ∧ ∃ (K : Type) (_ : Field K) (_ : NumberField K) (_ : NumberField.IsTotallyReal K), Module.finrank ℚ K = d ∧ |(NumberField.discr K : ℝ)| ≤ C ^ d := ⊢ ∃ C, 0 < C ∧ ∀ (N : ℕ), ∃ d, N ≤ d ∧ ∃ K x, ∃ (x_1 : NumberField K) (_ : IsTotallyReal K), Module.finrank ℚ K = d ∧ |↑(discr K)| ≤ C ^ d All goals completed! 🐙
#62
Lagarias criterion is equivalent to RH
riemann_hypothesis_iff_lagarias_elementary_criterion

Verso theorem preview

theorem declaration uses `sorry`riemann_hypothesis_iff_lagarias_elementary_criterion : RiemannHypothesis ↔ LeanEval.NumberTheory.LagariasElementaryCriterion := ⊢ RiemannHypothesis ↔ LagariasElementaryCriterion All goals completed! 🐙
#63
Strong normalization and consistency for the calculus of constructions with a universe hierarchy
coc_strong_normalization

Verso theorem preview

/-- Anti-vacuity guard: the polymorphic identity `λ (A : Prop). λ (x : A). x` has type `Π (A : Prop). Π (x : A). A`. This is typable only because `Prop` is impredicative. -/ theorem declaration uses `sorry`typing_polyId : Typing [] (.lam (.srt .prop) (.lam (.var 0) (.var 0))) (.pi (.srt .prop) (.pi (.var 0) (.var 1))) := sorry
/-- Anti-vacuity guard: applying the polymorphic identity to `False` exercises application typing. Here `False` is encoded as `Π (P : Prop). P`. -/ theorem declaration uses `sorry`typing_polyId_app : Typing [] (.app (.lam (.srt .prop) (.lam (.var 0) (.var 0))) (.pi (.srt .prop) (.var 0))) (.pi (.pi (.srt .prop) (.var 0)) (.pi (.srt .prop) (.var 0))) := sorry
/-- Anti-vacuity guard: the same application takes its expected beta step. -/ theorem declaration uses `sorry`step_polyId_app : Step (.app (.lam (.srt .prop) (.lam (.var 0) (.var 0))) (.pi (.srt .prop) (.var 0))) (.lam (.pi (.srt .prop) (.var 0)) (.var 0)) := sorry
/-- Types are preserved by reduction. -/ theorem declaration uses `sorry`subject_reduction (Γ : List Tm) (t t' A : Tm) : Typing Γ t A → Step t t' → Typing Γ t' A := sorry
/-- Every well-typed term is strongly normalizing. -/ theorem declaration uses `sorry`strong_normalization (Γ : List Tm) (t A : Tm) : Typing Γ t A → SN t := sorry
/-- The system is logically consistent: `Π (P : Prop). P` is not inhabited. -/ theorem declaration uses `sorry`consistency : ¬ ∃ t : Tm, Typing [] t (.pi (.srt .prop) (.var 0)) := sorry
#64
Galois groups of random integer polynomials and van der Waerden's Conjecture
annals_van_der_waerden_conjecture

Verso theorem preview

theorem declaration uses `sorry`theorem_1 (n : ℕ) (hn : 3 ≤ n) : (fun H ↦ (vanDerWaerdenConjecture.E n H : ℝ)) =O[atTop] (fun H ↦ (H ^ (n - 1) : ℝ)) := n:ℕhn:3 ≤ n⊢ (fun H => ↑(E n H)) =O[atTop] fun H => ↑H ^ (n - 1) All goals completed! 🐙
#65
Coherent cohomology of a proper scheme over ℚ is finite-dimensional
coherent_cohomology_finite_dimensional

Verso theorem preview

theorem declaration uses `sorry`coherent_cohomology_finite_dimensional (f : X ⟶ Spec (CommRingCat.of ℚ)) [IsProper f] [M.IsFiniteType] [M.IsQuasicoherent] (n : ℕ) : Module.Finite ℚ (ℚ ⊗[ℤ] M.sheaf.H n) := X:SchemeM:X.Modulesf:X ⟶ Spec ↧ℚinst✝²:IsProper finst✝¹:SheafOfModules.IsFiniteType Minst✝:SheafOfModules.IsQuasicoherent Mn:ℕ⊢ Module.Finite ℚ (ℚ ⊗[ℤ] Sheaf.H Scheme.Modules.sheaf n) All goals completed! 🐙
#66
Fatou–Julia / Cantor dichotomy
fatou_julia_dichotomy

Lean theorem statement

/-- **Fatou–Julia dichotomy.** For the quadratic family, `c ∈ M` implies
the filled Julia set `K_c` is connected; `c ∉ M` implies `K_c` is
homeomorphic to the Cantor space `ℕ → Bool`. -/
theorem julia_cantor_dichotomy (c : ℂ) :
    (c ∈ Mandelbrot → IsConnected (FilledJulia c)) ∧
    (c ∉ Mandelbrot → Nonempty ((FilledJulia c) ≃ₜ (ℕ → Bool))) := by
  sorry
#67
Connective constant of the honeycomb lattice
honeycomb_connective_constant

Verso theorem preview

theorem declaration uses `sorry`honeycomb_connective_constant : Tendsto (fun n ↦ (LeanEval.Combinatorics.HoneycombConnectiveConstant.walkCount n : ℝ) ^ (1 / n : ℝ)) atTop (nhds (Real.sqrt (2 + Real.sqrt 2))) := ⊢ Tendsto (fun n => ↑(walkCount n) ^ (1 / ↑n)) atTop (𝓝 √(2 + √2)) All goals completed! 🐙
#68
Novikov's theorem: the word problem is undecidable for finitely presented groups
novikov_unsolvable

Verso theorem preview

theorem declaration uses `sorry`novikov_unsolvable : ∃ (n : ℕ) (rels : Set (FreeGroup (Fin n))), rels.Finite ∧ ¬ LeanEval.GroupTheory.NovikovUnsolvableProblem.WordProblemSolvable (PresentedGroup.mk rels) := ⊢ ∃ n rels, rels.Finite ∧ ¬WordProblemSolvable (PresentedGroup.mk rels) All goals completed! 🐙
#69
The alternating sign matrix theorem
alternating_sign_matrix_count

Verso theorem preview

theorem declaration uses `sorry`alternating_sign_matrix_count (n : ℕ) : (Nat.card (LeanEval.Combinatorics.AlternatingSignMatrix.ASMatrix n) : ℚ) = LeanEval.Combinatorics.AlternatingSignMatrix.robbinsProduct n := n:ℕ⊢ ↑(Nat.card (ASMatrix n)) = robbinsProduct n All goals completed! 🐙
#70
Commuting probabilities are closed
commProb_closed

Lean theorem statement

/-- The set of commuting probabilities of finite groups is closed. -/
theorem commProb_closed : IsClosed ({p : ℝ | ∃ (G : Type) (hG : Group G), commProb G = p}) := by
  sorry
#71
Conway–Schneeberger fifteen theorem
conway_schneeberger_fifteen

Verso theorem preview

theorem declaration uses `sorry`conway_schneeberger_fifteen {n : ℕ} (Q : Matrix (Fin n) (Fin n) ℤ) (_hpos : Q.PosDef) : LeanEval.NumberTheory.ConwaySchneebergerFifteenProblem.IsUniversal Q ↔ ∀ k ∈ Finset.Icc (1 : ℤ) 15, LeanEval.NumberTheory.ConwaySchneebergerFifteenProblem.Represents Q k := n:ℕQ:Matrix (Fin n) (Fin n) ℤ_hpos:Q.PosDef⊢ IsUniversal Q ↔ ∀ k ∈ Finset.Icc 1 15, Represents Q k All goals completed! 🐙
#72
Poincaré–Bendixson theorem
poincare_bendixson

Lean theorem statement

/-- **Poincaré–Bendixson theorem.** For a `C¹` autonomous vector field
`F : ℝ² → ℝ²` and a forward integral curve `γ` on `[0, ∞)`, either the
forward orbit is unbounded, or the ω-limit set contains an equilibrium
of `F`, or the ω-limit set equals the range of a non-constant periodic
integral curve of `F`. -/
theorem poincare_bendixson
    (F : Plane → Plane) (_hF : ContDiff ℝ 1 F)
    (γ : ℝ → Plane)
    (_hγ : IsIntegralCurveOn γ (fun _ x => F x) (Set.Ici 0)) :
    ¬ Bornology.IsBounded (γ '' Set.Ici 0)
    ∨ (∃ x₀, F x₀ = 0 ∧ x₀ ∈ ⋂ s : ℝ, closure (γ '' Set.Ici s))
    ∨ (∃ T : ℝ, 0 < T ∧ ∃ β : ℝ → Plane,
        IsIntegralCurve β (fun _ x => F x) ∧
        (∀ t, β (t + T) = β t) ∧
        F (β 0) ≠ 0 ∧
        (⋂ s : ℝ, closure (γ '' Set.Ici s)) = Set.range β) := by
  sorry
#73
Enumerating number fields
annals_enumerating_number_fields

Lean theorem statement

/--
Statement of Theorem 1 (Number fields have small models):

There exists a positive constant `Q` such that the following is true. Let `K` be a number field
of degree `n ≥ Q` and root discriminant `δ` over `ℚ`. Then there exist integers `r ≤ Q log n` and
`d ≤ Q log n` such that `(d + r) choose r ≤ Q n log n`, and there exist `r` polynomials
`E₁, ..., Eᵣ` of degree `≤ d` in `ℤ[x₁, ..., xᵣ]` all having coefficients bounded in absolute value
by `(n δ) ^ (Q log n)` such that the (smooth and zero-dimensional affine) scheme with equations
`E₁ = ... = Eᵣ = 0` and `det (∂Eᵢ/∂xⱼ) ≠ 0` contains `Spec K` as one of its irreducible components.
-/
theorem theorem_1 : ∃ Q > 0, ∀ n ≥ Q, ∀ K : NumberFieldOfDegree n, ∃ (r d : ℕ),
    r ≤ Q * log n ∧ d ≤ Q * log n ∧ (d + r).choose r ≤ Q * n * log n ∧
      ∃ E : Fin r → MvPolynomial (Fin r) ℤ, (∀ i, (E i).totalDegree ≤ d) ∧
        (∀ i j, |(E i).coeff j| ≤ (n * rootDiscr K) ^ (Q * log n)) ∧
          letI X := nonsingularOpen fun i ↦ (E i).map (algebraMap ℤ ℚ)
          ∃ Z, ∃ hZ : Z ∈ irreducibleComponents X,
            Nonempty (X.irreducibleComponent Z hZ ≅ Spec (.of K)) := by
  sorry

/--
Statement of Theorem 2 (Number fields with bounded discriminant):

There exists a positive constant `Q` such that the following is true. Let `n ≥ Q` be an integer.
Let `H ≥ 1` be an integer. The number of isomorphism classes of number fields
with degree `n` and discriminant `≤ H` is `≤ n^(Q n log^3 n) H^(Q log^3 n)`.
-/
theorem theorem_2 : ∃ Q > 0, ∀ n ≥ Q, ∀ H ≥ 1,
    (Nat.card (NumberFieldOfBoundedDiscriminantUpToIsomorphism n H) : ℝ) ≤
      n ^ (Q * n * log n ^ 3) * H ^ (Q * log n ^ 3) := by
  sorry
#74
Viscosity solutions and hyperbolic motions: a new PDE method for the N-body problem
annals_viscosity_solutions

Verso theorem preview

theorem declaration uses `sorry`theorem_1_1 (hE : 2 ≤ Module.finrank ℝ E) (m : ℝᴺ) (hm : ∀ i, 0 < m i) (x₀ a : Eᴺ) (a_nc : ViscositySolutions.WithoutCollisions a) (a_norm : ‖a‖_[m] = 1) (h : ℝ) (h_pos : h > 0) : ∃ x : ℝ → Eᴺ, ∃ o : ℝ → Eᴺ, (o =o[atTop] fun t ↦ t) ∧ x 0 = x₀ ∧ ViscositySolutions.IsNBodySolution m x ∧ (∀ t > 0, ViscositySolutions.WithoutCollisions (x t)) ∧ ∀ t ≥ 0, x t = (sqrt (2 * h) * t) • a + o t := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:InnerProductSpace ℝ Einst✝:FiniteDimensional ℝ EN:ℕhE:2 ≤ Module.finrank ℝ Em:Fin N → ℝhm:∀ (i : Fin N), 0 < m ix₀:Eᴺa:Eᴺa_nc:WithoutCollisions aa_norm:‖a‖_[m] = 1h:ℝh_pos:h > 0⊢ ∃ x o, (o =o[atTop] fun t => t) ∧ x 0 = x₀ ∧ IsNBodySolution m x ∧ (∀ t > 0, WithoutCollisions (x t)) ∧ ∀ t ≥ 0, x t = (√(2 * h) * t) • a + o t All goals completed! 🐙
#75
Thue–Siegel–Roth theorem (irrationality measure ≤ 2 for algebraic irrationals)
thue_siegel_roth

Lean theorem statement

/-- **Thue–Siegel–Roth theorem** (Klaus Roth, 1955). Every irrational
algebraic real is Diophantine: its irrationality measure is at most
`2`. -/
theorem thueSiegelRoth (x : ℝ) (_h_irr : Irrational x)
    (_h_alg : IsAlgebraic ℤ x) : IsDiophantine x := by
  sorry
#76
Weak Morse inequalities
weak_morse_inequality

Lean theorem statement

/-- **Weak Morse inequalities.** For a Morse function `f` on a closed
smooth finite-dimensional Hausdorff manifold `M` and every `k ∈ ℕ`,
`b_k(M) ≤ c_k(f)`. -/
theorem weak_morse_inequality
    {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E]
    {H : Type*} [TopologicalSpace H] {I : ModelWithCorners ℝ E H} [I.Boundaryless]
    {M : Type} [TopologicalSpace M] [ChartedSpace H M] [IsManifold I ∞ M]
    [CompactSpace M] [T2Space M] (f : M → ℝ) (_hf : IsMorseFunction I f) (k : ℕ) :
    bettiNumber M k ≤ morseCount I f k := by
  sorry
#77
Bounded gaps between primes
zhang_bounded_prime_gaps

Verso theorem preview

theorem declaration uses `sorry`zhang_bounded_prime_gaps : ∀ n : ℕ, ∃ p q : ℕ, n ≤ p ∧ p.Prime ∧ q.Prime ∧ p < q ∧ q - p ≤ 246 := ⊢ ∀ (n : ℕ), ∃ p q, n ≤ p ∧ Nat.Prime p ∧ Nat.Prime q ∧ p < q ∧ q - p ≤ 246 All goals completed! 🐙
#78
Fractal uncertainty in higher dimensions
annals_fractal_uncertainty

Lean theorem statement

/--
Statement of Theorem 1.1:

Let `ν > 0` and assume that
- `X ⊆ [−1,1]ᵈ` is `ν`-porous on balls from scales `h` to `1`, and
- `Y ⊆ [−h⁻¹,h⁻¹]ᵈ` is `ν`-porous on lines from scales `1` to `h⁻¹`.
Then there exist `β,C > 0` depending only on `ν` and `d` such that for all `f ∈ L²(ℝᵈ)`,
`supp (𝓕 f) ⊆ Y => ‖f * 1_X‖₂ ≤ C * h ^ β * ‖f‖₂`.
Note: We require `X` and `Y` to be measurable to make the statement more natural.
-/
theorem theorem_1_1 (ν : ℝ) (hν₀ : 0 < ν) :
    ∃ (β C : ℝ), β > 0 ∧ C > 0 ∧ ∀ (h : ℝ) (X Y : Set ℝᵈ)
      (hX : MeasurableSet X) (hY : MeasurableSet Y), h ∈ Set.Ioo 0 (1 / 100) →
        X ⊆ cube (-1) 1 → PorousOnBalls ν h 1 X → Y ⊆ cube (-h⁻¹) h⁻¹ →
          PorousOnLines ν 1 h⁻¹ Y → ∀ (f : Lp ℂ 2), (𝓕 f : Lp ℂ 2) =ᵐ[volume.restrict Yᶜ] 0 →
            (eLpNorm (X.indicator f) 2).toReal ≤ C * h ^ β * ‖f‖ := by
  sorry
#79
Gleason's theorem (separable Hilbert space)
gleason_theorem_separable

Lean theorem statement

/-- **Gleason's theorem**, separable Hilbert space version (Gleason's original 1957
formulation). For a separable complex Hilbert space `H` of dimension at least `3`, every
frame function on the unit sphere of `H` is given by `x ↦ re ⟨x, ρ x⟩` for some positive
bounded operator `ρ`. (The Lean conclusion does not separately assert trace-class /
`Tr ρ = 1`; see the file docstring.) -/
theorem gleason_theorem_separable
    {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H]
      [CompleteSpace H] [TopologicalSpace.SeparableSpace H]
    (hdim : 3 ≤ Module.rank ℂ H)
    (f : SphereFrameFunction H) :
    ∃ ρ : H →L[ℂ] H,
      ContinuousLinearMap.IsPositive ρ ∧
      ∀ x : Metric.sphere (0 : H) 1,
        f.f x = (inner ℂ (x : H) (ρ (x : H))).re := by
  sorry
#80
Higman's infinite finitely-presented simple group
higman_infinite_simple

Verso theorem preview

theorem declaration uses `sorry`higman_infinite_simple : ∃ (n : ℕ) (rels : Set (FreeGroup (Fin n))), rels.Finite ∧ IsSimpleGroup (PresentedGroup rels) ∧ Infinite (PresentedGroup rels) := ⊢ ∃ n rels, rels.Finite ∧ IsSimpleGroup (PresentedGroup rels) ∧ Infinite (PresentedGroup rels) All goals completed! 🐙
#81
Platonic classification
platonic_classification

Verso theorem preview

theorem declaration uses `sorry`platonic_classification : platonicCount 2 = ⊤ ∧ platonicCount 3 = 5 ∧ platonicCount 4 = 6 ∧ ∀ d, 5 ≤ d → platonicCount d = 3 := ⊢ platonicCount 2 = ⊤ ∧ platonicCount 3 = 5 ∧ platonicCount 4 = 6 ∧ ∀ (d : ℕ), 5 ≤ d → platonicCount d = 3 All goals completed! 🐙
#82
Seventeen wallpaper groups (Pólya–Niggli 1924)
wallpaper_groups_17

Lean theorem statement

/-- **There are exactly 17 wallpaper groups** (Pólya–Niggli 1924). -/
theorem there_are_17_wallpaper_groups :
    crystallographicCount 2 = 17 := by
  sorry
#83
Ado–Iwasawa theorem over an arbitrary field
adoIwasawa

Verso theorem preview

theorem declaration uses `sorry`adoIwasawa [FiniteDimensional K L] : ∃ (V : Type u) (_ : AddCommGroup V) (_ : Module K V) (_ : FiniteDimensional K V) (ρ : L →ₗ⁅K⁆ Module.End K V), Function.Injective ρ := K:Type uL:Type uinst✝³:Field Kinst✝²:LieRing Linst✝¹:LieAlgebra K Linst✝:FiniteDimensional K L⊢ ∃ V x x_1, ∃ (_ : FiniteDimensional K V), ∃ ρ, Function.Injective ⇑ρ All goals completed! 🐙
#84
Brauer's splitting field theorem
brauer_splitting_field

Verso theorem preview

theorem declaration uses `sorry`brauer_splitting_field (G : Type) [Group G] [Fintype G] (V : Type) [AddCommGroup V] [Module ℂ V] [FiniteDimensional ℂ V] (ρ : Representation ℂ G V) : ∃ (φ : CyclotomicField (Monoid.exponent G) ℚ →+* ℂ) (W : Type) (_ : AddCommGroup W) (_ : Module (CyclotomicField (Monoid.exponent G) ℚ) W) (σ : Representation (CyclotomicField (Monoid.exponent G) ℚ) G W), letI : Algebra (CyclotomicField (Monoid.exponent G) ℚ) ℂ := φ.toAlgebra ∃ (f : (ℂ ⊗[CyclotomicField (Monoid.exponent G) ℚ] W) ≃ₗ[ℂ] V), ∀ (g : G) (x : ℂ ⊗[CyclotomicField (Monoid.exponent G) ℚ] W), f ((σ g).baseChange ℂ x) = ρ g (f x) := G:Typeinst✝⁴:Group Ginst✝³:Fintype GV:Typeinst✝²:AddCommGroup Vinst✝¹:Module ℂ Vinst✝:FiniteDimensional ℂ Vρ:Representation ℂ G V⊢ ∃ φ W x x_1 σ f, ∀ (g : G) (x_2 : ℂ ⊗[CyclotomicField (Monoid.exponent G) ℚ] W), f ((LinearMap.baseChange ℂ (σ g)) x_2) = (ρ g) (f x_2) All goals completed! 🐙
#85
Schoenflies theorem
schoenflies

Verso theorem preview

theorem declaration uses `sorry`schoenflies (r : Metric.sphere (0 : EuclideanSpace ℝ (Fin 2)) 1 → EuclideanSpace ℝ (Fin 2)) (_hcont : Continuous r) (_hinj : Function.Injective r) : ∃ h : EuclideanSpace ℝ (Fin 2) ≃ₜ EuclideanSpace ℝ (Fin 2), h '' Set.range r = Metric.sphere (0 : EuclideanSpace ℝ (Fin 2)) 1 := r:↑(Metric.sphere 0 1) → EuclideanSpace ℝ (Fin 2)_hcont:Continuous r_hinj:Function.Injective r⊢ ∃ h, ⇑h '' Set.range r = Metric.sphere 0 1 All goals completed! 🐙
#86
New large value estimates for Dirichlet polynomials
annals_large_value_estimates

Verso theorem preview

theorem declaration uses `sorry`theorem_1_1 : ∃ o : ℝ → ℝ, o =o[Filter.atTop] (1 : ℝ → ℝ) ∧ ∀ (b : ℕ → ℂ) (_hb : ∀ n, ‖b n‖ ≤ 1) (N : ℕ) (V : ℝ) (T : ℝ) (R : ℕ) (t : Fin R → ℝ), N > 0 → V > 0 → T > 1 → -- these assumptions are necessary but not stated in the paper (∀ i j, i ≠ j → |t i - t j| ≥ 1) → (∀ i, t i ∈ Set.Icc 0 T) → (∀ r, ‖∑ n ∈ Finset.Icc N (2 * N), b n * n ^ (I * t r)‖ ≥ V) → R ≤ T ^ (o T) * bound N V T := ⊢ ∃ o, o =o[Filter.atTop] 1 ∧ ∀ (b : ℕ → ℂ), (∀ (n : ℕ), ‖b n‖ ≤ 1) → ∀ (N : ℕ) (V T : ℝ) (R : ℕ) (t : Fin R → ℝ), N > 0 → V > 0 → T > 1 → (∀ (i j : Fin R), i ≠ j → |t i - t j| ≥ 1) → (∀ (i : Fin R), t i ∈ Set.Icc 0 T) → (∀ (r : Fin R), ‖∑ n ∈ Finset.Icc N (2 * N), b n * ↑n ^ (I * ↑(t r))‖ ≥ V) → ↑R ≤ T ^ o T * bound N V T All goals completed! 🐙
#87
Darboux's theorem (symplectic forms are locally standard)
darboux

Lean theorem statement

/-- **Darboux's theorem.** Every symplectic form on an open subset
`U ⊆ ℝ^{2n}` is locally symplectomorphic to the standard symplectic form
`ω₀`. Formally: for every `x ∈ U` there is a smooth local diffeomorphism
`φ` (`OpenPartialHomeomorph`, smooth in both directions) whose source lies
in `U` and contains `x`, such that on the target the pullback of `α` by
`φ⁻¹` is in Darboux normal form (and hence equals `ω₀`) at every point. -/
theorem darboux {n : ℕ} {U : Set (E n)} (_hU : IsOpen U)
    (α : E n → E n [⋀^Fin 2]→L[ℝ] ℝ) (_hα : IsSymplecticOn α U)
    {x : E n} (_hx : x ∈ U) :
    ∃ φ : OpenPartialHomeomorph (E n) (E n),
      x ∈ φ.source ∧ φ.source ⊆ U ∧
      ContDiffOn ℝ ∞ (φ : E n → E n) φ.source ∧
      ContDiffOn ℝ ∞ (φ.symm : E n → E n) φ.target ∧
      ∀ z ∈ φ.target,
        IsDarbouxNormal
          ((α (φ.symm z)).compContinuousLinearMap
            (fderiv ℝ (φ.symm : E n → E n) z)) := by
  sorry
#88
Fáry–Milnor theorem (knot total curvature ≤ 4π implies unknotted)
fary_milnor

Verso theorem preview

theorem declaration uses `sorry`fary_milnor_total_curvature {r : ℝ → LeanEval.Geometry.FaryMilnorProblem.Space} (_hknot : LeanEval.Geometry.FaryMilnorProblem.IsSmoothKnot r) (_hK : LeanEval.Geometry.FaryMilnorProblem.totalCurvature r ≤ 4 * Real.pi) : LeanEval.Geometry.FaryMilnorProblem.IsUnknotted r := r:ℝ → Space_hknot:IsSmoothKnot r_hK:totalCurvature r ≤ 4 * π⊢ IsUnknotted r All goals completed! 🐙
#89
Gleason's theorem (finite-dimensional)
gleason_theorem_finite

Lean theorem statement

/-- **Gleason's theorem**, finite-dimensional version. For `dim H ≥ 3`, every frame
function on the projection lattice of `H` is given by `P ↦ re Tr(ρ P)` for the unique
density operator `ρ` (positive, `re Tr ρ = 1`). -/
theorem gleason_theorem_finite
    {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H]
      [CompleteSpace H] [FiniteDimensional ℂ H]
    (hdim : 3 ≤ Module.finrank ℂ H)
    (f : FrameFunction H) :
    ∃! ρ : H →L[ℂ] H,
      ContinuousLinearMap.IsPositive ρ ∧
      reTr ρ = 1 ∧
      ∀ P : H →L[ℂ] H, IsOrthProj P → f.μ P = reTr (ρ * P) := by
  sorry
#90
Wieferich's theorem g(3) = 9
wieferich_g_three

Verso theorem preview

theorem declaration uses `sorry`wieferich_g_three : (∀ n : ℕ, LeanEval.NumberTheory.IsSumOfCubes 9 n) ∧ ∃ n : ℕ, ¬ LeanEval.NumberTheory.IsSumOfCubes 8 n := ⊢ (∀ (n : ℕ), IsSumOfCubes 9 n) ∧ ∃ n, ¬IsSumOfCubes 8 n All goals completed! 🐙
#91
Margulis–Ruelle inequality
margulis_ruelle

Lean theorem statement

/-- **Margulis–Ruelle inequality (1968/1978).** `h_μ(T) ≤ λ₁⁺ + λ₂⁺`. -/
theorem margulis_ruelle
    (T T_inv : EucPlane → EucPlane)
    (hT_smooth : ContDiff ℝ 2 T)
    (hT_inv_smooth : ContDiff ℝ 2 T_inv)
    (hT_left : Function.LeftInverse T_inv T)
    (hT_right : Function.RightInverse T_inv T)
    (K : Set EucPlane)
    (hK_compact : IsCompact K)
    (hK_inv : T '' K = K)
    (μ : Measure EucPlane) [IsProbabilityMeasure μ]
    (hμ_supp : μ Kᶜ = 0)
    (hμ_pres : MeasurePreserving T μ μ)
    (hμ_erg : Ergodic T μ) :
    kolmogorovSinaiEntropy μ T
      ≤ max 0 (∫ x, lyapunovUpperAt T x ∂μ)
          + max 0 (∫ x, lyapunovLowerAt T x ∂μ) := by
  sorry
#92
Mergelyan's theorem
mergelyan_theorem

Lean theorem statement

/-- **Mergelyan's theorem.** For a compact `K ⊆ ℂ` with connected
complement and `f : ℂ → ℂ` continuous on `K` and analytic on the
interior of `K`, every `ε > 0` admits a complex polynomial `p` with
`‖f z − p(z)‖ < ε` on `K`. -/
theorem mergelyan (K : Set ℂ) (_hK : IsCompact K) (_hKc : IsConnected (Kᶜ))
    (f : ℂ → ℂ) (_hfc : ContinuousOn f K) (_hfh : AnalyticOnNhd ℂ f (interior K))
    (ε : ℝ) (_hε : 0 < ε) :
    ∃ p : ℂ[X], ∀ z ∈ K, ‖f z - p.eval z‖ < ε := by
  sorry
#93
pi_n of the n-sphere is Z
pin_sphere_n_mulEquiv_int

Lean theorem statement

/-- For every `n ≥ 1`, the `n`th homotopy group of the `n`-sphere is infinite cyclic. -/
theorem pin_sphere_n_mulEquiv_int
    (n : ℕ)
    (x : Metric.sphere (0 : EuclideanSpace ℝ (Fin (n + 2))) 1) :
    Nonempty
      (HomotopyGroup.Pi (n + 1) (Metric.sphere (0 : EuclideanSpace ℝ (Fin (n + 2))) 1) x ≃*
        Multiplicative ℤ) := by
  sorry
#94
A negative answer to Ulam's Problem 19 from the Scottish Book
annals_ulam

Verso theorem preview

theorem declaration uses `sorry`theorem_1 (hd : 3 ≤ d) : letI : NeZero d := ⟨d:ℕhd:3 ≤ d⊢ d ≠ 0 All goals completed! 🐙⟩ ∃ K : Ulam.BodyOfRevolution d, Ulam.IsStrictlyConvexBody K.body ∧ ¬ Ulam.IsCentrallySymmetric K.body ∧ Ulam.FloatsInEquilibriumInEveryOrientationAtLevel K.body (volume.real K.body / 2) := d:ℕhd:3 ≤ d⊢ ∃ K, IsStrictlyConvexBody K.body ∧ ¬IsCentrallySymmetric K.body ∧ FloatsInEquilibriumInEveryOrientationAtLevel K.body (volume.real K.body / 2) All goals completed! 🐙
#95
On Zagier-Hoffman's conjectures in positive characteristic
annals_zagier_hoffman_positive_char

Lean theorem statement

/--
Statement of Theorem A (Brown's theorem in positive characteristic):

Let `w ∈ ℕ`, where `ℕ := {1,2,...}`. Then every MZV of weight `w` can be written as a `K`-linear
combination of MZV's in the set `𝒯_w`. In particular, `dim 𝒵_w ≤ d(w)`.
Note that `K` in the paper is `RatFunc F`.
-/
theorem theorem_A (w : ℕ+) :
    𝒵 F w = Submodule.span (RatFunc F) (𝒯 F w) ∧
    Module.rank (RatFunc F) (𝒵 F w) ≤ d F w := by
  sorry

/--
Statement of Theorem B:

Let `w ∈ ℕ`, where `ℕ := {1,2,...}`. MZVs of weight `w` in `𝒯0 w` are all linearly independent over
`K`. In particular, `dim 𝒵 w ≥ |𝒯0 w|`. Note that `K` in the paper is `RatFunc F`.
-/
theorem theorem_B (w : ℕ+) :
    LinearIndependent (RatFunc F) (Subtype.val : 𝒯0 F w → CompletionAtInfty F) ∧
    Module.rank (RatFunc F) (𝒵 F w) ≥ Set.ncard (𝒯0 F w) := by
  sorry

/--
Statement of Theorem D:

Let `w ∈ ℕ+` with `w ≤ 2q − 2`. Then `𝒯 w` is a `K`-basis for `𝒵 w`. In particular,
`dim_K (𝒵 w) = d(w)`. Note that `K` in the paper is `RatFunc F`.

Note: Theorem A establishes that `𝒯 w` spans `𝒵 w`. So to prove `𝒯 w` is a `K`-basis for `𝒵 w`, we
only need to show that `𝒯 w` are linearly independent in `𝒵 w`.
-/
theorem theorem_D (w : ℕ+) (hw : w ≤ 2 * Nat.card F - 2) :
    LinearIndependent (RatFunc F) (Subtype.val : 𝒯 F w → CompletionAtInfty F) ∧
    Module.rank (RatFunc F) (𝒵 F w) = d F w := by
  sorry
#96
Brauer–Suzuki theorem (quaternion Sylow 2-subgroup)
brauer_suzuki

Verso theorem preview

theorem declaration uses `sorry`brauer_suzuki {G : Type*} [Group G] [Finite G] (n : ℕ) (hn : 3 ≤ n) (P : Sylow 2 G) (hquat : Nonempty ((P : Subgroup G) ≃* QuaternionGroup (2 ^ (n - 2)))) (t : G) (ht_mem : t ∈ (P : Subgroup G)) (ht_ord : orderOf t = 2) : (QuotientGroup.mk t : G ⧸ LeanEval.GroupTheory.Defs.oddCore G) ∈ Subgroup.center (G ⧸ LeanEval.GroupTheory.Defs.oddCore G) := G:Type u_1inst✝¹:Group Ginst✝:Finite Gn:ℕhn:3 ≤ nP:Sylow 2 Ghquat:Nonempty (↥↑P ≃* QuaternionGroup (2 ^ (n - 2)))t:Ght_mem:t ∈ ↑Pht_ord:orderOf t = 2⊢ ↑t ∈ Subgroup.center (G ⧸ oddCore G) All goals completed! 🐙
#97
Dehn–Sommerville equations for simplicial spheres
dehn_sommerville

Lean theorem statement

/-- **Dehn–Sommerville equations.** The h-vector of a finite simplicial sphere
is symmetric: `h_j = h_{d-j}`. -/
theorem dehn_sommerville
    {d j : ℕ} (X : FiniteSimplicialSphere d) (hj : j ≤ d) :
    hVector X j = hVector X (d - j) := by
  sorry
#98
Onsager's 2D Ising phase transition
ising_2d_phase_transition

Lean theorem statement

/-- **Onsager's 2D Ising phase transition.** The thermodynamic-limit free
energy exists for all `β` and is non-analytic at some positive `βc`. -/
theorem ising_2d_phase_transition :
    ∃ (F : ℝ → ℝ) (βc : ℝ),
      0 < βc ∧
        (∀ β : ℝ,
          Tendsto (fun n : ℕ => finiteIsingFreeEnergySeq n β) atTop (𝓝 (F β))) ∧
        ¬ AnalyticAt ℝ F βc := by
  sorry
#99
Jordan–Brouwer separation theorem
jordan_brouwer

Lean theorem statement

/-- **Jordan–Brouwer separation theorem.** For `d ≥ 2`, the
complement in `ℝᵈ` of a topological `(d−1)`-sphere (the image of any
continuous injection from the unit `(d−1)`-sphere into `ℝᵈ`) has
exactly two connected components. -/
theorem jordan_brouwer (d : ℕ) (_hd : 2 ≤ d)
    (r : Metric.sphere (0 : EuclideanSpace ℝ (Fin d)) 1 → EuclideanSpace ℝ (Fin d))
    (_hcont : Continuous r) (_hinj : Function.Injective r) :
    Nat.card
        (ConnectedComponents ((Set.range r)ᶜ : Set (EuclideanSpace ℝ (Fin d)))) =
      2 := by
  sorry
#100
Upper bound theorem for geometric simplicial spheres (Stanley 1975)
upper_bound_simplicial_spheres

Verso theorem preview

theorem declaration uses `sorry`upper_bound_theorem_simplicial_spheres {d n k : ℕ} (X : LeanEval.Combinatorics.UpperBoundSimplicialSpheresProblem.FiniteSimplicialSphere d) (_hn : LeanEval.Combinatorics.UpperBoundSimplicialSpheresProblem.faceCount X 0 = n) (_hk : k < d) : LeanEval.Combinatorics.UpperBoundSimplicialSpheresProblem.faceCount X k ≤ LeanEval.Combinatorics.UpperBoundSimplicialSpheresProblem.cyclicPolytopeFaceCount n d k := d:ℕn:ℕk:ℕX:FiniteSimplicialSphere d_hn:faceCount X 0 = n_hk:k < d⊢ faceCount X k ≤ cyclicPolytopeFaceCount n d k All goals completed! 🐙
#101
Erdős's unit-distance conjecture is false
erdos_unit_distance_conjecture_false

Verso theorem preview

theorem declaration uses `sorry`erdos_unit_distance_conjecture_false : ∃ δ : ℝ, 0 < δ ∧ ∀ N : ℕ, ∃ (n : ℕ) (P : Finset (EuclideanSpace ℝ (Fin 2))), N ≤ n ∧ P.card = n ∧ (n : ℝ) ^ (1 + δ) ≤ (unitDist P : ℝ) := ⊢ ∃ δ, 0 < δ ∧ ∀ (N : ℕ), ∃ n P, N ≤ n ∧ P.card = n ∧ ↑n ^ (1 + δ) ≤ ↑(unitDist P) All goals completed! 🐙
#102
KAM persistence of an invariant curve
kam_invariant_curve

Lean theorem statement

/-- **KAM theorem (persistence of an invariant curve).** For real-analytic,
`1`-periodic, non-constant, mean-zero `f` and Diophantine `α`, for all small
`|c|` the twist-map functional equation
`q(t+α) − 2q(t) + q(t−α) = c·f(q(t))` has a smooth strictly increasing solution
`q` with `q − id` periodic — the `c = 0` curve `q₀(t) = t` persists as a smooth
invariant curve of rotation number `α`. -/
theorem kam_invariant_curve
    (α : ℝ) (_hα : IsDiophantine α)
    (f : ℝ → ℝ)
    (_hf_analytic : AnalyticOnNhd ℝ f Set.univ)
    (_hf_per : Function.Periodic f 1)
    (_hf_nonconst : ¬ ∃ k : ℝ, ∀ x, f x = k)
    (_hf_mean : ∫ x in (0 : ℝ)..1, f x = 0) :
    ∃ c₀ : ℝ, 0 < c₀ ∧ ∀ c : ℝ, |c| < c₀ →
      ∃ q : ℝ → ℝ,
        ContDiff ℝ ∞ q ∧ StrictMono q ∧
        Function.Periodic (fun t => q t - t) 1 ∧
        ∀ t : ℝ, q (t + α) - 2 * q t + q (t - α) = c * f (q t) := by
  sorry
#103
Mandelbrot set is connected (Douady–Hubbard)
mandelbrot_connected

Lean theorem statement

/-- **Mandelbrot set is connected** (Douady–Hubbard). -/
theorem mandelbrot_connected : IsConnected Mandelbrot := by
  sorry
#104
pi_3 of the 2-sphere is Z
pi3_sphere_two_mulEquiv_int

Lean theorem statement

/-- The third homotopy group of the 2-sphere is infinite cyclic. -/
theorem pi3_sphere_two_mulEquiv_int
    (x : Metric.sphere (0 : EuclideanSpace ℝ (Fin 3)) 1) :
    Nonempty
      (HomotopyGroup.Pi 3 (Metric.sphere (0 : EuclideanSpace ℝ (Fin 3)) 1) x ≃*
        Multiplicative ℤ) := by
  sorry
#105
Neukirch–Uchida theorem
neukirch_uchida

Verso theorem preview

theorem declaration uses `sorry`neukirch_uchida {K₁ K₂ K₁' K₂' : Type*} [Field K₁] [Field K₂] [Field K₁'] [Field K₂'] [NumberField K₁] [NumberField K₂] [Algebra K₁ K₁'] [Algebra K₂ K₂'] [IsSepClosure K₁ K₁'] [IsSepClosure K₂ K₂'] (ϕ : Gal(K₁'/K₁) ≃* Gal(K₂'/K₂)) (he : IsHomeomorph ϕ) : ∃! σ : K₂' ≃+* K₁', (algebraMap K₂ K₂').range.map σ.toRingHom = (algebraMap K₁ K₁').range ∧ ∀ g : Gal(K₁'/K₁), ϕ g = σ.trans (g.toRingEquiv.trans σ.symm) := K₁:Type u_1K₂:Type u_2K₁':Type u_3K₂':Type u_4inst✝⁹:Field K₁inst✝⁸:Field K₂inst✝⁷:Field K₁'inst✝⁶:Field K₂'inst✝⁵:NumberField K₁inst✝⁴:NumberField K₂inst✝³:Algebra K₁ K₁'inst✝²:Algebra K₂ K₂'inst✝¹:IsSepClosure K₁ K₁'inst✝:IsSepClosure K₂ K₂'ϕ:Gal(K₁'/K₁) ≃* Gal(K₂'/K₂)he:IsHomeomorph ⇑ϕ⊢ ∃! σ, Subring.map σ.toRingHom (algebraMap K₂ K₂').range = (algebraMap K₁ K₁').range ∧ ∀ (g : Gal(K₁'/K₁)), (ϕ g).toRingEquiv = σ.trans (g.toRingEquiv.trans σ.symm) All goals completed! 🐙
#106
Bézout's theorem (projective, with multiplicity)
bezout_projective_multiplicity

Lean theorem statement

/-- **Bézout's theorem (with multiplicity).** Given `n` homogeneous
polynomials `f_k` in `n + 1` variables, each of total degree exactly
`d_k ≥ 1`, over an algebraically closed field with finite common
projective zero set, the sum of intersection multiplicities equals
`∏ d_k`. The `totalDegree` hypothesis rules out the zero polynomial
(which is `IsHomogeneous d` for every `d` but has `totalDegree = 0`). -/
theorem bezout_multiplicity [IsAlgClosed K] {n : ℕ}
    (f : Fin n → MvPolynomial (Fin (n + 1)) K)
    (d : Fin n → ℕ) (_hd : ∀ k, (f k).IsHomogeneous (d k))
    (_hdeg : ∀ k, (f k).totalDegree = d k)
    (_hd_pos : ∀ k, 1 ≤ d k)
    (_hfin : (⋂ k, vanishingSet (f k)).Finite) :
    ∑ᶠ p ∈ (⋂ k, vanishingSet (f k)), intersectionMultiplicity f p
      = (∏ k, d k : ℕ∞) := by
  sorry
#107
Furstenberg measure-preserving multiple recurrence
furstenberg_measure

Verso theorem preview

theorem declaration uses `sorry`furstenberg_measure_recurrence {Ω : Type*} [MeasurableSpace Ω] (μ : MeasureTheory.Measure Ω) [MeasureTheory.IsProbabilityMeasure μ] {T : Ω → Ω} (_hT : MeasureTheory.MeasurePreserving T μ μ) {A : Set Ω} (_hA : MeasurableSet A) (_h0 : 0 < μ A) (d : ℕ) (_hd : 1 ≤ d) : ∃ n : ℕ, 1 ≤ n ∧ 0 < μ (A ∩ ⋂ j ∈ Finset.Icc 1 d, T^[j * n] ⁻¹' A) := Ω:Type u_1inst✝¹:MeasurableSpace Ωμ:Measure Ωinst✝:IsProbabilityMeasure μT:Ω → Ω_hT:MeasurePreserving T μ μA:Set Ω_hA:MeasurableSet A_h0:0 < μ Ad:ℕ_hd:1 ≤ d⊢ ∃ n, 1 ≤ n ∧ 0 < μ (A ∩ ⋂ j ∈ Finset.Icc 1 d, T^[j * n] ⁻¹' A) All goals completed! 🐙
#108
Morse inequalities
morse_inequality

Lean theorem statement

/-- **Morse inequalities** (Marston Morse, 1934). For a Morse function `f`
on a closed smooth finite-dimensional Hausdorff manifold `M` and every `k ∈ ℕ`,
`∑_{j≤k}(−1)^{k−j} c_j(f) ≥ ∑_{j≤k}(−1)^{k−j} b_j(M)`. -/
theorem morse_inequality
    {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E]
    {H : Type*} [TopologicalSpace H] {I : ModelWithCorners ℝ E H} [I.Boundaryless]
    {M : Type} [TopologicalSpace M] [ChartedSpace H M] [IsManifold I ∞ M]
    [CompactSpace M] [T2Space M] (f : M → ℝ) (_hf : IsMorseFunction I f) (k : ℕ) :
    alternatingPartialSum (bettiNumber M) k ≤
      alternatingPartialSum (morseCount I f) k := by
  sorry
#109
pi_(n+1) of S^n is Z/2 for n at least 3
pi_succ_sphere_n_mulEquiv_zmod_two

Verso theorem preview

theorem declaration uses `sorry`pi_succ_sphere_n_mulEquiv_zmod_two (n : ℕ) (hn : 3 ≤ n) (x : Metric.sphere (0 : EuclideanSpace ℝ (Fin (n + 1))) 1) : Nonempty (HomotopyGroup.Pi (n + 1) (Metric.sphere (0 : EuclideanSpace ℝ (Fin (n + 1))) 1) x ≃* Multiplicative (ZMod 2)) := n:ℕhn:3 ≤ nx:↑(Metric.sphere 0 1)⊢ Nonempty (HomotopyGroup.Pi (n + 1) (↑(Metric.sphere 0 1)) x ≃* Multiplicative (ZMod 2)) All goals completed! 🐙
#110
Strong Mason conjecture for matroid independent sets
strong_mason_conjecture

Verso theorem preview

theorem declaration uses `sorry`strong_mason_conjecture {α : Type*} (M : Matroid α) [M.Finite] (k : ℕ) (hk : 0 < k) (hkn : k < M.E.ncard) : independentSetCount M (k - 1) * independentSetCount M (k + 1) * (k + 1) * (M.E.ncard - k + 1) ≤ independentSetCount M k ^ 2 * k * (M.E.ncard - k) := α:Type u_1M:Matroid αinst✝:M.Finitek:ℕhk:0 < khkn:k < M.E.ncard⊢ independentSetCount M (k - 1) * independentSetCount M (k + 1) * (k + 1) * (M.E.ncard - k + 1) ≤ independentSetCount M k ^ 2 * k * (M.E.ncard - k) All goals completed! 🐙
#111
Feit–Thompson odd-order theorem
feit_thompson

Verso theorem preview

theorem declaration uses `sorry`feit_thompson {G : Type*} [Group G] [Finite G] (_h : Odd (Nat.card G)) : Group.IsSolvable G := G:Type u_1inst✝¹:Group Ginst✝:Finite G_h:Odd (Nat.card G)⊢ Group.IsSolvable G All goals completed! 🐙
#112
Spencer-Szemerédi-Trotter unit-distance upper bound
unit_distance_upper_bound

Verso theorem preview

theorem declaration uses `sorry`unit_distance_upper_bound : ∃ C : ℝ, 0 < C ∧ ∀ P : Finset (EuclideanSpace ℝ (Fin 2)), (unitDist P : ℝ) ≤ C * (P.card : ℝ) ^ ((4 : ℝ) / 3) := ⊢ ∃ C, 0 < C ∧ ∀ (P : Finset (EuclideanSpace ℝ (Fin 2))), ↑(unitDist P) ≤ C * ↑P.card ^ (4 / 3) All goals completed! 🐙
#113
Pseudorandom sets in Grassmann graph have near-perfect expansion
annals_pseudorandom_grassmann

Verso theorem preview

theorem declaration uses `sorry`theorem_1_12 (α : ℝ) (hα : α ∈ Set.Ioo 0 1) : ∃ ε > 0, ∃ r, ∀ᶠ (ℓ : ℕ) (k : ℕ) in atTop, ∀ S : Finset (PseudorandomGrassmann.GrVertex k ℓ), (hS : S.Nonempty) → 2 * #S ≤ Fintype.card (PseudorandomGrassmann.GrVertex k ℓ) → Φ (PseudorandomGrassmann.Gr k ℓ) S hS ≤ α → ∃ (A B : Submodule 𝔽₂ (Fin k → 𝔽₂)), A ≤ B ∧ letI a := finrank 𝔽₂ A; letI b := k - finrank 𝔽₂ B a + b ≤ r ∧ #(S ∩ SubGr k ℓ A B) / #(SubGr k ℓ A B) ≥ (ε : ℝ) := α:ℝhα:α ∈ Set.Ioo 0 1⊢ ∃ ε > 0, ∃ r, ∀ᶠ (ℓ : ℕ) (k : ℕ) in atTop, ∀ (S : Finset (GrVertex k ℓ)) (hS : S.Nonempty), 2 * #S ≤ Fintype.card (GrVertex k ℓ) → ↑(Φ (Gr k ℓ) S hS) ≤ α → ∃ A B, A ≤ B ∧ finrank 𝔽₂ ↥A + (k - finrank 𝔽₂ ↥B) ≤ r ∧ ↑(#(S ∩ SubGr k ℓ A B)) / ↑(#(SubGr k ℓ A B)) ≥ ε All goals completed! 🐙
#114
Jacobian of a compact Riemann surface (Buzzard challenge)
jacobian_challenge_diffgeo

Verso theorem preview

def declaration uses `sorry`genus (X : Type u) [TopologicalSpace X] [T2Space X] [CompactSpace X] [ConnectedSpace X] [Nonempty X] [ChartedSpace ℂ X] [IsManifold (modelWithCornersSelf ℂ ℂ) ω X] : ℕ := sorry
theorem declaration uses `sorry`genus_eq_zero_iff_homeo : genus X = 0 ↔ Nonempty (X ≃ₜ (Metric.sphere (0 : EuclideanSpace ℝ (Fin 3)) 1)) := sorry
def declaration uses `sorry`Jacobian (X : Type u) [TopologicalSpace X] [T2Space X] [CompactSpace X] [ConnectedSpace X] [Nonempty X] [ChartedSpace ℂ X] [IsManifold (modelWithCornersSelf ℂ ℂ) ω X] : Type u := sorry
instance declaration uses `sorry`instAddCommGroup : AddCommGroup (Jacobian X) := sorry
instance declaration uses `sorry`instTopologicalSpace : TopologicalSpace (Jacobian X) := sorry
instance declaration uses `sorry`instT2Space : T2Space (Jacobian X) := sorry
instance declaration uses `sorry`instCompactSpace : CompactSpace (Jacobian X) := sorry
instance declaration uses `sorry`instChartedSpace : ChartedSpace (Fin (genus X) → ℂ) (Jacobian X) := sorry
instance declaration uses `sorry`instIsManifold : IsManifold (modelWithCornersSelf ℂ (Fin (genus X) → ℂ)) ω (Jacobian X) := sorry
instance declaration uses `sorry`instLieAddGroup : LieAddGroup (modelWithCornersSelf ℂ (Fin (genus X) → ℂ)) ω (Jacobian X) := sorry
def declaration uses `sorry`ofCurve (P : X) : X → Jacobian X := sorry
theorem declaration uses `sorry`ofCurve_contMDiff (P : X) : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ (Fin (genus X) → ℂ)) ω (ofCurve P) := sorry
theorem declaration uses `sorry`ofCurve_self (P : X) : ofCurve P P = 0 := sorry
theorem declaration uses `sorry`ofCurve_inj (P : X) (h : 0 < genus X) : Function.Injective (ofCurve P) := sorry
def declaration uses `sorry`pushforward (f : X → Y) (hf : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω f) : Jacobian X →ₜ+ Jacobian Y := sorry
theorem declaration uses `sorry`pushforward_contMDiff (f : X → Y) (hf : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω f) : ContMDiff (modelWithCornersSelf ℂ (Fin (genus X) → ℂ)) (modelWithCornersSelf ℂ (Fin (genus Y) → ℂ)) ω (pushforward f hf) := sorry
theorem declaration uses `sorry`pushforward_id_apply (P : Jacobian X) : pushforward id contMDiff_id P = P := sorry
theorem declaration uses `sorry`pushforward_comp_apply (f : X → Y) (hf : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω f) (g : Y → Z) (hg : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω g) (P : Jacobian X) : pushforward (g ∘ f) (hg.comp hf) P = pushforward g hg (pushforward f hf P) := sorry
def declaration uses `sorry`pullback (f : X → Y) (hf : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω f) : Jacobian Y →ₜ+ Jacobian X := sorry
theorem declaration uses `sorry`pullback_contMDiff (f : X → Y) (hf : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω f) : ContMDiff (modelWithCornersSelf ℂ (Fin (genus Y) → ℂ)) (modelWithCornersSelf ℂ (Fin (genus X) → ℂ)) ω (pullback f hf) := sorry
theorem declaration uses `sorry`pullback_id_apply (P : Jacobian X) : pullback id contMDiff_id P = P := sorry
theorem declaration uses `sorry`pullback_comp_apply (f : X → Y) (hf : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω f) (g : Y → Z) (hg : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω g) (P : Jacobian Z) : pullback (g.comp f) (hg.comp hf) P = pullback f hf (pullback g hg P) := sorry
def declaration uses `sorry`degree (f : X → Y) (hf : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω f) : ℕ := sorry -- 0 for constant case
theorem declaration uses `sorry`pushforward_pullback (f : X → Y) (hf : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω f) (P : Jacobian Y) : pushforward f hf (pullback f hf P) = (degree f hf) • P := sorry
#115
Existence of a simple group of order 10200960 with a 22-dim irrep whose tensor square has 4 isotypic components
m23_irrep_tensor_square_decomp

Verso theorem preview

theorem declaration uses `sorry`m23_irrep_tensor_square_decomp : ∃ (G : Type) (_ : Group G) (_ : Fintype G), Fintype.card G = 10200960 ∧ IsSimpleGroup G ∧ ∃ (V : Type) (_ : AddCommGroup V) (_ : Module ℂ V) (ρ : Representation ℂ G V), Module.finrank ℂ V = 22 ∧ ρ.IsIrreducible ∧ (@isotypicComponents (MonoidAlgebra ℂ G) (V ⊗[ℂ] V) _ _ (Module.compHom (V ⊗[ℂ] V) (Representation.asAlgebraHom (ρ.tprod ρ)).toRingHom)).ncard = 4 := ⊢ ∃ G x x_1, Fintype.card G = 10200960 ∧ IsSimpleGroup G ∧ ∃ V x_2 x_3 ρ, Module.finrank ℂ V = 22 ∧ ρ.IsIrreducible ∧ (isotypicComponents (MonoidAlgebra ℂ G) (V ⊗[ℂ] V)).ncard = 4 All goals completed! 🐙
#116
Schmidt's subspace theorem
schmidt_subspace

Verso theorem preview

theorem declaration uses `sorry`schmidt_subspace (σ : Type*) [Fintype σ] (hσ : 2 ≤ Fintype.card σ) (L : σ → σ → ℂ) (alg : ∀ i j, IsAlgebraic ℚ (L i j)) (ind : LinearIndependent ℂ L) (ε : ℝ) (pos : 0 < ε) : ∃ s : Finset (σ → ℤ), 0 ∉ s ∧ ∀ x : σ → ℤ, ‖∏ i, ∑ j, L i j * x j‖ < ‖x‖ ^ (-ε) → ∃ c ∈ s, ∑ i, c i * x i = 0 := σ:Type u_1inst✝:Fintype σhσ:2 ≤ Fintype.card σL:σ → σ → ℂalg:∀ (i j : σ), IsAlgebraic ℚ (L i j)ind:LinearIndependent ℂ Lε:ℝpos:0 < ε⊢ ∃ s, 0 ∉ s ∧ ∀ (x : σ → ℤ), ‖∏ i, ∑ j, L i j * ↑(x j)‖ < ‖x‖ ^ (-ε) → ∃ c ∈ s, ∑ i, c i * x i = 0 All goals completed! 🐙
#117
Vinogradov mean value theorem
vinogradov_mean_value

Verso theorem preview

theorem declaration uses `sorry`vinogradov_mean_value (s k : ℕ) (ε : ℝ) (hε : 0 < ε) : LeanEval.NumberTheory.VinogradovMeanValue.J s k =O[Filter.atTop] fun X ↦ (X ^ (s + ε) + X ^ ((2 * s : ℝ) - k * (k + 1) / 2 + ε) : ℝ) := s:ℕk:ℕε:ℝhε:0 < ε⊢ J s k =O[Filter.atTop] fun X => ↑X ^ (↑s + ε) + ↑X ^ (2 * ↑s - ↑k * (↑k + 1) / 2 + ε) All goals completed! 🐙
#118
On the Duffin-Schaeffer conjecture
annals_duffin_schaeffer_conjecture

Verso theorem preview

/-- Statement of Theorem 1: If for `ψ : ℕ → ℝ≥0`, the infinite series `∑ (ψ q * φ q) / q`, where `φ` is the Euler totient function, diverges, then the set `𝒜` defined above has Lebesgue measure `1`. -/ theorem declaration uses `sorry`theorem_1 (ψ : ℕ+ → ℝ≥0) (hdivergence : ¬ Summable fun q ↦ (ψ q * φ q) / q) : MeasurableSet (𝒜 ψ) ∧ volume (𝒜 ψ) = 1 := ψ:ℕ+ → ℝ≥0hdivergence:¬Summable fun q => ψ q * ↑(φ ↑q) / ↑↑q⊢ MeasurableSet (𝒜 ψ) ∧ volume (𝒜 ψ) = 1 All goals completed! 🐙
/-- Statement of Theorem 2(a): Let `ψ : ℕ → ℝ≥0`, `𝒦` and `ψ⋆` be as above. Then, if `∑ ψ⋆ (q)` converges, `𝒦` has Lebesgue measure `0`. -/ theorem declaration uses `sorry`theorem_2_a (ψ : ℕ+ → ℝ≥0) (hψ : ∑' q, ψ_star ψ q < ∞) : MeasurableSet (𝒦 ψ) ∧ volume (𝒦 ψ) = 0 := ψ:ℕ+ → ℝ≥0hψ:∑' (q : ℕ+), ψ_star ψ q < ∞⊢ MeasurableSet (𝒦 ψ) ∧ volume (𝒦 ψ) = 0 All goals completed! 🐙
/-- Statement of Theorem 2(b): Let `ψ : ℕ → ℝ≥0`, `𝒦` and `ψ⋆` be as above. Then, if `∑ ψ⋆ (q)` diverges, `𝒦` has Lebesgue measure `1`. -/ theorem declaration uses `sorry`theorem_2_b (ψ : ℕ+ → ℝ≥0) (hψ : ∑' q, ψ_star ψ q = ∞) : MeasurableSet (𝒦 ψ) ∧ volume (𝒦 ψ) = 1 := ψ:ℕ+ → ℝ≥0hψ:∑' (q : ℕ+), ψ_star ψ q = ∞⊢ MeasurableSet (𝒦 ψ) ∧ volume (𝒦 ψ) = 1 All goals completed! 🐙
/-- Statement of Corollary 3: For a function `ψ : ℕ → [0, 1/2]`, the set `𝒜` and the element `s` defined as above, the Hausdorff dimension of `𝒜` is the minimum of `s` and `1`. -/ theorem declaration uses `sorry`corollary_3 (ψ : ℕ+ → ℝ≥0) (hψ : ∀ n, ψ n ∈ Set.Icc 0 (1 / 2)) : dimH (𝒜 ψ) = min (s_inf ψ) 1 := ψ:ℕ+ → ℝ≥0hψ:∀ (n : ℕ+), ψ n ∈ Set.Icc 0 (1 / 2)⊢ dimH (𝒜 ψ) = ↑(min (s_inf ψ) 1) All goals completed! 🐙
#119
Uniformization theorem for Riemann surfaces
uniformization

Verso theorem preview

theorem declaration uses `sorry`uniformization {X : Type*} [TopologicalSpace X] [T2Space X] [ConnectedSpace X] [SecondCountableTopology X] [ChartedSpace ℂ X] [IsManifold mℂ 1 X] (hX : ¬ CompactSpace X) (x : X) [Subsingleton <| Additive (FundamentalGroup X x) →+ ℝ] : Nonempty (X ≃ₘ⟮mℂ, mℂ⟯ ℂ) ∨ Nonempty (X ≃ₘ⟮mℂ, mℂ⟯ UpperHalfPlane) := X:Type u_1inst✝⁶:TopologicalSpace Xinst✝⁵:T2Space Xinst✝⁴:ConnectedSpace Xinst✝³:SecondCountableTopology Xinst✝²:ChartedSpace ℂ Xinst✝¹:IsManifold mℂ 1 XhX:¬CompactSpace Xx:Xinst✝:Subsingleton (Additive (FundamentalGroup X x) →+ ℝ)⊢ Nonempty (X ≃ₘ⟮mℂ, mℂ⟯ ℂ) ∨ Nonempty (X ≃ₘ⟮mℂ, mℂ⟯ UpperHalfPlane) All goals completed! 🐙
#120
Ado's theorem in characteristic zero
adoCharZero

Verso theorem preview

theorem declaration uses `sorry`adoCharZero [CharZero K] [FiniteDimensional K L] : ∃ (V : Type u) (_ : AddCommGroup V) (_ : Module K V) (_ : FiniteDimensional K V) (ρ : L →ₗ⁅K⁆ Module.End K V), Function.Injective ρ := K:Type uL:Type uinst✝⁴:Field Kinst✝³:LieRing Linst✝²:LieAlgebra K Linst✝¹:CharZero Kinst✝:FiniteDimensional K L⊢ ∃ V x x_1, ∃ (_ : FiniteDimensional K V), ∃ ρ, Function.Injective ⇑ρ All goals completed! 🐙
#121
Flat Littlewood polynomials exist
annals_flat_littlewood_poly

Verso theorem preview

theorem declaration uses `sorry`theorem_1_1 : ∃ Δ δ : ℝ, Δ > δ ∧ δ > 0 ∧ ∀ n ≥ 2, ∃ P : ℂ[X], FlatLittlewoodPoly.IsLittlewoodPolynomial P ∧ P.natDegree = n ∧ ∀ z : ℂ, ‖z‖ = 1 → δ * √n ≤ ‖P.eval z‖ ∧ ‖P.eval z‖ ≤ Δ * √n := ⊢ ∃ Δ δ, Δ > δ ∧ δ > 0 ∧ ∀ n ≥ 2, ∃ P, IsLittlewoodPolynomial P ∧ P.natDegree = n ∧ ∀ (z : ℂ), ‖z‖ = 1 → δ * √↑n ≤ ‖Polynomial.eval z P‖ ∧ ‖Polynomial.eval z P‖ ≤ Δ * √↑n All goals completed! 🐙
#122
Lorentzian polynomials
annals_lorentzian_polynomials

Verso theorem preview

theorem declaration uses `sorry`theorem_2_25 (n d : ℕ) (hn : 0 < n) : closure (Ŀ n d) = LorentzianPolynomials.L n d := n:ℕd:ℕhn:0 < n⊢ closure (Ŀ n d) = L n d All goals completed! 🐙
#123
Moran's equality for affine-symmetric iterated function systems
moran_equality_affine

Verso theorem preview

theorem declaration uses `sorry`moran_equality_affine {d n : ℕ} (hn : 1 ≤ n) (f : Fin n → EuclideanSpace ℝ (Fin d) → EuclideanSpace ℝ (Fin d)) (lam : ℝ) (h_aff : LeanEval.Dynamics.IsAffineSymmetricIFS f lam) (h_osc : LeanEval.Dynamics.OpenSetCondition f) {S : Set (EuclideanSpace ℝ (Fin d))} (hS : LeanEval.Dynamics.IsAttractor f S) : dimH S = ENNReal.ofReal (- Real.log n / Real.log lam) := d:ℕn:ℕhn:1 ≤ nf:Fin n → EuclideanSpace ℝ (Fin d) → EuclideanSpace ℝ (Fin d)lam:ℝh_aff:IsAffineSymmetricIFS f lamh_osc:OpenSetCondition fS:Set (EuclideanSpace ℝ (Fin d))hS:IsAttractor f S⊢ dimH S = ENNReal.ofReal (-Real.log ↑n / Real.log lam) All goals completed! 🐙
#124
Generalized topological Poincaré conjecture in dimensions ≥ 5 (Smale)
poincare_high_dim_topological

Verso theorem preview

theorem declaration uses `sorry`poincare_high_dim_topological {n : ℕ} (_h5 : 5 ≤ n) {M : Type*} [TopologicalSpace M] [T2Space M] [ChartedSpace (EuclideanSpace ℝ (Fin n)) M] (_h : M ≃ₕ sphere (0 : EuclideanSpace ℝ (Fin (n + 1))) 1) : Nonempty (M ≃ₜ sphere (0 : EuclideanSpace ℝ (Fin (n + 1))) 1) := n:ℕ_h5:5 ≤ nM:Type u_1inst✝²:TopologicalSpace Minst✝¹:T2Space Minst✝:ChartedSpace (EuclideanSpace ℝ (Fin n)) M_h:M ≃ₕ ↑(sphere 0 1)⊢ Nonempty (M ≃ₜ ↑(sphere 0 1)) All goals completed! 🐙
#125
Chen's theorem
chen_theorem

Verso theorem preview

theorem declaration uses `sorry`chen_theorem : {p : ℕ | p.Prime ∧ LeanEval.NumberTheory.ChenTheorem.HasAtMostTwoPrimeFactors (p + 2)}.Infinite := ⊢ {p | Nat.Prime p ∧ HasAtMostTwoPrimeFactors (p + 2)}.Infinite All goals completed! 🐙
#126
A counterexample to the periodic tiling conjecture
annals_periodic_tiling_conjecture

Lean theorem statement

/--
Statement of Theorem 1.4 (Counterexample to Conjecture 1.2, I):

There exists a finite abelian group `G₀` and a finite non-empty `F ⊆ ℤ² × G₀` such that
`F` forms an aperiodic tiling equation.
-/
theorem theorem_1_4 : ∃ (G₀ : Type) (_ : AddCommGroup G₀) (_ : Finite G₀),
    ∃ F : Set (ℤ × ℤ × G₀), F.Finite ∧ F.Nonempty ∧ IsAperiodicTilingEquation F := by
  sorry

/--
Statement of Corollary 1.6 (Counterexample to Conjecture 1.2, II):

For all sufficiently large `d`, there exists a finite non-empty `F ⊆ ℤᵈ` such that
`F` forms an aperiodic tiling equation.
-/
theorem corollary_1_6 : ∀ᶠ d in atTop, ∃ (F : Set (Fin d → ℤ)),
    F.Finite ∧ F.Nonempty ∧ IsAperiodicTilingEquation F := by
  sorry

/--
Statement of Corollary 1.7 (Counterexample to Conjecture 1.3):

For all sufficiently large `d`, there exists a bounded measurable set `σ ⊆ ℝᵈ` of positive
measure such that `σ` forms an aperiodic continuous tiling equation.
-/
theorem corollary_1_7 : ∀ᶠ d in atTop, ∃ σ : Set (Fin d → ℝ), IsBounded σ ∧ MeasurableSet σ ∧
    0 < volume σ ∧ IsAperiodicContinuousTilingEquation σ := by
  sorry
#127
The Hopf Umlaufsatz (theorem of turning tangents)
hopf_umlaufsatz

Verso theorem preview

theorem declaration uses `sorry`hopf_umlaufsatz {r : ℝ → LeanEval.Geometry.HopfUmlaufsatz.Plane} {α : ℝ → ℝ} (_hr : LeanEval.Geometry.HopfUmlaufsatz.IsPositiveSimpleClosedUnitSpeedCurve r) (_hα : LeanEval.Geometry.HopfUmlaufsatz.IsTangentAngleLift r α) : totalCurvature α = 2 * Real.pi := r:ℝ → Planeα:ℝ → ℝ_hr:IsPositiveSimpleClosedUnitSpeedCurve r_hα:IsTangentAngleLift r α⊢ totalCurvature α = 2 * Real.pi All goals completed! 🐙
#128
Radó's theorem on Riemann surfaces
rado_riemannSurface

Verso theorem preview

theorem declaration uses `sorry`rado_riemannSurface {X : Type*} [TopologicalSpace X] [T2Space X] [ConnectedSpace X] [ChartedSpace ℂ X] [IsManifold (modelWithCornersSelf ℂ ℂ) 1 X] : SecondCountableTopology X := X:Type u_1inst✝⁴:TopologicalSpace Xinst✝³:T2Space Xinst✝²:ConnectedSpace Xinst✝¹:ChartedSpace ℂ Xinst✝:IsManifold (modelWithCornersSelf ℂ ℂ) 1 X⊢ SecondCountableTopology X All goals completed! 🐙
#129
Riesz brothers' theorem
riesz_brothers_theorem

Lean theorem statement

/-- **Riesz brothers' theorem.** Let `μ` be a complex Borel measure on
the unit circle such that `∫ z^n dμ = 0` for every `n ≥ 1`. Then `μ` is
absolutely continuous with respect to Haar measure. The usual density
formulation follows by applying the Radon–Nikodym theorem to this conclusion;
the hypothesis transfers the Fourier-vanishing property to that density. This
corollary is not part of the formal statement here. -/
theorem riesz_brothers_theorem (μ : ComplexMeasure UnitAddCircle)
    (hμ : ∀ n : ℕ, 1 ≤ n → ∫ᵛ z, fourier n z ∂[ContinuousLinearMap.mul ℝ ℂ; μ] = 0) :
    μ ≪ᵥ AddCircle.haarAddCircle.toENNRealVectorMeasure := by
  sorry
#130
On a conjecture of Talagrand on selector processes and a consequence on positive empirical processes
annals_supremum_of_selector_processes

Lean theorem statement

/-- The constant `L` of Theorem 1.2. -/
noncomputable def L₂ : ℝ≥0 := sorry

/-- The constant of Theorem 1.2 is positive. -/
theorem L₂_pos : L₂ > 0 := sorry

/--
Statement of Theorem 1.2:

There exists `L > 0` such that for any `0 < p < 1`, finite type `X`, and set `Λ` of functions from
`X` to `ℝ≥0` such that `0 < 𝔼[sup_{f ∈ Λ} ∑ i ∈ Xp, f i] < ∞`, the collection of sets

`{s ⊆ X | sup_{f ∈ Λ} ∑ i ∈ s, f i ≥ L * 𝔼[sup_{f ∈ Λ} ∑ i ∈ Xp, f i]}`

is `p-small`, where `Xp` is a binomial random subset of `X` with parameter `p`.

Note: The assumption `0 < 𝔼[sup_{f ∈ Λ} ∑ i ∈ Xp, f i] < ∞` is not explicitly stated in the theorem
but used in the last step of the proof where `𝔼 ≥ (L/L') * 𝔼` is a contradiction for `L > L'`.
-/
theorem theorem_1_2 (p : I) (hp₀ : 0 < p) (hp₁ : p < 1) (X : Type*) [Fintype X] (Λ : Set (X → ℝ≥0))
    (hE₀ : 0 < 𝔼⁻[⨆ f ∈ Λ, ∑ i ∈ Xp, (f i : ℝ≥0∞); Xp ∼ binomialSetDistribution X p])
    (hE : 𝔼⁻[⨆ f ∈ Λ, ∑ i ∈ Xp, (f i : ℝ≥0∞); Xp ∼ binomialSetDistribution X p] < ∞) :
    IsSmall p {s : Set X | ⨆ f ∈ Λ, ∑ i ∈ s, (f i : ℝ≥0∞) ≥
        L₂ * 𝔼⁻[⨆ f ∈ Λ, ∑ i ∈ Xp, (f i : ℝ≥0∞); Xp ∼ binomialSetDistribution X p]} := by
  sorry

/-- The constant `L` of Theorem 1.3. -/
noncomputable def L₃ : ℝ≥0 := sorry

/-- The constant of Theorem 1.3 is positive. -/
theorem L₃_pos : L₃ > 0 := sorry

/--
Statement of Theorem 1.3:

There exists `L > 0` such that for any `N > 0`, i.i.d random variables `Y_1, …, Y_N` distributed
according to a Borel probability measure `ν` on a Polish space `𝕋`, if `𝓕` is a finite set of
non-negative functions in `L∞(𝕋)` and `0 < 𝔼[sup_{f ∈ 𝓕} Z Y f] < ∞` then there exists a finite
collection `𝓒` of pairs `(g, t)` where `g : 𝕋 → ℝ≥0`, `t > 0` such that

`{sup_{f ∈ 𝓕} Z N Y f ≥ L * 𝔼[sup_{f ∈ 𝓕} Z N Y f] } ⊆ ⋃ (g,t) ∈ 𝓒, {t ≤ Z N Y g}`

and

`∑ (g,t) ∈ 𝓒, P(t ≤ Z N Y g) ≤ 2⁻¹`.

Note: The requirement that the collection `𝓒` be finite is not explicitly stated in the paper.
However, `𝓒` must at least be assumed to be countable in order for the sum to make sense,
and the collections `𝓒` produced by the proof are indeed finite.

-/
theorem theorem_1_3 (N : ℕ) (N_pos : N > 0) (𝕋 : Type*) (t𝕋 : TopologicalSpace 𝕋)
    (p𝕋 : PolishSpace 𝕋)
    (m𝕋 : MeasurableSpace 𝕋) (b𝕋 : BorelSpace 𝕋) (ν : Measure 𝕋) (hν : IsProbabilityMeasure ν)
    (Ω : Type*) (mΩ : MeasurableSpace Ω) (P : Measure Ω) (Y : Fin N → Ω → 𝕋)
    (Y_indep : iIndepFun Y P) (Y_law_ν : ∀ i, HasLaw (Y i) ν P)
    (𝓕 : Set {f : 𝕋 → ℝ≥0 // Measurable f ∧ MemLp f ∞ ν}) (h𝓕 : Finite 𝓕)
    (hZ₀ : 0 < 𝔼⁻[⨆ f ∈ 𝓕, (Z N Y f ·); P]) (hZ : 𝔼⁻[⨆ f ∈ 𝓕, (Z N Y f ·); P] < ∞) :
    ∃ 𝓒 : Finset ({g : 𝕋 → ℝ≥0 // Measurable g} × {t : ℝ≥0 | t > 0}),
      {ω | ⨆ f ∈ 𝓕, Z N Y f ω ≥ L₃ * 𝔼⁻[⨆ f ∈ 𝓕, (Z N Y f ·); P]} ⊆ ⋃ c ∈ 𝓒, {ω | c.2 ≤ Z N Y c.1 ω}
      ∧ ∑ c : 𝓒, P {ω | c.val.2 ≤ Z N Y c.val.1 ω} ≤ 2⁻¹ := by
  sorry
#131
Gauss-Wantzel constructible regular polygon theorem
gauss_wantzel_constructible_polygon

Lean theorem statement

/-- **Gauss-Wantzel constructible polygon theorem** (§174): a regular `n`-gon
is straightedge-and-compass constructible exactly for the Gauss-Wantzel
integers. -/
theorem gauss_wantzel_constructible_polygon (n : ℕ) (hn : 3 ≤ n) :
    IsConstructible (Real.cos (2 * Real.pi / n)) ↔ GaussWantzelNumber n := by
  sorry
#132
Green–Tao theorem
green_tao

Verso theorem preview

theorem declaration uses `sorry`green_tao : LeanEval.NumberTheory.ContainsArbitraryAPs {p : ℕ | Nat.Prime p} := ⊢ ContainsArbitraryAPs {p | Nat.Prime p} All goals completed! 🐙
#133
No bounded projection from L^1 onto H^1
H1_not_closedComplemented

Verso theorem preview

theorem declaration uses `sorry`H1_not_closedComplemented : ¬ LeanEval.Analysis.H1.ClosedComplemented := ⊢ ¬H1.ClosedComplemented All goals completed! 🐙
#134
Improved bounds for the sunflower lemma
annals_improved_bounds_sunflower_lemma

Lean theorem statement

/-- The absolute constant `C` in Theorem 1.4. Although not explicitly stated in the paper,
the constant `C` doesn't depend on `r`. -/
noncomputable def C : ℝ := sorry

/--
Statement of Theorem 1.4 (Main theorem, sunflowers):

Let `r ≥ 3`. For some constant `C`, any `w`-set system `F` of size
`|F| ≥ (C * r ^ 3 * log w * log log w) ^ w` contains an `r`-sunflower.

Note: We require `w ≥ 2`, as the paper assumes `log log w > 0`.
-/
theorem theorem_1_4 (r : ℕ) (hr : r ≥ 3) (X : Type*) [Finite X] (ℱ : Set (Set X)) (w : ℕ)
      (hw : w ≥ 2) (hℱ₁ : ℱ.IsSystem w) (hℱ₂ : ℱ.ncard ≥ lowerBound r C w) :
      ∃ S ⊆ ℱ, S.IsSunflower r := by
  sorry
#135
On approximation to a real number by algebraic numbers of bounded degree
annals_on_approximation_of_reals

Lean theorem statement

/--
Statement of Theorem 1.1:

Let `n` be an integer such that `n ≥ 2`. For any transcendental real number `ξ`, we have
`ω⋆_n(ξ) ≥ a * n`, where `a = 1 / (2 - log 2)`.
-/
theorem theorem_1_1 (n : ℕ) (hn : n ≥ 2) (ξ : ℝ) (hξ : Transcendental ℚ ξ) :
    letI a : ℝ := 1 / (2 - Real.log 2)
    (ω⋆ n ξ : EReal) ≥ (a : EReal) * n := by
  sorry
#136
Fundamental theorem of topos theory
fundamental_topos_theory

Verso theorem preview

theorem declaration uses `sorry`fundamental_topos_theory {E : Type*} [Category E] (hE : LeanEval.ToposTheory.IsTopos E) (X : E) : LeanEval.ToposTheory.IsTopos (Over X) := E:Type u_1inst✝:Category.{u_2, u_1} EhE:IsTopos EX:E⊢ IsTopos (Over X) All goals completed! 🐙
#137
Hurewicz theorem in degree 1 (H₁ = abelianization of π₁)
hurewicz_h1_abelianization

Lean theorem statement

/-- **Hurewicz (n = 1).** For a path-connected space `X`, `H₁(X;ℤ)` is the
abelianization of `π₁(X, x)`. -/
theorem hurewicz_h1_abelianization
    (X : Type) [TopologicalSpace X] [PathConnectedSpace X] (x : X) :
    Nonempty (Additive (Abelianization (FundamentalGroup X x)) ≃+
      (IntegralHomology 1 X : Type)) := by
  sorry
#138
Singularity of random Bernoulli matrices
annals_random_bernoulli_matrices

Verso theorem preview

/-- Statement of Theorem A: For every `p ∈ (0, 1/2]` and `ε > 0` there exists `N, C > 0` such that for any `n ≥ N` and any `n × n` random matrix `B` with mutually independent `Bernoulli(p)` entries, `P(σ_min (B + sIIᵀ) ≤ t/√n) ≤ (1 - p + ε)ⁿ + Ct` for all `s ∈ [-1,0]` and `t > 0`. -/ theorem declaration uses `sorry`theorem_A {p : I} {ε : ℝ} (hp₀ : 0 < p) (hp₁ : (p : ℝ) ≤ 1 / 2) (hε : 0 < ε) : ∃ N > 0, ∃ C > 0, ∀ n ≥ N, ∀ (Ω : Type*) (_mΩ : MeasurableSpace Ω) (P : Measure Ω) (B : Ω → Matrix (Fin n) (Fin n) ℝ) (_B_indep : iIndepFun (fun x : Fin n × Fin n ↦ (B · x.1 x.2)) P) (_B_bernoulli : ∀ i j, HasLaw (B · i j) (bernoulliMeasure 1 0 p) P), ∀ s : ℝ, -1 ≤ s ∧ s ≤ 0 → ∀ t : ℝ, 0 < t → P.real {ω : Ω | σ_min (B ω + of (fun _ _ ↦ s)) ≤ t / √n} ≤ (1 - p + ε) ^ n + C * t := p:↑Iε:ℝhp₀:0 < php₁:↑p ≤ 1 / 2hε:0 < ε⊢ ∃ N > 0, ∃ C > 0, ∀ n ≥ N, ∀ (Ω : Type u_1) (_mΩ : MeasurableSpace Ω) (P : Measure Ω) (B : Ω → Matrix (Fin n) (Fin n) ℝ), iIndepFun (fun x x_1 => B x_1 x.1 x.2) P → (∀ (i j : Fin n), HasLaw (fun x => B x i j) Ber(1, 0, p) P) → ∀ (s : ℝ), -1 ≤ s ∧ s ≤ 0 → ∀ (t : ℝ), 0 < t → P.real {ω | σ_min (B ω + of fun x x_1 => s) ≤ t / √↑n} ≤ (1 - ↑p + ε) ^ n + C * t All goals completed! 🐙
/-- This (unnamed) corollary appears directly below Theorem A in the paper: For every `p ∈ (0, 1/2]` and any sequence `Bₙ` of `n × n` random matrices with mutually independent `Bernoulli(p)` entries we have that `P(Bₙ is singular) = (1 - p + oₙ(1))ⁿ`. -/ theorem declaration uses `sorry`corollary_1 {p : I} (hp₀ : 0 < p) (hp₁ : (p : ℝ) ≤ 1 / 2) {Ω : ℕ → Type*} [mΩ : ∀ n, MeasurableSpace (Ω n)] {P : (n : ℕ) → Measure (Ω n)} {B : (n : ℕ) → Ω n → Matrix (Fin n) (Fin n) ℝ} (B_indep : ∀ n, iIndepFun (fun x : Fin n × Fin n ↦ (B n · x.1 x.2)) (P n)) (B_bernoulli : ∀ n i j, HasLaw (B n · i j) (bernoulliMeasure 1 0 p) (P n)) : ∃ o : ℕ → ℝ, o =o[atTop] (1 : ℕ → ℝ) ∧ ∀ n > 0, (P n).real {ω | (B n ω).det = 0} = (1 - p + o n) ^ n := p:↑Ihp₀:0 < php₁:↑p ≤ 1 / 2Ω:ℕ → Type u_1mΩ:(n : ℕ) → MeasurableSpace (Ω n)P:(n : ℕ) → Measure (Ω n)B:(n : ℕ) → Ω n → Matrix (Fin n) (Fin n) ℝB_indep:∀ (n : ℕ), iIndepFun (fun x x_1 => B n x_1 x.1 x.2) (P n)B_bernoulli:∀ (n : ℕ) (i j : Fin n), HasLaw (fun x => B n x i j) Ber(1, 0, p) (P n)⊢ ∃ o, o =o[atTop] 1 ∧ ∀ n > 0, (P n).real {ω | (B n ω).det = 0} = (1 - ↑p + o n) ^ n All goals completed! 🐙
/-- This is the result stated in the paper's abstract: For any sequence `Mₙ` of `n × n` random matrices with mutually independent `Rademacher` entries we have that `P(Mₙ is singular) = (1/2 + oₙ(1))ⁿ`. -/ theorem declaration uses `sorry`corollary_2 {Ω : ℕ → Type*} (mΩ : ∀ n, MeasurableSpace (Ω n)) {P : (n : ℕ) → Measure (Ω n)} {M : (n : ℕ) → Ω n → Matrix (Fin n) (Fin n) ℝ} (M_indep : ∀ n, iIndepFun (fun x : Fin n × Fin n ↦ (M n · x.1 x.2)) (P n)) (M_rademacher : ∀ n i j, HasLaw (M n · i j) rademacherMeasure (P n)) : ∃ o : ℕ → ℝ, o =o[atTop] (1 : ℕ → ℝ) ∧ ∀ n > 0, (P n).real {ω | (M n ω).det = 0} = (1 / 2 + o n) ^ n := Ω:ℕ → Type u_1mΩ:(n : ℕ) → MeasurableSpace (Ω n)P:(n : ℕ) → Measure (Ω n)M:(n : ℕ) → Ω n → Matrix (Fin n) (Fin n) ℝM_indep:∀ (n : ℕ), iIndepFun (fun x x_1 => M n x_1 x.1 x.2) (P n)M_rademacher:∀ (n : ℕ) (i j : Fin n), HasLaw (fun x => M n x i j) rademacherMeasure (P n)⊢ ∃ o, o =o[atTop] 1 ∧ ∀ n > 0, (P n).real {ω | (M n ω).det = 0} = (1 / 2 + o n) ^ n All goals completed! 🐙
#139
Anosov–Bowen shadowing lemma
anosov_bowen_shadowing

Lean theorem statement

/-- **Anosov–Bowen shadowing lemma** (Anosov 1967; Bowen 1975). Every
compact hyperbolic invariant set has the shadowing property. -/
theorem hyperbolic_has_shadowing
    (T : E d ≃ₜ E d) (K : Set (E d))
    (_hKc : IsCompact K) (_hK : IsHyperbolic T K) :
    HasShadowing (T : E d → E d) K := by
  sorry
#140
Hessian estimates for the sigma-2 equation in dimension four
annals_hessian_estimates

Verso theorem preview

theorem declaration uses `sorry`theorem_1_1 : ∃ C : ℝ≥0∞ → ℝ, ∀ (u : ℝ⁴ → ℝ) (_smooth : ContDiffOn ℝ ∞ u B₁(0)) (_bounded : ‖u‖_C¹(B₁(0)) < (∞ : ℝ≥0∞)) (_positive_branch : ∀ x ∈ B₁(0), (Δ u) x > 0) (_solution : ∀ x ∈ B₁(0), σ₂ (H u B₁(0) x) = 1), ‖H u B₁(0) 0‖_F ≤ C (‖u‖_C¹(B₁(0))) := ⊢ ∃ C, ∀ (u : ℝ⁴ → ℝ), ContDiffOn ℝ ∞ u B₁(0) → ‖u‖_C¹(B₁(0)) < ∞ → (∀ x ∈ B₁(0), Δ u x > 0) → (∀ x ∈ B₁(0), σ₂ (H u B₁(0) x) = 1) → ‖H u B₁(0) 0‖_F ≤ C ‖u‖_C¹(B₁(0)) All goals completed! 🐙
#141
Morrison–Walker Lemma B.0.1: adapting families of maps to open covers
families_of_maps_b01

Verso theorem preview

/-- **Lemma B.0.1** of Morrison–Walker, *The Blob Complex* (arXiv:1009.5025, §B), continuous case. -/ theorem declaration uses `sorry`continuous {P : Set (Fin k → ℝ)} (_hP : IsPolyhedron P) [CompactSpace X] (U : ι → Set X) (_hUopen : ∀ α, IsOpen (U α)) (ρ : PartitionOfUnity ι X univ) (_hρ : ρ.IsSubordinate U) (f : C(P × X, T)) : ∃ F : C(I × P × X, T), (∀ p : P, ∀ x : X, F (0, p, x) = f (p, x)) ∧ (∃ K : Subdivision P, ∀ D ∈ K.complex.facets, AdaptedTo U k (fun q : closedCell P D × X => F (1, q.1.1, q.2))) ∧ (∀ S : Set X, Supported (f := f.toFun) S → Supported (fun q : (I × P) × X => F (q.1.1, q.1.2, q.2)) S) ∧ (∀ Q : Set P, IsBoundarySubpolyhedron Q → ∀ S' : Set X, Supported (fun q : Q × X => f (q.1.1, q.2)) S' → Supported (fun q : (I × Q) × X => F (q.1.1, q.1.2.1, q.2)) S') := k:ℕι:Type u_1X:Type u_2T:Type u_3inst✝²:TopologicalSpace Xinst✝¹:TopologicalSpace TP:Set (Fin k → ℝ)_hP:IsPolyhedron Pinst✝:CompactSpace XU:ι → Set X_hUopen:∀ (α : ι), IsOpen[inst✝²] (U α)ρ:PartitionOfUnity ι X_hρ:ρ.IsSubordinate Uf:C(↑P × X, T)⊢ ∃ F, (∀ (p : ↑P) (x : X), F (0, p, x) = f (p, x)) ∧ (∃ K, ∀ D ∈ K.complex.facets, AdaptedTo U k fun q => F (1, ↑q.1, q.2)) ∧ (∀ (S : Set X), Supported f.toFun S → Supported (fun q => F (q.1.1, q.1.2, q.2)) S) ∧ ∀ (Q : Set ↑P), IsBoundarySubpolyhedron Q → ∀ (S' : Set X), Supported (fun q => f (↑q.1, q.2)) S' → Supported (fun q => F (q.1.1, ↑q.1.2, q.2)) S' All goals completed! 🐙
/-- **Lemma B.0.1**, bi-Lipschitz variant (part 4 of the paper). -/ theorem declaration uses `sorry`biLipschitz {X T : Type*} [MetricSpace X] [MetricSpace T] [CompactSpace X] {P : Set (Fin k → ℝ)} (_hP : IsPolyhedron P) {ι : Type*} (U : ι → Set X) (_hUopen : ∀ α, IsOpen (U α)) (ρ : PartitionOfUnity ι X univ) (_hρ : ρ.IsSubordinate U) (f : C(P × X, T)) (slice : P → (X ≃ₜ T)) (_h_slice_eq : ∀ p : P, ∀ x : X, f (p, x) = slice p x) (L : NNReal) (_hf_joint : LipschitzWith L f.toFun) (_hf_slice_inv : ∀ p : P, LipschitzWith L (slice p).symm) : ∃ F : C(I × P × X, T), ∃ L' : NNReal, ∃ Slice : I × P → (X ≃ₜ T), (∀ p : P, ∀ x : X, F (0, p, x) = f (p, x)) ∧ (∀ t : I, ∀ p : P, ∀ x : X, F (t, p, x) = Slice (t, p) x) ∧ (∃ K : Subdivision P, ∀ D ∈ K.complex.facets, AdaptedTo U k (fun q : closedCell P D × X => F (1, q.1.1, q.2))) ∧ (∀ S : Set X, Supported (f := f.toFun) S → Supported (fun q : (I × P) × X => F (q.1.1, q.1.2, q.2)) S) ∧ (∀ Q : Set P, IsBoundarySubpolyhedron Q → ∀ S' : Set X, Supported (fun q : Q × X => f (q.1.1, q.2)) S' → Supported (fun q : (I × Q) × X => F (q.1.1, q.1.2.1, q.2)) S') ∧ (∀ tp : I × P, LipschitzWith L' (Slice tp)) ∧ (∀ tp : I × P, LipschitzWith L' (Slice tp).symm) := k:ℕX:Type u_4T:Type u_5inst✝²:MetricSpace Xinst✝¹:MetricSpace Tinst✝:CompactSpace XP:Set (Fin k → ℝ)_hP:IsPolyhedron Pι:Type u_6U:ι → Set X_hUopen:∀ (α : ι), IsOpen[PseudoMetricSpace.toUniformSpace.toTopologicalSpace] (U α)ρ:PartitionOfUnity ι X_hρ:ρ.IsSubordinate Uf:C(↑P × X, T)slice:↑P → X ≃ₜ T_h_slice_eq:∀ (p : ↑P) (x : X), f (p, x) = (slice p) xL:NNReal_hf_joint:LipschitzWith L f.toFun_hf_slice_inv:∀ (p : ↑P), LipschitzWith L ⇑(slice p).symm⊢ ∃ F L' Slice, (∀ (p : ↑P) (x : X), F (0, p, x) = f (p, x)) ∧ (∀ (t : ↑I) (p : ↑P) (x : X), F (t, p, x) = (Slice (t, p)) x) ∧ (∃ K, ∀ D ∈ K.complex.facets, AdaptedTo U k fun q => F (1, ↑q.1, q.2)) ∧ (∀ (S : Set X), Supported f.toFun S → Supported (fun q => F (q.1.1, q.1.2, q.2)) S) ∧ (∀ (Q : Set ↑P), IsBoundarySubpolyhedron Q → ∀ (S' : Set X), Supported (fun q => f (↑q.1, q.2)) S' → Supported (fun q => F (q.1.1, ↑q.1.2, q.2)) S') ∧ (∀ (tp : ↑I × ↑P), LipschitzWith L' ⇑(Slice tp)) ∧ ∀ (tp : ↑I × ↑P), LipschitzWith L' ⇑(Slice tp).symm All goals completed! 🐙
#142
Pick's theorem
pick

Verso theorem preview

theorem declaration uses `sorry`pick {n : ℕ} (hn : 3 ≤ n) (v : Fin n → ℤ × ℤ) (hsimple : LeanEval.Geometry.PicksTheorem.IsSimple (LeanEval.Geometry.PicksTheorem.latPoly v)) : area ((LeanEval.Geometry.PicksTheorem.latPoly v).boundary (R := ℝ)) = (interiorPts v : ℝ) + (boundaryPts v : ℝ) / 2 - 1 := n:ℕhn:3 ≤ nv:Fin n → ℤ × ℤhsimple:IsSimple (latPoly v)⊢ area (Polygon.boundary ℝ (latPoly v)) = ↑(interiorPts v) + ↑(boundaryPts v) / 2 - 1 All goals completed! 🐙
#143
Poincaré–Siegel linearisation theorem
poincare_siegel_linearisation

Lean theorem statement

/-- **Poincaré–Siegel linearisation theorem.** If `α` is Diophantine,
`λ = e^{2πiα}`, and `f` is holomorphic near `0` with `f 0 = 0` and
`f'(0) = λ`, then there is a holomorphic germ `u` with `u 0 = 0`,
`u'(0) = 1`, and `f(u z) = u(λ z)` for `z` near `0`. -/
theorem poincare_siegel
    (α : ℝ) (_hα : IsDiophantine α)
    (lam : ℂ) (_hlam : lam = Complex.exp (2 * Real.pi * Complex.I * (α : ℂ)))
    (f : ℂ → ℂ) (_hf : AnalyticAt ℂ f 0) (_hf0 : f 0 = 0)
    (_hmult : deriv f 0 = lam) :
    ∃ u : ℂ → ℂ, AnalyticAt ℂ u 0 ∧ u 0 = 0 ∧ deriv u 0 = 1 ∧
      ∀ᶠ z in nhds (0 : ℂ), f (u z) = u (lam * z) := by
  sorry
#144
General recursive equals Turing computable
turing_recursive_equiv

Lean theorem statement

/-- **General recursive = Turing computable** (total form). A total function
`f : ℕ → ℕ` is recursive (`Computable`, i.e. partial recursive as a partial
function) **iff** it is computed by some Turing machine (mathlib's `FinTM2`
model) under the standard binary encoding of `ℕ`. This is Knill's class
equality; the backward direction (TM-computable ⇒ recursive) is absent from
mathlib. -/
theorem turing_recursive_equiv (f : ℕ → ℕ) :
    Computable f ↔ Nonempty (TM2Computable encodeNat encodeNat f) := by
  sorry
#145
The Golod–Shafarevich inequality
golod_shafarevich_inequality

Verso theorem preview

theorem declaration uses `sorry`golod_shafarevich_inequality (p : ℕ) [Fact p.Prime] (Q : Type) [Group Q] [TopologicalSpace Q] [IsTopologicalGroup Q] [DiscreteTopology Q] [Finite Q] : IsPGroup p Q → Nontrivial Q → (generatorRank Q : ℝ) ^ 2 < 4 * (relationRank p Q : ℝ) := p:ℕinst✝⁵:Fact (Nat.Prime p)Q:Typeinst✝⁴:Group Qinst✝³:TopologicalSpace Qinst✝²:IsTopologicalGroup Qinst✝¹:DiscreteTopology Qinst✝:Finite Q⊢ IsPGroup p Q → Nontrivial Q → ↑(generatorRank Q) ^ 2 < 4 * ↑(relationRank p Q) All goals completed! 🐙
#146
Sobolev embedding theorem (Morrey regime)
sobolev_embedding_morrey

Verso theorem preview

theorem declaration uses `sorry`sobolev_embedding {n k r : ℕ} {α p : ℝ} (_hp : (n : ℝ) < p) (_hα : 0 < α) (_hα1 : α ≤ 1) (_hgap : (r : ℝ) + α < (k : ℝ) - n / p) (f : LeanEval.Analysis.SobolevMorreyProblem.E n → ℝ) (_hf : LeanEval.Analysis.SobolevMorreyProblem.MemSobolevWk k (ENNReal.ofReal p) f) : ∃ g : LeanEval.Analysis.SobolevMorreyProblem.E n → ℝ, f =ᵐ[volume] g ∧ LeanEval.Analysis.SobolevMorreyProblem.MemHolder r α g := n:ℕk:ℕr:ℕα:ℝp:ℝ_hp:↑n < p_hα:0 < α_hα1:α ≤ 1_hgap:↑r + α < ↑k - ↑n / pf:E n → ℝ_hf:MemSobolevWk k (ENNReal.ofReal p) f⊢ ∃ g, f =ᵐ[volume] g ∧ LeanEval.Analysis.SobolevMorreyProblem.MemHolder r α g All goals completed! 🐙
#147
Wigner semicircle law
wigner_semicircle

Verso theorem preview

theorem declaration uses `sorry`wigner_semicircle {Ω : Type*} [MeasurableSpace Ω] (μ : Measure Ω) [IsProbabilityMeasure μ] (X : ℕ → ℕ → Ω → ℝ) (_hX_meas : ∀ i j, Measurable (X i j)) (_hX_indep : iIndepFun (fun ij : {p : ℕ × ℕ // p.1 ≤ p.2} => X ij.val.1 ij.val.2) μ) (_hX_iid : ∀ i j i' j', i ≤ j → i' ≤ j' → ProbabilityTheory.IdentDistrib (X i j) (X i' j') μ μ) (_hX_int : ∀ i j, i ≤ j → Integrable (X i j) μ) (_hX_sq_int : ∀ i j, i ≤ j → Integrable (fun ω => (X i j ω) ^ 2) μ) (_hX_mean : ∀ i j, i ≤ j → ∫ ω, X i j ω ∂μ = 0) (_hX_var : ∀ i j, i ≤ j → ∫ ω, (X i j ω) ^ 2 ∂μ = 1) : ∀ᵐ ω ∂μ, ∀ (f : ℝ → ℝ), Continuous f → (∃ M, ∀ x, ‖f x‖ ≤ M) → Tendsto (fun n : ℕ => ∫ x, f x ∂ (empiricalSpectralMeasureHerm (wignerMatrix_isHermitian X n ω)).map (fun x : ℝ => x / Real.sqrt n)) atTop (𝓝 (∫ x, f x ∂semicircleLaw)) := Ω:Type u_1inst✝¹:MeasurableSpace Ωμ:Measure Ωinst✝:IsProbabilityMeasure μX:ℕ → ℕ → Ω → ℝ_hX_meas:∀ (i j : ℕ), Measurable (X i j)_hX_indep:iIndepFun (fun ij => X (↑ij).1 (↑ij).2) μ_hX_iid:∀ (i j i' j' : ℕ), i ≤ j → i' ≤ j' → IdentDistrib (X i j) (X i' j') μ μ_hX_int:∀ (i j : ℕ), i ≤ j → Integrable (X i j) μ_hX_sq_int:∀ (i j : ℕ), i ≤ j → Integrable (fun ω => X i j ω ^ 2) μ_hX_mean:∀ (i j : ℕ), i ≤ j → ∫ (ω : Ω), X i j ω ∂μ = 0_hX_var:∀ (i j : ℕ), i ≤ j → ∫ (ω : Ω), X i j ω ^ 2 ∂μ = 1⊢ ∀ᵐ (ω : Ω) ∂μ, ∀ (f : ℝ → ℝ), Continuous f → (∃ M, ∀ (x : ℝ), ‖f x‖ ≤ M) → Tendsto (fun n => ∫ (x : ℝ), f x ∂Measure.map (fun x => x / √↑n) (empiricalSpectralMeasureHerm ⋯)) atTop (𝓝 (∫ (x : ℝ), f x ∂semicircleLaw)) All goals completed! 🐙
#148
A reverse Minkowski theorem
annals_reverse_minkowski

Verso theorem preview

theorem declaration uses `sorry`theorem_1_2 (ℒ : Submodule ℤ ℝⁿ) [DiscreteTopology ℒ] (hℒ : IsZLattice ℝ ℒ) (h : ∀ ℒ' (_hℒℒ' : ℒ' ≤ ℒ) [DiscreteTopology ℒ'], determinant ℒ' ≥ 1) : let t : ℝ := 10 * (log n + 2) ρ (1 / t) ℒ ≤ 3 / 2 := n:ℕℒ:Submodule ℤ ℝⁿinst✝:DiscreteTopology ↥ℒhℒ:IsZLattice ℝ ℒh:∀ ℒ' ≤ ℒ, ∀ [inst : DiscreteTopology ↥ℒ'], determinant ℒ' ≥ 1⊢ let t := 10 * (log ↑n + 2); ρ (1 / t) ℒ ≤ 3 / 2 All goals completed! 🐙
#149
Duffin-Schaeffer conjecture
duffin_schaeffer

Verso theorem preview

theorem declaration uses `sorry`duffin_schaeffer (δ : ℕ → ℝ) (hδ : ∀ n, 0 ≤ δ n) : volume (addWellApproximable UnitAddCircle δ) = 1 ↔ ¬ Summable fun n : ℕ => n.totient * δ n := δ:ℕ → ℝhδ:∀ (n : ℕ), 0 ≤ δ n⊢ volume (addWellApproximable UnitAddCircle δ) = 1 ↔ ¬Summable fun n => ↑n.totient * δ n All goals completed! 🐙
#150
Ornstein–Weiss ℤᵈ Rokhlin lemma
ornstein_weiss_rokhlin

Verso theorem preview

theorem declaration uses `sorry`ornstein_weiss_rokhlin {Ω : Type*} [MeasurableSpace Ω] [StandardBorelSpace Ω] {d : ℕ} (_hd : 1 ≤ d) (μ : Measure Ω) [IsProbabilityMeasure μ] (T : (Fin d → ℤ) → Ω → Ω) (_hid : ∀ x, T 0 x = x) (_hT : ∀ v, MeasurePreserving (T v) μ μ) (_hgrp : ∀ u v x, T (u + v) x = T u (T v x)) (_hfree : LeanEval.Dynamics.IsFreeAction μ T) (N : ℕ) (_hN : 1 ≤ N) {ε : ENNReal} (_hε : 0 < ε) : ∃ B : Set Ω, MeasurableSet B ∧ ((boxShape d N : Finset (Fin d → ℤ)) : Set (Fin d → ℤ)).PairwiseDisjoint (fun v => T v '' B) ∧ μ (⋃ v ∈ boxShape d N, T v '' B) ≥ 1 - ε := Ω:Type u_1inst✝²:MeasurableSpace Ωinst✝¹:StandardBorelSpace Ωd:ℕ_hd:1 ≤ dμ:Measure Ωinst✝:IsProbabilityMeasure μT:(Fin d → ℤ) → Ω → Ω_hid:∀ (x : Ω), T 0 x = x_hT:∀ (v : Fin d → ℤ), MeasurePreserving (T v) μ μ_hgrp:∀ (u v : Fin d → ℤ) (x : Ω), T (u + v) x = T u (T v x)_hfree:IsFreeAction μ TN:ℕ_hN:1 ≤ Nε:ENNReal_hε:0 < ε⊢ ∃ B, MeasurableSet B ∧ ((↑(boxShape d N)).PairwiseDisjoint fun v => T v '' B) ∧ μ (⋃ v ∈ boxShape d N, T v '' B) ≥ 1 - ε All goals completed! 🐙
#151
Cauchy–Kovalevskaya theorem
cauchy_kovalevskaya

Verso theorem preview

theorem declaration uses `sorry`cauchy_kovalevskaya {d : ℕ} (F : LeanEval.Analysis.E d × ℝ × ℝ → LeanEval.Analysis.E d) (f : LeanEval.Analysis.E d × ℝ × ℝ → ℝ) (u₀ : LeanEval.Analysis.E d → ℝ) (_hF : AnalyticOnNhd ℝ F univ) (_hf : AnalyticOnNhd ℝ f univ) (_hu₀ : AnalyticOnNhd ℝ u₀ univ) (x₀ : LeanEval.Analysis.E d) : ∃ (U : Set (LeanEval.Analysis.E d × ℝ)) (u : LeanEval.Analysis.E d × ℝ → ℝ), (x₀, (0 : ℝ)) ∈ U ∧ IsOpen U ∧ AnalyticOnNhd ℝ u U ∧ (∀ x : LeanEval.Analysis.E d, (x, (0 : ℝ)) ∈ U → u (x, 0) = u₀ x) ∧ (∀ p ∈ U, fderiv ℝ u p ((0 : LeanEval.Analysis.E d), (1 : ℝ)) = fderiv ℝ u p (F (p.1, p.2, u p), (0 : ℝ)) + f (p.1, p.2, u p)) ∧ (∀ v : LeanEval.Analysis.E d × ℝ → ℝ, AnalyticOnNhd ℝ v U → (∀ x : LeanEval.Analysis.E d, (x, (0 : ℝ)) ∈ U → v (x, 0) = u₀ x) → (∀ p ∈ U, fderiv ℝ v p ((0 : LeanEval.Analysis.E d), (1 : ℝ)) = fderiv ℝ v p (F (p.1, p.2, v p), (0 : ℝ)) + f (p.1, p.2, v p)) → ∀ p ∈ U, u p = v p) := d:ℕF:E d × ℝ × ℝ → E df:E d × ℝ × ℝ → ℝu₀:E d → ℝ_hF:AnalyticOnNhd ℝ F univ_hf:AnalyticOnNhd ℝ f univ_hu₀:AnalyticOnNhd ℝ u₀ univx₀:E d⊢ ∃ U u, (x₀, 0) ∈ U ∧ IsOpen U ∧ AnalyticOnNhd ℝ u U ∧ (∀ (x : E d), (x, 0) ∈ U → u (x, 0) = u₀ x) ∧ (∀ p ∈ U, (fderiv ℝ u p) (0, 1) = (fderiv ℝ u p) (F (p.1, p.2, u p), 0) + f (p.1, p.2, u p)) ∧ ∀ (v : E d × ℝ → ℝ), AnalyticOnNhd ℝ v U → (∀ (x : E d), (x, 0) ∈ U → v (x, 0) = u₀ x) → (∀ p ∈ U, (fderiv ℝ v p) (0, 1) = (fderiv ℝ v p) (F (p.1, p.2, v p), 0) + f (p.1, p.2, v p)) → ∀ p ∈ U, u p = v p All goals completed! 🐙
#152
Existence of a non-isotopic pair of oriented knots
exists_nonisotopic_knots

Verso theorem preview

theorem declaration uses `sorry`exists_nonisotopic_knots : ∃ K₁ K₂ : LeanEval.KnotTheory.Knot, ¬ K₁.Isotopic K₂ := ⊢ ∃ K₁ K₂, ¬K₁.Isotopic K₂ All goals completed! 🐙
#153
Kolmogorov–Arnold superposition theorem (non-universal Lorentz form)
kolmogorov_arnold_superposition

Lean theorem statement

/-- **Kolmogorov–Arnold superposition theorem (non-universal Lorentz
form).** For `n ≥ 1`, every continuous `f` on the unit cube `[0, 1]ⁿ`
admits a representation
`f(x) = ∑_{k=0}^{2n} g(∑_{l=1}^{n} φ_{k,l}(x_l))` with a single
continuous outer function `g : ℝ → ℝ` and continuous inner functions
`φ_{k,l} : ℝ → ℝ`. -/
theorem kolmogorov_arnold (n : ℕ) (_hn : 1 ≤ n)
    (f : (Fin n → ℝ) → ℝ) (_hf : ContinuousOn f (Set.Icc 0 1)) :
    ∃ (g : ℝ → ℝ) (φ : Fin (2 * n + 1) → Fin n → ℝ → ℝ),
      Continuous g ∧ (∀ k l, Continuous (φ k l)) ∧
      ∀ x ∈ Set.Icc (0 : Fin n → ℝ) 1,
        f x = ∑ k, g (∑ l, φ k l (x l)) := by
  sorry
#154
The Landsberg–Schaar relation
landsberg_schaar

Verso theorem preview

theorem declaration uses `sorry`landsberg_schaar (p q : ℕ) (hp : Odd p) (hq : Odd q) : gaussS (2 * q : ℕ) p = Complex.exp ((Real.pi : ℂ) * Complex.I / 4) * gaussS (-(p : ℤ)) (2 * q) := p:ℕq:ℕhp:Odd phq:Odd q⊢ gaussS (↑(2 * q)) p = cexp (↑Real.pi * I / 4) * gaussS (-↑p) (2 * q) All goals completed! 🐙
#155
Strong Subadditivity of von Neumann Entropy
strong_subadditivity

Verso theorem preview

theorem declaration uses `sorry`strong_subadditivity (M_ABC : Matrix (A × B × C) (A × B × C) ℂ) (h : M_ABC.PosSemidef) : let M_AB : Matrix (A × B) (A × B) ℂ := .traceRight <| M_ABC.reindex (.symm <| .prodAssoc ..) (.symm <| .prodAssoc ..) let M_BC : Matrix (B × C) (B × C) ℂ := M_ABC.traceLeft let M_B : Matrix B B ℂ := M_BC.traceRight LeanEval.Physics.entropy M_ABC + LeanEval.Physics.entropy M_B ≤ LeanEval.Physics.entropy M_AB + LeanEval.Physics.entropy M_BC := A:Type u_1B:Type u_2C:Type u_3inst✝⁸:Fintype Ainst✝⁷:Fintype Binst✝⁶:Fintype Cinst✝⁵:DecidableEq Ainst✝⁴:DecidableEq Binst✝³:DecidableEq Cinst✝²:Nonempty Ainst✝¹:Nonempty Binst✝:Nonempty CM_ABC:Matrix (A × B × C) (A × B × C) ℂh:M_ABC.PosSemidef⊢ let M_AB := ((Matrix.reindex (Equiv.prodAssoc A B C).symm (Equiv.prodAssoc A B C).symm) M_ABC).traceRight; let M_BC := M_ABC.traceLeft; let M_B := M_BC.traceRight; entropy M_ABC + entropy M_B ≤ entropy M_AB + entropy M_BC All goals completed! 🐙
#156
Rational approximations to linear subspaces
annals_linear_subspaces

Verso theorem preview

theorem declaration uses `sorry`theorem_1 (hd : 2 ≤ d) (l : ℕ) (hl0 : 0 < l) (hld : l < d) (k : ℕ) (hk1 : 1 ≤ k) (hkl : k ≤ l) : (∀ x : Submodule ℝ ℝᵈ, finrank ℝ x = l → LinearSubspaces.diophantineExponent k x ≥ d / (k * (d - l))) ∧ (∃ x : Submodule ℝ ℝᵈ, finrank ℝ x = l ∧ LinearSubspaces.diophantineExponent k x = d / (k * (d - l))) := d:ℕhd:2 ≤ dl:ℕhl0:0 < lhld:l < dk:ℕhk1:1 ≤ khkl:k ≤ l⊢ (∀ (x : Submodule ℝ ℝᵈ), finrank ℝ ↥x = l → diophantineExponent k x ≥ ↑d / (↑k * (↑d - ↑l))) ∧ ∃ x, finrank ℝ ↥x = l ∧ diophantineExponent k x = ↑d / (↑k * (↑d - ↑l)) All goals completed! 🐙
#157
The local-global conjecture for Apollonian circle packings is false
annals_local_global_apollonian_circle_packings

Lean theorem statement

/--
Statement of Theorem 1.6:

The Apollonian circle packing `A` generated by `(−3, 5, 8, 8)` has no square curvatures.
-/
theorem theorem_1_6 : ∀ n, n ^ 2 ∉ curvatureSet ⟦⟨![-3, 5, 8, 8], by decide⟩⟧ := by
  sorry

/--
Statement of Theorem 1.3:

There exist infinitely many `A` for which the number of missing curvatures up to `N` is `Ω(√N)`.
-/
theorem theorem_1_3 : {A : PrimitiveApollonianCirclePacking |
    Real.sqrt =O[Filter.atTop] missingCurvatures A}.Infinite := by
  sorry
#158
The optimal paper Moebius band
annals_optimal_moebius

Lean theorem statement

/--
Statement of Theorem 1.1 (Main):

A smooth embedded paper Moebius band has aspect ratio greater than `√3`.
-/
theorem theorem_1_1 (a : ℝ) (ha : a > 0) (f : ℝ² → ℝ³) (hf : IsMoebiusEmbedding a f) :
    a > √3 := by
  sorry
#159
Lax's approximation theorem for toral homeomorphisms
lax_approximation

Lean theorem statement

/-- **Lax's approximation theorem.** Every toral dynamical system on `𝕋^d`
(`d ≥ 1`) is approximated arbitrarily well in the metric `δ` by cyclic cube
exchange transformations. -/
theorem lax_approximation {d : ℕ} (hd : 0 < d) (T : ToralDynamicalSystem d)
    {ε : ℝ≥0∞} (hε : 0 < ε) :
    ∃ (n : ℕ) (S : VolumePreservingEquiv d),
      IsCyclicCubeExchange S n ∧ deltaDist T.toVolumePreservingEquiv S < ε := by
  sorry
#160
Radon transform: Fourier-slice diagonalization and pseudo-inversion
radon_transform_inversion

Verso theorem preview

theorem declaration uses `sorry`radon_can_be_diagonalized_and_pseudo_inverted : (∀ φ : SchwartzMap (ℝ × ℝ) ℂ, ∀ θ k : ℝ, fourier1 (fun p => radon (φ : ℝ × ℝ → ℂ) (p, θ)) k = fourier2 (φ : ℝ × ℝ → ℂ) (k * Real.cos θ, k * Real.sin θ)) ∧ (∃ Rinv : (ℝ × ℝ → ℂ) → (ℝ × ℝ → ℂ), ∀ φ : SchwartzMap (ℝ × ℝ) ℂ, Rinv (radon (φ : ℝ × ℝ → ℂ)) = (φ : ℝ × ℝ → ℂ)) := ⊢ (∀ (φ : SchwartzMap (ℝ × ℝ) ℂ) (θ k : ℝ), fourier1 (fun p => radon ⇑φ (p, θ)) k = fourier2 ⇑φ (k * Real.cos θ, k * Real.sin θ)) ∧ ∃ Rinv, ∀ (φ : SchwartzMap (ℝ × ℝ) ℂ), Rinv (radon ⇑φ) = ⇑φ All goals completed! 🐙
#161
Algebraic integers with conjugates in a prescribed distribution
annals_algebraic_integers

Verso theorem preview

theorem declaration uses `sorry`theorem_1_1 : lambda_SSS < 1.89831 := ⊢ lambda_SSS < 1.89831 All goals completed! 🐙
#162
Brun's theorem (convergence of the twin-prime reciprocal sum)
brun_constant_converges

Lean theorem statement

/-- **Brun's theorem.** The reciprocal sum over twin-prime pairs converges. -/
theorem brun_constant_converges :
    Summable twinPrimeReciprocalTerm := by
  sorry
#163
Hadwiger's theorem
hadwiger

Verso theorem preview

theorem declaration uses `sorry`hadwiger (n : ℕ) : Module.finrank ℝ (valuations n) = n + 1 := n:ℕ⊢ Module.finrank ℝ ↥(valuations n) = n + 1 All goals completed! 🐙
#164
A 3-manifold group with no faithful representation into GL(4, ℝ)
nonlinear_three_manifold_group

Verso theorem preview

theorem declaration uses `sorry`nonlinear_three_manifold_group : ∃ (M : LeanEval.Topology.Closed3Manifold) (x : M.carrier), ∀ f : FundamentalGroup M.carrier x →* GL (Fin 4) ℝ, ¬ Function.Injective f := ⊢ ∃ M x, ∀ (f : FundamentalGroup M.carrier x →* GL (Fin 4) ℝ), ¬Function.Injective ⇑f All goals completed! 🐙
#165
Radial symmetry for positive semilinear Poisson solutions
semilinear_poisson_radial_symmetry

Verso theorem preview

theorem declaration uses `sorry`semilinear_poisson_radial_symmetry {n : ℕ} (hn : 0 < n) {f : ℝ → ℝ} (u : EuclideanSpace ℝ (Fin n) → ℝ) (hf_lipschitz : ∃ K : ℝ≥0, LipschitzWith K f) (hu_c2 : ContDiffOn ℝ 2 u (closedBall 0 1)) (hu_solve : LeanEval.Analysis.PDE.SolvesSemilinearPoisson f u) (hu_positive : ∀ x ∈ ball 0 1, 0 < u x) : ∃ v : ℝ → ℝ≥0, StrictAntiOn v (Set.Icc (0 : ℝ) 1) ∧ ∀ x ∈ closedBall 0 1, u x = v ‖x‖ := n:ℕhn:0 < nf:ℝ → ℝu:EuclideanSpace ℝ (Fin n) → ℝhf_lipschitz:∃ K, LipschitzWith K fhu_c2:ContDiffOn ℝ 2 u (closedBall 0 1)hu_solve:SolvesSemilinearPoisson f uhu_positive:∀ x ∈ ball 0 1, 0 < u x⊢ ∃ v, StrictAntiOn v (Set.Icc 0 1) ∧ ∀ x ∈ closedBall 0 1, u x = ↑(v ‖x‖) All goals completed! 🐙
#166
Klartag's construction of lattice sphere packings
klartag_packing

Verso theorem preview

theorem declaration uses `sorry`klartag_packing : ∃ c : ℝ, 0 < c ∧ ∀ n : ℕ, let V := EuclideanSpace ℝ (Fin (n + 1)) ∃ φ : V →ₗ[ℝ] V, let E := φ '' Metric.ball (0 : V) 1 (MeasureTheory.volume E : EReal) = c * n ^ 2 ∧ {v ∈ E | ∀ i, v i ∈ Set.range ((↑) : ℤ → ℝ)} = {0} := ⊢ ∃ c, 0 < c ∧ ∀ (n : ℕ), let V := EuclideanSpace ℝ (Fin (n + 1)); ∃ φ, let E := ⇑φ '' Metric.ball 0 1; ↑(MeasureTheory.volume E) = ↑c * ↑n ^ 2 ∧ {v | v ∈ E ∧ ∀ (i : Fin (n + 1)), v.ofLp i ∈ Set.range Int.cast} = {0} All goals completed! 🐙
#167
Fraser: Fourier decay for finite-field Kakeya sets is q^{-1} and sharp
fraser_kakeya_fourier_decay

Verso theorem preview

theorem declaration uses `sorry`fraser_kakeya_fourier_decay_and_sharp {d : ℕ} (_hd : 2 ≤ d) {K : Set (LeanEval.Combinatorics.FraserKakeyaProblem.Space F d)} (_hK : LeanEval.Combinatorics.FraserKakeyaProblem.IsKakeya K) (χ : AddChar F ℂ) (_hχ : χ ≠ 1) : (∃ μ : LeanEval.Combinatorics.FraserKakeyaProblem.Space F d → ℝ, LeanEval.Combinatorics.FraserKakeyaProblem.IsProbabilityMeasureOn K μ ∧ ∀ ξ : LeanEval.Combinatorics.FraserKakeyaProblem.Space F d, ξ ≠ 0 → ‖fourier χ μ ξ‖ ≤ (Fintype.card F : ℝ)⁻¹) ∧ (∀ κ : ℝ, 0 < κ → κ < 1 → ∃ Q : ℕ, ∀ (F' : Type*) [Field F'] [Fintype F'] [DecidableEq F'], Q ≤ Fintype.card F' → ∃ K' : Set (LeanEval.Combinatorics.FraserKakeyaProblem.Space F' d), LeanEval.Combinatorics.FraserKakeyaProblem.IsKakeya K' ∧ ∀ μ : LeanEval.Combinatorics.FraserKakeyaProblem.Space F' d → ℝ, LeanEval.Combinatorics.FraserKakeyaProblem.IsProbabilityMeasureOn K' μ → ∃ ξ : LeanEval.Combinatorics.FraserKakeyaProblem.Space F' d, ξ ≠ 0 ∧ κ * (Fintype.card F' : ℝ)⁻¹ ≤ ‖fourier (AddChar.FiniteField.primitiveChar_to_Complex F') μ ξ‖) := F:Type u_1inst✝²:Field Finst✝¹:Fintype Finst✝:DecidableEq Fd:ℕ_hd:2 ≤ dK:Set (Space F d)_hK:IsKakeya Kχ:AddChar F ℂ_hχ:χ ≠ 1⊢ (∃ μ, IsProbabilityMeasureOn K μ ∧ ∀ (ξ : Space F d), ξ ≠ 0 → ‖LeanEval.Combinatorics.FraserKakeyaProblem.fourier χ μ ξ‖ ≤ (↑(Fintype.card F))⁻¹) ∧ ∀ (κ : ℝ), 0 < κ → κ < 1 → ∃ Q, ∀ (F' : Type u_2) [inst : Field F'] [inst_1 : Fintype F'] [DecidableEq F'], Q ≤ Fintype.card F' → ∃ K', IsKakeya K' ∧ ∀ (μ : Space F' d → ℝ), IsProbabilityMeasureOn K' μ → ∃ ξ, ξ ≠ 0 ∧ κ * (↑(Fintype.card F'))⁻¹ ≤ ‖LeanEval.Combinatorics.FraserKakeyaProblem.fourier (AddChar.FiniteField.primitiveChar_to_Complex F') μ ξ‖ All goals completed! 🐙
#168
Jordan curve theorem
jordan_curve

Verso theorem preview

theorem declaration uses `sorry`jordan_curve (r : Metric.sphere (0 : EuclideanSpace ℝ (Fin 2)) 1 → EuclideanSpace ℝ (Fin 2)) (_hcont : Continuous r) (_hinj : Function.Injective r) : Nat.card (ConnectedComponents ((Set.range r)ᶜ : Set (EuclideanSpace ℝ (Fin 2)))) = 2 := r:↑(Metric.sphere 0 1) → EuclideanSpace ℝ (Fin 2)_hcont:Continuous r_hinj:Function.Injective r⊢ Nat.card (ConnectedComponents ↑(Set.range r)ᶜ) = 2 All goals completed! 🐙
#169
Lidskii's inequality
lidskii_inequality

Verso theorem preview

theorem declaration uses `sorry`lidskii_inequality {n : Type*} [Fintype n] [DecidableEq n] {A B : Matrix n n ℂ} (hA : A.IsHermitian) (hB : B.IsHermitian) {p : ℝ} (_hp : 1 ≤ p) : ∑ j, |hA.eigenvalues₀ j - hB.eigenvalues₀ j| ^ p ≤ ∑ j, |(hB.sub hA).eigenvalues₀ j| ^ p := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℂB:Matrix n n ℂhA:A.IsHermitianhB:B.IsHermitianp:ℝ_hp:1 ≤ p⊢ ∑ j, |hA.eigenvalues₀ j - hB.eigenvalues₀ j| ^ p ≤ ∑ j, |⋯.eigenvalues₀ j| ^ p All goals completed! 🐙
#170
Chen theorem for Markoff graphs
dvd_card_connectedComponent_markoffGraph

Verso theorem preview

theorem declaration uses `sorry`dvd_card_connectedComponent_markoffGraph {p : ℕ} (hp : Nat.Prime p) (hgt : 3 < p) : ∀ c : (LeanEval.Combinatorics.markoffGraph p).ConnectedComponent, p ∣ Nat.card c := p:ℕhp:Nat.Prime phgt:3 < p⊢ ∀ (c : (markoffGraph p).ConnectedComponent), p ∣ Nat.card ↥c All goals completed! 🐙
#171
Nyquist–Shannon sampling theorem
nyquist_shannon_sampling

Verso theorem preview

theorem declaration uses `sorry`nyquist_shannon_sampling (f : 𝓢(ℝ, ℂ)) (hf : LeanEval.Analysis.NyquistShannon.FourierSupportedInNyquist f) : ∀ t : ℝ, Summable (fun n : ℤ ↦ f (n : ℝ) * sinc (Real.pi * ((n : ℝ) - t))) ∧ f t = ∑' n : ℤ, f (n : ℝ) * sinc (Real.pi * ((n : ℝ) - t)) := f:𝓢(ℝ, ℂ)hf:FourierSupportedInNyquist f⊢ ∀ (t : ℝ), (Summable fun n => f ↑n * sinc (Real.pi * (↑n - t))) ∧ f t = ∑' (n : ℤ), f ↑n * sinc (Real.pi * (↑n - t)) All goals completed! 🐙
#172
Local stable/unstable sets at a hyperbolic fixed point (set-level Hadamard–Perron)
stable_unstable_manifolds

Verso theorem preview

theorem declaration uses `sorry`stable_unstable_manifolds_exist (n : ℕ) (f : LeanEval.Dynamics.StableUnstableManifoldsProblem.E n → LeanEval.Dynamics.StableUnstableManifoldsProblem.E n) (x₀ : LeanEval.Dynamics.StableUnstableManifoldsProblem.E n) (_hf : ContDiffAt ℝ 1 f x₀) (_hfix : f x₀ = x₀) (_hhyp : LeanEval.Dynamics.StableUnstableManifoldsProblem.IsHyperbolicLinear (fderiv ℝ f x₀)) (_hf_inv : (fderiv ℝ f x₀).IsInvertible) : ∃ U : Set (LeanEval.Dynamics.StableUnstableManifoldsProblem.E n), IsOpen U ∧ x₀ ∈ U ∧ ∃ Ws Wu : Set (LeanEval.Dynamics.StableUnstableManifoldsProblem.E n), Ws = {x | (∀ k : ℕ, f^[k] x ∈ U) ∧ Tendsto (fun k => f^[k] x) atTop (𝓝 x₀)} ∧ Wu = {x | ∃ y : ℕ → LeanEval.Dynamics.StableUnstableManifoldsProblem.E n, y 0 = x ∧ (∀ k : ℕ, y k ∈ U) ∧ (∀ k : ℕ, f (y (k + 1)) = y k) ∧ Tendsto y atTop (𝓝 x₀)} ∧ Ws ∩ Wu = {x₀} := n:ℕf:E n → E nx₀:E n_hf:ContDiffAt ℝ 1 f x₀_hfix:f x₀ = x₀_hhyp:IsHyperbolicLinear (fderiv ℝ f x₀)_hf_inv:(fderiv ℝ f x₀).IsInvertible⊢ ∃ U, IsOpen U ∧ x₀ ∈ U ∧ ∃ Ws Wu, Ws = {x | (∀ (k : ℕ), f^[k] x ∈ U) ∧ Tendsto (fun k => f^[k] x) atTop (𝓝 x₀)} ∧ Wu = {x | ∃ y, y 0 = x ∧ (∀ (k : ℕ), y k ∈ U) ∧ (∀ (k : ℕ), f (y (k + 1)) = y k) ∧ Tendsto y atTop (𝓝 x₀)} ∧ Ws ∩ Wu = {x₀} All goals completed! 🐙
#173
Rokhlin lemma
rokhlin_lemma

Lean theorem statement

/-- **Rokhlin lemma, not-necessarily-invertible forward-image form.** For every
aperiodic measure-preserving transformation `T` of a standard Borel probability
space `(Ω, μ)`, every height `n ≥ 1`, and every `ε > 0`, there is a measurable
base whose `n` forward-image floors `B, T B, …, T^{n−1} B` are pairwise
disjoint and whose union has outer measure at least `1 − ε`. No invertibility
assumption is made. -/
theorem rokhlin_lemma {Ω : Type*} [MeasurableSpace Ω]
    [StandardBorelSpace Ω]
    (μ : Measure Ω) [IsProbabilityMeasure μ] (T : Ω → Ω)
    (_hT : MeasurePreserving T μ μ) (_hap : IsAperiodic T μ)
    (n : ℕ) (_hn : 1 ≤ n) {ε : ENNReal} (_hε : 0 < ε) :
    ∃ B : Set Ω, IsRokhlinTower T B n ∧
      μ (towerUnion T B n) ≥ 1 - ε := by
  sorry
#174
Tverberg's theorem
tverberg_theorem

Lean theorem statement

/-- **Tverberg's theorem.** Any `(r-1)(d+1)+1` points in `ℝ^d` admit an
`r`-part Tverberg partition. -/
theorem tverberg_theorem (d r : ℕ) (hr : 1 ≤ r)
    (f : Fin ((r - 1) * (d + 1) + 1) → Space d) :
    HasTverbergPartition (r := r) f := by
  sorry
#175
Fang–Xia: tiling of the symmetric group by transpositions implies λ-transitivity
fang_xia_tiling_partition_transitive

Verso theorem preview

theorem declaration uses `sorry`fang_xia_partition_transitive_of_tiling {n : ℕ} {Y : Set (Equiv.Perm (Fin n))} (_h : LeanEval.Combinatorics.FangXiaTilingProblem.IsTiling (LeanEval.Combinatorics.FangXiaTilingProblem.transpositionsWithOne n) Y) : ∀ lam : LeanEval.Combinatorics.FangXiaTilingProblem.PartitionShape n, 0 ≤ lam.contentSum → LeanEval.Combinatorics.FangXiaTilingProblem.IsPartitionTransitive Y lam := n:ℕY:Set (Equiv.Perm (Fin n))_h:IsTiling (transpositionsWithOne n) Y⊢ ∀ (lam : PartitionShape n), 0 ≤ lam.contentSum → IsPartitionTransitive Y lam All goals completed! 🐙
#176
Hopf–Rinow theorem
hopf_rinow

Verso theorem preview

theorem declaration uses `sorry`hopf_rinow {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] {H : Type*} [TopologicalSpace H] (I : ModelWithCorners ℝ E H) [I.Boundaryless] (M : Type*) [EMetricSpace M] [ChartedSpace H M] [IsManifold I ∞ M] [Bundle.RiemannianBundle (fun x : M => TangentSpace I x)] [IsContMDiffRiemannianBundle I ∞ E (fun x : M => TangentSpace I x)] [IsContinuousRiemannianBundle E (fun x : M => TangentSpace I x)] [IsRiemannianManifold I M] [LocallyCompactSpace M] [ConnectedSpace M] : LeanEval.Geometry.IsGeodesicallyComplete M ↔ CompleteSpace M := E:Type u_1inst✝¹³:NormedAddCommGroup Einst✝¹²:NormedSpace ℝ Einst✝¹¹:FiniteDimensional ℝ EH:Type u_2inst✝¹⁰:TopologicalSpace HI:ModelWithCorners ℝ E Hinst✝⁹:I.BoundarylessM:Type u_3inst✝⁸:EMetricSpace Minst✝⁷:ChartedSpace H Minst✝⁶:IsManifold I ∞ Minst✝⁵:RiemannianBundle fun x => TangentSpace I xinst✝⁴:IsContMDiffRiemannianBundle I ∞ E fun x => TangentSpace I xinst✝³:IsContinuousRiemannianBundle E fun x => TangentSpace I xinst✝²:IsRiemannianManifold I Minst✝¹:LocallyCompactSpace Minst✝:ConnectedSpace M⊢ IsGeodesicallyComplete M ↔ CompleteSpace M All goals completed! 🐙
#177
Liouville–Arnold theorem on integrable systems
liouville_arnold

Verso theorem preview

theorem declaration uses `sorry`liouville_arnold {n : ℕ} (F : Fin n → LeanEval.Geometry.LiouvilleArnold.E n → ℝ) (U : Set (LeanEval.Geometry.LiouvilleArnold.E n)) (_hU : IsOpen U) (_hLI : LeanEval.Geometry.LiouvilleArnold.IsLiouvilleIntegrable F U) (c : Fin n → ℝ) (_hMc_sub : LeanEval.Geometry.LiouvilleArnold.levelSet F c ⊆ U) (_hMc_compact : IsCompact (LeanEval.Geometry.LiouvilleArnold.levelSet F c)) (_hMc_connected : IsConnected (LeanEval.Geometry.LiouvilleArnold.levelSet F c)) : Nonempty ((LeanEval.Geometry.LiouvilleArnold.levelSet F c) ≃ₜ (Fin n → AddCircle (1 : ℝ))) := n:ℕF:Fin n → E n → ℝU:Set (E n)_hU:IsOpen U_hLI:IsLiouvilleIntegrable F Uc:Fin n → ℝ_hMc_sub:levelSet F c ⊆ U_hMc_compact:IsCompact (levelSet F c)_hMc_connected:IsConnected (levelSet F c)⊢ Nonempty (↑(levelSet F c) ≃ₜ (Fin n → AddCircle 1)) All goals completed! 🐙
#178
Mountain Pass Theorem (Ambrosetti–Rabinowitz 1973)
mountain_pass

Verso theorem preview

theorem declaration uses `sorry`mountain_pass (f : E → ℝ) (_hf : ContDiff ℝ 1 f) (_hps : LeanEval.Analysis.MountainPassProblem.PalaisSmale f) {a b : E} {ε r : ℝ} (_hmr : LeanEval.Analysis.MountainPassProblem.MountainRange f a b ε r) : ∃ x : E, LeanEval.Analysis.MountainPassProblem.IsCriticalPoint f x ∧ f x = mountainPassLevel f a b ∧ ε ≤ mountainPassLevel f a b := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:CompleteSpace Ef:E → ℝ_hf:ContDiff ℝ 1 f_hps:PalaisSmale fa:Eb:Eε:ℝr:ℝ_hmr:MountainRange f a b ε r⊢ ∃ x, IsCriticalPoint f x ∧ f x = mountainPassLevel f a b ∧ ε ≤ mountainPassLevel f a b All goals completed! 🐙
#179
Boone–Higman theorem (easy direction)
boone_higman_embedding

Verso theorem preview

theorem declaration uses `sorry`boone_higman_embedding {G H K : Type*} [Group G] [Group H] [Group K] [IsSimpleGroup H] [Group.IsFinitelyPresented K] (f : G →* H) (hf : Function.Injective f) (g : H →* K) (hg : Function.Injective g) {n : ℕ} (φ : FreeGroup (Fin n) →* G) (hsurj : Function.Surjective φ) (hker : (MonoidHom.ker φ).IsFinitelyNormallyGenerated) : LeanEval.GroupTheory.BooneHigmanEmbedding.WordProblemSolvable φ := G:Type u_1H:Type u_2K:Type u_3inst✝⁴:Group Ginst✝³:Group Hinst✝²:Group Kinst✝¹:IsSimpleGroup Hinst✝:Group.IsFinitelyPresented Kf:G →* Hhf:Function.Injective ⇑fg:H →* Khg:Function.Injective ⇑gn:ℕφ:FreeGroup (Fin n) →* Ghsurj:Function.Surjective ⇑φhker:φ.ker.IsFinitelyNormallyGenerated⊢ WordProblemSolvable φ All goals completed! 🐙
#180
Pascal's theorem
pascal

Lean theorem statement

/-- **Pascal's theorem.** Six distinct points on a non-singular conic determine
three collinear intersection points `Aᵢ Bⱼ ∩ Aⱼ Bᵢ`. -/
theorem pascal
    (M : Matrix (Fin 3) (Fin 3) ℝ) (hMsymm : M.IsSymm) (hMdet : M.det ≠ 0)
    (a₁ a₂ a₃ b₁ b₂ b₃ : Fin 3 → ℝ)
    (ha₁ : a₁ ≠ 0) (ha₂ : a₂ ≠ 0) (ha₃ : a₃ ≠ 0)
    (hb₁ : b₁ ≠ 0) (hb₂ : b₂ ≠ 0) (hb₃ : b₃ ≠ 0)
    (hdist : [a₁, a₂, a₃, b₁, b₂, b₃].Pairwise (fun v w => ¬ SamePoint v w))
    (hA₁ : OnConic M a₁) (hA₂ : OnConic M a₂) (hA₃ : OnConic M a₃)
    (hB₁ : OnConic M b₁) (hB₂ : OnConic M b₂) (hB₃ : OnConic M b₃) :
    Collinear3 (meet a₁ b₂ a₂ b₁) (meet a₁ b₃ a₃ b₁) (meet a₂ b₃ a₃ b₂) := by
  sorry
#181
Szemerédi's theorem
szemeredi

Verso theorem preview

theorem declaration uses `sorry`szemeredi (A : Set ℕ) (h : 0 < upperDensity A) : LeanEval.Combinatorics.ContainsArbitraryAPs A := A:Set ℕh:0 < upperDensity A⊢ ContainsArbitraryAPs A All goals completed! 🐙
#182
Equiangular lines with a fixed angle
annals_equiangular_lines_fixed_angle

Verso theorem preview

theorem declaration uses `sorry`theorem_1_2 (α : ℝ) (hα : α ∈ Set.Ioo 0 1) : let k := spectralRadiusOrder ((1 - α) / (2 * α)) (k < ⊤ → ∀ᶠ d in atTop, N α d = ⌊(k.toNat * (d - 1) : ℝ) / (k.toNat - 1 : ℝ)⌋₊) ∧ (k = ⊤ → ∃ e : ℕ → ℝ, e =o[atTop] (Nat.cast : ℕ → ℝ) ∧ ∀ d, N α d = d + e d) := α:ℝhα:α ∈ Set.Ioo 0 1⊢ let k := spectralRadiusOrder ((1 - α) / (2 * α)); (k < ⊤ → ∀ᶠ (d : ℕ) in atTop, N α d = ⌊↑k.toNat * (↑d - 1) / (↑k.toNat - 1)⌋₊) ∧ (k = ⊤ → ∃ e, e =o[atTop] Nat.cast ∧ ∀ (d : ℕ), ↑(N α d) = ↑d + e d) All goals completed! 🐙
#183
Rademacher type and Enflo type coincide
annals_rademacher_enflo_type

Verso theorem preview

theorem declaration uses `sorry`theorem_1_1 (p : ℝ) (h1p : 1 ≤ p) (hp2 : p ≤ 2) : TR X p ≤ TE X p ∧ TE X p ≤ (pi / sqrt 2) * TR X p := X:Type u_2inst✝²:NormedAddCommGroup Xinst✝¹:NormedSpace ℝ Xinst✝:CompleteSpace Xp:ℝh1p:1 ≤ php2:p ≤ 2⊢ TR X p ≤ TE X p ∧ TE X p ≤ ↑pi / ↑(sqrt 2) * TR X p All goals completed! 🐙
#184
Choquet's representation theorem
choquet_representation_theorem

Verso theorem preview

theorem declaration uses `sorry`choquet [MeasurableSpace X] [BorelSpace X] (K : Set X) (hK_cpt : IsCompact K) (hK_cvx : Convex ℝ K) {x : X} (hx : x ∈ K) : ∃ μ : Measure X, IsProbabilityMeasure μ ∧ μ (K.extremePoints ℝ)ᶜ = 0 ∧ x = ∫ y, y ∂μ := X:Type u_1inst✝⁴:NormedAddCommGroup Xinst✝³:NormedSpace ℝ Xinst✝²:CompleteSpace Xinst✝¹:MeasurableSpace Xinst✝:BorelSpace XK:Set XhK_cpt:IsCompact KhK_cvx:Convex ℝ Kx:Xhx:x ∈ K⊢ ∃ μ, IsProbabilityMeasure μ ∧ μ (Set.extremePoints ℝ K)ᶜ = 0 ∧ x = ∫ (y : X), y ∂μ All goals completed! 🐙
#185
Frobenius's theorem: the Frobenius kernel is normal
frobenius_kernel_isNormal

Verso theorem preview

theorem declaration uses `sorry`frobenius_kernel_isNormal (G X : Type) [Group G] [Fintype G] [Fintype X] [MulAction G X] [FaithfulSMul G X] (hcard : 2 ≤ Fintype.card X) (htrans : ∀ x y : X, ∃ g : G, g • x = y) (hstab : ∀ x : X, MulAction.stabilizer G x ≠ ⊥) (hfrob : ∀ g : G, g ≠ 1 → ∀ x y : X, g • x = x → g • y = y → x = y) : ∃ N : Subgroup G, N.Normal ∧ (N : Set G) = {1} ∪ {g : G | ∀ x : X, g • x ≠ x} := G:TypeX:Typeinst✝⁴:Group Ginst✝³:Fintype Ginst✝²:Fintype Xinst✝¹:MulAction G Xinst✝:FaithfulSMul G Xhcard:2 ≤ Fintype.card Xhtrans:∀ (x y : X), ∃ g, g • x = yhstab:∀ (x : X), MulAction.stabilizer G x ≠ ⊥hfrob:∀ (g : G), g ≠ 1 → ∀ (x y : X), g • x = x → g • y = y → x = y⊢ ∃ N, N.Normal ∧ ↑N = {1} ∪ {g | ∀ (x : X), g • x ≠ x} All goals completed! 🐙
#186
Kirk's normal-structure fixed point theorem
kirk_normal_structure

Verso theorem preview

theorem declaration uses `sorry`kirk_normal_structure [CompleteSpace E] (hE_reflexive : Function.Surjective (NormedSpace.inclusionInDoubleDual ℝ E)) (K : Set E) (hK_nonempty : K.Nonempty) (hK_closed : IsClosed K) (hK_bounded : Bornology.IsBounded K) (hK_convex : Convex ℝ K) (hK_normal : LeanEval.Topology.KirkNormalStructure.HasNormalStructure K) (T : K → K) (hT : LeanEval.Topology.KirkNormalStructure.IsNonexpansiveSelfMap K T) : ∃ x : K, IsFixedPt T x := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:CompleteSpace EhE_reflexive:Surjective ⇑(NormedSpace.inclusionInDoubleDual ℝ E)K:Set EhK_nonempty:K.NonemptyhK_closed:IsClosed KhK_bounded:Bornology.IsBounded KhK_convex:Convex ℝ KhK_normal:HasNormalStructure KT:↑K → ↑KhT:IsNonexpansiveSelfMap K T⊢ ∃ x, IsFixedPt T x All goals completed! 🐙
#187
Wiener–Lévy theorem
wiener_levy_analytic_calculus

Lean theorem statement

/-- **Wiener–Lévy theorem.** If `φ` is complex-analytic on a neighbourhood of
the range of a Wiener-algebra function `f`, then the composed function
`φ ∘ f` is again in the Wiener algebra. -/
theorem wiener_levy_analytic_calculus (f : C(AddCircle T, ℂ))
    (φ : ℂ → ℂ) (U : Set ℂ) (hf : InWienerAlgebra f)
    (hU : IsOpen U) (hrange : range f ⊆ U)
    (hφ : AnalyticOnNhd ℂ φ U) :
    ∃ g : C(AddCircle T, ℂ),
      (∀ x, g x = φ (f x)) ∧ InWienerAlgebra g := by
  sorry
#188
The Hausdorff positivity (complete-monotonicity) criterion
hausdorff_positivity_criterion

Lean theorem statement

/-- **Hausdorff positivity criterion** (Hausdorff 1921). A moment configuration
comes from a positive measure iff all its iterated backward differences are
nonnegative — i.e. the sequence is *completely monotone*: `(Δᵏa)ₙ ≥ 0` for all
`k ≤ n`. -/
theorem hausdorff_positivity {d : ℕ} (a : (Fin d → ℕ) → ℝ) :
    IsPositiveMomentConfiguration a ↔ ∀ k n : Fin d → ℕ, k ≤ n → 0 ≤ diff a k n := by
  sorry
#189
The Lindemann–Weierstrass theorem
lindemann_weierstrass

Lean theorem statement

/-- **Lindemann–Weierstrass theorem.** If `x₁, …, xₙ ∈ ℂ` are algebraic over `ℚ`
and ℚ-linearly independent, then `e^{x₁}, …, e^{xₙ}` are algebraically
independent over `ℚ`. -/
theorem lindemann_weierstrass {n : ℕ} (x : Fin n → ℂ)
    (h_alg : ∀ i, IsAlgebraic ℚ (x i))
    (h_lin : LinearIndependent ℚ x) :
    AlgebraicIndependent ℚ (fun i => Complex.exp (x i)) := by
  sorry
#190
Sard's regular-value corollary
regular_value_ae

Lean theorem statement

/-- **Regular value corollary (Sard).** For a smooth `f : ℝᵐ → ℝ`, almost every
`c ∈ ℝ` is a regular value. -/
theorem regular_value_ae {m : ℕ} (f : EuclideanSpace ℝ (Fin m) → ℝ)
    (hf : ContDiff ℝ ∞ f) :
    ∀ᵐ c ∂(volume : Measure ℝ), IsRegularValue f c := by
  sorry
#191
Wiener's 1/f theorem
wiener_inverse_closed

Lean theorem statement

/-- **Wiener's `1/f` theorem.** If a function on the circle belongs to the
Wiener algebra and has no zero on the circle, then its pointwise reciprocal
again belongs to the Wiener algebra. -/
theorem wiener_inverse_closed (f : C(AddCircle T, ℂ))
    (hf : InWienerAlgebra f) (hzero : ∀ x, f x ≠ 0) :
    ∃ g : C(AddCircle T, ℂ),
      (∀ x, g x = (f x)⁻¹) ∧ InWienerAlgebra g := by
  sorry
#192
Thresholds versus fractional expectation-thresholds
annals_fractional_expectation_thresholds

Verso theorem preview

/-- The constant `K` in Theorem 1.1. -/ noncomputable def declaration uses `sorry`K : ℝ := sorry
/-- Statement of Theorem 1.1: There exists a universal constant `K` such that for any finite set `X` and any increasing collection of sets `𝓕` such that `l(𝓕)` is at least `2`, `p_c(𝓕) ≤ K * q_f(𝓕) * log l(𝓕)`. Note: The assumption that `l(𝓕)` is at least `2` is not explicitly in the paper but is needed because if `l(𝓕) = 1` then `Real.log (l 𝓕) = 0`, but `p_c 𝓕 ∈ (0,1)` (so the inequality clearly cannot hold). -/ theorem declaration uses `sorry`theorem_1_1 (X : Type*) [Fintype X] (𝓕 : Set (Set X)) (h𝓕 : IsUpperSet 𝓕) (hl𝓕 : 2 ≤ l 𝓕) : p_c 𝓕 ≤ K * q_f 𝓕 * Real.log (l 𝓕) := X:Type u_1inst✝:Fintype X𝓕:Set (Set X)h𝓕:IsUpperSet 𝓕hl𝓕:2 ≤ l 𝓕⊢ ↑(p_c 𝓕) ≤ K * ↑(q_f 𝓕) * Real.log ↑(l 𝓕) All goals completed! 🐙
#193
Halmos's generic weak-mixing theorem
halmos_generic_weak_mixing

Verso theorem preview

theorem declaration uses `sorry`generic_weakly_mixing [StandardBorelSpace X] (m : Measure X) [IsProbabilityMeasure m] [NullSingletonClass m] : (∃ G : Set (LeanEval.Dynamics.HalmosGenericWeakMixingProblem.Automorphism m), IsGδ G ∧ Dense G ∧ ∀ T ∈ G, LeanEval.Dynamics.HalmosGenericWeakMixingProblem.IsWeaklyMixing m T) ∧ (∀ T : LeanEval.Dynamics.HalmosGenericWeakMixingProblem.Automorphism m, LeanEval.Dynamics.HalmosGenericWeakMixingProblem.IsWeaklyMixing m T → Ergodic (T.toEquiv : X → X) m) := X:Type u_1inst✝³:MeasurableSpace Xinst✝²:StandardBorelSpace Xm:Measure Xinst✝¹:IsProbabilityMeasure minst✝:NullSingletonClass m⊢ (∃ G, IsGδ G ∧ Dense G ∧ ∀ T ∈ G, IsWeaklyMixing m T) ∧ ∀ (T : Automorphism m), IsWeaklyMixing m T → Ergodic (⇑T.toEquiv) m All goals completed! 🐙
#194
Fundamental theorem of Riemannian geometry (Levi-Civita)
levi_civita_exists_unique

Lean theorem statement

/-- **Fundamental theorem of Riemannian geometry** (Levi-Civita). On a
`C^∞` finite-dimensional Riemannian manifold there exists a smooth
torsion-free metric-compatible covariant derivative on `TM`, and any other
such connection agrees with it on smooth vector fields. -/
theorem levi_civita_exists_unique
    {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E]
      [FiniteDimensional ℝ E] [CompleteSpace E]
    {H : Type*} [TopologicalSpace H] {I : ModelWithCorners ℝ E H}
    {M : Type*} [TopologicalSpace M] [T2Space M] [ChartedSpace H M]
      [IsManifold I ∞ M]
    [RiemannianBundle (fun (x : M) ↦ TangentSpace I x)]
    [IsContMDiffRiemannianBundle I ∞ E (fun (x : M) ↦ TangentSpace I x)] :
    ∃ cov : CovariantDerivative I E (TangentSpace I (M := M)),
      (ContMDiffCovariantDerivative cov ∞ ∧
        cov.torsion = 0 ∧ IsMetricCompatible cov) ∧
      ∀ cov' : CovariantDerivative I E (TangentSpace I (M := M)),
        (ContMDiffCovariantDerivative cov' ∞ ∧
          cov'.torsion = 0 ∧ IsMetricCompatible cov') →
        SameOnSmooth cov cov' := by
  sorry
#195
Shannon capacity of the pentagon
shannon_capacity_pentagon

Lean theorem statement

/-- **Lovász's theorem on Shannon capacity of the pentagon** (§238).
The Shannon capacity of the five-cycle is `√5`. -/
theorem shannon_capacity_pentagon :
    HasShannonCapacity (SimpleGraph.cycleGraph 5) (Real.sqrt 5) := by
  sorry
#196
Frobenius determinant theorem
frobenius_group_determinant

Verso theorem preview

theorem declaration uses `sorry`frobenius_group_determinant (G : Type*) [Group G] [Fintype G] [DecidableEq G] : ∃ (r : ℕ) (p : Fin r → MvPolynomial G ℂ), r = Nat.card (ConjClasses G) ∧ (∀ j, Irreducible (p j)) ∧ (∀ i j, i ≠ j → ¬ Associated (p i) (p j)) ∧ groupDeterminant G = ∏ j, (p j) ^ (p j).totalDegree := G:Type u_1inst✝²:Group Ginst✝¹:Fintype Ginst✝:DecidableEq G⊢ ∃ r p, r = Nat.card (ConjClasses G) ∧ (∀ (j : Fin r), Irreducible (p j)) ∧ (∀ (i j : Fin r), i ≠ j → ¬Associated (p i) (p j)) ∧ groupDeterminant G = ∏ j, p j ^ (p j).totalDegree All goals completed! 🐙
#197
Lindemann's theorem (e and π transcendental)
lindemann

Lean theorem statement

/-- **Lindemann's theorem.** Both `e = exp 1` and `π` are transcendental over
`ℤ`. -/
theorem lindemann :
    Transcendental ℤ (Real.exp 1) ∧ Transcendental ℤ Real.pi := by
  sorry
#198
Independence of the parallel postulate
parallel_postulate_independent

Verso theorem preview

theorem declaration uses `sorry`parallel_postulate_independent : (∃ (M : Type) (T : LeanEval.Geometry.TarskiAbsolute M), LeanEval.Geometry.Euclidean M T) ∧ (∃ (M : Type) (T : LeanEval.Geometry.TarskiAbsolute M), ¬ LeanEval.Geometry.Euclidean M T) := ⊢ (∃ M T, Euclidean M T) ∧ ∃ M T, ¬Euclidean M T All goals completed! 🐙
#199
Hausdorff moment problem: absolute-continuity criterion
hausdorff_absolute_continuity

Verso theorem preview

theorem declaration uses `sorry`hausdorff_absolute_continuity {d : ℕ} (μ : Measure (EuclideanSpace ℝ (Fin d))) [IsProbabilityMeasure μ] (hμ : μ ((LeanEval.Analysis.HausdorffAbsoluteContinuity.cube d)ᶜ) = 0) : LeanEval.Analysis.HausdorffAbsoluteContinuity.UniformlyAbsolutelyContinuous μ (volume.restrict (LeanEval.Analysis.HausdorffAbsoluteContinuity.cube d)) ↔ ∃ C : ℝ, ∀ k n : Fin d → ℕ, k ≤ n → diff (momentOf μ) k n ≤ C * diff (momentOf (volume.restrict (LeanEval.Analysis.HausdorffAbsoluteContinuity.cube d))) k n := d:ℕμ:Measure (EuclideanSpace ℝ (Fin d))inst✝:IsProbabilityMeasure μhμ:μ (cube d)ᶜ = 0⊢ UniformlyAbsolutelyContinuous μ (volume.restrict (cube d)) ↔ ∃ C, ∀ (k n : Fin d → ℕ), k ≤ n → diff (momentOf μ) k n ≤ C * diff (momentOf (volume.restrict (cube d))) k n All goals completed! 🐙
#200
The Hausdorff–Hildebrandt–Schoenberg moment theorem
hausdorff_hildebrandt_schoenberg

Verso theorem preview

theorem declaration uses `sorry`hausdorff_hildebrandt_schoenberg {d : ℕ} (a : (Fin d → ℕ) → ℝ) : LeanEval.Analysis.IsMomentConfiguration a ↔ LeanEval.Analysis.HausdorffBounded a := d:ℕa:(Fin d → ℕ) → ℝ⊢ IsMomentConfiguration a ↔ HausdorffBounded a All goals completed! 🐙
#201
Chudnovsky formula for pi inverse
chudnovsky_formula_for_pi_inv

Verso theorem preview

theorem declaration uses `sorry`chudnovsky_formula_for_pi_inv : chudnovskySum = π⁻¹ := ⊢ chudnovskySum = π⁻¹ All goals completed! 🐙
#202
Hippocrates' theorem on lunes
hippocrates_lunes

Verso theorem preview

theorem declaration uses `sorry`hippocrates_lunes (a b : ℝ) (ha : 0 < a) (hb : 0 < b) : volume (LeanEval.Geometry.HippocratesLunes.horizontalLune a b) + volume (LeanEval.Geometry.HippocratesLunes.verticalLune a b) = volume (LeanEval.Geometry.HippocratesLunes.rightTriangle a b) := a:ℝb:ℝha:0 < ahb:0 < b⊢ volume (horizontalLune a b) + volume (verticalLune a b) = volume (rightTriangle a b) All goals completed! 🐙
#203
Solvable extensions ↔ solvable groups (the missing converse in Abel–Ruffini)
solvable_by_radicals_converse

Lean theorem statement

/-- **Solvable extensions ↔ solvable groups.** For a field `F` of
characteristic zero and a nonzero `p : F[X]`, every root of `p` in
`AlgebraicClosure F` lies in `solvableByRad F (AlgebraicClosure F)`
iff `p.Gal` is solvable. -/
theorem solvable_iff_solvableByRad (F : Type*) [Field F] [CharZero F]
    (p : F[X]) (_hp : p ≠ 0) :
    (∀ x : AlgebraicClosure F, aeval x p = 0 →
        x ∈ solvableByRad F (AlgebraicClosure F)) ↔ Group.IsSolvable p.Gal := by
  sorry
#204
Schur-Weyl duality: S_k image equals centralizer of GL(V) image
symAction_range_eq_centralizer_glAction

Verso theorem preview

theorem declaration uses `sorry`symAction_range_eq_centralizer_glAction {R : Type*} [Field R] {M : Type*} [AddCommGroup M] [Module R M] [FiniteDimensional R M] {k : ℕ} [Invertible (k.factorial : R)] : Algebra.adjoin R (Set.range (LeanEval.RepresentationTheory.symAction R M k)) = Subalgebra.centralizer R (Set.range (LeanEval.RepresentationTheory.glAction R M k)) := R:Type u_1inst✝⁴:Field RM:Type u_2inst✝³:AddCommGroup Minst✝²:Module R Minst✝¹:FiniteDimensional R Mk:ℕinst✝:Invertible ↑k.factorial⊢ Algebra.adjoin R (Set.range ⇑(symAction R M k)) = Subalgebra.centralizer R (Set.range ⇑(glAction R M k)) All goals completed! 🐙
#205
Sturm's theorem
sturm

Lean theorem statement

/-- **Sturm's theorem.** For a squarefree real polynomial `p` and an interval
`(a, b)` with `a < b` whose endpoints are not roots of `p`, the number of
distinct roots of `p` in `(a, b)` equals `σ(a) − σ(b)`. -/
theorem sturm (p : ℝ[X]) (hp : Squarefree p) {a b : ℝ} (hab : a < b)
    (ha : p.eval a ≠ 0) (hb : p.eval b ≠ 0) :
    ((p.roots.toFinset).filter (fun x => a < x ∧ x < b)).card =
      sigma p a - sigma p b := by
  sorry
#206
Balanceable k-bounded partitions
balanceable_bounded_partitions

Lean theorem statement

/--
For any `k`, the smallest `n` such that any `k`-bounded partition of `n` is
also balanceable is given by `2 * lcm(1, ..., k)`.
-/
theorem minimal_balanceable_of_bounded (k : ℕ) (hk : 0 < k) :
    Minimal (fun n => 0 < n ∧ ∀ p : n.Partition, Bounded k p → Balanceable p) (2 * (Finset.Icc 1 k).lcm id) := by
  sorry
#207
Brauer–Fowler theorem
brauer_fowler

Lean theorem statement

/-- **Brauer–Fowler theorem.** There is a function bounding the order
of a finite nonabelian simple group by the order of any involution
centralizer. -/
theorem brauer_fowler :
    ∃ f : ℕ → ℕ, ∀ (G : Type) [Group G] [Finite G],
      IsSimpleGroup G → (∃ a b : G, a * b ≠ b * a) →
      ∀ t : G, orderOf t = 2 →
        Nat.card G ≤ f (Nat.card (Subgroup.centralizer ({t} : Set G))) := by
  sorry
#208
Kakutani fixed-point theorem
kakutani_fixed_point

Lean theorem statement

/-- **Kakutani fixed-point theorem.** Every upper-hemicontinuous
correspondence `F` from a nonempty compact convex `K ⊆ ℝᵈ` to itself, with
nonempty convex closed values, has a fixed point `x ∈ F x`. -/
theorem kakutani_fixed_point {d : ℕ}
    {K : Set (EuclideanSpace ℝ (Fin d))}
    (_hK_compact : IsCompact K) (_hK_convex : Convex ℝ K)
    (_hK_nonempty : K.Nonempty)
    (F : EuclideanSpace ℝ (Fin d) → Set (EuclideanSpace ℝ (Fin d)))
    (_hF_uhc : IsUpperHemicontinuous F)
    (_hF_nonempty : ∀ x ∈ K, (F x).Nonempty)
    (_hF_convex : ∀ x ∈ K, Convex ℝ (F x))
    (_hF_closed : ∀ x ∈ K, IsClosed (F x))
    (_hF_maps : ∀ x ∈ K, F x ⊆ K) :
    ∃ x ∈ K, x ∈ F x := by
  sorry
#209
Lidskii–Last eigenvalue-perturbation theorem
lidskii_last

Verso theorem preview

theorem declaration uses `sorry`lidskii_last {n : Type*} [Fintype n] [DecidableEq n] {A B : Matrix n n ℂ} (hA : A.IsHermitian) (hB : B.IsHermitian) : ∑ j, |hA.eigenvalues₀ j - hB.eigenvalues₀ j| ≤ ∑ i, ∑ j, ‖A i j - B i j‖ := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℂB:Matrix n n ℂhA:A.IsHermitianhB:B.IsHermitian⊢ ∑ j, |hA.eigenvalues₀ j - hB.eigenvalues₀ j| ≤ ∑ i, ∑ j, ‖A i j - B i j‖ All goals completed! 🐙
#210
A competition programming problem about permuting a permutation to be unimodal
permute_to_unimodal

Lean theorem statement

/--
`minRearrange` correctly computes the smallest number of indices that need to be permuted in order to
turn `arr` into a unimodal permutation.
-/
theorem minRearrange_correct {arr : Array Nat} :
    arr.Perm (1...=arr.size).toArray →
      (∃ (x : Array Nat) (hx : x.Perm (1...=arr.size).toArray), Unimodal x ∧ differences (Vector.mk x (by simpa using hx.size_eq)) arr.toVector = minRearrange arr) ∧
      (∀ (x : Array Nat) (hx : x.Perm (1...=arr.size).toArray), Unimodal x → minRearrange arr ≤ differences (Vector.mk x (by simpa using hx.size_eq)) arr.toVector) := by
  sorry
#211
Jordan normal form
jordan_normal_form

Lean theorem statement

/-- **Jordan normal form.** Over an algebraically closed field, every
endomorphism of `Kⁿ` admits a Jordan-chain basis. -/
theorem jordan_normal_form {K : Type*} [Field K] [IsAlgClosed K] (n : ℕ)
    (f : Module.End K (StdSpace K n)) :
    Nonempty (JordanChainBasis f) := by
  sorry
#212
Nash equilibrium existence theorem
nash_equilibrium_exists

Lean theorem statement

/-- **Nash equilibrium existence theorem.** Every finite `n`-player game
with nonempty finite pure-strategy sets and arbitrary real payoffs admits
at least one mixed-strategy Nash equilibrium. -/
theorem nash_equilibrium_exists {n : ℕ} {S : Fin n → Type*}
    [∀ i, Fintype (S i)] [∀ i, Nonempty (S i)]
    (u : Fin n → StrategyProfile n S → ℝ) :
    ∃ σ : ∀ i, S i → ℝ, IsNashEquilibrium u σ := by
  sorry
#213
Peano existence theorem for ODEs
peano_existence

Verso theorem preview

theorem declaration uses `sorry`peano_existence {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] {f : E → E} (hf : Continuous f) (x₀ : E) : ∃ a : ℝ, 0 < a ∧ ∃ α : ℝ → E, α 0 = x₀ ∧ ∀ t ∈ Ioo (-a) a, HasDerivAt α (f (α t)) t := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:FiniteDimensional ℝ Ef:E → Ehf:Continuous fx₀:E⊢ ∃ a, 0 < a ∧ ∃ α, α 0 = x₀ ∧ ∀ t ∈ Ioo (-a) a, HasDerivAt α (f (α t)) t All goals completed! 🐙
#214
Furstenberg–Weiss topological multiple recurrence (single-transformation form)
furstenberg_topological

Lean theorem statement

/-- **Furstenberg–Weiss topological multiple recurrence** (single-
transformation form). Every homeomorphism `T` of a nonempty compact
metric space `X` has a multiply recurrent point. -/
theorem furstenberg_topological_recurrence {X : Type*} [MetricSpace X]
    [CompactSpace X] [Nonempty X] (T : X ≃ₜ X) :
    ∃ x : X, IsMultiplyRecurrent (T : X → X) x := by
  sorry
#215
Baer–Suzuki theorem
baer_suzuki

Verso theorem preview

theorem declaration uses `sorry`baer_suzuki {G : Type*} [Group G] [Finite G] {p : ℕ} [Fact p.Prime] (x : G) : x ∈ LeanEval.GroupTheory.Defs.pCore p G ↔ ∀ g : G, IsPGroup p (Subgroup.closure ({x, g * x * g⁻¹} : Set G)) := G:Type u_1inst✝²:Group Ginst✝¹:Finite Gp:ℕinst✝:Fact (Nat.Prime p)x:G⊢ x ∈ pCore p G ↔ ∀ (g : G), IsPGroup p ↥(Subgroup.closure {x, g * x * g⁻¹}) All goals completed! 🐙
#216
Sard's theorem (critical-set image has measure zero)
sard_theorem

Verso theorem preview

theorem declaration uses `sorry`sard {m n : ℕ} (f : LeanEval.Geometry.SardTheoremProblem.E m → LeanEval.Geometry.SardTheoremProblem.E n) (_hf : ContDiff ℝ ∞ f) : volume (LeanEval.Geometry.SardTheoremProblem.criticalValues f) = 0 := m:ℕn:ℕf:E m → E n_hf:ContDiff ℝ ∞ f⊢ volume (criticalValues f) = 0 All goals completed! 🐙
#217
Complete reducibility for compact groups
compact_group_semisimple

Verso theorem preview

theorem declaration uses `sorry`compact_group_semisimple {G V : Type*} [Group G] [TopologicalSpace G] [IsTopologicalGroup G] [CompactSpace G] [NormedAddCommGroup V] [NormedSpace ℝ V] [FiniteDimensional ℝ V] (ρ : Representation ℝ G V) (hρ : Continuous fun p : G × V => ρ p.1 p.2) : ρ.IsSemisimpleRepresentation := G:Type u_1V:Type u_2inst✝⁶:Group Ginst✝⁵:TopologicalSpace Ginst✝⁴:IsTopologicalGroup Ginst✝³:CompactSpace Ginst✝²:NormedAddCommGroup Vinst✝¹:NormedSpace ℝ Vinst✝:FiniteDimensional ℝ Vρ:Representation ℝ G Vhρ:Continuous fun p => (ρ p.1) p.2⊢ ρ.IsSemisimpleRepresentation All goals completed! 🐙
#218
Monge–Kantorovich existence theorem
monge_kantorovich

Verso theorem preview

theorem declaration uses `sorry`monge_kantorovich_exists {X Y : Type*} [TopologicalSpace X] [PolishSpace X] [MeasurableSpace X] [BorelSpace X] [TopologicalSpace Y] [PolishSpace Y] [MeasurableSpace Y] [BorelSpace Y] (P : Measure X) (Q : Measure Y) [IsProbabilityMeasure P] [IsProbabilityMeasure Q] (c : X × Y → ENNReal) (_hc : Continuous c) : ∃ π ∈ LeanEval.Analysis.Couplings P Q, ∀ π' ∈ LeanEval.Analysis.Couplings P Q, kantorovichCost c π ≤ kantorovichCost c π' := X:Type u_1Y:Type u_2inst✝⁹:TopologicalSpace Xinst✝⁸:PolishSpace Xinst✝⁷:MeasurableSpace Xinst✝⁶:BorelSpace Xinst✝⁵:TopologicalSpace Yinst✝⁴:PolishSpace Yinst✝³:MeasurableSpace Yinst✝²:BorelSpace YP:Measure XQ:Measure Yinst✝¹:IsProbabilityMeasure Pinst✝:IsProbabilityMeasure Qc:X × Y → ENNReal_hc:Continuous c⊢ ∃ π ∈ Couplings P Q, ∀ π' ∈ Couplings P Q, kantorovichCost c π ≤ kantorovichCost c π' All goals completed! 🐙
#219
Schauder fixed-point theorem
schauder_fixed_point

Verso theorem preview

theorem declaration uses `sorry`schauder_fixed_point {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [CompleteSpace E] {K : Set E} (_hK_compact : IsCompact K) (_hK_convex : Convex ℝ K) (_hK_nonempty : K.Nonempty) (f : E → E) (_hf_cont : ContinuousOn f K) (_hf_maps : Set.MapsTo f K K) : ∃ x ∈ K, f x = x := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:CompleteSpace EK:Set E_hK_compact:IsCompact K_hK_convex:Convex ℝ K_hK_nonempty:K.Nonemptyf:E → E_hf_cont:ContinuousOn f K_hf_maps:Set.MapsTo f K K⊢ ∃ x ∈ K, f x = x All goals completed! 🐙
#220
Dimitrov's lower bound for the house of a nonzero algebraic integer that is not a root of unity
dimitrov

Verso theorem preview

theorem declaration uses `sorry`dimitrov {K : Type*} [Field K] [NumberField K] (α : K) (α_int : IsIntegral ℤ α) (α_ne_zero : α ≠ 0) (α_not_rootOfUnity : ¬ IsOfFinOrder α) : (2 : ℝ) ^ (1 / (4 * (Finset.univ.image fun σ : K →+* ℂ ↦ (σ α).arg).card) : ℝ) ≤ NumberField.house α := K:Type u_1inst✝¹:Field Kinst✝:NumberField Kα:Kα_int:IsIntegral ℤ αα_ne_zero:α ≠ 0α_not_rootOfUnity:¬IsOfFinOrder α⊢ 2 ^ (1 / (4 * ↑(Finset.image (fun σ => (σ α).arg) Finset.univ).card)) ≤ NumberField.house α All goals completed! 🐙
#221
Burnside p^a q^b theorem
finite_group_isSolvable_of_card_eq_prime_pow_mul_prime_pow

Verso theorem preview

theorem declaration uses `sorry`finite_group_isSolvable_of_card_eq_prime_pow_mul_prime_pow {G : Type*} [Group G] [Fintype G] {p q a b : ℕ} (hp : Nat.Prime p) (hq : Nat.Prime q) (hpq : p ≠ q) (hcard : Fintype.card G = p ^ a * q ^ b) : Group.IsSolvable G := G:Type u_1inst✝¹:Group Ginst✝:Fintype Gp:ℕq:ℕa:ℕb:ℕhp:Nat.Prime phq:Nat.Prime qhpq:p ≠ qhcard:Fintype.card G = p ^ a * q ^ b⊢ Group.IsSolvable G All goals completed! 🐙
#222
Riesz's rising sun lemma
rising_sun_lemma

Verso theorem preview

theorem declaration uses `sorry`rising_sun_lemma {a b : ℝ} (hab : a < b) {f : ℝ → ℝ} (hf : ContinuousOn f (Icc a b)) : LeanEval.Analysis.RisingSun.HasRisingSunProperty a b f := a:ℝb:ℝhab:a < bf:ℝ → ℝhf:ContinuousOn f (Icc a b)⊢ HasRisingSunProperty a b f All goals completed! 🐙
#223
Existence of a non-isotopic pair of oriented two-component links
exists_nonisotopic_link

Verso theorem preview

theorem declaration uses `sorry`exists_nonisotopic_link : ∃ L₁ L₂ : LeanEval.KnotTheory.TwoLink, ¬ L₁.Isotopic L₂ := ⊢ ∃ L₁ L₂, ¬L₁.Isotopic L₂ All goals completed! 🐙
#224
Pointwise and Cesàro convergence of Fourier series (Dirichlet, Fejér)
fourier_dirichlet_fejer

Verso theorem preview

/-- **Dirichlet's pointwise convergence theorem** (§46). For every `C¹` 2π-periodic complex function `f`, the symmetric Fourier partial sums `S_N(f)(x)` converge to `f(x)` at every point `x ∈ ℝ`. -/ theorem declaration uses `sorry`dirichlet_pointwise {f : ℝ → ℂ} (_hperiod : Function.Periodic f (2 * Real.pi)) (_hC1 : ContDiff ℝ 1 f) (x : ℝ) : Tendsto (fun N : ℕ => fourierPartialSum f N x) atTop (𝓝 (f x)) := f:ℝ → ℂ_hperiod:Function.Periodic f (2 * Real.pi)_hC1:ContDiff ℝ 1 fx:ℝ⊢ Tendsto (fun N => fourierPartialSum f N x) atTop (𝓝 (f x)) All goals completed! 🐙
/-- **Fejér's theorem** (§46). For every *continuous* 2π-periodic complex function `f` — without the `C¹` hypothesis of Dirichlet's theorem — the Cesàro means `σ_N(f)` of the symmetric Fourier partial sums converge to `f` uniformly on `ℝ`. -/ theorem declaration uses `sorry`fejer {f : ℝ → ℂ} (_hperiod : Function.Periodic f (2 * Real.pi)) (_hcont : Continuous f) : TendstoUniformly (fun N : ℕ => fourierCesaroMean f N) f atTop := f:ℝ → ℂ_hperiod:Function.Periodic f (2 * Real.pi)_hcont:Continuous f⊢ TendstoUniformly (fun N => fourierCesaroMean f N) f atTop All goals completed! 🐙
#225
Schur-Weyl duality: GL(V) image equals centralizer of S_k image
glAction_range_eq_centralizer_symAction

Verso theorem preview

theorem declaration uses `sorry`glAction_range_eq_centralizer_symAction {R : Type*} [Field R] {M : Type*} [AddCommGroup M] [Module R M] [FiniteDimensional R M] {k : ℕ} [Invertible (k.factorial : R)] : Algebra.adjoin R (Set.range (LeanEval.RepresentationTheory.glAction R M k)) = Subalgebra.centralizer R (Set.range (LeanEval.RepresentationTheory.symAction R M k)) := R:Type u_1inst✝⁴:Field RM:Type u_2inst✝³:AddCommGroup Minst✝²:Module R Minst✝¹:FiniteDimensional R Mk:ℕinst✝:Invertible ↑k.factorial⊢ Algebra.adjoin R (Set.range ⇑(glAction R M k)) = Subalgebra.centralizer R (Set.range ⇑(symAction R M k)) All goals completed! 🐙
#226
Morley's trisector theorem
morley_theorem

Verso theorem preview

theorem declaration uses `sorry`morley_theorem (A B C P Q R : LeanEval.Geometry.Morley.Plane) (h : LeanEval.Geometry.Morley.IsMorleyConfiguration A B C P Q R) : LeanEval.Geometry.Morley.IsEquilateralTriple P Q R := A:PlaneB:PlaneC:PlaneP:PlaneQ:PlaneR:Planeh:IsMorleyConfiguration A B C P Q R⊢ IsEquilateralTriple P Q R All goals completed! 🐙
#227
Runge's theorem
runge_theorem

Verso theorem preview

theorem declaration uses `sorry`runge (K : Set ℂ) (_hK : IsCompact K) (U : Set ℂ) (_hU : IsOpen U) (_hKU : K ⊆ U) (f : ℂ → ℂ) (_hf : AnalyticOnNhd ℂ f U) (ε : ℝ) (_hε : 0 < ε) : ∃ p q : ℂ[X], (∀ z ∈ K, q.eval z ≠ 0) ∧ (∀ z ∈ K, ‖f z - p.eval z / q.eval z‖ < ε) := K:Set ℂ_hK:IsCompact KU:Set ℂ_hU:IsOpen U_hKU:K ⊆ Uf:ℂ → ℂ_hf:AnalyticOnNhd ℂ f Uε:ℝ_hε:0 < ε⊢ ∃ p q, (∀ z ∈ K, Polynomial.eval z q ≠ 0) ∧ ∀ z ∈ K, ‖f z - Polynomial.eval z p / Polynomial.eval z q‖ < ε All goals completed! 🐙
#228
Kuznetsov's theorem: finitely presented simple groups have solvable word problem
boone_higman_simple

Verso theorem preview

theorem declaration uses `sorry`boone_higman_simple {G : Type*} [Group G] [IsSimpleGroup G] {n : ℕ} (φ : FreeGroup (Fin n) →* G) (_hsurj : Function.Surjective φ) (_hker : (MonoidHom.ker φ).IsFinitelyNormallyGenerated) : LeanEval.GroupTheory.BooneHigmanSimpleProblem.WordProblemSolvable φ := G:Type u_1inst✝¹:Group Ginst✝:IsSimpleGroup Gn:ℕφ:FreeGroup (Fin n) →* G_hsurj:Function.Surjective ⇑φ_hker:φ.ker.IsFinitelyNormallyGenerated⊢ WordProblemSolvable φ All goals completed! 🐙
#229
Euler–Lagrange equation
euler_lagrange_equation

Verso theorem preview

theorem declaration uses `sorry`euler_lagrange_equation {a b : ℝ} (L : ℝ → ℝ → ℝ → ℝ) (x : ℝ → ℝ) (_hab : a < b) (_hL : ContDiff ℝ 2 (fun p : ℝ × ℝ × ℝ => L p.1 p.2.1 p.2.2)) (_hx : ContDiff ℝ 2 x) (_hxe : LeanEval.Analysis.IsVariationalExtremum a b L x) : ∀ t ∈ Set.Ioo a b, lagrangianPartialX L x t = deriv (lagrangianPartialV L x) t := a:ℝb:ℝL:ℝ → ℝ → ℝ → ℝx:ℝ → ℝ_hab:a < b_hL:ContDiff ℝ 2 fun p => L p.1 p.2.1 p.2.2_hx:ContDiff ℝ 2 x_hxe:IsVariationalExtremum a b L x⊢ ∀ t ∈ Ioo a b, lagrangianPartialX L x t = deriv (lagrangianPartialV L x) t All goals completed! 🐙
#230
Bauer's uniqueness at extreme points
bauer_extreme_point_uniqueness

Verso theorem preview

theorem declaration uses `sorry`bauer_unique [MeasurableSpace X] [BorelSpace X] (K : Set X) (hK_cpt : IsCompact K) (hK_cvx : Convex ℝ K) {x : X} (hx : x ∈ K.extremePoints ℝ) (μ : Measure X) [IsProbabilityMeasure μ] (hμ : μ Kᶜ = 0) (hbar : x = ∫ y, y ∂μ) : μ = Measure.dirac x := X:Type u_1inst✝⁵:NormedAddCommGroup Xinst✝⁴:NormedSpace ℝ Xinst✝³:CompleteSpace Xinst✝²:MeasurableSpace Xinst✝¹:BorelSpace XK:Set XhK_cpt:IsCompact KhK_cvx:Convex ℝ Kx:Xhx:x ∈ Set.extremePoints ℝ Kμ:Measure Xinst✝:IsProbabilityMeasure μhμ:μ Kᶜ = 0hbar:x = ∫ (y : X), y ∂μ⊢ μ = Measure.dirac x All goals completed! 🐙
#231
Normal spectral theorem
normal_spectral_theorem

Verso theorem preview

theorem declaration uses `sorry`normal_spectral_theorem (A : Matrix n n ℂ) : IsStarNormal A ↔ ∃ U ∈ unitary (Matrix n n ℂ), ∃ d : n → ℂ, A = U * diagonal d * star U := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℂ⊢ IsStarNormal A ↔ ∃ U ∈ unitary (Matrix n n ℂ), ∃ d, A = U * diagonal d * star U All goals completed! 🐙
#232
von Neumann double commutant theorem
vonNeumann_doubleCommutant_tfae

Verso theorem preview

theorem declaration uses `sorry`vonNeumann_doubleCommutant_tfae {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H] (S : StarSubalgebra ℂ (H →L[ℂ] H)) : List.TFAE [ Set.centralizer (Set.centralizer (S : Set (H →L[ℂ] H))) = S , IsClosed (ContinuousLinearMapWOT.ofCLM '' (S : Set (H →L[ℂ] H))) , IsClosed (ContinuousLinearMap.toPointwiseConvergenceCLM ℂ (RingHom.id ℂ) H H '' (S : Set (H →L[ℂ] H))) ] := H:Type u_1inst✝²:NormedAddCommGroup Hinst✝¹:InnerProductSpace ℂ Hinst✝:CompleteSpace HS:StarSubalgebra ℂ (H →L[ℂ] H)⊢ [(↑S).centralizer.centralizer = ↑S, IsClosed (ContinuousLinearMapWOT.ofCLM '' ↑S), IsClosed (⇑(ContinuousLinearMap.toPointwiseConvergenceCLM ℂ (RingHom.id ℂ) H H) '' ↑S)].TFAE All goals completed! 🐙
#233
Abel–Ruffini theorem
abel_ruffini

Verso theorem preview

theorem declaration uses `sorry`abel_ruffini (n : ℕ) (_hn : 1 ≤ n) : (∀ p : ℚ[X], p.natDegree = n → ∀ x : ℂ, aeval x p = 0 → x ∈ solvableByRad ℚ ℂ) ↔ n ≤ 4 := n:ℕ_hn:1 ≤ n⊢ (∀ (p : ℚ[X]), p.natDegree = n → ∀ (x : ℂ), (aeval x) p = 0 → x ∈ solvableByRad ℚ ℂ) ↔ n ≤ 4 All goals completed! 🐙
#234
Brouwer fixed-point theorem
brouwer_fixed_point

Verso theorem preview

theorem declaration uses `sorry`brouwer_fixed_point {d : ℕ} {K : Set (EuclideanSpace ℝ (Fin d))} (_hK_compact : IsCompact K) (_hK_convex : Convex ℝ K) (_hK_nonempty : K.Nonempty) (f : EuclideanSpace ℝ (Fin d) → EuclideanSpace ℝ (Fin d)) (_hf_cont : ContinuousOn f K) (_hf_maps : MapsTo f K K) : ∃ x ∈ K, f x = x := d:ℕK:Set (EuclideanSpace ℝ (Fin d))_hK_compact:IsCompact K_hK_convex:Convex ℝ K_hK_nonempty:K.Nonemptyf:EuclideanSpace ℝ (Fin d) → EuclideanSpace ℝ (Fin d)_hf_cont:ContinuousOn f K_hf_maps:MapsTo f K K⊢ ∃ x ∈ K, f x = x All goals completed! 🐙
#235
Bing's house with two rooms is contractible
contractibleSpace_houseWithTwoRooms

Verso theorem preview

theorem declaration uses `sorry`contractibleSpace_houseWithTwoRooms : ContractibleSpace LeanEval.Topology.HouseWithTwoRooms := ⊢ ContractibleSpace ↑HouseWithTwoRooms All goals completed! 🐙
#236
Trace Cayley-Hamilton / Newton identity
trace_cayley_hamilton_newton

Verso theorem preview

theorem declaration uses `sorry`trace_cayley_hamilton_newton {R : Type*} [CommRing R] (A : Matrix n n R) {k : ℕ} (hk : 1 ≤ k) : (k : R) * charpolyDescendingCoeff A k + ∑ j ∈ Finset.Icc 1 k, trace (A ^ j) * charpolyDescendingCoeff A (k - j) = 0 := n:Type u_1inst✝²:Fintype ninst✝¹:DecidableEq nR:Type u_2inst✝:CommRing RA:Matrix n n Rk:ℕhk:1 ≤ k⊢ ↑k * charpolyDescendingCoeff A k + ∑ j ∈ Finset.Icc 1 k, (A ^ j).trace * charpolyDescendingCoeff A (k - j) = 0 All goals completed! 🐙
#237
Wiener's atom-detection formula
wiener_atom_detection

Verso theorem preview

theorem declaration uses `sorry`wiener_atom_detection (μ : Measure (AddCircle (2 * Real.pi))) [IsProbabilityMeasure μ] : Tendsto (fun N : ℕ => (1 / (N : ℝ)) * ∑ k ∈ Finset.Icc (1 : ℤ) N, ‖fourierCoeffMeasure μ k‖ ^ 2) atTop (𝓝 (∑' x : AddCircle (2 * Real.pi), ((μ {x}).toReal) ^ 2)) := μ:Measure (AddCircle (2 * π))inst✝:IsProbabilityMeasure μ⊢ Tendsto (fun N => 1 / ↑N * ∑ k ∈ Finset.Icc 1 ↑N, ‖fourierCoeffMeasure μ k‖ ^ 2) atTop (𝓝 (∑' (x : AddCircle (2 * π)), (μ {x}).toReal ^ 2)) All goals completed! 🐙
#238
Linear ODE with negative-real-part eigenvalues is asymptotically stable
linear_ode_asymptotic_stability

Verso theorem preview

theorem declaration uses `sorry`linear_ode_asymptotic_stability (n : ℕ) (A : Matrix (Fin n) (Fin n) ℝ) (hA : ∀ μ : ℂ, Module.End.HasEigenvalue (Matrix.toLin' (A.map (algebraMap ℝ ℂ))) μ → μ.re < 0) (x : ℝ → (Fin n → ℝ)) (hx : ∀ t : ℝ, 0 < t → HasDerivAt x (A.mulVec (x t)) t) : Filter.Tendsto (fun t : ℝ => ‖x t‖) Filter.atTop (nhds 0) := n:ℕA:Matrix (Fin n) (Fin n) ℝhA:∀ (μ : ℂ), Module.End.HasEigenvalue (Matrix.toLin' (A.map ⇑(algebraMap ℝ ℂ))) μ → μ.re < 0x:ℝ → Fin n → ℝhx:∀ (t : ℝ), 0 < t → HasDerivAt x (A *ᵥ x t) t⊢ Filter.Tendsto (fun t => ‖x t‖) Filter.atTop (nhds 0) All goals completed! 🐙
#239
Real cyclotomic integer with house at most 2
cyclotomic_integer_house_le_two

Verso theorem preview

theorem declaration uses `sorry`cyclotomic_integer_house_le_two {K : Type*} [Field K] [NumberField K] [Algebra ℚ K] (n : ℕ) [NeZero n] [IsCyclotomicExtension {n} ℚ K] {β : K} (hβ_int : IsIntegral ℤ β) (hβ_real : β ∈ NumberField.maximalRealSubfield K) : house β ≤ 2 → house β = 2 ∨ ∃ m : ℕ, 0 < m ∧ house β = 2 * Real.cos (Real.pi / m) := K:Type u_1inst✝⁴:Field Kinst✝³:NumberField Kinst✝²:Algebra ℚ Kn:ℕinst✝¹:NeZero ninst✝:IsCyclotomicExtension {n} ℚ Kβ:Khβ_int:IsIntegral ℤ βhβ_real:β ∈ maximalRealSubfield K⊢ house β ≤ 2 → house β = 2 ∨ ∃ m, 0 < m ∧ house β = 2 * Real.cos (Real.pi / ↑m) All goals completed! 🐙
#240
Koszul formula
koszul_formula

Verso theorem preview

theorem declaration uses `sorry`koszul_formula {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] [CompleteSpace E] {H : Type*} [TopologicalSpace H] {I : ModelWithCorners ℝ E H} {M : Type*} [TopologicalSpace M] [ChartedSpace H M] [IsManifold I ∞ M] [RiemannianBundle (fun (x : M) ↦ TangentSpace I x)] [IsContMDiffRiemannianBundle I ∞ E (fun (x : M) ↦ TangentSpace I x)] (cov : CovariantDerivative I E (TangentSpace I (M := M))) [ContMDiffCovariantDerivative cov ∞] (_htor : cov.torsion = 0) (_hmet : LeanEval.Geometry.KoszulFormula.IsMetricCompatible cov) (X Y Z : Π x : M, TangentSpace I x) (_hX : CMDiff ∞ (T% X)) (_hY : CMDiff ∞ (T% Y)) (_hZ : CMDiff ∞ (T% Z)) (x : M) : 2 * inner ℝ (cov Y x (X x)) (Z x) = mvfderiv I (fun y : M => inner ℝ (Y y) (Z y)) x (X x) + mvfderiv I (fun y : M => inner ℝ (X y) (Z y)) x (Y x) - mvfderiv I (fun y : M => inner ℝ (X y) (Y y)) x (Z x) - inner ℝ (X x) (mlieBracket I Y Z x) - inner ℝ (Y x) (mlieBracket I X Z x) + inner ℝ (Z x) (mlieBracket I X Y x) := E:Type u_1inst✝¹⁰:NormedAddCommGroup Einst✝⁹:NormedSpace ℝ Einst✝⁸:FiniteDimensional ℝ Einst✝⁷:CompleteSpace EH:Type u_2inst✝⁶:TopologicalSpace HI:ModelWithCorners ℝ E HM:Type u_3inst✝⁵:TopologicalSpace Minst✝⁴:ChartedSpace H Minst✝³:IsManifold I ∞ Minst✝²:RiemannianBundle fun x => TangentSpace I xinst✝¹:IsContMDiffRiemannianBundle I ∞ E fun x => TangentSpace I xcov:CovariantDerivative I E (TangentSpace I)inst✝:cov.ContMDiffCovariantDerivative ∞_htor:cov.torsion = 0_hmet:LeanEval.Geometry.KoszulFormula.IsMetricCompatible covX:(x : M) → TangentSpace I xY:(x : M) → TangentSpace I xZ:(x : M) → TangentSpace I x_hX:ContMDiff I I.tangent ∞ (T% X)_hY:ContMDiff I I.tangent ∞ (T% Y)_hZ:ContMDiff I I.tangent ∞ (T% Z)x:M⊢ 2 * Inner.inner ℝ ((↑cov Y x) (X x)) (Z x) = ((d% fun y => Inner.inner ℝ (Y y) (Z y)) x) (X x) + ((d% fun y => Inner.inner ℝ (X y) (Z y)) x) (Y x) - ((d% fun y => Inner.inner ℝ (X y) (Y y)) x) (Z x) - Inner.inner ℝ (X x) (mlieBracket I Y Z x) - Inner.inner ℝ (Y x) (mlieBracket I X Z x) + Inner.inner ℝ (Z x) (mlieBracket I X Y x) All goals completed! 🐙
#241
A counterexample to the unit conjecture for group rings
annals_unit_conjecture

Verso theorem preview

theorem declaration uses `sorry`theorem_A : (∀ g : UnitConjecture.P, ∀ n ≠ 0, g ^ n = 1 → g = 1) ∧ IsUnit UnitConjecture.u ∧ ¬ ∃ g : UnitConjecture.P, UnitConjecture.u = g := ⊢ (∀ (g : P) (n : ℕ), n ≠ 0 → g ^ n = 1 → g = 1) ∧ IsUnit u ∧ ¬∃ g, u = (MonoidAlgebra.of (ZMod 2) P) g All goals completed! 🐙
#242
Perron-Frobenius for irreducible nonnegative matrices
irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius

Verso theorem preview

theorem declaration uses `sorry`irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius {n : Type*} [Fintype n] [DecidableEq n] [Nonempty n] (A : Matrix n n ℝ) (hA : A.IsIrreducible) : ∃ v : n → ℝ, Module.End.HasEigenvector (Matrix.toLin' A) (spectralRadius ℝ A).toReal v ∧ (∀ i, 0 < v i) := n:Type u_1inst✝²:Fintype ninst✝¹:DecidableEq ninst✝:Nonempty nA:Matrix n n ℝhA:A.IsIrreducible⊢ ∃ v, Module.End.HasEigenvector (Matrix.toLin' A) (spectralRadius ℝ A).toReal v ∧ ∀ (i : n), 0 < v i All goals completed! 🐙
#243
Rouche theorem via zero counting
rouche_zero_count_eq

Verso theorem preview

theorem declaration uses `sorry`rouche_zero_count_eq {f g : ℂ → ℂ} {R : ℝ} (hR : 0 < R) (hf : MeromorphicNFOn f Set.univ) (hg : AnalyticOn ℂ g Set.univ) (hbound : ∀ z : ℂ, ‖z‖ = R → ‖g z‖ < ‖f z‖) : (∑ᶠ z, ((divisor (f + g) (Metric.closedBall 0 R))⁺) z) = (∑ᶠ z, ((divisor f (Metric.closedBall 0 R))⁺) z) := f:ℂ → ℂg:ℂ → ℂR:ℝhR:0 < Rhf:MeromorphicNFOn f Set.univhg:AnalyticOn ℂ g Set.univhbound:∀ (z : ℂ), ‖z‖ = R → ‖g z‖ < ‖f z‖⊢ ∑ᶠ (z : ℂ), (divisor (f + g) (Metric.closedBall 0 R))⁺ z = ∑ᶠ (z : ℂ), (divisor f (Metric.closedBall 0 R))⁺ z All goals completed! 🐙
#244
Complementary polynomial on the unit circle
exists_complementary_polynomial_on_unit_circle

Verso theorem preview

theorem declaration uses `sorry`exists_complementary_polynomial_on_unit_circle (P : ℂ[X]) (hP : ∀ z : Circle, ‖P.eval (z : ℂ)‖ ≤ 1) : ∃ Q : ℂ[X], Q.natDegree ≤ P.natDegree ∧ ∀ z : Circle, ‖P.eval (z : ℂ)‖ ^ 2 + ‖Q.eval (z : ℂ)‖ ^ 2 = 1 := P:ℂ[X]hP:∀ (z : Circle), ‖eval (↑z) P‖ ≤ 1⊢ ∃ Q, Q.natDegree ≤ P.natDegree ∧ ∀ (z : Circle), ‖eval (↑z) P‖ ^ 2 + ‖eval (↑z) Q‖ ^ 2 = 1 All goals completed! 🐙
#245
Bourbaki's locally convex extension of Banach–Alaoglu
banach_alaoglu_bourbaki

Verso theorem preview

theorem declaration uses `sorry`banach_alaoglu_bourbaki (E : Type*) [AddCommGroup E] [Module ℝ E] [TopologicalSpace E] [ContinuousAdd E] [ContinuousSMul ℝ E] [LocallyConvexSpace ℝ E] (U : Set E) (_hU : U ∈ 𝓝 (0 : E)) : IsCompact (LeanEval.Analysis.weakStarPolar E U) := E:Type u_1inst✝⁵:AddCommGroup Einst✝⁴:Module ℝ Einst✝³:TopologicalSpace Einst✝²:ContinuousAdd Einst✝¹:ContinuousSMul ℝ Einst✝:LocallyConvexSpace ℝ EU:Set E_hU:U ∈ 𝓝 0⊢ IsCompact (weakStarPolar E U) All goals completed! 🐙
#246
Linear programming: maximum principle and vertex optimality
lp_maximum_principle

Verso theorem preview

/-- **Maximum principle for linear programming** (§101). A local maximiser of the LP objective on the feasible region is automatically a global maximiser; and whenever the objective is non-constant (`c ≠ 0`), the maximiser lies on the topological frontier of the feasible region. -/ theorem declaration uses `sorry`lp_maximum_principle {m n : ℕ} (lp : LinearProgram m n) (x : Fin m → ℝ) (_hx : x ∈ lp.feasible) (_hlocal : IsLocalMaxOn lp.objective lp.feasible x) : IsMaxOn lp.objective lp.feasible x ∧ (lp.c ≠ 0 → x ∈ frontier lp.feasible) := m:ℕn:ℕlp:LinearProgram m nx:Fin m → ℝ_hx:x ∈ lp.feasible_hlocal:IsLocalMaxOn lp.objective lp.feasible x⊢ IsMaxOn lp.objective lp.feasible x ∧ (lp.c ≠ 0 → x ∈ frontier lp.feasible) All goals completed! 🐙
/-- **Vertex optimality** (§101; the existence content of Dantzig's 1947 simplex algorithm). Every linear program with a nonempty bounded feasible region admits a global maximiser that is an extreme point (vertex) of the feasible region. -/ theorem declaration uses `sorry`simplex_algorithm {m n : ℕ} (lp : LinearProgram m n) (_hfeas : lp.feasible.Nonempty) (_hbdd : Bornology.IsBounded lp.feasible) : ∃ x ∈ lp.feasible, IsMaxOn lp.objective lp.feasible x ∧ x ∈ Set.extremePoints ℝ lp.feasible := m:ℕn:ℕlp:LinearProgram m n_hfeas:lp.feasible.Nonempty_hbdd:Bornology.IsBounded lp.feasible⊢ ∃ x ∈ lp.feasible, IsMaxOn lp.objective lp.feasible x ∧ x ∈ Set.extremePoints ℝ lp.feasible All goals completed! 🐙
#247
Pell solutions are convergents of √d
pell_solution_convergent

Verso theorem preview

theorem declaration uses `sorry`pell_solution_is_convergent (d : ℤ) (_hd : Squarefree d) (_hd0 : 0 < d) (x y : ℤ) (_hx : 0 < x) (_hy : 0 < y) (_hsol : x ^ 2 - d * y ^ 2 = 1) : ∃ n : ℕ, (GenContFract.of (Real.sqrt (d : ℝ))).convs n = (x : ℝ) / (y : ℝ) := d:ℤ_hd:Squarefree d_hd0:0 < dx:ℤy:ℤ_hx:0 < x_hy:0 < y_hsol:x ^ 2 - d * y ^ 2 = 1⊢ ∃ n, (GenContFract.of √↑d).convs n = ↑x / ↑y All goals completed! 🐙
#248
Symplectic matrices have determinant 1
symplectic_matrix_det

Verso theorem preview

theorem declaration uses `sorry`symplectic_matrix_det {l R : Type*} [DecidableEq l] [Fintype l] [CommRing R] {A : Matrix (l ⊕ l) (l ⊕ l) R} (_hA : A ∈ Matrix.symplecticGroup l R) : A.det = 1 := l:Type u_1R:Type u_2inst✝²:DecidableEq linst✝¹:Fintype linst✝:CommRing RA:Matrix (l ⊕ l) (l ⊕ l) R_hA:A ∈ symplecticGroup l R⊢ A.det = 1 All goals completed! 🐙
#249
Gaussian heat kernel solves the 1D heat equation
heat_kernel_solves_heat_equation

Verso theorem preview

theorem declaration uses `sorry`heat_kernel_solves_heat_equation (f : ℝ → ℝ) (hf_cont : Continuous f) (hf_bdd : ∃ M : ℝ, ∀ x, |f x| ≤ M) : -- The PDE on (0, ∞) × ℝ. (∀ t : ℝ, 0 < t → ∀ x : ℝ, ∃ ux : ℝ → ℝ, ∃ uxx : ℝ, (∀ y : ℝ, HasDerivAt (fun z => heatSolution f t z) (ux y) y) ∧ HasDerivAt ux uxx x ∧ HasDerivAt (fun s => heatSolution f s x) uxx t) ∧ -- Initial condition recovered as a one-sided limit at t = 0. (∀ x : ℝ, Filter.Tendsto (fun t : ℝ => heatSolution f t x) (nhdsWithin (0 : ℝ) (Set.Ioi 0)) (nhds (f x))) := f:ℝ → ℝhf_cont:Continuous fhf_bdd:∃ M, ∀ (x : ℝ), |f x| ≤ M⊢ (∀ (t : ℝ), 0 < t → ∀ (x : ℝ), ∃ ux uxx, (∀ (y : ℝ), HasDerivAt (fun z => heatSolution f t z) (ux y) y) ∧ HasDerivAt ux uxx x ∧ HasDerivAt (fun s => heatSolution f s x) uxx t) ∧ ∀ (x : ℝ), Filter.Tendsto (fun t => heatSolution f t x) (nhdsWithin 0 (Set.Ioi 0)) (nhds (f x)) All goals completed! 🐙
#250
Minkowski-Caratheodory theorem
mem_convexHull_finset_extremePoints_of_mem_compact_convex

Verso theorem preview

theorem declaration uses `sorry`mem_convexHull_finset_extremePoints_of_mem_compact_convex {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] {s : Set E} {x : E} (hscomp : IsCompact s) (hsconv : Convex ℝ s) (hx : x ∈ s) : ∃ t : Finset E, (↑t : Set E) ⊆ s.extremePoints ℝ ∧ t.card ≤ Module.finrank ℝ E + 1 ∧ x ∈ convexHull ℝ (↑t : Set E) := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:FiniteDimensional ℝ Es:Set Ex:Ehscomp:IsCompact shsconv:Convex ℝ shx:x ∈ s⊢ ∃ t, ↑t ⊆ extremePoints ℝ s ∧ t.card ≤ Module.finrank ℝ E + 1 ∧ x ∈ (convexHull ℝ) ↑t All goals completed! 🐙
#251
Oppenheim's inequality for Hadamard products
oppenheim_inequality

Verso theorem preview

theorem declaration uses `sorry`oppenheim_inequality {n : Type*} [Fintype n] [DecidableEq n] {A B : Matrix n n ℝ} (hA : A.PosSemidef) (hB : B.PosSemidef) : A.det * ∏ i, B i i ≤ (A ⊙ B).det := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℝB:Matrix n n ℝhA:A.PosSemidefhB:B.PosSemidef⊢ A.det * ∏ i, B i i ≤ (A ⊙ B).det All goals completed! 🐙
#252
Character values of finite groups lie in cyclotomic fields
brauer_character_in_cyclotomic

Verso theorem preview

theorem declaration uses `sorry`brauer_character_in_cyclotomic (G : Type) [Group G] [Fintype G] : ∃ φ : CyclotomicField (Monoid.exponent G) ℚ →+* ℂ, ∀ (V : Type) (_ : AddCommGroup V) (_ : Module ℂ V) (_ : FiniteDimensional ℂ V) (ρ : Representation ℂ G V) (g : G), LinearMap.trace ℂ V (ρ g) ∈ φ.range := G:Typeinst✝¹:Group Ginst✝:Fintype G⊢ ∃ φ, ∀ (V : Type) (x : AddCommGroup V) (x_1 : Module ℂ V), FiniteDimensional ℂ V → ∀ (ρ : Representation ℂ G V) (g : G), (LinearMap.trace ℂ V) (ρ g) ∈ φ.range All goals completed! 🐙
#253
pi_1 of the circle is Z
pi1_circle_mulEquiv_int

Verso theorem preview

theorem declaration uses `sorry`pi1_circle_mulEquiv_int : Nonempty (HomotopyGroup.Pi 1 Circle (1 : Circle) ≃* Multiplicative ℤ) := ⊢ Nonempty (HomotopyGroup.Pi 1 Circle 1 ≃* Multiplicative ℤ) All goals completed! 🐙
#254
Dirichlet eigenvalues of -y'' = lambda y on [0,pi] are n^2
dirichlet_eigenvalues_eq_nat_sq

Verso theorem preview

theorem declaration uses `sorry`dirichlet_eigenvalues_eq_nat_sq (lam : ℝ) : (∃ (y : ℝ → ℝ) (J : Set ℝ), IsOpen J ∧ Set.Icc (0 : ℝ) Real.pi ⊆ J ∧ (∀ x ∈ J, HasDerivAt y (deriv y x) x) ∧ (∀ x ∈ J, HasDerivAt (deriv y) (-(lam * y x)) x) ∧ y 0 = 0 ∧ y Real.pi = 0 ∧ ∃ x ∈ Set.Ioo (0 : ℝ) Real.pi, y x ≠ 0) ↔ ∃ n : ℕ, 0 < n ∧ lam = (n : ℝ) ^ 2 := lam:ℝ⊢ (∃ y J, IsOpen J ∧ Set.Icc 0 π ⊆ J ∧ (∀ x ∈ J, HasDerivAt y (deriv y x) x) ∧ (∀ x ∈ J, HasDerivAt (deriv y) (-(lam * y x)) x) ∧ y 0 = 0 ∧ y π = 0 ∧ ∃ x ∈ Set.Ioo 0 π, y x ≠ 0) ↔ ∃ n, 0 < n ∧ lam = ↑n ^ 2 All goals completed! 🐙
#255
Entrywise exponential of a PSD matrix is PSD
posSemidef_map_exp

Verso theorem preview

theorem declaration uses `sorry`posSemidef_map_exp {n : Type*} [Fintype n] [DecidableEq n] {A : Matrix n n ℝ} (hA : A.PosSemidef) : (A.map Real.exp).PosSemidef := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℝhA:A.PosSemidef⊢ (A.map Real.exp).PosSemidef All goals completed! 🐙
#256
Sturm separation theorem
sturm_separation

Verso theorem preview

theorem declaration uses `sorry`sturm_separation (p q y₁ y₂ : ℝ → ℝ) (a b : ℝ) (hab : a < b) (J : Set ℝ) (hJ_open : IsOpen J) (hJ_conn : IsPreconnected J) (hJ_sub : Set.Icc a b ⊆ J) (hp : ContinuousOn p J) (hq : ContinuousOn q J) (hy₁ : ∀ x ∈ J, HasDerivAt y₁ (deriv y₁ x) x) (hy₁' : ∀ x ∈ J, HasDerivAt (deriv y₁) (-(p x * deriv y₁ x + q x * y₁ x)) x) (hy₂ : ∀ x ∈ J, HasDerivAt y₂ (deriv y₂ x) x) (hy₂' : ∀ x ∈ J, HasDerivAt (deriv y₂) (-(p x * deriv y₂ x + q x * y₂ x)) x) (hW : ∃ x₀ ∈ J, y₁ x₀ * deriv y₂ x₀ - y₂ x₀ * deriv y₁ x₀ ≠ 0) (hza : y₁ a = 0) (hzb : y₁ b = 0) (hne : ∀ x ∈ Set.Ioo a b, y₁ x ≠ 0) : ∃! c, c ∈ Set.Ioo a b ∧ y₂ c = 0 := p:ℝ → ℝq:ℝ → ℝy₁:ℝ → ℝy₂:ℝ → ℝa:ℝb:ℝhab:a < bJ:Set ℝhJ_open:IsOpen JhJ_conn:IsPreconnected JhJ_sub:Set.Icc a b ⊆ Jhp:ContinuousOn p Jhq:ContinuousOn q Jhy₁:∀ x ∈ J, HasDerivAt y₁ (deriv y₁ x) xhy₁':∀ x ∈ J, HasDerivAt (deriv y₁) (-(p x * deriv y₁ x + q x * y₁ x)) xhy₂:∀ x ∈ J, HasDerivAt y₂ (deriv y₂ x) xhy₂':∀ x ∈ J, HasDerivAt (deriv y₂) (-(p x * deriv y₂ x + q x * y₂ x)) xhW:∃ x₀ ∈ J, y₁ x₀ * deriv y₂ x₀ - y₂ x₀ * deriv y₁ x₀ ≠ 0hza:y₁ a = 0hzb:y₁ b = 0hne:∀ x ∈ Set.Ioo a b, y₁ x ≠ 0⊢ ∃! c, c ∈ Set.Ioo a b ∧ y₂ c = 0 All goals completed! 🐙
#257
Polynomial decay rate of y' = -y^3
cubic_decay_asymptotic

Verso theorem preview

theorem declaration uses `sorry`cubic_decay_asymptotic (y : ℝ → ℝ) (hy_diff : ∀ t : ℝ, 0 < t → HasDerivAt y (-(y t) ^ 3) t) (hy_cont : ContinuousWithinAt y (Set.Ici 0) 0) (hy0 : y 0 = 1) : Tendsto (fun t : ℝ => y t * Real.sqrt t) atTop (𝓝 (1 / Real.sqrt 2)) := y:ℝ → ℝhy_diff:∀ (t : ℝ), 0 < t → HasDerivAt y (-y t ^ 3) thy_cont:ContinuousWithinAt y (Set.Ici 0) 0hy0:y 0 = 1⊢ Tendsto (fun t => y t * √t) atTop (𝓝 (1 / √2)) All goals completed! 🐙
#258
Comparison principle for the Dirichlet BVP
bvp_comparison

Verso theorem preview

theorem declaration uses `sorry`bvp_comparison (J : Set ℝ) (hJ_open : IsOpen J) (hJ_sub : Set.Icc (0 : ℝ) 1 ⊆ J) (u v : ℝ → ℝ) (hu : ∀ x ∈ J, HasDerivAt u (deriv u x) x) (hu' : ∀ x ∈ J, HasDerivAt (deriv u) (deriv (deriv u) x) x) (hv : ∀ x ∈ J, HasDerivAt v (deriv v x) x) (hv' : ∀ x ∈ J, HasDerivAt (deriv v) (deriv (deriv v) x) x) (hineq : ∀ x ∈ Set.Ioo (0 : ℝ) 1, -deriv (deriv u) x ≤ -deriv (deriv v) x) (hu0 : u 0 ≤ v 0) (hu1 : u 1 ≤ v 1) : ∀ x ∈ Set.Icc (0 : ℝ) 1, u x ≤ v x := J:Set ℝhJ_open:IsOpen JhJ_sub:Set.Icc 0 1 ⊆ Ju:ℝ → ℝv:ℝ → ℝhu:∀ x ∈ J, HasDerivAt u (deriv u x) xhu':∀ x ∈ J, HasDerivAt (deriv u) (deriv (deriv u) x) xhv:∀ x ∈ J, HasDerivAt v (deriv v x) xhv':∀ x ∈ J, HasDerivAt (deriv v) (deriv (deriv v) x) xhineq:∀ x ∈ Set.Ioo 0 1, -deriv (deriv u) x ≤ -deriv (deriv v) xhu0:u 0 ≤ v 0hu1:u 1 ≤ v 1⊢ ∀ x ∈ Set.Icc 0 1, u x ≤ v x All goals completed! 🐙
#259
Cayley graph connected iff generators generate the group
mulCayley_connected_iff_closure_eq_top

Verso theorem preview

theorem declaration uses `sorry`mulCayley_connected_iff_closure_eq_top {G : Type*} [Group G] (S : Set G) : (SimpleGraph.mulCayley S).Connected ↔ Subgroup.closure S = ⊤ := G:Type u_1inst✝:Group GS:Set G⊢ (SimpleGraph.mulCayley S).Connected ↔ Subgroup.closure S = ⊤ All goals completed! 🐙
#260
Finite Ramsey theorem for graphs
finite_graph_ramsey_theorem

Verso theorem preview

theorem declaration uses `sorry`finite_graph_ramsey_theorem : ∀ r s : ℕ, 2 ≤ r → 2 ≤ s → ∃ n : ℕ, ∀ G : SimpleGraph (Fin n), ¬ G.CliqueFree r ∨ ¬ Gᶜ.CliqueFree s := ⊢ ∀ (r s : ℕ), 2 ≤ r → 2 ≤ s → ∃ n, ∀ (G : SimpleGraph (Fin n)), ¬G.CliqueFree r ∨ ¬Gᶜ.CliqueFree s All goals completed! 🐙
#261
Catalan generating function via compositional inversion
substInv_X_sub_X_sq_eq_catalan

Verso theorem preview

theorem declaration uses `sorry`substInv_X_sub_X_sq_eq_catalan (n : ℕ) : haveI : Invertible (coeff 1 ((X : ℚ⟦X⟧) - X ^ 2)) := n:ℕ⊢ Invertible ((coeff 1) (X - X ^ 2)) n:ℕ⊢ Invertible 1; All goals completed! 🐙 coeff (n + 1) (substInv ((X : ℚ⟦X⟧) - X ^ 2)) = (Nat.choose (2 * n) n : ℚ) / (↑n + 1) := n:ℕ⊢ (coeff (n + 1)) (X - X ^ 2).substInv = ↑((2 * n).choose n) / (↑n + 1) All goals completed! 🐙
#262
First submissionAug 29, 2026
Last submissionOct 13, 2026
Vilin97262
2Humanifa + GPT 5.6 sol256 solved
Real cyclotomic integer with house in (2, 76/33)
cyclotomic_integer_house_between_two_and_76_33

Verso theorem preview

theorem declaration uses `sorry`cyclotomic_integer_house_between_two_and_76_33 {K : Type*} [Field K] [NumberField K] [Algebra ℚ K] (n : ℕ) [NeZero n] [IsCyclotomicExtension {n} ℚ K] {β : K} (hβ_int : IsIntegral ℤ β) (hβ_real : β ∈ NumberField.maximalRealSubfield K) : (2 < house β ∧ house β < (76 : ℝ) / 33) → house β = (Real.sqrt 7 + Real.sqrt 3) / 2 ∨ house β = Real.sqrt 5 ∨ house β = 1 + 2 * Real.cos (2 * Real.pi / 7) ∨ house β = (1 + Real.sqrt 5) / Real.sqrt 2 ∨ house β = (1 + Real.sqrt 13) / 2 := K:Type u_1inst✝⁴:Field Kinst✝³:NumberField Kinst✝²:Algebra ℚ Kn:ℕinst✝¹:NeZero ninst✝:IsCyclotomicExtension {n} ℚ Kβ:Khβ_int:IsIntegral ℤ βhβ_real:β ∈ maximalRealSubfield K⊢ 2 < house β ∧ house β < 76 / 33 → house β = (√7 + √3) / 2 ∨ house β = √5 ∨ house β = 1 + 2 * Real.cos (2 * Real.pi / 7) ∨ house β = (1 + √5) / √2 ∨ house β = (1 + √13) / 2 All goals completed! 🐙
#1
Differentiable sphere theorem (Brendle–Schoen)
sphere_theorem_differentiable

Verso theorem preview

theorem declaration uses `sorry`differentiable_sphere_theorem [I.Boundaryless] [T2Space M] [CompactSpace M] [SimplyConnectedSpace M] (hdim : 2 ≤ Module.finrank ℝ E) (cov : CovariantDerivative I E (TangentSpace I (M := M))) [ContMDiffCovariantDerivative cov ∞] (_htor : cov.torsion = 0) (_hmet : LeanEval.Geometry.SphereTheorem.IsMetricCompatible cov) (_hpinch : LeanEval.Geometry.SphereTheorem.QuarterPinched cov) : Nonempty (M ≃ₘ⟮I, 𝓡 (Module.finrank ℝ E)⟯ (sphere (0 : EuclideanSpace ℝ (Fin (Module.finrank ℝ E + 1))) 1)) := E:Type u_1inst✝¹⁴:NormedAddCommGroup Einst✝¹³:NormedSpace ℝ Einst✝¹²:FiniteDimensional ℝ Einst✝¹¹:CompleteSpace EH:Type u_2inst✝¹⁰:TopologicalSpace HI:ModelWithCorners ℝ E HM:Type u_3inst✝⁹:TopologicalSpace Minst✝⁸:ChartedSpace H Minst✝⁷:IsManifold I ∞ Minst✝⁶:RiemannianBundle fun x => TangentSpace I xinst✝⁵:IsContMDiffRiemannianBundle I ∞ E fun x => TangentSpace I xinst✝⁴:I.Boundarylessinst✝³:T2Space Minst✝²:CompactSpace Minst✝¹:SimplyConnectedSpace Mhdim:2 ≤ Module.finrank ℝ Ecov:CovariantDerivative I E (TangentSpace I)inst✝:cov.ContMDiffCovariantDerivative ∞_htor:cov.torsion = 0_hmet:LeanEval.Geometry.SphereTheorem.IsMetricCompatible cov_hpinch:QuarterPinched cov⊢ Nonempty (M ≃ₘ⟮I, 𝓡 Module.finrank ℝ E⟯ ↑(sphere 0 1)) All goals completed! 🐙
#2
How produced

Models: Claude Opus 5.5 + GPT-6 Astra. Note on the Model field: "Humanifa + GPT 5.6 sol" is the public label our team (Humanfia) has used for its earlier lean-eval submissions, kept here for consistency. It is a team identity, not the list of models used. A request to display it as "Humanfia" (https://github.com/leanprover/lean-eval-leaderboard/issues/92) has not been applied yet. This proof was produced with Claude Opus 5.5 and GPT-6 Astra. Produced by Humanfia's LOT (Lean Option Tree) orchestrator: agent sessions recursively split the statement into frozen sub-obligations, prove them in parallel, and every step is checked with the official lean-eval checker (comparator, nanoda and Lean kernel replay). The proof is fully machine-written; humans built the orchestrator and the seed package and operated the infrastructure. Builds on Mathlib and lean-pool (JacobianDiffgeo, NavierStokesAndEuler, RellichKondrachov, CaffarelliKohnNirenberg).

Wilkie's conjecture for Pfaffian structures
annals_wilkies_conjecture

Verso theorem preview

theorem declaration uses `sorry`corollary_1 (X : Set ℝⁿ) (h : WilkiesConjecture.IsRExpDefinable X) : ∃ f : MvPolynomial (Fin 2) ℝ, ∀ (g H : ℕ), Nat.card (WilkiesConjecture.degreeHeightLE X.trans g H) ≤ f.eval ![(g : ℝ), Real.log H] := n:ℕX:Set (Fin n → ℝ)h:IsRExpDefinable X⊢ ∃ f, ∀ (g H : ℕ), ↑(Nat.card ↑(degreeHeightLE X.trans g H)) ≤ (MvPolynomial.eval ![↑g, Real.log ↑H]) f All goals completed! 🐙
#3
The rectangular peg problem
annals_rectangular_peg_problem

Verso theorem preview

theorem declaration uses `sorry`theorem_1 (γ : Circle → ℂ) (z w : ℂ) (θ : Real.Angle) (hγ : IsSmoothEmbedding (𝓡 1) 𝓘(ℝ, ℂ) ∞ γ) : ∃ (θ' : Real.Angle), ∃ (z' w' : ℂ), Similar (R z w θ) (R z' w' θ') ∧ ∀ i : Fin 4, R z' w' θ' i ∈ Set.range γ := γ:Circle → ℂz:ℂw:ℂθ:Anglehγ:IsSmoothEmbedding (𝓡 1) 𝓘(ℝ, ℂ) ∞ γ⊢ ∃ θ' z' w', Similar (R z w θ) (R z' w' θ') ∧ ∀ (i : Fin 4), R z' w' θ' i ∈ Set.range γ All goals completed! 🐙
#4
How produced

Mini-Humanize workflow using Kimi K3 and GPT-6 Astra for proof development and Lean migration, followed by GPT-5.6-sol review and full evaluator verification.

Integer multiplication in time O(n log n)
annals_integer_multiplication

Verso theorem preview

theorem declaration uses `sorry`theorem_1_1 : ∃ T : TM2ComputableInTime (IntegerMultiplication.encodeProd encodeNat encodeNat) encodeNat (fun (x, y) ↦ x * y), (fun n ↦ (T.time n : ℝ)) =O[Filter.atTop] (fun n ↦ n * log n) := ⊢ ∃ T, (fun n => ↑(T.time n)) =O[Filter.atTop] fun n => ↑n * log ↑n All goals completed! 🐙
#5
How produced

Mini-Humanize workflow using Kimi K3 and GPT-6 Astra for proof development and Lean migration, followed by GPT-5.6-sol review and full evaluator verification.

Hausdorff dimension of the Mandelbrot boundary (Shishikura)
mandelbrot_boundary_dimh

Verso theorem preview

theorem declaration uses `sorry`mandelbrot_boundary_dimh : dimH (frontier LeanEval.Dynamics.MandelbrotBoundary.Mandelbrot) = 2 := ⊢ dimH (frontier Mandelbrot) = 2 All goals completed! 🐙
#6
How produced

Mini-Humanize workflow using Kimi K3 and GPT-6 Astra for proof development and Lean migration, followed by GPT-5.6-sol review and full evaluator verification.

On property (T) for Aut(F_n) and SL_n(Z)
annals_on_property_t

Verso theorem preview

theorem declaration uses `sorry`theorem_1 (n : ℕ) (hn : n ≥ 6) : OnPropertyT.PropertyT (MulAut (FreeGroup (Fin n))) := n:ℕhn:n ≥ 6⊢ PropertyT (MulAut (FreeGroup (Fin n))) All goals completed! 🐙
#7
How produced

Humanifa workflow using Kimi K3 and GPT-6 Astra for proof development and Lean migration, followed by GPT-5.6-sol review.

Milnor's exotic 7-sphere
milnor_exotic_sphere_seven

Verso theorem preview

theorem declaration uses `sorry`milnor_exotic_sphere_seven : ∃ (M : Type) (_ : TopologicalSpace M) (_ : ChartedSpace (EuclideanSpace ℝ (Fin 7)) M) (_ : IsManifold (𝓡 7) ∞ M) (_homeo : M ≃ₜ sphere (0 : EuclideanSpace ℝ (Fin 8)) 1), IsEmpty (M ≃ₘ⟮𝓡 7, 𝓡 7⟯ sphere (0 : EuclideanSpace ℝ (Fin 8)) 1) := ⊢ ∃ M x x_1, ∃ (_ : IsManifold (𝓡 7) ∞ M), ∃ _homeo, IsEmpty (M ≃ₘ⟮𝓡 7, 𝓡 7⟯ ↑(sphere 0 1)) All goals completed! 🐙
#8
How produced

Mini-Humanize workflow using Kimi K3 and GPT-6 Astra for proof development and Lean migration, followed by GPT-5.6-sol review and full evaluator verification.

Pointwise ergodic theorems for non-conventional bilinear polynomial averages
annals_pointwise_ergodic_theorems

Verso theorem preview

/-- Statement of Theorem 1.17(i) (Mean ergodic theorem): The averages `A T N X P f g` converge as `N → ∞` in `Lᵖ(X)` norm. -/ theorem declaration uses `sorry`theorem_1_17_i {f g : 𝓧 → ℂ} (hf : MemLp f p₁ μ) (hg : MemLp g p₂ μ) : ∃ h : 𝓧 → ℂ, MemLp h p μ ∧ Tendsto (fun N ↦ eLpNorm (A T N (X : ℤ[X]) P f g - h) p μ) atTop (𝓝 0) := 𝓧:Type u_1σX:MeasurableSpace 𝓧μ:Measure 𝓧inst✝:SigmaFinite μT:𝓧 ≃ᵐ 𝓧hT:MeasurePreserving (⇑T) μ μP:ℤ[X]hP:P.degree ≥ 2p₁:ℝ≥0∞p₂:ℝ≥0∞p:ℝ≥0∞h₁p₁:1 < p₁h₁p₂:1 < p₂h₂p₁:p₁ < ∞h₂p₂:p₂ < ∞hp₁p₂p:p₁⁻¹ + p₂⁻¹ = p⁻¹hp:p⁻¹ ≤ 1f:𝓧 → ℂg:𝓧 → ℂhf:MemLp f p₁ μhg:MemLp g p₂ μ⊢ ∃ h, MemLp h p μ ∧ Tendsto (fun N => eLpNorm (A T N X P f g - h) p μ) atTop (𝓝 0) All goals completed! 🐙
/-- Statement of Theorem 1.16(ii) (Pointwise ergodic theorem): The averages `A T N X P f g` converge as `N → ∞` pointwise almost everywhere. -/ theorem declaration uses `sorry`theorem_1_17_ii {f g : 𝓧 → ℂ} (hf : MemLp f p₁ μ) (hg : MemLp g p₂ μ) : ∃ h : 𝓧 → ℂ, MemLp h p μ ∧ ∀ᵐ x ∂μ, Tendsto (fun N ↦ A T N (X : ℤ[X]) P f g x) atTop (𝓝 (h x)) := 𝓧:Type u_1σX:MeasurableSpace 𝓧μ:Measure 𝓧inst✝:SigmaFinite μT:𝓧 ≃ᵐ 𝓧hT:MeasurePreserving (⇑T) μ μP:ℤ[X]hP:P.degree ≥ 2p₁:ℝ≥0∞p₂:ℝ≥0∞p:ℝ≥0∞h₁p₁:1 < p₁h₁p₂:1 < p₂h₂p₁:p₁ < ∞h₂p₂:p₂ < ∞hp₁p₂p:p₁⁻¹ + p₂⁻¹ = p⁻¹hp:p⁻¹ ≤ 1f:𝓧 → ℂg:𝓧 → ℂhf:MemLp f p₁ μhg:MemLp g p₂ μ⊢ ∃ h, MemLp h p μ ∧ ∀ᵐ (x : 𝓧) ∂μ, Tendsto (fun N => A T N X P f g x) atTop (𝓝 (h x)) All goals completed! 🐙
/-- The constant of Theorem 1.17 (iii). -/ noncomputable def declaration uses `sorry`Cᵢᵢᵢ (P : ℤ[X]) (p₁ p₂ : ℝ≥0∞) : ℝ≥0 := sorry
/-- Statement of Theorem 1.17(iii) (Maximal ergodic theorem): There exists a constant `C ≥ 0` such that for any `f ∈ Lᵖ₁(X)` and `g ∈ Lᵖ₂(X)`, `‖A T (N : ℕ+) X P f g‖_{Lᵖ(X;ℓ∞)} ≤ C ‖f‖_{Lᵖ₁(X)} ‖g‖_{Lᵖ₂(X)}`. -/ theorem declaration uses `sorry`theorem_1_17_iii {f g : 𝓧 → ℂ} (hf : MemLp f p₁ μ) (hg : MemLp g p₂ μ) : eLpNorm (fun x ↦ ⨆ (N : ℕ+), ‖A T N (X : ℤ[X]) P f g x‖ₑ) p μ ≤ Cᵢᵢᵢ P p₁ p₂ * ‖hf.toLp‖ₑ * ‖hg.toLp‖ₑ := 𝓧:Type u_1σX:MeasurableSpace 𝓧μ:Measure 𝓧inst✝:SigmaFinite μT:𝓧 ≃ᵐ 𝓧hT:MeasurePreserving (⇑T) μ μP:ℤ[X]hP:P.degree ≥ 2p₁:ℝ≥0∞p₂:ℝ≥0∞p:ℝ≥0∞h₁p₁:1 < p₁h₁p₂:1 < p₂h₂p₁:p₁ < ∞h₂p₂:p₂ < ∞hp₁p₂p:p₁⁻¹ + p₂⁻¹ = p⁻¹hp:p⁻¹ ≤ 1f:𝓧 → ℂg:𝓧 → ℂhf:MemLp f p₁ μhg:MemLp g p₂ μ⊢ eLpNorm (fun x => ⨆ N, ‖A T (↑↑N) X P f g x‖ₑ) p μ ≤ ↑(Cᵢᵢᵢ P p₁ p₂) * ‖MemLp.toLp f hf‖ₑ * ‖MemLp.toLp g hg‖ₑ All goals completed! 🐙
/-- The constant of Theorem 1.17 (iv). -/ noncomputable def declaration uses `sorry`Cᵢᵥ (P : ℤ[X]) (p₁ p₂ : ℝ≥0∞) (r Λ : ℝ≥0) : ℝ≥0 := sorry
/-- Statement of Theorem 1.17(iv) (Long variational ergodic theorem): For any `r > 2` and `Λ > 1`, there exists a constant `C ≥ 0` such that for any `f ∈ Lᵖ₁(X)`, `g ∈ Lᵖ₂(X)` and `Λ`-lacunary sequence `a` such that `1 ≤ a n` for all `n ∈ ℕ`, `‖A T (a n) X P f g‖_{Lᵖ(X;Vʳ)} ≤ C ‖f‖_{Lᵖ₁(X)} ‖g‖_{Lᵖ₂(X)}`. -/ theorem declaration uses `sorry`theorem_1_17_iv (r Λ : ℝ≥0) (hr : r > 2) (hΛ : Λ > 1) {f g : 𝓧 → ℂ} (hf : MemLp f p₁ μ) (hg : MemLp g p₂ μ) (a : ℕ → ℝ≥0) (ha : Lacunary Λ a) (ha' : ∀ n, 1 ≤ a n) : eLpNorm (fun x ↦ variationalNorm r fun n ↦ A T (a n) X P f g x) p μ ≤ Cᵢᵥ P p₁ p₂ r Λ * ‖hf.toLp‖ₑ * ‖hg.toLp‖ₑ := 𝓧:Type u_1σX:MeasurableSpace 𝓧μ:Measure 𝓧inst✝:SigmaFinite μT:𝓧 ≃ᵐ 𝓧hT:MeasurePreserving (⇑T) μ μP:ℤ[X]hP:P.degree ≥ 2p₁:ℝ≥0∞p₂:ℝ≥0∞p:ℝ≥0∞h₁p₁:1 < p₁h₁p₂:1 < p₂h₂p₁:p₁ < ∞h₂p₂:p₂ < ∞hp₁p₂p:p₁⁻¹ + p₂⁻¹ = p⁻¹hp:p⁻¹ ≤ 1r:ℝ≥0Λ:ℝ≥0hr:r > 2hΛ:Λ > 1f:𝓧 → ℂg:𝓧 → ℂhf:MemLp f p₁ μhg:MemLp g p₂ μa:ℕ → ℝ≥0ha:Lacunary Λ aha':∀ (n : ℕ), 1 ≤ a n⊢ eLpNorm (fun x => variationalNorm r fun n => A T (a n) X P f g x) p μ ≤ ↑(Cᵢᵥ P p₁ p₂ r Λ) * ‖MemLp.toLp f hf‖ₑ * ‖MemLp.toLp g hg‖ₑ All goals completed! 🐙
#9
How produced

Humanifa iterative proof development with GPT-6 Astra Lean 4.35 migration and GPT-5.6 Sol review, followed by complete official verification. The full 4,883-job workspace build, comparator, four-thread Nanoda, default Lean kernel, and 7,596-report axiom audit all passed.

Finite-time singularity formation for C^{1,α} solutions to the incompressible Euler equations on ℝ³
annals_finite_time_singularity

Verso theorem preview

theorem declaration uses `sorry`theorem_1 : ∃ α > 0, ∃ u₀, div u₀ = 0 ∧ FiniteTimeSingularity.IsOdd u₀ ∧ IsContDiffHolder ℝ α u₀ ∧ (∃ C > 0, ∀ x, ‖(∇×u₀) x‖ ≤ C / (‖x‖ ^ (α : ℝ) + 1)) ∧ ∃ p, ∃ u, (∀ t ∈ Ico 0 1, FiniteTimeSingularity.IsOdd (u · t)) ∧ FiniteTimeSingularity.IsLocalEulerEquationSolution p u₀ 1 u ∧ (∀ T ∈ Ioo 0 1, IsContDiffHolderOn ℝ α u.uncurry (univ ×ˢ Icc 0 T)) ∧ Tendsto (fun t ↦ ∫ s in 0..t, ⨆ x, ‖(∇×(u · s)) x‖) (𝓝[<] 1) atTop := ⊢ ∃ α > 0, ∃ u₀, div u₀ = 0 ∧ IsOdd u₀ ∧ IsContDiffHolder ℝ α u₀ ∧ (∃ C > 0, ∀ (x : ℝ³), ‖(∇×u₀) x‖ ≤ C / (‖x‖ ^ ↑α + 1)) ∧ ∃ p u, (∀ t ∈ Ico 0 1, IsOdd fun x => u x t) ∧ IsLocalEulerEquationSolution p u₀ 1 u ∧ (∀ T ∈ Ioo 0 1, IsContDiffHolderOn ℝ α (Function.uncurry u) (univ ×ˢ Icc 0 T)) ∧ Tendsto (fun t => ∫ (s : ℝ) in 0..t, ⨆ x, ‖(∇×fun x => u x s) x‖) (𝓝[<] 1) atTop All goals completed! 🐙
#10
How produced

Humanifa iterative proof development using Mini-Humanize, with GPT Astra Lean 4.35 migration and GPT-5.6-sol review. The completed proof passed comparator, four-worker Nanoda, and Lean default-kernel checks on the official Lean 4.35.0-rc3 benchmark.

Linnik's theorem (L = 5.5)
linnik

Verso theorem preview

theorem declaration uses `sorry`linnik : ∃ c : ℝ, ∀ ⦃a d : ℕ⦄, 0 < a → a < d → a.Coprime d → p a d ≤ c * d ^ (5.5 : ℝ) := ⊢ ∃ c, ∀ ⦃a d : ℕ⦄, 0 < a → a < d → a.Coprime d → ↑(p a d) ≤ c * ↑d ^ 5.5 All goals completed! 🐙
#11
How produced

Humanifa iterative proof development using Mini-Humanize, with GPT Astra Lean 4.35 migration and GPT-5.6-sol review. The complete Heath-Brown-based proof passed comparator, four-worker Nanoda, and Lean default-kernel checks on the official Lean 4.35.0-rc3 benchmark.

Serre finiteness for homotopy groups of spheres
pi_sphere_infinite_iff

Verso theorem preview

theorem declaration uses `sorry`pi_sphere_infinite_iff (k n : ℕ) (hn : 1 ≤ n) (x : Metric.sphere (0 : EuclideanSpace ℝ (Fin (n + 1))) 1) : Infinite (HomotopyGroup.Pi k (Metric.sphere (0 : EuclideanSpace ℝ (Fin (n + 1))) 1) x) ↔ k = n ∨ (Even n ∧ k + 1 = 2 * n) := k:ℕn:ℕhn:1 ≤ nx:↑(Metric.sphere 0 1)⊢ Infinite (HomotopyGroup.Pi k (↑(Metric.sphere 0 1)) x) ↔ k = n ∨ Even n ∧ k + 1 = 2 * n All goals completed! 🐙
#12
How produced

Humanifa workflow using Kimi K3 and GPT-6 Astra for proof development and Lean migration, followed by GPT 5.6 sol review. The exact source was verified against Lean-Eval commit `0e093293afbe96be91504ae6e44947876d3fc84e` with Lean 4.35.0-rc3 and Mathlib `5e0c4e5239cb0a2d86d68a884bf52cfd963fce22`. The complete 9,462-job build passed, and comparator, four-thread Nanoda, the default Lean kernel, and the exhaustive axiom audit accepted the solution.

Higher uniformity of bounded multiplicative functions in short intervals on average
annals_bounded_multiplicative_functions

Lean theorem statement

/--
Statement of Theorem 1.3 (Non-pretentious multiplicative functions do not correlate
with polynomial phases on short intervals on average):

Let `k : ℕ`, `θ : ℝ` such that `0 < θ < 1/2` and `η : ℝ` such that `η > 0`. Then there exist
constants `Q : ℕ` such that `Q > 0`, `C : ℝ` such that `C > 0`, and `B : ℝ`, such that for any
multiplicative 1-bounded arithmetic function `f : ℕ → ℂ`, any `X : ℝ` such that `X ≥ 1` and any
`H : ℝ` such that `Xᶿ ≤ H ≤ X¹⁻ᶿ`, if

`∫ x ∈ [X, 2X], ‖f‖_{uᵏ⁺¹[x, x + H]}dx ≥ ηX`

then

`M(f;CXᵏ⁺¹/Hᵏ⁺¹,Q) ≤ B`.
-/
theorem theorem_1_3 (k : ℕ) (θ : ℝ) (hθ₀ : 0 < θ) (hθ₁ : θ < 1 / 2) (η : ℝ) (hη : η > 0) :
    ∃ (Q : ℕ+) (_hQ : 1 ≤ Q) (C : ℝ) (_hC : 0 < C) (B : ℝ),
      ∀ (f : ArithmeticFunction ℂ) (_hf : f.IsMultiplicative) (_hf' : IsOneBounded f)
        (X : ℝ) (_hX : X ≥ 1) (H : ℝ) (_hXH : X ^ θ ≤ H) (_hHX : H ≤ X ^ (1 - θ)),
          ∫ x in X..(2 * X), weakGowersUniformityNorm k x H f.intExtension ≥ η * X →
            M f (C * X ^ (k + 1) / H ^ (k + 1)) Q ≤ B := by
  sorry

/--
Statement of Corollary 1.1 (Liouville does not correlate with polynomial phases on
short intervals on average):

Let `λ` denote the liouville function. Fix `k : ℕ` and `θ : ℝ` such that `0 < θ < 1`. Then

`∫ x ∈ [X, 2X], ‖λ‖_{uᵏ⁺¹[x, x + Xᶿ]}dx = o(X)`

as `X → ∞`.
-/
theorem corollary_1_1 (k : ℕ) (θ : ℝ) (hθ₀ : 0 < θ) (hθ₁ : θ < 1) :
    (fun X ↦ ∫ x in X..(2 * X), weakGowersUniformityNorm k x (X ^ θ) (fun n ↦ liouville ⌊n⌋₊))
      =o[atTop] (fun X ↦ X) := by
  sorry
#13
How produced

Humanifa workflow with iterative AI proof development, Lean 4.35 migration, GPT 5.6 sol review, and independent verification against Lean 4.35.0-rc3 / Mathlib 5e0c4e5239cb0a2d86d68a884bf52cfd963fce22. The complete 4,299-job build passed, and comparator, Nanoda, the default Lean kernel, and the axiom audit accepted the solution.

Friedlander–Iwaniec theorem
friedlander_iwaniec

Verso theorem preview

theorem declaration uses `sorry`friedlander_iwaniec : {p : ℕ | p.Prime ∧ ∃ a b, p = a ^ 2 + b ^ 4}.Infinite := ⊢ {p | Nat.Prime p ∧ ∃ a b, p = a ^ 2 + b ^ 4}.Infinite All goals completed! 🐙
#14
How produced

Humanifa workflow using Kimi K3 and GPT-6 Astra to develop the proof, followed by GPT 5.6 sol to migrate and independently review it on Lean 4.35.0-rc3 / Mathlib 5e0c4e5239cb0a2d86d68a884bf52cfd963fce22. The complete 9,653-job build passed, and comparator, Nanoda, and the default Lean kernel accepted the solution. This is the current-benchmark corrected resubmission of #1844.

Fourier interpolation in dimensions 8 and 24
ckmrv_fourier_interpolation

Lean theorem statement

/-- **Cohn-Kumar-Miller-Radchenko-Viazovska Fourier interpolation theorem.**
In dimension 8 sampling starts at `sqrt 2`, while in dimension 24 it starts
at radius `2`. In both cases the four sample sequences give a bijection
between radial Schwartz functions and rapidly decreasing data. -/
theorem ckmrv_fourier_interpolation :
    CKMRV 8 1 ∧ CKMRV 24 2 := by
  sorry
#15
Existence of a 64-dim irreducible g₂-representation with 14 tensor-square isotypic components
g2_irrep_tensor_square_decomp

Verso theorem preview

theorem declaration uses `sorry`g2_irrep_tensor_square_decomp : ∃ (V : Type) (_ : AddCommGroup V) (_ : Module ℂ V) (_ : LieRingModule (LieAlgebra.g₂ ℂ) V) (_ : LieModule ℂ (LieAlgebra.g₂ ℂ) V), Module.finrank ℂ V = 64 ∧ LieModule.IsIrreducible ℂ (LieAlgebra.g₂ ℂ) V ∧ (isotypicComponents (UniversalEnvelopingAlgebra ℂ (LieAlgebra.g₂ ℂ)) (V ⊗[ℂ] V)).ncard = 14 := ⊢ ∃ V x x_1 x_2, ∃ (x_3 : LieModule ℂ (LieAlgebra.g₂ ℂ) V), Module.finrank ℂ V = 64 ∧ LieModule.IsIrreducible ℂ (LieAlgebra.g₂ ℂ) V ∧ (isotypicComponents (UniversalEnvelopingAlgebra ℂ (LieAlgebra.g₂ ℂ)) (V ⊗[ℂ] V)).ncard = 14 All goals completed! 🐙
#16
Lai-Sang Young entropy–dimension–Lyapunov theorem
entropy_dimension_lyapunov

Verso theorem preview

theorem declaration uses `sorry`entropy_dimension_lyapunov (T T_inv : LeanEval.Dynamics.EucPlane → LeanEval.Dynamics.EucPlane) (hT_smooth : ContDiff ℝ 2 T) (hT_inv_smooth : ContDiff ℝ 2 T_inv) (hT_left : Function.LeftInverse T_inv T) (hT_right : Function.RightInverse T_inv T) (K : Set LeanEval.Dynamics.EucPlane) (hK_compact : IsCompact K) (hK_inv : T '' K = K) (μ : Measure LeanEval.Dynamics.EucPlane) [IsProbabilityMeasure μ] (hμ_supp : μ Kᶜ = 0) (hμ_pres : MeasurePreserving T μ μ) (hμ_erg : Ergodic T μ) : kolmogorovSinaiEntropy μ T = (dimMeasure μ).toReal * harmonicMeanLyapunov (∫ x, lyapunovUpperAt T x ∂μ) (∫ x, lyapunovLowerAt T x ∂μ) / 2 := T:EucPlane → EucPlaneT_inv:EucPlane → EucPlanehT_smooth:ContDiff ℝ 2 ThT_inv_smooth:ContDiff ℝ 2 T_invhT_left:Function.LeftInverse T_inv ThT_right:Function.RightInverse T_inv TK:Set EucPlanehK_compact:IsCompact KhK_inv:T '' K = Kμ:Measure EucPlaneinst✝:IsProbabilityMeasure μhμ_supp:μ Kᶜ = 0hμ_pres:MeasurePreserving T μ μhμ_erg:Ergodic T μ⊢ kolmogorovSinaiEntropy μ T = (dimMeasure μ).toReal * harmonicMeanLyapunov (∫ (x : EucPlane), lyapunovUpperAt T x ∂μ) (∫ (x : EucPlane), lyapunovLowerAt T x ∂μ) / 2 All goals completed! 🐙
#17
How produced

Change the name for model

Linear independence results of Calegari–Dimitrov–Tang
cdt_linearIndependent

Lean theorem statement

/--
Theorem A and C in arXiv:2408.15403.
-/
theorem cdt_linearIndependent :
    letI χ : ZMod 3 → ℂ := ![0, 1, -1]
    LinearIndependent ℚ ![1, riemannZeta 2, ZMod.LFunction χ 2] ∧
    ∀ m n : ℤ, m ≠ -1 → m ≠ 0 → n ≠ -1 → n ≠ 0 → 10 ^ 6 * |m - n| < |n| →
      letI lm := Real.log (1 + 1 / m)
      letI ln := Real.log (1 + 1 / n)
      Irrational (lm * ln) ∧
      (m ≠ n → LinearIndependent ℚ ![1, lm, ln, lm * ln]) := by
  sorry
#18
How produced

Models: Claude Opus 5.5 + GPT-6 Astra. Produced by Humanfia's LOT (Lean Option Tree) orchestrator: agent sessions recursively split the statement into frozen sub-obligations, prove them in parallel, and every step is checked with the official lean-eval checker (comparator, nanoda and Lean kernel replay). The proof is fully machine-written; humans built the orchestrator and the seed package and operated the infrastructure. Builds on Mathlib and lean-pool (MooreBound, RiemannMappingTheorem, JacobianDiffgeo, PentagonalNumberTheoremAnalytic, LeanModularForms, IsTranscendentalPi).

The energy of dilute Bose gases
annals_bose_gases

Lean theorem statement

/-- Constant `η` in Theorem 1.2. -/
noncomputable def η : ℝ := sorry

/-- Constant `𝓒` in Theorem 1.2. -/
noncomputable def 𝓒 (𝓡 : ℝ) (r : ℝ) : ℝ := sorry

/--
Statement of Theorem 1.2 (The Lee-Huang-Yang Formula):

For any non-zero, non-negative, radial potential `v ∈ L¹(ℝ³)` with compact support contained
in some ball `B(0,R)`, there exists `η > 0` and `𝓒` (depending only on `𝓡`and `R / a`) such that
as `ρ → 0⁺`,

`e ρ v ≥ 4πρ²a(1 + 128/(15√π)√(ρa³) - 𝓒(ρa³)^{1/2 + η})`.

Note: We (equivalently) take the limit as `ρ → 0⁺` rather than `ρa³ → 0⁺` as in the paper.

Note: While the wording of Theorem 1.2 in the paper suggests that `η` should also be allowed to
depend on `𝓡` and `R / a`, Theorem 6.8 makes it clear that `η` is in fact a universal constant.

Note: Since `v` is in `L¹(ℝ³)`, we interpret `v ≠ 0` to mean that `v` is not zero in `L¹(ℝ³)`.
-/
theorem theorem_1_2 (v : ℝ³ → ℝ) (hv_ne_zero : ¬ v =ᵐ[volume] 0) (hv_nonneg : 0 ≤ v)
    (hv_radial : IsRadial v) (hv_memL1 : MemLp v 1) {R : ℝ} (hR : 0 < R)
    (hv_supp : tsupport v ⊆ ball 0 R) : 0 < η ∧ ∀ᶠ ρ in 𝓝[>] 0,
      e ρ v ≥ 4 * π * ρ ^ 2 * a v * (1 + (128 / (15 * √ π)) * √ (ρ * a v ^ 3) -
        𝓒 (𝓡 v) (R / a v) * (ρ * a v ^ 3) ^ (1 / 2 + η)) := by
  sorry
#19
How produced

Models: Claude Opus 5.5 + GPT-6 Astra. Note on the Model field: "Humanifa + GPT 5.6 sol" is the public label our team (Humanfia) has used for its earlier lean-eval submissions, kept here for consistency. It is a team identity, not the list of models used. A request to display it as "Humanfia" (https://github.com/leanprover/lean-eval-leaderboard/issues/92) has not been applied yet. This proof was produced with Claude Opus 5.5 and GPT-6 Astra. Produced by Humanfia's LOT (Lean Option Tree) orchestrator: agent sessions recursively split the statement into frozen sub-obligations, prove them in parallel, and every step is checked with the official lean-eval checker (comparator, nanoda and Lean kernel replay). The proof is fully machine-written; humans built the orchestrator and the seed package and operated the infrastructure. Builds on Mathlib and lean-pool (CaffarelliKohnNirenberg).

The Hopf problem: a complex structure on the 6-sphere
hopf_s6_complex_structure

Verso theorem preview

/-- **Hole 1 (data).** An atlas of charts from the 6-sphere — the unit sphere in `ℝ⁷`, with its subspace topology — into `ℂ³`, taken as the plain function type `Fin 3 → ℂ`: all norms on a finite-dimensional space are equivalent, so the choice of model norm is immaterial to the statement. -/ instance declaration uses `sorry`instChartedSpaceS6 : ChartedSpace (Fin 3 → ℂ) (Metric.sphere (0 : EuclideanSpace ℝ (Fin 7)) 1) := sorry
/-- **Hole 2 (proof).** The atlas of hole 1 is holomorphic: its transition functions are `ℂ`-analytic on their open domains. -/ instance declaration uses `sorry`instIsManifoldS6 : IsManifold 𝓘(ℂ, Fin 3 → ℂ) ω (Metric.sphere (0 : EuclideanSpace ℝ (Fin 7)) 1) := sorry
#20
How produced

Models: Claude Opus 5.5 + GPT-6 Astra. Produced by Humanfia's LOT (Lean Option Tree) orchestrator: agent sessions recursively split the statement into frozen sub-obligations, prove them in parallel, and every step is checked with the official lean-eval checker (comparator, nanoda and Lean kernel replay). The proof is fully machine-written; humans built the orchestrator and the seed package and operated the infrastructure. Builds on Mathlib and lean-pool (HopfProblem).

Pannwitz–Kuperberg quadrisecant theorem
smooth_knot_has_quadrisecant

Lean theorem statement

/-- **Quadrisecant theorem** (Pannwitz–Kuperberg). Every smooth nontrivial knot
has a quadrisecant. -/
theorem smooth_knot_has_quadrisecant
    {r : ℝ → Space} (_hknot : IsSmoothKnot r) (_hnontrivial : ¬ IsUnknotted r) :
    HasQuadrisecant r := by
  sorry
#21
How produced

Models: Claude Opus 5.5 + GPT-6 Astra. Produced by Humanfia's LOT (Lean Option Tree) orchestrator: agent sessions recursively split the statement into frozen sub-obligations, prove them in parallel, and every step is checked with the official lean-eval checker (comparator, nanoda and Lean kernel replay). The proof is fully machine-written; humans built the orchestrator and the seed package and operated the infrastructure. Builds on Mathlib; the run started from a seed package containing our own earlier partial work on this problem.

pi_6 of the 3-sphere is Z/12
pi6_sphere_three_mulEquiv_zmod_twelve

Lean theorem statement

/-- **π₆ of the 3-sphere.** Toda's tables give `π₆(𝕊³) ≅ ℤ/12`. -/
theorem pi6_sphere_three_mulEquiv_zmod_twelve
    (x : Metric.sphere (0 : EuclideanSpace ℝ (Fin 4)) 1) :
    Nonempty
      (HomotopyGroup.Pi 6 (Metric.sphere (0 : EuclideanSpace ℝ (Fin 4)) 1) x ≃*
        Multiplicative (ZMod 12)) := by
  sorry
#22
How produced

Mini-Humanize workflow with iterative model proof development and independent review, followed by GPT-6 Astra Lean 4.35 migration and full evaluator verification.

Whitney embedding theorem (strong form, dimension 2n)
whitney_embedding

Lean theorem statement

/-- **Whitney embedding theorem** (Whitney 1944). Every smooth
`n`-manifold (`n ≥ 1`, Hausdorff, second-countable) admits a smooth
embedding into `ℝ^{2n}`. -/
theorem whitney_embedding (n : ℕ) (_hn : 1 ≤ n)
    {M : Type*} [TopologicalSpace M]
    [ChartedSpace (EuclideanSpace ℝ (Fin n)) M] [IsManifold (𝓡 n) ∞ M]
    [T2Space M] [SecondCountableTopology M] :
    ∃ e : M → EuclideanSpace ℝ (Fin (2 * n)),
      ContMDiff (𝓡 n) (𝓡 (2 * n)) ∞ e ∧
      IsEmbedding e ∧
      ∀ x : M, Function.Injective (mfderiv (𝓡 n) (𝓡 (2 * n)) e x) := by
  sorry
#23
How produced

Mini-Humanize workflow using Kimi K3 and GPT-6 Astra for proof development and Lean migration, followed by GPT-5.6-sol review and full evaluator verification.

Jacobian of a smooth proper curve (Merten challenge)
jacobian_challenge_alggeo

Lean theorem statement

/-- The genus of a smooth proper curve. -/
def genus (C : Over (Spec (.of k))) [IsProper C.hom] [SmoothOfRelativeDimension 1 C.hom]
    [GeometricallyIrreducible C.hom] : ℕ :=
  sorry

/-- The Jacobian of a smooth, proper curve over a field `k`. -/
def Jacobian (C : Over (Spec (.of k))) [IsProper C.hom] [SmoothOfRelativeDimension 1 C.hom]
    [GeometricallyIrreducible C.hom] : Over (Spec (.of k)) :=
  sorry

/-- The group scheme structure on the Jacobian of the curve `C`. -/
instance instGrpObj : GrpObj (Jacobian C) :=
  sorry

/-- The Jacobian of `C` is smooth of relative dimension `g` over `k`, where `g` is the
genus of `C`. -/
instance smoothOfRelativeDimension_genus :
    SmoothOfRelativeDimension (genus C) (Jacobian C).hom :=
  sorry

/-- The Jacobian of `C` is proper over `k`. -/
instance instIsProper : IsProper (Jacobian C).hom :=
  sorry

/-- The Jacobian of `C` is geometrically irreducible over `k`. -/
instance instGeometricallyIrreducible : GeometricallyIrreducible (Jacobian C).hom :=
  sorry

/-- The Abel-Jacobi map from a smooth, proper curve to its Jacobian associated
to a `k`-rational point of `C`. -/
def ofCurve (P : 𝟙_ (Over (Spec (.of k))) ⟶ C) : C ⟶ Jacobian C :=
  sorry

/-- The Abel-Jacobi map sends the `k`-rational point `P` to `0`, where `0` (denoted by `η` below) is
the neutral element of the group scheme `Jacobian C`. -/
theorem comp_ofCurve (C : Over (Spec (.of k))) [IsProper C.hom]
    [SmoothOfRelativeDimension 1 C.hom] [GeometricallyIrreducible C.hom]
    (P : 𝟙_ (Over (Spec (.of k))) ⟶ C) :
    P ≫ ofCurve P = η[Jacobian C] :=
  sorry

/--
The universal property of the Jacobian variety: For any abelian variety `A`,
any morphism `f : C ⟶ A` such that `f(P) = 0` factors uniquely through the
Jacobian of `C`.
In other words, `Jacobian C` is the Albanese variety of `C`.
-/
theorem exists_unique_ofCurve_comp (C : Over (Spec (.of k))) [IsProper C.hom]
    [SmoothOfRelativeDimension 1 C.hom] [GeometricallyIrreducible C.hom]
    (P : 𝟙_ (Over (Spec (.of k))) ⟶ C)
    {A : Over (Spec (.of k))} [Smooth A.hom] [IsProper A.hom] [GrpObj A]
    [GeometricallyIrreducible A.hom] (f : C ⟶ A) (hf : P ≫ f = η[A]) :
    ∃! (g : Jacobian C ⟶ A), f = ofCurve P ≫ g :=
  sorry
#24
How produced

Mini-Humanize workflow using Kimi K3 and GPT-6 Astra for proof development and Lean migration, followed by GPT-5.6-sol review and full evaluator verification.

230 space groups (Fedorov 1891 / Schoenflies 1891)
space_groups_230

Lean theorem statement

/-- **230 space groups** (Fedorov 1891; Schoenflies 1891). In
dimension 3 there are 230 space groups (orientation-preserving
equivalence), 219 (general affine equivalence), and 65 orientation-
preserving subfamily. -/
theorem space_groups :
    crystallographicCountOP 3 = 230 ∧
      crystallographicCount 3 = 219 ∧
        crystallographicCountOPOnly 3 = 65 := by
  sorry
#25
How produced

Mini-Humanize workflow using Kimi K3 and GPT-6 Astra for proof development and Lean migration, followed by GPT-5.6-sol review and full evaluator verification.

Topological classification of surfaces
topological_classification_of_surfaces

Verso theorem preview

theorem declaration uses `sorry`classification_of_surfaces (S : Type*) [TopologicalSpace S] [T2Space S] [ConnectedSpace S] [CompactSpace S] [ChartedSpace (EuclideanHalfSpace 2) S] [IsManifold (modelWithCornersEuclideanHalfSpace 2) 0 S] : Nonempty (S ≃ₜ Metric.sphere (0 : EuclideanSpace ℝ (Fin 3)) 1) ∨ ∃ p n, ((1 ≤ p ∨ 1 ≤ n) ∧ Nonempty (S ≃ₜ Quot (LeanEval.Topology.ClassificationOfSurfaces.OrientableRel p n))) ∨ (1 ≤ p ∧ Nonempty (S ≃ₜ Quot (LeanEval.Topology.ClassificationOfSurfaces.NonOrientableRel p n))) := S:Type u_1inst✝⁵:TopologicalSpace Sinst✝⁴:T2Space Sinst✝³:ConnectedSpace Sinst✝²:CompactSpace Sinst✝¹:ChartedSpace (EuclideanHalfSpace 2) Sinst✝:IsManifold (modelWithCornersEuclideanHalfSpace 2) 0 S⊢ Nonempty (S ≃ₜ ↑(Metric.sphere 0 1)) ∨ ∃ p n, (1 ≤ p ∨ 1 ≤ n) ∧ Nonempty (S ≃ₜ Quot (OrientableRel p n)) ∨ 1 ≤ p ∧ Nonempty (S ≃ₜ Quot (NonOrientableRel p n)) All goals completed! 🐙
#26
How produced

Mini-Humanize workflow using GPT-6 Astra for proof development and Lean 4.35 migration, followed by GPT-5.6-sol review and full evaluator verification.

Smallness of exceptional set to Littlewood's conjecture
einsiedler_katok_lindenstrauss

Lean theorem statement

theorem einsiedler_katok_lindenstrauss :
    dimH {(α, β) : ℝ × ℝ | Filter.atTop.liminf
      (fun n : ℕ ↦ n * distToNearestInt (n * α) * distToNearestInt (n * β)) > 0} = 0 := by
  sorry
#27
How produced

Humanifa workflow using GPT 5.6 sol to develop the proof, followed by Mini-Humanize-assisted migration and independent verification on Lean 4.35.0-rc3 / Mathlib 5e0c4e5239cb0a2d86d68a884bf52cfd963fce22. The complete workspace build, comparator, four-thread Nanoda, and Lean's default kernel passed.

Baker-Wüstholz theorem on linear forms in logarithms
bakerWustholz_linearForms_logs

Verso theorem preview

theorem declaration uses `sorry`bakerWustholz_linearForms_logs {n : ℕ} (hn : 0 < n) {K : Type*} [Field K] [NumberField K] (φ : K →+* ℂ) (α : Fin n → K) (hα : ∀ i, α i ≠ 0) (b : Fin n → ℤ) {B : ℕ} (hB : 2 ≤ B) (hbB : ∀ i, (b i).natAbs ≤ B) (hΛ_ne_zero : (∑ i, (b i : ℂ) * Complex.log (φ (α i))) ≠ 0) : Real.log ‖∑ i, (b i : ℂ) * Complex.log (φ (α i))‖ ≥ -(BakerWustholz.C n (Module.finrank ℚ K) * max (Real.log B) (1 / (Module.finrank ℚ K : ℝ)) * ∏ i, BakerWustholz.modifiedHeight φ (α i)) := n:ℕhn:0 < nK:Type u_1inst✝¹:Field Kinst✝:NumberField Kφ:K →+* ℂα:Fin n → Khα:∀ (i : Fin n), α i ≠ 0b:Fin n → ℤB:ℕhB:2 ≤ BhbB:∀ (i : Fin n), (b i).natAbs ≤ BhΛ_ne_zero:∑ i, ↑(b i) * log (φ (α i)) ≠ 0⊢ Real.log ‖∑ i, ↑(b i) * log (φ (α i))‖ ≥ -(BakerWustholz.C n (Module.finrank ℚ K) * max (Real.log ↑B) (1 / ↑(Module.finrank ℚ K)) * ∏ i, BakerWustholz.modifiedHeight φ (α i)) All goals completed! 🐙
#28
How produced

Humanifa workflow using Kimi K3 and GPT-6 Astra for proof development and Lean 4.35 migration, followed by Mini-Humanize review and full official verification. The complete 4,621-job workspace build passed, and both four-thread Nanoda and the default Lean kernel accepted the solution.

Existence of an aspherical integer homology 4-sphere
aspherical_integer_homology_four_sphere

Lean theorem statement

/-- **Existence of an aspherical integer homology 4-sphere** (Tschantz, answering
`[Kir97, Problem 4.17]`). There is a closed topological 4-manifold that is both
aspherical and an integer homology 4-sphere. -/
theorem aspherical_integer_homology_four_sphere :
    ∃ M : Closed4Manifold, M.IsAspherical ∧ M.IsIntegerHomologySphere := by
  sorry
#29
How produced

Humanifa AI-assisted proof development, Mini-Humanize + Astra Lean 4.35 migration and memory-oriented module splitting, with GPT-5.6-sol review.

On the coherence of one-relator groups and their group algebras
annals_on_coherence_of_one_relator_groups

Lean theorem statement

/--
Statement of Theorem 1.1:

Let `G` be a one-relator group and `K` be a field of characteristic zero.
Then `G` is a coherent group and the group algebra `K[G]` is a coherent ring.
-/
theorem theorem_1_1 (G K : Type*) [Group G] [Field K] [CharZero K] (hG : Group.OneRelator G) :
    Group.Coherent G ∧ Ring.Coherent (MonoidAlgebra K G) := by
  sorry
#30
How produced

Humanifa workflow using AI-assisted proof development, Mini-Humanize + GPT-6 Astra migration to Lean 4.35, followed by GPT 5.6 sol review. The exact source was verified against Lean-Eval commit `0e093293afbe96be91504ae6e44947876d3fc84e` with Lean 4.35.0-rc3 and Mathlib `5e0c4e5239cb0a2d86d68a884bf52cfd963fce22`. The complete 4,254-job workspace build passed, and comparator, four-thread Nanoda, the default Lean kernel, and the axiom audit accepted the solution.

A proof of the Erdős–Faber–Lovász conjecture
annals_erdos_faber_lovasz_conjecture

Lean theorem statement

/--
Statement of Theorem 1.1:

For sufficiently large `n : ℕ`, every linear hypergraph on `n` vertices has chromatic index
at most `n`.
-/
theorem theorem_1_1 :
    ∀ᶠ n in atTop, ∀ 𝓗 : Hypergraph (Fin n), 𝓗.IsLinear → 𝓗.chromaticIndex ≤ n := by
  sorry
#31
How produced

Humanifa workflow with iterative AI proof development, Lean 4.35 migration, GPT 5.6 sol review, and independent verification against Lean 4.35.0-rc3 / Mathlib 5e0c4e5239cb0a2d86d68a884bf52cfd963fce22. The complete workspace build passed, and comparator, Nanoda, the default Lean kernel, and the axiom audit accepted the solution.

Bender–Suzuki theorem (classification of finite simple groups with a strongly-embedded subgroup)
bender_suzuki

Lean theorem statement

/-- **Bender–Suzuki theorem.** -/
theorem bender_suzuki {X : Type*} [Group X] [Finite X] [IsSimpleGroup X]
    (M : Subgroup X) (h : IsStronglyEmbedded M) :
    IsSimpleBenderGroup X := by
  sorry
#32
How produced

Humanifa workflow using Kimi K3 and GPT-6 Astra for proof development and Lean migration, followed by GPT 5.6 sol review. The exact Lean source was verified against Lean-Eval commit `0e093293afbe96be91504ae6e44947876d3fc84e` with Lean 4.35.0-rc3 and Mathlib `5e0c4e5239cb0a2d86d68a884bf52cfd963fce22`. The full build, comparator, Nanoda, and the default Lean kernel passed. The submitted packaging commit contains the same 942 Lean files as the verified migration commit.

The Hasse principle for random Fano hypersurfaces
annals_hasse_principle_random_fano

Lean theorem statement

/--
Statement of Theorem 1.1:

Let `d ≥ 2` and `n ≥ d` with `(d, n) ≠ (3, 3)`. Then we have `lim_{A → ∞} ρ_{d,n}(A) = ρˡᵒᶜ_{d,n}`.
-/
theorem theorem_1_1 (hd : 2 ≤ d) (h₁ : d ≤ n) (h₂ : (d, n) ≠ (3, 3)) :
    Tendsto (ρ d n) atTop (nhds (ρLoc d n)) := by
  sorry
#33
How produced

Humanifa mini-humanize workflow for proof development and Lean migration, followed by GPT 5.6 sol review. The exact source commit was verified against Lean-Eval commit 0e093293afbe96be91504ae6e44947876d3fc84e with Lean 4.35.0-rc3 and Mathlib 5e0c4e5239cb0a2d86d68a884bf52cfd963fce22. The full build, comparator, Nanoda, and the default Lean kernel passed.

Inscribed rectangles in a smooth Jordan curve attain at least one third of all aspect ratios
annals_inscribed_rectangles

Lean theorem statement

/--
Statement of Theorem 1:

Let `γ` be a smooth Jordan curve, and let `X` be the set of all `r ∈ [0,1]` so that there is an
inscribed rectangle in `γ` of aspect ratio `tan(r·π/4)`.
Then the Lebesgue measure of `X` is at least `1/3`.
-/
theorem theorem_1 (γ : Circle → ℝ × ℝ) (hγ : IsSmoothEmbedding (𝓡 1) 𝓘(ℝ, ℝ × ℝ) ∞ γ) :
    volume (X γ) ≥ 1/3 := by
  sorry
#34
How produced

Humanifa workflow using Kimi K3 and GPT-6 Astra for proof development and Lean migration, followed by GPT 5.6 sol review. The exact source commit was verified against Lean-Eval commit 0e093293afbe96be91504ae6e44947876d3fc84e with Lean 4.35.0-rc3 and Mathlib 5e0c4e5239cb0a2d86d68a884bf52cfd963fce22. The full build, comparator, Nanoda, and the default Lean kernel passed. This is an unchanged-source infrastructure retry of #1854.

Avila-Jitomirskaya Ten Martini Problem
ten_martini_problem

Lean theorem statement

/-- **Avila-Jitomirskaya Ten Martini theorem.** For irrational frequency
and nonzero coupling, the spectrum of the almost Mathieu operator is a
Cantor set. Here this means nonempty, compact, perfect, and totally
disconnected. -/
theorem ten_martini_problem (α coupling θ : ℝ)
    (hα : Irrational α) (hcoupling : coupling ≠ 0) :
    ∃ H : EllTwo →L[ℂ] EllTwo,
      IsAlmostMathieuOperator α coupling θ H ∧
        (spectrum ℂ H).Nonempty ∧
        IsCompact (spectrum ℂ H) ∧
        Perfect (spectrum ℂ H) ∧
        IsTotallyDisconnected (spectrum ℂ H) := by
  sorry
#35
How produced

Humanifa mini-humanize workflow for proof development and Lean migration, followed by GPT 5.6 sol review. The exact source commit was verified against Lean-Eval commit 0e093293afbe96be91504ae6e44947876d3fc84e with Lean 4.35.0-rc3 and Mathlib 5e0c4e5239cb0a2d86d68a884bf52cfd963fce22. The full build, comparator, Nanoda, and the default Lean kernel passed. This is an unchanged-source infrastructure retry of #1855.

Mostow rigidity
mostow_rigidity

Lean theorem statement

theorem mostow_rigidity (n : ℕ) (hn : 3 ≤ n) (Γ Λ : Subgroup (PO n 1))
    (disc_Γ : IsDiscrete (SetLike.coe Γ)) (disc_Λ : IsDiscrete (SetLike.coe Λ))
    [HasFundamentalDomain Γ (PO n 1)] [HasFundamentalDomain Λ (PO n 1)]
    (covol_Γ : covolume Γ (PO n 1) ≠ ⊤) (covol_Λ : covolume Λ (PO n 1) ≠ ⊤)
    (f : Γ ≃* Λ) : ∃ g : PO n 1, ∀ γ : Γ, f γ = g * γ * g⁻¹ := by
  sorry
#36
How produced

Humanifa workflow using GPT-5.6 sol to migrate and verify the completed proof on Lean 4.34.1 / Mathlib d13f23b723b8a846827a245b89c10fc7d3f11612. Full build, comparator, Nanoda, and the default Lean kernel passed.

Pardon's lower bound for torus-knot distortion
pardon_torus_knot_distortion

Lean theorem statement

/-- **Pardon's torus-knot distortion bound (smooth specialization).**

If `p` and `q` are positive and coprime, every smooth knot in the
orientation-preserving smooth ambient-isotopy class of the explicit standard
`(p, q)`-torus curve has distortion at least `min(p, q) / 160`. -/
theorem pardon_torus_knot_distortion
    (p q : ℕ) (_hp : 0 < p) (_hq : 0 < q) (_hc : Nat.Coprime p q)
    (K : Knot)
    (_hclass : ∃ Φ : AmbientIsotopy, ∃ σ : CircleReparam,
      ∀ t, Φ.H 1 (K.curve t) = standardTorusCurve p q (σ.f t)) :
    (1 / 160 : ℝ≥0∞) * (Nat.min p q : ℝ≥0∞) ≤ distortion K := by
  sorry
#37
How produced

Humanifa workflow using GPT-5.6 sol to migrate and verify the completed proof on Lean 4.34.1 / Mathlib d13f23b723b8a846827a245b89c10fc7d3f11612. Full build, comparator, Nanoda, and the default Lean kernel passed.

Bourgain's polynomial ergodic theorem
bourgain_polynomial_ergodic

Lean theorem statement

/-- Bourgain's polynomial ergodic theorem: for every integer-polynomial
iterate sequence and every `L^p`, `p > 1`, function, the polynomial ergodic
averages converge pointwise almost everywhere. -/
theorem bourgain_polynomial_ergodic
    [IsProbabilityMeasure μ] {p : ℝ≥0∞} (hp : 1 < p) (hp_ne_top : p ≠ ∞)
    {T : X → X} (hT : MeasurePreserving T μ μ)
    {a : ℕ → ℕ} (ha : IsIntegerPolynomialSequence a)
    {f : X → ℝ} (hf : MemLp f p μ) :
    ∃ F : X → ℝ,
      ∀ᵐ x ∂μ,
        Tendsto (fun n : ℕ => polynomialErgodicAverage a T f (n + 1) x) atTop (𝓝 (F x)) := by
  sorry
#38
How produced

Humanifa workflow using GPT 5.6 sol to migrate and verify the completed proof on Lean 4.34.1 / Mathlib d13f23b723b8a846827a245b89c10fc7d3f11612. Full build, comparator, Nanoda, and the default Lean kernel passed.

Mihăilescu's theorem
mihailescu

Verso theorem preview

theorem declaration uses `sorry`mihailescu {x y m n : ℕ} (hx : 0 < x) (hy : 0 < y) (hm : 1 < m) (hn : 1 < n) (h : x ^ m = y ^ n + 1) : x = 3 ∧ y = 2 ∧ m = 2 ∧ n = 3 := x:ℕy:ℕm:ℕn:ℕhx:0 < xhy:0 < yhm:1 < mhn:1 < nh:x ^ m = y ^ n + 1⊢ x = 3 ∧ y = 2 ∧ m = 2 ∧ n = 3 All goals completed! 🐙
#39
Good Locally Testable Codes
annals_good_lt_codes

Lean theorem statement

/--
Statement of Theorem 1.2:

There exist explicit good locally testable codes (for every rate `ρ < 1`).
-/
theorem theorem_1_2 (ρ : ℝ≥0) (hρ : ρ < 1) :
    ∃ q, ∃ κ ≠ 0, ∃ (n : ℕ → ℕ), ∃ (𝒞 : (i : ℕ) → BinaryCode (n i)), IsGood 𝒞 ∧
      ∀ i, Nonempty (LTC q κ (𝒞 i)) ∧ rate (𝒞 i) ≥ ρ := by
  sorry
#40
Newlander–Nirenberg theorem
newlander_nirenberg

Lean theorem statement

/-- **The Newlander–Nirenberg theorem.** An almost complex structure with
vanishing Nijenhuis tensor is integrable. Formally: for every `x` in an open
set `U ⊆ ℝ^{2n}` carrying such a structure `J` there is a smooth local
diffeomorphism `φ` (an `OpenPartialHomeomorph`, smooth in both directions)
from a neighbourhood of `x` inside `U` onto an open subset of `ℂⁿ` whose
differential is complex linear:

  `dφ_y (J y v) = i · dφ_y v`.

Such charts are holomorphic coordinates for `J`. -/
theorem newlander_nirenberg {n : ℕ} {U : Set (E n)} (_hU : IsOpen U)
    (J : E n → E n →L[ℝ] E n) (_hJ : IsAlmostComplexOn J U)
    (_hN : NijenhuisVanishesOn J U) {x : E n} (_hx : x ∈ U) :
    ∃ φ : OpenPartialHomeomorph (E n) (EuclideanSpace ℂ (Fin n)),
      x ∈ φ.source ∧ φ.source ⊆ U ∧
      ContDiffOn ℝ ∞ (φ : E n → EuclideanSpace ℂ (Fin n)) φ.source ∧
      ContDiffOn ℝ ∞ (φ.symm : EuclideanSpace ℂ (Fin n) → E n) φ.target ∧
      ∀ y ∈ φ.source, ∀ v : E n,
        fderiv ℝ (φ : E n → EuclideanSpace ℂ (Fin n)) y (J y v)
          = Complex.I • fderiv ℝ (φ : E n → EuclideanSpace ℂ (Fin n)) y v := by
  sorry
#41
Adams: S^n is an H-space iff n = 0, 1, 3, 7
hSpace_sphere_iff

Lean theorem statement

/-- **Adams' Hopf-invariant-one theorem** (H-space form). The sphere `𝕊ⁿ`
admits an H-space structure if and only if `n = 0`, `1`, `3`, or `7`. -/
theorem hSpace_sphere_iff (n : ℕ) :
    Nonempty (HSpace (Metric.sphere (0 : EuclideanSpace ℝ (Fin (n + 1))) 1)) ↔
      n = 0 ∨ n = 1 ∨ n = 3 ∨ n = 7 := by
  sorry
#42
Equichordal point theorem (convex curves have a unique equichordal point)
equichordal_point_unique

Verso theorem preview

theorem declaration uses `sorry`equichordal_point_unique {K : Set LeanEval.Geometry.Equichordal.Plane} (hK : IsCompact K) (hconv : Convex ℝ K) (hne : (interior K).Nonempty) : ¬ ∃ P Q : LeanEval.Geometry.Equichordal.Plane, P ≠ Q ∧ LeanEval.Geometry.Equichordal.IsEquichordalPoint K P ∧ LeanEval.Geometry.Equichordal.IsEquichordalPoint K Q := K:Set PlanehK:IsCompact Khconv:Convex ℝ Khne:(interior K).Nonempty⊢ ¬∃ P Q, P ≠ Q ∧ IsEquichordalPoint K P ∧ IsEquichordalPoint K Q All goals completed! 🐙
#43
Existence of a 779247-dim irreducible e₈-representation with 40 tensor-square isotypic components
e8_irrep_tensor_square_decomp

Lean theorem statement

theorem e8_irrep_tensor_square_decomp :
    ∃ (V : Type) (_ : AddCommGroup V) (_ : Module ℂ V)
      (_ : LieRingModule (LieAlgebra.e₈ ℂ) V) (_ : LieModule ℂ (LieAlgebra.e₈ ℂ) V),
      Module.finrank ℂ V = 779247 ∧
      LieModule.IsIrreducible ℂ (LieAlgebra.e₈ ℂ) V ∧
      (isotypicComponents (UniversalEnvelopingAlgebra ℂ (LieAlgebra.e₈ ℂ))
        (V ⊗[ℂ] V)).ncard = 40 := by
  sorry
#44
Quantifier elimination for the theory of real closed fields
rcf_quantifier_elimination

Verso theorem preview

/-- Quantifier elimination: `qe φ` is a quantifier-free formula equivalent to `φ` over `ℝ` in every environment. Its syntax may mention additional variables vacuously. -/ def declaration uses `sorry`qe (φ : Formula) : Formula := sorry
/-- The output of `qe` is quantifier free. -/ theorem declaration uses `sorry`isQF_qe (φ : Formula) : (qe φ).IsQF := sorry
/-- The output of `qe` is equivalent to its input, under every environment. -/ theorem declaration uses `sorry`holds_qe (φ : Formula) (env : Nat → ℝ) : (qe φ).Holds env ↔ φ.Holds env := sorry
/-- Anti-vacuity guard for the semantics and de Bruijn convention: a real number is a square exactly when it is nonnegative. -/ theorem declaration uses `sorry`holds_ex_sq (env : Nat → ℝ) : (Formula.ex (.eq (.mul (.var 0) (.var 0)) (.var 1))).Holds env ↔ (Formula.not (.lt (.var 0) (.const 0))).Holds env := sorry
#45
On a conjecture of Marton
annals_conjecture_of_marton

Verso theorem preview

theorem declaration uses `sorry`theorem_1_2 (A : Set (ConjectureOfMarton.F n)) (K : ℝ) (h₀ : A.Nonempty) (h : (A + A).ncard ≤ K * A.ncard) : ∃ H : AddSubgroup (ConjectureOfMarton.F n), Nat.card H ≤ A.ncard ∧ CovByVAdd (ConjectureOfMarton.F n) (2 * K ^ 12) A H := n:ℕA:Set (F n)K:ℝh₀:A.Nonemptyh:↑(A + A).ncard ≤ K * ↑A.ncard⊢ ∃ H, Nat.card ↥H ≤ A.ncard ∧ CovByVAdd (F n) (2 * K ^ 12) A ↑H All goals completed! 🐙
#46
Topological sphere theorem (Berger–Klingenberg–Rauch)
sphere_theorem_topological

Lean theorem statement

/-- **Topological sphere theorem** (Berger–Klingenberg–Rauch 1960). A closed,
simply-connected, smooth `d`-manifold (`d ≥ 2`) whose Levi-Civita connection is
strictly quarter-pinched is homeomorphic to the standard `d`-sphere. -/
theorem sphere_theorem
    [I.Boundaryless] [T2Space M] [CompactSpace M] [SimplyConnectedSpace M]
    (hdim : 2 ≤ Module.finrank ℝ E)
    (cov : CovariantDerivative I E (TangentSpace I (M := M)))
    [ContMDiffCovariantDerivative cov ∞]
    (_htor : cov.torsion = 0) (_hmet : IsMetricCompatible cov)
    (_hpinch : QuarterPinched cov) :
    Nonempty
      (M ≃ₜ sphere (0 : EuclideanSpace ℝ (Fin (Module.finrank ℝ E + 1))) 1) := by
  sorry
#47
How produced

Lean 4.33.0 port of an existing Humanifa + GPT 5.6 sol solution.

Glauberman's Z* theorem for isolated involutions
glauberman_zStar

Verso theorem preview

theorem declaration uses `sorry`glauberman_zStar (G : Type) [Group G] [Fintype G] (t : G) (ht1 : t ≠ 1) (ht2 : t * t = 1) (hisolated : ∀ g : G, (g * t * g⁻¹) * t = t * (g * t * g⁻¹) → g * t * g⁻¹ = t) : ∃ N : Subgroup G, N.Normal ∧ Odd (Nat.card N) ∧ ∀ g : G, g * t * g⁻¹ * t⁻¹ ∈ N := G:Typeinst✝¹:Group Ginst✝:Fintype Gt:Ght1:t ≠ 1ht2:t * t = 1hisolated:∀ (g : G), g * t * g⁻¹ * t = t * (g * t * g⁻¹) → g * t * g⁻¹ = t⊢ ∃ N, N.Normal ∧ Odd (Nat.card ↥N) ∧ ∀ (g : G), g * t * g⁻¹ * t⁻¹ ∈ N All goals completed! 🐙
#48
Morley's categoricity theorem
morley_categoricity_theorem

Verso theorem preview

theorem declaration uses `sorry`morley_categoricity_theorem (L : FirstOrder.Language.{0, 0}) (hL : L.card ≤ ℵ₀) (T : L.Theory) (hT : T.IsComplete) (hInf : ∀ M : FirstOrder.Language.Theory.ModelType.{0, 0, 0} T, Infinite M) {κ : Cardinal.{0}} (hκ : ℵ₀ < κ) (hcat : κ.Categorical T) {μ : Cardinal.{0}} (hμ : ℵ₀ < μ) : μ.Categorical T := L:FirstOrder.LanguagehL:L.card ≤ ℵ₀T:L.TheoryhT:T.IsCompletehInf:∀ (M : T.ModelType), Infinite ↑Mκ:Cardinal.{0}hκ:ℵ₀ < κhcat:κ.Categorical Tμ:Cardinal.{0}hμ:ℵ₀ < μ⊢ μ.Categorical T All goals completed! 🐙
#49
Schläfli classification of regular polytopes
schlafli_classification

Verso theorem preview

theorem declaration uses `sorry`schlafli_classification : platonicCount 3 = 5 ∧ platonicCount 4 = 6 ∧ ∀ d, 5 ≤ d → platonicCount d = 3 := ⊢ platonicCount 3 = 5 ∧ platonicCount 4 = 6 ∧ ∀ (d : ℕ), 5 ≤ d → platonicCount d = 3 All goals completed! 🐙
#50
Hardy–Littlewood sign-change for the prime race mod 4
chebyshev_sign_change

Verso theorem preview

theorem declaration uses `sorry`chebyshev_sign_change : LeanEval.NumberTheory.ChebyshevSignChangeProblem.chebyshevLead.Infinite ∧ {n : ℕ | primeCountingMod 3 n < primeCountingMod 1 n}.Infinite := ⊢ chebyshevLead.Infinite ∧ {n | primeCountingMod 3 n < primeCountingMod 1 n}.Infinite All goals completed! 🐙
#51
How produced

Change the name for model

De Branges's theorem (Bieberbach conjecture)
deBranges_theorem

Verso theorem preview

theorem declaration uses `sorry`deBranges (f : ℂ → ℂ) (diff : DifferentiableOn ℂ f (ball 0 1)) (inj : (ball 0 1).InjOn f) (h0 : f 0 = 0) (h1 : deriv f 0 = 1) (n : ℕ) : ‖iteratedDeriv n f 0 / n.factorial‖ ≤ n := f:ℂ → ℂdiff:DifferentiableOn ℂ f (ball 0 1)inj:Set.InjOn f (ball 0 1)h0:f 0 = 0h1:deriv f 0 = 1n:ℕ⊢ ‖iteratedDeriv n f 0 / ↑n.factorial‖ ≤ ↑n All goals completed! 🐙
#52
How produced

Change the name for model

Existence of a chiral oriented knot
exists_chiral_knot

Verso theorem preview

theorem declaration uses `sorry`exists_chiral_knot : ∃ K : LeanEval.KnotTheory.Knot, K.Chiral := ⊢ ∃ K, K.Chiral All goals completed! 🐙
#53
How produced

Change the name for model

Isoperimetric inequality (n-dim, topological-frontier form)
isoperimetric_inequality

Verso theorem preview

theorem declaration uses `sorry`isoperimetric (n : ℕ) (_hn : 2 ≤ n) (B : Set (LeanEval.Geometry.E n)) (_hB : MeasurableSet B) (_hBdd : Bornology.IsBounded B) : (n : ℝ≥0∞) ^ n * (volume B) ^ (n - 1) * volume (closedBall (0 : LeanEval.Geometry.E n) 1) ≤ (μHE[n - 1] (frontier B)) ^ n := n:ℕ_hn:2 ≤ nB:Set (E n)_hB:MeasurableSet B_hBdd:Bornology.IsBounded B⊢ ↑n ^ n * volume B ^ (n - 1) * volume (closedBall 0 1) ≤ μHE[n - 1] (frontier B) ^ n All goals completed! 🐙
#54
How produced

Change the name for model

Pesin entropy formula (symplectic surface case)
pesin_formula

Verso theorem preview

theorem declaration uses `sorry`pesin_formula (T T_inv : LeanEval.Dynamics.EucPlane → LeanEval.Dynamics.EucPlane) (hT_smooth : ContDiff ℝ 2 T) (hT_inv_smooth : ContDiff ℝ 2 T_inv) (hT_left : Function.LeftInverse T_inv T) (hT_right : Function.RightInverse T_inv T) (K : Set LeanEval.Dynamics.EucPlane) (hK_compact : IsCompact K) (hK_inv : T '' K = K) (μ : Measure LeanEval.Dynamics.EucPlane) [IsProbabilityMeasure μ] (hμ_supp : μ Kᶜ = 0) (hμ_pres : MeasurePreserving T μ μ) (hμ_erg : Ergodic T μ) (hμ_dim : dimMeasure μ = 2) (hlam_sym : ∫ x, lyapunovUpperAt T x ∂μ = -∫ x, lyapunovLowerAt T x ∂μ) : kolmogorovSinaiEntropy μ T = ∫ x, lyapunovUpperAt T x ∂μ := T:EucPlane → EucPlaneT_inv:EucPlane → EucPlanehT_smooth:ContDiff ℝ 2 ThT_inv_smooth:ContDiff ℝ 2 T_invhT_left:Function.LeftInverse T_inv ThT_right:Function.RightInverse T_inv TK:Set EucPlanehK_compact:IsCompact KhK_inv:T '' K = Kμ:Measure EucPlaneinst✝:IsProbabilityMeasure μhμ_supp:μ Kᶜ = 0hμ_pres:MeasurePreserving T μ μhμ_erg:Ergodic T μhμ_dim:dimMeasure μ = 2hlam_sym:∫ (x : EucPlane), lyapunovUpperAt T x ∂μ = -∫ (x : EucPlane), lyapunovLowerAt T x ∂μ⊢ kolmogorovSinaiEntropy μ T = ∫ (x : EucPlane), lyapunovUpperAt T x ∂μ All goals completed! 🐙
#55
How produced

Change the name for model

Shafarevich's relation-rank bound
shafarevich_relation_rank_bound

Verso theorem preview

theorem declaration uses `sorry`shafarevich_relation_rank_bound (F : Type) [Field F] [NumberField F] (p : ℕ) [Fact p.Prime] (_hpOdd : Odd p) : LeanEval.NumberTheory.H2Finite p (MaxUnramifiedProPGaloisGroup F p) ∧ (open Classical in relationRank p (MaxUnramifiedProPGaloisGroup F p) ≤ generatorRank (MaxUnramifiedProPGaloisGroup F p) + (NumberField.InfinitePlace.nrRealPlaces F + NumberField.InfinitePlace.nrComplexPlaces F - 1) + (if ∃ ζ : F, IsPrimitiveRoot ζ p then 1 else 0)) := F:Typeinst✝²:Field Finst✝¹:NumberField Fp:ℕinst✝:Fact (Nat.Prime p)_hpOdd:Odd p⊢ H2Finite p (MaxUnramifiedProPGaloisGroup F p) ∧ relationRank p (MaxUnramifiedProPGaloisGroup F p) ≤ generatorRank (MaxUnramifiedProPGaloisGroup F p) + (InfinitePlace.nrRealPlaces F + InfinitePlace.nrComplexPlaces F - 1) + if ∃ ζ, IsPrimitiveRoot ζ p then 1 else 0 All goals completed! 🐙
#56
How produced

Mini-Humanize workflow using Kimi K3 and GPT-6 Astra for proof development and Lean migration, followed by GPT-5.6-sol review and full evaluator verification.

pi_(n+1) of S^n is Z/2 for n at least 3
pi_succ_sphere_n_mulEquiv_zmod_two

Verso theorem preview

theorem declaration uses `sorry`pi_succ_sphere_n_mulEquiv_zmod_two (n : ℕ) (hn : 3 ≤ n) (x : Metric.sphere (0 : EuclideanSpace ℝ (Fin (n + 1))) 1) : Nonempty (HomotopyGroup.Pi (n + 1) (Metric.sphere (0 : EuclideanSpace ℝ (Fin (n + 1))) 1) x ≃* Multiplicative (ZMod 2)) := n:ℕhn:3 ≤ nx:↑(Metric.sphere 0 1)⊢ Nonempty (HomotopyGroup.Pi (n + 1) (↑(Metric.sphere 0 1)) x ≃* Multiplicative (ZMod 2)) All goals completed! 🐙
#57
How produced

Humanifa workflow using GPT 5.6 sol to develop the proof, followed by Mini-Humanize-assisted migration and independent verification on Lean 4.35.0-rc3 / Mathlib 5e0c4e5239cb0a2d86d68a884bf52cfd963fce22. The complete workspace build, comparator, four-thread Nanoda, and Lean's default kernel passed.

Lagarias criterion is equivalent to RH
riemann_hypothesis_iff_lagarias_elementary_criterion

Verso theorem preview

theorem declaration uses `sorry`riemann_hypothesis_iff_lagarias_elementary_criterion : RiemannHypothesis ↔ LeanEval.NumberTheory.LagariasElementaryCriterion := ⊢ RiemannHypothesis ↔ LagariasElementaryCriterion All goals completed! 🐙
#58
How produced

Humanifa iterative proof development using Mini-Humanize, with GPT Astra proof-term optimization and GPT-5.6-sol review. This revision replaces all 381 `with_unfolding_all` certificates with structurally shallower proofs and passes comparator, four-worker default-stack Nanoda, and Lean default-kernel checks on the official Lean 4.35.0-rc3 benchmark.

Bounded gaps between primes
zhang_bounded_prime_gaps

Verso theorem preview

theorem declaration uses `sorry`zhang_bounded_prime_gaps : ∀ n : ℕ, ∃ p q : ℕ, n ≤ p ∧ p.Prime ∧ q.Prime ∧ p < q ∧ q - p ≤ 246 := ⊢ ∀ (n : ℕ), ∃ p q, n ≤ p ∧ Nat.Prime p ∧ Nat.Prime q ∧ p < q ∧ q - p ≤ 246 All goals completed! 🐙
#59
Martinet's asymptotically-good totally real towers
martinet_totally_real_towers

Verso theorem preview

theorem declaration uses `sorry`exists_totallyReal_discr_le : ∃ C : ℝ, 0 < C ∧ ∀ N : ℕ, ∃ d : ℕ, N ≤ d ∧ ∃ (K : Type) (_ : Field K) (_ : NumberField K) (_ : NumberField.IsTotallyReal K), Module.finrank ℚ K = d ∧ |(NumberField.discr K : ℝ)| ≤ C ^ d := ⊢ ∃ C, 0 < C ∧ ∀ (N : ℕ), ∃ d, N ≤ d ∧ ∃ K x, ∃ (x_1 : NumberField K) (_ : IsTotallyReal K), Module.finrank ℚ K = d ∧ |↑(discr K)| ≤ C ^ d All goals completed! 🐙
#60
Erdős's unit-distance conjecture is false
erdos_unit_distance_conjecture_false

Verso theorem preview

theorem declaration uses `sorry`erdos_unit_distance_conjecture_false : ∃ δ : ℝ, 0 < δ ∧ ∀ N : ℕ, ∃ (n : ℕ) (P : Finset (EuclideanSpace ℝ (Fin 2))), N ≤ n ∧ P.card = n ∧ (n : ℝ) ^ (1 + δ) ≤ (unitDist P : ℝ) := ⊢ ∃ δ, 0 < δ ∧ ∀ (N : ℕ), ∃ n P, N ≤ n ∧ P.card = n ∧ ↑n ^ (1 + δ) ≤ ↑(unitDist P) All goals completed! 🐙
#61
Fractal uncertainty in higher dimensions
annals_fractal_uncertainty

Lean theorem statement

/--
Statement of Theorem 1.1:

Let `ν > 0` and assume that
- `X ⊆ [−1,1]ᵈ` is `ν`-porous on balls from scales `h` to `1`, and
- `Y ⊆ [−h⁻¹,h⁻¹]ᵈ` is `ν`-porous on lines from scales `1` to `h⁻¹`.
Then there exist `β,C > 0` depending only on `ν` and `d` such that for all `f ∈ L²(ℝᵈ)`,
`supp (𝓕 f) ⊆ Y => ‖f * 1_X‖₂ ≤ C * h ^ β * ‖f‖₂`.
Note: We require `X` and `Y` to be measurable to make the statement more natural.
-/
theorem theorem_1_1 (ν : ℝ) (hν₀ : 0 < ν) :
    ∃ (β C : ℝ), β > 0 ∧ C > 0 ∧ ∀ (h : ℝ) (X Y : Set ℝᵈ)
      (hX : MeasurableSet X) (hY : MeasurableSet Y), h ∈ Set.Ioo 0 (1 / 100) →
        X ⊆ cube (-1) 1 → PorousOnBalls ν h 1 X → Y ⊆ cube (-h⁻¹) h⁻¹ →
          PorousOnLines ν 1 h⁻¹ Y → ∀ (f : Lp ℂ 2), (𝓕 f : Lp ℂ 2) =ᵐ[volume.restrict Yᶜ] 0 →
            (eLpNorm (X.indicator f) 2).toReal ≤ C * h ^ β * ‖f‖ := by
  sorry
#62
Neukirch–Uchida theorem
neukirch_uchida

Verso theorem preview

theorem declaration uses `sorry`neukirch_uchida {K₁ K₂ K₁' K₂' : Type*} [Field K₁] [Field K₂] [Field K₁'] [Field K₂'] [NumberField K₁] [NumberField K₂] [Algebra K₁ K₁'] [Algebra K₂ K₂'] [IsSepClosure K₁ K₁'] [IsSepClosure K₂ K₂'] (ϕ : Gal(K₁'/K₁) ≃* Gal(K₂'/K₂)) (he : IsHomeomorph ϕ) : ∃! σ : K₂' ≃+* K₁', (algebraMap K₂ K₂').range.map σ.toRingHom = (algebraMap K₁ K₁').range ∧ ∀ g : Gal(K₁'/K₁), ϕ g = σ.trans (g.toRingEquiv.trans σ.symm) := K₁:Type u_1K₂:Type u_2K₁':Type u_3K₂':Type u_4inst✝⁹:Field K₁inst✝⁸:Field K₂inst✝⁷:Field K₁'inst✝⁶:Field K₂'inst✝⁵:NumberField K₁inst✝⁴:NumberField K₂inst✝³:Algebra K₁ K₁'inst✝²:Algebra K₂ K₂'inst✝¹:IsSepClosure K₁ K₁'inst✝:IsSepClosure K₂ K₂'ϕ:Gal(K₁'/K₁) ≃* Gal(K₂'/K₂)he:IsHomeomorph ⇑ϕ⊢ ∃! σ, Subring.map σ.toRingHom (algebraMap K₂ K₂').range = (algebraMap K₁ K₁').range ∧ ∀ (g : Gal(K₁'/K₁)), (ϕ g).toRingEquiv = σ.trans (g.toRingEquiv.trans σ.symm) All goals completed! 🐙
#63
Conway–Schneeberger fifteen theorem
conway_schneeberger_fifteen

Verso theorem preview

theorem declaration uses `sorry`conway_schneeberger_fifteen {n : ℕ} (Q : Matrix (Fin n) (Fin n) ℤ) (_hpos : Q.PosDef) : LeanEval.NumberTheory.ConwaySchneebergerFifteenProblem.IsUniversal Q ↔ ∀ k ∈ Finset.Icc (1 : ℤ) 15, LeanEval.NumberTheory.ConwaySchneebergerFifteenProblem.Represents Q k := n:ℕQ:Matrix (Fin n) (Fin n) ℤ_hpos:Q.PosDef⊢ IsUniversal Q ↔ ∀ k ∈ Finset.Icc 1 15, Represents Q k All goals completed! 🐙
#64
Strong normalization and consistency for the calculus of constructions with a universe hierarchy
coc_strong_normalization

Verso theorem preview

/-- Anti-vacuity guard: the polymorphic identity `λ (A : Prop). λ (x : A). x` has type `Π (A : Prop). Π (x : A). A`. This is typable only because `Prop` is impredicative. -/ theorem declaration uses `sorry`typing_polyId : Typing [] (.lam (.srt .prop) (.lam (.var 0) (.var 0))) (.pi (.srt .prop) (.pi (.var 0) (.var 1))) := sorry
/-- Anti-vacuity guard: applying the polymorphic identity to `False` exercises application typing. Here `False` is encoded as `Π (P : Prop). P`. -/ theorem declaration uses `sorry`typing_polyId_app : Typing [] (.app (.lam (.srt .prop) (.lam (.var 0) (.var 0))) (.pi (.srt .prop) (.var 0))) (.pi (.pi (.srt .prop) (.var 0)) (.pi (.srt .prop) (.var 0))) := sorry
/-- Anti-vacuity guard: the same application takes its expected beta step. -/ theorem declaration uses `sorry`step_polyId_app : Step (.app (.lam (.srt .prop) (.lam (.var 0) (.var 0))) (.pi (.srt .prop) (.var 0))) (.lam (.pi (.srt .prop) (.var 0)) (.var 0)) := sorry
/-- Types are preserved by reduction. -/ theorem declaration uses `sorry`subject_reduction (Γ : List Tm) (t t' A : Tm) : Typing Γ t A → Step t t' → Typing Γ t' A := sorry
/-- Every well-typed term is strongly normalizing. -/ theorem declaration uses `sorry`strong_normalization (Γ : List Tm) (t A : Tm) : Typing Γ t A → SN t := sorry
/-- The system is logically consistent: `Π (P : Prop). P` is not inhabited. -/ theorem declaration uses `sorry`consistency : ¬ ∃ t : Tm, Typing [] t (.pi (.srt .prop) (.var 0)) := sorry
#65
New large value estimates for Dirichlet polynomials
annals_large_value_estimates

Verso theorem preview

theorem declaration uses `sorry`theorem_1_1 : ∃ o : ℝ → ℝ, o =o[Filter.atTop] (1 : ℝ → ℝ) ∧ ∀ (b : ℕ → ℂ) (_hb : ∀ n, ‖b n‖ ≤ 1) (N : ℕ) (V : ℝ) (T : ℝ) (R : ℕ) (t : Fin R → ℝ), N > 0 → V > 0 → T > 1 → -- these assumptions are necessary but not stated in the paper (∀ i j, i ≠ j → |t i - t j| ≥ 1) → (∀ i, t i ∈ Set.Icc 0 T) → (∀ r, ‖∑ n ∈ Finset.Icc N (2 * N), b n * n ^ (I * t r)‖ ≥ V) → R ≤ T ^ (o T) * bound N V T := ⊢ ∃ o, o =o[Filter.atTop] 1 ∧ ∀ (b : ℕ → ℂ), (∀ (n : ℕ), ‖b n‖ ≤ 1) → ∀ (N : ℕ) (V T : ℝ) (R : ℕ) (t : Fin R → ℝ), N > 0 → V > 0 → T > 1 → (∀ (i j : Fin R), i ≠ j → |t i - t j| ≥ 1) → (∀ (i : Fin R), t i ∈ Set.Icc 0 T) → (∀ (r : Fin R), ‖∑ n ∈ Finset.Icc N (2 * N), b n * ↑n ^ (I * ↑(t r))‖ ≥ V) → ↑R ≤ T ^ o T * bound N V T All goals completed! 🐙
#66
Coherent cohomology of a proper scheme over ℚ is finite-dimensional
coherent_cohomology_finite_dimensional

Verso theorem preview

theorem declaration uses `sorry`coherent_cohomology_finite_dimensional (f : X ⟶ Spec (CommRingCat.of ℚ)) [IsProper f] [M.IsFiniteType] [M.IsQuasicoherent] (n : ℕ) : Module.Finite ℚ (ℚ ⊗[ℤ] M.sheaf.H n) := X:SchemeM:X.Modulesf:X ⟶ Spec ↧ℚinst✝²:IsProper finst✝¹:SheafOfModules.IsFiniteType Minst✝:SheafOfModules.IsQuasicoherent Mn:ℕ⊢ Module.Finite ℚ (ℚ ⊗[ℤ] Sheaf.H Scheme.Modules.sheaf n) All goals completed! 🐙
#67
A negative answer to Ulam's Problem 19 from the Scottish Book
annals_ulam

Verso theorem preview

theorem declaration uses `sorry`theorem_1 (hd : 3 ≤ d) : letI : NeZero d := ⟨d:ℕhd:3 ≤ d⊢ d ≠ 0 All goals completed! 🐙⟩ ∃ K : Ulam.BodyOfRevolution d, Ulam.IsStrictlyConvexBody K.body ∧ ¬ Ulam.IsCentrallySymmetric K.body ∧ Ulam.FloatsInEquilibriumInEveryOrientationAtLevel K.body (volume.real K.body / 2) := d:ℕhd:3 ≤ d⊢ ∃ K, IsStrictlyConvexBody K.body ∧ ¬IsCentrallySymmetric K.body ∧ FloatsInEquilibriumInEveryOrientationAtLevel K.body (volume.real K.body / 2) All goals completed! 🐙
#68
Enumerating number fields
annals_enumerating_number_fields

Lean theorem statement

/--
Statement of Theorem 1 (Number fields have small models):

There exists a positive constant `Q` such that the following is true. Let `K` be a number field
of degree `n ≥ Q` and root discriminant `δ` over `ℚ`. Then there exist integers `r ≤ Q log n` and
`d ≤ Q log n` such that `(d + r) choose r ≤ Q n log n`, and there exist `r` polynomials
`E₁, ..., Eᵣ` of degree `≤ d` in `ℤ[x₁, ..., xᵣ]` all having coefficients bounded in absolute value
by `(n δ) ^ (Q log n)` such that the (smooth and zero-dimensional affine) scheme with equations
`E₁ = ... = Eᵣ = 0` and `det (∂Eᵢ/∂xⱼ) ≠ 0` contains `Spec K` as one of its irreducible components.
-/
theorem theorem_1 : ∃ Q > 0, ∀ n ≥ Q, ∀ K : NumberFieldOfDegree n, ∃ (r d : ℕ),
    r ≤ Q * log n ∧ d ≤ Q * log n ∧ (d + r).choose r ≤ Q * n * log n ∧
      ∃ E : Fin r → MvPolynomial (Fin r) ℤ, (∀ i, (E i).totalDegree ≤ d) ∧
        (∀ i j, |(E i).coeff j| ≤ (n * rootDiscr K) ^ (Q * log n)) ∧
          letI X := nonsingularOpen fun i ↦ (E i).map (algebraMap ℤ ℚ)
          ∃ Z, ∃ hZ : Z ∈ irreducibleComponents X,
            Nonempty (X.irreducibleComponent Z hZ ≅ Spec (.of K)) := by
  sorry

/--
Statement of Theorem 2 (Number fields with bounded discriminant):

There exists a positive constant `Q` such that the following is true. Let `n ≥ Q` be an integer.
Let `H ≥ 1` be an integer. The number of isomorphism classes of number fields
with degree `n` and discriminant `≤ H` is `≤ n^(Q n log^3 n) H^(Q log^3 n)`.
-/
theorem theorem_2 : ∃ Q > 0, ∀ n ≥ Q, ∀ H ≥ 1,
    (Nat.card (NumberFieldOfBoundedDiscriminantUpToIsomorphism n H) : ℝ) ≤
      n ^ (Q * n * log n ^ 3) * H ^ (Q * log n ^ 3) := by
  sorry
#69
Viscosity solutions and hyperbolic motions: a new PDE method for the N-body problem
annals_viscosity_solutions

Verso theorem preview

theorem declaration uses `sorry`theorem_1_1 (hE : 2 ≤ Module.finrank ℝ E) (m : ℝᴺ) (hm : ∀ i, 0 < m i) (x₀ a : Eᴺ) (a_nc : ViscositySolutions.WithoutCollisions a) (a_norm : ‖a‖_[m] = 1) (h : ℝ) (h_pos : h > 0) : ∃ x : ℝ → Eᴺ, ∃ o : ℝ → Eᴺ, (o =o[atTop] fun t ↦ t) ∧ x 0 = x₀ ∧ ViscositySolutions.IsNBodySolution m x ∧ (∀ t > 0, ViscositySolutions.WithoutCollisions (x t)) ∧ ∀ t ≥ 0, x t = (sqrt (2 * h) * t) • a + o t := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:InnerProductSpace ℝ Einst✝:FiniteDimensional ℝ EN:ℕhE:2 ≤ Module.finrank ℝ Em:Fin N → ℝhm:∀ (i : Fin N), 0 < m ix₀:Eᴺa:Eᴺa_nc:WithoutCollisions aa_norm:‖a‖_[m] = 1h:ℝh_pos:h > 0⊢ ∃ x o, (o =o[atTop] fun t => t) ∧ x 0 = x₀ ∧ IsNBodySolution m x ∧ (∀ t > 0, WithoutCollisions (x t)) ∧ ∀ t ≥ 0, x t = (√(2 * h) * t) • a + o t All goals completed! 🐙
#70
Galois groups of random integer polynomials and van der Waerden's Conjecture
annals_van_der_waerden_conjecture

Verso theorem preview

theorem declaration uses `sorry`theorem_1 (n : ℕ) (hn : 3 ≤ n) : (fun H ↦ (vanDerWaerdenConjecture.E n H : ℝ)) =O[atTop] (fun H ↦ (H ^ (n - 1) : ℝ)) := n:ℕhn:3 ≤ n⊢ (fun H => ↑(E n H)) =O[atTop] fun H => ↑H ^ (n - 1) All goals completed! 🐙
#71
On Zagier-Hoffman's conjectures in positive characteristic
annals_zagier_hoffman_positive_char

Lean theorem statement

/--
Statement of Theorem A (Brown's theorem in positive characteristic):

Let `w ∈ ℕ`, where `ℕ := {1,2,...}`. Then every MZV of weight `w` can be written as a `K`-linear
combination of MZV's in the set `𝒯_w`. In particular, `dim 𝒵_w ≤ d(w)`.
Note that `K` in the paper is `RatFunc F`.
-/
theorem theorem_A (w : ℕ+) :
    𝒵 F w = Submodule.span (RatFunc F) (𝒯 F w) ∧
    Module.rank (RatFunc F) (𝒵 F w) ≤ d F w := by
  sorry

/--
Statement of Theorem B:

Let `w ∈ ℕ`, where `ℕ := {1,2,...}`. MZVs of weight `w` in `𝒯0 w` are all linearly independent over
`K`. In particular, `dim 𝒵 w ≥ |𝒯0 w|`. Note that `K` in the paper is `RatFunc F`.
-/
theorem theorem_B (w : ℕ+) :
    LinearIndependent (RatFunc F) (Subtype.val : 𝒯0 F w → CompletionAtInfty F) ∧
    Module.rank (RatFunc F) (𝒵 F w) ≥ Set.ncard (𝒯0 F w) := by
  sorry

/--
Statement of Theorem D:

Let `w ∈ ℕ+` with `w ≤ 2q − 2`. Then `𝒯 w` is a `K`-basis for `𝒵 w`. In particular,
`dim_K (𝒵 w) = d(w)`. Note that `K` in the paper is `RatFunc F`.

Note: Theorem A establishes that `𝒯 w` spans `𝒵 w`. So to prove `𝒯 w` is a `K`-basis for `𝒵 w`, we
only need to show that `𝒯 w` are linearly independent in `𝒵 w`.
-/
theorem theorem_D (w : ℕ+) (hw : w ≤ 2 * Nat.card F - 2) :
    LinearIndependent (RatFunc F) (Subtype.val : 𝒯 F w → CompletionAtInfty F) ∧
    Module.rank (RatFunc F) (𝒵 F w) = d F w := by
  sorry
#72
Furstenberg measure-preserving multiple recurrence
furstenberg_measure

Verso theorem preview

theorem declaration uses `sorry`furstenberg_measure_recurrence {Ω : Type*} [MeasurableSpace Ω] (μ : MeasureTheory.Measure Ω) [MeasureTheory.IsProbabilityMeasure μ] {T : Ω → Ω} (_hT : MeasureTheory.MeasurePreserving T μ μ) {A : Set Ω} (_hA : MeasurableSet A) (_h0 : 0 < μ A) (d : ℕ) (_hd : 1 ≤ d) : ∃ n : ℕ, 1 ≤ n ∧ 0 < μ (A ∩ ⋂ j ∈ Finset.Icc 1 d, T^[j * n] ⁻¹' A) := Ω:Type u_1inst✝¹:MeasurableSpace Ωμ:Measure Ωinst✝:IsProbabilityMeasure μT:Ω → Ω_hT:MeasurePreserving T μ μA:Set Ω_hA:MeasurableSet A_h0:0 < μ Ad:ℕ_hd:1 ≤ d⊢ ∃ n, 1 ≤ n ∧ 0 < μ (A ∩ ⋂ j ∈ Finset.Icc 1 d, T^[j * n] ⁻¹' A) All goals completed! 🐙
#73
Schoenflies theorem
schoenflies

Verso theorem preview

theorem declaration uses `sorry`schoenflies (r : Metric.sphere (0 : EuclideanSpace ℝ (Fin 2)) 1 → EuclideanSpace ℝ (Fin 2)) (_hcont : Continuous r) (_hinj : Function.Injective r) : ∃ h : EuclideanSpace ℝ (Fin 2) ≃ₜ EuclideanSpace ℝ (Fin 2), h '' Set.range r = Metric.sphere (0 : EuclideanSpace ℝ (Fin 2)) 1 := r:↑(Metric.sphere 0 1) → EuclideanSpace ℝ (Fin 2)_hcont:Continuous r_hinj:Function.Injective r⊢ ∃ h, ⇑h '' Set.range r = Metric.sphere 0 1 All goals completed! 🐙
#74
Weak Morse inequalities
weak_morse_inequality

Lean theorem statement

/-- **Weak Morse inequalities.** For a Morse function `f` on a closed
smooth finite-dimensional Hausdorff manifold `M` and every `k ∈ ℕ`,
`b_k(M) ≤ c_k(f)`. -/
theorem weak_morse_inequality
    {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E]
    {H : Type*} [TopologicalSpace H] {I : ModelWithCorners ℝ E H} [I.Boundaryless]
    {M : Type} [TopologicalSpace M] [ChartedSpace H M] [IsManifold I ∞ M]
    [CompactSpace M] [T2Space M] (f : M → ℝ) (_hf : IsMorseFunction I f) (k : ℕ) :
    bettiNumber M k ≤ morseCount I f k := by
  sorry
#75
Morse inequalities
morse_inequality

Lean theorem statement

/-- **Morse inequalities** (Marston Morse, 1934). For a Morse function `f`
on a closed smooth finite-dimensional Hausdorff manifold `M` and every `k ∈ ℕ`,
`∑_{j≤k}(−1)^{k−j} c_j(f) ≥ ∑_{j≤k}(−1)^{k−j} b_j(M)`. -/
theorem morse_inequality
    {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E]
    {H : Type*} [TopologicalSpace H] {I : ModelWithCorners ℝ E H} [I.Boundaryless]
    {M : Type} [TopologicalSpace M] [ChartedSpace H M] [IsManifold I ∞ M]
    [CompactSpace M] [T2Space M] (f : M → ℝ) (_hf : IsMorseFunction I f) (k : ℕ) :
    alternatingPartialSum (bettiNumber M) k ≤
      alternatingPartialSum (morseCount I f) k := by
  sorry
#76
Thue–Siegel–Roth theorem (irrationality measure ≤ 2 for algebraic irrationals)
thue_siegel_roth

Lean theorem statement

/-- **Thue–Siegel–Roth theorem** (Klaus Roth, 1955). Every irrational
algebraic real is Diophantine: its irrationality measure is at most
`2`. -/
theorem thueSiegelRoth (x : ℝ) (_h_irr : Irrational x)
    (_h_alg : IsAlgebraic ℤ x) : IsDiophantine x := by
  sorry
#77
Connective constant of the honeycomb lattice
honeycomb_connective_constant

Verso theorem preview

theorem declaration uses `sorry`honeycomb_connective_constant : Tendsto (fun n ↦ (LeanEval.Combinatorics.HoneycombConnectiveConstant.walkCount n : ℝ) ^ (1 / n : ℝ)) atTop (nhds (Real.sqrt (2 + Real.sqrt 2))) := ⊢ Tendsto (fun n => ↑(walkCount n) ^ (1 / ↑n)) atTop (𝓝 √(2 + √2)) All goals completed! 🐙
#78
Ado–Iwasawa theorem over an arbitrary field
adoIwasawa

Verso theorem preview

theorem declaration uses `sorry`adoIwasawa [FiniteDimensional K L] : ∃ (V : Type u) (_ : AddCommGroup V) (_ : Module K V) (_ : FiniteDimensional K V) (ρ : L →ₗ⁅K⁆ Module.End K V), Function.Injective ρ := K:Type uL:Type uinst✝³:Field Kinst✝²:LieRing Linst✝¹:LieAlgebra K Linst✝:FiniteDimensional K L⊢ ∃ V x x_1, ∃ (_ : FiniteDimensional K V), ∃ ρ, Function.Injective ⇑ρ All goals completed! 🐙
#79
Upper bound theorem for geometric simplicial spheres (Stanley 1975)
upper_bound_simplicial_spheres

Verso theorem preview

theorem declaration uses `sorry`upper_bound_theorem_simplicial_spheres {d n k : ℕ} (X : LeanEval.Combinatorics.UpperBoundSimplicialSpheresProblem.FiniteSimplicialSphere d) (_hn : LeanEval.Combinatorics.UpperBoundSimplicialSpheresProblem.faceCount X 0 = n) (_hk : k < d) : LeanEval.Combinatorics.UpperBoundSimplicialSpheresProblem.faceCount X k ≤ LeanEval.Combinatorics.UpperBoundSimplicialSpheresProblem.cyclicPolytopeFaceCount n d k := d:ℕn:ℕk:ℕX:FiniteSimplicialSphere d_hn:faceCount X 0 = n_hk:k < d⊢ faceCount X k ≤ cyclicPolytopeFaceCount n d k All goals completed! 🐙
#80
Onsager's 2D Ising phase transition
ising_2d_phase_transition

Lean theorem statement

/-- **Onsager's 2D Ising phase transition.** The thermodynamic-limit free
energy exists for all `β` and is non-analytic at some positive `βc`. -/
theorem ising_2d_phase_transition :
    ∃ (F : ℝ → ℝ) (βc : ℝ),
      0 < βc ∧
        (∀ β : ℝ,
          Tendsto (fun n : ℕ => finiteIsingFreeEnergySeq n β) atTop (𝓝 (F β))) ∧
        ¬ AnalyticAt ℝ F βc := by
  sorry
#81
Gleason's theorem (separable Hilbert space)
gleason_theorem_separable

Lean theorem statement

/-- **Gleason's theorem**, separable Hilbert space version (Gleason's original 1957
formulation). For a separable complex Hilbert space `H` of dimension at least `3`, every
frame function on the unit sphere of `H` is given by `x ↦ re ⟨x, ρ x⟩` for some positive
bounded operator `ρ`. (The Lean conclusion does not separately assert trace-class /
`Tr ρ = 1`; see the file docstring.) -/
theorem gleason_theorem_separable
    {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H]
      [CompleteSpace H] [TopologicalSpace.SeparableSpace H]
    (hdim : 3 ≤ Module.rank ℂ H)
    (f : SphereFrameFunction H) :
    ∃ ρ : H →L[ℂ] H,
      ContinuousLinearMap.IsPositive ρ ∧
      ∀ x : Metric.sphere (0 : H) 1,
        f.f x = (inner ℂ (x : H) (ρ (x : H))).re := by
  sorry
#82
Wieferich's theorem g(3) = 9
wieferich_g_three

Verso theorem preview

theorem declaration uses `sorry`wieferich_g_three : (∀ n : ℕ, LeanEval.NumberTheory.IsSumOfCubes 9 n) ∧ ∃ n : ℕ, ¬ LeanEval.NumberTheory.IsSumOfCubes 8 n := ⊢ (∀ (n : ℕ), IsSumOfCubes 9 n) ∧ ∃ n, ¬IsSumOfCubes 8 n All goals completed! 🐙
#83
Brauer–Suzuki theorem (quaternion Sylow 2-subgroup)
brauer_suzuki

Verso theorem preview

theorem declaration uses `sorry`brauer_suzuki {G : Type*} [Group G] [Finite G] (n : ℕ) (hn : 3 ≤ n) (P : Sylow 2 G) (hquat : Nonempty ((P : Subgroup G) ≃* QuaternionGroup (2 ^ (n - 2)))) (t : G) (ht_mem : t ∈ (P : Subgroup G)) (ht_ord : orderOf t = 2) : (QuotientGroup.mk t : G ⧸ LeanEval.GroupTheory.Defs.oddCore G) ∈ Subgroup.center (G ⧸ LeanEval.GroupTheory.Defs.oddCore G) := G:Type u_1inst✝¹:Group Ginst✝:Finite Gn:ℕhn:3 ≤ nP:Sylow 2 Ghquat:Nonempty (↥↑P ≃* QuaternionGroup (2 ^ (n - 2)))t:Ght_mem:t ∈ ↑Pht_ord:orderOf t = 2⊢ ↑t ∈ Subgroup.center (G ⧸ oddCore G) All goals completed! 🐙
#84
Strong Mason conjecture for matroid independent sets
strong_mason_conjecture

Verso theorem preview

theorem declaration uses `sorry`strong_mason_conjecture {α : Type*} (M : Matroid α) [M.Finite] (k : ℕ) (hk : 0 < k) (hkn : k < M.E.ncard) : independentSetCount M (k - 1) * independentSetCount M (k + 1) * (k + 1) * (M.E.ncard - k + 1) ≤ independentSetCount M k ^ 2 * k * (M.E.ncard - k) := α:Type u_1M:Matroid αinst✝:M.Finitek:ℕhk:0 < khkn:k < M.E.ncard⊢ independentSetCount M (k - 1) * independentSetCount M (k + 1) * (k + 1) * (M.E.ncard - k + 1) ≤ independentSetCount M k ^ 2 * k * (M.E.ncard - k) All goals completed! 🐙
#85
The alternating sign matrix theorem
alternating_sign_matrix_count

Verso theorem preview

theorem declaration uses `sorry`alternating_sign_matrix_count (n : ℕ) : (Nat.card (LeanEval.Combinatorics.AlternatingSignMatrix.ASMatrix n) : ℚ) = LeanEval.Combinatorics.AlternatingSignMatrix.robbinsProduct n := n:ℕ⊢ ↑(Nat.card (ASMatrix n)) = robbinsProduct n All goals completed! 🐙
#86
Brauer's splitting field theorem
brauer_splitting_field

Verso theorem preview

theorem declaration uses `sorry`brauer_splitting_field (G : Type) [Group G] [Fintype G] (V : Type) [AddCommGroup V] [Module ℂ V] [FiniteDimensional ℂ V] (ρ : Representation ℂ G V) : ∃ (φ : CyclotomicField (Monoid.exponent G) ℚ →+* ℂ) (W : Type) (_ : AddCommGroup W) (_ : Module (CyclotomicField (Monoid.exponent G) ℚ) W) (σ : Representation (CyclotomicField (Monoid.exponent G) ℚ) G W), letI : Algebra (CyclotomicField (Monoid.exponent G) ℚ) ℂ := φ.toAlgebra ∃ (f : (ℂ ⊗[CyclotomicField (Monoid.exponent G) ℚ] W) ≃ₗ[ℂ] V), ∀ (g : G) (x : ℂ ⊗[CyclotomicField (Monoid.exponent G) ℚ] W), f ((σ g).baseChange ℂ x) = ρ g (f x) := G:Typeinst✝⁴:Group Ginst✝³:Fintype GV:Typeinst✝²:AddCommGroup Vinst✝¹:Module ℂ Vinst✝:FiniteDimensional ℂ Vρ:Representation ℂ G V⊢ ∃ φ W x x_1 σ f, ∀ (g : G) (x_2 : ℂ ⊗[CyclotomicField (Monoid.exponent G) ℚ] W), f ((LinearMap.baseChange ℂ (σ g)) x_2) = (ρ g) (f x_2) All goals completed! 🐙
#87
Mandelbrot set is connected (Douady–Hubbard)
mandelbrot_connected

Lean theorem statement

/-- **Mandelbrot set is connected** (Douady–Hubbard). -/
theorem mandelbrot_connected : IsConnected Mandelbrot := by
  sorry
#88
Platonic classification
platonic_classification

Verso theorem preview

theorem declaration uses `sorry`platonic_classification : platonicCount 2 = ⊤ ∧ platonicCount 3 = 5 ∧ platonicCount 4 = 6 ∧ ∀ d, 5 ≤ d → platonicCount d = 3 := ⊢ platonicCount 2 = ⊤ ∧ platonicCount 3 = 5 ∧ platonicCount 4 = 6 ∧ ∀ (d : ℕ), 5 ≤ d → platonicCount d = 3 All goals completed! 🐙
#89
pi_n of the n-sphere is Z
pin_sphere_n_mulEquiv_int

Lean theorem statement

/-- For every `n ≥ 1`, the `n`th homotopy group of the `n`-sphere is infinite cyclic. -/
theorem pin_sphere_n_mulEquiv_int
    (n : ℕ)
    (x : Metric.sphere (0 : EuclideanSpace ℝ (Fin (n + 2))) 1) :
    Nonempty
      (HomotopyGroup.Pi (n + 1) (Metric.sphere (0 : EuclideanSpace ℝ (Fin (n + 2))) 1) x ≃*
        Multiplicative ℤ) := by
  sorry
#90
Seventeen wallpaper groups (Pólya–Niggli 1924)
wallpaper_groups_17

Lean theorem statement

/-- **There are exactly 17 wallpaper groups** (Pólya–Niggli 1924). -/
theorem there_are_17_wallpaper_groups :
    crystallographicCount 2 = 17 := by
  sorry
#91
Bézout's theorem (projective, with multiplicity)
bezout_projective_multiplicity

Lean theorem statement

/-- **Bézout's theorem (with multiplicity).** Given `n` homogeneous
polynomials `f_k` in `n + 1` variables, each of total degree exactly
`d_k ≥ 1`, over an algebraically closed field with finite common
projective zero set, the sum of intersection multiplicities equals
`∏ d_k`. The `totalDegree` hypothesis rules out the zero polynomial
(which is `IsHomogeneous d` for every `d` but has `totalDegree = 0`). -/
theorem bezout_multiplicity [IsAlgClosed K] {n : ℕ}
    (f : Fin n → MvPolynomial (Fin (n + 1)) K)
    (d : Fin n → ℕ) (_hd : ∀ k, (f k).IsHomogeneous (d k))
    (_hdeg : ∀ k, (f k).totalDegree = d k)
    (_hd_pos : ∀ k, 1 ≤ d k)
    (_hfin : (⋂ k, vanishingSet (f k)).Finite) :
    ∑ᶠ p ∈ (⋂ k, vanishingSet (f k)), intersectionMultiplicity f p
      = (∏ k, d k : ℕ∞) := by
  sorry
#92
How produced

Change the name for model

Commuting probabilities are closed
commProb_closed

Lean theorem statement

/-- The set of commuting probabilities of finite groups is closed. -/
theorem commProb_closed : IsClosed ({p : ℝ | ∃ (G : Type) (hG : Group G), commProb G = p}) := by
  sorry
#93
How produced

Change the name for model

Darboux's theorem (symplectic forms are locally standard)
darboux

Lean theorem statement

/-- **Darboux's theorem.** Every symplectic form on an open subset
`U ⊆ ℝ^{2n}` is locally symplectomorphic to the standard symplectic form
`ω₀`. Formally: for every `x ∈ U` there is a smooth local diffeomorphism
`φ` (`OpenPartialHomeomorph`, smooth in both directions) whose source lies
in `U` and contains `x`, such that on the target the pullback of `α` by
`φ⁻¹` is in Darboux normal form (and hence equals `ω₀`) at every point. -/
theorem darboux {n : ℕ} {U : Set (E n)} (_hU : IsOpen U)
    (α : E n → E n [⋀^Fin 2]→L[ℝ] ℝ) (_hα : IsSymplecticOn α U)
    {x : E n} (_hx : x ∈ U) :
    ∃ φ : OpenPartialHomeomorph (E n) (E n),
      x ∈ φ.source ∧ φ.source ⊆ U ∧
      ContDiffOn ℝ ∞ (φ : E n → E n) φ.source ∧
      ContDiffOn ℝ ∞ (φ.symm : E n → E n) φ.target ∧
      ∀ z ∈ φ.target,
        IsDarbouxNormal
          ((α (φ.symm z)).compContinuousLinearMap
            (fderiv ℝ (φ.symm : E n → E n) z)) := by
  sorry
#94
How produced

Change the name for model

Dehn–Sommerville equations for simplicial spheres
dehn_sommerville

Lean theorem statement

/-- **Dehn–Sommerville equations.** The h-vector of a finite simplicial sphere
is symmetric: `h_j = h_{d-j}`. -/
theorem dehn_sommerville
    {d j : ℕ} (X : FiniteSimplicialSphere d) (hj : j ≤ d) :
    hVector X j = hVector X (d - j) := by
  sorry
#95
How produced

Change the name for model

Fáry–Milnor theorem (knot total curvature ≤ 4π implies unknotted)
fary_milnor

Verso theorem preview

theorem declaration uses `sorry`fary_milnor_total_curvature {r : ℝ → LeanEval.Geometry.FaryMilnorProblem.Space} (_hknot : LeanEval.Geometry.FaryMilnorProblem.IsSmoothKnot r) (_hK : LeanEval.Geometry.FaryMilnorProblem.totalCurvature r ≤ 4 * Real.pi) : LeanEval.Geometry.FaryMilnorProblem.IsUnknotted r := r:ℝ → Space_hknot:IsSmoothKnot r_hK:totalCurvature r ≤ 4 * π⊢ IsUnknotted r All goals completed! 🐙
#96
How produced

Change the name for model

Fatou–Julia / Cantor dichotomy
fatou_julia_dichotomy

Lean theorem statement

/-- **Fatou–Julia dichotomy.** For the quadratic family, `c ∈ M` implies
the filled Julia set `K_c` is connected; `c ∉ M` implies `K_c` is
homeomorphic to the Cantor space `ℕ → Bool`. -/
theorem julia_cantor_dichotomy (c : ℂ) :
    (c ∈ Mandelbrot → IsConnected (FilledJulia c)) ∧
    (c ∉ Mandelbrot → Nonempty ((FilledJulia c) ≃ₜ (ℕ → Bool))) := by
  sorry
#97
How produced

Change the name for model

Gleason's theorem (finite-dimensional)
gleason_theorem_finite

Lean theorem statement

/-- **Gleason's theorem**, finite-dimensional version. For `dim H ≥ 3`, every frame
function on the projection lattice of `H` is given by `P ↦ re Tr(ρ P)` for the unique
density operator `ρ` (positive, `re Tr ρ = 1`). -/
theorem gleason_theorem_finite
    {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H]
      [CompleteSpace H] [FiniteDimensional ℂ H]
    (hdim : 3 ≤ Module.finrank ℂ H)
    (f : FrameFunction H) :
    ∃! ρ : H →L[ℂ] H,
      ContinuousLinearMap.IsPositive ρ ∧
      reTr ρ = 1 ∧
      ∀ P : H →L[ℂ] H, IsOrthProj P → f.μ P = reTr (ρ * P) := by
  sorry
#98
How produced

Change the name for model

Higman's infinite finitely-presented simple group
higman_infinite_simple

Verso theorem preview

theorem declaration uses `sorry`higman_infinite_simple : ∃ (n : ℕ) (rels : Set (FreeGroup (Fin n))), rels.Finite ∧ IsSimpleGroup (PresentedGroup rels) ∧ Infinite (PresentedGroup rels) := ⊢ ∃ n rels, rels.Finite ∧ IsSimpleGroup (PresentedGroup rels) ∧ Infinite (PresentedGroup rels) All goals completed! 🐙
#99
How produced

Change the name for model

Jordan–Brouwer separation theorem
jordan_brouwer

Lean theorem statement

/-- **Jordan–Brouwer separation theorem.** For `d ≥ 2`, the
complement in `ℝᵈ` of a topological `(d−1)`-sphere (the image of any
continuous injection from the unit `(d−1)`-sphere into `ℝᵈ`) has
exactly two connected components. -/
theorem jordan_brouwer (d : ℕ) (_hd : 2 ≤ d)
    (r : Metric.sphere (0 : EuclideanSpace ℝ (Fin d)) 1 → EuclideanSpace ℝ (Fin d))
    (_hcont : Continuous r) (_hinj : Function.Injective r) :
    Nat.card
        (ConnectedComponents ((Set.range r)ᶜ : Set (EuclideanSpace ℝ (Fin d)))) =
      2 := by
  sorry
#100
How produced

Change the name for model

KAM persistence of an invariant curve
kam_invariant_curve

Lean theorem statement

/-- **KAM theorem (persistence of an invariant curve).** For real-analytic,
`1`-periodic, non-constant, mean-zero `f` and Diophantine `α`, for all small
`|c|` the twist-map functional equation
`q(t+α) − 2q(t) + q(t−α) = c·f(q(t))` has a smooth strictly increasing solution
`q` with `q − id` periodic — the `c = 0` curve `q₀(t) = t` persists as a smooth
invariant curve of rotation number `α`. -/
theorem kam_invariant_curve
    (α : ℝ) (_hα : IsDiophantine α)
    (f : ℝ → ℝ)
    (_hf_analytic : AnalyticOnNhd ℝ f Set.univ)
    (_hf_per : Function.Periodic f 1)
    (_hf_nonconst : ¬ ∃ k : ℝ, ∀ x, f x = k)
    (_hf_mean : ∫ x in (0 : ℝ)..1, f x = 0) :
    ∃ c₀ : ℝ, 0 < c₀ ∧ ∀ c : ℝ, |c| < c₀ →
      ∃ q : ℝ → ℝ,
        ContDiff ℝ ∞ q ∧ StrictMono q ∧
        Function.Periodic (fun t => q t - t) 1 ∧
        ∀ t : ℝ, q (t + α) - 2 * q t + q (t - α) = c * f (q t) := by
  sorry
#101
How produced

Change the name for model

Margulis–Ruelle inequality
margulis_ruelle

Lean theorem statement

/-- **Margulis–Ruelle inequality (1968/1978).** `h_μ(T) ≤ λ₁⁺ + λ₂⁺`. -/
theorem margulis_ruelle
    (T T_inv : EucPlane → EucPlane)
    (hT_smooth : ContDiff ℝ 2 T)
    (hT_inv_smooth : ContDiff ℝ 2 T_inv)
    (hT_left : Function.LeftInverse T_inv T)
    (hT_right : Function.RightInverse T_inv T)
    (K : Set EucPlane)
    (hK_compact : IsCompact K)
    (hK_inv : T '' K = K)
    (μ : Measure EucPlane) [IsProbabilityMeasure μ]
    (hμ_supp : μ Kᶜ = 0)
    (hμ_pres : MeasurePreserving T μ μ)
    (hμ_erg : Ergodic T μ) :
    kolmogorovSinaiEntropy μ T
      ≤ max 0 (∫ x, lyapunovUpperAt T x ∂μ)
          + max 0 (∫ x, lyapunovLowerAt T x ∂μ) := by
  sorry
#102
How produced

Change the name for model

Mergelyan's theorem
mergelyan_theorem

Lean theorem statement

/-- **Mergelyan's theorem.** For a compact `K ⊆ ℂ` with connected
complement and `f : ℂ → ℂ` continuous on `K` and analytic on the
interior of `K`, every `ε > 0` admits a complex polynomial `p` with
`‖f z − p(z)‖ < ε` on `K`. -/
theorem mergelyan (K : Set ℂ) (_hK : IsCompact K) (_hKc : IsConnected (Kᶜ))
    (f : ℂ → ℂ) (_hfc : ContinuousOn f K) (_hfh : AnalyticOnNhd ℂ f (interior K))
    (ε : ℝ) (_hε : 0 < ε) :
    ∃ p : ℂ[X], ∀ z ∈ K, ‖f z - p.eval z‖ < ε := by
  sorry
#103
How produced

Change the name for model

Novikov's theorem: the word problem is undecidable for finitely presented groups
novikov_unsolvable

Verso theorem preview

theorem declaration uses `sorry`novikov_unsolvable : ∃ (n : ℕ) (rels : Set (FreeGroup (Fin n))), rels.Finite ∧ ¬ LeanEval.GroupTheory.NovikovUnsolvableProblem.WordProblemSolvable (PresentedGroup.mk rels) := ⊢ ∃ n rels, rels.Finite ∧ ¬WordProblemSolvable (PresentedGroup.mk rels) All goals completed! 🐙
#104
How produced

Change the name for model

pi_3 of the 2-sphere is Z
pi3_sphere_two_mulEquiv_int

Lean theorem statement

/-- The third homotopy group of the 2-sphere is infinite cyclic. -/
theorem pi3_sphere_two_mulEquiv_int
    (x : Metric.sphere (0 : EuclideanSpace ℝ (Fin 3)) 1) :
    Nonempty
      (HomotopyGroup.Pi 3 (Metric.sphere (0 : EuclideanSpace ℝ (Fin 3)) 1) x ≃*
        Multiplicative ℤ) := by
  sorry
#105
How produced

Change the name for model

Poincaré–Bendixson theorem
poincare_bendixson

Lean theorem statement

/-- **Poincaré–Bendixson theorem.** For a `C¹` autonomous vector field
`F : ℝ² → ℝ²` and a forward integral curve `γ` on `[0, ∞)`, either the
forward orbit is unbounded, or the ω-limit set contains an equilibrium
of `F`, or the ω-limit set equals the range of a non-constant periodic
integral curve of `F`. -/
theorem poincare_bendixson
    (F : Plane → Plane) (_hF : ContDiff ℝ 1 F)
    (γ : ℝ → Plane)
    (_hγ : IsIntegralCurveOn γ (fun _ x => F x) (Set.Ici 0)) :
    ¬ Bornology.IsBounded (γ '' Set.Ici 0)
    ∨ (∃ x₀, F x₀ = 0 ∧ x₀ ∈ ⋂ s : ℝ, closure (γ '' Set.Ici s))
    ∨ (∃ T : ℝ, 0 < T ∧ ∃ β : ℝ → Plane,
        IsIntegralCurve β (fun _ x => F x) ∧
        (∀ t, β (t + T) = β t) ∧
        F (β 0) ≠ 0 ∧
        (⋂ s : ℝ, closure (γ '' Set.Ici s)) = Set.range β) := by
  sorry
#106
How produced

Change the name for model

Jacobian of a compact Riemann surface (Buzzard challenge)
jacobian_challenge_diffgeo

Verso theorem preview

def declaration uses `sorry`genus (X : Type u) [TopologicalSpace X] [T2Space X] [CompactSpace X] [ConnectedSpace X] [Nonempty X] [ChartedSpace ℂ X] [IsManifold (modelWithCornersSelf ℂ ℂ) ω X] : ℕ := sorry
theorem declaration uses `sorry`genus_eq_zero_iff_homeo : genus X = 0 ↔ Nonempty (X ≃ₜ (Metric.sphere (0 : EuclideanSpace ℝ (Fin 3)) 1)) := sorry
def declaration uses `sorry`Jacobian (X : Type u) [TopologicalSpace X] [T2Space X] [CompactSpace X] [ConnectedSpace X] [Nonempty X] [ChartedSpace ℂ X] [IsManifold (modelWithCornersSelf ℂ ℂ) ω X] : Type u := sorry
instance declaration uses `sorry`instAddCommGroup : AddCommGroup (Jacobian X) := sorry
instance declaration uses `sorry`instTopologicalSpace : TopologicalSpace (Jacobian X) := sorry
instance declaration uses `sorry`instT2Space : T2Space (Jacobian X) := sorry
instance declaration uses `sorry`instCompactSpace : CompactSpace (Jacobian X) := sorry
instance declaration uses `sorry`instChartedSpace : ChartedSpace (Fin (genus X) → ℂ) (Jacobian X) := sorry
instance declaration uses `sorry`instIsManifold : IsManifold (modelWithCornersSelf ℂ (Fin (genus X) → ℂ)) ω (Jacobian X) := sorry
instance declaration uses `sorry`instLieAddGroup : LieAddGroup (modelWithCornersSelf ℂ (Fin (genus X) → ℂ)) ω (Jacobian X) := sorry
def declaration uses `sorry`ofCurve (P : X) : X → Jacobian X := sorry
theorem declaration uses `sorry`ofCurve_contMDiff (P : X) : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ (Fin (genus X) → ℂ)) ω (ofCurve P) := sorry
theorem declaration uses `sorry`ofCurve_self (P : X) : ofCurve P P = 0 := sorry
theorem declaration uses `sorry`ofCurve_inj (P : X) (h : 0 < genus X) : Function.Injective (ofCurve P) := sorry
def declaration uses `sorry`pushforward (f : X → Y) (hf : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω f) : Jacobian X →ₜ+ Jacobian Y := sorry
theorem declaration uses `sorry`pushforward_contMDiff (f : X → Y) (hf : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω f) : ContMDiff (modelWithCornersSelf ℂ (Fin (genus X) → ℂ)) (modelWithCornersSelf ℂ (Fin (genus Y) → ℂ)) ω (pushforward f hf) := sorry
theorem declaration uses `sorry`pushforward_id_apply (P : Jacobian X) : pushforward id contMDiff_id P = P := sorry
theorem declaration uses `sorry`pushforward_comp_apply (f : X → Y) (hf : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω f) (g : Y → Z) (hg : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω g) (P : Jacobian X) : pushforward (g ∘ f) (hg.comp hf) P = pushforward g hg (pushforward f hf P) := sorry
def declaration uses `sorry`pullback (f : X → Y) (hf : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω f) : Jacobian Y →ₜ+ Jacobian X := sorry
theorem declaration uses `sorry`pullback_contMDiff (f : X → Y) (hf : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω f) : ContMDiff (modelWithCornersSelf ℂ (Fin (genus Y) → ℂ)) (modelWithCornersSelf ℂ (Fin (genus X) → ℂ)) ω (pullback f hf) := sorry
theorem declaration uses `sorry`pullback_id_apply (P : Jacobian X) : pullback id contMDiff_id P = P := sorry
theorem declaration uses `sorry`pullback_comp_apply (f : X → Y) (hf : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω f) (g : Y → Z) (hg : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω g) (P : Jacobian Z) : pullback (g.comp f) (hg.comp hf) P = pullback f hf (pullback g hg P) := sorry
def declaration uses `sorry`degree (f : X → Y) (hf : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω f) : ℕ := sorry -- 0 for constant case
theorem declaration uses `sorry`pushforward_pullback (f : X → Y) (hf : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω f) (P : Jacobian Y) : pushforward f hf (pullback f hf P) = (degree f hf) • P := sorry
#107
How produced

Humanifa workflow using GPT 5.6 sol to develop the proof, followed by Mini-Humanize-assisted migration and independent verification on Lean 4.35.0-rc3 / Mathlib 5e0c4e5239cb0a2d86d68a884bf52cfd963fce22. The complete workspace build, comparator, four-thread Nanoda, and Lean's default kernel passed.

Uniformization theorem for Riemann surfaces
uniformization

Verso theorem preview

theorem declaration uses `sorry`uniformization {X : Type*} [TopologicalSpace X] [T2Space X] [ConnectedSpace X] [SecondCountableTopology X] [ChartedSpace ℂ X] [IsManifold mℂ 1 X] (hX : ¬ CompactSpace X) (x : X) [Subsingleton <| Additive (FundamentalGroup X x) →+ ℝ] : Nonempty (X ≃ₘ⟮mℂ, mℂ⟯ ℂ) ∨ Nonempty (X ≃ₘ⟮mℂ, mℂ⟯ UpperHalfPlane) := X:Type u_1inst✝⁶:TopologicalSpace Xinst✝⁵:T2Space Xinst✝⁴:ConnectedSpace Xinst✝³:SecondCountableTopology Xinst✝²:ChartedSpace ℂ Xinst✝¹:IsManifold mℂ 1 XhX:¬CompactSpace Xx:Xinst✝:Subsingleton (Additive (FundamentalGroup X x) →+ ℝ)⊢ Nonempty (X ≃ₘ⟮mℂ, mℂ⟯ ℂ) ∨ Nonempty (X ≃ₘ⟮mℂ, mℂ⟯ UpperHalfPlane) All goals completed! 🐙
#108
Schmidt's subspace theorem
schmidt_subspace

Verso theorem preview

theorem declaration uses `sorry`schmidt_subspace (σ : Type*) [Fintype σ] (hσ : 2 ≤ Fintype.card σ) (L : σ → σ → ℂ) (alg : ∀ i j, IsAlgebraic ℚ (L i j)) (ind : LinearIndependent ℂ L) (ε : ℝ) (pos : 0 < ε) : ∃ s : Finset (σ → ℤ), 0 ∉ s ∧ ∀ x : σ → ℤ, ‖∏ i, ∑ j, L i j * x j‖ < ‖x‖ ^ (-ε) → ∃ c ∈ s, ∑ i, c i * x i = 0 := σ:Type u_1inst✝:Fintype σhσ:2 ≤ Fintype.card σL:σ → σ → ℂalg:∀ (i j : σ), IsAlgebraic ℚ (L i j)ind:LinearIndependent ℂ Lε:ℝpos:0 < ε⊢ ∃ s, 0 ∉ s ∧ ∀ (x : σ → ℤ), ‖∏ i, ∑ j, L i j * ↑(x j)‖ < ‖x‖ ^ (-ε) → ∃ c ∈ s, ∑ i, c i * x i = 0 All goals completed! 🐙
#109
On the Duffin-Schaeffer conjecture
annals_duffin_schaeffer_conjecture

Verso theorem preview

/-- Statement of Theorem 1: If for `ψ : ℕ → ℝ≥0`, the infinite series `∑ (ψ q * φ q) / q`, where `φ` is the Euler totient function, diverges, then the set `𝒜` defined above has Lebesgue measure `1`. -/ theorem declaration uses `sorry`theorem_1 (ψ : ℕ+ → ℝ≥0) (hdivergence : ¬ Summable fun q ↦ (ψ q * φ q) / q) : MeasurableSet (𝒜 ψ) ∧ volume (𝒜 ψ) = 1 := ψ:ℕ+ → ℝ≥0hdivergence:¬Summable fun q => ψ q * ↑(φ ↑q) / ↑↑q⊢ MeasurableSet (𝒜 ψ) ∧ volume (𝒜 ψ) = 1 All goals completed! 🐙
/-- Statement of Theorem 2(a): Let `ψ : ℕ → ℝ≥0`, `𝒦` and `ψ⋆` be as above. Then, if `∑ ψ⋆ (q)` converges, `𝒦` has Lebesgue measure `0`. -/ theorem declaration uses `sorry`theorem_2_a (ψ : ℕ+ → ℝ≥0) (hψ : ∑' q, ψ_star ψ q < ∞) : MeasurableSet (𝒦 ψ) ∧ volume (𝒦 ψ) = 0 := ψ:ℕ+ → ℝ≥0hψ:∑' (q : ℕ+), ψ_star ψ q < ∞⊢ MeasurableSet (𝒦 ψ) ∧ volume (𝒦 ψ) = 0 All goals completed! 🐙
/-- Statement of Theorem 2(b): Let `ψ : ℕ → ℝ≥0`, `𝒦` and `ψ⋆` be as above. Then, if `∑ ψ⋆ (q)` diverges, `𝒦` has Lebesgue measure `1`. -/ theorem declaration uses `sorry`theorem_2_b (ψ : ℕ+ → ℝ≥0) (hψ : ∑' q, ψ_star ψ q = ∞) : MeasurableSet (𝒦 ψ) ∧ volume (𝒦 ψ) = 1 := ψ:ℕ+ → ℝ≥0hψ:∑' (q : ℕ+), ψ_star ψ q = ∞⊢ MeasurableSet (𝒦 ψ) ∧ volume (𝒦 ψ) = 1 All goals completed! 🐙
/-- Statement of Corollary 3: For a function `ψ : ℕ → [0, 1/2]`, the set `𝒜` and the element `s` defined as above, the Hausdorff dimension of `𝒜` is the minimum of `s` and `1`. -/ theorem declaration uses `sorry`corollary_3 (ψ : ℕ+ → ℝ≥0) (hψ : ∀ n, ψ n ∈ Set.Icc 0 (1 / 2)) : dimH (𝒜 ψ) = min (s_inf ψ) 1 := ψ:ℕ+ → ℝ≥0hψ:∀ (n : ℕ+), ψ n ∈ Set.Icc 0 (1 / 2)⊢ dimH (𝒜 ψ) = ↑(min (s_inf ψ) 1) All goals completed! 🐙
#110
Lorentzian polynomials
annals_lorentzian_polynomials

Verso theorem preview

theorem declaration uses `sorry`theorem_2_25 (n d : ℕ) (hn : 0 < n) : closure (Ŀ n d) = LorentzianPolynomials.L n d := n:ℕd:ℕhn:0 < n⊢ closure (Ŀ n d) = L n d All goals completed! 🐙
#111
Pseudorandom sets in Grassmann graph have near-perfect expansion
annals_pseudorandom_grassmann

Verso theorem preview

theorem declaration uses `sorry`theorem_1_12 (α : ℝ) (hα : α ∈ Set.Ioo 0 1) : ∃ ε > 0, ∃ r, ∀ᶠ (ℓ : ℕ) (k : ℕ) in atTop, ∀ S : Finset (PseudorandomGrassmann.GrVertex k ℓ), (hS : S.Nonempty) → 2 * #S ≤ Fintype.card (PseudorandomGrassmann.GrVertex k ℓ) → Φ (PseudorandomGrassmann.Gr k ℓ) S hS ≤ α → ∃ (A B : Submodule 𝔽₂ (Fin k → 𝔽₂)), A ≤ B ∧ letI a := finrank 𝔽₂ A; letI b := k - finrank 𝔽₂ B a + b ≤ r ∧ #(S ∩ SubGr k ℓ A B) / #(SubGr k ℓ A B) ≥ (ε : ℝ) := α:ℝhα:α ∈ Set.Ioo 0 1⊢ ∃ ε > 0, ∃ r, ∀ᶠ (ℓ : ℕ) (k : ℕ) in atTop, ∀ (S : Finset (GrVertex k ℓ)) (hS : S.Nonempty), 2 * #S ≤ Fintype.card (GrVertex k ℓ) → ↑(Φ (Gr k ℓ) S hS) ≤ α → ∃ A B, A ≤ B ∧ finrank 𝔽₂ ↥A + (k - finrank 𝔽₂ ↥B) ≤ r ∧ ↑(#(S ∩ SubGr k ℓ A B)) / ↑(#(SubGr k ℓ A B)) ≥ ε All goals completed! 🐙
#112
Flat Littlewood polynomials exist
annals_flat_littlewood_poly

Verso theorem preview

theorem declaration uses `sorry`theorem_1_1 : ∃ Δ δ : ℝ, Δ > δ ∧ δ > 0 ∧ ∀ n ≥ 2, ∃ P : ℂ[X], FlatLittlewoodPoly.IsLittlewoodPolynomial P ∧ P.natDegree = n ∧ ∀ z : ℂ, ‖z‖ = 1 → δ * √n ≤ ‖P.eval z‖ ∧ ‖P.eval z‖ ≤ Δ * √n := ⊢ ∃ Δ δ, Δ > δ ∧ δ > 0 ∧ ∀ n ≥ 2, ∃ P, IsLittlewoodPolynomial P ∧ P.natDegree = n ∧ ∀ (z : ℂ), ‖z‖ = 1 → δ * √↑n ≤ ‖Polynomial.eval z P‖ ∧ ‖Polynomial.eval z P‖ ≤ Δ * √↑n All goals completed! 🐙
#113
Ado's theorem in characteristic zero
adoCharZero

Verso theorem preview

theorem declaration uses `sorry`adoCharZero [CharZero K] [FiniteDimensional K L] : ∃ (V : Type u) (_ : AddCommGroup V) (_ : Module K V) (_ : FiniteDimensional K V) (ρ : L →ₗ⁅K⁆ Module.End K V), Function.Injective ρ := K:Type uL:Type uinst✝⁴:Field Kinst✝³:LieRing Linst✝²:LieAlgebra K Linst✝¹:CharZero Kinst✝:FiniteDimensional K L⊢ ∃ V x x_1, ∃ (_ : FiniteDimensional K V), ∃ ρ, Function.Injective ⇑ρ All goals completed! 🐙
#114
Vinogradov mean value theorem
vinogradov_mean_value

Verso theorem preview

theorem declaration uses `sorry`vinogradov_mean_value (s k : ℕ) (ε : ℝ) (hε : 0 < ε) : LeanEval.NumberTheory.VinogradovMeanValue.J s k =O[Filter.atTop] fun X ↦ (X ^ (s + ε) + X ^ ((2 * s : ℝ) - k * (k + 1) / 2 + ε) : ℝ) := s:ℕk:ℕε:ℝhε:0 < ε⊢ J s k =O[Filter.atTop] fun X => ↑X ^ (↑s + ε) + ↑X ^ (2 * ↑s - ↑k * (↑k + 1) / 2 + ε) All goals completed! 🐙
#115
Existence of a simple group of order 10200960 with a 22-dim irrep whose tensor square has 4 isotypic components
m23_irrep_tensor_square_decomp

Verso theorem preview

theorem declaration uses `sorry`m23_irrep_tensor_square_decomp : ∃ (G : Type) (_ : Group G) (_ : Fintype G), Fintype.card G = 10200960 ∧ IsSimpleGroup G ∧ ∃ (V : Type) (_ : AddCommGroup V) (_ : Module ℂ V) (ρ : Representation ℂ G V), Module.finrank ℂ V = 22 ∧ ρ.IsIrreducible ∧ (@isotypicComponents (MonoidAlgebra ℂ G) (V ⊗[ℂ] V) _ _ (Module.compHom (V ⊗[ℂ] V) (Representation.asAlgebraHom (ρ.tprod ρ)).toRingHom)).ncard = 4 := ⊢ ∃ G x x_1, Fintype.card G = 10200960 ∧ IsSimpleGroup G ∧ ∃ V x_2 x_3 ρ, Module.finrank ℂ V = 22 ∧ ρ.IsIrreducible ∧ (isotypicComponents (MonoidAlgebra ℂ G) (V ⊗[ℂ] V)).ncard = 4 All goals completed! 🐙
#116
Spencer-Szemerédi-Trotter unit-distance upper bound
unit_distance_upper_bound

Verso theorem preview

theorem declaration uses `sorry`unit_distance_upper_bound : ∃ C : ℝ, 0 < C ∧ ∀ P : Finset (EuclideanSpace ℝ (Fin 2)), (unitDist P : ℝ) ≤ C * (P.card : ℝ) ^ ((4 : ℝ) / 3) := ⊢ ∃ C, 0 < C ∧ ∀ (P : Finset (EuclideanSpace ℝ (Fin 2))), ↑(unitDist P) ≤ C * ↑P.card ^ (4 / 3) All goals completed! 🐙
#117
Moran's equality for affine-symmetric iterated function systems
moran_equality_affine

Verso theorem preview

theorem declaration uses `sorry`moran_equality_affine {d n : ℕ} (hn : 1 ≤ n) (f : Fin n → EuclideanSpace ℝ (Fin d) → EuclideanSpace ℝ (Fin d)) (lam : ℝ) (h_aff : LeanEval.Dynamics.IsAffineSymmetricIFS f lam) (h_osc : LeanEval.Dynamics.OpenSetCondition f) {S : Set (EuclideanSpace ℝ (Fin d))} (hS : LeanEval.Dynamics.IsAttractor f S) : dimH S = ENNReal.ofReal (- Real.log n / Real.log lam) := d:ℕn:ℕhn:1 ≤ nf:Fin n → EuclideanSpace ℝ (Fin d) → EuclideanSpace ℝ (Fin d)lam:ℝh_aff:IsAffineSymmetricIFS f lamh_osc:OpenSetCondition fS:Set (EuclideanSpace ℝ (Fin d))hS:IsAttractor f S⊢ dimH S = ENNReal.ofReal (-Real.log ↑n / Real.log lam) All goals completed! 🐙
#118
How produced

Change the name for model

Generalized topological Poincaré conjecture in dimensions ≥ 5 (Smale)
poincare_high_dim_topological

Verso theorem preview

theorem declaration uses `sorry`poincare_high_dim_topological {n : ℕ} (_h5 : 5 ≤ n) {M : Type*} [TopologicalSpace M] [T2Space M] [ChartedSpace (EuclideanSpace ℝ (Fin n)) M] (_h : M ≃ₕ sphere (0 : EuclideanSpace ℝ (Fin (n + 1))) 1) : Nonempty (M ≃ₜ sphere (0 : EuclideanSpace ℝ (Fin (n + 1))) 1) := n:ℕ_h5:5 ≤ nM:Type u_1inst✝²:TopologicalSpace Minst✝¹:T2Space Minst✝:ChartedSpace (EuclideanSpace ℝ (Fin n)) M_h:M ≃ₕ ↑(sphere 0 1)⊢ Nonempty (M ≃ₜ ↑(sphere 0 1)) All goals completed! 🐙
#119
How produced

Mini-Humanize workflow using GPT-6 Astra for proof development and Lean 4.35 migration, followed by GPT-5.6-sol review and full evaluator verification.

Chen's theorem
chen_theorem

Verso theorem preview

theorem declaration uses `sorry`chen_theorem : {p : ℕ | p.Prime ∧ LeanEval.NumberTheory.ChenTheorem.HasAtMostTwoPrimeFactors (p + 2)}.Infinite := ⊢ {p | Nat.Prime p ∧ HasAtMostTwoPrimeFactors (p + 2)}.Infinite All goals completed! 🐙
#120
Algebraic integers with conjugates in a prescribed distribution
annals_algebraic_integers

Verso theorem preview

theorem declaration uses `sorry`theorem_1_1 : lambda_SSS < 1.89831 := ⊢ lambda_SSS < 1.89831 All goals completed! 🐙
#121
Singularity of random Bernoulli matrices
annals_random_bernoulli_matrices

Verso theorem preview

/-- Statement of Theorem A: For every `p ∈ (0, 1/2]` and `ε > 0` there exists `N, C > 0` such that for any `n ≥ N` and any `n × n` random matrix `B` with mutually independent `Bernoulli(p)` entries, `P(σ_min (B + sIIᵀ) ≤ t/√n) ≤ (1 - p + ε)ⁿ + Ct` for all `s ∈ [-1,0]` and `t > 0`. -/ theorem declaration uses `sorry`theorem_A {p : I} {ε : ℝ} (hp₀ : 0 < p) (hp₁ : (p : ℝ) ≤ 1 / 2) (hε : 0 < ε) : ∃ N > 0, ∃ C > 0, ∀ n ≥ N, ∀ (Ω : Type*) (_mΩ : MeasurableSpace Ω) (P : Measure Ω) (B : Ω → Matrix (Fin n) (Fin n) ℝ) (_B_indep : iIndepFun (fun x : Fin n × Fin n ↦ (B · x.1 x.2)) P) (_B_bernoulli : ∀ i j, HasLaw (B · i j) (bernoulliMeasure 1 0 p) P), ∀ s : ℝ, -1 ≤ s ∧ s ≤ 0 → ∀ t : ℝ, 0 < t → P.real {ω : Ω | σ_min (B ω + of (fun _ _ ↦ s)) ≤ t / √n} ≤ (1 - p + ε) ^ n + C * t := p:↑Iε:ℝhp₀:0 < php₁:↑p ≤ 1 / 2hε:0 < ε⊢ ∃ N > 0, ∃ C > 0, ∀ n ≥ N, ∀ (Ω : Type u_1) (_mΩ : MeasurableSpace Ω) (P : Measure Ω) (B : Ω → Matrix (Fin n) (Fin n) ℝ), iIndepFun (fun x x_1 => B x_1 x.1 x.2) P → (∀ (i j : Fin n), HasLaw (fun x => B x i j) Ber(1, 0, p) P) → ∀ (s : ℝ), -1 ≤ s ∧ s ≤ 0 → ∀ (t : ℝ), 0 < t → P.real {ω | σ_min (B ω + of fun x x_1 => s) ≤ t / √↑n} ≤ (1 - ↑p + ε) ^ n + C * t All goals completed! 🐙
/-- This (unnamed) corollary appears directly below Theorem A in the paper: For every `p ∈ (0, 1/2]` and any sequence `Bₙ` of `n × n` random matrices with mutually independent `Bernoulli(p)` entries we have that `P(Bₙ is singular) = (1 - p + oₙ(1))ⁿ`. -/ theorem declaration uses `sorry`corollary_1 {p : I} (hp₀ : 0 < p) (hp₁ : (p : ℝ) ≤ 1 / 2) {Ω : ℕ → Type*} [mΩ : ∀ n, MeasurableSpace (Ω n)] {P : (n : ℕ) → Measure (Ω n)} {B : (n : ℕ) → Ω n → Matrix (Fin n) (Fin n) ℝ} (B_indep : ∀ n, iIndepFun (fun x : Fin n × Fin n ↦ (B n · x.1 x.2)) (P n)) (B_bernoulli : ∀ n i j, HasLaw (B n · i j) (bernoulliMeasure 1 0 p) (P n)) : ∃ o : ℕ → ℝ, o =o[atTop] (1 : ℕ → ℝ) ∧ ∀ n > 0, (P n).real {ω | (B n ω).det = 0} = (1 - p + o n) ^ n := p:↑Ihp₀:0 < php₁:↑p ≤ 1 / 2Ω:ℕ → Type u_1mΩ:(n : ℕ) → MeasurableSpace (Ω n)P:(n : ℕ) → Measure (Ω n)B:(n : ℕ) → Ω n → Matrix (Fin n) (Fin n) ℝB_indep:∀ (n : ℕ), iIndepFun (fun x x_1 => B n x_1 x.1 x.2) (P n)B_bernoulli:∀ (n : ℕ) (i j : Fin n), HasLaw (fun x => B n x i j) Ber(1, 0, p) (P n)⊢ ∃ o, o =o[atTop] 1 ∧ ∀ n > 0, (P n).real {ω | (B n ω).det = 0} = (1 - ↑p + o n) ^ n All goals completed! 🐙
/-- This is the result stated in the paper's abstract: For any sequence `Mₙ` of `n × n` random matrices with mutually independent `Rademacher` entries we have that `P(Mₙ is singular) = (1/2 + oₙ(1))ⁿ`. -/ theorem declaration uses `sorry`corollary_2 {Ω : ℕ → Type*} (mΩ : ∀ n, MeasurableSpace (Ω n)) {P : (n : ℕ) → Measure (Ω n)} {M : (n : ℕ) → Ω n → Matrix (Fin n) (Fin n) ℝ} (M_indep : ∀ n, iIndepFun (fun x : Fin n × Fin n ↦ (M n · x.1 x.2)) (P n)) (M_rademacher : ∀ n i j, HasLaw (M n · i j) rademacherMeasure (P n)) : ∃ o : ℕ → ℝ, o =o[atTop] (1 : ℕ → ℝ) ∧ ∀ n > 0, (P n).real {ω | (M n ω).det = 0} = (1 / 2 + o n) ^ n := Ω:ℕ → Type u_1mΩ:(n : ℕ) → MeasurableSpace (Ω n)P:(n : ℕ) → Measure (Ω n)M:(n : ℕ) → Ω n → Matrix (Fin n) (Fin n) ℝM_indep:∀ (n : ℕ), iIndepFun (fun x x_1 => M n x_1 x.1 x.2) (P n)M_rademacher:∀ (n : ℕ) (i j : Fin n), HasLaw (fun x => M n x i j) rademacherMeasure (P n)⊢ ∃ o, o =o[atTop] 1 ∧ ∀ n > 0, (P n).real {ω | (M n ω).det = 0} = (1 / 2 + o n) ^ n All goals completed! 🐙
#122
Hessian estimates for the sigma-2 equation in dimension four
annals_hessian_estimates

Verso theorem preview

theorem declaration uses `sorry`theorem_1_1 : ∃ C : ℝ≥0∞ → ℝ, ∀ (u : ℝ⁴ → ℝ) (_smooth : ContDiffOn ℝ ∞ u B₁(0)) (_bounded : ‖u‖_C¹(B₁(0)) < (∞ : ℝ≥0∞)) (_positive_branch : ∀ x ∈ B₁(0), (Δ u) x > 0) (_solution : ∀ x ∈ B₁(0), σ₂ (H u B₁(0) x) = 1), ‖H u B₁(0) 0‖_F ≤ C (‖u‖_C¹(B₁(0))) := ⊢ ∃ C, ∀ (u : ℝ⁴ → ℝ), ContDiffOn ℝ ∞ u B₁(0) → ‖u‖_C¹(B₁(0)) < ∞ → (∀ x ∈ B₁(0), Δ u x > 0) → (∀ x ∈ B₁(0), σ₂ (H u B₁(0) x) = 1) → ‖H u B₁(0) 0‖_F ≤ C ‖u‖_C¹(B₁(0)) All goals completed! 🐙
#123
Rational approximations to linear subspaces
annals_linear_subspaces

Verso theorem preview

theorem declaration uses `sorry`theorem_1 (hd : 2 ≤ d) (l : ℕ) (hl0 : 0 < l) (hld : l < d) (k : ℕ) (hk1 : 1 ≤ k) (hkl : k ≤ l) : (∀ x : Submodule ℝ ℝᵈ, finrank ℝ x = l → LinearSubspaces.diophantineExponent k x ≥ d / (k * (d - l))) ∧ (∃ x : Submodule ℝ ℝᵈ, finrank ℝ x = l ∧ LinearSubspaces.diophantineExponent k x = d / (k * (d - l))) := d:ℕhd:2 ≤ dl:ℕhl0:0 < lhld:l < dk:ℕhk1:1 ≤ khkl:k ≤ l⊢ (∀ (x : Submodule ℝ ℝᵈ), finrank ℝ ↥x = l → diophantineExponent k x ≥ ↑d / (↑k * (↑d - ↑l))) ∧ ∃ x, finrank ℝ ↥x = l ∧ diophantineExponent k x = ↑d / (↑k * (↑d - ↑l)) All goals completed! 🐙
#124
A reverse Minkowski theorem
annals_reverse_minkowski

Verso theorem preview

theorem declaration uses `sorry`theorem_1_2 (ℒ : Submodule ℤ ℝⁿ) [DiscreteTopology ℒ] (hℒ : IsZLattice ℝ ℒ) (h : ∀ ℒ' (_hℒℒ' : ℒ' ≤ ℒ) [DiscreteTopology ℒ'], determinant ℒ' ≥ 1) : let t : ℝ := 10 * (log n + 2) ρ (1 / t) ℒ ≤ 3 / 2 := n:ℕℒ:Submodule ℤ ℝⁿinst✝:DiscreteTopology ↥ℒhℒ:IsZLattice ℝ ℒh:∀ ℒ' ≤ ℒ, ∀ [inst : DiscreteTopology ↥ℒ'], determinant ℒ' ≥ 1⊢ let t := 10 * (log ↑n + 2); ρ (1 / t) ℒ ≤ 3 / 2 All goals completed! 🐙
#125
On a conjecture of Talagrand on selector processes and a consequence on positive empirical processes
annals_supremum_of_selector_processes

Lean theorem statement

/-- The constant `L` of Theorem 1.2. -/
noncomputable def L₂ : ℝ≥0 := sorry

/-- The constant of Theorem 1.2 is positive. -/
theorem L₂_pos : L₂ > 0 := sorry

/--
Statement of Theorem 1.2:

There exists `L > 0` such that for any `0 < p < 1`, finite type `X`, and set `Λ` of functions from
`X` to `ℝ≥0` such that `0 < 𝔼[sup_{f ∈ Λ} ∑ i ∈ Xp, f i] < ∞`, the collection of sets

`{s ⊆ X | sup_{f ∈ Λ} ∑ i ∈ s, f i ≥ L * 𝔼[sup_{f ∈ Λ} ∑ i ∈ Xp, f i]}`

is `p-small`, where `Xp` is a binomial random subset of `X` with parameter `p`.

Note: The assumption `0 < 𝔼[sup_{f ∈ Λ} ∑ i ∈ Xp, f i] < ∞` is not explicitly stated in the theorem
but used in the last step of the proof where `𝔼 ≥ (L/L') * 𝔼` is a contradiction for `L > L'`.
-/
theorem theorem_1_2 (p : I) (hp₀ : 0 < p) (hp₁ : p < 1) (X : Type*) [Fintype X] (Λ : Set (X → ℝ≥0))
    (hE₀ : 0 < 𝔼⁻[⨆ f ∈ Λ, ∑ i ∈ Xp, (f i : ℝ≥0∞); Xp ∼ binomialSetDistribution X p])
    (hE : 𝔼⁻[⨆ f ∈ Λ, ∑ i ∈ Xp, (f i : ℝ≥0∞); Xp ∼ binomialSetDistribution X p] < ∞) :
    IsSmall p {s : Set X | ⨆ f ∈ Λ, ∑ i ∈ s, (f i : ℝ≥0∞) ≥
        L₂ * 𝔼⁻[⨆ f ∈ Λ, ∑ i ∈ Xp, (f i : ℝ≥0∞); Xp ∼ binomialSetDistribution X p]} := by
  sorry

/-- The constant `L` of Theorem 1.3. -/
noncomputable def L₃ : ℝ≥0 := sorry

/-- The constant of Theorem 1.3 is positive. -/
theorem L₃_pos : L₃ > 0 := sorry

/--
Statement of Theorem 1.3:

There exists `L > 0` such that for any `N > 0`, i.i.d random variables `Y_1, …, Y_N` distributed
according to a Borel probability measure `ν` on a Polish space `𝕋`, if `𝓕` is a finite set of
non-negative functions in `L∞(𝕋)` and `0 < 𝔼[sup_{f ∈ 𝓕} Z Y f] < ∞` then there exists a finite
collection `𝓒` of pairs `(g, t)` where `g : 𝕋 → ℝ≥0`, `t > 0` such that

`{sup_{f ∈ 𝓕} Z N Y f ≥ L * 𝔼[sup_{f ∈ 𝓕} Z N Y f] } ⊆ ⋃ (g,t) ∈ 𝓒, {t ≤ Z N Y g}`

and

`∑ (g,t) ∈ 𝓒, P(t ≤ Z N Y g) ≤ 2⁻¹`.

Note: The requirement that the collection `𝓒` be finite is not explicitly stated in the paper.
However, `𝓒` must at least be assumed to be countable in order for the sum to make sense,
and the collections `𝓒` produced by the proof are indeed finite.

-/
theorem theorem_1_3 (N : ℕ) (N_pos : N > 0) (𝕋 : Type*) (t𝕋 : TopologicalSpace 𝕋)
    (p𝕋 : PolishSpace 𝕋)
    (m𝕋 : MeasurableSpace 𝕋) (b𝕋 : BorelSpace 𝕋) (ν : Measure 𝕋) (hν : IsProbabilityMeasure ν)
    (Ω : Type*) (mΩ : MeasurableSpace Ω) (P : Measure Ω) (Y : Fin N → Ω → 𝕋)
    (Y_indep : iIndepFun Y P) (Y_law_ν : ∀ i, HasLaw (Y i) ν P)
    (𝓕 : Set {f : 𝕋 → ℝ≥0 // Measurable f ∧ MemLp f ∞ ν}) (h𝓕 : Finite 𝓕)
    (hZ₀ : 0 < 𝔼⁻[⨆ f ∈ 𝓕, (Z N Y f ·); P]) (hZ : 𝔼⁻[⨆ f ∈ 𝓕, (Z N Y f ·); P] < ∞) :
    ∃ 𝓒 : Finset ({g : 𝕋 → ℝ≥0 // Measurable g} × {t : ℝ≥0 | t > 0}),
      {ω | ⨆ f ∈ 𝓕, Z N Y f ω ≥ L₃ * 𝔼⁻[⨆ f ∈ 𝓕, (Z N Y f ·); P]} ⊆ ⋃ c ∈ 𝓒, {ω | c.2 ≤ Z N Y c.1 ω}
      ∧ ∑ c : 𝓒, P {ω | c.val.2 ≤ Z N Y c.val.1 ω} ≤ 2⁻¹ := by
  sorry
#126
A counterexample to the periodic tiling conjecture
annals_periodic_tiling_conjecture

Lean theorem statement

/--
Statement of Theorem 1.4 (Counterexample to Conjecture 1.2, I):

There exists a finite abelian group `G₀` and a finite non-empty `F ⊆ ℤ² × G₀` such that
`F` forms an aperiodic tiling equation.
-/
theorem theorem_1_4 : ∃ (G₀ : Type) (_ : AddCommGroup G₀) (_ : Finite G₀),
    ∃ F : Set (ℤ × ℤ × G₀), F.Finite ∧ F.Nonempty ∧ IsAperiodicTilingEquation F := by
  sorry

/--
Statement of Corollary 1.6 (Counterexample to Conjecture 1.2, II):

For all sufficiently large `d`, there exists a finite non-empty `F ⊆ ℤᵈ` such that
`F` forms an aperiodic tiling equation.
-/
theorem corollary_1_6 : ∀ᶠ d in atTop, ∃ (F : Set (Fin d → ℤ)),
    F.Finite ∧ F.Nonempty ∧ IsAperiodicTilingEquation F := by
  sorry

/--
Statement of Corollary 1.7 (Counterexample to Conjecture 1.3):

For all sufficiently large `d`, there exists a bounded measurable set `σ ⊆ ℝᵈ` of positive
measure such that `σ` forms an aperiodic continuous tiling equation.
-/
theorem corollary_1_7 : ∀ᶠ d in atTop, ∃ σ : Set (Fin d → ℝ), IsBounded σ ∧ MeasurableSet σ ∧
    0 < volume σ ∧ IsAperiodicContinuousTilingEquation σ := by
  sorry
#127
The optimal paper Moebius band
annals_optimal_moebius

Lean theorem statement

/--
Statement of Theorem 1.1 (Main):

A smooth embedded paper Moebius band has aspect ratio greater than `√3`.
-/
theorem theorem_1_1 (a : ℝ) (ha : a > 0) (f : ℝ² → ℝ³) (hf : IsMoebiusEmbedding a f) :
    a > √3 := by
  sorry
#128
On approximation to a real number by algebraic numbers of bounded degree
annals_on_approximation_of_reals

Lean theorem statement

/--
Statement of Theorem 1.1:

Let `n` be an integer such that `n ≥ 2`. For any transcendental real number `ξ`, we have
`ω⋆_n(ξ) ≥ a * n`, where `a = 1 / (2 - log 2)`.
-/
theorem theorem_1_1 (n : ℕ) (hn : n ≥ 2) (ξ : ℝ) (hξ : Transcendental ℚ ξ) :
    letI a : ℝ := 1 / (2 - Real.log 2)
    (ω⋆ n ξ : EReal) ≥ (a : EReal) * n := by
  sorry
#129
The local-global conjecture for Apollonian circle packings is false
annals_local_global_apollonian_circle_packings

Lean theorem statement

/--
Statement of Theorem 1.6:

The Apollonian circle packing `A` generated by `(−3, 5, 8, 8)` has no square curvatures.
-/
theorem theorem_1_6 : ∀ n, n ^ 2 ∉ curvatureSet ⟦⟨![-3, 5, 8, 8], by decide⟩⟧ := by
  sorry

/--
Statement of Theorem 1.3:

There exist infinitely many `A` for which the number of missing curvatures up to `N` is `Ω(√N)`.
-/
theorem theorem_1_3 : {A : PrimitiveApollonianCirclePacking |
    Real.sqrt =O[Filter.atTop] missingCurvatures A}.Infinite := by
  sorry
#130
Improved bounds for the sunflower lemma
annals_improved_bounds_sunflower_lemma

Lean theorem statement

/-- The absolute constant `C` in Theorem 1.4. Although not explicitly stated in the paper,
the constant `C` doesn't depend on `r`. -/
noncomputable def C : ℝ := sorry

/--
Statement of Theorem 1.4 (Main theorem, sunflowers):

Let `r ≥ 3`. For some constant `C`, any `w`-set system `F` of size
`|F| ≥ (C * r ^ 3 * log w * log log w) ^ w` contains an `r`-sunflower.

Note: We require `w ≥ 2`, as the paper assumes `log log w > 0`.
-/
theorem theorem_1_4 (r : ℕ) (hr : r ≥ 3) (X : Type*) [Finite X] (ℱ : Set (Set X)) (w : ℕ)
      (hw : w ≥ 2) (hℱ₁ : ℱ.IsSystem w) (hℱ₂ : ℱ.ncard ≥ lowerBound r C w) :
      ∃ S ⊆ ℱ, S.IsSunflower r := by
  sorry
#131
Green–Tao theorem
green_tao

Verso theorem preview

theorem declaration uses `sorry`green_tao : LeanEval.NumberTheory.ContainsArbitraryAPs {p : ℕ | Nat.Prime p} := ⊢ ContainsArbitraryAPs {p | Nat.Prime p} All goals completed! 🐙
#132
Hadwiger's theorem
hadwiger

Verso theorem preview

theorem declaration uses `sorry`hadwiger (n : ℕ) : Module.finrank ℝ (valuations n) = n + 1 := n:ℕ⊢ Module.finrank ℝ ↥(valuations n) = n + 1 All goals completed! 🐙
#133
Radó's theorem on Riemann surfaces
rado_riemannSurface

Verso theorem preview

theorem declaration uses `sorry`rado_riemannSurface {X : Type*} [TopologicalSpace X] [T2Space X] [ConnectedSpace X] [ChartedSpace ℂ X] [IsManifold (modelWithCornersSelf ℂ ℂ) 1 X] : SecondCountableTopology X := X:Type u_1inst✝⁴:TopologicalSpace Xinst✝³:T2Space Xinst✝²:ConnectedSpace Xinst✝¹:ChartedSpace ℂ Xinst✝:IsManifold (modelWithCornersSelf ℂ ℂ) 1 X⊢ SecondCountableTopology X All goals completed! 🐙
#134
Wigner semicircle law
wigner_semicircle

Verso theorem preview

theorem declaration uses `sorry`wigner_semicircle {Ω : Type*} [MeasurableSpace Ω] (μ : Measure Ω) [IsProbabilityMeasure μ] (X : ℕ → ℕ → Ω → ℝ) (_hX_meas : ∀ i j, Measurable (X i j)) (_hX_indep : iIndepFun (fun ij : {p : ℕ × ℕ // p.1 ≤ p.2} => X ij.val.1 ij.val.2) μ) (_hX_iid : ∀ i j i' j', i ≤ j → i' ≤ j' → ProbabilityTheory.IdentDistrib (X i j) (X i' j') μ μ) (_hX_int : ∀ i j, i ≤ j → Integrable (X i j) μ) (_hX_sq_int : ∀ i j, i ≤ j → Integrable (fun ω => (X i j ω) ^ 2) μ) (_hX_mean : ∀ i j, i ≤ j → ∫ ω, X i j ω ∂μ = 0) (_hX_var : ∀ i j, i ≤ j → ∫ ω, (X i j ω) ^ 2 ∂μ = 1) : ∀ᵐ ω ∂μ, ∀ (f : ℝ → ℝ), Continuous f → (∃ M, ∀ x, ‖f x‖ ≤ M) → Tendsto (fun n : ℕ => ∫ x, f x ∂ (empiricalSpectralMeasureHerm (wignerMatrix_isHermitian X n ω)).map (fun x : ℝ => x / Real.sqrt n)) atTop (𝓝 (∫ x, f x ∂semicircleLaw)) := Ω:Type u_1inst✝¹:MeasurableSpace Ωμ:Measure Ωinst✝:IsProbabilityMeasure μX:ℕ → ℕ → Ω → ℝ_hX_meas:∀ (i j : ℕ), Measurable (X i j)_hX_indep:iIndepFun (fun ij => X (↑ij).1 (↑ij).2) μ_hX_iid:∀ (i j i' j' : ℕ), i ≤ j → i' ≤ j' → IdentDistrib (X i j) (X i' j') μ μ_hX_int:∀ (i j : ℕ), i ≤ j → Integrable (X i j) μ_hX_sq_int:∀ (i j : ℕ), i ≤ j → Integrable (fun ω => X i j ω ^ 2) μ_hX_mean:∀ (i j : ℕ), i ≤ j → ∫ (ω : Ω), X i j ω ∂μ = 0_hX_var:∀ (i j : ℕ), i ≤ j → ∫ (ω : Ω), X i j ω ^ 2 ∂μ = 1⊢ ∀ᵐ (ω : Ω) ∂μ, ∀ (f : ℝ → ℝ), Continuous f → (∃ M, ∀ (x : ℝ), ‖f x‖ ≤ M) → Tendsto (fun n => ∫ (x : ℝ), f x ∂Measure.map (fun x => x / √↑n) (empiricalSpectralMeasureHerm ⋯)) atTop (𝓝 (∫ (x : ℝ), f x ∂semicircleLaw)) All goals completed! 🐙
#135
Duffin-Schaeffer conjecture
duffin_schaeffer

Verso theorem preview

theorem declaration uses `sorry`duffin_schaeffer (δ : ℕ → ℝ) (hδ : ∀ n, 0 ≤ δ n) : volume (addWellApproximable UnitAddCircle δ) = 1 ↔ ¬ Summable fun n : ℕ => n.totient * δ n := δ:ℕ → ℝhδ:∀ (n : ℕ), 0 ≤ δ n⊢ volume (addWellApproximable UnitAddCircle δ) = 1 ↔ ¬Summable fun n => ↑n.totient * δ n All goals completed! 🐙
#136
No bounded projection from L^1 onto H^1
H1_not_closedComplemented

Verso theorem preview

theorem declaration uses `sorry`H1_not_closedComplemented : ¬ LeanEval.Analysis.H1.ClosedComplemented := ⊢ ¬H1.ClosedComplemented All goals completed! 🐙
#137
How produced

Change the name for model

Anosov–Bowen shadowing lemma
anosov_bowen_shadowing

Lean theorem statement

/-- **Anosov–Bowen shadowing lemma** (Anosov 1967; Bowen 1975). Every
compact hyperbolic invariant set has the shadowing property. -/
theorem hyperbolic_has_shadowing
    (T : E d ≃ₜ E d) (K : Set (E d))
    (_hKc : IsCompact K) (_hK : IsHyperbolic T K) :
    HasShadowing (T : E d → E d) K := by
  sorry
#138
How produced

Change the name for model

Brun's theorem (convergence of the twin-prime reciprocal sum)
brun_constant_converges

Lean theorem statement

/-- **Brun's theorem.** The reciprocal sum over twin-prime pairs converges. -/
theorem brun_constant_converges :
    Summable twinPrimeReciprocalTerm := by
  sorry
#139
How produced

Change the name for model

Cauchy–Kovalevskaya theorem
cauchy_kovalevskaya

Verso theorem preview

theorem declaration uses `sorry`cauchy_kovalevskaya {d : ℕ} (F : LeanEval.Analysis.E d × ℝ × ℝ → LeanEval.Analysis.E d) (f : LeanEval.Analysis.E d × ℝ × ℝ → ℝ) (u₀ : LeanEval.Analysis.E d → ℝ) (_hF : AnalyticOnNhd ℝ F univ) (_hf : AnalyticOnNhd ℝ f univ) (_hu₀ : AnalyticOnNhd ℝ u₀ univ) (x₀ : LeanEval.Analysis.E d) : ∃ (U : Set (LeanEval.Analysis.E d × ℝ)) (u : LeanEval.Analysis.E d × ℝ → ℝ), (x₀, (0 : ℝ)) ∈ U ∧ IsOpen U ∧ AnalyticOnNhd ℝ u U ∧ (∀ x : LeanEval.Analysis.E d, (x, (0 : ℝ)) ∈ U → u (x, 0) = u₀ x) ∧ (∀ p ∈ U, fderiv ℝ u p ((0 : LeanEval.Analysis.E d), (1 : ℝ)) = fderiv ℝ u p (F (p.1, p.2, u p), (0 : ℝ)) + f (p.1, p.2, u p)) ∧ (∀ v : LeanEval.Analysis.E d × ℝ → ℝ, AnalyticOnNhd ℝ v U → (∀ x : LeanEval.Analysis.E d, (x, (0 : ℝ)) ∈ U → v (x, 0) = u₀ x) → (∀ p ∈ U, fderiv ℝ v p ((0 : LeanEval.Analysis.E d), (1 : ℝ)) = fderiv ℝ v p (F (p.1, p.2, v p), (0 : ℝ)) + f (p.1, p.2, v p)) → ∀ p ∈ U, u p = v p) := d:ℕF:E d × ℝ × ℝ → E df:E d × ℝ × ℝ → ℝu₀:E d → ℝ_hF:AnalyticOnNhd ℝ F univ_hf:AnalyticOnNhd ℝ f univ_hu₀:AnalyticOnNhd ℝ u₀ univx₀:E d⊢ ∃ U u, (x₀, 0) ∈ U ∧ IsOpen U ∧ AnalyticOnNhd ℝ u U ∧ (∀ (x : E d), (x, 0) ∈ U → u (x, 0) = u₀ x) ∧ (∀ p ∈ U, (fderiv ℝ u p) (0, 1) = (fderiv ℝ u p) (F (p.1, p.2, u p), 0) + f (p.1, p.2, u p)) ∧ ∀ (v : E d × ℝ → ℝ), AnalyticOnNhd ℝ v U → (∀ (x : E d), (x, 0) ∈ U → v (x, 0) = u₀ x) → (∀ p ∈ U, (fderiv ℝ v p) (0, 1) = (fderiv ℝ v p) (F (p.1, p.2, v p), 0) + f (p.1, p.2, v p)) → ∀ p ∈ U, u p = v p All goals completed! 🐙
#140
How produced

Change the name for model

Existence of a non-isotopic pair of oriented knots
exists_nonisotopic_knots

Verso theorem preview

theorem declaration uses `sorry`exists_nonisotopic_knots : ∃ K₁ K₂ : LeanEval.KnotTheory.Knot, ¬ K₁.Isotopic K₂ := ⊢ ∃ K₁ K₂, ¬K₁.Isotopic K₂ All goals completed! 🐙
#141
How produced

Change the name for model

Morrison–Walker Lemma B.0.1: adapting families of maps to open covers
families_of_maps_b01

Verso theorem preview

/-- **Lemma B.0.1** of Morrison–Walker, *The Blob Complex* (arXiv:1009.5025, §B), continuous case. -/ theorem declaration uses `sorry`continuous {P : Set (Fin k → ℝ)} (_hP : IsPolyhedron P) [CompactSpace X] (U : ι → Set X) (_hUopen : ∀ α, IsOpen (U α)) (ρ : PartitionOfUnity ι X univ) (_hρ : ρ.IsSubordinate U) (f : C(P × X, T)) : ∃ F : C(I × P × X, T), (∀ p : P, ∀ x : X, F (0, p, x) = f (p, x)) ∧ (∃ K : Subdivision P, ∀ D ∈ K.complex.facets, AdaptedTo U k (fun q : closedCell P D × X => F (1, q.1.1, q.2))) ∧ (∀ S : Set X, Supported (f := f.toFun) S → Supported (fun q : (I × P) × X => F (q.1.1, q.1.2, q.2)) S) ∧ (∀ Q : Set P, IsBoundarySubpolyhedron Q → ∀ S' : Set X, Supported (fun q : Q × X => f (q.1.1, q.2)) S' → Supported (fun q : (I × Q) × X => F (q.1.1, q.1.2.1, q.2)) S') := k:ℕι:Type u_1X:Type u_2T:Type u_3inst✝²:TopologicalSpace Xinst✝¹:TopologicalSpace TP:Set (Fin k → ℝ)_hP:IsPolyhedron Pinst✝:CompactSpace XU:ι → Set X_hUopen:∀ (α : ι), IsOpen[inst✝²] (U α)ρ:PartitionOfUnity ι X_hρ:ρ.IsSubordinate Uf:C(↑P × X, T)⊢ ∃ F, (∀ (p : ↑P) (x : X), F (0, p, x) = f (p, x)) ∧ (∃ K, ∀ D ∈ K.complex.facets, AdaptedTo U k fun q => F (1, ↑q.1, q.2)) ∧ (∀ (S : Set X), Supported f.toFun S → Supported (fun q => F (q.1.1, q.1.2, q.2)) S) ∧ ∀ (Q : Set ↑P), IsBoundarySubpolyhedron Q → ∀ (S' : Set X), Supported (fun q => f (↑q.1, q.2)) S' → Supported (fun q => F (q.1.1, ↑q.1.2, q.2)) S' All goals completed! 🐙
/-- **Lemma B.0.1**, bi-Lipschitz variant (part 4 of the paper). -/ theorem declaration uses `sorry`biLipschitz {X T : Type*} [MetricSpace X] [MetricSpace T] [CompactSpace X] {P : Set (Fin k → ℝ)} (_hP : IsPolyhedron P) {ι : Type*} (U : ι → Set X) (_hUopen : ∀ α, IsOpen (U α)) (ρ : PartitionOfUnity ι X univ) (_hρ : ρ.IsSubordinate U) (f : C(P × X, T)) (slice : P → (X ≃ₜ T)) (_h_slice_eq : ∀ p : P, ∀ x : X, f (p, x) = slice p x) (L : NNReal) (_hf_joint : LipschitzWith L f.toFun) (_hf_slice_inv : ∀ p : P, LipschitzWith L (slice p).symm) : ∃ F : C(I × P × X, T), ∃ L' : NNReal, ∃ Slice : I × P → (X ≃ₜ T), (∀ p : P, ∀ x : X, F (0, p, x) = f (p, x)) ∧ (∀ t : I, ∀ p : P, ∀ x : X, F (t, p, x) = Slice (t, p) x) ∧ (∃ K : Subdivision P, ∀ D ∈ K.complex.facets, AdaptedTo U k (fun q : closedCell P D × X => F (1, q.1.1, q.2))) ∧ (∀ S : Set X, Supported (f := f.toFun) S → Supported (fun q : (I × P) × X => F (q.1.1, q.1.2, q.2)) S) ∧ (∀ Q : Set P, IsBoundarySubpolyhedron Q → ∀ S' : Set X, Supported (fun q : Q × X => f (q.1.1, q.2)) S' → Supported (fun q : (I × Q) × X => F (q.1.1, q.1.2.1, q.2)) S') ∧ (∀ tp : I × P, LipschitzWith L' (Slice tp)) ∧ (∀ tp : I × P, LipschitzWith L' (Slice tp).symm) := k:ℕX:Type u_4T:Type u_5inst✝²:MetricSpace Xinst✝¹:MetricSpace Tinst✝:CompactSpace XP:Set (Fin k → ℝ)_hP:IsPolyhedron Pι:Type u_6U:ι → Set X_hUopen:∀ (α : ι), IsOpen[PseudoMetricSpace.toUniformSpace.toTopologicalSpace] (U α)ρ:PartitionOfUnity ι X_hρ:ρ.IsSubordinate Uf:C(↑P × X, T)slice:↑P → X ≃ₜ T_h_slice_eq:∀ (p : ↑P) (x : X), f (p, x) = (slice p) xL:NNReal_hf_joint:LipschitzWith L f.toFun_hf_slice_inv:∀ (p : ↑P), LipschitzWith L ⇑(slice p).symm⊢ ∃ F L' Slice, (∀ (p : ↑P) (x : X), F (0, p, x) = f (p, x)) ∧ (∀ (t : ↑I) (p : ↑P) (x : X), F (t, p, x) = (Slice (t, p)) x) ∧ (∃ K, ∀ D ∈ K.complex.facets, AdaptedTo U k fun q => F (1, ↑q.1, q.2)) ∧ (∀ (S : Set X), Supported f.toFun S → Supported (fun q => F (q.1.1, q.1.2, q.2)) S) ∧ (∀ (Q : Set ↑P), IsBoundarySubpolyhedron Q → ∀ (S' : Set X), Supported (fun q => f (↑q.1, q.2)) S' → Supported (fun q => F (q.1.1, ↑q.1.2, q.2)) S') ∧ (∀ (tp : ↑I × ↑P), LipschitzWith L' ⇑(Slice tp)) ∧ ∀ (tp : ↑I × ↑P), LipschitzWith L' ⇑(Slice tp).symm All goals completed! 🐙
#142
How produced

Change the name for model

Fundamental theorem of topos theory
fundamental_topos_theory

Verso theorem preview

theorem declaration uses `sorry`fundamental_topos_theory {E : Type*} [Category E] (hE : LeanEval.ToposTheory.IsTopos E) (X : E) : LeanEval.ToposTheory.IsTopos (Over X) := E:Type u_1inst✝:Category.{u_2, u_1} EhE:IsTopos EX:E⊢ IsTopos (Over X) All goals completed! 🐙
#143
How produced

Change the name for model

Gauss-Wantzel constructible regular polygon theorem
gauss_wantzel_constructible_polygon

Lean theorem statement

/-- **Gauss-Wantzel constructible polygon theorem** (§174): a regular `n`-gon
is straightedge-and-compass constructible exactly for the Gauss-Wantzel
integers. -/
theorem gauss_wantzel_constructible_polygon (n : ℕ) (hn : 3 ≤ n) :
    IsConstructible (Real.cos (2 * Real.pi / n)) ↔ GaussWantzelNumber n := by
  sorry
#144
How produced

Change the name for model

The Golod–Shafarevich inequality
golod_shafarevich_inequality

Verso theorem preview

theorem declaration uses `sorry`golod_shafarevich_inequality (p : ℕ) [Fact p.Prime] (Q : Type) [Group Q] [TopologicalSpace Q] [IsTopologicalGroup Q] [DiscreteTopology Q] [Finite Q] : IsPGroup p Q → Nontrivial Q → (generatorRank Q : ℝ) ^ 2 < 4 * (relationRank p Q : ℝ) := p:ℕinst✝⁵:Fact (Nat.Prime p)Q:Typeinst✝⁴:Group Qinst✝³:TopologicalSpace Qinst✝²:IsTopologicalGroup Qinst✝¹:DiscreteTopology Qinst✝:Finite Q⊢ IsPGroup p Q → Nontrivial Q → ↑(generatorRank Q) ^ 2 < 4 * ↑(relationRank p Q) All goals completed! 🐙
#145
How produced

Change the name for model

The Hopf Umlaufsatz (theorem of turning tangents)
hopf_umlaufsatz

Verso theorem preview

theorem declaration uses `sorry`hopf_umlaufsatz {r : ℝ → LeanEval.Geometry.HopfUmlaufsatz.Plane} {α : ℝ → ℝ} (_hr : LeanEval.Geometry.HopfUmlaufsatz.IsPositiveSimpleClosedUnitSpeedCurve r) (_hα : LeanEval.Geometry.HopfUmlaufsatz.IsTangentAngleLift r α) : totalCurvature α = 2 * Real.pi := r:ℝ → Planeα:ℝ → ℝ_hr:IsPositiveSimpleClosedUnitSpeedCurve r_hα:IsTangentAngleLift r α⊢ totalCurvature α = 2 * Real.pi All goals completed! 🐙
#146
How produced

Change the name for model

Hurewicz theorem in degree 1 (H₁ = abelianization of π₁)
hurewicz_h1_abelianization

Lean theorem statement

/-- **Hurewicz (n = 1).** For a path-connected space `X`, `H₁(X;ℤ)` is the
abelianization of `π₁(X, x)`. -/
theorem hurewicz_h1_abelianization
    (X : Type) [TopologicalSpace X] [PathConnectedSpace X] (x : X) :
    Nonempty (Additive (Abelianization (FundamentalGroup X x)) ≃+
      (IntegralHomology 1 X : Type)) := by
  sorry
#147
How produced

Change the name for model

Kolmogorov–Arnold superposition theorem (non-universal Lorentz form)
kolmogorov_arnold_superposition

Lean theorem statement

/-- **Kolmogorov–Arnold superposition theorem (non-universal Lorentz
form).** For `n ≥ 1`, every continuous `f` on the unit cube `[0, 1]ⁿ`
admits a representation
`f(x) = ∑_{k=0}^{2n} g(∑_{l=1}^{n} φ_{k,l}(x_l))` with a single
continuous outer function `g : ℝ → ℝ` and continuous inner functions
`φ_{k,l} : ℝ → ℝ`. -/
theorem kolmogorov_arnold (n : ℕ) (_hn : 1 ≤ n)
    (f : (Fin n → ℝ) → ℝ) (_hf : ContinuousOn f (Set.Icc 0 1)) :
    ∃ (g : ℝ → ℝ) (φ : Fin (2 * n + 1) → Fin n → ℝ → ℝ),
      Continuous g ∧ (∀ k l, Continuous (φ k l)) ∧
      ∀ x ∈ Set.Icc (0 : Fin n → ℝ) 1,
        f x = ∑ k, g (∑ l, φ k l (x l)) := by
  sorry
#148
How produced

Change the name for model

The Landsberg–Schaar relation
landsberg_schaar

Verso theorem preview

theorem declaration uses `sorry`landsberg_schaar (p q : ℕ) (hp : Odd p) (hq : Odd q) : gaussS (2 * q : ℕ) p = Complex.exp ((Real.pi : ℂ) * Complex.I / 4) * gaussS (-(p : ℤ)) (2 * q) := p:ℕq:ℕhp:Odd phq:Odd q⊢ gaussS (↑(2 * q)) p = cexp (↑Real.pi * I / 4) * gaussS (-↑p) (2 * q) All goals completed! 🐙
#149
How produced

Change the name for model

Lax's approximation theorem for toral homeomorphisms
lax_approximation

Lean theorem statement

/-- **Lax's approximation theorem.** Every toral dynamical system on `𝕋^d`
(`d ≥ 1`) is approximated arbitrarily well in the metric `δ` by cyclic cube
exchange transformations. -/
theorem lax_approximation {d : ℕ} (hd : 0 < d) (T : ToralDynamicalSystem d)
    {ε : ℝ≥0∞} (hε : 0 < ε) :
    ∃ (n : ℕ) (S : VolumePreservingEquiv d),
      IsCyclicCubeExchange S n ∧ deltaDist T.toVolumePreservingEquiv S < ε := by
  sorry
#150
How produced

Change the name for model

A 3-manifold group with no faithful representation into GL(4, ℝ)
nonlinear_three_manifold_group

Verso theorem preview

theorem declaration uses `sorry`nonlinear_three_manifold_group : ∃ (M : LeanEval.Topology.Closed3Manifold) (x : M.carrier), ∀ f : FundamentalGroup M.carrier x →* GL (Fin 4) ℝ, ¬ Function.Injective f := ⊢ ∃ M x, ∀ (f : FundamentalGroup M.carrier x →* GL (Fin 4) ℝ), ¬Function.Injective ⇑f All goals completed! 🐙
#151
How produced

Change the name for model

Ornstein–Weiss ℤᵈ Rokhlin lemma
ornstein_weiss_rokhlin

Verso theorem preview

theorem declaration uses `sorry`ornstein_weiss_rokhlin {Ω : Type*} [MeasurableSpace Ω] [StandardBorelSpace Ω] {d : ℕ} (_hd : 1 ≤ d) (μ : Measure Ω) [IsProbabilityMeasure μ] (T : (Fin d → ℤ) → Ω → Ω) (_hid : ∀ x, T 0 x = x) (_hT : ∀ v, MeasurePreserving (T v) μ μ) (_hgrp : ∀ u v x, T (u + v) x = T u (T v x)) (_hfree : LeanEval.Dynamics.IsFreeAction μ T) (N : ℕ) (_hN : 1 ≤ N) {ε : ENNReal} (_hε : 0 < ε) : ∃ B : Set Ω, MeasurableSet B ∧ ((boxShape d N : Finset (Fin d → ℤ)) : Set (Fin d → ℤ)).PairwiseDisjoint (fun v => T v '' B) ∧ μ (⋃ v ∈ boxShape d N, T v '' B) ≥ 1 - ε := Ω:Type u_1inst✝²:MeasurableSpace Ωinst✝¹:StandardBorelSpace Ωd:ℕ_hd:1 ≤ dμ:Measure Ωinst✝:IsProbabilityMeasure μT:(Fin d → ℤ) → Ω → Ω_hid:∀ (x : Ω), T 0 x = x_hT:∀ (v : Fin d → ℤ), MeasurePreserving (T v) μ μ_hgrp:∀ (u v : Fin d → ℤ) (x : Ω), T (u + v) x = T u (T v x)_hfree:IsFreeAction μ TN:ℕ_hN:1 ≤ Nε:ENNReal_hε:0 < ε⊢ ∃ B, MeasurableSet B ∧ ((↑(boxShape d N)).PairwiseDisjoint fun v => T v '' B) ∧ μ (⋃ v ∈ boxShape d N, T v '' B) ≥ 1 - ε All goals completed! 🐙
#152
How produced

Change the name for model

Pick's theorem
pick

Verso theorem preview

theorem declaration uses `sorry`pick {n : ℕ} (hn : 3 ≤ n) (v : Fin n → ℤ × ℤ) (hsimple : LeanEval.Geometry.PicksTheorem.IsSimple (LeanEval.Geometry.PicksTheorem.latPoly v)) : area ((LeanEval.Geometry.PicksTheorem.latPoly v).boundary (R := ℝ)) = (interiorPts v : ℝ) + (boundaryPts v : ℝ) / 2 - 1 := n:ℕhn:3 ≤ nv:Fin n → ℤ × ℤhsimple:IsSimple (latPoly v)⊢ area (Polygon.boundary ℝ (latPoly v)) = ↑(interiorPts v) + ↑(boundaryPts v) / 2 - 1 All goals completed! 🐙
#153
How produced

Change the name for model

Poincaré–Siegel linearisation theorem
poincare_siegel_linearisation

Lean theorem statement

/-- **Poincaré–Siegel linearisation theorem.** If `α` is Diophantine,
`λ = e^{2πiα}`, and `f` is holomorphic near `0` with `f 0 = 0` and
`f'(0) = λ`, then there is a holomorphic germ `u` with `u 0 = 0`,
`u'(0) = 1`, and `f(u z) = u(λ z)` for `z` near `0`. -/
theorem poincare_siegel
    (α : ℝ) (_hα : IsDiophantine α)
    (lam : ℂ) (_hlam : lam = Complex.exp (2 * Real.pi * Complex.I * (α : ℂ)))
    (f : ℂ → ℂ) (_hf : AnalyticAt ℂ f 0) (_hf0 : f 0 = 0)
    (_hmult : deriv f 0 = lam) :
    ∃ u : ℂ → ℂ, AnalyticAt ℂ u 0 ∧ u 0 = 0 ∧ deriv u 0 = 1 ∧
      ∀ᶠ z in nhds (0 : ℂ), f (u z) = u (lam * z) := by
  sorry
#154
How produced

Change the name for model

Radon transform: Fourier-slice diagonalization and pseudo-inversion
radon_transform_inversion

Verso theorem preview

theorem declaration uses `sorry`radon_can_be_diagonalized_and_pseudo_inverted : (∀ φ : SchwartzMap (ℝ × ℝ) ℂ, ∀ θ k : ℝ, fourier1 (fun p => radon (φ : ℝ × ℝ → ℂ) (p, θ)) k = fourier2 (φ : ℝ × ℝ → ℂ) (k * Real.cos θ, k * Real.sin θ)) ∧ (∃ Rinv : (ℝ × ℝ → ℂ) → (ℝ × ℝ → ℂ), ∀ φ : SchwartzMap (ℝ × ℝ) ℂ, Rinv (radon (φ : ℝ × ℝ → ℂ)) = (φ : ℝ × ℝ → ℂ)) := ⊢ (∀ (φ : SchwartzMap (ℝ × ℝ) ℂ) (θ k : ℝ), fourier1 (fun p => radon ⇑φ (p, θ)) k = fourier2 ⇑φ (k * Real.cos θ, k * Real.sin θ)) ∧ ∃ Rinv, ∀ (φ : SchwartzMap (ℝ × ℝ) ℂ), Rinv (radon ⇑φ) = ⇑φ All goals completed! 🐙
#155
How produced

Change the name for model

Riesz brothers' theorem
riesz_brothers_theorem

Lean theorem statement

/-- **Riesz brothers' theorem.** Let `μ` be a complex Borel measure on
the unit circle such that `∫ z^n dμ = 0` for every `n ≥ 1`. Then `μ` is
absolutely continuous with respect to Haar measure. The usual density
formulation follows by applying the Radon–Nikodym theorem to this conclusion;
the hypothesis transfers the Fourier-vanishing property to that density. This
corollary is not part of the formal statement here. -/
theorem riesz_brothers_theorem (μ : ComplexMeasure UnitAddCircle)
    (hμ : ∀ n : ℕ, 1 ≤ n → ∫ᵛ z, fourier n z ∂[ContinuousLinearMap.mul ℝ ℂ; μ] = 0) :
    μ ≪ᵥ AddCircle.haarAddCircle.toENNRealVectorMeasure := by
  sorry
#156
How produced

Change the name for model

Radial symmetry for positive semilinear Poisson solutions
semilinear_poisson_radial_symmetry

Verso theorem preview

theorem declaration uses `sorry`semilinear_poisson_radial_symmetry {n : ℕ} (hn : 0 < n) {f : ℝ → ℝ} (u : EuclideanSpace ℝ (Fin n) → ℝ) (hf_lipschitz : ∃ K : ℝ≥0, LipschitzWith K f) (hu_c2 : ContDiffOn ℝ 2 u (closedBall 0 1)) (hu_solve : LeanEval.Analysis.PDE.SolvesSemilinearPoisson f u) (hu_positive : ∀ x ∈ ball 0 1, 0 < u x) : ∃ v : ℝ → ℝ≥0, StrictAntiOn v (Set.Icc (0 : ℝ) 1) ∧ ∀ x ∈ closedBall 0 1, u x = v ‖x‖ := n:ℕhn:0 < nf:ℝ → ℝu:EuclideanSpace ℝ (Fin n) → ℝhf_lipschitz:∃ K, LipschitzWith K fhu_c2:ContDiffOn ℝ 2 u (closedBall 0 1)hu_solve:SolvesSemilinearPoisson f uhu_positive:∀ x ∈ ball 0 1, 0 < u x⊢ ∃ v, StrictAntiOn v (Set.Icc 0 1) ∧ ∀ x ∈ closedBall 0 1, u x = ↑(v ‖x‖) All goals completed! 🐙
#157
How produced

Change the name for model

Sobolev embedding theorem (Morrey regime)
sobolev_embedding_morrey

Verso theorem preview

theorem declaration uses `sorry`sobolev_embedding {n k r : ℕ} {α p : ℝ} (_hp : (n : ℝ) < p) (_hα : 0 < α) (_hα1 : α ≤ 1) (_hgap : (r : ℝ) + α < (k : ℝ) - n / p) (f : LeanEval.Analysis.SobolevMorreyProblem.E n → ℝ) (_hf : LeanEval.Analysis.SobolevMorreyProblem.MemSobolevWk k (ENNReal.ofReal p) f) : ∃ g : LeanEval.Analysis.SobolevMorreyProblem.E n → ℝ, f =ᵐ[volume] g ∧ LeanEval.Analysis.SobolevMorreyProblem.MemHolder r α g := n:ℕk:ℕr:ℕα:ℝp:ℝ_hp:↑n < p_hα:0 < α_hα1:α ≤ 1_hgap:↑r + α < ↑k - ↑n / pf:E n → ℝ_hf:MemSobolevWk k (ENNReal.ofReal p) f⊢ ∃ g, f =ᵐ[volume] g ∧ LeanEval.Analysis.SobolevMorreyProblem.MemHolder r α g All goals completed! 🐙
#158
How produced

Change the name for model

Strong Subadditivity of von Neumann Entropy
strong_subadditivity

Verso theorem preview

theorem declaration uses `sorry`strong_subadditivity (M_ABC : Matrix (A × B × C) (A × B × C) ℂ) (h : M_ABC.PosSemidef) : let M_AB : Matrix (A × B) (A × B) ℂ := .traceRight <| M_ABC.reindex (.symm <| .prodAssoc ..) (.symm <| .prodAssoc ..) let M_BC : Matrix (B × C) (B × C) ℂ := M_ABC.traceLeft let M_B : Matrix B B ℂ := M_BC.traceRight LeanEval.Physics.entropy M_ABC + LeanEval.Physics.entropy M_B ≤ LeanEval.Physics.entropy M_AB + LeanEval.Physics.entropy M_BC := A:Type u_1B:Type u_2C:Type u_3inst✝⁸:Fintype Ainst✝⁷:Fintype Binst✝⁶:Fintype Cinst✝⁵:DecidableEq Ainst✝⁴:DecidableEq Binst✝³:DecidableEq Cinst✝²:Nonempty Ainst✝¹:Nonempty Binst✝:Nonempty CM_ABC:Matrix (A × B × C) (A × B × C) ℂh:M_ABC.PosSemidef⊢ let M_AB := ((Matrix.reindex (Equiv.prodAssoc A B C).symm (Equiv.prodAssoc A B C).symm) M_ABC).traceRight; let M_BC := M_ABC.traceLeft; let M_B := M_BC.traceRight; entropy M_ABC + entropy M_B ≤ entropy M_AB + entropy M_BC All goals completed! 🐙
#159
How produced

Change the name for model

General recursive equals Turing computable
turing_recursive_equiv

Lean theorem statement

/-- **General recursive = Turing computable** (total form). A total function
`f : ℕ → ℕ` is recursive (`Computable`, i.e. partial recursive as a partial
function) **iff** it is computed by some Turing machine (mathlib's `FinTM2`
model) under the standard binary encoding of `ℕ`. This is Knill's class
equality; the backward direction (TM-computable ⇒ recursive) is absent from
mathlib. -/
theorem turing_recursive_equiv (f : ℕ → ℕ) :
    Computable f ↔ Nonempty (TM2Computable encodeNat encodeNat f) := by
  sorry
#160
How produced

Change the name for model

Klartag's construction of lattice sphere packings
klartag_packing

Verso theorem preview

theorem declaration uses `sorry`klartag_packing : ∃ c : ℝ, 0 < c ∧ ∀ n : ℕ, let V := EuclideanSpace ℝ (Fin (n + 1)) ∃ φ : V →ₗ[ℝ] V, let E := φ '' Metric.ball (0 : V) 1 (MeasureTheory.volume E : EReal) = c * n ^ 2 ∧ {v ∈ E | ∀ i, v i ∈ Set.range ((↑) : ℤ → ℝ)} = {0} := ⊢ ∃ c, 0 < c ∧ ∀ (n : ℕ), let V := EuclideanSpace ℝ (Fin (n + 1)); ∃ φ, let E := ⇑φ '' Metric.ball 0 1; ↑(MeasureTheory.volume E) = ↑c * ↑n ^ 2 ∧ {v | v ∈ E ∧ ∀ (i : Fin (n + 1)), v.ofLp i ∈ Set.range Int.cast} = {0} All goals completed! 🐙
#161
Equiangular lines with a fixed angle
annals_equiangular_lines_fixed_angle

Verso theorem preview

theorem declaration uses `sorry`theorem_1_2 (α : ℝ) (hα : α ∈ Set.Ioo 0 1) : let k := spectralRadiusOrder ((1 - α) / (2 * α)) (k < ⊤ → ∀ᶠ d in atTop, N α d = ⌊(k.toNat * (d - 1) : ℝ) / (k.toNat - 1 : ℝ)⌋₊) ∧ (k = ⊤ → ∃ e : ℕ → ℝ, e =o[atTop] (Nat.cast : ℕ → ℝ) ∧ ∀ d, N α d = d + e d) := α:ℝhα:α ∈ Set.Ioo 0 1⊢ let k := spectralRadiusOrder ((1 - α) / (2 * α)); (k < ⊤ → ∀ᶠ (d : ℕ) in atTop, N α d = ⌊↑k.toNat * (↑d - 1) / (↑k.toNat - 1)⌋₊) ∧ (k = ⊤ → ∃ e, e =o[atTop] Nat.cast ∧ ∀ (d : ℕ), ↑(N α d) = ↑d + e d) All goals completed! 🐙
#162
Thresholds versus fractional expectation-thresholds
annals_fractional_expectation_thresholds

Verso theorem preview

/-- The constant `K` in Theorem 1.1. -/ noncomputable def declaration uses `sorry`K : ℝ := sorry
/-- Statement of Theorem 1.1: There exists a universal constant `K` such that for any finite set `X` and any increasing collection of sets `𝓕` such that `l(𝓕)` is at least `2`, `p_c(𝓕) ≤ K * q_f(𝓕) * log l(𝓕)`. Note: The assumption that `l(𝓕)` is at least `2` is not explicitly in the paper but is needed because if `l(𝓕) = 1` then `Real.log (l 𝓕) = 0`, but `p_c 𝓕 ∈ (0,1)` (so the inequality clearly cannot hold). -/ theorem declaration uses `sorry`theorem_1_1 (X : Type*) [Fintype X] (𝓕 : Set (Set X)) (h𝓕 : IsUpperSet 𝓕) (hl𝓕 : 2 ≤ l 𝓕) : p_c 𝓕 ≤ K * q_f 𝓕 * Real.log (l 𝓕) := X:Type u_1inst✝:Fintype X𝓕:Set (Set X)h𝓕:IsUpperSet 𝓕hl𝓕:2 ≤ l 𝓕⊢ ↑(p_c 𝓕) ≤ K * ↑(q_f 𝓕) * Real.log ↑(l 𝓕) All goals completed! 🐙
#163
How produced

Produced using gpt-5.6-sol through the Humanize iterative implementation and independent review workflow, with a natural-language proof written before Lean implementation and validation under Lean 4.33.0.

Rademacher type and Enflo type coincide
annals_rademacher_enflo_type

Verso theorem preview

theorem declaration uses `sorry`theorem_1_1 (p : ℝ) (h1p : 1 ≤ p) (hp2 : p ≤ 2) : TR X p ≤ TE X p ∧ TE X p ≤ (pi / sqrt 2) * TR X p := X:Type u_2inst✝²:NormedAddCommGroup Xinst✝¹:NormedSpace ℝ Xinst✝:CompleteSpace Xp:ℝh1p:1 ≤ php2:p ≤ 2⊢ TR X p ≤ TE X p ∧ TE X p ≤ ↑pi / ↑(sqrt 2) * TR X p All goals completed! 🐙
#164
How produced

Produced using gpt-5.6-sol through the Humanize iterative implementation and independent review workflow, with a natural-language proof written before Lean implementation and validation under Lean 4.33.0.

Szemerédi's theorem
szemeredi

Verso theorem preview

theorem declaration uses `sorry`szemeredi (A : Set ℕ) (h : 0 < upperDensity A) : LeanEval.Combinatorics.ContainsArbitraryAPs A := A:Set ℕh:0 < upperDensity A⊢ ContainsArbitraryAPs A All goals completed! 🐙
#165
Hopf–Rinow theorem
hopf_rinow

Verso theorem preview

theorem declaration uses `sorry`hopf_rinow {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] {H : Type*} [TopologicalSpace H] (I : ModelWithCorners ℝ E H) [I.Boundaryless] (M : Type*) [EMetricSpace M] [ChartedSpace H M] [IsManifold I ∞ M] [Bundle.RiemannianBundle (fun x : M => TangentSpace I x)] [IsContMDiffRiemannianBundle I ∞ E (fun x : M => TangentSpace I x)] [IsContinuousRiemannianBundle E (fun x : M => TangentSpace I x)] [IsRiemannianManifold I M] [LocallyCompactSpace M] [ConnectedSpace M] : LeanEval.Geometry.IsGeodesicallyComplete M ↔ CompleteSpace M := E:Type u_1inst✝¹³:NormedAddCommGroup Einst✝¹²:NormedSpace ℝ Einst✝¹¹:FiniteDimensional ℝ EH:Type u_2inst✝¹⁰:TopologicalSpace HI:ModelWithCorners ℝ E Hinst✝⁹:I.BoundarylessM:Type u_3inst✝⁸:EMetricSpace Minst✝⁷:ChartedSpace H Minst✝⁶:IsManifold I ∞ Minst✝⁵:RiemannianBundle fun x => TangentSpace I xinst✝⁴:IsContMDiffRiemannianBundle I ∞ E fun x => TangentSpace I xinst✝³:IsContinuousRiemannianBundle E fun x => TangentSpace I xinst✝²:IsRiemannianManifold I Minst✝¹:LocallyCompactSpace Minst✝:ConnectedSpace M⊢ IsGeodesicallyComplete M ↔ CompleteSpace M All goals completed! 🐙
#166
Wiener–Lévy theorem
wiener_levy_analytic_calculus

Lean theorem statement

/-- **Wiener–Lévy theorem.** If `φ` is complex-analytic on a neighbourhood of
the range of a Wiener-algebra function `f`, then the composed function
`φ ∘ f` is again in the Wiener algebra. -/
theorem wiener_levy_analytic_calculus (f : C(AddCircle T, ℂ))
    (φ : ℂ → ℂ) (U : Set ℂ) (hf : InWienerAlgebra f)
    (hU : IsOpen U) (hrange : range f ⊆ U)
    (hφ : AnalyticOnNhd ℂ φ U) :
    ∃ g : C(AddCircle T, ℂ),
      (∀ x, g x = φ (f x)) ∧ InWienerAlgebra g := by
  sorry
#167
Wiener's 1/f theorem
wiener_inverse_closed

Lean theorem statement

/-- **Wiener's `1/f` theorem.** If a function on the circle belongs to the
Wiener algebra and has no zero on the circle, then its pointwise reciprocal
again belongs to the Wiener algebra. -/
theorem wiener_inverse_closed (f : C(AddCircle T, ℂ))
    (hf : InWienerAlgebra f) (hzero : ∀ x, f x ≠ 0) :
    ∃ g : C(AddCircle T, ℂ),
      (∀ x, g x = (f x)⁻¹) ∧ InWienerAlgebra g := by
  sorry
#168
Boone–Higman theorem (easy direction)
boone_higman_embedding

Verso theorem preview

theorem declaration uses `sorry`boone_higman_embedding {G H K : Type*} [Group G] [Group H] [Group K] [IsSimpleGroup H] [Group.IsFinitelyPresented K] (f : G →* H) (hf : Function.Injective f) (g : H →* K) (hg : Function.Injective g) {n : ℕ} (φ : FreeGroup (Fin n) →* G) (hsurj : Function.Surjective φ) (hker : (MonoidHom.ker φ).IsFinitelyNormallyGenerated) : LeanEval.GroupTheory.BooneHigmanEmbedding.WordProblemSolvable φ := G:Type u_1H:Type u_2K:Type u_3inst✝⁴:Group Ginst✝³:Group Hinst✝²:Group Kinst✝¹:IsSimpleGroup Hinst✝:Group.IsFinitelyPresented Kf:G →* Hhf:Function.Injective ⇑fg:H →* Khg:Function.Injective ⇑gn:ℕφ:FreeGroup (Fin n) →* Ghsurj:Function.Surjective ⇑φhker:φ.ker.IsFinitelyNormallyGenerated⊢ WordProblemSolvable φ All goals completed! 🐙
#169
How produced

Change the name for model

Choquet's representation theorem
choquet_representation_theorem

Verso theorem preview

theorem declaration uses `sorry`choquet [MeasurableSpace X] [BorelSpace X] (K : Set X) (hK_cpt : IsCompact K) (hK_cvx : Convex ℝ K) {x : X} (hx : x ∈ K) : ∃ μ : Measure X, IsProbabilityMeasure μ ∧ μ (K.extremePoints ℝ)ᶜ = 0 ∧ x = ∫ y, y ∂μ := X:Type u_1inst✝⁴:NormedAddCommGroup Xinst✝³:NormedSpace ℝ Xinst✝²:CompleteSpace Xinst✝¹:MeasurableSpace Xinst✝:BorelSpace XK:Set XhK_cpt:IsCompact KhK_cvx:Convex ℝ Kx:Xhx:x ∈ K⊢ ∃ μ, IsProbabilityMeasure μ ∧ μ (Set.extremePoints ℝ K)ᶜ = 0 ∧ x = ∫ (y : X), y ∂μ All goals completed! 🐙
#170
How produced

Change the name for model

Chen theorem for Markoff graphs
dvd_card_connectedComponent_markoffGraph

Verso theorem preview

theorem declaration uses `sorry`dvd_card_connectedComponent_markoffGraph {p : ℕ} (hp : Nat.Prime p) (hgt : 3 < p) : ∀ c : (LeanEval.Combinatorics.markoffGraph p).ConnectedComponent, p ∣ Nat.card c := p:ℕhp:Nat.Prime phgt:3 < p⊢ ∀ (c : (markoffGraph p).ConnectedComponent), p ∣ Nat.card ↥c All goals completed! 🐙
#171
How produced

Change the name for model

Fang–Xia: tiling of the symmetric group by transpositions implies λ-transitivity
fang_xia_tiling_partition_transitive

Verso theorem preview

theorem declaration uses `sorry`fang_xia_partition_transitive_of_tiling {n : ℕ} {Y : Set (Equiv.Perm (Fin n))} (_h : LeanEval.Combinatorics.FangXiaTilingProblem.IsTiling (LeanEval.Combinatorics.FangXiaTilingProblem.transpositionsWithOne n) Y) : ∀ lam : LeanEval.Combinatorics.FangXiaTilingProblem.PartitionShape n, 0 ≤ lam.contentSum → LeanEval.Combinatorics.FangXiaTilingProblem.IsPartitionTransitive Y lam := n:ℕY:Set (Equiv.Perm (Fin n))_h:IsTiling (transpositionsWithOne n) Y⊢ ∀ (lam : PartitionShape n), 0 ≤ lam.contentSum → IsPartitionTransitive Y lam All goals completed! 🐙
#172
How produced

Change the name for model

Fraser: Fourier decay for finite-field Kakeya sets is q^{-1} and sharp
fraser_kakeya_fourier_decay

Verso theorem preview

theorem declaration uses `sorry`fraser_kakeya_fourier_decay_and_sharp {d : ℕ} (_hd : 2 ≤ d) {K : Set (LeanEval.Combinatorics.FraserKakeyaProblem.Space F d)} (_hK : LeanEval.Combinatorics.FraserKakeyaProblem.IsKakeya K) (χ : AddChar F ℂ) (_hχ : χ ≠ 1) : (∃ μ : LeanEval.Combinatorics.FraserKakeyaProblem.Space F d → ℝ, LeanEval.Combinatorics.FraserKakeyaProblem.IsProbabilityMeasureOn K μ ∧ ∀ ξ : LeanEval.Combinatorics.FraserKakeyaProblem.Space F d, ξ ≠ 0 → ‖fourier χ μ ξ‖ ≤ (Fintype.card F : ℝ)⁻¹) ∧ (∀ κ : ℝ, 0 < κ → κ < 1 → ∃ Q : ℕ, ∀ (F' : Type*) [Field F'] [Fintype F'] [DecidableEq F'], Q ≤ Fintype.card F' → ∃ K' : Set (LeanEval.Combinatorics.FraserKakeyaProblem.Space F' d), LeanEval.Combinatorics.FraserKakeyaProblem.IsKakeya K' ∧ ∀ μ : LeanEval.Combinatorics.FraserKakeyaProblem.Space F' d → ℝ, LeanEval.Combinatorics.FraserKakeyaProblem.IsProbabilityMeasureOn K' μ → ∃ ξ : LeanEval.Combinatorics.FraserKakeyaProblem.Space F' d, ξ ≠ 0 ∧ κ * (Fintype.card F' : ℝ)⁻¹ ≤ ‖fourier (AddChar.FiniteField.primitiveChar_to_Complex F') μ ξ‖) := F:Type u_1inst✝²:Field Finst✝¹:Fintype Finst✝:DecidableEq Fd:ℕ_hd:2 ≤ dK:Set (Space F d)_hK:IsKakeya Kχ:AddChar F ℂ_hχ:χ ≠ 1⊢ (∃ μ, IsProbabilityMeasureOn K μ ∧ ∀ (ξ : Space F d), ξ ≠ 0 → ‖LeanEval.Combinatorics.FraserKakeyaProblem.fourier χ μ ξ‖ ≤ (↑(Fintype.card F))⁻¹) ∧ ∀ (κ : ℝ), 0 < κ → κ < 1 → ∃ Q, ∀ (F' : Type u_2) [inst : Field F'] [inst_1 : Fintype F'] [DecidableEq F'], Q ≤ Fintype.card F' → ∃ K', IsKakeya K' ∧ ∀ (μ : Space F' d → ℝ), IsProbabilityMeasureOn K' μ → ∃ ξ, ξ ≠ 0 ∧ κ * (↑(Fintype.card F'))⁻¹ ≤ ‖LeanEval.Combinatorics.FraserKakeyaProblem.fourier (AddChar.FiniteField.primitiveChar_to_Complex F') μ ξ‖ All goals completed! 🐙
#173
How produced

Change the name for model

Frobenius determinant theorem
frobenius_group_determinant

Verso theorem preview

theorem declaration uses `sorry`frobenius_group_determinant (G : Type*) [Group G] [Fintype G] [DecidableEq G] : ∃ (r : ℕ) (p : Fin r → MvPolynomial G ℂ), r = Nat.card (ConjClasses G) ∧ (∀ j, Irreducible (p j)) ∧ (∀ i j, i ≠ j → ¬ Associated (p i) (p j)) ∧ groupDeterminant G = ∏ j, (p j) ^ (p j).totalDegree := G:Type u_1inst✝²:Group Ginst✝¹:Fintype Ginst✝:DecidableEq G⊢ ∃ r p, r = Nat.card (ConjClasses G) ∧ (∀ (j : Fin r), Irreducible (p j)) ∧ (∀ (i j : Fin r), i ≠ j → ¬Associated (p i) (p j)) ∧ groupDeterminant G = ∏ j, p j ^ (p j).totalDegree All goals completed! 🐙
#174
How produced

Change the name for model

Frobenius's theorem: the Frobenius kernel is normal
frobenius_kernel_isNormal

Verso theorem preview

theorem declaration uses `sorry`frobenius_kernel_isNormal (G X : Type) [Group G] [Fintype G] [Fintype X] [MulAction G X] [FaithfulSMul G X] (hcard : 2 ≤ Fintype.card X) (htrans : ∀ x y : X, ∃ g : G, g • x = y) (hstab : ∀ x : X, MulAction.stabilizer G x ≠ ⊥) (hfrob : ∀ g : G, g ≠ 1 → ∀ x y : X, g • x = x → g • y = y → x = y) : ∃ N : Subgroup G, N.Normal ∧ (N : Set G) = {1} ∪ {g : G | ∀ x : X, g • x ≠ x} := G:TypeX:Typeinst✝⁴:Group Ginst✝³:Fintype Ginst✝²:Fintype Xinst✝¹:MulAction G Xinst✝:FaithfulSMul G Xhcard:2 ≤ Fintype.card Xhtrans:∀ (x y : X), ∃ g, g • x = yhstab:∀ (x : X), MulAction.stabilizer G x ≠ ⊥hfrob:∀ (g : G), g ≠ 1 → ∀ (x y : X), g • x = x → g • y = y → x = y⊢ ∃ N, N.Normal ∧ ↑N = {1} ∪ {g | ∀ (x : X), g • x ≠ x} All goals completed! 🐙
#175
How produced

Change the name for model

Halmos's generic weak-mixing theorem
halmos_generic_weak_mixing

Verso theorem preview

theorem declaration uses `sorry`generic_weakly_mixing [StandardBorelSpace X] (m : Measure X) [IsProbabilityMeasure m] [NullSingletonClass m] : (∃ G : Set (LeanEval.Dynamics.HalmosGenericWeakMixingProblem.Automorphism m), IsGδ G ∧ Dense G ∧ ∀ T ∈ G, LeanEval.Dynamics.HalmosGenericWeakMixingProblem.IsWeaklyMixing m T) ∧ (∀ T : LeanEval.Dynamics.HalmosGenericWeakMixingProblem.Automorphism m, LeanEval.Dynamics.HalmosGenericWeakMixingProblem.IsWeaklyMixing m T → Ergodic (T.toEquiv : X → X) m) := X:Type u_1inst✝³:MeasurableSpace Xinst✝²:StandardBorelSpace Xm:Measure Xinst✝¹:IsProbabilityMeasure minst✝:NullSingletonClass m⊢ (∃ G, IsGδ G ∧ Dense G ∧ ∀ T ∈ G, IsWeaklyMixing m T) ∧ ∀ (T : Automorphism m), IsWeaklyMixing m T → Ergodic (⇑T.toEquiv) m All goals completed! 🐙
#176
How produced

Change the name for model

Hausdorff moment problem: absolute-continuity criterion
hausdorff_absolute_continuity

Verso theorem preview

theorem declaration uses `sorry`hausdorff_absolute_continuity {d : ℕ} (μ : Measure (EuclideanSpace ℝ (Fin d))) [IsProbabilityMeasure μ] (hμ : μ ((LeanEval.Analysis.HausdorffAbsoluteContinuity.cube d)ᶜ) = 0) : LeanEval.Analysis.HausdorffAbsoluteContinuity.UniformlyAbsolutelyContinuous μ (volume.restrict (LeanEval.Analysis.HausdorffAbsoluteContinuity.cube d)) ↔ ∃ C : ℝ, ∀ k n : Fin d → ℕ, k ≤ n → diff (momentOf μ) k n ≤ C * diff (momentOf (volume.restrict (LeanEval.Analysis.HausdorffAbsoluteContinuity.cube d))) k n := d:ℕμ:Measure (EuclideanSpace ℝ (Fin d))inst✝:IsProbabilityMeasure μhμ:μ (cube d)ᶜ = 0⊢ UniformlyAbsolutelyContinuous μ (volume.restrict (cube d)) ↔ ∃ C, ∀ (k n : Fin d → ℕ), k ≤ n → diff (momentOf μ) k n ≤ C * diff (momentOf (volume.restrict (cube d))) k n All goals completed! 🐙
#177
How produced

Change the name for model

The Hausdorff–Hildebrandt–Schoenberg moment theorem
hausdorff_hildebrandt_schoenberg

Verso theorem preview

theorem declaration uses `sorry`hausdorff_hildebrandt_schoenberg {d : ℕ} (a : (Fin d → ℕ) → ℝ) : LeanEval.Analysis.IsMomentConfiguration a ↔ LeanEval.Analysis.HausdorffBounded a := d:ℕa:(Fin d → ℕ) → ℝ⊢ IsMomentConfiguration a ↔ HausdorffBounded a All goals completed! 🐙
#178
How produced

Change the name for model

The Hausdorff positivity (complete-monotonicity) criterion
hausdorff_positivity_criterion

Lean theorem statement

/-- **Hausdorff positivity criterion** (Hausdorff 1921). A moment configuration
comes from a positive measure iff all its iterated backward differences are
nonnegative — i.e. the sequence is *completely monotone*: `(Δᵏa)ₙ ≥ 0` for all
`k ≤ n`. -/
theorem hausdorff_positivity {d : ℕ} (a : (Fin d → ℕ) → ℝ) :
    IsPositiveMomentConfiguration a ↔ ∀ k n : Fin d → ℕ, k ≤ n → 0 ≤ diff a k n := by
  sorry
#179
How produced

Change the name for model

Jordan curve theorem
jordan_curve

Verso theorem preview

theorem declaration uses `sorry`jordan_curve (r : Metric.sphere (0 : EuclideanSpace ℝ (Fin 2)) 1 → EuclideanSpace ℝ (Fin 2)) (_hcont : Continuous r) (_hinj : Function.Injective r) : Nat.card (ConnectedComponents ((Set.range r)ᶜ : Set (EuclideanSpace ℝ (Fin 2)))) = 2 := r:↑(Metric.sphere 0 1) → EuclideanSpace ℝ (Fin 2)_hcont:Continuous r_hinj:Function.Injective r⊢ Nat.card (ConnectedComponents ↑(Set.range r)ᶜ) = 2 All goals completed! 🐙
#180
How produced

Change the name for model

Kirk's normal-structure fixed point theorem
kirk_normal_structure

Verso theorem preview

theorem declaration uses `sorry`kirk_normal_structure [CompleteSpace E] (hE_reflexive : Function.Surjective (NormedSpace.inclusionInDoubleDual ℝ E)) (K : Set E) (hK_nonempty : K.Nonempty) (hK_closed : IsClosed K) (hK_bounded : Bornology.IsBounded K) (hK_convex : Convex ℝ K) (hK_normal : LeanEval.Topology.KirkNormalStructure.HasNormalStructure K) (T : K → K) (hT : LeanEval.Topology.KirkNormalStructure.IsNonexpansiveSelfMap K T) : ∃ x : K, IsFixedPt T x := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:CompleteSpace EhE_reflexive:Surjective ⇑(NormedSpace.inclusionInDoubleDual ℝ E)K:Set EhK_nonempty:K.NonemptyhK_closed:IsClosed KhK_bounded:Bornology.IsBounded KhK_convex:Convex ℝ KhK_normal:HasNormalStructure KT:↑K → ↑KhT:IsNonexpansiveSelfMap K T⊢ ∃ x, IsFixedPt T x All goals completed! 🐙
#181
How produced

Change the name for model

Fundamental theorem of Riemannian geometry (Levi-Civita)
levi_civita_exists_unique

Lean theorem statement

/-- **Fundamental theorem of Riemannian geometry** (Levi-Civita). On a
`C^∞` finite-dimensional Riemannian manifold there exists a smooth
torsion-free metric-compatible covariant derivative on `TM`, and any other
such connection agrees with it on smooth vector fields. -/
theorem levi_civita_exists_unique
    {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E]
      [FiniteDimensional ℝ E] [CompleteSpace E]
    {H : Type*} [TopologicalSpace H] {I : ModelWithCorners ℝ E H}
    {M : Type*} [TopologicalSpace M] [T2Space M] [ChartedSpace H M]
      [IsManifold I ∞ M]
    [RiemannianBundle (fun (x : M) ↦ TangentSpace I x)]
    [IsContMDiffRiemannianBundle I ∞ E (fun (x : M) ↦ TangentSpace I x)] :
    ∃ cov : CovariantDerivative I E (TangentSpace I (M := M)),
      (ContMDiffCovariantDerivative cov ∞ ∧
        cov.torsion = 0 ∧ IsMetricCompatible cov) ∧
      ∀ cov' : CovariantDerivative I E (TangentSpace I (M := M)),
        (ContMDiffCovariantDerivative cov' ∞ ∧
          cov'.torsion = 0 ∧ IsMetricCompatible cov') →
        SameOnSmooth cov cov' := by
  sorry
#182
How produced

Change the name for model

Lidskii's inequality
lidskii_inequality

Verso theorem preview

theorem declaration uses `sorry`lidskii_inequality {n : Type*} [Fintype n] [DecidableEq n] {A B : Matrix n n ℂ} (hA : A.IsHermitian) (hB : B.IsHermitian) {p : ℝ} (_hp : 1 ≤ p) : ∑ j, |hA.eigenvalues₀ j - hB.eigenvalues₀ j| ^ p ≤ ∑ j, |(hB.sub hA).eigenvalues₀ j| ^ p := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℂB:Matrix n n ℂhA:A.IsHermitianhB:B.IsHermitianp:ℝ_hp:1 ≤ p⊢ ∑ j, |hA.eigenvalues₀ j - hB.eigenvalues₀ j| ^ p ≤ ∑ j, |⋯.eigenvalues₀ j| ^ p All goals completed! 🐙
#183
How produced

Change the name for model

Lindemann's theorem (e and π transcendental)
lindemann

Lean theorem statement

/-- **Lindemann's theorem.** Both `e = exp 1` and `π` are transcendental over
`ℤ`. -/
theorem lindemann :
    Transcendental ℤ (Real.exp 1) ∧ Transcendental ℤ Real.pi := by
  sorry
#184
How produced

Change the name for model

The Lindemann–Weierstrass theorem
lindemann_weierstrass

Lean theorem statement

/-- **Lindemann–Weierstrass theorem.** If `x₁, …, xₙ ∈ ℂ` are algebraic over `ℚ`
and ℚ-linearly independent, then `e^{x₁}, …, e^{xₙ}` are algebraically
independent over `ℚ`. -/
theorem lindemann_weierstrass {n : ℕ} (x : Fin n → ℂ)
    (h_alg : ∀ i, IsAlgebraic ℚ (x i))
    (h_lin : LinearIndependent ℚ x) :
    AlgebraicIndependent ℚ (fun i => Complex.exp (x i)) := by
  sorry
#185
How produced

Change the name for model

Liouville–Arnold theorem on integrable systems
liouville_arnold

Verso theorem preview

theorem declaration uses `sorry`liouville_arnold {n : ℕ} (F : Fin n → LeanEval.Geometry.LiouvilleArnold.E n → ℝ) (U : Set (LeanEval.Geometry.LiouvilleArnold.E n)) (_hU : IsOpen U) (_hLI : LeanEval.Geometry.LiouvilleArnold.IsLiouvilleIntegrable F U) (c : Fin n → ℝ) (_hMc_sub : LeanEval.Geometry.LiouvilleArnold.levelSet F c ⊆ U) (_hMc_compact : IsCompact (LeanEval.Geometry.LiouvilleArnold.levelSet F c)) (_hMc_connected : IsConnected (LeanEval.Geometry.LiouvilleArnold.levelSet F c)) : Nonempty ((LeanEval.Geometry.LiouvilleArnold.levelSet F c) ≃ₜ (Fin n → AddCircle (1 : ℝ))) := n:ℕF:Fin n → E n → ℝU:Set (E n)_hU:IsOpen U_hLI:IsLiouvilleIntegrable F Uc:Fin n → ℝ_hMc_sub:levelSet F c ⊆ U_hMc_compact:IsCompact (levelSet F c)_hMc_connected:IsConnected (levelSet F c)⊢ Nonempty (↑(levelSet F c) ≃ₜ (Fin n → AddCircle 1)) All goals completed! 🐙
#186
How produced

Change the name for model

Mountain Pass Theorem (Ambrosetti–Rabinowitz 1973)
mountain_pass

Verso theorem preview

theorem declaration uses `sorry`mountain_pass (f : E → ℝ) (_hf : ContDiff ℝ 1 f) (_hps : LeanEval.Analysis.MountainPassProblem.PalaisSmale f) {a b : E} {ε r : ℝ} (_hmr : LeanEval.Analysis.MountainPassProblem.MountainRange f a b ε r) : ∃ x : E, LeanEval.Analysis.MountainPassProblem.IsCriticalPoint f x ∧ f x = mountainPassLevel f a b ∧ ε ≤ mountainPassLevel f a b := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:CompleteSpace Ef:E → ℝ_hf:ContDiff ℝ 1 f_hps:PalaisSmale fa:Eb:Eε:ℝr:ℝ_hmr:MountainRange f a b ε r⊢ ∃ x, IsCriticalPoint f x ∧ f x = mountainPassLevel f a b ∧ ε ≤ mountainPassLevel f a b All goals completed! 🐙
#187
How produced

Change the name for model

Nyquist–Shannon sampling theorem
nyquist_shannon_sampling

Verso theorem preview

theorem declaration uses `sorry`nyquist_shannon_sampling (f : 𝓢(ℝ, ℂ)) (hf : LeanEval.Analysis.NyquistShannon.FourierSupportedInNyquist f) : ∀ t : ℝ, Summable (fun n : ℤ ↦ f (n : ℝ) * sinc (Real.pi * ((n : ℝ) - t))) ∧ f t = ∑' n : ℤ, f (n : ℝ) * sinc (Real.pi * ((n : ℝ) - t)) := f:𝓢(ℝ, ℂ)hf:FourierSupportedInNyquist f⊢ ∀ (t : ℝ), (Summable fun n => f ↑n * sinc (Real.pi * (↑n - t))) ∧ f t = ∑' (n : ℤ), f ↑n * sinc (Real.pi * (↑n - t)) All goals completed! 🐙
#188
How produced

Change the name for model

Independence of the parallel postulate
parallel_postulate_independent

Verso theorem preview

theorem declaration uses `sorry`parallel_postulate_independent : (∃ (M : Type) (T : LeanEval.Geometry.TarskiAbsolute M), LeanEval.Geometry.Euclidean M T) ∧ (∃ (M : Type) (T : LeanEval.Geometry.TarskiAbsolute M), ¬ LeanEval.Geometry.Euclidean M T) := ⊢ (∃ M T, Euclidean M T) ∧ ∃ M T, ¬Euclidean M T All goals completed! 🐙
#189
How produced

Change the name for model

Pascal's theorem
pascal

Lean theorem statement

/-- **Pascal's theorem.** Six distinct points on a non-singular conic determine
three collinear intersection points `Aᵢ Bⱼ ∩ Aⱼ Bᵢ`. -/
theorem pascal
    (M : Matrix (Fin 3) (Fin 3) ℝ) (hMsymm : M.IsSymm) (hMdet : M.det ≠ 0)
    (a₁ a₂ a₃ b₁ b₂ b₃ : Fin 3 → ℝ)
    (ha₁ : a₁ ≠ 0) (ha₂ : a₂ ≠ 0) (ha₃ : a₃ ≠ 0)
    (hb₁ : b₁ ≠ 0) (hb₂ : b₂ ≠ 0) (hb₃ : b₃ ≠ 0)
    (hdist : [a₁, a₂, a₃, b₁, b₂, b₃].Pairwise (fun v w => ¬ SamePoint v w))
    (hA₁ : OnConic M a₁) (hA₂ : OnConic M a₂) (hA₃ : OnConic M a₃)
    (hB₁ : OnConic M b₁) (hB₂ : OnConic M b₂) (hB₃ : OnConic M b₃) :
    Collinear3 (meet a₁ b₂ a₂ b₁) (meet a₁ b₃ a₃ b₁) (meet a₂ b₃ a₃ b₂) := by
  sorry
#190
How produced

Change the name for model

Sard's regular-value corollary
regular_value_ae

Lean theorem statement

/-- **Regular value corollary (Sard).** For a smooth `f : ℝᵐ → ℝ`, almost every
`c ∈ ℝ` is a regular value. -/
theorem regular_value_ae {m : ℕ} (f : EuclideanSpace ℝ (Fin m) → ℝ)
    (hf : ContDiff ℝ ∞ f) :
    ∀ᵐ c ∂(volume : Measure ℝ), IsRegularValue f c := by
  sorry
#191
How produced

Change the name for model

Rokhlin lemma
rokhlin_lemma

Lean theorem statement

/-- **Rokhlin lemma, not-necessarily-invertible forward-image form.** For every
aperiodic measure-preserving transformation `T` of a standard Borel probability
space `(Ω, μ)`, every height `n ≥ 1`, and every `ε > 0`, there is a measurable
base whose `n` forward-image floors `B, T B, …, T^{n−1} B` are pairwise
disjoint and whose union has outer measure at least `1 − ε`. No invertibility
assumption is made. -/
theorem rokhlin_lemma {Ω : Type*} [MeasurableSpace Ω]
    [StandardBorelSpace Ω]
    (μ : Measure Ω) [IsProbabilityMeasure μ] (T : Ω → Ω)
    (_hT : MeasurePreserving T μ μ) (_hap : IsAperiodic T μ)
    (n : ℕ) (_hn : 1 ≤ n) {ε : ENNReal} (_hε : 0 < ε) :
    ∃ B : Set Ω, IsRokhlinTower T B n ∧
      μ (towerUnion T B n) ≥ 1 - ε := by
  sorry
#192
How produced

Change the name for model

Shannon capacity of the pentagon
shannon_capacity_pentagon

Lean theorem statement

/-- **Lovász's theorem on Shannon capacity of the pentagon** (§238).
The Shannon capacity of the five-cycle is `√5`. -/
theorem shannon_capacity_pentagon :
    HasShannonCapacity (SimpleGraph.cycleGraph 5) (Real.sqrt 5) := by
  sorry
#193
How produced

Change the name for model

Local stable/unstable sets at a hyperbolic fixed point (set-level Hadamard–Perron)
stable_unstable_manifolds

Verso theorem preview

theorem declaration uses `sorry`stable_unstable_manifolds_exist (n : ℕ) (f : LeanEval.Dynamics.StableUnstableManifoldsProblem.E n → LeanEval.Dynamics.StableUnstableManifoldsProblem.E n) (x₀ : LeanEval.Dynamics.StableUnstableManifoldsProblem.E n) (_hf : ContDiffAt ℝ 1 f x₀) (_hfix : f x₀ = x₀) (_hhyp : LeanEval.Dynamics.StableUnstableManifoldsProblem.IsHyperbolicLinear (fderiv ℝ f x₀)) (_hf_inv : (fderiv ℝ f x₀).IsInvertible) : ∃ U : Set (LeanEval.Dynamics.StableUnstableManifoldsProblem.E n), IsOpen U ∧ x₀ ∈ U ∧ ∃ Ws Wu : Set (LeanEval.Dynamics.StableUnstableManifoldsProblem.E n), Ws = {x | (∀ k : ℕ, f^[k] x ∈ U) ∧ Tendsto (fun k => f^[k] x) atTop (𝓝 x₀)} ∧ Wu = {x | ∃ y : ℕ → LeanEval.Dynamics.StableUnstableManifoldsProblem.E n, y 0 = x ∧ (∀ k : ℕ, y k ∈ U) ∧ (∀ k : ℕ, f (y (k + 1)) = y k) ∧ Tendsto y atTop (𝓝 x₀)} ∧ Ws ∩ Wu = {x₀} := n:ℕf:E n → E nx₀:E n_hf:ContDiffAt ℝ 1 f x₀_hfix:f x₀ = x₀_hhyp:IsHyperbolicLinear (fderiv ℝ f x₀)_hf_inv:(fderiv ℝ f x₀).IsInvertible⊢ ∃ U, IsOpen U ∧ x₀ ∈ U ∧ ∃ Ws Wu, Ws = {x | (∀ (k : ℕ), f^[k] x ∈ U) ∧ Tendsto (fun k => f^[k] x) atTop (𝓝 x₀)} ∧ Wu = {x | ∃ y, y 0 = x ∧ (∀ (k : ℕ), y k ∈ U) ∧ (∀ (k : ℕ), f (y (k + 1)) = y k) ∧ Tendsto y atTop (𝓝 x₀)} ∧ Ws ∩ Wu = {x₀} All goals completed! 🐙
#194
How produced

Change the name for model

Tverberg's theorem
tverberg_theorem

Lean theorem statement

/-- **Tverberg's theorem.** Any `(r-1)(d+1)+1` points in `ℝ^d` admit an
`r`-part Tverberg partition. -/
theorem tverberg_theorem (d r : ℕ) (hr : 1 ≤ r)
    (f : Fin ((r - 1) * (d + 1) + 1) → Space d) :
    HasTverbergPartition (r := r) f := by
  sorry
#195
How produced

Change the name for model

Chudnovsky formula for pi inverse
chudnovsky_formula_for_pi_inv

Verso theorem preview

theorem declaration uses `sorry`chudnovsky_formula_for_pi_inv : chudnovskySum = π⁻¹ := ⊢ chudnovskySum = π⁻¹ All goals completed! 🐙
#196
Baer–Suzuki theorem
baer_suzuki

Verso theorem preview

theorem declaration uses `sorry`baer_suzuki {G : Type*} [Group G] [Finite G] {p : ℕ} [Fact p.Prime] (x : G) : x ∈ LeanEval.GroupTheory.Defs.pCore p G ↔ ∀ g : G, IsPGroup p (Subgroup.closure ({x, g * x * g⁻¹} : Set G)) := G:Type u_1inst✝²:Group Ginst✝¹:Finite Gp:ℕinst✝:Fact (Nat.Prime p)x:G⊢ x ∈ pCore p G ↔ ∀ (g : G), IsPGroup p ↥(Subgroup.closure {x, g * x * g⁻¹}) All goals completed! 🐙
#197
How produced

Change the name for model

Balanceable k-bounded partitions
balanceable_bounded_partitions

Lean theorem statement

/--
For any `k`, the smallest `n` such that any `k`-bounded partition of `n` is
also balanceable is given by `2 * lcm(1, ..., k)`.
-/
theorem minimal_balanceable_of_bounded (k : ℕ) (hk : 0 < k) :
    Minimal (fun n => 0 < n ∧ ∀ p : n.Partition, Bounded k p → Balanceable p) (2 * (Finset.Icc 1 k).lcm id) := by
  sorry
#198
How produced

Change the name for model

Brauer–Fowler theorem
brauer_fowler

Lean theorem statement

/-- **Brauer–Fowler theorem.** There is a function bounding the order
of a finite nonabelian simple group by the order of any involution
centralizer. -/
theorem brauer_fowler :
    ∃ f : ℕ → ℕ, ∀ (G : Type) [Group G] [Finite G],
      IsSimpleGroup G → (∃ a b : G, a * b ≠ b * a) →
      ∀ t : G, orderOf t = 2 →
        Nat.card G ≤ f (Nat.card (Subgroup.centralizer ({t} : Set G))) := by
  sorry
#199
How produced

Change the name for model

Complete reducibility for compact groups
compact_group_semisimple

Verso theorem preview

theorem declaration uses `sorry`compact_group_semisimple {G V : Type*} [Group G] [TopologicalSpace G] [IsTopologicalGroup G] [CompactSpace G] [NormedAddCommGroup V] [NormedSpace ℝ V] [FiniteDimensional ℝ V] (ρ : Representation ℝ G V) (hρ : Continuous fun p : G × V => ρ p.1 p.2) : ρ.IsSemisimpleRepresentation := G:Type u_1V:Type u_2inst✝⁶:Group Ginst✝⁵:TopologicalSpace Ginst✝⁴:IsTopologicalGroup Ginst✝³:CompactSpace Ginst✝²:NormedAddCommGroup Vinst✝¹:NormedSpace ℝ Vinst✝:FiniteDimensional ℝ Vρ:Representation ℝ G Vhρ:Continuous fun p => (ρ p.1) p.2⊢ ρ.IsSemisimpleRepresentation All goals completed! 🐙
#200
How produced

Change the name for model

Furstenberg–Weiss topological multiple recurrence (single-transformation form)
furstenberg_topological

Lean theorem statement

/-- **Furstenberg–Weiss topological multiple recurrence** (single-
transformation form). Every homeomorphism `T` of a nonempty compact
metric space `X` has a multiply recurrent point. -/
theorem furstenberg_topological_recurrence {X : Type*} [MetricSpace X]
    [CompactSpace X] [Nonempty X] (T : X ≃ₜ X) :
    ∃ x : X, IsMultiplyRecurrent (T : X → X) x := by
  sorry
#201
How produced

Change the name for model

Hippocrates' theorem on lunes
hippocrates_lunes

Verso theorem preview

theorem declaration uses `sorry`hippocrates_lunes (a b : ℝ) (ha : 0 < a) (hb : 0 < b) : volume (LeanEval.Geometry.HippocratesLunes.horizontalLune a b) + volume (LeanEval.Geometry.HippocratesLunes.verticalLune a b) = volume (LeanEval.Geometry.HippocratesLunes.rightTriangle a b) := a:ℝb:ℝha:0 < ahb:0 < b⊢ volume (horizontalLune a b) + volume (verticalLune a b) = volume (rightTriangle a b) All goals completed! 🐙
#202
How produced

Change the name for model

Jordan normal form
jordan_normal_form

Lean theorem statement

/-- **Jordan normal form.** Over an algebraically closed field, every
endomorphism of `Kⁿ` admits a Jordan-chain basis. -/
theorem jordan_normal_form {K : Type*} [Field K] [IsAlgClosed K] (n : ℕ)
    (f : Module.End K (StdSpace K n)) :
    Nonempty (JordanChainBasis f) := by
  sorry
#203
How produced

Change the name for model

Kakutani fixed-point theorem
kakutani_fixed_point

Lean theorem statement

/-- **Kakutani fixed-point theorem.** Every upper-hemicontinuous
correspondence `F` from a nonempty compact convex `K ⊆ ℝᵈ` to itself, with
nonempty convex closed values, has a fixed point `x ∈ F x`. -/
theorem kakutani_fixed_point {d : ℕ}
    {K : Set (EuclideanSpace ℝ (Fin d))}
    (_hK_compact : IsCompact K) (_hK_convex : Convex ℝ K)
    (_hK_nonempty : K.Nonempty)
    (F : EuclideanSpace ℝ (Fin d) → Set (EuclideanSpace ℝ (Fin d)))
    (_hF_uhc : IsUpperHemicontinuous F)
    (_hF_nonempty : ∀ x ∈ K, (F x).Nonempty)
    (_hF_convex : ∀ x ∈ K, Convex ℝ (F x))
    (_hF_closed : ∀ x ∈ K, IsClosed (F x))
    (_hF_maps : ∀ x ∈ K, F x ⊆ K) :
    ∃ x ∈ K, x ∈ F x := by
  sorry
#204
How produced

Change the name for model

Lidskii–Last eigenvalue-perturbation theorem
lidskii_last

Verso theorem preview

theorem declaration uses `sorry`lidskii_last {n : Type*} [Fintype n] [DecidableEq n] {A B : Matrix n n ℂ} (hA : A.IsHermitian) (hB : B.IsHermitian) : ∑ j, |hA.eigenvalues₀ j - hB.eigenvalues₀ j| ≤ ∑ i, ∑ j, ‖A i j - B i j‖ := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℂB:Matrix n n ℂhA:A.IsHermitianhB:B.IsHermitian⊢ ∑ j, |hA.eigenvalues₀ j - hB.eigenvalues₀ j| ≤ ∑ i, ∑ j, ‖A i j - B i j‖ All goals completed! 🐙
#205
How produced

Change the name for model

Monge–Kantorovich existence theorem
monge_kantorovich

Verso theorem preview

theorem declaration uses `sorry`monge_kantorovich_exists {X Y : Type*} [TopologicalSpace X] [PolishSpace X] [MeasurableSpace X] [BorelSpace X] [TopologicalSpace Y] [PolishSpace Y] [MeasurableSpace Y] [BorelSpace Y] (P : Measure X) (Q : Measure Y) [IsProbabilityMeasure P] [IsProbabilityMeasure Q] (c : X × Y → ENNReal) (_hc : Continuous c) : ∃ π ∈ LeanEval.Analysis.Couplings P Q, ∀ π' ∈ LeanEval.Analysis.Couplings P Q, kantorovichCost c π ≤ kantorovichCost c π' := X:Type u_1Y:Type u_2inst✝⁹:TopologicalSpace Xinst✝⁸:PolishSpace Xinst✝⁷:MeasurableSpace Xinst✝⁶:BorelSpace Xinst✝⁵:TopologicalSpace Yinst✝⁴:PolishSpace Yinst✝³:MeasurableSpace Yinst✝²:BorelSpace YP:Measure XQ:Measure Yinst✝¹:IsProbabilityMeasure Pinst✝:IsProbabilityMeasure Qc:X × Y → ENNReal_hc:Continuous c⊢ ∃ π ∈ Couplings P Q, ∀ π' ∈ Couplings P Q, kantorovichCost c π ≤ kantorovichCost c π' All goals completed! 🐙
#206
How produced

Change the name for model

Nash equilibrium existence theorem
nash_equilibrium_exists

Lean theorem statement

/-- **Nash equilibrium existence theorem.** Every finite `n`-player game
with nonempty finite pure-strategy sets and arbitrary real payoffs admits
at least one mixed-strategy Nash equilibrium. -/
theorem nash_equilibrium_exists {n : ℕ} {S : Fin n → Type*}
    [∀ i, Fintype (S i)] [∀ i, Nonempty (S i)]
    (u : Fin n → StrategyProfile n S → ℝ) :
    ∃ σ : ∀ i, S i → ℝ, IsNashEquilibrium u σ := by
  sorry
#207
How produced

Change the name for model

Peano existence theorem for ODEs
peano_existence

Verso theorem preview

theorem declaration uses `sorry`peano_existence {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] {f : E → E} (hf : Continuous f) (x₀ : E) : ∃ a : ℝ, 0 < a ∧ ∃ α : ℝ → E, α 0 = x₀ ∧ ∀ t ∈ Ioo (-a) a, HasDerivAt α (f (α t)) t := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:FiniteDimensional ℝ Ef:E → Ehf:Continuous fx₀:E⊢ ∃ a, 0 < a ∧ ∃ α, α 0 = x₀ ∧ ∀ t ∈ Ioo (-a) a, HasDerivAt α (f (α t)) t All goals completed! 🐙
#208
How produced

Change the name for model

A competition programming problem about permuting a permutation to be unimodal
permute_to_unimodal

Lean theorem statement

/--
`minRearrange` correctly computes the smallest number of indices that need to be permuted in order to
turn `arr` into a unimodal permutation.
-/
theorem minRearrange_correct {arr : Array Nat} :
    arr.Perm (1...=arr.size).toArray →
      (∃ (x : Array Nat) (hx : x.Perm (1...=arr.size).toArray), Unimodal x ∧ differences (Vector.mk x (by simpa using hx.size_eq)) arr.toVector = minRearrange arr) ∧
      (∀ (x : Array Nat) (hx : x.Perm (1...=arr.size).toArray), Unimodal x → minRearrange arr ≤ differences (Vector.mk x (by simpa using hx.size_eq)) arr.toVector) := by
  sorry
#209
How produced

Change the name for model

Sard's theorem (critical-set image has measure zero)
sard_theorem

Verso theorem preview

theorem declaration uses `sorry`sard {m n : ℕ} (f : LeanEval.Geometry.SardTheoremProblem.E m → LeanEval.Geometry.SardTheoremProblem.E n) (_hf : ContDiff ℝ ∞ f) : volume (LeanEval.Geometry.SardTheoremProblem.criticalValues f) = 0 := m:ℕn:ℕf:E m → E n_hf:ContDiff ℝ ∞ f⊢ volume (criticalValues f) = 0 All goals completed! 🐙
#210
How produced

Change the name for model

Solvable extensions ↔ solvable groups (the missing converse in Abel–Ruffini)
solvable_by_radicals_converse

Lean theorem statement

/-- **Solvable extensions ↔ solvable groups.** For a field `F` of
characteristic zero and a nonzero `p : F[X]`, every root of `p` in
`AlgebraicClosure F` lies in `solvableByRad F (AlgebraicClosure F)`
iff `p.Gal` is solvable. -/
theorem solvable_iff_solvableByRad (F : Type*) [Field F] [CharZero F]
    (p : F[X]) (_hp : p ≠ 0) :
    (∀ x : AlgebraicClosure F, aeval x p = 0 →
        x ∈ solvableByRad F (AlgebraicClosure F)) ↔ Group.IsSolvable p.Gal := by
  sorry
#211
How produced

Change the name for model

Sturm's theorem
sturm

Lean theorem statement

/-- **Sturm's theorem.** For a squarefree real polynomial `p` and an interval
`(a, b)` with `a < b` whose endpoints are not roots of `p`, the number of
distinct roots of `p` in `(a, b)` equals `σ(a) − σ(b)`. -/
theorem sturm (p : ℝ[X]) (hp : Squarefree p) {a b : ℝ} (hab : a < b)
    (ha : p.eval a ≠ 0) (hb : p.eval b ≠ 0) :
    ((p.roots.toFinset).filter (fun x => a < x ∧ x < b)).card =
      sigma p a - sigma p b := by
  sorry
#212
How produced

Change the name for model

Schur-Weyl duality: S_k image equals centralizer of GL(V) image
symAction_range_eq_centralizer_glAction

Verso theorem preview

theorem declaration uses `sorry`symAction_range_eq_centralizer_glAction {R : Type*} [Field R] {M : Type*} [AddCommGroup M] [Module R M] [FiniteDimensional R M] {k : ℕ} [Invertible (k.factorial : R)] : Algebra.adjoin R (Set.range (LeanEval.RepresentationTheory.symAction R M k)) = Subalgebra.centralizer R (Set.range (LeanEval.RepresentationTheory.glAction R M k)) := R:Type u_1inst✝⁴:Field RM:Type u_2inst✝³:AddCommGroup Minst✝²:Module R Minst✝¹:FiniteDimensional R Mk:ℕinst✝:Invertible ↑k.factorial⊢ Algebra.adjoin R (Set.range ⇑(symAction R M k)) = Subalgebra.centralizer R (Set.range ⇑(glAction R M k)) All goals completed! 🐙
#213
How produced

Change the name for model

Dimitrov's lower bound for the house of a nonzero algebraic integer that is not a root of unity
dimitrov

Verso theorem preview

theorem declaration uses `sorry`dimitrov {K : Type*} [Field K] [NumberField K] (α : K) (α_int : IsIntegral ℤ α) (α_ne_zero : α ≠ 0) (α_not_rootOfUnity : ¬ IsOfFinOrder α) : (2 : ℝ) ^ (1 / (4 * (Finset.univ.image fun σ : K →+* ℂ ↦ (σ α).arg).card) : ℝ) ≤ NumberField.house α := K:Type u_1inst✝¹:Field Kinst✝:NumberField Kα:Kα_int:IsIntegral ℤ αα_ne_zero:α ≠ 0α_not_rootOfUnity:¬IsOfFinOrder α⊢ 2 ^ (1 / (4 * ↑(Finset.image (fun σ => (σ α).arg) Finset.univ).card)) ≤ NumberField.house α All goals completed! 🐙
#214
Bauer's uniqueness at extreme points
bauer_extreme_point_uniqueness

Verso theorem preview

theorem declaration uses `sorry`bauer_unique [MeasurableSpace X] [BorelSpace X] (K : Set X) (hK_cpt : IsCompact K) (hK_cvx : Convex ℝ K) {x : X} (hx : x ∈ K.extremePoints ℝ) (μ : Measure X) [IsProbabilityMeasure μ] (hμ : μ Kᶜ = 0) (hbar : x = ∫ y, y ∂μ) : μ = Measure.dirac x := X:Type u_1inst✝⁵:NormedAddCommGroup Xinst✝⁴:NormedSpace ℝ Xinst✝³:CompleteSpace Xinst✝²:MeasurableSpace Xinst✝¹:BorelSpace XK:Set XhK_cpt:IsCompact KhK_cvx:Convex ℝ Kx:Xhx:x ∈ Set.extremePoints ℝ Kμ:Measure Xinst✝:IsProbabilityMeasure μhμ:μ Kᶜ = 0hbar:x = ∫ (y : X), y ∂μ⊢ μ = Measure.dirac x All goals completed! 🐙
#215
How produced

Change the name for model

Kuznetsov's theorem: finitely presented simple groups have solvable word problem
boone_higman_simple

Verso theorem preview

theorem declaration uses `sorry`boone_higman_simple {G : Type*} [Group G] [IsSimpleGroup G] {n : ℕ} (φ : FreeGroup (Fin n) →* G) (_hsurj : Function.Surjective φ) (_hker : (MonoidHom.ker φ).IsFinitelyNormallyGenerated) : LeanEval.GroupTheory.BooneHigmanSimpleProblem.WordProblemSolvable φ := G:Type u_1inst✝¹:Group Ginst✝:IsSimpleGroup Gn:ℕφ:FreeGroup (Fin n) →* G_hsurj:Function.Surjective ⇑φ_hker:φ.ker.IsFinitelyNormallyGenerated⊢ WordProblemSolvable φ All goals completed! 🐙
#216
How produced

Change the name for model

Euler–Lagrange equation
euler_lagrange_equation

Verso theorem preview

theorem declaration uses `sorry`euler_lagrange_equation {a b : ℝ} (L : ℝ → ℝ → ℝ → ℝ) (x : ℝ → ℝ) (_hab : a < b) (_hL : ContDiff ℝ 2 (fun p : ℝ × ℝ × ℝ => L p.1 p.2.1 p.2.2)) (_hx : ContDiff ℝ 2 x) (_hxe : LeanEval.Analysis.IsVariationalExtremum a b L x) : ∀ t ∈ Set.Ioo a b, lagrangianPartialX L x t = deriv (lagrangianPartialV L x) t := a:ℝb:ℝL:ℝ → ℝ → ℝ → ℝx:ℝ → ℝ_hab:a < b_hL:ContDiff ℝ 2 fun p => L p.1 p.2.1 p.2.2_hx:ContDiff ℝ 2 x_hxe:IsVariationalExtremum a b L x⊢ ∀ t ∈ Ioo a b, lagrangianPartialX L x t = deriv (lagrangianPartialV L x) t All goals completed! 🐙
#217
How produced

Change the name for model

Existence of a non-isotopic pair of oriented two-component links
exists_nonisotopic_link

Verso theorem preview

theorem declaration uses `sorry`exists_nonisotopic_link : ∃ L₁ L₂ : LeanEval.KnotTheory.TwoLink, ¬ L₁.Isotopic L₂ := ⊢ ∃ L₁ L₂, ¬L₁.Isotopic L₂ All goals completed! 🐙
#218
How produced

Change the name for model

Burnside p^a q^b theorem
finite_group_isSolvable_of_card_eq_prime_pow_mul_prime_pow

Verso theorem preview

theorem declaration uses `sorry`finite_group_isSolvable_of_card_eq_prime_pow_mul_prime_pow {G : Type*} [Group G] [Fintype G] {p q a b : ℕ} (hp : Nat.Prime p) (hq : Nat.Prime q) (hpq : p ≠ q) (hcard : Fintype.card G = p ^ a * q ^ b) : Group.IsSolvable G := G:Type u_1inst✝¹:Group Ginst✝:Fintype Gp:ℕq:ℕa:ℕb:ℕhp:Nat.Prime phq:Nat.Prime qhpq:p ≠ qhcard:Fintype.card G = p ^ a * q ^ b⊢ Group.IsSolvable G All goals completed! 🐙
#219
How produced

Change the name for model

Pointwise and Cesàro convergence of Fourier series (Dirichlet, Fejér)
fourier_dirichlet_fejer

Verso theorem preview

/-- **Dirichlet's pointwise convergence theorem** (§46). For every `C¹` 2π-periodic complex function `f`, the symmetric Fourier partial sums `S_N(f)(x)` converge to `f(x)` at every point `x ∈ ℝ`. -/ theorem declaration uses `sorry`dirichlet_pointwise {f : ℝ → ℂ} (_hperiod : Function.Periodic f (2 * Real.pi)) (_hC1 : ContDiff ℝ 1 f) (x : ℝ) : Tendsto (fun N : ℕ => fourierPartialSum f N x) atTop (𝓝 (f x)) := f:ℝ → ℂ_hperiod:Function.Periodic f (2 * Real.pi)_hC1:ContDiff ℝ 1 fx:ℝ⊢ Tendsto (fun N => fourierPartialSum f N x) atTop (𝓝 (f x)) All goals completed! 🐙
/-- **Fejér's theorem** (§46). For every *continuous* 2π-periodic complex function `f` — without the `C¹` hypothesis of Dirichlet's theorem — the Cesàro means `σ_N(f)` of the symmetric Fourier partial sums converge to `f` uniformly on `ℝ`. -/ theorem declaration uses `sorry`fejer {f : ℝ → ℂ} (_hperiod : Function.Periodic f (2 * Real.pi)) (_hcont : Continuous f) : TendstoUniformly (fun N : ℕ => fourierCesaroMean f N) f atTop := f:ℝ → ℂ_hperiod:Function.Periodic f (2 * Real.pi)_hcont:Continuous f⊢ TendstoUniformly (fun N => fourierCesaroMean f N) f atTop All goals completed! 🐙
#220
How produced

Change the name for model

Schur-Weyl duality: GL(V) image equals centralizer of S_k image
glAction_range_eq_centralizer_symAction

Verso theorem preview

theorem declaration uses `sorry`glAction_range_eq_centralizer_symAction {R : Type*} [Field R] {M : Type*} [AddCommGroup M] [Module R M] [FiniteDimensional R M] {k : ℕ} [Invertible (k.factorial : R)] : Algebra.adjoin R (Set.range (LeanEval.RepresentationTheory.glAction R M k)) = Subalgebra.centralizer R (Set.range (LeanEval.RepresentationTheory.symAction R M k)) := R:Type u_1inst✝⁴:Field RM:Type u_2inst✝³:AddCommGroup Minst✝²:Module R Minst✝¹:FiniteDimensional R Mk:ℕinst✝:Invertible ↑k.factorial⊢ Algebra.adjoin R (Set.range ⇑(glAction R M k)) = Subalgebra.centralizer R (Set.range ⇑(symAction R M k)) All goals completed! 🐙
#221
How produced

Change the name for model

Morley's trisector theorem
morley_theorem

Verso theorem preview

theorem declaration uses `sorry`morley_theorem (A B C P Q R : LeanEval.Geometry.Morley.Plane) (h : LeanEval.Geometry.Morley.IsMorleyConfiguration A B C P Q R) : LeanEval.Geometry.Morley.IsEquilateralTriple P Q R := A:PlaneB:PlaneC:PlaneP:PlaneQ:PlaneR:Planeh:IsMorleyConfiguration A B C P Q R⊢ IsEquilateralTriple P Q R All goals completed! 🐙
#222
How produced

Change the name for model

Normal spectral theorem
normal_spectral_theorem

Verso theorem preview

theorem declaration uses `sorry`normal_spectral_theorem (A : Matrix n n ℂ) : IsStarNormal A ↔ ∃ U ∈ unitary (Matrix n n ℂ), ∃ d : n → ℂ, A = U * diagonal d * star U := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℂ⊢ IsStarNormal A ↔ ∃ U ∈ unitary (Matrix n n ℂ), ∃ d, A = U * diagonal d * star U All goals completed! 🐙
#223
How produced

Change the name for model

Riesz's rising sun lemma
rising_sun_lemma

Verso theorem preview

theorem declaration uses `sorry`rising_sun_lemma {a b : ℝ} (hab : a < b) {f : ℝ → ℝ} (hf : ContinuousOn f (Icc a b)) : LeanEval.Analysis.RisingSun.HasRisingSunProperty a b f := a:ℝb:ℝhab:a < bf:ℝ → ℝhf:ContinuousOn f (Icc a b)⊢ HasRisingSunProperty a b f All goals completed! 🐙
#224
How produced

Change the name for model

Runge's theorem
runge_theorem

Verso theorem preview

theorem declaration uses `sorry`runge (K : Set ℂ) (_hK : IsCompact K) (U : Set ℂ) (_hU : IsOpen U) (_hKU : K ⊆ U) (f : ℂ → ℂ) (_hf : AnalyticOnNhd ℂ f U) (ε : ℝ) (_hε : 0 < ε) : ∃ p q : ℂ[X], (∀ z ∈ K, q.eval z ≠ 0) ∧ (∀ z ∈ K, ‖f z - p.eval z / q.eval z‖ < ε) := K:Set ℂ_hK:IsCompact KU:Set ℂ_hU:IsOpen U_hKU:K ⊆ Uf:ℂ → ℂ_hf:AnalyticOnNhd ℂ f Uε:ℝ_hε:0 < ε⊢ ∃ p q, (∀ z ∈ K, Polynomial.eval z q ≠ 0) ∧ ∀ z ∈ K, ‖f z - Polynomial.eval z p / Polynomial.eval z q‖ < ε All goals completed! 🐙
#225
How produced

Change the name for model

Schauder fixed-point theorem
schauder_fixed_point

Verso theorem preview

theorem declaration uses `sorry`schauder_fixed_point {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [CompleteSpace E] {K : Set E} (_hK_compact : IsCompact K) (_hK_convex : Convex ℝ K) (_hK_nonempty : K.Nonempty) (f : E → E) (_hf_cont : ContinuousOn f K) (_hf_maps : Set.MapsTo f K K) : ∃ x ∈ K, f x = x := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:CompleteSpace EK:Set E_hK_compact:IsCompact K_hK_convex:Convex ℝ K_hK_nonempty:K.Nonemptyf:E → E_hf_cont:ContinuousOn f K_hf_maps:Set.MapsTo f K K⊢ ∃ x ∈ K, f x = x All goals completed! 🐙
#226
How produced

Change the name for model

Wiener's atom-detection formula
wiener_atom_detection

Verso theorem preview

theorem declaration uses `sorry`wiener_atom_detection (μ : Measure (AddCircle (2 * Real.pi))) [IsProbabilityMeasure μ] : Tendsto (fun N : ℕ => (1 / (N : ℝ)) * ∑ k ∈ Finset.Icc (1 : ℤ) N, ‖fourierCoeffMeasure μ k‖ ^ 2) atTop (𝓝 (∑' x : AddCircle (2 * Real.pi), ((μ {x}).toReal) ^ 2)) := μ:Measure (AddCircle (2 * π))inst✝:IsProbabilityMeasure μ⊢ Tendsto (fun N => 1 / ↑N * ∑ k ∈ Finset.Icc 1 ↑N, ‖fourierCoeffMeasure μ k‖ ^ 2) atTop (𝓝 (∑' (x : AddCircle (2 * π)), (μ {x}).toReal ^ 2)) All goals completed! 🐙
#227
Abel–Ruffini theorem
abel_ruffini

Verso theorem preview

theorem declaration uses `sorry`abel_ruffini (n : ℕ) (_hn : 1 ≤ n) : (∀ p : ℚ[X], p.natDegree = n → ∀ x : ℂ, aeval x p = 0 → x ∈ solvableByRad ℚ ℂ) ↔ n ≤ 4 := n:ℕ_hn:1 ≤ n⊢ (∀ (p : ℚ[X]), p.natDegree = n → ∀ (x : ℂ), (aeval x) p = 0 → x ∈ solvableByRad ℚ ℂ) ↔ n ≤ 4 All goals completed! 🐙
#228
How produced

Change the name for model

Brouwer fixed-point theorem
brouwer_fixed_point

Verso theorem preview

theorem declaration uses `sorry`brouwer_fixed_point {d : ℕ} {K : Set (EuclideanSpace ℝ (Fin d))} (_hK_compact : IsCompact K) (_hK_convex : Convex ℝ K) (_hK_nonempty : K.Nonempty) (f : EuclideanSpace ℝ (Fin d) → EuclideanSpace ℝ (Fin d)) (_hf_cont : ContinuousOn f K) (_hf_maps : MapsTo f K K) : ∃ x ∈ K, f x = x := d:ℕK:Set (EuclideanSpace ℝ (Fin d))_hK_compact:IsCompact K_hK_convex:Convex ℝ K_hK_nonempty:K.Nonemptyf:EuclideanSpace ℝ (Fin d) → EuclideanSpace ℝ (Fin d)_hf_cont:ContinuousOn f K_hf_maps:MapsTo f K K⊢ ∃ x ∈ K, f x = x All goals completed! 🐙
#229
How produced

Change the name for model

Bing's house with two rooms is contractible
contractibleSpace_houseWithTwoRooms

Verso theorem preview

theorem declaration uses `sorry`contractibleSpace_houseWithTwoRooms : ContractibleSpace LeanEval.Topology.HouseWithTwoRooms := ⊢ ContractibleSpace ↑HouseWithTwoRooms All goals completed! 🐙
#230
How produced

Change the name for model

Trace Cayley-Hamilton / Newton identity
trace_cayley_hamilton_newton

Verso theorem preview

theorem declaration uses `sorry`trace_cayley_hamilton_newton {R : Type*} [CommRing R] (A : Matrix n n R) {k : ℕ} (hk : 1 ≤ k) : (k : R) * charpolyDescendingCoeff A k + ∑ j ∈ Finset.Icc 1 k, trace (A ^ j) * charpolyDescendingCoeff A (k - j) = 0 := n:Type u_1inst✝²:Fintype ninst✝¹:DecidableEq nR:Type u_2inst✝:CommRing RA:Matrix n n Rk:ℕhk:1 ≤ k⊢ ↑k * charpolyDescendingCoeff A k + ∑ j ∈ Finset.Icc 1 k, (A ^ j).trace * charpolyDescendingCoeff A (k - j) = 0 All goals completed! 🐙
#231
How produced

Change the name for model

von Neumann double commutant theorem
vonNeumann_doubleCommutant_tfae

Verso theorem preview

theorem declaration uses `sorry`vonNeumann_doubleCommutant_tfae {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H] (S : StarSubalgebra ℂ (H →L[ℂ] H)) : List.TFAE [ Set.centralizer (Set.centralizer (S : Set (H →L[ℂ] H))) = S , IsClosed (ContinuousLinearMapWOT.ofCLM '' (S : Set (H →L[ℂ] H))) , IsClosed (ContinuousLinearMap.toPointwiseConvergenceCLM ℂ (RingHom.id ℂ) H H '' (S : Set (H →L[ℂ] H))) ] := H:Type u_1inst✝²:NormedAddCommGroup Hinst✝¹:InnerProductSpace ℂ Hinst✝:CompleteSpace HS:StarSubalgebra ℂ (H →L[ℂ] H)⊢ [(↑S).centralizer.centralizer = ↑S, IsClosed (ContinuousLinearMapWOT.ofCLM '' ↑S), IsClosed (⇑(ContinuousLinearMap.toPointwiseConvergenceCLM ℂ (RingHom.id ℂ) H H) '' ↑S)].TFAE All goals completed! 🐙
#232
How produced

Change the name for model

Real cyclotomic integer with house at most 2
cyclotomic_integer_house_le_two

Verso theorem preview

theorem declaration uses `sorry`cyclotomic_integer_house_le_two {K : Type*} [Field K] [NumberField K] [Algebra ℚ K] (n : ℕ) [NeZero n] [IsCyclotomicExtension {n} ℚ K] {β : K} (hβ_int : IsIntegral ℤ β) (hβ_real : β ∈ NumberField.maximalRealSubfield K) : house β ≤ 2 → house β = 2 ∨ ∃ m : ℕ, 0 < m ∧ house β = 2 * Real.cos (Real.pi / m) := K:Type u_1inst✝⁴:Field Kinst✝³:NumberField Kinst✝²:Algebra ℚ Kn:ℕinst✝¹:NeZero ninst✝:IsCyclotomicExtension {n} ℚ Kβ:Khβ_int:IsIntegral ℤ βhβ_real:β ∈ maximalRealSubfield K⊢ house β ≤ 2 → house β = 2 ∨ ∃ m, 0 < m ∧ house β = 2 * Real.cos (Real.pi / ↑m) All goals completed! 🐙
#233
How produced

Change the name for model

Koszul formula
koszul_formula

Verso theorem preview

theorem declaration uses `sorry`koszul_formula {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] [CompleteSpace E] {H : Type*} [TopologicalSpace H] {I : ModelWithCorners ℝ E H} {M : Type*} [TopologicalSpace M] [ChartedSpace H M] [IsManifold I ∞ M] [RiemannianBundle (fun (x : M) ↦ TangentSpace I x)] [IsContMDiffRiemannianBundle I ∞ E (fun (x : M) ↦ TangentSpace I x)] (cov : CovariantDerivative I E (TangentSpace I (M := M))) [ContMDiffCovariantDerivative cov ∞] (_htor : cov.torsion = 0) (_hmet : LeanEval.Geometry.KoszulFormula.IsMetricCompatible cov) (X Y Z : Π x : M, TangentSpace I x) (_hX : CMDiff ∞ (T% X)) (_hY : CMDiff ∞ (T% Y)) (_hZ : CMDiff ∞ (T% Z)) (x : M) : 2 * inner ℝ (cov Y x (X x)) (Z x) = mvfderiv I (fun y : M => inner ℝ (Y y) (Z y)) x (X x) + mvfderiv I (fun y : M => inner ℝ (X y) (Z y)) x (Y x) - mvfderiv I (fun y : M => inner ℝ (X y) (Y y)) x (Z x) - inner ℝ (X x) (mlieBracket I Y Z x) - inner ℝ (Y x) (mlieBracket I X Z x) + inner ℝ (Z x) (mlieBracket I X Y x) := E:Type u_1inst✝¹⁰:NormedAddCommGroup Einst✝⁹:NormedSpace ℝ Einst✝⁸:FiniteDimensional ℝ Einst✝⁷:CompleteSpace EH:Type u_2inst✝⁶:TopologicalSpace HI:ModelWithCorners ℝ E HM:Type u_3inst✝⁵:TopologicalSpace Minst✝⁴:ChartedSpace H Minst✝³:IsManifold I ∞ Minst✝²:RiemannianBundle fun x => TangentSpace I xinst✝¹:IsContMDiffRiemannianBundle I ∞ E fun x => TangentSpace I xcov:CovariantDerivative I E (TangentSpace I)inst✝:cov.ContMDiffCovariantDerivative ∞_htor:cov.torsion = 0_hmet:LeanEval.Geometry.KoszulFormula.IsMetricCompatible covX:(x : M) → TangentSpace I xY:(x : M) → TangentSpace I xZ:(x : M) → TangentSpace I x_hX:ContMDiff I I.tangent ∞ (T% X)_hY:ContMDiff I I.tangent ∞ (T% Y)_hZ:ContMDiff I I.tangent ∞ (T% Z)x:M⊢ 2 * Inner.inner ℝ ((↑cov Y x) (X x)) (Z x) = ((d% fun y => Inner.inner ℝ (Y y) (Z y)) x) (X x) + ((d% fun y => Inner.inner ℝ (X y) (Z y)) x) (Y x) - ((d% fun y => Inner.inner ℝ (X y) (Y y)) x) (Z x) - Inner.inner ℝ (X x) (mlieBracket I Y Z x) - Inner.inner ℝ (Y x) (mlieBracket I X Z x) + Inner.inner ℝ (Z x) (mlieBracket I X Y x) All goals completed! 🐙
#234
How produced

Change the name for model

Linear ODE with negative-real-part eigenvalues is asymptotically stable
linear_ode_asymptotic_stability

Verso theorem preview

theorem declaration uses `sorry`linear_ode_asymptotic_stability (n : ℕ) (A : Matrix (Fin n) (Fin n) ℝ) (hA : ∀ μ : ℂ, Module.End.HasEigenvalue (Matrix.toLin' (A.map (algebraMap ℝ ℂ))) μ → μ.re < 0) (x : ℝ → (Fin n → ℝ)) (hx : ∀ t : ℝ, 0 < t → HasDerivAt x (A.mulVec (x t)) t) : Filter.Tendsto (fun t : ℝ => ‖x t‖) Filter.atTop (nhds 0) := n:ℕA:Matrix (Fin n) (Fin n) ℝhA:∀ (μ : ℂ), Module.End.HasEigenvalue (Matrix.toLin' (A.map ⇑(algebraMap ℝ ℂ))) μ → μ.re < 0x:ℝ → Fin n → ℝhx:∀ (t : ℝ), 0 < t → HasDerivAt x (A *ᵥ x t) t⊢ Filter.Tendsto (fun t => ‖x t‖) Filter.atTop (nhds 0) All goals completed! 🐙
#235
How produced

Change the name for model

A counterexample to the unit conjecture for group rings
annals_unit_conjecture

Verso theorem preview

theorem declaration uses `sorry`theorem_A : (∀ g : UnitConjecture.P, ∀ n ≠ 0, g ^ n = 1 → g = 1) ∧ IsUnit UnitConjecture.u ∧ ¬ ∃ g : UnitConjecture.P, UnitConjecture.u = g := ⊢ (∀ (g : P) (n : ℕ), n ≠ 0 → g ^ n = 1 → g = 1) ∧ IsUnit u ∧ ¬∃ g, u = (MonoidAlgebra.of (ZMod 2) P) g All goals completed! 🐙
#236
How produced

Produced using gpt-5.6-sol through the Humanize iterative implementation and independent review workflow, with a natural-language proof written before Lean implementation and validation under Lean 4.33.0.

Bourbaki's locally convex extension of Banach–Alaoglu
banach_alaoglu_bourbaki

Verso theorem preview

theorem declaration uses `sorry`banach_alaoglu_bourbaki (E : Type*) [AddCommGroup E] [Module ℝ E] [TopologicalSpace E] [ContinuousAdd E] [ContinuousSMul ℝ E] [LocallyConvexSpace ℝ E] (U : Set E) (_hU : U ∈ 𝓝 (0 : E)) : IsCompact (LeanEval.Analysis.weakStarPolar E U) := E:Type u_1inst✝⁵:AddCommGroup Einst✝⁴:Module ℝ Einst✝³:TopologicalSpace Einst✝²:ContinuousAdd Einst✝¹:ContinuousSMul ℝ Einst✝:LocallyConvexSpace ℝ EU:Set E_hU:U ∈ 𝓝 0⊢ IsCompact (weakStarPolar E U) All goals completed! 🐙
#237
How produced

Change the name for model

Complementary polynomial on the unit circle
exists_complementary_polynomial_on_unit_circle

Verso theorem preview

theorem declaration uses `sorry`exists_complementary_polynomial_on_unit_circle (P : ℂ[X]) (hP : ∀ z : Circle, ‖P.eval (z : ℂ)‖ ≤ 1) : ∃ Q : ℂ[X], Q.natDegree ≤ P.natDegree ∧ ∀ z : Circle, ‖P.eval (z : ℂ)‖ ^ 2 + ‖Q.eval (z : ℂ)‖ ^ 2 = 1 := P:ℂ[X]hP:∀ (z : Circle), ‖eval (↑z) P‖ ≤ 1⊢ ∃ Q, Q.natDegree ≤ P.natDegree ∧ ∀ (z : Circle), ‖eval (↑z) P‖ ^ 2 + ‖eval (↑z) Q‖ ^ 2 = 1 All goals completed! 🐙
#238
How produced

Change the name for model

Perron-Frobenius for irreducible nonnegative matrices
irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius

Verso theorem preview

theorem declaration uses `sorry`irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius {n : Type*} [Fintype n] [DecidableEq n] [Nonempty n] (A : Matrix n n ℝ) (hA : A.IsIrreducible) : ∃ v : n → ℝ, Module.End.HasEigenvector (Matrix.toLin' A) (spectralRadius ℝ A).toReal v ∧ (∀ i, 0 < v i) := n:Type u_1inst✝²:Fintype ninst✝¹:DecidableEq ninst✝:Nonempty nA:Matrix n n ℝhA:A.IsIrreducible⊢ ∃ v, Module.End.HasEigenvector (Matrix.toLin' A) (spectralRadius ℝ A).toReal v ∧ ∀ (i : n), 0 < v i All goals completed! 🐙
#239
How produced

Change the name for model

Linear programming: maximum principle and vertex optimality
lp_maximum_principle

Verso theorem preview

/-- **Maximum principle for linear programming** (§101). A local maximiser of the LP objective on the feasible region is automatically a global maximiser; and whenever the objective is non-constant (`c ≠ 0`), the maximiser lies on the topological frontier of the feasible region. -/ theorem declaration uses `sorry`lp_maximum_principle {m n : ℕ} (lp : LinearProgram m n) (x : Fin m → ℝ) (_hx : x ∈ lp.feasible) (_hlocal : IsLocalMaxOn lp.objective lp.feasible x) : IsMaxOn lp.objective lp.feasible x ∧ (lp.c ≠ 0 → x ∈ frontier lp.feasible) := m:ℕn:ℕlp:LinearProgram m nx:Fin m → ℝ_hx:x ∈ lp.feasible_hlocal:IsLocalMaxOn lp.objective lp.feasible x⊢ IsMaxOn lp.objective lp.feasible x ∧ (lp.c ≠ 0 → x ∈ frontier lp.feasible) All goals completed! 🐙
/-- **Vertex optimality** (§101; the existence content of Dantzig's 1947 simplex algorithm). Every linear program with a nonempty bounded feasible region admits a global maximiser that is an extreme point (vertex) of the feasible region. -/ theorem declaration uses `sorry`simplex_algorithm {m n : ℕ} (lp : LinearProgram m n) (_hfeas : lp.feasible.Nonempty) (_hbdd : Bornology.IsBounded lp.feasible) : ∃ x ∈ lp.feasible, IsMaxOn lp.objective lp.feasible x ∧ x ∈ Set.extremePoints ℝ lp.feasible := m:ℕn:ℕlp:LinearProgram m n_hfeas:lp.feasible.Nonempty_hbdd:Bornology.IsBounded lp.feasible⊢ ∃ x ∈ lp.feasible, IsMaxOn lp.objective lp.feasible x ∧ x ∈ Set.extremePoints ℝ lp.feasible All goals completed! 🐙
#240
How produced

Change the name for model

Pell solutions are convergents of √d
pell_solution_convergent

Verso theorem preview

theorem declaration uses `sorry`pell_solution_is_convergent (d : ℤ) (_hd : Squarefree d) (_hd0 : 0 < d) (x y : ℤ) (_hx : 0 < x) (_hy : 0 < y) (_hsol : x ^ 2 - d * y ^ 2 = 1) : ∃ n : ℕ, (GenContFract.of (Real.sqrt (d : ℝ))).convs n = (x : ℝ) / (y : ℝ) := d:ℤ_hd:Squarefree d_hd0:0 < dx:ℤy:ℤ_hx:0 < x_hy:0 < y_hsol:x ^ 2 - d * y ^ 2 = 1⊢ ∃ n, (GenContFract.of √↑d).convs n = ↑x / ↑y All goals completed! 🐙
#241
How produced

Change the name for model

Rouche theorem via zero counting
rouche_zero_count_eq

Verso theorem preview

theorem declaration uses `sorry`rouche_zero_count_eq {f g : ℂ → ℂ} {R : ℝ} (hR : 0 < R) (hf : MeromorphicNFOn f Set.univ) (hg : AnalyticOn ℂ g Set.univ) (hbound : ∀ z : ℂ, ‖z‖ = R → ‖g z‖ < ‖f z‖) : (∑ᶠ z, ((divisor (f + g) (Metric.closedBall 0 R))⁺) z) = (∑ᶠ z, ((divisor f (Metric.closedBall 0 R))⁺) z) := f:ℂ → ℂg:ℂ → ℂR:ℝhR:0 < Rhf:MeromorphicNFOn f Set.univhg:AnalyticOn ℂ g Set.univhbound:∀ (z : ℂ), ‖z‖ = R → ‖g z‖ < ‖f z‖⊢ ∑ᶠ (z : ℂ), (divisor (f + g) (Metric.closedBall 0 R))⁺ z = ∑ᶠ (z : ℂ), (divisor f (Metric.closedBall 0 R))⁺ z All goals completed! 🐙
#242
How produced

Change the name for model

Symplectic matrices have determinant 1
symplectic_matrix_det

Verso theorem preview

theorem declaration uses `sorry`symplectic_matrix_det {l R : Type*} [DecidableEq l] [Fintype l] [CommRing R] {A : Matrix (l ⊕ l) (l ⊕ l) R} (_hA : A ∈ Matrix.symplecticGroup l R) : A.det = 1 := l:Type u_1R:Type u_2inst✝²:DecidableEq linst✝¹:Fintype linst✝:CommRing RA:Matrix (l ⊕ l) (l ⊕ l) R_hA:A ∈ symplecticGroup l R⊢ A.det = 1 All goals completed! 🐙
#243
How produced

Change the name for model

Gaussian heat kernel solves the 1D heat equation
heat_kernel_solves_heat_equation

Verso theorem preview

theorem declaration uses `sorry`heat_kernel_solves_heat_equation (f : ℝ → ℝ) (hf_cont : Continuous f) (hf_bdd : ∃ M : ℝ, ∀ x, |f x| ≤ M) : -- The PDE on (0, ∞) × ℝ. (∀ t : ℝ, 0 < t → ∀ x : ℝ, ∃ ux : ℝ → ℝ, ∃ uxx : ℝ, (∀ y : ℝ, HasDerivAt (fun z => heatSolution f t z) (ux y) y) ∧ HasDerivAt ux uxx x ∧ HasDerivAt (fun s => heatSolution f s x) uxx t) ∧ -- Initial condition recovered as a one-sided limit at t = 0. (∀ x : ℝ, Filter.Tendsto (fun t : ℝ => heatSolution f t x) (nhdsWithin (0 : ℝ) (Set.Ioi 0)) (nhds (f x))) := f:ℝ → ℝhf_cont:Continuous fhf_bdd:∃ M, ∀ (x : ℝ), |f x| ≤ M⊢ (∀ (t : ℝ), 0 < t → ∀ (x : ℝ), ∃ ux uxx, (∀ (y : ℝ), HasDerivAt (fun z => heatSolution f t z) (ux y) y) ∧ HasDerivAt ux uxx x ∧ HasDerivAt (fun s => heatSolution f s x) uxx t) ∧ ∀ (x : ℝ), Filter.Tendsto (fun t => heatSolution f t x) (nhdsWithin 0 (Set.Ioi 0)) (nhds (f x)) All goals completed! 🐙
#244
How produced

Change the name for model

Minkowski-Caratheodory theorem
mem_convexHull_finset_extremePoints_of_mem_compact_convex

Verso theorem preview

theorem declaration uses `sorry`mem_convexHull_finset_extremePoints_of_mem_compact_convex {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] {s : Set E} {x : E} (hscomp : IsCompact s) (hsconv : Convex ℝ s) (hx : x ∈ s) : ∃ t : Finset E, (↑t : Set E) ⊆ s.extremePoints ℝ ∧ t.card ≤ Module.finrank ℝ E + 1 ∧ x ∈ convexHull ℝ (↑t : Set E) := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:FiniteDimensional ℝ Es:Set Ex:Ehscomp:IsCompact shsconv:Convex ℝ shx:x ∈ s⊢ ∃ t, ↑t ⊆ extremePoints ℝ s ∧ t.card ≤ Module.finrank ℝ E + 1 ∧ x ∈ (convexHull ℝ) ↑t All goals completed! 🐙
#245
How produced

Change the name for model

Character values of finite groups lie in cyclotomic fields
brauer_character_in_cyclotomic

Verso theorem preview

theorem declaration uses `sorry`brauer_character_in_cyclotomic (G : Type) [Group G] [Fintype G] : ∃ φ : CyclotomicField (Monoid.exponent G) ℚ →+* ℂ, ∀ (V : Type) (_ : AddCommGroup V) (_ : Module ℂ V) (_ : FiniteDimensional ℂ V) (ρ : Representation ℂ G V) (g : G), LinearMap.trace ℂ V (ρ g) ∈ φ.range := G:Typeinst✝¹:Group Ginst✝:Fintype G⊢ ∃ φ, ∀ (V : Type) (x : AddCommGroup V) (x_1 : Module ℂ V), FiniteDimensional ℂ V → ∀ (ρ : Representation ℂ G V) (g : G), (LinearMap.trace ℂ V) (ρ g) ∈ φ.range All goals completed! 🐙
#246
How produced

Change the name for model

Oppenheim's inequality for Hadamard products
oppenheim_inequality

Verso theorem preview

theorem declaration uses `sorry`oppenheim_inequality {n : Type*} [Fintype n] [DecidableEq n] {A B : Matrix n n ℝ} (hA : A.PosSemidef) (hB : B.PosSemidef) : A.det * ∏ i, B i i ≤ (A ⊙ B).det := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℝB:Matrix n n ℝhA:A.PosSemidefhB:B.PosSemidef⊢ A.det * ∏ i, B i i ≤ (A ⊙ B).det All goals completed! 🐙
#247
How produced

Change the name for model

pi_1 of the circle is Z
pi1_circle_mulEquiv_int

Verso theorem preview

theorem declaration uses `sorry`pi1_circle_mulEquiv_int : Nonempty (HomotopyGroup.Pi 1 Circle (1 : Circle) ≃* Multiplicative ℤ) := ⊢ Nonempty (HomotopyGroup.Pi 1 Circle 1 ≃* Multiplicative ℤ) All goals completed! 🐙
#248
How produced

Change the name for model

Dirichlet eigenvalues of -y'' = lambda y on [0,pi] are n^2
dirichlet_eigenvalues_eq_nat_sq

Verso theorem preview

theorem declaration uses `sorry`dirichlet_eigenvalues_eq_nat_sq (lam : ℝ) : (∃ (y : ℝ → ℝ) (J : Set ℝ), IsOpen J ∧ Set.Icc (0 : ℝ) Real.pi ⊆ J ∧ (∀ x ∈ J, HasDerivAt y (deriv y x) x) ∧ (∀ x ∈ J, HasDerivAt (deriv y) (-(lam * y x)) x) ∧ y 0 = 0 ∧ y Real.pi = 0 ∧ ∃ x ∈ Set.Ioo (0 : ℝ) Real.pi, y x ≠ 0) ↔ ∃ n : ℕ, 0 < n ∧ lam = (n : ℝ) ^ 2 := lam:ℝ⊢ (∃ y J, IsOpen J ∧ Set.Icc 0 π ⊆ J ∧ (∀ x ∈ J, HasDerivAt y (deriv y x) x) ∧ (∀ x ∈ J, HasDerivAt (deriv y) (-(lam * y x)) x) ∧ y 0 = 0 ∧ y π = 0 ∧ ∃ x ∈ Set.Ioo 0 π, y x ≠ 0) ↔ ∃ n, 0 < n ∧ lam = ↑n ^ 2 All goals completed! 🐙
#249
How produced

Change the name for model

Entrywise exponential of a PSD matrix is PSD
posSemidef_map_exp

Verso theorem preview

theorem declaration uses `sorry`posSemidef_map_exp {n : Type*} [Fintype n] [DecidableEq n] {A : Matrix n n ℝ} (hA : A.PosSemidef) : (A.map Real.exp).PosSemidef := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℝhA:A.PosSemidef⊢ (A.map Real.exp).PosSemidef All goals completed! 🐙
#250
How produced

Change the name for model

Sturm separation theorem
sturm_separation

Verso theorem preview

theorem declaration uses `sorry`sturm_separation (p q y₁ y₂ : ℝ → ℝ) (a b : ℝ) (hab : a < b) (J : Set ℝ) (hJ_open : IsOpen J) (hJ_conn : IsPreconnected J) (hJ_sub : Set.Icc a b ⊆ J) (hp : ContinuousOn p J) (hq : ContinuousOn q J) (hy₁ : ∀ x ∈ J, HasDerivAt y₁ (deriv y₁ x) x) (hy₁' : ∀ x ∈ J, HasDerivAt (deriv y₁) (-(p x * deriv y₁ x + q x * y₁ x)) x) (hy₂ : ∀ x ∈ J, HasDerivAt y₂ (deriv y₂ x) x) (hy₂' : ∀ x ∈ J, HasDerivAt (deriv y₂) (-(p x * deriv y₂ x + q x * y₂ x)) x) (hW : ∃ x₀ ∈ J, y₁ x₀ * deriv y₂ x₀ - y₂ x₀ * deriv y₁ x₀ ≠ 0) (hza : y₁ a = 0) (hzb : y₁ b = 0) (hne : ∀ x ∈ Set.Ioo a b, y₁ x ≠ 0) : ∃! c, c ∈ Set.Ioo a b ∧ y₂ c = 0 := p:ℝ → ℝq:ℝ → ℝy₁:ℝ → ℝy₂:ℝ → ℝa:ℝb:ℝhab:a < bJ:Set ℝhJ_open:IsOpen JhJ_conn:IsPreconnected JhJ_sub:Set.Icc a b ⊆ Jhp:ContinuousOn p Jhq:ContinuousOn q Jhy₁:∀ x ∈ J, HasDerivAt y₁ (deriv y₁ x) xhy₁':∀ x ∈ J, HasDerivAt (deriv y₁) (-(p x * deriv y₁ x + q x * y₁ x)) xhy₂:∀ x ∈ J, HasDerivAt y₂ (deriv y₂ x) xhy₂':∀ x ∈ J, HasDerivAt (deriv y₂) (-(p x * deriv y₂ x + q x * y₂ x)) xhW:∃ x₀ ∈ J, y₁ x₀ * deriv y₂ x₀ - y₂ x₀ * deriv y₁ x₀ ≠ 0hza:y₁ a = 0hzb:y₁ b = 0hne:∀ x ∈ Set.Ioo a b, y₁ x ≠ 0⊢ ∃! c, c ∈ Set.Ioo a b ∧ y₂ c = 0 All goals completed! 🐙
#251
How produced

Change the name for model

Polynomial decay rate of y' = -y^3
cubic_decay_asymptotic

Verso theorem preview

theorem declaration uses `sorry`cubic_decay_asymptotic (y : ℝ → ℝ) (hy_diff : ∀ t : ℝ, 0 < t → HasDerivAt y (-(y t) ^ 3) t) (hy_cont : ContinuousWithinAt y (Set.Ici 0) 0) (hy0 : y 0 = 1) : Tendsto (fun t : ℝ => y t * Real.sqrt t) atTop (𝓝 (1 / Real.sqrt 2)) := y:ℝ → ℝhy_diff:∀ (t : ℝ), 0 < t → HasDerivAt y (-y t ^ 3) thy_cont:ContinuousWithinAt y (Set.Ici 0) 0hy0:y 0 = 1⊢ Tendsto (fun t => y t * √t) atTop (𝓝 (1 / √2)) All goals completed! 🐙
#252
How produced

Change the name for model

Comparison principle for the Dirichlet BVP
bvp_comparison

Verso theorem preview

theorem declaration uses `sorry`bvp_comparison (J : Set ℝ) (hJ_open : IsOpen J) (hJ_sub : Set.Icc (0 : ℝ) 1 ⊆ J) (u v : ℝ → ℝ) (hu : ∀ x ∈ J, HasDerivAt u (deriv u x) x) (hu' : ∀ x ∈ J, HasDerivAt (deriv u) (deriv (deriv u) x) x) (hv : ∀ x ∈ J, HasDerivAt v (deriv v x) x) (hv' : ∀ x ∈ J, HasDerivAt (deriv v) (deriv (deriv v) x) x) (hineq : ∀ x ∈ Set.Ioo (0 : ℝ) 1, -deriv (deriv u) x ≤ -deriv (deriv v) x) (hu0 : u 0 ≤ v 0) (hu1 : u 1 ≤ v 1) : ∀ x ∈ Set.Icc (0 : ℝ) 1, u x ≤ v x := J:Set ℝhJ_open:IsOpen JhJ_sub:Set.Icc 0 1 ⊆ Ju:ℝ → ℝv:ℝ → ℝhu:∀ x ∈ J, HasDerivAt u (deriv u x) xhu':∀ x ∈ J, HasDerivAt (deriv u) (deriv (deriv u) x) xhv:∀ x ∈ J, HasDerivAt v (deriv v x) xhv':∀ x ∈ J, HasDerivAt (deriv v) (deriv (deriv v) x) xhineq:∀ x ∈ Set.Ioo 0 1, -deriv (deriv u) x ≤ -deriv (deriv v) xhu0:u 0 ≤ v 0hu1:u 1 ≤ v 1⊢ ∀ x ∈ Set.Icc 0 1, u x ≤ v x All goals completed! 🐙
#253
How produced

Change the name for model

Cayley graph connected iff generators generate the group
mulCayley_connected_iff_closure_eq_top

Verso theorem preview

theorem declaration uses `sorry`mulCayley_connected_iff_closure_eq_top {G : Type*} [Group G] (S : Set G) : (SimpleGraph.mulCayley S).Connected ↔ Subgroup.closure S = ⊤ := G:Type u_1inst✝:Group GS:Set G⊢ (SimpleGraph.mulCayley S).Connected ↔ Subgroup.closure S = ⊤ All goals completed! 🐙
#254
How produced

Change the name for model

Finite Ramsey theorem for graphs
finite_graph_ramsey_theorem

Verso theorem preview

theorem declaration uses `sorry`finite_graph_ramsey_theorem : ∀ r s : ℕ, 2 ≤ r → 2 ≤ s → ∃ n : ℕ, ∀ G : SimpleGraph (Fin n), ¬ G.CliqueFree r ∨ ¬ Gᶜ.CliqueFree s := ⊢ ∀ (r s : ℕ), 2 ≤ r → 2 ≤ s → ∃ n, ∀ (G : SimpleGraph (Fin n)), ¬G.CliqueFree r ∨ ¬Gᶜ.CliqueFree s All goals completed! 🐙
#255
How produced

Change the name for model

Catalan generating function via compositional inversion
substInv_X_sub_X_sq_eq_catalan

Verso theorem preview

theorem declaration uses `sorry`substInv_X_sub_X_sq_eq_catalan (n : ℕ) : haveI : Invertible (coeff 1 ((X : ℚ⟦X⟧) - X ^ 2)) := n:ℕ⊢ Invertible ((coeff 1) (X - X ^ 2)) n:ℕ⊢ Invertible 1; All goals completed! 🐙 coeff (n + 1) (substInv ((X : ℚ⟦X⟧) - X ^ 2)) = (Nat.choose (2 * n) n : ℚ) / (↑n + 1) := n:ℕ⊢ (coeff (n + 1)) (X - X ^ 2).substInv = ↑((2 * n).choose n) / (↑n + 1) All goals completed! 🐙
#256
How produced

Change the name for model

First submissionJul 28, 2026
Last submissionOct 13, 2026
ZhengyangZhang06215hongzhoulin8934juihuichung6antoinegg15
3Tau (caj.al)200 solved
Real cyclotomic integer with house in (2, 76/33)
cyclotomic_integer_house_between_two_and_76_33

Verso theorem preview

theorem declaration uses `sorry`cyclotomic_integer_house_between_two_and_76_33 {K : Type*} [Field K] [NumberField K] [Algebra ℚ K] (n : ℕ) [NeZero n] [IsCyclotomicExtension {n} ℚ K] {β : K} (hβ_int : IsIntegral ℤ β) (hβ_real : β ∈ NumberField.maximalRealSubfield K) : (2 < house β ∧ house β < (76 : ℝ) / 33) → house β = (Real.sqrt 7 + Real.sqrt 3) / 2 ∨ house β = Real.sqrt 5 ∨ house β = 1 + 2 * Real.cos (2 * Real.pi / 7) ∨ house β = (1 + Real.sqrt 5) / Real.sqrt 2 ∨ house β = (1 + Real.sqrt 13) / 2 := K:Type u_1inst✝⁴:Field Kinst✝³:NumberField Kinst✝²:Algebra ℚ Kn:ℕinst✝¹:NeZero ninst✝:IsCyclotomicExtension {n} ℚ Kβ:Khβ_int:IsIntegral ℤ βhβ_real:β ∈ maximalRealSubfield K⊢ 2 < house β ∧ house β < 76 / 33 → house β = (√7 + √3) / 2 ∨ house β = √5 ∨ house β = 1 + 2 * Real.cos (2 * Real.pi / 7) ∨ house β = (1 + √5) / √2 ∨ house β = (1 + √13) / 2 All goals completed! 🐙
#1
Lai-Sang Young entropy–dimension–Lyapunov theorem
entropy_dimension_lyapunov

Verso theorem preview

theorem declaration uses `sorry`entropy_dimension_lyapunov (T T_inv : LeanEval.Dynamics.EucPlane → LeanEval.Dynamics.EucPlane) (hT_smooth : ContDiff ℝ 2 T) (hT_inv_smooth : ContDiff ℝ 2 T_inv) (hT_left : Function.LeftInverse T_inv T) (hT_right : Function.RightInverse T_inv T) (K : Set LeanEval.Dynamics.EucPlane) (hK_compact : IsCompact K) (hK_inv : T '' K = K) (μ : Measure LeanEval.Dynamics.EucPlane) [IsProbabilityMeasure μ] (hμ_supp : μ Kᶜ = 0) (hμ_pres : MeasurePreserving T μ μ) (hμ_erg : Ergodic T μ) : kolmogorovSinaiEntropy μ T = (dimMeasure μ).toReal * harmonicMeanLyapunov (∫ x, lyapunovUpperAt T x ∂μ) (∫ x, lyapunovLowerAt T x ∂μ) / 2 := T:EucPlane → EucPlaneT_inv:EucPlane → EucPlanehT_smooth:ContDiff ℝ 2 ThT_inv_smooth:ContDiff ℝ 2 T_invhT_left:Function.LeftInverse T_inv ThT_right:Function.RightInverse T_inv TK:Set EucPlanehK_compact:IsCompact KhK_inv:T '' K = Kμ:Measure EucPlaneinst✝:IsProbabilityMeasure μhμ_supp:μ Kᶜ = 0hμ_pres:MeasurePreserving T μ μhμ_erg:Ergodic T μ⊢ kolmogorovSinaiEntropy μ T = (dimMeasure μ).toReal * harmonicMeanLyapunov (∫ (x : EucPlane), lyapunovUpperAt T x ∂μ) (∫ (x : EucPlane), lyapunovLowerAt T x ∂μ) / 2 All goals completed! 🐙
#2
Hardy–Littlewood sign-change for the prime race mod 4
chebyshev_sign_change

Verso theorem preview

theorem declaration uses `sorry`chebyshev_sign_change : LeanEval.NumberTheory.ChebyshevSignChangeProblem.chebyshevLead.Infinite ∧ {n : ℕ | primeCountingMod 3 n < primeCountingMod 1 n}.Infinite := ⊢ chebyshevLead.Infinite ∧ {n | primeCountingMod 3 n < primeCountingMod 1 n}.Infinite All goals completed! 🐙
#3
De Branges's theorem (Bieberbach conjecture)
deBranges_theorem

Verso theorem preview

theorem declaration uses `sorry`deBranges (f : ℂ → ℂ) (diff : DifferentiableOn ℂ f (ball 0 1)) (inj : (ball 0 1).InjOn f) (h0 : f 0 = 0) (h1 : deriv f 0 = 1) (n : ℕ) : ‖iteratedDeriv n f 0 / n.factorial‖ ≤ n := f:ℂ → ℂdiff:DifferentiableOn ℂ f (ball 0 1)inj:Set.InjOn f (ball 0 1)h0:f 0 = 0h1:deriv f 0 = 1n:ℕ⊢ ‖iteratedDeriv n f 0 / ↑n.factorial‖ ≤ ↑n All goals completed! 🐙
#4
Schläfli classification of regular polytopes
schlafli_classification

Verso theorem preview

theorem declaration uses `sorry`schlafli_classification : platonicCount 3 = 5 ∧ platonicCount 4 = 6 ∧ ∀ d, 5 ≤ d → platonicCount d = 3 := ⊢ platonicCount 3 = 5 ∧ platonicCount 4 = 6 ∧ ∀ (d : ℕ), 5 ≤ d → platonicCount d = 3 All goals completed! 🐙
#5
Topological classification of surfaces
topological_classification_of_surfaces

Verso theorem preview

theorem declaration uses `sorry`classification_of_surfaces (S : Type*) [TopologicalSpace S] [T2Space S] [ConnectedSpace S] [CompactSpace S] [ChartedSpace (EuclideanHalfSpace 2) S] [IsManifold (modelWithCornersEuclideanHalfSpace 2) 0 S] : Nonempty (S ≃ₜ Metric.sphere (0 : EuclideanSpace ℝ (Fin 3)) 1) ∨ ∃ p n, ((1 ≤ p ∨ 1 ≤ n) ∧ Nonempty (S ≃ₜ Quot (LeanEval.Topology.ClassificationOfSurfaces.OrientableRel p n))) ∨ (1 ≤ p ∧ Nonempty (S ≃ₜ Quot (LeanEval.Topology.ClassificationOfSurfaces.NonOrientableRel p n))) := S:Type u_1inst✝⁵:TopologicalSpace Sinst✝⁴:T2Space Sinst✝³:ConnectedSpace Sinst✝²:CompactSpace Sinst✝¹:ChartedSpace (EuclideanHalfSpace 2) Sinst✝:IsManifold (modelWithCornersEuclideanHalfSpace 2) 0 S⊢ Nonempty (S ≃ₜ ↑(Metric.sphere 0 1)) ∨ ∃ p n, (1 ≤ p ∨ 1 ≤ n) ∧ Nonempty (S ≃ₜ Quot (OrientableRel p n)) ∨ 1 ≤ p ∧ Nonempty (S ≃ₜ Quot (NonOrientableRel p n)) All goals completed! 🐙
#6
Pesin entropy formula (symplectic surface case)
pesin_formula

Verso theorem preview

theorem declaration uses `sorry`pesin_formula (T T_inv : LeanEval.Dynamics.EucPlane → LeanEval.Dynamics.EucPlane) (hT_smooth : ContDiff ℝ 2 T) (hT_inv_smooth : ContDiff ℝ 2 T_inv) (hT_left : Function.LeftInverse T_inv T) (hT_right : Function.RightInverse T_inv T) (K : Set LeanEval.Dynamics.EucPlane) (hK_compact : IsCompact K) (hK_inv : T '' K = K) (μ : Measure LeanEval.Dynamics.EucPlane) [IsProbabilityMeasure μ] (hμ_supp : μ Kᶜ = 0) (hμ_pres : MeasurePreserving T μ μ) (hμ_erg : Ergodic T μ) (hμ_dim : dimMeasure μ = 2) (hlam_sym : ∫ x, lyapunovUpperAt T x ∂μ = -∫ x, lyapunovLowerAt T x ∂μ) : kolmogorovSinaiEntropy μ T = ∫ x, lyapunovUpperAt T x ∂μ := T:EucPlane → EucPlaneT_inv:EucPlane → EucPlanehT_smooth:ContDiff ℝ 2 ThT_inv_smooth:ContDiff ℝ 2 T_invhT_left:Function.LeftInverse T_inv ThT_right:Function.RightInverse T_inv TK:Set EucPlanehK_compact:IsCompact KhK_inv:T '' K = Kμ:Measure EucPlaneinst✝:IsProbabilityMeasure μhμ_supp:μ Kᶜ = 0hμ_pres:MeasurePreserving T μ μhμ_erg:Ergodic T μhμ_dim:dimMeasure μ = 2hlam_sym:∫ (x : EucPlane), lyapunovUpperAt T x ∂μ = -∫ (x : EucPlane), lyapunovLowerAt T x ∂μ⊢ kolmogorovSinaiEntropy μ T = ∫ (x : EucPlane), lyapunovUpperAt T x ∂μ All goals completed! 🐙
#7
Quantifier elimination for the theory of real closed fields
rcf_quantifier_elimination

Verso theorem preview

/-- Quantifier elimination: `qe φ` is a quantifier-free formula equivalent to `φ` over `ℝ` in every environment. Its syntax may mention additional variables vacuously. -/ def declaration uses `sorry`qe (φ : Formula) : Formula := sorry
/-- The output of `qe` is quantifier free. -/ theorem declaration uses `sorry`isQF_qe (φ : Formula) : (qe φ).IsQF := sorry
/-- The output of `qe` is equivalent to its input, under every environment. -/ theorem declaration uses `sorry`holds_qe (φ : Formula) (env : Nat → ℝ) : (qe φ).Holds env ↔ φ.Holds env := sorry
/-- Anti-vacuity guard for the semantics and de Bruijn convention: a real number is a square exactly when it is nonnegative. -/ theorem declaration uses `sorry`holds_ex_sq (env : Nat → ℝ) : (Formula.ex (.eq (.mul (.var 0) (.var 0)) (.var 1))).Holds env ↔ (Formula.not (.lt (.var 0) (.const 0))).Holds env := sorry
#8
Mihăilescu's theorem
mihailescu

Verso theorem preview

theorem declaration uses `sorry`mihailescu {x y m n : ℕ} (hx : 0 < x) (hy : 0 < y) (hm : 1 < m) (hn : 1 < n) (h : x ^ m = y ^ n + 1) : x = 3 ∧ y = 2 ∧ m = 2 ∧ n = 3 := x:ℕy:ℕm:ℕn:ℕhx:0 < xhy:0 < yhm:1 < mhn:1 < nh:x ^ m = y ^ n + 1⊢ x = 3 ∧ y = 2 ∧ m = 2 ∧ n = 3 All goals completed! 🐙
#9
Morley's categoricity theorem
morley_categoricity_theorem

Verso theorem preview

theorem declaration uses `sorry`morley_categoricity_theorem (L : FirstOrder.Language.{0, 0}) (hL : L.card ≤ ℵ₀) (T : L.Theory) (hT : T.IsComplete) (hInf : ∀ M : FirstOrder.Language.Theory.ModelType.{0, 0, 0} T, Infinite M) {κ : Cardinal.{0}} (hκ : ℵ₀ < κ) (hcat : κ.Categorical T) {μ : Cardinal.{0}} (hμ : ℵ₀ < μ) : μ.Categorical T := L:FirstOrder.LanguagehL:L.card ≤ ℵ₀T:L.TheoryhT:T.IsCompletehInf:∀ (M : T.ModelType), Infinite ↑Mκ:Cardinal.{0}hκ:ℵ₀ < κhcat:κ.Categorical Tμ:Cardinal.{0}hμ:ℵ₀ < μ⊢ μ.Categorical T All goals completed! 🐙
#10
Glauberman's Z* theorem for isolated involutions
glauberman_zStar

Verso theorem preview

theorem declaration uses `sorry`glauberman_zStar (G : Type) [Group G] [Fintype G] (t : G) (ht1 : t ≠ 1) (ht2 : t * t = 1) (hisolated : ∀ g : G, (g * t * g⁻¹) * t = t * (g * t * g⁻¹) → g * t * g⁻¹ = t) : ∃ N : Subgroup G, N.Normal ∧ Odd (Nat.card N) ∧ ∀ g : G, g * t * g⁻¹ * t⁻¹ ∈ N := G:Typeinst✝¹:Group Ginst✝:Fintype Gt:Ght1:t ≠ 1ht2:t * t = 1hisolated:∀ (g : G), g * t * g⁻¹ * t = t * (g * t * g⁻¹) → g * t * g⁻¹ = t⊢ ∃ N, N.Normal ∧ Odd (Nat.card ↥N) ∧ ∀ (g : G), g * t * g⁻¹ * t⁻¹ ∈ N All goals completed! 🐙
#11
Isoperimetric inequality (n-dim, topological-frontier form)
isoperimetric_inequality

Verso theorem preview

theorem declaration uses `sorry`isoperimetric (n : ℕ) (_hn : 2 ≤ n) (B : Set (LeanEval.Geometry.E n)) (_hB : MeasurableSet B) (_hBdd : Bornology.IsBounded B) : (n : ℝ≥0∞) ^ n * (volume B) ^ (n - 1) * volume (closedBall (0 : LeanEval.Geometry.E n) 1) ≤ (μHE[n - 1] (frontier B)) ^ n := n:ℕ_hn:2 ≤ nB:Set (E n)_hB:MeasurableSet B_hBdd:Bornology.IsBounded B⊢ ↑n ^ n * volume B ^ (n - 1) * volume (closedBall 0 1) ≤ μHE[n - 1] (frontier B) ^ n All goals completed! 🐙
#12
Existence of a chiral oriented knot
exists_chiral_knot

Verso theorem preview

theorem declaration uses `sorry`exists_chiral_knot : ∃ K : LeanEval.KnotTheory.Knot, K.Chiral := ⊢ ∃ K, K.Chiral All goals completed! 🐙
#13
On a conjecture of Marton
annals_conjecture_of_marton

Verso theorem preview

theorem declaration uses `sorry`theorem_1_2 (A : Set (ConjectureOfMarton.F n)) (K : ℝ) (h₀ : A.Nonempty) (h : (A + A).ncard ≤ K * A.ncard) : ∃ H : AddSubgroup (ConjectureOfMarton.F n), Nat.card H ≤ A.ncard ∧ CovByVAdd (ConjectureOfMarton.F n) (2 * K ^ 12) A H := n:ℕA:Set (F n)K:ℝh₀:A.Nonemptyh:↑(A + A).ncard ≤ K * ↑A.ncard⊢ ∃ H, Nat.card ↥H ≤ A.ncard ∧ CovByVAdd (F n) (2 * K ^ 12) A ↑H All goals completed! 🐙
#14
On Zagier-Hoffman's conjectures in positive characteristic
annals_zagier_hoffman_positive_char

Lean theorem statement

/--
Statement of Theorem A (Brown's theorem in positive characteristic):

Let `w ∈ ℕ`, where `ℕ := {1,2,...}`. Then every MZV of weight `w` can be written as a `K`-linear
combination of MZV's in the set `𝒯_w`. In particular, `dim 𝒵_w ≤ d(w)`.
Note that `K` in the paper is `RatFunc F`.
-/
theorem theorem_A (w : ℕ+) :
    𝒵 F w = Submodule.span (RatFunc F) (𝒯 F w) ∧
    Module.rank (RatFunc F) (𝒵 F w) ≤ d F w := by
  sorry

/--
Statement of Theorem B:

Let `w ∈ ℕ`, where `ℕ := {1,2,...}`. MZVs of weight `w` in `𝒯0 w` are all linearly independent over
`K`. In particular, `dim 𝒵 w ≥ |𝒯0 w|`. Note that `K` in the paper is `RatFunc F`.
-/
theorem theorem_B (w : ℕ+) :
    LinearIndependent (RatFunc F) (Subtype.val : 𝒯0 F w → CompletionAtInfty F) ∧
    Module.rank (RatFunc F) (𝒵 F w) ≥ Set.ncard (𝒯0 F w) := by
  sorry

/--
Statement of Theorem D:

Let `w ∈ ℕ+` with `w ≤ 2q − 2`. Then `𝒯 w` is a `K`-basis for `𝒵 w`. In particular,
`dim_K (𝒵 w) = d(w)`. Note that `K` in the paper is `RatFunc F`.

Note: Theorem A establishes that `𝒯 w` spans `𝒵 w`. So to prove `𝒯 w` is a `K`-basis for `𝒵 w`, we
only need to show that `𝒯 w` are linearly independent in `𝒵 w`.
-/
theorem theorem_D (w : ℕ+) (hw : w ≤ 2 * Nat.card F - 2) :
    LinearIndependent (RatFunc F) (Subtype.val : 𝒯 F w → CompletionAtInfty F) ∧
    Module.rank (RatFunc F) (𝒵 F w) = d F w := by
  sorry
#15
Commuting probabilities are closed
commProb_closed

Lean theorem statement

/-- The set of commuting probabilities of finite groups is closed. -/
theorem commProb_closed : IsClosed ({p : ℝ | ∃ (G : Type) (hG : Group G), commProb G = p}) := by
  sorry
#16
Conway–Schneeberger fifteen theorem
conway_schneeberger_fifteen

Verso theorem preview

theorem declaration uses `sorry`conway_schneeberger_fifteen {n : ℕ} (Q : Matrix (Fin n) (Fin n) ℤ) (_hpos : Q.PosDef) : LeanEval.NumberTheory.ConwaySchneebergerFifteenProblem.IsUniversal Q ↔ ∀ k ∈ Finset.Icc (1 : ℤ) 15, LeanEval.NumberTheory.ConwaySchneebergerFifteenProblem.Represents Q k := n:ℕQ:Matrix (Fin n) (Fin n) ℤ_hpos:Q.PosDef⊢ IsUniversal Q ↔ ∀ k ∈ Finset.Icc 1 15, Represents Q k All goals completed! 🐙
#17
Coherent cohomology of a proper scheme over ℚ is finite-dimensional
coherent_cohomology_finite_dimensional

Verso theorem preview

theorem declaration uses `sorry`coherent_cohomology_finite_dimensional (f : X ⟶ Spec (CommRingCat.of ℚ)) [IsProper f] [M.IsFiniteType] [M.IsQuasicoherent] (n : ℕ) : Module.Finite ℚ (ℚ ⊗[ℤ] M.sheaf.H n) := X:SchemeM:X.Modulesf:X ⟶ Spec ↧ℚinst✝²:IsProper finst✝¹:SheafOfModules.IsFiniteType Minst✝:SheafOfModules.IsQuasicoherent Mn:ℕ⊢ Module.Finite ℚ (ℚ ⊗[ℤ] Sheaf.H Scheme.Modules.sheaf n) All goals completed! 🐙
#18
Gleason's theorem (separable Hilbert space)
gleason_theorem_separable

Lean theorem statement

/-- **Gleason's theorem**, separable Hilbert space version (Gleason's original 1957
formulation). For a separable complex Hilbert space `H` of dimension at least `3`, every
frame function on the unit sphere of `H` is given by `x ↦ re ⟨x, ρ x⟩` for some positive
bounded operator `ρ`. (The Lean conclusion does not separately assert trace-class /
`Tr ρ = 1`; see the file docstring.) -/
theorem gleason_theorem_separable
    {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H]
      [CompleteSpace H] [TopologicalSpace.SeparableSpace H]
    (hdim : 3 ≤ Module.rank ℂ H)
    (f : SphereFrameFunction H) :
    ∃ ρ : H →L[ℂ] H,
      ContinuousLinearMap.IsPositive ρ ∧
      ∀ x : Metric.sphere (0 : H) 1,
        f.f x = (inner ℂ (x : H) (ρ (x : H))).re := by
  sorry
#19
pi_(n+1) of S^n is Z/2 for n at least 3
pi_succ_sphere_n_mulEquiv_zmod_two

Verso theorem preview

theorem declaration uses `sorry`pi_succ_sphere_n_mulEquiv_zmod_two (n : ℕ) (hn : 3 ≤ n) (x : Metric.sphere (0 : EuclideanSpace ℝ (Fin (n + 1))) 1) : Nonempty (HomotopyGroup.Pi (n + 1) (Metric.sphere (0 : EuclideanSpace ℝ (Fin (n + 1))) 1) x ≃* Multiplicative (ZMod 2)) := n:ℕhn:3 ≤ nx:↑(Metric.sphere 0 1)⊢ Nonempty (HomotopyGroup.Pi (n + 1) (↑(Metric.sphere 0 1)) x ≃* Multiplicative (ZMod 2)) All goals completed! 🐙
#20
Brauer–Suzuki theorem (quaternion Sylow 2-subgroup)
brauer_suzuki

Verso theorem preview

theorem declaration uses `sorry`brauer_suzuki {G : Type*} [Group G] [Finite G] (n : ℕ) (hn : 3 ≤ n) (P : Sylow 2 G) (hquat : Nonempty ((P : Subgroup G) ≃* QuaternionGroup (2 ^ (n - 2)))) (t : G) (ht_mem : t ∈ (P : Subgroup G)) (ht_ord : orderOf t = 2) : (QuotientGroup.mk t : G ⧸ LeanEval.GroupTheory.Defs.oddCore G) ∈ Subgroup.center (G ⧸ LeanEval.GroupTheory.Defs.oddCore G) := G:Type u_1inst✝¹:Group Ginst✝:Finite Gn:ℕhn:3 ≤ nP:Sylow 2 Ghquat:Nonempty (↥↑P ≃* QuaternionGroup (2 ^ (n - 2)))t:Ght_mem:t ∈ ↑Pht_ord:orderOf t = 2⊢ ↑t ∈ Subgroup.center (G ⧸ oddCore G) All goals completed! 🐙
#21
Schoenflies theorem
schoenflies

Verso theorem preview

theorem declaration uses `sorry`schoenflies (r : Metric.sphere (0 : EuclideanSpace ℝ (Fin 2)) 1 → EuclideanSpace ℝ (Fin 2)) (_hcont : Continuous r) (_hinj : Function.Injective r) : ∃ h : EuclideanSpace ℝ (Fin 2) ≃ₜ EuclideanSpace ℝ (Fin 2), h '' Set.range r = Metric.sphere (0 : EuclideanSpace ℝ (Fin 2)) 1 := r:↑(Metric.sphere 0 1) → EuclideanSpace ℝ (Fin 2)_hcont:Continuous r_hinj:Function.Injective r⊢ ∃ h, ⇑h '' Set.range r = Metric.sphere 0 1 All goals completed! 🐙
#22
Strong Mason conjecture for matroid independent sets
strong_mason_conjecture

Verso theorem preview

theorem declaration uses `sorry`strong_mason_conjecture {α : Type*} (M : Matroid α) [M.Finite] (k : ℕ) (hk : 0 < k) (hkn : k < M.E.ncard) : independentSetCount M (k - 1) * independentSetCount M (k + 1) * (k + 1) * (M.E.ncard - k + 1) ≤ independentSetCount M k ^ 2 * k * (M.E.ncard - k) := α:Type u_1M:Matroid αinst✝:M.Finitek:ℕhk:0 < khkn:k < M.E.ncard⊢ independentSetCount M (k - 1) * independentSetCount M (k + 1) * (k + 1) * (M.E.ncard - k + 1) ≤ independentSetCount M k ^ 2 * k * (M.E.ncard - k) All goals completed! 🐙
#23
Thue–Siegel–Roth theorem (irrationality measure ≤ 2 for algebraic irrationals)
thue_siegel_roth

Lean theorem statement

/-- **Thue–Siegel–Roth theorem** (Klaus Roth, 1955). Every irrational
algebraic real is Diophantine: its irrationality measure is at most
`2`. -/
theorem thueSiegelRoth (x : ℝ) (_h_irr : Irrational x)
    (_h_alg : IsAlgebraic ℤ x) : IsDiophantine x := by
  sorry
#24
Upper bound theorem for geometric simplicial spheres (Stanley 1975)
upper_bound_simplicial_spheres

Verso theorem preview

theorem declaration uses `sorry`upper_bound_theorem_simplicial_spheres {d n k : ℕ} (X : LeanEval.Combinatorics.UpperBoundSimplicialSpheresProblem.FiniteSimplicialSphere d) (_hn : LeanEval.Combinatorics.UpperBoundSimplicialSpheresProblem.faceCount X 0 = n) (_hk : k < d) : LeanEval.Combinatorics.UpperBoundSimplicialSpheresProblem.faceCount X k ≤ LeanEval.Combinatorics.UpperBoundSimplicialSpheresProblem.cyclicPolytopeFaceCount n d k := d:ℕn:ℕk:ℕX:FiniteSimplicialSphere d_hn:faceCount X 0 = n_hk:k < d⊢ faceCount X k ≤ cyclicPolytopeFaceCount n d k All goals completed! 🐙
#25
Seventeen wallpaper groups (Pólya–Niggli 1924)
wallpaper_groups_17

Lean theorem statement

/-- **There are exactly 17 wallpaper groups** (Pólya–Niggli 1924). -/
theorem there_are_17_wallpaper_groups :
    crystallographicCount 2 = 17 := by
  sorry
#26
pi_3 of the 2-sphere is Z
pi3_sphere_two_mulEquiv_int

Lean theorem statement

/-- The third homotopy group of the 2-sphere is infinite cyclic. -/
theorem pi3_sphere_two_mulEquiv_int
    (x : Metric.sphere (0 : EuclideanSpace ℝ (Fin 3)) 1) :
    Nonempty
      (HomotopyGroup.Pi 3 (Metric.sphere (0 : EuclideanSpace ℝ (Fin 3)) 1) x ≃*
        Multiplicative ℤ) := by
  sorry
#27
pi_n of the n-sphere is Z
pin_sphere_n_mulEquiv_int

Lean theorem statement

/-- For every `n ≥ 1`, the `n`th homotopy group of the `n`-sphere is infinite cyclic. -/
theorem pin_sphere_n_mulEquiv_int
    (n : ℕ)
    (x : Metric.sphere (0 : EuclideanSpace ℝ (Fin (n + 2))) 1) :
    Nonempty
      (HomotopyGroup.Pi (n + 1) (Metric.sphere (0 : EuclideanSpace ℝ (Fin (n + 2))) 1) x ≃*
        Multiplicative ℤ) := by
  sorry
#28
Platonic classification
platonic_classification

Verso theorem preview

theorem declaration uses `sorry`platonic_classification : platonicCount 2 = ⊤ ∧ platonicCount 3 = 5 ∧ platonicCount 4 = 6 ∧ ∀ d, 5 ≤ d → platonicCount d = 3 := ⊢ platonicCount 2 = ⊤ ∧ platonicCount 3 = 5 ∧ platonicCount 4 = 6 ∧ ∀ (d : ℕ), 5 ≤ d → platonicCount d = 3 All goals completed! 🐙
#29
Poincaré–Bendixson theorem
poincare_bendixson

Lean theorem statement

/-- **Poincaré–Bendixson theorem.** For a `C¹` autonomous vector field
`F : ℝ² → ℝ²` and a forward integral curve `γ` on `[0, ∞)`, either the
forward orbit is unbounded, or the ω-limit set contains an equilibrium
of `F`, or the ω-limit set equals the range of a non-constant periodic
integral curve of `F`. -/
theorem poincare_bendixson
    (F : Plane → Plane) (_hF : ContDiff ℝ 1 F)
    (γ : ℝ → Plane)
    (_hγ : IsIntegralCurveOn γ (fun _ x => F x) (Set.Ici 0)) :
    ¬ Bornology.IsBounded (γ '' Set.Ici 0)
    ∨ (∃ x₀, F x₀ = 0 ∧ x₀ ∈ ⋂ s : ℝ, closure (γ '' Set.Ici s))
    ∨ (∃ T : ℝ, 0 < T ∧ ∃ β : ℝ → Plane,
        IsIntegralCurve β (fun _ x => F x) ∧
        (∀ t, β (t + T) = β t) ∧
        F (β 0) ≠ 0 ∧
        (⋂ s : ℝ, closure (γ '' Set.Ici s)) = Set.range β) := by
  sorry
#30
Mandelbrot set is connected (Douady–Hubbard)
mandelbrot_connected

Lean theorem statement

/-- **Mandelbrot set is connected** (Douady–Hubbard). -/
theorem mandelbrot_connected : IsConnected Mandelbrot := by
  sorry
#31
Margulis–Ruelle inequality
margulis_ruelle

Lean theorem statement

/-- **Margulis–Ruelle inequality (1968/1978).** `h_μ(T) ≤ λ₁⁺ + λ₂⁺`. -/
theorem margulis_ruelle
    (T T_inv : EucPlane → EucPlane)
    (hT_smooth : ContDiff ℝ 2 T)
    (hT_inv_smooth : ContDiff ℝ 2 T_inv)
    (hT_left : Function.LeftInverse T_inv T)
    (hT_right : Function.RightInverse T_inv T)
    (K : Set EucPlane)
    (hK_compact : IsCompact K)
    (hK_inv : T '' K = K)
    (μ : Measure EucPlane) [IsProbabilityMeasure μ]
    (hμ_supp : μ Kᶜ = 0)
    (hμ_pres : MeasurePreserving T μ μ)
    (hμ_erg : Ergodic T μ) :
    kolmogorovSinaiEntropy μ T
      ≤ max 0 (∫ x, lyapunovUpperAt T x ∂μ)
          + max 0 (∫ x, lyapunovLowerAt T x ∂μ) := by
  sorry
#32
Mergelyan's theorem
mergelyan_theorem

Lean theorem statement

/-- **Mergelyan's theorem.** For a compact `K ⊆ ℂ` with connected
complement and `f : ℂ → ℂ` continuous on `K` and analytic on the
interior of `K`, every `ε > 0` admits a complex polynomial `p` with
`‖f z − p(z)‖ < ε` on `K`. -/
theorem mergelyan (K : Set ℂ) (_hK : IsCompact K) (_hKc : IsConnected (Kᶜ))
    (f : ℂ → ℂ) (_hfc : ContinuousOn f K) (_hfh : AnalyticOnNhd ℂ f (interior K))
    (ε : ℝ) (_hε : 0 < ε) :
    ∃ p : ℂ[X], ∀ z ∈ K, ‖f z - p.eval z‖ < ε := by
  sorry
#33
Morse inequalities
morse_inequality

Lean theorem statement

/-- **Morse inequalities** (Marston Morse, 1934). For a Morse function `f`
on a closed smooth finite-dimensional Hausdorff manifold `M` and every `k ∈ ℕ`,
`∑_{j≤k}(−1)^{k−j} c_j(f) ≥ ∑_{j≤k}(−1)^{k−j} b_j(M)`. -/
theorem morse_inequality
    {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E]
    {H : Type*} [TopologicalSpace H] {I : ModelWithCorners ℝ E H} [I.Boundaryless]
    {M : Type} [TopologicalSpace M] [ChartedSpace H M] [IsManifold I ∞ M]
    [CompactSpace M] [T2Space M] (f : M → ℝ) (_hf : IsMorseFunction I f) (k : ℕ) :
    alternatingPartialSum (bettiNumber M) k ≤
      alternatingPartialSum (morseCount I f) k := by
  sorry
#34
Novikov's theorem: the word problem is undecidable for finitely presented groups
novikov_unsolvable

Verso theorem preview

theorem declaration uses `sorry`novikov_unsolvable : ∃ (n : ℕ) (rels : Set (FreeGroup (Fin n))), rels.Finite ∧ ¬ LeanEval.GroupTheory.NovikovUnsolvableProblem.WordProblemSolvable (PresentedGroup.mk rels) := ⊢ ∃ n rels, rels.Finite ∧ ¬WordProblemSolvable (PresentedGroup.mk rels) All goals completed! 🐙
#35
Fractal uncertainty in higher dimensions
annals_fractal_uncertainty

Lean theorem statement

/--
Statement of Theorem 1.1:

Let `ν > 0` and assume that
- `X ⊆ [−1,1]ᵈ` is `ν`-porous on balls from scales `h` to `1`, and
- `Y ⊆ [−h⁻¹,h⁻¹]ᵈ` is `ν`-porous on lines from scales `1` to `h⁻¹`.
Then there exist `β,C > 0` depending only on `ν` and `d` such that for all `f ∈ L²(ℝᵈ)`,
`supp (𝓕 f) ⊆ Y => ‖f * 1_X‖₂ ≤ C * h ^ β * ‖f‖₂`.
Note: We require `X` and `Y` to be measurable to make the statement more natural.
-/
theorem theorem_1_1 (ν : ℝ) (hν₀ : 0 < ν) :
    ∃ (β C : ℝ), β > 0 ∧ C > 0 ∧ ∀ (h : ℝ) (X Y : Set ℝᵈ)
      (hX : MeasurableSet X) (hY : MeasurableSet Y), h ∈ Set.Ioo 0 (1 / 100) →
        X ⊆ cube (-1) 1 → PorousOnBalls ν h 1 X → Y ⊆ cube (-h⁻¹) h⁻¹ →
          PorousOnLines ν 1 h⁻¹ Y → ∀ (f : Lp ℂ 2), (𝓕 f : Lp ℂ 2) =ᵐ[volume.restrict Yᶜ] 0 →
            (eLpNorm (X.indicator f) 2).toReal ≤ C * h ^ β * ‖f‖ := by
  sorry
#36
Weak Morse inequalities
weak_morse_inequality

Lean theorem statement

/-- **Weak Morse inequalities.** For a Morse function `f` on a closed
smooth finite-dimensional Hausdorff manifold `M` and every `k ∈ ℕ`,
`b_k(M) ≤ c_k(f)`. -/
theorem weak_morse_inequality
    {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E]
    {H : Type*} [TopologicalSpace H] {I : ModelWithCorners ℝ E H} [I.Boundaryless]
    {M : Type} [TopologicalSpace M] [ChartedSpace H M] [IsManifold I ∞ M]
    [CompactSpace M] [T2Space M] (f : M → ℝ) (_hf : IsMorseFunction I f) (k : ℕ) :
    bettiNumber M k ≤ morseCount I f k := by
  sorry
#37
Wieferich's theorem g(3) = 9
wieferich_g_three

Verso theorem preview

theorem declaration uses `sorry`wieferich_g_three : (∀ n : ℕ, LeanEval.NumberTheory.IsSumOfCubes 9 n) ∧ ∃ n : ℕ, ¬ LeanEval.NumberTheory.IsSumOfCubes 8 n := ⊢ (∀ (n : ℕ), IsSumOfCubes 9 n) ∧ ∃ n, ¬IsSumOfCubes 8 n All goals completed! 🐙
#38
Furstenberg measure-preserving multiple recurrence
furstenberg_measure

Verso theorem preview

theorem declaration uses `sorry`furstenberg_measure_recurrence {Ω : Type*} [MeasurableSpace Ω] (μ : MeasureTheory.Measure Ω) [MeasureTheory.IsProbabilityMeasure μ] {T : Ω → Ω} (_hT : MeasureTheory.MeasurePreserving T μ μ) {A : Set Ω} (_hA : MeasurableSet A) (_h0 : 0 < μ A) (d : ℕ) (_hd : 1 ≤ d) : ∃ n : ℕ, 1 ≤ n ∧ 0 < μ (A ∩ ⋂ j ∈ Finset.Icc 1 d, T^[j * n] ⁻¹' A) := Ω:Type u_1inst✝¹:MeasurableSpace Ωμ:Measure Ωinst✝:IsProbabilityMeasure μT:Ω → Ω_hT:MeasurePreserving T μ μA:Set Ω_hA:MeasurableSet A_h0:0 < μ Ad:ℕ_hd:1 ≤ d⊢ ∃ n, 1 ≤ n ∧ 0 < μ (A ∩ ⋂ j ∈ Finset.Icc 1 d, T^[j * n] ⁻¹' A) All goals completed! 🐙
#39
Gleason's theorem (finite-dimensional)
gleason_theorem_finite

Lean theorem statement

/-- **Gleason's theorem**, finite-dimensional version. For `dim H ≥ 3`, every frame
function on the projection lattice of `H` is given by `P ↦ re Tr(ρ P)` for the unique
density operator `ρ` (positive, `re Tr ρ = 1`). -/
theorem gleason_theorem_finite
    {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H]
      [CompleteSpace H] [FiniteDimensional ℂ H]
    (hdim : 3 ≤ Module.finrank ℂ H)
    (f : FrameFunction H) :
    ∃! ρ : H →L[ℂ] H,
      ContinuousLinearMap.IsPositive ρ ∧
      reTr ρ = 1 ∧
      ∀ P : H →L[ℂ] H, IsOrthProj P → f.μ P = reTr (ρ * P) := by
  sorry
#40
Higman's infinite finitely-presented simple group
higman_infinite_simple

Verso theorem preview

theorem declaration uses `sorry`higman_infinite_simple : ∃ (n : ℕ) (rels : Set (FreeGroup (Fin n))), rels.Finite ∧ IsSimpleGroup (PresentedGroup rels) ∧ Infinite (PresentedGroup rels) := ⊢ ∃ n rels, rels.Finite ∧ IsSimpleGroup (PresentedGroup rels) ∧ Infinite (PresentedGroup rels) All goals completed! 🐙
#41
Connective constant of the honeycomb lattice
honeycomb_connective_constant

Verso theorem preview

theorem declaration uses `sorry`honeycomb_connective_constant : Tendsto (fun n ↦ (LeanEval.Combinatorics.HoneycombConnectiveConstant.walkCount n : ℝ) ^ (1 / n : ℝ)) atTop (nhds (Real.sqrt (2 + Real.sqrt 2))) := ⊢ Tendsto (fun n => ↑(walkCount n) ^ (1 / ↑n)) atTop (𝓝 √(2 + √2)) All goals completed! 🐙
#42
Onsager's 2D Ising phase transition
ising_2d_phase_transition

Lean theorem statement

/-- **Onsager's 2D Ising phase transition.** The thermodynamic-limit free
energy exists for all `β` and is non-analytic at some positive `βc`. -/
theorem ising_2d_phase_transition :
    ∃ (F : ℝ → ℝ) (βc : ℝ),
      0 < βc ∧
        (∀ β : ℝ,
          Tendsto (fun n : ℕ => finiteIsingFreeEnergySeq n β) atTop (𝓝 (F β))) ∧
        ¬ AnalyticAt ℝ F βc := by
  sorry
#43
Jordan–Brouwer separation theorem
jordan_brouwer

Lean theorem statement

/-- **Jordan–Brouwer separation theorem.** For `d ≥ 2`, the
complement in `ℝᵈ` of a topological `(d−1)`-sphere (the image of any
continuous injection from the unit `(d−1)`-sphere into `ℝᵈ`) has
exactly two connected components. -/
theorem jordan_brouwer (d : ℕ) (_hd : 2 ≤ d)
    (r : Metric.sphere (0 : EuclideanSpace ℝ (Fin d)) 1 → EuclideanSpace ℝ (Fin d))
    (_hcont : Continuous r) (_hinj : Function.Injective r) :
    Nat.card
        (ConnectedComponents ((Set.range r)ᶜ : Set (EuclideanSpace ℝ (Fin d)))) =
      2 := by
  sorry
#44
KAM persistence of an invariant curve
kam_invariant_curve

Lean theorem statement

/-- **KAM theorem (persistence of an invariant curve).** For real-analytic,
`1`-periodic, non-constant, mean-zero `f` and Diophantine `α`, for all small
`|c|` the twist-map functional equation
`q(t+α) − 2q(t) + q(t−α) = c·f(q(t))` has a smooth strictly increasing solution
`q` with `q − id` periodic — the `c = 0` curve `q₀(t) = t` persists as a smooth
invariant curve of rotation number `α`. -/
theorem kam_invariant_curve
    (α : ℝ) (_hα : IsDiophantine α)
    (f : ℝ → ℝ)
    (_hf_analytic : AnalyticOnNhd ℝ f Set.univ)
    (_hf_per : Function.Periodic f 1)
    (_hf_nonconst : ¬ ∃ k : ℝ, ∀ x, f x = k)
    (_hf_mean : ∫ x in (0 : ℝ)..1, f x = 0) :
    ∃ c₀ : ℝ, 0 < c₀ ∧ ∀ c : ℝ, |c| < c₀ →
      ∃ q : ℝ → ℝ,
        ContDiff ℝ ∞ q ∧ StrictMono q ∧
        Function.Periodic (fun t => q t - t) 1 ∧
        ∀ t : ℝ, q (t + α) - 2 * q t + q (t - α) = c * f (q t) := by
  sorry
#45
Dehn–Sommerville equations for simplicial spheres
dehn_sommerville

Lean theorem statement

/-- **Dehn–Sommerville equations.** The h-vector of a finite simplicial sphere
is symmetric: `h_j = h_{d-j}`. -/
theorem dehn_sommerville
    {d j : ℕ} (X : FiniteSimplicialSphere d) (hj : j ≤ d) :
    hVector X j = hVector X (d - j) := by
  sorry
#46
Fáry–Milnor theorem (knot total curvature ≤ 4π implies unknotted)
fary_milnor

Verso theorem preview

theorem declaration uses `sorry`fary_milnor_total_curvature {r : ℝ → LeanEval.Geometry.FaryMilnorProblem.Space} (_hknot : LeanEval.Geometry.FaryMilnorProblem.IsSmoothKnot r) (_hK : LeanEval.Geometry.FaryMilnorProblem.totalCurvature r ≤ 4 * Real.pi) : LeanEval.Geometry.FaryMilnorProblem.IsUnknotted r := r:ℝ → Space_hknot:IsSmoothKnot r_hK:totalCurvature r ≤ 4 * π⊢ IsUnknotted r All goals completed! 🐙
#47
Fatou–Julia / Cantor dichotomy
fatou_julia_dichotomy

Lean theorem statement

/-- **Fatou–Julia dichotomy.** For the quadratic family, `c ∈ M` implies
the filled Julia set `K_c` is connected; `c ∉ M` implies `K_c` is
homeomorphic to the Cantor space `ℕ → Bool`. -/
theorem julia_cantor_dichotomy (c : ℂ) :
    (c ∈ Mandelbrot → IsConnected (FilledJulia c)) ∧
    (c ∉ Mandelbrot → Nonempty ((FilledJulia c) ≃ₜ (ℕ → Bool))) := by
  sorry
#48
Ado–Iwasawa theorem over an arbitrary field
adoIwasawa

Verso theorem preview

theorem declaration uses `sorry`adoIwasawa [FiniteDimensional K L] : ∃ (V : Type u) (_ : AddCommGroup V) (_ : Module K V) (_ : FiniteDimensional K V) (ρ : L →ₗ⁅K⁆ Module.End K V), Function.Injective ρ := K:Type uL:Type uinst✝³:Field Kinst✝²:LieRing Linst✝¹:LieAlgebra K Linst✝:FiniteDimensional K L⊢ ∃ V x x_1, ∃ (_ : FiniteDimensional K V), ∃ ρ, Function.Injective ⇑ρ All goals completed! 🐙
#49
The alternating sign matrix theorem
alternating_sign_matrix_count

Verso theorem preview

theorem declaration uses `sorry`alternating_sign_matrix_count (n : ℕ) : (Nat.card (LeanEval.Combinatorics.AlternatingSignMatrix.ASMatrix n) : ℚ) = LeanEval.Combinatorics.AlternatingSignMatrix.robbinsProduct n := n:ℕ⊢ ↑(Nat.card (ASMatrix n)) = robbinsProduct n All goals completed! 🐙
#50
Bézout's theorem (projective, with multiplicity)
bezout_projective_multiplicity

Lean theorem statement

/-- **Bézout's theorem (with multiplicity).** Given `n` homogeneous
polynomials `f_k` in `n + 1` variables, each of total degree exactly
`d_k ≥ 1`, over an algebraically closed field with finite common
projective zero set, the sum of intersection multiplicities equals
`∏ d_k`. The `totalDegree` hypothesis rules out the zero polynomial
(which is `IsHomogeneous d` for every `d` but has `totalDegree = 0`). -/
theorem bezout_multiplicity [IsAlgClosed K] {n : ℕ}
    (f : Fin n → MvPolynomial (Fin (n + 1)) K)
    (d : Fin n → ℕ) (_hd : ∀ k, (f k).IsHomogeneous (d k))
    (_hdeg : ∀ k, (f k).totalDegree = d k)
    (_hd_pos : ∀ k, 1 ≤ d k)
    (_hfin : (⋂ k, vanishingSet (f k)).Finite) :
    ∑ᶠ p ∈ (⋂ k, vanishingSet (f k)), intersectionMultiplicity f p
      = (∏ k, d k : ℕ∞) := by
  sorry
#51
Brauer's splitting field theorem
brauer_splitting_field

Verso theorem preview

theorem declaration uses `sorry`brauer_splitting_field (G : Type) [Group G] [Fintype G] (V : Type) [AddCommGroup V] [Module ℂ V] [FiniteDimensional ℂ V] (ρ : Representation ℂ G V) : ∃ (φ : CyclotomicField (Monoid.exponent G) ℚ →+* ℂ) (W : Type) (_ : AddCommGroup W) (_ : Module (CyclotomicField (Monoid.exponent G) ℚ) W) (σ : Representation (CyclotomicField (Monoid.exponent G) ℚ) G W), letI : Algebra (CyclotomicField (Monoid.exponent G) ℚ) ℂ := φ.toAlgebra ∃ (f : (ℂ ⊗[CyclotomicField (Monoid.exponent G) ℚ] W) ≃ₗ[ℂ] V), ∀ (g : G) (x : ℂ ⊗[CyclotomicField (Monoid.exponent G) ℚ] W), f ((σ g).baseChange ℂ x) = ρ g (f x) := G:Typeinst✝⁴:Group Ginst✝³:Fintype GV:Typeinst✝²:AddCommGroup Vinst✝¹:Module ℂ Vinst✝:FiniteDimensional ℂ Vρ:Representation ℂ G V⊢ ∃ φ W x x_1 σ f, ∀ (g : G) (x_2 : ℂ ⊗[CyclotomicField (Monoid.exponent G) ℚ] W), f ((LinearMap.baseChange ℂ (σ g)) x_2) = (ρ g) (f x_2) All goals completed! 🐙
#52
Enumerating number fields
annals_enumerating_number_fields

Lean theorem statement

/--
Statement of Theorem 1 (Number fields have small models):

There exists a positive constant `Q` such that the following is true. Let `K` be a number field
of degree `n ≥ Q` and root discriminant `δ` over `ℚ`. Then there exist integers `r ≤ Q log n` and
`d ≤ Q log n` such that `(d + r) choose r ≤ Q n log n`, and there exist `r` polynomials
`E₁, ..., Eᵣ` of degree `≤ d` in `ℤ[x₁, ..., xᵣ]` all having coefficients bounded in absolute value
by `(n δ) ^ (Q log n)` such that the (smooth and zero-dimensional affine) scheme with equations
`E₁ = ... = Eᵣ = 0` and `det (∂Eᵢ/∂xⱼ) ≠ 0` contains `Spec K` as one of its irreducible components.
-/
theorem theorem_1 : ∃ Q > 0, ∀ n ≥ Q, ∀ K : NumberFieldOfDegree n, ∃ (r d : ℕ),
    r ≤ Q * log n ∧ d ≤ Q * log n ∧ (d + r).choose r ≤ Q * n * log n ∧
      ∃ E : Fin r → MvPolynomial (Fin r) ℤ, (∀ i, (E i).totalDegree ≤ d) ∧
        (∀ i j, |(E i).coeff j| ≤ (n * rootDiscr K) ^ (Q * log n)) ∧
          letI X := nonsingularOpen fun i ↦ (E i).map (algebraMap ℤ ℚ)
          ∃ Z, ∃ hZ : Z ∈ irreducibleComponents X,
            Nonempty (X.irreducibleComponent Z hZ ≅ Spec (.of K)) := by
  sorry

/--
Statement of Theorem 2 (Number fields with bounded discriminant):

There exists a positive constant `Q` such that the following is true. Let `n ≥ Q` be an integer.
Let `H ≥ 1` be an integer. The number of isomorphism classes of number fields
with degree `n` and discriminant `≤ H` is `≤ n^(Q n log^3 n) H^(Q log^3 n)`.
-/
theorem theorem_2 : ∃ Q > 0, ∀ n ≥ Q, ∀ H ≥ 1,
    (Nat.card (NumberFieldOfBoundedDiscriminantUpToIsomorphism n H) : ℝ) ≤
      n ^ (Q * n * log n ^ 3) * H ^ (Q * log n ^ 3) := by
  sorry
#53
Darboux's theorem (symplectic forms are locally standard)
darboux

Lean theorem statement

/-- **Darboux's theorem.** Every symplectic form on an open subset
`U ⊆ ℝ^{2n}` is locally symplectomorphic to the standard symplectic form
`ω₀`. Formally: for every `x ∈ U` there is a smooth local diffeomorphism
`φ` (`OpenPartialHomeomorph`, smooth in both directions) whose source lies
in `U` and contains `x`, such that on the target the pullback of `α` by
`φ⁻¹` is in Darboux normal form (and hence equals `ω₀`) at every point. -/
theorem darboux {n : ℕ} {U : Set (E n)} (_hU : IsOpen U)
    (α : E n → E n [⋀^Fin 2]→L[ℝ] ℝ) (_hα : IsSymplecticOn α U)
    {x : E n} (_hx : x ∈ U) :
    ∃ φ : OpenPartialHomeomorph (E n) (E n),
      x ∈ φ.source ∧ φ.source ⊆ U ∧
      ContDiffOn ℝ ∞ (φ : E n → E n) φ.source ∧
      ContDiffOn ℝ ∞ (φ.symm : E n → E n) φ.target ∧
      ∀ z ∈ φ.target,
        IsDarbouxNormal
          ((α (φ.symm z)).compContinuousLinearMap
            (fderiv ℝ (φ.symm : E n → E n) z)) := by
  sorry
#54
Uniformization theorem for Riemann surfaces
uniformization

Verso theorem preview

theorem declaration uses `sorry`uniformization {X : Type*} [TopologicalSpace X] [T2Space X] [ConnectedSpace X] [SecondCountableTopology X] [ChartedSpace ℂ X] [IsManifold mℂ 1 X] (hX : ¬ CompactSpace X) (x : X) [Subsingleton <| Additive (FundamentalGroup X x) →+ ℝ] : Nonempty (X ≃ₘ⟮mℂ, mℂ⟯ ℂ) ∨ Nonempty (X ≃ₘ⟮mℂ, mℂ⟯ UpperHalfPlane) := X:Type u_1inst✝⁶:TopologicalSpace Xinst✝⁵:T2Space Xinst✝⁴:ConnectedSpace Xinst✝³:SecondCountableTopology Xinst✝²:ChartedSpace ℂ Xinst✝¹:IsManifold mℂ 1 XhX:¬CompactSpace Xx:Xinst✝:Subsingleton (Additive (FundamentalGroup X x) →+ ℝ)⊢ Nonempty (X ≃ₘ⟮mℂ, mℂ⟯ ℂ) ∨ Nonempty (X ≃ₘ⟮mℂ, mℂ⟯ UpperHalfPlane) All goals completed! 🐙
#55
Spencer-Szemerédi-Trotter unit-distance upper bound
unit_distance_upper_bound

Verso theorem preview

theorem declaration uses `sorry`unit_distance_upper_bound : ∃ C : ℝ, 0 < C ∧ ∀ P : Finset (EuclideanSpace ℝ (Fin 2)), (unitDist P : ℝ) ≤ C * (P.card : ℝ) ^ ((4 : ℝ) / 3) := ⊢ ∃ C, 0 < C ∧ ∀ (P : Finset (EuclideanSpace ℝ (Fin 2))), ↑(unitDist P) ≤ C * ↑P.card ^ (4 / 3) All goals completed! 🐙
#56
Existence of a simple group of order 10200960 with a 22-dim irrep whose tensor square has 4 isotypic components
m23_irrep_tensor_square_decomp

Verso theorem preview

theorem declaration uses `sorry`m23_irrep_tensor_square_decomp : ∃ (G : Type) (_ : Group G) (_ : Fintype G), Fintype.card G = 10200960 ∧ IsSimpleGroup G ∧ ∃ (V : Type) (_ : AddCommGroup V) (_ : Module ℂ V) (ρ : Representation ℂ G V), Module.finrank ℂ V = 22 ∧ ρ.IsIrreducible ∧ (@isotypicComponents (MonoidAlgebra ℂ G) (V ⊗[ℂ] V) _ _ (Module.compHom (V ⊗[ℂ] V) (Representation.asAlgebraHom (ρ.tprod ρ)).toRingHom)).ncard = 4 := ⊢ ∃ G x x_1, Fintype.card G = 10200960 ∧ IsSimpleGroup G ∧ ∃ V x_2 x_3 ρ, Module.finrank ℂ V = 22 ∧ ρ.IsIrreducible ∧ (isotypicComponents (MonoidAlgebra ℂ G) (V ⊗[ℂ] V)).ncard = 4 All goals completed! 🐙
#57
Feit–Thompson odd-order theorem
feit_thompson

Verso theorem preview

theorem declaration uses `sorry`feit_thompson {G : Type*} [Group G] [Finite G] (_h : Odd (Nat.card G)) : Group.IsSolvable G := G:Type u_1inst✝¹:Group Ginst✝:Finite G_h:Odd (Nat.card G)⊢ Group.IsSolvable G All goals completed! 🐙
#58
Jacobian of a compact Riemann surface (Buzzard challenge)
jacobian_challenge_diffgeo

Verso theorem preview

def declaration uses `sorry`genus (X : Type u) [TopologicalSpace X] [T2Space X] [CompactSpace X] [ConnectedSpace X] [Nonempty X] [ChartedSpace ℂ X] [IsManifold (modelWithCornersSelf ℂ ℂ) ω X] : ℕ := sorry
theorem declaration uses `sorry`genus_eq_zero_iff_homeo : genus X = 0 ↔ Nonempty (X ≃ₜ (Metric.sphere (0 : EuclideanSpace ℝ (Fin 3)) 1)) := sorry
def declaration uses `sorry`Jacobian (X : Type u) [TopologicalSpace X] [T2Space X] [CompactSpace X] [ConnectedSpace X] [Nonempty X] [ChartedSpace ℂ X] [IsManifold (modelWithCornersSelf ℂ ℂ) ω X] : Type u := sorry
instance declaration uses `sorry`instAddCommGroup : AddCommGroup (Jacobian X) := sorry
instance declaration uses `sorry`instTopologicalSpace : TopologicalSpace (Jacobian X) := sorry
instance declaration uses `sorry`instT2Space : T2Space (Jacobian X) := sorry
instance declaration uses `sorry`instCompactSpace : CompactSpace (Jacobian X) := sorry
instance declaration uses `sorry`instChartedSpace : ChartedSpace (Fin (genus X) → ℂ) (Jacobian X) := sorry
instance declaration uses `sorry`instIsManifold : IsManifold (modelWithCornersSelf ℂ (Fin (genus X) → ℂ)) ω (Jacobian X) := sorry
instance declaration uses `sorry`instLieAddGroup : LieAddGroup (modelWithCornersSelf ℂ (Fin (genus X) → ℂ)) ω (Jacobian X) := sorry
def declaration uses `sorry`ofCurve (P : X) : X → Jacobian X := sorry
theorem declaration uses `sorry`ofCurve_contMDiff (P : X) : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ (Fin (genus X) → ℂ)) ω (ofCurve P) := sorry
theorem declaration uses `sorry`ofCurve_self (P : X) : ofCurve P P = 0 := sorry
theorem declaration uses `sorry`ofCurve_inj (P : X) (h : 0 < genus X) : Function.Injective (ofCurve P) := sorry
def declaration uses `sorry`pushforward (f : X → Y) (hf : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω f) : Jacobian X →ₜ+ Jacobian Y := sorry
theorem declaration uses `sorry`pushforward_contMDiff (f : X → Y) (hf : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω f) : ContMDiff (modelWithCornersSelf ℂ (Fin (genus X) → ℂ)) (modelWithCornersSelf ℂ (Fin (genus Y) → ℂ)) ω (pushforward f hf) := sorry
theorem declaration uses `sorry`pushforward_id_apply (P : Jacobian X) : pushforward id contMDiff_id P = P := sorry
theorem declaration uses `sorry`pushforward_comp_apply (f : X → Y) (hf : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω f) (g : Y → Z) (hg : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω g) (P : Jacobian X) : pushforward (g ∘ f) (hg.comp hf) P = pushforward g hg (pushforward f hf P) := sorry
def declaration uses `sorry`pullback (f : X → Y) (hf : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω f) : Jacobian Y →ₜ+ Jacobian X := sorry
theorem declaration uses `sorry`pullback_contMDiff (f : X → Y) (hf : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω f) : ContMDiff (modelWithCornersSelf ℂ (Fin (genus Y) → ℂ)) (modelWithCornersSelf ℂ (Fin (genus X) → ℂ)) ω (pullback f hf) := sorry
theorem declaration uses `sorry`pullback_id_apply (P : Jacobian X) : pullback id contMDiff_id P = P := sorry
theorem declaration uses `sorry`pullback_comp_apply (f : X → Y) (hf : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω f) (g : Y → Z) (hg : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω g) (P : Jacobian Z) : pullback (g.comp f) (hg.comp hf) P = pullback f hf (pullback g hg P) := sorry
def declaration uses `sorry`degree (f : X → Y) (hf : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω f) : ℕ := sorry -- 0 for constant case
theorem declaration uses `sorry`pushforward_pullback (f : X → Y) (hf : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω f) (P : Jacobian Y) : pushforward f hf (pullback f hf P) = (degree f hf) • P := sorry
#59
Ado's theorem in characteristic zero
adoCharZero

Verso theorem preview

theorem declaration uses `sorry`adoCharZero [CharZero K] [FiniteDimensional K L] : ∃ (V : Type u) (_ : AddCommGroup V) (_ : Module K V) (_ : FiniteDimensional K V) (ρ : L →ₗ⁅K⁆ Module.End K V), Function.Injective ρ := K:Type uL:Type uinst✝⁴:Field Kinst✝³:LieRing Linst✝²:LieAlgebra K Linst✝¹:CharZero Kinst✝:FiniteDimensional K L⊢ ∃ V x x_1, ∃ (_ : FiniteDimensional K V), ∃ ρ, Function.Injective ⇑ρ All goals completed! 🐙
#60
Lorentzian polynomials
annals_lorentzian_polynomials

Verso theorem preview

theorem declaration uses `sorry`theorem_2_25 (n d : ℕ) (hn : 0 < n) : closure (Ŀ n d) = LorentzianPolynomials.L n d := n:ℕd:ℕhn:0 < n⊢ closure (Ŀ n d) = L n d All goals completed! 🐙
#61
Pseudorandom sets in Grassmann graph have near-perfect expansion
annals_pseudorandom_grassmann

Verso theorem preview

theorem declaration uses `sorry`theorem_1_12 (α : ℝ) (hα : α ∈ Set.Ioo 0 1) : ∃ ε > 0, ∃ r, ∀ᶠ (ℓ : ℕ) (k : ℕ) in atTop, ∀ S : Finset (PseudorandomGrassmann.GrVertex k ℓ), (hS : S.Nonempty) → 2 * #S ≤ Fintype.card (PseudorandomGrassmann.GrVertex k ℓ) → Φ (PseudorandomGrassmann.Gr k ℓ) S hS ≤ α → ∃ (A B : Submodule 𝔽₂ (Fin k → 𝔽₂)), A ≤ B ∧ letI a := finrank 𝔽₂ A; letI b := k - finrank 𝔽₂ B a + b ≤ r ∧ #(S ∩ SubGr k ℓ A B) / #(SubGr k ℓ A B) ≥ (ε : ℝ) := α:ℝhα:α ∈ Set.Ioo 0 1⊢ ∃ ε > 0, ∃ r, ∀ᶠ (ℓ : ℕ) (k : ℕ) in atTop, ∀ (S : Finset (GrVertex k ℓ)) (hS : S.Nonempty), 2 * #S ≤ Fintype.card (GrVertex k ℓ) → ↑(Φ (Gr k ℓ) S hS) ≤ α → ∃ A B, A ≤ B ∧ finrank 𝔽₂ ↥A + (k - finrank 𝔽₂ ↥B) ≤ r ∧ ↑(#(S ∩ SubGr k ℓ A B)) / ↑(#(SubGr k ℓ A B)) ≥ ε All goals completed! 🐙
#62
On the Duffin-Schaeffer conjecture
annals_duffin_schaeffer_conjecture

Verso theorem preview

/-- Statement of Theorem 1: If for `ψ : ℕ → ℝ≥0`, the infinite series `∑ (ψ q * φ q) / q`, where `φ` is the Euler totient function, diverges, then the set `𝒜` defined above has Lebesgue measure `1`. -/ theorem declaration uses `sorry`theorem_1 (ψ : ℕ+ → ℝ≥0) (hdivergence : ¬ Summable fun q ↦ (ψ q * φ q) / q) : MeasurableSet (𝒜 ψ) ∧ volume (𝒜 ψ) = 1 := ψ:ℕ+ → ℝ≥0hdivergence:¬Summable fun q => ψ q * ↑(φ ↑q) / ↑↑q⊢ MeasurableSet (𝒜 ψ) ∧ volume (𝒜 ψ) = 1 All goals completed! 🐙
/-- Statement of Theorem 2(a): Let `ψ : ℕ → ℝ≥0`, `𝒦` and `ψ⋆` be as above. Then, if `∑ ψ⋆ (q)` converges, `𝒦` has Lebesgue measure `0`. -/ theorem declaration uses `sorry`theorem_2_a (ψ : ℕ+ → ℝ≥0) (hψ : ∑' q, ψ_star ψ q < ∞) : MeasurableSet (𝒦 ψ) ∧ volume (𝒦 ψ) = 0 := ψ:ℕ+ → ℝ≥0hψ:∑' (q : ℕ+), ψ_star ψ q < ∞⊢ MeasurableSet (𝒦 ψ) ∧ volume (𝒦 ψ) = 0 All goals completed! 🐙
/-- Statement of Theorem 2(b): Let `ψ : ℕ → ℝ≥0`, `𝒦` and `ψ⋆` be as above. Then, if `∑ ψ⋆ (q)` diverges, `𝒦` has Lebesgue measure `1`. -/ theorem declaration uses `sorry`theorem_2_b (ψ : ℕ+ → ℝ≥0) (hψ : ∑' q, ψ_star ψ q = ∞) : MeasurableSet (𝒦 ψ) ∧ volume (𝒦 ψ) = 1 := ψ:ℕ+ → ℝ≥0hψ:∑' (q : ℕ+), ψ_star ψ q = ∞⊢ MeasurableSet (𝒦 ψ) ∧ volume (𝒦 ψ) = 1 All goals completed! 🐙
/-- Statement of Corollary 3: For a function `ψ : ℕ → [0, 1/2]`, the set `𝒜` and the element `s` defined as above, the Hausdorff dimension of `𝒜` is the minimum of `s` and `1`. -/ theorem declaration uses `sorry`corollary_3 (ψ : ℕ+ → ℝ≥0) (hψ : ∀ n, ψ n ∈ Set.Icc 0 (1 / 2)) : dimH (𝒜 ψ) = min (s_inf ψ) 1 := ψ:ℕ+ → ℝ≥0hψ:∀ (n : ℕ+), ψ n ∈ Set.Icc 0 (1 / 2)⊢ dimH (𝒜 ψ) = ↑(min (s_inf ψ) 1) All goals completed! 🐙
#63
Flat Littlewood polynomials exist
annals_flat_littlewood_poly

Verso theorem preview

theorem declaration uses `sorry`theorem_1_1 : ∃ Δ δ : ℝ, Δ > δ ∧ δ > 0 ∧ ∀ n ≥ 2, ∃ P : ℂ[X], FlatLittlewoodPoly.IsLittlewoodPolynomial P ∧ P.natDegree = n ∧ ∀ z : ℂ, ‖z‖ = 1 → δ * √n ≤ ‖P.eval z‖ ∧ ‖P.eval z‖ ≤ Δ * √n := ⊢ ∃ Δ δ, Δ > δ ∧ δ > 0 ∧ ∀ n ≥ 2, ∃ P, IsLittlewoodPolynomial P ∧ P.natDegree = n ∧ ∀ (z : ℂ), ‖z‖ = 1 → δ * √↑n ≤ ‖Polynomial.eval z P‖ ∧ ‖Polynomial.eval z P‖ ≤ Δ * √↑n All goals completed! 🐙
#64
Moran's equality for affine-symmetric iterated function systems
moran_equality_affine

Verso theorem preview

theorem declaration uses `sorry`moran_equality_affine {d n : ℕ} (hn : 1 ≤ n) (f : Fin n → EuclideanSpace ℝ (Fin d) → EuclideanSpace ℝ (Fin d)) (lam : ℝ) (h_aff : LeanEval.Dynamics.IsAffineSymmetricIFS f lam) (h_osc : LeanEval.Dynamics.OpenSetCondition f) {S : Set (EuclideanSpace ℝ (Fin d))} (hS : LeanEval.Dynamics.IsAttractor f S) : dimH S = ENNReal.ofReal (- Real.log n / Real.log lam) := d:ℕn:ℕhn:1 ≤ nf:Fin n → EuclideanSpace ℝ (Fin d) → EuclideanSpace ℝ (Fin d)lam:ℝh_aff:IsAffineSymmetricIFS f lamh_osc:OpenSetCondition fS:Set (EuclideanSpace ℝ (Fin d))hS:IsAttractor f S⊢ dimH S = ENNReal.ofReal (-Real.log ↑n / Real.log lam) All goals completed! 🐙
#65
A reverse Minkowski theorem
annals_reverse_minkowski

Verso theorem preview

theorem declaration uses `sorry`theorem_1_2 (ℒ : Submodule ℤ ℝⁿ) [DiscreteTopology ℒ] (hℒ : IsZLattice ℝ ℒ) (h : ∀ ℒ' (_hℒℒ' : ℒ' ≤ ℒ) [DiscreteTopology ℒ'], determinant ℒ' ≥ 1) : let t : ℝ := 10 * (log n + 2) ρ (1 / t) ℒ ≤ 3 / 2 := n:ℕℒ:Submodule ℤ ℝⁿinst✝:DiscreteTopology ↥ℒhℒ:IsZLattice ℝ ℒh:∀ ℒ' ≤ ℒ, ∀ [inst : DiscreteTopology ↥ℒ'], determinant ℒ' ≥ 1⊢ let t := 10 * (log ↑n + 2); ρ (1 / t) ℒ ≤ 3 / 2 All goals completed! 🐙
#66
On a conjecture of Talagrand on selector processes and a consequence on positive empirical processes
annals_supremum_of_selector_processes

Lean theorem statement

/-- The constant `L` of Theorem 1.2. -/
noncomputable def L₂ : ℝ≥0 := sorry

/-- The constant of Theorem 1.2 is positive. -/
theorem L₂_pos : L₂ > 0 := sorry

/--
Statement of Theorem 1.2:

There exists `L > 0` such that for any `0 < p < 1`, finite type `X`, and set `Λ` of functions from
`X` to `ℝ≥0` such that `0 < 𝔼[sup_{f ∈ Λ} ∑ i ∈ Xp, f i] < ∞`, the collection of sets

`{s ⊆ X | sup_{f ∈ Λ} ∑ i ∈ s, f i ≥ L * 𝔼[sup_{f ∈ Λ} ∑ i ∈ Xp, f i]}`

is `p-small`, where `Xp` is a binomial random subset of `X` with parameter `p`.

Note: The assumption `0 < 𝔼[sup_{f ∈ Λ} ∑ i ∈ Xp, f i] < ∞` is not explicitly stated in the theorem
but used in the last step of the proof where `𝔼 ≥ (L/L') * 𝔼` is a contradiction for `L > L'`.
-/
theorem theorem_1_2 (p : I) (hp₀ : 0 < p) (hp₁ : p < 1) (X : Type*) [Fintype X] (Λ : Set (X → ℝ≥0))
    (hE₀ : 0 < 𝔼⁻[⨆ f ∈ Λ, ∑ i ∈ Xp, (f i : ℝ≥0∞); Xp ∼ binomialSetDistribution X p])
    (hE : 𝔼⁻[⨆ f ∈ Λ, ∑ i ∈ Xp, (f i : ℝ≥0∞); Xp ∼ binomialSetDistribution X p] < ∞) :
    IsSmall p {s : Set X | ⨆ f ∈ Λ, ∑ i ∈ s, (f i : ℝ≥0∞) ≥
        L₂ * 𝔼⁻[⨆ f ∈ Λ, ∑ i ∈ Xp, (f i : ℝ≥0∞); Xp ∼ binomialSetDistribution X p]} := by
  sorry

/-- The constant `L` of Theorem 1.3. -/
noncomputable def L₃ : ℝ≥0 := sorry

/-- The constant of Theorem 1.3 is positive. -/
theorem L₃_pos : L₃ > 0 := sorry

/--
Statement of Theorem 1.3:

There exists `L > 0` such that for any `N > 0`, i.i.d random variables `Y_1, …, Y_N` distributed
according to a Borel probability measure `ν` on a Polish space `𝕋`, if `𝓕` is a finite set of
non-negative functions in `L∞(𝕋)` and `0 < 𝔼[sup_{f ∈ 𝓕} Z Y f] < ∞` then there exists a finite
collection `𝓒` of pairs `(g, t)` where `g : 𝕋 → ℝ≥0`, `t > 0` such that

`{sup_{f ∈ 𝓕} Z N Y f ≥ L * 𝔼[sup_{f ∈ 𝓕} Z N Y f] } ⊆ ⋃ (g,t) ∈ 𝓒, {t ≤ Z N Y g}`

and

`∑ (g,t) ∈ 𝓒, P(t ≤ Z N Y g) ≤ 2⁻¹`.

Note: The requirement that the collection `𝓒` be finite is not explicitly stated in the paper.
However, `𝓒` must at least be assumed to be countable in order for the sum to make sense,
and the collections `𝓒` produced by the proof are indeed finite.

-/
theorem theorem_1_3 (N : ℕ) (N_pos : N > 0) (𝕋 : Type*) (t𝕋 : TopologicalSpace 𝕋)
    (p𝕋 : PolishSpace 𝕋)
    (m𝕋 : MeasurableSpace 𝕋) (b𝕋 : BorelSpace 𝕋) (ν : Measure 𝕋) (hν : IsProbabilityMeasure ν)
    (Ω : Type*) (mΩ : MeasurableSpace Ω) (P : Measure Ω) (Y : Fin N → Ω → 𝕋)
    (Y_indep : iIndepFun Y P) (Y_law_ν : ∀ i, HasLaw (Y i) ν P)
    (𝓕 : Set {f : 𝕋 → ℝ≥0 // Measurable f ∧ MemLp f ∞ ν}) (h𝓕 : Finite 𝓕)
    (hZ₀ : 0 < 𝔼⁻[⨆ f ∈ 𝓕, (Z N Y f ·); P]) (hZ : 𝔼⁻[⨆ f ∈ 𝓕, (Z N Y f ·); P] < ∞) :
    ∃ 𝓒 : Finset ({g : 𝕋 → ℝ≥0 // Measurable g} × {t : ℝ≥0 | t > 0}),
      {ω | ⨆ f ∈ 𝓕, Z N Y f ω ≥ L₃ * 𝔼⁻[⨆ f ∈ 𝓕, (Z N Y f ·); P]} ⊆ ⋃ c ∈ 𝓒, {ω | c.2 ≤ Z N Y c.1 ω}
      ∧ ∑ c : 𝓒, P {ω | c.val.2 ≤ Z N Y c.val.1 ω} ≤ 2⁻¹ := by
  sorry
#67
Radó's theorem on Riemann surfaces
rado_riemannSurface

Verso theorem preview

theorem declaration uses `sorry`rado_riemannSurface {X : Type*} [TopologicalSpace X] [T2Space X] [ConnectedSpace X] [ChartedSpace ℂ X] [IsManifold (modelWithCornersSelf ℂ ℂ) 1 X] : SecondCountableTopology X := X:Type u_1inst✝⁴:TopologicalSpace Xinst✝³:T2Space Xinst✝²:ConnectedSpace Xinst✝¹:ChartedSpace ℂ Xinst✝:IsManifold (modelWithCornersSelf ℂ ℂ) 1 X⊢ SecondCountableTopology X All goals completed! 🐙
#68
Pick's theorem
pick

Verso theorem preview

theorem declaration uses `sorry`pick {n : ℕ} (hn : 3 ≤ n) (v : Fin n → ℤ × ℤ) (hsimple : LeanEval.Geometry.PicksTheorem.IsSimple (LeanEval.Geometry.PicksTheorem.latPoly v)) : area ((LeanEval.Geometry.PicksTheorem.latPoly v).boundary (R := ℝ)) = (interiorPts v : ℝ) + (boundaryPts v : ℝ) / 2 - 1 := n:ℕhn:3 ≤ nv:Fin n → ℤ × ℤhsimple:IsSimple (latPoly v)⊢ area (Polygon.boundary ℝ (latPoly v)) = ↑(interiorPts v) + ↑(boundaryPts v) / 2 - 1 All goals completed! 🐙
#69
A 3-manifold group with no faithful representation into GL(4, ℝ)
nonlinear_three_manifold_group

Verso theorem preview

theorem declaration uses `sorry`nonlinear_three_manifold_group : ∃ (M : LeanEval.Topology.Closed3Manifold) (x : M.carrier), ∀ f : FundamentalGroup M.carrier x →* GL (Fin 4) ℝ, ¬ Function.Injective f := ⊢ ∃ M x, ∀ (f : FundamentalGroup M.carrier x →* GL (Fin 4) ℝ), ¬Function.Injective ⇑f All goals completed! 🐙
#70
The Golod–Shafarevich inequality
golod_shafarevich_inequality

Verso theorem preview

theorem declaration uses `sorry`golod_shafarevich_inequality (p : ℕ) [Fact p.Prime] (Q : Type) [Group Q] [TopologicalSpace Q] [IsTopologicalGroup Q] [DiscreteTopology Q] [Finite Q] : IsPGroup p Q → Nontrivial Q → (generatorRank Q : ℝ) ^ 2 < 4 * (relationRank p Q : ℝ) := p:ℕinst✝⁵:Fact (Nat.Prime p)Q:Typeinst✝⁴:Group Qinst✝³:TopologicalSpace Qinst✝²:IsTopologicalGroup Qinst✝¹:DiscreteTopology Qinst✝:Finite Q⊢ IsPGroup p Q → Nontrivial Q → ↑(generatorRank Q) ^ 2 < 4 * ↑(relationRank p Q) All goals completed! 🐙
#71
Green–Tao theorem
green_tao

Verso theorem preview

theorem declaration uses `sorry`green_tao : LeanEval.NumberTheory.ContainsArbitraryAPs {p : ℕ | Nat.Prime p} := ⊢ ContainsArbitraryAPs {p | Nat.Prime p} All goals completed! 🐙
#72
Hadwiger's theorem
hadwiger

Verso theorem preview

theorem declaration uses `sorry`hadwiger (n : ℕ) : Module.finrank ℝ (valuations n) = n + 1 := n:ℕ⊢ Module.finrank ℝ ↥(valuations n) = n + 1 All goals completed! 🐙
#73
The Hopf Umlaufsatz (theorem of turning tangents)
hopf_umlaufsatz

Verso theorem preview

theorem declaration uses `sorry`hopf_umlaufsatz {r : ℝ → LeanEval.Geometry.HopfUmlaufsatz.Plane} {α : ℝ → ℝ} (_hr : LeanEval.Geometry.HopfUmlaufsatz.IsPositiveSimpleClosedUnitSpeedCurve r) (_hα : LeanEval.Geometry.HopfUmlaufsatz.IsTangentAngleLift r α) : totalCurvature α = 2 * Real.pi := r:ℝ → Planeα:ℝ → ℝ_hr:IsPositiveSimpleClosedUnitSpeedCurve r_hα:IsTangentAngleLift r α⊢ totalCurvature α = 2 * Real.pi All goals completed! 🐙
#74
Duffin-Schaeffer conjecture
duffin_schaeffer

Verso theorem preview

theorem declaration uses `sorry`duffin_schaeffer (δ : ℕ → ℝ) (hδ : ∀ n, 0 ≤ δ n) : volume (addWellApproximable UnitAddCircle δ) = 1 ↔ ¬ Summable fun n : ℕ => n.totient * δ n := δ:ℕ → ℝhδ:∀ (n : ℕ), 0 ≤ δ n⊢ volume (addWellApproximable UnitAddCircle δ) = 1 ↔ ¬Summable fun n => ↑n.totient * δ n All goals completed! 🐙
#75
Existence of a non-isotopic pair of oriented knots
exists_nonisotopic_knots

Verso theorem preview

theorem declaration uses `sorry`exists_nonisotopic_knots : ∃ K₁ K₂ : LeanEval.KnotTheory.Knot, ¬ K₁.Isotopic K₂ := ⊢ ∃ K₁ K₂, ¬K₁.Isotopic K₂ All goals completed! 🐙
#76
Morrison–Walker Lemma B.0.1: adapting families of maps to open covers
families_of_maps_b01

Verso theorem preview

/-- **Lemma B.0.1** of Morrison–Walker, *The Blob Complex* (arXiv:1009.5025, §B), continuous case. -/ theorem declaration uses `sorry`continuous {P : Set (Fin k → ℝ)} (_hP : IsPolyhedron P) [CompactSpace X] (U : ι → Set X) (_hUopen : ∀ α, IsOpen (U α)) (ρ : PartitionOfUnity ι X univ) (_hρ : ρ.IsSubordinate U) (f : C(P × X, T)) : ∃ F : C(I × P × X, T), (∀ p : P, ∀ x : X, F (0, p, x) = f (p, x)) ∧ (∃ K : Subdivision P, ∀ D ∈ K.complex.facets, AdaptedTo U k (fun q : closedCell P D × X => F (1, q.1.1, q.2))) ∧ (∀ S : Set X, Supported (f := f.toFun) S → Supported (fun q : (I × P) × X => F (q.1.1, q.1.2, q.2)) S) ∧ (∀ Q : Set P, IsBoundarySubpolyhedron Q → ∀ S' : Set X, Supported (fun q : Q × X => f (q.1.1, q.2)) S' → Supported (fun q : (I × Q) × X => F (q.1.1, q.1.2.1, q.2)) S') := k:ℕι:Type u_1X:Type u_2T:Type u_3inst✝²:TopologicalSpace Xinst✝¹:TopologicalSpace TP:Set (Fin k → ℝ)_hP:IsPolyhedron Pinst✝:CompactSpace XU:ι → Set X_hUopen:∀ (α : ι), IsOpen[inst✝²] (U α)ρ:PartitionOfUnity ι X_hρ:ρ.IsSubordinate Uf:C(↑P × X, T)⊢ ∃ F, (∀ (p : ↑P) (x : X), F (0, p, x) = f (p, x)) ∧ (∃ K, ∀ D ∈ K.complex.facets, AdaptedTo U k fun q => F (1, ↑q.1, q.2)) ∧ (∀ (S : Set X), Supported f.toFun S → Supported (fun q => F (q.1.1, q.1.2, q.2)) S) ∧ ∀ (Q : Set ↑P), IsBoundarySubpolyhedron Q → ∀ (S' : Set X), Supported (fun q => f (↑q.1, q.2)) S' → Supported (fun q => F (q.1.1, ↑q.1.2, q.2)) S' All goals completed! 🐙
/-- **Lemma B.0.1**, bi-Lipschitz variant (part 4 of the paper). -/ theorem declaration uses `sorry`biLipschitz {X T : Type*} [MetricSpace X] [MetricSpace T] [CompactSpace X] {P : Set (Fin k → ℝ)} (_hP : IsPolyhedron P) {ι : Type*} (U : ι → Set X) (_hUopen : ∀ α, IsOpen (U α)) (ρ : PartitionOfUnity ι X univ) (_hρ : ρ.IsSubordinate U) (f : C(P × X, T)) (slice : P → (X ≃ₜ T)) (_h_slice_eq : ∀ p : P, ∀ x : X, f (p, x) = slice p x) (L : NNReal) (_hf_joint : LipschitzWith L f.toFun) (_hf_slice_inv : ∀ p : P, LipschitzWith L (slice p).symm) : ∃ F : C(I × P × X, T), ∃ L' : NNReal, ∃ Slice : I × P → (X ≃ₜ T), (∀ p : P, ∀ x : X, F (0, p, x) = f (p, x)) ∧ (∀ t : I, ∀ p : P, ∀ x : X, F (t, p, x) = Slice (t, p) x) ∧ (∃ K : Subdivision P, ∀ D ∈ K.complex.facets, AdaptedTo U k (fun q : closedCell P D × X => F (1, q.1.1, q.2))) ∧ (∀ S : Set X, Supported (f := f.toFun) S → Supported (fun q : (I × P) × X => F (q.1.1, q.1.2, q.2)) S) ∧ (∀ Q : Set P, IsBoundarySubpolyhedron Q → ∀ S' : Set X, Supported (fun q : Q × X => f (q.1.1, q.2)) S' → Supported (fun q : (I × Q) × X => F (q.1.1, q.1.2.1, q.2)) S') ∧ (∀ tp : I × P, LipschitzWith L' (Slice tp)) ∧ (∀ tp : I × P, LipschitzWith L' (Slice tp).symm) := k:ℕX:Type u_4T:Type u_5inst✝²:MetricSpace Xinst✝¹:MetricSpace Tinst✝:CompactSpace XP:Set (Fin k → ℝ)_hP:IsPolyhedron Pι:Type u_6U:ι → Set X_hUopen:∀ (α : ι), IsOpen[PseudoMetricSpace.toUniformSpace.toTopologicalSpace] (U α)ρ:PartitionOfUnity ι X_hρ:ρ.IsSubordinate Uf:C(↑P × X, T)slice:↑P → X ≃ₜ T_h_slice_eq:∀ (p : ↑P) (x : X), f (p, x) = (slice p) xL:NNReal_hf_joint:LipschitzWith L f.toFun_hf_slice_inv:∀ (p : ↑P), LipschitzWith L ⇑(slice p).symm⊢ ∃ F L' Slice, (∀ (p : ↑P) (x : X), F (0, p, x) = f (p, x)) ∧ (∀ (t : ↑I) (p : ↑P) (x : X), F (t, p, x) = (Slice (t, p)) x) ∧ (∃ K, ∀ D ∈ K.complex.facets, AdaptedTo U k fun q => F (1, ↑q.1, q.2)) ∧ (∀ (S : Set X), Supported f.toFun S → Supported (fun q => F (q.1.1, q.1.2, q.2)) S) ∧ (∀ (Q : Set ↑P), IsBoundarySubpolyhedron Q → ∀ (S' : Set X), Supported (fun q => f (↑q.1, q.2)) S' → Supported (fun q => F (q.1.1, ↑q.1.2, q.2)) S') ∧ (∀ (tp : ↑I × ↑P), LipschitzWith L' ⇑(Slice tp)) ∧ ∀ (tp : ↑I × ↑P), LipschitzWith L' ⇑(Slice tp).symm All goals completed! 🐙
#77
The local-global conjecture for Apollonian circle packings is false
annals_local_global_apollonian_circle_packings

Lean theorem statement

/--
Statement of Theorem 1.6:

The Apollonian circle packing `A` generated by `(−3, 5, 8, 8)` has no square curvatures.
-/
theorem theorem_1_6 : ∀ n, n ^ 2 ∉ curvatureSet ⟦⟨![-3, 5, 8, 8], by decide⟩⟧ := by
  sorry

/--
Statement of Theorem 1.3:

There exist infinitely many `A` for which the number of missing curvatures up to `N` is `Ω(√N)`.
-/
theorem theorem_1_3 : {A : PrimitiveApollonianCirclePacking |
    Real.sqrt =O[Filter.atTop] missingCurvatures A}.Infinite := by
  sorry
#78
On approximation to a real number by algebraic numbers of bounded degree
annals_on_approximation_of_reals

Lean theorem statement

/--
Statement of Theorem 1.1:

Let `n` be an integer such that `n ≥ 2`. For any transcendental real number `ξ`, we have
`ω⋆_n(ξ) ≥ a * n`, where `a = 1 / (2 - log 2)`.
-/
theorem theorem_1_1 (n : ℕ) (hn : n ≥ 2) (ξ : ℝ) (hξ : Transcendental ℚ ξ) :
    letI a : ℝ := 1 / (2 - Real.log 2)
    (ω⋆ n ξ : EReal) ≥ (a : EReal) * n := by
  sorry
#79
A counterexample to the periodic tiling conjecture
annals_periodic_tiling_conjecture

Lean theorem statement

/--
Statement of Theorem 1.4 (Counterexample to Conjecture 1.2, I):

There exists a finite abelian group `G₀` and a finite non-empty `F ⊆ ℤ² × G₀` such that
`F` forms an aperiodic tiling equation.
-/
theorem theorem_1_4 : ∃ (G₀ : Type) (_ : AddCommGroup G₀) (_ : Finite G₀),
    ∃ F : Set (ℤ × ℤ × G₀), F.Finite ∧ F.Nonempty ∧ IsAperiodicTilingEquation F := by
  sorry

/--
Statement of Corollary 1.6 (Counterexample to Conjecture 1.2, II):

For all sufficiently large `d`, there exists a finite non-empty `F ⊆ ℤᵈ` such that
`F` forms an aperiodic tiling equation.
-/
theorem corollary_1_6 : ∀ᶠ d in atTop, ∃ (F : Set (Fin d → ℤ)),
    F.Finite ∧ F.Nonempty ∧ IsAperiodicTilingEquation F := by
  sorry

/--
Statement of Corollary 1.7 (Counterexample to Conjecture 1.3):

For all sufficiently large `d`, there exists a bounded measurable set `σ ⊆ ℝᵈ` of positive
measure such that `σ` forms an aperiodic continuous tiling equation.
-/
theorem corollary_1_7 : ∀ᶠ d in atTop, ∃ σ : Set (Fin d → ℝ), IsBounded σ ∧ MeasurableSet σ ∧
    0 < volume σ ∧ IsAperiodicContinuousTilingEquation σ := by
  sorry
#80
Singularity of random Bernoulli matrices
annals_random_bernoulli_matrices

Verso theorem preview

/-- Statement of Theorem A: For every `p ∈ (0, 1/2]` and `ε > 0` there exists `N, C > 0` such that for any `n ≥ N` and any `n × n` random matrix `B` with mutually independent `Bernoulli(p)` entries, `P(σ_min (B + sIIᵀ) ≤ t/√n) ≤ (1 - p + ε)ⁿ + Ct` for all `s ∈ [-1,0]` and `t > 0`. -/ theorem declaration uses `sorry`theorem_A {p : I} {ε : ℝ} (hp₀ : 0 < p) (hp₁ : (p : ℝ) ≤ 1 / 2) (hε : 0 < ε) : ∃ N > 0, ∃ C > 0, ∀ n ≥ N, ∀ (Ω : Type*) (_mΩ : MeasurableSpace Ω) (P : Measure Ω) (B : Ω → Matrix (Fin n) (Fin n) ℝ) (_B_indep : iIndepFun (fun x : Fin n × Fin n ↦ (B · x.1 x.2)) P) (_B_bernoulli : ∀ i j, HasLaw (B · i j) (bernoulliMeasure 1 0 p) P), ∀ s : ℝ, -1 ≤ s ∧ s ≤ 0 → ∀ t : ℝ, 0 < t → P.real {ω : Ω | σ_min (B ω + of (fun _ _ ↦ s)) ≤ t / √n} ≤ (1 - p + ε) ^ n + C * t := p:↑Iε:ℝhp₀:0 < php₁:↑p ≤ 1 / 2hε:0 < ε⊢ ∃ N > 0, ∃ C > 0, ∀ n ≥ N, ∀ (Ω : Type u_1) (_mΩ : MeasurableSpace Ω) (P : Measure Ω) (B : Ω → Matrix (Fin n) (Fin n) ℝ), iIndepFun (fun x x_1 => B x_1 x.1 x.2) P → (∀ (i j : Fin n), HasLaw (fun x => B x i j) Ber(1, 0, p) P) → ∀ (s : ℝ), -1 ≤ s ∧ s ≤ 0 → ∀ (t : ℝ), 0 < t → P.real {ω | σ_min (B ω + of fun x x_1 => s) ≤ t / √↑n} ≤ (1 - ↑p + ε) ^ n + C * t All goals completed! 🐙
/-- This (unnamed) corollary appears directly below Theorem A in the paper: For every `p ∈ (0, 1/2]` and any sequence `Bₙ` of `n × n` random matrices with mutually independent `Bernoulli(p)` entries we have that `P(Bₙ is singular) = (1 - p + oₙ(1))ⁿ`. -/ theorem declaration uses `sorry`corollary_1 {p : I} (hp₀ : 0 < p) (hp₁ : (p : ℝ) ≤ 1 / 2) {Ω : ℕ → Type*} [mΩ : ∀ n, MeasurableSpace (Ω n)] {P : (n : ℕ) → Measure (Ω n)} {B : (n : ℕ) → Ω n → Matrix (Fin n) (Fin n) ℝ} (B_indep : ∀ n, iIndepFun (fun x : Fin n × Fin n ↦ (B n · x.1 x.2)) (P n)) (B_bernoulli : ∀ n i j, HasLaw (B n · i j) (bernoulliMeasure 1 0 p) (P n)) : ∃ o : ℕ → ℝ, o =o[atTop] (1 : ℕ → ℝ) ∧ ∀ n > 0, (P n).real {ω | (B n ω).det = 0} = (1 - p + o n) ^ n := p:↑Ihp₀:0 < php₁:↑p ≤ 1 / 2Ω:ℕ → Type u_1mΩ:(n : ℕ) → MeasurableSpace (Ω n)P:(n : ℕ) → Measure (Ω n)B:(n : ℕ) → Ω n → Matrix (Fin n) (Fin n) ℝB_indep:∀ (n : ℕ), iIndepFun (fun x x_1 => B n x_1 x.1 x.2) (P n)B_bernoulli:∀ (n : ℕ) (i j : Fin n), HasLaw (fun x => B n x i j) Ber(1, 0, p) (P n)⊢ ∃ o, o =o[atTop] 1 ∧ ∀ n > 0, (P n).real {ω | (B n ω).det = 0} = (1 - ↑p + o n) ^ n All goals completed! 🐙
/-- This is the result stated in the paper's abstract: For any sequence `Mₙ` of `n × n` random matrices with mutually independent `Rademacher` entries we have that `P(Mₙ is singular) = (1/2 + oₙ(1))ⁿ`. -/ theorem declaration uses `sorry`corollary_2 {Ω : ℕ → Type*} (mΩ : ∀ n, MeasurableSpace (Ω n)) {P : (n : ℕ) → Measure (Ω n)} {M : (n : ℕ) → Ω n → Matrix (Fin n) (Fin n) ℝ} (M_indep : ∀ n, iIndepFun (fun x : Fin n × Fin n ↦ (M n · x.1 x.2)) (P n)) (M_rademacher : ∀ n i j, HasLaw (M n · i j) rademacherMeasure (P n)) : ∃ o : ℕ → ℝ, o =o[atTop] (1 : ℕ → ℝ) ∧ ∀ n > 0, (P n).real {ω | (M n ω).det = 0} = (1 / 2 + o n) ^ n := Ω:ℕ → Type u_1mΩ:(n : ℕ) → MeasurableSpace (Ω n)P:(n : ℕ) → Measure (Ω n)M:(n : ℕ) → Ω n → Matrix (Fin n) (Fin n) ℝM_indep:∀ (n : ℕ), iIndepFun (fun x x_1 => M n x_1 x.1 x.2) (P n)M_rademacher:∀ (n : ℕ) (i j : Fin n), HasLaw (fun x => M n x i j) rademacherMeasure (P n)⊢ ∃ o, o =o[atTop] 1 ∧ ∀ n > 0, (P n).real {ω | (M n ω).det = 0} = (1 / 2 + o n) ^ n All goals completed! 🐙
#81
The optimal paper Moebius band
annals_optimal_moebius

Lean theorem statement

/--
Statement of Theorem 1.1 (Main):

A smooth embedded paper Moebius band has aspect ratio greater than `√3`.
-/
theorem theorem_1_1 (a : ℝ) (ha : a > 0) (f : ℝ² → ℝ³) (hf : IsMoebiusEmbedding a f) :
    a > √3 := by
  sorry
#82
Cauchy–Kovalevskaya theorem
cauchy_kovalevskaya

Verso theorem preview

theorem declaration uses `sorry`cauchy_kovalevskaya {d : ℕ} (F : LeanEval.Analysis.E d × ℝ × ℝ → LeanEval.Analysis.E d) (f : LeanEval.Analysis.E d × ℝ × ℝ → ℝ) (u₀ : LeanEval.Analysis.E d → ℝ) (_hF : AnalyticOnNhd ℝ F univ) (_hf : AnalyticOnNhd ℝ f univ) (_hu₀ : AnalyticOnNhd ℝ u₀ univ) (x₀ : LeanEval.Analysis.E d) : ∃ (U : Set (LeanEval.Analysis.E d × ℝ)) (u : LeanEval.Analysis.E d × ℝ → ℝ), (x₀, (0 : ℝ)) ∈ U ∧ IsOpen U ∧ AnalyticOnNhd ℝ u U ∧ (∀ x : LeanEval.Analysis.E d, (x, (0 : ℝ)) ∈ U → u (x, 0) = u₀ x) ∧ (∀ p ∈ U, fderiv ℝ u p ((0 : LeanEval.Analysis.E d), (1 : ℝ)) = fderiv ℝ u p (F (p.1, p.2, u p), (0 : ℝ)) + f (p.1, p.2, u p)) ∧ (∀ v : LeanEval.Analysis.E d × ℝ → ℝ, AnalyticOnNhd ℝ v U → (∀ x : LeanEval.Analysis.E d, (x, (0 : ℝ)) ∈ U → v (x, 0) = u₀ x) → (∀ p ∈ U, fderiv ℝ v p ((0 : LeanEval.Analysis.E d), (1 : ℝ)) = fderiv ℝ v p (F (p.1, p.2, v p), (0 : ℝ)) + f (p.1, p.2, v p)) → ∀ p ∈ U, u p = v p) := d:ℕF:E d × ℝ × ℝ → E df:E d × ℝ × ℝ → ℝu₀:E d → ℝ_hF:AnalyticOnNhd ℝ F univ_hf:AnalyticOnNhd ℝ f univ_hu₀:AnalyticOnNhd ℝ u₀ univx₀:E d⊢ ∃ U u, (x₀, 0) ∈ U ∧ IsOpen U ∧ AnalyticOnNhd ℝ u U ∧ (∀ (x : E d), (x, 0) ∈ U → u (x, 0) = u₀ x) ∧ (∀ p ∈ U, (fderiv ℝ u p) (0, 1) = (fderiv ℝ u p) (F (p.1, p.2, u p), 0) + f (p.1, p.2, u p)) ∧ ∀ (v : E d × ℝ → ℝ), AnalyticOnNhd ℝ v U → (∀ (x : E d), (x, 0) ∈ U → v (x, 0) = u₀ x) → (∀ p ∈ U, (fderiv ℝ v p) (0, 1) = (fderiv ℝ v p) (F (p.1, p.2, v p), 0) + f (p.1, p.2, v p)) → ∀ p ∈ U, u p = v p All goals completed! 🐙
#83
Algebraic integers with conjugates in a prescribed distribution
annals_algebraic_integers

Verso theorem preview

theorem declaration uses `sorry`theorem_1_1 : lambda_SSS < 1.89831 := ⊢ lambda_SSS < 1.89831 All goals completed! 🐙
#84
Improved bounds for the sunflower lemma
annals_improved_bounds_sunflower_lemma

Lean theorem statement

/-- The absolute constant `C` in Theorem 1.4. Although not explicitly stated in the paper,
the constant `C` doesn't depend on `r`. -/
noncomputable def C : ℝ := sorry

/--
Statement of Theorem 1.4 (Main theorem, sunflowers):

Let `r ≥ 3`. For some constant `C`, any `w`-set system `F` of size
`|F| ≥ (C * r ^ 3 * log w * log log w) ^ w` contains an `r`-sunflower.

Note: We require `w ≥ 2`, as the paper assumes `log log w > 0`.
-/
theorem theorem_1_4 (r : ℕ) (hr : r ≥ 3) (X : Type*) [Finite X] (ℱ : Set (Set X)) (w : ℕ)
      (hw : w ≥ 2) (hℱ₁ : ℱ.IsSystem w) (hℱ₂ : ℱ.ncard ≥ lowerBound r C w) :
      ∃ S ⊆ ℱ, S.IsSunflower r := by
  sorry
#85
Rational approximations to linear subspaces
annals_linear_subspaces

Verso theorem preview

theorem declaration uses `sorry`theorem_1 (hd : 2 ≤ d) (l : ℕ) (hl0 : 0 < l) (hld : l < d) (k : ℕ) (hk1 : 1 ≤ k) (hkl : k ≤ l) : (∀ x : Submodule ℝ ℝᵈ, finrank ℝ x = l → LinearSubspaces.diophantineExponent k x ≥ d / (k * (d - l))) ∧ (∃ x : Submodule ℝ ℝᵈ, finrank ℝ x = l ∧ LinearSubspaces.diophantineExponent k x = d / (k * (d - l))) := d:ℕhd:2 ≤ dl:ℕhl0:0 < lhld:l < dk:ℕhk1:1 ≤ khkl:k ≤ l⊢ (∀ (x : Submodule ℝ ℝᵈ), finrank ℝ ↥x = l → diophantineExponent k x ≥ ↑d / (↑k * (↑d - ↑l))) ∧ ∃ x, finrank ℝ ↥x = l ∧ diophantineExponent k x = ↑d / (↑k * (↑d - ↑l)) All goals completed! 🐙
#86
Hessian estimates for the sigma-2 equation in dimension four
annals_hessian_estimates

Verso theorem preview

theorem declaration uses `sorry`theorem_1_1 : ∃ C : ℝ≥0∞ → ℝ, ∀ (u : ℝ⁴ → ℝ) (_smooth : ContDiffOn ℝ ∞ u B₁(0)) (_bounded : ‖u‖_C¹(B₁(0)) < (∞ : ℝ≥0∞)) (_positive_branch : ∀ x ∈ B₁(0), (Δ u) x > 0) (_solution : ∀ x ∈ B₁(0), σ₂ (H u B₁(0) x) = 1), ‖H u B₁(0) 0‖_F ≤ C (‖u‖_C¹(B₁(0))) := ⊢ ∃ C, ∀ (u : ℝ⁴ → ℝ), ContDiffOn ℝ ∞ u B₁(0) → ‖u‖_C¹(B₁(0)) < ∞ → (∀ x ∈ B₁(0), Δ u x > 0) → (∀ x ∈ B₁(0), σ₂ (H u B₁(0) x) = 1) → ‖H u B₁(0) 0‖_F ≤ C ‖u‖_C¹(B₁(0)) All goals completed! 🐙
#87
Kolmogorov–Arnold superposition theorem (non-universal Lorentz form)
kolmogorov_arnold_superposition

Lean theorem statement

/-- **Kolmogorov–Arnold superposition theorem (non-universal Lorentz
form).** For `n ≥ 1`, every continuous `f` on the unit cube `[0, 1]ⁿ`
admits a representation
`f(x) = ∑_{k=0}^{2n} g(∑_{l=1}^{n} φ_{k,l}(x_l))` with a single
continuous outer function `g : ℝ → ℝ` and continuous inner functions
`φ_{k,l} : ℝ → ℝ`. -/
theorem kolmogorov_arnold (n : ℕ) (_hn : 1 ≤ n)
    (f : (Fin n → ℝ) → ℝ) (_hf : ContinuousOn f (Set.Icc 0 1)) :
    ∃ (g : ℝ → ℝ) (φ : Fin (2 * n + 1) → Fin n → ℝ → ℝ),
      Continuous g ∧ (∀ k l, Continuous (φ k l)) ∧
      ∀ x ∈ Set.Icc (0 : Fin n → ℝ) 1,
        f x = ∑ k, g (∑ l, φ k l (x l)) := by
  sorry
#88
Sobolev embedding theorem (Morrey regime)
sobolev_embedding_morrey

Verso theorem preview

theorem declaration uses `sorry`sobolev_embedding {n k r : ℕ} {α p : ℝ} (_hp : (n : ℝ) < p) (_hα : 0 < α) (_hα1 : α ≤ 1) (_hgap : (r : ℝ) + α < (k : ℝ) - n / p) (f : LeanEval.Analysis.SobolevMorreyProblem.E n → ℝ) (_hf : LeanEval.Analysis.SobolevMorreyProblem.MemSobolevWk k (ENNReal.ofReal p) f) : ∃ g : LeanEval.Analysis.SobolevMorreyProblem.E n → ℝ, f =ᵐ[volume] g ∧ LeanEval.Analysis.SobolevMorreyProblem.MemHolder r α g := n:ℕk:ℕr:ℕα:ℝp:ℝ_hp:↑n < p_hα:0 < α_hα1:α ≤ 1_hgap:↑r + α < ↑k - ↑n / pf:E n → ℝ_hf:MemSobolevWk k (ENNReal.ofReal p) f⊢ ∃ g, f =ᵐ[volume] g ∧ LeanEval.Analysis.SobolevMorreyProblem.MemHolder r α g All goals completed! 🐙
#89
Fundamental theorem of topos theory
fundamental_topos_theory

Verso theorem preview

theorem declaration uses `sorry`fundamental_topos_theory {E : Type*} [Category E] (hE : LeanEval.ToposTheory.IsTopos E) (X : E) : LeanEval.ToposTheory.IsTopos (Over X) := E:Type u_1inst✝:Category.{u_2, u_1} EhE:IsTopos EX:E⊢ IsTopos (Over X) All goals completed! 🐙
#90
Wigner semicircle law
wigner_semicircle

Verso theorem preview

theorem declaration uses `sorry`wigner_semicircle {Ω : Type*} [MeasurableSpace Ω] (μ : Measure Ω) [IsProbabilityMeasure μ] (X : ℕ → ℕ → Ω → ℝ) (_hX_meas : ∀ i j, Measurable (X i j)) (_hX_indep : iIndepFun (fun ij : {p : ℕ × ℕ // p.1 ≤ p.2} => X ij.val.1 ij.val.2) μ) (_hX_iid : ∀ i j i' j', i ≤ j → i' ≤ j' → ProbabilityTheory.IdentDistrib (X i j) (X i' j') μ μ) (_hX_int : ∀ i j, i ≤ j → Integrable (X i j) μ) (_hX_sq_int : ∀ i j, i ≤ j → Integrable (fun ω => (X i j ω) ^ 2) μ) (_hX_mean : ∀ i j, i ≤ j → ∫ ω, X i j ω ∂μ = 0) (_hX_var : ∀ i j, i ≤ j → ∫ ω, (X i j ω) ^ 2 ∂μ = 1) : ∀ᵐ ω ∂μ, ∀ (f : ℝ → ℝ), Continuous f → (∃ M, ∀ x, ‖f x‖ ≤ M) → Tendsto (fun n : ℕ => ∫ x, f x ∂ (empiricalSpectralMeasureHerm (wignerMatrix_isHermitian X n ω)).map (fun x : ℝ => x / Real.sqrt n)) atTop (𝓝 (∫ x, f x ∂semicircleLaw)) := Ω:Type u_1inst✝¹:MeasurableSpace Ωμ:Measure Ωinst✝:IsProbabilityMeasure μX:ℕ → ℕ → Ω → ℝ_hX_meas:∀ (i j : ℕ), Measurable (X i j)_hX_indep:iIndepFun (fun ij => X (↑ij).1 (↑ij).2) μ_hX_iid:∀ (i j i' j' : ℕ), i ≤ j → i' ≤ j' → IdentDistrib (X i j) (X i' j') μ μ_hX_int:∀ (i j : ℕ), i ≤ j → Integrable (X i j) μ_hX_sq_int:∀ (i j : ℕ), i ≤ j → Integrable (fun ω => X i j ω ^ 2) μ_hX_mean:∀ (i j : ℕ), i ≤ j → ∫ (ω : Ω), X i j ω ∂μ = 0_hX_var:∀ (i j : ℕ), i ≤ j → ∫ (ω : Ω), X i j ω ^ 2 ∂μ = 1⊢ ∀ᵐ (ω : Ω) ∂μ, ∀ (f : ℝ → ℝ), Continuous f → (∃ M, ∀ (x : ℝ), ‖f x‖ ≤ M) → Tendsto (fun n => ∫ (x : ℝ), f x ∂Measure.map (fun x => x / √↑n) (empiricalSpectralMeasureHerm ⋯)) atTop (𝓝 (∫ (x : ℝ), f x ∂semicircleLaw)) All goals completed! 🐙
#91
General recursive equals Turing computable
turing_recursive_equiv

Lean theorem statement

/-- **General recursive = Turing computable** (total form). A total function
`f : ℕ → ℕ` is recursive (`Computable`, i.e. partial recursive as a partial
function) **iff** it is computed by some Turing machine (mathlib's `FinTM2`
model) under the standard binary encoding of `ℕ`. This is Knill's class
equality; the backward direction (TM-computable ⇒ recursive) is absent from
mathlib. -/
theorem turing_recursive_equiv (f : ℕ → ℕ) :
    Computable f ↔ Nonempty (TM2Computable encodeNat encodeNat f) := by
  sorry
#92
Brun's theorem (convergence of the twin-prime reciprocal sum)
brun_constant_converges

Lean theorem statement

/-- **Brun's theorem.** The reciprocal sum over twin-prime pairs converges. -/
theorem brun_constant_converges :
    Summable twinPrimeReciprocalTerm := by
  sorry
#93
Radial symmetry for positive semilinear Poisson solutions
semilinear_poisson_radial_symmetry

Verso theorem preview

theorem declaration uses `sorry`semilinear_poisson_radial_symmetry {n : ℕ} (hn : 0 < n) {f : ℝ → ℝ} (u : EuclideanSpace ℝ (Fin n) → ℝ) (hf_lipschitz : ∃ K : ℝ≥0, LipschitzWith K f) (hu_c2 : ContDiffOn ℝ 2 u (closedBall 0 1)) (hu_solve : LeanEval.Analysis.PDE.SolvesSemilinearPoisson f u) (hu_positive : ∀ x ∈ ball 0 1, 0 < u x) : ∃ v : ℝ → ℝ≥0, StrictAntiOn v (Set.Icc (0 : ℝ) 1) ∧ ∀ x ∈ closedBall 0 1, u x = v ‖x‖ := n:ℕhn:0 < nf:ℝ → ℝu:EuclideanSpace ℝ (Fin n) → ℝhf_lipschitz:∃ K, LipschitzWith K fhu_c2:ContDiffOn ℝ 2 u (closedBall 0 1)hu_solve:SolvesSemilinearPoisson f uhu_positive:∀ x ∈ ball 0 1, 0 < u x⊢ ∃ v, StrictAntiOn v (Set.Icc 0 1) ∧ ∀ x ∈ closedBall 0 1, u x = ↑(v ‖x‖) All goals completed! 🐙
#94
Strong Subadditivity of von Neumann Entropy
strong_subadditivity

Verso theorem preview

theorem declaration uses `sorry`strong_subadditivity (M_ABC : Matrix (A × B × C) (A × B × C) ℂ) (h : M_ABC.PosSemidef) : let M_AB : Matrix (A × B) (A × B) ℂ := .traceRight <| M_ABC.reindex (.symm <| .prodAssoc ..) (.symm <| .prodAssoc ..) let M_BC : Matrix (B × C) (B × C) ℂ := M_ABC.traceLeft let M_B : Matrix B B ℂ := M_BC.traceRight LeanEval.Physics.entropy M_ABC + LeanEval.Physics.entropy M_B ≤ LeanEval.Physics.entropy M_AB + LeanEval.Physics.entropy M_BC := A:Type u_1B:Type u_2C:Type u_3inst✝⁸:Fintype Ainst✝⁷:Fintype Binst✝⁶:Fintype Cinst✝⁵:DecidableEq Ainst✝⁴:DecidableEq Binst✝³:DecidableEq Cinst✝²:Nonempty Ainst✝¹:Nonempty Binst✝:Nonempty CM_ABC:Matrix (A × B × C) (A × B × C) ℂh:M_ABC.PosSemidef⊢ let M_AB := ((Matrix.reindex (Equiv.prodAssoc A B C).symm (Equiv.prodAssoc A B C).symm) M_ABC).traceRight; let M_BC := M_ABC.traceLeft; let M_B := M_BC.traceRight; entropy M_ABC + entropy M_B ≤ entropy M_AB + entropy M_BC All goals completed! 🐙
#95
No bounded projection from L^1 onto H^1
H1_not_closedComplemented

Verso theorem preview

theorem declaration uses `sorry`H1_not_closedComplemented : ¬ LeanEval.Analysis.H1.ClosedComplemented := ⊢ ¬H1.ClosedComplemented All goals completed! 🐙
#96
Anosov–Bowen shadowing lemma
anosov_bowen_shadowing

Lean theorem statement

/-- **Anosov–Bowen shadowing lemma** (Anosov 1967; Bowen 1975). Every
compact hyperbolic invariant set has the shadowing property. -/
theorem hyperbolic_has_shadowing
    (T : E d ≃ₜ E d) (K : Set (E d))
    (_hKc : IsCompact K) (_hK : IsHyperbolic T K) :
    HasShadowing (T : E d → E d) K := by
  sorry
#97
Poincaré–Siegel linearisation theorem
poincare_siegel_linearisation

Lean theorem statement

/-- **Poincaré–Siegel linearisation theorem.** If `α` is Diophantine,
`λ = e^{2πiα}`, and `f` is holomorphic near `0` with `f 0 = 0` and
`f'(0) = λ`, then there is a holomorphic germ `u` with `u 0 = 0`,
`u'(0) = 1`, and `f(u z) = u(λ z)` for `z` near `0`. -/
theorem poincare_siegel
    (α : ℝ) (_hα : IsDiophantine α)
    (lam : ℂ) (_hlam : lam = Complex.exp (2 * Real.pi * Complex.I * (α : ℂ)))
    (f : ℂ → ℂ) (_hf : AnalyticAt ℂ f 0) (_hf0 : f 0 = 0)
    (_hmult : deriv f 0 = lam) :
    ∃ u : ℂ → ℂ, AnalyticAt ℂ u 0 ∧ u 0 = 0 ∧ deriv u 0 = 1 ∧
      ∀ᶠ z in nhds (0 : ℂ), f (u z) = u (lam * z) := by
  sorry
#98
Riesz brothers' theorem
riesz_brothers_theorem

Lean theorem statement

/-- **Riesz brothers' theorem.** Let `μ` be a complex Borel measure on
the unit circle such that `∫ z^n dμ = 0` for every `n ≥ 1`. Then `μ` is
absolutely continuous with respect to Haar measure. The usual density
formulation follows by applying the Radon–Nikodym theorem to this conclusion;
the hypothesis transfers the Fourier-vanishing property to that density. This
corollary is not part of the formal statement here. -/
theorem riesz_brothers_theorem (μ : ComplexMeasure UnitAddCircle)
    (hμ : ∀ n : ℕ, 1 ≤ n → ∫ᵛ z, fourier n z ∂[ContinuousLinearMap.mul ℝ ℂ; μ] = 0) :
    μ ≪ᵥ AddCircle.haarAddCircle.toENNRealVectorMeasure := by
  sorry
#99
Gauss-Wantzel constructible regular polygon theorem
gauss_wantzel_constructible_polygon

Lean theorem statement

/-- **Gauss-Wantzel constructible polygon theorem** (§174): a regular `n`-gon
is straightedge-and-compass constructible exactly for the Gauss-Wantzel
integers. -/
theorem gauss_wantzel_constructible_polygon (n : ℕ) (hn : 3 ≤ n) :
    IsConstructible (Real.cos (2 * Real.pi / n)) ↔ GaussWantzelNumber n := by
  sorry
#100
Hurewicz theorem in degree 1 (H₁ = abelianization of π₁)
hurewicz_h1_abelianization

Lean theorem statement

/-- **Hurewicz (n = 1).** For a path-connected space `X`, `H₁(X;ℤ)` is the
abelianization of `π₁(X, x)`. -/
theorem hurewicz_h1_abelianization
    (X : Type) [TopologicalSpace X] [PathConnectedSpace X] (x : X) :
    Nonempty (Additive (Abelianization (FundamentalGroup X x)) ≃+
      (IntegralHomology 1 X : Type)) := by
  sorry
#101
Lax's approximation theorem for toral homeomorphisms
lax_approximation

Lean theorem statement

/-- **Lax's approximation theorem.** Every toral dynamical system on `𝕋^d`
(`d ≥ 1`) is approximated arbitrarily well in the metric `δ` by cyclic cube
exchange transformations. -/
theorem lax_approximation {d : ℕ} (hd : 0 < d) (T : ToralDynamicalSystem d)
    {ε : ℝ≥0∞} (hε : 0 < ε) :
    ∃ (n : ℕ) (S : VolumePreservingEquiv d),
      IsCyclicCubeExchange S n ∧ deltaDist T.toVolumePreservingEquiv S < ε := by
  sorry
#102
Radon transform: Fourier-slice diagonalization and pseudo-inversion
radon_transform_inversion

Verso theorem preview

theorem declaration uses `sorry`radon_can_be_diagonalized_and_pseudo_inverted : (∀ φ : SchwartzMap (ℝ × ℝ) ℂ, ∀ θ k : ℝ, fourier1 (fun p => radon (φ : ℝ × ℝ → ℂ) (p, θ)) k = fourier2 (φ : ℝ × ℝ → ℂ) (k * Real.cos θ, k * Real.sin θ)) ∧ (∃ Rinv : (ℝ × ℝ → ℂ) → (ℝ × ℝ → ℂ), ∀ φ : SchwartzMap (ℝ × ℝ) ℂ, Rinv (radon (φ : ℝ × ℝ → ℂ)) = (φ : ℝ × ℝ → ℂ)) := ⊢ (∀ (φ : SchwartzMap (ℝ × ℝ) ℂ) (θ k : ℝ), fourier1 (fun p => radon ⇑φ (p, θ)) k = fourier2 ⇑φ (k * Real.cos θ, k * Real.sin θ)) ∧ ∃ Rinv, ∀ (φ : SchwartzMap (ℝ × ℝ) ℂ), Rinv (radon ⇑φ) = ⇑φ All goals completed! 🐙
#103
The Landsberg–Schaar relation
landsberg_schaar

Verso theorem preview

theorem declaration uses `sorry`landsberg_schaar (p q : ℕ) (hp : Odd p) (hq : Odd q) : gaussS (2 * q : ℕ) p = Complex.exp ((Real.pi : ℂ) * Complex.I / 4) * gaussS (-(p : ℤ)) (2 * q) := p:ℕq:ℕhp:Odd phq:Odd q⊢ gaussS (↑(2 * q)) p = cexp (↑Real.pi * I / 4) * gaussS (-↑p) (2 * q) All goals completed! 🐙
#104
Ornstein–Weiss ℤᵈ Rokhlin lemma
ornstein_weiss_rokhlin

Verso theorem preview

theorem declaration uses `sorry`ornstein_weiss_rokhlin {Ω : Type*} [MeasurableSpace Ω] [StandardBorelSpace Ω] {d : ℕ} (_hd : 1 ≤ d) (μ : Measure Ω) [IsProbabilityMeasure μ] (T : (Fin d → ℤ) → Ω → Ω) (_hid : ∀ x, T 0 x = x) (_hT : ∀ v, MeasurePreserving (T v) μ μ) (_hgrp : ∀ u v x, T (u + v) x = T u (T v x)) (_hfree : LeanEval.Dynamics.IsFreeAction μ T) (N : ℕ) (_hN : 1 ≤ N) {ε : ENNReal} (_hε : 0 < ε) : ∃ B : Set Ω, MeasurableSet B ∧ ((boxShape d N : Finset (Fin d → ℤ)) : Set (Fin d → ℤ)).PairwiseDisjoint (fun v => T v '' B) ∧ μ (⋃ v ∈ boxShape d N, T v '' B) ≥ 1 - ε := Ω:Type u_1inst✝²:MeasurableSpace Ωinst✝¹:StandardBorelSpace Ωd:ℕ_hd:1 ≤ dμ:Measure Ωinst✝:IsProbabilityMeasure μT:(Fin d → ℤ) → Ω → Ω_hid:∀ (x : Ω), T 0 x = x_hT:∀ (v : Fin d → ℤ), MeasurePreserving (T v) μ μ_hgrp:∀ (u v : Fin d → ℤ) (x : Ω), T (u + v) x = T u (T v x)_hfree:IsFreeAction μ TN:ℕ_hN:1 ≤ Nε:ENNReal_hε:0 < ε⊢ ∃ B, MeasurableSet B ∧ ((↑(boxShape d N)).PairwiseDisjoint fun v => T v '' B) ∧ μ (⋃ v ∈ boxShape d N, T v '' B) ≥ 1 - ε All goals completed! 🐙
#105
Szemerédi's theorem
szemeredi

Verso theorem preview

theorem declaration uses `sorry`szemeredi (A : Set ℕ) (h : 0 < upperDensity A) : LeanEval.Combinatorics.ContainsArbitraryAPs A := A:Set ℕh:0 < upperDensity A⊢ ContainsArbitraryAPs A All goals completed! 🐙
#106
Liouville–Arnold theorem on integrable systems
liouville_arnold

Verso theorem preview

theorem declaration uses `sorry`liouville_arnold {n : ℕ} (F : Fin n → LeanEval.Geometry.LiouvilleArnold.E n → ℝ) (U : Set (LeanEval.Geometry.LiouvilleArnold.E n)) (_hU : IsOpen U) (_hLI : LeanEval.Geometry.LiouvilleArnold.IsLiouvilleIntegrable F U) (c : Fin n → ℝ) (_hMc_sub : LeanEval.Geometry.LiouvilleArnold.levelSet F c ⊆ U) (_hMc_compact : IsCompact (LeanEval.Geometry.LiouvilleArnold.levelSet F c)) (_hMc_connected : IsConnected (LeanEval.Geometry.LiouvilleArnold.levelSet F c)) : Nonempty ((LeanEval.Geometry.LiouvilleArnold.levelSet F c) ≃ₜ (Fin n → AddCircle (1 : ℝ))) := n:ℕF:Fin n → E n → ℝU:Set (E n)_hU:IsOpen U_hLI:IsLiouvilleIntegrable F Uc:Fin n → ℝ_hMc_sub:levelSet F c ⊆ U_hMc_compact:IsCompact (levelSet F c)_hMc_connected:IsConnected (levelSet F c)⊢ Nonempty (↑(levelSet F c) ≃ₜ (Fin n → AddCircle 1)) All goals completed! 🐙
#107
Halmos's generic weak-mixing theorem
halmos_generic_weak_mixing

Verso theorem preview

theorem declaration uses `sorry`generic_weakly_mixing [StandardBorelSpace X] (m : Measure X) [IsProbabilityMeasure m] [NullSingletonClass m] : (∃ G : Set (LeanEval.Dynamics.HalmosGenericWeakMixingProblem.Automorphism m), IsGδ G ∧ Dense G ∧ ∀ T ∈ G, LeanEval.Dynamics.HalmosGenericWeakMixingProblem.IsWeaklyMixing m T) ∧ (∀ T : LeanEval.Dynamics.HalmosGenericWeakMixingProblem.Automorphism m, LeanEval.Dynamics.HalmosGenericWeakMixingProblem.IsWeaklyMixing m T → Ergodic (T.toEquiv : X → X) m) := X:Type u_1inst✝³:MeasurableSpace Xinst✝²:StandardBorelSpace Xm:Measure Xinst✝¹:IsProbabilityMeasure minst✝:NullSingletonClass m⊢ (∃ G, IsGδ G ∧ Dense G ∧ ∀ T ∈ G, IsWeaklyMixing m T) ∧ ∀ (T : Automorphism m), IsWeaklyMixing m T → Ergodic (⇑T.toEquiv) m All goals completed! 🐙
#108
Hopf–Rinow theorem
hopf_rinow

Verso theorem preview

theorem declaration uses `sorry`hopf_rinow {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] {H : Type*} [TopologicalSpace H] (I : ModelWithCorners ℝ E H) [I.Boundaryless] (M : Type*) [EMetricSpace M] [ChartedSpace H M] [IsManifold I ∞ M] [Bundle.RiemannianBundle (fun x : M => TangentSpace I x)] [IsContMDiffRiemannianBundle I ∞ E (fun x : M => TangentSpace I x)] [IsContinuousRiemannianBundle E (fun x : M => TangentSpace I x)] [IsRiemannianManifold I M] [LocallyCompactSpace M] [ConnectedSpace M] : LeanEval.Geometry.IsGeodesicallyComplete M ↔ CompleteSpace M := E:Type u_1inst✝¹³:NormedAddCommGroup Einst✝¹²:NormedSpace ℝ Einst✝¹¹:FiniteDimensional ℝ EH:Type u_2inst✝¹⁰:TopologicalSpace HI:ModelWithCorners ℝ E Hinst✝⁹:I.BoundarylessM:Type u_3inst✝⁸:EMetricSpace Minst✝⁷:ChartedSpace H Minst✝⁶:IsManifold I ∞ Minst✝⁵:RiemannianBundle fun x => TangentSpace I xinst✝⁴:IsContMDiffRiemannianBundle I ∞ E fun x => TangentSpace I xinst✝³:IsContinuousRiemannianBundle E fun x => TangentSpace I xinst✝²:IsRiemannianManifold I Minst✝¹:LocallyCompactSpace Minst✝:ConnectedSpace M⊢ IsGeodesicallyComplete M ↔ CompleteSpace M All goals completed! 🐙
#109
Jordan curve theorem
jordan_curve

Verso theorem preview

theorem declaration uses `sorry`jordan_curve (r : Metric.sphere (0 : EuclideanSpace ℝ (Fin 2)) 1 → EuclideanSpace ℝ (Fin 2)) (_hcont : Continuous r) (_hinj : Function.Injective r) : Nat.card (ConnectedComponents ((Set.range r)ᶜ : Set (EuclideanSpace ℝ (Fin 2)))) = 2 := r:↑(Metric.sphere 0 1) → EuclideanSpace ℝ (Fin 2)_hcont:Continuous r_hinj:Function.Injective r⊢ Nat.card (ConnectedComponents ↑(Set.range r)ᶜ) = 2 All goals completed! 🐙
#110
Rademacher type and Enflo type coincide
annals_rademacher_enflo_type

Verso theorem preview

theorem declaration uses `sorry`theorem_1_1 (p : ℝ) (h1p : 1 ≤ p) (hp2 : p ≤ 2) : TR X p ≤ TE X p ∧ TE X p ≤ (pi / sqrt 2) * TR X p := X:Type u_2inst✝²:NormedAddCommGroup Xinst✝¹:NormedSpace ℝ Xinst✝:CompleteSpace Xp:ℝh1p:1 ≤ php2:p ≤ 2⊢ TR X p ≤ TE X p ∧ TE X p ≤ ↑pi / ↑(sqrt 2) * TR X p All goals completed! 🐙
#111
Equiangular lines with a fixed angle
annals_equiangular_lines_fixed_angle

Verso theorem preview

theorem declaration uses `sorry`theorem_1_2 (α : ℝ) (hα : α ∈ Set.Ioo 0 1) : let k := spectralRadiusOrder ((1 - α) / (2 * α)) (k < ⊤ → ∀ᶠ d in atTop, N α d = ⌊(k.toNat * (d - 1) : ℝ) / (k.toNat - 1 : ℝ)⌋₊) ∧ (k = ⊤ → ∃ e : ℕ → ℝ, e =o[atTop] (Nat.cast : ℕ → ℝ) ∧ ∀ d, N α d = d + e d) := α:ℝhα:α ∈ Set.Ioo 0 1⊢ let k := spectralRadiusOrder ((1 - α) / (2 * α)); (k < ⊤ → ∀ᶠ (d : ℕ) in atTop, N α d = ⌊↑k.toNat * (↑d - 1) / (↑k.toNat - 1)⌋₊) ∧ (k = ⊤ → ∃ e, e =o[atTop] Nat.cast ∧ ∀ (d : ℕ), ↑(N α d) = ↑d + e d) All goals completed! 🐙
#112
Thresholds versus fractional expectation-thresholds
annals_fractional_expectation_thresholds

Verso theorem preview

/-- The constant `K` in Theorem 1.1. -/ noncomputable def declaration uses `sorry`K : ℝ := sorry
/-- Statement of Theorem 1.1: There exists a universal constant `K` such that for any finite set `X` and any increasing collection of sets `𝓕` such that `l(𝓕)` is at least `2`, `p_c(𝓕) ≤ K * q_f(𝓕) * log l(𝓕)`. Note: The assumption that `l(𝓕)` is at least `2` is not explicitly in the paper but is needed because if `l(𝓕) = 1` then `Real.log (l 𝓕) = 0`, but `p_c 𝓕 ∈ (0,1)` (so the inequality clearly cannot hold). -/ theorem declaration uses `sorry`theorem_1_1 (X : Type*) [Fintype X] (𝓕 : Set (Set X)) (h𝓕 : IsUpperSet 𝓕) (hl𝓕 : 2 ≤ l 𝓕) : p_c 𝓕 ≤ K * q_f 𝓕 * Real.log (l 𝓕) := X:Type u_1inst✝:Fintype X𝓕:Set (Set X)h𝓕:IsUpperSet 𝓕hl𝓕:2 ≤ l 𝓕⊢ ↑(p_c 𝓕) ≤ K * ↑(q_f 𝓕) * Real.log ↑(l 𝓕) All goals completed! 🐙
#113
Wiener–Lévy theorem
wiener_levy_analytic_calculus

Lean theorem statement

/-- **Wiener–Lévy theorem.** If `φ` is complex-analytic on a neighbourhood of
the range of a Wiener-algebra function `f`, then the composed function
`φ ∘ f` is again in the Wiener algebra. -/
theorem wiener_levy_analytic_calculus (f : C(AddCircle T, ℂ))
    (φ : ℂ → ℂ) (U : Set ℂ) (hf : InWienerAlgebra f)
    (hU : IsOpen U) (hrange : range f ⊆ U)
    (hφ : AnalyticOnNhd ℂ φ U) :
    ∃ g : C(AddCircle T, ℂ),
      (∀ x, g x = φ (f x)) ∧ InWienerAlgebra g := by
  sorry
#114
Wiener's 1/f theorem
wiener_inverse_closed

Lean theorem statement

/-- **Wiener's `1/f` theorem.** If a function on the circle belongs to the
Wiener algebra and has no zero on the circle, then its pointwise reciprocal
again belongs to the Wiener algebra. -/
theorem wiener_inverse_closed (f : C(AddCircle T, ℂ))
    (hf : InWienerAlgebra f) (hzero : ∀ x, f x ≠ 0) :
    ∃ g : C(AddCircle T, ℂ),
      (∀ x, g x = (f x)⁻¹) ∧ InWienerAlgebra g := by
  sorry
#115
Fundamental theorem of Riemannian geometry (Levi-Civita)
levi_civita_exists_unique

Lean theorem statement

/-- **Fundamental theorem of Riemannian geometry** (Levi-Civita). On a
`C^∞` finite-dimensional Riemannian manifold there exists a smooth
torsion-free metric-compatible covariant derivative on `TM`, and any other
such connection agrees with it on smooth vector fields. -/
theorem levi_civita_exists_unique
    {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E]
      [FiniteDimensional ℝ E] [CompleteSpace E]
    {H : Type*} [TopologicalSpace H] {I : ModelWithCorners ℝ E H}
    {M : Type*} [TopologicalSpace M] [T2Space M] [ChartedSpace H M]
      [IsManifold I ∞ M]
    [RiemannianBundle (fun (x : M) ↦ TangentSpace I x)]
    [IsContMDiffRiemannianBundle I ∞ E (fun (x : M) ↦ TangentSpace I x)] :
    ∃ cov : CovariantDerivative I E (TangentSpace I (M := M)),
      (ContMDiffCovariantDerivative cov ∞ ∧
        cov.torsion = 0 ∧ IsMetricCompatible cov) ∧
      ∀ cov' : CovariantDerivative I E (TangentSpace I (M := M)),
        (ContMDiffCovariantDerivative cov' ∞ ∧
          cov'.torsion = 0 ∧ IsMetricCompatible cov') →
        SameOnSmooth cov cov' := by
  sorry
#116
Frobenius determinant theorem
frobenius_group_determinant

Verso theorem preview

theorem declaration uses `sorry`frobenius_group_determinant (G : Type*) [Group G] [Fintype G] [DecidableEq G] : ∃ (r : ℕ) (p : Fin r → MvPolynomial G ℂ), r = Nat.card (ConjClasses G) ∧ (∀ j, Irreducible (p j)) ∧ (∀ i j, i ≠ j → ¬ Associated (p i) (p j)) ∧ groupDeterminant G = ∏ j, (p j) ^ (p j).totalDegree := G:Type u_1inst✝²:Group Ginst✝¹:Fintype Ginst✝:DecidableEq G⊢ ∃ r p, r = Nat.card (ConjClasses G) ∧ (∀ (j : Fin r), Irreducible (p j)) ∧ (∀ (i j : Fin r), i ≠ j → ¬Associated (p i) (p j)) ∧ groupDeterminant G = ∏ j, p j ^ (p j).totalDegree All goals completed! 🐙
#117
Kirk's normal-structure fixed point theorem
kirk_normal_structure

Verso theorem preview

theorem declaration uses `sorry`kirk_normal_structure [CompleteSpace E] (hE_reflexive : Function.Surjective (NormedSpace.inclusionInDoubleDual ℝ E)) (K : Set E) (hK_nonempty : K.Nonempty) (hK_closed : IsClosed K) (hK_bounded : Bornology.IsBounded K) (hK_convex : Convex ℝ K) (hK_normal : LeanEval.Topology.KirkNormalStructure.HasNormalStructure K) (T : K → K) (hT : LeanEval.Topology.KirkNormalStructure.IsNonexpansiveSelfMap K T) : ∃ x : K, IsFixedPt T x := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:CompleteSpace EhE_reflexive:Surjective ⇑(NormedSpace.inclusionInDoubleDual ℝ E)K:Set EhK_nonempty:K.NonemptyhK_closed:IsClosed KhK_bounded:Bornology.IsBounded KhK_convex:Convex ℝ KhK_normal:HasNormalStructure KT:↑K → ↑KhT:IsNonexpansiveSelfMap K T⊢ ∃ x, IsFixedPt T x All goals completed! 🐙
#118
Nyquist–Shannon sampling theorem
nyquist_shannon_sampling

Verso theorem preview

theorem declaration uses `sorry`nyquist_shannon_sampling (f : 𝓢(ℝ, ℂ)) (hf : LeanEval.Analysis.NyquistShannon.FourierSupportedInNyquist f) : ∀ t : ℝ, Summable (fun n : ℤ ↦ f (n : ℝ) * sinc (Real.pi * ((n : ℝ) - t))) ∧ f t = ∑' n : ℤ, f (n : ℝ) * sinc (Real.pi * ((n : ℝ) - t)) := f:𝓢(ℝ, ℂ)hf:FourierSupportedInNyquist f⊢ ∀ (t : ℝ), (Summable fun n => f ↑n * sinc (Real.pi * (↑n - t))) ∧ f t = ∑' (n : ℤ), f ↑n * sinc (Real.pi * (↑n - t)) All goals completed! 🐙
#119
Lidskii's inequality
lidskii_inequality

Verso theorem preview

theorem declaration uses `sorry`lidskii_inequality {n : Type*} [Fintype n] [DecidableEq n] {A B : Matrix n n ℂ} (hA : A.IsHermitian) (hB : B.IsHermitian) {p : ℝ} (_hp : 1 ≤ p) : ∑ j, |hA.eigenvalues₀ j - hB.eigenvalues₀ j| ^ p ≤ ∑ j, |(hB.sub hA).eigenvalues₀ j| ^ p := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℂB:Matrix n n ℂhA:A.IsHermitianhB:B.IsHermitianp:ℝ_hp:1 ≤ p⊢ ∑ j, |hA.eigenvalues₀ j - hB.eigenvalues₀ j| ^ p ≤ ∑ j, |⋯.eigenvalues₀ j| ^ p All goals completed! 🐙
#120
Shannon capacity of the pentagon
shannon_capacity_pentagon

Lean theorem statement

/-- **Lovász's theorem on Shannon capacity of the pentagon** (§238).
The Shannon capacity of the five-cycle is `√5`. -/
theorem shannon_capacity_pentagon :
    HasShannonCapacity (SimpleGraph.cycleGraph 5) (Real.sqrt 5) := by
  sorry
#121
The Hausdorff–Hildebrandt–Schoenberg moment theorem
hausdorff_hildebrandt_schoenberg

Verso theorem preview

theorem declaration uses `sorry`hausdorff_hildebrandt_schoenberg {d : ℕ} (a : (Fin d → ℕ) → ℝ) : LeanEval.Analysis.IsMomentConfiguration a ↔ LeanEval.Analysis.HausdorffBounded a := d:ℕa:(Fin d → ℕ) → ℝ⊢ IsMomentConfiguration a ↔ HausdorffBounded a All goals completed! 🐙
#122
Frobenius's theorem: the Frobenius kernel is normal
frobenius_kernel_isNormal

Verso theorem preview

theorem declaration uses `sorry`frobenius_kernel_isNormal (G X : Type) [Group G] [Fintype G] [Fintype X] [MulAction G X] [FaithfulSMul G X] (hcard : 2 ≤ Fintype.card X) (htrans : ∀ x y : X, ∃ g : G, g • x = y) (hstab : ∀ x : X, MulAction.stabilizer G x ≠ ⊥) (hfrob : ∀ g : G, g ≠ 1 → ∀ x y : X, g • x = x → g • y = y → x = y) : ∃ N : Subgroup G, N.Normal ∧ (N : Set G) = {1} ∪ {g : G | ∀ x : X, g • x ≠ x} := G:TypeX:Typeinst✝⁴:Group Ginst✝³:Fintype Ginst✝²:Fintype Xinst✝¹:MulAction G Xinst✝:FaithfulSMul G Xhcard:2 ≤ Fintype.card Xhtrans:∀ (x y : X), ∃ g, g • x = yhstab:∀ (x : X), MulAction.stabilizer G x ≠ ⊥hfrob:∀ (g : G), g ≠ 1 → ∀ (x y : X), g • x = x → g • y = y → x = y⊢ ∃ N, N.Normal ∧ ↑N = {1} ∪ {g | ∀ (x : X), g • x ≠ x} All goals completed! 🐙
#123
The Lindemann–Weierstrass theorem
lindemann_weierstrass

Lean theorem statement

/-- **Lindemann–Weierstrass theorem.** If `x₁, …, xₙ ∈ ℂ` are algebraic over `ℚ`
and ℚ-linearly independent, then `e^{x₁}, …, e^{xₙ}` are algebraically
independent over `ℚ`. -/
theorem lindemann_weierstrass {n : ℕ} (x : Fin n → ℂ)
    (h_alg : ∀ i, IsAlgebraic ℚ (x i))
    (h_lin : LinearIndependent ℚ x) :
    AlgebraicIndependent ℚ (fun i => Complex.exp (x i)) := by
  sorry
#124
Local stable/unstable sets at a hyperbolic fixed point (set-level Hadamard–Perron)
stable_unstable_manifolds

Verso theorem preview

theorem declaration uses `sorry`stable_unstable_manifolds_exist (n : ℕ) (f : LeanEval.Dynamics.StableUnstableManifoldsProblem.E n → LeanEval.Dynamics.StableUnstableManifoldsProblem.E n) (x₀ : LeanEval.Dynamics.StableUnstableManifoldsProblem.E n) (_hf : ContDiffAt ℝ 1 f x₀) (_hfix : f x₀ = x₀) (_hhyp : LeanEval.Dynamics.StableUnstableManifoldsProblem.IsHyperbolicLinear (fderiv ℝ f x₀)) (_hf_inv : (fderiv ℝ f x₀).IsInvertible) : ∃ U : Set (LeanEval.Dynamics.StableUnstableManifoldsProblem.E n), IsOpen U ∧ x₀ ∈ U ∧ ∃ Ws Wu : Set (LeanEval.Dynamics.StableUnstableManifoldsProblem.E n), Ws = {x | (∀ k : ℕ, f^[k] x ∈ U) ∧ Tendsto (fun k => f^[k] x) atTop (𝓝 x₀)} ∧ Wu = {x | ∃ y : ℕ → LeanEval.Dynamics.StableUnstableManifoldsProblem.E n, y 0 = x ∧ (∀ k : ℕ, y k ∈ U) ∧ (∀ k : ℕ, f (y (k + 1)) = y k) ∧ Tendsto y atTop (𝓝 x₀)} ∧ Ws ∩ Wu = {x₀} := n:ℕf:E n → E nx₀:E n_hf:ContDiffAt ℝ 1 f x₀_hfix:f x₀ = x₀_hhyp:IsHyperbolicLinear (fderiv ℝ f x₀)_hf_inv:(fderiv ℝ f x₀).IsInvertible⊢ ∃ U, IsOpen U ∧ x₀ ∈ U ∧ ∃ Ws Wu, Ws = {x | (∀ (k : ℕ), f^[k] x ∈ U) ∧ Tendsto (fun k => f^[k] x) atTop (𝓝 x₀)} ∧ Wu = {x | ∃ y, y 0 = x ∧ (∀ (k : ℕ), y k ∈ U) ∧ (∀ (k : ℕ), f (y (k + 1)) = y k) ∧ Tendsto y atTop (𝓝 x₀)} ∧ Ws ∩ Wu = {x₀} All goals completed! 🐙
#125
Independence of the parallel postulate
parallel_postulate_independent

Verso theorem preview

theorem declaration uses `sorry`parallel_postulate_independent : (∃ (M : Type) (T : LeanEval.Geometry.TarskiAbsolute M), LeanEval.Geometry.Euclidean M T) ∧ (∃ (M : Type) (T : LeanEval.Geometry.TarskiAbsolute M), ¬ LeanEval.Geometry.Euclidean M T) := ⊢ (∃ M T, Euclidean M T) ∧ ∃ M T, ¬Euclidean M T All goals completed! 🐙
#126
Sard's regular-value corollary
regular_value_ae

Lean theorem statement

/-- **Regular value corollary (Sard).** For a smooth `f : ℝᵐ → ℝ`, almost every
`c ∈ ℝ` is a regular value. -/
theorem regular_value_ae {m : ℕ} (f : EuclideanSpace ℝ (Fin m) → ℝ)
    (hf : ContDiff ℝ ∞ f) :
    ∀ᵐ c ∂(volume : Measure ℝ), IsRegularValue f c := by
  sorry
#127
The Hausdorff positivity (complete-monotonicity) criterion
hausdorff_positivity_criterion

Lean theorem statement

/-- **Hausdorff positivity criterion** (Hausdorff 1921). A moment configuration
comes from a positive measure iff all its iterated backward differences are
nonnegative — i.e. the sequence is *completely monotone*: `(Δᵏa)ₙ ≥ 0` for all
`k ≤ n`. -/
theorem hausdorff_positivity {d : ℕ} (a : (Fin d → ℕ) → ℝ) :
    IsPositiveMomentConfiguration a ↔ ∀ k n : Fin d → ℕ, k ≤ n → 0 ≤ diff a k n := by
  sorry
#128
Lindemann's theorem (e and π transcendental)
lindemann

Lean theorem statement

/-- **Lindemann's theorem.** Both `e = exp 1` and `π` are transcendental over
`ℤ`. -/
theorem lindemann :
    Transcendental ℤ (Real.exp 1) ∧ Transcendental ℤ Real.pi := by
  sorry
#129
Pascal's theorem
pascal

Lean theorem statement

/-- **Pascal's theorem.** Six distinct points on a non-singular conic determine
three collinear intersection points `Aᵢ Bⱼ ∩ Aⱼ Bᵢ`. -/
theorem pascal
    (M : Matrix (Fin 3) (Fin 3) ℝ) (hMsymm : M.IsSymm) (hMdet : M.det ≠ 0)
    (a₁ a₂ a₃ b₁ b₂ b₃ : Fin 3 → ℝ)
    (ha₁ : a₁ ≠ 0) (ha₂ : a₂ ≠ 0) (ha₃ : a₃ ≠ 0)
    (hb₁ : b₁ ≠ 0) (hb₂ : b₂ ≠ 0) (hb₃ : b₃ ≠ 0)
    (hdist : [a₁, a₂, a₃, b₁, b₂, b₃].Pairwise (fun v w => ¬ SamePoint v w))
    (hA₁ : OnConic M a₁) (hA₂ : OnConic M a₂) (hA₃ : OnConic M a₃)
    (hB₁ : OnConic M b₁) (hB₂ : OnConic M b₂) (hB₃ : OnConic M b₃) :
    Collinear3 (meet a₁ b₂ a₂ b₁) (meet a₁ b₃ a₃ b₁) (meet a₂ b₃ a₃ b₂) := by
  sorry
#130
Tverberg's theorem
tverberg_theorem

Lean theorem statement

/-- **Tverberg's theorem.** Any `(r-1)(d+1)+1` points in `ℝ^d` admit an
`r`-part Tverberg partition. -/
theorem tverberg_theorem (d r : ℕ) (hr : 1 ≤ r)
    (f : Fin ((r - 1) * (d + 1) + 1) → Space d) :
    HasTverbergPartition (r := r) f := by
  sorry
#131
Boone–Higman theorem (easy direction)
boone_higman_embedding

Verso theorem preview

theorem declaration uses `sorry`boone_higman_embedding {G H K : Type*} [Group G] [Group H] [Group K] [IsSimpleGroup H] [Group.IsFinitelyPresented K] (f : G →* H) (hf : Function.Injective f) (g : H →* K) (hg : Function.Injective g) {n : ℕ} (φ : FreeGroup (Fin n) →* G) (hsurj : Function.Surjective φ) (hker : (MonoidHom.ker φ).IsFinitelyNormallyGenerated) : LeanEval.GroupTheory.BooneHigmanEmbedding.WordProblemSolvable φ := G:Type u_1H:Type u_2K:Type u_3inst✝⁴:Group Ginst✝³:Group Hinst✝²:Group Kinst✝¹:IsSimpleGroup Hinst✝:Group.IsFinitelyPresented Kf:G →* Hhf:Function.Injective ⇑fg:H →* Khg:Function.Injective ⇑gn:ℕφ:FreeGroup (Fin n) →* Ghsurj:Function.Surjective ⇑φhker:φ.ker.IsFinitelyNormallyGenerated⊢ WordProblemSolvable φ All goals completed! 🐙
#132
Chen theorem for Markoff graphs
dvd_card_connectedComponent_markoffGraph

Verso theorem preview

theorem declaration uses `sorry`dvd_card_connectedComponent_markoffGraph {p : ℕ} (hp : Nat.Prime p) (hgt : 3 < p) : ∀ c : (LeanEval.Combinatorics.markoffGraph p).ConnectedComponent, p ∣ Nat.card c := p:ℕhp:Nat.Prime phgt:3 < p⊢ ∀ (c : (markoffGraph p).ConnectedComponent), p ∣ Nat.card ↥c All goals completed! 🐙
#133
Fang–Xia: tiling of the symmetric group by transpositions implies λ-transitivity
fang_xia_tiling_partition_transitive

Verso theorem preview

theorem declaration uses `sorry`fang_xia_partition_transitive_of_tiling {n : ℕ} {Y : Set (Equiv.Perm (Fin n))} (_h : LeanEval.Combinatorics.FangXiaTilingProblem.IsTiling (LeanEval.Combinatorics.FangXiaTilingProblem.transpositionsWithOne n) Y) : ∀ lam : LeanEval.Combinatorics.FangXiaTilingProblem.PartitionShape n, 0 ≤ lam.contentSum → LeanEval.Combinatorics.FangXiaTilingProblem.IsPartitionTransitive Y lam := n:ℕY:Set (Equiv.Perm (Fin n))_h:IsTiling (transpositionsWithOne n) Y⊢ ∀ (lam : PartitionShape n), 0 ≤ lam.contentSum → IsPartitionTransitive Y lam All goals completed! 🐙
#134
Fraser: Fourier decay for finite-field Kakeya sets is q^{-1} and sharp
fraser_kakeya_fourier_decay

Verso theorem preview

theorem declaration uses `sorry`fraser_kakeya_fourier_decay_and_sharp {d : ℕ} (_hd : 2 ≤ d) {K : Set (LeanEval.Combinatorics.FraserKakeyaProblem.Space F d)} (_hK : LeanEval.Combinatorics.FraserKakeyaProblem.IsKakeya K) (χ : AddChar F ℂ) (_hχ : χ ≠ 1) : (∃ μ : LeanEval.Combinatorics.FraserKakeyaProblem.Space F d → ℝ, LeanEval.Combinatorics.FraserKakeyaProblem.IsProbabilityMeasureOn K μ ∧ ∀ ξ : LeanEval.Combinatorics.FraserKakeyaProblem.Space F d, ξ ≠ 0 → ‖fourier χ μ ξ‖ ≤ (Fintype.card F : ℝ)⁻¹) ∧ (∀ κ : ℝ, 0 < κ → κ < 1 → ∃ Q : ℕ, ∀ (F' : Type*) [Field F'] [Fintype F'] [DecidableEq F'], Q ≤ Fintype.card F' → ∃ K' : Set (LeanEval.Combinatorics.FraserKakeyaProblem.Space F' d), LeanEval.Combinatorics.FraserKakeyaProblem.IsKakeya K' ∧ ∀ μ : LeanEval.Combinatorics.FraserKakeyaProblem.Space F' d → ℝ, LeanEval.Combinatorics.FraserKakeyaProblem.IsProbabilityMeasureOn K' μ → ∃ ξ : LeanEval.Combinatorics.FraserKakeyaProblem.Space F' d, ξ ≠ 0 ∧ κ * (Fintype.card F' : ℝ)⁻¹ ≤ ‖fourier (AddChar.FiniteField.primitiveChar_to_Complex F') μ ξ‖) := F:Type u_1inst✝²:Field Finst✝¹:Fintype Finst✝:DecidableEq Fd:ℕ_hd:2 ≤ dK:Set (Space F d)_hK:IsKakeya Kχ:AddChar F ℂ_hχ:χ ≠ 1⊢ (∃ μ, IsProbabilityMeasureOn K μ ∧ ∀ (ξ : Space F d), ξ ≠ 0 → ‖LeanEval.Combinatorics.FraserKakeyaProblem.fourier χ μ ξ‖ ≤ (↑(Fintype.card F))⁻¹) ∧ ∀ (κ : ℝ), 0 < κ → κ < 1 → ∃ Q, ∀ (F' : Type u_2) [inst : Field F'] [inst_1 : Fintype F'] [DecidableEq F'], Q ≤ Fintype.card F' → ∃ K', IsKakeya K' ∧ ∀ (μ : Space F' d → ℝ), IsProbabilityMeasureOn K' μ → ∃ ξ, ξ ≠ 0 ∧ κ * (↑(Fintype.card F'))⁻¹ ≤ ‖LeanEval.Combinatorics.FraserKakeyaProblem.fourier (AddChar.FiniteField.primitiveChar_to_Complex F') μ ξ‖ All goals completed! 🐙
#135
Hausdorff moment problem: absolute-continuity criterion
hausdorff_absolute_continuity

Verso theorem preview

theorem declaration uses `sorry`hausdorff_absolute_continuity {d : ℕ} (μ : Measure (EuclideanSpace ℝ (Fin d))) [IsProbabilityMeasure μ] (hμ : μ ((LeanEval.Analysis.HausdorffAbsoluteContinuity.cube d)ᶜ) = 0) : LeanEval.Analysis.HausdorffAbsoluteContinuity.UniformlyAbsolutelyContinuous μ (volume.restrict (LeanEval.Analysis.HausdorffAbsoluteContinuity.cube d)) ↔ ∃ C : ℝ, ∀ k n : Fin d → ℕ, k ≤ n → diff (momentOf μ) k n ≤ C * diff (momentOf (volume.restrict (LeanEval.Analysis.HausdorffAbsoluteContinuity.cube d))) k n := d:ℕμ:Measure (EuclideanSpace ℝ (Fin d))inst✝:IsProbabilityMeasure μhμ:μ (cube d)ᶜ = 0⊢ UniformlyAbsolutelyContinuous μ (volume.restrict (cube d)) ↔ ∃ C, ∀ (k n : Fin d → ℕ), k ≤ n → diff (momentOf μ) k n ≤ C * diff (momentOf (volume.restrict (cube d))) k n All goals completed! 🐙
#136
Mountain Pass Theorem (Ambrosetti–Rabinowitz 1973)
mountain_pass

Verso theorem preview

theorem declaration uses `sorry`mountain_pass (f : E → ℝ) (_hf : ContDiff ℝ 1 f) (_hps : LeanEval.Analysis.MountainPassProblem.PalaisSmale f) {a b : E} {ε r : ℝ} (_hmr : LeanEval.Analysis.MountainPassProblem.MountainRange f a b ε r) : ∃ x : E, LeanEval.Analysis.MountainPassProblem.IsCriticalPoint f x ∧ f x = mountainPassLevel f a b ∧ ε ≤ mountainPassLevel f a b := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:CompleteSpace Ef:E → ℝ_hf:ContDiff ℝ 1 f_hps:PalaisSmale fa:Eb:Eε:ℝr:ℝ_hmr:MountainRange f a b ε r⊢ ∃ x, IsCriticalPoint f x ∧ f x = mountainPassLevel f a b ∧ ε ≤ mountainPassLevel f a b All goals completed! 🐙
#137
Choquet's representation theorem
choquet_representation_theorem

Verso theorem preview

theorem declaration uses `sorry`choquet [MeasurableSpace X] [BorelSpace X] (K : Set X) (hK_cpt : IsCompact K) (hK_cvx : Convex ℝ K) {x : X} (hx : x ∈ K) : ∃ μ : Measure X, IsProbabilityMeasure μ ∧ μ (K.extremePoints ℝ)ᶜ = 0 ∧ x = ∫ y, y ∂μ := X:Type u_1inst✝⁴:NormedAddCommGroup Xinst✝³:NormedSpace ℝ Xinst✝²:CompleteSpace Xinst✝¹:MeasurableSpace Xinst✝:BorelSpace XK:Set XhK_cpt:IsCompact KhK_cvx:Convex ℝ Kx:Xhx:x ∈ K⊢ ∃ μ, IsProbabilityMeasure μ ∧ μ (Set.extremePoints ℝ K)ᶜ = 0 ∧ x = ∫ (y : X), y ∂μ All goals completed! 🐙
#138
Rokhlin lemma
rokhlin_lemma

Lean theorem statement

/-- **Rokhlin lemma, not-necessarily-invertible forward-image form.** For every
aperiodic measure-preserving transformation `T` of a standard Borel probability
space `(Ω, μ)`, every height `n ≥ 1`, and every `ε > 0`, there is a measurable
base whose `n` forward-image floors `B, T B, …, T^{n−1} B` are pairwise
disjoint and whose union has outer measure at least `1 − ε`. No invertibility
assumption is made. -/
theorem rokhlin_lemma {Ω : Type*} [MeasurableSpace Ω]
    [StandardBorelSpace Ω]
    (μ : Measure Ω) [IsProbabilityMeasure μ] (T : Ω → Ω)
    (_hT : MeasurePreserving T μ μ) (_hap : IsAperiodic T μ)
    (n : ℕ) (_hn : 1 ≤ n) {ε : ENNReal} (_hε : 0 < ε) :
    ∃ B : Set Ω, IsRokhlinTower T B n ∧
      μ (towerUnion T B n) ≥ 1 - ε := by
  sorry
#139
Chudnovsky formula for pi inverse
chudnovsky_formula_for_pi_inv

Verso theorem preview

theorem declaration uses `sorry`chudnovsky_formula_for_pi_inv : chudnovskySum = π⁻¹ := ⊢ chudnovskySum = π⁻¹ All goals completed! 🐙
#140
Balanceable k-bounded partitions
balanceable_bounded_partitions

Lean theorem statement

/--
For any `k`, the smallest `n` such that any `k`-bounded partition of `n` is
also balanceable is given by `2 * lcm(1, ..., k)`.
-/
theorem minimal_balanceable_of_bounded (k : ℕ) (hk : 0 < k) :
    Minimal (fun n => 0 < n ∧ ∀ p : n.Partition, Bounded k p → Balanceable p) (2 * (Finset.Icc 1 k).lcm id) := by
  sorry
#141
Nash equilibrium existence theorem
nash_equilibrium_exists

Lean theorem statement

/-- **Nash equilibrium existence theorem.** Every finite `n`-player game
with nonempty finite pure-strategy sets and arbitrary real payoffs admits
at least one mixed-strategy Nash equilibrium. -/
theorem nash_equilibrium_exists {n : ℕ} {S : Fin n → Type*}
    [∀ i, Fintype (S i)] [∀ i, Nonempty (S i)]
    (u : Fin n → StrategyProfile n S → ℝ) :
    ∃ σ : ∀ i, S i → ℝ, IsNashEquilibrium u σ := by
  sorry
#142
A competition programming problem about permuting a permutation to be unimodal
permute_to_unimodal

Lean theorem statement

/--
`minRearrange` correctly computes the smallest number of indices that need to be permuted in order to
turn `arr` into a unimodal permutation.
-/
theorem minRearrange_correct {arr : Array Nat} :
    arr.Perm (1...=arr.size).toArray →
      (∃ (x : Array Nat) (hx : x.Perm (1...=arr.size).toArray), Unimodal x ∧ differences (Vector.mk x (by simpa using hx.size_eq)) arr.toVector = minRearrange arr) ∧
      (∀ (x : Array Nat) (hx : x.Perm (1...=arr.size).toArray), Unimodal x → minRearrange arr ≤ differences (Vector.mk x (by simpa using hx.size_eq)) arr.toVector) := by
  sorry
#143
Complete reducibility for compact groups
compact_group_semisimple

Verso theorem preview

theorem declaration uses `sorry`compact_group_semisimple {G V : Type*} [Group G] [TopologicalSpace G] [IsTopologicalGroup G] [CompactSpace G] [NormedAddCommGroup V] [NormedSpace ℝ V] [FiniteDimensional ℝ V] (ρ : Representation ℝ G V) (hρ : Continuous fun p : G × V => ρ p.1 p.2) : ρ.IsSemisimpleRepresentation := G:Type u_1V:Type u_2inst✝⁶:Group Ginst✝⁵:TopologicalSpace Ginst✝⁴:IsTopologicalGroup Ginst✝³:CompactSpace Ginst✝²:NormedAddCommGroup Vinst✝¹:NormedSpace ℝ Vinst✝:FiniteDimensional ℝ Vρ:Representation ℝ G Vhρ:Continuous fun p => (ρ p.1) p.2⊢ ρ.IsSemisimpleRepresentation All goals completed! 🐙
#144
Peano existence theorem for ODEs
peano_existence

Verso theorem preview

theorem declaration uses `sorry`peano_existence {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] {f : E → E} (hf : Continuous f) (x₀ : E) : ∃ a : ℝ, 0 < a ∧ ∃ α : ℝ → E, α 0 = x₀ ∧ ∀ t ∈ Ioo (-a) a, HasDerivAt α (f (α t)) t := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:FiniteDimensional ℝ Ef:E → Ehf:Continuous fx₀:E⊢ ∃ a, 0 < a ∧ ∃ α, α 0 = x₀ ∧ ∀ t ∈ Ioo (-a) a, HasDerivAt α (f (α t)) t All goals completed! 🐙
#145
Sard's theorem (critical-set image has measure zero)
sard_theorem

Verso theorem preview

theorem declaration uses `sorry`sard {m n : ℕ} (f : LeanEval.Geometry.SardTheoremProblem.E m → LeanEval.Geometry.SardTheoremProblem.E n) (_hf : ContDiff ℝ ∞ f) : volume (LeanEval.Geometry.SardTheoremProblem.criticalValues f) = 0 := m:ℕn:ℕf:E m → E n_hf:ContDiff ℝ ∞ f⊢ volume (criticalValues f) = 0 All goals completed! 🐙
#146
Baer–Suzuki theorem
baer_suzuki

Verso theorem preview

theorem declaration uses `sorry`baer_suzuki {G : Type*} [Group G] [Finite G] {p : ℕ} [Fact p.Prime] (x : G) : x ∈ LeanEval.GroupTheory.Defs.pCore p G ↔ ∀ g : G, IsPGroup p (Subgroup.closure ({x, g * x * g⁻¹} : Set G)) := G:Type u_1inst✝²:Group Ginst✝¹:Finite Gp:ℕinst✝:Fact (Nat.Prime p)x:G⊢ x ∈ pCore p G ↔ ∀ (g : G), IsPGroup p ↥(Subgroup.closure {x, g * x * g⁻¹}) All goals completed! 🐙
#147
Brauer–Fowler theorem
brauer_fowler

Lean theorem statement

/-- **Brauer–Fowler theorem.** There is a function bounding the order
of a finite nonabelian simple group by the order of any involution
centralizer. -/
theorem brauer_fowler :
    ∃ f : ℕ → ℕ, ∀ (G : Type) [Group G] [Finite G],
      IsSimpleGroup G → (∃ a b : G, a * b ≠ b * a) →
      ∀ t : G, orderOf t = 2 →
        Nat.card G ≤ f (Nat.card (Subgroup.centralizer ({t} : Set G))) := by
  sorry
#148
Monge–Kantorovich existence theorem
monge_kantorovich

Verso theorem preview

theorem declaration uses `sorry`monge_kantorovich_exists {X Y : Type*} [TopologicalSpace X] [PolishSpace X] [MeasurableSpace X] [BorelSpace X] [TopologicalSpace Y] [PolishSpace Y] [MeasurableSpace Y] [BorelSpace Y] (P : Measure X) (Q : Measure Y) [IsProbabilityMeasure P] [IsProbabilityMeasure Q] (c : X × Y → ENNReal) (_hc : Continuous c) : ∃ π ∈ LeanEval.Analysis.Couplings P Q, ∀ π' ∈ LeanEval.Analysis.Couplings P Q, kantorovichCost c π ≤ kantorovichCost c π' := X:Type u_1Y:Type u_2inst✝⁹:TopologicalSpace Xinst✝⁸:PolishSpace Xinst✝⁷:MeasurableSpace Xinst✝⁶:BorelSpace Xinst✝⁵:TopologicalSpace Yinst✝⁴:PolishSpace Yinst✝³:MeasurableSpace Yinst✝²:BorelSpace YP:Measure XQ:Measure Yinst✝¹:IsProbabilityMeasure Pinst✝:IsProbabilityMeasure Qc:X × Y → ENNReal_hc:Continuous c⊢ ∃ π ∈ Couplings P Q, ∀ π' ∈ Couplings P Q, kantorovichCost c π ≤ kantorovichCost c π' All goals completed! 🐙
#149
Sturm's theorem
sturm

Lean theorem statement

/-- **Sturm's theorem.** For a squarefree real polynomial `p` and an interval
`(a, b)` with `a < b` whose endpoints are not roots of `p`, the number of
distinct roots of `p` in `(a, b)` equals `σ(a) − σ(b)`. -/
theorem sturm (p : ℝ[X]) (hp : Squarefree p) {a b : ℝ} (hab : a < b)
    (ha : p.eval a ≠ 0) (hb : p.eval b ≠ 0) :
    ((p.roots.toFinset).filter (fun x => a < x ∧ x < b)).card =
      sigma p a - sigma p b := by
  sorry
#150
Hippocrates' theorem on lunes
hippocrates_lunes

Verso theorem preview

theorem declaration uses `sorry`hippocrates_lunes (a b : ℝ) (ha : 0 < a) (hb : 0 < b) : volume (LeanEval.Geometry.HippocratesLunes.horizontalLune a b) + volume (LeanEval.Geometry.HippocratesLunes.verticalLune a b) = volume (LeanEval.Geometry.HippocratesLunes.rightTriangle a b) := a:ℝb:ℝha:0 < ahb:0 < b⊢ volume (horizontalLune a b) + volume (verticalLune a b) = volume (rightTriangle a b) All goals completed! 🐙
#151
Furstenberg–Weiss topological multiple recurrence (single-transformation form)
furstenberg_topological

Lean theorem statement

/-- **Furstenberg–Weiss topological multiple recurrence** (single-
transformation form). Every homeomorphism `T` of a nonempty compact
metric space `X` has a multiply recurrent point. -/
theorem furstenberg_topological_recurrence {X : Type*} [MetricSpace X]
    [CompactSpace X] [Nonempty X] (T : X ≃ₜ X) :
    ∃ x : X, IsMultiplyRecurrent (T : X → X) x := by
  sorry
#152
Jordan normal form
jordan_normal_form

Lean theorem statement

/-- **Jordan normal form.** Over an algebraically closed field, every
endomorphism of `Kⁿ` admits a Jordan-chain basis. -/
theorem jordan_normal_form {K : Type*} [Field K] [IsAlgClosed K] (n : ℕ)
    (f : Module.End K (StdSpace K n)) :
    Nonempty (JordanChainBasis f) := by
  sorry
#153
Kakutani fixed-point theorem
kakutani_fixed_point

Lean theorem statement

/-- **Kakutani fixed-point theorem.** Every upper-hemicontinuous
correspondence `F` from a nonempty compact convex `K ⊆ ℝᵈ` to itself, with
nonempty convex closed values, has a fixed point `x ∈ F x`. -/
theorem kakutani_fixed_point {d : ℕ}
    {K : Set (EuclideanSpace ℝ (Fin d))}
    (_hK_compact : IsCompact K) (_hK_convex : Convex ℝ K)
    (_hK_nonempty : K.Nonempty)
    (F : EuclideanSpace ℝ (Fin d) → Set (EuclideanSpace ℝ (Fin d)))
    (_hF_uhc : IsUpperHemicontinuous F)
    (_hF_nonempty : ∀ x ∈ K, (F x).Nonempty)
    (_hF_convex : ∀ x ∈ K, Convex ℝ (F x))
    (_hF_closed : ∀ x ∈ K, IsClosed (F x))
    (_hF_maps : ∀ x ∈ K, F x ⊆ K) :
    ∃ x ∈ K, x ∈ F x := by
  sorry
#154
Lidskii–Last eigenvalue-perturbation theorem
lidskii_last

Verso theorem preview

theorem declaration uses `sorry`lidskii_last {n : Type*} [Fintype n] [DecidableEq n] {A B : Matrix n n ℂ} (hA : A.IsHermitian) (hB : B.IsHermitian) : ∑ j, |hA.eigenvalues₀ j - hB.eigenvalues₀ j| ≤ ∑ i, ∑ j, ‖A i j - B i j‖ := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℂB:Matrix n n ℂhA:A.IsHermitianhB:B.IsHermitian⊢ ∑ j, |hA.eigenvalues₀ j - hB.eigenvalues₀ j| ≤ ∑ i, ∑ j, ‖A i j - B i j‖ All goals completed! 🐙
#155
Solvable extensions ↔ solvable groups (the missing converse in Abel–Ruffini)
solvable_by_radicals_converse

Lean theorem statement

/-- **Solvable extensions ↔ solvable groups.** For a field `F` of
characteristic zero and a nonzero `p : F[X]`, every root of `p` in
`AlgebraicClosure F` lies in `solvableByRad F (AlgebraicClosure F)`
iff `p.Gal` is solvable. -/
theorem solvable_iff_solvableByRad (F : Type*) [Field F] [CharZero F]
    (p : F[X]) (_hp : p ≠ 0) :
    (∀ x : AlgebraicClosure F, aeval x p = 0 →
        x ∈ solvableByRad F (AlgebraicClosure F)) ↔ Group.IsSolvable p.Gal := by
  sorry
#156
Schur-Weyl duality: S_k image equals centralizer of GL(V) image
symAction_range_eq_centralizer_glAction

Verso theorem preview

theorem declaration uses `sorry`symAction_range_eq_centralizer_glAction {R : Type*} [Field R] {M : Type*} [AddCommGroup M] [Module R M] [FiniteDimensional R M] {k : ℕ} [Invertible (k.factorial : R)] : Algebra.adjoin R (Set.range (LeanEval.RepresentationTheory.symAction R M k)) = Subalgebra.centralizer R (Set.range (LeanEval.RepresentationTheory.glAction R M k)) := R:Type u_1inst✝⁴:Field RM:Type u_2inst✝³:AddCommGroup Minst✝²:Module R Minst✝¹:FiniteDimensional R Mk:ℕinst✝:Invertible ↑k.factorial⊢ Algebra.adjoin R (Set.range ⇑(symAction R M k)) = Subalgebra.centralizer R (Set.range ⇑(glAction R M k)) All goals completed! 🐙
#157
Dimitrov's lower bound for the house of a nonzero algebraic integer that is not a root of unity
dimitrov

Verso theorem preview

theorem declaration uses `sorry`dimitrov {K : Type*} [Field K] [NumberField K] (α : K) (α_int : IsIntegral ℤ α) (α_ne_zero : α ≠ 0) (α_not_rootOfUnity : ¬ IsOfFinOrder α) : (2 : ℝ) ^ (1 / (4 * (Finset.univ.image fun σ : K →+* ℂ ↦ (σ α).arg).card) : ℝ) ≤ NumberField.house α := K:Type u_1inst✝¹:Field Kinst✝:NumberField Kα:Kα_int:IsIntegral ℤ αα_ne_zero:α ≠ 0α_not_rootOfUnity:¬IsOfFinOrder α⊢ 2 ^ (1 / (4 * ↑(Finset.image (fun σ => (σ α).arg) Finset.univ).card)) ≤ NumberField.house α All goals completed! 🐙
#158
Existence of a non-isotopic pair of oriented two-component links
exists_nonisotopic_link

Verso theorem preview

theorem declaration uses `sorry`exists_nonisotopic_link : ∃ L₁ L₂ : LeanEval.KnotTheory.TwoLink, ¬ L₁.Isotopic L₂ := ⊢ ∃ L₁ L₂, ¬L₁.Isotopic L₂ All goals completed! 🐙
#159
Normal spectral theorem
normal_spectral_theorem

Verso theorem preview

theorem declaration uses `sorry`normal_spectral_theorem (A : Matrix n n ℂ) : IsStarNormal A ↔ ∃ U ∈ unitary (Matrix n n ℂ), ∃ d : n → ℂ, A = U * diagonal d * star U := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℂ⊢ IsStarNormal A ↔ ∃ U ∈ unitary (Matrix n n ℂ), ∃ d, A = U * diagonal d * star U All goals completed! 🐙
#160
Runge's theorem
runge_theorem

Verso theorem preview

theorem declaration uses `sorry`runge (K : Set ℂ) (_hK : IsCompact K) (U : Set ℂ) (_hU : IsOpen U) (_hKU : K ⊆ U) (f : ℂ → ℂ) (_hf : AnalyticOnNhd ℂ f U) (ε : ℝ) (_hε : 0 < ε) : ∃ p q : ℂ[X], (∀ z ∈ K, q.eval z ≠ 0) ∧ (∀ z ∈ K, ‖f z - p.eval z / q.eval z‖ < ε) := K:Set ℂ_hK:IsCompact KU:Set ℂ_hU:IsOpen U_hKU:K ⊆ Uf:ℂ → ℂ_hf:AnalyticOnNhd ℂ f Uε:ℝ_hε:0 < ε⊢ ∃ p q, (∀ z ∈ K, Polynomial.eval z q ≠ 0) ∧ ∀ z ∈ K, ‖f z - Polynomial.eval z p / Polynomial.eval z q‖ < ε All goals completed! 🐙
#161
Pointwise and Cesàro convergence of Fourier series (Dirichlet, Fejér)
fourier_dirichlet_fejer

Verso theorem preview

/-- **Dirichlet's pointwise convergence theorem** (§46). For every `C¹` 2π-periodic complex function `f`, the symmetric Fourier partial sums `S_N(f)(x)` converge to `f(x)` at every point `x ∈ ℝ`. -/ theorem declaration uses `sorry`dirichlet_pointwise {f : ℝ → ℂ} (_hperiod : Function.Periodic f (2 * Real.pi)) (_hC1 : ContDiff ℝ 1 f) (x : ℝ) : Tendsto (fun N : ℕ => fourierPartialSum f N x) atTop (𝓝 (f x)) := f:ℝ → ℂ_hperiod:Function.Periodic f (2 * Real.pi)_hC1:ContDiff ℝ 1 fx:ℝ⊢ Tendsto (fun N => fourierPartialSum f N x) atTop (𝓝 (f x)) All goals completed! 🐙
/-- **Fejér's theorem** (§46). For every *continuous* 2π-periodic complex function `f` — without the `C¹` hypothesis of Dirichlet's theorem — the Cesàro means `σ_N(f)` of the symmetric Fourier partial sums converge to `f` uniformly on `ℝ`. -/ theorem declaration uses `sorry`fejer {f : ℝ → ℂ} (_hperiod : Function.Periodic f (2 * Real.pi)) (_hcont : Continuous f) : TendstoUniformly (fun N : ℕ => fourierCesaroMean f N) f atTop := f:ℝ → ℂ_hperiod:Function.Periodic f (2 * Real.pi)_hcont:Continuous f⊢ TendstoUniformly (fun N => fourierCesaroMean f N) f atTop All goals completed! 🐙
#162
Schur-Weyl duality: GL(V) image equals centralizer of S_k image
glAction_range_eq_centralizer_symAction

Verso theorem preview

theorem declaration uses `sorry`glAction_range_eq_centralizer_symAction {R : Type*} [Field R] {M : Type*} [AddCommGroup M] [Module R M] [FiniteDimensional R M] {k : ℕ} [Invertible (k.factorial : R)] : Algebra.adjoin R (Set.range (LeanEval.RepresentationTheory.glAction R M k)) = Subalgebra.centralizer R (Set.range (LeanEval.RepresentationTheory.symAction R M k)) := R:Type u_1inst✝⁴:Field RM:Type u_2inst✝³:AddCommGroup Minst✝²:Module R Minst✝¹:FiniteDimensional R Mk:ℕinst✝:Invertible ↑k.factorial⊢ Algebra.adjoin R (Set.range ⇑(glAction R M k)) = Subalgebra.centralizer R (Set.range ⇑(symAction R M k)) All goals completed! 🐙
#163
Burnside p^a q^b theorem
finite_group_isSolvable_of_card_eq_prime_pow_mul_prime_pow

Verso theorem preview

theorem declaration uses `sorry`finite_group_isSolvable_of_card_eq_prime_pow_mul_prime_pow {G : Type*} [Group G] [Fintype G] {p q a b : ℕ} (hp : Nat.Prime p) (hq : Nat.Prime q) (hpq : p ≠ q) (hcard : Fintype.card G = p ^ a * q ^ b) : Group.IsSolvable G := G:Type u_1inst✝¹:Group Ginst✝:Fintype Gp:ℕq:ℕa:ℕb:ℕhp:Nat.Prime phq:Nat.Prime qhpq:p ≠ qhcard:Fintype.card G = p ^ a * q ^ b⊢ Group.IsSolvable G All goals completed! 🐙
#164
Schauder fixed-point theorem
schauder_fixed_point

Verso theorem preview

theorem declaration uses `sorry`schauder_fixed_point {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [CompleteSpace E] {K : Set E} (_hK_compact : IsCompact K) (_hK_convex : Convex ℝ K) (_hK_nonempty : K.Nonempty) (f : E → E) (_hf_cont : ContinuousOn f K) (_hf_maps : Set.MapsTo f K K) : ∃ x ∈ K, f x = x := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:CompleteSpace EK:Set E_hK_compact:IsCompact K_hK_convex:Convex ℝ K_hK_nonempty:K.Nonemptyf:E → E_hf_cont:ContinuousOn f K_hf_maps:Set.MapsTo f K K⊢ ∃ x ∈ K, f x = x All goals completed! 🐙
#165
Bauer's uniqueness at extreme points
bauer_extreme_point_uniqueness

Verso theorem preview

theorem declaration uses `sorry`bauer_unique [MeasurableSpace X] [BorelSpace X] (K : Set X) (hK_cpt : IsCompact K) (hK_cvx : Convex ℝ K) {x : X} (hx : x ∈ K.extremePoints ℝ) (μ : Measure X) [IsProbabilityMeasure μ] (hμ : μ Kᶜ = 0) (hbar : x = ∫ y, y ∂μ) : μ = Measure.dirac x := X:Type u_1inst✝⁵:NormedAddCommGroup Xinst✝⁴:NormedSpace ℝ Xinst✝³:CompleteSpace Xinst✝²:MeasurableSpace Xinst✝¹:BorelSpace XK:Set XhK_cpt:IsCompact KhK_cvx:Convex ℝ Kx:Xhx:x ∈ Set.extremePoints ℝ Kμ:Measure Xinst✝:IsProbabilityMeasure μhμ:μ Kᶜ = 0hbar:x = ∫ (y : X), y ∂μ⊢ μ = Measure.dirac x All goals completed! 🐙
#166
Euler–Lagrange equation
euler_lagrange_equation

Verso theorem preview

theorem declaration uses `sorry`euler_lagrange_equation {a b : ℝ} (L : ℝ → ℝ → ℝ → ℝ) (x : ℝ → ℝ) (_hab : a < b) (_hL : ContDiff ℝ 2 (fun p : ℝ × ℝ × ℝ => L p.1 p.2.1 p.2.2)) (_hx : ContDiff ℝ 2 x) (_hxe : LeanEval.Analysis.IsVariationalExtremum a b L x) : ∀ t ∈ Set.Ioo a b, lagrangianPartialX L x t = deriv (lagrangianPartialV L x) t := a:ℝb:ℝL:ℝ → ℝ → ℝ → ℝx:ℝ → ℝ_hab:a < b_hL:ContDiff ℝ 2 fun p => L p.1 p.2.1 p.2.2_hx:ContDiff ℝ 2 x_hxe:IsVariationalExtremum a b L x⊢ ∀ t ∈ Ioo a b, lagrangianPartialX L x t = deriv (lagrangianPartialV L x) t All goals completed! 🐙
#167
Kuznetsov's theorem: finitely presented simple groups have solvable word problem
boone_higman_simple

Verso theorem preview

theorem declaration uses `sorry`boone_higman_simple {G : Type*} [Group G] [IsSimpleGroup G] {n : ℕ} (φ : FreeGroup (Fin n) →* G) (_hsurj : Function.Surjective φ) (_hker : (MonoidHom.ker φ).IsFinitelyNormallyGenerated) : LeanEval.GroupTheory.BooneHigmanSimpleProblem.WordProblemSolvable φ := G:Type u_1inst✝¹:Group Ginst✝:IsSimpleGroup Gn:ℕφ:FreeGroup (Fin n) →* G_hsurj:Function.Surjective ⇑φ_hker:φ.ker.IsFinitelyNormallyGenerated⊢ WordProblemSolvable φ All goals completed! 🐙
#168
Morley's trisector theorem
morley_theorem

Verso theorem preview

theorem declaration uses `sorry`morley_theorem (A B C P Q R : LeanEval.Geometry.Morley.Plane) (h : LeanEval.Geometry.Morley.IsMorleyConfiguration A B C P Q R) : LeanEval.Geometry.Morley.IsEquilateralTriple P Q R := A:PlaneB:PlaneC:PlaneP:PlaneQ:PlaneR:Planeh:IsMorleyConfiguration A B C P Q R⊢ IsEquilateralTriple P Q R All goals completed! 🐙
#169
Riesz's rising sun lemma
rising_sun_lemma

Verso theorem preview

theorem declaration uses `sorry`rising_sun_lemma {a b : ℝ} (hab : a < b) {f : ℝ → ℝ} (hf : ContinuousOn f (Icc a b)) : LeanEval.Analysis.RisingSun.HasRisingSunProperty a b f := a:ℝb:ℝhab:a < bf:ℝ → ℝhf:ContinuousOn f (Icc a b)⊢ HasRisingSunProperty a b f All goals completed! 🐙
#170
Trace Cayley-Hamilton / Newton identity
trace_cayley_hamilton_newton

Verso theorem preview

theorem declaration uses `sorry`trace_cayley_hamilton_newton {R : Type*} [CommRing R] (A : Matrix n n R) {k : ℕ} (hk : 1 ≤ k) : (k : R) * charpolyDescendingCoeff A k + ∑ j ∈ Finset.Icc 1 k, trace (A ^ j) * charpolyDescendingCoeff A (k - j) = 0 := n:Type u_1inst✝²:Fintype ninst✝¹:DecidableEq nR:Type u_2inst✝:CommRing RA:Matrix n n Rk:ℕhk:1 ≤ k⊢ ↑k * charpolyDescendingCoeff A k + ∑ j ∈ Finset.Icc 1 k, (A ^ j).trace * charpolyDescendingCoeff A (k - j) = 0 All goals completed! 🐙
#171
Bing's house with two rooms is contractible
contractibleSpace_houseWithTwoRooms

Verso theorem preview

theorem declaration uses `sorry`contractibleSpace_houseWithTwoRooms : ContractibleSpace LeanEval.Topology.HouseWithTwoRooms := ⊢ ContractibleSpace ↑HouseWithTwoRooms All goals completed! 🐙
#172
Brouwer fixed-point theorem
brouwer_fixed_point

Verso theorem preview

theorem declaration uses `sorry`brouwer_fixed_point {d : ℕ} {K : Set (EuclideanSpace ℝ (Fin d))} (_hK_compact : IsCompact K) (_hK_convex : Convex ℝ K) (_hK_nonempty : K.Nonempty) (f : EuclideanSpace ℝ (Fin d) → EuclideanSpace ℝ (Fin d)) (_hf_cont : ContinuousOn f K) (_hf_maps : MapsTo f K K) : ∃ x ∈ K, f x = x := d:ℕK:Set (EuclideanSpace ℝ (Fin d))_hK_compact:IsCompact K_hK_convex:Convex ℝ K_hK_nonempty:K.Nonemptyf:EuclideanSpace ℝ (Fin d) → EuclideanSpace ℝ (Fin d)_hf_cont:ContinuousOn f K_hf_maps:MapsTo f K K⊢ ∃ x ∈ K, f x = x All goals completed! 🐙
#173
von Neumann double commutant theorem
vonNeumann_doubleCommutant_tfae

Verso theorem preview

theorem declaration uses `sorry`vonNeumann_doubleCommutant_tfae {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H] (S : StarSubalgebra ℂ (H →L[ℂ] H)) : List.TFAE [ Set.centralizer (Set.centralizer (S : Set (H →L[ℂ] H))) = S , IsClosed (ContinuousLinearMapWOT.ofCLM '' (S : Set (H →L[ℂ] H))) , IsClosed (ContinuousLinearMap.toPointwiseConvergenceCLM ℂ (RingHom.id ℂ) H H '' (S : Set (H →L[ℂ] H))) ] := H:Type u_1inst✝²:NormedAddCommGroup Hinst✝¹:InnerProductSpace ℂ Hinst✝:CompleteSpace HS:StarSubalgebra ℂ (H →L[ℂ] H)⊢ [(↑S).centralizer.centralizer = ↑S, IsClosed (ContinuousLinearMapWOT.ofCLM '' ↑S), IsClosed (⇑(ContinuousLinearMap.toPointwiseConvergenceCLM ℂ (RingHom.id ℂ) H H) '' ↑S)].TFAE All goals completed! 🐙
#174
Abel–Ruffini theorem
abel_ruffini

Verso theorem preview

theorem declaration uses `sorry`abel_ruffini (n : ℕ) (_hn : 1 ≤ n) : (∀ p : ℚ[X], p.natDegree = n → ∀ x : ℂ, aeval x p = 0 → x ∈ solvableByRad ℚ ℂ) ↔ n ≤ 4 := n:ℕ_hn:1 ≤ n⊢ (∀ (p : ℚ[X]), p.natDegree = n → ∀ (x : ℂ), (aeval x) p = 0 → x ∈ solvableByRad ℚ ℂ) ↔ n ≤ 4 All goals completed! 🐙
#175
Wiener's atom-detection formula
wiener_atom_detection

Verso theorem preview

theorem declaration uses `sorry`wiener_atom_detection (μ : Measure (AddCircle (2 * Real.pi))) [IsProbabilityMeasure μ] : Tendsto (fun N : ℕ => (1 / (N : ℝ)) * ∑ k ∈ Finset.Icc (1 : ℤ) N, ‖fourierCoeffMeasure μ k‖ ^ 2) atTop (𝓝 (∑' x : AddCircle (2 * Real.pi), ((μ {x}).toReal) ^ 2)) := μ:Measure (AddCircle (2 * π))inst✝:IsProbabilityMeasure μ⊢ Tendsto (fun N => 1 / ↑N * ∑ k ∈ Finset.Icc 1 ↑N, ‖fourierCoeffMeasure μ k‖ ^ 2) atTop (𝓝 (∑' (x : AddCircle (2 * π)), (μ {x}).toReal ^ 2)) All goals completed! 🐙
#176
Real cyclotomic integer with house at most 2
cyclotomic_integer_house_le_two

Verso theorem preview

theorem declaration uses `sorry`cyclotomic_integer_house_le_two {K : Type*} [Field K] [NumberField K] [Algebra ℚ K] (n : ℕ) [NeZero n] [IsCyclotomicExtension {n} ℚ K] {β : K} (hβ_int : IsIntegral ℤ β) (hβ_real : β ∈ NumberField.maximalRealSubfield K) : house β ≤ 2 → house β = 2 ∨ ∃ m : ℕ, 0 < m ∧ house β = 2 * Real.cos (Real.pi / m) := K:Type u_1inst✝⁴:Field Kinst✝³:NumberField Kinst✝²:Algebra ℚ Kn:ℕinst✝¹:NeZero ninst✝:IsCyclotomicExtension {n} ℚ Kβ:Khβ_int:IsIntegral ℤ βhβ_real:β ∈ maximalRealSubfield K⊢ house β ≤ 2 → house β = 2 ∨ ∃ m, 0 < m ∧ house β = 2 * Real.cos (Real.pi / ↑m) All goals completed! 🐙
#177
Linear ODE with negative-real-part eigenvalues is asymptotically stable
linear_ode_asymptotic_stability

Verso theorem preview

theorem declaration uses `sorry`linear_ode_asymptotic_stability (n : ℕ) (A : Matrix (Fin n) (Fin n) ℝ) (hA : ∀ μ : ℂ, Module.End.HasEigenvalue (Matrix.toLin' (A.map (algebraMap ℝ ℂ))) μ → μ.re < 0) (x : ℝ → (Fin n → ℝ)) (hx : ∀ t : ℝ, 0 < t → HasDerivAt x (A.mulVec (x t)) t) : Filter.Tendsto (fun t : ℝ => ‖x t‖) Filter.atTop (nhds 0) := n:ℕA:Matrix (Fin n) (Fin n) ℝhA:∀ (μ : ℂ), Module.End.HasEigenvalue (Matrix.toLin' (A.map ⇑(algebraMap ℝ ℂ))) μ → μ.re < 0x:ℝ → Fin n → ℝhx:∀ (t : ℝ), 0 < t → HasDerivAt x (A *ᵥ x t) t⊢ Filter.Tendsto (fun t => ‖x t‖) Filter.atTop (nhds 0) All goals completed! 🐙
#178
Koszul formula
koszul_formula

Verso theorem preview

theorem declaration uses `sorry`koszul_formula {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] [CompleteSpace E] {H : Type*} [TopologicalSpace H] {I : ModelWithCorners ℝ E H} {M : Type*} [TopologicalSpace M] [ChartedSpace H M] [IsManifold I ∞ M] [RiemannianBundle (fun (x : M) ↦ TangentSpace I x)] [IsContMDiffRiemannianBundle I ∞ E (fun (x : M) ↦ TangentSpace I x)] (cov : CovariantDerivative I E (TangentSpace I (M := M))) [ContMDiffCovariantDerivative cov ∞] (_htor : cov.torsion = 0) (_hmet : LeanEval.Geometry.KoszulFormula.IsMetricCompatible cov) (X Y Z : Π x : M, TangentSpace I x) (_hX : CMDiff ∞ (T% X)) (_hY : CMDiff ∞ (T% Y)) (_hZ : CMDiff ∞ (T% Z)) (x : M) : 2 * inner ℝ (cov Y x (X x)) (Z x) = mvfderiv I (fun y : M => inner ℝ (Y y) (Z y)) x (X x) + mvfderiv I (fun y : M => inner ℝ (X y) (Z y)) x (Y x) - mvfderiv I (fun y : M => inner ℝ (X y) (Y y)) x (Z x) - inner ℝ (X x) (mlieBracket I Y Z x) - inner ℝ (Y x) (mlieBracket I X Z x) + inner ℝ (Z x) (mlieBracket I X Y x) := E:Type u_1inst✝¹⁰:NormedAddCommGroup Einst✝⁹:NormedSpace ℝ Einst✝⁸:FiniteDimensional ℝ Einst✝⁷:CompleteSpace EH:Type u_2inst✝⁶:TopologicalSpace HI:ModelWithCorners ℝ E HM:Type u_3inst✝⁵:TopologicalSpace Minst✝⁴:ChartedSpace H Minst✝³:IsManifold I ∞ Minst✝²:RiemannianBundle fun x => TangentSpace I xinst✝¹:IsContMDiffRiemannianBundle I ∞ E fun x => TangentSpace I xcov:CovariantDerivative I E (TangentSpace I)inst✝:cov.ContMDiffCovariantDerivative ∞_htor:cov.torsion = 0_hmet:LeanEval.Geometry.KoszulFormula.IsMetricCompatible covX:(x : M) → TangentSpace I xY:(x : M) → TangentSpace I xZ:(x : M) → TangentSpace I x_hX:ContMDiff I I.tangent ∞ (T% X)_hY:ContMDiff I I.tangent ∞ (T% Y)_hZ:ContMDiff I I.tangent ∞ (T% Z)x:M⊢ 2 * Inner.inner ℝ ((↑cov Y x) (X x)) (Z x) = ((d% fun y => Inner.inner ℝ (Y y) (Z y)) x) (X x) + ((d% fun y => Inner.inner ℝ (X y) (Z y)) x) (Y x) - ((d% fun y => Inner.inner ℝ (X y) (Y y)) x) (Z x) - Inner.inner ℝ (X x) (mlieBracket I Y Z x) - Inner.inner ℝ (Y x) (mlieBracket I X Z x) + Inner.inner ℝ (Z x) (mlieBracket I X Y x) All goals completed! 🐙
#179
A counterexample to the unit conjecture for group rings
annals_unit_conjecture

Verso theorem preview

theorem declaration uses `sorry`theorem_A : (∀ g : UnitConjecture.P, ∀ n ≠ 0, g ^ n = 1 → g = 1) ∧ IsUnit UnitConjecture.u ∧ ¬ ∃ g : UnitConjecture.P, UnitConjecture.u = g := ⊢ (∀ (g : P) (n : ℕ), n ≠ 0 → g ^ n = 1 → g = 1) ∧ IsUnit u ∧ ¬∃ g, u = (MonoidAlgebra.of (ZMod 2) P) g All goals completed! 🐙
#180
Symplectic matrices have determinant 1
symplectic_matrix_det

Verso theorem preview

theorem declaration uses `sorry`symplectic_matrix_det {l R : Type*} [DecidableEq l] [Fintype l] [CommRing R] {A : Matrix (l ⊕ l) (l ⊕ l) R} (_hA : A ∈ Matrix.symplecticGroup l R) : A.det = 1 := l:Type u_1R:Type u_2inst✝²:DecidableEq linst✝¹:Fintype linst✝:CommRing RA:Matrix (l ⊕ l) (l ⊕ l) R_hA:A ∈ symplecticGroup l R⊢ A.det = 1 All goals completed! 🐙
#181
Complementary polynomial on the unit circle
exists_complementary_polynomial_on_unit_circle

Verso theorem preview

theorem declaration uses `sorry`exists_complementary_polynomial_on_unit_circle (P : ℂ[X]) (hP : ∀ z : Circle, ‖P.eval (z : ℂ)‖ ≤ 1) : ∃ Q : ℂ[X], Q.natDegree ≤ P.natDegree ∧ ∀ z : Circle, ‖P.eval (z : ℂ)‖ ^ 2 + ‖Q.eval (z : ℂ)‖ ^ 2 = 1 := P:ℂ[X]hP:∀ (z : Circle), ‖eval (↑z) P‖ ≤ 1⊢ ∃ Q, Q.natDegree ≤ P.natDegree ∧ ∀ (z : Circle), ‖eval (↑z) P‖ ^ 2 + ‖eval (↑z) Q‖ ^ 2 = 1 All goals completed! 🐙
#182
Rouche theorem via zero counting
rouche_zero_count_eq

Verso theorem preview

theorem declaration uses `sorry`rouche_zero_count_eq {f g : ℂ → ℂ} {R : ℝ} (hR : 0 < R) (hf : MeromorphicNFOn f Set.univ) (hg : AnalyticOn ℂ g Set.univ) (hbound : ∀ z : ℂ, ‖z‖ = R → ‖g z‖ < ‖f z‖) : (∑ᶠ z, ((divisor (f + g) (Metric.closedBall 0 R))⁺) z) = (∑ᶠ z, ((divisor f (Metric.closedBall 0 R))⁺) z) := f:ℂ → ℂg:ℂ → ℂR:ℝhR:0 < Rhf:MeromorphicNFOn f Set.univhg:AnalyticOn ℂ g Set.univhbound:∀ (z : ℂ), ‖z‖ = R → ‖g z‖ < ‖f z‖⊢ ∑ᶠ (z : ℂ), (divisor (f + g) (Metric.closedBall 0 R))⁺ z = ∑ᶠ (z : ℂ), (divisor f (Metric.closedBall 0 R))⁺ z All goals completed! 🐙
#183
Linear programming: maximum principle and vertex optimality
lp_maximum_principle

Verso theorem preview

/-- **Maximum principle for linear programming** (§101). A local maximiser of the LP objective on the feasible region is automatically a global maximiser; and whenever the objective is non-constant (`c ≠ 0`), the maximiser lies on the topological frontier of the feasible region. -/ theorem declaration uses `sorry`lp_maximum_principle {m n : ℕ} (lp : LinearProgram m n) (x : Fin m → ℝ) (_hx : x ∈ lp.feasible) (_hlocal : IsLocalMaxOn lp.objective lp.feasible x) : IsMaxOn lp.objective lp.feasible x ∧ (lp.c ≠ 0 → x ∈ frontier lp.feasible) := m:ℕn:ℕlp:LinearProgram m nx:Fin m → ℝ_hx:x ∈ lp.feasible_hlocal:IsLocalMaxOn lp.objective lp.feasible x⊢ IsMaxOn lp.objective lp.feasible x ∧ (lp.c ≠ 0 → x ∈ frontier lp.feasible) All goals completed! 🐙
/-- **Vertex optimality** (§101; the existence content of Dantzig's 1947 simplex algorithm). Every linear program with a nonempty bounded feasible region admits a global maximiser that is an extreme point (vertex) of the feasible region. -/ theorem declaration uses `sorry`simplex_algorithm {m n : ℕ} (lp : LinearProgram m n) (_hfeas : lp.feasible.Nonempty) (_hbdd : Bornology.IsBounded lp.feasible) : ∃ x ∈ lp.feasible, IsMaxOn lp.objective lp.feasible x ∧ x ∈ Set.extremePoints ℝ lp.feasible := m:ℕn:ℕlp:LinearProgram m n_hfeas:lp.feasible.Nonempty_hbdd:Bornology.IsBounded lp.feasible⊢ ∃ x ∈ lp.feasible, IsMaxOn lp.objective lp.feasible x ∧ x ∈ Set.extremePoints ℝ lp.feasible All goals completed! 🐙
#184
Pell solutions are convergents of √d
pell_solution_convergent

Verso theorem preview

theorem declaration uses `sorry`pell_solution_is_convergent (d : ℤ) (_hd : Squarefree d) (_hd0 : 0 < d) (x y : ℤ) (_hx : 0 < x) (_hy : 0 < y) (_hsol : x ^ 2 - d * y ^ 2 = 1) : ∃ n : ℕ, (GenContFract.of (Real.sqrt (d : ℝ))).convs n = (x : ℝ) / (y : ℝ) := d:ℤ_hd:Squarefree d_hd0:0 < dx:ℤy:ℤ_hx:0 < x_hy:0 < y_hsol:x ^ 2 - d * y ^ 2 = 1⊢ ∃ n, (GenContFract.of √↑d).convs n = ↑x / ↑y All goals completed! 🐙
#185
Bourbaki's locally convex extension of Banach–Alaoglu
banach_alaoglu_bourbaki

Verso theorem preview

theorem declaration uses `sorry`banach_alaoglu_bourbaki (E : Type*) [AddCommGroup E] [Module ℝ E] [TopologicalSpace E] [ContinuousAdd E] [ContinuousSMul ℝ E] [LocallyConvexSpace ℝ E] (U : Set E) (_hU : U ∈ 𝓝 (0 : E)) : IsCompact (LeanEval.Analysis.weakStarPolar E U) := E:Type u_1inst✝⁵:AddCommGroup Einst✝⁴:Module ℝ Einst✝³:TopologicalSpace Einst✝²:ContinuousAdd Einst✝¹:ContinuousSMul ℝ Einst✝:LocallyConvexSpace ℝ EU:Set E_hU:U ∈ 𝓝 0⊢ IsCompact (weakStarPolar E U) All goals completed! 🐙
#186
Perron-Frobenius for irreducible nonnegative matrices
irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius

Verso theorem preview

theorem declaration uses `sorry`irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius {n : Type*} [Fintype n] [DecidableEq n] [Nonempty n] (A : Matrix n n ℝ) (hA : A.IsIrreducible) : ∃ v : n → ℝ, Module.End.HasEigenvector (Matrix.toLin' A) (spectralRadius ℝ A).toReal v ∧ (∀ i, 0 < v i) := n:Type u_1inst✝²:Fintype ninst✝¹:DecidableEq ninst✝:Nonempty nA:Matrix n n ℝhA:A.IsIrreducible⊢ ∃ v, Module.End.HasEigenvector (Matrix.toLin' A) (spectralRadius ℝ A).toReal v ∧ ∀ (i : n), 0 < v i All goals completed! 🐙
#187
Minkowski-Caratheodory theorem
mem_convexHull_finset_extremePoints_of_mem_compact_convex

Verso theorem preview

theorem declaration uses `sorry`mem_convexHull_finset_extremePoints_of_mem_compact_convex {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] {s : Set E} {x : E} (hscomp : IsCompact s) (hsconv : Convex ℝ s) (hx : x ∈ s) : ∃ t : Finset E, (↑t : Set E) ⊆ s.extremePoints ℝ ∧ t.card ≤ Module.finrank ℝ E + 1 ∧ x ∈ convexHull ℝ (↑t : Set E) := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:FiniteDimensional ℝ Es:Set Ex:Ehscomp:IsCompact shsconv:Convex ℝ shx:x ∈ s⊢ ∃ t, ↑t ⊆ extremePoints ℝ s ∧ t.card ≤ Module.finrank ℝ E + 1 ∧ x ∈ (convexHull ℝ) ↑t All goals completed! 🐙
#188
Gaussian heat kernel solves the 1D heat equation
heat_kernel_solves_heat_equation

Verso theorem preview

theorem declaration uses `sorry`heat_kernel_solves_heat_equation (f : ℝ → ℝ) (hf_cont : Continuous f) (hf_bdd : ∃ M : ℝ, ∀ x, |f x| ≤ M) : -- The PDE on (0, ∞) × ℝ. (∀ t : ℝ, 0 < t → ∀ x : ℝ, ∃ ux : ℝ → ℝ, ∃ uxx : ℝ, (∀ y : ℝ, HasDerivAt (fun z => heatSolution f t z) (ux y) y) ∧ HasDerivAt ux uxx x ∧ HasDerivAt (fun s => heatSolution f s x) uxx t) ∧ -- Initial condition recovered as a one-sided limit at t = 0. (∀ x : ℝ, Filter.Tendsto (fun t : ℝ => heatSolution f t x) (nhdsWithin (0 : ℝ) (Set.Ioi 0)) (nhds (f x))) := f:ℝ → ℝhf_cont:Continuous fhf_bdd:∃ M, ∀ (x : ℝ), |f x| ≤ M⊢ (∀ (t : ℝ), 0 < t → ∀ (x : ℝ), ∃ ux uxx, (∀ (y : ℝ), HasDerivAt (fun z => heatSolution f t z) (ux y) y) ∧ HasDerivAt ux uxx x ∧ HasDerivAt (fun s => heatSolution f s x) uxx t) ∧ ∀ (x : ℝ), Filter.Tendsto (fun t => heatSolution f t x) (nhdsWithin 0 (Set.Ioi 0)) (nhds (f x)) All goals completed! 🐙
#189
Character values of finite groups lie in cyclotomic fields
brauer_character_in_cyclotomic

Verso theorem preview

theorem declaration uses `sorry`brauer_character_in_cyclotomic (G : Type) [Group G] [Fintype G] : ∃ φ : CyclotomicField (Monoid.exponent G) ℚ →+* ℂ, ∀ (V : Type) (_ : AddCommGroup V) (_ : Module ℂ V) (_ : FiniteDimensional ℂ V) (ρ : Representation ℂ G V) (g : G), LinearMap.trace ℂ V (ρ g) ∈ φ.range := G:Typeinst✝¹:Group Ginst✝:Fintype G⊢ ∃ φ, ∀ (V : Type) (x : AddCommGroup V) (x_1 : Module ℂ V), FiniteDimensional ℂ V → ∀ (ρ : Representation ℂ G V) (g : G), (LinearMap.trace ℂ V) (ρ g) ∈ φ.range All goals completed! 🐙
#190
Oppenheim's inequality for Hadamard products
oppenheim_inequality

Verso theorem preview

theorem declaration uses `sorry`oppenheim_inequality {n : Type*} [Fintype n] [DecidableEq n] {A B : Matrix n n ℝ} (hA : A.PosSemidef) (hB : B.PosSemidef) : A.det * ∏ i, B i i ≤ (A ⊙ B).det := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℝB:Matrix n n ℝhA:A.PosSemidefhB:B.PosSemidef⊢ A.det * ∏ i, B i i ≤ (A ⊙ B).det All goals completed! 🐙
#191
pi_1 of the circle is Z
pi1_circle_mulEquiv_int

Verso theorem preview

theorem declaration uses `sorry`pi1_circle_mulEquiv_int : Nonempty (HomotopyGroup.Pi 1 Circle (1 : Circle) ≃* Multiplicative ℤ) := ⊢ Nonempty (HomotopyGroup.Pi 1 Circle 1 ≃* Multiplicative ℤ) All goals completed! 🐙
#192
Dirichlet eigenvalues of -y'' = lambda y on [0,pi] are n^2
dirichlet_eigenvalues_eq_nat_sq

Verso theorem preview

theorem declaration uses `sorry`dirichlet_eigenvalues_eq_nat_sq (lam : ℝ) : (∃ (y : ℝ → ℝ) (J : Set ℝ), IsOpen J ∧ Set.Icc (0 : ℝ) Real.pi ⊆ J ∧ (∀ x ∈ J, HasDerivAt y (deriv y x) x) ∧ (∀ x ∈ J, HasDerivAt (deriv y) (-(lam * y x)) x) ∧ y 0 = 0 ∧ y Real.pi = 0 ∧ ∃ x ∈ Set.Ioo (0 : ℝ) Real.pi, y x ≠ 0) ↔ ∃ n : ℕ, 0 < n ∧ lam = (n : ℝ) ^ 2 := lam:ℝ⊢ (∃ y J, IsOpen J ∧ Set.Icc 0 π ⊆ J ∧ (∀ x ∈ J, HasDerivAt y (deriv y x) x) ∧ (∀ x ∈ J, HasDerivAt (deriv y) (-(lam * y x)) x) ∧ y 0 = 0 ∧ y π = 0 ∧ ∃ x ∈ Set.Ioo 0 π, y x ≠ 0) ↔ ∃ n, 0 < n ∧ lam = ↑n ^ 2 All goals completed! 🐙
#193
Entrywise exponential of a PSD matrix is PSD
posSemidef_map_exp

Verso theorem preview

theorem declaration uses `sorry`posSemidef_map_exp {n : Type*} [Fintype n] [DecidableEq n] {A : Matrix n n ℝ} (hA : A.PosSemidef) : (A.map Real.exp).PosSemidef := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℝhA:A.PosSemidef⊢ (A.map Real.exp).PosSemidef All goals completed! 🐙
#194
Sturm separation theorem
sturm_separation

Verso theorem preview

theorem declaration uses `sorry`sturm_separation (p q y₁ y₂ : ℝ → ℝ) (a b : ℝ) (hab : a < b) (J : Set ℝ) (hJ_open : IsOpen J) (hJ_conn : IsPreconnected J) (hJ_sub : Set.Icc a b ⊆ J) (hp : ContinuousOn p J) (hq : ContinuousOn q J) (hy₁ : ∀ x ∈ J, HasDerivAt y₁ (deriv y₁ x) x) (hy₁' : ∀ x ∈ J, HasDerivAt (deriv y₁) (-(p x * deriv y₁ x + q x * y₁ x)) x) (hy₂ : ∀ x ∈ J, HasDerivAt y₂ (deriv y₂ x) x) (hy₂' : ∀ x ∈ J, HasDerivAt (deriv y₂) (-(p x * deriv y₂ x + q x * y₂ x)) x) (hW : ∃ x₀ ∈ J, y₁ x₀ * deriv y₂ x₀ - y₂ x₀ * deriv y₁ x₀ ≠ 0) (hza : y₁ a = 0) (hzb : y₁ b = 0) (hne : ∀ x ∈ Set.Ioo a b, y₁ x ≠ 0) : ∃! c, c ∈ Set.Ioo a b ∧ y₂ c = 0 := p:ℝ → ℝq:ℝ → ℝy₁:ℝ → ℝy₂:ℝ → ℝa:ℝb:ℝhab:a < bJ:Set ℝhJ_open:IsOpen JhJ_conn:IsPreconnected JhJ_sub:Set.Icc a b ⊆ Jhp:ContinuousOn p Jhq:ContinuousOn q Jhy₁:∀ x ∈ J, HasDerivAt y₁ (deriv y₁ x) xhy₁':∀ x ∈ J, HasDerivAt (deriv y₁) (-(p x * deriv y₁ x + q x * y₁ x)) xhy₂:∀ x ∈ J, HasDerivAt y₂ (deriv y₂ x) xhy₂':∀ x ∈ J, HasDerivAt (deriv y₂) (-(p x * deriv y₂ x + q x * y₂ x)) xhW:∃ x₀ ∈ J, y₁ x₀ * deriv y₂ x₀ - y₂ x₀ * deriv y₁ x₀ ≠ 0hza:y₁ a = 0hzb:y₁ b = 0hne:∀ x ∈ Set.Ioo a b, y₁ x ≠ 0⊢ ∃! c, c ∈ Set.Ioo a b ∧ y₂ c = 0 All goals completed! 🐙
#195
Polynomial decay rate of y' = -y^3
cubic_decay_asymptotic

Verso theorem preview

theorem declaration uses `sorry`cubic_decay_asymptotic (y : ℝ → ℝ) (hy_diff : ∀ t : ℝ, 0 < t → HasDerivAt y (-(y t) ^ 3) t) (hy_cont : ContinuousWithinAt y (Set.Ici 0) 0) (hy0 : y 0 = 1) : Tendsto (fun t : ℝ => y t * Real.sqrt t) atTop (𝓝 (1 / Real.sqrt 2)) := y:ℝ → ℝhy_diff:∀ (t : ℝ), 0 < t → HasDerivAt y (-y t ^ 3) thy_cont:ContinuousWithinAt y (Set.Ici 0) 0hy0:y 0 = 1⊢ Tendsto (fun t => y t * √t) atTop (𝓝 (1 / √2)) All goals completed! 🐙
#196
Cayley graph connected iff generators generate the group
mulCayley_connected_iff_closure_eq_top

Verso theorem preview

theorem declaration uses `sorry`mulCayley_connected_iff_closure_eq_top {G : Type*} [Group G] (S : Set G) : (SimpleGraph.mulCayley S).Connected ↔ Subgroup.closure S = ⊤ := G:Type u_1inst✝:Group GS:Set G⊢ (SimpleGraph.mulCayley S).Connected ↔ Subgroup.closure S = ⊤ All goals completed! 🐙
#197
Comparison principle for the Dirichlet BVP
bvp_comparison

Verso theorem preview

theorem declaration uses `sorry`bvp_comparison (J : Set ℝ) (hJ_open : IsOpen J) (hJ_sub : Set.Icc (0 : ℝ) 1 ⊆ J) (u v : ℝ → ℝ) (hu : ∀ x ∈ J, HasDerivAt u (deriv u x) x) (hu' : ∀ x ∈ J, HasDerivAt (deriv u) (deriv (deriv u) x) x) (hv : ∀ x ∈ J, HasDerivAt v (deriv v x) x) (hv' : ∀ x ∈ J, HasDerivAt (deriv v) (deriv (deriv v) x) x) (hineq : ∀ x ∈ Set.Ioo (0 : ℝ) 1, -deriv (deriv u) x ≤ -deriv (deriv v) x) (hu0 : u 0 ≤ v 0) (hu1 : u 1 ≤ v 1) : ∀ x ∈ Set.Icc (0 : ℝ) 1, u x ≤ v x := J:Set ℝhJ_open:IsOpen JhJ_sub:Set.Icc 0 1 ⊆ Ju:ℝ → ℝv:ℝ → ℝhu:∀ x ∈ J, HasDerivAt u (deriv u x) xhu':∀ x ∈ J, HasDerivAt (deriv u) (deriv (deriv u) x) xhv:∀ x ∈ J, HasDerivAt v (deriv v x) xhv':∀ x ∈ J, HasDerivAt (deriv v) (deriv (deriv v) x) xhineq:∀ x ∈ Set.Ioo 0 1, -deriv (deriv u) x ≤ -deriv (deriv v) xhu0:u 0 ≤ v 0hu1:u 1 ≤ v 1⊢ ∀ x ∈ Set.Icc 0 1, u x ≤ v x All goals completed! 🐙
#198
Finite Ramsey theorem for graphs
finite_graph_ramsey_theorem

Verso theorem preview

theorem declaration uses `sorry`finite_graph_ramsey_theorem : ∀ r s : ℕ, 2 ≤ r → 2 ≤ s → ∃ n : ℕ, ∀ G : SimpleGraph (Fin n), ¬ G.CliqueFree r ∨ ¬ Gᶜ.CliqueFree s := ⊢ ∀ (r s : ℕ), 2 ≤ r → 2 ≤ s → ∃ n, ∀ (G : SimpleGraph (Fin n)), ¬G.CliqueFree r ∨ ¬Gᶜ.CliqueFree s All goals completed! 🐙
#199
Catalan generating function via compositional inversion
substInv_X_sub_X_sq_eq_catalan

Verso theorem preview

theorem declaration uses `sorry`substInv_X_sub_X_sq_eq_catalan (n : ℕ) : haveI : Invertible (coeff 1 ((X : ℚ⟦X⟧) - X ^ 2)) := n:ℕ⊢ Invertible ((coeff 1) (X - X ^ 2)) n:ℕ⊢ Invertible 1; All goals completed! 🐙 coeff (n + 1) (substInv ((X : ℚ⟦X⟧) - X ^ 2)) = (Nat.choose (2 * n) n : ℚ) / (↑n + 1) := n:ℕ⊢ (coeff (n + 1)) (X - X ^ 2).substInv = ↑((2 * n).choose n) / (↑n + 1) All goals completed! 🐙
#200
First submissionJun 18, 2026
Last submissionSep 7, 2026
lukerj00200
4Aristotle (Harmonic)162 solved
Pesin entropy formula (symplectic surface case)
pesin_formula

Verso theorem preview

theorem declaration uses `sorry`pesin_formula (T T_inv : LeanEval.Dynamics.EucPlane → LeanEval.Dynamics.EucPlane) (hT_smooth : ContDiff ℝ 2 T) (hT_inv_smooth : ContDiff ℝ 2 T_inv) (hT_left : Function.LeftInverse T_inv T) (hT_right : Function.RightInverse T_inv T) (K : Set LeanEval.Dynamics.EucPlane) (hK_compact : IsCompact K) (hK_inv : T '' K = K) (μ : Measure LeanEval.Dynamics.EucPlane) [IsProbabilityMeasure μ] (hμ_supp : μ Kᶜ = 0) (hμ_pres : MeasurePreserving T μ μ) (hμ_erg : Ergodic T μ) (hμ_dim : dimMeasure μ = 2) (hlam_sym : ∫ x, lyapunovUpperAt T x ∂μ = -∫ x, lyapunovLowerAt T x ∂μ) : kolmogorovSinaiEntropy μ T = ∫ x, lyapunovUpperAt T x ∂μ := T:EucPlane → EucPlaneT_inv:EucPlane → EucPlanehT_smooth:ContDiff ℝ 2 ThT_inv_smooth:ContDiff ℝ 2 T_invhT_left:Function.LeftInverse T_inv ThT_right:Function.RightInverse T_inv TK:Set EucPlanehK_compact:IsCompact KhK_inv:T '' K = Kμ:Measure EucPlaneinst✝:IsProbabilityMeasure μhμ_supp:μ Kᶜ = 0hμ_pres:MeasurePreserving T μ μhμ_erg:Ergodic T μhμ_dim:dimMeasure μ = 2hlam_sym:∫ (x : EucPlane), lyapunovUpperAt T x ∂μ = -∫ (x : EucPlane), lyapunovLowerAt T x ∂μ⊢ kolmogorovSinaiEntropy μ T = ∫ (x : EucPlane), lyapunovUpperAt T x ∂μ All goals completed! 🐙
#1
Upper bound theorem for geometric simplicial spheres (Stanley 1975)
upper_bound_simplicial_spheres

Verso theorem preview

theorem declaration uses `sorry`upper_bound_theorem_simplicial_spheres {d n k : ℕ} (X : LeanEval.Combinatorics.UpperBoundSimplicialSpheresProblem.FiniteSimplicialSphere d) (_hn : LeanEval.Combinatorics.UpperBoundSimplicialSpheresProblem.faceCount X 0 = n) (_hk : k < d) : LeanEval.Combinatorics.UpperBoundSimplicialSpheresProblem.faceCount X k ≤ LeanEval.Combinatorics.UpperBoundSimplicialSpheresProblem.cyclicPolytopeFaceCount n d k := d:ℕn:ℕk:ℕX:FiniteSimplicialSphere d_hn:faceCount X 0 = n_hk:k < d⊢ faceCount X k ≤ cyclicPolytopeFaceCount n d k All goals completed! 🐙
#2
Coherent cohomology of a proper scheme over ℚ is finite-dimensional
coherent_cohomology_finite_dimensional

Verso theorem preview

theorem declaration uses `sorry`coherent_cohomology_finite_dimensional (f : X ⟶ Spec (CommRingCat.of ℚ)) [IsProper f] [M.IsFiniteType] [M.IsQuasicoherent] (n : ℕ) : Module.Finite ℚ (ℚ ⊗[ℤ] M.sheaf.H n) := X:SchemeM:X.Modulesf:X ⟶ Spec ↧ℚinst✝²:IsProper finst✝¹:SheafOfModules.IsFiniteType Minst✝:SheafOfModules.IsQuasicoherent Mn:ℕ⊢ Module.Finite ℚ (ℚ ⊗[ℤ] Sheaf.H Scheme.Modules.sheaf n) All goals completed! 🐙
#3
Novikov's theorem: the word problem is undecidable for finitely presented groups
novikov_unsolvable

Verso theorem preview

theorem declaration uses `sorry`novikov_unsolvable : ∃ (n : ℕ) (rels : Set (FreeGroup (Fin n))), rels.Finite ∧ ¬ LeanEval.GroupTheory.NovikovUnsolvableProblem.WordProblemSolvable (PresentedGroup.mk rels) := ⊢ ∃ n rels, rels.Finite ∧ ¬WordProblemSolvable (PresentedGroup.mk rels) All goals completed! 🐙
#4
Higman's infinite finitely-presented simple group
higman_infinite_simple

Verso theorem preview

theorem declaration uses `sorry`higman_infinite_simple : ∃ (n : ℕ) (rels : Set (FreeGroup (Fin n))), rels.Finite ∧ IsSimpleGroup (PresentedGroup rels) ∧ Infinite (PresentedGroup rels) := ⊢ ∃ n rels, rels.Finite ∧ IsSimpleGroup (PresentedGroup rels) ∧ Infinite (PresentedGroup rels) All goals completed! 🐙
#5
Wieferich's theorem g(3) = 9
wieferich_g_three

Verso theorem preview

theorem declaration uses `sorry`wieferich_g_three : (∀ n : ℕ, LeanEval.NumberTheory.IsSumOfCubes 9 n) ∧ ∃ n : ℕ, ¬ LeanEval.NumberTheory.IsSumOfCubes 8 n := ⊢ (∀ (n : ℕ), IsSumOfCubes 9 n) ∧ ∃ n, ¬IsSumOfCubes 8 n All goals completed! 🐙
#6
Fáry–Milnor theorem (knot total curvature ≤ 4π implies unknotted)
fary_milnor

Verso theorem preview

theorem declaration uses `sorry`fary_milnor_total_curvature {r : ℝ → LeanEval.Geometry.FaryMilnorProblem.Space} (_hknot : LeanEval.Geometry.FaryMilnorProblem.IsSmoothKnot r) (_hK : LeanEval.Geometry.FaryMilnorProblem.totalCurvature r ≤ 4 * Real.pi) : LeanEval.Geometry.FaryMilnorProblem.IsUnknotted r := r:ℝ → Space_hknot:IsSmoothKnot r_hK:totalCurvature r ≤ 4 * π⊢ IsUnknotted r All goals completed! 🐙
#7
Brauer's splitting field theorem
brauer_splitting_field

Verso theorem preview

theorem declaration uses `sorry`brauer_splitting_field (G : Type) [Group G] [Fintype G] (V : Type) [AddCommGroup V] [Module ℂ V] [FiniteDimensional ℂ V] (ρ : Representation ℂ G V) : ∃ (φ : CyclotomicField (Monoid.exponent G) ℚ →+* ℂ) (W : Type) (_ : AddCommGroup W) (_ : Module (CyclotomicField (Monoid.exponent G) ℚ) W) (σ : Representation (CyclotomicField (Monoid.exponent G) ℚ) G W), letI : Algebra (CyclotomicField (Monoid.exponent G) ℚ) ℂ := φ.toAlgebra ∃ (f : (ℂ ⊗[CyclotomicField (Monoid.exponent G) ℚ] W) ≃ₗ[ℂ] V), ∀ (g : G) (x : ℂ ⊗[CyclotomicField (Monoid.exponent G) ℚ] W), f ((σ g).baseChange ℂ x) = ρ g (f x) := G:Typeinst✝⁴:Group Ginst✝³:Fintype GV:Typeinst✝²:AddCommGroup Vinst✝¹:Module ℂ Vinst✝:FiniteDimensional ℂ Vρ:Representation ℂ G V⊢ ∃ φ W x x_1 σ f, ∀ (g : G) (x_2 : ℂ ⊗[CyclotomicField (Monoid.exponent G) ℚ] W), f ((LinearMap.baseChange ℂ (σ g)) x_2) = (ρ g) (f x_2) All goals completed! 🐙
#8
Connective constant of the honeycomb lattice
honeycomb_connective_constant

Verso theorem preview

theorem declaration uses `sorry`honeycomb_connective_constant : Tendsto (fun n ↦ (LeanEval.Combinatorics.HoneycombConnectiveConstant.walkCount n : ℝ) ^ (1 / n : ℝ)) atTop (nhds (Real.sqrt (2 + Real.sqrt 2))) := ⊢ Tendsto (fun n => ↑(walkCount n) ^ (1 / ↑n)) atTop (𝓝 √(2 + √2)) All goals completed! 🐙
#9
Ado–Iwasawa theorem over an arbitrary field
adoIwasawa

Verso theorem preview

theorem declaration uses `sorry`adoIwasawa [FiniteDimensional K L] : ∃ (V : Type u) (_ : AddCommGroup V) (_ : Module K V) (_ : FiniteDimensional K V) (ρ : L →ₗ⁅K⁆ Module.End K V), Function.Injective ρ := K:Type uL:Type uinst✝³:Field Kinst✝²:LieRing Linst✝¹:LieAlgebra K Linst✝:FiniteDimensional K L⊢ ∃ V x x_1, ∃ (_ : FiniteDimensional K V), ∃ ρ, Function.Injective ⇑ρ All goals completed! 🐙
#10
Dehn–Sommerville equations for simplicial spheres
dehn_sommerville

Lean theorem statement

/-- **Dehn–Sommerville equations.** The h-vector of a finite simplicial sphere
is symmetric: `h_j = h_{d-j}`. -/
theorem dehn_sommerville
    {d j : ℕ} (X : FiniteSimplicialSphere d) (hj : j ≤ d) :
    hVector X j = hVector X (d - j) := by
  sorry
#11
The alternating sign matrix theorem
alternating_sign_matrix_count

Verso theorem preview

theorem declaration uses `sorry`alternating_sign_matrix_count (n : ℕ) : (Nat.card (LeanEval.Combinatorics.AlternatingSignMatrix.ASMatrix n) : ℚ) = LeanEval.Combinatorics.AlternatingSignMatrix.robbinsProduct n := n:ℕ⊢ ↑(Nat.card (ASMatrix n)) = robbinsProduct n All goals completed! 🐙
#12
Morse inequalities
morse_inequality

Lean theorem statement

/-- **Morse inequalities** (Marston Morse, 1934). For a Morse function `f`
on a closed smooth finite-dimensional Hausdorff manifold `M` and every `k ∈ ℕ`,
`∑_{j≤k}(−1)^{k−j} c_j(f) ≥ ∑_{j≤k}(−1)^{k−j} b_j(M)`. -/
theorem morse_inequality
    {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E]
    {H : Type*} [TopologicalSpace H] {I : ModelWithCorners ℝ E H} [I.Boundaryless]
    {M : Type} [TopologicalSpace M] [ChartedSpace H M] [IsManifold I ∞ M]
    [CompactSpace M] [T2Space M] (f : M → ℝ) (_hf : IsMorseFunction I f) (k : ℕ) :
    alternatingPartialSum (bettiNumber M) k ≤
      alternatingPartialSum (morseCount I f) k := by
  sorry
#13
Strong Mason conjecture for matroid independent sets
strong_mason_conjecture

Verso theorem preview

theorem declaration uses `sorry`strong_mason_conjecture {α : Type*} (M : Matroid α) [M.Finite] (k : ℕ) (hk : 0 < k) (hkn : k < M.E.ncard) : independentSetCount M (k - 1) * independentSetCount M (k + 1) * (k + 1) * (M.E.ncard - k + 1) ≤ independentSetCount M k ^ 2 * k * (M.E.ncard - k) := α:Type u_1M:Matroid αinst✝:M.Finitek:ℕhk:0 < khkn:k < M.E.ncard⊢ independentSetCount M (k - 1) * independentSetCount M (k + 1) * (k + 1) * (M.E.ncard - k + 1) ≤ independentSetCount M k ^ 2 * k * (M.E.ncard - k) All goals completed! 🐙
#14
Gleason's theorem (separable Hilbert space)
gleason_theorem_separable

Lean theorem statement

/-- **Gleason's theorem**, separable Hilbert space version (Gleason's original 1957
formulation). For a separable complex Hilbert space `H` of dimension at least `3`, every
frame function on the unit sphere of `H` is given by `x ↦ re ⟨x, ρ x⟩` for some positive
bounded operator `ρ`. (The Lean conclusion does not separately assert trace-class /
`Tr ρ = 1`; see the file docstring.) -/
theorem gleason_theorem_separable
    {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H]
      [CompleteSpace H] [TopologicalSpace.SeparableSpace H]
    (hdim : 3 ≤ Module.rank ℂ H)
    (f : SphereFrameFunction H) :
    ∃ ρ : H →L[ℂ] H,
      ContinuousLinearMap.IsPositive ρ ∧
      ∀ x : Metric.sphere (0 : H) 1,
        f.f x = (inner ℂ (x : H) (ρ (x : H))).re := by
  sorry
#15
Gleason's theorem (finite-dimensional)
gleason_theorem_finite

Lean theorem statement

/-- **Gleason's theorem**, finite-dimensional version. For `dim H ≥ 3`, every frame
function on the projection lattice of `H` is given by `P ↦ re Tr(ρ P)` for the unique
density operator `ρ` (positive, `re Tr ρ = 1`). -/
theorem gleason_theorem_finite
    {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H]
      [CompleteSpace H] [FiniteDimensional ℂ H]
    (hdim : 3 ≤ Module.finrank ℂ H)
    (f : FrameFunction H) :
    ∃! ρ : H →L[ℂ] H,
      ContinuousLinearMap.IsPositive ρ ∧
      reTr ρ = 1 ∧
      ∀ P : H →L[ℂ] H, IsOrthProj P → f.μ P = reTr (ρ * P) := by
  sorry
#16
Fatou–Julia / Cantor dichotomy
fatou_julia_dichotomy

Lean theorem statement

/-- **Fatou–Julia dichotomy.** For the quadratic family, `c ∈ M` implies
the filled Julia set `K_c` is connected; `c ∉ M` implies `K_c` is
homeomorphic to the Cantor space `ℕ → Bool`. -/
theorem julia_cantor_dichotomy (c : ℂ) :
    (c ∈ Mandelbrot → IsConnected (FilledJulia c)) ∧
    (c ∉ Mandelbrot → Nonempty ((FilledJulia c) ≃ₜ (ℕ → Bool))) := by
  sorry
#17
Mandelbrot set is connected (Douady–Hubbard)
mandelbrot_connected

Lean theorem statement

/-- **Mandelbrot set is connected** (Douady–Hubbard). -/
theorem mandelbrot_connected : IsConnected Mandelbrot := by
  sorry
#18
Weak Morse inequalities
weak_morse_inequality

Lean theorem statement

/-- **Weak Morse inequalities.** For a Morse function `f` on a closed
smooth finite-dimensional Hausdorff manifold `M` and every `k ∈ ℕ`,
`b_k(M) ≤ c_k(f)`. -/
theorem weak_morse_inequality
    {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E]
    {H : Type*} [TopologicalSpace H] {I : ModelWithCorners ℝ E H} [I.Boundaryless]
    {M : Type} [TopologicalSpace M] [ChartedSpace H M] [IsManifold I ∞ M]
    [CompactSpace M] [T2Space M] (f : M → ℝ) (_hf : IsMorseFunction I f) (k : ℕ) :
    bettiNumber M k ≤ morseCount I f k := by
  sorry
#19
Onsager's 2D Ising phase transition
ising_2d_phase_transition

Lean theorem statement

/-- **Onsager's 2D Ising phase transition.** The thermodynamic-limit free
energy exists for all `β` and is non-analytic at some positive `βc`. -/
theorem ising_2d_phase_transition :
    ∃ (F : ℝ → ℝ) (βc : ℝ),
      0 < βc ∧
        (∀ β : ℝ,
          Tendsto (fun n : ℕ => finiteIsingFreeEnergySeq n β) atTop (𝓝 (F β))) ∧
        ¬ AnalyticAt ℝ F βc := by
  sorry
#20
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Commuting probabilities are closed
commProb_closed

Lean theorem statement

/-- The set of commuting probabilities of finite groups is closed. -/
theorem commProb_closed : IsClosed ({p : ℝ | ∃ (G : Type) (hG : Group G), commProb G = p}) := by
  sorry
#21
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Poincaré–Bendixson theorem
poincare_bendixson

Lean theorem statement

/-- **Poincaré–Bendixson theorem.** For a `C¹` autonomous vector field
`F : ℝ² → ℝ²` and a forward integral curve `γ` on `[0, ∞)`, either the
forward orbit is unbounded, or the ω-limit set contains an equilibrium
of `F`, or the ω-limit set equals the range of a non-constant periodic
integral curve of `F`. -/
theorem poincare_bendixson
    (F : Plane → Plane) (_hF : ContDiff ℝ 1 F)
    (γ : ℝ → Plane)
    (_hγ : IsIntegralCurveOn γ (fun _ x => F x) (Set.Ici 0)) :
    ¬ Bornology.IsBounded (γ '' Set.Ici 0)
    ∨ (∃ x₀, F x₀ = 0 ∧ x₀ ∈ ⋂ s : ℝ, closure (γ '' Set.Ici s))
    ∨ (∃ T : ℝ, 0 < T ∧ ∃ β : ℝ → Plane,
        IsIntegralCurve β (fun _ x => F x) ∧
        (∀ t, β (t + T) = β t) ∧
        F (β 0) ≠ 0 ∧
        (⋂ s : ℝ, closure (γ '' Set.Ici s)) = Set.range β) := by
  sorry
#22
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

pi_3 of the 2-sphere is Z
pi3_sphere_two_mulEquiv_int

Lean theorem statement

/-- The third homotopy group of the 2-sphere is infinite cyclic. -/
theorem pi3_sphere_two_mulEquiv_int
    (x : Metric.sphere (0 : EuclideanSpace ℝ (Fin 3)) 1) :
    Nonempty
      (HomotopyGroup.Pi 3 (Metric.sphere (0 : EuclideanSpace ℝ (Fin 3)) 1) x ≃*
        Multiplicative ℤ) := by
  sorry
#23
pi_n of the n-sphere is Z
pin_sphere_n_mulEquiv_int

Lean theorem statement

/-- For every `n ≥ 1`, the `n`th homotopy group of the `n`-sphere is infinite cyclic. -/
theorem pin_sphere_n_mulEquiv_int
    (n : ℕ)
    (x : Metric.sphere (0 : EuclideanSpace ℝ (Fin (n + 2))) 1) :
    Nonempty
      (HomotopyGroup.Pi (n + 1) (Metric.sphere (0 : EuclideanSpace ℝ (Fin (n + 2))) 1) x ≃*
        Multiplicative ℤ) := by
  sorry
#24
Bézout's theorem (projective, with multiplicity)
bezout_projective_multiplicity

Lean theorem statement

/-- **Bézout's theorem (with multiplicity).** Given `n` homogeneous
polynomials `f_k` in `n + 1` variables, each of total degree exactly
`d_k ≥ 1`, over an algebraically closed field with finite common
projective zero set, the sum of intersection multiplicities equals
`∏ d_k`. The `totalDegree` hypothesis rules out the zero polynomial
(which is `IsHomogeneous d` for every `d` but has `totalDegree = 0`). -/
theorem bezout_multiplicity [IsAlgClosed K] {n : ℕ}
    (f : Fin n → MvPolynomial (Fin (n + 1)) K)
    (d : Fin n → ℕ) (_hd : ∀ k, (f k).IsHomogeneous (d k))
    (_hdeg : ∀ k, (f k).totalDegree = d k)
    (_hd_pos : ∀ k, 1 ≤ d k)
    (_hfin : (⋂ k, vanishingSet (f k)).Finite) :
    ∑ᶠ p ∈ (⋂ k, vanishingSet (f k)), intersectionMultiplicity f p
      = (∏ k, d k : ℕ∞) := by
  sorry
#25
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Jordan–Brouwer separation theorem
jordan_brouwer

Lean theorem statement

/-- **Jordan–Brouwer separation theorem.** For `d ≥ 2`, the
complement in `ℝᵈ` of a topological `(d−1)`-sphere (the image of any
continuous injection from the unit `(d−1)`-sphere into `ℝᵈ`) has
exactly two connected components. -/
theorem jordan_brouwer (d : ℕ) (_hd : 2 ≤ d)
    (r : Metric.sphere (0 : EuclideanSpace ℝ (Fin d)) 1 → EuclideanSpace ℝ (Fin d))
    (_hcont : Continuous r) (_hinj : Function.Injective r) :
    Nat.card
        (ConnectedComponents ((Set.range r)ᶜ : Set (EuclideanSpace ℝ (Fin d)))) =
      2 := by
  sorry
#26
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Thue–Siegel–Roth theorem (irrationality measure ≤ 2 for algebraic irrationals)
thue_siegel_roth

Lean theorem statement

/-- **Thue–Siegel–Roth theorem** (Klaus Roth, 1955). Every irrational
algebraic real is Diophantine: its irrationality measure is at most
`2`. -/
theorem thueSiegelRoth (x : ℝ) (_h_irr : Irrational x)
    (_h_alg : IsAlgebraic ℤ x) : IsDiophantine x := by
  sorry
#27
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Margulis–Ruelle inequality
margulis_ruelle

Lean theorem statement

/-- **Margulis–Ruelle inequality (1968/1978).** `h_μ(T) ≤ λ₁⁺ + λ₂⁺`. -/
theorem margulis_ruelle
    (T T_inv : EucPlane → EucPlane)
    (hT_smooth : ContDiff ℝ 2 T)
    (hT_inv_smooth : ContDiff ℝ 2 T_inv)
    (hT_left : Function.LeftInverse T_inv T)
    (hT_right : Function.RightInverse T_inv T)
    (K : Set EucPlane)
    (hK_compact : IsCompact K)
    (hK_inv : T '' K = K)
    (μ : Measure EucPlane) [IsProbabilityMeasure μ]
    (hμ_supp : μ Kᶜ = 0)
    (hμ_pres : MeasurePreserving T μ μ)
    (hμ_erg : Ergodic T μ) :
    kolmogorovSinaiEntropy μ T
      ≤ max 0 (∫ x, lyapunovUpperAt T x ∂μ)
          + max 0 (∫ x, lyapunovLowerAt T x ∂μ) := by
  sorry
#28
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Seventeen wallpaper groups (Pólya–Niggli 1924)
wallpaper_groups_17

Lean theorem statement

/-- **There are exactly 17 wallpaper groups** (Pólya–Niggli 1924). -/
theorem there_are_17_wallpaper_groups :
    crystallographicCount 2 = 17 := by
  sorry
#29
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Mergelyan's theorem
mergelyan_theorem

Lean theorem statement

/-- **Mergelyan's theorem.** For a compact `K ⊆ ℂ` with connected
complement and `f : ℂ → ℂ` continuous on `K` and analytic on the
interior of `K`, every `ε > 0` admits a complex polynomial `p` with
`‖f z − p(z)‖ < ε` on `K`. -/
theorem mergelyan (K : Set ℂ) (_hK : IsCompact K) (_hKc : IsConnected (Kᶜ))
    (f : ℂ → ℂ) (_hfc : ContinuousOn f K) (_hfh : AnalyticOnNhd ℂ f (interior K))
    (ε : ℝ) (_hε : 0 < ε) :
    ∃ p : ℂ[X], ∀ z ∈ K, ‖f z - p.eval z‖ < ε := by
  sorry
#30
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

KAM persistence of an invariant curve
kam_invariant_curve

Lean theorem statement

/-- **KAM theorem (persistence of an invariant curve).** For real-analytic,
`1`-periodic, non-constant, mean-zero `f` and Diophantine `α`, for all small
`|c|` the twist-map functional equation
`q(t+α) − 2q(t) + q(t−α) = c·f(q(t))` has a smooth strictly increasing solution
`q` with `q − id` periodic — the `c = 0` curve `q₀(t) = t` persists as a smooth
invariant curve of rotation number `α`. -/
theorem kam_invariant_curve
    (α : ℝ) (_hα : IsDiophantine α)
    (f : ℝ → ℝ)
    (_hf_analytic : AnalyticOnNhd ℝ f Set.univ)
    (_hf_per : Function.Periodic f 1)
    (_hf_nonconst : ¬ ∃ k : ℝ, ∀ x, f x = k)
    (_hf_mean : ∫ x in (0 : ℝ)..1, f x = 0) :
    ∃ c₀ : ℝ, 0 < c₀ ∧ ∀ c : ℝ, |c| < c₀ →
      ∃ q : ℝ → ℝ,
        ContDiff ℝ ∞ q ∧ StrictMono q ∧
        Function.Periodic (fun t => q t - t) 1 ∧
        ∀ t : ℝ, q (t + α) - 2 * q t + q (t - α) = c * f (q t) := by
  sorry
#31
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Darboux's theorem (symplectic forms are locally standard)
darboux

Lean theorem statement

/-- **Darboux's theorem.** Every symplectic form on an open subset
`U ⊆ ℝ^{2n}` is locally symplectomorphic to the standard symplectic form
`ω₀`. Formally: for every `x ∈ U` there is a smooth local diffeomorphism
`φ` (`OpenPartialHomeomorph`, smooth in both directions) whose source lies
in `U` and contains `x`, such that on the target the pullback of `α` by
`φ⁻¹` is in Darboux normal form (and hence equals `ω₀`) at every point. -/
theorem darboux {n : ℕ} {U : Set (E n)} (_hU : IsOpen U)
    (α : E n → E n [⋀^Fin 2]→L[ℝ] ℝ) (_hα : IsSymplecticOn α U)
    {x : E n} (_hx : x ∈ U) :
    ∃ φ : OpenPartialHomeomorph (E n) (E n),
      x ∈ φ.source ∧ φ.source ⊆ U ∧
      ContDiffOn ℝ ∞ (φ : E n → E n) φ.source ∧
      ContDiffOn ℝ ∞ (φ.symm : E n → E n) φ.target ∧
      ∀ z ∈ φ.target,
        IsDarbouxNormal
          ((α (φ.symm z)).compContinuousLinearMap
            (fderiv ℝ (φ.symm : E n → E n) z)) := by
  sorry
#32
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Vinogradov mean value theorem
vinogradov_mean_value

Verso theorem preview

theorem declaration uses `sorry`vinogradov_mean_value (s k : ℕ) (ε : ℝ) (hε : 0 < ε) : LeanEval.NumberTheory.VinogradovMeanValue.J s k =O[Filter.atTop] fun X ↦ (X ^ (s + ε) + X ^ ((2 * s : ℝ) - k * (k + 1) / 2 + ε) : ℝ) := s:ℕk:ℕε:ℝhε:0 < ε⊢ J s k =O[Filter.atTop] fun X => ↑X ^ (↑s + ε) + ↑X ^ (2 * ↑s - ↑k * (↑k + 1) / 2 + ε) All goals completed! 🐙
#33
Existence of a simple group of order 10200960 with a 22-dim irrep whose tensor square has 4 isotypic components
m23_irrep_tensor_square_decomp

Verso theorem preview

theorem declaration uses `sorry`m23_irrep_tensor_square_decomp : ∃ (G : Type) (_ : Group G) (_ : Fintype G), Fintype.card G = 10200960 ∧ IsSimpleGroup G ∧ ∃ (V : Type) (_ : AddCommGroup V) (_ : Module ℂ V) (ρ : Representation ℂ G V), Module.finrank ℂ V = 22 ∧ ρ.IsIrreducible ∧ (@isotypicComponents (MonoidAlgebra ℂ G) (V ⊗[ℂ] V) _ _ (Module.compHom (V ⊗[ℂ] V) (Representation.asAlgebraHom (ρ.tprod ρ)).toRingHom)).ncard = 4 := ⊢ ∃ G x x_1, Fintype.card G = 10200960 ∧ IsSimpleGroup G ∧ ∃ V x_2 x_3 ρ, Module.finrank ℂ V = 22 ∧ ρ.IsIrreducible ∧ (isotypicComponents (MonoidAlgebra ℂ G) (V ⊗[ℂ] V)).ncard = 4 All goals completed! 🐙
#34
Spencer-Szemerédi-Trotter unit-distance upper bound
unit_distance_upper_bound

Verso theorem preview

theorem declaration uses `sorry`unit_distance_upper_bound : ∃ C : ℝ, 0 < C ∧ ∀ P : Finset (EuclideanSpace ℝ (Fin 2)), (unitDist P : ℝ) ≤ C * (P.card : ℝ) ^ ((4 : ℝ) / 3) := ⊢ ∃ C, 0 < C ∧ ∀ (P : Finset (EuclideanSpace ℝ (Fin 2))), ↑(unitDist P) ≤ C * ↑P.card ^ (4 / 3) All goals completed! 🐙
#35
Ado's theorem in characteristic zero
adoCharZero

Verso theorem preview

theorem declaration uses `sorry`adoCharZero [CharZero K] [FiniteDimensional K L] : ∃ (V : Type u) (_ : AddCommGroup V) (_ : Module K V) (_ : FiniteDimensional K V) (ρ : L →ₗ⁅K⁆ Module.End K V), Function.Injective ρ := K:Type uL:Type uinst✝⁴:Field Kinst✝³:LieRing Linst✝²:LieAlgebra K Linst✝¹:CharZero Kinst✝:FiniteDimensional K L⊢ ∃ V x x_1, ∃ (_ : FiniteDimensional K V), ∃ ρ, Function.Injective ⇑ρ All goals completed! 🐙
#36
Moran's equality for affine-symmetric iterated function systems
moran_equality_affine

Verso theorem preview

theorem declaration uses `sorry`moran_equality_affine {d n : ℕ} (hn : 1 ≤ n) (f : Fin n → EuclideanSpace ℝ (Fin d) → EuclideanSpace ℝ (Fin d)) (lam : ℝ) (h_aff : LeanEval.Dynamics.IsAffineSymmetricIFS f lam) (h_osc : LeanEval.Dynamics.OpenSetCondition f) {S : Set (EuclideanSpace ℝ (Fin d))} (hS : LeanEval.Dynamics.IsAttractor f S) : dimH S = ENNReal.ofReal (- Real.log n / Real.log lam) := d:ℕn:ℕhn:1 ≤ nf:Fin n → EuclideanSpace ℝ (Fin d) → EuclideanSpace ℝ (Fin d)lam:ℝh_aff:IsAffineSymmetricIFS f lamh_osc:OpenSetCondition fS:Set (EuclideanSpace ℝ (Fin d))hS:IsAttractor f S⊢ dimH S = ENNReal.ofReal (-Real.log ↑n / Real.log lam) All goals completed! 🐙
#37
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

A counterexample to the periodic tiling conjecture
annals_periodic_tiling_conjecture

Lean theorem statement

/--
Statement of Theorem 1.4 (Counterexample to Conjecture 1.2, I):

There exists a finite abelian group `G₀` and a finite non-empty `F ⊆ ℤ² × G₀` such that
`F` forms an aperiodic tiling equation.
-/
theorem theorem_1_4 : ∃ (G₀ : Type) (_ : AddCommGroup G₀) (_ : Finite G₀),
    ∃ F : Set (ℤ × ℤ × G₀), F.Finite ∧ F.Nonempty ∧ IsAperiodicTilingEquation F := by
  sorry

/--
Statement of Corollary 1.6 (Counterexample to Conjecture 1.2, II):

For all sufficiently large `d`, there exists a finite non-empty `F ⊆ ℤᵈ` such that
`F` forms an aperiodic tiling equation.
-/
theorem corollary_1_6 : ∀ᶠ d in atTop, ∃ (F : Set (Fin d → ℤ)),
    F.Finite ∧ F.Nonempty ∧ IsAperiodicTilingEquation F := by
  sorry

/--
Statement of Corollary 1.7 (Counterexample to Conjecture 1.3):

For all sufficiently large `d`, there exists a bounded measurable set `σ ⊆ ℝᵈ` of positive
measure such that `σ` forms an aperiodic continuous tiling equation.
-/
theorem corollary_1_7 : ∀ᶠ d in atTop, ∃ σ : Set (Fin d → ℝ), IsBounded σ ∧ MeasurableSet σ ∧
    0 < volume σ ∧ IsAperiodicContinuousTilingEquation σ := by
  sorry
#38
The optimal paper Moebius band
annals_optimal_moebius

Lean theorem statement

/--
Statement of Theorem 1.1 (Main):

A smooth embedded paper Moebius band has aspect ratio greater than `√3`.
-/
theorem theorem_1_1 (a : ℝ) (ha : a > 0) (f : ℝ² → ℝ³) (hf : IsMoebiusEmbedding a f) :
    a > √3 := by
  sorry
#39
On a conjecture of Talagrand on selector processes and a consequence on positive empirical processes
annals_supremum_of_selector_processes

Lean theorem statement

/-- The constant `L` of Theorem 1.2. -/
noncomputable def L₂ : ℝ≥0 := sorry

/-- The constant of Theorem 1.2 is positive. -/
theorem L₂_pos : L₂ > 0 := sorry

/--
Statement of Theorem 1.2:

There exists `L > 0` such that for any `0 < p < 1`, finite type `X`, and set `Λ` of functions from
`X` to `ℝ≥0` such that `0 < 𝔼[sup_{f ∈ Λ} ∑ i ∈ Xp, f i] < ∞`, the collection of sets

`{s ⊆ X | sup_{f ∈ Λ} ∑ i ∈ s, f i ≥ L * 𝔼[sup_{f ∈ Λ} ∑ i ∈ Xp, f i]}`

is `p-small`, where `Xp` is a binomial random subset of `X` with parameter `p`.

Note: The assumption `0 < 𝔼[sup_{f ∈ Λ} ∑ i ∈ Xp, f i] < ∞` is not explicitly stated in the theorem
but used in the last step of the proof where `𝔼 ≥ (L/L') * 𝔼` is a contradiction for `L > L'`.
-/
theorem theorem_1_2 (p : I) (hp₀ : 0 < p) (hp₁ : p < 1) (X : Type*) [Fintype X] (Λ : Set (X → ℝ≥0))
    (hE₀ : 0 < 𝔼⁻[⨆ f ∈ Λ, ∑ i ∈ Xp, (f i : ℝ≥0∞); Xp ∼ binomialSetDistribution X p])
    (hE : 𝔼⁻[⨆ f ∈ Λ, ∑ i ∈ Xp, (f i : ℝ≥0∞); Xp ∼ binomialSetDistribution X p] < ∞) :
    IsSmall p {s : Set X | ⨆ f ∈ Λ, ∑ i ∈ s, (f i : ℝ≥0∞) ≥
        L₂ * 𝔼⁻[⨆ f ∈ Λ, ∑ i ∈ Xp, (f i : ℝ≥0∞); Xp ∼ binomialSetDistribution X p]} := by
  sorry

/-- The constant `L` of Theorem 1.3. -/
noncomputable def L₃ : ℝ≥0 := sorry

/-- The constant of Theorem 1.3 is positive. -/
theorem L₃_pos : L₃ > 0 := sorry

/--
Statement of Theorem 1.3:

There exists `L > 0` such that for any `N > 0`, i.i.d random variables `Y_1, …, Y_N` distributed
according to a Borel probability measure `ν` on a Polish space `𝕋`, if `𝓕` is a finite set of
non-negative functions in `L∞(𝕋)` and `0 < 𝔼[sup_{f ∈ 𝓕} Z Y f] < ∞` then there exists a finite
collection `𝓒` of pairs `(g, t)` where `g : 𝕋 → ℝ≥0`, `t > 0` such that

`{sup_{f ∈ 𝓕} Z N Y f ≥ L * 𝔼[sup_{f ∈ 𝓕} Z N Y f] } ⊆ ⋃ (g,t) ∈ 𝓒, {t ≤ Z N Y g}`

and

`∑ (g,t) ∈ 𝓒, P(t ≤ Z N Y g) ≤ 2⁻¹`.

Note: The requirement that the collection `𝓒` be finite is not explicitly stated in the paper.
However, `𝓒` must at least be assumed to be countable in order for the sum to make sense,
and the collections `𝓒` produced by the proof are indeed finite.

-/
theorem theorem_1_3 (N : ℕ) (N_pos : N > 0) (𝕋 : Type*) (t𝕋 : TopologicalSpace 𝕋)
    (p𝕋 : PolishSpace 𝕋)
    (m𝕋 : MeasurableSpace 𝕋) (b𝕋 : BorelSpace 𝕋) (ν : Measure 𝕋) (hν : IsProbabilityMeasure ν)
    (Ω : Type*) (mΩ : MeasurableSpace Ω) (P : Measure Ω) (Y : Fin N → Ω → 𝕋)
    (Y_indep : iIndepFun Y P) (Y_law_ν : ∀ i, HasLaw (Y i) ν P)
    (𝓕 : Set {f : 𝕋 → ℝ≥0 // Measurable f ∧ MemLp f ∞ ν}) (h𝓕 : Finite 𝓕)
    (hZ₀ : 0 < 𝔼⁻[⨆ f ∈ 𝓕, (Z N Y f ·); P]) (hZ : 𝔼⁻[⨆ f ∈ 𝓕, (Z N Y f ·); P] < ∞) :
    ∃ 𝓒 : Finset ({g : 𝕋 → ℝ≥0 // Measurable g} × {t : ℝ≥0 | t > 0}),
      {ω | ⨆ f ∈ 𝓕, Z N Y f ω ≥ L₃ * 𝔼⁻[⨆ f ∈ 𝓕, (Z N Y f ·); P]} ⊆ ⋃ c ∈ 𝓒, {ω | c.2 ≤ Z N Y c.1 ω}
      ∧ ∑ c : 𝓒, P {ω | c.val.2 ≤ Z N Y c.val.1 ω} ≤ 2⁻¹ := by
  sorry
#40
On approximation to a real number by algebraic numbers of bounded degree
annals_on_approximation_of_reals

Lean theorem statement

/--
Statement of Theorem 1.1:

Let `n` be an integer such that `n ≥ 2`. For any transcendental real number `ξ`, we have
`ω⋆_n(ξ) ≥ a * n`, where `a = 1 / (2 - log 2)`.
-/
theorem theorem_1_1 (n : ℕ) (hn : n ≥ 2) (ξ : ℝ) (hξ : Transcendental ℚ ξ) :
    letI a : ℝ := 1 / (2 - Real.log 2)
    (ω⋆ n ξ : EReal) ≥ (a : EReal) * n := by
  sorry
#41
The local-global conjecture for Apollonian circle packings is false
annals_local_global_apollonian_circle_packings

Lean theorem statement

/--
Statement of Theorem 1.6:

The Apollonian circle packing `A` generated by `(−3, 5, 8, 8)` has no square curvatures.
-/
theorem theorem_1_6 : ∀ n, n ^ 2 ∉ curvatureSet ⟦⟨![-3, 5, 8, 8], by decide⟩⟧ := by
  sorry

/--
Statement of Theorem 1.3:

There exist infinitely many `A` for which the number of missing curvatures up to `N` is `Ω(√N)`.
-/
theorem theorem_1_3 : {A : PrimitiveApollonianCirclePacking |
    Real.sqrt =O[Filter.atTop] missingCurvatures A}.Infinite := by
  sorry
#42
Improved bounds for the sunflower lemma
annals_improved_bounds_sunflower_lemma

Lean theorem statement

/-- The absolute constant `C` in Theorem 1.4. Although not explicitly stated in the paper,
the constant `C` doesn't depend on `r`. -/
noncomputable def C : ℝ := sorry

/--
Statement of Theorem 1.4 (Main theorem, sunflowers):

Let `r ≥ 3`. For some constant `C`, any `w`-set system `F` of size
`|F| ≥ (C * r ^ 3 * log w * log log w) ^ w` contains an `r`-sunflower.

Note: We require `w ≥ 2`, as the paper assumes `log log w > 0`.
-/
theorem theorem_1_4 (r : ℕ) (hr : r ≥ 3) (X : Type*) [Finite X] (ℱ : Set (Set X)) (w : ℕ)
      (hw : w ≥ 2) (hℱ₁ : ℱ.IsSystem w) (hℱ₂ : ℱ.ncard ≥ lowerBound r C w) :
      ∃ S ⊆ ℱ, S.IsSunflower r := by
  sorry
#43
Duffin-Schaeffer conjecture
duffin_schaeffer

Verso theorem preview

theorem declaration uses `sorry`duffin_schaeffer (δ : ℕ → ℝ) (hδ : ∀ n, 0 ≤ δ n) : volume (addWellApproximable UnitAddCircle δ) = 1 ↔ ¬ Summable fun n : ℕ => n.totient * δ n := δ:ℕ → ℝhδ:∀ (n : ℕ), 0 ≤ δ n⊢ volume (addWellApproximable UnitAddCircle δ) = 1 ↔ ¬Summable fun n => ↑n.totient * δ n All goals completed! 🐙
#44
A 3-manifold group with no faithful representation into GL(4, ℝ)
nonlinear_three_manifold_group

Verso theorem preview

theorem declaration uses `sorry`nonlinear_three_manifold_group : ∃ (M : LeanEval.Topology.Closed3Manifold) (x : M.carrier), ∀ f : FundamentalGroup M.carrier x →* GL (Fin 4) ℝ, ¬ Function.Injective f := ⊢ ∃ M x, ∀ (f : FundamentalGroup M.carrier x →* GL (Fin 4) ℝ), ¬Function.Injective ⇑f All goals completed! 🐙
#45
The Hopf Umlaufsatz (theorem of turning tangents)
hopf_umlaufsatz

Verso theorem preview

theorem declaration uses `sorry`hopf_umlaufsatz {r : ℝ → LeanEval.Geometry.HopfUmlaufsatz.Plane} {α : ℝ → ℝ} (_hr : LeanEval.Geometry.HopfUmlaufsatz.IsPositiveSimpleClosedUnitSpeedCurve r) (_hα : LeanEval.Geometry.HopfUmlaufsatz.IsTangentAngleLift r α) : totalCurvature α = 2 * Real.pi := r:ℝ → Planeα:ℝ → ℝ_hr:IsPositiveSimpleClosedUnitSpeedCurve r_hα:IsTangentAngleLift r α⊢ totalCurvature α = 2 * Real.pi All goals completed! 🐙
#46
Radial symmetry for positive semilinear Poisson solutions
semilinear_poisson_radial_symmetry

Verso theorem preview

theorem declaration uses `sorry`semilinear_poisson_radial_symmetry {n : ℕ} (hn : 0 < n) {f : ℝ → ℝ} (u : EuclideanSpace ℝ (Fin n) → ℝ) (hf_lipschitz : ∃ K : ℝ≥0, LipschitzWith K f) (hu_c2 : ContDiffOn ℝ 2 u (closedBall 0 1)) (hu_solve : LeanEval.Analysis.PDE.SolvesSemilinearPoisson f u) (hu_positive : ∀ x ∈ ball 0 1, 0 < u x) : ∃ v : ℝ → ℝ≥0, StrictAntiOn v (Set.Icc (0 : ℝ) 1) ∧ ∀ x ∈ closedBall 0 1, u x = v ‖x‖ := n:ℕhn:0 < nf:ℝ → ℝu:EuclideanSpace ℝ (Fin n) → ℝhf_lipschitz:∃ K, LipschitzWith K fhu_c2:ContDiffOn ℝ 2 u (closedBall 0 1)hu_solve:SolvesSemilinearPoisson f uhu_positive:∀ x ∈ ball 0 1, 0 < u x⊢ ∃ v, StrictAntiOn v (Set.Icc 0 1) ∧ ∀ x ∈ closedBall 0 1, u x = ↑(v ‖x‖) All goals completed! 🐙
#47
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

No bounded projection from L^1 onto H^1
H1_not_closedComplemented

Verso theorem preview

theorem declaration uses `sorry`H1_not_closedComplemented : ¬ LeanEval.Analysis.H1.ClosedComplemented := ⊢ ¬H1.ClosedComplemented All goals completed! 🐙
#48
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Riesz brothers' theorem
riesz_brothers_theorem

Lean theorem statement

/-- **Riesz brothers' theorem.** Let `μ` be a complex Borel measure on
the unit circle such that `∫ z^n dμ = 0` for every `n ≥ 1`. Then `μ` is
absolutely continuous with respect to Haar measure. The usual density
formulation follows by applying the Radon–Nikodym theorem to this conclusion;
the hypothesis transfers the Fourier-vanishing property to that density. This
corollary is not part of the formal statement here. -/
theorem riesz_brothers_theorem (μ : ComplexMeasure UnitAddCircle)
    (hμ : ∀ n : ℕ, 1 ≤ n → ∫ᵛ z, fourier n z ∂[ContinuousLinearMap.mul ℝ ℂ; μ] = 0) :
    μ ≪ᵥ AddCircle.haarAddCircle.toENNRealVectorMeasure := by
  sorry
#49
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Existence of a non-isotopic pair of oriented knots
exists_nonisotopic_knots

Verso theorem preview

theorem declaration uses `sorry`exists_nonisotopic_knots : ∃ K₁ K₂ : LeanEval.KnotTheory.Knot, ¬ K₁.Isotopic K₂ := ⊢ ∃ K₁ K₂, ¬K₁.Isotopic K₂ All goals completed! 🐙
#50
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Pick's theorem
pick

Verso theorem preview

theorem declaration uses `sorry`pick {n : ℕ} (hn : 3 ≤ n) (v : Fin n → ℤ × ℤ) (hsimple : LeanEval.Geometry.PicksTheorem.IsSimple (LeanEval.Geometry.PicksTheorem.latPoly v)) : area ((LeanEval.Geometry.PicksTheorem.latPoly v).boundary (R := ℝ)) = (interiorPts v : ℝ) + (boundaryPts v : ℝ) / 2 - 1 := n:ℕhn:3 ≤ nv:Fin n → ℤ × ℤhsimple:IsSimple (latPoly v)⊢ area (Polygon.boundary ℝ (latPoly v)) = ↑(interiorPts v) + ↑(boundaryPts v) / 2 - 1 All goals completed! 🐙
#51
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Brun's theorem (convergence of the twin-prime reciprocal sum)
brun_constant_converges

Lean theorem statement

/-- **Brun's theorem.** The reciprocal sum over twin-prime pairs converges. -/
theorem brun_constant_converges :
    Summable twinPrimeReciprocalTerm := by
  sorry
#52
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Gauss-Wantzel constructible regular polygon theorem
gauss_wantzel_constructible_polygon

Lean theorem statement

/-- **Gauss-Wantzel constructible polygon theorem** (§174): a regular `n`-gon
is straightedge-and-compass constructible exactly for the Gauss-Wantzel
integers. -/
theorem gauss_wantzel_constructible_polygon (n : ℕ) (hn : 3 ≤ n) :
    IsConstructible (Real.cos (2 * Real.pi / n)) ↔ GaussWantzelNumber n := by
  sorry
#53
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Radó's theorem on Riemann surfaces
rado_riemannSurface

Verso theorem preview

theorem declaration uses `sorry`rado_riemannSurface {X : Type*} [TopologicalSpace X] [T2Space X] [ConnectedSpace X] [ChartedSpace ℂ X] [IsManifold (modelWithCornersSelf ℂ ℂ) 1 X] : SecondCountableTopology X := X:Type u_1inst✝⁴:TopologicalSpace Xinst✝³:T2Space Xinst✝²:ConnectedSpace Xinst✝¹:ChartedSpace ℂ Xinst✝:IsManifold (modelWithCornersSelf ℂ ℂ) 1 X⊢ SecondCountableTopology X All goals completed! 🐙
#54
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

General recursive equals Turing computable
turing_recursive_equiv

Lean theorem statement

/-- **General recursive = Turing computable** (total form). A total function
`f : ℕ → ℕ` is recursive (`Computable`, i.e. partial recursive as a partial
function) **iff** it is computed by some Turing machine (mathlib's `FinTM2`
model) under the standard binary encoding of `ℕ`. This is Knill's class
equality; the backward direction (TM-computable ⇒ recursive) is absent from
mathlib. -/
theorem turing_recursive_equiv (f : ℕ → ℕ) :
    Computable f ↔ Nonempty (TM2Computable encodeNat encodeNat f) := by
  sorry
#55
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Morrison–Walker Lemma B.0.1: adapting families of maps to open covers
families_of_maps_b01

Verso theorem preview

/-- **Lemma B.0.1** of Morrison–Walker, *The Blob Complex* (arXiv:1009.5025, §B), continuous case. -/ theorem declaration uses `sorry`continuous {P : Set (Fin k → ℝ)} (_hP : IsPolyhedron P) [CompactSpace X] (U : ι → Set X) (_hUopen : ∀ α, IsOpen (U α)) (ρ : PartitionOfUnity ι X univ) (_hρ : ρ.IsSubordinate U) (f : C(P × X, T)) : ∃ F : C(I × P × X, T), (∀ p : P, ∀ x : X, F (0, p, x) = f (p, x)) ∧ (∃ K : Subdivision P, ∀ D ∈ K.complex.facets, AdaptedTo U k (fun q : closedCell P D × X => F (1, q.1.1, q.2))) ∧ (∀ S : Set X, Supported (f := f.toFun) S → Supported (fun q : (I × P) × X => F (q.1.1, q.1.2, q.2)) S) ∧ (∀ Q : Set P, IsBoundarySubpolyhedron Q → ∀ S' : Set X, Supported (fun q : Q × X => f (q.1.1, q.2)) S' → Supported (fun q : (I × Q) × X => F (q.1.1, q.1.2.1, q.2)) S') := k:ℕι:Type u_1X:Type u_2T:Type u_3inst✝²:TopologicalSpace Xinst✝¹:TopologicalSpace TP:Set (Fin k → ℝ)_hP:IsPolyhedron Pinst✝:CompactSpace XU:ι → Set X_hUopen:∀ (α : ι), IsOpen[inst✝²] (U α)ρ:PartitionOfUnity ι X_hρ:ρ.IsSubordinate Uf:C(↑P × X, T)⊢ ∃ F, (∀ (p : ↑P) (x : X), F (0, p, x) = f (p, x)) ∧ (∃ K, ∀ D ∈ K.complex.facets, AdaptedTo U k fun q => F (1, ↑q.1, q.2)) ∧ (∀ (S : Set X), Supported f.toFun S → Supported (fun q => F (q.1.1, q.1.2, q.2)) S) ∧ ∀ (Q : Set ↑P), IsBoundarySubpolyhedron Q → ∀ (S' : Set X), Supported (fun q => f (↑q.1, q.2)) S' → Supported (fun q => F (q.1.1, ↑q.1.2, q.2)) S' All goals completed! 🐙
/-- **Lemma B.0.1**, bi-Lipschitz variant (part 4 of the paper). -/ theorem declaration uses `sorry`biLipschitz {X T : Type*} [MetricSpace X] [MetricSpace T] [CompactSpace X] {P : Set (Fin k → ℝ)} (_hP : IsPolyhedron P) {ι : Type*} (U : ι → Set X) (_hUopen : ∀ α, IsOpen (U α)) (ρ : PartitionOfUnity ι X univ) (_hρ : ρ.IsSubordinate U) (f : C(P × X, T)) (slice : P → (X ≃ₜ T)) (_h_slice_eq : ∀ p : P, ∀ x : X, f (p, x) = slice p x) (L : NNReal) (_hf_joint : LipschitzWith L f.toFun) (_hf_slice_inv : ∀ p : P, LipschitzWith L (slice p).symm) : ∃ F : C(I × P × X, T), ∃ L' : NNReal, ∃ Slice : I × P → (X ≃ₜ T), (∀ p : P, ∀ x : X, F (0, p, x) = f (p, x)) ∧ (∀ t : I, ∀ p : P, ∀ x : X, F (t, p, x) = Slice (t, p) x) ∧ (∃ K : Subdivision P, ∀ D ∈ K.complex.facets, AdaptedTo U k (fun q : closedCell P D × X => F (1, q.1.1, q.2))) ∧ (∀ S : Set X, Supported (f := f.toFun) S → Supported (fun q : (I × P) × X => F (q.1.1, q.1.2, q.2)) S) ∧ (∀ Q : Set P, IsBoundarySubpolyhedron Q → ∀ S' : Set X, Supported (fun q : Q × X => f (q.1.1, q.2)) S' → Supported (fun q : (I × Q) × X => F (q.1.1, q.1.2.1, q.2)) S') ∧ (∀ tp : I × P, LipschitzWith L' (Slice tp)) ∧ (∀ tp : I × P, LipschitzWith L' (Slice tp).symm) := k:ℕX:Type u_4T:Type u_5inst✝²:MetricSpace Xinst✝¹:MetricSpace Tinst✝:CompactSpace XP:Set (Fin k → ℝ)_hP:IsPolyhedron Pι:Type u_6U:ι → Set X_hUopen:∀ (α : ι), IsOpen[PseudoMetricSpace.toUniformSpace.toTopologicalSpace] (U α)ρ:PartitionOfUnity ι X_hρ:ρ.IsSubordinate Uf:C(↑P × X, T)slice:↑P → X ≃ₜ T_h_slice_eq:∀ (p : ↑P) (x : X), f (p, x) = (slice p) xL:NNReal_hf_joint:LipschitzWith L f.toFun_hf_slice_inv:∀ (p : ↑P), LipschitzWith L ⇑(slice p).symm⊢ ∃ F L' Slice, (∀ (p : ↑P) (x : X), F (0, p, x) = f (p, x)) ∧ (∀ (t : ↑I) (p : ↑P) (x : X), F (t, p, x) = (Slice (t, p)) x) ∧ (∃ K, ∀ D ∈ K.complex.facets, AdaptedTo U k fun q => F (1, ↑q.1, q.2)) ∧ (∀ (S : Set X), Supported f.toFun S → Supported (fun q => F (q.1.1, q.1.2, q.2)) S) ∧ (∀ (Q : Set ↑P), IsBoundarySubpolyhedron Q → ∀ (S' : Set X), Supported (fun q => f (↑q.1, q.2)) S' → Supported (fun q => F (q.1.1, ↑q.1.2, q.2)) S') ∧ (∀ (tp : ↑I × ↑P), LipschitzWith L' ⇑(Slice tp)) ∧ ∀ (tp : ↑I × ↑P), LipschitzWith L' ⇑(Slice tp).symm All goals completed! 🐙
#56
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

The Golod–Shafarevich inequality
golod_shafarevich_inequality

Verso theorem preview

theorem declaration uses `sorry`golod_shafarevich_inequality (p : ℕ) [Fact p.Prime] (Q : Type) [Group Q] [TopologicalSpace Q] [IsTopologicalGroup Q] [DiscreteTopology Q] [Finite Q] : IsPGroup p Q → Nontrivial Q → (generatorRank Q : ℝ) ^ 2 < 4 * (relationRank p Q : ℝ) := p:ℕinst✝⁵:Fact (Nat.Prime p)Q:Typeinst✝⁴:Group Qinst✝³:TopologicalSpace Qinst✝²:IsTopologicalGroup Qinst✝¹:DiscreteTopology Qinst✝:Finite Q⊢ IsPGroup p Q → Nontrivial Q → ↑(generatorRank Q) ^ 2 < 4 * ↑(relationRank p Q) All goals completed! 🐙
#57
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Wigner semicircle law
wigner_semicircle

Verso theorem preview

theorem declaration uses `sorry`wigner_semicircle {Ω : Type*} [MeasurableSpace Ω] (μ : Measure Ω) [IsProbabilityMeasure μ] (X : ℕ → ℕ → Ω → ℝ) (_hX_meas : ∀ i j, Measurable (X i j)) (_hX_indep : iIndepFun (fun ij : {p : ℕ × ℕ // p.1 ≤ p.2} => X ij.val.1 ij.val.2) μ) (_hX_iid : ∀ i j i' j', i ≤ j → i' ≤ j' → ProbabilityTheory.IdentDistrib (X i j) (X i' j') μ μ) (_hX_int : ∀ i j, i ≤ j → Integrable (X i j) μ) (_hX_sq_int : ∀ i j, i ≤ j → Integrable (fun ω => (X i j ω) ^ 2) μ) (_hX_mean : ∀ i j, i ≤ j → ∫ ω, X i j ω ∂μ = 0) (_hX_var : ∀ i j, i ≤ j → ∫ ω, (X i j ω) ^ 2 ∂μ = 1) : ∀ᵐ ω ∂μ, ∀ (f : ℝ → ℝ), Continuous f → (∃ M, ∀ x, ‖f x‖ ≤ M) → Tendsto (fun n : ℕ => ∫ x, f x ∂ (empiricalSpectralMeasureHerm (wignerMatrix_isHermitian X n ω)).map (fun x : ℝ => x / Real.sqrt n)) atTop (𝓝 (∫ x, f x ∂semicircleLaw)) := Ω:Type u_1inst✝¹:MeasurableSpace Ωμ:Measure Ωinst✝:IsProbabilityMeasure μX:ℕ → ℕ → Ω → ℝ_hX_meas:∀ (i j : ℕ), Measurable (X i j)_hX_indep:iIndepFun (fun ij => X (↑ij).1 (↑ij).2) μ_hX_iid:∀ (i j i' j' : ℕ), i ≤ j → i' ≤ j' → IdentDistrib (X i j) (X i' j') μ μ_hX_int:∀ (i j : ℕ), i ≤ j → Integrable (X i j) μ_hX_sq_int:∀ (i j : ℕ), i ≤ j → Integrable (fun ω => X i j ω ^ 2) μ_hX_mean:∀ (i j : ℕ), i ≤ j → ∫ (ω : Ω), X i j ω ∂μ = 0_hX_var:∀ (i j : ℕ), i ≤ j → ∫ (ω : Ω), X i j ω ^ 2 ∂μ = 1⊢ ∀ᵐ (ω : Ω) ∂μ, ∀ (f : ℝ → ℝ), Continuous f → (∃ M, ∀ (x : ℝ), ‖f x‖ ≤ M) → Tendsto (fun n => ∫ (x : ℝ), f x ∂Measure.map (fun x => x / √↑n) (empiricalSpectralMeasureHerm ⋯)) atTop (𝓝 (∫ (x : ℝ), f x ∂semicircleLaw)) All goals completed! 🐙
#58
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Cauchy–Kovalevskaya theorem
cauchy_kovalevskaya

Verso theorem preview

theorem declaration uses `sorry`cauchy_kovalevskaya {d : ℕ} (F : LeanEval.Analysis.E d × ℝ × ℝ → LeanEval.Analysis.E d) (f : LeanEval.Analysis.E d × ℝ × ℝ → ℝ) (u₀ : LeanEval.Analysis.E d → ℝ) (_hF : AnalyticOnNhd ℝ F univ) (_hf : AnalyticOnNhd ℝ f univ) (_hu₀ : AnalyticOnNhd ℝ u₀ univ) (x₀ : LeanEval.Analysis.E d) : ∃ (U : Set (LeanEval.Analysis.E d × ℝ)) (u : LeanEval.Analysis.E d × ℝ → ℝ), (x₀, (0 : ℝ)) ∈ U ∧ IsOpen U ∧ AnalyticOnNhd ℝ u U ∧ (∀ x : LeanEval.Analysis.E d, (x, (0 : ℝ)) ∈ U → u (x, 0) = u₀ x) ∧ (∀ p ∈ U, fderiv ℝ u p ((0 : LeanEval.Analysis.E d), (1 : ℝ)) = fderiv ℝ u p (F (p.1, p.2, u p), (0 : ℝ)) + f (p.1, p.2, u p)) ∧ (∀ v : LeanEval.Analysis.E d × ℝ → ℝ, AnalyticOnNhd ℝ v U → (∀ x : LeanEval.Analysis.E d, (x, (0 : ℝ)) ∈ U → v (x, 0) = u₀ x) → (∀ p ∈ U, fderiv ℝ v p ((0 : LeanEval.Analysis.E d), (1 : ℝ)) = fderiv ℝ v p (F (p.1, p.2, v p), (0 : ℝ)) + f (p.1, p.2, v p)) → ∀ p ∈ U, u p = v p) := d:ℕF:E d × ℝ × ℝ → E df:E d × ℝ × ℝ → ℝu₀:E d → ℝ_hF:AnalyticOnNhd ℝ F univ_hf:AnalyticOnNhd ℝ f univ_hu₀:AnalyticOnNhd ℝ u₀ univx₀:E d⊢ ∃ U u, (x₀, 0) ∈ U ∧ IsOpen U ∧ AnalyticOnNhd ℝ u U ∧ (∀ (x : E d), (x, 0) ∈ U → u (x, 0) = u₀ x) ∧ (∀ p ∈ U, (fderiv ℝ u p) (0, 1) = (fderiv ℝ u p) (F (p.1, p.2, u p), 0) + f (p.1, p.2, u p)) ∧ ∀ (v : E d × ℝ → ℝ), AnalyticOnNhd ℝ v U → (∀ (x : E d), (x, 0) ∈ U → v (x, 0) = u₀ x) → (∀ p ∈ U, (fderiv ℝ v p) (0, 1) = (fderiv ℝ v p) (F (p.1, p.2, v p), 0) + f (p.1, p.2, v p)) → ∀ p ∈ U, u p = v p All goals completed! 🐙
#59
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Strong Subadditivity of von Neumann Entropy
strong_subadditivity

Verso theorem preview

theorem declaration uses `sorry`strong_subadditivity (M_ABC : Matrix (A × B × C) (A × B × C) ℂ) (h : M_ABC.PosSemidef) : let M_AB : Matrix (A × B) (A × B) ℂ := .traceRight <| M_ABC.reindex (.symm <| .prodAssoc ..) (.symm <| .prodAssoc ..) let M_BC : Matrix (B × C) (B × C) ℂ := M_ABC.traceLeft let M_B : Matrix B B ℂ := M_BC.traceRight LeanEval.Physics.entropy M_ABC + LeanEval.Physics.entropy M_B ≤ LeanEval.Physics.entropy M_AB + LeanEval.Physics.entropy M_BC := A:Type u_1B:Type u_2C:Type u_3inst✝⁸:Fintype Ainst✝⁷:Fintype Binst✝⁶:Fintype Cinst✝⁵:DecidableEq Ainst✝⁴:DecidableEq Binst✝³:DecidableEq Cinst✝²:Nonempty Ainst✝¹:Nonempty Binst✝:Nonempty CM_ABC:Matrix (A × B × C) (A × B × C) ℂh:M_ABC.PosSemidef⊢ let M_AB := ((Matrix.reindex (Equiv.prodAssoc A B C).symm (Equiv.prodAssoc A B C).symm) M_ABC).traceRight; let M_BC := M_ABC.traceLeft; let M_B := M_BC.traceRight; entropy M_ABC + entropy M_B ≤ entropy M_AB + entropy M_BC All goals completed! 🐙
#60
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Fundamental theorem of topos theory
fundamental_topos_theory

Verso theorem preview

theorem declaration uses `sorry`fundamental_topos_theory {E : Type*} [Category E] (hE : LeanEval.ToposTheory.IsTopos E) (X : E) : LeanEval.ToposTheory.IsTopos (Over X) := E:Type u_1inst✝:Category.{u_2, u_1} EhE:IsTopos EX:E⊢ IsTopos (Over X) All goals completed! 🐙
#61
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Ornstein–Weiss ℤᵈ Rokhlin lemma
ornstein_weiss_rokhlin

Verso theorem preview

theorem declaration uses `sorry`ornstein_weiss_rokhlin {Ω : Type*} [MeasurableSpace Ω] [StandardBorelSpace Ω] {d : ℕ} (_hd : 1 ≤ d) (μ : Measure Ω) [IsProbabilityMeasure μ] (T : (Fin d → ℤ) → Ω → Ω) (_hid : ∀ x, T 0 x = x) (_hT : ∀ v, MeasurePreserving (T v) μ μ) (_hgrp : ∀ u v x, T (u + v) x = T u (T v x)) (_hfree : LeanEval.Dynamics.IsFreeAction μ T) (N : ℕ) (_hN : 1 ≤ N) {ε : ENNReal} (_hε : 0 < ε) : ∃ B : Set Ω, MeasurableSet B ∧ ((boxShape d N : Finset (Fin d → ℤ)) : Set (Fin d → ℤ)).PairwiseDisjoint (fun v => T v '' B) ∧ μ (⋃ v ∈ boxShape d N, T v '' B) ≥ 1 - ε := Ω:Type u_1inst✝²:MeasurableSpace Ωinst✝¹:StandardBorelSpace Ωd:ℕ_hd:1 ≤ dμ:Measure Ωinst✝:IsProbabilityMeasure μT:(Fin d → ℤ) → Ω → Ω_hid:∀ (x : Ω), T 0 x = x_hT:∀ (v : Fin d → ℤ), MeasurePreserving (T v) μ μ_hgrp:∀ (u v : Fin d → ℤ) (x : Ω), T (u + v) x = T u (T v x)_hfree:IsFreeAction μ TN:ℕ_hN:1 ≤ Nε:ENNReal_hε:0 < ε⊢ ∃ B, MeasurableSet B ∧ ((↑(boxShape d N)).PairwiseDisjoint fun v => T v '' B) ∧ μ (⋃ v ∈ boxShape d N, T v '' B) ≥ 1 - ε All goals completed! 🐙
#62
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Radon transform: Fourier-slice diagonalization and pseudo-inversion
radon_transform_inversion

Verso theorem preview

theorem declaration uses `sorry`radon_can_be_diagonalized_and_pseudo_inverted : (∀ φ : SchwartzMap (ℝ × ℝ) ℂ, ∀ θ k : ℝ, fourier1 (fun p => radon (φ : ℝ × ℝ → ℂ) (p, θ)) k = fourier2 (φ : ℝ × ℝ → ℂ) (k * Real.cos θ, k * Real.sin θ)) ∧ (∃ Rinv : (ℝ × ℝ → ℂ) → (ℝ × ℝ → ℂ), ∀ φ : SchwartzMap (ℝ × ℝ) ℂ, Rinv (radon (φ : ℝ × ℝ → ℂ)) = (φ : ℝ × ℝ → ℂ)) := ⊢ (∀ (φ : SchwartzMap (ℝ × ℝ) ℂ) (θ k : ℝ), fourier1 (fun p => radon ⇑φ (p, θ)) k = fourier2 ⇑φ (k * Real.cos θ, k * Real.sin θ)) ∧ ∃ Rinv, ∀ (φ : SchwartzMap (ℝ × ℝ) ℂ), Rinv (radon ⇑φ) = ⇑φ All goals completed! 🐙
#63
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Hurewicz theorem in degree 1 (H₁ = abelianization of π₁)
hurewicz_h1_abelianization

Lean theorem statement

/-- **Hurewicz (n = 1).** For a path-connected space `X`, `H₁(X;ℤ)` is the
abelianization of `π₁(X, x)`. -/
theorem hurewicz_h1_abelianization
    (X : Type) [TopologicalSpace X] [PathConnectedSpace X] (x : X) :
    Nonempty (Additive (Abelianization (FundamentalGroup X x)) ≃+
      (IntegralHomology 1 X : Type)) := by
  sorry
#64
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Kolmogorov–Arnold superposition theorem (non-universal Lorentz form)
kolmogorov_arnold_superposition

Lean theorem statement

/-- **Kolmogorov–Arnold superposition theorem (non-universal Lorentz
form).** For `n ≥ 1`, every continuous `f` on the unit cube `[0, 1]ⁿ`
admits a representation
`f(x) = ∑_{k=0}^{2n} g(∑_{l=1}^{n} φ_{k,l}(x_l))` with a single
continuous outer function `g : ℝ → ℝ` and continuous inner functions
`φ_{k,l} : ℝ → ℝ`. -/
theorem kolmogorov_arnold (n : ℕ) (_hn : 1 ≤ n)
    (f : (Fin n → ℝ) → ℝ) (_hf : ContinuousOn f (Set.Icc 0 1)) :
    ∃ (g : ℝ → ℝ) (φ : Fin (2 * n + 1) → Fin n → ℝ → ℝ),
      Continuous g ∧ (∀ k l, Continuous (φ k l)) ∧
      ∀ x ∈ Set.Icc (0 : Fin n → ℝ) 1,
        f x = ∑ k, g (∑ l, φ k l (x l)) := by
  sorry
#65
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

The Landsberg–Schaar relation
landsberg_schaar

Verso theorem preview

theorem declaration uses `sorry`landsberg_schaar (p q : ℕ) (hp : Odd p) (hq : Odd q) : gaussS (2 * q : ℕ) p = Complex.exp ((Real.pi : ℂ) * Complex.I / 4) * gaussS (-(p : ℤ)) (2 * q) := p:ℕq:ℕhp:Odd phq:Odd q⊢ gaussS (↑(2 * q)) p = cexp (↑Real.pi * I / 4) * gaussS (-↑p) (2 * q) All goals completed! 🐙
#66
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Lax's approximation theorem for toral homeomorphisms
lax_approximation

Lean theorem statement

/-- **Lax's approximation theorem.** Every toral dynamical system on `𝕋^d`
(`d ≥ 1`) is approximated arbitrarily well in the metric `δ` by cyclic cube
exchange transformations. -/
theorem lax_approximation {d : ℕ} (hd : 0 < d) (T : ToralDynamicalSystem d)
    {ε : ℝ≥0∞} (hε : 0 < ε) :
    ∃ (n : ℕ) (S : VolumePreservingEquiv d),
      IsCyclicCubeExchange S n ∧ deltaDist T.toVolumePreservingEquiv S < ε := by
  sorry
#67
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Poincaré–Siegel linearisation theorem
poincare_siegel_linearisation

Lean theorem statement

/-- **Poincaré–Siegel linearisation theorem.** If `α` is Diophantine,
`λ = e^{2πiα}`, and `f` is holomorphic near `0` with `f 0 = 0` and
`f'(0) = λ`, then there is a holomorphic germ `u` with `u 0 = 0`,
`u'(0) = 1`, and `f(u z) = u(λ z)` for `z` near `0`. -/
theorem poincare_siegel
    (α : ℝ) (_hα : IsDiophantine α)
    (lam : ℂ) (_hlam : lam = Complex.exp (2 * Real.pi * Complex.I * (α : ℂ)))
    (f : ℂ → ℂ) (_hf : AnalyticAt ℂ f 0) (_hf0 : f 0 = 0)
    (_hmult : deriv f 0 = lam) :
    ∃ u : ℂ → ℂ, AnalyticAt ℂ u 0 ∧ u 0 = 0 ∧ deriv u 0 = 1 ∧
      ∀ᶠ z in nhds (0 : ℂ), f (u z) = u (lam * z) := by
  sorry
#68
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Anosov–Bowen shadowing lemma
anosov_bowen_shadowing

Lean theorem statement

/-- **Anosov–Bowen shadowing lemma** (Anosov 1967; Bowen 1975). Every
compact hyperbolic invariant set has the shadowing property. -/
theorem hyperbolic_has_shadowing
    (T : E d ≃ₜ E d) (K : Set (E d))
    (_hKc : IsCompact K) (_hK : IsHyperbolic T K) :
    HasShadowing (T : E d → E d) K := by
  sorry
#69
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Sobolev embedding theorem (Morrey regime)
sobolev_embedding_morrey

Verso theorem preview

theorem declaration uses `sorry`sobolev_embedding {n k r : ℕ} {α p : ℝ} (_hp : (n : ℝ) < p) (_hα : 0 < α) (_hα1 : α ≤ 1) (_hgap : (r : ℝ) + α < (k : ℝ) - n / p) (f : LeanEval.Analysis.SobolevMorreyProblem.E n → ℝ) (_hf : LeanEval.Analysis.SobolevMorreyProblem.MemSobolevWk k (ENNReal.ofReal p) f) : ∃ g : LeanEval.Analysis.SobolevMorreyProblem.E n → ℝ, f =ᵐ[volume] g ∧ LeanEval.Analysis.SobolevMorreyProblem.MemHolder r α g := n:ℕk:ℕr:ℕα:ℝp:ℝ_hp:↑n < p_hα:0 < α_hα1:α ≤ 1_hgap:↑r + α < ↑k - ↑n / pf:E n → ℝ_hf:MemSobolevWk k (ENNReal.ofReal p) f⊢ ∃ g, f =ᵐ[volume] g ∧ LeanEval.Analysis.SobolevMorreyProblem.MemHolder r α g All goals completed! 🐙
#70
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Equiangular lines with a fixed angle
annals_equiangular_lines_fixed_angle

Verso theorem preview

theorem declaration uses `sorry`theorem_1_2 (α : ℝ) (hα : α ∈ Set.Ioo 0 1) : let k := spectralRadiusOrder ((1 - α) / (2 * α)) (k < ⊤ → ∀ᶠ d in atTop, N α d = ⌊(k.toNat * (d - 1) : ℝ) / (k.toNat - 1 : ℝ)⌋₊) ∧ (k = ⊤ → ∃ e : ℕ → ℝ, e =o[atTop] (Nat.cast : ℕ → ℝ) ∧ ∀ d, N α d = d + e d) := α:ℝhα:α ∈ Set.Ioo 0 1⊢ let k := spectralRadiusOrder ((1 - α) / (2 * α)); (k < ⊤ → ∀ᶠ (d : ℕ) in atTop, N α d = ⌊↑k.toNat * (↑d - 1) / (↑k.toNat - 1)⌋₊) ∧ (k = ⊤ → ∃ e, e =o[atTop] Nat.cast ∧ ∀ (d : ℕ), ↑(N α d) = ↑d + e d) All goals completed! 🐙
#71
Thresholds versus fractional expectation-thresholds
annals_fractional_expectation_thresholds

Verso theorem preview

/-- The constant `K` in Theorem 1.1. -/ noncomputable def declaration uses `sorry`K : ℝ := sorry
/-- Statement of Theorem 1.1: There exists a universal constant `K` such that for any finite set `X` and any increasing collection of sets `𝓕` such that `l(𝓕)` is at least `2`, `p_c(𝓕) ≤ K * q_f(𝓕) * log l(𝓕)`. Note: The assumption that `l(𝓕)` is at least `2` is not explicitly in the paper but is needed because if `l(𝓕) = 1` then `Real.log (l 𝓕) = 0`, but `p_c 𝓕 ∈ (0,1)` (so the inequality clearly cannot hold). -/ theorem declaration uses `sorry`theorem_1_1 (X : Type*) [Fintype X] (𝓕 : Set (Set X)) (h𝓕 : IsUpperSet 𝓕) (hl𝓕 : 2 ≤ l 𝓕) : p_c 𝓕 ≤ K * q_f 𝓕 * Real.log (l 𝓕) := X:Type u_1inst✝:Fintype X𝓕:Set (Set X)h𝓕:IsUpperSet 𝓕hl𝓕:2 ≤ l 𝓕⊢ ↑(p_c 𝓕) ≤ K * ↑(q_f 𝓕) * Real.log ↑(l 𝓕) All goals completed! 🐙
#72
Rademacher type and Enflo type coincide
annals_rademacher_enflo_type

Verso theorem preview

theorem declaration uses `sorry`theorem_1_1 (p : ℝ) (h1p : 1 ≤ p) (hp2 : p ≤ 2) : TR X p ≤ TE X p ∧ TE X p ≤ (pi / sqrt 2) * TR X p := X:Type u_2inst✝²:NormedAddCommGroup Xinst✝¹:NormedSpace ℝ Xinst✝:CompleteSpace Xp:ℝh1p:1 ≤ php2:p ≤ 2⊢ TR X p ≤ TE X p ∧ TE X p ≤ ↑pi / ↑(sqrt 2) * TR X p All goals completed! 🐙
#73
Jordan curve theorem
jordan_curve

Verso theorem preview

theorem declaration uses `sorry`jordan_curve (r : Metric.sphere (0 : EuclideanSpace ℝ (Fin 2)) 1 → EuclideanSpace ℝ (Fin 2)) (_hcont : Continuous r) (_hinj : Function.Injective r) : Nat.card (ConnectedComponents ((Set.range r)ᶜ : Set (EuclideanSpace ℝ (Fin 2)))) = 2 := r:↑(Metric.sphere 0 1) → EuclideanSpace ℝ (Fin 2)_hcont:Continuous r_hinj:Function.Injective r⊢ Nat.card (ConnectedComponents ↑(Set.range r)ᶜ) = 2 All goals completed! 🐙
#74
Wiener–Lévy theorem
wiener_levy_analytic_calculus

Lean theorem statement

/-- **Wiener–Lévy theorem.** If `φ` is complex-analytic on a neighbourhood of
the range of a Wiener-algebra function `f`, then the composed function
`φ ∘ f` is again in the Wiener algebra. -/
theorem wiener_levy_analytic_calculus (f : C(AddCircle T, ℂ))
    (φ : ℂ → ℂ) (U : Set ℂ) (hf : InWienerAlgebra f)
    (hU : IsOpen U) (hrange : range f ⊆ U)
    (hφ : AnalyticOnNhd ℂ φ U) :
    ∃ g : C(AddCircle T, ℂ),
      (∀ x, g x = φ (f x)) ∧ InWienerAlgebra g := by
  sorry
#75
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Frobenius determinant theorem
frobenius_group_determinant

Verso theorem preview

theorem declaration uses `sorry`frobenius_group_determinant (G : Type*) [Group G] [Fintype G] [DecidableEq G] : ∃ (r : ℕ) (p : Fin r → MvPolynomial G ℂ), r = Nat.card (ConjClasses G) ∧ (∀ j, Irreducible (p j)) ∧ (∀ i j, i ≠ j → ¬ Associated (p i) (p j)) ∧ groupDeterminant G = ∏ j, (p j) ^ (p j).totalDegree := G:Type u_1inst✝²:Group Ginst✝¹:Fintype Ginst✝:DecidableEq G⊢ ∃ r p, r = Nat.card (ConjClasses G) ∧ (∀ (j : Fin r), Irreducible (p j)) ∧ (∀ (i j : Fin r), i ≠ j → ¬Associated (p i) (p j)) ∧ groupDeterminant G = ∏ j, p j ^ (p j).totalDegree All goals completed! 🐙
#76
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Wiener's 1/f theorem
wiener_inverse_closed

Lean theorem statement

/-- **Wiener's `1/f` theorem.** If a function on the circle belongs to the
Wiener algebra and has no zero on the circle, then its pointwise reciprocal
again belongs to the Wiener algebra. -/
theorem wiener_inverse_closed (f : C(AddCircle T, ℂ))
    (hf : InWienerAlgebra f) (hzero : ∀ x, f x ≠ 0) :
    ∃ g : C(AddCircle T, ℂ),
      (∀ x, g x = (f x)⁻¹) ∧ InWienerAlgebra g := by
  sorry
#77
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Kirk's normal-structure fixed point theorem
kirk_normal_structure

Verso theorem preview

theorem declaration uses `sorry`kirk_normal_structure [CompleteSpace E] (hE_reflexive : Function.Surjective (NormedSpace.inclusionInDoubleDual ℝ E)) (K : Set E) (hK_nonempty : K.Nonempty) (hK_closed : IsClosed K) (hK_bounded : Bornology.IsBounded K) (hK_convex : Convex ℝ K) (hK_normal : LeanEval.Topology.KirkNormalStructure.HasNormalStructure K) (T : K → K) (hT : LeanEval.Topology.KirkNormalStructure.IsNonexpansiveSelfMap K T) : ∃ x : K, IsFixedPt T x := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:CompleteSpace EhE_reflexive:Surjective ⇑(NormedSpace.inclusionInDoubleDual ℝ E)K:Set EhK_nonempty:K.NonemptyhK_closed:IsClosed KhK_bounded:Bornology.IsBounded KhK_convex:Convex ℝ KhK_normal:HasNormalStructure KT:↑K → ↑KhT:IsNonexpansiveSelfMap K T⊢ ∃ x, IsFixedPt T x All goals completed! 🐙
#78
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Shannon capacity of the pentagon
shannon_capacity_pentagon

Lean theorem statement

/-- **Lovász's theorem on Shannon capacity of the pentagon** (§238).
The Shannon capacity of the five-cycle is `√5`. -/
theorem shannon_capacity_pentagon :
    HasShannonCapacity (SimpleGraph.cycleGraph 5) (Real.sqrt 5) := by
  sorry
#79
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Nyquist–Shannon sampling theorem
nyquist_shannon_sampling

Verso theorem preview

theorem declaration uses `sorry`nyquist_shannon_sampling (f : 𝓢(ℝ, ℂ)) (hf : LeanEval.Analysis.NyquistShannon.FourierSupportedInNyquist f) : ∀ t : ℝ, Summable (fun n : ℤ ↦ f (n : ℝ) * sinc (Real.pi * ((n : ℝ) - t))) ∧ f t = ∑' n : ℤ, f (n : ℝ) * sinc (Real.pi * ((n : ℝ) - t)) := f:𝓢(ℝ, ℂ)hf:FourierSupportedInNyquist f⊢ ∀ (t : ℝ), (Summable fun n => f ↑n * sinc (Real.pi * (↑n - t))) ∧ f t = ∑' (n : ℤ), f ↑n * sinc (Real.pi * (↑n - t)) All goals completed! 🐙
#80
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Fundamental theorem of Riemannian geometry (Levi-Civita)
levi_civita_exists_unique

Lean theorem statement

/-- **Fundamental theorem of Riemannian geometry** (Levi-Civita). On a
`C^∞` finite-dimensional Riemannian manifold there exists a smooth
torsion-free metric-compatible covariant derivative on `TM`, and any other
such connection agrees with it on smooth vector fields. -/
theorem levi_civita_exists_unique
    {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E]
      [FiniteDimensional ℝ E] [CompleteSpace E]
    {H : Type*} [TopologicalSpace H] {I : ModelWithCorners ℝ E H}
    {M : Type*} [TopologicalSpace M] [T2Space M] [ChartedSpace H M]
      [IsManifold I ∞ M]
    [RiemannianBundle (fun (x : M) ↦ TangentSpace I x)]
    [IsContMDiffRiemannianBundle I ∞ E (fun (x : M) ↦ TangentSpace I x)] :
    ∃ cov : CovariantDerivative I E (TangentSpace I (M := M)),
      (ContMDiffCovariantDerivative cov ∞ ∧
        cov.torsion = 0 ∧ IsMetricCompatible cov) ∧
      ∀ cov' : CovariantDerivative I E (TangentSpace I (M := M)),
        (ContMDiffCovariantDerivative cov' ∞ ∧
          cov'.torsion = 0 ∧ IsMetricCompatible cov') →
        SameOnSmooth cov cov' := by
  sorry
#81
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Halmos's generic weak-mixing theorem
halmos_generic_weak_mixing

Verso theorem preview

theorem declaration uses `sorry`generic_weakly_mixing [StandardBorelSpace X] (m : Measure X) [IsProbabilityMeasure m] [NullSingletonClass m] : (∃ G : Set (LeanEval.Dynamics.HalmosGenericWeakMixingProblem.Automorphism m), IsGδ G ∧ Dense G ∧ ∀ T ∈ G, LeanEval.Dynamics.HalmosGenericWeakMixingProblem.IsWeaklyMixing m T) ∧ (∀ T : LeanEval.Dynamics.HalmosGenericWeakMixingProblem.Automorphism m, LeanEval.Dynamics.HalmosGenericWeakMixingProblem.IsWeaklyMixing m T → Ergodic (T.toEquiv : X → X) m) := X:Type u_1inst✝³:MeasurableSpace Xinst✝²:StandardBorelSpace Xm:Measure Xinst✝¹:IsProbabilityMeasure minst✝:NullSingletonClass m⊢ (∃ G, IsGδ G ∧ Dense G ∧ ∀ T ∈ G, IsWeaklyMixing m T) ∧ ∀ (T : Automorphism m), IsWeaklyMixing m T → Ergodic (⇑T.toEquiv) m All goals completed! 🐙
#82
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

The Lindemann–Weierstrass theorem
lindemann_weierstrass

Lean theorem statement

/-- **Lindemann–Weierstrass theorem.** If `x₁, …, xₙ ∈ ℂ` are algebraic over `ℚ`
and ℚ-linearly independent, then `e^{x₁}, …, e^{xₙ}` are algebraically
independent over `ℚ`. -/
theorem lindemann_weierstrass {n : ℕ} (x : Fin n → ℂ)
    (h_alg : ∀ i, IsAlgebraic ℚ (x i))
    (h_lin : LinearIndependent ℚ x) :
    AlgebraicIndependent ℚ (fun i => Complex.exp (x i)) := by
  sorry
#83
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Boone–Higman theorem (easy direction)
boone_higman_embedding

Verso theorem preview

theorem declaration uses `sorry`boone_higman_embedding {G H K : Type*} [Group G] [Group H] [Group K] [IsSimpleGroup H] [Group.IsFinitelyPresented K] (f : G →* H) (hf : Function.Injective f) (g : H →* K) (hg : Function.Injective g) {n : ℕ} (φ : FreeGroup (Fin n) →* G) (hsurj : Function.Surjective φ) (hker : (MonoidHom.ker φ).IsFinitelyNormallyGenerated) : LeanEval.GroupTheory.BooneHigmanEmbedding.WordProblemSolvable φ := G:Type u_1H:Type u_2K:Type u_3inst✝⁴:Group Ginst✝³:Group Hinst✝²:Group Kinst✝¹:IsSimpleGroup Hinst✝:Group.IsFinitelyPresented Kf:G →* Hhf:Function.Injective ⇑fg:H →* Khg:Function.Injective ⇑gn:ℕφ:FreeGroup (Fin n) →* Ghsurj:Function.Surjective ⇑φhker:φ.ker.IsFinitelyNormallyGenerated⊢ WordProblemSolvable φ All goals completed! 🐙
#84
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Choquet's representation theorem
choquet_representation_theorem

Verso theorem preview

theorem declaration uses `sorry`choquet [MeasurableSpace X] [BorelSpace X] (K : Set X) (hK_cpt : IsCompact K) (hK_cvx : Convex ℝ K) {x : X} (hx : x ∈ K) : ∃ μ : Measure X, IsProbabilityMeasure μ ∧ μ (K.extremePoints ℝ)ᶜ = 0 ∧ x = ∫ y, y ∂μ := X:Type u_1inst✝⁴:NormedAddCommGroup Xinst✝³:NormedSpace ℝ Xinst✝²:CompleteSpace Xinst✝¹:MeasurableSpace Xinst✝:BorelSpace XK:Set XhK_cpt:IsCompact KhK_cvx:Convex ℝ Kx:Xhx:x ∈ K⊢ ∃ μ, IsProbabilityMeasure μ ∧ μ (Set.extremePoints ℝ K)ᶜ = 0 ∧ x = ∫ (y : X), y ∂μ All goals completed! 🐙
#85
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Hausdorff moment problem: absolute-continuity criterion
hausdorff_absolute_continuity

Verso theorem preview

theorem declaration uses `sorry`hausdorff_absolute_continuity {d : ℕ} (μ : Measure (EuclideanSpace ℝ (Fin d))) [IsProbabilityMeasure μ] (hμ : μ ((LeanEval.Analysis.HausdorffAbsoluteContinuity.cube d)ᶜ) = 0) : LeanEval.Analysis.HausdorffAbsoluteContinuity.UniformlyAbsolutelyContinuous μ (volume.restrict (LeanEval.Analysis.HausdorffAbsoluteContinuity.cube d)) ↔ ∃ C : ℝ, ∀ k n : Fin d → ℕ, k ≤ n → diff (momentOf μ) k n ≤ C * diff (momentOf (volume.restrict (LeanEval.Analysis.HausdorffAbsoluteContinuity.cube d))) k n := d:ℕμ:Measure (EuclideanSpace ℝ (Fin d))inst✝:IsProbabilityMeasure μhμ:μ (cube d)ᶜ = 0⊢ UniformlyAbsolutelyContinuous μ (volume.restrict (cube d)) ↔ ∃ C, ∀ (k n : Fin d → ℕ), k ≤ n → diff (momentOf μ) k n ≤ C * diff (momentOf (volume.restrict (cube d))) k n All goals completed! 🐙
#86
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

The Hausdorff–Hildebrandt–Schoenberg moment theorem
hausdorff_hildebrandt_schoenberg

Verso theorem preview

theorem declaration uses `sorry`hausdorff_hildebrandt_schoenberg {d : ℕ} (a : (Fin d → ℕ) → ℝ) : LeanEval.Analysis.IsMomentConfiguration a ↔ LeanEval.Analysis.HausdorffBounded a := d:ℕa:(Fin d → ℕ) → ℝ⊢ IsMomentConfiguration a ↔ HausdorffBounded a All goals completed! 🐙
#87
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

The Hausdorff positivity (complete-monotonicity) criterion
hausdorff_positivity_criterion

Lean theorem statement

/-- **Hausdorff positivity criterion** (Hausdorff 1921). A moment configuration
comes from a positive measure iff all its iterated backward differences are
nonnegative — i.e. the sequence is *completely monotone*: `(Δᵏa)ₙ ≥ 0` for all
`k ≤ n`. -/
theorem hausdorff_positivity {d : ℕ} (a : (Fin d → ℕ) → ℝ) :
    IsPositiveMomentConfiguration a ↔ ∀ k n : Fin d → ℕ, k ≤ n → 0 ≤ diff a k n := by
  sorry
#88
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Lindemann's theorem (e and π transcendental)
lindemann

Lean theorem statement

/-- **Lindemann's theorem.** Both `e = exp 1` and `π` are transcendental over
`ℤ`. -/
theorem lindemann :
    Transcendental ℤ (Real.exp 1) ∧ Transcendental ℤ Real.pi := by
  sorry
#89
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Mountain Pass Theorem (Ambrosetti–Rabinowitz 1973)
mountain_pass

Verso theorem preview

theorem declaration uses `sorry`mountain_pass (f : E → ℝ) (_hf : ContDiff ℝ 1 f) (_hps : LeanEval.Analysis.MountainPassProblem.PalaisSmale f) {a b : E} {ε r : ℝ} (_hmr : LeanEval.Analysis.MountainPassProblem.MountainRange f a b ε r) : ∃ x : E, LeanEval.Analysis.MountainPassProblem.IsCriticalPoint f x ∧ f x = mountainPassLevel f a b ∧ ε ≤ mountainPassLevel f a b := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:CompleteSpace Ef:E → ℝ_hf:ContDiff ℝ 1 f_hps:PalaisSmale fa:Eb:Eε:ℝr:ℝ_hmr:MountainRange f a b ε r⊢ ∃ x, IsCriticalPoint f x ∧ f x = mountainPassLevel f a b ∧ ε ≤ mountainPassLevel f a b All goals completed! 🐙
#90
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Pascal's theorem
pascal

Lean theorem statement

/-- **Pascal's theorem.** Six distinct points on a non-singular conic determine
three collinear intersection points `Aᵢ Bⱼ ∩ Aⱼ Bᵢ`. -/
theorem pascal
    (M : Matrix (Fin 3) (Fin 3) ℝ) (hMsymm : M.IsSymm) (hMdet : M.det ≠ 0)
    (a₁ a₂ a₃ b₁ b₂ b₃ : Fin 3 → ℝ)
    (ha₁ : a₁ ≠ 0) (ha₂ : a₂ ≠ 0) (ha₃ : a₃ ≠ 0)
    (hb₁ : b₁ ≠ 0) (hb₂ : b₂ ≠ 0) (hb₃ : b₃ ≠ 0)
    (hdist : [a₁, a₂, a₃, b₁, b₂, b₃].Pairwise (fun v w => ¬ SamePoint v w))
    (hA₁ : OnConic M a₁) (hA₂ : OnConic M a₂) (hA₃ : OnConic M a₃)
    (hB₁ : OnConic M b₁) (hB₂ : OnConic M b₂) (hB₃ : OnConic M b₃) :
    Collinear3 (meet a₁ b₂ a₂ b₁) (meet a₁ b₃ a₃ b₁) (meet a₂ b₃ a₃ b₂) := by
  sorry
#91
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Sard's regular-value corollary
regular_value_ae

Lean theorem statement

/-- **Regular value corollary (Sard).** For a smooth `f : ℝᵐ → ℝ`, almost every
`c ∈ ℝ` is a regular value. -/
theorem regular_value_ae {m : ℕ} (f : EuclideanSpace ℝ (Fin m) → ℝ)
    (hf : ContDiff ℝ ∞ f) :
    ∀ᵐ c ∂(volume : Measure ℝ), IsRegularValue f c := by
  sorry
#92
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Tverberg's theorem
tverberg_theorem

Lean theorem statement

/-- **Tverberg's theorem.** Any `(r-1)(d+1)+1` points in `ℝ^d` admit an
`r`-part Tverberg partition. -/
theorem tverberg_theorem (d r : ℕ) (hr : 1 ≤ r)
    (f : Fin ((r - 1) * (d + 1) + 1) → Space d) :
    HasTverbergPartition (r := r) f := by
  sorry
#93
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Lidskii's inequality
lidskii_inequality

Verso theorem preview

theorem declaration uses `sorry`lidskii_inequality {n : Type*} [Fintype n] [DecidableEq n] {A B : Matrix n n ℂ} (hA : A.IsHermitian) (hB : B.IsHermitian) {p : ℝ} (_hp : 1 ≤ p) : ∑ j, |hA.eigenvalues₀ j - hB.eigenvalues₀ j| ^ p ≤ ∑ j, |(hB.sub hA).eigenvalues₀ j| ^ p := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℂB:Matrix n n ℂhA:A.IsHermitianhB:B.IsHermitianp:ℝ_hp:1 ≤ p⊢ ∑ j, |hA.eigenvalues₀ j - hB.eigenvalues₀ j| ^ p ≤ ∑ j, |⋯.eigenvalues₀ j| ^ p All goals completed! 🐙
#94
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with prompting and submission by John Jennings. No human review of the proofs was performed; correctness was checked only through the benchmark comparator.

Rokhlin lemma
rokhlin_lemma

Lean theorem statement

/-- **Rokhlin lemma, not-necessarily-invertible forward-image form.** For every
aperiodic measure-preserving transformation `T` of a standard Borel probability
space `(Ω, μ)`, every height `n ≥ 1`, and every `ε > 0`, there is a measurable
base whose `n` forward-image floors `B, T B, …, T^{n−1} B` are pairwise
disjoint and whose union has outer measure at least `1 − ε`. No invertibility
assumption is made. -/
theorem rokhlin_lemma {Ω : Type*} [MeasurableSpace Ω]
    [StandardBorelSpace Ω]
    (μ : Measure Ω) [IsProbabilityMeasure μ] (T : Ω → Ω)
    (_hT : MeasurePreserving T μ μ) (_hap : IsAperiodic T μ)
    (n : ℕ) (_hn : 1 ≤ n) {ε : ENNReal} (_hε : 0 < ε) :
    ∃ B : Set Ω, IsRokhlinTower T B n ∧
      μ (towerUnion T B n) ≥ 1 - ε := by
  sorry
#95
Fang–Xia: tiling of the symmetric group by transpositions implies λ-transitivity
fang_xia_tiling_partition_transitive

Verso theorem preview

theorem declaration uses `sorry`fang_xia_partition_transitive_of_tiling {n : ℕ} {Y : Set (Equiv.Perm (Fin n))} (_h : LeanEval.Combinatorics.FangXiaTilingProblem.IsTiling (LeanEval.Combinatorics.FangXiaTilingProblem.transpositionsWithOne n) Y) : ∀ lam : LeanEval.Combinatorics.FangXiaTilingProblem.PartitionShape n, 0 ≤ lam.contentSum → LeanEval.Combinatorics.FangXiaTilingProblem.IsPartitionTransitive Y lam := n:ℕY:Set (Equiv.Perm (Fin n))_h:IsTiling (transpositionsWithOne n) Y⊢ ∀ (lam : PartitionShape n), 0 ≤ lam.contentSum → IsPartitionTransitive Y lam All goals completed! 🐙
#96
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Local stable/unstable sets at a hyperbolic fixed point (set-level Hadamard–Perron)
stable_unstable_manifolds

Verso theorem preview

theorem declaration uses `sorry`stable_unstable_manifolds_exist (n : ℕ) (f : LeanEval.Dynamics.StableUnstableManifoldsProblem.E n → LeanEval.Dynamics.StableUnstableManifoldsProblem.E n) (x₀ : LeanEval.Dynamics.StableUnstableManifoldsProblem.E n) (_hf : ContDiffAt ℝ 1 f x₀) (_hfix : f x₀ = x₀) (_hhyp : LeanEval.Dynamics.StableUnstableManifoldsProblem.IsHyperbolicLinear (fderiv ℝ f x₀)) (_hf_inv : (fderiv ℝ f x₀).IsInvertible) : ∃ U : Set (LeanEval.Dynamics.StableUnstableManifoldsProblem.E n), IsOpen U ∧ x₀ ∈ U ∧ ∃ Ws Wu : Set (LeanEval.Dynamics.StableUnstableManifoldsProblem.E n), Ws = {x | (∀ k : ℕ, f^[k] x ∈ U) ∧ Tendsto (fun k => f^[k] x) atTop (𝓝 x₀)} ∧ Wu = {x | ∃ y : ℕ → LeanEval.Dynamics.StableUnstableManifoldsProblem.E n, y 0 = x ∧ (∀ k : ℕ, y k ∈ U) ∧ (∀ k : ℕ, f (y (k + 1)) = y k) ∧ Tendsto y atTop (𝓝 x₀)} ∧ Ws ∩ Wu = {x₀} := n:ℕf:E n → E nx₀:E n_hf:ContDiffAt ℝ 1 f x₀_hfix:f x₀ = x₀_hhyp:IsHyperbolicLinear (fderiv ℝ f x₀)_hf_inv:(fderiv ℝ f x₀).IsInvertible⊢ ∃ U, IsOpen U ∧ x₀ ∈ U ∧ ∃ Ws Wu, Ws = {x | (∀ (k : ℕ), f^[k] x ∈ U) ∧ Tendsto (fun k => f^[k] x) atTop (𝓝 x₀)} ∧ Wu = {x | ∃ y, y 0 = x ∧ (∀ (k : ℕ), y k ∈ U) ∧ (∀ (k : ℕ), f (y (k + 1)) = y k) ∧ Tendsto y atTop (𝓝 x₀)} ∧ Ws ∩ Wu = {x₀} All goals completed! 🐙
#97
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Fraser: Fourier decay for finite-field Kakeya sets is q^{-1} and sharp
fraser_kakeya_fourier_decay

Verso theorem preview

theorem declaration uses `sorry`fraser_kakeya_fourier_decay_and_sharp {d : ℕ} (_hd : 2 ≤ d) {K : Set (LeanEval.Combinatorics.FraserKakeyaProblem.Space F d)} (_hK : LeanEval.Combinatorics.FraserKakeyaProblem.IsKakeya K) (χ : AddChar F ℂ) (_hχ : χ ≠ 1) : (∃ μ : LeanEval.Combinatorics.FraserKakeyaProblem.Space F d → ℝ, LeanEval.Combinatorics.FraserKakeyaProblem.IsProbabilityMeasureOn K μ ∧ ∀ ξ : LeanEval.Combinatorics.FraserKakeyaProblem.Space F d, ξ ≠ 0 → ‖fourier χ μ ξ‖ ≤ (Fintype.card F : ℝ)⁻¹) ∧ (∀ κ : ℝ, 0 < κ → κ < 1 → ∃ Q : ℕ, ∀ (F' : Type*) [Field F'] [Fintype F'] [DecidableEq F'], Q ≤ Fintype.card F' → ∃ K' : Set (LeanEval.Combinatorics.FraserKakeyaProblem.Space F' d), LeanEval.Combinatorics.FraserKakeyaProblem.IsKakeya K' ∧ ∀ μ : LeanEval.Combinatorics.FraserKakeyaProblem.Space F' d → ℝ, LeanEval.Combinatorics.FraserKakeyaProblem.IsProbabilityMeasureOn K' μ → ∃ ξ : LeanEval.Combinatorics.FraserKakeyaProblem.Space F' d, ξ ≠ 0 ∧ κ * (Fintype.card F' : ℝ)⁻¹ ≤ ‖fourier (AddChar.FiniteField.primitiveChar_to_Complex F') μ ξ‖) := F:Type u_1inst✝²:Field Finst✝¹:Fintype Finst✝:DecidableEq Fd:ℕ_hd:2 ≤ dK:Set (Space F d)_hK:IsKakeya Kχ:AddChar F ℂ_hχ:χ ≠ 1⊢ (∃ μ, IsProbabilityMeasureOn K μ ∧ ∀ (ξ : Space F d), ξ ≠ 0 → ‖LeanEval.Combinatorics.FraserKakeyaProblem.fourier χ μ ξ‖ ≤ (↑(Fintype.card F))⁻¹) ∧ ∀ (κ : ℝ), 0 < κ → κ < 1 → ∃ Q, ∀ (F' : Type u_2) [inst : Field F'] [inst_1 : Fintype F'] [DecidableEq F'], Q ≤ Fintype.card F' → ∃ K', IsKakeya K' ∧ ∀ (μ : Space F' d → ℝ), IsProbabilityMeasureOn K' μ → ∃ ξ, ξ ≠ 0 ∧ κ * (↑(Fintype.card F'))⁻¹ ≤ ‖LeanEval.Combinatorics.FraserKakeyaProblem.fourier (AddChar.FiniteField.primitiveChar_to_Complex F') μ ξ‖ All goals completed! 🐙
#98
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Liouville–Arnold theorem on integrable systems
liouville_arnold

Verso theorem preview

theorem declaration uses `sorry`liouville_arnold {n : ℕ} (F : Fin n → LeanEval.Geometry.LiouvilleArnold.E n → ℝ) (U : Set (LeanEval.Geometry.LiouvilleArnold.E n)) (_hU : IsOpen U) (_hLI : LeanEval.Geometry.LiouvilleArnold.IsLiouvilleIntegrable F U) (c : Fin n → ℝ) (_hMc_sub : LeanEval.Geometry.LiouvilleArnold.levelSet F c ⊆ U) (_hMc_compact : IsCompact (LeanEval.Geometry.LiouvilleArnold.levelSet F c)) (_hMc_connected : IsConnected (LeanEval.Geometry.LiouvilleArnold.levelSet F c)) : Nonempty ((LeanEval.Geometry.LiouvilleArnold.levelSet F c) ≃ₜ (Fin n → AddCircle (1 : ℝ))) := n:ℕF:Fin n → E n → ℝU:Set (E n)_hU:IsOpen U_hLI:IsLiouvilleIntegrable F Uc:Fin n → ℝ_hMc_sub:levelSet F c ⊆ U_hMc_compact:IsCompact (levelSet F c)_hMc_connected:IsConnected (levelSet F c)⊢ Nonempty (↑(levelSet F c) ≃ₜ (Fin n → AddCircle 1)) All goals completed! 🐙
#99
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Independence of the parallel postulate
parallel_postulate_independent

Verso theorem preview

theorem declaration uses `sorry`parallel_postulate_independent : (∃ (M : Type) (T : LeanEval.Geometry.TarskiAbsolute M), LeanEval.Geometry.Euclidean M T) ∧ (∃ (M : Type) (T : LeanEval.Geometry.TarskiAbsolute M), ¬ LeanEval.Geometry.Euclidean M T) := ⊢ (∃ M T, Euclidean M T) ∧ ∃ M T, ¬Euclidean M T All goals completed! 🐙
#100
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Frobenius's theorem: the Frobenius kernel is normal
frobenius_kernel_isNormal

Verso theorem preview

theorem declaration uses `sorry`frobenius_kernel_isNormal (G X : Type) [Group G] [Fintype G] [Fintype X] [MulAction G X] [FaithfulSMul G X] (hcard : 2 ≤ Fintype.card X) (htrans : ∀ x y : X, ∃ g : G, g • x = y) (hstab : ∀ x : X, MulAction.stabilizer G x ≠ ⊥) (hfrob : ∀ g : G, g ≠ 1 → ∀ x y : X, g • x = x → g • y = y → x = y) : ∃ N : Subgroup G, N.Normal ∧ (N : Set G) = {1} ∪ {g : G | ∀ x : X, g • x ≠ x} := G:TypeX:Typeinst✝⁴:Group Ginst✝³:Fintype Ginst✝²:Fintype Xinst✝¹:MulAction G Xinst✝:FaithfulSMul G Xhcard:2 ≤ Fintype.card Xhtrans:∀ (x y : X), ∃ g, g • x = yhstab:∀ (x : X), MulAction.stabilizer G x ≠ ⊥hfrob:∀ (g : G), g ≠ 1 → ∀ (x y : X), g • x = x → g • y = y → x = y⊢ ∃ N, N.Normal ∧ ↑N = {1} ∪ {g | ∀ (x : X), g • x ≠ x} All goals completed! 🐙
#101
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Chen theorem for Markoff graphs
dvd_card_connectedComponent_markoffGraph

Verso theorem preview

theorem declaration uses `sorry`dvd_card_connectedComponent_markoffGraph {p : ℕ} (hp : Nat.Prime p) (hgt : 3 < p) : ∀ c : (LeanEval.Combinatorics.markoffGraph p).ConnectedComponent, p ∣ Nat.card c := p:ℕhp:Nat.Prime phgt:3 < p⊢ ∀ (c : (markoffGraph p).ConnectedComponent), p ∣ Nat.card ↥c All goals completed! 🐙
#102
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration by Stefano Rocca and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Chudnovsky formula for pi inverse
chudnovsky_formula_for_pi_inv

Verso theorem preview

theorem declaration uses `sorry`chudnovsky_formula_for_pi_inv : chudnovskySum = π⁻¹ := ⊢ chudnovskySum = π⁻¹ All goals completed! 🐙
#103
Peano existence theorem for ODEs
peano_existence

Verso theorem preview

theorem declaration uses `sorry`peano_existence {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] {f : E → E} (hf : Continuous f) (x₀ : E) : ∃ a : ℝ, 0 < a ∧ ∃ α : ℝ → E, α 0 = x₀ ∧ ∀ t ∈ Ioo (-a) a, HasDerivAt α (f (α t)) t := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:FiniteDimensional ℝ Ef:E → Ehf:Continuous fx₀:E⊢ ∃ a, 0 < a ∧ ∃ α, α 0 = x₀ ∧ ∀ t ∈ Ioo (-a) a, HasDerivAt α (f (α t)) t All goals completed! 🐙
#104
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Complete reducibility for compact groups
compact_group_semisimple

Verso theorem preview

theorem declaration uses `sorry`compact_group_semisimple {G V : Type*} [Group G] [TopologicalSpace G] [IsTopologicalGroup G] [CompactSpace G] [NormedAddCommGroup V] [NormedSpace ℝ V] [FiniteDimensional ℝ V] (ρ : Representation ℝ G V) (hρ : Continuous fun p : G × V => ρ p.1 p.2) : ρ.IsSemisimpleRepresentation := G:Type u_1V:Type u_2inst✝⁶:Group Ginst✝⁵:TopologicalSpace Ginst✝⁴:IsTopologicalGroup Ginst✝³:CompactSpace Ginst✝²:NormedAddCommGroup Vinst✝¹:NormedSpace ℝ Vinst✝:FiniteDimensional ℝ Vρ:Representation ℝ G Vhρ:Continuous fun p => (ρ p.1) p.2⊢ ρ.IsSemisimpleRepresentation All goals completed! 🐙
#105
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Baer–Suzuki theorem
baer_suzuki

Verso theorem preview

theorem declaration uses `sorry`baer_suzuki {G : Type*} [Group G] [Finite G] {p : ℕ} [Fact p.Prime] (x : G) : x ∈ LeanEval.GroupTheory.Defs.pCore p G ↔ ∀ g : G, IsPGroup p (Subgroup.closure ({x, g * x * g⁻¹} : Set G)) := G:Type u_1inst✝²:Group Ginst✝¹:Finite Gp:ℕinst✝:Fact (Nat.Prime p)x:G⊢ x ∈ pCore p G ↔ ∀ (g : G), IsPGroup p ↥(Subgroup.closure {x, g * x * g⁻¹}) All goals completed! 🐙
#106
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with prompting and submission by John Jennings. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Jordan normal form
jordan_normal_form

Lean theorem statement

/-- **Jordan normal form.** Over an algebraically closed field, every
endomorphism of `Kⁿ` admits a Jordan-chain basis. -/
theorem jordan_normal_form {K : Type*} [Field K] [IsAlgClosed K] (n : ℕ)
    (f : Module.End K (StdSpace K n)) :
    Nonempty (JordanChainBasis f) := by
  sorry
#107
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Lidskii–Last eigenvalue-perturbation theorem
lidskii_last

Verso theorem preview

theorem declaration uses `sorry`lidskii_last {n : Type*} [Fintype n] [DecidableEq n] {A B : Matrix n n ℂ} (hA : A.IsHermitian) (hB : B.IsHermitian) : ∑ j, |hA.eigenvalues₀ j - hB.eigenvalues₀ j| ≤ ∑ i, ∑ j, ‖A i j - B i j‖ := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℂB:Matrix n n ℂhA:A.IsHermitianhB:B.IsHermitian⊢ ∑ j, |hA.eigenvalues₀ j - hB.eigenvalues₀ j| ≤ ∑ i, ∑ j, ‖A i j - B i j‖ All goals completed! 🐙
#108
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with prompting and submission by John Jennings. No human review of the proofs was performed; correctness was checked only through the benchmark comparator.

Solvable extensions ↔ solvable groups (the missing converse in Abel–Ruffini)
solvable_by_radicals_converse

Lean theorem statement

/-- **Solvable extensions ↔ solvable groups.** For a field `F` of
characteristic zero and a nonzero `p : F[X]`, every root of `p` in
`AlgebraicClosure F` lies in `solvableByRad F (AlgebraicClosure F)`
iff `p.Gal` is solvable. -/
theorem solvable_iff_solvableByRad (F : Type*) [Field F] [CharZero F]
    (p : F[X]) (_hp : p ≠ 0) :
    (∀ x : AlgebraicClosure F, aeval x p = 0 →
        x ∈ solvableByRad F (AlgebraicClosure F)) ↔ Group.IsSolvable p.Gal := by
  sorry
#109
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Hippocrates' theorem on lunes
hippocrates_lunes

Verso theorem preview

theorem declaration uses `sorry`hippocrates_lunes (a b : ℝ) (ha : 0 < a) (hb : 0 < b) : volume (LeanEval.Geometry.HippocratesLunes.horizontalLune a b) + volume (LeanEval.Geometry.HippocratesLunes.verticalLune a b) = volume (LeanEval.Geometry.HippocratesLunes.rightTriangle a b) := a:ℝb:ℝha:0 < ahb:0 < b⊢ volume (horizontalLune a b) + volume (verticalLune a b) = volume (rightTriangle a b) All goals completed! 🐙
#110
How produced

Autoformalized using Aristotle (Harmonic), orchestrated by Amogh Parab.

Sard's theorem (critical-set image has measure zero)
sard_theorem

Verso theorem preview

theorem declaration uses `sorry`sard {m n : ℕ} (f : LeanEval.Geometry.SardTheoremProblem.E m → LeanEval.Geometry.SardTheoremProblem.E n) (_hf : ContDiff ℝ ∞ f) : volume (LeanEval.Geometry.SardTheoremProblem.criticalValues f) = 0 := m:ℕn:ℕf:E m → E n_hf:ContDiff ℝ ∞ f⊢ volume (criticalValues f) = 0 All goals completed! 🐙
#111
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Monge–Kantorovich existence theorem
monge_kantorovich

Verso theorem preview

theorem declaration uses `sorry`monge_kantorovich_exists {X Y : Type*} [TopologicalSpace X] [PolishSpace X] [MeasurableSpace X] [BorelSpace X] [TopologicalSpace Y] [PolishSpace Y] [MeasurableSpace Y] [BorelSpace Y] (P : Measure X) (Q : Measure Y) [IsProbabilityMeasure P] [IsProbabilityMeasure Q] (c : X × Y → ENNReal) (_hc : Continuous c) : ∃ π ∈ LeanEval.Analysis.Couplings P Q, ∀ π' ∈ LeanEval.Analysis.Couplings P Q, kantorovichCost c π ≤ kantorovichCost c π' := X:Type u_1Y:Type u_2inst✝⁹:TopologicalSpace Xinst✝⁸:PolishSpace Xinst✝⁷:MeasurableSpace Xinst✝⁶:BorelSpace Xinst✝⁵:TopologicalSpace Yinst✝⁴:PolishSpace Yinst✝³:MeasurableSpace Yinst✝²:BorelSpace YP:Measure XQ:Measure Yinst✝¹:IsProbabilityMeasure Pinst✝:IsProbabilityMeasure Qc:X × Y → ENNReal_hc:Continuous c⊢ ∃ π ∈ Couplings P Q, ∀ π' ∈ Couplings P Q, kantorovichCost c π ≤ kantorovichCost c π' All goals completed! 🐙
#112
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Furstenberg–Weiss topological multiple recurrence (single-transformation form)
furstenberg_topological

Lean theorem statement

/-- **Furstenberg–Weiss topological multiple recurrence** (single-
transformation form). Every homeomorphism `T` of a nonempty compact
metric space `X` has a multiply recurrent point. -/
theorem furstenberg_topological_recurrence {X : Type*} [MetricSpace X]
    [CompactSpace X] [Nonempty X] (T : X ≃ₜ X) :
    ∃ x : X, IsMultiplyRecurrent (T : X → X) x := by
  sorry
#113
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Kakutani fixed-point theorem
kakutani_fixed_point

Lean theorem statement

/-- **Kakutani fixed-point theorem.** Every upper-hemicontinuous
correspondence `F` from a nonempty compact convex `K ⊆ ℝᵈ` to itself, with
nonempty convex closed values, has a fixed point `x ∈ F x`. -/
theorem kakutani_fixed_point {d : ℕ}
    {K : Set (EuclideanSpace ℝ (Fin d))}
    (_hK_compact : IsCompact K) (_hK_convex : Convex ℝ K)
    (_hK_nonempty : K.Nonempty)
    (F : EuclideanSpace ℝ (Fin d) → Set (EuclideanSpace ℝ (Fin d)))
    (_hF_uhc : IsUpperHemicontinuous F)
    (_hF_nonempty : ∀ x ∈ K, (F x).Nonempty)
    (_hF_convex : ∀ x ∈ K, Convex ℝ (F x))
    (_hF_closed : ∀ x ∈ K, IsClosed (F x))
    (_hF_maps : ∀ x ∈ K, F x ⊆ K) :
    ∃ x ∈ K, x ∈ F x := by
  sorry
#114
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with prompting and submission by John Jennings. No human review of the proofs was performed; correctness was checked only through the benchmark comparator. The Brouwer fixed-point theorem formalization component of this proof was extracted from Aristotle's proof `brouwer_fixed_point`.

Nash equilibrium existence theorem
nash_equilibrium_exists

Lean theorem statement

/-- **Nash equilibrium existence theorem.** Every finite `n`-player game
with nonempty finite pure-strategy sets and arbitrary real payoffs admits
at least one mixed-strategy Nash equilibrium. -/
theorem nash_equilibrium_exists {n : ℕ} {S : Fin n → Type*}
    [∀ i, Fintype (S i)] [∀ i, Nonempty (S i)]
    (u : Fin n → StrategyProfile n S → ℝ) :
    ∃ σ : ∀ i, S i → ℝ, IsNashEquilibrium u σ := by
  sorry
#115
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Sturm's theorem
sturm

Lean theorem statement

/-- **Sturm's theorem.** For a squarefree real polynomial `p` and an interval
`(a, b)` with `a < b` whose endpoints are not roots of `p`, the number of
distinct roots of `p` in `(a, b)` equals `σ(a) − σ(b)`. -/
theorem sturm (p : ℝ[X]) (hp : Squarefree p) {a b : ℝ} (hab : a < b)
    (ha : p.eval a ≠ 0) (hb : p.eval b ≠ 0) :
    ((p.roots.toFinset).filter (fun x => a < x ∧ x < b)).card =
      sigma p a - sigma p b := by
  sorry
#116
How produced

Solved autonomously by aristotle. Manually bumped to 4.30.0-rc2.

Brauer–Fowler theorem
brauer_fowler

Lean theorem statement

/-- **Brauer–Fowler theorem.** There is a function bounding the order
of a finite nonabelian simple group by the order of any involution
centralizer. -/
theorem brauer_fowler :
    ∃ f : ℕ → ℕ, ∀ (G : Type) [Group G] [Finite G],
      IsSimpleGroup G → (∃ a b : G, a * b ≠ b * a) →
      ∀ t : G, orderOf t = 2 →
        Nat.card G ≤ f (Nat.card (Subgroup.centralizer ({t} : Set G))) := by
  sorry
#117
How produced

Auto-formalized by Aristotle

Balanceable k-bounded partitions
balanceable_bounded_partitions

Lean theorem statement

/--
For any `k`, the smallest `n` such that any `k`-bounded partition of `n` is
also balanceable is given by `2 * lcm(1, ..., k)`.
-/
theorem minimal_balanceable_of_bounded (k : ℕ) (hk : 0 < k) :
    Minimal (fun n => 0 < n ∧ ∀ p : n.Partition, Bounded k p → Balanceable p) (2 * (Finset.Icc 1 k).lcm id) := by
  sorry
#118
A competition programming problem about permuting a permutation to be unimodal
permute_to_unimodal

Lean theorem statement

/--
`minRearrange` correctly computes the smallest number of indices that need to be permuted in order to
turn `arr` into a unimodal permutation.
-/
theorem minRearrange_correct {arr : Array Nat} :
    arr.Perm (1...=arr.size).toArray →
      (∃ (x : Array Nat) (hx : x.Perm (1...=arr.size).toArray), Unimodal x ∧ differences (Vector.mk x (by simpa using hx.size_eq)) arr.toVector = minRearrange arr) ∧
      (∀ (x : Array Nat) (hx : x.Perm (1...=arr.size).toArray), Unimodal x → minRearrange arr ≤ differences (Vector.mk x (by simpa using hx.size_eq)) arr.toVector) := by
  sorry
#119
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Schur-Weyl duality: S_k image equals centralizer of GL(V) image
symAction_range_eq_centralizer_glAction

Verso theorem preview

theorem declaration uses `sorry`symAction_range_eq_centralizer_glAction {R : Type*} [Field R] {M : Type*} [AddCommGroup M] [Module R M] [FiniteDimensional R M] {k : ℕ} [Invertible (k.factorial : R)] : Algebra.adjoin R (Set.range (LeanEval.RepresentationTheory.symAction R M k)) = Subalgebra.centralizer R (Set.range (LeanEval.RepresentationTheory.glAction R M k)) := R:Type u_1inst✝⁴:Field RM:Type u_2inst✝³:AddCommGroup Minst✝²:Module R Minst✝¹:FiniteDimensional R Mk:ℕinst✝:Invertible ↑k.factorial⊢ Algebra.adjoin R (Set.range ⇑(symAction R M k)) = Subalgebra.centralizer R (Set.range ⇑(glAction R M k)) All goals completed! 🐙
#120
Normal spectral theorem
normal_spectral_theorem

Verso theorem preview

theorem declaration uses `sorry`normal_spectral_theorem (A : Matrix n n ℂ) : IsStarNormal A ↔ ∃ U ∈ unitary (Matrix n n ℂ), ∃ d : n → ℂ, A = U * diagonal d * star U := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℂ⊢ IsStarNormal A ↔ ∃ U ∈ unitary (Matrix n n ℂ), ∃ d, A = U * diagonal d * star U All goals completed! 🐙
#121
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Bauer's uniqueness at extreme points
bauer_extreme_point_uniqueness

Verso theorem preview

theorem declaration uses `sorry`bauer_unique [MeasurableSpace X] [BorelSpace X] (K : Set X) (hK_cpt : IsCompact K) (hK_cvx : Convex ℝ K) {x : X} (hx : x ∈ K.extremePoints ℝ) (μ : Measure X) [IsProbabilityMeasure μ] (hμ : μ Kᶜ = 0) (hbar : x = ∫ y, y ∂μ) : μ = Measure.dirac x := X:Type u_1inst✝⁵:NormedAddCommGroup Xinst✝⁴:NormedSpace ℝ Xinst✝³:CompleteSpace Xinst✝²:MeasurableSpace Xinst✝¹:BorelSpace XK:Set XhK_cpt:IsCompact KhK_cvx:Convex ℝ Kx:Xhx:x ∈ Set.extremePoints ℝ Kμ:Measure Xinst✝:IsProbabilityMeasure μhμ:μ Kᶜ = 0hbar:x = ∫ (y : X), y ∂μ⊢ μ = Measure.dirac x All goals completed! 🐙
#122
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Morley's trisector theorem
morley_theorem

Verso theorem preview

theorem declaration uses `sorry`morley_theorem (A B C P Q R : LeanEval.Geometry.Morley.Plane) (h : LeanEval.Geometry.Morley.IsMorleyConfiguration A B C P Q R) : LeanEval.Geometry.Morley.IsEquilateralTriple P Q R := A:PlaneB:PlaneC:PlaneP:PlaneQ:PlaneR:Planeh:IsMorleyConfiguration A B C P Q R⊢ IsEquilateralTriple P Q R All goals completed! 🐙
#123
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Riesz's rising sun lemma
rising_sun_lemma

Verso theorem preview

theorem declaration uses `sorry`rising_sun_lemma {a b : ℝ} (hab : a < b) {f : ℝ → ℝ} (hf : ContinuousOn f (Icc a b)) : LeanEval.Analysis.RisingSun.HasRisingSunProperty a b f := a:ℝb:ℝhab:a < bf:ℝ → ℝhf:ContinuousOn f (Icc a b)⊢ HasRisingSunProperty a b f All goals completed! 🐙
#124
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Runge's theorem
runge_theorem

Verso theorem preview

theorem declaration uses `sorry`runge (K : Set ℂ) (_hK : IsCompact K) (U : Set ℂ) (_hU : IsOpen U) (_hKU : K ⊆ U) (f : ℂ → ℂ) (_hf : AnalyticOnNhd ℂ f U) (ε : ℝ) (_hε : 0 < ε) : ∃ p q : ℂ[X], (∀ z ∈ K, q.eval z ≠ 0) ∧ (∀ z ∈ K, ‖f z - p.eval z / q.eval z‖ < ε) := K:Set ℂ_hK:IsCompact KU:Set ℂ_hU:IsOpen U_hKU:K ⊆ Uf:ℂ → ℂ_hf:AnalyticOnNhd ℂ f Uε:ℝ_hε:0 < ε⊢ ∃ p q, (∀ z ∈ K, Polynomial.eval z q ≠ 0) ∧ ∀ z ∈ K, ‖f z - Polynomial.eval z p / Polynomial.eval z q‖ < ε All goals completed! 🐙
#125
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Kuznetsov's theorem: finitely presented simple groups have solvable word problem
boone_higman_simple

Verso theorem preview

theorem declaration uses `sorry`boone_higman_simple {G : Type*} [Group G] [IsSimpleGroup G] {n : ℕ} (φ : FreeGroup (Fin n) →* G) (_hsurj : Function.Surjective φ) (_hker : (MonoidHom.ker φ).IsFinitelyNormallyGenerated) : LeanEval.GroupTheory.BooneHigmanSimpleProblem.WordProblemSolvable φ := G:Type u_1inst✝¹:Group Ginst✝:IsSimpleGroup Gn:ℕφ:FreeGroup (Fin n) →* G_hsurj:Function.Surjective ⇑φ_hker:φ.ker.IsFinitelyNormallyGenerated⊢ WordProblemSolvable φ All goals completed! 🐙
#126
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Pointwise and Cesàro convergence of Fourier series (Dirichlet, Fejér)
fourier_dirichlet_fejer

Verso theorem preview

/-- **Dirichlet's pointwise convergence theorem** (§46). For every `C¹` 2π-periodic complex function `f`, the symmetric Fourier partial sums `S_N(f)(x)` converge to `f(x)` at every point `x ∈ ℝ`. -/ theorem declaration uses `sorry`dirichlet_pointwise {f : ℝ → ℂ} (_hperiod : Function.Periodic f (2 * Real.pi)) (_hC1 : ContDiff ℝ 1 f) (x : ℝ) : Tendsto (fun N : ℕ => fourierPartialSum f N x) atTop (𝓝 (f x)) := f:ℝ → ℂ_hperiod:Function.Periodic f (2 * Real.pi)_hC1:ContDiff ℝ 1 fx:ℝ⊢ Tendsto (fun N => fourierPartialSum f N x) atTop (𝓝 (f x)) All goals completed! 🐙
/-- **Fejér's theorem** (§46). For every *continuous* 2π-periodic complex function `f` — without the `C¹` hypothesis of Dirichlet's theorem — the Cesàro means `σ_N(f)` of the symmetric Fourier partial sums converge to `f` uniformly on `ℝ`. -/ theorem declaration uses `sorry`fejer {f : ℝ → ℂ} (_hperiod : Function.Periodic f (2 * Real.pi)) (_hcont : Continuous f) : TendstoUniformly (fun N : ℕ => fourierCesaroMean f N) f atTop := f:ℝ → ℂ_hperiod:Function.Periodic f (2 * Real.pi)_hcont:Continuous f⊢ TendstoUniformly (fun N => fourierCesaroMean f N) f atTop All goals completed! 🐙
#127
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Euler–Lagrange equation
euler_lagrange_equation

Verso theorem preview

theorem declaration uses `sorry`euler_lagrange_equation {a b : ℝ} (L : ℝ → ℝ → ℝ → ℝ) (x : ℝ → ℝ) (_hab : a < b) (_hL : ContDiff ℝ 2 (fun p : ℝ × ℝ × ℝ => L p.1 p.2.1 p.2.2)) (_hx : ContDiff ℝ 2 x) (_hxe : LeanEval.Analysis.IsVariationalExtremum a b L x) : ∀ t ∈ Set.Ioo a b, lagrangianPartialX L x t = deriv (lagrangianPartialV L x) t := a:ℝb:ℝL:ℝ → ℝ → ℝ → ℝx:ℝ → ℝ_hab:a < b_hL:ContDiff ℝ 2 fun p => L p.1 p.2.1 p.2.2_hx:ContDiff ℝ 2 x_hxe:IsVariationalExtremum a b L x⊢ ∀ t ∈ Ioo a b, lagrangianPartialX L x t = deriv (lagrangianPartialV L x) t All goals completed! 🐙
#128
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Schauder fixed-point theorem
schauder_fixed_point

Verso theorem preview

theorem declaration uses `sorry`schauder_fixed_point {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [CompleteSpace E] {K : Set E} (_hK_compact : IsCompact K) (_hK_convex : Convex ℝ K) (_hK_nonempty : K.Nonempty) (f : E → E) (_hf_cont : ContinuousOn f K) (_hf_maps : Set.MapsTo f K K) : ∃ x ∈ K, f x = x := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:CompleteSpace EK:Set E_hK_compact:IsCompact K_hK_convex:Convex ℝ K_hK_nonempty:K.Nonemptyf:E → E_hf_cont:ContinuousOn f K_hf_maps:Set.MapsTo f K K⊢ ∃ x ∈ K, f x = x All goals completed! 🐙
#129
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with prompting and submission by John Jennings. No human review of the proofs was performed; correctness was checked only through the benchmark comparator. The Brouwer fixed-point theorem formalization component of the `schauder_fixed_point` proof was extracted from Aristotle's proof of `brouwer_fixed_point`.

Burnside p^a q^b theorem
finite_group_isSolvable_of_card_eq_prime_pow_mul_prime_pow

Verso theorem preview

theorem declaration uses `sorry`finite_group_isSolvable_of_card_eq_prime_pow_mul_prime_pow {G : Type*} [Group G] [Fintype G] {p q a b : ℕ} (hp : Nat.Prime p) (hq : Nat.Prime q) (hpq : p ≠ q) (hcard : Fintype.card G = p ^ a * q ^ b) : Group.IsSolvable G := G:Type u_1inst✝¹:Group Ginst✝:Fintype Gp:ℕq:ℕa:ℕb:ℕhp:Nat.Prime phq:Nat.Prime qhpq:p ≠ qhcard:Fintype.card G = p ^ a * q ^ b⊢ Group.IsSolvable G All goals completed! 🐙
#130
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Schur-Weyl duality: GL(V) image equals centralizer of S_k image
glAction_range_eq_centralizer_symAction

Verso theorem preview

theorem declaration uses `sorry`glAction_range_eq_centralizer_symAction {R : Type*} [Field R] {M : Type*} [AddCommGroup M] [Module R M] [FiniteDimensional R M] {k : ℕ} [Invertible (k.factorial : R)] : Algebra.adjoin R (Set.range (LeanEval.RepresentationTheory.glAction R M k)) = Subalgebra.centralizer R (Set.range (LeanEval.RepresentationTheory.symAction R M k)) := R:Type u_1inst✝⁴:Field RM:Type u_2inst✝³:AddCommGroup Minst✝²:Module R Minst✝¹:FiniteDimensional R Mk:ℕinst✝:Invertible ↑k.factorial⊢ Algebra.adjoin R (Set.range ⇑(glAction R M k)) = Subalgebra.centralizer R (Set.range ⇑(symAction R M k)) All goals completed! 🐙
#131
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Existence of a non-isotopic pair of oriented two-component links
exists_nonisotopic_link

Verso theorem preview

theorem declaration uses `sorry`exists_nonisotopic_link : ∃ L₁ L₂ : LeanEval.KnotTheory.TwoLink, ¬ L₁.Isotopic L₂ := ⊢ ∃ L₁ L₂, ¬L₁.Isotopic L₂ All goals completed! 🐙
#132
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Trace Cayley-Hamilton / Newton identity
trace_cayley_hamilton_newton

Verso theorem preview

theorem declaration uses `sorry`trace_cayley_hamilton_newton {R : Type*} [CommRing R] (A : Matrix n n R) {k : ℕ} (hk : 1 ≤ k) : (k : R) * charpolyDescendingCoeff A k + ∑ j ∈ Finset.Icc 1 k, trace (A ^ j) * charpolyDescendingCoeff A (k - j) = 0 := n:Type u_1inst✝²:Fintype ninst✝¹:DecidableEq nR:Type u_2inst✝:CommRing RA:Matrix n n Rk:ℕhk:1 ≤ k⊢ ↑k * charpolyDescendingCoeff A k + ∑ j ∈ Finset.Icc 1 k, (A ^ j).trace * charpolyDescendingCoeff A (k - j) = 0 All goals completed! 🐙
#133
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Abel–Ruffini theorem
abel_ruffini

Verso theorem preview

theorem declaration uses `sorry`abel_ruffini (n : ℕ) (_hn : 1 ≤ n) : (∀ p : ℚ[X], p.natDegree = n → ∀ x : ℂ, aeval x p = 0 → x ∈ solvableByRad ℚ ℂ) ↔ n ≤ 4 := n:ℕ_hn:1 ≤ n⊢ (∀ (p : ℚ[X]), p.natDegree = n → ∀ (x : ℂ), (aeval x) p = 0 → x ∈ solvableByRad ℚ ℂ) ↔ n ≤ 4 All goals completed! 🐙
#134
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Wiener's atom-detection formula
wiener_atom_detection

Verso theorem preview

theorem declaration uses `sorry`wiener_atom_detection (μ : Measure (AddCircle (2 * Real.pi))) [IsProbabilityMeasure μ] : Tendsto (fun N : ℕ => (1 / (N : ℝ)) * ∑ k ∈ Finset.Icc (1 : ℤ) N, ‖fourierCoeffMeasure μ k‖ ^ 2) atTop (𝓝 (∑' x : AddCircle (2 * Real.pi), ((μ {x}).toReal) ^ 2)) := μ:Measure (AddCircle (2 * π))inst✝:IsProbabilityMeasure μ⊢ Tendsto (fun N => 1 / ↑N * ∑ k ∈ Finset.Icc 1 ↑N, ‖fourierCoeffMeasure μ k‖ ^ 2) atTop (𝓝 (∑' (x : AddCircle (2 * π)), (μ {x}).toReal ^ 2)) All goals completed! 🐙
#135
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Brouwer fixed-point theorem
brouwer_fixed_point

Verso theorem preview

theorem declaration uses `sorry`brouwer_fixed_point {d : ℕ} {K : Set (EuclideanSpace ℝ (Fin d))} (_hK_compact : IsCompact K) (_hK_convex : Convex ℝ K) (_hK_nonempty : K.Nonempty) (f : EuclideanSpace ℝ (Fin d) → EuclideanSpace ℝ (Fin d)) (_hf_cont : ContinuousOn f K) (_hf_maps : MapsTo f K K) : ∃ x ∈ K, f x = x := d:ℕK:Set (EuclideanSpace ℝ (Fin d))_hK_compact:IsCompact K_hK_convex:Convex ℝ K_hK_nonempty:K.Nonemptyf:EuclideanSpace ℝ (Fin d) → EuclideanSpace ℝ (Fin d)_hf_cont:ContinuousOn f K_hf_maps:MapsTo f K K⊢ ∃ x ∈ K, f x = x All goals completed! 🐙
#136
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with prompting and submission by John Jennings. No human review of the proofs was performed; correctness was checked only through the benchmark comparator. Most of this proof was extracted from an intermediate result that Aristotle used to prove `nash_equilibrium_exists`.

Bing's house with two rooms is contractible
contractibleSpace_houseWithTwoRooms

Verso theorem preview

theorem declaration uses `sorry`contractibleSpace_houseWithTwoRooms : ContractibleSpace LeanEval.Topology.HouseWithTwoRooms := ⊢ ContractibleSpace ↑HouseWithTwoRooms All goals completed! 🐙
#137
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

von Neumann double commutant theorem
vonNeumann_doubleCommutant_tfae

Verso theorem preview

theorem declaration uses `sorry`vonNeumann_doubleCommutant_tfae {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H] (S : StarSubalgebra ℂ (H →L[ℂ] H)) : List.TFAE [ Set.centralizer (Set.centralizer (S : Set (H →L[ℂ] H))) = S , IsClosed (ContinuousLinearMapWOT.ofCLM '' (S : Set (H →L[ℂ] H))) , IsClosed (ContinuousLinearMap.toPointwiseConvergenceCLM ℂ (RingHom.id ℂ) H H '' (S : Set (H →L[ℂ] H))) ] := H:Type u_1inst✝²:NormedAddCommGroup Hinst✝¹:InnerProductSpace ℂ Hinst✝:CompleteSpace HS:StarSubalgebra ℂ (H →L[ℂ] H)⊢ [(↑S).centralizer.centralizer = ↑S, IsClosed (ContinuousLinearMapWOT.ofCLM '' ↑S), IsClosed (⇑(ContinuousLinearMap.toPointwiseConvergenceCLM ℂ (RingHom.id ℂ) H H) '' ↑S)].TFAE All goals completed! 🐙
#138
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Koszul formula
koszul_formula

Verso theorem preview

theorem declaration uses `sorry`koszul_formula {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] [CompleteSpace E] {H : Type*} [TopologicalSpace H] {I : ModelWithCorners ℝ E H} {M : Type*} [TopologicalSpace M] [ChartedSpace H M] [IsManifold I ∞ M] [RiemannianBundle (fun (x : M) ↦ TangentSpace I x)] [IsContMDiffRiemannianBundle I ∞ E (fun (x : M) ↦ TangentSpace I x)] (cov : CovariantDerivative I E (TangentSpace I (M := M))) [ContMDiffCovariantDerivative cov ∞] (_htor : cov.torsion = 0) (_hmet : LeanEval.Geometry.KoszulFormula.IsMetricCompatible cov) (X Y Z : Π x : M, TangentSpace I x) (_hX : CMDiff ∞ (T% X)) (_hY : CMDiff ∞ (T% Y)) (_hZ : CMDiff ∞ (T% Z)) (x : M) : 2 * inner ℝ (cov Y x (X x)) (Z x) = mvfderiv I (fun y : M => inner ℝ (Y y) (Z y)) x (X x) + mvfderiv I (fun y : M => inner ℝ (X y) (Z y)) x (Y x) - mvfderiv I (fun y : M => inner ℝ (X y) (Y y)) x (Z x) - inner ℝ (X x) (mlieBracket I Y Z x) - inner ℝ (Y x) (mlieBracket I X Z x) + inner ℝ (Z x) (mlieBracket I X Y x) := E:Type u_1inst✝¹⁰:NormedAddCommGroup Einst✝⁹:NormedSpace ℝ Einst✝⁸:FiniteDimensional ℝ Einst✝⁷:CompleteSpace EH:Type u_2inst✝⁶:TopologicalSpace HI:ModelWithCorners ℝ E HM:Type u_3inst✝⁵:TopologicalSpace Minst✝⁴:ChartedSpace H Minst✝³:IsManifold I ∞ Minst✝²:RiemannianBundle fun x => TangentSpace I xinst✝¹:IsContMDiffRiemannianBundle I ∞ E fun x => TangentSpace I xcov:CovariantDerivative I E (TangentSpace I)inst✝:cov.ContMDiffCovariantDerivative ∞_htor:cov.torsion = 0_hmet:LeanEval.Geometry.KoszulFormula.IsMetricCompatible covX:(x : M) → TangentSpace I xY:(x : M) → TangentSpace I xZ:(x : M) → TangentSpace I x_hX:ContMDiff I I.tangent ∞ (T% X)_hY:ContMDiff I I.tangent ∞ (T% Y)_hZ:ContMDiff I I.tangent ∞ (T% Z)x:M⊢ 2 * Inner.inner ℝ ((↑cov Y x) (X x)) (Z x) = ((d% fun y => Inner.inner ℝ (Y y) (Z y)) x) (X x) + ((d% fun y => Inner.inner ℝ (X y) (Z y)) x) (Y x) - ((d% fun y => Inner.inner ℝ (X y) (Y y)) x) (Z x) - Inner.inner ℝ (X x) (mlieBracket I Y Z x) - Inner.inner ℝ (Y x) (mlieBracket I X Z x) + Inner.inner ℝ (Z x) (mlieBracket I X Y x) All goals completed! 🐙
#139
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Real cyclotomic integer with house at most 2
cyclotomic_integer_house_le_two

Verso theorem preview

theorem declaration uses `sorry`cyclotomic_integer_house_le_two {K : Type*} [Field K] [NumberField K] [Algebra ℚ K] (n : ℕ) [NeZero n] [IsCyclotomicExtension {n} ℚ K] {β : K} (hβ_int : IsIntegral ℤ β) (hβ_real : β ∈ NumberField.maximalRealSubfield K) : house β ≤ 2 → house β = 2 ∨ ∃ m : ℕ, 0 < m ∧ house β = 2 * Real.cos (Real.pi / m) := K:Type u_1inst✝⁴:Field Kinst✝³:NumberField Kinst✝²:Algebra ℚ Kn:ℕinst✝¹:NeZero ninst✝:IsCyclotomicExtension {n} ℚ Kβ:Khβ_int:IsIntegral ℤ βhβ_real:β ∈ maximalRealSubfield K⊢ house β ≤ 2 → house β = 2 ∨ ∃ m, 0 < m ∧ house β = 2 * Real.cos (Real.pi / ↑m) All goals completed! 🐙
#140
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Linear ODE with negative-real-part eigenvalues is asymptotically stable
linear_ode_asymptotic_stability

Verso theorem preview

theorem declaration uses `sorry`linear_ode_asymptotic_stability (n : ℕ) (A : Matrix (Fin n) (Fin n) ℝ) (hA : ∀ μ : ℂ, Module.End.HasEigenvalue (Matrix.toLin' (A.map (algebraMap ℝ ℂ))) μ → μ.re < 0) (x : ℝ → (Fin n → ℝ)) (hx : ∀ t : ℝ, 0 < t → HasDerivAt x (A.mulVec (x t)) t) : Filter.Tendsto (fun t : ℝ => ‖x t‖) Filter.atTop (nhds 0) := n:ℕA:Matrix (Fin n) (Fin n) ℝhA:∀ (μ : ℂ), Module.End.HasEigenvalue (Matrix.toLin' (A.map ⇑(algebraMap ℝ ℂ))) μ → μ.re < 0x:ℝ → Fin n → ℝhx:∀ (t : ℝ), 0 < t → HasDerivAt x (A *ᵥ x t) t⊢ Filter.Tendsto (fun t => ‖x t‖) Filter.atTop (nhds 0) All goals completed! 🐙
#141
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

A counterexample to the unit conjecture for group rings
annals_unit_conjecture

Verso theorem preview

theorem declaration uses `sorry`theorem_A : (∀ g : UnitConjecture.P, ∀ n ≠ 0, g ^ n = 1 → g = 1) ∧ IsUnit UnitConjecture.u ∧ ¬ ∃ g : UnitConjecture.P, UnitConjecture.u = g := ⊢ (∀ (g : P) (n : ℕ), n ≠ 0 → g ^ n = 1 → g = 1) ∧ IsUnit u ∧ ¬∃ g, u = (MonoidAlgebra.of (ZMod 2) P) g All goals completed! 🐙
#142
Linear programming: maximum principle and vertex optimality
lp_maximum_principle

Verso theorem preview

/-- **Maximum principle for linear programming** (§101). A local maximiser of the LP objective on the feasible region is automatically a global maximiser; and whenever the objective is non-constant (`c ≠ 0`), the maximiser lies on the topological frontier of the feasible region. -/ theorem declaration uses `sorry`lp_maximum_principle {m n : ℕ} (lp : LinearProgram m n) (x : Fin m → ℝ) (_hx : x ∈ lp.feasible) (_hlocal : IsLocalMaxOn lp.objective lp.feasible x) : IsMaxOn lp.objective lp.feasible x ∧ (lp.c ≠ 0 → x ∈ frontier lp.feasible) := m:ℕn:ℕlp:LinearProgram m nx:Fin m → ℝ_hx:x ∈ lp.feasible_hlocal:IsLocalMaxOn lp.objective lp.feasible x⊢ IsMaxOn lp.objective lp.feasible x ∧ (lp.c ≠ 0 → x ∈ frontier lp.feasible) All goals completed! 🐙
/-- **Vertex optimality** (§101; the existence content of Dantzig's 1947 simplex algorithm). Every linear program with a nonempty bounded feasible region admits a global maximiser that is an extreme point (vertex) of the feasible region. -/ theorem declaration uses `sorry`simplex_algorithm {m n : ℕ} (lp : LinearProgram m n) (_hfeas : lp.feasible.Nonempty) (_hbdd : Bornology.IsBounded lp.feasible) : ∃ x ∈ lp.feasible, IsMaxOn lp.objective lp.feasible x ∧ x ∈ Set.extremePoints ℝ lp.feasible := m:ℕn:ℕlp:LinearProgram m n_hfeas:lp.feasible.Nonempty_hbdd:Bornology.IsBounded lp.feasible⊢ ∃ x ∈ lp.feasible, IsMaxOn lp.objective lp.feasible x ∧ x ∈ Set.extremePoints ℝ lp.feasible All goals completed! 🐙
#143
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Bourbaki's locally convex extension of Banach–Alaoglu
banach_alaoglu_bourbaki

Verso theorem preview

theorem declaration uses `sorry`banach_alaoglu_bourbaki (E : Type*) [AddCommGroup E] [Module ℝ E] [TopologicalSpace E] [ContinuousAdd E] [ContinuousSMul ℝ E] [LocallyConvexSpace ℝ E] (U : Set E) (_hU : U ∈ 𝓝 (0 : E)) : IsCompact (LeanEval.Analysis.weakStarPolar E U) := E:Type u_1inst✝⁵:AddCommGroup Einst✝⁴:Module ℝ Einst✝³:TopologicalSpace Einst✝²:ContinuousAdd Einst✝¹:ContinuousSMul ℝ Einst✝:LocallyConvexSpace ℝ EU:Set E_hU:U ∈ 𝓝 0⊢ IsCompact (weakStarPolar E U) All goals completed! 🐙
#144
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Pell solutions are convergents of √d
pell_solution_convergent

Verso theorem preview

theorem declaration uses `sorry`pell_solution_is_convergent (d : ℤ) (_hd : Squarefree d) (_hd0 : 0 < d) (x y : ℤ) (_hx : 0 < x) (_hy : 0 < y) (_hsol : x ^ 2 - d * y ^ 2 = 1) : ∃ n : ℕ, (GenContFract.of (Real.sqrt (d : ℝ))).convs n = (x : ℝ) / (y : ℝ) := d:ℤ_hd:Squarefree d_hd0:0 < dx:ℤy:ℤ_hx:0 < x_hy:0 < y_hsol:x ^ 2 - d * y ^ 2 = 1⊢ ∃ n, (GenContFract.of √↑d).convs n = ↑x / ↑y All goals completed! 🐙
#145
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Symplectic matrices have determinant 1
symplectic_matrix_det

Verso theorem preview

theorem declaration uses `sorry`symplectic_matrix_det {l R : Type*} [DecidableEq l] [Fintype l] [CommRing R] {A : Matrix (l ⊕ l) (l ⊕ l) R} (_hA : A ∈ Matrix.symplecticGroup l R) : A.det = 1 := l:Type u_1R:Type u_2inst✝²:DecidableEq linst✝¹:Fintype linst✝:CommRing RA:Matrix (l ⊕ l) (l ⊕ l) R_hA:A ∈ symplecticGroup l R⊢ A.det = 1 All goals completed! 🐙
#146
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with prompting and submission by John Jennings. No human review of the proofs was performed; correctness was checked only through the benchmark comparator. The Brouwer fixed-point theorem formalization component of the `schauder_fixed_point` proof was extracted from Aristotle's proof of `brouwer_fixed_point`.

Rouche theorem via zero counting
rouche_zero_count_eq

Verso theorem preview

theorem declaration uses `sorry`rouche_zero_count_eq {f g : ℂ → ℂ} {R : ℝ} (hR : 0 < R) (hf : MeromorphicNFOn f Set.univ) (hg : AnalyticOn ℂ g Set.univ) (hbound : ∀ z : ℂ, ‖z‖ = R → ‖g z‖ < ‖f z‖) : (∑ᶠ z, ((divisor (f + g) (Metric.closedBall 0 R))⁺) z) = (∑ᶠ z, ((divisor f (Metric.closedBall 0 R))⁺) z) := f:ℂ → ℂg:ℂ → ℂR:ℝhR:0 < Rhf:MeromorphicNFOn f Set.univhg:AnalyticOn ℂ g Set.univhbound:∀ (z : ℂ), ‖z‖ = R → ‖g z‖ < ‖f z‖⊢ ∑ᶠ (z : ℂ), (divisor (f + g) (Metric.closedBall 0 R))⁺ z = ∑ᶠ (z : ℂ), (divisor f (Metric.closedBall 0 R))⁺ z All goals completed! 🐙
#147
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Complementary polynomial on the unit circle
exists_complementary_polynomial_on_unit_circle

Verso theorem preview

theorem declaration uses `sorry`exists_complementary_polynomial_on_unit_circle (P : ℂ[X]) (hP : ∀ z : Circle, ‖P.eval (z : ℂ)‖ ≤ 1) : ∃ Q : ℂ[X], Q.natDegree ≤ P.natDegree ∧ ∀ z : Circle, ‖P.eval (z : ℂ)‖ ^ 2 + ‖Q.eval (z : ℂ)‖ ^ 2 = 1 := P:ℂ[X]hP:∀ (z : Circle), ‖eval (↑z) P‖ ≤ 1⊢ ∃ Q, Q.natDegree ≤ P.natDegree ∧ ∀ (z : Circle), ‖eval (↑z) P‖ ^ 2 + ‖eval (↑z) Q‖ ^ 2 = 1 All goals completed! 🐙
#148
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Perron-Frobenius for irreducible nonnegative matrices
irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius

Verso theorem preview

theorem declaration uses `sorry`irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius {n : Type*} [Fintype n] [DecidableEq n] [Nonempty n] (A : Matrix n n ℝ) (hA : A.IsIrreducible) : ∃ v : n → ℝ, Module.End.HasEigenvector (Matrix.toLin' A) (spectralRadius ℝ A).toReal v ∧ (∀ i, 0 < v i) := n:Type u_1inst✝²:Fintype ninst✝¹:DecidableEq ninst✝:Nonempty nA:Matrix n n ℝhA:A.IsIrreducible⊢ ∃ v, Module.End.HasEigenvector (Matrix.toLin' A) (spectralRadius ℝ A).toReal v ∧ ∀ (i : n), 0 < v i All goals completed! 🐙
#149
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Minkowski-Caratheodory theorem
mem_convexHull_finset_extremePoints_of_mem_compact_convex

Verso theorem preview

theorem declaration uses `sorry`mem_convexHull_finset_extremePoints_of_mem_compact_convex {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] {s : Set E} {x : E} (hscomp : IsCompact s) (hsconv : Convex ℝ s) (hx : x ∈ s) : ∃ t : Finset E, (↑t : Set E) ⊆ s.extremePoints ℝ ∧ t.card ≤ Module.finrank ℝ E + 1 ∧ x ∈ convexHull ℝ (↑t : Set E) := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:FiniteDimensional ℝ Es:Set Ex:Ehscomp:IsCompact shsconv:Convex ℝ shx:x ∈ s⊢ ∃ t, ↑t ⊆ extremePoints ℝ s ∧ t.card ≤ Module.finrank ℝ E + 1 ∧ x ∈ (convexHull ℝ) ↑t All goals completed! 🐙
#150
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Gaussian heat kernel solves the 1D heat equation
heat_kernel_solves_heat_equation

Verso theorem preview

theorem declaration uses `sorry`heat_kernel_solves_heat_equation (f : ℝ → ℝ) (hf_cont : Continuous f) (hf_bdd : ∃ M : ℝ, ∀ x, |f x| ≤ M) : -- The PDE on (0, ∞) × ℝ. (∀ t : ℝ, 0 < t → ∀ x : ℝ, ∃ ux : ℝ → ℝ, ∃ uxx : ℝ, (∀ y : ℝ, HasDerivAt (fun z => heatSolution f t z) (ux y) y) ∧ HasDerivAt ux uxx x ∧ HasDerivAt (fun s => heatSolution f s x) uxx t) ∧ -- Initial condition recovered as a one-sided limit at t = 0. (∀ x : ℝ, Filter.Tendsto (fun t : ℝ => heatSolution f t x) (nhdsWithin (0 : ℝ) (Set.Ioi 0)) (nhds (f x))) := f:ℝ → ℝhf_cont:Continuous fhf_bdd:∃ M, ∀ (x : ℝ), |f x| ≤ M⊢ (∀ (t : ℝ), 0 < t → ∀ (x : ℝ), ∃ ux uxx, (∀ (y : ℝ), HasDerivAt (fun z => heatSolution f t z) (ux y) y) ∧ HasDerivAt ux uxx x ∧ HasDerivAt (fun s => heatSolution f s x) uxx t) ∧ ∀ (x : ℝ), Filter.Tendsto (fun t => heatSolution f t x) (nhdsWithin 0 (Set.Ioi 0)) (nhds (f x)) All goals completed! 🐙
#151
How produced

Solved by the Aristotle automated theorem prover (Harmonic) via the `aristotle` CLI, with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Character values of finite groups lie in cyclotomic fields
brauer_character_in_cyclotomic

Verso theorem preview

theorem declaration uses `sorry`brauer_character_in_cyclotomic (G : Type) [Group G] [Fintype G] : ∃ φ : CyclotomicField (Monoid.exponent G) ℚ →+* ℂ, ∀ (V : Type) (_ : AddCommGroup V) (_ : Module ℂ V) (_ : FiniteDimensional ℂ V) (ρ : Representation ℂ G V) (g : G), LinearMap.trace ℂ V (ρ g) ∈ φ.range := G:Typeinst✝¹:Group Ginst✝:Fintype G⊢ ∃ φ, ∀ (V : Type) (x : AddCommGroup V) (x_1 : Module ℂ V), FiniteDimensional ℂ V → ∀ (ρ : Representation ℂ G V) (g : G), (LinearMap.trace ℂ V) (ρ g) ∈ φ.range All goals completed! 🐙
#152
How produced

Solved by the Aristotle automated theorem prover (Harmonic) via the `aristotle` CLI, with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Oppenheim's inequality for Hadamard products
oppenheim_inequality

Verso theorem preview

theorem declaration uses `sorry`oppenheim_inequality {n : Type*} [Fintype n] [DecidableEq n] {A B : Matrix n n ℝ} (hA : A.PosSemidef) (hB : B.PosSemidef) : A.det * ∏ i, B i i ≤ (A ⊙ B).det := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℝB:Matrix n n ℝhA:A.PosSemidefhB:B.PosSemidef⊢ A.det * ∏ i, B i i ≤ (A ⊙ B).det All goals completed! 🐙
#153
How produced

Solved by the Aristotle automated theorem prover (Harmonic) via the `aristotle` CLI, with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

pi_1 of the circle is Z
pi1_circle_mulEquiv_int

Verso theorem preview

theorem declaration uses `sorry`pi1_circle_mulEquiv_int : Nonempty (HomotopyGroup.Pi 1 Circle (1 : Circle) ≃* Multiplicative ℤ) := ⊢ Nonempty (HomotopyGroup.Pi 1 Circle 1 ≃* Multiplicative ℤ) All goals completed! 🐙
#154
How produced

Solved by the Aristotle automated theorem prover (Harmonic) via the `aristotle` CLI, with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Sturm separation theorem
sturm_separation

Verso theorem preview

theorem declaration uses `sorry`sturm_separation (p q y₁ y₂ : ℝ → ℝ) (a b : ℝ) (hab : a < b) (J : Set ℝ) (hJ_open : IsOpen J) (hJ_conn : IsPreconnected J) (hJ_sub : Set.Icc a b ⊆ J) (hp : ContinuousOn p J) (hq : ContinuousOn q J) (hy₁ : ∀ x ∈ J, HasDerivAt y₁ (deriv y₁ x) x) (hy₁' : ∀ x ∈ J, HasDerivAt (deriv y₁) (-(p x * deriv y₁ x + q x * y₁ x)) x) (hy₂ : ∀ x ∈ J, HasDerivAt y₂ (deriv y₂ x) x) (hy₂' : ∀ x ∈ J, HasDerivAt (deriv y₂) (-(p x * deriv y₂ x + q x * y₂ x)) x) (hW : ∃ x₀ ∈ J, y₁ x₀ * deriv y₂ x₀ - y₂ x₀ * deriv y₁ x₀ ≠ 0) (hza : y₁ a = 0) (hzb : y₁ b = 0) (hne : ∀ x ∈ Set.Ioo a b, y₁ x ≠ 0) : ∃! c, c ∈ Set.Ioo a b ∧ y₂ c = 0 := p:ℝ → ℝq:ℝ → ℝy₁:ℝ → ℝy₂:ℝ → ℝa:ℝb:ℝhab:a < bJ:Set ℝhJ_open:IsOpen JhJ_conn:IsPreconnected JhJ_sub:Set.Icc a b ⊆ Jhp:ContinuousOn p Jhq:ContinuousOn q Jhy₁:∀ x ∈ J, HasDerivAt y₁ (deriv y₁ x) xhy₁':∀ x ∈ J, HasDerivAt (deriv y₁) (-(p x * deriv y₁ x + q x * y₁ x)) xhy₂:∀ x ∈ J, HasDerivAt y₂ (deriv y₂ x) xhy₂':∀ x ∈ J, HasDerivAt (deriv y₂) (-(p x * deriv y₂ x + q x * y₂ x)) xhW:∃ x₀ ∈ J, y₁ x₀ * deriv y₂ x₀ - y₂ x₀ * deriv y₁ x₀ ≠ 0hza:y₁ a = 0hzb:y₁ b = 0hne:∀ x ∈ Set.Ioo a b, y₁ x ≠ 0⊢ ∃! c, c ∈ Set.Ioo a b ∧ y₂ c = 0 All goals completed! 🐙
#155
How produced

Solved by the Aristotle automated theorem prover (Harmonic), with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Dirichlet eigenvalues of -y'' = lambda y on [0,pi] are n^2
dirichlet_eigenvalues_eq_nat_sq

Verso theorem preview

theorem declaration uses `sorry`dirichlet_eigenvalues_eq_nat_sq (lam : ℝ) : (∃ (y : ℝ → ℝ) (J : Set ℝ), IsOpen J ∧ Set.Icc (0 : ℝ) Real.pi ⊆ J ∧ (∀ x ∈ J, HasDerivAt y (deriv y x) x) ∧ (∀ x ∈ J, HasDerivAt (deriv y) (-(lam * y x)) x) ∧ y 0 = 0 ∧ y Real.pi = 0 ∧ ∃ x ∈ Set.Ioo (0 : ℝ) Real.pi, y x ≠ 0) ↔ ∃ n : ℕ, 0 < n ∧ lam = (n : ℝ) ^ 2 := lam:ℝ⊢ (∃ y J, IsOpen J ∧ Set.Icc 0 π ⊆ J ∧ (∀ x ∈ J, HasDerivAt y (deriv y x) x) ∧ (∀ x ∈ J, HasDerivAt (deriv y) (-(lam * y x)) x) ∧ y 0 = 0 ∧ y π = 0 ∧ ∃ x ∈ Set.Ioo 0 π, y x ≠ 0) ↔ ∃ n, 0 < n ∧ lam = ↑n ^ 2 All goals completed! 🐙
#156
How produced

Solved by the Aristotle automated theorem prover (Harmonic) via the `aristotle` CLI, with orchestration and submission by Lorenzo Luccioli. No human review or supervision of the proofs was performed; correctness was checked only through the benchmark comparator.

Entrywise exponential of a PSD matrix is PSD
posSemidef_map_exp

Verso theorem preview

theorem declaration uses `sorry`posSemidef_map_exp {n : Type*} [Fintype n] [DecidableEq n] {A : Matrix n n ℝ} (hA : A.PosSemidef) : (A.map Real.exp).PosSemidef := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℝhA:A.PosSemidef⊢ (A.map Real.exp).PosSemidef All goals completed! 🐙
#157
How produced

Solved by the Aristotle automated theorem prover (Harmonic) via the `aristotle` CLI v1.0.1, with submission orchestration by Kim Morrison. The proof was generated against Aristotle's default Lean v4.28.0 / Mathlib v4.28.0 target; submitted here against the benchmark's pinned Lean v4.30.0-rc2 + pinned Mathlib commit. Comparator's verdict applies — proofs that exploit features added to Mathlib after v4.28.0 will compile; those that rely on tactic behaviour that changed are at the mercy of forward compatibility.

Polynomial decay rate of y' = -y^3
cubic_decay_asymptotic

Verso theorem preview

theorem declaration uses `sorry`cubic_decay_asymptotic (y : ℝ → ℝ) (hy_diff : ∀ t : ℝ, 0 < t → HasDerivAt y (-(y t) ^ 3) t) (hy_cont : ContinuousWithinAt y (Set.Ici 0) 0) (hy0 : y 0 = 1) : Tendsto (fun t : ℝ => y t * Real.sqrt t) atTop (𝓝 (1 / Real.sqrt 2)) := y:ℝ → ℝhy_diff:∀ (t : ℝ), 0 < t → HasDerivAt y (-y t ^ 3) thy_cont:ContinuousWithinAt y (Set.Ici 0) 0hy0:y 0 = 1⊢ Tendsto (fun t => y t * √t) atTop (𝓝 (1 / √2)) All goals completed! 🐙
#158
How produced

Solved by the Aristotle automated theorem prover (Harmonic) via the `aristotle` CLI v1.0.1, with submission orchestration by Kim Morrison. The proof was generated against Aristotle's default Lean v4.28.0 / Mathlib v4.28.0 target; submitted here against the benchmark's pinned Lean v4.30.0-rc2 + pinned Mathlib commit. Comparator's verdict applies — proofs that exploit features added to Mathlib after v4.28.0 will compile; those that rely on tactic behaviour that changed are at the mercy of forward compatibility.

Comparison principle for the Dirichlet BVP
bvp_comparison

Verso theorem preview

theorem declaration uses `sorry`bvp_comparison (J : Set ℝ) (hJ_open : IsOpen J) (hJ_sub : Set.Icc (0 : ℝ) 1 ⊆ J) (u v : ℝ → ℝ) (hu : ∀ x ∈ J, HasDerivAt u (deriv u x) x) (hu' : ∀ x ∈ J, HasDerivAt (deriv u) (deriv (deriv u) x) x) (hv : ∀ x ∈ J, HasDerivAt v (deriv v x) x) (hv' : ∀ x ∈ J, HasDerivAt (deriv v) (deriv (deriv v) x) x) (hineq : ∀ x ∈ Set.Ioo (0 : ℝ) 1, -deriv (deriv u) x ≤ -deriv (deriv v) x) (hu0 : u 0 ≤ v 0) (hu1 : u 1 ≤ v 1) : ∀ x ∈ Set.Icc (0 : ℝ) 1, u x ≤ v x := J:Set ℝhJ_open:IsOpen JhJ_sub:Set.Icc 0 1 ⊆ Ju:ℝ → ℝv:ℝ → ℝhu:∀ x ∈ J, HasDerivAt u (deriv u x) xhu':∀ x ∈ J, HasDerivAt (deriv u) (deriv (deriv u) x) xhv:∀ x ∈ J, HasDerivAt v (deriv v x) xhv':∀ x ∈ J, HasDerivAt (deriv v) (deriv (deriv v) x) xhineq:∀ x ∈ Set.Ioo 0 1, -deriv (deriv u) x ≤ -deriv (deriv v) xhu0:u 0 ≤ v 0hu1:u 1 ≤ v 1⊢ ∀ x ∈ Set.Icc 0 1, u x ≤ v x All goals completed! 🐙
#159
How produced

Solved by the Aristotle automated theorem prover (Harmonic) via the `aristotle` CLI v1.0.1, with submission orchestration by Kim Morrison. The proof was generated against Aristotle's default Lean v4.28.0 / Mathlib v4.28.0 target; submitted here against the benchmark's pinned Lean v4.30.0-rc2 + pinned Mathlib commit. Comparator's verdict applies — proofs that exploit features added to Mathlib after v4.28.0 will compile; those that rely on tactic behaviour that changed are at the mercy of forward compatibility.

Cayley graph connected iff generators generate the group
mulCayley_connected_iff_closure_eq_top

Verso theorem preview

theorem declaration uses `sorry`mulCayley_connected_iff_closure_eq_top {G : Type*} [Group G] (S : Set G) : (SimpleGraph.mulCayley S).Connected ↔ Subgroup.closure S = ⊤ := G:Type u_1inst✝:Group GS:Set G⊢ (SimpleGraph.mulCayley S).Connected ↔ Subgroup.closure S = ⊤ All goals completed! 🐙
#160
How produced

Solved by the Aristotle automated theorem prover (Harmonic) via the `aristotle` CLI v1.0.1, with submission orchestration by Kim Morrison. The proof was generated against Aristotle's default Lean v4.28.0 / Mathlib v4.28.0 target; submitted here against the benchmark's pinned Lean v4.30.0-rc2 + pinned Mathlib commit. Comparator's verdict applies — proofs that exploit features added to Mathlib after v4.28.0 will compile; those that rely on tactic behaviour that changed are at the mercy of forward compatibility.

Finite Ramsey theorem for graphs
finite_graph_ramsey_theorem

Verso theorem preview

theorem declaration uses `sorry`finite_graph_ramsey_theorem : ∀ r s : ℕ, 2 ≤ r → 2 ≤ s → ∃ n : ℕ, ∀ G : SimpleGraph (Fin n), ¬ G.CliqueFree r ∨ ¬ Gᶜ.CliqueFree s := ⊢ ∀ (r s : ℕ), 2 ≤ r → 2 ≤ s → ∃ n, ∀ (G : SimpleGraph (Fin n)), ¬G.CliqueFree r ∨ ¬Gᶜ.CliqueFree s All goals completed! 🐙
#161
How produced

Solved by the Aristotle automated theorem prover (Harmonic) via the `aristotle` CLI v1.0.1, with submission orchestration by Kim Morrison. The proof was generated against Aristotle's default Lean v4.28.0 / Mathlib v4.28.0 target; submitted here against the benchmark's pinned Lean v4.30.0-rc2 + pinned Mathlib commit. Comparator's verdict applies — proofs that exploit features added to Mathlib after v4.28.0 will compile; those that rely on tactic behaviour that changed are at the mercy of forward compatibility.

Catalan generating function via compositional inversion
substInv_X_sub_X_sq_eq_catalan

Verso theorem preview

theorem declaration uses `sorry`substInv_X_sub_X_sq_eq_catalan (n : ℕ) : haveI : Invertible (coeff 1 ((X : ℚ⟦X⟧) - X ^ 2)) := n:ℕ⊢ Invertible ((coeff 1) (X - X ^ 2)) n:ℕ⊢ Invertible 1; All goals completed! 🐙 coeff (n + 1) (substInv ((X : ℚ⟦X⟧) - X ^ 2)) = (Nat.choose (2 * n) n : ℚ) / (↑n + 1) := n:ℕ⊢ (coeff (n + 1)) (X - X ^ 2).substInv = ↑((2 * n).choose n) / (↑n + 1) All goals completed! 🐙
#162
How produced

Solved by the Aristotle automated theorem prover (Harmonic) via the `aristotle` CLI v1.0.1, with submission orchestration by Kim Morrison. The proof was generated against Aristotle's default Lean v4.28.0 / Mathlib v4.28.0 target; submitted here against the benchmark's pinned Lean v4.30.0-rc2 + pinned Mathlib commit. Comparator's verdict applies — proofs that exploit features added to Mathlib after v4.28.0 will compile; those that rely on tactic behaviour that changed are at the mercy of forward compatibility.

First submissionMay 1, 2026
Last submissionAug 20, 2026
LorenzoLuccioli105parabamoghv42JohnEdwardJennings7sqrt-of-27kim-em6adrianmartir3Parcly-Taxel1
5Seed Prover (ByteDance)156 solved
Hardy–Littlewood sign-change for the prime race mod 4
chebyshev_sign_change

Verso theorem preview

theorem declaration uses `sorry`chebyshev_sign_change : LeanEval.NumberTheory.ChebyshevSignChangeProblem.chebyshevLead.Infinite ∧ {n : ℕ | primeCountingMod 3 n < primeCountingMod 1 n}.Infinite := ⊢ chebyshevLead.Infinite ∧ {n | primeCountingMod 3 n < primeCountingMod 1 n}.Infinite All goals completed! 🐙
#1
How produced

Automatically proved by Seed Prover.

Schläfli classification of regular polytopes
schlafli_classification

Verso theorem preview

theorem declaration uses `sorry`schlafli_classification : platonicCount 3 = 5 ∧ platonicCount 4 = 6 ∧ ∀ d, 5 ≤ d → platonicCount d = 3 := ⊢ platonicCount 3 = 5 ∧ platonicCount 4 = 6 ∧ ∀ (d : ℕ), 5 ≤ d → platonicCount d = 3 All goals completed! 🐙
#2
How produced

Automatically proved by Seed Prover.

Isoperimetric inequality (n-dim, topological-frontier form)
isoperimetric_inequality

Verso theorem preview

theorem declaration uses `sorry`isoperimetric (n : ℕ) (_hn : 2 ≤ n) (B : Set (LeanEval.Geometry.E n)) (_hB : MeasurableSet B) (_hBdd : Bornology.IsBounded B) : (n : ℝ≥0∞) ^ n * (volume B) ^ (n - 1) * volume (closedBall (0 : LeanEval.Geometry.E n) 1) ≤ (μHE[n - 1] (frontier B)) ^ n := n:ℕ_hn:2 ≤ nB:Set (E n)_hB:MeasurableSet B_hBdd:Bornology.IsBounded B⊢ ↑n ^ n * volume B ^ (n - 1) * volume (closedBall 0 1) ≤ μHE[n - 1] (frontier B) ^ n All goals completed! 🐙
#3
How produced

Automatically proved by Seed Prover.

De Branges's theorem (Bieberbach conjecture)
deBranges_theorem

Verso theorem preview

theorem declaration uses `sorry`deBranges (f : ℂ → ℂ) (diff : DifferentiableOn ℂ f (ball 0 1)) (inj : (ball 0 1).InjOn f) (h0 : f 0 = 0) (h1 : deriv f 0 = 1) (n : ℕ) : ‖iteratedDeriv n f 0 / n.factorial‖ ≤ n := f:ℂ → ℂdiff:DifferentiableOn ℂ f (ball 0 1)inj:Set.InjOn f (ball 0 1)h0:f 0 = 0h1:deriv f 0 = 1n:ℕ⊢ ‖iteratedDeriv n f 0 / ↑n.factorial‖ ≤ ↑n All goals completed! 🐙
#4
How produced

Automatically proved by Seed Prover.

Existence of a chiral oriented knot
exists_chiral_knot

Verso theorem preview

theorem declaration uses `sorry`exists_chiral_knot : ∃ K : LeanEval.KnotTheory.Knot, K.Chiral := ⊢ ∃ K, K.Chiral All goals completed! 🐙
#5
How produced

Automatically proved by Seed Prover.

Conway–Schneeberger fifteen theorem
conway_schneeberger_fifteen

Verso theorem preview

theorem declaration uses `sorry`conway_schneeberger_fifteen {n : ℕ} (Q : Matrix (Fin n) (Fin n) ℤ) (_hpos : Q.PosDef) : LeanEval.NumberTheory.ConwaySchneebergerFifteenProblem.IsUniversal Q ↔ ∀ k ∈ Finset.Icc (1 : ℤ) 15, LeanEval.NumberTheory.ConwaySchneebergerFifteenProblem.Represents Q k := n:ℕQ:Matrix (Fin n) (Fin n) ℤ_hpos:Q.PosDef⊢ IsUniversal Q ↔ ∀ k ∈ Finset.Icc 1 15, Represents Q k All goals completed! 🐙
#6
How produced

Automatically proved by Seed Prover.

Strong Mason conjecture for matroid independent sets
strong_mason_conjecture

Verso theorem preview

theorem declaration uses `sorry`strong_mason_conjecture {α : Type*} (M : Matroid α) [M.Finite] (k : ℕ) (hk : 0 < k) (hkn : k < M.E.ncard) : independentSetCount M (k - 1) * independentSetCount M (k + 1) * (k + 1) * (M.E.ncard - k + 1) ≤ independentSetCount M k ^ 2 * k * (M.E.ncard - k) := α:Type u_1M:Matroid αinst✝:M.Finitek:ℕhk:0 < khkn:k < M.E.ncard⊢ independentSetCount M (k - 1) * independentSetCount M (k + 1) * (k + 1) * (M.E.ncard - k + 1) ≤ independentSetCount M k ^ 2 * k * (M.E.ncard - k) All goals completed! 🐙
#7
How produced

Automatically proved by Seed Prover.

Furstenberg measure-preserving multiple recurrence
furstenberg_measure

Verso theorem preview

theorem declaration uses `sorry`furstenberg_measure_recurrence {Ω : Type*} [MeasurableSpace Ω] (μ : MeasureTheory.Measure Ω) [MeasureTheory.IsProbabilityMeasure μ] {T : Ω → Ω} (_hT : MeasureTheory.MeasurePreserving T μ μ) {A : Set Ω} (_hA : MeasurableSet A) (_h0 : 0 < μ A) (d : ℕ) (_hd : 1 ≤ d) : ∃ n : ℕ, 1 ≤ n ∧ 0 < μ (A ∩ ⋂ j ∈ Finset.Icc 1 d, T^[j * n] ⁻¹' A) := Ω:Type u_1inst✝¹:MeasurableSpace Ωμ:Measure Ωinst✝:IsProbabilityMeasure μT:Ω → Ω_hT:MeasurePreserving T μ μA:Set Ω_hA:MeasurableSet A_h0:0 < μ Ad:ℕ_hd:1 ≤ d⊢ ∃ n, 1 ≤ n ∧ 0 < μ (A ∩ ⋂ j ∈ Finset.Icc 1 d, T^[j * n] ⁻¹' A) All goals completed! 🐙
#8
How produced

Automatically proved by Seed Prover.

Platonic classification
platonic_classification

Verso theorem preview

theorem declaration uses `sorry`platonic_classification : platonicCount 2 = ⊤ ∧ platonicCount 3 = 5 ∧ platonicCount 4 = 6 ∧ ∀ d, 5 ≤ d → platonicCount d = 3 := ⊢ platonicCount 2 = ⊤ ∧ platonicCount 3 = 5 ∧ platonicCount 4 = 6 ∧ ∀ (d : ℕ), 5 ≤ d → platonicCount d = 3 All goals completed! 🐙
#9
How produced

Automatically proved by Seed Prover.

The alternating sign matrix theorem
alternating_sign_matrix_count

Verso theorem preview

theorem declaration uses `sorry`alternating_sign_matrix_count (n : ℕ) : (Nat.card (LeanEval.Combinatorics.AlternatingSignMatrix.ASMatrix n) : ℚ) = LeanEval.Combinatorics.AlternatingSignMatrix.robbinsProduct n := n:ℕ⊢ ↑(Nat.card (ASMatrix n)) = robbinsProduct n All goals completed! 🐙
#10
How produced

Automatically proved by Seed Prover.

Brauer–Suzuki theorem (quaternion Sylow 2-subgroup)
brauer_suzuki

Verso theorem preview

theorem declaration uses `sorry`brauer_suzuki {G : Type*} [Group G] [Finite G] (n : ℕ) (hn : 3 ≤ n) (P : Sylow 2 G) (hquat : Nonempty ((P : Subgroup G) ≃* QuaternionGroup (2 ^ (n - 2)))) (t : G) (ht_mem : t ∈ (P : Subgroup G)) (ht_ord : orderOf t = 2) : (QuotientGroup.mk t : G ⧸ LeanEval.GroupTheory.Defs.oddCore G) ∈ Subgroup.center (G ⧸ LeanEval.GroupTheory.Defs.oddCore G) := G:Type u_1inst✝¹:Group Ginst✝:Finite Gn:ℕhn:3 ≤ nP:Sylow 2 Ghquat:Nonempty (↥↑P ≃* QuaternionGroup (2 ^ (n - 2)))t:Ght_mem:t ∈ ↑Pht_ord:orderOf t = 2⊢ ↑t ∈ Subgroup.center (G ⧸ oddCore G) All goals completed! 🐙
#11
How produced

Automatically proved by Seed Prover.

Brauer's splitting field theorem
brauer_splitting_field

Verso theorem preview

theorem declaration uses `sorry`brauer_splitting_field (G : Type) [Group G] [Fintype G] (V : Type) [AddCommGroup V] [Module ℂ V] [FiniteDimensional ℂ V] (ρ : Representation ℂ G V) : ∃ (φ : CyclotomicField (Monoid.exponent G) ℚ →+* ℂ) (W : Type) (_ : AddCommGroup W) (_ : Module (CyclotomicField (Monoid.exponent G) ℚ) W) (σ : Representation (CyclotomicField (Monoid.exponent G) ℚ) G W), letI : Algebra (CyclotomicField (Monoid.exponent G) ℚ) ℂ := φ.toAlgebra ∃ (f : (ℂ ⊗[CyclotomicField (Monoid.exponent G) ℚ] W) ≃ₗ[ℂ] V), ∀ (g : G) (x : ℂ ⊗[CyclotomicField (Monoid.exponent G) ℚ] W), f ((σ g).baseChange ℂ x) = ρ g (f x) := G:Typeinst✝⁴:Group Ginst✝³:Fintype GV:Typeinst✝²:AddCommGroup Vinst✝¹:Module ℂ Vinst✝:FiniteDimensional ℂ Vρ:Representation ℂ G V⊢ ∃ φ W x x_1 σ f, ∀ (g : G) (x_2 : ℂ ⊗[CyclotomicField (Monoid.exponent G) ℚ] W), f ((LinearMap.baseChange ℂ (σ g)) x_2) = (ρ g) (f x_2) All goals completed! 🐙
#12
How produced

Automatically proved by Seed Prover.

Higman's infinite finitely-presented simple group
higman_infinite_simple

Verso theorem preview

theorem declaration uses `sorry`higman_infinite_simple : ∃ (n : ℕ) (rels : Set (FreeGroup (Fin n))), rels.Finite ∧ IsSimpleGroup (PresentedGroup rels) ∧ Infinite (PresentedGroup rels) := ⊢ ∃ n rels, rels.Finite ∧ IsSimpleGroup (PresentedGroup rels) ∧ Infinite (PresentedGroup rels) All goals completed! 🐙
#13
How produced

Automatically proved by Seed Prover.

Fáry–Milnor theorem (knot total curvature ≤ 4π implies unknotted)
fary_milnor

Verso theorem preview

theorem declaration uses `sorry`fary_milnor_total_curvature {r : ℝ → LeanEval.Geometry.FaryMilnorProblem.Space} (_hknot : LeanEval.Geometry.FaryMilnorProblem.IsSmoothKnot r) (_hK : LeanEval.Geometry.FaryMilnorProblem.totalCurvature r ≤ 4 * Real.pi) : LeanEval.Geometry.FaryMilnorProblem.IsUnknotted r := r:ℝ → Space_hknot:IsSmoothKnot r_hK:totalCurvature r ≤ 4 * π⊢ IsUnknotted r All goals completed! 🐙
#14
How produced

Automatically proved by Seed Prover.

Novikov's theorem: the word problem is undecidable for finitely presented groups
novikov_unsolvable

Verso theorem preview

theorem declaration uses `sorry`novikov_unsolvable : ∃ (n : ℕ) (rels : Set (FreeGroup (Fin n))), rels.Finite ∧ ¬ LeanEval.GroupTheory.NovikovUnsolvableProblem.WordProblemSolvable (PresentedGroup.mk rels) := ⊢ ∃ n rels, rels.Finite ∧ ¬WordProblemSolvable (PresentedGroup.mk rels) All goals completed! 🐙
#15
How produced

Automatically proved by Seed Prover.

Onsager's 2D Ising phase transition
ising_2d_phase_transition

Lean theorem statement

/-- **Onsager's 2D Ising phase transition.** The thermodynamic-limit free
energy exists for all `β` and is non-analytic at some positive `βc`. -/
theorem ising_2d_phase_transition :
    ∃ (F : ℝ → ℝ) (βc : ℝ),
      0 < βc ∧
        (∀ β : ℝ,
          Tendsto (fun n : ℕ => finiteIsingFreeEnergySeq n β) atTop (𝓝 (F β))) ∧
        ¬ AnalyticAt ℝ F βc := by
  sorry
#16
How produced

Automatically proved by Seed Prover.

KAM persistence of an invariant curve
kam_invariant_curve

Lean theorem statement

/-- **KAM theorem (persistence of an invariant curve).** For real-analytic,
`1`-periodic, non-constant, mean-zero `f` and Diophantine `α`, for all small
`|c|` the twist-map functional equation
`q(t+α) − 2q(t) + q(t−α) = c·f(q(t))` has a smooth strictly increasing solution
`q` with `q − id` periodic — the `c = 0` curve `q₀(t) = t` persists as a smooth
invariant curve of rotation number `α`. -/
theorem kam_invariant_curve
    (α : ℝ) (_hα : IsDiophantine α)
    (f : ℝ → ℝ)
    (_hf_analytic : AnalyticOnNhd ℝ f Set.univ)
    (_hf_per : Function.Periodic f 1)
    (_hf_nonconst : ¬ ∃ k : ℝ, ∀ x, f x = k)
    (_hf_mean : ∫ x in (0 : ℝ)..1, f x = 0) :
    ∃ c₀ : ℝ, 0 < c₀ ∧ ∀ c : ℝ, |c| < c₀ →
      ∃ q : ℝ → ℝ,
        ContDiff ℝ ∞ q ∧ StrictMono q ∧
        Function.Periodic (fun t => q t - t) 1 ∧
        ∀ t : ℝ, q (t + α) - 2 * q t + q (t - α) = c * f (q t) := by
  sorry
#17
How produced

Automatically proved by Seed Prover.

Upper bound theorem for geometric simplicial spheres (Stanley 1975)
upper_bound_simplicial_spheres

Verso theorem preview

theorem declaration uses `sorry`upper_bound_theorem_simplicial_spheres {d n k : ℕ} (X : LeanEval.Combinatorics.UpperBoundSimplicialSpheresProblem.FiniteSimplicialSphere d) (_hn : LeanEval.Combinatorics.UpperBoundSimplicialSpheresProblem.faceCount X 0 = n) (_hk : k < d) : LeanEval.Combinatorics.UpperBoundSimplicialSpheresProblem.faceCount X k ≤ LeanEval.Combinatorics.UpperBoundSimplicialSpheresProblem.cyclicPolytopeFaceCount n d k := d:ℕn:ℕk:ℕX:FiniteSimplicialSphere d_hn:faceCount X 0 = n_hk:k < d⊢ faceCount X k ≤ cyclicPolytopeFaceCount n d k All goals completed! 🐙
#18
How produced

Automatically proved by Seed Prover.

Weak Morse inequalities
weak_morse_inequality

Lean theorem statement

/-- **Weak Morse inequalities.** For a Morse function `f` on a closed
smooth finite-dimensional Hausdorff manifold `M` and every `k ∈ ℕ`,
`b_k(M) ≤ c_k(f)`. -/
theorem weak_morse_inequality
    {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E]
    {H : Type*} [TopologicalSpace H] {I : ModelWithCorners ℝ E H} [I.Boundaryless]
    {M : Type} [TopologicalSpace M] [ChartedSpace H M] [IsManifold I ∞ M]
    [CompactSpace M] [T2Space M] (f : M → ℝ) (_hf : IsMorseFunction I f) (k : ℕ) :
    bettiNumber M k ≤ morseCount I f k := by
  sorry
#19
How produced

Automatically proved by Seed Prover.

Morse inequalities
morse_inequality

Lean theorem statement

/-- **Morse inequalities** (Marston Morse, 1934). For a Morse function `f`
on a closed smooth finite-dimensional Hausdorff manifold `M` and every `k ∈ ℕ`,
`∑_{j≤k}(−1)^{k−j} c_j(f) ≥ ∑_{j≤k}(−1)^{k−j} b_j(M)`. -/
theorem morse_inequality
    {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E]
    {H : Type*} [TopologicalSpace H] {I : ModelWithCorners ℝ E H} [I.Boundaryless]
    {M : Type} [TopologicalSpace M] [ChartedSpace H M] [IsManifold I ∞ M]
    [CompactSpace M] [T2Space M] (f : M → ℝ) (_hf : IsMorseFunction I f) (k : ℕ) :
    alternatingPartialSum (bettiNumber M) k ≤
      alternatingPartialSum (morseCount I f) k := by
  sorry
#20
How produced

Automatically proved by Seed Prover.

Mandelbrot set is connected (Douady–Hubbard)
mandelbrot_connected

Lean theorem statement

/-- **Mandelbrot set is connected** (Douady–Hubbard). -/
theorem mandelbrot_connected : IsConnected Mandelbrot := by
  sorry
#21
How produced

Automatically proved by Seed Prover.

Dehn–Sommerville equations for simplicial spheres
dehn_sommerville

Lean theorem statement

/-- **Dehn–Sommerville equations.** The h-vector of a finite simplicial sphere
is symmetric: `h_j = h_{d-j}`. -/
theorem dehn_sommerville
    {d j : ℕ} (X : FiniteSimplicialSphere d) (hj : j ≤ d) :
    hVector X j = hVector X (d - j) := by
  sorry
#22
How produced

Automatically proved by Seed Prover.

Thue–Siegel–Roth theorem (irrationality measure ≤ 2 for algebraic irrationals)
thue_siegel_roth

Lean theorem statement

/-- **Thue–Siegel–Roth theorem** (Klaus Roth, 1955). Every irrational
algebraic real is Diophantine: its irrationality measure is at most
`2`. -/
theorem thueSiegelRoth (x : ℝ) (_h_irr : Irrational x)
    (_h_alg : IsAlgebraic ℤ x) : IsDiophantine x := by
  sorry
#23
How produced

Automatically proved by Seed Prover.

Commuting probabilities are closed
commProb_closed

Lean theorem statement

/-- The set of commuting probabilities of finite groups is closed. -/
theorem commProb_closed : IsClosed ({p : ℝ | ∃ (G : Type) (hG : Group G), commProb G = p}) := by
  sorry
#24
How produced

Automatically proved by Seed Prover.

Fatou–Julia / Cantor dichotomy
fatou_julia_dichotomy

Lean theorem statement

/-- **Fatou–Julia dichotomy.** For the quadratic family, `c ∈ M` implies
the filled Julia set `K_c` is connected; `c ∉ M` implies `K_c` is
homeomorphic to the Cantor space `ℕ → Bool`. -/
theorem julia_cantor_dichotomy (c : ℂ) :
    (c ∈ Mandelbrot → IsConnected (FilledJulia c)) ∧
    (c ∉ Mandelbrot → Nonempty ((FilledJulia c) ≃ₜ (ℕ → Bool))) := by
  sorry
#25
How produced

Automatically proved by Seed Prover.

Seventeen wallpaper groups (Pólya–Niggli 1924)
wallpaper_groups_17

Lean theorem statement

/-- **There are exactly 17 wallpaper groups** (Pólya–Niggli 1924). -/
theorem there_are_17_wallpaper_groups :
    crystallographicCount 2 = 17 := by
  sorry
#26
How produced

Automatically proved by Seed Prover.

Gleason's theorem (finite-dimensional)
gleason_theorem_finite

Lean theorem statement

/-- **Gleason's theorem**, finite-dimensional version. For `dim H ≥ 3`, every frame
function on the projection lattice of `H` is given by `P ↦ re Tr(ρ P)` for the unique
density operator `ρ` (positive, `re Tr ρ = 1`). -/
theorem gleason_theorem_finite
    {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H]
      [CompleteSpace H] [FiniteDimensional ℂ H]
    (hdim : 3 ≤ Module.finrank ℂ H)
    (f : FrameFunction H) :
    ∃! ρ : H →L[ℂ] H,
      ContinuousLinearMap.IsPositive ρ ∧
      reTr ρ = 1 ∧
      ∀ P : H →L[ℂ] H, IsOrthProj P → f.μ P = reTr (ρ * P) := by
  sorry
#27
How produced

Automatically proved by Seed Prover.

Margulis–Ruelle inequality
margulis_ruelle

Lean theorem statement

/-- **Margulis–Ruelle inequality (1968/1978).** `h_μ(T) ≤ λ₁⁺ + λ₂⁺`. -/
theorem margulis_ruelle
    (T T_inv : EucPlane → EucPlane)
    (hT_smooth : ContDiff ℝ 2 T)
    (hT_inv_smooth : ContDiff ℝ 2 T_inv)
    (hT_left : Function.LeftInverse T_inv T)
    (hT_right : Function.RightInverse T_inv T)
    (K : Set EucPlane)
    (hK_compact : IsCompact K)
    (hK_inv : T '' K = K)
    (μ : Measure EucPlane) [IsProbabilityMeasure μ]
    (hμ_supp : μ Kᶜ = 0)
    (hμ_pres : MeasurePreserving T μ μ)
    (hμ_erg : Ergodic T μ) :
    kolmogorovSinaiEntropy μ T
      ≤ max 0 (∫ x, lyapunovUpperAt T x ∂μ)
          + max 0 (∫ x, lyapunovLowerAt T x ∂μ) := by
  sorry
#28
How produced

Automatically proved by Seed Prover.

Poincaré–Bendixson theorem
poincare_bendixson

Lean theorem statement

/-- **Poincaré–Bendixson theorem.** For a `C¹` autonomous vector field
`F : ℝ² → ℝ²` and a forward integral curve `γ` on `[0, ∞)`, either the
forward orbit is unbounded, or the ω-limit set contains an equilibrium
of `F`, or the ω-limit set equals the range of a non-constant periodic
integral curve of `F`. -/
theorem poincare_bendixson
    (F : Plane → Plane) (_hF : ContDiff ℝ 1 F)
    (γ : ℝ → Plane)
    (_hγ : IsIntegralCurveOn γ (fun _ x => F x) (Set.Ici 0)) :
    ¬ Bornology.IsBounded (γ '' Set.Ici 0)
    ∨ (∃ x₀, F x₀ = 0 ∧ x₀ ∈ ⋂ s : ℝ, closure (γ '' Set.Ici s))
    ∨ (∃ T : ℝ, 0 < T ∧ ∃ β : ℝ → Plane,
        IsIntegralCurve β (fun _ x => F x) ∧
        (∀ t, β (t + T) = β t) ∧
        F (β 0) ≠ 0 ∧
        (⋂ s : ℝ, closure (γ '' Set.Ici s)) = Set.range β) := by
  sorry
#29
How produced

Automatically proved by Seed Prover.

Gleason's theorem (separable Hilbert space)
gleason_theorem_separable

Lean theorem statement

/-- **Gleason's theorem**, separable Hilbert space version (Gleason's original 1957
formulation). For a separable complex Hilbert space `H` of dimension at least `3`, every
frame function on the unit sphere of `H` is given by `x ↦ re ⟨x, ρ x⟩` for some positive
bounded operator `ρ`. (The Lean conclusion does not separately assert trace-class /
`Tr ρ = 1`; see the file docstring.) -/
theorem gleason_theorem_separable
    {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H]
      [CompleteSpace H] [TopologicalSpace.SeparableSpace H]
    (hdim : 3 ≤ Module.rank ℂ H)
    (f : SphereFrameFunction H) :
    ∃ ρ : H →L[ℂ] H,
      ContinuousLinearMap.IsPositive ρ ∧
      ∀ x : Metric.sphere (0 : H) 1,
        f.f x = (inner ℂ (x : H) (ρ (x : H))).re := by
  sorry
#30
How produced

Automatically proved by Seed Prover.

Mergelyan's theorem
mergelyan_theorem

Lean theorem statement

/-- **Mergelyan's theorem.** For a compact `K ⊆ ℂ` with connected
complement and `f : ℂ → ℂ` continuous on `K` and analytic on the
interior of `K`, every `ε > 0` admits a complex polynomial `p` with
`‖f z − p(z)‖ < ε` on `K`. -/
theorem mergelyan (K : Set ℂ) (_hK : IsCompact K) (_hKc : IsConnected (Kᶜ))
    (f : ℂ → ℂ) (_hfc : ContinuousOn f K) (_hfh : AnalyticOnNhd ℂ f (interior K))
    (ε : ℝ) (_hε : 0 < ε) :
    ∃ p : ℂ[X], ∀ z ∈ K, ‖f z - p.eval z‖ < ε := by
  sorry
#31
How produced

Automatically proved by Seed Prover.

pi_n of the n-sphere is Z
pin_sphere_n_mulEquiv_int

Lean theorem statement

/-- For every `n ≥ 1`, the `n`th homotopy group of the `n`-sphere is infinite cyclic. -/
theorem pin_sphere_n_mulEquiv_int
    (n : ℕ)
    (x : Metric.sphere (0 : EuclideanSpace ℝ (Fin (n + 2))) 1) :
    Nonempty
      (HomotopyGroup.Pi (n + 1) (Metric.sphere (0 : EuclideanSpace ℝ (Fin (n + 2))) 1) x ≃*
        Multiplicative ℤ) := by
  sorry
#32
How produced

Automatically proved by Seed Prover.

pi_3 of the 2-sphere is Z
pi3_sphere_two_mulEquiv_int

Lean theorem statement

/-- The third homotopy group of the 2-sphere is infinite cyclic. -/
theorem pi3_sphere_two_mulEquiv_int
    (x : Metric.sphere (0 : EuclideanSpace ℝ (Fin 3)) 1) :
    Nonempty
      (HomotopyGroup.Pi 3 (Metric.sphere (0 : EuclideanSpace ℝ (Fin 3)) 1) x ≃*
        Multiplicative ℤ) := by
  sorry
#33
How produced

Automatically proved by Seed Prover.

Bézout's theorem (projective, with multiplicity)
bezout_projective_multiplicity

Lean theorem statement

/-- **Bézout's theorem (with multiplicity).** Given `n` homogeneous
polynomials `f_k` in `n + 1` variables, each of total degree exactly
`d_k ≥ 1`, over an algebraically closed field with finite common
projective zero set, the sum of intersection multiplicities equals
`∏ d_k`. The `totalDegree` hypothesis rules out the zero polynomial
(which is `IsHomogeneous d` for every `d` but has `totalDegree = 0`). -/
theorem bezout_multiplicity [IsAlgClosed K] {n : ℕ}
    (f : Fin n → MvPolynomial (Fin (n + 1)) K)
    (d : Fin n → ℕ) (_hd : ∀ k, (f k).IsHomogeneous (d k))
    (_hdeg : ∀ k, (f k).totalDegree = d k)
    (_hd_pos : ∀ k, 1 ≤ d k)
    (_hfin : (⋂ k, vanishingSet (f k)).Finite) :
    ∑ᶠ p ∈ (⋂ k, vanishingSet (f k)), intersectionMultiplicity f p
      = (∏ k, d k : ℕ∞) := by
  sorry
#34
How produced

Automatically proved by Seed Prover.

Jordan–Brouwer separation theorem
jordan_brouwer

Lean theorem statement

/-- **Jordan–Brouwer separation theorem.** For `d ≥ 2`, the
complement in `ℝᵈ` of a topological `(d−1)`-sphere (the image of any
continuous injection from the unit `(d−1)`-sphere into `ℝᵈ`) has
exactly two connected components. -/
theorem jordan_brouwer (d : ℕ) (_hd : 2 ≤ d)
    (r : Metric.sphere (0 : EuclideanSpace ℝ (Fin d)) 1 → EuclideanSpace ℝ (Fin d))
    (_hcont : Continuous r) (_hinj : Function.Injective r) :
    Nat.card
        (ConnectedComponents ((Set.range r)ᶜ : Set (EuclideanSpace ℝ (Fin d)))) =
      2 := by
  sorry
#35
How produced

Automatically proved by Seed Prover.

Darboux's theorem (symplectic forms are locally standard)
darboux

Lean theorem statement

/-- **Darboux's theorem.** Every symplectic form on an open subset
`U ⊆ ℝ^{2n}` is locally symplectomorphic to the standard symplectic form
`ω₀`. Formally: for every `x ∈ U` there is a smooth local diffeomorphism
`φ` (`OpenPartialHomeomorph`, smooth in both directions) whose source lies
in `U` and contains `x`, such that on the target the pullback of `α` by
`φ⁻¹` is in Darboux normal form (and hence equals `ω₀`) at every point. -/
theorem darboux {n : ℕ} {U : Set (E n)} (_hU : IsOpen U)
    (α : E n → E n [⋀^Fin 2]→L[ℝ] ℝ) (_hα : IsSymplecticOn α U)
    {x : E n} (_hx : x ∈ U) :
    ∃ φ : OpenPartialHomeomorph (E n) (E n),
      x ∈ φ.source ∧ φ.source ⊆ U ∧
      ContDiffOn ℝ ∞ (φ : E n → E n) φ.source ∧
      ContDiffOn ℝ ∞ (φ.symm : E n → E n) φ.target ∧
      ∀ z ∈ φ.target,
        IsDarbouxNormal
          ((α (φ.symm z)).compContinuousLinearMap
            (fderiv ℝ (φ.symm : E n → E n) z)) := by
  sorry
#36
How produced

Automatically proved by Seed Prover.

Wieferich's theorem g(3) = 9
wieferich_g_three

Verso theorem preview

theorem declaration uses `sorry`wieferich_g_three : (∀ n : ℕ, LeanEval.NumberTheory.IsSumOfCubes 9 n) ∧ ∃ n : ℕ, ¬ LeanEval.NumberTheory.IsSumOfCubes 8 n := ⊢ (∀ (n : ℕ), IsSumOfCubes 9 n) ∧ ∃ n, ¬IsSumOfCubes 8 n All goals completed! 🐙
#37
How produced

Automatically proved by Seed Prover.

Ado's theorem in characteristic zero
adoCharZero

Verso theorem preview

theorem declaration uses `sorry`adoCharZero [CharZero K] [FiniteDimensional K L] : ∃ (V : Type u) (_ : AddCommGroup V) (_ : Module K V) (_ : FiniteDimensional K V) (ρ : L →ₗ⁅K⁆ Module.End K V), Function.Injective ρ := K:Type uL:Type uinst✝⁴:Field Kinst✝³:LieRing Linst✝²:LieAlgebra K Linst✝¹:CharZero Kinst✝:FiniteDimensional K L⊢ ∃ V x x_1, ∃ (_ : FiniteDimensional K V), ∃ ρ, Function.Injective ⇑ρ All goals completed! 🐙
#38
How produced

Automatically proved by Seed Prover.

Spencer-Szemerédi-Trotter unit-distance upper bound
unit_distance_upper_bound

Verso theorem preview

theorem declaration uses `sorry`unit_distance_upper_bound : ∃ C : ℝ, 0 < C ∧ ∀ P : Finset (EuclideanSpace ℝ (Fin 2)), (unitDist P : ℝ) ≤ C * (P.card : ℝ) ^ ((4 : ℝ) / 3) := ⊢ ∃ C, 0 < C ∧ ∀ (P : Finset (EuclideanSpace ℝ (Fin 2))), ↑(unitDist P) ≤ C * ↑P.card ^ (4 / 3) All goals completed! 🐙
#39
How produced

Automatically proved by Seed Prover.

Existence of a simple group of order 10200960 with a 22-dim irrep whose tensor square has 4 isotypic components
m23_irrep_tensor_square_decomp

Verso theorem preview

theorem declaration uses `sorry`m23_irrep_tensor_square_decomp : ∃ (G : Type) (_ : Group G) (_ : Fintype G), Fintype.card G = 10200960 ∧ IsSimpleGroup G ∧ ∃ (V : Type) (_ : AddCommGroup V) (_ : Module ℂ V) (ρ : Representation ℂ G V), Module.finrank ℂ V = 22 ∧ ρ.IsIrreducible ∧ (@isotypicComponents (MonoidAlgebra ℂ G) (V ⊗[ℂ] V) _ _ (Module.compHom (V ⊗[ℂ] V) (Representation.asAlgebraHom (ρ.tprod ρ)).toRingHom)).ncard = 4 := ⊢ ∃ G x x_1, Fintype.card G = 10200960 ∧ IsSimpleGroup G ∧ ∃ V x_2 x_3 ρ, Module.finrank ℂ V = 22 ∧ ρ.IsIrreducible ∧ (isotypicComponents (MonoidAlgebra ℂ G) (V ⊗[ℂ] V)).ncard = 4 All goals completed! 🐙
#40
How produced

Automatically proved by Seed Prover.

Moran's equality for affine-symmetric iterated function systems
moran_equality_affine

Verso theorem preview

theorem declaration uses `sorry`moran_equality_affine {d n : ℕ} (hn : 1 ≤ n) (f : Fin n → EuclideanSpace ℝ (Fin d) → EuclideanSpace ℝ (Fin d)) (lam : ℝ) (h_aff : LeanEval.Dynamics.IsAffineSymmetricIFS f lam) (h_osc : LeanEval.Dynamics.OpenSetCondition f) {S : Set (EuclideanSpace ℝ (Fin d))} (hS : LeanEval.Dynamics.IsAttractor f S) : dimH S = ENNReal.ofReal (- Real.log n / Real.log lam) := d:ℕn:ℕhn:1 ≤ nf:Fin n → EuclideanSpace ℝ (Fin d) → EuclideanSpace ℝ (Fin d)lam:ℝh_aff:IsAffineSymmetricIFS f lamh_osc:OpenSetCondition fS:Set (EuclideanSpace ℝ (Fin d))hS:IsAttractor f S⊢ dimH S = ENNReal.ofReal (-Real.log ↑n / Real.log lam) All goals completed! 🐙
#41
How produced

Automatically proved by Seed Prover.

A 3-manifold group with no faithful representation into GL(4, ℝ)
nonlinear_three_manifold_group

Verso theorem preview

theorem declaration uses `sorry`nonlinear_three_manifold_group : ∃ (M : LeanEval.Topology.Closed3Manifold) (x : M.carrier), ∀ f : FundamentalGroup M.carrier x →* GL (Fin 4) ℝ, ¬ Function.Injective f := ⊢ ∃ M x, ∀ (f : FundamentalGroup M.carrier x →* GL (Fin 4) ℝ), ¬Function.Injective ⇑f All goals completed! 🐙
#42
How produced

Automatically proved by Seed Prover.

The Hopf Umlaufsatz (theorem of turning tangents)
hopf_umlaufsatz

Verso theorem preview

theorem declaration uses `sorry`hopf_umlaufsatz {r : ℝ → LeanEval.Geometry.HopfUmlaufsatz.Plane} {α : ℝ → ℝ} (_hr : LeanEval.Geometry.HopfUmlaufsatz.IsPositiveSimpleClosedUnitSpeedCurve r) (_hα : LeanEval.Geometry.HopfUmlaufsatz.IsTangentAngleLift r α) : totalCurvature α = 2 * Real.pi := r:ℝ → Planeα:ℝ → ℝ_hr:IsPositiveSimpleClosedUnitSpeedCurve r_hα:IsTangentAngleLift r α⊢ totalCurvature α = 2 * Real.pi All goals completed! 🐙
#43
How produced

Automatically proved by Seed Prover.

Morrison–Walker Lemma B.0.1: adapting families of maps to open covers
families_of_maps_b01

Verso theorem preview

/-- **Lemma B.0.1** of Morrison–Walker, *The Blob Complex* (arXiv:1009.5025, §B), continuous case. -/ theorem declaration uses `sorry`continuous {P : Set (Fin k → ℝ)} (_hP : IsPolyhedron P) [CompactSpace X] (U : ι → Set X) (_hUopen : ∀ α, IsOpen (U α)) (ρ : PartitionOfUnity ι X univ) (_hρ : ρ.IsSubordinate U) (f : C(P × X, T)) : ∃ F : C(I × P × X, T), (∀ p : P, ∀ x : X, F (0, p, x) = f (p, x)) ∧ (∃ K : Subdivision P, ∀ D ∈ K.complex.facets, AdaptedTo U k (fun q : closedCell P D × X => F (1, q.1.1, q.2))) ∧ (∀ S : Set X, Supported (f := f.toFun) S → Supported (fun q : (I × P) × X => F (q.1.1, q.1.2, q.2)) S) ∧ (∀ Q : Set P, IsBoundarySubpolyhedron Q → ∀ S' : Set X, Supported (fun q : Q × X => f (q.1.1, q.2)) S' → Supported (fun q : (I × Q) × X => F (q.1.1, q.1.2.1, q.2)) S') := k:ℕι:Type u_1X:Type u_2T:Type u_3inst✝²:TopologicalSpace Xinst✝¹:TopologicalSpace TP:Set (Fin k → ℝ)_hP:IsPolyhedron Pinst✝:CompactSpace XU:ι → Set X_hUopen:∀ (α : ι), IsOpen[inst✝²] (U α)ρ:PartitionOfUnity ι X_hρ:ρ.IsSubordinate Uf:C(↑P × X, T)⊢ ∃ F, (∀ (p : ↑P) (x : X), F (0, p, x) = f (p, x)) ∧ (∃ K, ∀ D ∈ K.complex.facets, AdaptedTo U k fun q => F (1, ↑q.1, q.2)) ∧ (∀ (S : Set X), Supported f.toFun S → Supported (fun q => F (q.1.1, q.1.2, q.2)) S) ∧ ∀ (Q : Set ↑P), IsBoundarySubpolyhedron Q → ∀ (S' : Set X), Supported (fun q => f (↑q.1, q.2)) S' → Supported (fun q => F (q.1.1, ↑q.1.2, q.2)) S' All goals completed! 🐙
/-- **Lemma B.0.1**, bi-Lipschitz variant (part 4 of the paper). -/ theorem declaration uses `sorry`biLipschitz {X T : Type*} [MetricSpace X] [MetricSpace T] [CompactSpace X] {P : Set (Fin k → ℝ)} (_hP : IsPolyhedron P) {ι : Type*} (U : ι → Set X) (_hUopen : ∀ α, IsOpen (U α)) (ρ : PartitionOfUnity ι X univ) (_hρ : ρ.IsSubordinate U) (f : C(P × X, T)) (slice : P → (X ≃ₜ T)) (_h_slice_eq : ∀ p : P, ∀ x : X, f (p, x) = slice p x) (L : NNReal) (_hf_joint : LipschitzWith L f.toFun) (_hf_slice_inv : ∀ p : P, LipschitzWith L (slice p).symm) : ∃ F : C(I × P × X, T), ∃ L' : NNReal, ∃ Slice : I × P → (X ≃ₜ T), (∀ p : P, ∀ x : X, F (0, p, x) = f (p, x)) ∧ (∀ t : I, ∀ p : P, ∀ x : X, F (t, p, x) = Slice (t, p) x) ∧ (∃ K : Subdivision P, ∀ D ∈ K.complex.facets, AdaptedTo U k (fun q : closedCell P D × X => F (1, q.1.1, q.2))) ∧ (∀ S : Set X, Supported (f := f.toFun) S → Supported (fun q : (I × P) × X => F (q.1.1, q.1.2, q.2)) S) ∧ (∀ Q : Set P, IsBoundarySubpolyhedron Q → ∀ S' : Set X, Supported (fun q : Q × X => f (q.1.1, q.2)) S' → Supported (fun q : (I × Q) × X => F (q.1.1, q.1.2.1, q.2)) S') ∧ (∀ tp : I × P, LipschitzWith L' (Slice tp)) ∧ (∀ tp : I × P, LipschitzWith L' (Slice tp).symm) := k:ℕX:Type u_4T:Type u_5inst✝²:MetricSpace Xinst✝¹:MetricSpace Tinst✝:CompactSpace XP:Set (Fin k → ℝ)_hP:IsPolyhedron Pι:Type u_6U:ι → Set X_hUopen:∀ (α : ι), IsOpen[PseudoMetricSpace.toUniformSpace.toTopologicalSpace] (U α)ρ:PartitionOfUnity ι X_hρ:ρ.IsSubordinate Uf:C(↑P × X, T)slice:↑P → X ≃ₜ T_h_slice_eq:∀ (p : ↑P) (x : X), f (p, x) = (slice p) xL:NNReal_hf_joint:LipschitzWith L f.toFun_hf_slice_inv:∀ (p : ↑P), LipschitzWith L ⇑(slice p).symm⊢ ∃ F L' Slice, (∀ (p : ↑P) (x : X), F (0, p, x) = f (p, x)) ∧ (∀ (t : ↑I) (p : ↑P) (x : X), F (t, p, x) = (Slice (t, p)) x) ∧ (∃ K, ∀ D ∈ K.complex.facets, AdaptedTo U k fun q => F (1, ↑q.1, q.2)) ∧ (∀ (S : Set X), Supported f.toFun S → Supported (fun q => F (q.1.1, q.1.2, q.2)) S) ∧ (∀ (Q : Set ↑P), IsBoundarySubpolyhedron Q → ∀ (S' : Set X), Supported (fun q => f (↑q.1, q.2)) S' → Supported (fun q => F (q.1.1, ↑q.1.2, q.2)) S') ∧ (∀ (tp : ↑I × ↑P), LipschitzWith L' ⇑(Slice tp)) ∧ ∀ (tp : ↑I × ↑P), LipschitzWith L' ⇑(Slice tp).symm All goals completed! 🐙
#44
How produced

Automatically proved by Seed Prover.

Pick's theorem
pick

Verso theorem preview

theorem declaration uses `sorry`pick {n : ℕ} (hn : 3 ≤ n) (v : Fin n → ℤ × ℤ) (hsimple : LeanEval.Geometry.PicksTheorem.IsSimple (LeanEval.Geometry.PicksTheorem.latPoly v)) : area ((LeanEval.Geometry.PicksTheorem.latPoly v).boundary (R := ℝ)) = (interiorPts v : ℝ) + (boundaryPts v : ℝ) / 2 - 1 := n:ℕhn:3 ≤ nv:Fin n → ℤ × ℤhsimple:IsSimple (latPoly v)⊢ area (Polygon.boundary ℝ (latPoly v)) = ↑(interiorPts v) + ↑(boundaryPts v) / 2 - 1 All goals completed! 🐙
#45
How produced

Automatically proved by Seed Prover.

Existence of a non-isotopic pair of oriented knots
exists_nonisotopic_knots

Verso theorem preview

theorem declaration uses `sorry`exists_nonisotopic_knots : ∃ K₁ K₂ : LeanEval.KnotTheory.Knot, ¬ K₁.Isotopic K₂ := ⊢ ∃ K₁ K₂, ¬K₁.Isotopic K₂ All goals completed! 🐙
#46
How produced

Automatically proved by Seed Prover.

Riesz brothers' theorem
riesz_brothers_theorem

Lean theorem statement

/-- **Riesz brothers' theorem.** Let `μ` be a complex Borel measure on
the unit circle such that `∫ z^n dμ = 0` for every `n ≥ 1`. Then `μ` is
absolutely continuous with respect to Haar measure. The usual density
formulation follows by applying the Radon–Nikodym theorem to this conclusion;
the hypothesis transfers the Fourier-vanishing property to that density. This
corollary is not part of the formal statement here. -/
theorem riesz_brothers_theorem (μ : ComplexMeasure UnitAddCircle)
    (hμ : ∀ n : ℕ, 1 ≤ n → ∫ᵛ z, fourier n z ∂[ContinuousLinearMap.mul ℝ ℂ; μ] = 0) :
    μ ≪ᵥ AddCircle.haarAddCircle.toENNRealVectorMeasure := by
  sorry
#47
How produced

Automatically proved by Seed Prover.

Wigner semicircle law
wigner_semicircle

Verso theorem preview

theorem declaration uses `sorry`wigner_semicircle {Ω : Type*} [MeasurableSpace Ω] (μ : Measure Ω) [IsProbabilityMeasure μ] (X : ℕ → ℕ → Ω → ℝ) (_hX_meas : ∀ i j, Measurable (X i j)) (_hX_indep : iIndepFun (fun ij : {p : ℕ × ℕ // p.1 ≤ p.2} => X ij.val.1 ij.val.2) μ) (_hX_iid : ∀ i j i' j', i ≤ j → i' ≤ j' → ProbabilityTheory.IdentDistrib (X i j) (X i' j') μ μ) (_hX_int : ∀ i j, i ≤ j → Integrable (X i j) μ) (_hX_sq_int : ∀ i j, i ≤ j → Integrable (fun ω => (X i j ω) ^ 2) μ) (_hX_mean : ∀ i j, i ≤ j → ∫ ω, X i j ω ∂μ = 0) (_hX_var : ∀ i j, i ≤ j → ∫ ω, (X i j ω) ^ 2 ∂μ = 1) : ∀ᵐ ω ∂μ, ∀ (f : ℝ → ℝ), Continuous f → (∃ M, ∀ x, ‖f x‖ ≤ M) → Tendsto (fun n : ℕ => ∫ x, f x ∂ (empiricalSpectralMeasureHerm (wignerMatrix_isHermitian X n ω)).map (fun x : ℝ => x / Real.sqrt n)) atTop (𝓝 (∫ x, f x ∂semicircleLaw)) := Ω:Type u_1inst✝¹:MeasurableSpace Ωμ:Measure Ωinst✝:IsProbabilityMeasure μX:ℕ → ℕ → Ω → ℝ_hX_meas:∀ (i j : ℕ), Measurable (X i j)_hX_indep:iIndepFun (fun ij => X (↑ij).1 (↑ij).2) μ_hX_iid:∀ (i j i' j' : ℕ), i ≤ j → i' ≤ j' → IdentDistrib (X i j) (X i' j') μ μ_hX_int:∀ (i j : ℕ), i ≤ j → Integrable (X i j) μ_hX_sq_int:∀ (i j : ℕ), i ≤ j → Integrable (fun ω => X i j ω ^ 2) μ_hX_mean:∀ (i j : ℕ), i ≤ j → ∫ (ω : Ω), X i j ω ∂μ = 0_hX_var:∀ (i j : ℕ), i ≤ j → ∫ (ω : Ω), X i j ω ^ 2 ∂μ = 1⊢ ∀ᵐ (ω : Ω) ∂μ, ∀ (f : ℝ → ℝ), Continuous f → (∃ M, ∀ (x : ℝ), ‖f x‖ ≤ M) → Tendsto (fun n => ∫ (x : ℝ), f x ∂Measure.map (fun x => x / √↑n) (empiricalSpectralMeasureHerm ⋯)) atTop (𝓝 (∫ (x : ℝ), f x ∂semicircleLaw)) All goals completed! 🐙
#48
How produced

Automatically proved by Seed Prover.

Radó's theorem on Riemann surfaces
rado_riemannSurface

Verso theorem preview

theorem declaration uses `sorry`rado_riemannSurface {X : Type*} [TopologicalSpace X] [T2Space X] [ConnectedSpace X] [ChartedSpace ℂ X] [IsManifold (modelWithCornersSelf ℂ ℂ) 1 X] : SecondCountableTopology X := X:Type u_1inst✝⁴:TopologicalSpace Xinst✝³:T2Space Xinst✝²:ConnectedSpace Xinst✝¹:ChartedSpace ℂ Xinst✝:IsManifold (modelWithCornersSelf ℂ ℂ) 1 X⊢ SecondCountableTopology X All goals completed! 🐙
#49
How produced

Automatically proved by Seed Prover.

Cauchy–Kovalevskaya theorem
cauchy_kovalevskaya

Verso theorem preview

theorem declaration uses `sorry`cauchy_kovalevskaya {d : ℕ} (F : LeanEval.Analysis.E d × ℝ × ℝ → LeanEval.Analysis.E d) (f : LeanEval.Analysis.E d × ℝ × ℝ → ℝ) (u₀ : LeanEval.Analysis.E d → ℝ) (_hF : AnalyticOnNhd ℝ F univ) (_hf : AnalyticOnNhd ℝ f univ) (_hu₀ : AnalyticOnNhd ℝ u₀ univ) (x₀ : LeanEval.Analysis.E d) : ∃ (U : Set (LeanEval.Analysis.E d × ℝ)) (u : LeanEval.Analysis.E d × ℝ → ℝ), (x₀, (0 : ℝ)) ∈ U ∧ IsOpen U ∧ AnalyticOnNhd ℝ u U ∧ (∀ x : LeanEval.Analysis.E d, (x, (0 : ℝ)) ∈ U → u (x, 0) = u₀ x) ∧ (∀ p ∈ U, fderiv ℝ u p ((0 : LeanEval.Analysis.E d), (1 : ℝ)) = fderiv ℝ u p (F (p.1, p.2, u p), (0 : ℝ)) + f (p.1, p.2, u p)) ∧ (∀ v : LeanEval.Analysis.E d × ℝ → ℝ, AnalyticOnNhd ℝ v U → (∀ x : LeanEval.Analysis.E d, (x, (0 : ℝ)) ∈ U → v (x, 0) = u₀ x) → (∀ p ∈ U, fderiv ℝ v p ((0 : LeanEval.Analysis.E d), (1 : ℝ)) = fderiv ℝ v p (F (p.1, p.2, v p), (0 : ℝ)) + f (p.1, p.2, v p)) → ∀ p ∈ U, u p = v p) := d:ℕF:E d × ℝ × ℝ → E df:E d × ℝ × ℝ → ℝu₀:E d → ℝ_hF:AnalyticOnNhd ℝ F univ_hf:AnalyticOnNhd ℝ f univ_hu₀:AnalyticOnNhd ℝ u₀ univx₀:E d⊢ ∃ U u, (x₀, 0) ∈ U ∧ IsOpen U ∧ AnalyticOnNhd ℝ u U ∧ (∀ (x : E d), (x, 0) ∈ U → u (x, 0) = u₀ x) ∧ (∀ p ∈ U, (fderiv ℝ u p) (0, 1) = (fderiv ℝ u p) (F (p.1, p.2, u p), 0) + f (p.1, p.2, u p)) ∧ ∀ (v : E d × ℝ → ℝ), AnalyticOnNhd ℝ v U → (∀ (x : E d), (x, 0) ∈ U → v (x, 0) = u₀ x) → (∀ p ∈ U, (fderiv ℝ v p) (0, 1) = (fderiv ℝ v p) (F (p.1, p.2, v p), 0) + f (p.1, p.2, v p)) → ∀ p ∈ U, u p = v p All goals completed! 🐙
#50
How produced

Automatically proved by Seed Prover.

The Golod–Shafarevich inequality
golod_shafarevich_inequality

Verso theorem preview

theorem declaration uses `sorry`golod_shafarevich_inequality (p : ℕ) [Fact p.Prime] (Q : Type) [Group Q] [TopologicalSpace Q] [IsTopologicalGroup Q] [DiscreteTopology Q] [Finite Q] : IsPGroup p Q → Nontrivial Q → (generatorRank Q : ℝ) ^ 2 < 4 * (relationRank p Q : ℝ) := p:ℕinst✝⁵:Fact (Nat.Prime p)Q:Typeinst✝⁴:Group Qinst✝³:TopologicalSpace Qinst✝²:IsTopologicalGroup Qinst✝¹:DiscreteTopology Qinst✝:Finite Q⊢ IsPGroup p Q → Nontrivial Q → ↑(generatorRank Q) ^ 2 < 4 * ↑(relationRank p Q) All goals completed! 🐙
#51
How produced

Automatically proved by Seed Prover.

No bounded projection from L^1 onto H^1
H1_not_closedComplemented

Verso theorem preview

theorem declaration uses `sorry`H1_not_closedComplemented : ¬ LeanEval.Analysis.H1.ClosedComplemented := ⊢ ¬H1.ClosedComplemented All goals completed! 🐙
#52
How produced

Automatically proved by Seed Prover.

Radial symmetry for positive semilinear Poisson solutions
semilinear_poisson_radial_symmetry

Verso theorem preview

theorem declaration uses `sorry`semilinear_poisson_radial_symmetry {n : ℕ} (hn : 0 < n) {f : ℝ → ℝ} (u : EuclideanSpace ℝ (Fin n) → ℝ) (hf_lipschitz : ∃ K : ℝ≥0, LipschitzWith K f) (hu_c2 : ContDiffOn ℝ 2 u (closedBall 0 1)) (hu_solve : LeanEval.Analysis.PDE.SolvesSemilinearPoisson f u) (hu_positive : ∀ x ∈ ball 0 1, 0 < u x) : ∃ v : ℝ → ℝ≥0, StrictAntiOn v (Set.Icc (0 : ℝ) 1) ∧ ∀ x ∈ closedBall 0 1, u x = v ‖x‖ := n:ℕhn:0 < nf:ℝ → ℝu:EuclideanSpace ℝ (Fin n) → ℝhf_lipschitz:∃ K, LipschitzWith K fhu_c2:ContDiffOn ℝ 2 u (closedBall 0 1)hu_solve:SolvesSemilinearPoisson f uhu_positive:∀ x ∈ ball 0 1, 0 < u x⊢ ∃ v, StrictAntiOn v (Set.Icc 0 1) ∧ ∀ x ∈ closedBall 0 1, u x = ↑(v ‖x‖) All goals completed! 🐙
#53
How produced

Automatically proved by Seed Prover.

Strong Subadditivity of von Neumann Entropy
strong_subadditivity

Verso theorem preview

theorem declaration uses `sorry`strong_subadditivity (M_ABC : Matrix (A × B × C) (A × B × C) ℂ) (h : M_ABC.PosSemidef) : let M_AB : Matrix (A × B) (A × B) ℂ := .traceRight <| M_ABC.reindex (.symm <| .prodAssoc ..) (.symm <| .prodAssoc ..) let M_BC : Matrix (B × C) (B × C) ℂ := M_ABC.traceLeft let M_B : Matrix B B ℂ := M_BC.traceRight LeanEval.Physics.entropy M_ABC + LeanEval.Physics.entropy M_B ≤ LeanEval.Physics.entropy M_AB + LeanEval.Physics.entropy M_BC := A:Type u_1B:Type u_2C:Type u_3inst✝⁸:Fintype Ainst✝⁷:Fintype Binst✝⁶:Fintype Cinst✝⁵:DecidableEq Ainst✝⁴:DecidableEq Binst✝³:DecidableEq Cinst✝²:Nonempty Ainst✝¹:Nonempty Binst✝:Nonempty CM_ABC:Matrix (A × B × C) (A × B × C) ℂh:M_ABC.PosSemidef⊢ let M_AB := ((Matrix.reindex (Equiv.prodAssoc A B C).symm (Equiv.prodAssoc A B C).symm) M_ABC).traceRight; let M_BC := M_ABC.traceLeft; let M_B := M_BC.traceRight; entropy M_ABC + entropy M_B ≤ entropy M_AB + entropy M_BC All goals completed! 🐙
#54
How produced

Automatically proved by Seed Prover.

Brun's theorem (convergence of the twin-prime reciprocal sum)
brun_constant_converges

Lean theorem statement

/-- **Brun's theorem.** The reciprocal sum over twin-prime pairs converges. -/
theorem brun_constant_converges :
    Summable twinPrimeReciprocalTerm := by
  sorry
#55
How produced

Automatically proved by Seed Prover.

General recursive equals Turing computable
turing_recursive_equiv

Lean theorem statement

/-- **General recursive = Turing computable** (total form). A total function
`f : ℕ → ℕ` is recursive (`Computable`, i.e. partial recursive as a partial
function) **iff** it is computed by some Turing machine (mathlib's `FinTM2`
model) under the standard binary encoding of `ℕ`. This is Knill's class
equality; the backward direction (TM-computable ⇒ recursive) is absent from
mathlib. -/
theorem turing_recursive_equiv (f : ℕ → ℕ) :
    Computable f ↔ Nonempty (TM2Computable encodeNat encodeNat f) := by
  sorry
#56
How produced

Automatically proved by Seed Prover.

Gauss-Wantzel constructible regular polygon theorem
gauss_wantzel_constructible_polygon

Lean theorem statement

/-- **Gauss-Wantzel constructible polygon theorem** (§174): a regular `n`-gon
is straightedge-and-compass constructible exactly for the Gauss-Wantzel
integers. -/
theorem gauss_wantzel_constructible_polygon (n : ℕ) (hn : 3 ≤ n) :
    IsConstructible (Real.cos (2 * Real.pi / n)) ↔ GaussWantzelNumber n := by
  sorry
#57
How produced

Automatically proved by Seed Prover.

Poincaré–Siegel linearisation theorem
poincare_siegel_linearisation

Lean theorem statement

/-- **Poincaré–Siegel linearisation theorem.** If `α` is Diophantine,
`λ = e^{2πiα}`, and `f` is holomorphic near `0` with `f 0 = 0` and
`f'(0) = λ`, then there is a holomorphic germ `u` with `u 0 = 0`,
`u'(0) = 1`, and `f(u z) = u(λ z)` for `z` near `0`. -/
theorem poincare_siegel
    (α : ℝ) (_hα : IsDiophantine α)
    (lam : ℂ) (_hlam : lam = Complex.exp (2 * Real.pi * Complex.I * (α : ℂ)))
    (f : ℂ → ℂ) (_hf : AnalyticAt ℂ f 0) (_hf0 : f 0 = 0)
    (_hmult : deriv f 0 = lam) :
    ∃ u : ℂ → ℂ, AnalyticAt ℂ u 0 ∧ u 0 = 0 ∧ deriv u 0 = 1 ∧
      ∀ᶠ z in nhds (0 : ℂ), f (u z) = u (lam * z) := by
  sorry
#58
How produced

Automatically proved by Seed Prover.

Kolmogorov–Arnold superposition theorem (non-universal Lorentz form)
kolmogorov_arnold_superposition

Lean theorem statement

/-- **Kolmogorov–Arnold superposition theorem (non-universal Lorentz
form).** For `n ≥ 1`, every continuous `f` on the unit cube `[0, 1]ⁿ`
admits a representation
`f(x) = ∑_{k=0}^{2n} g(∑_{l=1}^{n} φ_{k,l}(x_l))` with a single
continuous outer function `g : ℝ → ℝ` and continuous inner functions
`φ_{k,l} : ℝ → ℝ`. -/
theorem kolmogorov_arnold (n : ℕ) (_hn : 1 ≤ n)
    (f : (Fin n → ℝ) → ℝ) (_hf : ContinuousOn f (Set.Icc 0 1)) :
    ∃ (g : ℝ → ℝ) (φ : Fin (2 * n + 1) → Fin n → ℝ → ℝ),
      Continuous g ∧ (∀ k l, Continuous (φ k l)) ∧
      ∀ x ∈ Set.Icc (0 : Fin n → ℝ) 1,
        f x = ∑ k, g (∑ l, φ k l (x l)) := by
  sorry
#59
How produced

Automatically proved by Seed Prover.

Radon transform: Fourier-slice diagonalization and pseudo-inversion
radon_transform_inversion

Verso theorem preview

theorem declaration uses `sorry`radon_can_be_diagonalized_and_pseudo_inverted : (∀ φ : SchwartzMap (ℝ × ℝ) ℂ, ∀ θ k : ℝ, fourier1 (fun p => radon (φ : ℝ × ℝ → ℂ) (p, θ)) k = fourier2 (φ : ℝ × ℝ → ℂ) (k * Real.cos θ, k * Real.sin θ)) ∧ (∃ Rinv : (ℝ × ℝ → ℂ) → (ℝ × ℝ → ℂ), ∀ φ : SchwartzMap (ℝ × ℝ) ℂ, Rinv (radon (φ : ℝ × ℝ → ℂ)) = (φ : ℝ × ℝ → ℂ)) := ⊢ (∀ (φ : SchwartzMap (ℝ × ℝ) ℂ) (θ k : ℝ), fourier1 (fun p => radon ⇑φ (p, θ)) k = fourier2 ⇑φ (k * Real.cos θ, k * Real.sin θ)) ∧ ∃ Rinv, ∀ (φ : SchwartzMap (ℝ × ℝ) ℂ), Rinv (radon ⇑φ) = ⇑φ All goals completed! 🐙
#60
How produced

Automatically proved by Seed Prover.

Fundamental theorem of topos theory
fundamental_topos_theory

Verso theorem preview

theorem declaration uses `sorry`fundamental_topos_theory {E : Type*} [Category E] (hE : LeanEval.ToposTheory.IsTopos E) (X : E) : LeanEval.ToposTheory.IsTopos (Over X) := E:Type u_1inst✝:Category.{u_2, u_1} EhE:IsTopos EX:E⊢ IsTopos (Over X) All goals completed! 🐙
#61
How produced

Automatically proved by Seed Prover.

Lax's approximation theorem for toral homeomorphisms
lax_approximation

Lean theorem statement

/-- **Lax's approximation theorem.** Every toral dynamical system on `𝕋^d`
(`d ≥ 1`) is approximated arbitrarily well in the metric `δ` by cyclic cube
exchange transformations. -/
theorem lax_approximation {d : ℕ} (hd : 0 < d) (T : ToralDynamicalSystem d)
    {ε : ℝ≥0∞} (hε : 0 < ε) :
    ∃ (n : ℕ) (S : VolumePreservingEquiv d),
      IsCyclicCubeExchange S n ∧ deltaDist T.toVolumePreservingEquiv S < ε := by
  sorry
#62
How produced

Automatically proved by Seed Prover.

The Landsberg–Schaar relation
landsberg_schaar

Verso theorem preview

theorem declaration uses `sorry`landsberg_schaar (p q : ℕ) (hp : Odd p) (hq : Odd q) : gaussS (2 * q : ℕ) p = Complex.exp ((Real.pi : ℂ) * Complex.I / 4) * gaussS (-(p : ℤ)) (2 * q) := p:ℕq:ℕhp:Odd phq:Odd q⊢ gaussS (↑(2 * q)) p = cexp (↑Real.pi * I / 4) * gaussS (-↑p) (2 * q) All goals completed! 🐙
#63
How produced

Automatically proved by Seed Prover.

Hurewicz theorem in degree 1 (H₁ = abelianization of π₁)
hurewicz_h1_abelianization

Lean theorem statement

/-- **Hurewicz (n = 1).** For a path-connected space `X`, `H₁(X;ℤ)` is the
abelianization of `π₁(X, x)`. -/
theorem hurewicz_h1_abelianization
    (X : Type) [TopologicalSpace X] [PathConnectedSpace X] (x : X) :
    Nonempty (Additive (Abelianization (FundamentalGroup X x)) ≃+
      (IntegralHomology 1 X : Type)) := by
  sorry
#64
How produced

Automatically proved by Seed Prover.

Anosov–Bowen shadowing lemma
anosov_bowen_shadowing

Lean theorem statement

/-- **Anosov–Bowen shadowing lemma** (Anosov 1967; Bowen 1975). Every
compact hyperbolic invariant set has the shadowing property. -/
theorem hyperbolic_has_shadowing
    (T : E d ≃ₜ E d) (K : Set (E d))
    (_hKc : IsCompact K) (_hK : IsHyperbolic T K) :
    HasShadowing (T : E d → E d) K := by
  sorry
#65
How produced

Automatically proved by Seed Prover.

Ornstein–Weiss ℤᵈ Rokhlin lemma
ornstein_weiss_rokhlin

Verso theorem preview

theorem declaration uses `sorry`ornstein_weiss_rokhlin {Ω : Type*} [MeasurableSpace Ω] [StandardBorelSpace Ω] {d : ℕ} (_hd : 1 ≤ d) (μ : Measure Ω) [IsProbabilityMeasure μ] (T : (Fin d → ℤ) → Ω → Ω) (_hid : ∀ x, T 0 x = x) (_hT : ∀ v, MeasurePreserving (T v) μ μ) (_hgrp : ∀ u v x, T (u + v) x = T u (T v x)) (_hfree : LeanEval.Dynamics.IsFreeAction μ T) (N : ℕ) (_hN : 1 ≤ N) {ε : ENNReal} (_hε : 0 < ε) : ∃ B : Set Ω, MeasurableSet B ∧ ((boxShape d N : Finset (Fin d → ℤ)) : Set (Fin d → ℤ)).PairwiseDisjoint (fun v => T v '' B) ∧ μ (⋃ v ∈ boxShape d N, T v '' B) ≥ 1 - ε := Ω:Type u_1inst✝²:MeasurableSpace Ωinst✝¹:StandardBorelSpace Ωd:ℕ_hd:1 ≤ dμ:Measure Ωinst✝:IsProbabilityMeasure μT:(Fin d → ℤ) → Ω → Ω_hid:∀ (x : Ω), T 0 x = x_hT:∀ (v : Fin d → ℤ), MeasurePreserving (T v) μ μ_hgrp:∀ (u v : Fin d → ℤ) (x : Ω), T (u + v) x = T u (T v x)_hfree:IsFreeAction μ TN:ℕ_hN:1 ≤ Nε:ENNReal_hε:0 < ε⊢ ∃ B, MeasurableSet B ∧ ((↑(boxShape d N)).PairwiseDisjoint fun v => T v '' B) ∧ μ (⋃ v ∈ boxShape d N, T v '' B) ≥ 1 - ε All goals completed! 🐙
#66
How produced

Automatically proved by Seed Prover.

Sobolev embedding theorem (Morrey regime)
sobolev_embedding_morrey

Verso theorem preview

theorem declaration uses `sorry`sobolev_embedding {n k r : ℕ} {α p : ℝ} (_hp : (n : ℝ) < p) (_hα : 0 < α) (_hα1 : α ≤ 1) (_hgap : (r : ℝ) + α < (k : ℝ) - n / p) (f : LeanEval.Analysis.SobolevMorreyProblem.E n → ℝ) (_hf : LeanEval.Analysis.SobolevMorreyProblem.MemSobolevWk k (ENNReal.ofReal p) f) : ∃ g : LeanEval.Analysis.SobolevMorreyProblem.E n → ℝ, f =ᵐ[volume] g ∧ LeanEval.Analysis.SobolevMorreyProblem.MemHolder r α g := n:ℕk:ℕr:ℕα:ℝp:ℝ_hp:↑n < p_hα:0 < α_hα1:α ≤ 1_hgap:↑r + α < ↑k - ↑n / pf:E n → ℝ_hf:MemSobolevWk k (ENNReal.ofReal p) f⊢ ∃ g, f =ᵐ[volume] g ∧ LeanEval.Analysis.SobolevMorreyProblem.MemHolder r α g All goals completed! 🐙
#67
How produced

Automatically proved by Seed Prover.

Hopf–Rinow theorem
hopf_rinow

Verso theorem preview

theorem declaration uses `sorry`hopf_rinow {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] {H : Type*} [TopologicalSpace H] (I : ModelWithCorners ℝ E H) [I.Boundaryless] (M : Type*) [EMetricSpace M] [ChartedSpace H M] [IsManifold I ∞ M] [Bundle.RiemannianBundle (fun x : M => TangentSpace I x)] [IsContMDiffRiemannianBundle I ∞ E (fun x : M => TangentSpace I x)] [IsContinuousRiemannianBundle E (fun x : M => TangentSpace I x)] [IsRiemannianManifold I M] [LocallyCompactSpace M] [ConnectedSpace M] : LeanEval.Geometry.IsGeodesicallyComplete M ↔ CompleteSpace M := E:Type u_1inst✝¹³:NormedAddCommGroup Einst✝¹²:NormedSpace ℝ Einst✝¹¹:FiniteDimensional ℝ EH:Type u_2inst✝¹⁰:TopologicalSpace HI:ModelWithCorners ℝ E Hinst✝⁹:I.BoundarylessM:Type u_3inst✝⁸:EMetricSpace Minst✝⁷:ChartedSpace H Minst✝⁶:IsManifold I ∞ Minst✝⁵:RiemannianBundle fun x => TangentSpace I xinst✝⁴:IsContMDiffRiemannianBundle I ∞ E fun x => TangentSpace I xinst✝³:IsContinuousRiemannianBundle E fun x => TangentSpace I xinst✝²:IsRiemannianManifold I Minst✝¹:LocallyCompactSpace Minst✝:ConnectedSpace M⊢ IsGeodesicallyComplete M ↔ CompleteSpace M All goals completed! 🐙
#68
How produced

Automatically proved by Seed Prover.

Jordan curve theorem
jordan_curve

Verso theorem preview

theorem declaration uses `sorry`jordan_curve (r : Metric.sphere (0 : EuclideanSpace ℝ (Fin 2)) 1 → EuclideanSpace ℝ (Fin 2)) (_hcont : Continuous r) (_hinj : Function.Injective r) : Nat.card (ConnectedComponents ((Set.range r)ᶜ : Set (EuclideanSpace ℝ (Fin 2)))) = 2 := r:↑(Metric.sphere 0 1) → EuclideanSpace ℝ (Fin 2)_hcont:Continuous r_hinj:Function.Injective r⊢ Nat.card (ConnectedComponents ↑(Set.range r)ᶜ) = 2 All goals completed! 🐙
#69
How produced

Automatically proved by Seed Prover.

Wiener–Lévy theorem
wiener_levy_analytic_calculus

Lean theorem statement

/-- **Wiener–Lévy theorem.** If `φ` is complex-analytic on a neighbourhood of
the range of a Wiener-algebra function `f`, then the composed function
`φ ∘ f` is again in the Wiener algebra. -/
theorem wiener_levy_analytic_calculus (f : C(AddCircle T, ℂ))
    (φ : ℂ → ℂ) (U : Set ℂ) (hf : InWienerAlgebra f)
    (hU : IsOpen U) (hrange : range f ⊆ U)
    (hφ : AnalyticOnNhd ℂ φ U) :
    ∃ g : C(AddCircle T, ℂ),
      (∀ x, g x = φ (f x)) ∧ InWienerAlgebra g := by
  sorry
#70
How produced

Automatically proved by Seed Prover.

Fundamental theorem of Riemannian geometry (Levi-Civita)
levi_civita_exists_unique

Lean theorem statement

/-- **Fundamental theorem of Riemannian geometry** (Levi-Civita). On a
`C^∞` finite-dimensional Riemannian manifold there exists a smooth
torsion-free metric-compatible covariant derivative on `TM`, and any other
such connection agrees with it on smooth vector fields. -/
theorem levi_civita_exists_unique
    {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E]
      [FiniteDimensional ℝ E] [CompleteSpace E]
    {H : Type*} [TopologicalSpace H] {I : ModelWithCorners ℝ E H}
    {M : Type*} [TopologicalSpace M] [T2Space M] [ChartedSpace H M]
      [IsManifold I ∞ M]
    [RiemannianBundle (fun (x : M) ↦ TangentSpace I x)]
    [IsContMDiffRiemannianBundle I ∞ E (fun (x : M) ↦ TangentSpace I x)] :
    ∃ cov : CovariantDerivative I E (TangentSpace I (M := M)),
      (ContMDiffCovariantDerivative cov ∞ ∧
        cov.torsion = 0 ∧ IsMetricCompatible cov) ∧
      ∀ cov' : CovariantDerivative I E (TangentSpace I (M := M)),
        (ContMDiffCovariantDerivative cov' ∞ ∧
          cov'.torsion = 0 ∧ IsMetricCompatible cov') →
        SameOnSmooth cov cov' := by
  sorry
#71
How produced

Automatically proved by Seed Prover.

Frobenius determinant theorem
frobenius_group_determinant

Verso theorem preview

theorem declaration uses `sorry`frobenius_group_determinant (G : Type*) [Group G] [Fintype G] [DecidableEq G] : ∃ (r : ℕ) (p : Fin r → MvPolynomial G ℂ), r = Nat.card (ConjClasses G) ∧ (∀ j, Irreducible (p j)) ∧ (∀ i j, i ≠ j → ¬ Associated (p i) (p j)) ∧ groupDeterminant G = ∏ j, (p j) ^ (p j).totalDegree := G:Type u_1inst✝²:Group Ginst✝¹:Fintype Ginst✝:DecidableEq G⊢ ∃ r p, r = Nat.card (ConjClasses G) ∧ (∀ (j : Fin r), Irreducible (p j)) ∧ (∀ (i j : Fin r), i ≠ j → ¬Associated (p i) (p j)) ∧ groupDeterminant G = ∏ j, p j ^ (p j).totalDegree All goals completed! 🐙
#72
How produced

Automatically proved by Seed Prover.

Wiener's 1/f theorem
wiener_inverse_closed

Lean theorem statement

/-- **Wiener's `1/f` theorem.** If a function on the circle belongs to the
Wiener algebra and has no zero on the circle, then its pointwise reciprocal
again belongs to the Wiener algebra. -/
theorem wiener_inverse_closed (f : C(AddCircle T, ℂ))
    (hf : InWienerAlgebra f) (hzero : ∀ x, f x ≠ 0) :
    ∃ g : C(AddCircle T, ℂ),
      (∀ x, g x = (f x)⁻¹) ∧ InWienerAlgebra g := by
  sorry
#73
How produced

Automatically proved by Seed Prover.

Halmos's generic weak-mixing theorem
halmos_generic_weak_mixing

Verso theorem preview

theorem declaration uses `sorry`generic_weakly_mixing [StandardBorelSpace X] (m : Measure X) [IsProbabilityMeasure m] [NullSingletonClass m] : (∃ G : Set (LeanEval.Dynamics.HalmosGenericWeakMixingProblem.Automorphism m), IsGδ G ∧ Dense G ∧ ∀ T ∈ G, LeanEval.Dynamics.HalmosGenericWeakMixingProblem.IsWeaklyMixing m T) ∧ (∀ T : LeanEval.Dynamics.HalmosGenericWeakMixingProblem.Automorphism m, LeanEval.Dynamics.HalmosGenericWeakMixingProblem.IsWeaklyMixing m T → Ergodic (T.toEquiv : X → X) m) := X:Type u_1inst✝³:MeasurableSpace Xinst✝²:StandardBorelSpace Xm:Measure Xinst✝¹:IsProbabilityMeasure minst✝:NullSingletonClass m⊢ (∃ G, IsGδ G ∧ Dense G ∧ ∀ T ∈ G, IsWeaklyMixing m T) ∧ ∀ (T : Automorphism m), IsWeaklyMixing m T → Ergodic (⇑T.toEquiv) m All goals completed! 🐙
#74
How produced

Automatically proved by Seed Prover.

Shannon capacity of the pentagon
shannon_capacity_pentagon

Lean theorem statement

/-- **Lovász's theorem on Shannon capacity of the pentagon** (§238).
The Shannon capacity of the five-cycle is `√5`. -/
theorem shannon_capacity_pentagon :
    HasShannonCapacity (SimpleGraph.cycleGraph 5) (Real.sqrt 5) := by
  sorry
#75
How produced

Automatically proved by Seed Prover.

Nyquist–Shannon sampling theorem
nyquist_shannon_sampling

Verso theorem preview

theorem declaration uses `sorry`nyquist_shannon_sampling (f : 𝓢(ℝ, ℂ)) (hf : LeanEval.Analysis.NyquistShannon.FourierSupportedInNyquist f) : ∀ t : ℝ, Summable (fun n : ℤ ↦ f (n : ℝ) * sinc (Real.pi * ((n : ℝ) - t))) ∧ f t = ∑' n : ℤ, f (n : ℝ) * sinc (Real.pi * ((n : ℝ) - t)) := f:𝓢(ℝ, ℂ)hf:FourierSupportedInNyquist f⊢ ∀ (t : ℝ), (Summable fun n => f ↑n * sinc (Real.pi * (↑n - t))) ∧ f t = ∑' (n : ℤ), f ↑n * sinc (Real.pi * (↑n - t)) All goals completed! 🐙
#76
How produced

Automatically proved by Seed Prover.

Kirk's normal-structure fixed point theorem
kirk_normal_structure

Verso theorem preview

theorem declaration uses `sorry`kirk_normal_structure [CompleteSpace E] (hE_reflexive : Function.Surjective (NormedSpace.inclusionInDoubleDual ℝ E)) (K : Set E) (hK_nonempty : K.Nonempty) (hK_closed : IsClosed K) (hK_bounded : Bornology.IsBounded K) (hK_convex : Convex ℝ K) (hK_normal : LeanEval.Topology.KirkNormalStructure.HasNormalStructure K) (T : K → K) (hT : LeanEval.Topology.KirkNormalStructure.IsNonexpansiveSelfMap K T) : ∃ x : K, IsFixedPt T x := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:CompleteSpace EhE_reflexive:Surjective ⇑(NormedSpace.inclusionInDoubleDual ℝ E)K:Set EhK_nonempty:K.NonemptyhK_closed:IsClosed KhK_bounded:Bornology.IsBounded KhK_convex:Convex ℝ KhK_normal:HasNormalStructure KT:↑K → ↑KhT:IsNonexpansiveSelfMap K T⊢ ∃ x, IsFixedPt T x All goals completed! 🐙
#77
How produced

Automatically proved by Seed Prover.

Lindemann's theorem (e and π transcendental)
lindemann

Lean theorem statement

/-- **Lindemann's theorem.** Both `e = exp 1` and `π` are transcendental over
`ℤ`. -/
theorem lindemann :
    Transcendental ℤ (Real.exp 1) ∧ Transcendental ℤ Real.pi := by
  sorry
#78
How produced

Automatically proved by Seed Prover.

The Lindemann–Weierstrass theorem
lindemann_weierstrass

Lean theorem statement

/-- **Lindemann–Weierstrass theorem.** If `x₁, …, xₙ ∈ ℂ` are algebraic over `ℚ`
and ℚ-linearly independent, then `e^{x₁}, …, e^{xₙ}` are algebraically
independent over `ℚ`. -/
theorem lindemann_weierstrass {n : ℕ} (x : Fin n → ℂ)
    (h_alg : ∀ i, IsAlgebraic ℚ (x i))
    (h_lin : LinearIndependent ℚ x) :
    AlgebraicIndependent ℚ (fun i => Complex.exp (x i)) := by
  sorry
#79
How produced

Automatically proved by Seed Prover.

The Hausdorff–Hildebrandt–Schoenberg moment theorem
hausdorff_hildebrandt_schoenberg

Verso theorem preview

theorem declaration uses `sorry`hausdorff_hildebrandt_schoenberg {d : ℕ} (a : (Fin d → ℕ) → ℝ) : LeanEval.Analysis.IsMomentConfiguration a ↔ LeanEval.Analysis.HausdorffBounded a := d:ℕa:(Fin d → ℕ) → ℝ⊢ IsMomentConfiguration a ↔ HausdorffBounded a All goals completed! 🐙
#80
How produced

Automatically proved by Seed Prover.

Pascal's theorem
pascal

Lean theorem statement

/-- **Pascal's theorem.** Six distinct points on a non-singular conic determine
three collinear intersection points `Aᵢ Bⱼ ∩ Aⱼ Bᵢ`. -/
theorem pascal
    (M : Matrix (Fin 3) (Fin 3) ℝ) (hMsymm : M.IsSymm) (hMdet : M.det ≠ 0)
    (a₁ a₂ a₃ b₁ b₂ b₃ : Fin 3 → ℝ)
    (ha₁ : a₁ ≠ 0) (ha₂ : a₂ ≠ 0) (ha₃ : a₃ ≠ 0)
    (hb₁ : b₁ ≠ 0) (hb₂ : b₂ ≠ 0) (hb₃ : b₃ ≠ 0)
    (hdist : [a₁, a₂, a₃, b₁, b₂, b₃].Pairwise (fun v w => ¬ SamePoint v w))
    (hA₁ : OnConic M a₁) (hA₂ : OnConic M a₂) (hA₃ : OnConic M a₃)
    (hB₁ : OnConic M b₁) (hB₂ : OnConic M b₂) (hB₃ : OnConic M b₃) :
    Collinear3 (meet a₁ b₂ a₂ b₁) (meet a₁ b₃ a₃ b₁) (meet a₂ b₃ a₃ b₂) := by
  sorry
#81
How produced

Automatically proved by Seed Prover.

Tverberg's theorem
tverberg_theorem

Lean theorem statement

/-- **Tverberg's theorem.** Any `(r-1)(d+1)+1` points in `ℝ^d` admit an
`r`-part Tverberg partition. -/
theorem tverberg_theorem (d r : ℕ) (hr : 1 ≤ r)
    (f : Fin ((r - 1) * (d + 1) + 1) → Space d) :
    HasTverbergPartition (r := r) f := by
  sorry
#82
How produced

Automatically proved by Seed Prover.

Boone–Higman theorem (easy direction)
boone_higman_embedding

Verso theorem preview

theorem declaration uses `sorry`boone_higman_embedding {G H K : Type*} [Group G] [Group H] [Group K] [IsSimpleGroup H] [Group.IsFinitelyPresented K] (f : G →* H) (hf : Function.Injective f) (g : H →* K) (hg : Function.Injective g) {n : ℕ} (φ : FreeGroup (Fin n) →* G) (hsurj : Function.Surjective φ) (hker : (MonoidHom.ker φ).IsFinitelyNormallyGenerated) : LeanEval.GroupTheory.BooneHigmanEmbedding.WordProblemSolvable φ := G:Type u_1H:Type u_2K:Type u_3inst✝⁴:Group Ginst✝³:Group Hinst✝²:Group Kinst✝¹:IsSimpleGroup Hinst✝:Group.IsFinitelyPresented Kf:G →* Hhf:Function.Injective ⇑fg:H →* Khg:Function.Injective ⇑gn:ℕφ:FreeGroup (Fin n) →* Ghsurj:Function.Surjective ⇑φhker:φ.ker.IsFinitelyNormallyGenerated⊢ WordProblemSolvable φ All goals completed! 🐙
#83
How produced

Automatically proved by Seed Prover.

Choquet's representation theorem
choquet_representation_theorem

Verso theorem preview

theorem declaration uses `sorry`choquet [MeasurableSpace X] [BorelSpace X] (K : Set X) (hK_cpt : IsCompact K) (hK_cvx : Convex ℝ K) {x : X} (hx : x ∈ K) : ∃ μ : Measure X, IsProbabilityMeasure μ ∧ μ (K.extremePoints ℝ)ᶜ = 0 ∧ x = ∫ y, y ∂μ := X:Type u_1inst✝⁴:NormedAddCommGroup Xinst✝³:NormedSpace ℝ Xinst✝²:CompleteSpace Xinst✝¹:MeasurableSpace Xinst✝:BorelSpace XK:Set XhK_cpt:IsCompact KhK_cvx:Convex ℝ Kx:Xhx:x ∈ K⊢ ∃ μ, IsProbabilityMeasure μ ∧ μ (Set.extremePoints ℝ K)ᶜ = 0 ∧ x = ∫ (y : X), y ∂μ All goals completed! 🐙
#84
How produced

Automatically proved by Seed Prover.

Hausdorff moment problem: absolute-continuity criterion
hausdorff_absolute_continuity

Verso theorem preview

theorem declaration uses `sorry`hausdorff_absolute_continuity {d : ℕ} (μ : Measure (EuclideanSpace ℝ (Fin d))) [IsProbabilityMeasure μ] (hμ : μ ((LeanEval.Analysis.HausdorffAbsoluteContinuity.cube d)ᶜ) = 0) : LeanEval.Analysis.HausdorffAbsoluteContinuity.UniformlyAbsolutelyContinuous μ (volume.restrict (LeanEval.Analysis.HausdorffAbsoluteContinuity.cube d)) ↔ ∃ C : ℝ, ∀ k n : Fin d → ℕ, k ≤ n → diff (momentOf μ) k n ≤ C * diff (momentOf (volume.restrict (LeanEval.Analysis.HausdorffAbsoluteContinuity.cube d))) k n := d:ℕμ:Measure (EuclideanSpace ℝ (Fin d))inst✝:IsProbabilityMeasure μhμ:μ (cube d)ᶜ = 0⊢ UniformlyAbsolutelyContinuous μ (volume.restrict (cube d)) ↔ ∃ C, ∀ (k n : Fin d → ℕ), k ≤ n → diff (momentOf μ) k n ≤ C * diff (momentOf (volume.restrict (cube d))) k n All goals completed! 🐙
#85
How produced

Automatically proved by Seed Prover.

The Hausdorff positivity (complete-monotonicity) criterion
hausdorff_positivity_criterion

Lean theorem statement

/-- **Hausdorff positivity criterion** (Hausdorff 1921). A moment configuration
comes from a positive measure iff all its iterated backward differences are
nonnegative — i.e. the sequence is *completely monotone*: `(Δᵏa)ₙ ≥ 0` for all
`k ≤ n`. -/
theorem hausdorff_positivity {d : ℕ} (a : (Fin d → ℕ) → ℝ) :
    IsPositiveMomentConfiguration a ↔ ∀ k n : Fin d → ℕ, k ≤ n → 0 ≤ diff a k n := by
  sorry
#86
How produced

Automatically proved by Seed Prover.

Sard's regular-value corollary
regular_value_ae

Lean theorem statement

/-- **Regular value corollary (Sard).** For a smooth `f : ℝᵐ → ℝ`, almost every
`c ∈ ℝ` is a regular value. -/
theorem regular_value_ae {m : ℕ} (f : EuclideanSpace ℝ (Fin m) → ℝ)
    (hf : ContDiff ℝ ∞ f) :
    ∀ᵐ c ∂(volume : Measure ℝ), IsRegularValue f c := by
  sorry
#87
How produced

Automatically proved by Seed Prover.

Fang–Xia: tiling of the symmetric group by transpositions implies λ-transitivity
fang_xia_tiling_partition_transitive

Verso theorem preview

theorem declaration uses `sorry`fang_xia_partition_transitive_of_tiling {n : ℕ} {Y : Set (Equiv.Perm (Fin n))} (_h : LeanEval.Combinatorics.FangXiaTilingProblem.IsTiling (LeanEval.Combinatorics.FangXiaTilingProblem.transpositionsWithOne n) Y) : ∀ lam : LeanEval.Combinatorics.FangXiaTilingProblem.PartitionShape n, 0 ≤ lam.contentSum → LeanEval.Combinatorics.FangXiaTilingProblem.IsPartitionTransitive Y lam := n:ℕY:Set (Equiv.Perm (Fin n))_h:IsTiling (transpositionsWithOne n) Y⊢ ∀ (lam : PartitionShape n), 0 ≤ lam.contentSum → IsPartitionTransitive Y lam All goals completed! 🐙
#88
How produced

Automatically proved by Seed Prover.

Local stable/unstable sets at a hyperbolic fixed point (set-level Hadamard–Perron)
stable_unstable_manifolds

Verso theorem preview

theorem declaration uses `sorry`stable_unstable_manifolds_exist (n : ℕ) (f : LeanEval.Dynamics.StableUnstableManifoldsProblem.E n → LeanEval.Dynamics.StableUnstableManifoldsProblem.E n) (x₀ : LeanEval.Dynamics.StableUnstableManifoldsProblem.E n) (_hf : ContDiffAt ℝ 1 f x₀) (_hfix : f x₀ = x₀) (_hhyp : LeanEval.Dynamics.StableUnstableManifoldsProblem.IsHyperbolicLinear (fderiv ℝ f x₀)) (_hf_inv : (fderiv ℝ f x₀).IsInvertible) : ∃ U : Set (LeanEval.Dynamics.StableUnstableManifoldsProblem.E n), IsOpen U ∧ x₀ ∈ U ∧ ∃ Ws Wu : Set (LeanEval.Dynamics.StableUnstableManifoldsProblem.E n), Ws = {x | (∀ k : ℕ, f^[k] x ∈ U) ∧ Tendsto (fun k => f^[k] x) atTop (𝓝 x₀)} ∧ Wu = {x | ∃ y : ℕ → LeanEval.Dynamics.StableUnstableManifoldsProblem.E n, y 0 = x ∧ (∀ k : ℕ, y k ∈ U) ∧ (∀ k : ℕ, f (y (k + 1)) = y k) ∧ Tendsto y atTop (𝓝 x₀)} ∧ Ws ∩ Wu = {x₀} := n:ℕf:E n → E nx₀:E n_hf:ContDiffAt ℝ 1 f x₀_hfix:f x₀ = x₀_hhyp:IsHyperbolicLinear (fderiv ℝ f x₀)_hf_inv:(fderiv ℝ f x₀).IsInvertible⊢ ∃ U, IsOpen U ∧ x₀ ∈ U ∧ ∃ Ws Wu, Ws = {x | (∀ (k : ℕ), f^[k] x ∈ U) ∧ Tendsto (fun k => f^[k] x) atTop (𝓝 x₀)} ∧ Wu = {x | ∃ y, y 0 = x ∧ (∀ (k : ℕ), y k ∈ U) ∧ (∀ (k : ℕ), f (y (k + 1)) = y k) ∧ Tendsto y atTop (𝓝 x₀)} ∧ Ws ∩ Wu = {x₀} All goals completed! 🐙
#89
How produced

Automatically proved by Seed Prover.

Mountain Pass Theorem (Ambrosetti–Rabinowitz 1973)
mountain_pass

Verso theorem preview

theorem declaration uses `sorry`mountain_pass (f : E → ℝ) (_hf : ContDiff ℝ 1 f) (_hps : LeanEval.Analysis.MountainPassProblem.PalaisSmale f) {a b : E} {ε r : ℝ} (_hmr : LeanEval.Analysis.MountainPassProblem.MountainRange f a b ε r) : ∃ x : E, LeanEval.Analysis.MountainPassProblem.IsCriticalPoint f x ∧ f x = mountainPassLevel f a b ∧ ε ≤ mountainPassLevel f a b := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:CompleteSpace Ef:E → ℝ_hf:ContDiff ℝ 1 f_hps:PalaisSmale fa:Eb:Eε:ℝr:ℝ_hmr:MountainRange f a b ε r⊢ ∃ x, IsCriticalPoint f x ∧ f x = mountainPassLevel f a b ∧ ε ≤ mountainPassLevel f a b All goals completed! 🐙
#90
How produced

Automatically proved by Seed Prover.

Fraser: Fourier decay for finite-field Kakeya sets is q^{-1} and sharp
fraser_kakeya_fourier_decay

Verso theorem preview

theorem declaration uses `sorry`fraser_kakeya_fourier_decay_and_sharp {d : ℕ} (_hd : 2 ≤ d) {K : Set (LeanEval.Combinatorics.FraserKakeyaProblem.Space F d)} (_hK : LeanEval.Combinatorics.FraserKakeyaProblem.IsKakeya K) (χ : AddChar F ℂ) (_hχ : χ ≠ 1) : (∃ μ : LeanEval.Combinatorics.FraserKakeyaProblem.Space F d → ℝ, LeanEval.Combinatorics.FraserKakeyaProblem.IsProbabilityMeasureOn K μ ∧ ∀ ξ : LeanEval.Combinatorics.FraserKakeyaProblem.Space F d, ξ ≠ 0 → ‖fourier χ μ ξ‖ ≤ (Fintype.card F : ℝ)⁻¹) ∧ (∀ κ : ℝ, 0 < κ → κ < 1 → ∃ Q : ℕ, ∀ (F' : Type*) [Field F'] [Fintype F'] [DecidableEq F'], Q ≤ Fintype.card F' → ∃ K' : Set (LeanEval.Combinatorics.FraserKakeyaProblem.Space F' d), LeanEval.Combinatorics.FraserKakeyaProblem.IsKakeya K' ∧ ∀ μ : LeanEval.Combinatorics.FraserKakeyaProblem.Space F' d → ℝ, LeanEval.Combinatorics.FraserKakeyaProblem.IsProbabilityMeasureOn K' μ → ∃ ξ : LeanEval.Combinatorics.FraserKakeyaProblem.Space F' d, ξ ≠ 0 ∧ κ * (Fintype.card F' : ℝ)⁻¹ ≤ ‖fourier (AddChar.FiniteField.primitiveChar_to_Complex F') μ ξ‖) := F:Type u_1inst✝²:Field Finst✝¹:Fintype Finst✝:DecidableEq Fd:ℕ_hd:2 ≤ dK:Set (Space F d)_hK:IsKakeya Kχ:AddChar F ℂ_hχ:χ ≠ 1⊢ (∃ μ, IsProbabilityMeasureOn K μ ∧ ∀ (ξ : Space F d), ξ ≠ 0 → ‖LeanEval.Combinatorics.FraserKakeyaProblem.fourier χ μ ξ‖ ≤ (↑(Fintype.card F))⁻¹) ∧ ∀ (κ : ℝ), 0 < κ → κ < 1 → ∃ Q, ∀ (F' : Type u_2) [inst : Field F'] [inst_1 : Fintype F'] [DecidableEq F'], Q ≤ Fintype.card F' → ∃ K', IsKakeya K' ∧ ∀ (μ : Space F' d → ℝ), IsProbabilityMeasureOn K' μ → ∃ ξ, ξ ≠ 0 ∧ κ * (↑(Fintype.card F'))⁻¹ ≤ ‖LeanEval.Combinatorics.FraserKakeyaProblem.fourier (AddChar.FiniteField.primitiveChar_to_Complex F') μ ξ‖ All goals completed! 🐙
#91
How produced

Automatically proved by Seed Prover.

Liouville–Arnold theorem on integrable systems
liouville_arnold

Verso theorem preview

theorem declaration uses `sorry`liouville_arnold {n : ℕ} (F : Fin n → LeanEval.Geometry.LiouvilleArnold.E n → ℝ) (U : Set (LeanEval.Geometry.LiouvilleArnold.E n)) (_hU : IsOpen U) (_hLI : LeanEval.Geometry.LiouvilleArnold.IsLiouvilleIntegrable F U) (c : Fin n → ℝ) (_hMc_sub : LeanEval.Geometry.LiouvilleArnold.levelSet F c ⊆ U) (_hMc_compact : IsCompact (LeanEval.Geometry.LiouvilleArnold.levelSet F c)) (_hMc_connected : IsConnected (LeanEval.Geometry.LiouvilleArnold.levelSet F c)) : Nonempty ((LeanEval.Geometry.LiouvilleArnold.levelSet F c) ≃ₜ (Fin n → AddCircle (1 : ℝ))) := n:ℕF:Fin n → E n → ℝU:Set (E n)_hU:IsOpen U_hLI:IsLiouvilleIntegrable F Uc:Fin n → ℝ_hMc_sub:levelSet F c ⊆ U_hMc_compact:IsCompact (levelSet F c)_hMc_connected:IsConnected (levelSet F c)⊢ Nonempty (↑(levelSet F c) ≃ₜ (Fin n → AddCircle 1)) All goals completed! 🐙
#92
How produced

Automatically proved by Seed Prover.

Lidskii's inequality
lidskii_inequality

Verso theorem preview

theorem declaration uses `sorry`lidskii_inequality {n : Type*} [Fintype n] [DecidableEq n] {A B : Matrix n n ℂ} (hA : A.IsHermitian) (hB : B.IsHermitian) {p : ℝ} (_hp : 1 ≤ p) : ∑ j, |hA.eigenvalues₀ j - hB.eigenvalues₀ j| ^ p ≤ ∑ j, |(hB.sub hA).eigenvalues₀ j| ^ p := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℂB:Matrix n n ℂhA:A.IsHermitianhB:B.IsHermitianp:ℝ_hp:1 ≤ p⊢ ∑ j, |hA.eigenvalues₀ j - hB.eigenvalues₀ j| ^ p ≤ ∑ j, |⋯.eigenvalues₀ j| ^ p All goals completed! 🐙
#93
How produced

Automatically proved by Seed Prover.

Frobenius's theorem: the Frobenius kernel is normal
frobenius_kernel_isNormal

Verso theorem preview

theorem declaration uses `sorry`frobenius_kernel_isNormal (G X : Type) [Group G] [Fintype G] [Fintype X] [MulAction G X] [FaithfulSMul G X] (hcard : 2 ≤ Fintype.card X) (htrans : ∀ x y : X, ∃ g : G, g • x = y) (hstab : ∀ x : X, MulAction.stabilizer G x ≠ ⊥) (hfrob : ∀ g : G, g ≠ 1 → ∀ x y : X, g • x = x → g • y = y → x = y) : ∃ N : Subgroup G, N.Normal ∧ (N : Set G) = {1} ∪ {g : G | ∀ x : X, g • x ≠ x} := G:TypeX:Typeinst✝⁴:Group Ginst✝³:Fintype Ginst✝²:Fintype Xinst✝¹:MulAction G Xinst✝:FaithfulSMul G Xhcard:2 ≤ Fintype.card Xhtrans:∀ (x y : X), ∃ g, g • x = yhstab:∀ (x : X), MulAction.stabilizer G x ≠ ⊥hfrob:∀ (g : G), g ≠ 1 → ∀ (x y : X), g • x = x → g • y = y → x = y⊢ ∃ N, N.Normal ∧ ↑N = {1} ∪ {g | ∀ (x : X), g • x ≠ x} All goals completed! 🐙
#94
How produced

Automatically proved by Seed Prover.

Rokhlin lemma
rokhlin_lemma

Lean theorem statement

/-- **Rokhlin lemma, not-necessarily-invertible forward-image form.** For every
aperiodic measure-preserving transformation `T` of a standard Borel probability
space `(Ω, μ)`, every height `n ≥ 1`, and every `ε > 0`, there is a measurable
base whose `n` forward-image floors `B, T B, …, T^{n−1} B` are pairwise
disjoint and whose union has outer measure at least `1 − ε`. No invertibility
assumption is made. -/
theorem rokhlin_lemma {Ω : Type*} [MeasurableSpace Ω]
    [StandardBorelSpace Ω]
    (μ : Measure Ω) [IsProbabilityMeasure μ] (T : Ω → Ω)
    (_hT : MeasurePreserving T μ μ) (_hap : IsAperiodic T μ)
    (n : ℕ) (_hn : 1 ≤ n) {ε : ENNReal} (_hε : 0 < ε) :
    ∃ B : Set Ω, IsRokhlinTower T B n ∧
      μ (towerUnion T B n) ≥ 1 - ε := by
  sorry
#95
How produced

Automatically proved by Seed Prover.

Independence of the parallel postulate
parallel_postulate_independent

Verso theorem preview

theorem declaration uses `sorry`parallel_postulate_independent : (∃ (M : Type) (T : LeanEval.Geometry.TarskiAbsolute M), LeanEval.Geometry.Euclidean M T) ∧ (∃ (M : Type) (T : LeanEval.Geometry.TarskiAbsolute M), ¬ LeanEval.Geometry.Euclidean M T) := ⊢ (∃ M T, Euclidean M T) ∧ ∃ M T, ¬Euclidean M T All goals completed! 🐙
#96
How produced

Automatically proved by Seed Prover.

Chen theorem for Markoff graphs
dvd_card_connectedComponent_markoffGraph

Verso theorem preview

theorem declaration uses `sorry`dvd_card_connectedComponent_markoffGraph {p : ℕ} (hp : Nat.Prime p) (hgt : 3 < p) : ∀ c : (LeanEval.Combinatorics.markoffGraph p).ConnectedComponent, p ∣ Nat.card c := p:ℕhp:Nat.Prime phgt:3 < p⊢ ∀ (c : (markoffGraph p).ConnectedComponent), p ∣ Nat.card ↥c All goals completed! 🐙
#97
Chudnovsky formula for pi inverse
chudnovsky_formula_for_pi_inv

Verso theorem preview

theorem declaration uses `sorry`chudnovsky_formula_for_pi_inv : chudnovskySum = π⁻¹ := ⊢ chudnovskySum = π⁻¹ All goals completed! 🐙
#98
How produced

Automatically proved by Seed Prover.

Peano existence theorem for ODEs
peano_existence

Verso theorem preview

theorem declaration uses `sorry`peano_existence {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] {f : E → E} (hf : Continuous f) (x₀ : E) : ∃ a : ℝ, 0 < a ∧ ∃ α : ℝ → E, α 0 = x₀ ∧ ∀ t ∈ Ioo (-a) a, HasDerivAt α (f (α t)) t := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:FiniteDimensional ℝ Ef:E → Ehf:Continuous fx₀:E⊢ ∃ a, 0 < a ∧ ∃ α, α 0 = x₀ ∧ ∀ t ∈ Ioo (-a) a, HasDerivAt α (f (α t)) t All goals completed! 🐙
#99
How produced

Automatically proved by Seed Prover.

Complete reducibility for compact groups
compact_group_semisimple

Verso theorem preview

theorem declaration uses `sorry`compact_group_semisimple {G V : Type*} [Group G] [TopologicalSpace G] [IsTopologicalGroup G] [CompactSpace G] [NormedAddCommGroup V] [NormedSpace ℝ V] [FiniteDimensional ℝ V] (ρ : Representation ℝ G V) (hρ : Continuous fun p : G × V => ρ p.1 p.2) : ρ.IsSemisimpleRepresentation := G:Type u_1V:Type u_2inst✝⁶:Group Ginst✝⁵:TopologicalSpace Ginst✝⁴:IsTopologicalGroup Ginst✝³:CompactSpace Ginst✝²:NormedAddCommGroup Vinst✝¹:NormedSpace ℝ Vinst✝:FiniteDimensional ℝ Vρ:Representation ℝ G Vhρ:Continuous fun p => (ρ p.1) p.2⊢ ρ.IsSemisimpleRepresentation All goals completed! 🐙
#100
How produced

Automatically proved by Seed Prover.

Hippocrates' theorem on lunes
hippocrates_lunes

Verso theorem preview

theorem declaration uses `sorry`hippocrates_lunes (a b : ℝ) (ha : 0 < a) (hb : 0 < b) : volume (LeanEval.Geometry.HippocratesLunes.horizontalLune a b) + volume (LeanEval.Geometry.HippocratesLunes.verticalLune a b) = volume (LeanEval.Geometry.HippocratesLunes.rightTriangle a b) := a:ℝb:ℝha:0 < ahb:0 < b⊢ volume (horizontalLune a b) + volume (verticalLune a b) = volume (rightTriangle a b) All goals completed! 🐙
#101
How produced

Automatically proved by Seed Prover.

Jordan normal form
jordan_normal_form

Lean theorem statement

/-- **Jordan normal form.** Over an algebraically closed field, every
endomorphism of `Kⁿ` admits a Jordan-chain basis. -/
theorem jordan_normal_form {K : Type*} [Field K] [IsAlgClosed K] (n : ℕ)
    (f : Module.End K (StdSpace K n)) :
    Nonempty (JordanChainBasis f) := by
  sorry
#102
How produced

Automatically proved by Seed Prover.

Sard's theorem (critical-set image has measure zero)
sard_theorem

Verso theorem preview

theorem declaration uses `sorry`sard {m n : ℕ} (f : LeanEval.Geometry.SardTheoremProblem.E m → LeanEval.Geometry.SardTheoremProblem.E n) (_hf : ContDiff ℝ ∞ f) : volume (LeanEval.Geometry.SardTheoremProblem.criticalValues f) = 0 := m:ℕn:ℕf:E m → E n_hf:ContDiff ℝ ∞ f⊢ volume (criticalValues f) = 0 All goals completed! 🐙
#103
How produced

Automatically proved by Seed Prover.

Monge–Kantorovich existence theorem
monge_kantorovich

Verso theorem preview

theorem declaration uses `sorry`monge_kantorovich_exists {X Y : Type*} [TopologicalSpace X] [PolishSpace X] [MeasurableSpace X] [BorelSpace X] [TopologicalSpace Y] [PolishSpace Y] [MeasurableSpace Y] [BorelSpace Y] (P : Measure X) (Q : Measure Y) [IsProbabilityMeasure P] [IsProbabilityMeasure Q] (c : X × Y → ENNReal) (_hc : Continuous c) : ∃ π ∈ LeanEval.Analysis.Couplings P Q, ∀ π' ∈ LeanEval.Analysis.Couplings P Q, kantorovichCost c π ≤ kantorovichCost c π' := X:Type u_1Y:Type u_2inst✝⁹:TopologicalSpace Xinst✝⁸:PolishSpace Xinst✝⁷:MeasurableSpace Xinst✝⁶:BorelSpace Xinst✝⁵:TopologicalSpace Yinst✝⁴:PolishSpace Yinst✝³:MeasurableSpace Yinst✝²:BorelSpace YP:Measure XQ:Measure Yinst✝¹:IsProbabilityMeasure Pinst✝:IsProbabilityMeasure Qc:X × Y → ENNReal_hc:Continuous c⊢ ∃ π ∈ Couplings P Q, ∀ π' ∈ Couplings P Q, kantorovichCost c π ≤ kantorovichCost c π' All goals completed! 🐙
#104
How produced

Automatically proved by Seed Prover.

Baer–Suzuki theorem
baer_suzuki

Verso theorem preview

theorem declaration uses `sorry`baer_suzuki {G : Type*} [Group G] [Finite G] {p : ℕ} [Fact p.Prime] (x : G) : x ∈ LeanEval.GroupTheory.Defs.pCore p G ↔ ∀ g : G, IsPGroup p (Subgroup.closure ({x, g * x * g⁻¹} : Set G)) := G:Type u_1inst✝²:Group Ginst✝¹:Finite Gp:ℕinst✝:Fact (Nat.Prime p)x:G⊢ x ∈ pCore p G ↔ ∀ (g : G), IsPGroup p ↥(Subgroup.closure {x, g * x * g⁻¹}) All goals completed! 🐙
#105
How produced

Automatically proved by Seed Prover.

Solvable extensions ↔ solvable groups (the missing converse in Abel–Ruffini)
solvable_by_radicals_converse

Lean theorem statement

/-- **Solvable extensions ↔ solvable groups.** For a field `F` of
characteristic zero and a nonzero `p : F[X]`, every root of `p` in
`AlgebraicClosure F` lies in `solvableByRad F (AlgebraicClosure F)`
iff `p.Gal` is solvable. -/
theorem solvable_iff_solvableByRad (F : Type*) [Field F] [CharZero F]
    (p : F[X]) (_hp : p ≠ 0) :
    (∀ x : AlgebraicClosure F, aeval x p = 0 →
        x ∈ solvableByRad F (AlgebraicClosure F)) ↔ Group.IsSolvable p.Gal := by
  sorry
#106
How produced

Automatically proved by Seed Prover.

Furstenberg–Weiss topological multiple recurrence (single-transformation form)
furstenberg_topological

Lean theorem statement

/-- **Furstenberg–Weiss topological multiple recurrence** (single-
transformation form). Every homeomorphism `T` of a nonempty compact
metric space `X` has a multiply recurrent point. -/
theorem furstenberg_topological_recurrence {X : Type*} [MetricSpace X]
    [CompactSpace X] [Nonempty X] (T : X ≃ₜ X) :
    ∃ x : X, IsMultiplyRecurrent (T : X → X) x := by
  sorry
#107
How produced

Automatically proved by Seed Prover.

Lidskii–Last eigenvalue-perturbation theorem
lidskii_last

Verso theorem preview

theorem declaration uses `sorry`lidskii_last {n : Type*} [Fintype n] [DecidableEq n] {A B : Matrix n n ℂ} (hA : A.IsHermitian) (hB : B.IsHermitian) : ∑ j, |hA.eigenvalues₀ j - hB.eigenvalues₀ j| ≤ ∑ i, ∑ j, ‖A i j - B i j‖ := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℂB:Matrix n n ℂhA:A.IsHermitianhB:B.IsHermitian⊢ ∑ j, |hA.eigenvalues₀ j - hB.eigenvalues₀ j| ≤ ∑ i, ∑ j, ‖A i j - B i j‖ All goals completed! 🐙
#108
How produced

Automatically proved by Seed Prover.

Sturm's theorem
sturm

Lean theorem statement

/-- **Sturm's theorem.** For a squarefree real polynomial `p` and an interval
`(a, b)` with `a < b` whose endpoints are not roots of `p`, the number of
distinct roots of `p` in `(a, b)` equals `σ(a) − σ(b)`. -/
theorem sturm (p : ℝ[X]) (hp : Squarefree p) {a b : ℝ} (hab : a < b)
    (ha : p.eval a ≠ 0) (hb : p.eval b ≠ 0) :
    ((p.roots.toFinset).filter (fun x => a < x ∧ x < b)).card =
      sigma p a - sigma p b := by
  sorry
#109
How produced

Automatically proved by Seed Prover.

Kakutani fixed-point theorem
kakutani_fixed_point

Lean theorem statement

/-- **Kakutani fixed-point theorem.** Every upper-hemicontinuous
correspondence `F` from a nonempty compact convex `K ⊆ ℝᵈ` to itself, with
nonempty convex closed values, has a fixed point `x ∈ F x`. -/
theorem kakutani_fixed_point {d : ℕ}
    {K : Set (EuclideanSpace ℝ (Fin d))}
    (_hK_compact : IsCompact K) (_hK_convex : Convex ℝ K)
    (_hK_nonempty : K.Nonempty)
    (F : EuclideanSpace ℝ (Fin d) → Set (EuclideanSpace ℝ (Fin d)))
    (_hF_uhc : IsUpperHemicontinuous F)
    (_hF_nonempty : ∀ x ∈ K, (F x).Nonempty)
    (_hF_convex : ∀ x ∈ K, Convex ℝ (F x))
    (_hF_closed : ∀ x ∈ K, IsClosed (F x))
    (_hF_maps : ∀ x ∈ K, F x ⊆ K) :
    ∃ x ∈ K, x ∈ F x := by
  sorry
#110
How produced

Automatically proved by Seed Prover.

Nash equilibrium existence theorem
nash_equilibrium_exists

Lean theorem statement

/-- **Nash equilibrium existence theorem.** Every finite `n`-player game
with nonempty finite pure-strategy sets and arbitrary real payoffs admits
at least one mixed-strategy Nash equilibrium. -/
theorem nash_equilibrium_exists {n : ℕ} {S : Fin n → Type*}
    [∀ i, Fintype (S i)] [∀ i, Nonempty (S i)]
    (u : Fin n → StrategyProfile n S → ℝ) :
    ∃ σ : ∀ i, S i → ℝ, IsNashEquilibrium u σ := by
  sorry
#111
How produced

Automatically proved by Seed Prover.

Brauer–Fowler theorem
brauer_fowler

Lean theorem statement

/-- **Brauer–Fowler theorem.** There is a function bounding the order
of a finite nonabelian simple group by the order of any involution
centralizer. -/
theorem brauer_fowler :
    ∃ f : ℕ → ℕ, ∀ (G : Type) [Group G] [Finite G],
      IsSimpleGroup G → (∃ a b : G, a * b ≠ b * a) →
      ∀ t : G, orderOf t = 2 →
        Nat.card G ≤ f (Nat.card (Subgroup.centralizer ({t} : Set G))) := by
  sorry
#112
How produced

Automatically proved by Seed Prover.

Balanceable k-bounded partitions
balanceable_bounded_partitions

Lean theorem statement

/--
For any `k`, the smallest `n` such that any `k`-bounded partition of `n` is
also balanceable is given by `2 * lcm(1, ..., k)`.
-/
theorem minimal_balanceable_of_bounded (k : ℕ) (hk : 0 < k) :
    Minimal (fun n => 0 < n ∧ ∀ p : n.Partition, Bounded k p → Balanceable p) (2 * (Finset.Icc 1 k).lcm id) := by
  sorry
#113
A competition programming problem about permuting a permutation to be unimodal
permute_to_unimodal

Lean theorem statement

/--
`minRearrange` correctly computes the smallest number of indices that need to be permuted in order to
turn `arr` into a unimodal permutation.
-/
theorem minRearrange_correct {arr : Array Nat} :
    arr.Perm (1...=arr.size).toArray →
      (∃ (x : Array Nat) (hx : x.Perm (1...=arr.size).toArray), Unimodal x ∧ differences (Vector.mk x (by simpa using hx.size_eq)) arr.toVector = minRearrange arr) ∧
      (∀ (x : Array Nat) (hx : x.Perm (1...=arr.size).toArray), Unimodal x → minRearrange arr ≤ differences (Vector.mk x (by simpa using hx.size_eq)) arr.toVector) := by
  sorry
#114
Schur-Weyl duality: S_k image equals centralizer of GL(V) image
symAction_range_eq_centralizer_glAction

Verso theorem preview

theorem declaration uses `sorry`symAction_range_eq_centralizer_glAction {R : Type*} [Field R] {M : Type*} [AddCommGroup M] [Module R M] [FiniteDimensional R M] {k : ℕ} [Invertible (k.factorial : R)] : Algebra.adjoin R (Set.range (LeanEval.RepresentationTheory.symAction R M k)) = Subalgebra.centralizer R (Set.range (LeanEval.RepresentationTheory.glAction R M k)) := R:Type u_1inst✝⁴:Field RM:Type u_2inst✝³:AddCommGroup Minst✝²:Module R Minst✝¹:FiniteDimensional R Mk:ℕinst✝:Invertible ↑k.factorial⊢ Algebra.adjoin R (Set.range ⇑(symAction R M k)) = Subalgebra.centralizer R (Set.range ⇑(glAction R M k)) All goals completed! 🐙
#115
Normal spectral theorem
normal_spectral_theorem

Verso theorem preview

theorem declaration uses `sorry`normal_spectral_theorem (A : Matrix n n ℂ) : IsStarNormal A ↔ ∃ U ∈ unitary (Matrix n n ℂ), ∃ d : n → ℂ, A = U * diagonal d * star U := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℂ⊢ IsStarNormal A ↔ ∃ U ∈ unitary (Matrix n n ℂ), ∃ d, A = U * diagonal d * star U All goals completed! 🐙
#116
How produced

Automatically proved by Seed Prover.

Bauer's uniqueness at extreme points
bauer_extreme_point_uniqueness

Verso theorem preview

theorem declaration uses `sorry`bauer_unique [MeasurableSpace X] [BorelSpace X] (K : Set X) (hK_cpt : IsCompact K) (hK_cvx : Convex ℝ K) {x : X} (hx : x ∈ K.extremePoints ℝ) (μ : Measure X) [IsProbabilityMeasure μ] (hμ : μ Kᶜ = 0) (hbar : x = ∫ y, y ∂μ) : μ = Measure.dirac x := X:Type u_1inst✝⁵:NormedAddCommGroup Xinst✝⁴:NormedSpace ℝ Xinst✝³:CompleteSpace Xinst✝²:MeasurableSpace Xinst✝¹:BorelSpace XK:Set XhK_cpt:IsCompact KhK_cvx:Convex ℝ Kx:Xhx:x ∈ Set.extremePoints ℝ Kμ:Measure Xinst✝:IsProbabilityMeasure μhμ:μ Kᶜ = 0hbar:x = ∫ (y : X), y ∂μ⊢ μ = Measure.dirac x All goals completed! 🐙
#117
How produced

Automatically proved by Seed Prover.

Morley's trisector theorem
morley_theorem

Verso theorem preview

theorem declaration uses `sorry`morley_theorem (A B C P Q R : LeanEval.Geometry.Morley.Plane) (h : LeanEval.Geometry.Morley.IsMorleyConfiguration A B C P Q R) : LeanEval.Geometry.Morley.IsEquilateralTriple P Q R := A:PlaneB:PlaneC:PlaneP:PlaneQ:PlaneR:Planeh:IsMorleyConfiguration A B C P Q R⊢ IsEquilateralTriple P Q R All goals completed! 🐙
#118
How produced

Automatically proved by Seed Prover.

Riesz's rising sun lemma
rising_sun_lemma

Verso theorem preview

theorem declaration uses `sorry`rising_sun_lemma {a b : ℝ} (hab : a < b) {f : ℝ → ℝ} (hf : ContinuousOn f (Icc a b)) : LeanEval.Analysis.RisingSun.HasRisingSunProperty a b f := a:ℝb:ℝhab:a < bf:ℝ → ℝhf:ContinuousOn f (Icc a b)⊢ HasRisingSunProperty a b f All goals completed! 🐙
#119
How produced

Automatically proved by Seed Prover.

Kuznetsov's theorem: finitely presented simple groups have solvable word problem
boone_higman_simple

Verso theorem preview

theorem declaration uses `sorry`boone_higman_simple {G : Type*} [Group G] [IsSimpleGroup G] {n : ℕ} (φ : FreeGroup (Fin n) →* G) (_hsurj : Function.Surjective φ) (_hker : (MonoidHom.ker φ).IsFinitelyNormallyGenerated) : LeanEval.GroupTheory.BooneHigmanSimpleProblem.WordProblemSolvable φ := G:Type u_1inst✝¹:Group Ginst✝:IsSimpleGroup Gn:ℕφ:FreeGroup (Fin n) →* G_hsurj:Function.Surjective ⇑φ_hker:φ.ker.IsFinitelyNormallyGenerated⊢ WordProblemSolvable φ All goals completed! 🐙
#120
How produced

Automatically proved by Seed Prover.

Pointwise and Cesàro convergence of Fourier series (Dirichlet, Fejér)
fourier_dirichlet_fejer

Verso theorem preview

/-- **Dirichlet's pointwise convergence theorem** (§46). For every `C¹` 2π-periodic complex function `f`, the symmetric Fourier partial sums `S_N(f)(x)` converge to `f(x)` at every point `x ∈ ℝ`. -/ theorem declaration uses `sorry`dirichlet_pointwise {f : ℝ → ℂ} (_hperiod : Function.Periodic f (2 * Real.pi)) (_hC1 : ContDiff ℝ 1 f) (x : ℝ) : Tendsto (fun N : ℕ => fourierPartialSum f N x) atTop (𝓝 (f x)) := f:ℝ → ℂ_hperiod:Function.Periodic f (2 * Real.pi)_hC1:ContDiff ℝ 1 fx:ℝ⊢ Tendsto (fun N => fourierPartialSum f N x) atTop (𝓝 (f x)) All goals completed! 🐙
/-- **Fejér's theorem** (§46). For every *continuous* 2π-periodic complex function `f` — without the `C¹` hypothesis of Dirichlet's theorem — the Cesàro means `σ_N(f)` of the symmetric Fourier partial sums converge to `f` uniformly on `ℝ`. -/ theorem declaration uses `sorry`fejer {f : ℝ → ℂ} (_hperiod : Function.Periodic f (2 * Real.pi)) (_hcont : Continuous f) : TendstoUniformly (fun N : ℕ => fourierCesaroMean f N) f atTop := f:ℝ → ℂ_hperiod:Function.Periodic f (2 * Real.pi)_hcont:Continuous f⊢ TendstoUniformly (fun N => fourierCesaroMean f N) f atTop All goals completed! 🐙
#121
How produced

Automatically proved by Seed Prover.

Euler–Lagrange equation
euler_lagrange_equation

Verso theorem preview

theorem declaration uses `sorry`euler_lagrange_equation {a b : ℝ} (L : ℝ → ℝ → ℝ → ℝ) (x : ℝ → ℝ) (_hab : a < b) (_hL : ContDiff ℝ 2 (fun p : ℝ × ℝ × ℝ => L p.1 p.2.1 p.2.2)) (_hx : ContDiff ℝ 2 x) (_hxe : LeanEval.Analysis.IsVariationalExtremum a b L x) : ∀ t ∈ Set.Ioo a b, lagrangianPartialX L x t = deriv (lagrangianPartialV L x) t := a:ℝb:ℝL:ℝ → ℝ → ℝ → ℝx:ℝ → ℝ_hab:a < b_hL:ContDiff ℝ 2 fun p => L p.1 p.2.1 p.2.2_hx:ContDiff ℝ 2 x_hxe:IsVariationalExtremum a b L x⊢ ∀ t ∈ Ioo a b, lagrangianPartialX L x t = deriv (lagrangianPartialV L x) t All goals completed! 🐙
#122
How produced

Automatically proved by Seed Prover.

Runge's theorem
runge_theorem

Verso theorem preview

theorem declaration uses `sorry`runge (K : Set ℂ) (_hK : IsCompact K) (U : Set ℂ) (_hU : IsOpen U) (_hKU : K ⊆ U) (f : ℂ → ℂ) (_hf : AnalyticOnNhd ℂ f U) (ε : ℝ) (_hε : 0 < ε) : ∃ p q : ℂ[X], (∀ z ∈ K, q.eval z ≠ 0) ∧ (∀ z ∈ K, ‖f z - p.eval z / q.eval z‖ < ε) := K:Set ℂ_hK:IsCompact KU:Set ℂ_hU:IsOpen U_hKU:K ⊆ Uf:ℂ → ℂ_hf:AnalyticOnNhd ℂ f Uε:ℝ_hε:0 < ε⊢ ∃ p q, (∀ z ∈ K, Polynomial.eval z q ≠ 0) ∧ ∀ z ∈ K, ‖f z - Polynomial.eval z p / Polynomial.eval z q‖ < ε All goals completed! 🐙
#123
How produced

Automatically proved by Seed Prover.

Schauder fixed-point theorem
schauder_fixed_point

Verso theorem preview

theorem declaration uses `sorry`schauder_fixed_point {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [CompleteSpace E] {K : Set E} (_hK_compact : IsCompact K) (_hK_convex : Convex ℝ K) (_hK_nonempty : K.Nonempty) (f : E → E) (_hf_cont : ContinuousOn f K) (_hf_maps : Set.MapsTo f K K) : ∃ x ∈ K, f x = x := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:CompleteSpace EK:Set E_hK_compact:IsCompact K_hK_convex:Convex ℝ K_hK_nonempty:K.Nonemptyf:E → E_hf_cont:ContinuousOn f K_hf_maps:Set.MapsTo f K K⊢ ∃ x ∈ K, f x = x All goals completed! 🐙
#124
How produced

Automatically proved by Seed Prover.

Burnside p^a q^b theorem
finite_group_isSolvable_of_card_eq_prime_pow_mul_prime_pow

Verso theorem preview

theorem declaration uses `sorry`finite_group_isSolvable_of_card_eq_prime_pow_mul_prime_pow {G : Type*} [Group G] [Fintype G] {p q a b : ℕ} (hp : Nat.Prime p) (hq : Nat.Prime q) (hpq : p ≠ q) (hcard : Fintype.card G = p ^ a * q ^ b) : Group.IsSolvable G := G:Type u_1inst✝¹:Group Ginst✝:Fintype Gp:ℕq:ℕa:ℕb:ℕhp:Nat.Prime phq:Nat.Prime qhpq:p ≠ qhcard:Fintype.card G = p ^ a * q ^ b⊢ Group.IsSolvable G All goals completed! 🐙
#125
Existence of a non-isotopic pair of oriented two-component links
exists_nonisotopic_link

Verso theorem preview

theorem declaration uses `sorry`exists_nonisotopic_link : ∃ L₁ L₂ : LeanEval.KnotTheory.TwoLink, ¬ L₁.Isotopic L₂ := ⊢ ∃ L₁ L₂, ¬L₁.Isotopic L₂ All goals completed! 🐙
#126
Schur-Weyl duality: GL(V) image equals centralizer of S_k image
glAction_range_eq_centralizer_symAction

Verso theorem preview

theorem declaration uses `sorry`glAction_range_eq_centralizer_symAction {R : Type*} [Field R] {M : Type*} [AddCommGroup M] [Module R M] [FiniteDimensional R M] {k : ℕ} [Invertible (k.factorial : R)] : Algebra.adjoin R (Set.range (LeanEval.RepresentationTheory.glAction R M k)) = Subalgebra.centralizer R (Set.range (LeanEval.RepresentationTheory.symAction R M k)) := R:Type u_1inst✝⁴:Field RM:Type u_2inst✝³:AddCommGroup Minst✝²:Module R Minst✝¹:FiniteDimensional R Mk:ℕinst✝:Invertible ↑k.factorial⊢ Algebra.adjoin R (Set.range ⇑(glAction R M k)) = Subalgebra.centralizer R (Set.range ⇑(symAction R M k)) All goals completed! 🐙
#127
Trace Cayley-Hamilton / Newton identity
trace_cayley_hamilton_newton

Verso theorem preview

theorem declaration uses `sorry`trace_cayley_hamilton_newton {R : Type*} [CommRing R] (A : Matrix n n R) {k : ℕ} (hk : 1 ≤ k) : (k : R) * charpolyDescendingCoeff A k + ∑ j ∈ Finset.Icc 1 k, trace (A ^ j) * charpolyDescendingCoeff A (k - j) = 0 := n:Type u_1inst✝²:Fintype ninst✝¹:DecidableEq nR:Type u_2inst✝:CommRing RA:Matrix n n Rk:ℕhk:1 ≤ k⊢ ↑k * charpolyDescendingCoeff A k + ∑ j ∈ Finset.Icc 1 k, (A ^ j).trace * charpolyDescendingCoeff A (k - j) = 0 All goals completed! 🐙
#128
How produced

Automatically proved by Seed Prover.

Abel–Ruffini theorem
abel_ruffini

Verso theorem preview

theorem declaration uses `sorry`abel_ruffini (n : ℕ) (_hn : 1 ≤ n) : (∀ p : ℚ[X], p.natDegree = n → ∀ x : ℂ, aeval x p = 0 → x ∈ solvableByRad ℚ ℂ) ↔ n ≤ 4 := n:ℕ_hn:1 ≤ n⊢ (∀ (p : ℚ[X]), p.natDegree = n → ∀ (x : ℂ), (aeval x) p = 0 → x ∈ solvableByRad ℚ ℂ) ↔ n ≤ 4 All goals completed! 🐙
#129
How produced

Automatically proved by Seed Prover.

Wiener's atom-detection formula
wiener_atom_detection

Verso theorem preview

theorem declaration uses `sorry`wiener_atom_detection (μ : Measure (AddCircle (2 * Real.pi))) [IsProbabilityMeasure μ] : Tendsto (fun N : ℕ => (1 / (N : ℝ)) * ∑ k ∈ Finset.Icc (1 : ℤ) N, ‖fourierCoeffMeasure μ k‖ ^ 2) atTop (𝓝 (∑' x : AddCircle (2 * Real.pi), ((μ {x}).toReal) ^ 2)) := μ:Measure (AddCircle (2 * π))inst✝:IsProbabilityMeasure μ⊢ Tendsto (fun N => 1 / ↑N * ∑ k ∈ Finset.Icc 1 ↑N, ‖fourierCoeffMeasure μ k‖ ^ 2) atTop (𝓝 (∑' (x : AddCircle (2 * π)), (μ {x}).toReal ^ 2)) All goals completed! 🐙
#130
How produced

Automatically proved by Seed Prover.

Brouwer fixed-point theorem
brouwer_fixed_point

Verso theorem preview

theorem declaration uses `sorry`brouwer_fixed_point {d : ℕ} {K : Set (EuclideanSpace ℝ (Fin d))} (_hK_compact : IsCompact K) (_hK_convex : Convex ℝ K) (_hK_nonempty : K.Nonempty) (f : EuclideanSpace ℝ (Fin d) → EuclideanSpace ℝ (Fin d)) (_hf_cont : ContinuousOn f K) (_hf_maps : MapsTo f K K) : ∃ x ∈ K, f x = x := d:ℕK:Set (EuclideanSpace ℝ (Fin d))_hK_compact:IsCompact K_hK_convex:Convex ℝ K_hK_nonempty:K.Nonemptyf:EuclideanSpace ℝ (Fin d) → EuclideanSpace ℝ (Fin d)_hf_cont:ContinuousOn f K_hf_maps:MapsTo f K K⊢ ∃ x ∈ K, f x = x All goals completed! 🐙
#131
How produced

Automatically proved by Seed Prover.

Bing's house with two rooms is contractible
contractibleSpace_houseWithTwoRooms

Verso theorem preview

theorem declaration uses `sorry`contractibleSpace_houseWithTwoRooms : ContractibleSpace LeanEval.Topology.HouseWithTwoRooms := ⊢ ContractibleSpace ↑HouseWithTwoRooms All goals completed! 🐙
#132
von Neumann double commutant theorem
vonNeumann_doubleCommutant_tfae

Verso theorem preview

theorem declaration uses `sorry`vonNeumann_doubleCommutant_tfae {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H] (S : StarSubalgebra ℂ (H →L[ℂ] H)) : List.TFAE [ Set.centralizer (Set.centralizer (S : Set (H →L[ℂ] H))) = S , IsClosed (ContinuousLinearMapWOT.ofCLM '' (S : Set (H →L[ℂ] H))) , IsClosed (ContinuousLinearMap.toPointwiseConvergenceCLM ℂ (RingHom.id ℂ) H H '' (S : Set (H →L[ℂ] H))) ] := H:Type u_1inst✝²:NormedAddCommGroup Hinst✝¹:InnerProductSpace ℂ Hinst✝:CompleteSpace HS:StarSubalgebra ℂ (H →L[ℂ] H)⊢ [(↑S).centralizer.centralizer = ↑S, IsClosed (ContinuousLinearMapWOT.ofCLM '' ↑S), IsClosed (⇑(ContinuousLinearMap.toPointwiseConvergenceCLM ℂ (RingHom.id ℂ) H H) '' ↑S)].TFAE All goals completed! 🐙
#133
Koszul formula
koszul_formula

Verso theorem preview

theorem declaration uses `sorry`koszul_formula {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] [CompleteSpace E] {H : Type*} [TopologicalSpace H] {I : ModelWithCorners ℝ E H} {M : Type*} [TopologicalSpace M] [ChartedSpace H M] [IsManifold I ∞ M] [RiemannianBundle (fun (x : M) ↦ TangentSpace I x)] [IsContMDiffRiemannianBundle I ∞ E (fun (x : M) ↦ TangentSpace I x)] (cov : CovariantDerivative I E (TangentSpace I (M := M))) [ContMDiffCovariantDerivative cov ∞] (_htor : cov.torsion = 0) (_hmet : LeanEval.Geometry.KoszulFormula.IsMetricCompatible cov) (X Y Z : Π x : M, TangentSpace I x) (_hX : CMDiff ∞ (T% X)) (_hY : CMDiff ∞ (T% Y)) (_hZ : CMDiff ∞ (T% Z)) (x : M) : 2 * inner ℝ (cov Y x (X x)) (Z x) = mvfderiv I (fun y : M => inner ℝ (Y y) (Z y)) x (X x) + mvfderiv I (fun y : M => inner ℝ (X y) (Z y)) x (Y x) - mvfderiv I (fun y : M => inner ℝ (X y) (Y y)) x (Z x) - inner ℝ (X x) (mlieBracket I Y Z x) - inner ℝ (Y x) (mlieBracket I X Z x) + inner ℝ (Z x) (mlieBracket I X Y x) := E:Type u_1inst✝¹⁰:NormedAddCommGroup Einst✝⁹:NormedSpace ℝ Einst✝⁸:FiniteDimensional ℝ Einst✝⁷:CompleteSpace EH:Type u_2inst✝⁶:TopologicalSpace HI:ModelWithCorners ℝ E HM:Type u_3inst✝⁵:TopologicalSpace Minst✝⁴:ChartedSpace H Minst✝³:IsManifold I ∞ Minst✝²:RiemannianBundle fun x => TangentSpace I xinst✝¹:IsContMDiffRiemannianBundle I ∞ E fun x => TangentSpace I xcov:CovariantDerivative I E (TangentSpace I)inst✝:cov.ContMDiffCovariantDerivative ∞_htor:cov.torsion = 0_hmet:LeanEval.Geometry.KoszulFormula.IsMetricCompatible covX:(x : M) → TangentSpace I xY:(x : M) → TangentSpace I xZ:(x : M) → TangentSpace I x_hX:ContMDiff I I.tangent ∞ (T% X)_hY:ContMDiff I I.tangent ∞ (T% Y)_hZ:ContMDiff I I.tangent ∞ (T% Z)x:M⊢ 2 * Inner.inner ℝ ((↑cov Y x) (X x)) (Z x) = ((d% fun y => Inner.inner ℝ (Y y) (Z y)) x) (X x) + ((d% fun y => Inner.inner ℝ (X y) (Z y)) x) (Y x) - ((d% fun y => Inner.inner ℝ (X y) (Y y)) x) (Z x) - Inner.inner ℝ (X x) (mlieBracket I Y Z x) - Inner.inner ℝ (Y x) (mlieBracket I X Z x) + Inner.inner ℝ (Z x) (mlieBracket I X Y x) All goals completed! 🐙
#134
How produced

Automatically proved by Seed Prover.

Linear ODE with negative-real-part eigenvalues is asymptotically stable
linear_ode_asymptotic_stability

Verso theorem preview

theorem declaration uses `sorry`linear_ode_asymptotic_stability (n : ℕ) (A : Matrix (Fin n) (Fin n) ℝ) (hA : ∀ μ : ℂ, Module.End.HasEigenvalue (Matrix.toLin' (A.map (algebraMap ℝ ℂ))) μ → μ.re < 0) (x : ℝ → (Fin n → ℝ)) (hx : ∀ t : ℝ, 0 < t → HasDerivAt x (A.mulVec (x t)) t) : Filter.Tendsto (fun t : ℝ => ‖x t‖) Filter.atTop (nhds 0) := n:ℕA:Matrix (Fin n) (Fin n) ℝhA:∀ (μ : ℂ), Module.End.HasEigenvalue (Matrix.toLin' (A.map ⇑(algebraMap ℝ ℂ))) μ → μ.re < 0x:ℝ → Fin n → ℝhx:∀ (t : ℝ), 0 < t → HasDerivAt x (A *ᵥ x t) t⊢ Filter.Tendsto (fun t => ‖x t‖) Filter.atTop (nhds 0) All goals completed! 🐙
#135
Real cyclotomic integer with house at most 2
cyclotomic_integer_house_le_two

Verso theorem preview

theorem declaration uses `sorry`cyclotomic_integer_house_le_two {K : Type*} [Field K] [NumberField K] [Algebra ℚ K] (n : ℕ) [NeZero n] [IsCyclotomicExtension {n} ℚ K] {β : K} (hβ_int : IsIntegral ℤ β) (hβ_real : β ∈ NumberField.maximalRealSubfield K) : house β ≤ 2 → house β = 2 ∨ ∃ m : ℕ, 0 < m ∧ house β = 2 * Real.cos (Real.pi / m) := K:Type u_1inst✝⁴:Field Kinst✝³:NumberField Kinst✝²:Algebra ℚ Kn:ℕinst✝¹:NeZero ninst✝:IsCyclotomicExtension {n} ℚ Kβ:Khβ_int:IsIntegral ℤ βhβ_real:β ∈ maximalRealSubfield K⊢ house β ≤ 2 → house β = 2 ∨ ∃ m, 0 < m ∧ house β = 2 * Real.cos (Real.pi / ↑m) All goals completed! 🐙
#136
Linear programming: maximum principle and vertex optimality
lp_maximum_principle

Verso theorem preview

/-- **Maximum principle for linear programming** (§101). A local maximiser of the LP objective on the feasible region is automatically a global maximiser; and whenever the objective is non-constant (`c ≠ 0`), the maximiser lies on the topological frontier of the feasible region. -/ theorem declaration uses `sorry`lp_maximum_principle {m n : ℕ} (lp : LinearProgram m n) (x : Fin m → ℝ) (_hx : x ∈ lp.feasible) (_hlocal : IsLocalMaxOn lp.objective lp.feasible x) : IsMaxOn lp.objective lp.feasible x ∧ (lp.c ≠ 0 → x ∈ frontier lp.feasible) := m:ℕn:ℕlp:LinearProgram m nx:Fin m → ℝ_hx:x ∈ lp.feasible_hlocal:IsLocalMaxOn lp.objective lp.feasible x⊢ IsMaxOn lp.objective lp.feasible x ∧ (lp.c ≠ 0 → x ∈ frontier lp.feasible) All goals completed! 🐙
/-- **Vertex optimality** (§101; the existence content of Dantzig's 1947 simplex algorithm). Every linear program with a nonempty bounded feasible region admits a global maximiser that is an extreme point (vertex) of the feasible region. -/ theorem declaration uses `sorry`simplex_algorithm {m n : ℕ} (lp : LinearProgram m n) (_hfeas : lp.feasible.Nonempty) (_hbdd : Bornology.IsBounded lp.feasible) : ∃ x ∈ lp.feasible, IsMaxOn lp.objective lp.feasible x ∧ x ∈ Set.extremePoints ℝ lp.feasible := m:ℕn:ℕlp:LinearProgram m n_hfeas:lp.feasible.Nonempty_hbdd:Bornology.IsBounded lp.feasible⊢ ∃ x ∈ lp.feasible, IsMaxOn lp.objective lp.feasible x ∧ x ∈ Set.extremePoints ℝ lp.feasible All goals completed! 🐙
#137
How produced

Automatically proved by Seed Prover.

Bourbaki's locally convex extension of Banach–Alaoglu
banach_alaoglu_bourbaki

Verso theorem preview

theorem declaration uses `sorry`banach_alaoglu_bourbaki (E : Type*) [AddCommGroup E] [Module ℝ E] [TopologicalSpace E] [ContinuousAdd E] [ContinuousSMul ℝ E] [LocallyConvexSpace ℝ E] (U : Set E) (_hU : U ∈ 𝓝 (0 : E)) : IsCompact (LeanEval.Analysis.weakStarPolar E U) := E:Type u_1inst✝⁵:AddCommGroup Einst✝⁴:Module ℝ Einst✝³:TopologicalSpace Einst✝²:ContinuousAdd Einst✝¹:ContinuousSMul ℝ Einst✝:LocallyConvexSpace ℝ EU:Set E_hU:U ∈ 𝓝 0⊢ IsCompact (weakStarPolar E U) All goals completed! 🐙
#138
How produced

Automatically proved by Seed Prover.

Pell solutions are convergents of √d
pell_solution_convergent

Verso theorem preview

theorem declaration uses `sorry`pell_solution_is_convergent (d : ℤ) (_hd : Squarefree d) (_hd0 : 0 < d) (x y : ℤ) (_hx : 0 < x) (_hy : 0 < y) (_hsol : x ^ 2 - d * y ^ 2 = 1) : ∃ n : ℕ, (GenContFract.of (Real.sqrt (d : ℝ))).convs n = (x : ℝ) / (y : ℝ) := d:ℤ_hd:Squarefree d_hd0:0 < dx:ℤy:ℤ_hx:0 < x_hy:0 < y_hsol:x ^ 2 - d * y ^ 2 = 1⊢ ∃ n, (GenContFract.of √↑d).convs n = ↑x / ↑y All goals completed! 🐙
#139
How produced

Automatically proved by Seed Prover.

Symplectic matrices have determinant 1
symplectic_matrix_det

Verso theorem preview

theorem declaration uses `sorry`symplectic_matrix_det {l R : Type*} [DecidableEq l] [Fintype l] [CommRing R] {A : Matrix (l ⊕ l) (l ⊕ l) R} (_hA : A ∈ Matrix.symplecticGroup l R) : A.det = 1 := l:Type u_1R:Type u_2inst✝²:DecidableEq linst✝¹:Fintype linst✝:CommRing RA:Matrix (l ⊕ l) (l ⊕ l) R_hA:A ∈ symplecticGroup l R⊢ A.det = 1 All goals completed! 🐙
#140
How produced

Automatically proved by Seed Prover.

Perron-Frobenius for irreducible nonnegative matrices
irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius

Verso theorem preview

theorem declaration uses `sorry`irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius {n : Type*} [Fintype n] [DecidableEq n] [Nonempty n] (A : Matrix n n ℝ) (hA : A.IsIrreducible) : ∃ v : n → ℝ, Module.End.HasEigenvector (Matrix.toLin' A) (spectralRadius ℝ A).toReal v ∧ (∀ i, 0 < v i) := n:Type u_1inst✝²:Fintype ninst✝¹:DecidableEq ninst✝:Nonempty nA:Matrix n n ℝhA:A.IsIrreducible⊢ ∃ v, Module.End.HasEigenvector (Matrix.toLin' A) (spectralRadius ℝ A).toReal v ∧ ∀ (i : n), 0 < v i All goals completed! 🐙
#141
Rouche theorem via zero counting
rouche_zero_count_eq

Verso theorem preview

theorem declaration uses `sorry`rouche_zero_count_eq {f g : ℂ → ℂ} {R : ℝ} (hR : 0 < R) (hf : MeromorphicNFOn f Set.univ) (hg : AnalyticOn ℂ g Set.univ) (hbound : ∀ z : ℂ, ‖z‖ = R → ‖g z‖ < ‖f z‖) : (∑ᶠ z, ((divisor (f + g) (Metric.closedBall 0 R))⁺) z) = (∑ᶠ z, ((divisor f (Metric.closedBall 0 R))⁺) z) := f:ℂ → ℂg:ℂ → ℂR:ℝhR:0 < Rhf:MeromorphicNFOn f Set.univhg:AnalyticOn ℂ g Set.univhbound:∀ (z : ℂ), ‖z‖ = R → ‖g z‖ < ‖f z‖⊢ ∑ᶠ (z : ℂ), (divisor (f + g) (Metric.closedBall 0 R))⁺ z = ∑ᶠ (z : ℂ), (divisor f (Metric.closedBall 0 R))⁺ z All goals completed! 🐙
#142
Complementary polynomial on the unit circle
exists_complementary_polynomial_on_unit_circle

Verso theorem preview

theorem declaration uses `sorry`exists_complementary_polynomial_on_unit_circle (P : ℂ[X]) (hP : ∀ z : Circle, ‖P.eval (z : ℂ)‖ ≤ 1) : ∃ Q : ℂ[X], Q.natDegree ≤ P.natDegree ∧ ∀ z : Circle, ‖P.eval (z : ℂ)‖ ^ 2 + ‖Q.eval (z : ℂ)‖ ^ 2 = 1 := P:ℂ[X]hP:∀ (z : Circle), ‖eval (↑z) P‖ ≤ 1⊢ ∃ Q, Q.natDegree ≤ P.natDegree ∧ ∀ (z : Circle), ‖eval (↑z) P‖ ^ 2 + ‖eval (↑z) Q‖ ^ 2 = 1 All goals completed! 🐙
#143
Gaussian heat kernel solves the 1D heat equation
heat_kernel_solves_heat_equation

Verso theorem preview

theorem declaration uses `sorry`heat_kernel_solves_heat_equation (f : ℝ → ℝ) (hf_cont : Continuous f) (hf_bdd : ∃ M : ℝ, ∀ x, |f x| ≤ M) : -- The PDE on (0, ∞) × ℝ. (∀ t : ℝ, 0 < t → ∀ x : ℝ, ∃ ux : ℝ → ℝ, ∃ uxx : ℝ, (∀ y : ℝ, HasDerivAt (fun z => heatSolution f t z) (ux y) y) ∧ HasDerivAt ux uxx x ∧ HasDerivAt (fun s => heatSolution f s x) uxx t) ∧ -- Initial condition recovered as a one-sided limit at t = 0. (∀ x : ℝ, Filter.Tendsto (fun t : ℝ => heatSolution f t x) (nhdsWithin (0 : ℝ) (Set.Ioi 0)) (nhds (f x))) := f:ℝ → ℝhf_cont:Continuous fhf_bdd:∃ M, ∀ (x : ℝ), |f x| ≤ M⊢ (∀ (t : ℝ), 0 < t → ∀ (x : ℝ), ∃ ux uxx, (∀ (y : ℝ), HasDerivAt (fun z => heatSolution f t z) (ux y) y) ∧ HasDerivAt ux uxx x ∧ HasDerivAt (fun s => heatSolution f s x) uxx t) ∧ ∀ (x : ℝ), Filter.Tendsto (fun t => heatSolution f t x) (nhdsWithin 0 (Set.Ioi 0)) (nhds (f x)) All goals completed! 🐙
#144
Minkowski-Caratheodory theorem
mem_convexHull_finset_extremePoints_of_mem_compact_convex

Verso theorem preview

theorem declaration uses `sorry`mem_convexHull_finset_extremePoints_of_mem_compact_convex {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] {s : Set E} {x : E} (hscomp : IsCompact s) (hsconv : Convex ℝ s) (hx : x ∈ s) : ∃ t : Finset E, (↑t : Set E) ⊆ s.extremePoints ℝ ∧ t.card ≤ Module.finrank ℝ E + 1 ∧ x ∈ convexHull ℝ (↑t : Set E) := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:FiniteDimensional ℝ Es:Set Ex:Ehscomp:IsCompact shsconv:Convex ℝ shx:x ∈ s⊢ ∃ t, ↑t ⊆ extremePoints ℝ s ∧ t.card ≤ Module.finrank ℝ E + 1 ∧ x ∈ (convexHull ℝ) ↑t All goals completed! 🐙
#145
Character values of finite groups lie in cyclotomic fields
brauer_character_in_cyclotomic

Verso theorem preview

theorem declaration uses `sorry`brauer_character_in_cyclotomic (G : Type) [Group G] [Fintype G] : ∃ φ : CyclotomicField (Monoid.exponent G) ℚ →+* ℂ, ∀ (V : Type) (_ : AddCommGroup V) (_ : Module ℂ V) (_ : FiniteDimensional ℂ V) (ρ : Representation ℂ G V) (g : G), LinearMap.trace ℂ V (ρ g) ∈ φ.range := G:Typeinst✝¹:Group Ginst✝:Fintype G⊢ ∃ φ, ∀ (V : Type) (x : AddCommGroup V) (x_1 : Module ℂ V), FiniteDimensional ℂ V → ∀ (ρ : Representation ℂ G V) (g : G), (LinearMap.trace ℂ V) (ρ g) ∈ φ.range All goals completed! 🐙
#146
Oppenheim's inequality for Hadamard products
oppenheim_inequality

Verso theorem preview

theorem declaration uses `sorry`oppenheim_inequality {n : Type*} [Fintype n] [DecidableEq n] {A B : Matrix n n ℝ} (hA : A.PosSemidef) (hB : B.PosSemidef) : A.det * ∏ i, B i i ≤ (A ⊙ B).det := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℝB:Matrix n n ℝhA:A.PosSemidefhB:B.PosSemidef⊢ A.det * ∏ i, B i i ≤ (A ⊙ B).det All goals completed! 🐙
#147
pi_1 of the circle is Z
pi1_circle_mulEquiv_int

Verso theorem preview

theorem declaration uses `sorry`pi1_circle_mulEquiv_int : Nonempty (HomotopyGroup.Pi 1 Circle (1 : Circle) ≃* Multiplicative ℤ) := ⊢ Nonempty (HomotopyGroup.Pi 1 Circle 1 ≃* Multiplicative ℤ) All goals completed! 🐙
#148
Dirichlet eigenvalues of -y'' = lambda y on [0,pi] are n^2
dirichlet_eigenvalues_eq_nat_sq

Verso theorem preview

theorem declaration uses `sorry`dirichlet_eigenvalues_eq_nat_sq (lam : ℝ) : (∃ (y : ℝ → ℝ) (J : Set ℝ), IsOpen J ∧ Set.Icc (0 : ℝ) Real.pi ⊆ J ∧ (∀ x ∈ J, HasDerivAt y (deriv y x) x) ∧ (∀ x ∈ J, HasDerivAt (deriv y) (-(lam * y x)) x) ∧ y 0 = 0 ∧ y Real.pi = 0 ∧ ∃ x ∈ Set.Ioo (0 : ℝ) Real.pi, y x ≠ 0) ↔ ∃ n : ℕ, 0 < n ∧ lam = (n : ℝ) ^ 2 := lam:ℝ⊢ (∃ y J, IsOpen J ∧ Set.Icc 0 π ⊆ J ∧ (∀ x ∈ J, HasDerivAt y (deriv y x) x) ∧ (∀ x ∈ J, HasDerivAt (deriv y) (-(lam * y x)) x) ∧ y 0 = 0 ∧ y π = 0 ∧ ∃ x ∈ Set.Ioo 0 π, y x ≠ 0) ↔ ∃ n, 0 < n ∧ lam = ↑n ^ 2 All goals completed! 🐙
#149
Entrywise exponential of a PSD matrix is PSD
posSemidef_map_exp

Verso theorem preview

theorem declaration uses `sorry`posSemidef_map_exp {n : Type*} [Fintype n] [DecidableEq n] {A : Matrix n n ℝ} (hA : A.PosSemidef) : (A.map Real.exp).PosSemidef := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℝhA:A.PosSemidef⊢ (A.map Real.exp).PosSemidef All goals completed! 🐙
#150
Sturm separation theorem
sturm_separation

Verso theorem preview

theorem declaration uses `sorry`sturm_separation (p q y₁ y₂ : ℝ → ℝ) (a b : ℝ) (hab : a < b) (J : Set ℝ) (hJ_open : IsOpen J) (hJ_conn : IsPreconnected J) (hJ_sub : Set.Icc a b ⊆ J) (hp : ContinuousOn p J) (hq : ContinuousOn q J) (hy₁ : ∀ x ∈ J, HasDerivAt y₁ (deriv y₁ x) x) (hy₁' : ∀ x ∈ J, HasDerivAt (deriv y₁) (-(p x * deriv y₁ x + q x * y₁ x)) x) (hy₂ : ∀ x ∈ J, HasDerivAt y₂ (deriv y₂ x) x) (hy₂' : ∀ x ∈ J, HasDerivAt (deriv y₂) (-(p x * deriv y₂ x + q x * y₂ x)) x) (hW : ∃ x₀ ∈ J, y₁ x₀ * deriv y₂ x₀ - y₂ x₀ * deriv y₁ x₀ ≠ 0) (hza : y₁ a = 0) (hzb : y₁ b = 0) (hne : ∀ x ∈ Set.Ioo a b, y₁ x ≠ 0) : ∃! c, c ∈ Set.Ioo a b ∧ y₂ c = 0 := p:ℝ → ℝq:ℝ → ℝy₁:ℝ → ℝy₂:ℝ → ℝa:ℝb:ℝhab:a < bJ:Set ℝhJ_open:IsOpen JhJ_conn:IsPreconnected JhJ_sub:Set.Icc a b ⊆ Jhp:ContinuousOn p Jhq:ContinuousOn q Jhy₁:∀ x ∈ J, HasDerivAt y₁ (deriv y₁ x) xhy₁':∀ x ∈ J, HasDerivAt (deriv y₁) (-(p x * deriv y₁ x + q x * y₁ x)) xhy₂:∀ x ∈ J, HasDerivAt y₂ (deriv y₂ x) xhy₂':∀ x ∈ J, HasDerivAt (deriv y₂) (-(p x * deriv y₂ x + q x * y₂ x)) xhW:∃ x₀ ∈ J, y₁ x₀ * deriv y₂ x₀ - y₂ x₀ * deriv y₁ x₀ ≠ 0hza:y₁ a = 0hzb:y₁ b = 0hne:∀ x ∈ Set.Ioo a b, y₁ x ≠ 0⊢ ∃! c, c ∈ Set.Ioo a b ∧ y₂ c = 0 All goals completed! 🐙
#151
Polynomial decay rate of y' = -y^3
cubic_decay_asymptotic

Verso theorem preview

theorem declaration uses `sorry`cubic_decay_asymptotic (y : ℝ → ℝ) (hy_diff : ∀ t : ℝ, 0 < t → HasDerivAt y (-(y t) ^ 3) t) (hy_cont : ContinuousWithinAt y (Set.Ici 0) 0) (hy0 : y 0 = 1) : Tendsto (fun t : ℝ => y t * Real.sqrt t) atTop (𝓝 (1 / Real.sqrt 2)) := y:ℝ → ℝhy_diff:∀ (t : ℝ), 0 < t → HasDerivAt y (-y t ^ 3) thy_cont:ContinuousWithinAt y (Set.Ici 0) 0hy0:y 0 = 1⊢ Tendsto (fun t => y t * √t) atTop (𝓝 (1 / √2)) All goals completed! 🐙
#152
Comparison principle for the Dirichlet BVP
bvp_comparison

Verso theorem preview

theorem declaration uses `sorry`bvp_comparison (J : Set ℝ) (hJ_open : IsOpen J) (hJ_sub : Set.Icc (0 : ℝ) 1 ⊆ J) (u v : ℝ → ℝ) (hu : ∀ x ∈ J, HasDerivAt u (deriv u x) x) (hu' : ∀ x ∈ J, HasDerivAt (deriv u) (deriv (deriv u) x) x) (hv : ∀ x ∈ J, HasDerivAt v (deriv v x) x) (hv' : ∀ x ∈ J, HasDerivAt (deriv v) (deriv (deriv v) x) x) (hineq : ∀ x ∈ Set.Ioo (0 : ℝ) 1, -deriv (deriv u) x ≤ -deriv (deriv v) x) (hu0 : u 0 ≤ v 0) (hu1 : u 1 ≤ v 1) : ∀ x ∈ Set.Icc (0 : ℝ) 1, u x ≤ v x := J:Set ℝhJ_open:IsOpen JhJ_sub:Set.Icc 0 1 ⊆ Ju:ℝ → ℝv:ℝ → ℝhu:∀ x ∈ J, HasDerivAt u (deriv u x) xhu':∀ x ∈ J, HasDerivAt (deriv u) (deriv (deriv u) x) xhv:∀ x ∈ J, HasDerivAt v (deriv v x) xhv':∀ x ∈ J, HasDerivAt (deriv v) (deriv (deriv v) x) xhineq:∀ x ∈ Set.Ioo 0 1, -deriv (deriv u) x ≤ -deriv (deriv v) xhu0:u 0 ≤ v 0hu1:u 1 ≤ v 1⊢ ∀ x ∈ Set.Icc 0 1, u x ≤ v x All goals completed! 🐙
#153
Cayley graph connected iff generators generate the group
mulCayley_connected_iff_closure_eq_top

Verso theorem preview

theorem declaration uses `sorry`mulCayley_connected_iff_closure_eq_top {G : Type*} [Group G] (S : Set G) : (SimpleGraph.mulCayley S).Connected ↔ Subgroup.closure S = ⊤ := G:Type u_1inst✝:Group GS:Set G⊢ (SimpleGraph.mulCayley S).Connected ↔ Subgroup.closure S = ⊤ All goals completed! 🐙
#154
Finite Ramsey theorem for graphs
finite_graph_ramsey_theorem

Verso theorem preview

theorem declaration uses `sorry`finite_graph_ramsey_theorem : ∀ r s : ℕ, 2 ≤ r → 2 ≤ s → ∃ n : ℕ, ∀ G : SimpleGraph (Fin n), ¬ G.CliqueFree r ∨ ¬ Gᶜ.CliqueFree s := ⊢ ∀ (r s : ℕ), 2 ≤ r → 2 ≤ s → ∃ n, ∀ (G : SimpleGraph (Fin n)), ¬G.CliqueFree r ∨ ¬Gᶜ.CliqueFree s All goals completed! 🐙
#155
Catalan generating function via compositional inversion
substInv_X_sub_X_sq_eq_catalan

Verso theorem preview

theorem declaration uses `sorry`substInv_X_sub_X_sq_eq_catalan (n : ℕ) : haveI : Invertible (coeff 1 ((X : ℚ⟦X⟧) - X ^ 2)) := n:ℕ⊢ Invertible ((coeff 1) (X - X ^ 2)) n:ℕ⊢ Invertible 1; All goals completed! 🐙 coeff (n + 1) (substInv ((X : ℚ⟦X⟧) - X ^ 2)) = (Nat.choose (2 * n) n : ℚ) / (↑n + 1) := n:ℕ⊢ (coeff (n + 1)) (X - X ^ 2).substInv = ↑((2 * n).choose n) / (↑n + 1) All goals completed! 🐙
#156
First submissionMay 20, 2026
Last submissionAug 13, 2026
GanjinZero135hanwenzhu21
6GPT-5.6112 solved
Feit–Thompson odd-order theorem
feit_thompson

Verso theorem preview

theorem declaration uses `sorry`feit_thompson {G : Type*} [Group G] [Finite G] (_h : Odd (Nat.card G)) : Group.IsSolvable G := G:Type u_1inst✝¹:Group Ginst✝:Finite G_h:Odd (Nat.card G)⊢ Group.IsSolvable G All goals completed! 🐙
#1
How produced

The solution was produced using GPT-5.6 Sol in Codex, based on the existing formalization of the theorem in Coq. The LLM worked autonomously for several days, with minimal steering to keep the work productive and on target. The entire work was paid for with a ChatGPT Pro subscription (with 2 available usage resets). The repo also includes submissions to `baer_suzuki` and `brauer_character_in_cyclotomic` as derivatives of the main effort on `feit_thompson`.

Moran's equality for affine-symmetric iterated function systems
moran_equality_affine

Verso theorem preview

theorem declaration uses `sorry`moran_equality_affine {d n : ℕ} (hn : 1 ≤ n) (f : Fin n → EuclideanSpace ℝ (Fin d) → EuclideanSpace ℝ (Fin d)) (lam : ℝ) (h_aff : LeanEval.Dynamics.IsAffineSymmetricIFS f lam) (h_osc : LeanEval.Dynamics.OpenSetCondition f) {S : Set (EuclideanSpace ℝ (Fin d))} (hS : LeanEval.Dynamics.IsAttractor f S) : dimH S = ENNReal.ofReal (- Real.log n / Real.log lam) := d:ℕn:ℕhn:1 ≤ nf:Fin n → EuclideanSpace ℝ (Fin d) → EuclideanSpace ℝ (Fin d)lam:ℝh_aff:IsAffineSymmetricIFS f lamh_osc:OpenSetCondition fS:Set (EuclideanSpace ℝ (Fin d))hS:IsAttractor f S⊢ dimH S = ENNReal.ofReal (-Real.log ↑n / Real.log lam) All goals completed! 🐙
#2
Morrison–Walker Lemma B.0.1: adapting families of maps to open covers
families_of_maps_b01

Verso theorem preview

/-- **Lemma B.0.1** of Morrison–Walker, *The Blob Complex* (arXiv:1009.5025, §B), continuous case. -/ theorem declaration uses `sorry`continuous {P : Set (Fin k → ℝ)} (_hP : IsPolyhedron P) [CompactSpace X] (U : ι → Set X) (_hUopen : ∀ α, IsOpen (U α)) (ρ : PartitionOfUnity ι X univ) (_hρ : ρ.IsSubordinate U) (f : C(P × X, T)) : ∃ F : C(I × P × X, T), (∀ p : P, ∀ x : X, F (0, p, x) = f (p, x)) ∧ (∃ K : Subdivision P, ∀ D ∈ K.complex.facets, AdaptedTo U k (fun q : closedCell P D × X => F (1, q.1.1, q.2))) ∧ (∀ S : Set X, Supported (f := f.toFun) S → Supported (fun q : (I × P) × X => F (q.1.1, q.1.2, q.2)) S) ∧ (∀ Q : Set P, IsBoundarySubpolyhedron Q → ∀ S' : Set X, Supported (fun q : Q × X => f (q.1.1, q.2)) S' → Supported (fun q : (I × Q) × X => F (q.1.1, q.1.2.1, q.2)) S') := k:ℕι:Type u_1X:Type u_2T:Type u_3inst✝²:TopologicalSpace Xinst✝¹:TopologicalSpace TP:Set (Fin k → ℝ)_hP:IsPolyhedron Pinst✝:CompactSpace XU:ι → Set X_hUopen:∀ (α : ι), IsOpen[inst✝²] (U α)ρ:PartitionOfUnity ι X_hρ:ρ.IsSubordinate Uf:C(↑P × X, T)⊢ ∃ F, (∀ (p : ↑P) (x : X), F (0, p, x) = f (p, x)) ∧ (∃ K, ∀ D ∈ K.complex.facets, AdaptedTo U k fun q => F (1, ↑q.1, q.2)) ∧ (∀ (S : Set X), Supported f.toFun S → Supported (fun q => F (q.1.1, q.1.2, q.2)) S) ∧ ∀ (Q : Set ↑P), IsBoundarySubpolyhedron Q → ∀ (S' : Set X), Supported (fun q => f (↑q.1, q.2)) S' → Supported (fun q => F (q.1.1, ↑q.1.2, q.2)) S' All goals completed! 🐙
/-- **Lemma B.0.1**, bi-Lipschitz variant (part 4 of the paper). -/ theorem declaration uses `sorry`biLipschitz {X T : Type*} [MetricSpace X] [MetricSpace T] [CompactSpace X] {P : Set (Fin k → ℝ)} (_hP : IsPolyhedron P) {ι : Type*} (U : ι → Set X) (_hUopen : ∀ α, IsOpen (U α)) (ρ : PartitionOfUnity ι X univ) (_hρ : ρ.IsSubordinate U) (f : C(P × X, T)) (slice : P → (X ≃ₜ T)) (_h_slice_eq : ∀ p : P, ∀ x : X, f (p, x) = slice p x) (L : NNReal) (_hf_joint : LipschitzWith L f.toFun) (_hf_slice_inv : ∀ p : P, LipschitzWith L (slice p).symm) : ∃ F : C(I × P × X, T), ∃ L' : NNReal, ∃ Slice : I × P → (X ≃ₜ T), (∀ p : P, ∀ x : X, F (0, p, x) = f (p, x)) ∧ (∀ t : I, ∀ p : P, ∀ x : X, F (t, p, x) = Slice (t, p) x) ∧ (∃ K : Subdivision P, ∀ D ∈ K.complex.facets, AdaptedTo U k (fun q : closedCell P D × X => F (1, q.1.1, q.2))) ∧ (∀ S : Set X, Supported (f := f.toFun) S → Supported (fun q : (I × P) × X => F (q.1.1, q.1.2, q.2)) S) ∧ (∀ Q : Set P, IsBoundarySubpolyhedron Q → ∀ S' : Set X, Supported (fun q : Q × X => f (q.1.1, q.2)) S' → Supported (fun q : (I × Q) × X => F (q.1.1, q.1.2.1, q.2)) S') ∧ (∀ tp : I × P, LipschitzWith L' (Slice tp)) ∧ (∀ tp : I × P, LipschitzWith L' (Slice tp).symm) := k:ℕX:Type u_4T:Type u_5inst✝²:MetricSpace Xinst✝¹:MetricSpace Tinst✝:CompactSpace XP:Set (Fin k → ℝ)_hP:IsPolyhedron Pι:Type u_6U:ι → Set X_hUopen:∀ (α : ι), IsOpen[PseudoMetricSpace.toUniformSpace.toTopologicalSpace] (U α)ρ:PartitionOfUnity ι X_hρ:ρ.IsSubordinate Uf:C(↑P × X, T)slice:↑P → X ≃ₜ T_h_slice_eq:∀ (p : ↑P) (x : X), f (p, x) = (slice p) xL:NNReal_hf_joint:LipschitzWith L f.toFun_hf_slice_inv:∀ (p : ↑P), LipschitzWith L ⇑(slice p).symm⊢ ∃ F L' Slice, (∀ (p : ↑P) (x : X), F (0, p, x) = f (p, x)) ∧ (∀ (t : ↑I) (p : ↑P) (x : X), F (t, p, x) = (Slice (t, p)) x) ∧ (∃ K, ∀ D ∈ K.complex.facets, AdaptedTo U k fun q => F (1, ↑q.1, q.2)) ∧ (∀ (S : Set X), Supported f.toFun S → Supported (fun q => F (q.1.1, q.1.2, q.2)) S) ∧ (∀ (Q : Set ↑P), IsBoundarySubpolyhedron Q → ∀ (S' : Set X), Supported (fun q => f (↑q.1, q.2)) S' → Supported (fun q => F (q.1.1, ↑q.1.2, q.2)) S') ∧ (∀ (tp : ↑I × ↑P), LipschitzWith L' ⇑(Slice tp)) ∧ ∀ (tp : ↑I × ↑P), LipschitzWith L' ⇑(Slice tp).symm All goals completed! 🐙
#3
Ornstein–Weiss ℤᵈ Rokhlin lemma
ornstein_weiss_rokhlin

Verso theorem preview

theorem declaration uses `sorry`ornstein_weiss_rokhlin {Ω : Type*} [MeasurableSpace Ω] [StandardBorelSpace Ω] {d : ℕ} (_hd : 1 ≤ d) (μ : Measure Ω) [IsProbabilityMeasure μ] (T : (Fin d → ℤ) → Ω → Ω) (_hid : ∀ x, T 0 x = x) (_hT : ∀ v, MeasurePreserving (T v) μ μ) (_hgrp : ∀ u v x, T (u + v) x = T u (T v x)) (_hfree : LeanEval.Dynamics.IsFreeAction μ T) (N : ℕ) (_hN : 1 ≤ N) {ε : ENNReal} (_hε : 0 < ε) : ∃ B : Set Ω, MeasurableSet B ∧ ((boxShape d N : Finset (Fin d → ℤ)) : Set (Fin d → ℤ)).PairwiseDisjoint (fun v => T v '' B) ∧ μ (⋃ v ∈ boxShape d N, T v '' B) ≥ 1 - ε := Ω:Type u_1inst✝²:MeasurableSpace Ωinst✝¹:StandardBorelSpace Ωd:ℕ_hd:1 ≤ dμ:Measure Ωinst✝:IsProbabilityMeasure μT:(Fin d → ℤ) → Ω → Ω_hid:∀ (x : Ω), T 0 x = x_hT:∀ (v : Fin d → ℤ), MeasurePreserving (T v) μ μ_hgrp:∀ (u v : Fin d → ℤ) (x : Ω), T (u + v) x = T u (T v x)_hfree:IsFreeAction μ TN:ℕ_hN:1 ≤ Nε:ENNReal_hε:0 < ε⊢ ∃ B, MeasurableSet B ∧ ((↑(boxShape d N)).PairwiseDisjoint fun v => T v '' B) ∧ μ (⋃ v ∈ boxShape d N, T v '' B) ≥ 1 - ε All goals completed! 🐙
#4
The Golod–Shafarevich inequality
golod_shafarevich_inequality

Verso theorem preview

theorem declaration uses `sorry`golod_shafarevich_inequality (p : ℕ) [Fact p.Prime] (Q : Type) [Group Q] [TopologicalSpace Q] [IsTopologicalGroup Q] [DiscreteTopology Q] [Finite Q] : IsPGroup p Q → Nontrivial Q → (generatorRank Q : ℝ) ^ 2 < 4 * (relationRank p Q : ℝ) := p:ℕinst✝⁵:Fact (Nat.Prime p)Q:Typeinst✝⁴:Group Qinst✝³:TopologicalSpace Qinst✝²:IsTopologicalGroup Qinst✝¹:DiscreteTopology Qinst✝:Finite Q⊢ IsPGroup p Q → Nontrivial Q → ↑(generatorRank Q) ^ 2 < 4 * ↑(relationRank p Q) All goals completed! 🐙
#5
Wigner semicircle law
wigner_semicircle

Verso theorem preview

theorem declaration uses `sorry`wigner_semicircle {Ω : Type*} [MeasurableSpace Ω] (μ : Measure Ω) [IsProbabilityMeasure μ] (X : ℕ → ℕ → Ω → ℝ) (_hX_meas : ∀ i j, Measurable (X i j)) (_hX_indep : iIndepFun (fun ij : {p : ℕ × ℕ // p.1 ≤ p.2} => X ij.val.1 ij.val.2) μ) (_hX_iid : ∀ i j i' j', i ≤ j → i' ≤ j' → ProbabilityTheory.IdentDistrib (X i j) (X i' j') μ μ) (_hX_int : ∀ i j, i ≤ j → Integrable (X i j) μ) (_hX_sq_int : ∀ i j, i ≤ j → Integrable (fun ω => (X i j ω) ^ 2) μ) (_hX_mean : ∀ i j, i ≤ j → ∫ ω, X i j ω ∂μ = 0) (_hX_var : ∀ i j, i ≤ j → ∫ ω, (X i j ω) ^ 2 ∂μ = 1) : ∀ᵐ ω ∂μ, ∀ (f : ℝ → ℝ), Continuous f → (∃ M, ∀ x, ‖f x‖ ≤ M) → Tendsto (fun n : ℕ => ∫ x, f x ∂ (empiricalSpectralMeasureHerm (wignerMatrix_isHermitian X n ω)).map (fun x : ℝ => x / Real.sqrt n)) atTop (𝓝 (∫ x, f x ∂semicircleLaw)) := Ω:Type u_1inst✝¹:MeasurableSpace Ωμ:Measure Ωinst✝:IsProbabilityMeasure μX:ℕ → ℕ → Ω → ℝ_hX_meas:∀ (i j : ℕ), Measurable (X i j)_hX_indep:iIndepFun (fun ij => X (↑ij).1 (↑ij).2) μ_hX_iid:∀ (i j i' j' : ℕ), i ≤ j → i' ≤ j' → IdentDistrib (X i j) (X i' j') μ μ_hX_int:∀ (i j : ℕ), i ≤ j → Integrable (X i j) μ_hX_sq_int:∀ (i j : ℕ), i ≤ j → Integrable (fun ω => X i j ω ^ 2) μ_hX_mean:∀ (i j : ℕ), i ≤ j → ∫ (ω : Ω), X i j ω ∂μ = 0_hX_var:∀ (i j : ℕ), i ≤ j → ∫ (ω : Ω), X i j ω ^ 2 ∂μ = 1⊢ ∀ᵐ (ω : Ω) ∂μ, ∀ (f : ℝ → ℝ), Continuous f → (∃ M, ∀ (x : ℝ), ‖f x‖ ≤ M) → Tendsto (fun n => ∫ (x : ℝ), f x ∂Measure.map (fun x => x / √↑n) (empiricalSpectralMeasureHerm ⋯)) atTop (𝓝 (∫ (x : ℝ), f x ∂semicircleLaw)) All goals completed! 🐙
#6
A 3-manifold group with no faithful representation into GL(4, ℝ)
nonlinear_three_manifold_group

Verso theorem preview

theorem declaration uses `sorry`nonlinear_three_manifold_group : ∃ (M : LeanEval.Topology.Closed3Manifold) (x : M.carrier), ∀ f : FundamentalGroup M.carrier x →* GL (Fin 4) ℝ, ¬ Function.Injective f := ⊢ ∃ M x, ∀ (f : FundamentalGroup M.carrier x →* GL (Fin 4) ℝ), ¬Function.Injective ⇑f All goals completed! 🐙
#7
Cauchy–Kovalevskaya theorem
cauchy_kovalevskaya

Verso theorem preview

theorem declaration uses `sorry`cauchy_kovalevskaya {d : ℕ} (F : LeanEval.Analysis.E d × ℝ × ℝ → LeanEval.Analysis.E d) (f : LeanEval.Analysis.E d × ℝ × ℝ → ℝ) (u₀ : LeanEval.Analysis.E d → ℝ) (_hF : AnalyticOnNhd ℝ F univ) (_hf : AnalyticOnNhd ℝ f univ) (_hu₀ : AnalyticOnNhd ℝ u₀ univ) (x₀ : LeanEval.Analysis.E d) : ∃ (U : Set (LeanEval.Analysis.E d × ℝ)) (u : LeanEval.Analysis.E d × ℝ → ℝ), (x₀, (0 : ℝ)) ∈ U ∧ IsOpen U ∧ AnalyticOnNhd ℝ u U ∧ (∀ x : LeanEval.Analysis.E d, (x, (0 : ℝ)) ∈ U → u (x, 0) = u₀ x) ∧ (∀ p ∈ U, fderiv ℝ u p ((0 : LeanEval.Analysis.E d), (1 : ℝ)) = fderiv ℝ u p (F (p.1, p.2, u p), (0 : ℝ)) + f (p.1, p.2, u p)) ∧ (∀ v : LeanEval.Analysis.E d × ℝ → ℝ, AnalyticOnNhd ℝ v U → (∀ x : LeanEval.Analysis.E d, (x, (0 : ℝ)) ∈ U → v (x, 0) = u₀ x) → (∀ p ∈ U, fderiv ℝ v p ((0 : LeanEval.Analysis.E d), (1 : ℝ)) = fderiv ℝ v p (F (p.1, p.2, v p), (0 : ℝ)) + f (p.1, p.2, v p)) → ∀ p ∈ U, u p = v p) := d:ℕF:E d × ℝ × ℝ → E df:E d × ℝ × ℝ → ℝu₀:E d → ℝ_hF:AnalyticOnNhd ℝ F univ_hf:AnalyticOnNhd ℝ f univ_hu₀:AnalyticOnNhd ℝ u₀ univx₀:E d⊢ ∃ U u, (x₀, 0) ∈ U ∧ IsOpen U ∧ AnalyticOnNhd ℝ u U ∧ (∀ (x : E d), (x, 0) ∈ U → u (x, 0) = u₀ x) ∧ (∀ p ∈ U, (fderiv ℝ u p) (0, 1) = (fderiv ℝ u p) (F (p.1, p.2, u p), 0) + f (p.1, p.2, u p)) ∧ ∀ (v : E d × ℝ → ℝ), AnalyticOnNhd ℝ v U → (∀ (x : E d), (x, 0) ∈ U → v (x, 0) = u₀ x) → (∀ p ∈ U, (fderiv ℝ v p) (0, 1) = (fderiv ℝ v p) (F (p.1, p.2, v p), 0) + f (p.1, p.2, v p)) → ∀ p ∈ U, u p = v p All goals completed! 🐙
#8
The Hopf Umlaufsatz (theorem of turning tangents)
hopf_umlaufsatz

Verso theorem preview

theorem declaration uses `sorry`hopf_umlaufsatz {r : ℝ → LeanEval.Geometry.HopfUmlaufsatz.Plane} {α : ℝ → ℝ} (_hr : LeanEval.Geometry.HopfUmlaufsatz.IsPositiveSimpleClosedUnitSpeedCurve r) (_hα : LeanEval.Geometry.HopfUmlaufsatz.IsTangentAngleLift r α) : totalCurvature α = 2 * Real.pi := r:ℝ → Planeα:ℝ → ℝ_hr:IsPositiveSimpleClosedUnitSpeedCurve r_hα:IsTangentAngleLift r α⊢ totalCurvature α = 2 * Real.pi All goals completed! 🐙
#9
Sobolev embedding theorem (Morrey regime)
sobolev_embedding_morrey

Verso theorem preview

theorem declaration uses `sorry`sobolev_embedding {n k r : ℕ} {α p : ℝ} (_hp : (n : ℝ) < p) (_hα : 0 < α) (_hα1 : α ≤ 1) (_hgap : (r : ℝ) + α < (k : ℝ) - n / p) (f : LeanEval.Analysis.SobolevMorreyProblem.E n → ℝ) (_hf : LeanEval.Analysis.SobolevMorreyProblem.MemSobolevWk k (ENNReal.ofReal p) f) : ∃ g : LeanEval.Analysis.SobolevMorreyProblem.E n → ℝ, f =ᵐ[volume] g ∧ LeanEval.Analysis.SobolevMorreyProblem.MemHolder r α g := n:ℕk:ℕr:ℕα:ℝp:ℝ_hp:↑n < p_hα:0 < α_hα1:α ≤ 1_hgap:↑r + α < ↑k - ↑n / pf:E n → ℝ_hf:MemSobolevWk k (ENNReal.ofReal p) f⊢ ∃ g, f =ᵐ[volume] g ∧ LeanEval.Analysis.SobolevMorreyProblem.MemHolder r α g All goals completed! 🐙
#10
Existence of a non-isotopic pair of oriented knots
exists_nonisotopic_knots

Verso theorem preview

theorem declaration uses `sorry`exists_nonisotopic_knots : ∃ K₁ K₂ : LeanEval.KnotTheory.Knot, ¬ K₁.Isotopic K₂ := ⊢ ∃ K₁ K₂, ¬K₁.Isotopic K₂ All goals completed! 🐙
#11
Hurewicz theorem in degree 1 (H₁ = abelianization of π₁)
hurewicz_h1_abelianization

Lean theorem statement

/-- **Hurewicz (n = 1).** For a path-connected space `X`, `H₁(X;ℤ)` is the
abelianization of `π₁(X, x)`. -/
theorem hurewicz_h1_abelianization
    (X : Type) [TopologicalSpace X] [PathConnectedSpace X] (x : X) :
    Nonempty (Additive (Abelianization (FundamentalGroup X x)) ≃+
      (IntegralHomology 1 X : Type)) := by
  sorry
#12
Strong Subadditivity of von Neumann Entropy
strong_subadditivity

Verso theorem preview

theorem declaration uses `sorry`strong_subadditivity (M_ABC : Matrix (A × B × C) (A × B × C) ℂ) (h : M_ABC.PosSemidef) : let M_AB : Matrix (A × B) (A × B) ℂ := .traceRight <| M_ABC.reindex (.symm <| .prodAssoc ..) (.symm <| .prodAssoc ..) let M_BC : Matrix (B × C) (B × C) ℂ := M_ABC.traceLeft let M_B : Matrix B B ℂ := M_BC.traceRight LeanEval.Physics.entropy M_ABC + LeanEval.Physics.entropy M_B ≤ LeanEval.Physics.entropy M_AB + LeanEval.Physics.entropy M_BC := A:Type u_1B:Type u_2C:Type u_3inst✝⁸:Fintype Ainst✝⁷:Fintype Binst✝⁶:Fintype Cinst✝⁵:DecidableEq Ainst✝⁴:DecidableEq Binst✝³:DecidableEq Cinst✝²:Nonempty Ainst✝¹:Nonempty Binst✝:Nonempty CM_ABC:Matrix (A × B × C) (A × B × C) ℂh:M_ABC.PosSemidef⊢ let M_AB := ((Matrix.reindex (Equiv.prodAssoc A B C).symm (Equiv.prodAssoc A B C).symm) M_ABC).traceRight; let M_BC := M_ABC.traceLeft; let M_B := M_BC.traceRight; entropy M_ABC + entropy M_B ≤ entropy M_AB + entropy M_BC All goals completed! 🐙
#13
Lax's approximation theorem for toral homeomorphisms
lax_approximation

Lean theorem statement

/-- **Lax's approximation theorem.** Every toral dynamical system on `𝕋^d`
(`d ≥ 1`) is approximated arbitrarily well in the metric `δ` by cyclic cube
exchange transformations. -/
theorem lax_approximation {d : ℕ} (hd : 0 < d) (T : ToralDynamicalSystem d)
    {ε : ℝ≥0∞} (hε : 0 < ε) :
    ∃ (n : ℕ) (S : VolumePreservingEquiv d),
      IsCyclicCubeExchange S n ∧ deltaDist T.toVolumePreservingEquiv S < ε := by
  sorry
#14
Anosov–Bowen shadowing lemma
anosov_bowen_shadowing

Lean theorem statement

/-- **Anosov–Bowen shadowing lemma** (Anosov 1967; Bowen 1975). Every
compact hyperbolic invariant set has the shadowing property. -/
theorem hyperbolic_has_shadowing
    (T : E d ≃ₜ E d) (K : Set (E d))
    (_hKc : IsCompact K) (_hK : IsHyperbolic T K) :
    HasShadowing (T : E d → E d) K := by
  sorry
#15
General recursive equals Turing computable
turing_recursive_equiv

Lean theorem statement

/-- **General recursive = Turing computable** (total form). A total function
`f : ℕ → ℕ` is recursive (`Computable`, i.e. partial recursive as a partial
function) **iff** it is computed by some Turing machine (mathlib's `FinTM2`
model) under the standard binary encoding of `ℕ`. This is Knill's class
equality; the backward direction (TM-computable ⇒ recursive) is absent from
mathlib. -/
theorem turing_recursive_equiv (f : ℕ → ℕ) :
    Computable f ↔ Nonempty (TM2Computable encodeNat encodeNat f) := by
  sorry
#16
Radial symmetry for positive semilinear Poisson solutions
semilinear_poisson_radial_symmetry

Verso theorem preview

theorem declaration uses `sorry`semilinear_poisson_radial_symmetry {n : ℕ} (hn : 0 < n) {f : ℝ → ℝ} (u : EuclideanSpace ℝ (Fin n) → ℝ) (hf_lipschitz : ∃ K : ℝ≥0, LipschitzWith K f) (hu_c2 : ContDiffOn ℝ 2 u (closedBall 0 1)) (hu_solve : LeanEval.Analysis.PDE.SolvesSemilinearPoisson f u) (hu_positive : ∀ x ∈ ball 0 1, 0 < u x) : ∃ v : ℝ → ℝ≥0, StrictAntiOn v (Set.Icc (0 : ℝ) 1) ∧ ∀ x ∈ closedBall 0 1, u x = v ‖x‖ := n:ℕhn:0 < nf:ℝ → ℝu:EuclideanSpace ℝ (Fin n) → ℝhf_lipschitz:∃ K, LipschitzWith K fhu_c2:ContDiffOn ℝ 2 u (closedBall 0 1)hu_solve:SolvesSemilinearPoisson f uhu_positive:∀ x ∈ ball 0 1, 0 < u x⊢ ∃ v, StrictAntiOn v (Set.Icc 0 1) ∧ ∀ x ∈ closedBall 0 1, u x = ↑(v ‖x‖) All goals completed! 🐙
#17
Poincaré–Siegel linearisation theorem
poincare_siegel_linearisation

Lean theorem statement

/-- **Poincaré–Siegel linearisation theorem.** If `α` is Diophantine,
`λ = e^{2πiα}`, and `f` is holomorphic near `0` with `f 0 = 0` and
`f'(0) = λ`, then there is a holomorphic germ `u` with `u 0 = 0`,
`u'(0) = 1`, and `f(u z) = u(λ z)` for `z` near `0`. -/
theorem poincare_siegel
    (α : ℝ) (_hα : IsDiophantine α)
    (lam : ℂ) (_hlam : lam = Complex.exp (2 * Real.pi * Complex.I * (α : ℂ)))
    (f : ℂ → ℂ) (_hf : AnalyticAt ℂ f 0) (_hf0 : f 0 = 0)
    (_hmult : deriv f 0 = lam) :
    ∃ u : ℂ → ℂ, AnalyticAt ℂ u 0 ∧ u 0 = 0 ∧ deriv u 0 = 1 ∧
      ∀ᶠ z in nhds (0 : ℂ), f (u z) = u (lam * z) := by
  sorry
#18
Kolmogorov–Arnold superposition theorem (non-universal Lorentz form)
kolmogorov_arnold_superposition

Lean theorem statement

/-- **Kolmogorov–Arnold superposition theorem (non-universal Lorentz
form).** For `n ≥ 1`, every continuous `f` on the unit cube `[0, 1]ⁿ`
admits a representation
`f(x) = ∑_{k=0}^{2n} g(∑_{l=1}^{n} φ_{k,l}(x_l))` with a single
continuous outer function `g : ℝ → ℝ` and continuous inner functions
`φ_{k,l} : ℝ → ℝ`. -/
theorem kolmogorov_arnold (n : ℕ) (_hn : 1 ≤ n)
    (f : (Fin n → ℝ) → ℝ) (_hf : ContinuousOn f (Set.Icc 0 1)) :
    ∃ (g : ℝ → ℝ) (φ : Fin (2 * n + 1) → Fin n → ℝ → ℝ),
      Continuous g ∧ (∀ k l, Continuous (φ k l)) ∧
      ∀ x ∈ Set.Icc (0 : Fin n → ℝ) 1,
        f x = ∑ k, g (∑ l, φ k l (x l)) := by
  sorry
#19
No bounded projection from L^1 onto H^1
H1_not_closedComplemented

Verso theorem preview

theorem declaration uses `sorry`H1_not_closedComplemented : ¬ LeanEval.Analysis.H1.ClosedComplemented := ⊢ ¬H1.ClosedComplemented All goals completed! 🐙
#20
Fundamental theorem of topos theory
fundamental_topos_theory

Verso theorem preview

theorem declaration uses `sorry`fundamental_topos_theory {E : Type*} [Category E] (hE : LeanEval.ToposTheory.IsTopos E) (X : E) : LeanEval.ToposTheory.IsTopos (Over X) := E:Type u_1inst✝:Category.{u_2, u_1} EhE:IsTopos EX:E⊢ IsTopos (Over X) All goals completed! 🐙
#21
Brun's theorem (convergence of the twin-prime reciprocal sum)
brun_constant_converges

Lean theorem statement

/-- **Brun's theorem.** The reciprocal sum over twin-prime pairs converges. -/
theorem brun_constant_converges :
    Summable twinPrimeReciprocalTerm := by
  sorry
#22
Riesz brothers' theorem
riesz_brothers_theorem

Lean theorem statement

/-- **Riesz brothers' theorem.** Let `μ` be a complex Borel measure on
the unit circle such that `∫ z^n dμ = 0` for every `n ≥ 1`. Then `μ` is
absolutely continuous with respect to Haar measure. The usual density
formulation follows by applying the Radon–Nikodym theorem to this conclusion;
the hypothesis transfers the Fourier-vanishing property to that density. This
corollary is not part of the formal statement here. -/
theorem riesz_brothers_theorem (μ : ComplexMeasure UnitAddCircle)
    (hμ : ∀ n : ℕ, 1 ≤ n → ∫ᵛ z, fourier n z ∂[ContinuousLinearMap.mul ℝ ℂ; μ] = 0) :
    μ ≪ᵥ AddCircle.haarAddCircle.toENNRealVectorMeasure := by
  sorry
#23
Gauss-Wantzel constructible regular polygon theorem
gauss_wantzel_constructible_polygon

Lean theorem statement

/-- **Gauss-Wantzel constructible polygon theorem** (§174): a regular `n`-gon
is straightedge-and-compass constructible exactly for the Gauss-Wantzel
integers. -/
theorem gauss_wantzel_constructible_polygon (n : ℕ) (hn : 3 ≤ n) :
    IsConstructible (Real.cos (2 * Real.pi / n)) ↔ GaussWantzelNumber n := by
  sorry
#24
The Landsberg–Schaar relation
landsberg_schaar

Verso theorem preview

theorem declaration uses `sorry`landsberg_schaar (p q : ℕ) (hp : Odd p) (hq : Odd q) : gaussS (2 * q : ℕ) p = Complex.exp ((Real.pi : ℂ) * Complex.I / 4) * gaussS (-(p : ℤ)) (2 * q) := p:ℕq:ℕhp:Odd phq:Odd q⊢ gaussS (↑(2 * q)) p = cexp (↑Real.pi * I / 4) * gaussS (-↑p) (2 * q) All goals completed! 🐙
#25
Radon transform: Fourier-slice diagonalization and pseudo-inversion
radon_transform_inversion

Verso theorem preview

theorem declaration uses `sorry`radon_can_be_diagonalized_and_pseudo_inverted : (∀ φ : SchwartzMap (ℝ × ℝ) ℂ, ∀ θ k : ℝ, fourier1 (fun p => radon (φ : ℝ × ℝ → ℂ) (p, θ)) k = fourier2 (φ : ℝ × ℝ → ℂ) (k * Real.cos θ, k * Real.sin θ)) ∧ (∃ Rinv : (ℝ × ℝ → ℂ) → (ℝ × ℝ → ℂ), ∀ φ : SchwartzMap (ℝ × ℝ) ℂ, Rinv (radon (φ : ℝ × ℝ → ℂ)) = (φ : ℝ × ℝ → ℂ)) := ⊢ (∀ (φ : SchwartzMap (ℝ × ℝ) ℂ) (θ k : ℝ), fourier1 (fun p => radon ⇑φ (p, θ)) k = fourier2 ⇑φ (k * Real.cos θ, k * Real.sin θ)) ∧ ∃ Rinv, ∀ (φ : SchwartzMap (ℝ × ℝ) ℂ), Rinv (radon ⇑φ) = ⇑φ All goals completed! 🐙
#26
Independence of the parallel postulate
parallel_postulate_independent

Verso theorem preview

theorem declaration uses `sorry`parallel_postulate_independent : (∃ (M : Type) (T : LeanEval.Geometry.TarskiAbsolute M), LeanEval.Geometry.Euclidean M T) ∧ (∃ (M : Type) (T : LeanEval.Geometry.TarskiAbsolute M), ¬ LeanEval.Geometry.Euclidean M T) := ⊢ (∃ M T, Euclidean M T) ∧ ∃ M T, ¬Euclidean M T All goals completed! 🐙
#27
Halmos's generic weak-mixing theorem
halmos_generic_weak_mixing

Verso theorem preview

theorem declaration uses `sorry`generic_weakly_mixing [StandardBorelSpace X] (m : Measure X) [IsProbabilityMeasure m] [NullSingletonClass m] : (∃ G : Set (LeanEval.Dynamics.HalmosGenericWeakMixingProblem.Automorphism m), IsGδ G ∧ Dense G ∧ ∀ T ∈ G, LeanEval.Dynamics.HalmosGenericWeakMixingProblem.IsWeaklyMixing m T) ∧ (∀ T : LeanEval.Dynamics.HalmosGenericWeakMixingProblem.Automorphism m, LeanEval.Dynamics.HalmosGenericWeakMixingProblem.IsWeaklyMixing m T → Ergodic (T.toEquiv : X → X) m) := X:Type u_1inst✝³:MeasurableSpace Xinst✝²:StandardBorelSpace Xm:Measure Xinst✝¹:IsProbabilityMeasure minst✝:NullSingletonClass m⊢ (∃ G, IsGδ G ∧ Dense G ∧ ∀ T ∈ G, IsWeaklyMixing m T) ∧ ∀ (T : Automorphism m), IsWeaklyMixing m T → Ergodic (⇑T.toEquiv) m All goals completed! 🐙
#28
Rokhlin lemma
rokhlin_lemma

Lean theorem statement

/-- **Rokhlin lemma, not-necessarily-invertible forward-image form.** For every
aperiodic measure-preserving transformation `T` of a standard Borel probability
space `(Ω, μ)`, every height `n ≥ 1`, and every `ε > 0`, there is a measurable
base whose `n` forward-image floors `B, T B, …, T^{n−1} B` are pairwise
disjoint and whose union has outer measure at least `1 − ε`. No invertibility
assumption is made. -/
theorem rokhlin_lemma {Ω : Type*} [MeasurableSpace Ω]
    [StandardBorelSpace Ω]
    (μ : Measure Ω) [IsProbabilityMeasure μ] (T : Ω → Ω)
    (_hT : MeasurePreserving T μ μ) (_hap : IsAperiodic T μ)
    (n : ℕ) (_hn : 1 ≤ n) {ε : ENNReal} (_hε : 0 < ε) :
    ∃ B : Set Ω, IsRokhlinTower T B n ∧
      μ (towerUnion T B n) ≥ 1 - ε := by
  sorry
#29
Liouville–Arnold theorem on integrable systems
liouville_arnold

Verso theorem preview

theorem declaration uses `sorry`liouville_arnold {n : ℕ} (F : Fin n → LeanEval.Geometry.LiouvilleArnold.E n → ℝ) (U : Set (LeanEval.Geometry.LiouvilleArnold.E n)) (_hU : IsOpen U) (_hLI : LeanEval.Geometry.LiouvilleArnold.IsLiouvilleIntegrable F U) (c : Fin n → ℝ) (_hMc_sub : LeanEval.Geometry.LiouvilleArnold.levelSet F c ⊆ U) (_hMc_compact : IsCompact (LeanEval.Geometry.LiouvilleArnold.levelSet F c)) (_hMc_connected : IsConnected (LeanEval.Geometry.LiouvilleArnold.levelSet F c)) : Nonempty ((LeanEval.Geometry.LiouvilleArnold.levelSet F c) ≃ₜ (Fin n → AddCircle (1 : ℝ))) := n:ℕF:Fin n → E n → ℝU:Set (E n)_hU:IsOpen U_hLI:IsLiouvilleIntegrable F Uc:Fin n → ℝ_hMc_sub:levelSet F c ⊆ U_hMc_compact:IsCompact (levelSet F c)_hMc_connected:IsConnected (levelSet F c)⊢ Nonempty (↑(levelSet F c) ≃ₜ (Fin n → AddCircle 1)) All goals completed! 🐙
#30
Wiener–Lévy theorem
wiener_levy_analytic_calculus

Lean theorem statement

/-- **Wiener–Lévy theorem.** If `φ` is complex-analytic on a neighbourhood of
the range of a Wiener-algebra function `f`, then the composed function
`φ ∘ f` is again in the Wiener algebra. -/
theorem wiener_levy_analytic_calculus (f : C(AddCircle T, ℂ))
    (φ : ℂ → ℂ) (U : Set ℂ) (hf : InWienerAlgebra f)
    (hU : IsOpen U) (hrange : range f ⊆ U)
    (hφ : AnalyticOnNhd ℂ φ U) :
    ∃ g : C(AddCircle T, ℂ),
      (∀ x, g x = φ (f x)) ∧ InWienerAlgebra g := by
  sorry
#31
Tverberg's theorem
tverberg_theorem

Lean theorem statement

/-- **Tverberg's theorem.** Any `(r-1)(d+1)+1` points in `ℝ^d` admit an
`r`-part Tverberg partition. -/
theorem tverberg_theorem (d r : ℕ) (hr : 1 ≤ r)
    (f : Fin ((r - 1) * (d + 1) + 1) → Space d) :
    HasTverbergPartition (r := r) f := by
  sorry
#32
Local stable/unstable sets at a hyperbolic fixed point (set-level Hadamard–Perron)
stable_unstable_manifolds

Verso theorem preview

theorem declaration uses `sorry`stable_unstable_manifolds_exist (n : ℕ) (f : LeanEval.Dynamics.StableUnstableManifoldsProblem.E n → LeanEval.Dynamics.StableUnstableManifoldsProblem.E n) (x₀ : LeanEval.Dynamics.StableUnstableManifoldsProblem.E n) (_hf : ContDiffAt ℝ 1 f x₀) (_hfix : f x₀ = x₀) (_hhyp : LeanEval.Dynamics.StableUnstableManifoldsProblem.IsHyperbolicLinear (fderiv ℝ f x₀)) (_hf_inv : (fderiv ℝ f x₀).IsInvertible) : ∃ U : Set (LeanEval.Dynamics.StableUnstableManifoldsProblem.E n), IsOpen U ∧ x₀ ∈ U ∧ ∃ Ws Wu : Set (LeanEval.Dynamics.StableUnstableManifoldsProblem.E n), Ws = {x | (∀ k : ℕ, f^[k] x ∈ U) ∧ Tendsto (fun k => f^[k] x) atTop (𝓝 x₀)} ∧ Wu = {x | ∃ y : ℕ → LeanEval.Dynamics.StableUnstableManifoldsProblem.E n, y 0 = x ∧ (∀ k : ℕ, y k ∈ U) ∧ (∀ k : ℕ, f (y (k + 1)) = y k) ∧ Tendsto y atTop (𝓝 x₀)} ∧ Ws ∩ Wu = {x₀} := n:ℕf:E n → E nx₀:E n_hf:ContDiffAt ℝ 1 f x₀_hfix:f x₀ = x₀_hhyp:IsHyperbolicLinear (fderiv ℝ f x₀)_hf_inv:(fderiv ℝ f x₀).IsInvertible⊢ ∃ U, IsOpen U ∧ x₀ ∈ U ∧ ∃ Ws Wu, Ws = {x | (∀ (k : ℕ), f^[k] x ∈ U) ∧ Tendsto (fun k => f^[k] x) atTop (𝓝 x₀)} ∧ Wu = {x | ∃ y, y 0 = x ∧ (∀ (k : ℕ), y k ∈ U) ∧ (∀ (k : ℕ), f (y (k + 1)) = y k) ∧ Tendsto y atTop (𝓝 x₀)} ∧ Ws ∩ Wu = {x₀} All goals completed! 🐙
#33
Shannon capacity of the pentagon
shannon_capacity_pentagon

Lean theorem statement

/-- **Lovász's theorem on Shannon capacity of the pentagon** (§238).
The Shannon capacity of the five-cycle is `√5`. -/
theorem shannon_capacity_pentagon :
    HasShannonCapacity (SimpleGraph.cycleGraph 5) (Real.sqrt 5) := by
  sorry
#34
Sard's regular-value corollary
regular_value_ae

Lean theorem statement

/-- **Regular value corollary (Sard).** For a smooth `f : ℝᵐ → ℝ`, almost every
`c ∈ ℝ` is a regular value. -/
theorem regular_value_ae {m : ℕ} (f : EuclideanSpace ℝ (Fin m) → ℝ)
    (hf : ContDiff ℝ ∞ f) :
    ∀ᵐ c ∂(volume : Measure ℝ), IsRegularValue f c := by
  sorry
#35
The Lindemann–Weierstrass theorem
lindemann_weierstrass

Lean theorem statement

/-- **Lindemann–Weierstrass theorem.** If `x₁, …, xₙ ∈ ℂ` are algebraic over `ℚ`
and ℚ-linearly independent, then `e^{x₁}, …, e^{xₙ}` are algebraically
independent over `ℚ`. -/
theorem lindemann_weierstrass {n : ℕ} (x : Fin n → ℂ)
    (h_alg : ∀ i, IsAlgebraic ℚ (x i))
    (h_lin : LinearIndependent ℚ x) :
    AlgebraicIndependent ℚ (fun i => Complex.exp (x i)) := by
  sorry
#36
Fundamental theorem of Riemannian geometry (Levi-Civita)
levi_civita_exists_unique

Lean theorem statement

/-- **Fundamental theorem of Riemannian geometry** (Levi-Civita). On a
`C^∞` finite-dimensional Riemannian manifold there exists a smooth
torsion-free metric-compatible covariant derivative on `TM`, and any other
such connection agrees with it on smooth vector fields. -/
theorem levi_civita_exists_unique
    {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E]
      [FiniteDimensional ℝ E] [CompleteSpace E]
    {H : Type*} [TopologicalSpace H] {I : ModelWithCorners ℝ E H}
    {M : Type*} [TopologicalSpace M] [T2Space M] [ChartedSpace H M]
      [IsManifold I ∞ M]
    [RiemannianBundle (fun (x : M) ↦ TangentSpace I x)]
    [IsContMDiffRiemannianBundle I ∞ E (fun (x : M) ↦ TangentSpace I x)] :
    ∃ cov : CovariantDerivative I E (TangentSpace I (M := M)),
      (ContMDiffCovariantDerivative cov ∞ ∧
        cov.torsion = 0 ∧ IsMetricCompatible cov) ∧
      ∀ cov' : CovariantDerivative I E (TangentSpace I (M := M)),
        (ContMDiffCovariantDerivative cov' ∞ ∧
          cov'.torsion = 0 ∧ IsMetricCompatible cov') →
        SameOnSmooth cov cov' := by
  sorry
#37
Lidskii's inequality
lidskii_inequality

Verso theorem preview

theorem declaration uses `sorry`lidskii_inequality {n : Type*} [Fintype n] [DecidableEq n] {A B : Matrix n n ℂ} (hA : A.IsHermitian) (hB : B.IsHermitian) {p : ℝ} (_hp : 1 ≤ p) : ∑ j, |hA.eigenvalues₀ j - hB.eigenvalues₀ j| ^ p ≤ ∑ j, |(hB.sub hA).eigenvalues₀ j| ^ p := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℂB:Matrix n n ℂhA:A.IsHermitianhB:B.IsHermitianp:ℝ_hp:1 ≤ p⊢ ∑ j, |hA.eigenvalues₀ j - hB.eigenvalues₀ j| ^ p ≤ ∑ j, |⋯.eigenvalues₀ j| ^ p All goals completed! 🐙
#38
The Hausdorff–Hildebrandt–Schoenberg moment theorem
hausdorff_hildebrandt_schoenberg

Verso theorem preview

theorem declaration uses `sorry`hausdorff_hildebrandt_schoenberg {d : ℕ} (a : (Fin d → ℕ) → ℝ) : LeanEval.Analysis.IsMomentConfiguration a ↔ LeanEval.Analysis.HausdorffBounded a := d:ℕa:(Fin d → ℕ) → ℝ⊢ IsMomentConfiguration a ↔ HausdorffBounded a All goals completed! 🐙
#39
Frobenius's theorem: the Frobenius kernel is normal
frobenius_kernel_isNormal

Verso theorem preview

theorem declaration uses `sorry`frobenius_kernel_isNormal (G X : Type) [Group G] [Fintype G] [Fintype X] [MulAction G X] [FaithfulSMul G X] (hcard : 2 ≤ Fintype.card X) (htrans : ∀ x y : X, ∃ g : G, g • x = y) (hstab : ∀ x : X, MulAction.stabilizer G x ≠ ⊥) (hfrob : ∀ g : G, g ≠ 1 → ∀ x y : X, g • x = x → g • y = y → x = y) : ∃ N : Subgroup G, N.Normal ∧ (N : Set G) = {1} ∪ {g : G | ∀ x : X, g • x ≠ x} := G:TypeX:Typeinst✝⁴:Group Ginst✝³:Fintype Ginst✝²:Fintype Xinst✝¹:MulAction G Xinst✝:FaithfulSMul G Xhcard:2 ≤ Fintype.card Xhtrans:∀ (x y : X), ∃ g, g • x = yhstab:∀ (x : X), MulAction.stabilizer G x ≠ ⊥hfrob:∀ (g : G), g ≠ 1 → ∀ (x y : X), g • x = x → g • y = y → x = y⊢ ∃ N, N.Normal ∧ ↑N = {1} ∪ {g | ∀ (x : X), g • x ≠ x} All goals completed! 🐙
#40
Frobenius determinant theorem
frobenius_group_determinant

Verso theorem preview

theorem declaration uses `sorry`frobenius_group_determinant (G : Type*) [Group G] [Fintype G] [DecidableEq G] : ∃ (r : ℕ) (p : Fin r → MvPolynomial G ℂ), r = Nat.card (ConjClasses G) ∧ (∀ j, Irreducible (p j)) ∧ (∀ i j, i ≠ j → ¬ Associated (p i) (p j)) ∧ groupDeterminant G = ∏ j, (p j) ^ (p j).totalDegree := G:Type u_1inst✝²:Group Ginst✝¹:Fintype Ginst✝:DecidableEq G⊢ ∃ r p, r = Nat.card (ConjClasses G) ∧ (∀ (j : Fin r), Irreducible (p j)) ∧ (∀ (i j : Fin r), i ≠ j → ¬Associated (p i) (p j)) ∧ groupDeterminant G = ∏ j, p j ^ (p j).totalDegree All goals completed! 🐙
#41
Choquet's representation theorem
choquet_representation_theorem

Verso theorem preview

theorem declaration uses `sorry`choquet [MeasurableSpace X] [BorelSpace X] (K : Set X) (hK_cpt : IsCompact K) (hK_cvx : Convex ℝ K) {x : X} (hx : x ∈ K) : ∃ μ : Measure X, IsProbabilityMeasure μ ∧ μ (K.extremePoints ℝ)ᶜ = 0 ∧ x = ∫ y, y ∂μ := X:Type u_1inst✝⁴:NormedAddCommGroup Xinst✝³:NormedSpace ℝ Xinst✝²:CompleteSpace Xinst✝¹:MeasurableSpace Xinst✝:BorelSpace XK:Set XhK_cpt:IsCompact KhK_cvx:Convex ℝ Kx:Xhx:x ∈ K⊢ ∃ μ, IsProbabilityMeasure μ ∧ μ (Set.extremePoints ℝ K)ᶜ = 0 ∧ x = ∫ (y : X), y ∂μ All goals completed! 🐙
#42
Wiener's 1/f theorem
wiener_inverse_closed

Lean theorem statement

/-- **Wiener's `1/f` theorem.** If a function on the circle belongs to the
Wiener algebra and has no zero on the circle, then its pointwise reciprocal
again belongs to the Wiener algebra. -/
theorem wiener_inverse_closed (f : C(AddCircle T, ℂ))
    (hf : InWienerAlgebra f) (hzero : ∀ x, f x ≠ 0) :
    ∃ g : C(AddCircle T, ℂ),
      (∀ x, g x = (f x)⁻¹) ∧ InWienerAlgebra g := by
  sorry
#43
Hausdorff moment problem: absolute-continuity criterion
hausdorff_absolute_continuity

Verso theorem preview

theorem declaration uses `sorry`hausdorff_absolute_continuity {d : ℕ} (μ : Measure (EuclideanSpace ℝ (Fin d))) [IsProbabilityMeasure μ] (hμ : μ ((LeanEval.Analysis.HausdorffAbsoluteContinuity.cube d)ᶜ) = 0) : LeanEval.Analysis.HausdorffAbsoluteContinuity.UniformlyAbsolutelyContinuous μ (volume.restrict (LeanEval.Analysis.HausdorffAbsoluteContinuity.cube d)) ↔ ∃ C : ℝ, ∀ k n : Fin d → ℕ, k ≤ n → diff (momentOf μ) k n ≤ C * diff (momentOf (volume.restrict (LeanEval.Analysis.HausdorffAbsoluteContinuity.cube d))) k n := d:ℕμ:Measure (EuclideanSpace ℝ (Fin d))inst✝:IsProbabilityMeasure μhμ:μ (cube d)ᶜ = 0⊢ UniformlyAbsolutelyContinuous μ (volume.restrict (cube d)) ↔ ∃ C, ∀ (k n : Fin d → ℕ), k ≤ n → diff (momentOf μ) k n ≤ C * diff (momentOf (volume.restrict (cube d))) k n All goals completed! 🐙
#44
Fang–Xia: tiling of the symmetric group by transpositions implies λ-transitivity
fang_xia_tiling_partition_transitive

Verso theorem preview

theorem declaration uses `sorry`fang_xia_partition_transitive_of_tiling {n : ℕ} {Y : Set (Equiv.Perm (Fin n))} (_h : LeanEval.Combinatorics.FangXiaTilingProblem.IsTiling (LeanEval.Combinatorics.FangXiaTilingProblem.transpositionsWithOne n) Y) : ∀ lam : LeanEval.Combinatorics.FangXiaTilingProblem.PartitionShape n, 0 ≤ lam.contentSum → LeanEval.Combinatorics.FangXiaTilingProblem.IsPartitionTransitive Y lam := n:ℕY:Set (Equiv.Perm (Fin n))_h:IsTiling (transpositionsWithOne n) Y⊢ ∀ (lam : PartitionShape n), 0 ≤ lam.contentSum → IsPartitionTransitive Y lam All goals completed! 🐙
#45
Mountain Pass Theorem (Ambrosetti–Rabinowitz 1973)
mountain_pass

Verso theorem preview

theorem declaration uses `sorry`mountain_pass (f : E → ℝ) (_hf : ContDiff ℝ 1 f) (_hps : LeanEval.Analysis.MountainPassProblem.PalaisSmale f) {a b : E} {ε r : ℝ} (_hmr : LeanEval.Analysis.MountainPassProblem.MountainRange f a b ε r) : ∃ x : E, LeanEval.Analysis.MountainPassProblem.IsCriticalPoint f x ∧ f x = mountainPassLevel f a b ∧ ε ≤ mountainPassLevel f a b := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:CompleteSpace Ef:E → ℝ_hf:ContDiff ℝ 1 f_hps:PalaisSmale fa:Eb:Eε:ℝr:ℝ_hmr:MountainRange f a b ε r⊢ ∃ x, IsCriticalPoint f x ∧ f x = mountainPassLevel f a b ∧ ε ≤ mountainPassLevel f a b All goals completed! 🐙
#46
The Hausdorff positivity (complete-monotonicity) criterion
hausdorff_positivity_criterion

Lean theorem statement

/-- **Hausdorff positivity criterion** (Hausdorff 1921). A moment configuration
comes from a positive measure iff all its iterated backward differences are
nonnegative — i.e. the sequence is *completely monotone*: `(Δᵏa)ₙ ≥ 0` for all
`k ≤ n`. -/
theorem hausdorff_positivity {d : ℕ} (a : (Fin d → ℕ) → ℝ) :
    IsPositiveMomentConfiguration a ↔ ∀ k n : Fin d → ℕ, k ≤ n → 0 ≤ diff a k n := by
  sorry
#47
Fraser: Fourier decay for finite-field Kakeya sets is q^{-1} and sharp
fraser_kakeya_fourier_decay

Verso theorem preview

theorem declaration uses `sorry`fraser_kakeya_fourier_decay_and_sharp {d : ℕ} (_hd : 2 ≤ d) {K : Set (LeanEval.Combinatorics.FraserKakeyaProblem.Space F d)} (_hK : LeanEval.Combinatorics.FraserKakeyaProblem.IsKakeya K) (χ : AddChar F ℂ) (_hχ : χ ≠ 1) : (∃ μ : LeanEval.Combinatorics.FraserKakeyaProblem.Space F d → ℝ, LeanEval.Combinatorics.FraserKakeyaProblem.IsProbabilityMeasureOn K μ ∧ ∀ ξ : LeanEval.Combinatorics.FraserKakeyaProblem.Space F d, ξ ≠ 0 → ‖fourier χ μ ξ‖ ≤ (Fintype.card F : ℝ)⁻¹) ∧ (∀ κ : ℝ, 0 < κ → κ < 1 → ∃ Q : ℕ, ∀ (F' : Type*) [Field F'] [Fintype F'] [DecidableEq F'], Q ≤ Fintype.card F' → ∃ K' : Set (LeanEval.Combinatorics.FraserKakeyaProblem.Space F' d), LeanEval.Combinatorics.FraserKakeyaProblem.IsKakeya K' ∧ ∀ μ : LeanEval.Combinatorics.FraserKakeyaProblem.Space F' d → ℝ, LeanEval.Combinatorics.FraserKakeyaProblem.IsProbabilityMeasureOn K' μ → ∃ ξ : LeanEval.Combinatorics.FraserKakeyaProblem.Space F' d, ξ ≠ 0 ∧ κ * (Fintype.card F' : ℝ)⁻¹ ≤ ‖fourier (AddChar.FiniteField.primitiveChar_to_Complex F') μ ξ‖) := F:Type u_1inst✝²:Field Finst✝¹:Fintype Finst✝:DecidableEq Fd:ℕ_hd:2 ≤ dK:Set (Space F d)_hK:IsKakeya Kχ:AddChar F ℂ_hχ:χ ≠ 1⊢ (∃ μ, IsProbabilityMeasureOn K μ ∧ ∀ (ξ : Space F d), ξ ≠ 0 → ‖LeanEval.Combinatorics.FraserKakeyaProblem.fourier χ μ ξ‖ ≤ (↑(Fintype.card F))⁻¹) ∧ ∀ (κ : ℝ), 0 < κ → κ < 1 → ∃ Q, ∀ (F' : Type u_2) [inst : Field F'] [inst_1 : Fintype F'] [DecidableEq F'], Q ≤ Fintype.card F' → ∃ K', IsKakeya K' ∧ ∀ (μ : Space F' d → ℝ), IsProbabilityMeasureOn K' μ → ∃ ξ, ξ ≠ 0 ∧ κ * (↑(Fintype.card F'))⁻¹ ≤ ‖LeanEval.Combinatorics.FraserKakeyaProblem.fourier (AddChar.FiniteField.primitiveChar_to_Complex F') μ ξ‖ All goals completed! 🐙
#48
Chen theorem for Markoff graphs
dvd_card_connectedComponent_markoffGraph

Verso theorem preview

theorem declaration uses `sorry`dvd_card_connectedComponent_markoffGraph {p : ℕ} (hp : Nat.Prime p) (hgt : 3 < p) : ∀ c : (LeanEval.Combinatorics.markoffGraph p).ConnectedComponent, p ∣ Nat.card c := p:ℕhp:Nat.Prime phgt:3 < p⊢ ∀ (c : (markoffGraph p).ConnectedComponent), p ∣ Nat.card ↥c All goals completed! 🐙
#49
Nyquist–Shannon sampling theorem
nyquist_shannon_sampling

Verso theorem preview

theorem declaration uses `sorry`nyquist_shannon_sampling (f : 𝓢(ℝ, ℂ)) (hf : LeanEval.Analysis.NyquistShannon.FourierSupportedInNyquist f) : ∀ t : ℝ, Summable (fun n : ℤ ↦ f (n : ℝ) * sinc (Real.pi * ((n : ℝ) - t))) ∧ f t = ∑' n : ℤ, f (n : ℝ) * sinc (Real.pi * ((n : ℝ) - t)) := f:𝓢(ℝ, ℂ)hf:FourierSupportedInNyquist f⊢ ∀ (t : ℝ), (Summable fun n => f ↑n * sinc (Real.pi * (↑n - t))) ∧ f t = ∑' (n : ℤ), f ↑n * sinc (Real.pi * (↑n - t)) All goals completed! 🐙
#50
Kirk's normal-structure fixed point theorem
kirk_normal_structure

Verso theorem preview

theorem declaration uses `sorry`kirk_normal_structure [CompleteSpace E] (hE_reflexive : Function.Surjective (NormedSpace.inclusionInDoubleDual ℝ E)) (K : Set E) (hK_nonempty : K.Nonempty) (hK_closed : IsClosed K) (hK_bounded : Bornology.IsBounded K) (hK_convex : Convex ℝ K) (hK_normal : LeanEval.Topology.KirkNormalStructure.HasNormalStructure K) (T : K → K) (hT : LeanEval.Topology.KirkNormalStructure.IsNonexpansiveSelfMap K T) : ∃ x : K, IsFixedPt T x := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:CompleteSpace EhE_reflexive:Surjective ⇑(NormedSpace.inclusionInDoubleDual ℝ E)K:Set EhK_nonempty:K.NonemptyhK_closed:IsClosed KhK_bounded:Bornology.IsBounded KhK_convex:Convex ℝ KhK_normal:HasNormalStructure KT:↑K → ↑KhT:IsNonexpansiveSelfMap K T⊢ ∃ x, IsFixedPt T x All goals completed! 🐙
#51
Pascal's theorem
pascal

Lean theorem statement

/-- **Pascal's theorem.** Six distinct points on a non-singular conic determine
three collinear intersection points `Aᵢ Bⱼ ∩ Aⱼ Bᵢ`. -/
theorem pascal
    (M : Matrix (Fin 3) (Fin 3) ℝ) (hMsymm : M.IsSymm) (hMdet : M.det ≠ 0)
    (a₁ a₂ a₃ b₁ b₂ b₃ : Fin 3 → ℝ)
    (ha₁ : a₁ ≠ 0) (ha₂ : a₂ ≠ 0) (ha₃ : a₃ ≠ 0)
    (hb₁ : b₁ ≠ 0) (hb₂ : b₂ ≠ 0) (hb₃ : b₃ ≠ 0)
    (hdist : [a₁, a₂, a₃, b₁, b₂, b₃].Pairwise (fun v w => ¬ SamePoint v w))
    (hA₁ : OnConic M a₁) (hA₂ : OnConic M a₂) (hA₃ : OnConic M a₃)
    (hB₁ : OnConic M b₁) (hB₂ : OnConic M b₂) (hB₃ : OnConic M b₃) :
    Collinear3 (meet a₁ b₂ a₂ b₁) (meet a₁ b₃ a₃ b₁) (meet a₂ b₃ a₃ b₂) := by
  sorry
#52
Lindemann's theorem (e and π transcendental)
lindemann

Lean theorem statement

/-- **Lindemann's theorem.** Both `e = exp 1` and `π` are transcendental over
`ℤ`. -/
theorem lindemann :
    Transcendental ℤ (Real.exp 1) ∧ Transcendental ℤ Real.pi := by
  sorry
#53
Boone–Higman theorem (easy direction)
boone_higman_embedding

Verso theorem preview

theorem declaration uses `sorry`boone_higman_embedding {G H K : Type*} [Group G] [Group H] [Group K] [IsSimpleGroup H] [Group.IsFinitelyPresented K] (f : G →* H) (hf : Function.Injective f) (g : H →* K) (hg : Function.Injective g) {n : ℕ} (φ : FreeGroup (Fin n) →* G) (hsurj : Function.Surjective φ) (hker : (MonoidHom.ker φ).IsFinitelyNormallyGenerated) : LeanEval.GroupTheory.BooneHigmanEmbedding.WordProblemSolvable φ := G:Type u_1H:Type u_2K:Type u_3inst✝⁴:Group Ginst✝³:Group Hinst✝²:Group Kinst✝¹:IsSimpleGroup Hinst✝:Group.IsFinitelyPresented Kf:G →* Hhf:Function.Injective ⇑fg:H →* Khg:Function.Injective ⇑gn:ℕφ:FreeGroup (Fin n) →* Ghsurj:Function.Surjective ⇑φhker:φ.ker.IsFinitelyNormallyGenerated⊢ WordProblemSolvable φ All goals completed! 🐙
#54
Baer–Suzuki theorem
baer_suzuki

Verso theorem preview

theorem declaration uses `sorry`baer_suzuki {G : Type*} [Group G] [Finite G] {p : ℕ} [Fact p.Prime] (x : G) : x ∈ LeanEval.GroupTheory.Defs.pCore p G ↔ ∀ g : G, IsPGroup p (Subgroup.closure ({x, g * x * g⁻¹} : Set G)) := G:Type u_1inst✝²:Group Ginst✝¹:Finite Gp:ℕinst✝:Fact (Nat.Prime p)x:G⊢ x ∈ pCore p G ↔ ∀ (g : G), IsPGroup p ↥(Subgroup.closure {x, g * x * g⁻¹}) All goals completed! 🐙
#55
Jordan normal form
jordan_normal_form

Lean theorem statement

/-- **Jordan normal form.** Over an algebraically closed field, every
endomorphism of `Kⁿ` admits a Jordan-chain basis. -/
theorem jordan_normal_form {K : Type*} [Field K] [IsAlgClosed K] (n : ℕ)
    (f : Module.End K (StdSpace K n)) :
    Nonempty (JordanChainBasis f) := by
  sorry
#56
Sard's theorem (critical-set image has measure zero)
sard_theorem

Verso theorem preview

theorem declaration uses `sorry`sard {m n : ℕ} (f : LeanEval.Geometry.SardTheoremProblem.E m → LeanEval.Geometry.SardTheoremProblem.E n) (_hf : ContDiff ℝ ∞ f) : volume (LeanEval.Geometry.SardTheoremProblem.criticalValues f) = 0 := m:ℕn:ℕf:E m → E n_hf:ContDiff ℝ ∞ f⊢ volume (criticalValues f) = 0 All goals completed! 🐙
#57
Peano existence theorem for ODEs
peano_existence

Verso theorem preview

theorem declaration uses `sorry`peano_existence {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] {f : E → E} (hf : Continuous f) (x₀ : E) : ∃ a : ℝ, 0 < a ∧ ∃ α : ℝ → E, α 0 = x₀ ∧ ∀ t ∈ Ioo (-a) a, HasDerivAt α (f (α t)) t := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:FiniteDimensional ℝ Ef:E → Ehf:Continuous fx₀:E⊢ ∃ a, 0 < a ∧ ∃ α, α 0 = x₀ ∧ ∀ t ∈ Ioo (-a) a, HasDerivAt α (f (α t)) t All goals completed! 🐙
#58
Nash equilibrium existence theorem
nash_equilibrium_exists

Lean theorem statement

/-- **Nash equilibrium existence theorem.** Every finite `n`-player game
with nonempty finite pure-strategy sets and arbitrary real payoffs admits
at least one mixed-strategy Nash equilibrium. -/
theorem nash_equilibrium_exists {n : ℕ} {S : Fin n → Type*}
    [∀ i, Fintype (S i)] [∀ i, Nonempty (S i)]
    (u : Fin n → StrategyProfile n S → ℝ) :
    ∃ σ : ∀ i, S i → ℝ, IsNashEquilibrium u σ := by
  sorry
#59
Kakutani fixed-point theorem
kakutani_fixed_point

Lean theorem statement

/-- **Kakutani fixed-point theorem.** Every upper-hemicontinuous
correspondence `F` from a nonempty compact convex `K ⊆ ℝᵈ` to itself, with
nonempty convex closed values, has a fixed point `x ∈ F x`. -/
theorem kakutani_fixed_point {d : ℕ}
    {K : Set (EuclideanSpace ℝ (Fin d))}
    (_hK_compact : IsCompact K) (_hK_convex : Convex ℝ K)
    (_hK_nonempty : K.Nonempty)
    (F : EuclideanSpace ℝ (Fin d) → Set (EuclideanSpace ℝ (Fin d)))
    (_hF_uhc : IsUpperHemicontinuous F)
    (_hF_nonempty : ∀ x ∈ K, (F x).Nonempty)
    (_hF_convex : ∀ x ∈ K, Convex ℝ (F x))
    (_hF_closed : ∀ x ∈ K, IsClosed (F x))
    (_hF_maps : ∀ x ∈ K, F x ⊆ K) :
    ∃ x ∈ K, x ∈ F x := by
  sorry
#60
Balanceable k-bounded partitions
balanceable_bounded_partitions

Lean theorem statement

/--
For any `k`, the smallest `n` such that any `k`-bounded partition of `n` is
also balanceable is given by `2 * lcm(1, ..., k)`.
-/
theorem minimal_balanceable_of_bounded (k : ℕ) (hk : 0 < k) :
    Minimal (fun n => 0 < n ∧ ∀ p : n.Partition, Bounded k p → Balanceable p) (2 * (Finset.Icc 1 k).lcm id) := by
  sorry
#61
A competition programming problem about permuting a permutation to be unimodal
permute_to_unimodal

Lean theorem statement

/--
`minRearrange` correctly computes the smallest number of indices that need to be permuted in order to
turn `arr` into a unimodal permutation.
-/
theorem minRearrange_correct {arr : Array Nat} :
    arr.Perm (1...=arr.size).toArray →
      (∃ (x : Array Nat) (hx : x.Perm (1...=arr.size).toArray), Unimodal x ∧ differences (Vector.mk x (by simpa using hx.size_eq)) arr.toVector = minRearrange arr) ∧
      (∀ (x : Array Nat) (hx : x.Perm (1...=arr.size).toArray), Unimodal x → minRearrange arr ≤ differences (Vector.mk x (by simpa using hx.size_eq)) arr.toVector) := by
  sorry
#62
Hippocrates' theorem on lunes
hippocrates_lunes

Verso theorem preview

theorem declaration uses `sorry`hippocrates_lunes (a b : ℝ) (ha : 0 < a) (hb : 0 < b) : volume (LeanEval.Geometry.HippocratesLunes.horizontalLune a b) + volume (LeanEval.Geometry.HippocratesLunes.verticalLune a b) = volume (LeanEval.Geometry.HippocratesLunes.rightTriangle a b) := a:ℝb:ℝha:0 < ahb:0 < b⊢ volume (horizontalLune a b) + volume (verticalLune a b) = volume (rightTriangle a b) All goals completed! 🐙
#63
Schur-Weyl duality: S_k image equals centralizer of GL(V) image
symAction_range_eq_centralizer_glAction

Verso theorem preview

theorem declaration uses `sorry`symAction_range_eq_centralizer_glAction {R : Type*} [Field R] {M : Type*} [AddCommGroup M] [Module R M] [FiniteDimensional R M] {k : ℕ} [Invertible (k.factorial : R)] : Algebra.adjoin R (Set.range (LeanEval.RepresentationTheory.symAction R M k)) = Subalgebra.centralizer R (Set.range (LeanEval.RepresentationTheory.glAction R M k)) := R:Type u_1inst✝⁴:Field RM:Type u_2inst✝³:AddCommGroup Minst✝²:Module R Minst✝¹:FiniteDimensional R Mk:ℕinst✝:Invertible ↑k.factorial⊢ Algebra.adjoin R (Set.range ⇑(symAction R M k)) = Subalgebra.centralizer R (Set.range ⇑(glAction R M k)) All goals completed! 🐙
#64
Solvable extensions ↔ solvable groups (the missing converse in Abel–Ruffini)
solvable_by_radicals_converse

Lean theorem statement

/-- **Solvable extensions ↔ solvable groups.** For a field `F` of
characteristic zero and a nonzero `p : F[X]`, every root of `p` in
`AlgebraicClosure F` lies in `solvableByRad F (AlgebraicClosure F)`
iff `p.Gal` is solvable. -/
theorem solvable_iff_solvableByRad (F : Type*) [Field F] [CharZero F]
    (p : F[X]) (_hp : p ≠ 0) :
    (∀ x : AlgebraicClosure F, aeval x p = 0 →
        x ∈ solvableByRad F (AlgebraicClosure F)) ↔ Group.IsSolvable p.Gal := by
  sorry
#65
Sturm's theorem
sturm

Lean theorem statement

/-- **Sturm's theorem.** For a squarefree real polynomial `p` and an interval
`(a, b)` with `a < b` whose endpoints are not roots of `p`, the number of
distinct roots of `p` in `(a, b)` equals `σ(a) − σ(b)`. -/
theorem sturm (p : ℝ[X]) (hp : Squarefree p) {a b : ℝ} (hab : a < b)
    (ha : p.eval a ≠ 0) (hb : p.eval b ≠ 0) :
    ((p.roots.toFinset).filter (fun x => a < x ∧ x < b)).card =
      sigma p a - sigma p b := by
  sorry
#66
Monge–Kantorovich existence theorem
monge_kantorovich

Verso theorem preview

theorem declaration uses `sorry`monge_kantorovich_exists {X Y : Type*} [TopologicalSpace X] [PolishSpace X] [MeasurableSpace X] [BorelSpace X] [TopologicalSpace Y] [PolishSpace Y] [MeasurableSpace Y] [BorelSpace Y] (P : Measure X) (Q : Measure Y) [IsProbabilityMeasure P] [IsProbabilityMeasure Q] (c : X × Y → ENNReal) (_hc : Continuous c) : ∃ π ∈ LeanEval.Analysis.Couplings P Q, ∀ π' ∈ LeanEval.Analysis.Couplings P Q, kantorovichCost c π ≤ kantorovichCost c π' := X:Type u_1Y:Type u_2inst✝⁹:TopologicalSpace Xinst✝⁸:PolishSpace Xinst✝⁷:MeasurableSpace Xinst✝⁶:BorelSpace Xinst✝⁵:TopologicalSpace Yinst✝⁴:PolishSpace Yinst✝³:MeasurableSpace Yinst✝²:BorelSpace YP:Measure XQ:Measure Yinst✝¹:IsProbabilityMeasure Pinst✝:IsProbabilityMeasure Qc:X × Y → ENNReal_hc:Continuous c⊢ ∃ π ∈ Couplings P Q, ∀ π' ∈ Couplings P Q, kantorovichCost c π ≤ kantorovichCost c π' All goals completed! 🐙
#67
Lidskii–Last eigenvalue-perturbation theorem
lidskii_last

Verso theorem preview

theorem declaration uses `sorry`lidskii_last {n : Type*} [Fintype n] [DecidableEq n] {A B : Matrix n n ℂ} (hA : A.IsHermitian) (hB : B.IsHermitian) : ∑ j, |hA.eigenvalues₀ j - hB.eigenvalues₀ j| ≤ ∑ i, ∑ j, ‖A i j - B i j‖ := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℂB:Matrix n n ℂhA:A.IsHermitianhB:B.IsHermitian⊢ ∑ j, |hA.eigenvalues₀ j - hB.eigenvalues₀ j| ≤ ∑ i, ∑ j, ‖A i j - B i j‖ All goals completed! 🐙
#68
Furstenberg–Weiss topological multiple recurrence (single-transformation form)
furstenberg_topological

Lean theorem statement

/-- **Furstenberg–Weiss topological multiple recurrence** (single-
transformation form). Every homeomorphism `T` of a nonempty compact
metric space `X` has a multiply recurrent point. -/
theorem furstenberg_topological_recurrence {X : Type*} [MetricSpace X]
    [CompactSpace X] [Nonempty X] (T : X ≃ₜ X) :
    ∃ x : X, IsMultiplyRecurrent (T : X → X) x := by
  sorry
#69
Complete reducibility for compact groups
compact_group_semisimple

Verso theorem preview

theorem declaration uses `sorry`compact_group_semisimple {G V : Type*} [Group G] [TopologicalSpace G] [IsTopologicalGroup G] [CompactSpace G] [NormedAddCommGroup V] [NormedSpace ℝ V] [FiniteDimensional ℝ V] (ρ : Representation ℝ G V) (hρ : Continuous fun p : G × V => ρ p.1 p.2) : ρ.IsSemisimpleRepresentation := G:Type u_1V:Type u_2inst✝⁶:Group Ginst✝⁵:TopologicalSpace Ginst✝⁴:IsTopologicalGroup Ginst✝³:CompactSpace Ginst✝²:NormedAddCommGroup Vinst✝¹:NormedSpace ℝ Vinst✝:FiniteDimensional ℝ Vρ:Representation ℝ G Vhρ:Continuous fun p => (ρ p.1) p.2⊢ ρ.IsSemisimpleRepresentation All goals completed! 🐙
#70
Brauer–Fowler theorem
brauer_fowler

Lean theorem statement

/-- **Brauer–Fowler theorem.** There is a function bounding the order
of a finite nonabelian simple group by the order of any involution
centralizer. -/
theorem brauer_fowler :
    ∃ f : ℕ → ℕ, ∀ (G : Type) [Group G] [Finite G],
      IsSimpleGroup G → (∃ a b : G, a * b ≠ b * a) →
      ∀ t : G, orderOf t = 2 →
        Nat.card G ≤ f (Nat.card (Subgroup.centralizer ({t} : Set G))) := by
  sorry
#71
Schauder fixed-point theorem
schauder_fixed_point

Verso theorem preview

theorem declaration uses `sorry`schauder_fixed_point {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [CompleteSpace E] {K : Set E} (_hK_compact : IsCompact K) (_hK_convex : Convex ℝ K) (_hK_nonempty : K.Nonempty) (f : E → E) (_hf_cont : ContinuousOn f K) (_hf_maps : Set.MapsTo f K K) : ∃ x ∈ K, f x = x := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:CompleteSpace EK:Set E_hK_compact:IsCompact K_hK_convex:Convex ℝ K_hK_nonempty:K.Nonemptyf:E → E_hf_cont:ContinuousOn f K_hf_maps:Set.MapsTo f K K⊢ ∃ x ∈ K, f x = x All goals completed! 🐙
#72
Runge's theorem
runge_theorem

Verso theorem preview

theorem declaration uses `sorry`runge (K : Set ℂ) (_hK : IsCompact K) (U : Set ℂ) (_hU : IsOpen U) (_hKU : K ⊆ U) (f : ℂ → ℂ) (_hf : AnalyticOnNhd ℂ f U) (ε : ℝ) (_hε : 0 < ε) : ∃ p q : ℂ[X], (∀ z ∈ K, q.eval z ≠ 0) ∧ (∀ z ∈ K, ‖f z - p.eval z / q.eval z‖ < ε) := K:Set ℂ_hK:IsCompact KU:Set ℂ_hU:IsOpen U_hKU:K ⊆ Uf:ℂ → ℂ_hf:AnalyticOnNhd ℂ f Uε:ℝ_hε:0 < ε⊢ ∃ p q, (∀ z ∈ K, Polynomial.eval z q ≠ 0) ∧ ∀ z ∈ K, ‖f z - Polynomial.eval z p / Polynomial.eval z q‖ < ε All goals completed! 🐙
#73
Morley's trisector theorem
morley_theorem

Verso theorem preview

theorem declaration uses `sorry`morley_theorem (A B C P Q R : LeanEval.Geometry.Morley.Plane) (h : LeanEval.Geometry.Morley.IsMorleyConfiguration A B C P Q R) : LeanEval.Geometry.Morley.IsEquilateralTriple P Q R := A:PlaneB:PlaneC:PlaneP:PlaneQ:PlaneR:Planeh:IsMorleyConfiguration A B C P Q R⊢ IsEquilateralTriple P Q R All goals completed! 🐙
#74
Riesz's rising sun lemma
rising_sun_lemma

Verso theorem preview

theorem declaration uses `sorry`rising_sun_lemma {a b : ℝ} (hab : a < b) {f : ℝ → ℝ} (hf : ContinuousOn f (Icc a b)) : LeanEval.Analysis.RisingSun.HasRisingSunProperty a b f := a:ℝb:ℝhab:a < bf:ℝ → ℝhf:ContinuousOn f (Icc a b)⊢ HasRisingSunProperty a b f All goals completed! 🐙
#75
Existence of a non-isotopic pair of oriented two-component links
exists_nonisotopic_link

Verso theorem preview

theorem declaration uses `sorry`exists_nonisotopic_link : ∃ L₁ L₂ : LeanEval.KnotTheory.TwoLink, ¬ L₁.Isotopic L₂ := ⊢ ∃ L₁ L₂, ¬L₁.Isotopic L₂ All goals completed! 🐙
#76
Normal spectral theorem
normal_spectral_theorem

Verso theorem preview

theorem declaration uses `sorry`normal_spectral_theorem (A : Matrix n n ℂ) : IsStarNormal A ↔ ∃ U ∈ unitary (Matrix n n ℂ), ∃ d : n → ℂ, A = U * diagonal d * star U := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℂ⊢ IsStarNormal A ↔ ∃ U ∈ unitary (Matrix n n ℂ), ∃ d, A = U * diagonal d * star U All goals completed! 🐙
#77
Burnside p^a q^b theorem
finite_group_isSolvable_of_card_eq_prime_pow_mul_prime_pow

Verso theorem preview

theorem declaration uses `sorry`finite_group_isSolvable_of_card_eq_prime_pow_mul_prime_pow {G : Type*} [Group G] [Fintype G] {p q a b : ℕ} (hp : Nat.Prime p) (hq : Nat.Prime q) (hpq : p ≠ q) (hcard : Fintype.card G = p ^ a * q ^ b) : Group.IsSolvable G := G:Type u_1inst✝¹:Group Ginst✝:Fintype Gp:ℕq:ℕa:ℕb:ℕhp:Nat.Prime phq:Nat.Prime qhpq:p ≠ qhcard:Fintype.card G = p ^ a * q ^ b⊢ Group.IsSolvable G All goals completed! 🐙
#78
Pointwise and Cesàro convergence of Fourier series (Dirichlet, Fejér)
fourier_dirichlet_fejer

Verso theorem preview

/-- **Dirichlet's pointwise convergence theorem** (§46). For every `C¹` 2π-periodic complex function `f`, the symmetric Fourier partial sums `S_N(f)(x)` converge to `f(x)` at every point `x ∈ ℝ`. -/ theorem declaration uses `sorry`dirichlet_pointwise {f : ℝ → ℂ} (_hperiod : Function.Periodic f (2 * Real.pi)) (_hC1 : ContDiff ℝ 1 f) (x : ℝ) : Tendsto (fun N : ℕ => fourierPartialSum f N x) atTop (𝓝 (f x)) := f:ℝ → ℂ_hperiod:Function.Periodic f (2 * Real.pi)_hC1:ContDiff ℝ 1 fx:ℝ⊢ Tendsto (fun N => fourierPartialSum f N x) atTop (𝓝 (f x)) All goals completed! 🐙
/-- **Fejér's theorem** (§46). For every *continuous* 2π-periodic complex function `f` — without the `C¹` hypothesis of Dirichlet's theorem — the Cesàro means `σ_N(f)` of the symmetric Fourier partial sums converge to `f` uniformly on `ℝ`. -/ theorem declaration uses `sorry`fejer {f : ℝ → ℂ} (_hperiod : Function.Periodic f (2 * Real.pi)) (_hcont : Continuous f) : TendstoUniformly (fun N : ℕ => fourierCesaroMean f N) f atTop := f:ℝ → ℂ_hperiod:Function.Periodic f (2 * Real.pi)_hcont:Continuous f⊢ TendstoUniformly (fun N => fourierCesaroMean f N) f atTop All goals completed! 🐙
#79
Schur-Weyl duality: GL(V) image equals centralizer of S_k image
glAction_range_eq_centralizer_symAction

Verso theorem preview

theorem declaration uses `sorry`glAction_range_eq_centralizer_symAction {R : Type*} [Field R] {M : Type*} [AddCommGroup M] [Module R M] [FiniteDimensional R M] {k : ℕ} [Invertible (k.factorial : R)] : Algebra.adjoin R (Set.range (LeanEval.RepresentationTheory.glAction R M k)) = Subalgebra.centralizer R (Set.range (LeanEval.RepresentationTheory.symAction R M k)) := R:Type u_1inst✝⁴:Field RM:Type u_2inst✝³:AddCommGroup Minst✝²:Module R Minst✝¹:FiniteDimensional R Mk:ℕinst✝:Invertible ↑k.factorial⊢ Algebra.adjoin R (Set.range ⇑(glAction R M k)) = Subalgebra.centralizer R (Set.range ⇑(symAction R M k)) All goals completed! 🐙
#80
Euler–Lagrange equation
euler_lagrange_equation

Verso theorem preview

theorem declaration uses `sorry`euler_lagrange_equation {a b : ℝ} (L : ℝ → ℝ → ℝ → ℝ) (x : ℝ → ℝ) (_hab : a < b) (_hL : ContDiff ℝ 2 (fun p : ℝ × ℝ × ℝ => L p.1 p.2.1 p.2.2)) (_hx : ContDiff ℝ 2 x) (_hxe : LeanEval.Analysis.IsVariationalExtremum a b L x) : ∀ t ∈ Set.Ioo a b, lagrangianPartialX L x t = deriv (lagrangianPartialV L x) t := a:ℝb:ℝL:ℝ → ℝ → ℝ → ℝx:ℝ → ℝ_hab:a < b_hL:ContDiff ℝ 2 fun p => L p.1 p.2.1 p.2.2_hx:ContDiff ℝ 2 x_hxe:IsVariationalExtremum a b L x⊢ ∀ t ∈ Ioo a b, lagrangianPartialX L x t = deriv (lagrangianPartialV L x) t All goals completed! 🐙
#81
Kuznetsov's theorem: finitely presented simple groups have solvable word problem
boone_higman_simple

Verso theorem preview

theorem declaration uses `sorry`boone_higman_simple {G : Type*} [Group G] [IsSimpleGroup G] {n : ℕ} (φ : FreeGroup (Fin n) →* G) (_hsurj : Function.Surjective φ) (_hker : (MonoidHom.ker φ).IsFinitelyNormallyGenerated) : LeanEval.GroupTheory.BooneHigmanSimpleProblem.WordProblemSolvable φ := G:Type u_1inst✝¹:Group Ginst✝:IsSimpleGroup Gn:ℕφ:FreeGroup (Fin n) →* G_hsurj:Function.Surjective ⇑φ_hker:φ.ker.IsFinitelyNormallyGenerated⊢ WordProblemSolvable φ All goals completed! 🐙
#82
Bauer's uniqueness at extreme points
bauer_extreme_point_uniqueness

Verso theorem preview

theorem declaration uses `sorry`bauer_unique [MeasurableSpace X] [BorelSpace X] (K : Set X) (hK_cpt : IsCompact K) (hK_cvx : Convex ℝ K) {x : X} (hx : x ∈ K.extremePoints ℝ) (μ : Measure X) [IsProbabilityMeasure μ] (hμ : μ Kᶜ = 0) (hbar : x = ∫ y, y ∂μ) : μ = Measure.dirac x := X:Type u_1inst✝⁵:NormedAddCommGroup Xinst✝⁴:NormedSpace ℝ Xinst✝³:CompleteSpace Xinst✝²:MeasurableSpace Xinst✝¹:BorelSpace XK:Set XhK_cpt:IsCompact KhK_cvx:Convex ℝ Kx:Xhx:x ∈ Set.extremePoints ℝ Kμ:Measure Xinst✝:IsProbabilityMeasure μhμ:μ Kᶜ = 0hbar:x = ∫ (y : X), y ∂μ⊢ μ = Measure.dirac x All goals completed! 🐙
#83
Bing's house with two rooms is contractible
contractibleSpace_houseWithTwoRooms

Verso theorem preview

theorem declaration uses `sorry`contractibleSpace_houseWithTwoRooms : ContractibleSpace LeanEval.Topology.HouseWithTwoRooms := ⊢ ContractibleSpace ↑HouseWithTwoRooms All goals completed! 🐙
#84
Brouwer fixed-point theorem
brouwer_fixed_point

Verso theorem preview

theorem declaration uses `sorry`brouwer_fixed_point {d : ℕ} {K : Set (EuclideanSpace ℝ (Fin d))} (_hK_compact : IsCompact K) (_hK_convex : Convex ℝ K) (_hK_nonempty : K.Nonempty) (f : EuclideanSpace ℝ (Fin d) → EuclideanSpace ℝ (Fin d)) (_hf_cont : ContinuousOn f K) (_hf_maps : MapsTo f K K) : ∃ x ∈ K, f x = x := d:ℕK:Set (EuclideanSpace ℝ (Fin d))_hK_compact:IsCompact K_hK_convex:Convex ℝ K_hK_nonempty:K.Nonemptyf:EuclideanSpace ℝ (Fin d) → EuclideanSpace ℝ (Fin d)_hf_cont:ContinuousOn f K_hf_maps:MapsTo f K K⊢ ∃ x ∈ K, f x = x All goals completed! 🐙
#85
Abel–Ruffini theorem
abel_ruffini

Verso theorem preview

theorem declaration uses `sorry`abel_ruffini (n : ℕ) (_hn : 1 ≤ n) : (∀ p : ℚ[X], p.natDegree = n → ∀ x : ℂ, aeval x p = 0 → x ∈ solvableByRad ℚ ℂ) ↔ n ≤ 4 := n:ℕ_hn:1 ≤ n⊢ (∀ (p : ℚ[X]), p.natDegree = n → ∀ (x : ℂ), (aeval x) p = 0 → x ∈ solvableByRad ℚ ℂ) ↔ n ≤ 4 All goals completed! 🐙
#86
von Neumann double commutant theorem
vonNeumann_doubleCommutant_tfae

Verso theorem preview

theorem declaration uses `sorry`vonNeumann_doubleCommutant_tfae {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H] (S : StarSubalgebra ℂ (H →L[ℂ] H)) : List.TFAE [ Set.centralizer (Set.centralizer (S : Set (H →L[ℂ] H))) = S , IsClosed (ContinuousLinearMapWOT.ofCLM '' (S : Set (H →L[ℂ] H))) , IsClosed (ContinuousLinearMap.toPointwiseConvergenceCLM ℂ (RingHom.id ℂ) H H '' (S : Set (H →L[ℂ] H))) ] := H:Type u_1inst✝²:NormedAddCommGroup Hinst✝¹:InnerProductSpace ℂ Hinst✝:CompleteSpace HS:StarSubalgebra ℂ (H →L[ℂ] H)⊢ [(↑S).centralizer.centralizer = ↑S, IsClosed (ContinuousLinearMapWOT.ofCLM '' ↑S), IsClosed (⇑(ContinuousLinearMap.toPointwiseConvergenceCLM ℂ (RingHom.id ℂ) H H) '' ↑S)].TFAE All goals completed! 🐙
#87
Wiener's atom-detection formula
wiener_atom_detection

Verso theorem preview

theorem declaration uses `sorry`wiener_atom_detection (μ : Measure (AddCircle (2 * Real.pi))) [IsProbabilityMeasure μ] : Tendsto (fun N : ℕ => (1 / (N : ℝ)) * ∑ k ∈ Finset.Icc (1 : ℤ) N, ‖fourierCoeffMeasure μ k‖ ^ 2) atTop (𝓝 (∑' x : AddCircle (2 * Real.pi), ((μ {x}).toReal) ^ 2)) := μ:Measure (AddCircle (2 * π))inst✝:IsProbabilityMeasure μ⊢ Tendsto (fun N => 1 / ↑N * ∑ k ∈ Finset.Icc 1 ↑N, ‖fourierCoeffMeasure μ k‖ ^ 2) atTop (𝓝 (∑' (x : AddCircle (2 * π)), (μ {x}).toReal ^ 2)) All goals completed! 🐙
#88
Trace Cayley-Hamilton / Newton identity
trace_cayley_hamilton_newton

Verso theorem preview

theorem declaration uses `sorry`trace_cayley_hamilton_newton {R : Type*} [CommRing R] (A : Matrix n n R) {k : ℕ} (hk : 1 ≤ k) : (k : R) * charpolyDescendingCoeff A k + ∑ j ∈ Finset.Icc 1 k, trace (A ^ j) * charpolyDescendingCoeff A (k - j) = 0 := n:Type u_1inst✝²:Fintype ninst✝¹:DecidableEq nR:Type u_2inst✝:CommRing RA:Matrix n n Rk:ℕhk:1 ≤ k⊢ ↑k * charpolyDescendingCoeff A k + ∑ j ∈ Finset.Icc 1 k, (A ^ j).trace * charpolyDescendingCoeff A (k - j) = 0 All goals completed! 🐙
#89
Linear ODE with negative-real-part eigenvalues is asymptotically stable
linear_ode_asymptotic_stability

Verso theorem preview

theorem declaration uses `sorry`linear_ode_asymptotic_stability (n : ℕ) (A : Matrix (Fin n) (Fin n) ℝ) (hA : ∀ μ : ℂ, Module.End.HasEigenvalue (Matrix.toLin' (A.map (algebraMap ℝ ℂ))) μ → μ.re < 0) (x : ℝ → (Fin n → ℝ)) (hx : ∀ t : ℝ, 0 < t → HasDerivAt x (A.mulVec (x t)) t) : Filter.Tendsto (fun t : ℝ => ‖x t‖) Filter.atTop (nhds 0) := n:ℕA:Matrix (Fin n) (Fin n) ℝhA:∀ (μ : ℂ), Module.End.HasEigenvalue (Matrix.toLin' (A.map ⇑(algebraMap ℝ ℂ))) μ → μ.re < 0x:ℝ → Fin n → ℝhx:∀ (t : ℝ), 0 < t → HasDerivAt x (A *ᵥ x t) t⊢ Filter.Tendsto (fun t => ‖x t‖) Filter.atTop (nhds 0) All goals completed! 🐙
#90
Real cyclotomic integer with house at most 2
cyclotomic_integer_house_le_two

Verso theorem preview

theorem declaration uses `sorry`cyclotomic_integer_house_le_two {K : Type*} [Field K] [NumberField K] [Algebra ℚ K] (n : ℕ) [NeZero n] [IsCyclotomicExtension {n} ℚ K] {β : K} (hβ_int : IsIntegral ℤ β) (hβ_real : β ∈ NumberField.maximalRealSubfield K) : house β ≤ 2 → house β = 2 ∨ ∃ m : ℕ, 0 < m ∧ house β = 2 * Real.cos (Real.pi / m) := K:Type u_1inst✝⁴:Field Kinst✝³:NumberField Kinst✝²:Algebra ℚ Kn:ℕinst✝¹:NeZero ninst✝:IsCyclotomicExtension {n} ℚ Kβ:Khβ_int:IsIntegral ℤ βhβ_real:β ∈ maximalRealSubfield K⊢ house β ≤ 2 → house β = 2 ∨ ∃ m, 0 < m ∧ house β = 2 * Real.cos (Real.pi / ↑m) All goals completed! 🐙
#91
Koszul formula
koszul_formula

Verso theorem preview

theorem declaration uses `sorry`koszul_formula {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] [CompleteSpace E] {H : Type*} [TopologicalSpace H] {I : ModelWithCorners ℝ E H} {M : Type*} [TopologicalSpace M] [ChartedSpace H M] [IsManifold I ∞ M] [RiemannianBundle (fun (x : M) ↦ TangentSpace I x)] [IsContMDiffRiemannianBundle I ∞ E (fun (x : M) ↦ TangentSpace I x)] (cov : CovariantDerivative I E (TangentSpace I (M := M))) [ContMDiffCovariantDerivative cov ∞] (_htor : cov.torsion = 0) (_hmet : LeanEval.Geometry.KoszulFormula.IsMetricCompatible cov) (X Y Z : Π x : M, TangentSpace I x) (_hX : CMDiff ∞ (T% X)) (_hY : CMDiff ∞ (T% Y)) (_hZ : CMDiff ∞ (T% Z)) (x : M) : 2 * inner ℝ (cov Y x (X x)) (Z x) = mvfderiv I (fun y : M => inner ℝ (Y y) (Z y)) x (X x) + mvfderiv I (fun y : M => inner ℝ (X y) (Z y)) x (Y x) - mvfderiv I (fun y : M => inner ℝ (X y) (Y y)) x (Z x) - inner ℝ (X x) (mlieBracket I Y Z x) - inner ℝ (Y x) (mlieBracket I X Z x) + inner ℝ (Z x) (mlieBracket I X Y x) := E:Type u_1inst✝¹⁰:NormedAddCommGroup Einst✝⁹:NormedSpace ℝ Einst✝⁸:FiniteDimensional ℝ Einst✝⁷:CompleteSpace EH:Type u_2inst✝⁶:TopologicalSpace HI:ModelWithCorners ℝ E HM:Type u_3inst✝⁵:TopologicalSpace Minst✝⁴:ChartedSpace H Minst✝³:IsManifold I ∞ Minst✝²:RiemannianBundle fun x => TangentSpace I xinst✝¹:IsContMDiffRiemannianBundle I ∞ E fun x => TangentSpace I xcov:CovariantDerivative I E (TangentSpace I)inst✝:cov.ContMDiffCovariantDerivative ∞_htor:cov.torsion = 0_hmet:LeanEval.Geometry.KoszulFormula.IsMetricCompatible covX:(x : M) → TangentSpace I xY:(x : M) → TangentSpace I xZ:(x : M) → TangentSpace I x_hX:ContMDiff I I.tangent ∞ (T% X)_hY:ContMDiff I I.tangent ∞ (T% Y)_hZ:ContMDiff I I.tangent ∞ (T% Z)x:M⊢ 2 * Inner.inner ℝ ((↑cov Y x) (X x)) (Z x) = ((d% fun y => Inner.inner ℝ (Y y) (Z y)) x) (X x) + ((d% fun y => Inner.inner ℝ (X y) (Z y)) x) (Y x) - ((d% fun y => Inner.inner ℝ (X y) (Y y)) x) (Z x) - Inner.inner ℝ (X x) (mlieBracket I Y Z x) - Inner.inner ℝ (Y x) (mlieBracket I X Z x) + Inner.inner ℝ (Z x) (mlieBracket I X Y x) All goals completed! 🐙
#92
Complementary polynomial on the unit circle
exists_complementary_polynomial_on_unit_circle

Verso theorem preview

theorem declaration uses `sorry`exists_complementary_polynomial_on_unit_circle (P : ℂ[X]) (hP : ∀ z : Circle, ‖P.eval (z : ℂ)‖ ≤ 1) : ∃ Q : ℂ[X], Q.natDegree ≤ P.natDegree ∧ ∀ z : Circle, ‖P.eval (z : ℂ)‖ ^ 2 + ‖Q.eval (z : ℂ)‖ ^ 2 = 1 := P:ℂ[X]hP:∀ (z : Circle), ‖eval (↑z) P‖ ≤ 1⊢ ∃ Q, Q.natDegree ≤ P.natDegree ∧ ∀ (z : Circle), ‖eval (↑z) P‖ ^ 2 + ‖eval (↑z) Q‖ ^ 2 = 1 All goals completed! 🐙
#93
Linear programming: maximum principle and vertex optimality
lp_maximum_principle

Verso theorem preview

/-- **Maximum principle for linear programming** (§101). A local maximiser of the LP objective on the feasible region is automatically a global maximiser; and whenever the objective is non-constant (`c ≠ 0`), the maximiser lies on the topological frontier of the feasible region. -/ theorem declaration uses `sorry`lp_maximum_principle {m n : ℕ} (lp : LinearProgram m n) (x : Fin m → ℝ) (_hx : x ∈ lp.feasible) (_hlocal : IsLocalMaxOn lp.objective lp.feasible x) : IsMaxOn lp.objective lp.feasible x ∧ (lp.c ≠ 0 → x ∈ frontier lp.feasible) := m:ℕn:ℕlp:LinearProgram m nx:Fin m → ℝ_hx:x ∈ lp.feasible_hlocal:IsLocalMaxOn lp.objective lp.feasible x⊢ IsMaxOn lp.objective lp.feasible x ∧ (lp.c ≠ 0 → x ∈ frontier lp.feasible) All goals completed! 🐙
/-- **Vertex optimality** (§101; the existence content of Dantzig's 1947 simplex algorithm). Every linear program with a nonempty bounded feasible region admits a global maximiser that is an extreme point (vertex) of the feasible region. -/ theorem declaration uses `sorry`simplex_algorithm {m n : ℕ} (lp : LinearProgram m n) (_hfeas : lp.feasible.Nonempty) (_hbdd : Bornology.IsBounded lp.feasible) : ∃ x ∈ lp.feasible, IsMaxOn lp.objective lp.feasible x ∧ x ∈ Set.extremePoints ℝ lp.feasible := m:ℕn:ℕlp:LinearProgram m n_hfeas:lp.feasible.Nonempty_hbdd:Bornology.IsBounded lp.feasible⊢ ∃ x ∈ lp.feasible, IsMaxOn lp.objective lp.feasible x ∧ x ∈ Set.extremePoints ℝ lp.feasible All goals completed! 🐙
#94
Symplectic matrices have determinant 1
symplectic_matrix_det

Verso theorem preview

theorem declaration uses `sorry`symplectic_matrix_det {l R : Type*} [DecidableEq l] [Fintype l] [CommRing R] {A : Matrix (l ⊕ l) (l ⊕ l) R} (_hA : A ∈ Matrix.symplecticGroup l R) : A.det = 1 := l:Type u_1R:Type u_2inst✝²:DecidableEq linst✝¹:Fintype linst✝:CommRing RA:Matrix (l ⊕ l) (l ⊕ l) R_hA:A ∈ symplecticGroup l R⊢ A.det = 1 All goals completed! 🐙
#95
Rouche theorem via zero counting
rouche_zero_count_eq

Verso theorem preview

theorem declaration uses `sorry`rouche_zero_count_eq {f g : ℂ → ℂ} {R : ℝ} (hR : 0 < R) (hf : MeromorphicNFOn f Set.univ) (hg : AnalyticOn ℂ g Set.univ) (hbound : ∀ z : ℂ, ‖z‖ = R → ‖g z‖ < ‖f z‖) : (∑ᶠ z, ((divisor (f + g) (Metric.closedBall 0 R))⁺) z) = (∑ᶠ z, ((divisor f (Metric.closedBall 0 R))⁺) z) := f:ℂ → ℂg:ℂ → ℂR:ℝhR:0 < Rhf:MeromorphicNFOn f Set.univhg:AnalyticOn ℂ g Set.univhbound:∀ (z : ℂ), ‖z‖ = R → ‖g z‖ < ‖f z‖⊢ ∑ᶠ (z : ℂ), (divisor (f + g) (Metric.closedBall 0 R))⁺ z = ∑ᶠ (z : ℂ), (divisor f (Metric.closedBall 0 R))⁺ z All goals completed! 🐙
#96
Perron-Frobenius for irreducible nonnegative matrices
irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius

Verso theorem preview

theorem declaration uses `sorry`irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius {n : Type*} [Fintype n] [DecidableEq n] [Nonempty n] (A : Matrix n n ℝ) (hA : A.IsIrreducible) : ∃ v : n → ℝ, Module.End.HasEigenvector (Matrix.toLin' A) (spectralRadius ℝ A).toReal v ∧ (∀ i, 0 < v i) := n:Type u_1inst✝²:Fintype ninst✝¹:DecidableEq ninst✝:Nonempty nA:Matrix n n ℝhA:A.IsIrreducible⊢ ∃ v, Module.End.HasEigenvector (Matrix.toLin' A) (spectralRadius ℝ A).toReal v ∧ ∀ (i : n), 0 < v i All goals completed! 🐙
#97
Pell solutions are convergents of √d
pell_solution_convergent

Verso theorem preview

theorem declaration uses `sorry`pell_solution_is_convergent (d : ℤ) (_hd : Squarefree d) (_hd0 : 0 < d) (x y : ℤ) (_hx : 0 < x) (_hy : 0 < y) (_hsol : x ^ 2 - d * y ^ 2 = 1) : ∃ n : ℕ, (GenContFract.of (Real.sqrt (d : ℝ))).convs n = (x : ℝ) / (y : ℝ) := d:ℤ_hd:Squarefree d_hd0:0 < dx:ℤy:ℤ_hx:0 < x_hy:0 < y_hsol:x ^ 2 - d * y ^ 2 = 1⊢ ∃ n, (GenContFract.of √↑d).convs n = ↑x / ↑y All goals completed! 🐙
#98
Bourbaki's locally convex extension of Banach–Alaoglu
banach_alaoglu_bourbaki

Verso theorem preview

theorem declaration uses `sorry`banach_alaoglu_bourbaki (E : Type*) [AddCommGroup E] [Module ℝ E] [TopologicalSpace E] [ContinuousAdd E] [ContinuousSMul ℝ E] [LocallyConvexSpace ℝ E] (U : Set E) (_hU : U ∈ 𝓝 (0 : E)) : IsCompact (LeanEval.Analysis.weakStarPolar E U) := E:Type u_1inst✝⁵:AddCommGroup Einst✝⁴:Module ℝ Einst✝³:TopologicalSpace Einst✝²:ContinuousAdd Einst✝¹:ContinuousSMul ℝ Einst✝:LocallyConvexSpace ℝ EU:Set E_hU:U ∈ 𝓝 0⊢ IsCompact (weakStarPolar E U) All goals completed! 🐙
#99
Gaussian heat kernel solves the 1D heat equation
heat_kernel_solves_heat_equation

Verso theorem preview

theorem declaration uses `sorry`heat_kernel_solves_heat_equation (f : ℝ → ℝ) (hf_cont : Continuous f) (hf_bdd : ∃ M : ℝ, ∀ x, |f x| ≤ M) : -- The PDE on (0, ∞) × ℝ. (∀ t : ℝ, 0 < t → ∀ x : ℝ, ∃ ux : ℝ → ℝ, ∃ uxx : ℝ, (∀ y : ℝ, HasDerivAt (fun z => heatSolution f t z) (ux y) y) ∧ HasDerivAt ux uxx x ∧ HasDerivAt (fun s => heatSolution f s x) uxx t) ∧ -- Initial condition recovered as a one-sided limit at t = 0. (∀ x : ℝ, Filter.Tendsto (fun t : ℝ => heatSolution f t x) (nhdsWithin (0 : ℝ) (Set.Ioi 0)) (nhds (f x))) := f:ℝ → ℝhf_cont:Continuous fhf_bdd:∃ M, ∀ (x : ℝ), |f x| ≤ M⊢ (∀ (t : ℝ), 0 < t → ∀ (x : ℝ), ∃ ux uxx, (∀ (y : ℝ), HasDerivAt (fun z => heatSolution f t z) (ux y) y) ∧ HasDerivAt ux uxx x ∧ HasDerivAt (fun s => heatSolution f s x) uxx t) ∧ ∀ (x : ℝ), Filter.Tendsto (fun t => heatSolution f t x) (nhdsWithin 0 (Set.Ioi 0)) (nhds (f x)) All goals completed! 🐙
#100
Minkowski-Caratheodory theorem
mem_convexHull_finset_extremePoints_of_mem_compact_convex

Verso theorem preview

theorem declaration uses `sorry`mem_convexHull_finset_extremePoints_of_mem_compact_convex {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] {s : Set E} {x : E} (hscomp : IsCompact s) (hsconv : Convex ℝ s) (hx : x ∈ s) : ∃ t : Finset E, (↑t : Set E) ⊆ s.extremePoints ℝ ∧ t.card ≤ Module.finrank ℝ E + 1 ∧ x ∈ convexHull ℝ (↑t : Set E) := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:FiniteDimensional ℝ Es:Set Ex:Ehscomp:IsCompact shsconv:Convex ℝ shx:x ∈ s⊢ ∃ t, ↑t ⊆ extremePoints ℝ s ∧ t.card ≤ Module.finrank ℝ E + 1 ∧ x ∈ (convexHull ℝ) ↑t All goals completed! 🐙
#101
Oppenheim's inequality for Hadamard products
oppenheim_inequality

Verso theorem preview

theorem declaration uses `sorry`oppenheim_inequality {n : Type*} [Fintype n] [DecidableEq n] {A B : Matrix n n ℝ} (hA : A.PosSemidef) (hB : B.PosSemidef) : A.det * ∏ i, B i i ≤ (A ⊙ B).det := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℝB:Matrix n n ℝhA:A.PosSemidefhB:B.PosSemidef⊢ A.det * ∏ i, B i i ≤ (A ⊙ B).det All goals completed! 🐙
#102
pi_1 of the circle is Z
pi1_circle_mulEquiv_int

Verso theorem preview

theorem declaration uses `sorry`pi1_circle_mulEquiv_int : Nonempty (HomotopyGroup.Pi 1 Circle (1 : Circle) ≃* Multiplicative ℤ) := ⊢ Nonempty (HomotopyGroup.Pi 1 Circle 1 ≃* Multiplicative ℤ) All goals completed! 🐙
#103
Character values of finite groups lie in cyclotomic fields
brauer_character_in_cyclotomic

Verso theorem preview

theorem declaration uses `sorry`brauer_character_in_cyclotomic (G : Type) [Group G] [Fintype G] : ∃ φ : CyclotomicField (Monoid.exponent G) ℚ →+* ℂ, ∀ (V : Type) (_ : AddCommGroup V) (_ : Module ℂ V) (_ : FiniteDimensional ℂ V) (ρ : Representation ℂ G V) (g : G), LinearMap.trace ℂ V (ρ g) ∈ φ.range := G:Typeinst✝¹:Group Ginst✝:Fintype G⊢ ∃ φ, ∀ (V : Type) (x : AddCommGroup V) (x_1 : Module ℂ V), FiniteDimensional ℂ V → ∀ (ρ : Representation ℂ G V) (g : G), (LinearMap.trace ℂ V) (ρ g) ∈ φ.range All goals completed! 🐙
#104
Entrywise exponential of a PSD matrix is PSD
posSemidef_map_exp

Verso theorem preview

theorem declaration uses `sorry`posSemidef_map_exp {n : Type*} [Fintype n] [DecidableEq n] {A : Matrix n n ℝ} (hA : A.PosSemidef) : (A.map Real.exp).PosSemidef := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℝhA:A.PosSemidef⊢ (A.map Real.exp).PosSemidef All goals completed! 🐙
#105
Sturm separation theorem
sturm_separation

Verso theorem preview

theorem declaration uses `sorry`sturm_separation (p q y₁ y₂ : ℝ → ℝ) (a b : ℝ) (hab : a < b) (J : Set ℝ) (hJ_open : IsOpen J) (hJ_conn : IsPreconnected J) (hJ_sub : Set.Icc a b ⊆ J) (hp : ContinuousOn p J) (hq : ContinuousOn q J) (hy₁ : ∀ x ∈ J, HasDerivAt y₁ (deriv y₁ x) x) (hy₁' : ∀ x ∈ J, HasDerivAt (deriv y₁) (-(p x * deriv y₁ x + q x * y₁ x)) x) (hy₂ : ∀ x ∈ J, HasDerivAt y₂ (deriv y₂ x) x) (hy₂' : ∀ x ∈ J, HasDerivAt (deriv y₂) (-(p x * deriv y₂ x + q x * y₂ x)) x) (hW : ∃ x₀ ∈ J, y₁ x₀ * deriv y₂ x₀ - y₂ x₀ * deriv y₁ x₀ ≠ 0) (hza : y₁ a = 0) (hzb : y₁ b = 0) (hne : ∀ x ∈ Set.Ioo a b, y₁ x ≠ 0) : ∃! c, c ∈ Set.Ioo a b ∧ y₂ c = 0 := p:ℝ → ℝq:ℝ → ℝy₁:ℝ → ℝy₂:ℝ → ℝa:ℝb:ℝhab:a < bJ:Set ℝhJ_open:IsOpen JhJ_conn:IsPreconnected JhJ_sub:Set.Icc a b ⊆ Jhp:ContinuousOn p Jhq:ContinuousOn q Jhy₁:∀ x ∈ J, HasDerivAt y₁ (deriv y₁ x) xhy₁':∀ x ∈ J, HasDerivAt (deriv y₁) (-(p x * deriv y₁ x + q x * y₁ x)) xhy₂:∀ x ∈ J, HasDerivAt y₂ (deriv y₂ x) xhy₂':∀ x ∈ J, HasDerivAt (deriv y₂) (-(p x * deriv y₂ x + q x * y₂ x)) xhW:∃ x₀ ∈ J, y₁ x₀ * deriv y₂ x₀ - y₂ x₀ * deriv y₁ x₀ ≠ 0hza:y₁ a = 0hzb:y₁ b = 0hne:∀ x ∈ Set.Ioo a b, y₁ x ≠ 0⊢ ∃! c, c ∈ Set.Ioo a b ∧ y₂ c = 0 All goals completed! 🐙
#106
Dirichlet eigenvalues of -y'' = lambda y on [0,pi] are n^2
dirichlet_eigenvalues_eq_nat_sq

Verso theorem preview

theorem declaration uses `sorry`dirichlet_eigenvalues_eq_nat_sq (lam : ℝ) : (∃ (y : ℝ → ℝ) (J : Set ℝ), IsOpen J ∧ Set.Icc (0 : ℝ) Real.pi ⊆ J ∧ (∀ x ∈ J, HasDerivAt y (deriv y x) x) ∧ (∀ x ∈ J, HasDerivAt (deriv y) (-(lam * y x)) x) ∧ y 0 = 0 ∧ y Real.pi = 0 ∧ ∃ x ∈ Set.Ioo (0 : ℝ) Real.pi, y x ≠ 0) ↔ ∃ n : ℕ, 0 < n ∧ lam = (n : ℝ) ^ 2 := lam:ℝ⊢ (∃ y J, IsOpen J ∧ Set.Icc 0 π ⊆ J ∧ (∀ x ∈ J, HasDerivAt y (deriv y x) x) ∧ (∀ x ∈ J, HasDerivAt (deriv y) (-(lam * y x)) x) ∧ y 0 = 0 ∧ y π = 0 ∧ ∃ x ∈ Set.Ioo 0 π, y x ≠ 0) ↔ ∃ n, 0 < n ∧ lam = ↑n ^ 2 All goals completed! 🐙
#107
Polynomial decay rate of y' = -y^3
cubic_decay_asymptotic

Verso theorem preview

theorem declaration uses `sorry`cubic_decay_asymptotic (y : ℝ → ℝ) (hy_diff : ∀ t : ℝ, 0 < t → HasDerivAt y (-(y t) ^ 3) t) (hy_cont : ContinuousWithinAt y (Set.Ici 0) 0) (hy0 : y 0 = 1) : Tendsto (fun t : ℝ => y t * Real.sqrt t) atTop (𝓝 (1 / Real.sqrt 2)) := y:ℝ → ℝhy_diff:∀ (t : ℝ), 0 < t → HasDerivAt y (-y t ^ 3) thy_cont:ContinuousWithinAt y (Set.Ici 0) 0hy0:y 0 = 1⊢ Tendsto (fun t => y t * √t) atTop (𝓝 (1 / √2)) All goals completed! 🐙
#108
Comparison principle for the Dirichlet BVP
bvp_comparison

Verso theorem preview

theorem declaration uses `sorry`bvp_comparison (J : Set ℝ) (hJ_open : IsOpen J) (hJ_sub : Set.Icc (0 : ℝ) 1 ⊆ J) (u v : ℝ → ℝ) (hu : ∀ x ∈ J, HasDerivAt u (deriv u x) x) (hu' : ∀ x ∈ J, HasDerivAt (deriv u) (deriv (deriv u) x) x) (hv : ∀ x ∈ J, HasDerivAt v (deriv v x) x) (hv' : ∀ x ∈ J, HasDerivAt (deriv v) (deriv (deriv v) x) x) (hineq : ∀ x ∈ Set.Ioo (0 : ℝ) 1, -deriv (deriv u) x ≤ -deriv (deriv v) x) (hu0 : u 0 ≤ v 0) (hu1 : u 1 ≤ v 1) : ∀ x ∈ Set.Icc (0 : ℝ) 1, u x ≤ v x := J:Set ℝhJ_open:IsOpen JhJ_sub:Set.Icc 0 1 ⊆ Ju:ℝ → ℝv:ℝ → ℝhu:∀ x ∈ J, HasDerivAt u (deriv u x) xhu':∀ x ∈ J, HasDerivAt (deriv u) (deriv (deriv u) x) xhv:∀ x ∈ J, HasDerivAt v (deriv v x) xhv':∀ x ∈ J, HasDerivAt (deriv v) (deriv (deriv v) x) xhineq:∀ x ∈ Set.Ioo 0 1, -deriv (deriv u) x ≤ -deriv (deriv v) xhu0:u 0 ≤ v 0hu1:u 1 ≤ v 1⊢ ∀ x ∈ Set.Icc 0 1, u x ≤ v x All goals completed! 🐙
#109
Cayley graph connected iff generators generate the group
mulCayley_connected_iff_closure_eq_top

Verso theorem preview

theorem declaration uses `sorry`mulCayley_connected_iff_closure_eq_top {G : Type*} [Group G] (S : Set G) : (SimpleGraph.mulCayley S).Connected ↔ Subgroup.closure S = ⊤ := G:Type u_1inst✝:Group GS:Set G⊢ (SimpleGraph.mulCayley S).Connected ↔ Subgroup.closure S = ⊤ All goals completed! 🐙
#110
Finite Ramsey theorem for graphs
finite_graph_ramsey_theorem

Verso theorem preview

theorem declaration uses `sorry`finite_graph_ramsey_theorem : ∀ r s : ℕ, 2 ≤ r → 2 ≤ s → ∃ n : ℕ, ∀ G : SimpleGraph (Fin n), ¬ G.CliqueFree r ∨ ¬ Gᶜ.CliqueFree s := ⊢ ∀ (r s : ℕ), 2 ≤ r → 2 ≤ s → ∃ n, ∀ (G : SimpleGraph (Fin n)), ¬G.CliqueFree r ∨ ¬Gᶜ.CliqueFree s All goals completed! 🐙
#111
Catalan generating function via compositional inversion
substInv_X_sub_X_sq_eq_catalan

Verso theorem preview

theorem declaration uses `sorry`substInv_X_sub_X_sq_eq_catalan (n : ℕ) : haveI : Invertible (coeff 1 ((X : ℚ⟦X⟧) - X ^ 2)) := n:ℕ⊢ Invertible ((coeff 1) (X - X ^ 2)) n:ℕ⊢ Invertible 1; All goals completed! 🐙 coeff (n + 1) (substInv ((X : ℚ⟦X⟧) - X ^ 2)) = (Nat.choose (2 * n) n : ℚ) / (↑n + 1) := n:ℕ⊢ (coeff (n + 1)) (X - X ^ 2).substInv = ↑((2 * n).choose n) / (↑n + 1) All goals completed! 🐙
#112
First submissionJul 9, 2026
Last submissionJul 21, 2026
Morgan-Griffiths111eohjelle3
7Stealth Model104 solved
Morrison–Walker Lemma B.0.1: adapting families of maps to open covers
families_of_maps_b01

Verso theorem preview

/-- **Lemma B.0.1** of Morrison–Walker, *The Blob Complex* (arXiv:1009.5025, §B), continuous case. -/ theorem declaration uses `sorry`continuous {P : Set (Fin k → ℝ)} (_hP : IsPolyhedron P) [CompactSpace X] (U : ι → Set X) (_hUopen : ∀ α, IsOpen (U α)) (ρ : PartitionOfUnity ι X univ) (_hρ : ρ.IsSubordinate U) (f : C(P × X, T)) : ∃ F : C(I × P × X, T), (∀ p : P, ∀ x : X, F (0, p, x) = f (p, x)) ∧ (∃ K : Subdivision P, ∀ D ∈ K.complex.facets, AdaptedTo U k (fun q : closedCell P D × X => F (1, q.1.1, q.2))) ∧ (∀ S : Set X, Supported (f := f.toFun) S → Supported (fun q : (I × P) × X => F (q.1.1, q.1.2, q.2)) S) ∧ (∀ Q : Set P, IsBoundarySubpolyhedron Q → ∀ S' : Set X, Supported (fun q : Q × X => f (q.1.1, q.2)) S' → Supported (fun q : (I × Q) × X => F (q.1.1, q.1.2.1, q.2)) S') := k:ℕι:Type u_1X:Type u_2T:Type u_3inst✝²:TopologicalSpace Xinst✝¹:TopologicalSpace TP:Set (Fin k → ℝ)_hP:IsPolyhedron Pinst✝:CompactSpace XU:ι → Set X_hUopen:∀ (α : ι), IsOpen[inst✝²] (U α)ρ:PartitionOfUnity ι X_hρ:ρ.IsSubordinate Uf:C(↑P × X, T)⊢ ∃ F, (∀ (p : ↑P) (x : X), F (0, p, x) = f (p, x)) ∧ (∃ K, ∀ D ∈ K.complex.facets, AdaptedTo U k fun q => F (1, ↑q.1, q.2)) ∧ (∀ (S : Set X), Supported f.toFun S → Supported (fun q => F (q.1.1, q.1.2, q.2)) S) ∧ ∀ (Q : Set ↑P), IsBoundarySubpolyhedron Q → ∀ (S' : Set X), Supported (fun q => f (↑q.1, q.2)) S' → Supported (fun q => F (q.1.1, ↑q.1.2, q.2)) S' All goals completed! 🐙
/-- **Lemma B.0.1**, bi-Lipschitz variant (part 4 of the paper). -/ theorem declaration uses `sorry`biLipschitz {X T : Type*} [MetricSpace X] [MetricSpace T] [CompactSpace X] {P : Set (Fin k → ℝ)} (_hP : IsPolyhedron P) {ι : Type*} (U : ι → Set X) (_hUopen : ∀ α, IsOpen (U α)) (ρ : PartitionOfUnity ι X univ) (_hρ : ρ.IsSubordinate U) (f : C(P × X, T)) (slice : P → (X ≃ₜ T)) (_h_slice_eq : ∀ p : P, ∀ x : X, f (p, x) = slice p x) (L : NNReal) (_hf_joint : LipschitzWith L f.toFun) (_hf_slice_inv : ∀ p : P, LipschitzWith L (slice p).symm) : ∃ F : C(I × P × X, T), ∃ L' : NNReal, ∃ Slice : I × P → (X ≃ₜ T), (∀ p : P, ∀ x : X, F (0, p, x) = f (p, x)) ∧ (∀ t : I, ∀ p : P, ∀ x : X, F (t, p, x) = Slice (t, p) x) ∧ (∃ K : Subdivision P, ∀ D ∈ K.complex.facets, AdaptedTo U k (fun q : closedCell P D × X => F (1, q.1.1, q.2))) ∧ (∀ S : Set X, Supported (f := f.toFun) S → Supported (fun q : (I × P) × X => F (q.1.1, q.1.2, q.2)) S) ∧ (∀ Q : Set P, IsBoundarySubpolyhedron Q → ∀ S' : Set X, Supported (fun q : Q × X => f (q.1.1, q.2)) S' → Supported (fun q : (I × Q) × X => F (q.1.1, q.1.2.1, q.2)) S') ∧ (∀ tp : I × P, LipschitzWith L' (Slice tp)) ∧ (∀ tp : I × P, LipschitzWith L' (Slice tp).symm) := k:ℕX:Type u_4T:Type u_5inst✝²:MetricSpace Xinst✝¹:MetricSpace Tinst✝:CompactSpace XP:Set (Fin k → ℝ)_hP:IsPolyhedron Pι:Type u_6U:ι → Set X_hUopen:∀ (α : ι), IsOpen[PseudoMetricSpace.toUniformSpace.toTopologicalSpace] (U α)ρ:PartitionOfUnity ι X_hρ:ρ.IsSubordinate Uf:C(↑P × X, T)slice:↑P → X ≃ₜ T_h_slice_eq:∀ (p : ↑P) (x : X), f (p, x) = (slice p) xL:NNReal_hf_joint:LipschitzWith L f.toFun_hf_slice_inv:∀ (p : ↑P), LipschitzWith L ⇑(slice p).symm⊢ ∃ F L' Slice, (∀ (p : ↑P) (x : X), F (0, p, x) = f (p, x)) ∧ (∀ (t : ↑I) (p : ↑P) (x : X), F (t, p, x) = (Slice (t, p)) x) ∧ (∃ K, ∀ D ∈ K.complex.facets, AdaptedTo U k fun q => F (1, ↑q.1, q.2)) ∧ (∀ (S : Set X), Supported f.toFun S → Supported (fun q => F (q.1.1, q.1.2, q.2)) S) ∧ (∀ (Q : Set ↑P), IsBoundarySubpolyhedron Q → ∀ (S' : Set X), Supported (fun q => f (↑q.1, q.2)) S' → Supported (fun q => F (q.1.1, ↑q.1.2, q.2)) S') ∧ (∀ (tp : ↑I × ↑P), LipschitzWith L' ⇑(Slice tp)) ∧ ∀ (tp : ↑I × ↑P), LipschitzWith L' ⇑(Slice tp).symm All goals completed! 🐙
#1
The Golod–Shafarevich inequality
golod_shafarevich_inequality

Verso theorem preview

theorem declaration uses `sorry`golod_shafarevich_inequality (p : ℕ) [Fact p.Prime] (Q : Type) [Group Q] [TopologicalSpace Q] [IsTopologicalGroup Q] [DiscreteTopology Q] [Finite Q] : IsPGroup p Q → Nontrivial Q → (generatorRank Q : ℝ) ^ 2 < 4 * (relationRank p Q : ℝ) := p:ℕinst✝⁵:Fact (Nat.Prime p)Q:Typeinst✝⁴:Group Qinst✝³:TopologicalSpace Qinst✝²:IsTopologicalGroup Qinst✝¹:DiscreteTopology Qinst✝:Finite Q⊢ IsPGroup p Q → Nontrivial Q → ↑(generatorRank Q) ^ 2 < 4 * ↑(relationRank p Q) All goals completed! 🐙
#2
Wigner semicircle law
wigner_semicircle

Verso theorem preview

theorem declaration uses `sorry`wigner_semicircle {Ω : Type*} [MeasurableSpace Ω] (μ : Measure Ω) [IsProbabilityMeasure μ] (X : ℕ → ℕ → Ω → ℝ) (_hX_meas : ∀ i j, Measurable (X i j)) (_hX_indep : iIndepFun (fun ij : {p : ℕ × ℕ // p.1 ≤ p.2} => X ij.val.1 ij.val.2) μ) (_hX_iid : ∀ i j i' j', i ≤ j → i' ≤ j' → ProbabilityTheory.IdentDistrib (X i j) (X i' j') μ μ) (_hX_int : ∀ i j, i ≤ j → Integrable (X i j) μ) (_hX_sq_int : ∀ i j, i ≤ j → Integrable (fun ω => (X i j ω) ^ 2) μ) (_hX_mean : ∀ i j, i ≤ j → ∫ ω, X i j ω ∂μ = 0) (_hX_var : ∀ i j, i ≤ j → ∫ ω, (X i j ω) ^ 2 ∂μ = 1) : ∀ᵐ ω ∂μ, ∀ (f : ℝ → ℝ), Continuous f → (∃ M, ∀ x, ‖f x‖ ≤ M) → Tendsto (fun n : ℕ => ∫ x, f x ∂ (empiricalSpectralMeasureHerm (wignerMatrix_isHermitian X n ω)).map (fun x : ℝ => x / Real.sqrt n)) atTop (𝓝 (∫ x, f x ∂semicircleLaw)) := Ω:Type u_1inst✝¹:MeasurableSpace Ωμ:Measure Ωinst✝:IsProbabilityMeasure μX:ℕ → ℕ → Ω → ℝ_hX_meas:∀ (i j : ℕ), Measurable (X i j)_hX_indep:iIndepFun (fun ij => X (↑ij).1 (↑ij).2) μ_hX_iid:∀ (i j i' j' : ℕ), i ≤ j → i' ≤ j' → IdentDistrib (X i j) (X i' j') μ μ_hX_int:∀ (i j : ℕ), i ≤ j → Integrable (X i j) μ_hX_sq_int:∀ (i j : ℕ), i ≤ j → Integrable (fun ω => X i j ω ^ 2) μ_hX_mean:∀ (i j : ℕ), i ≤ j → ∫ (ω : Ω), X i j ω ∂μ = 0_hX_var:∀ (i j : ℕ), i ≤ j → ∫ (ω : Ω), X i j ω ^ 2 ∂μ = 1⊢ ∀ᵐ (ω : Ω) ∂μ, ∀ (f : ℝ → ℝ), Continuous f → (∃ M, ∀ (x : ℝ), ‖f x‖ ≤ M) → Tendsto (fun n => ∫ (x : ℝ), f x ∂Measure.map (fun x => x / √↑n) (empiricalSpectralMeasureHerm ⋯)) atTop (𝓝 (∫ (x : ℝ), f x ∂semicircleLaw)) All goals completed! 🐙
#3
A 3-manifold group with no faithful representation into GL(4, ℝ)
nonlinear_three_manifold_group

Verso theorem preview

theorem declaration uses `sorry`nonlinear_three_manifold_group : ∃ (M : LeanEval.Topology.Closed3Manifold) (x : M.carrier), ∀ f : FundamentalGroup M.carrier x →* GL (Fin 4) ℝ, ¬ Function.Injective f := ⊢ ∃ M x, ∀ (f : FundamentalGroup M.carrier x →* GL (Fin 4) ℝ), ¬Function.Injective ⇑f All goals completed! 🐙
#4
How produced

No Description

Strong Subadditivity of von Neumann Entropy
strong_subadditivity

Verso theorem preview

theorem declaration uses `sorry`strong_subadditivity (M_ABC : Matrix (A × B × C) (A × B × C) ℂ) (h : M_ABC.PosSemidef) : let M_AB : Matrix (A × B) (A × B) ℂ := .traceRight <| M_ABC.reindex (.symm <| .prodAssoc ..) (.symm <| .prodAssoc ..) let M_BC : Matrix (B × C) (B × C) ℂ := M_ABC.traceLeft let M_B : Matrix B B ℂ := M_BC.traceRight LeanEval.Physics.entropy M_ABC + LeanEval.Physics.entropy M_B ≤ LeanEval.Physics.entropy M_AB + LeanEval.Physics.entropy M_BC := A:Type u_1B:Type u_2C:Type u_3inst✝⁸:Fintype Ainst✝⁷:Fintype Binst✝⁶:Fintype Cinst✝⁵:DecidableEq Ainst✝⁴:DecidableEq Binst✝³:DecidableEq Cinst✝²:Nonempty Ainst✝¹:Nonempty Binst✝:Nonempty CM_ABC:Matrix (A × B × C) (A × B × C) ℂh:M_ABC.PosSemidef⊢ let M_AB := ((Matrix.reindex (Equiv.prodAssoc A B C).symm (Equiv.prodAssoc A B C).symm) M_ABC).traceRight; let M_BC := M_ABC.traceLeft; let M_B := M_BC.traceRight; entropy M_ABC + entropy M_B ≤ entropy M_AB + entropy M_BC All goals completed! 🐙
#5
How produced

No Description

Sobolev embedding theorem (Morrey regime)
sobolev_embedding_morrey

Verso theorem preview

theorem declaration uses `sorry`sobolev_embedding {n k r : ℕ} {α p : ℝ} (_hp : (n : ℝ) < p) (_hα : 0 < α) (_hα1 : α ≤ 1) (_hgap : (r : ℝ) + α < (k : ℝ) - n / p) (f : LeanEval.Analysis.SobolevMorreyProblem.E n → ℝ) (_hf : LeanEval.Analysis.SobolevMorreyProblem.MemSobolevWk k (ENNReal.ofReal p) f) : ∃ g : LeanEval.Analysis.SobolevMorreyProblem.E n → ℝ, f =ᵐ[volume] g ∧ LeanEval.Analysis.SobolevMorreyProblem.MemHolder r α g := n:ℕk:ℕr:ℕα:ℝp:ℝ_hp:↑n < p_hα:0 < α_hα1:α ≤ 1_hgap:↑r + α < ↑k - ↑n / pf:E n → ℝ_hf:MemSobolevWk k (ENNReal.ofReal p) f⊢ ∃ g, f =ᵐ[volume] g ∧ LeanEval.Analysis.SobolevMorreyProblem.MemHolder r α g All goals completed! 🐙
#6
How produced

No Description

Radial symmetry for positive semilinear Poisson solutions
semilinear_poisson_radial_symmetry

Verso theorem preview

theorem declaration uses `sorry`semilinear_poisson_radial_symmetry {n : ℕ} (hn : 0 < n) {f : ℝ → ℝ} (u : EuclideanSpace ℝ (Fin n) → ℝ) (hf_lipschitz : ∃ K : ℝ≥0, LipschitzWith K f) (hu_c2 : ContDiffOn ℝ 2 u (closedBall 0 1)) (hu_solve : LeanEval.Analysis.PDE.SolvesSemilinearPoisson f u) (hu_positive : ∀ x ∈ ball 0 1, 0 < u x) : ∃ v : ℝ → ℝ≥0, StrictAntiOn v (Set.Icc (0 : ℝ) 1) ∧ ∀ x ∈ closedBall 0 1, u x = v ‖x‖ := n:ℕhn:0 < nf:ℝ → ℝu:EuclideanSpace ℝ (Fin n) → ℝhf_lipschitz:∃ K, LipschitzWith K fhu_c2:ContDiffOn ℝ 2 u (closedBall 0 1)hu_solve:SolvesSemilinearPoisson f uhu_positive:∀ x ∈ ball 0 1, 0 < u x⊢ ∃ v, StrictAntiOn v (Set.Icc 0 1) ∧ ∀ x ∈ closedBall 0 1, u x = ↑(v ‖x‖) All goals completed! 🐙
#7
How produced

No Description

Fundamental theorem of topos theory
fundamental_topos_theory

Verso theorem preview

theorem declaration uses `sorry`fundamental_topos_theory {E : Type*} [Category E] (hE : LeanEval.ToposTheory.IsTopos E) (X : E) : LeanEval.ToposTheory.IsTopos (Over X) := E:Type u_1inst✝:Category.{u_2, u_1} EhE:IsTopos EX:E⊢ IsTopos (Over X) All goals completed! 🐙
#8
How produced

No Description

Existence of a non-isotopic pair of oriented knots
exists_nonisotopic_knots

Verso theorem preview

theorem declaration uses `sorry`exists_nonisotopic_knots : ∃ K₁ K₂ : LeanEval.KnotTheory.Knot, ¬ K₁.Isotopic K₂ := ⊢ ∃ K₁ K₂, ¬K₁.Isotopic K₂ All goals completed! 🐙
#9
How produced

No Description

Cauchy–Kovalevskaya theorem
cauchy_kovalevskaya

Verso theorem preview

theorem declaration uses `sorry`cauchy_kovalevskaya {d : ℕ} (F : LeanEval.Analysis.E d × ℝ × ℝ → LeanEval.Analysis.E d) (f : LeanEval.Analysis.E d × ℝ × ℝ → ℝ) (u₀ : LeanEval.Analysis.E d → ℝ) (_hF : AnalyticOnNhd ℝ F univ) (_hf : AnalyticOnNhd ℝ f univ) (_hu₀ : AnalyticOnNhd ℝ u₀ univ) (x₀ : LeanEval.Analysis.E d) : ∃ (U : Set (LeanEval.Analysis.E d × ℝ)) (u : LeanEval.Analysis.E d × ℝ → ℝ), (x₀, (0 : ℝ)) ∈ U ∧ IsOpen U ∧ AnalyticOnNhd ℝ u U ∧ (∀ x : LeanEval.Analysis.E d, (x, (0 : ℝ)) ∈ U → u (x, 0) = u₀ x) ∧ (∀ p ∈ U, fderiv ℝ u p ((0 : LeanEval.Analysis.E d), (1 : ℝ)) = fderiv ℝ u p (F (p.1, p.2, u p), (0 : ℝ)) + f (p.1, p.2, u p)) ∧ (∀ v : LeanEval.Analysis.E d × ℝ → ℝ, AnalyticOnNhd ℝ v U → (∀ x : LeanEval.Analysis.E d, (x, (0 : ℝ)) ∈ U → v (x, 0) = u₀ x) → (∀ p ∈ U, fderiv ℝ v p ((0 : LeanEval.Analysis.E d), (1 : ℝ)) = fderiv ℝ v p (F (p.1, p.2, v p), (0 : ℝ)) + f (p.1, p.2, v p)) → ∀ p ∈ U, u p = v p) := d:ℕF:E d × ℝ × ℝ → E df:E d × ℝ × ℝ → ℝu₀:E d → ℝ_hF:AnalyticOnNhd ℝ F univ_hf:AnalyticOnNhd ℝ f univ_hu₀:AnalyticOnNhd ℝ u₀ univx₀:E d⊢ ∃ U u, (x₀, 0) ∈ U ∧ IsOpen U ∧ AnalyticOnNhd ℝ u U ∧ (∀ (x : E d), (x, 0) ∈ U → u (x, 0) = u₀ x) ∧ (∀ p ∈ U, (fderiv ℝ u p) (0, 1) = (fderiv ℝ u p) (F (p.1, p.2, u p), 0) + f (p.1, p.2, u p)) ∧ ∀ (v : E d × ℝ → ℝ), AnalyticOnNhd ℝ v U → (∀ (x : E d), (x, 0) ∈ U → v (x, 0) = u₀ x) → (∀ p ∈ U, (fderiv ℝ v p) (0, 1) = (fderiv ℝ v p) (F (p.1, p.2, v p), 0) + f (p.1, p.2, v p)) → ∀ p ∈ U, u p = v p All goals completed! 🐙
#10
How produced

No Description

Brun's theorem (convergence of the twin-prime reciprocal sum)
brun_constant_converges

Lean theorem statement

/-- **Brun's theorem.** The reciprocal sum over twin-prime pairs converges. -/
theorem brun_constant_converges :
    Summable twinPrimeReciprocalTerm := by
  sorry
#11
How produced

No Description

Poincaré–Siegel linearisation theorem
poincare_siegel_linearisation

Lean theorem statement

/-- **Poincaré–Siegel linearisation theorem.** If `α` is Diophantine,
`λ = e^{2πiα}`, and `f` is holomorphic near `0` with `f 0 = 0` and
`f'(0) = λ`, then there is a holomorphic germ `u` with `u 0 = 0`,
`u'(0) = 1`, and `f(u z) = u(λ z)` for `z` near `0`. -/
theorem poincare_siegel
    (α : ℝ) (_hα : IsDiophantine α)
    (lam : ℂ) (_hlam : lam = Complex.exp (2 * Real.pi * Complex.I * (α : ℂ)))
    (f : ℂ → ℂ) (_hf : AnalyticAt ℂ f 0) (_hf0 : f 0 = 0)
    (_hmult : deriv f 0 = lam) :
    ∃ u : ℂ → ℂ, AnalyticAt ℂ u 0 ∧ u 0 = 0 ∧ deriv u 0 = 1 ∧
      ∀ᶠ z in nhds (0 : ℂ), f (u z) = u (lam * z) := by
  sorry
#12
How produced

No Description

Kolmogorov–Arnold superposition theorem (non-universal Lorentz form)
kolmogorov_arnold_superposition

Lean theorem statement

/-- **Kolmogorov–Arnold superposition theorem (non-universal Lorentz
form).** For `n ≥ 1`, every continuous `f` on the unit cube `[0, 1]ⁿ`
admits a representation
`f(x) = ∑_{k=0}^{2n} g(∑_{l=1}^{n} φ_{k,l}(x_l))` with a single
continuous outer function `g : ℝ → ℝ` and continuous inner functions
`φ_{k,l} : ℝ → ℝ`. -/
theorem kolmogorov_arnold (n : ℕ) (_hn : 1 ≤ n)
    (f : (Fin n → ℝ) → ℝ) (_hf : ContinuousOn f (Set.Icc 0 1)) :
    ∃ (g : ℝ → ℝ) (φ : Fin (2 * n + 1) → Fin n → ℝ → ℝ),
      Continuous g ∧ (∀ k l, Continuous (φ k l)) ∧
      ∀ x ∈ Set.Icc (0 : Fin n → ℝ) 1,
        f x = ∑ k, g (∑ l, φ k l (x l)) := by
  sorry
#13
How produced

No Description

The Hopf Umlaufsatz (theorem of turning tangents)
hopf_umlaufsatz

Verso theorem preview

theorem declaration uses `sorry`hopf_umlaufsatz {r : ℝ → LeanEval.Geometry.HopfUmlaufsatz.Plane} {α : ℝ → ℝ} (_hr : LeanEval.Geometry.HopfUmlaufsatz.IsPositiveSimpleClosedUnitSpeedCurve r) (_hα : LeanEval.Geometry.HopfUmlaufsatz.IsTangentAngleLift r α) : totalCurvature α = 2 * Real.pi := r:ℝ → Planeα:ℝ → ℝ_hr:IsPositiveSimpleClosedUnitSpeedCurve r_hα:IsTangentAngleLift r α⊢ totalCurvature α = 2 * Real.pi All goals completed! 🐙
#14
How produced

No Description

Hurewicz theorem in degree 1 (H₁ = abelianization of π₁)
hurewicz_h1_abelianization

Lean theorem statement

/-- **Hurewicz (n = 1).** For a path-connected space `X`, `H₁(X;ℤ)` is the
abelianization of `π₁(X, x)`. -/
theorem hurewicz_h1_abelianization
    (X : Type) [TopologicalSpace X] [PathConnectedSpace X] (x : X) :
    Nonempty (Additive (Abelianization (FundamentalGroup X x)) ≃+
      (IntegralHomology 1 X : Type)) := by
  sorry
#15
How produced

No Description

No bounded projection from L^1 onto H^1
H1_not_closedComplemented

Verso theorem preview

theorem declaration uses `sorry`H1_not_closedComplemented : ¬ LeanEval.Analysis.H1.ClosedComplemented := ⊢ ¬H1.ClosedComplemented All goals completed! 🐙
#16
How produced

No Description

Radó's theorem on Riemann surfaces
rado_riemannSurface

Verso theorem preview

theorem declaration uses `sorry`rado_riemannSurface {X : Type*} [TopologicalSpace X] [T2Space X] [ConnectedSpace X] [ChartedSpace ℂ X] [IsManifold (modelWithCornersSelf ℂ ℂ) 1 X] : SecondCountableTopology X := X:Type u_1inst✝⁴:TopologicalSpace Xinst✝³:T2Space Xinst✝²:ConnectedSpace Xinst✝¹:ChartedSpace ℂ Xinst✝:IsManifold (modelWithCornersSelf ℂ ℂ) 1 X⊢ SecondCountableTopology X All goals completed! 🐙
#17
How produced

No Description

Riesz brothers' theorem
riesz_brothers_theorem

Lean theorem statement

/-- **Riesz brothers' theorem.** Let `μ` be a complex Borel measure on
the unit circle such that `∫ z^n dμ = 0` for every `n ≥ 1`. Then `μ` is
absolutely continuous with respect to Haar measure. The usual density
formulation follows by applying the Radon–Nikodym theorem to this conclusion;
the hypothesis transfers the Fourier-vanishing property to that density. This
corollary is not part of the formal statement here. -/
theorem riesz_brothers_theorem (μ : ComplexMeasure UnitAddCircle)
    (hμ : ∀ n : ℕ, 1 ≤ n → ∫ᵛ z, fourier n z ∂[ContinuousLinearMap.mul ℝ ℂ; μ] = 0) :
    μ ≪ᵥ AddCircle.haarAddCircle.toENNRealVectorMeasure := by
  sorry
#18
How produced

No Description

Gauss-Wantzel constructible regular polygon theorem
gauss_wantzel_constructible_polygon

Lean theorem statement

/-- **Gauss-Wantzel constructible polygon theorem** (§174): a regular `n`-gon
is straightedge-and-compass constructible exactly for the Gauss-Wantzel
integers. -/
theorem gauss_wantzel_constructible_polygon (n : ℕ) (hn : 3 ≤ n) :
    IsConstructible (Real.cos (2 * Real.pi / n)) ↔ GaussWantzelNumber n := by
  sorry
#19
Anosov–Bowen shadowing lemma
anosov_bowen_shadowing

Lean theorem statement

/-- **Anosov–Bowen shadowing lemma** (Anosov 1967; Bowen 1975). Every
compact hyperbolic invariant set has the shadowing property. -/
theorem hyperbolic_has_shadowing
    (T : E d ≃ₜ E d) (K : Set (E d))
    (_hKc : IsCompact K) (_hK : IsHyperbolic T K) :
    HasShadowing (T : E d → E d) K := by
  sorry
#20
Ornstein–Weiss ℤᵈ Rokhlin lemma
ornstein_weiss_rokhlin

Verso theorem preview

theorem declaration uses `sorry`ornstein_weiss_rokhlin {Ω : Type*} [MeasurableSpace Ω] [StandardBorelSpace Ω] {d : ℕ} (_hd : 1 ≤ d) (μ : Measure Ω) [IsProbabilityMeasure μ] (T : (Fin d → ℤ) → Ω → Ω) (_hid : ∀ x, T 0 x = x) (_hT : ∀ v, MeasurePreserving (T v) μ μ) (_hgrp : ∀ u v x, T (u + v) x = T u (T v x)) (_hfree : LeanEval.Dynamics.IsFreeAction μ T) (N : ℕ) (_hN : 1 ≤ N) {ε : ENNReal} (_hε : 0 < ε) : ∃ B : Set Ω, MeasurableSet B ∧ ((boxShape d N : Finset (Fin d → ℤ)) : Set (Fin d → ℤ)).PairwiseDisjoint (fun v => T v '' B) ∧ μ (⋃ v ∈ boxShape d N, T v '' B) ≥ 1 - ε := Ω:Type u_1inst✝²:MeasurableSpace Ωinst✝¹:StandardBorelSpace Ωd:ℕ_hd:1 ≤ dμ:Measure Ωinst✝:IsProbabilityMeasure μT:(Fin d → ℤ) → Ω → Ω_hid:∀ (x : Ω), T 0 x = x_hT:∀ (v : Fin d → ℤ), MeasurePreserving (T v) μ μ_hgrp:∀ (u v : Fin d → ℤ) (x : Ω), T (u + v) x = T u (T v x)_hfree:IsFreeAction μ TN:ℕ_hN:1 ≤ Nε:ENNReal_hε:0 < ε⊢ ∃ B, MeasurableSet B ∧ ((↑(boxShape d N)).PairwiseDisjoint fun v => T v '' B) ∧ μ (⋃ v ∈ boxShape d N, T v '' B) ≥ 1 - ε All goals completed! 🐙
#21
General recursive equals Turing computable
turing_recursive_equiv

Lean theorem statement

/-- **General recursive = Turing computable** (total form). A total function
`f : ℕ → ℕ` is recursive (`Computable`, i.e. partial recursive as a partial
function) **iff** it is computed by some Turing machine (mathlib's `FinTM2`
model) under the standard binary encoding of `ℕ`. This is Knill's class
equality; the backward direction (TM-computable ⇒ recursive) is absent from
mathlib. -/
theorem turing_recursive_equiv (f : ℕ → ℕ) :
    Computable f ↔ Nonempty (TM2Computable encodeNat encodeNat f) := by
  sorry
#22
How produced

_no_response_

Lax's approximation theorem for toral homeomorphisms
lax_approximation

Lean theorem statement

/-- **Lax's approximation theorem.** Every toral dynamical system on `𝕋^d`
(`d ≥ 1`) is approximated arbitrarily well in the metric `δ` by cyclic cube
exchange transformations. -/
theorem lax_approximation {d : ℕ} (hd : 0 < d) (T : ToralDynamicalSystem d)
    {ε : ℝ≥0∞} (hε : 0 < ε) :
    ∃ (n : ℕ) (S : VolumePreservingEquiv d),
      IsCyclicCubeExchange S n ∧ deltaDist T.toVolumePreservingEquiv S < ε := by
  sorry
#23
How produced

_no_response_

Halmos's generic weak-mixing theorem
halmos_generic_weak_mixing

Verso theorem preview

theorem declaration uses `sorry`generic_weakly_mixing [StandardBorelSpace X] (m : Measure X) [IsProbabilityMeasure m] [NullSingletonClass m] : (∃ G : Set (LeanEval.Dynamics.HalmosGenericWeakMixingProblem.Automorphism m), IsGδ G ∧ Dense G ∧ ∀ T ∈ G, LeanEval.Dynamics.HalmosGenericWeakMixingProblem.IsWeaklyMixing m T) ∧ (∀ T : LeanEval.Dynamics.HalmosGenericWeakMixingProblem.Automorphism m, LeanEval.Dynamics.HalmosGenericWeakMixingProblem.IsWeaklyMixing m T → Ergodic (T.toEquiv : X → X) m) := X:Type u_1inst✝³:MeasurableSpace Xinst✝²:StandardBorelSpace Xm:Measure Xinst✝¹:IsProbabilityMeasure minst✝:NullSingletonClass m⊢ (∃ G, IsGδ G ∧ Dense G ∧ ∀ T ∈ G, IsWeaklyMixing m T) ∧ ∀ (T : Automorphism m), IsWeaklyMixing m T → Ergodic (⇑T.toEquiv) m All goals completed! 🐙
#24
Tverberg's theorem
tverberg_theorem

Lean theorem statement

/-- **Tverberg's theorem.** Any `(r-1)(d+1)+1` points in `ℝ^d` admit an
`r`-part Tverberg partition. -/
theorem tverberg_theorem (d r : ℕ) (hr : 1 ≤ r)
    (f : Fin ((r - 1) * (d + 1) + 1) → Space d) :
    HasTverbergPartition (r := r) f := by
  sorry
#25
How produced

No Description

Frobenius determinant theorem
frobenius_group_determinant

Verso theorem preview

theorem declaration uses `sorry`frobenius_group_determinant (G : Type*) [Group G] [Fintype G] [DecidableEq G] : ∃ (r : ℕ) (p : Fin r → MvPolynomial G ℂ), r = Nat.card (ConjClasses G) ∧ (∀ j, Irreducible (p j)) ∧ (∀ i j, i ≠ j → ¬ Associated (p i) (p j)) ∧ groupDeterminant G = ∏ j, (p j) ^ (p j).totalDegree := G:Type u_1inst✝²:Group Ginst✝¹:Fintype Ginst✝:DecidableEq G⊢ ∃ r p, r = Nat.card (ConjClasses G) ∧ (∀ (j : Fin r), Irreducible (p j)) ∧ (∀ (i j : Fin r), i ≠ j → ¬Associated (p i) (p j)) ∧ groupDeterminant G = ∏ j, p j ^ (p j).totalDegree All goals completed! 🐙
#26
How produced

No Description

Shannon capacity of the pentagon
shannon_capacity_pentagon

Lean theorem statement

/-- **Lovász's theorem on Shannon capacity of the pentagon** (§238).
The Shannon capacity of the five-cycle is `√5`. -/
theorem shannon_capacity_pentagon :
    HasShannonCapacity (SimpleGraph.cycleGraph 5) (Real.sqrt 5) := by
  sorry
#27
Wiener–Lévy theorem
wiener_levy_analytic_calculus

Lean theorem statement

/-- **Wiener–Lévy theorem.** If `φ` is complex-analytic on a neighbourhood of
the range of a Wiener-algebra function `f`, then the composed function
`φ ∘ f` is again in the Wiener algebra. -/
theorem wiener_levy_analytic_calculus (f : C(AddCircle T, ℂ))
    (φ : ℂ → ℂ) (U : Set ℂ) (hf : InWienerAlgebra f)
    (hU : IsOpen U) (hrange : range f ⊆ U)
    (hφ : AnalyticOnNhd ℂ φ U) :
    ∃ g : C(AddCircle T, ℂ),
      (∀ x, g x = φ (f x)) ∧ InWienerAlgebra g := by
  sorry
#28
The Lindemann–Weierstrass theorem
lindemann_weierstrass

Lean theorem statement

/-- **Lindemann–Weierstrass theorem.** If `x₁, …, xₙ ∈ ℂ` are algebraic over `ℚ`
and ℚ-linearly independent, then `e^{x₁}, …, e^{xₙ}` are algebraically
independent over `ℚ`. -/
theorem lindemann_weierstrass {n : ℕ} (x : Fin n → ℂ)
    (h_alg : ∀ i, IsAlgebraic ℚ (x i))
    (h_lin : LinearIndependent ℚ x) :
    AlgebraicIndependent ℚ (fun i => Complex.exp (x i)) := by
  sorry
#29
Liouville–Arnold theorem on integrable systems
liouville_arnold

Verso theorem preview

theorem declaration uses `sorry`liouville_arnold {n : ℕ} (F : Fin n → LeanEval.Geometry.LiouvilleArnold.E n → ℝ) (U : Set (LeanEval.Geometry.LiouvilleArnold.E n)) (_hU : IsOpen U) (_hLI : LeanEval.Geometry.LiouvilleArnold.IsLiouvilleIntegrable F U) (c : Fin n → ℝ) (_hMc_sub : LeanEval.Geometry.LiouvilleArnold.levelSet F c ⊆ U) (_hMc_compact : IsCompact (LeanEval.Geometry.LiouvilleArnold.levelSet F c)) (_hMc_connected : IsConnected (LeanEval.Geometry.LiouvilleArnold.levelSet F c)) : Nonempty ((LeanEval.Geometry.LiouvilleArnold.levelSet F c) ≃ₜ (Fin n → AddCircle (1 : ℝ))) := n:ℕF:Fin n → E n → ℝU:Set (E n)_hU:IsOpen U_hLI:IsLiouvilleIntegrable F Uc:Fin n → ℝ_hMc_sub:levelSet F c ⊆ U_hMc_compact:IsCompact (levelSet F c)_hMc_connected:IsConnected (levelSet F c)⊢ Nonempty (↑(levelSet F c) ≃ₜ (Fin n → AddCircle 1)) All goals completed! 🐙
#30
Fang–Xia: tiling of the symmetric group by transpositions implies λ-transitivity
fang_xia_tiling_partition_transitive

Verso theorem preview

theorem declaration uses `sorry`fang_xia_partition_transitive_of_tiling {n : ℕ} {Y : Set (Equiv.Perm (Fin n))} (_h : LeanEval.Combinatorics.FangXiaTilingProblem.IsTiling (LeanEval.Combinatorics.FangXiaTilingProblem.transpositionsWithOne n) Y) : ∀ lam : LeanEval.Combinatorics.FangXiaTilingProblem.PartitionShape n, 0 ≤ lam.contentSum → LeanEval.Combinatorics.FangXiaTilingProblem.IsPartitionTransitive Y lam := n:ℕY:Set (Equiv.Perm (Fin n))_h:IsTiling (transpositionsWithOne n) Y⊢ ∀ (lam : PartitionShape n), 0 ≤ lam.contentSum → IsPartitionTransitive Y lam All goals completed! 🐙
#31
How produced

No Description

Pascal's theorem
pascal

Lean theorem statement

/-- **Pascal's theorem.** Six distinct points on a non-singular conic determine
three collinear intersection points `Aᵢ Bⱼ ∩ Aⱼ Bᵢ`. -/
theorem pascal
    (M : Matrix (Fin 3) (Fin 3) ℝ) (hMsymm : M.IsSymm) (hMdet : M.det ≠ 0)
    (a₁ a₂ a₃ b₁ b₂ b₃ : Fin 3 → ℝ)
    (ha₁ : a₁ ≠ 0) (ha₂ : a₂ ≠ 0) (ha₃ : a₃ ≠ 0)
    (hb₁ : b₁ ≠ 0) (hb₂ : b₂ ≠ 0) (hb₃ : b₃ ≠ 0)
    (hdist : [a₁, a₂, a₃, b₁, b₂, b₃].Pairwise (fun v w => ¬ SamePoint v w))
    (hA₁ : OnConic M a₁) (hA₂ : OnConic M a₂) (hA₃ : OnConic M a₃)
    (hB₁ : OnConic M b₁) (hB₂ : OnConic M b₂) (hB₃ : OnConic M b₃) :
    Collinear3 (meet a₁ b₂ a₂ b₁) (meet a₁ b₃ a₃ b₁) (meet a₂ b₃ a₃ b₂) := by
  sorry
#32
How produced

No Description

Boone–Higman theorem (easy direction)
boone_higman_embedding

Verso theorem preview

theorem declaration uses `sorry`boone_higman_embedding {G H K : Type*} [Group G] [Group H] [Group K] [IsSimpleGroup H] [Group.IsFinitelyPresented K] (f : G →* H) (hf : Function.Injective f) (g : H →* K) (hg : Function.Injective g) {n : ℕ} (φ : FreeGroup (Fin n) →* G) (hsurj : Function.Surjective φ) (hker : (MonoidHom.ker φ).IsFinitelyNormallyGenerated) : LeanEval.GroupTheory.BooneHigmanEmbedding.WordProblemSolvable φ := G:Type u_1H:Type u_2K:Type u_3inst✝⁴:Group Ginst✝³:Group Hinst✝²:Group Kinst✝¹:IsSimpleGroup Hinst✝:Group.IsFinitelyPresented Kf:G →* Hhf:Function.Injective ⇑fg:H →* Khg:Function.Injective ⇑gn:ℕφ:FreeGroup (Fin n) →* Ghsurj:Function.Surjective ⇑φhker:φ.ker.IsFinitelyNormallyGenerated⊢ WordProblemSolvable φ All goals completed! 🐙
#33
Choquet's representation theorem
choquet_representation_theorem

Verso theorem preview

theorem declaration uses `sorry`choquet [MeasurableSpace X] [BorelSpace X] (K : Set X) (hK_cpt : IsCompact K) (hK_cvx : Convex ℝ K) {x : X} (hx : x ∈ K) : ∃ μ : Measure X, IsProbabilityMeasure μ ∧ μ (K.extremePoints ℝ)ᶜ = 0 ∧ x = ∫ y, y ∂μ := X:Type u_1inst✝⁴:NormedAddCommGroup Xinst✝³:NormedSpace ℝ Xinst✝²:CompleteSpace Xinst✝¹:MeasurableSpace Xinst✝:BorelSpace XK:Set XhK_cpt:IsCompact KhK_cvx:Convex ℝ Kx:Xhx:x ∈ K⊢ ∃ μ, IsProbabilityMeasure μ ∧ μ (Set.extremePoints ℝ K)ᶜ = 0 ∧ x = ∫ (y : X), y ∂μ All goals completed! 🐙
#34
Local stable/unstable sets at a hyperbolic fixed point (set-level Hadamard–Perron)
stable_unstable_manifolds

Verso theorem preview

theorem declaration uses `sorry`stable_unstable_manifolds_exist (n : ℕ) (f : LeanEval.Dynamics.StableUnstableManifoldsProblem.E n → LeanEval.Dynamics.StableUnstableManifoldsProblem.E n) (x₀ : LeanEval.Dynamics.StableUnstableManifoldsProblem.E n) (_hf : ContDiffAt ℝ 1 f x₀) (_hfix : f x₀ = x₀) (_hhyp : LeanEval.Dynamics.StableUnstableManifoldsProblem.IsHyperbolicLinear (fderiv ℝ f x₀)) (_hf_inv : (fderiv ℝ f x₀).IsInvertible) : ∃ U : Set (LeanEval.Dynamics.StableUnstableManifoldsProblem.E n), IsOpen U ∧ x₀ ∈ U ∧ ∃ Ws Wu : Set (LeanEval.Dynamics.StableUnstableManifoldsProblem.E n), Ws = {x | (∀ k : ℕ, f^[k] x ∈ U) ∧ Tendsto (fun k => f^[k] x) atTop (𝓝 x₀)} ∧ Wu = {x | ∃ y : ℕ → LeanEval.Dynamics.StableUnstableManifoldsProblem.E n, y 0 = x ∧ (∀ k : ℕ, y k ∈ U) ∧ (∀ k : ℕ, f (y (k + 1)) = y k) ∧ Tendsto y atTop (𝓝 x₀)} ∧ Ws ∩ Wu = {x₀} := n:ℕf:E n → E nx₀:E n_hf:ContDiffAt ℝ 1 f x₀_hfix:f x₀ = x₀_hhyp:IsHyperbolicLinear (fderiv ℝ f x₀)_hf_inv:(fderiv ℝ f x₀).IsInvertible⊢ ∃ U, IsOpen U ∧ x₀ ∈ U ∧ ∃ Ws Wu, Ws = {x | (∀ (k : ℕ), f^[k] x ∈ U) ∧ Tendsto (fun k => f^[k] x) atTop (𝓝 x₀)} ∧ Wu = {x | ∃ y, y 0 = x ∧ (∀ (k : ℕ), y k ∈ U) ∧ (∀ (k : ℕ), f (y (k + 1)) = y k) ∧ Tendsto y atTop (𝓝 x₀)} ∧ Ws ∩ Wu = {x₀} All goals completed! 🐙
#35
Fundamental theorem of Riemannian geometry (Levi-Civita)
levi_civita_exists_unique

Lean theorem statement

/-- **Fundamental theorem of Riemannian geometry** (Levi-Civita). On a
`C^∞` finite-dimensional Riemannian manifold there exists a smooth
torsion-free metric-compatible covariant derivative on `TM`, and any other
such connection agrees with it on smooth vector fields. -/
theorem levi_civita_exists_unique
    {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E]
      [FiniteDimensional ℝ E] [CompleteSpace E]
    {H : Type*} [TopologicalSpace H] {I : ModelWithCorners ℝ E H}
    {M : Type*} [TopologicalSpace M] [T2Space M] [ChartedSpace H M]
      [IsManifold I ∞ M]
    [RiemannianBundle (fun (x : M) ↦ TangentSpace I x)]
    [IsContMDiffRiemannianBundle I ∞ E (fun (x : M) ↦ TangentSpace I x)] :
    ∃ cov : CovariantDerivative I E (TangentSpace I (M := M)),
      (ContMDiffCovariantDerivative cov ∞ ∧
        cov.torsion = 0 ∧ IsMetricCompatible cov) ∧
      ∀ cov' : CovariantDerivative I E (TangentSpace I (M := M)),
        (ContMDiffCovariantDerivative cov' ∞ ∧
          cov'.torsion = 0 ∧ IsMetricCompatible cov') →
        SameOnSmooth cov cov' := by
  sorry
#36
Lindemann's theorem (e and π transcendental)
lindemann

Lean theorem statement

/-- **Lindemann's theorem.** Both `e = exp 1` and `π` are transcendental over
`ℤ`. -/
theorem lindemann :
    Transcendental ℤ (Real.exp 1) ∧ Transcendental ℤ Real.pi := by
  sorry
#37
Wiener's 1/f theorem
wiener_inverse_closed

Lean theorem statement

/-- **Wiener's `1/f` theorem.** If a function on the circle belongs to the
Wiener algebra and has no zero on the circle, then its pointwise reciprocal
again belongs to the Wiener algebra. -/
theorem wiener_inverse_closed (f : C(AddCircle T, ℂ))
    (hf : InWienerAlgebra f) (hzero : ∀ x, f x ≠ 0) :
    ∃ g : C(AddCircle T, ℂ),
      (∀ x, g x = (f x)⁻¹) ∧ InWienerAlgebra g := by
  sorry
#38
How produced

No Description

Lidskii's inequality
lidskii_inequality

Verso theorem preview

theorem declaration uses `sorry`lidskii_inequality {n : Type*} [Fintype n] [DecidableEq n] {A B : Matrix n n ℂ} (hA : A.IsHermitian) (hB : B.IsHermitian) {p : ℝ} (_hp : 1 ≤ p) : ∑ j, |hA.eigenvalues₀ j - hB.eigenvalues₀ j| ^ p ≤ ∑ j, |(hB.sub hA).eigenvalues₀ j| ^ p := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℂB:Matrix n n ℂhA:A.IsHermitianhB:B.IsHermitianp:ℝ_hp:1 ≤ p⊢ ∑ j, |hA.eigenvalues₀ j - hB.eigenvalues₀ j| ^ p ≤ ∑ j, |⋯.eigenvalues₀ j| ^ p All goals completed! 🐙
#39
How produced

_no_response_

Rokhlin lemma
rokhlin_lemma

Lean theorem statement

/-- **Rokhlin lemma, not-necessarily-invertible forward-image form.** For every
aperiodic measure-preserving transformation `T` of a standard Borel probability
space `(Ω, μ)`, every height `n ≥ 1`, and every `ε > 0`, there is a measurable
base whose `n` forward-image floors `B, T B, …, T^{n−1} B` are pairwise
disjoint and whose union has outer measure at least `1 − ε`. No invertibility
assumption is made. -/
theorem rokhlin_lemma {Ω : Type*} [MeasurableSpace Ω]
    [StandardBorelSpace Ω]
    (μ : Measure Ω) [IsProbabilityMeasure μ] (T : Ω → Ω)
    (_hT : MeasurePreserving T μ μ) (_hap : IsAperiodic T μ)
    (n : ℕ) (_hn : 1 ≤ n) {ε : ENNReal} (_hε : 0 < ε) :
    ∃ B : Set Ω, IsRokhlinTower T B n ∧
      μ (towerUnion T B n) ≥ 1 - ε := by
  sorry
#40
How produced

_no_response_

Hausdorff moment problem: absolute-continuity criterion
hausdorff_absolute_continuity

Verso theorem preview

theorem declaration uses `sorry`hausdorff_absolute_continuity {d : ℕ} (μ : Measure (EuclideanSpace ℝ (Fin d))) [IsProbabilityMeasure μ] (hμ : μ ((LeanEval.Analysis.HausdorffAbsoluteContinuity.cube d)ᶜ) = 0) : LeanEval.Analysis.HausdorffAbsoluteContinuity.UniformlyAbsolutelyContinuous μ (volume.restrict (LeanEval.Analysis.HausdorffAbsoluteContinuity.cube d)) ↔ ∃ C : ℝ, ∀ k n : Fin d → ℕ, k ≤ n → diff (momentOf μ) k n ≤ C * diff (momentOf (volume.restrict (LeanEval.Analysis.HausdorffAbsoluteContinuity.cube d))) k n := d:ℕμ:Measure (EuclideanSpace ℝ (Fin d))inst✝:IsProbabilityMeasure μhμ:μ (cube d)ᶜ = 0⊢ UniformlyAbsolutelyContinuous μ (volume.restrict (cube d)) ↔ ∃ C, ∀ (k n : Fin d → ℕ), k ≤ n → diff (momentOf μ) k n ≤ C * diff (momentOf (volume.restrict (cube d))) k n All goals completed! 🐙
#41
How produced

_no_response_

The Hausdorff–Hildebrandt–Schoenberg moment theorem
hausdorff_hildebrandt_schoenberg

Verso theorem preview

theorem declaration uses `sorry`hausdorff_hildebrandt_schoenberg {d : ℕ} (a : (Fin d → ℕ) → ℝ) : LeanEval.Analysis.IsMomentConfiguration a ↔ LeanEval.Analysis.HausdorffBounded a := d:ℕa:(Fin d → ℕ) → ℝ⊢ IsMomentConfiguration a ↔ HausdorffBounded a All goals completed! 🐙
#42
How produced

_no_response_

The Hausdorff positivity (complete-monotonicity) criterion
hausdorff_positivity_criterion

Lean theorem statement

/-- **Hausdorff positivity criterion** (Hausdorff 1921). A moment configuration
comes from a positive measure iff all its iterated backward differences are
nonnegative — i.e. the sequence is *completely monotone*: `(Δᵏa)ₙ ≥ 0` for all
`k ≤ n`. -/
theorem hausdorff_positivity {d : ℕ} (a : (Fin d → ℕ) → ℝ) :
    IsPositiveMomentConfiguration a ↔ ∀ k n : Fin d → ℕ, k ≤ n → 0 ≤ diff a k n := by
  sorry
#43
How produced

_no_response_

Chen theorem for Markoff graphs
dvd_card_connectedComponent_markoffGraph

Verso theorem preview

theorem declaration uses `sorry`dvd_card_connectedComponent_markoffGraph {p : ℕ} (hp : Nat.Prime p) (hgt : 3 < p) : ∀ c : (LeanEval.Combinatorics.markoffGraph p).ConnectedComponent, p ∣ Nat.card c := p:ℕhp:Nat.Prime phgt:3 < p⊢ ∀ (c : (markoffGraph p).ConnectedComponent), p ∣ Nat.card ↥c All goals completed! 🐙
#44
How produced

CI repair resubmission after extracting failed workflow logs. Root-workspace commit rebuilt locally with `lake build Submission`; forbidden-token scan clean; source tarball under 10 MiB.

Sard's regular-value corollary
regular_value_ae

Lean theorem statement

/-- **Regular value corollary (Sard).** For a smooth `f : ℝᵐ → ℝ`, almost every
`c ∈ ℝ` is a regular value. -/
theorem regular_value_ae {m : ℕ} (f : EuclideanSpace ℝ (Fin m) → ℝ)
    (hf : ContDiff ℝ ∞ f) :
    ∀ᵐ c ∂(volume : Measure ℝ), IsRegularValue f c := by
  sorry
#45
Frobenius's theorem: the Frobenius kernel is normal
frobenius_kernel_isNormal

Verso theorem preview

theorem declaration uses `sorry`frobenius_kernel_isNormal (G X : Type) [Group G] [Fintype G] [Fintype X] [MulAction G X] [FaithfulSMul G X] (hcard : 2 ≤ Fintype.card X) (htrans : ∀ x y : X, ∃ g : G, g • x = y) (hstab : ∀ x : X, MulAction.stabilizer G x ≠ ⊥) (hfrob : ∀ g : G, g ≠ 1 → ∀ x y : X, g • x = x → g • y = y → x = y) : ∃ N : Subgroup G, N.Normal ∧ (N : Set G) = {1} ∪ {g : G | ∀ x : X, g • x ≠ x} := G:TypeX:Typeinst✝⁴:Group Ginst✝³:Fintype Ginst✝²:Fintype Xinst✝¹:MulAction G Xinst✝:FaithfulSMul G Xhcard:2 ≤ Fintype.card Xhtrans:∀ (x y : X), ∃ g, g • x = yhstab:∀ (x : X), MulAction.stabilizer G x ≠ ⊥hfrob:∀ (g : G), g ≠ 1 → ∀ (x y : X), g • x = x → g • y = y → x = y⊢ ∃ N, N.Normal ∧ ↑N = {1} ∪ {g | ∀ (x : X), g • x ≠ x} All goals completed! 🐙
#46
Independence of the parallel postulate
parallel_postulate_independent

Verso theorem preview

theorem declaration uses `sorry`parallel_postulate_independent : (∃ (M : Type) (T : LeanEval.Geometry.TarskiAbsolute M), LeanEval.Geometry.Euclidean M T) ∧ (∃ (M : Type) (T : LeanEval.Geometry.TarskiAbsolute M), ¬ LeanEval.Geometry.Euclidean M T) := ⊢ (∃ M T, Euclidean M T) ∧ ∃ M T, ¬Euclidean M T All goals completed! 🐙
#47
Hippocrates' theorem on lunes
hippocrates_lunes

Verso theorem preview

theorem declaration uses `sorry`hippocrates_lunes (a b : ℝ) (ha : 0 < a) (hb : 0 < b) : volume (LeanEval.Geometry.HippocratesLunes.horizontalLune a b) + volume (LeanEval.Geometry.HippocratesLunes.verticalLune a b) = volume (LeanEval.Geometry.HippocratesLunes.rightTriangle a b) := a:ℝb:ℝha:0 < ahb:0 < b⊢ volume (horizontalLune a b) + volume (verticalLune a b) = volume (rightTriangle a b) All goals completed! 🐙
#48
Baer–Suzuki theorem
baer_suzuki

Verso theorem preview

theorem declaration uses `sorry`baer_suzuki {G : Type*} [Group G] [Finite G] {p : ℕ} [Fact p.Prime] (x : G) : x ∈ LeanEval.GroupTheory.Defs.pCore p G ↔ ∀ g : G, IsPGroup p (Subgroup.closure ({x, g * x * g⁻¹} : Set G)) := G:Type u_1inst✝²:Group Ginst✝¹:Finite Gp:ℕinst✝:Fact (Nat.Prime p)x:G⊢ x ∈ pCore p G ↔ ∀ (g : G), IsPGroup p ↥(Subgroup.closure {x, g * x * g⁻¹}) All goals completed! 🐙
#49
Sard's theorem (critical-set image has measure zero)
sard_theorem

Verso theorem preview

theorem declaration uses `sorry`sard {m n : ℕ} (f : LeanEval.Geometry.SardTheoremProblem.E m → LeanEval.Geometry.SardTheoremProblem.E n) (_hf : ContDiff ℝ ∞ f) : volume (LeanEval.Geometry.SardTheoremProblem.criticalValues f) = 0 := m:ℕn:ℕf:E m → E n_hf:ContDiff ℝ ∞ f⊢ volume (criticalValues f) = 0 All goals completed! 🐙
#50
How produced

No Description

Peano existence theorem for ODEs
peano_existence

Verso theorem preview

theorem declaration uses `sorry`peano_existence {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] {f : E → E} (hf : Continuous f) (x₀ : E) : ∃ a : ℝ, 0 < a ∧ ∃ α : ℝ → E, α 0 = x₀ ∧ ∀ t ∈ Ioo (-a) a, HasDerivAt α (f (α t)) t := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:FiniteDimensional ℝ Ef:E → Ehf:Continuous fx₀:E⊢ ∃ a, 0 < a ∧ ∃ α, α 0 = x₀ ∧ ∀ t ∈ Ioo (-a) a, HasDerivAt α (f (α t)) t All goals completed! 🐙
#51
Jordan normal form
jordan_normal_form

Lean theorem statement

/-- **Jordan normal form.** Over an algebraically closed field, every
endomorphism of `Kⁿ` admits a Jordan-chain basis. -/
theorem jordan_normal_form {K : Type*} [Field K] [IsAlgClosed K] (n : ℕ)
    (f : Module.End K (StdSpace K n)) :
    Nonempty (JordanChainBasis f) := by
  sorry
#52
Monge–Kantorovich existence theorem
monge_kantorovich

Verso theorem preview

theorem declaration uses `sorry`monge_kantorovich_exists {X Y : Type*} [TopologicalSpace X] [PolishSpace X] [MeasurableSpace X] [BorelSpace X] [TopologicalSpace Y] [PolishSpace Y] [MeasurableSpace Y] [BorelSpace Y] (P : Measure X) (Q : Measure Y) [IsProbabilityMeasure P] [IsProbabilityMeasure Q] (c : X × Y → ENNReal) (_hc : Continuous c) : ∃ π ∈ LeanEval.Analysis.Couplings P Q, ∀ π' ∈ LeanEval.Analysis.Couplings P Q, kantorovichCost c π ≤ kantorovichCost c π' := X:Type u_1Y:Type u_2inst✝⁹:TopologicalSpace Xinst✝⁸:PolishSpace Xinst✝⁷:MeasurableSpace Xinst✝⁶:BorelSpace Xinst✝⁵:TopologicalSpace Yinst✝⁴:PolishSpace Yinst✝³:MeasurableSpace Yinst✝²:BorelSpace YP:Measure XQ:Measure Yinst✝¹:IsProbabilityMeasure Pinst✝:IsProbabilityMeasure Qc:X × Y → ENNReal_hc:Continuous c⊢ ∃ π ∈ Couplings P Q, ∀ π' ∈ Couplings P Q, kantorovichCost c π ≤ kantorovichCost c π' All goals completed! 🐙
#53
Solvable extensions ↔ solvable groups (the missing converse in Abel–Ruffini)
solvable_by_radicals_converse

Lean theorem statement

/-- **Solvable extensions ↔ solvable groups.** For a field `F` of
characteristic zero and a nonzero `p : F[X]`, every root of `p` in
`AlgebraicClosure F` lies in `solvableByRad F (AlgebraicClosure F)`
iff `p.Gal` is solvable. -/
theorem solvable_iff_solvableByRad (F : Type*) [Field F] [CharZero F]
    (p : F[X]) (_hp : p ≠ 0) :
    (∀ x : AlgebraicClosure F, aeval x p = 0 →
        x ∈ solvableByRad F (AlgebraicClosure F)) ↔ Group.IsSolvable p.Gal := by
  sorry
#54
Complete reducibility for compact groups
compact_group_semisimple

Verso theorem preview

theorem declaration uses `sorry`compact_group_semisimple {G V : Type*} [Group G] [TopologicalSpace G] [IsTopologicalGroup G] [CompactSpace G] [NormedAddCommGroup V] [NormedSpace ℝ V] [FiniteDimensional ℝ V] (ρ : Representation ℝ G V) (hρ : Continuous fun p : G × V => ρ p.1 p.2) : ρ.IsSemisimpleRepresentation := G:Type u_1V:Type u_2inst✝⁶:Group Ginst✝⁵:TopologicalSpace Ginst✝⁴:IsTopologicalGroup Ginst✝³:CompactSpace Ginst✝²:NormedAddCommGroup Vinst✝¹:NormedSpace ℝ Vinst✝:FiniteDimensional ℝ Vρ:Representation ℝ G Vhρ:Continuous fun p => (ρ p.1) p.2⊢ ρ.IsSemisimpleRepresentation All goals completed! 🐙
#55
How produced

No Description

Chudnovsky formula for pi inverse
chudnovsky_formula_for_pi_inv

Verso theorem preview

theorem declaration uses `sorry`chudnovsky_formula_for_pi_inv : chudnovskySum = π⁻¹ := ⊢ chudnovskySum = π⁻¹ All goals completed! 🐙
#56
How produced

No Description

A competition programming problem about permuting a permutation to be unimodal
permute_to_unimodal

Lean theorem statement

/--
`minRearrange` correctly computes the smallest number of indices that need to be permuted in order to
turn `arr` into a unimodal permutation.
-/
theorem minRearrange_correct {arr : Array Nat} :
    arr.Perm (1...=arr.size).toArray →
      (∃ (x : Array Nat) (hx : x.Perm (1...=arr.size).toArray), Unimodal x ∧ differences (Vector.mk x (by simpa using hx.size_eq)) arr.toVector = minRearrange arr) ∧
      (∀ (x : Array Nat) (hx : x.Perm (1...=arr.size).toArray), Unimodal x → minRearrange arr ≤ differences (Vector.mk x (by simpa using hx.size_eq)) arr.toVector) := by
  sorry
#57
How produced

_no_response_

Lidskii–Last eigenvalue-perturbation theorem
lidskii_last

Verso theorem preview

theorem declaration uses `sorry`lidskii_last {n : Type*} [Fintype n] [DecidableEq n] {A B : Matrix n n ℂ} (hA : A.IsHermitian) (hB : B.IsHermitian) : ∑ j, |hA.eigenvalues₀ j - hB.eigenvalues₀ j| ≤ ∑ i, ∑ j, ‖A i j - B i j‖ := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℂB:Matrix n n ℂhA:A.IsHermitianhB:B.IsHermitian⊢ ∑ j, |hA.eigenvalues₀ j - hB.eigenvalues₀ j| ≤ ∑ i, ∑ j, ‖A i j - B i j‖ All goals completed! 🐙
#58
Brauer–Fowler theorem
brauer_fowler

Lean theorem statement

/-- **Brauer–Fowler theorem.** There is a function bounding the order
of a finite nonabelian simple group by the order of any involution
centralizer. -/
theorem brauer_fowler :
    ∃ f : ℕ → ℕ, ∀ (G : Type) [Group G] [Finite G],
      IsSimpleGroup G → (∃ a b : G, a * b ≠ b * a) →
      ∀ t : G, orderOf t = 2 →
        Nat.card G ≤ f (Nat.card (Subgroup.centralizer ({t} : Set G))) := by
  sorry
#59
How produced

No description

Sturm's theorem
sturm

Lean theorem statement

/-- **Sturm's theorem.** For a squarefree real polynomial `p` and an interval
`(a, b)` with `a < b` whose endpoints are not roots of `p`, the number of
distinct roots of `p` in `(a, b)` equals `σ(a) − σ(b)`. -/
theorem sturm (p : ℝ[X]) (hp : Squarefree p) {a b : ℝ} (hab : a < b)
    (ha : p.eval a ≠ 0) (hb : p.eval b ≠ 0) :
    ((p.roots.toFinset).filter (fun x => a < x ∧ x < b)).card =
      sigma p a - sigma p b := by
  sorry
#60
Balanceable k-bounded partitions
balanceable_bounded_partitions

Lean theorem statement

/--
For any `k`, the smallest `n` such that any `k`-bounded partition of `n` is
also balanceable is given by `2 * lcm(1, ..., k)`.
-/
theorem minimal_balanceable_of_bounded (k : ℕ) (hk : 0 < k) :
    Minimal (fun n => 0 < n ∧ ∀ p : n.Partition, Bounded k p → Balanceable p) (2 * (Finset.Icc 1 k).lcm id) := by
  sorry
#61
Furstenberg–Weiss topological multiple recurrence (single-transformation form)
furstenberg_topological

Lean theorem statement

/-- **Furstenberg–Weiss topological multiple recurrence** (single-
transformation form). Every homeomorphism `T` of a nonempty compact
metric space `X` has a multiply recurrent point. -/
theorem furstenberg_topological_recurrence {X : Type*} [MetricSpace X]
    [CompactSpace X] [Nonempty X] (T : X ≃ₜ X) :
    ∃ x : X, IsMultiplyRecurrent (T : X → X) x := by
  sorry
#62
Nash equilibrium existence theorem
nash_equilibrium_exists

Lean theorem statement

/-- **Nash equilibrium existence theorem.** Every finite `n`-player game
with nonempty finite pure-strategy sets and arbitrary real payoffs admits
at least one mixed-strategy Nash equilibrium. -/
theorem nash_equilibrium_exists {n : ℕ} {S : Fin n → Type*}
    [∀ i, Fintype (S i)] [∀ i, Nonempty (S i)]
    (u : Fin n → StrategyProfile n S → ℝ) :
    ∃ σ : ∀ i, S i → ℝ, IsNashEquilibrium u σ := by
  sorry
#63
Kakutani fixed-point theorem
kakutani_fixed_point

Lean theorem statement

/-- **Kakutani fixed-point theorem.** Every upper-hemicontinuous
correspondence `F` from a nonempty compact convex `K ⊆ ℝᵈ` to itself, with
nonempty convex closed values, has a fixed point `x ∈ F x`. -/
theorem kakutani_fixed_point {d : ℕ}
    {K : Set (EuclideanSpace ℝ (Fin d))}
    (_hK_compact : IsCompact K) (_hK_convex : Convex ℝ K)
    (_hK_nonempty : K.Nonempty)
    (F : EuclideanSpace ℝ (Fin d) → Set (EuclideanSpace ℝ (Fin d)))
    (_hF_uhc : IsUpperHemicontinuous F)
    (_hF_nonempty : ∀ x ∈ K, (F x).Nonempty)
    (_hF_convex : ∀ x ∈ K, Convex ℝ (F x))
    (_hF_closed : ∀ x ∈ K, IsClosed (F x))
    (_hF_maps : ∀ x ∈ K, F x ⊆ K) :
    ∃ x ∈ K, x ∈ F x := by
  sorry
#64
Morley's trisector theorem
morley_theorem

Verso theorem preview

theorem declaration uses `sorry`morley_theorem (A B C P Q R : LeanEval.Geometry.Morley.Plane) (h : LeanEval.Geometry.Morley.IsMorleyConfiguration A B C P Q R) : LeanEval.Geometry.Morley.IsEquilateralTriple P Q R := A:PlaneB:PlaneC:PlaneP:PlaneQ:PlaneR:Planeh:IsMorleyConfiguration A B C P Q R⊢ IsEquilateralTriple P Q R All goals completed! 🐙
#65
How produced

No Description

Normal spectral theorem
normal_spectral_theorem

Verso theorem preview

theorem declaration uses `sorry`normal_spectral_theorem (A : Matrix n n ℂ) : IsStarNormal A ↔ ∃ U ∈ unitary (Matrix n n ℂ), ∃ d : n → ℂ, A = U * diagonal d * star U := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℂ⊢ IsStarNormal A ↔ ∃ U ∈ unitary (Matrix n n ℂ), ∃ d, A = U * diagonal d * star U All goals completed! 🐙
#66
How produced

No Description

Euler–Lagrange equation
euler_lagrange_equation

Verso theorem preview

theorem declaration uses `sorry`euler_lagrange_equation {a b : ℝ} (L : ℝ → ℝ → ℝ → ℝ) (x : ℝ → ℝ) (_hab : a < b) (_hL : ContDiff ℝ 2 (fun p : ℝ × ℝ × ℝ => L p.1 p.2.1 p.2.2)) (_hx : ContDiff ℝ 2 x) (_hxe : LeanEval.Analysis.IsVariationalExtremum a b L x) : ∀ t ∈ Set.Ioo a b, lagrangianPartialX L x t = deriv (lagrangianPartialV L x) t := a:ℝb:ℝL:ℝ → ℝ → ℝ → ℝx:ℝ → ℝ_hab:a < b_hL:ContDiff ℝ 2 fun p => L p.1 p.2.1 p.2.2_hx:ContDiff ℝ 2 x_hxe:IsVariationalExtremum a b L x⊢ ∀ t ∈ Ioo a b, lagrangianPartialX L x t = deriv (lagrangianPartialV L x) t All goals completed! 🐙
#67
Kuznetsov's theorem: finitely presented simple groups have solvable word problem
boone_higman_simple

Verso theorem preview

theorem declaration uses `sorry`boone_higman_simple {G : Type*} [Group G] [IsSimpleGroup G] {n : ℕ} (φ : FreeGroup (Fin n) →* G) (_hsurj : Function.Surjective φ) (_hker : (MonoidHom.ker φ).IsFinitelyNormallyGenerated) : LeanEval.GroupTheory.BooneHigmanSimpleProblem.WordProblemSolvable φ := G:Type u_1inst✝¹:Group Ginst✝:IsSimpleGroup Gn:ℕφ:FreeGroup (Fin n) →* G_hsurj:Function.Surjective ⇑φ_hker:φ.ker.IsFinitelyNormallyGenerated⊢ WordProblemSolvable φ All goals completed! 🐙
#68
How produced

_no_response_

Runge's theorem
runge_theorem

Verso theorem preview

theorem declaration uses `sorry`runge (K : Set ℂ) (_hK : IsCompact K) (U : Set ℂ) (_hU : IsOpen U) (_hKU : K ⊆ U) (f : ℂ → ℂ) (_hf : AnalyticOnNhd ℂ f U) (ε : ℝ) (_hε : 0 < ε) : ∃ p q : ℂ[X], (∀ z ∈ K, q.eval z ≠ 0) ∧ (∀ z ∈ K, ‖f z - p.eval z / q.eval z‖ < ε) := K:Set ℂ_hK:IsCompact KU:Set ℂ_hU:IsOpen U_hKU:K ⊆ Uf:ℂ → ℂ_hf:AnalyticOnNhd ℂ f Uε:ℝ_hε:0 < ε⊢ ∃ p q, (∀ z ∈ K, Polynomial.eval z q ≠ 0) ∧ ∀ z ∈ K, ‖f z - Polynomial.eval z p / Polynomial.eval z q‖ < ε All goals completed! 🐙
#69
How produced

No Description

Schur-Weyl duality: GL(V) image equals centralizer of S_k image
glAction_range_eq_centralizer_symAction

Verso theorem preview

theorem declaration uses `sorry`glAction_range_eq_centralizer_symAction {R : Type*} [Field R] {M : Type*} [AddCommGroup M] [Module R M] [FiniteDimensional R M] {k : ℕ} [Invertible (k.factorial : R)] : Algebra.adjoin R (Set.range (LeanEval.RepresentationTheory.glAction R M k)) = Subalgebra.centralizer R (Set.range (LeanEval.RepresentationTheory.symAction R M k)) := R:Type u_1inst✝⁴:Field RM:Type u_2inst✝³:AddCommGroup Minst✝²:Module R Minst✝¹:FiniteDimensional R Mk:ℕinst✝:Invertible ↑k.factorial⊢ Algebra.adjoin R (Set.range ⇑(glAction R M k)) = Subalgebra.centralizer R (Set.range ⇑(symAction R M k)) All goals completed! 🐙
#70
How produced

_no_response_

Existence of a non-isotopic pair of oriented two-component links
exists_nonisotopic_link

Verso theorem preview

theorem declaration uses `sorry`exists_nonisotopic_link : ∃ L₁ L₂ : LeanEval.KnotTheory.TwoLink, ¬ L₁.Isotopic L₂ := ⊢ ∃ L₁ L₂, ¬L₁.Isotopic L₂ All goals completed! 🐙
#71
How produced

_no_response_

Riesz's rising sun lemma
rising_sun_lemma

Verso theorem preview

theorem declaration uses `sorry`rising_sun_lemma {a b : ℝ} (hab : a < b) {f : ℝ → ℝ} (hf : ContinuousOn f (Icc a b)) : LeanEval.Analysis.RisingSun.HasRisingSunProperty a b f := a:ℝb:ℝhab:a < bf:ℝ → ℝhf:ContinuousOn f (Icc a b)⊢ HasRisingSunProperty a b f All goals completed! 🐙
#72
Bauer's uniqueness at extreme points
bauer_extreme_point_uniqueness

Verso theorem preview

theorem declaration uses `sorry`bauer_unique [MeasurableSpace X] [BorelSpace X] (K : Set X) (hK_cpt : IsCompact K) (hK_cvx : Convex ℝ K) {x : X} (hx : x ∈ K.extremePoints ℝ) (μ : Measure X) [IsProbabilityMeasure μ] (hμ : μ Kᶜ = 0) (hbar : x = ∫ y, y ∂μ) : μ = Measure.dirac x := X:Type u_1inst✝⁵:NormedAddCommGroup Xinst✝⁴:NormedSpace ℝ Xinst✝³:CompleteSpace Xinst✝²:MeasurableSpace Xinst✝¹:BorelSpace XK:Set XhK_cpt:IsCompact KhK_cvx:Convex ℝ Kx:Xhx:x ∈ Set.extremePoints ℝ Kμ:Measure Xinst✝:IsProbabilityMeasure μhμ:μ Kᶜ = 0hbar:x = ∫ (y : X), y ∂μ⊢ μ = Measure.dirac x All goals completed! 🐙
#73
Schauder fixed-point theorem
schauder_fixed_point

Verso theorem preview

theorem declaration uses `sorry`schauder_fixed_point {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [CompleteSpace E] {K : Set E} (_hK_compact : IsCompact K) (_hK_convex : Convex ℝ K) (_hK_nonempty : K.Nonempty) (f : E → E) (_hf_cont : ContinuousOn f K) (_hf_maps : Set.MapsTo f K K) : ∃ x ∈ K, f x = x := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:CompleteSpace EK:Set E_hK_compact:IsCompact K_hK_convex:Convex ℝ K_hK_nonempty:K.Nonemptyf:E → E_hf_cont:ContinuousOn f K_hf_maps:Set.MapsTo f K K⊢ ∃ x ∈ K, f x = x All goals completed! 🐙
#74
Burnside p^a q^b theorem
finite_group_isSolvable_of_card_eq_prime_pow_mul_prime_pow

Verso theorem preview

theorem declaration uses `sorry`finite_group_isSolvable_of_card_eq_prime_pow_mul_prime_pow {G : Type*} [Group G] [Fintype G] {p q a b : ℕ} (hp : Nat.Prime p) (hq : Nat.Prime q) (hpq : p ≠ q) (hcard : Fintype.card G = p ^ a * q ^ b) : Group.IsSolvable G := G:Type u_1inst✝¹:Group Ginst✝:Fintype Gp:ℕq:ℕa:ℕb:ℕhp:Nat.Prime phq:Nat.Prime qhpq:p ≠ qhcard:Fintype.card G = p ^ a * q ^ b⊢ Group.IsSolvable G All goals completed! 🐙
#75
Trace Cayley-Hamilton / Newton identity
trace_cayley_hamilton_newton

Verso theorem preview

theorem declaration uses `sorry`trace_cayley_hamilton_newton {R : Type*} [CommRing R] (A : Matrix n n R) {k : ℕ} (hk : 1 ≤ k) : (k : R) * charpolyDescendingCoeff A k + ∑ j ∈ Finset.Icc 1 k, trace (A ^ j) * charpolyDescendingCoeff A (k - j) = 0 := n:Type u_1inst✝²:Fintype ninst✝¹:DecidableEq nR:Type u_2inst✝:CommRing RA:Matrix n n Rk:ℕhk:1 ≤ k⊢ ↑k * charpolyDescendingCoeff A k + ∑ j ∈ Finset.Icc 1 k, (A ^ j).trace * charpolyDescendingCoeff A (k - j) = 0 All goals completed! 🐙
#76
How produced

No Description

Wiener's atom-detection formula
wiener_atom_detection

Verso theorem preview

theorem declaration uses `sorry`wiener_atom_detection (μ : Measure (AddCircle (2 * Real.pi))) [IsProbabilityMeasure μ] : Tendsto (fun N : ℕ => (1 / (N : ℝ)) * ∑ k ∈ Finset.Icc (1 : ℤ) N, ‖fourierCoeffMeasure μ k‖ ^ 2) atTop (𝓝 (∑' x : AddCircle (2 * Real.pi), ((μ {x}).toReal) ^ 2)) := μ:Measure (AddCircle (2 * π))inst✝:IsProbabilityMeasure μ⊢ Tendsto (fun N => 1 / ↑N * ∑ k ∈ Finset.Icc 1 ↑N, ‖fourierCoeffMeasure μ k‖ ^ 2) atTop (𝓝 (∑' (x : AddCircle (2 * π)), (μ {x}).toReal ^ 2)) All goals completed! 🐙
#77
Abel–Ruffini theorem
abel_ruffini

Verso theorem preview

theorem declaration uses `sorry`abel_ruffini (n : ℕ) (_hn : 1 ≤ n) : (∀ p : ℚ[X], p.natDegree = n → ∀ x : ℂ, aeval x p = 0 → x ∈ solvableByRad ℚ ℂ) ↔ n ≤ 4 := n:ℕ_hn:1 ≤ n⊢ (∀ (p : ℚ[X]), p.natDegree = n → ∀ (x : ℂ), (aeval x) p = 0 → x ∈ solvableByRad ℚ ℂ) ↔ n ≤ 4 All goals completed! 🐙
#78
von Neumann double commutant theorem
vonNeumann_doubleCommutant_tfae

Verso theorem preview

theorem declaration uses `sorry`vonNeumann_doubleCommutant_tfae {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H] (S : StarSubalgebra ℂ (H →L[ℂ] H)) : List.TFAE [ Set.centralizer (Set.centralizer (S : Set (H →L[ℂ] H))) = S , IsClosed (ContinuousLinearMapWOT.ofCLM '' (S : Set (H →L[ℂ] H))) , IsClosed (ContinuousLinearMap.toPointwiseConvergenceCLM ℂ (RingHom.id ℂ) H H '' (S : Set (H →L[ℂ] H))) ] := H:Type u_1inst✝²:NormedAddCommGroup Hinst✝¹:InnerProductSpace ℂ Hinst✝:CompleteSpace HS:StarSubalgebra ℂ (H →L[ℂ] H)⊢ [(↑S).centralizer.centralizer = ↑S, IsClosed (ContinuousLinearMapWOT.ofCLM '' ↑S), IsClosed (⇑(ContinuousLinearMap.toPointwiseConvergenceCLM ℂ (RingHom.id ℂ) H H) '' ↑S)].TFAE All goals completed! 🐙
#79
How produced

_no_response_

Bing's house with two rooms is contractible
contractibleSpace_houseWithTwoRooms

Verso theorem preview

theorem declaration uses `sorry`contractibleSpace_houseWithTwoRooms : ContractibleSpace LeanEval.Topology.HouseWithTwoRooms := ⊢ ContractibleSpace ↑HouseWithTwoRooms All goals completed! 🐙
#80
How produced

_no_response_

Brouwer fixed-point theorem
brouwer_fixed_point

Verso theorem preview

theorem declaration uses `sorry`brouwer_fixed_point {d : ℕ} {K : Set (EuclideanSpace ℝ (Fin d))} (_hK_compact : IsCompact K) (_hK_convex : Convex ℝ K) (_hK_nonempty : K.Nonempty) (f : EuclideanSpace ℝ (Fin d) → EuclideanSpace ℝ (Fin d)) (_hf_cont : ContinuousOn f K) (_hf_maps : MapsTo f K K) : ∃ x ∈ K, f x = x := d:ℕK:Set (EuclideanSpace ℝ (Fin d))_hK_compact:IsCompact K_hK_convex:Convex ℝ K_hK_nonempty:K.Nonemptyf:EuclideanSpace ℝ (Fin d) → EuclideanSpace ℝ (Fin d)_hf_cont:ContinuousOn f K_hf_maps:MapsTo f K K⊢ ∃ x ∈ K, f x = x All goals completed! 🐙
#81
Linear ODE with negative-real-part eigenvalues is asymptotically stable
linear_ode_asymptotic_stability

Verso theorem preview

theorem declaration uses `sorry`linear_ode_asymptotic_stability (n : ℕ) (A : Matrix (Fin n) (Fin n) ℝ) (hA : ∀ μ : ℂ, Module.End.HasEigenvalue (Matrix.toLin' (A.map (algebraMap ℝ ℂ))) μ → μ.re < 0) (x : ℝ → (Fin n → ℝ)) (hx : ∀ t : ℝ, 0 < t → HasDerivAt x (A.mulVec (x t)) t) : Filter.Tendsto (fun t : ℝ => ‖x t‖) Filter.atTop (nhds 0) := n:ℕA:Matrix (Fin n) (Fin n) ℝhA:∀ (μ : ℂ), Module.End.HasEigenvalue (Matrix.toLin' (A.map ⇑(algebraMap ℝ ℂ))) μ → μ.re < 0x:ℝ → Fin n → ℝhx:∀ (t : ℝ), 0 < t → HasDerivAt x (A *ᵥ x t) t⊢ Filter.Tendsto (fun t => ‖x t‖) Filter.atTop (nhds 0) All goals completed! 🐙
#82
How produced

_no_response_

Koszul formula
koszul_formula

Verso theorem preview

theorem declaration uses `sorry`koszul_formula {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] [CompleteSpace E] {H : Type*} [TopologicalSpace H] {I : ModelWithCorners ℝ E H} {M : Type*} [TopologicalSpace M] [ChartedSpace H M] [IsManifold I ∞ M] [RiemannianBundle (fun (x : M) ↦ TangentSpace I x)] [IsContMDiffRiemannianBundle I ∞ E (fun (x : M) ↦ TangentSpace I x)] (cov : CovariantDerivative I E (TangentSpace I (M := M))) [ContMDiffCovariantDerivative cov ∞] (_htor : cov.torsion = 0) (_hmet : LeanEval.Geometry.KoszulFormula.IsMetricCompatible cov) (X Y Z : Π x : M, TangentSpace I x) (_hX : CMDiff ∞ (T% X)) (_hY : CMDiff ∞ (T% Y)) (_hZ : CMDiff ∞ (T% Z)) (x : M) : 2 * inner ℝ (cov Y x (X x)) (Z x) = mvfderiv I (fun y : M => inner ℝ (Y y) (Z y)) x (X x) + mvfderiv I (fun y : M => inner ℝ (X y) (Z y)) x (Y x) - mvfderiv I (fun y : M => inner ℝ (X y) (Y y)) x (Z x) - inner ℝ (X x) (mlieBracket I Y Z x) - inner ℝ (Y x) (mlieBracket I X Z x) + inner ℝ (Z x) (mlieBracket I X Y x) := E:Type u_1inst✝¹⁰:NormedAddCommGroup Einst✝⁹:NormedSpace ℝ Einst✝⁸:FiniteDimensional ℝ Einst✝⁷:CompleteSpace EH:Type u_2inst✝⁶:TopologicalSpace HI:ModelWithCorners ℝ E HM:Type u_3inst✝⁵:TopologicalSpace Minst✝⁴:ChartedSpace H Minst✝³:IsManifold I ∞ Minst✝²:RiemannianBundle fun x => TangentSpace I xinst✝¹:IsContMDiffRiemannianBundle I ∞ E fun x => TangentSpace I xcov:CovariantDerivative I E (TangentSpace I)inst✝:cov.ContMDiffCovariantDerivative ∞_htor:cov.torsion = 0_hmet:LeanEval.Geometry.KoszulFormula.IsMetricCompatible covX:(x : M) → TangentSpace I xY:(x : M) → TangentSpace I xZ:(x : M) → TangentSpace I x_hX:ContMDiff I I.tangent ∞ (T% X)_hY:ContMDiff I I.tangent ∞ (T% Y)_hZ:ContMDiff I I.tangent ∞ (T% Z)x:M⊢ 2 * Inner.inner ℝ ((↑cov Y x) (X x)) (Z x) = ((d% fun y => Inner.inner ℝ (Y y) (Z y)) x) (X x) + ((d% fun y => Inner.inner ℝ (X y) (Z y)) x) (Y x) - ((d% fun y => Inner.inner ℝ (X y) (Y y)) x) (Z x) - Inner.inner ℝ (X x) (mlieBracket I Y Z x) - Inner.inner ℝ (Y x) (mlieBracket I X Z x) + Inner.inner ℝ (Z x) (mlieBracket I X Y x) All goals completed! 🐙
#83
Real cyclotomic integer with house at most 2
cyclotomic_integer_house_le_two

Verso theorem preview

theorem declaration uses `sorry`cyclotomic_integer_house_le_two {K : Type*} [Field K] [NumberField K] [Algebra ℚ K] (n : ℕ) [NeZero n] [IsCyclotomicExtension {n} ℚ K] {β : K} (hβ_int : IsIntegral ℤ β) (hβ_real : β ∈ NumberField.maximalRealSubfield K) : house β ≤ 2 → house β = 2 ∨ ∃ m : ℕ, 0 < m ∧ house β = 2 * Real.cos (Real.pi / m) := K:Type u_1inst✝⁴:Field Kinst✝³:NumberField Kinst✝²:Algebra ℚ Kn:ℕinst✝¹:NeZero ninst✝:IsCyclotomicExtension {n} ℚ Kβ:Khβ_int:IsIntegral ℤ βhβ_real:β ∈ maximalRealSubfield K⊢ house β ≤ 2 → house β = 2 ∨ ∃ m, 0 < m ∧ house β = 2 * Real.cos (Real.pi / ↑m) All goals completed! 🐙
#84
How produced

Corrected model label for the comparator-accepted private submission of cyclotomic_integer_house_le_two. Same verified pinned commit as issue #234; the previous submission used the wrong model label.

Perron-Frobenius for irreducible nonnegative matrices
irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius

Verso theorem preview

theorem declaration uses `sorry`irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius {n : Type*} [Fintype n] [DecidableEq n] [Nonempty n] (A : Matrix n n ℝ) (hA : A.IsIrreducible) : ∃ v : n → ℝ, Module.End.HasEigenvector (Matrix.toLin' A) (spectralRadius ℝ A).toReal v ∧ (∀ i, 0 < v i) := n:Type u_1inst✝²:Fintype ninst✝¹:DecidableEq ninst✝:Nonempty nA:Matrix n n ℝhA:A.IsIrreducible⊢ ∃ v, Module.End.HasEigenvector (Matrix.toLin' A) (spectralRadius ℝ A).toReal v ∧ ∀ (i : n), 0 < v i All goals completed! 🐙
#85
Rouche theorem via zero counting
rouche_zero_count_eq

Verso theorem preview

theorem declaration uses `sorry`rouche_zero_count_eq {f g : ℂ → ℂ} {R : ℝ} (hR : 0 < R) (hf : MeromorphicNFOn f Set.univ) (hg : AnalyticOn ℂ g Set.univ) (hbound : ∀ z : ℂ, ‖z‖ = R → ‖g z‖ < ‖f z‖) : (∑ᶠ z, ((divisor (f + g) (Metric.closedBall 0 R))⁺) z) = (∑ᶠ z, ((divisor f (Metric.closedBall 0 R))⁺) z) := f:ℂ → ℂg:ℂ → ℂR:ℝhR:0 < Rhf:MeromorphicNFOn f Set.univhg:AnalyticOn ℂ g Set.univhbound:∀ (z : ℂ), ‖z‖ = R → ‖g z‖ < ‖f z‖⊢ ∑ᶠ (z : ℂ), (divisor (f + g) (Metric.closedBall 0 R))⁺ z = ∑ᶠ (z : ℂ), (divisor f (Metric.closedBall 0 R))⁺ z All goals completed! 🐙
#86
Complementary polynomial on the unit circle
exists_complementary_polynomial_on_unit_circle

Verso theorem preview

theorem declaration uses `sorry`exists_complementary_polynomial_on_unit_circle (P : ℂ[X]) (hP : ∀ z : Circle, ‖P.eval (z : ℂ)‖ ≤ 1) : ∃ Q : ℂ[X], Q.natDegree ≤ P.natDegree ∧ ∀ z : Circle, ‖P.eval (z : ℂ)‖ ^ 2 + ‖Q.eval (z : ℂ)‖ ^ 2 = 1 := P:ℂ[X]hP:∀ (z : Circle), ‖eval (↑z) P‖ ≤ 1⊢ ∃ Q, Q.natDegree ≤ P.natDegree ∧ ∀ (z : Circle), ‖eval (↑z) P‖ ^ 2 + ‖eval (↑z) Q‖ ^ 2 = 1 All goals completed! 🐙
#87
How produced

No Description

Bourbaki's locally convex extension of Banach–Alaoglu
banach_alaoglu_bourbaki

Verso theorem preview

theorem declaration uses `sorry`banach_alaoglu_bourbaki (E : Type*) [AddCommGroup E] [Module ℝ E] [TopologicalSpace E] [ContinuousAdd E] [ContinuousSMul ℝ E] [LocallyConvexSpace ℝ E] (U : Set E) (_hU : U ∈ 𝓝 (0 : E)) : IsCompact (LeanEval.Analysis.weakStarPolar E U) := E:Type u_1inst✝⁵:AddCommGroup Einst✝⁴:Module ℝ Einst✝³:TopologicalSpace Einst✝²:ContinuousAdd Einst✝¹:ContinuousSMul ℝ Einst✝:LocallyConvexSpace ℝ EU:Set E_hU:U ∈ 𝓝 0⊢ IsCompact (weakStarPolar E U) All goals completed! 🐙
#88
How produced

No Description

Linear programming: maximum principle and vertex optimality
lp_maximum_principle

Verso theorem preview

/-- **Maximum principle for linear programming** (§101). A local maximiser of the LP objective on the feasible region is automatically a global maximiser; and whenever the objective is non-constant (`c ≠ 0`), the maximiser lies on the topological frontier of the feasible region. -/ theorem declaration uses `sorry`lp_maximum_principle {m n : ℕ} (lp : LinearProgram m n) (x : Fin m → ℝ) (_hx : x ∈ lp.feasible) (_hlocal : IsLocalMaxOn lp.objective lp.feasible x) : IsMaxOn lp.objective lp.feasible x ∧ (lp.c ≠ 0 → x ∈ frontier lp.feasible) := m:ℕn:ℕlp:LinearProgram m nx:Fin m → ℝ_hx:x ∈ lp.feasible_hlocal:IsLocalMaxOn lp.objective lp.feasible x⊢ IsMaxOn lp.objective lp.feasible x ∧ (lp.c ≠ 0 → x ∈ frontier lp.feasible) All goals completed! 🐙
/-- **Vertex optimality** (§101; the existence content of Dantzig's 1947 simplex algorithm). Every linear program with a nonempty bounded feasible region admits a global maximiser that is an extreme point (vertex) of the feasible region. -/ theorem declaration uses `sorry`simplex_algorithm {m n : ℕ} (lp : LinearProgram m n) (_hfeas : lp.feasible.Nonempty) (_hbdd : Bornology.IsBounded lp.feasible) : ∃ x ∈ lp.feasible, IsMaxOn lp.objective lp.feasible x ∧ x ∈ Set.extremePoints ℝ lp.feasible := m:ℕn:ℕlp:LinearProgram m n_hfeas:lp.feasible.Nonempty_hbdd:Bornology.IsBounded lp.feasible⊢ ∃ x ∈ lp.feasible, IsMaxOn lp.objective lp.feasible x ∧ x ∈ Set.extremePoints ℝ lp.feasible All goals completed! 🐙
#89
Pell solutions are convergents of √d
pell_solution_convergent

Verso theorem preview

theorem declaration uses `sorry`pell_solution_is_convergent (d : ℤ) (_hd : Squarefree d) (_hd0 : 0 < d) (x y : ℤ) (_hx : 0 < x) (_hy : 0 < y) (_hsol : x ^ 2 - d * y ^ 2 = 1) : ∃ n : ℕ, (GenContFract.of (Real.sqrt (d : ℝ))).convs n = (x : ℝ) / (y : ℝ) := d:ℤ_hd:Squarefree d_hd0:0 < dx:ℤy:ℤ_hx:0 < x_hy:0 < y_hsol:x ^ 2 - d * y ^ 2 = 1⊢ ∃ n, (GenContFract.of √↑d).convs n = ↑x / ↑y All goals completed! 🐙
#90
Symplectic matrices have determinant 1
symplectic_matrix_det

Verso theorem preview

theorem declaration uses `sorry`symplectic_matrix_det {l R : Type*} [DecidableEq l] [Fintype l] [CommRing R] {A : Matrix (l ⊕ l) (l ⊕ l) R} (_hA : A ∈ Matrix.symplecticGroup l R) : A.det = 1 := l:Type u_1R:Type u_2inst✝²:DecidableEq linst✝¹:Fintype linst✝:CommRing RA:Matrix (l ⊕ l) (l ⊕ l) R_hA:A ∈ symplecticGroup l R⊢ A.det = 1 All goals completed! 🐙
#91
Gaussian heat kernel solves the 1D heat equation
heat_kernel_solves_heat_equation

Verso theorem preview

theorem declaration uses `sorry`heat_kernel_solves_heat_equation (f : ℝ → ℝ) (hf_cont : Continuous f) (hf_bdd : ∃ M : ℝ, ∀ x, |f x| ≤ M) : -- The PDE on (0, ∞) × ℝ. (∀ t : ℝ, 0 < t → ∀ x : ℝ, ∃ ux : ℝ → ℝ, ∃ uxx : ℝ, (∀ y : ℝ, HasDerivAt (fun z => heatSolution f t z) (ux y) y) ∧ HasDerivAt ux uxx x ∧ HasDerivAt (fun s => heatSolution f s x) uxx t) ∧ -- Initial condition recovered as a one-sided limit at t = 0. (∀ x : ℝ, Filter.Tendsto (fun t : ℝ => heatSolution f t x) (nhdsWithin (0 : ℝ) (Set.Ioi 0)) (nhds (f x))) := f:ℝ → ℝhf_cont:Continuous fhf_bdd:∃ M, ∀ (x : ℝ), |f x| ≤ M⊢ (∀ (t : ℝ), 0 < t → ∀ (x : ℝ), ∃ ux uxx, (∀ (y : ℝ), HasDerivAt (fun z => heatSolution f t z) (ux y) y) ∧ HasDerivAt ux uxx x ∧ HasDerivAt (fun s => heatSolution f s x) uxx t) ∧ ∀ (x : ℝ), Filter.Tendsto (fun t => heatSolution f t x) (nhdsWithin 0 (Set.Ioi 0)) (nhds (f x)) All goals completed! 🐙
#92
How produced

No Description

Minkowski-Caratheodory theorem
mem_convexHull_finset_extremePoints_of_mem_compact_convex

Verso theorem preview

theorem declaration uses `sorry`mem_convexHull_finset_extremePoints_of_mem_compact_convex {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] {s : Set E} {x : E} (hscomp : IsCompact s) (hsconv : Convex ℝ s) (hx : x ∈ s) : ∃ t : Finset E, (↑t : Set E) ⊆ s.extremePoints ℝ ∧ t.card ≤ Module.finrank ℝ E + 1 ∧ x ∈ convexHull ℝ (↑t : Set E) := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:FiniteDimensional ℝ Es:Set Ex:Ehscomp:IsCompact shsconv:Convex ℝ shx:x ∈ s⊢ ∃ t, ↑t ⊆ extremePoints ℝ s ∧ t.card ≤ Module.finrank ℝ E + 1 ∧ x ∈ (convexHull ℝ) ↑t All goals completed! 🐙
#93
How produced

No Description

Oppenheim's inequality for Hadamard products
oppenheim_inequality

Verso theorem preview

theorem declaration uses `sorry`oppenheim_inequality {n : Type*} [Fintype n] [DecidableEq n] {A B : Matrix n n ℝ} (hA : A.PosSemidef) (hB : B.PosSemidef) : A.det * ∏ i, B i i ≤ (A ⊙ B).det := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℝB:Matrix n n ℝhA:A.PosSemidefhB:B.PosSemidef⊢ A.det * ∏ i, B i i ≤ (A ⊙ B).det All goals completed! 🐙
#94
How produced

No Description

Character values of finite groups lie in cyclotomic fields
brauer_character_in_cyclotomic

Verso theorem preview

theorem declaration uses `sorry`brauer_character_in_cyclotomic (G : Type) [Group G] [Fintype G] : ∃ φ : CyclotomicField (Monoid.exponent G) ℚ →+* ℂ, ∀ (V : Type) (_ : AddCommGroup V) (_ : Module ℂ V) (_ : FiniteDimensional ℂ V) (ρ : Representation ℂ G V) (g : G), LinearMap.trace ℂ V (ρ g) ∈ φ.range := G:Typeinst✝¹:Group Ginst✝:Fintype G⊢ ∃ φ, ∀ (V : Type) (x : AddCommGroup V) (x_1 : Module ℂ V), FiniteDimensional ℂ V → ∀ (ρ : Representation ℂ G V) (g : G), (LinearMap.trace ℂ V) (ρ g) ∈ φ.range All goals completed! 🐙
#95
How produced

_no_response_

pi_1 of the circle is Z
pi1_circle_mulEquiv_int

Verso theorem preview

theorem declaration uses `sorry`pi1_circle_mulEquiv_int : Nonempty (HomotopyGroup.Pi 1 Circle (1 : Circle) ≃* Multiplicative ℤ) := ⊢ Nonempty (HomotopyGroup.Pi 1 Circle 1 ≃* Multiplicative ℤ) All goals completed! 🐙
#96
Dirichlet eigenvalues of -y'' = lambda y on [0,pi] are n^2
dirichlet_eigenvalues_eq_nat_sq

Verso theorem preview

theorem declaration uses `sorry`dirichlet_eigenvalues_eq_nat_sq (lam : ℝ) : (∃ (y : ℝ → ℝ) (J : Set ℝ), IsOpen J ∧ Set.Icc (0 : ℝ) Real.pi ⊆ J ∧ (∀ x ∈ J, HasDerivAt y (deriv y x) x) ∧ (∀ x ∈ J, HasDerivAt (deriv y) (-(lam * y x)) x) ∧ y 0 = 0 ∧ y Real.pi = 0 ∧ ∃ x ∈ Set.Ioo (0 : ℝ) Real.pi, y x ≠ 0) ↔ ∃ n : ℕ, 0 < n ∧ lam = (n : ℝ) ^ 2 := lam:ℝ⊢ (∃ y J, IsOpen J ∧ Set.Icc 0 π ⊆ J ∧ (∀ x ∈ J, HasDerivAt y (deriv y x) x) ∧ (∀ x ∈ J, HasDerivAt (deriv y) (-(lam * y x)) x) ∧ y 0 = 0 ∧ y π = 0 ∧ ∃ x ∈ Set.Ioo 0 π, y x ≠ 0) ↔ ∃ n, 0 < n ∧ lam = ↑n ^ 2 All goals completed! 🐙
#97
How produced

_no_response_

Entrywise exponential of a PSD matrix is PSD
posSemidef_map_exp

Verso theorem preview

theorem declaration uses `sorry`posSemidef_map_exp {n : Type*} [Fintype n] [DecidableEq n] {A : Matrix n n ℝ} (hA : A.PosSemidef) : (A.map Real.exp).PosSemidef := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℝhA:A.PosSemidef⊢ (A.map Real.exp).PosSemidef All goals completed! 🐙
#98
How produced

_no_response_

Sturm separation theorem
sturm_separation

Verso theorem preview

theorem declaration uses `sorry`sturm_separation (p q y₁ y₂ : ℝ → ℝ) (a b : ℝ) (hab : a < b) (J : Set ℝ) (hJ_open : IsOpen J) (hJ_conn : IsPreconnected J) (hJ_sub : Set.Icc a b ⊆ J) (hp : ContinuousOn p J) (hq : ContinuousOn q J) (hy₁ : ∀ x ∈ J, HasDerivAt y₁ (deriv y₁ x) x) (hy₁' : ∀ x ∈ J, HasDerivAt (deriv y₁) (-(p x * deriv y₁ x + q x * y₁ x)) x) (hy₂ : ∀ x ∈ J, HasDerivAt y₂ (deriv y₂ x) x) (hy₂' : ∀ x ∈ J, HasDerivAt (deriv y₂) (-(p x * deriv y₂ x + q x * y₂ x)) x) (hW : ∃ x₀ ∈ J, y₁ x₀ * deriv y₂ x₀ - y₂ x₀ * deriv y₁ x₀ ≠ 0) (hza : y₁ a = 0) (hzb : y₁ b = 0) (hne : ∀ x ∈ Set.Ioo a b, y₁ x ≠ 0) : ∃! c, c ∈ Set.Ioo a b ∧ y₂ c = 0 := p:ℝ → ℝq:ℝ → ℝy₁:ℝ → ℝy₂:ℝ → ℝa:ℝb:ℝhab:a < bJ:Set ℝhJ_open:IsOpen JhJ_conn:IsPreconnected JhJ_sub:Set.Icc a b ⊆ Jhp:ContinuousOn p Jhq:ContinuousOn q Jhy₁:∀ x ∈ J, HasDerivAt y₁ (deriv y₁ x) xhy₁':∀ x ∈ J, HasDerivAt (deriv y₁) (-(p x * deriv y₁ x + q x * y₁ x)) xhy₂:∀ x ∈ J, HasDerivAt y₂ (deriv y₂ x) xhy₂':∀ x ∈ J, HasDerivAt (deriv y₂) (-(p x * deriv y₂ x + q x * y₂ x)) xhW:∃ x₀ ∈ J, y₁ x₀ * deriv y₂ x₀ - y₂ x₀ * deriv y₁ x₀ ≠ 0hza:y₁ a = 0hzb:y₁ b = 0hne:∀ x ∈ Set.Ioo a b, y₁ x ≠ 0⊢ ∃! c, c ∈ Set.Ioo a b ∧ y₂ c = 0 All goals completed! 🐙
#99
How produced

_no_response_

Polynomial decay rate of y' = -y^3
cubic_decay_asymptotic

Verso theorem preview

theorem declaration uses `sorry`cubic_decay_asymptotic (y : ℝ → ℝ) (hy_diff : ∀ t : ℝ, 0 < t → HasDerivAt y (-(y t) ^ 3) t) (hy_cont : ContinuousWithinAt y (Set.Ici 0) 0) (hy0 : y 0 = 1) : Tendsto (fun t : ℝ => y t * Real.sqrt t) atTop (𝓝 (1 / Real.sqrt 2)) := y:ℝ → ℝhy_diff:∀ (t : ℝ), 0 < t → HasDerivAt y (-y t ^ 3) thy_cont:ContinuousWithinAt y (Set.Ici 0) 0hy0:y 0 = 1⊢ Tendsto (fun t => y t * √t) atTop (𝓝 (1 / √2)) All goals completed! 🐙
#100
How produced

_no_response_

Cayley graph connected iff generators generate the group
mulCayley_connected_iff_closure_eq_top

Verso theorem preview

theorem declaration uses `sorry`mulCayley_connected_iff_closure_eq_top {G : Type*} [Group G] (S : Set G) : (SimpleGraph.mulCayley S).Connected ↔ Subgroup.closure S = ⊤ := G:Type u_1inst✝:Group GS:Set G⊢ (SimpleGraph.mulCayley S).Connected ↔ Subgroup.closure S = ⊤ All goals completed! 🐙
#101
Comparison principle for the Dirichlet BVP
bvp_comparison

Verso theorem preview

theorem declaration uses `sorry`bvp_comparison (J : Set ℝ) (hJ_open : IsOpen J) (hJ_sub : Set.Icc (0 : ℝ) 1 ⊆ J) (u v : ℝ → ℝ) (hu : ∀ x ∈ J, HasDerivAt u (deriv u x) x) (hu' : ∀ x ∈ J, HasDerivAt (deriv u) (deriv (deriv u) x) x) (hv : ∀ x ∈ J, HasDerivAt v (deriv v x) x) (hv' : ∀ x ∈ J, HasDerivAt (deriv v) (deriv (deriv v) x) x) (hineq : ∀ x ∈ Set.Ioo (0 : ℝ) 1, -deriv (deriv u) x ≤ -deriv (deriv v) x) (hu0 : u 0 ≤ v 0) (hu1 : u 1 ≤ v 1) : ∀ x ∈ Set.Icc (0 : ℝ) 1, u x ≤ v x := J:Set ℝhJ_open:IsOpen JhJ_sub:Set.Icc 0 1 ⊆ Ju:ℝ → ℝv:ℝ → ℝhu:∀ x ∈ J, HasDerivAt u (deriv u x) xhu':∀ x ∈ J, HasDerivAt (deriv u) (deriv (deriv u) x) xhv:∀ x ∈ J, HasDerivAt v (deriv v x) xhv':∀ x ∈ J, HasDerivAt (deriv v) (deriv (deriv v) x) xhineq:∀ x ∈ Set.Ioo 0 1, -deriv (deriv u) x ≤ -deriv (deriv v) xhu0:u 0 ≤ v 0hu1:u 1 ≤ v 1⊢ ∀ x ∈ Set.Icc 0 1, u x ≤ v x All goals completed! 🐙
#102
Finite Ramsey theorem for graphs
finite_graph_ramsey_theorem

Verso theorem preview

theorem declaration uses `sorry`finite_graph_ramsey_theorem : ∀ r s : ℕ, 2 ≤ r → 2 ≤ s → ∃ n : ℕ, ∀ G : SimpleGraph (Fin n), ¬ G.CliqueFree r ∨ ¬ Gᶜ.CliqueFree s := ⊢ ∀ (r s : ℕ), 2 ≤ r → 2 ≤ s → ∃ n, ∀ (G : SimpleGraph (Fin n)), ¬G.CliqueFree r ∨ ¬Gᶜ.CliqueFree s All goals completed! 🐙
#103
Catalan generating function via compositional inversion
substInv_X_sub_X_sq_eq_catalan

Verso theorem preview

theorem declaration uses `sorry`substInv_X_sub_X_sq_eq_catalan (n : ℕ) : haveI : Invertible (coeff 1 ((X : ℚ⟦X⟧) - X ^ 2)) := n:ℕ⊢ Invertible ((coeff 1) (X - X ^ 2)) n:ℕ⊢ Invertible 1; All goals completed! 🐙 coeff (n + 1) (substInv ((X : ℚ⟦X⟧) - X ^ 2)) = (Nat.choose (2 * n) n : ℚ) / (↑n + 1) := n:ℕ⊢ (coeff (n + 1)) (X - X ^ 2).substInv = ↑((2 * n).choose n) / (↑n + 1) All goals completed! 🐙
#104
How produced

No Description

First submissionMay 11, 2026
Last submissionAug 20, 2026
rishistyping104
8NEAR AI w/ DeepSeek V486 solved
Wilkie's conjecture for Pfaffian structures
annals_wilkies_conjecture

Verso theorem preview

theorem declaration uses `sorry`corollary_1 (X : Set ℝⁿ) (h : WilkiesConjecture.IsRExpDefinable X) : ∃ f : MvPolynomial (Fin 2) ℝ, ∀ (g H : ℕ), Nat.card (WilkiesConjecture.degreeHeightLE X.trans g H) ≤ f.eval ![(g : ℝ), Real.log H] := n:ℕX:Set (Fin n → ℝ)h:IsRExpDefinable X⊢ ∃ f, ∀ (g H : ℕ), ↑(Nat.card ↑(degreeHeightLE X.trans g H)) ≤ (MvPolynomial.eval ![↑g, Real.log ↑H]) f All goals completed! 🐙
#1
Shafarevich's theorem on solvable Galois groups
shafarevich_solvable_galois

Verso theorem preview

theorem declaration uses `sorry`shafarevich_solvable_galois (G : Type*) [Group G] [Finite G] [Group.IsSolvable G] : ∃ (K : Type) (_ : Field K) (_ : Algebra ℚ K) (_ : FiniteDimensional ℚ K) (_ : IsGalois ℚ K), Nonempty (G ≃* (K ≃ₐ[ℚ] K)) := G:Type u_1inst✝²:Group Ginst✝¹:Finite Ginst✝:Group.IsSolvable G⊢ ∃ K x x_1, ∃ (_ : FiniteDimensional ℚ K) (_ : IsGalois ℚ K), Nonempty (G ≃* Gal(K/ℚ)) All goals completed! 🐙
#2
Motivic invariants of birational maps
annals_motivic_invariants

Verso theorem preview

/-- Statement of Theorem 1.2 (1) (a): When `𝕜` is a number field, `Cr₃(𝕜)` is not generated by pseudo-regularizable elements. -/ theorem declaration uses `sorry`theorem_1_2_1_a [NumberField 𝕜] : ¬ GenByPseudoRegularizable 𝕜 3 := 𝕜:Typeinst✝¹:Field 𝕜inst✝:NumberField 𝕜⊢ ¬GenByPseudoRegularizable 𝕜 3 All goals completed! 🐙
/-- Statement of Theorem 1.2 (1) (b): When `𝕜` is a function field over a number field, `Cr₃(𝕜)` is not generated by pseudo-regularizable elements. Here by a function field, we mean a function field of a positive-dimensional `𝔽`-variety. -/ theorem declaration uses `sorry`theorem_1_2_1_b [NumberField 𝔽] (X : Scheme) [Variety 𝔽 X] (hX : 0 < topologicalKrullDim X) : ¬ GenByPseudoRegularizable X.functionField 3 := 𝔽:Typeinst✝²:Field 𝔽inst✝¹:NumberField 𝔽X:Schemeinst✝:Variety 𝔽 XhX:0 < topologicalKrullDim ↥X⊢ ¬GenByPseudoRegularizable (↑X.functionField) 3 All goals completed! 🐙
/-- Statement of Theorem 1.2 (1) (c): When `𝕜` is a function field over a finite field, `Cr₃(𝕜)` is not generated by pseudo-regularizable elements. Here by a function field, we mean a function field of a positive-dimensional `𝔽`-variety. -/ theorem declaration uses `sorry`theorem_1_2_1_c [Finite 𝔽] (X : Scheme) [Variety 𝔽 X] (hX : 0 < topologicalKrullDim X) : ¬ GenByPseudoRegularizable X.functionField 3 := 𝔽:Typeinst✝²:Field 𝔽inst✝¹:Finite 𝔽X:Schemeinst✝:Variety 𝔽 XhX:0 < topologicalKrullDim ↥X⊢ ¬GenByPseudoRegularizable (↑X.functionField) 3 All goals completed! 🐙
/-- Statement of Theorem 1.2 (1) (d): When `𝕜` is a function field over an algebraically closed field, `Cr₃(𝕜)` is not generated by pseudo-regularizable elements. Here by a function field, we mean a function field of a positive-dimensional `𝔽`-variety. -/ theorem declaration uses `sorry`theorem_1_2_1_d [IsAlgClosed 𝔽] (X : Scheme) [Variety 𝔽 X] (hX : 0 < topologicalKrullDim X) : ¬ GenByPseudoRegularizable X.functionField 3 := 𝔽:Typeinst✝²:Field 𝔽inst✝¹:IsAlgClosed 𝔽X:Schemeinst✝:Variety 𝔽 XhX:0 < topologicalKrullDim ↥X⊢ ¬GenByPseudoRegularizable (↑X.functionField) 3 All goals completed! 🐙
/-- Statement of Theorem 1.2 (2): For subfields `𝕜 ≤ ℂ` and `n ≥ 4`, `Crₙ(𝕜)` is not generated by pseudo-regularizable elements. -/ theorem declaration uses `sorry`theorem_1_2_2 {n : ℕ} (hn : 4 ≤ n) (𝕜 : Subfield ℂ) : ¬ GenByPseudoRegularizable 𝕜 n := n:ℕhn:4 ≤ n𝕜:Subfield ℂ⊢ ¬GenByPseudoRegularizable (↥𝕜) n All goals completed! 🐙
/-- Statement of Theorem 1.2 (3): For infinite fields `𝕜` and `n ≥ 5`, `Crₙ(𝕜)` is not generated by pseudo-regularizable elements. -/ theorem declaration uses `sorry`theorem_1_2_3 {n : ℕ} (hn : 5 ≤ n) [Infinite 𝕜] : ¬ GenByPseudoRegularizable 𝕜 n := 𝕜:Typeinst✝¹:Field 𝕜n:ℕhn:5 ≤ ninst✝:Infinite 𝕜⊢ ¬GenByPseudoRegularizable 𝕜 n All goals completed! 🐙
#3
Gorenstein–Walter theorem (dihedral Sylow 2-subgroup)
gorenstein_walter

Verso theorem preview

theorem declaration uses `sorry`gorenstein_walter (G : Type) [Group G] [Finite G] [IsSimpleGroup G] (hnonab : ∃ a b : G, a * b ≠ b * a) (P : Sylow 2 G) (_hdih : ∃ n : ℕ, Nonempty ((P : Subgroup G) ≃* DihedralGroup n)) : Nonempty (G ≃* alternatingGroup (Fin 7)) ∨ ∃ p k : ℕ, ∃ _hp : Fact p.Prime, Odd p ∧ 5 ≤ p ^ k ∧ Nonempty (G ≃* PSL(2, GaloisField p k)) := G:Typeinst✝²:Group Ginst✝¹:Finite Ginst✝:IsSimpleGroup Ghnonab:∃ a b, a * b ≠ b * aP:Sylow 2 G_hdih:∃ n, Nonempty (↥↑P ≃* DihedralGroup n)⊢ Nonempty (G ≃* ↥(alternatingGroup (Fin 7))) ∨ ∃ p k, ∃ (_hp : Fact (Nat.Prime p)), Odd p ∧ 5 ≤ p ^ k ∧ Nonempty (G ≃* PSL(2, GaloisField p k)) All goals completed! 🐙
#4
The rectangular peg problem
annals_rectangular_peg_problem

Verso theorem preview

theorem declaration uses `sorry`theorem_1 (γ : Circle → ℂ) (z w : ℂ) (θ : Real.Angle) (hγ : IsSmoothEmbedding (𝓡 1) 𝓘(ℝ, ℂ) ∞ γ) : ∃ (θ' : Real.Angle), ∃ (z' w' : ℂ), Similar (R z w θ) (R z' w' θ') ∧ ∀ i : Fin 4, R z' w' θ' i ∈ Set.range γ := γ:Circle → ℂz:ℂw:ℂθ:Anglehγ:IsSmoothEmbedding (𝓡 1) 𝓘(ℝ, ℂ) ∞ γ⊢ ∃ θ' z' w', Similar (R z w θ) (R z' w' θ') ∧ ∀ (i : Fin 4), R z' w' θ' i ∈ Set.range γ All goals completed! 🐙
#5
Differentiable sphere theorem (Brendle–Schoen)
sphere_theorem_differentiable

Verso theorem preview

theorem declaration uses `sorry`differentiable_sphere_theorem [I.Boundaryless] [T2Space M] [CompactSpace M] [SimplyConnectedSpace M] (hdim : 2 ≤ Module.finrank ℝ E) (cov : CovariantDerivative I E (TangentSpace I (M := M))) [ContMDiffCovariantDerivative cov ∞] (_htor : cov.torsion = 0) (_hmet : LeanEval.Geometry.SphereTheorem.IsMetricCompatible cov) (_hpinch : LeanEval.Geometry.SphereTheorem.QuarterPinched cov) : Nonempty (M ≃ₘ⟮I, 𝓡 (Module.finrank ℝ E)⟯ (sphere (0 : EuclideanSpace ℝ (Fin (Module.finrank ℝ E + 1))) 1)) := E:Type u_1inst✝¹⁴:NormedAddCommGroup Einst✝¹³:NormedSpace ℝ Einst✝¹²:FiniteDimensional ℝ Einst✝¹¹:CompleteSpace EH:Type u_2inst✝¹⁰:TopologicalSpace HI:ModelWithCorners ℝ E HM:Type u_3inst✝⁹:TopologicalSpace Minst✝⁸:ChartedSpace H Minst✝⁷:IsManifold I ∞ Minst✝⁶:RiemannianBundle fun x => TangentSpace I xinst✝⁵:IsContMDiffRiemannianBundle I ∞ E fun x => TangentSpace I xinst✝⁴:I.Boundarylessinst✝³:T2Space Minst✝²:CompactSpace Minst✝¹:SimplyConnectedSpace Mhdim:2 ≤ Module.finrank ℝ Ecov:CovariantDerivative I E (TangentSpace I)inst✝:cov.ContMDiffCovariantDerivative ∞_htor:cov.torsion = 0_hmet:LeanEval.Geometry.SphereTheorem.IsMetricCompatible cov_hpinch:QuarterPinched cov⊢ Nonempty (M ≃ₘ⟮I, 𝓡 Module.finrank ℝ E⟯ ↑(sphere 0 1)) All goals completed! 🐙
#6
Pointwise ergodic theorems for non-conventional bilinear polynomial averages
annals_pointwise_ergodic_theorems

Verso theorem preview

/-- Statement of Theorem 1.17(i) (Mean ergodic theorem): The averages `A T N X P f g` converge as `N → ∞` in `Lᵖ(X)` norm. -/ theorem declaration uses `sorry`theorem_1_17_i {f g : 𝓧 → ℂ} (hf : MemLp f p₁ μ) (hg : MemLp g p₂ μ) : ∃ h : 𝓧 → ℂ, MemLp h p μ ∧ Tendsto (fun N ↦ eLpNorm (A T N (X : ℤ[X]) P f g - h) p μ) atTop (𝓝 0) := 𝓧:Type u_1σX:MeasurableSpace 𝓧μ:Measure 𝓧inst✝:SigmaFinite μT:𝓧 ≃ᵐ 𝓧hT:MeasurePreserving (⇑T) μ μP:ℤ[X]hP:P.degree ≥ 2p₁:ℝ≥0∞p₂:ℝ≥0∞p:ℝ≥0∞h₁p₁:1 < p₁h₁p₂:1 < p₂h₂p₁:p₁ < ∞h₂p₂:p₂ < ∞hp₁p₂p:p₁⁻¹ + p₂⁻¹ = p⁻¹hp:p⁻¹ ≤ 1f:𝓧 → ℂg:𝓧 → ℂhf:MemLp f p₁ μhg:MemLp g p₂ μ⊢ ∃ h, MemLp h p μ ∧ Tendsto (fun N => eLpNorm (A T N X P f g - h) p μ) atTop (𝓝 0) All goals completed! 🐙
/-- Statement of Theorem 1.16(ii) (Pointwise ergodic theorem): The averages `A T N X P f g` converge as `N → ∞` pointwise almost everywhere. -/ theorem declaration uses `sorry`theorem_1_17_ii {f g : 𝓧 → ℂ} (hf : MemLp f p₁ μ) (hg : MemLp g p₂ μ) : ∃ h : 𝓧 → ℂ, MemLp h p μ ∧ ∀ᵐ x ∂μ, Tendsto (fun N ↦ A T N (X : ℤ[X]) P f g x) atTop (𝓝 (h x)) := 𝓧:Type u_1σX:MeasurableSpace 𝓧μ:Measure 𝓧inst✝:SigmaFinite μT:𝓧 ≃ᵐ 𝓧hT:MeasurePreserving (⇑T) μ μP:ℤ[X]hP:P.degree ≥ 2p₁:ℝ≥0∞p₂:ℝ≥0∞p:ℝ≥0∞h₁p₁:1 < p₁h₁p₂:1 < p₂h₂p₁:p₁ < ∞h₂p₂:p₂ < ∞hp₁p₂p:p₁⁻¹ + p₂⁻¹ = p⁻¹hp:p⁻¹ ≤ 1f:𝓧 → ℂg:𝓧 → ℂhf:MemLp f p₁ μhg:MemLp g p₂ μ⊢ ∃ h, MemLp h p μ ∧ ∀ᵐ (x : 𝓧) ∂μ, Tendsto (fun N => A T N X P f g x) atTop (𝓝 (h x)) All goals completed! 🐙
/-- The constant of Theorem 1.17 (iii). -/ noncomputable def declaration uses `sorry`Cᵢᵢᵢ (P : ℤ[X]) (p₁ p₂ : ℝ≥0∞) : ℝ≥0 := sorry
/-- Statement of Theorem 1.17(iii) (Maximal ergodic theorem): There exists a constant `C ≥ 0` such that for any `f ∈ Lᵖ₁(X)` and `g ∈ Lᵖ₂(X)`, `‖A T (N : ℕ+) X P f g‖_{Lᵖ(X;ℓ∞)} ≤ C ‖f‖_{Lᵖ₁(X)} ‖g‖_{Lᵖ₂(X)}`. -/ theorem declaration uses `sorry`theorem_1_17_iii {f g : 𝓧 → ℂ} (hf : MemLp f p₁ μ) (hg : MemLp g p₂ μ) : eLpNorm (fun x ↦ ⨆ (N : ℕ+), ‖A T N (X : ℤ[X]) P f g x‖ₑ) p μ ≤ Cᵢᵢᵢ P p₁ p₂ * ‖hf.toLp‖ₑ * ‖hg.toLp‖ₑ := 𝓧:Type u_1σX:MeasurableSpace 𝓧μ:Measure 𝓧inst✝:SigmaFinite μT:𝓧 ≃ᵐ 𝓧hT:MeasurePreserving (⇑T) μ μP:ℤ[X]hP:P.degree ≥ 2p₁:ℝ≥0∞p₂:ℝ≥0∞p:ℝ≥0∞h₁p₁:1 < p₁h₁p₂:1 < p₂h₂p₁:p₁ < ∞h₂p₂:p₂ < ∞hp₁p₂p:p₁⁻¹ + p₂⁻¹ = p⁻¹hp:p⁻¹ ≤ 1f:𝓧 → ℂg:𝓧 → ℂhf:MemLp f p₁ μhg:MemLp g p₂ μ⊢ eLpNorm (fun x => ⨆ N, ‖A T (↑↑N) X P f g x‖ₑ) p μ ≤ ↑(Cᵢᵢᵢ P p₁ p₂) * ‖MemLp.toLp f hf‖ₑ * ‖MemLp.toLp g hg‖ₑ All goals completed! 🐙
/-- The constant of Theorem 1.17 (iv). -/ noncomputable def declaration uses `sorry`Cᵢᵥ (P : ℤ[X]) (p₁ p₂ : ℝ≥0∞) (r Λ : ℝ≥0) : ℝ≥0 := sorry
/-- Statement of Theorem 1.17(iv) (Long variational ergodic theorem): For any `r > 2` and `Λ > 1`, there exists a constant `C ≥ 0` such that for any `f ∈ Lᵖ₁(X)`, `g ∈ Lᵖ₂(X)` and `Λ`-lacunary sequence `a` such that `1 ≤ a n` for all `n ∈ ℕ`, `‖A T (a n) X P f g‖_{Lᵖ(X;Vʳ)} ≤ C ‖f‖_{Lᵖ₁(X)} ‖g‖_{Lᵖ₂(X)}`. -/ theorem declaration uses `sorry`theorem_1_17_iv (r Λ : ℝ≥0) (hr : r > 2) (hΛ : Λ > 1) {f g : 𝓧 → ℂ} (hf : MemLp f p₁ μ) (hg : MemLp g p₂ μ) (a : ℕ → ℝ≥0) (ha : Lacunary Λ a) (ha' : ∀ n, 1 ≤ a n) : eLpNorm (fun x ↦ variationalNorm r fun n ↦ A T (a n) X P f g x) p μ ≤ Cᵢᵥ P p₁ p₂ r Λ * ‖hf.toLp‖ₑ * ‖hg.toLp‖ₑ := 𝓧:Type u_1σX:MeasurableSpace 𝓧μ:Measure 𝓧inst✝:SigmaFinite μT:𝓧 ≃ᵐ 𝓧hT:MeasurePreserving (⇑T) μ μP:ℤ[X]hP:P.degree ≥ 2p₁:ℝ≥0∞p₂:ℝ≥0∞p:ℝ≥0∞h₁p₁:1 < p₁h₁p₂:1 < p₂h₂p₁:p₁ < ∞h₂p₂:p₂ < ∞hp₁p₂p:p₁⁻¹ + p₂⁻¹ = p⁻¹hp:p⁻¹ ≤ 1r:ℝ≥0Λ:ℝ≥0hr:r > 2hΛ:Λ > 1f:𝓧 → ℂg:𝓧 → ℂhf:MemLp f p₁ μhg:MemLp g p₂ μa:ℕ → ℝ≥0ha:Lacunary Λ aha':∀ (n : ℕ), 1 ≤ a n⊢ eLpNorm (fun x => variationalNorm r fun n => A T (a n) X P f g x) p μ ≤ ↑(Cᵢᵥ P p₁ p₂ r Λ) * ‖MemLp.toLp f hf‖ₑ * ‖MemLp.toLp g hg‖ₑ All goals completed! 🐙
#7
Hausdorff dimension of the Mandelbrot boundary (Shishikura)
mandelbrot_boundary_dimh

Verso theorem preview

theorem declaration uses `sorry`mandelbrot_boundary_dimh : dimH (frontier LeanEval.Dynamics.MandelbrotBoundary.Mandelbrot) = 2 := ⊢ dimH (frontier Mandelbrot) = 2 All goals completed! 🐙
#8
Friedlander–Iwaniec theorem
friedlander_iwaniec

Verso theorem preview

theorem declaration uses `sorry`friedlander_iwaniec : {p : ℕ | p.Prime ∧ ∃ a b, p = a ^ 2 + b ^ 4}.Infinite := ⊢ {p | Nat.Prime p ∧ ∃ a b, p = a ^ 2 + b ^ 4}.Infinite All goals completed! 🐙
#9
Linnik's theorem (L = 5.5)
linnik

Verso theorem preview

theorem declaration uses `sorry`linnik : ∃ c : ℝ, ∀ ⦃a d : ℕ⦄, 0 < a → a < d → a.Coprime d → p a d ≤ c * d ^ (5.5 : ℝ) := ⊢ ∃ c, ∀ ⦃a d : ℕ⦄, 0 < a → a < d → a.Coprime d → ↑(p a d) ≤ c * ↑d ^ 5.5 All goals completed! 🐙
#10
Mandelbar (tricorn) is not path-connected (Hubbard–Schleicher)
mandelbar_not_path_connected

Verso theorem preview

theorem declaration uses `sorry`mandelbar_not_path_connected : ¬ IsPathConnected LeanEval.ComplexAnalysis.Mandelbar := ⊢ ¬IsPathConnected Mandelbar All goals completed! 🐙
#11
Milnor's exotic 7-sphere
milnor_exotic_sphere_seven

Verso theorem preview

theorem declaration uses `sorry`milnor_exotic_sphere_seven : ∃ (M : Type) (_ : TopologicalSpace M) (_ : ChartedSpace (EuclideanSpace ℝ (Fin 7)) M) (_ : IsManifold (𝓡 7) ∞ M) (_homeo : M ≃ₜ sphere (0 : EuclideanSpace ℝ (Fin 8)) 1), IsEmpty (M ≃ₘ⟮𝓡 7, 𝓡 7⟯ sphere (0 : EuclideanSpace ℝ (Fin 8)) 1) := ⊢ ∃ M x x_1, ∃ (_ : IsManifold (𝓡 7) ∞ M), ∃ _homeo, IsEmpty (M ≃ₘ⟮𝓡 7, 𝓡 7⟯ ↑(sphere 0 1)) All goals completed! 🐙
#12
Higher uniformity of bounded multiplicative functions in short intervals on average
annals_bounded_multiplicative_functions

Lean theorem statement

/--
Statement of Theorem 1.3 (Non-pretentious multiplicative functions do not correlate
with polynomial phases on short intervals on average):

Let `k : ℕ`, `θ : ℝ` such that `0 < θ < 1/2` and `η : ℝ` such that `η > 0`. Then there exist
constants `Q : ℕ` such that `Q > 0`, `C : ℝ` such that `C > 0`, and `B : ℝ`, such that for any
multiplicative 1-bounded arithmetic function `f : ℕ → ℂ`, any `X : ℝ` such that `X ≥ 1` and any
`H : ℝ` such that `Xᶿ ≤ H ≤ X¹⁻ᶿ`, if

`∫ x ∈ [X, 2X], ‖f‖_{uᵏ⁺¹[x, x + H]}dx ≥ ηX`

then

`M(f;CXᵏ⁺¹/Hᵏ⁺¹,Q) ≤ B`.
-/
theorem theorem_1_3 (k : ℕ) (θ : ℝ) (hθ₀ : 0 < θ) (hθ₁ : θ < 1 / 2) (η : ℝ) (hη : η > 0) :
    ∃ (Q : ℕ+) (_hQ : 1 ≤ Q) (C : ℝ) (_hC : 0 < C) (B : ℝ),
      ∀ (f : ArithmeticFunction ℂ) (_hf : f.IsMultiplicative) (_hf' : IsOneBounded f)
        (X : ℝ) (_hX : X ≥ 1) (H : ℝ) (_hXH : X ^ θ ≤ H) (_hHX : H ≤ X ^ (1 - θ)),
          ∫ x in X..(2 * X), weakGowersUniformityNorm k x H f.intExtension ≥ η * X →
            M f (C * X ^ (k + 1) / H ^ (k + 1)) Q ≤ B := by
  sorry

/--
Statement of Corollary 1.1 (Liouville does not correlate with polynomial phases on
short intervals on average):

Let `λ` denote the liouville function. Fix `k : ℕ` and `θ : ℝ` such that `0 < θ < 1`. Then

`∫ x ∈ [X, 2X], ‖λ‖_{uᵏ⁺¹[x, x + Xᶿ]}dx = o(X)`

as `X → ∞`.
-/
theorem corollary_1_1 (k : ℕ) (θ : ℝ) (hθ₀ : 0 < θ) (hθ₁ : θ < 1) :
    (fun X ↦ ∫ x in X..(2 * X), weakGowersUniformityNorm k x (X ^ θ) (fun n ↦ liouville ⌊n⌋₊))
      =o[atTop] (fun X ↦ X) := by
  sorry
#13
Integer multiplication in time O(n log n)
annals_integer_multiplication

Verso theorem preview

theorem declaration uses `sorry`theorem_1_1 : ∃ T : TM2ComputableInTime (IntegerMultiplication.encodeProd encodeNat encodeNat) encodeNat (fun (x, y) ↦ x * y), (fun n ↦ (T.time n : ℝ)) =O[Filter.atTop] (fun n ↦ n * log n) := ⊢ ∃ T, (fun n => ↑(T.time n)) =O[Filter.atTop] fun n => ↑n * log ↑n All goals completed! 🐙
#14
Serre finiteness for homotopy groups of spheres
pi_sphere_infinite_iff

Verso theorem preview

theorem declaration uses `sorry`pi_sphere_infinite_iff (k n : ℕ) (hn : 1 ≤ n) (x : Metric.sphere (0 : EuclideanSpace ℝ (Fin (n + 1))) 1) : Infinite (HomotopyGroup.Pi k (Metric.sphere (0 : EuclideanSpace ℝ (Fin (n + 1))) 1) x) ↔ k = n ∨ (Even n ∧ k + 1 = 2 * n) := k:ℕn:ℕhn:1 ≤ nx:↑(Metric.sphere 0 1)⊢ Infinite (HomotopyGroup.Pi k (↑(Metric.sphere 0 1)) x) ↔ k = n ∨ Even n ∧ k + 1 = 2 * n All goals completed! 🐙
#15
On property (T) for Aut(F_n) and SL_n(Z)
annals_on_property_t

Verso theorem preview

theorem declaration uses `sorry`theorem_1 (n : ℕ) (hn : n ≥ 6) : OnPropertyT.PropertyT (MulAut (FreeGroup (Fin n))) := n:ℕhn:n ≥ 6⊢ PropertyT (MulAut (FreeGroup (Fin n))) All goals completed! 🐙
#16
Fourier interpolation in dimensions 8 and 24
ckmrv_fourier_interpolation

Lean theorem statement

/-- **Cohn-Kumar-Miller-Radchenko-Viazovska Fourier interpolation theorem.**
In dimension 8 sampling starts at `sqrt 2`, while in dimension 24 it starts
at radius `2`. In both cases the four sample sequences give a bijection
between radial Schwartz functions and rapidly decreasing data. -/
theorem ckmrv_fourier_interpolation :
    CKMRV 8 1 ∧ CKMRV 24 2 := by
  sorry
#17
The energy of dilute Bose gases
annals_bose_gases

Lean theorem statement

/-- Constant `η` in Theorem 1.2. -/
noncomputable def η : ℝ := sorry

/-- Constant `𝓒` in Theorem 1.2. -/
noncomputable def 𝓒 (𝓡 : ℝ) (r : ℝ) : ℝ := sorry

/--
Statement of Theorem 1.2 (The Lee-Huang-Yang Formula):

For any non-zero, non-negative, radial potential `v ∈ L¹(ℝ³)` with compact support contained
in some ball `B(0,R)`, there exists `η > 0` and `𝓒` (depending only on `𝓡`and `R / a`) such that
as `ρ → 0⁺`,

`e ρ v ≥ 4πρ²a(1 + 128/(15√π)√(ρa³) - 𝓒(ρa³)^{1/2 + η})`.

Note: We (equivalently) take the limit as `ρ → 0⁺` rather than `ρa³ → 0⁺` as in the paper.

Note: While the wording of Theorem 1.2 in the paper suggests that `η` should also be allowed to
depend on `𝓡` and `R / a`, Theorem 6.8 makes it clear that `η` is in fact a universal constant.

Note: Since `v` is in `L¹(ℝ³)`, we interpret `v ≠ 0` to mean that `v` is not zero in `L¹(ℝ³)`.
-/
theorem theorem_1_2 (v : ℝ³ → ℝ) (hv_ne_zero : ¬ v =ᵐ[volume] 0) (hv_nonneg : 0 ≤ v)
    (hv_radial : IsRadial v) (hv_memL1 : MemLp v 1) {R : ℝ} (hR : 0 < R)
    (hv_supp : tsupport v ⊆ ball 0 R) : 0 < η ∧ ∀ᶠ ρ in 𝓝[>] 0,
      e ρ v ≥ 4 * π * ρ ^ 2 * a v * (1 + (128 / (15 * √ π)) * √ (ρ * a v ^ 3) -
        𝓒 (𝓡 v) (R / a v) * (ρ * a v ^ 3) ^ (1 / 2 + η)) := by
  sorry
#18
Bender–Suzuki theorem (classification of finite simple groups with a strongly-embedded subgroup)
bender_suzuki

Lean theorem statement

/-- **Bender–Suzuki theorem.** -/
theorem bender_suzuki {X : Type*} [Group X] [Finite X] [IsSimpleGroup X]
    (M : Subgroup X) (h : IsStronglyEmbedded M) :
    IsSimpleBenderGroup X := by
  sorry
#19
On the coherence of one-relator groups and their group algebras
annals_on_coherence_of_one_relator_groups

Lean theorem statement

/--
Statement of Theorem 1.1:

Let `G` be a one-relator group and `K` be a field of characteristic zero.
Then `G` is a coherent group and the group algebra `K[G]` is a coherent ring.
-/
theorem theorem_1_1 (G K : Type*) [Group G] [Field K] [CharZero K] (hG : Group.OneRelator G) :
    Group.Coherent G ∧ Ring.Coherent (MonoidAlgebra K G) := by
  sorry
#20
A proof of the Erdős–Faber–Lovász conjecture
annals_erdos_faber_lovasz_conjecture

Lean theorem statement

/--
Statement of Theorem 1.1:

For sufficiently large `n : ℕ`, every linear hypergraph on `n` vertices has chromatic index
at most `n`.
-/
theorem theorem_1_1 :
    ∀ᶠ n in atTop, ∀ 𝓗 : Hypergraph (Fin n), 𝓗.IsLinear → 𝓗.chromaticIndex ≤ n := by
  sorry
#21
Existence of an aspherical integer homology 4-sphere
aspherical_integer_homology_four_sphere

Lean theorem statement

/-- **Existence of an aspherical integer homology 4-sphere** (Tschantz, answering
`[Kir97, Problem 4.17]`). There is a closed topological 4-manifold that is both
aspherical and an integer homology 4-sphere. -/
theorem aspherical_integer_homology_four_sphere :
    ∃ M : Closed4Manifold, M.IsAspherical ∧ M.IsIntegerHomologySphere := by
  sorry
#22
pi_6 of the 3-sphere is Z/12
pi6_sphere_three_mulEquiv_zmod_twelve

Lean theorem statement

/-- **π₆ of the 3-sphere.** Toda's tables give `π₆(𝕊³) ≅ ℤ/12`. -/
theorem pi6_sphere_three_mulEquiv_zmod_twelve
    (x : Metric.sphere (0 : EuclideanSpace ℝ (Fin 4)) 1) :
    Nonempty
      (HomotopyGroup.Pi 6 (Metric.sphere (0 : EuclideanSpace ℝ (Fin 4)) 1) x ≃*
        Multiplicative (ZMod 12)) := by
  sorry
#23
Jacobian of a smooth proper curve (Merten challenge)
jacobian_challenge_alggeo

Lean theorem statement

/-- The genus of a smooth proper curve. -/
def genus (C : Over (Spec (.of k))) [IsProper C.hom] [SmoothOfRelativeDimension 1 C.hom]
    [GeometricallyIrreducible C.hom] : ℕ :=
  sorry

/-- The Jacobian of a smooth, proper curve over a field `k`. -/
def Jacobian (C : Over (Spec (.of k))) [IsProper C.hom] [SmoothOfRelativeDimension 1 C.hom]
    [GeometricallyIrreducible C.hom] : Over (Spec (.of k)) :=
  sorry

/-- The group scheme structure on the Jacobian of the curve `C`. -/
instance instGrpObj : GrpObj (Jacobian C) :=
  sorry

/-- The Jacobian of `C` is smooth of relative dimension `g` over `k`, where `g` is the
genus of `C`. -/
instance smoothOfRelativeDimension_genus :
    SmoothOfRelativeDimension (genus C) (Jacobian C).hom :=
  sorry

/-- The Jacobian of `C` is proper over `k`. -/
instance instIsProper : IsProper (Jacobian C).hom :=
  sorry

/-- The Jacobian of `C` is geometrically irreducible over `k`. -/
instance instGeometricallyIrreducible : GeometricallyIrreducible (Jacobian C).hom :=
  sorry

/-- The Abel-Jacobi map from a smooth, proper curve to its Jacobian associated
to a `k`-rational point of `C`. -/
def ofCurve (P : 𝟙_ (Over (Spec (.of k))) ⟶ C) : C ⟶ Jacobian C :=
  sorry

/-- The Abel-Jacobi map sends the `k`-rational point `P` to `0`, where `0` (denoted by `η` below) is
the neutral element of the group scheme `Jacobian C`. -/
theorem comp_ofCurve (C : Over (Spec (.of k))) [IsProper C.hom]
    [SmoothOfRelativeDimension 1 C.hom] [GeometricallyIrreducible C.hom]
    (P : 𝟙_ (Over (Spec (.of k))) ⟶ C) :
    P ≫ ofCurve P = η[Jacobian C] :=
  sorry

/--
The universal property of the Jacobian variety: For any abelian variety `A`,
any morphism `f : C ⟶ A` such that `f(P) = 0` factors uniquely through the
Jacobian of `C`.
In other words, `Jacobian C` is the Albanese variety of `C`.
-/
theorem exists_unique_ofCurve_comp (C : Over (Spec (.of k))) [IsProper C.hom]
    [SmoothOfRelativeDimension 1 C.hom] [GeometricallyIrreducible C.hom]
    (P : 𝟙_ (Over (Spec (.of k))) ⟶ C)
    {A : Over (Spec (.of k))} [Smooth A.hom] [IsProper A.hom] [GrpObj A]
    [GeometricallyIrreducible A.hom] (f : C ⟶ A) (hf : P ≫ f = η[A]) :
    ∃! (g : Jacobian C ⟶ A), f = ofCurve P ≫ g :=
  sorry
#24
Linear independence results of Calegari–Dimitrov–Tang
cdt_linearIndependent

Lean theorem statement

/--
Theorem A and C in arXiv:2408.15403.
-/
theorem cdt_linearIndependent :
    letI χ : ZMod 3 → ℂ := ![0, 1, -1]
    LinearIndependent ℚ ![1, riemannZeta 2, ZMod.LFunction χ 2] ∧
    ∀ m n : ℤ, m ≠ -1 → m ≠ 0 → n ≠ -1 → n ≠ 0 → 10 ^ 6 * |m - n| < |n| →
      letI lm := Real.log (1 + 1 / m)
      letI ln := Real.log (1 + 1 / n)
      Irrational (lm * ln) ∧
      (m ≠ n → LinearIndependent ℚ ![1, lm, ln, lm * ln]) := by
  sorry
#25
Baker-Wüstholz theorem on linear forms in logarithms
bakerWustholz_linearForms_logs

Verso theorem preview

theorem declaration uses `sorry`bakerWustholz_linearForms_logs {n : ℕ} (hn : 0 < n) {K : Type*} [Field K] [NumberField K] (φ : K →+* ℂ) (α : Fin n → K) (hα : ∀ i, α i ≠ 0) (b : Fin n → ℤ) {B : ℕ} (hB : 2 ≤ B) (hbB : ∀ i, (b i).natAbs ≤ B) (hΛ_ne_zero : (∑ i, (b i : ℂ) * Complex.log (φ (α i))) ≠ 0) : Real.log ‖∑ i, (b i : ℂ) * Complex.log (φ (α i))‖ ≥ -(BakerWustholz.C n (Module.finrank ℚ K) * max (Real.log B) (1 / (Module.finrank ℚ K : ℝ)) * ∏ i, BakerWustholz.modifiedHeight φ (α i)) := n:ℕhn:0 < nK:Type u_1inst✝¹:Field Kinst✝:NumberField Kφ:K →+* ℂα:Fin n → Khα:∀ (i : Fin n), α i ≠ 0b:Fin n → ℤB:ℕhB:2 ≤ BhbB:∀ (i : Fin n), (b i).natAbs ≤ BhΛ_ne_zero:∑ i, ↑(b i) * log (φ (α i)) ≠ 0⊢ Real.log ‖∑ i, ↑(b i) * log (φ (α i))‖ ≥ -(BakerWustholz.C n (Module.finrank ℚ K) * max (Real.log ↑B) (1 / ↑(Module.finrank ℚ K)) * ∏ i, BakerWustholz.modifiedHeight φ (α i)) All goals completed! 🐙
#26
Avila-Jitomirskaya Ten Martini Problem
ten_martini_problem

Lean theorem statement

/-- **Avila-Jitomirskaya Ten Martini theorem.** For irrational frequency
and nonzero coupling, the spectrum of the almost Mathieu operator is a
Cantor set. Here this means nonempty, compact, perfect, and totally
disconnected. -/
theorem ten_martini_problem (α coupling θ : ℝ)
    (hα : Irrational α) (hcoupling : coupling ≠ 0) :
    ∃ H : EllTwo →L[ℂ] EllTwo,
      IsAlmostMathieuOperator α coupling θ H ∧
        (spectrum ℂ H).Nonempty ∧
        IsCompact (spectrum ℂ H) ∧
        Perfect (spectrum ℂ H) ∧
        IsTotallyDisconnected (spectrum ℂ H) := by
  sorry
#27
The Hasse principle for random Fano hypersurfaces
annals_hasse_principle_random_fano

Lean theorem statement

/--
Statement of Theorem 1.1:

Let `d ≥ 2` and `n ≥ d` with `(d, n) ≠ (3, 3)`. Then we have `lim_{A → ∞} ρ_{d,n}(A) = ρˡᵒᶜ_{d,n}`.
-/
theorem theorem_1_1 (hd : 2 ≤ d) (h₁ : d ≤ n) (h₂ : (d, n) ≠ (3, 3)) :
    Tendsto (ρ d n) atTop (nhds (ρLoc d n)) := by
  sorry
#28
Smallness of exceptional set to Littlewood's conjecture
einsiedler_katok_lindenstrauss

Lean theorem statement

theorem einsiedler_katok_lindenstrauss :
    dimH {(α, β) : ℝ × ℝ | Filter.atTop.liminf
      (fun n : ℕ ↦ n * distToNearestInt (n * α) * distToNearestInt (n * β)) > 0} = 0 := by
  sorry
#29
Equichordal point theorem (convex curves have a unique equichordal point)
equichordal_point_unique

Verso theorem preview

theorem declaration uses `sorry`equichordal_point_unique {K : Set LeanEval.Geometry.Equichordal.Plane} (hK : IsCompact K) (hconv : Convex ℝ K) (hne : (interior K).Nonempty) : ¬ ∃ P Q : LeanEval.Geometry.Equichordal.Plane, P ≠ Q ∧ LeanEval.Geometry.Equichordal.IsEquichordalPoint K P ∧ LeanEval.Geometry.Equichordal.IsEquichordalPoint K Q := K:Set PlanehK:IsCompact Khconv:Convex ℝ Khne:(interior K).Nonempty⊢ ¬∃ P Q, P ≠ Q ∧ IsEquichordalPoint K P ∧ IsEquichordalPoint K Q All goals completed! 🐙
#30
Whitney embedding theorem (strong form, dimension 2n)
whitney_embedding

Lean theorem statement

/-- **Whitney embedding theorem** (Whitney 1944). Every smooth
`n`-manifold (`n ≥ 1`, Hausdorff, second-countable) admits a smooth
embedding into `ℝ^{2n}`. -/
theorem whitney_embedding (n : ℕ) (_hn : 1 ≤ n)
    {M : Type*} [TopologicalSpace M]
    [ChartedSpace (EuclideanSpace ℝ (Fin n)) M] [IsManifold (𝓡 n) ∞ M]
    [T2Space M] [SecondCountableTopology M] :
    ∃ e : M → EuclideanSpace ℝ (Fin (2 * n)),
      ContMDiff (𝓡 n) (𝓡 (2 * n)) ∞ e ∧
      IsEmbedding e ∧
      ∀ x : M, Function.Injective (mfderiv (𝓡 n) (𝓡 (2 * n)) e x) := by
  sorry
#31
Mostow rigidity
mostow_rigidity

Lean theorem statement

theorem mostow_rigidity (n : ℕ) (hn : 3 ≤ n) (Γ Λ : Subgroup (PO n 1))
    (disc_Γ : IsDiscrete (SetLike.coe Γ)) (disc_Λ : IsDiscrete (SetLike.coe Λ))
    [HasFundamentalDomain Γ (PO n 1)] [HasFundamentalDomain Λ (PO n 1)]
    (covol_Γ : covolume Γ (PO n 1) ≠ ⊤) (covol_Λ : covolume Λ (PO n 1) ≠ ⊤)
    (f : Γ ≃* Λ) : ∃ g : PO n 1, ∀ γ : Γ, f γ = g * γ * g⁻¹ := by
  sorry
#32
Adams: S^n is an H-space iff n = 0, 1, 3, 7
hSpace_sphere_iff

Lean theorem statement

/-- **Adams' Hopf-invariant-one theorem** (H-space form). The sphere `𝕊ⁿ`
admits an H-space structure if and only if `n = 0`, `1`, `3`, or `7`. -/
theorem hSpace_sphere_iff (n : ℕ) :
    Nonempty (HSpace (Metric.sphere (0 : EuclideanSpace ℝ (Fin (n + 1))) 1)) ↔
      n = 0 ∨ n = 1 ∨ n = 3 ∨ n = 7 := by
  sorry
#33
Inscribed rectangles in a smooth Jordan curve attain at least one third of all aspect ratios
annals_inscribed_rectangles

Lean theorem statement

/--
Statement of Theorem 1:

Let `γ` be a smooth Jordan curve, and let `X` be the set of all `r ∈ [0,1]` so that there is an
inscribed rectangle in `γ` of aspect ratio `tan(r·π/4)`.
Then the Lebesgue measure of `X` is at least `1/3`.
-/
theorem theorem_1 (γ : Circle → ℝ × ℝ) (hγ : IsSmoothEmbedding (𝓡 1) 𝓘(ℝ, ℝ × ℝ) ∞ γ) :
    volume (X γ) ≥ 1/3 := by
  sorry
#34
Pardon's lower bound for torus-knot distortion
pardon_torus_knot_distortion

Lean theorem statement

/-- **Pardon's torus-knot distortion bound (smooth specialization).**

If `p` and `q` are positive and coprime, every smooth knot in the
orientation-preserving smooth ambient-isotopy class of the explicit standard
`(p, q)`-torus curve has distortion at least `min(p, q) / 160`. -/
theorem pardon_torus_knot_distortion
    (p q : ℕ) (_hp : 0 < p) (_hq : 0 < q) (_hc : Nat.Coprime p q)
    (K : Knot)
    (_hclass : ∃ Φ : AmbientIsotopy, ∃ σ : CircleReparam,
      ∀ t, Φ.H 1 (K.curve t) = standardTorusCurve p q (σ.f t)) :
    (1 / 160 : ℝ≥0∞) * (Nat.min p q : ℝ≥0∞) ≤ distortion K := by
  sorry
#35
Pannwitz–Kuperberg quadrisecant theorem
smooth_knot_has_quadrisecant

Lean theorem statement

/-- **Quadrisecant theorem** (Pannwitz–Kuperberg). Every smooth nontrivial knot
has a quadrisecant. -/
theorem smooth_knot_has_quadrisecant
    {r : ℝ → Space} (_hknot : IsSmoothKnot r) (_hnontrivial : ¬ IsUnknotted r) :
    HasQuadrisecant r := by
  sorry
#36
230 space groups (Fedorov 1891 / Schoenflies 1891)
space_groups_230

Lean theorem statement

/-- **230 space groups** (Fedorov 1891; Schoenflies 1891). In
dimension 3 there are 230 space groups (orientation-preserving
equivalence), 219 (general affine equivalence), and 65 orientation-
preserving subfamily. -/
theorem space_groups :
    crystallographicCountOP 3 = 230 ∧
      crystallographicCount 3 = 219 ∧
        crystallographicCountOPOnly 3 = 65 := by
  sorry
#37
Good Locally Testable Codes
annals_good_lt_codes

Lean theorem statement

/--
Statement of Theorem 1.2:

There exist explicit good locally testable codes (for every rate `ρ < 1`).
-/
theorem theorem_1_2 (ρ : ℝ≥0) (hρ : ρ < 1) :
    ∃ q, ∃ κ ≠ 0, ∃ (n : ℕ → ℕ), ∃ (𝒞 : (i : ℕ) → BinaryCode (n i)), IsGood 𝒞 ∧
      ∀ i, Nonempty (LTC q κ (𝒞 i)) ∧ rate (𝒞 i) ≥ ρ := by
  sorry
#38
Newlander–Nirenberg theorem
newlander_nirenberg

Lean theorem statement

/-- **The Newlander–Nirenberg theorem.** An almost complex structure with
vanishing Nijenhuis tensor is integrable. Formally: for every `x` in an open
set `U ⊆ ℝ^{2n}` carrying such a structure `J` there is a smooth local
diffeomorphism `φ` (an `OpenPartialHomeomorph`, smooth in both directions)
from a neighbourhood of `x` inside `U` onto an open subset of `ℂⁿ` whose
differential is complex linear:

  `dφ_y (J y v) = i · dφ_y v`.

Such charts are holomorphic coordinates for `J`. -/
theorem newlander_nirenberg {n : ℕ} {U : Set (E n)} (_hU : IsOpen U)
    (J : E n → E n →L[ℝ] E n) (_hJ : IsAlmostComplexOn J U)
    (_hN : NijenhuisVanishesOn J U) {x : E n} (_hx : x ∈ U) :
    ∃ φ : OpenPartialHomeomorph (E n) (EuclideanSpace ℂ (Fin n)),
      x ∈ φ.source ∧ φ.source ⊆ U ∧
      ContDiffOn ℝ ∞ (φ : E n → EuclideanSpace ℂ (Fin n)) φ.source ∧
      ContDiffOn ℝ ∞ (φ.symm : EuclideanSpace ℂ (Fin n) → E n) φ.target ∧
      ∀ y ∈ φ.source, ∀ v : E n,
        fderiv ℝ (φ : E n → EuclideanSpace ℂ (Fin n)) y (J y v)
          = Complex.I • fderiv ℝ (φ : E n → EuclideanSpace ℂ (Fin n)) y v := by
  sorry
#39
Bourgain's polynomial ergodic theorem
bourgain_polynomial_ergodic

Lean theorem statement

/-- Bourgain's polynomial ergodic theorem: for every integer-polynomial
iterate sequence and every `L^p`, `p > 1`, function, the polynomial ergodic
averages converge pointwise almost everywhere. -/
theorem bourgain_polynomial_ergodic
    [IsProbabilityMeasure μ] {p : ℝ≥0∞} (hp : 1 < p) (hp_ne_top : p ≠ ∞)
    {T : X → X} (hT : MeasurePreserving T μ μ)
    {a : ℕ → ℕ} (ha : IsIntegerPolynomialSequence a)
    {f : X → ℝ} (hf : MemLp f p μ) :
    ∃ F : X → ℝ,
      ∀ᵐ x ∂μ,
        Tendsto (fun n : ℕ => polynomialErgodicAverage a T f (n + 1) x) atTop (𝓝 (F x)) := by
  sorry
#40
Topological sphere theorem (Berger–Klingenberg–Rauch)
sphere_theorem_topological

Lean theorem statement

/-- **Topological sphere theorem** (Berger–Klingenberg–Rauch 1960). A closed,
simply-connected, smooth `d`-manifold (`d ≥ 2`) whose Levi-Civita connection is
strictly quarter-pinched is homeomorphic to the standard `d`-sphere. -/
theorem sphere_theorem
    [I.Boundaryless] [T2Space M] [CompactSpace M] [SimplyConnectedSpace M]
    (hdim : 2 ≤ Module.finrank ℝ E)
    (cov : CovariantDerivative I E (TangentSpace I (M := M)))
    [ContMDiffCovariantDerivative cov ∞]
    (_htor : cov.torsion = 0) (_hmet : IsMetricCompatible cov)
    (_hpinch : QuarterPinched cov) :
    Nonempty
      (M ≃ₜ sphere (0 : EuclideanSpace ℝ (Fin (Module.finrank ℝ E + 1))) 1) := by
  sorry
#41
Existence of a 779247-dim irreducible e₈-representation with 40 tensor-square isotypic components
e8_irrep_tensor_square_decomp

Lean theorem statement

theorem e8_irrep_tensor_square_decomp :
    ∃ (V : Type) (_ : AddCommGroup V) (_ : Module ℂ V)
      (_ : LieRingModule (LieAlgebra.e₈ ℂ) V) (_ : LieModule ℂ (LieAlgebra.e₈ ℂ) V),
      Module.finrank ℂ V = 779247 ∧
      LieModule.IsIrreducible ℂ (LieAlgebra.e₈ ℂ) V ∧
      (isotypicComponents (UniversalEnvelopingAlgebra ℂ (LieAlgebra.e₈ ℂ))
        (V ⊗[ℂ] V)).ncard = 40 := by
  sorry
#42
Lagarias criterion is equivalent to RH
riemann_hypothesis_iff_lagarias_elementary_criterion

Verso theorem preview

theorem declaration uses `sorry`riemann_hypothesis_iff_lagarias_elementary_criterion : RiemannHypothesis ↔ LeanEval.NumberTheory.LagariasElementaryCriterion := ⊢ RiemannHypothesis ↔ LagariasElementaryCriterion All goals completed! 🐙
#43
Martinet's asymptotically-good totally real towers
martinet_totally_real_towers

Verso theorem preview

theorem declaration uses `sorry`exists_totallyReal_discr_le : ∃ C : ℝ, 0 < C ∧ ∀ N : ℕ, ∃ d : ℕ, N ≤ d ∧ ∃ (K : Type) (_ : Field K) (_ : NumberField K) (_ : NumberField.IsTotallyReal K), Module.finrank ℚ K = d ∧ |(NumberField.discr K : ℝ)| ≤ C ^ d := ⊢ ∃ C, 0 < C ∧ ∀ (N : ℕ), ∃ d, N ≤ d ∧ ∃ K x, ∃ (x_1 : NumberField K) (_ : IsTotallyReal K), Module.finrank ℚ K = d ∧ |↑(discr K)| ≤ C ^ d All goals completed! 🐙
#44
Erdős's unit-distance conjecture is false
erdos_unit_distance_conjecture_false

Verso theorem preview

theorem declaration uses `sorry`erdos_unit_distance_conjecture_false : ∃ δ : ℝ, 0 < δ ∧ ∀ N : ℕ, ∃ (n : ℕ) (P : Finset (EuclideanSpace ℝ (Fin 2))), N ≤ n ∧ P.card = n ∧ (n : ℝ) ^ (1 + δ) ≤ (unitDist P : ℝ) := ⊢ ∃ δ, 0 < δ ∧ ∀ (N : ℕ), ∃ n P, N ≤ n ∧ P.card = n ∧ ↑n ^ (1 + δ) ≤ ↑(unitDist P) All goals completed! 🐙
#45
Neukirch–Uchida theorem
neukirch_uchida

Verso theorem preview

theorem declaration uses `sorry`neukirch_uchida {K₁ K₂ K₁' K₂' : Type*} [Field K₁] [Field K₂] [Field K₁'] [Field K₂'] [NumberField K₁] [NumberField K₂] [Algebra K₁ K₁'] [Algebra K₂ K₂'] [IsSepClosure K₁ K₁'] [IsSepClosure K₂ K₂'] (ϕ : Gal(K₁'/K₁) ≃* Gal(K₂'/K₂)) (he : IsHomeomorph ϕ) : ∃! σ : K₂' ≃+* K₁', (algebraMap K₂ K₂').range.map σ.toRingHom = (algebraMap K₁ K₁').range ∧ ∀ g : Gal(K₁'/K₁), ϕ g = σ.trans (g.toRingEquiv.trans σ.symm) := K₁:Type u_1K₂:Type u_2K₁':Type u_3K₂':Type u_4inst✝⁹:Field K₁inst✝⁸:Field K₂inst✝⁷:Field K₁'inst✝⁶:Field K₂'inst✝⁵:NumberField K₁inst✝⁴:NumberField K₂inst✝³:Algebra K₁ K₁'inst✝²:Algebra K₂ K₂'inst✝¹:IsSepClosure K₁ K₁'inst✝:IsSepClosure K₂ K₂'ϕ:Gal(K₁'/K₁) ≃* Gal(K₂'/K₂)he:IsHomeomorph ⇑ϕ⊢ ∃! σ, Subring.map σ.toRingHom (algebraMap K₂ K₂').range = (algebraMap K₁ K₁').range ∧ ∀ (g : Gal(K₁'/K₁)), (ϕ g).toRingEquiv = σ.trans (g.toRingEquiv.trans σ.symm) All goals completed! 🐙
#46
Bounded gaps between primes
zhang_bounded_prime_gaps

Verso theorem preview

theorem declaration uses `sorry`zhang_bounded_prime_gaps : ∀ n : ℕ, ∃ p q : ℕ, n ≤ p ∧ p.Prime ∧ q.Prime ∧ p < q ∧ q - p ≤ 246 := ⊢ ∀ (n : ℕ), ∃ p q, n ≤ p ∧ Nat.Prime p ∧ Nat.Prime q ∧ p < q ∧ q - p ≤ 246 All goals completed! 🐙
#47
Shafarevich's relation-rank bound
shafarevich_relation_rank_bound

Verso theorem preview

theorem declaration uses `sorry`shafarevich_relation_rank_bound (F : Type) [Field F] [NumberField F] (p : ℕ) [Fact p.Prime] (_hpOdd : Odd p) : LeanEval.NumberTheory.H2Finite p (MaxUnramifiedProPGaloisGroup F p) ∧ (open Classical in relationRank p (MaxUnramifiedProPGaloisGroup F p) ≤ generatorRank (MaxUnramifiedProPGaloisGroup F p) + (NumberField.InfinitePlace.nrRealPlaces F + NumberField.InfinitePlace.nrComplexPlaces F - 1) + (if ∃ ζ : F, IsPrimitiveRoot ζ p then 1 else 0)) := F:Typeinst✝²:Field Finst✝¹:NumberField Fp:ℕinst✝:Fact (Nat.Prime p)_hpOdd:Odd p⊢ H2Finite p (MaxUnramifiedProPGaloisGroup F p) ∧ relationRank p (MaxUnramifiedProPGaloisGroup F p) ≤ generatorRank (MaxUnramifiedProPGaloisGroup F p) + (InfinitePlace.nrRealPlaces F + InfinitePlace.nrComplexPlaces F - 1) + if ∃ ζ, IsPrimitiveRoot ζ p then 1 else 0 All goals completed! 🐙
#48
New large value estimates for Dirichlet polynomials
annals_large_value_estimates

Verso theorem preview

theorem declaration uses `sorry`theorem_1_1 : ∃ o : ℝ → ℝ, o =o[Filter.atTop] (1 : ℝ → ℝ) ∧ ∀ (b : ℕ → ℂ) (_hb : ∀ n, ‖b n‖ ≤ 1) (N : ℕ) (V : ℝ) (T : ℝ) (R : ℕ) (t : Fin R → ℝ), N > 0 → V > 0 → T > 1 → -- these assumptions are necessary but not stated in the paper (∀ i j, i ≠ j → |t i - t j| ≥ 1) → (∀ i, t i ∈ Set.Icc 0 T) → (∀ r, ‖∑ n ∈ Finset.Icc N (2 * N), b n * n ^ (I * t r)‖ ≥ V) → R ≤ T ^ (o T) * bound N V T := ⊢ ∃ o, o =o[Filter.atTop] 1 ∧ ∀ (b : ℕ → ℂ), (∀ (n : ℕ), ‖b n‖ ≤ 1) → ∀ (N : ℕ) (V T : ℝ) (R : ℕ) (t : Fin R → ℝ), N > 0 → V > 0 → T > 1 → (∀ (i j : Fin R), i ≠ j → |t i - t j| ≥ 1) → (∀ (i : Fin R), t i ∈ Set.Icc 0 T) → (∀ (r : Fin R), ‖∑ n ∈ Finset.Icc N (2 * N), b n * ↑n ^ (I * ↑(t r))‖ ≥ V) → ↑R ≤ T ^ o T * bound N V T All goals completed! 🐙
#49
A negative answer to Ulam's Problem 19 from the Scottish Book
annals_ulam

Verso theorem preview

theorem declaration uses `sorry`theorem_1 (hd : 3 ≤ d) : letI : NeZero d := ⟨d:ℕhd:3 ≤ d⊢ d ≠ 0 All goals completed! 🐙⟩ ∃ K : Ulam.BodyOfRevolution d, Ulam.IsStrictlyConvexBody K.body ∧ ¬ Ulam.IsCentrallySymmetric K.body ∧ Ulam.FloatsInEquilibriumInEveryOrientationAtLevel K.body (volume.real K.body / 2) := d:ℕhd:3 ≤ d⊢ ∃ K, IsStrictlyConvexBody K.body ∧ ¬IsCentrallySymmetric K.body ∧ FloatsInEquilibriumInEveryOrientationAtLevel K.body (volume.real K.body / 2) All goals completed! 🐙
#50
Fractal uncertainty in higher dimensions
annals_fractal_uncertainty

Lean theorem statement

/--
Statement of Theorem 1.1:

Let `ν > 0` and assume that
- `X ⊆ [−1,1]ᵈ` is `ν`-porous on balls from scales `h` to `1`, and
- `Y ⊆ [−h⁻¹,h⁻¹]ᵈ` is `ν`-porous on lines from scales `1` to `h⁻¹`.
Then there exist `β,C > 0` depending only on `ν` and `d` such that for all `f ∈ L²(ℝᵈ)`,
`supp (𝓕 f) ⊆ Y => ‖f * 1_X‖₂ ≤ C * h ^ β * ‖f‖₂`.
Note: We require `X` and `Y` to be measurable to make the statement more natural.
-/
theorem theorem_1_1 (ν : ℝ) (hν₀ : 0 < ν) :
    ∃ (β C : ℝ), β > 0 ∧ C > 0 ∧ ∀ (h : ℝ) (X Y : Set ℝᵈ)
      (hX : MeasurableSet X) (hY : MeasurableSet Y), h ∈ Set.Ioo 0 (1 / 100) →
        X ⊆ cube (-1) 1 → PorousOnBalls ν h 1 X → Y ⊆ cube (-h⁻¹) h⁻¹ →
          PorousOnLines ν 1 h⁻¹ Y → ∀ (f : Lp ℂ 2), (𝓕 f : Lp ℂ 2) =ᵐ[volume.restrict Yᶜ] 0 →
            (eLpNorm (X.indicator f) 2).toReal ≤ C * h ^ β * ‖f‖ := by
  sorry
#51
On Zagier-Hoffman's conjectures in positive characteristic
annals_zagier_hoffman_positive_char

Lean theorem statement

/--
Statement of Theorem A (Brown's theorem in positive characteristic):

Let `w ∈ ℕ`, where `ℕ := {1,2,...}`. Then every MZV of weight `w` can be written as a `K`-linear
combination of MZV's in the set `𝒯_w`. In particular, `dim 𝒵_w ≤ d(w)`.
Note that `K` in the paper is `RatFunc F`.
-/
theorem theorem_A (w : ℕ+) :
    𝒵 F w = Submodule.span (RatFunc F) (𝒯 F w) ∧
    Module.rank (RatFunc F) (𝒵 F w) ≤ d F w := by
  sorry

/--
Statement of Theorem B:

Let `w ∈ ℕ`, where `ℕ := {1,2,...}`. MZVs of weight `w` in `𝒯0 w` are all linearly independent over
`K`. In particular, `dim 𝒵 w ≥ |𝒯0 w|`. Note that `K` in the paper is `RatFunc F`.
-/
theorem theorem_B (w : ℕ+) :
    LinearIndependent (RatFunc F) (Subtype.val : 𝒯0 F w → CompletionAtInfty F) ∧
    Module.rank (RatFunc F) (𝒵 F w) ≥ Set.ncard (𝒯0 F w) := by
  sorry

/--
Statement of Theorem D:

Let `w ∈ ℕ+` with `w ≤ 2q − 2`. Then `𝒯 w` is a `K`-basis for `𝒵 w`. In particular,
`dim_K (𝒵 w) = d(w)`. Note that `K` in the paper is `RatFunc F`.

Note: Theorem A establishes that `𝒯 w` spans `𝒵 w`. So to prove `𝒯 w` is a `K`-basis for `𝒵 w`, we
only need to show that `𝒯 w` are linearly independent in `𝒵 w`.
-/
theorem theorem_D (w : ℕ+) (hw : w ≤ 2 * Nat.card F - 2) :
    LinearIndependent (RatFunc F) (Subtype.val : 𝒯 F w → CompletionAtInfty F) ∧
    Module.rank (RatFunc F) (𝒵 F w) = d F w := by
  sorry
#52
Galois groups of random integer polynomials and van der Waerden's Conjecture
annals_van_der_waerden_conjecture

Verso theorem preview

theorem declaration uses `sorry`theorem_1 (n : ℕ) (hn : 3 ≤ n) : (fun H ↦ (vanDerWaerdenConjecture.E n H : ℝ)) =O[atTop] (fun H ↦ (H ^ (n - 1) : ℝ)) := n:ℕhn:3 ≤ n⊢ (fun H => ↑(E n H)) =O[atTop] fun H => ↑H ^ (n - 1) All goals completed! 🐙
#53
Viscosity solutions and hyperbolic motions: a new PDE method for the N-body problem
annals_viscosity_solutions

Verso theorem preview

theorem declaration uses `sorry`theorem_1_1 (hE : 2 ≤ Module.finrank ℝ E) (m : ℝᴺ) (hm : ∀ i, 0 < m i) (x₀ a : Eᴺ) (a_nc : ViscositySolutions.WithoutCollisions a) (a_norm : ‖a‖_[m] = 1) (h : ℝ) (h_pos : h > 0) : ∃ x : ℝ → Eᴺ, ∃ o : ℝ → Eᴺ, (o =o[atTop] fun t ↦ t) ∧ x 0 = x₀ ∧ ViscositySolutions.IsNBodySolution m x ∧ (∀ t > 0, ViscositySolutions.WithoutCollisions (x t)) ∧ ∀ t ≥ 0, x t = (sqrt (2 * h) * t) • a + o t := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:InnerProductSpace ℝ Einst✝:FiniteDimensional ℝ EN:ℕhE:2 ≤ Module.finrank ℝ Em:Fin N → ℝhm:∀ (i : Fin N), 0 < m ix₀:Eᴺa:Eᴺa_nc:WithoutCollisions aa_norm:‖a‖_[m] = 1h:ℝh_pos:h > 0⊢ ∃ x o, (o =o[atTop] fun t => t) ∧ x 0 = x₀ ∧ IsNBodySolution m x ∧ (∀ t > 0, WithoutCollisions (x t)) ∧ ∀ t ≥ 0, x t = (√(2 * h) * t) • a + o t All goals completed! 🐙
#54
Enumerating number fields
annals_enumerating_number_fields

Lean theorem statement

/--
Statement of Theorem 1 (Number fields have small models):

There exists a positive constant `Q` such that the following is true. Let `K` be a number field
of degree `n ≥ Q` and root discriminant `δ` over `ℚ`. Then there exist integers `r ≤ Q log n` and
`d ≤ Q log n` such that `(d + r) choose r ≤ Q n log n`, and there exist `r` polynomials
`E₁, ..., Eᵣ` of degree `≤ d` in `ℤ[x₁, ..., xᵣ]` all having coefficients bounded in absolute value
by `(n δ) ^ (Q log n)` such that the (smooth and zero-dimensional affine) scheme with equations
`E₁ = ... = Eᵣ = 0` and `det (∂Eᵢ/∂xⱼ) ≠ 0` contains `Spec K` as one of its irreducible components.
-/
theorem theorem_1 : ∃ Q > 0, ∀ n ≥ Q, ∀ K : NumberFieldOfDegree n, ∃ (r d : ℕ),
    r ≤ Q * log n ∧ d ≤ Q * log n ∧ (d + r).choose r ≤ Q * n * log n ∧
      ∃ E : Fin r → MvPolynomial (Fin r) ℤ, (∀ i, (E i).totalDegree ≤ d) ∧
        (∀ i j, |(E i).coeff j| ≤ (n * rootDiscr K) ^ (Q * log n)) ∧
          letI X := nonsingularOpen fun i ↦ (E i).map (algebraMap ℤ ℚ)
          ∃ Z, ∃ hZ : Z ∈ irreducibleComponents X,
            Nonempty (X.irreducibleComponent Z hZ ≅ Spec (.of K)) := by
  sorry

/--
Statement of Theorem 2 (Number fields with bounded discriminant):

There exists a positive constant `Q` such that the following is true. Let `n ≥ Q` be an integer.
Let `H ≥ 1` be an integer. The number of isomorphism classes of number fields
with degree `n` and discriminant `≤ H` is `≤ n^(Q n log^3 n) H^(Q log^3 n)`.
-/
theorem theorem_2 : ∃ Q > 0, ∀ n ≥ Q, ∀ H ≥ 1,
    (Nat.card (NumberFieldOfBoundedDiscriminantUpToIsomorphism n H) : ℝ) ≤
      n ^ (Q * n * log n ^ 3) * H ^ (Q * log n ^ 3) := by
  sorry
#55
Uniformization theorem for Riemann surfaces
uniformization

Verso theorem preview

theorem declaration uses `sorry`uniformization {X : Type*} [TopologicalSpace X] [T2Space X] [ConnectedSpace X] [SecondCountableTopology X] [ChartedSpace ℂ X] [IsManifold mℂ 1 X] (hX : ¬ CompactSpace X) (x : X) [Subsingleton <| Additive (FundamentalGroup X x) →+ ℝ] : Nonempty (X ≃ₘ⟮mℂ, mℂ⟯ ℂ) ∨ Nonempty (X ≃ₘ⟮mℂ, mℂ⟯ UpperHalfPlane) := X:Type u_1inst✝⁶:TopologicalSpace Xinst✝⁵:T2Space Xinst✝⁴:ConnectedSpace Xinst✝³:SecondCountableTopology Xinst✝²:ChartedSpace ℂ Xinst✝¹:IsManifold mℂ 1 XhX:¬CompactSpace Xx:Xinst✝:Subsingleton (Additive (FundamentalGroup X x) →+ ℝ)⊢ Nonempty (X ≃ₘ⟮mℂ, mℂ⟯ ℂ) ∨ Nonempty (X ≃ₘ⟮mℂ, mℂ⟯ UpperHalfPlane) All goals completed! 🐙
#56
On the Duffin-Schaeffer conjecture
annals_duffin_schaeffer_conjecture

Verso theorem preview

/-- Statement of Theorem 1: If for `ψ : ℕ → ℝ≥0`, the infinite series `∑ (ψ q * φ q) / q`, where `φ` is the Euler totient function, diverges, then the set `𝒜` defined above has Lebesgue measure `1`. -/ theorem declaration uses `sorry`theorem_1 (ψ : ℕ+ → ℝ≥0) (hdivergence : ¬ Summable fun q ↦ (ψ q * φ q) / q) : MeasurableSet (𝒜 ψ) ∧ volume (𝒜 ψ) = 1 := ψ:ℕ+ → ℝ≥0hdivergence:¬Summable fun q => ψ q * ↑(φ ↑q) / ↑↑q⊢ MeasurableSet (𝒜 ψ) ∧ volume (𝒜 ψ) = 1 All goals completed! 🐙
/-- Statement of Theorem 2(a): Let `ψ : ℕ → ℝ≥0`, `𝒦` and `ψ⋆` be as above. Then, if `∑ ψ⋆ (q)` converges, `𝒦` has Lebesgue measure `0`. -/ theorem declaration uses `sorry`theorem_2_a (ψ : ℕ+ → ℝ≥0) (hψ : ∑' q, ψ_star ψ q < ∞) : MeasurableSet (𝒦 ψ) ∧ volume (𝒦 ψ) = 0 := ψ:ℕ+ → ℝ≥0hψ:∑' (q : ℕ+), ψ_star ψ q < ∞⊢ MeasurableSet (𝒦 ψ) ∧ volume (𝒦 ψ) = 0 All goals completed! 🐙
/-- Statement of Theorem 2(b): Let `ψ : ℕ → ℝ≥0`, `𝒦` and `ψ⋆` be as above. Then, if `∑ ψ⋆ (q)` diverges, `𝒦` has Lebesgue measure `1`. -/ theorem declaration uses `sorry`theorem_2_b (ψ : ℕ+ → ℝ≥0) (hψ : ∑' q, ψ_star ψ q = ∞) : MeasurableSet (𝒦 ψ) ∧ volume (𝒦 ψ) = 1 := ψ:ℕ+ → ℝ≥0hψ:∑' (q : ℕ+), ψ_star ψ q = ∞⊢ MeasurableSet (𝒦 ψ) ∧ volume (𝒦 ψ) = 1 All goals completed! 🐙
/-- Statement of Corollary 3: For a function `ψ : ℕ → [0, 1/2]`, the set `𝒜` and the element `s` defined as above, the Hausdorff dimension of `𝒜` is the minimum of `s` and `1`. -/ theorem declaration uses `sorry`corollary_3 (ψ : ℕ+ → ℝ≥0) (hψ : ∀ n, ψ n ∈ Set.Icc 0 (1 / 2)) : dimH (𝒜 ψ) = min (s_inf ψ) 1 := ψ:ℕ+ → ℝ≥0hψ:∀ (n : ℕ+), ψ n ∈ Set.Icc 0 (1 / 2)⊢ dimH (𝒜 ψ) = ↑(min (s_inf ψ) 1) All goals completed! 🐙
#57
Vinogradov mean value theorem
vinogradov_mean_value

Verso theorem preview

theorem declaration uses `sorry`vinogradov_mean_value (s k : ℕ) (ε : ℝ) (hε : 0 < ε) : LeanEval.NumberTheory.VinogradovMeanValue.J s k =O[Filter.atTop] fun X ↦ (X ^ (s + ε) + X ^ ((2 * s : ℝ) - k * (k + 1) / 2 + ε) : ℝ) := s:ℕk:ℕε:ℝhε:0 < ε⊢ J s k =O[Filter.atTop] fun X => ↑X ^ (↑s + ε) + ↑X ^ (2 * ↑s - ↑k * (↑k + 1) / 2 + ε) All goals completed! 🐙
#58
Pseudorandom sets in Grassmann graph have near-perfect expansion
annals_pseudorandom_grassmann

Verso theorem preview

theorem declaration uses `sorry`theorem_1_12 (α : ℝ) (hα : α ∈ Set.Ioo 0 1) : ∃ ε > 0, ∃ r, ∀ᶠ (ℓ : ℕ) (k : ℕ) in atTop, ∀ S : Finset (PseudorandomGrassmann.GrVertex k ℓ), (hS : S.Nonempty) → 2 * #S ≤ Fintype.card (PseudorandomGrassmann.GrVertex k ℓ) → Φ (PseudorandomGrassmann.Gr k ℓ) S hS ≤ α → ∃ (A B : Submodule 𝔽₂ (Fin k → 𝔽₂)), A ≤ B ∧ letI a := finrank 𝔽₂ A; letI b := k - finrank 𝔽₂ B a + b ≤ r ∧ #(S ∩ SubGr k ℓ A B) / #(SubGr k ℓ A B) ≥ (ε : ℝ) := α:ℝhα:α ∈ Set.Ioo 0 1⊢ ∃ ε > 0, ∃ r, ∀ᶠ (ℓ : ℕ) (k : ℕ) in atTop, ∀ (S : Finset (GrVertex k ℓ)) (hS : S.Nonempty), 2 * #S ≤ Fintype.card (GrVertex k ℓ) → ↑(Φ (Gr k ℓ) S hS) ≤ α → ∃ A B, A ≤ B ∧ finrank 𝔽₂ ↥A + (k - finrank 𝔽₂ ↥B) ≤ r ∧ ↑(#(S ∩ SubGr k ℓ A B)) / ↑(#(SubGr k ℓ A B)) ≥ ε All goals completed! 🐙
#59
Schmidt's subspace theorem
schmidt_subspace

Verso theorem preview

theorem declaration uses `sorry`schmidt_subspace (σ : Type*) [Fintype σ] (hσ : 2 ≤ Fintype.card σ) (L : σ → σ → ℂ) (alg : ∀ i j, IsAlgebraic ℚ (L i j)) (ind : LinearIndependent ℂ L) (ε : ℝ) (pos : 0 < ε) : ∃ s : Finset (σ → ℤ), 0 ∉ s ∧ ∀ x : σ → ℤ, ‖∏ i, ∑ j, L i j * x j‖ < ‖x‖ ^ (-ε) → ∃ c ∈ s, ∑ i, c i * x i = 0 := σ:Type u_1inst✝:Fintype σhσ:2 ≤ Fintype.card σL:σ → σ → ℂalg:∀ (i j : σ), IsAlgebraic ℚ (L i j)ind:LinearIndependent ℂ Lε:ℝpos:0 < ε⊢ ∃ s, 0 ∉ s ∧ ∀ (x : σ → ℤ), ‖∏ i, ∑ j, L i j * ↑(x j)‖ < ‖x‖ ^ (-ε) → ∃ c ∈ s, ∑ i, c i * x i = 0 All goals completed! 🐙
#60
Lorentzian polynomials
annals_lorentzian_polynomials

Verso theorem preview

theorem declaration uses `sorry`theorem_2_25 (n d : ℕ) (hn : 0 < n) : closure (Ŀ n d) = LorentzianPolynomials.L n d := n:ℕd:ℕhn:0 < n⊢ closure (Ŀ n d) = L n d All goals completed! 🐙
#61
Flat Littlewood polynomials exist
annals_flat_littlewood_poly

Verso theorem preview

theorem declaration uses `sorry`theorem_1_1 : ∃ Δ δ : ℝ, Δ > δ ∧ δ > 0 ∧ ∀ n ≥ 2, ∃ P : ℂ[X], FlatLittlewoodPoly.IsLittlewoodPolynomial P ∧ P.natDegree = n ∧ ∀ z : ℂ, ‖z‖ = 1 → δ * √n ≤ ‖P.eval z‖ ∧ ‖P.eval z‖ ≤ Δ * √n := ⊢ ∃ Δ δ, Δ > δ ∧ δ > 0 ∧ ∀ n ≥ 2, ∃ P, IsLittlewoodPolynomial P ∧ P.natDegree = n ∧ ∀ (z : ℂ), ‖z‖ = 1 → δ * √↑n ≤ ‖Polynomial.eval z P‖ ∧ ‖Polynomial.eval z P‖ ≤ Δ * √↑n All goals completed! 🐙
#62
Generalized topological Poincaré conjecture in dimensions ≥ 5 (Smale)
poincare_high_dim_topological

Verso theorem preview

theorem declaration uses `sorry`poincare_high_dim_topological {n : ℕ} (_h5 : 5 ≤ n) {M : Type*} [TopologicalSpace M] [T2Space M] [ChartedSpace (EuclideanSpace ℝ (Fin n)) M] (_h : M ≃ₕ sphere (0 : EuclideanSpace ℝ (Fin (n + 1))) 1) : Nonempty (M ≃ₜ sphere (0 : EuclideanSpace ℝ (Fin (n + 1))) 1) := n:ℕ_h5:5 ≤ nM:Type u_1inst✝²:TopologicalSpace Minst✝¹:T2Space Minst✝:ChartedSpace (EuclideanSpace ℝ (Fin n)) M_h:M ≃ₕ ↑(sphere 0 1)⊢ Nonempty (M ≃ₜ ↑(sphere 0 1)) All goals completed! 🐙
#63
Chen's theorem
chen_theorem

Verso theorem preview

theorem declaration uses `sorry`chen_theorem : {p : ℕ | p.Prime ∧ LeanEval.NumberTheory.ChenTheorem.HasAtMostTwoPrimeFactors (p + 2)}.Infinite := ⊢ {p | Nat.Prime p ∧ HasAtMostTwoPrimeFactors (p + 2)}.Infinite All goals completed! 🐙
#64
Duffin-Schaeffer conjecture
duffin_schaeffer

Verso theorem preview

theorem declaration uses `sorry`duffin_schaeffer (δ : ℕ → ℝ) (hδ : ∀ n, 0 ≤ δ n) : volume (addWellApproximable UnitAddCircle δ) = 1 ↔ ¬ Summable fun n : ℕ => n.totient * δ n := δ:ℕ → ℝhδ:∀ (n : ℕ), 0 ≤ δ n⊢ volume (addWellApproximable UnitAddCircle δ) = 1 ↔ ¬Summable fun n => ↑n.totient * δ n All goals completed! 🐙
#65
Green–Tao theorem
green_tao

Verso theorem preview

theorem declaration uses `sorry`green_tao : LeanEval.NumberTheory.ContainsArbitraryAPs {p : ℕ | Nat.Prime p} := ⊢ ContainsArbitraryAPs {p | Nat.Prime p} All goals completed! 🐙
#66
A reverse Minkowski theorem
annals_reverse_minkowski

Verso theorem preview

theorem declaration uses `sorry`theorem_1_2 (ℒ : Submodule ℤ ℝⁿ) [DiscreteTopology ℒ] (hℒ : IsZLattice ℝ ℒ) (h : ∀ ℒ' (_hℒℒ' : ℒ' ≤ ℒ) [DiscreteTopology ℒ'], determinant ℒ' ≥ 1) : let t : ℝ := 10 * (log n + 2) ρ (1 / t) ℒ ≤ 3 / 2 := n:ℕℒ:Submodule ℤ ℝⁿinst✝:DiscreteTopology ↥ℒhℒ:IsZLattice ℝ ℒh:∀ ℒ' ≤ ℒ, ∀ [inst : DiscreteTopology ↥ℒ'], determinant ℒ' ≥ 1⊢ let t := 10 * (log ↑n + 2); ρ (1 / t) ℒ ≤ 3 / 2 All goals completed! 🐙
#67
Hessian estimates for the sigma-2 equation in dimension four
annals_hessian_estimates

Verso theorem preview

theorem declaration uses `sorry`theorem_1_1 : ∃ C : ℝ≥0∞ → ℝ, ∀ (u : ℝ⁴ → ℝ) (_smooth : ContDiffOn ℝ ∞ u B₁(0)) (_bounded : ‖u‖_C¹(B₁(0)) < (∞ : ℝ≥0∞)) (_positive_branch : ∀ x ∈ B₁(0), (Δ u) x > 0) (_solution : ∀ x ∈ B₁(0), σ₂ (H u B₁(0) x) = 1), ‖H u B₁(0) 0‖_F ≤ C (‖u‖_C¹(B₁(0))) := ⊢ ∃ C, ∀ (u : ℝ⁴ → ℝ), ContDiffOn ℝ ∞ u B₁(0) → ‖u‖_C¹(B₁(0)) < ∞ → (∀ x ∈ B₁(0), Δ u x > 0) → (∀ x ∈ B₁(0), σ₂ (H u B₁(0) x) = 1) → ‖H u B₁(0) 0‖_F ≤ C ‖u‖_C¹(B₁(0)) All goals completed! 🐙
#68
A counterexample to the periodic tiling conjecture
annals_periodic_tiling_conjecture

Lean theorem statement

/--
Statement of Theorem 1.4 (Counterexample to Conjecture 1.2, I):

There exists a finite abelian group `G₀` and a finite non-empty `F ⊆ ℤ² × G₀` such that
`F` forms an aperiodic tiling equation.
-/
theorem theorem_1_4 : ∃ (G₀ : Type) (_ : AddCommGroup G₀) (_ : Finite G₀),
    ∃ F : Set (ℤ × ℤ × G₀), F.Finite ∧ F.Nonempty ∧ IsAperiodicTilingEquation F := by
  sorry

/--
Statement of Corollary 1.6 (Counterexample to Conjecture 1.2, II):

For all sufficiently large `d`, there exists a finite non-empty `F ⊆ ℤᵈ` such that
`F` forms an aperiodic tiling equation.
-/
theorem corollary_1_6 : ∀ᶠ d in atTop, ∃ (F : Set (Fin d → ℤ)),
    F.Finite ∧ F.Nonempty ∧ IsAperiodicTilingEquation F := by
  sorry

/--
Statement of Corollary 1.7 (Counterexample to Conjecture 1.3):

For all sufficiently large `d`, there exists a bounded measurable set `σ ⊆ ℝᵈ` of positive
measure such that `σ` forms an aperiodic continuous tiling equation.
-/
theorem corollary_1_7 : ∀ᶠ d in atTop, ∃ σ : Set (Fin d → ℝ), IsBounded σ ∧ MeasurableSet σ ∧
    0 < volume σ ∧ IsAperiodicContinuousTilingEquation σ := by
  sorry
#69
Rational approximations to linear subspaces
annals_linear_subspaces

Verso theorem preview

theorem declaration uses `sorry`theorem_1 (hd : 2 ≤ d) (l : ℕ) (hl0 : 0 < l) (hld : l < d) (k : ℕ) (hk1 : 1 ≤ k) (hkl : k ≤ l) : (∀ x : Submodule ℝ ℝᵈ, finrank ℝ x = l → LinearSubspaces.diophantineExponent k x ≥ d / (k * (d - l))) ∧ (∃ x : Submodule ℝ ℝᵈ, finrank ℝ x = l ∧ LinearSubspaces.diophantineExponent k x = d / (k * (d - l))) := d:ℕhd:2 ≤ dl:ℕhl0:0 < lhld:l < dk:ℕhk1:1 ≤ khkl:k ≤ l⊢ (∀ (x : Submodule ℝ ℝᵈ), finrank ℝ ↥x = l → diophantineExponent k x ≥ ↑d / (↑k * (↑d - ↑l))) ∧ ∃ x, finrank ℝ ↥x = l ∧ diophantineExponent k x = ↑d / (↑k * (↑d - ↑l)) All goals completed! 🐙
#70
On approximation to a real number by algebraic numbers of bounded degree
annals_on_approximation_of_reals

Lean theorem statement

/--
Statement of Theorem 1.1:

Let `n` be an integer such that `n ≥ 2`. For any transcendental real number `ξ`, we have
`ω⋆_n(ξ) ≥ a * n`, where `a = 1 / (2 - log 2)`.
-/
theorem theorem_1_1 (n : ℕ) (hn : n ≥ 2) (ξ : ℝ) (hξ : Transcendental ℚ ξ) :
    letI a : ℝ := 1 / (2 - Real.log 2)
    (ω⋆ n ξ : EReal) ≥ (a : EReal) * n := by
  sorry
#71
Singularity of random Bernoulli matrices
annals_random_bernoulli_matrices

Verso theorem preview

/-- Statement of Theorem A: For every `p ∈ (0, 1/2]` and `ε > 0` there exists `N, C > 0` such that for any `n ≥ N` and any `n × n` random matrix `B` with mutually independent `Bernoulli(p)` entries, `P(σ_min (B + sIIᵀ) ≤ t/√n) ≤ (1 - p + ε)ⁿ + Ct` for all `s ∈ [-1,0]` and `t > 0`. -/ theorem declaration uses `sorry`theorem_A {p : I} {ε : ℝ} (hp₀ : 0 < p) (hp₁ : (p : ℝ) ≤ 1 / 2) (hε : 0 < ε) : ∃ N > 0, ∃ C > 0, ∀ n ≥ N, ∀ (Ω : Type*) (_mΩ : MeasurableSpace Ω) (P : Measure Ω) (B : Ω → Matrix (Fin n) (Fin n) ℝ) (_B_indep : iIndepFun (fun x : Fin n × Fin n ↦ (B · x.1 x.2)) P) (_B_bernoulli : ∀ i j, HasLaw (B · i j) (bernoulliMeasure 1 0 p) P), ∀ s : ℝ, -1 ≤ s ∧ s ≤ 0 → ∀ t : ℝ, 0 < t → P.real {ω : Ω | σ_min (B ω + of (fun _ _ ↦ s)) ≤ t / √n} ≤ (1 - p + ε) ^ n + C * t := p:↑Iε:ℝhp₀:0 < php₁:↑p ≤ 1 / 2hε:0 < ε⊢ ∃ N > 0, ∃ C > 0, ∀ n ≥ N, ∀ (Ω : Type u_1) (_mΩ : MeasurableSpace Ω) (P : Measure Ω) (B : Ω → Matrix (Fin n) (Fin n) ℝ), iIndepFun (fun x x_1 => B x_1 x.1 x.2) P → (∀ (i j : Fin n), HasLaw (fun x => B x i j) Ber(1, 0, p) P) → ∀ (s : ℝ), -1 ≤ s ∧ s ≤ 0 → ∀ (t : ℝ), 0 < t → P.real {ω | σ_min (B ω + of fun x x_1 => s) ≤ t / √↑n} ≤ (1 - ↑p + ε) ^ n + C * t All goals completed! 🐙
/-- This (unnamed) corollary appears directly below Theorem A in the paper: For every `p ∈ (0, 1/2]` and any sequence `Bₙ` of `n × n` random matrices with mutually independent `Bernoulli(p)` entries we have that `P(Bₙ is singular) = (1 - p + oₙ(1))ⁿ`. -/ theorem declaration uses `sorry`corollary_1 {p : I} (hp₀ : 0 < p) (hp₁ : (p : ℝ) ≤ 1 / 2) {Ω : ℕ → Type*} [mΩ : ∀ n, MeasurableSpace (Ω n)] {P : (n : ℕ) → Measure (Ω n)} {B : (n : ℕ) → Ω n → Matrix (Fin n) (Fin n) ℝ} (B_indep : ∀ n, iIndepFun (fun x : Fin n × Fin n ↦ (B n · x.1 x.2)) (P n)) (B_bernoulli : ∀ n i j, HasLaw (B n · i j) (bernoulliMeasure 1 0 p) (P n)) : ∃ o : ℕ → ℝ, o =o[atTop] (1 : ℕ → ℝ) ∧ ∀ n > 0, (P n).real {ω | (B n ω).det = 0} = (1 - p + o n) ^ n := p:↑Ihp₀:0 < php₁:↑p ≤ 1 / 2Ω:ℕ → Type u_1mΩ:(n : ℕ) → MeasurableSpace (Ω n)P:(n : ℕ) → Measure (Ω n)B:(n : ℕ) → Ω n → Matrix (Fin n) (Fin n) ℝB_indep:∀ (n : ℕ), iIndepFun (fun x x_1 => B n x_1 x.1 x.2) (P n)B_bernoulli:∀ (n : ℕ) (i j : Fin n), HasLaw (fun x => B n x i j) Ber(1, 0, p) (P n)⊢ ∃ o, o =o[atTop] 1 ∧ ∀ n > 0, (P n).real {ω | (B n ω).det = 0} = (1 - ↑p + o n) ^ n All goals completed! 🐙
/-- This is the result stated in the paper's abstract: For any sequence `Mₙ` of `n × n` random matrices with mutually independent `Rademacher` entries we have that `P(Mₙ is singular) = (1/2 + oₙ(1))ⁿ`. -/ theorem declaration uses `sorry`corollary_2 {Ω : ℕ → Type*} (mΩ : ∀ n, MeasurableSpace (Ω n)) {P : (n : ℕ) → Measure (Ω n)} {M : (n : ℕ) → Ω n → Matrix (Fin n) (Fin n) ℝ} (M_indep : ∀ n, iIndepFun (fun x : Fin n × Fin n ↦ (M n · x.1 x.2)) (P n)) (M_rademacher : ∀ n i j, HasLaw (M n · i j) rademacherMeasure (P n)) : ∃ o : ℕ → ℝ, o =o[atTop] (1 : ℕ → ℝ) ∧ ∀ n > 0, (P n).real {ω | (M n ω).det = 0} = (1 / 2 + o n) ^ n := Ω:ℕ → Type u_1mΩ:(n : ℕ) → MeasurableSpace (Ω n)P:(n : ℕ) → Measure (Ω n)M:(n : ℕ) → Ω n → Matrix (Fin n) (Fin n) ℝM_indep:∀ (n : ℕ), iIndepFun (fun x x_1 => M n x_1 x.1 x.2) (P n)M_rademacher:∀ (n : ℕ) (i j : Fin n), HasLaw (fun x => M n x i j) rademacherMeasure (P n)⊢ ∃ o, o =o[atTop] 1 ∧ ∀ n > 0, (P n).real {ω | (M n ω).det = 0} = (1 / 2 + o n) ^ n All goals completed! 🐙
#72
Hadwiger's theorem
hadwiger

Verso theorem preview

theorem declaration uses `sorry`hadwiger (n : ℕ) : Module.finrank ℝ (valuations n) = n + 1 := n:ℕ⊢ Module.finrank ℝ ↥(valuations n) = n + 1 All goals completed! 🐙
#73
The optimal paper Moebius band
annals_optimal_moebius

Lean theorem statement

/--
Statement of Theorem 1.1 (Main):

A smooth embedded paper Moebius band has aspect ratio greater than `√3`.
-/
theorem theorem_1_1 (a : ℝ) (ha : a > 0) (f : ℝ² → ℝ³) (hf : IsMoebiusEmbedding a f) :
    a > √3 := by
  sorry
#74
The local-global conjecture for Apollonian circle packings is false
annals_local_global_apollonian_circle_packings

Lean theorem statement

/--
Statement of Theorem 1.6:

The Apollonian circle packing `A` generated by `(−3, 5, 8, 8)` has no square curvatures.
-/
theorem theorem_1_6 : ∀ n, n ^ 2 ∉ curvatureSet ⟦⟨![-3, 5, 8, 8], by decide⟩⟧ := by
  sorry

/--
Statement of Theorem 1.3:

There exist infinitely many `A` for which the number of missing curvatures up to `N` is `Ω(√N)`.
-/
theorem theorem_1_3 : {A : PrimitiveApollonianCirclePacking |
    Real.sqrt =O[Filter.atTop] missingCurvatures A}.Infinite := by
  sorry
#75
Algebraic integers with conjugates in a prescribed distribution
annals_algebraic_integers

Verso theorem preview

theorem declaration uses `sorry`theorem_1_1 : lambda_SSS < 1.89831 := ⊢ lambda_SSS < 1.89831 All goals completed! 🐙
#76
Improved bounds for the sunflower lemma
annals_improved_bounds_sunflower_lemma

Lean theorem statement

/-- The absolute constant `C` in Theorem 1.4. Although not explicitly stated in the paper,
the constant `C` doesn't depend on `r`. -/
noncomputable def C : ℝ := sorry

/--
Statement of Theorem 1.4 (Main theorem, sunflowers):

Let `r ≥ 3`. For some constant `C`, any `w`-set system `F` of size
`|F| ≥ (C * r ^ 3 * log w * log log w) ^ w` contains an `r`-sunflower.

Note: We require `w ≥ 2`, as the paper assumes `log log w > 0`.
-/
theorem theorem_1_4 (r : ℕ) (hr : r ≥ 3) (X : Type*) [Finite X] (ℱ : Set (Set X)) (w : ℕ)
      (hw : w ≥ 2) (hℱ₁ : ℱ.IsSystem w) (hℱ₂ : ℱ.ncard ≥ lowerBound r C w) :
      ∃ S ⊆ ℱ, S.IsSunflower r := by
  sorry
#77
On a conjecture of Talagrand on selector processes and a consequence on positive empirical processes
annals_supremum_of_selector_processes

Lean theorem statement

/-- The constant `L` of Theorem 1.2. -/
noncomputable def L₂ : ℝ≥0 := sorry

/-- The constant of Theorem 1.2 is positive. -/
theorem L₂_pos : L₂ > 0 := sorry

/--
Statement of Theorem 1.2:

There exists `L > 0` such that for any `0 < p < 1`, finite type `X`, and set `Λ` of functions from
`X` to `ℝ≥0` such that `0 < 𝔼[sup_{f ∈ Λ} ∑ i ∈ Xp, f i] < ∞`, the collection of sets

`{s ⊆ X | sup_{f ∈ Λ} ∑ i ∈ s, f i ≥ L * 𝔼[sup_{f ∈ Λ} ∑ i ∈ Xp, f i]}`

is `p-small`, where `Xp` is a binomial random subset of `X` with parameter `p`.

Note: The assumption `0 < 𝔼[sup_{f ∈ Λ} ∑ i ∈ Xp, f i] < ∞` is not explicitly stated in the theorem
but used in the last step of the proof where `𝔼 ≥ (L/L') * 𝔼` is a contradiction for `L > L'`.
-/
theorem theorem_1_2 (p : I) (hp₀ : 0 < p) (hp₁ : p < 1) (X : Type*) [Fintype X] (Λ : Set (X → ℝ≥0))
    (hE₀ : 0 < 𝔼⁻[⨆ f ∈ Λ, ∑ i ∈ Xp, (f i : ℝ≥0∞); Xp ∼ binomialSetDistribution X p])
    (hE : 𝔼⁻[⨆ f ∈ Λ, ∑ i ∈ Xp, (f i : ℝ≥0∞); Xp ∼ binomialSetDistribution X p] < ∞) :
    IsSmall p {s : Set X | ⨆ f ∈ Λ, ∑ i ∈ s, (f i : ℝ≥0∞) ≥
        L₂ * 𝔼⁻[⨆ f ∈ Λ, ∑ i ∈ Xp, (f i : ℝ≥0∞); Xp ∼ binomialSetDistribution X p]} := by
  sorry

/-- The constant `L` of Theorem 1.3. -/
noncomputable def L₃ : ℝ≥0 := sorry

/-- The constant of Theorem 1.3 is positive. -/
theorem L₃_pos : L₃ > 0 := sorry

/--
Statement of Theorem 1.3:

There exists `L > 0` such that for any `N > 0`, i.i.d random variables `Y_1, …, Y_N` distributed
according to a Borel probability measure `ν` on a Polish space `𝕋`, if `𝓕` is a finite set of
non-negative functions in `L∞(𝕋)` and `0 < 𝔼[sup_{f ∈ 𝓕} Z Y f] < ∞` then there exists a finite
collection `𝓒` of pairs `(g, t)` where `g : 𝕋 → ℝ≥0`, `t > 0` such that

`{sup_{f ∈ 𝓕} Z N Y f ≥ L * 𝔼[sup_{f ∈ 𝓕} Z N Y f] } ⊆ ⋃ (g,t) ∈ 𝓒, {t ≤ Z N Y g}`

and

`∑ (g,t) ∈ 𝓒, P(t ≤ Z N Y g) ≤ 2⁻¹`.

Note: The requirement that the collection `𝓒` be finite is not explicitly stated in the paper.
However, `𝓒` must at least be assumed to be countable in order for the sum to make sense,
and the collections `𝓒` produced by the proof are indeed finite.

-/
theorem theorem_1_3 (N : ℕ) (N_pos : N > 0) (𝕋 : Type*) (t𝕋 : TopologicalSpace 𝕋)
    (p𝕋 : PolishSpace 𝕋)
    (m𝕋 : MeasurableSpace 𝕋) (b𝕋 : BorelSpace 𝕋) (ν : Measure 𝕋) (hν : IsProbabilityMeasure ν)
    (Ω : Type*) (mΩ : MeasurableSpace Ω) (P : Measure Ω) (Y : Fin N → Ω → 𝕋)
    (Y_indep : iIndepFun Y P) (Y_law_ν : ∀ i, HasLaw (Y i) ν P)
    (𝓕 : Set {f : 𝕋 → ℝ≥0 // Measurable f ∧ MemLp f ∞ ν}) (h𝓕 : Finite 𝓕)
    (hZ₀ : 0 < 𝔼⁻[⨆ f ∈ 𝓕, (Z N Y f ·); P]) (hZ : 𝔼⁻[⨆ f ∈ 𝓕, (Z N Y f ·); P] < ∞) :
    ∃ 𝓒 : Finset ({g : 𝕋 → ℝ≥0 // Measurable g} × {t : ℝ≥0 | t > 0}),
      {ω | ⨆ f ∈ 𝓕, Z N Y f ω ≥ L₃ * 𝔼⁻[⨆ f ∈ 𝓕, (Z N Y f ·); P]} ⊆ ⋃ c ∈ 𝓒, {ω | c.2 ≤ Z N Y c.1 ω}
      ∧ ∑ c : 𝓒, P {ω | c.val.2 ≤ Z N Y c.val.1 ω} ≤ 2⁻¹ := by
  sorry
#78
Klartag's construction of lattice sphere packings
klartag_packing

Verso theorem preview

theorem declaration uses `sorry`klartag_packing : ∃ c : ℝ, 0 < c ∧ ∀ n : ℕ, let V := EuclideanSpace ℝ (Fin (n + 1)) ∃ φ : V →ₗ[ℝ] V, let E := φ '' Metric.ball (0 : V) 1 (MeasureTheory.volume E : EReal) = c * n ^ 2 ∧ {v ∈ E | ∀ i, v i ∈ Set.range ((↑) : ℤ → ℝ)} = {0} := ⊢ ∃ c, 0 < c ∧ ∀ (n : ℕ), let V := EuclideanSpace ℝ (Fin (n + 1)); ∃ φ, let E := ⇑φ '' Metric.ball 0 1; ↑(MeasureTheory.volume E) = ↑c * ↑n ^ 2 ∧ {v | v ∈ E ∧ ∀ (i : Fin (n + 1)), v.ofLp i ∈ Set.range Int.cast} = {0} All goals completed! 🐙
#79
Szemerédi's theorem
szemeredi

Verso theorem preview

theorem declaration uses `sorry`szemeredi (A : Set ℕ) (h : 0 < upperDensity A) : LeanEval.Combinatorics.ContainsArbitraryAPs A := A:Set ℕh:0 < upperDensity A⊢ ContainsArbitraryAPs A All goals completed! 🐙
#80
Hopf–Rinow theorem
hopf_rinow

Verso theorem preview

theorem declaration uses `sorry`hopf_rinow {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] {H : Type*} [TopologicalSpace H] (I : ModelWithCorners ℝ E H) [I.Boundaryless] (M : Type*) [EMetricSpace M] [ChartedSpace H M] [IsManifold I ∞ M] [Bundle.RiemannianBundle (fun x : M => TangentSpace I x)] [IsContMDiffRiemannianBundle I ∞ E (fun x : M => TangentSpace I x)] [IsContinuousRiemannianBundle E (fun x : M => TangentSpace I x)] [IsRiemannianManifold I M] [LocallyCompactSpace M] [ConnectedSpace M] : LeanEval.Geometry.IsGeodesicallyComplete M ↔ CompleteSpace M := E:Type u_1inst✝¹³:NormedAddCommGroup Einst✝¹²:NormedSpace ℝ Einst✝¹¹:FiniteDimensional ℝ EH:Type u_2inst✝¹⁰:TopologicalSpace HI:ModelWithCorners ℝ E Hinst✝⁹:I.BoundarylessM:Type u_3inst✝⁸:EMetricSpace Minst✝⁷:ChartedSpace H Minst✝⁶:IsManifold I ∞ Minst✝⁵:RiemannianBundle fun x => TangentSpace I xinst✝⁴:IsContMDiffRiemannianBundle I ∞ E fun x => TangentSpace I xinst✝³:IsContinuousRiemannianBundle E fun x => TangentSpace I xinst✝²:IsRiemannianManifold I Minst✝¹:LocallyCompactSpace Minst✝:ConnectedSpace M⊢ IsGeodesicallyComplete M ↔ CompleteSpace M All goals completed! 🐙
#81
Rademacher type and Enflo type coincide
annals_rademacher_enflo_type

Verso theorem preview

theorem declaration uses `sorry`theorem_1_1 (p : ℝ) (h1p : 1 ≤ p) (hp2 : p ≤ 2) : TR X p ≤ TE X p ∧ TE X p ≤ (pi / sqrt 2) * TR X p := X:Type u_2inst✝²:NormedAddCommGroup Xinst✝¹:NormedSpace ℝ Xinst✝:CompleteSpace Xp:ℝh1p:1 ≤ php2:p ≤ 2⊢ TR X p ≤ TE X p ∧ TE X p ≤ ↑pi / ↑(sqrt 2) * TR X p All goals completed! 🐙
#82
Thresholds versus fractional expectation-thresholds
annals_fractional_expectation_thresholds

Verso theorem preview

/-- The constant `K` in Theorem 1.1. -/ noncomputable def declaration uses `sorry`K : ℝ := sorry
/-- Statement of Theorem 1.1: There exists a universal constant `K` such that for any finite set `X` and any increasing collection of sets `𝓕` such that `l(𝓕)` is at least `2`, `p_c(𝓕) ≤ K * q_f(𝓕) * log l(𝓕)`. Note: The assumption that `l(𝓕)` is at least `2` is not explicitly in the paper but is needed because if `l(𝓕) = 1` then `Real.log (l 𝓕) = 0`, but `p_c 𝓕 ∈ (0,1)` (so the inequality clearly cannot hold). -/ theorem declaration uses `sorry`theorem_1_1 (X : Type*) [Fintype X] (𝓕 : Set (Set X)) (h𝓕 : IsUpperSet 𝓕) (hl𝓕 : 2 ≤ l 𝓕) : p_c 𝓕 ≤ K * q_f 𝓕 * Real.log (l 𝓕) := X:Type u_1inst✝:Fintype X𝓕:Set (Set X)h𝓕:IsUpperSet 𝓕hl𝓕:2 ≤ l 𝓕⊢ ↑(p_c 𝓕) ≤ K * ↑(q_f 𝓕) * Real.log ↑(l 𝓕) All goals completed! 🐙
#83
Equiangular lines with a fixed angle
annals_equiangular_lines_fixed_angle

Verso theorem preview

theorem declaration uses `sorry`theorem_1_2 (α : ℝ) (hα : α ∈ Set.Ioo 0 1) : let k := spectralRadiusOrder ((1 - α) / (2 * α)) (k < ⊤ → ∀ᶠ d in atTop, N α d = ⌊(k.toNat * (d - 1) : ℝ) / (k.toNat - 1 : ℝ)⌋₊) ∧ (k = ⊤ → ∃ e : ℕ → ℝ, e =o[atTop] (Nat.cast : ℕ → ℝ) ∧ ∀ d, N α d = d + e d) := α:ℝhα:α ∈ Set.Ioo 0 1⊢ let k := spectralRadiusOrder ((1 - α) / (2 * α)); (k < ⊤ → ∀ᶠ (d : ℕ) in atTop, N α d = ⌊↑k.toNat * (↑d - 1) / (↑k.toNat - 1)⌋₊) ∧ (k = ⊤ → ∃ e, e =o[atTop] Nat.cast ∧ ∀ (d : ℕ), ↑(N α d) = ↑d + e d) All goals completed! 🐙
#84
Dimitrov's lower bound for the house of a nonzero algebraic integer that is not a root of unity
dimitrov

Verso theorem preview

theorem declaration uses `sorry`dimitrov {K : Type*} [Field K] [NumberField K] (α : K) (α_int : IsIntegral ℤ α) (α_ne_zero : α ≠ 0) (α_not_rootOfUnity : ¬ IsOfFinOrder α) : (2 : ℝ) ^ (1 / (4 * (Finset.univ.image fun σ : K →+* ℂ ↦ (σ α).arg).card) : ℝ) ≤ NumberField.house α := K:Type u_1inst✝¹:Field Kinst✝:NumberField Kα:Kα_int:IsIntegral ℤ αα_ne_zero:α ≠ 0α_not_rootOfUnity:¬IsOfFinOrder α⊢ 2 ^ (1 / (4 * ↑(Finset.image (fun σ => (σ α).arg) Finset.univ).card)) ≤ NumberField.house α All goals completed! 🐙
#85
A counterexample to the unit conjecture for group rings
annals_unit_conjecture

Verso theorem preview

theorem declaration uses `sorry`theorem_A : (∀ g : UnitConjecture.P, ∀ n ≠ 0, g ^ n = 1 → g = 1) ∧ IsUnit UnitConjecture.u ∧ ¬ ∃ g : UnitConjecture.P, UnitConjecture.u = g := ⊢ (∀ (g : P) (n : ℕ), n ≠ 0 → g ^ n = 1 → g = 1) ∧ IsUnit u ∧ ¬∃ g, u = (MonoidAlgebra.of (ZMod 2) P) g All goals completed! 🐙
#86
First submissionSep 11, 2026
Last submissionOct 13, 2026
skidanovalex86
9Vasily-24-hour-gpt-5.6-speedrun79 solved
The Landsberg–Schaar relation
landsberg_schaar

Verso theorem preview

theorem declaration uses `sorry`landsberg_schaar (p q : ℕ) (hp : Odd p) (hq : Odd q) : gaussS (2 * q : ℕ) p = Complex.exp ((Real.pi : ℂ) * Complex.I / 4) * gaussS (-(p : ℤ)) (2 * q) := p:ℕq:ℕhp:Odd phq:Odd q⊢ gaussS (↑(2 * q)) p = cexp (↑Real.pi * I / 4) * gaussS (-↑p) (2 * q) All goals completed! 🐙
#1
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Radon transform: Fourier-slice diagonalization and pseudo-inversion
radon_transform_inversion

Verso theorem preview

theorem declaration uses `sorry`radon_can_be_diagonalized_and_pseudo_inverted : (∀ φ : SchwartzMap (ℝ × ℝ) ℂ, ∀ θ k : ℝ, fourier1 (fun p => radon (φ : ℝ × ℝ → ℂ) (p, θ)) k = fourier2 (φ : ℝ × ℝ → ℂ) (k * Real.cos θ, k * Real.sin θ)) ∧ (∃ Rinv : (ℝ × ℝ → ℂ) → (ℝ × ℝ → ℂ), ∀ φ : SchwartzMap (ℝ × ℝ) ℂ, Rinv (radon (φ : ℝ × ℝ → ℂ)) = (φ : ℝ × ℝ → ℂ)) := ⊢ (∀ (φ : SchwartzMap (ℝ × ℝ) ℂ) (θ k : ℝ), fourier1 (fun p => radon ⇑φ (p, θ)) k = fourier2 ⇑φ (k * Real.cos θ, k * Real.sin θ)) ∧ ∃ Rinv, ∀ (φ : SchwartzMap (ℝ × ℝ) ℂ), Rinv (radon ⇑φ) = ⇑φ All goals completed! 🐙
#2
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Boone–Higman theorem (easy direction)
boone_higman_embedding

Verso theorem preview

theorem declaration uses `sorry`boone_higman_embedding {G H K : Type*} [Group G] [Group H] [Group K] [IsSimpleGroup H] [Group.IsFinitelyPresented K] (f : G →* H) (hf : Function.Injective f) (g : H →* K) (hg : Function.Injective g) {n : ℕ} (φ : FreeGroup (Fin n) →* G) (hsurj : Function.Surjective φ) (hker : (MonoidHom.ker φ).IsFinitelyNormallyGenerated) : LeanEval.GroupTheory.BooneHigmanEmbedding.WordProblemSolvable φ := G:Type u_1H:Type u_2K:Type u_3inst✝⁴:Group Ginst✝³:Group Hinst✝²:Group Kinst✝¹:IsSimpleGroup Hinst✝:Group.IsFinitelyPresented Kf:G →* Hhf:Function.Injective ⇑fg:H →* Khg:Function.Injective ⇑gn:ℕφ:FreeGroup (Fin n) →* Ghsurj:Function.Surjective ⇑φhker:φ.ker.IsFinitelyNormallyGenerated⊢ WordProblemSolvable φ All goals completed! 🐙
#3
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Choquet's representation theorem
choquet_representation_theorem

Verso theorem preview

theorem declaration uses `sorry`choquet [MeasurableSpace X] [BorelSpace X] (K : Set X) (hK_cpt : IsCompact K) (hK_cvx : Convex ℝ K) {x : X} (hx : x ∈ K) : ∃ μ : Measure X, IsProbabilityMeasure μ ∧ μ (K.extremePoints ℝ)ᶜ = 0 ∧ x = ∫ y, y ∂μ := X:Type u_1inst✝⁴:NormedAddCommGroup Xinst✝³:NormedSpace ℝ Xinst✝²:CompleteSpace Xinst✝¹:MeasurableSpace Xinst✝:BorelSpace XK:Set XhK_cpt:IsCompact KhK_cvx:Convex ℝ Kx:Xhx:x ∈ K⊢ ∃ μ, IsProbabilityMeasure μ ∧ μ (Set.extremePoints ℝ K)ᶜ = 0 ∧ x = ∫ (y : X), y ∂μ All goals completed! 🐙
#4
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Fang–Xia: tiling of the symmetric group by transpositions implies λ-transitivity
fang_xia_tiling_partition_transitive

Verso theorem preview

theorem declaration uses `sorry`fang_xia_partition_transitive_of_tiling {n : ℕ} {Y : Set (Equiv.Perm (Fin n))} (_h : LeanEval.Combinatorics.FangXiaTilingProblem.IsTiling (LeanEval.Combinatorics.FangXiaTilingProblem.transpositionsWithOne n) Y) : ∀ lam : LeanEval.Combinatorics.FangXiaTilingProblem.PartitionShape n, 0 ≤ lam.contentSum → LeanEval.Combinatorics.FangXiaTilingProblem.IsPartitionTransitive Y lam := n:ℕY:Set (Equiv.Perm (Fin n))_h:IsTiling (transpositionsWithOne n) Y⊢ ∀ (lam : PartitionShape n), 0 ≤ lam.contentSum → IsPartitionTransitive Y lam All goals completed! 🐙
#5
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Fraser: Fourier decay for finite-field Kakeya sets is q^{-1} and sharp
fraser_kakeya_fourier_decay

Verso theorem preview

theorem declaration uses `sorry`fraser_kakeya_fourier_decay_and_sharp {d : ℕ} (_hd : 2 ≤ d) {K : Set (LeanEval.Combinatorics.FraserKakeyaProblem.Space F d)} (_hK : LeanEval.Combinatorics.FraserKakeyaProblem.IsKakeya K) (χ : AddChar F ℂ) (_hχ : χ ≠ 1) : (∃ μ : LeanEval.Combinatorics.FraserKakeyaProblem.Space F d → ℝ, LeanEval.Combinatorics.FraserKakeyaProblem.IsProbabilityMeasureOn K μ ∧ ∀ ξ : LeanEval.Combinatorics.FraserKakeyaProblem.Space F d, ξ ≠ 0 → ‖fourier χ μ ξ‖ ≤ (Fintype.card F : ℝ)⁻¹) ∧ (∀ κ : ℝ, 0 < κ → κ < 1 → ∃ Q : ℕ, ∀ (F' : Type*) [Field F'] [Fintype F'] [DecidableEq F'], Q ≤ Fintype.card F' → ∃ K' : Set (LeanEval.Combinatorics.FraserKakeyaProblem.Space F' d), LeanEval.Combinatorics.FraserKakeyaProblem.IsKakeya K' ∧ ∀ μ : LeanEval.Combinatorics.FraserKakeyaProblem.Space F' d → ℝ, LeanEval.Combinatorics.FraserKakeyaProblem.IsProbabilityMeasureOn K' μ → ∃ ξ : LeanEval.Combinatorics.FraserKakeyaProblem.Space F' d, ξ ≠ 0 ∧ κ * (Fintype.card F' : ℝ)⁻¹ ≤ ‖fourier (AddChar.FiniteField.primitiveChar_to_Complex F') μ ξ‖) := F:Type u_1inst✝²:Field Finst✝¹:Fintype Finst✝:DecidableEq Fd:ℕ_hd:2 ≤ dK:Set (Space F d)_hK:IsKakeya Kχ:AddChar F ℂ_hχ:χ ≠ 1⊢ (∃ μ, IsProbabilityMeasureOn K μ ∧ ∀ (ξ : Space F d), ξ ≠ 0 → ‖LeanEval.Combinatorics.FraserKakeyaProblem.fourier χ μ ξ‖ ≤ (↑(Fintype.card F))⁻¹) ∧ ∀ (κ : ℝ), 0 < κ → κ < 1 → ∃ Q, ∀ (F' : Type u_2) [inst : Field F'] [inst_1 : Fintype F'] [DecidableEq F'], Q ≤ Fintype.card F' → ∃ K', IsKakeya K' ∧ ∀ (μ : Space F' d → ℝ), IsProbabilityMeasureOn K' μ → ∃ ξ, ξ ≠ 0 ∧ κ * (↑(Fintype.card F'))⁻¹ ≤ ‖LeanEval.Combinatorics.FraserKakeyaProblem.fourier (AddChar.FiniteField.primitiveChar_to_Complex F') μ ξ‖ All goals completed! 🐙
#6
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Frobenius determinant theorem
frobenius_group_determinant

Verso theorem preview

theorem declaration uses `sorry`frobenius_group_determinant (G : Type*) [Group G] [Fintype G] [DecidableEq G] : ∃ (r : ℕ) (p : Fin r → MvPolynomial G ℂ), r = Nat.card (ConjClasses G) ∧ (∀ j, Irreducible (p j)) ∧ (∀ i j, i ≠ j → ¬ Associated (p i) (p j)) ∧ groupDeterminant G = ∏ j, (p j) ^ (p j).totalDegree := G:Type u_1inst✝²:Group Ginst✝¹:Fintype Ginst✝:DecidableEq G⊢ ∃ r p, r = Nat.card (ConjClasses G) ∧ (∀ (j : Fin r), Irreducible (p j)) ∧ (∀ (i j : Fin r), i ≠ j → ¬Associated (p i) (p j)) ∧ groupDeterminant G = ∏ j, p j ^ (p j).totalDegree All goals completed! 🐙
#7
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Halmos's generic weak-mixing theorem
halmos_generic_weak_mixing

Verso theorem preview

theorem declaration uses `sorry`generic_weakly_mixing [StandardBorelSpace X] (m : Measure X) [IsProbabilityMeasure m] [NullSingletonClass m] : (∃ G : Set (LeanEval.Dynamics.HalmosGenericWeakMixingProblem.Automorphism m), IsGδ G ∧ Dense G ∧ ∀ T ∈ G, LeanEval.Dynamics.HalmosGenericWeakMixingProblem.IsWeaklyMixing m T) ∧ (∀ T : LeanEval.Dynamics.HalmosGenericWeakMixingProblem.Automorphism m, LeanEval.Dynamics.HalmosGenericWeakMixingProblem.IsWeaklyMixing m T → Ergodic (T.toEquiv : X → X) m) := X:Type u_1inst✝³:MeasurableSpace Xinst✝²:StandardBorelSpace Xm:Measure Xinst✝¹:IsProbabilityMeasure minst✝:NullSingletonClass m⊢ (∃ G, IsGδ G ∧ Dense G ∧ ∀ T ∈ G, IsWeaklyMixing m T) ∧ ∀ (T : Automorphism m), IsWeaklyMixing m T → Ergodic (⇑T.toEquiv) m All goals completed! 🐙
#8
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Hausdorff moment problem: absolute-continuity criterion
hausdorff_absolute_continuity

Verso theorem preview

theorem declaration uses `sorry`hausdorff_absolute_continuity {d : ℕ} (μ : Measure (EuclideanSpace ℝ (Fin d))) [IsProbabilityMeasure μ] (hμ : μ ((LeanEval.Analysis.HausdorffAbsoluteContinuity.cube d)ᶜ) = 0) : LeanEval.Analysis.HausdorffAbsoluteContinuity.UniformlyAbsolutelyContinuous μ (volume.restrict (LeanEval.Analysis.HausdorffAbsoluteContinuity.cube d)) ↔ ∃ C : ℝ, ∀ k n : Fin d → ℕ, k ≤ n → diff (momentOf μ) k n ≤ C * diff (momentOf (volume.restrict (LeanEval.Analysis.HausdorffAbsoluteContinuity.cube d))) k n := d:ℕμ:Measure (EuclideanSpace ℝ (Fin d))inst✝:IsProbabilityMeasure μhμ:μ (cube d)ᶜ = 0⊢ UniformlyAbsolutelyContinuous μ (volume.restrict (cube d)) ↔ ∃ C, ∀ (k n : Fin d → ℕ), k ≤ n → diff (momentOf μ) k n ≤ C * diff (momentOf (volume.restrict (cube d))) k n All goals completed! 🐙
#9
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

The Hausdorff–Hildebrandt–Schoenberg moment theorem
hausdorff_hildebrandt_schoenberg

Verso theorem preview

theorem declaration uses `sorry`hausdorff_hildebrandt_schoenberg {d : ℕ} (a : (Fin d → ℕ) → ℝ) : LeanEval.Analysis.IsMomentConfiguration a ↔ LeanEval.Analysis.HausdorffBounded a := d:ℕa:(Fin d → ℕ) → ℝ⊢ IsMomentConfiguration a ↔ HausdorffBounded a All goals completed! 🐙
#10
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

The Hausdorff positivity (complete-monotonicity) criterion
hausdorff_positivity_criterion

Lean theorem statement

/-- **Hausdorff positivity criterion** (Hausdorff 1921). A moment configuration
comes from a positive measure iff all its iterated backward differences are
nonnegative — i.e. the sequence is *completely monotone*: `(Δᵏa)ₙ ≥ 0` for all
`k ≤ n`. -/
theorem hausdorff_positivity {d : ℕ} (a : (Fin d → ℕ) → ℝ) :
    IsPositiveMomentConfiguration a ↔ ∀ k n : Fin d → ℕ, k ≤ n → 0 ≤ diff a k n := by
  sorry
#11
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Kirk's normal-structure fixed point theorem
kirk_normal_structure

Verso theorem preview

theorem declaration uses `sorry`kirk_normal_structure [CompleteSpace E] (hE_reflexive : Function.Surjective (NormedSpace.inclusionInDoubleDual ℝ E)) (K : Set E) (hK_nonempty : K.Nonempty) (hK_closed : IsClosed K) (hK_bounded : Bornology.IsBounded K) (hK_convex : Convex ℝ K) (hK_normal : LeanEval.Topology.KirkNormalStructure.HasNormalStructure K) (T : K → K) (hT : LeanEval.Topology.KirkNormalStructure.IsNonexpansiveSelfMap K T) : ∃ x : K, IsFixedPt T x := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:CompleteSpace EhE_reflexive:Surjective ⇑(NormedSpace.inclusionInDoubleDual ℝ E)K:Set EhK_nonempty:K.NonemptyhK_closed:IsClosed KhK_bounded:Bornology.IsBounded KhK_convex:Convex ℝ KhK_normal:HasNormalStructure KT:↑K → ↑KhT:IsNonexpansiveSelfMap K T⊢ ∃ x, IsFixedPt T x All goals completed! 🐙
#12
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Fundamental theorem of Riemannian geometry (Levi-Civita)
levi_civita_exists_unique

Lean theorem statement

/-- **Fundamental theorem of Riemannian geometry** (Levi-Civita). On a
`C^∞` finite-dimensional Riemannian manifold there exists a smooth
torsion-free metric-compatible covariant derivative on `TM`, and any other
such connection agrees with it on smooth vector fields. -/
theorem levi_civita_exists_unique
    {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E]
      [FiniteDimensional ℝ E] [CompleteSpace E]
    {H : Type*} [TopologicalSpace H] {I : ModelWithCorners ℝ E H}
    {M : Type*} [TopologicalSpace M] [T2Space M] [ChartedSpace H M]
      [IsManifold I ∞ M]
    [RiemannianBundle (fun (x : M) ↦ TangentSpace I x)]
    [IsContMDiffRiemannianBundle I ∞ E (fun (x : M) ↦ TangentSpace I x)] :
    ∃ cov : CovariantDerivative I E (TangentSpace I (M := M)),
      (ContMDiffCovariantDerivative cov ∞ ∧
        cov.torsion = 0 ∧ IsMetricCompatible cov) ∧
      ∀ cov' : CovariantDerivative I E (TangentSpace I (M := M)),
        (ContMDiffCovariantDerivative cov' ∞ ∧
          cov'.torsion = 0 ∧ IsMetricCompatible cov') →
        SameOnSmooth cov cov' := by
  sorry
#13
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Lindemann's theorem (e and π transcendental)
lindemann

Lean theorem statement

/-- **Lindemann's theorem.** Both `e = exp 1` and `π` are transcendental over
`ℤ`. -/
theorem lindemann :
    Transcendental ℤ (Real.exp 1) ∧ Transcendental ℤ Real.pi := by
  sorry
#14
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

The Lindemann–Weierstrass theorem
lindemann_weierstrass

Lean theorem statement

/-- **Lindemann–Weierstrass theorem.** If `x₁, …, xₙ ∈ ℂ` are algebraic over `ℚ`
and ℚ-linearly independent, then `e^{x₁}, …, e^{xₙ}` are algebraically
independent over `ℚ`. -/
theorem lindemann_weierstrass {n : ℕ} (x : Fin n → ℂ)
    (h_alg : ∀ i, IsAlgebraic ℚ (x i))
    (h_lin : LinearIndependent ℚ x) :
    AlgebraicIndependent ℚ (fun i => Complex.exp (x i)) := by
  sorry
#15
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Mountain Pass Theorem (Ambrosetti–Rabinowitz 1973)
mountain_pass

Verso theorem preview

theorem declaration uses `sorry`mountain_pass (f : E → ℝ) (_hf : ContDiff ℝ 1 f) (_hps : LeanEval.Analysis.MountainPassProblem.PalaisSmale f) {a b : E} {ε r : ℝ} (_hmr : LeanEval.Analysis.MountainPassProblem.MountainRange f a b ε r) : ∃ x : E, LeanEval.Analysis.MountainPassProblem.IsCriticalPoint f x ∧ f x = mountainPassLevel f a b ∧ ε ≤ mountainPassLevel f a b := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:CompleteSpace Ef:E → ℝ_hf:ContDiff ℝ 1 f_hps:PalaisSmale fa:Eb:Eε:ℝr:ℝ_hmr:MountainRange f a b ε r⊢ ∃ x, IsCriticalPoint f x ∧ f x = mountainPassLevel f a b ∧ ε ≤ mountainPassLevel f a b All goals completed! 🐙
#16
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Nyquist–Shannon sampling theorem
nyquist_shannon_sampling

Verso theorem preview

theorem declaration uses `sorry`nyquist_shannon_sampling (f : 𝓢(ℝ, ℂ)) (hf : LeanEval.Analysis.NyquistShannon.FourierSupportedInNyquist f) : ∀ t : ℝ, Summable (fun n : ℤ ↦ f (n : ℝ) * sinc (Real.pi * ((n : ℝ) - t))) ∧ f t = ∑' n : ℤ, f (n : ℝ) * sinc (Real.pi * ((n : ℝ) - t)) := f:𝓢(ℝ, ℂ)hf:FourierSupportedInNyquist f⊢ ∀ (t : ℝ), (Summable fun n => f ↑n * sinc (Real.pi * (↑n - t))) ∧ f t = ∑' (n : ℤ), f ↑n * sinc (Real.pi * (↑n - t)) All goals completed! 🐙
#17
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Pascal's theorem
pascal

Lean theorem statement

/-- **Pascal's theorem.** Six distinct points on a non-singular conic determine
three collinear intersection points `Aᵢ Bⱼ ∩ Aⱼ Bᵢ`. -/
theorem pascal
    (M : Matrix (Fin 3) (Fin 3) ℝ) (hMsymm : M.IsSymm) (hMdet : M.det ≠ 0)
    (a₁ a₂ a₃ b₁ b₂ b₃ : Fin 3 → ℝ)
    (ha₁ : a₁ ≠ 0) (ha₂ : a₂ ≠ 0) (ha₃ : a₃ ≠ 0)
    (hb₁ : b₁ ≠ 0) (hb₂ : b₂ ≠ 0) (hb₃ : b₃ ≠ 0)
    (hdist : [a₁, a₂, a₃, b₁, b₂, b₃].Pairwise (fun v w => ¬ SamePoint v w))
    (hA₁ : OnConic M a₁) (hA₂ : OnConic M a₂) (hA₃ : OnConic M a₃)
    (hB₁ : OnConic M b₁) (hB₂ : OnConic M b₂) (hB₃ : OnConic M b₃) :
    Collinear3 (meet a₁ b₂ a₂ b₁) (meet a₁ b₃ a₃ b₁) (meet a₂ b₃ a₃ b₂) := by
  sorry
#18
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Sard's regular-value corollary
regular_value_ae

Lean theorem statement

/-- **Regular value corollary (Sard).** For a smooth `f : ℝᵐ → ℝ`, almost every
`c ∈ ℝ` is a regular value. -/
theorem regular_value_ae {m : ℕ} (f : EuclideanSpace ℝ (Fin m) → ℝ)
    (hf : ContDiff ℝ ∞ f) :
    ∀ᵐ c ∂(volume : Measure ℝ), IsRegularValue f c := by
  sorry
#19
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Rokhlin lemma
rokhlin_lemma

Lean theorem statement

/-- **Rokhlin lemma, not-necessarily-invertible forward-image form.** For every
aperiodic measure-preserving transformation `T` of a standard Borel probability
space `(Ω, μ)`, every height `n ≥ 1`, and every `ε > 0`, there is a measurable
base whose `n` forward-image floors `B, T B, …, T^{n−1} B` are pairwise
disjoint and whose union has outer measure at least `1 − ε`. No invertibility
assumption is made. -/
theorem rokhlin_lemma {Ω : Type*} [MeasurableSpace Ω]
    [StandardBorelSpace Ω]
    (μ : Measure Ω) [IsProbabilityMeasure μ] (T : Ω → Ω)
    (_hT : MeasurePreserving T μ μ) (_hap : IsAperiodic T μ)
    (n : ℕ) (_hn : 1 ≤ n) {ε : ENNReal} (_hε : 0 < ε) :
    ∃ B : Set Ω, IsRokhlinTower T B n ∧
      μ (towerUnion T B n) ≥ 1 - ε := by
  sorry
#20
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Shannon capacity of the pentagon
shannon_capacity_pentagon

Lean theorem statement

/-- **Lovász's theorem on Shannon capacity of the pentagon** (§238).
The Shannon capacity of the five-cycle is `√5`. -/
theorem shannon_capacity_pentagon :
    HasShannonCapacity (SimpleGraph.cycleGraph 5) (Real.sqrt 5) := by
  sorry
#21
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Tverberg's theorem
tverberg_theorem

Lean theorem statement

/-- **Tverberg's theorem.** Any `(r-1)(d+1)+1` points in `ℝ^d` admit an
`r`-part Tverberg partition. -/
theorem tverberg_theorem (d r : ℕ) (hr : 1 ≤ r)
    (f : Fin ((r - 1) * (d + 1) + 1) → Space d) :
    HasTverbergPartition (r := r) f := by
  sorry
#22
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Wiener's 1/f theorem
wiener_inverse_closed

Lean theorem statement

/-- **Wiener's `1/f` theorem.** If a function on the circle belongs to the
Wiener algebra and has no zero on the circle, then its pointwise reciprocal
again belongs to the Wiener algebra. -/
theorem wiener_inverse_closed (f : C(AddCircle T, ℂ))
    (hf : InWienerAlgebra f) (hzero : ∀ x, f x ≠ 0) :
    ∃ g : C(AddCircle T, ℂ),
      (∀ x, g x = (f x)⁻¹) ∧ InWienerAlgebra g := by
  sorry
#23
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Wiener–Lévy theorem
wiener_levy_analytic_calculus

Lean theorem statement

/-- **Wiener–Lévy theorem.** If `φ` is complex-analytic on a neighbourhood of
the range of a Wiener-algebra function `f`, then the composed function
`φ ∘ f` is again in the Wiener algebra. -/
theorem wiener_levy_analytic_calculus (f : C(AddCircle T, ℂ))
    (φ : ℂ → ℂ) (U : Set ℂ) (hf : InWienerAlgebra f)
    (hU : IsOpen U) (hrange : range f ⊆ U)
    (hφ : AnalyticOnNhd ℂ φ U) :
    ∃ g : C(AddCircle T, ℂ),
      (∀ x, g x = φ (f x)) ∧ InWienerAlgebra g := by
  sorry
#24
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Balanceable k-bounded partitions
balanceable_bounded_partitions

Lean theorem statement

/--
For any `k`, the smallest `n` such that any `k`-bounded partition of `n` is
also balanceable is given by `2 * lcm(1, ..., k)`.
-/
theorem minimal_balanceable_of_bounded (k : ℕ) (hk : 0 < k) :
    Minimal (fun n => 0 < n ∧ ∀ p : n.Partition, Bounded k p → Balanceable p) (2 * (Finset.Icc 1 k).lcm id) := by
  sorry
#25
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Brauer–Fowler theorem
brauer_fowler

Lean theorem statement

/-- **Brauer–Fowler theorem.** There is a function bounding the order
of a finite nonabelian simple group by the order of any involution
centralizer. -/
theorem brauer_fowler :
    ∃ f : ℕ → ℕ, ∀ (G : Type) [Group G] [Finite G],
      IsSimpleGroup G → (∃ a b : G, a * b ≠ b * a) →
      ∀ t : G, orderOf t = 2 →
        Nat.card G ≤ f (Nat.card (Subgroup.centralizer ({t} : Set G))) := by
  sorry
#26
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Chudnovsky formula for pi inverse
chudnovsky_formula_for_pi_inv

Verso theorem preview

theorem declaration uses `sorry`chudnovsky_formula_for_pi_inv : chudnovskySum = π⁻¹ := ⊢ chudnovskySum = π⁻¹ All goals completed! 🐙
#27
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Complete reducibility for compact groups
compact_group_semisimple

Verso theorem preview

theorem declaration uses `sorry`compact_group_semisimple {G V : Type*} [Group G] [TopologicalSpace G] [IsTopologicalGroup G] [CompactSpace G] [NormedAddCommGroup V] [NormedSpace ℝ V] [FiniteDimensional ℝ V] (ρ : Representation ℝ G V) (hρ : Continuous fun p : G × V => ρ p.1 p.2) : ρ.IsSemisimpleRepresentation := G:Type u_1V:Type u_2inst✝⁶:Group Ginst✝⁵:TopologicalSpace Ginst✝⁴:IsTopologicalGroup Ginst✝³:CompactSpace Ginst✝²:NormedAddCommGroup Vinst✝¹:NormedSpace ℝ Vinst✝:FiniteDimensional ℝ Vρ:Representation ℝ G Vhρ:Continuous fun p => (ρ p.1) p.2⊢ ρ.IsSemisimpleRepresentation All goals completed! 🐙
#28
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Furstenberg–Weiss topological multiple recurrence (single-transformation form)
furstenberg_topological

Lean theorem statement

/-- **Furstenberg–Weiss topological multiple recurrence** (single-
transformation form). Every homeomorphism `T` of a nonempty compact
metric space `X` has a multiply recurrent point. -/
theorem furstenberg_topological_recurrence {X : Type*} [MetricSpace X]
    [CompactSpace X] [Nonempty X] (T : X ≃ₜ X) :
    ∃ x : X, IsMultiplyRecurrent (T : X → X) x := by
  sorry
#29
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Hippocrates' theorem on lunes
hippocrates_lunes

Verso theorem preview

theorem declaration uses `sorry`hippocrates_lunes (a b : ℝ) (ha : 0 < a) (hb : 0 < b) : volume (LeanEval.Geometry.HippocratesLunes.horizontalLune a b) + volume (LeanEval.Geometry.HippocratesLunes.verticalLune a b) = volume (LeanEval.Geometry.HippocratesLunes.rightTriangle a b) := a:ℝb:ℝha:0 < ahb:0 < b⊢ volume (horizontalLune a b) + volume (verticalLune a b) = volume (rightTriangle a b) All goals completed! 🐙
#30
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Jordan normal form
jordan_normal_form

Lean theorem statement

/-- **Jordan normal form.** Over an algebraically closed field, every
endomorphism of `Kⁿ` admits a Jordan-chain basis. -/
theorem jordan_normal_form {K : Type*} [Field K] [IsAlgClosed K] (n : ℕ)
    (f : Module.End K (StdSpace K n)) :
    Nonempty (JordanChainBasis f) := by
  sorry
#31
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Kakutani fixed-point theorem
kakutani_fixed_point

Lean theorem statement

/-- **Kakutani fixed-point theorem.** Every upper-hemicontinuous
correspondence `F` from a nonempty compact convex `K ⊆ ℝᵈ` to itself, with
nonempty convex closed values, has a fixed point `x ∈ F x`. -/
theorem kakutani_fixed_point {d : ℕ}
    {K : Set (EuclideanSpace ℝ (Fin d))}
    (_hK_compact : IsCompact K) (_hK_convex : Convex ℝ K)
    (_hK_nonempty : K.Nonempty)
    (F : EuclideanSpace ℝ (Fin d) → Set (EuclideanSpace ℝ (Fin d)))
    (_hF_uhc : IsUpperHemicontinuous F)
    (_hF_nonempty : ∀ x ∈ K, (F x).Nonempty)
    (_hF_convex : ∀ x ∈ K, Convex ℝ (F x))
    (_hF_closed : ∀ x ∈ K, IsClosed (F x))
    (_hF_maps : ∀ x ∈ K, F x ⊆ K) :
    ∃ x ∈ K, x ∈ F x := by
  sorry
#32
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Monge–Kantorovich existence theorem
monge_kantorovich

Verso theorem preview

theorem declaration uses `sorry`monge_kantorovich_exists {X Y : Type*} [TopologicalSpace X] [PolishSpace X] [MeasurableSpace X] [BorelSpace X] [TopologicalSpace Y] [PolishSpace Y] [MeasurableSpace Y] [BorelSpace Y] (P : Measure X) (Q : Measure Y) [IsProbabilityMeasure P] [IsProbabilityMeasure Q] (c : X × Y → ENNReal) (_hc : Continuous c) : ∃ π ∈ LeanEval.Analysis.Couplings P Q, ∀ π' ∈ LeanEval.Analysis.Couplings P Q, kantorovichCost c π ≤ kantorovichCost c π' := X:Type u_1Y:Type u_2inst✝⁹:TopologicalSpace Xinst✝⁸:PolishSpace Xinst✝⁷:MeasurableSpace Xinst✝⁶:BorelSpace Xinst✝⁵:TopologicalSpace Yinst✝⁴:PolishSpace Yinst✝³:MeasurableSpace Yinst✝²:BorelSpace YP:Measure XQ:Measure Yinst✝¹:IsProbabilityMeasure Pinst✝:IsProbabilityMeasure Qc:X × Y → ENNReal_hc:Continuous c⊢ ∃ π ∈ Couplings P Q, ∀ π' ∈ Couplings P Q, kantorovichCost c π ≤ kantorovichCost c π' All goals completed! 🐙
#33
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Nash equilibrium existence theorem
nash_equilibrium_exists

Lean theorem statement

/-- **Nash equilibrium existence theorem.** Every finite `n`-player game
with nonempty finite pure-strategy sets and arbitrary real payoffs admits
at least one mixed-strategy Nash equilibrium. -/
theorem nash_equilibrium_exists {n : ℕ} {S : Fin n → Type*}
    [∀ i, Fintype (S i)] [∀ i, Nonempty (S i)]
    (u : Fin n → StrategyProfile n S → ℝ) :
    ∃ σ : ∀ i, S i → ℝ, IsNashEquilibrium u σ := by
  sorry
#34
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Peano existence theorem for ODEs
peano_existence

Verso theorem preview

theorem declaration uses `sorry`peano_existence {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] {f : E → E} (hf : Continuous f) (x₀ : E) : ∃ a : ℝ, 0 < a ∧ ∃ α : ℝ → E, α 0 = x₀ ∧ ∀ t ∈ Ioo (-a) a, HasDerivAt α (f (α t)) t := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:FiniteDimensional ℝ Ef:E → Ehf:Continuous fx₀:E⊢ ∃ a, 0 < a ∧ ∃ α, α 0 = x₀ ∧ ∀ t ∈ Ioo (-a) a, HasDerivAt α (f (α t)) t All goals completed! 🐙
#35
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

A competition programming problem about permuting a permutation to be unimodal
permute_to_unimodal

Lean theorem statement

/--
`minRearrange` correctly computes the smallest number of indices that need to be permuted in order to
turn `arr` into a unimodal permutation.
-/
theorem minRearrange_correct {arr : Array Nat} :
    arr.Perm (1...=arr.size).toArray →
      (∃ (x : Array Nat) (hx : x.Perm (1...=arr.size).toArray), Unimodal x ∧ differences (Vector.mk x (by simpa using hx.size_eq)) arr.toVector = minRearrange arr) ∧
      (∀ (x : Array Nat) (hx : x.Perm (1...=arr.size).toArray), Unimodal x → minRearrange arr ≤ differences (Vector.mk x (by simpa using hx.size_eq)) arr.toVector) := by
  sorry
#36
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Sard's theorem (critical-set image has measure zero)
sard_theorem

Verso theorem preview

theorem declaration uses `sorry`sard {m n : ℕ} (f : LeanEval.Geometry.SardTheoremProblem.E m → LeanEval.Geometry.SardTheoremProblem.E n) (_hf : ContDiff ℝ ∞ f) : volume (LeanEval.Geometry.SardTheoremProblem.criticalValues f) = 0 := m:ℕn:ℕf:E m → E n_hf:ContDiff ℝ ∞ f⊢ volume (criticalValues f) = 0 All goals completed! 🐙
#37
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Solvable extensions ↔ solvable groups (the missing converse in Abel–Ruffini)
solvable_by_radicals_converse

Lean theorem statement

/-- **Solvable extensions ↔ solvable groups.** For a field `F` of
characteristic zero and a nonzero `p : F[X]`, every root of `p` in
`AlgebraicClosure F` lies in `solvableByRad F (AlgebraicClosure F)`
iff `p.Gal` is solvable. -/
theorem solvable_iff_solvableByRad (F : Type*) [Field F] [CharZero F]
    (p : F[X]) (_hp : p ≠ 0) :
    (∀ x : AlgebraicClosure F, aeval x p = 0 →
        x ∈ solvableByRad F (AlgebraicClosure F)) ↔ Group.IsSolvable p.Gal := by
  sorry
#38
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Sturm's theorem
sturm

Lean theorem statement

/-- **Sturm's theorem.** For a squarefree real polynomial `p` and an interval
`(a, b)` with `a < b` whose endpoints are not roots of `p`, the number of
distinct roots of `p` in `(a, b)` equals `σ(a) − σ(b)`. -/
theorem sturm (p : ℝ[X]) (hp : Squarefree p) {a b : ℝ} (hab : a < b)
    (ha : p.eval a ≠ 0) (hb : p.eval b ≠ 0) :
    ((p.roots.toFinset).filter (fun x => a < x ∧ x < b)).card =
      sigma p a - sigma p b := by
  sorry
#39
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Schur-Weyl duality: S_k image equals centralizer of GL(V) image
symAction_range_eq_centralizer_glAction

Verso theorem preview

theorem declaration uses `sorry`symAction_range_eq_centralizer_glAction {R : Type*} [Field R] {M : Type*} [AddCommGroup M] [Module R M] [FiniteDimensional R M] {k : ℕ} [Invertible (k.factorial : R)] : Algebra.adjoin R (Set.range (LeanEval.RepresentationTheory.symAction R M k)) = Subalgebra.centralizer R (Set.range (LeanEval.RepresentationTheory.glAction R M k)) := R:Type u_1inst✝⁴:Field RM:Type u_2inst✝³:AddCommGroup Minst✝²:Module R Minst✝¹:FiniteDimensional R Mk:ℕinst✝:Invertible ↑k.factorial⊢ Algebra.adjoin R (Set.range ⇑(symAction R M k)) = Subalgebra.centralizer R (Set.range ⇑(glAction R M k)) All goals completed! 🐙
#40
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Bauer's uniqueness at extreme points
bauer_extreme_point_uniqueness

Verso theorem preview

theorem declaration uses `sorry`bauer_unique [MeasurableSpace X] [BorelSpace X] (K : Set X) (hK_cpt : IsCompact K) (hK_cvx : Convex ℝ K) {x : X} (hx : x ∈ K.extremePoints ℝ) (μ : Measure X) [IsProbabilityMeasure μ] (hμ : μ Kᶜ = 0) (hbar : x = ∫ y, y ∂μ) : μ = Measure.dirac x := X:Type u_1inst✝⁵:NormedAddCommGroup Xinst✝⁴:NormedSpace ℝ Xinst✝³:CompleteSpace Xinst✝²:MeasurableSpace Xinst✝¹:BorelSpace XK:Set XhK_cpt:IsCompact KhK_cvx:Convex ℝ Kx:Xhx:x ∈ Set.extremePoints ℝ Kμ:Measure Xinst✝:IsProbabilityMeasure μhμ:μ Kᶜ = 0hbar:x = ∫ (y : X), y ∂μ⊢ μ = Measure.dirac x All goals completed! 🐙
#41
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Kuznetsov's theorem: finitely presented simple groups have solvable word problem
boone_higman_simple

Verso theorem preview

theorem declaration uses `sorry`boone_higman_simple {G : Type*} [Group G] [IsSimpleGroup G] {n : ℕ} (φ : FreeGroup (Fin n) →* G) (_hsurj : Function.Surjective φ) (_hker : (MonoidHom.ker φ).IsFinitelyNormallyGenerated) : LeanEval.GroupTheory.BooneHigmanSimpleProblem.WordProblemSolvable φ := G:Type u_1inst✝¹:Group Ginst✝:IsSimpleGroup Gn:ℕφ:FreeGroup (Fin n) →* G_hsurj:Function.Surjective ⇑φ_hker:φ.ker.IsFinitelyNormallyGenerated⊢ WordProblemSolvable φ All goals completed! 🐙
#42
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Euler–Lagrange equation
euler_lagrange_equation

Verso theorem preview

theorem declaration uses `sorry`euler_lagrange_equation {a b : ℝ} (L : ℝ → ℝ → ℝ → ℝ) (x : ℝ → ℝ) (_hab : a < b) (_hL : ContDiff ℝ 2 (fun p : ℝ × ℝ × ℝ => L p.1 p.2.1 p.2.2)) (_hx : ContDiff ℝ 2 x) (_hxe : LeanEval.Analysis.IsVariationalExtremum a b L x) : ∀ t ∈ Set.Ioo a b, lagrangianPartialX L x t = deriv (lagrangianPartialV L x) t := a:ℝb:ℝL:ℝ → ℝ → ℝ → ℝx:ℝ → ℝ_hab:a < b_hL:ContDiff ℝ 2 fun p => L p.1 p.2.1 p.2.2_hx:ContDiff ℝ 2 x_hxe:IsVariationalExtremum a b L x⊢ ∀ t ∈ Ioo a b, lagrangianPartialX L x t = deriv (lagrangianPartialV L x) t All goals completed! 🐙
#43
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Pointwise and Cesàro convergence of Fourier series (Dirichlet, Fejér)
fourier_dirichlet_fejer

Verso theorem preview

/-- **Dirichlet's pointwise convergence theorem** (§46). For every `C¹` 2π-periodic complex function `f`, the symmetric Fourier partial sums `S_N(f)(x)` converge to `f(x)` at every point `x ∈ ℝ`. -/ theorem declaration uses `sorry`dirichlet_pointwise {f : ℝ → ℂ} (_hperiod : Function.Periodic f (2 * Real.pi)) (_hC1 : ContDiff ℝ 1 f) (x : ℝ) : Tendsto (fun N : ℕ => fourierPartialSum f N x) atTop (𝓝 (f x)) := f:ℝ → ℂ_hperiod:Function.Periodic f (2 * Real.pi)_hC1:ContDiff ℝ 1 fx:ℝ⊢ Tendsto (fun N => fourierPartialSum f N x) atTop (𝓝 (f x)) All goals completed! 🐙
/-- **Fejér's theorem** (§46). For every *continuous* 2π-periodic complex function `f` — without the `C¹` hypothesis of Dirichlet's theorem — the Cesàro means `σ_N(f)` of the symmetric Fourier partial sums converge to `f` uniformly on `ℝ`. -/ theorem declaration uses `sorry`fejer {f : ℝ → ℂ} (_hperiod : Function.Periodic f (2 * Real.pi)) (_hcont : Continuous f) : TendstoUniformly (fun N : ℕ => fourierCesaroMean f N) f atTop := f:ℝ → ℂ_hperiod:Function.Periodic f (2 * Real.pi)_hcont:Continuous f⊢ TendstoUniformly (fun N => fourierCesaroMean f N) f atTop All goals completed! 🐙
#44
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Schur-Weyl duality: GL(V) image equals centralizer of S_k image
glAction_range_eq_centralizer_symAction

Verso theorem preview

theorem declaration uses `sorry`glAction_range_eq_centralizer_symAction {R : Type*} [Field R] {M : Type*} [AddCommGroup M] [Module R M] [FiniteDimensional R M] {k : ℕ} [Invertible (k.factorial : R)] : Algebra.adjoin R (Set.range (LeanEval.RepresentationTheory.glAction R M k)) = Subalgebra.centralizer R (Set.range (LeanEval.RepresentationTheory.symAction R M k)) := R:Type u_1inst✝⁴:Field RM:Type u_2inst✝³:AddCommGroup Minst✝²:Module R Minst✝¹:FiniteDimensional R Mk:ℕinst✝:Invertible ↑k.factorial⊢ Algebra.adjoin R (Set.range ⇑(glAction R M k)) = Subalgebra.centralizer R (Set.range ⇑(symAction R M k)) All goals completed! 🐙
#45
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Morley's trisector theorem
morley_theorem

Verso theorem preview

theorem declaration uses `sorry`morley_theorem (A B C P Q R : LeanEval.Geometry.Morley.Plane) (h : LeanEval.Geometry.Morley.IsMorleyConfiguration A B C P Q R) : LeanEval.Geometry.Morley.IsEquilateralTriple P Q R := A:PlaneB:PlaneC:PlaneP:PlaneQ:PlaneR:Planeh:IsMorleyConfiguration A B C P Q R⊢ IsEquilateralTriple P Q R All goals completed! 🐙
#46
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Normal spectral theorem
normal_spectral_theorem

Verso theorem preview

theorem declaration uses `sorry`normal_spectral_theorem (A : Matrix n n ℂ) : IsStarNormal A ↔ ∃ U ∈ unitary (Matrix n n ℂ), ∃ d : n → ℂ, A = U * diagonal d * star U := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℂ⊢ IsStarNormal A ↔ ∃ U ∈ unitary (Matrix n n ℂ), ∃ d, A = U * diagonal d * star U All goals completed! 🐙
#47
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Riesz's rising sun lemma
rising_sun_lemma

Verso theorem preview

theorem declaration uses `sorry`rising_sun_lemma {a b : ℝ} (hab : a < b) {f : ℝ → ℝ} (hf : ContinuousOn f (Icc a b)) : LeanEval.Analysis.RisingSun.HasRisingSunProperty a b f := a:ℝb:ℝhab:a < bf:ℝ → ℝhf:ContinuousOn f (Icc a b)⊢ HasRisingSunProperty a b f All goals completed! 🐙
#48
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Runge's theorem
runge_theorem

Verso theorem preview

theorem declaration uses `sorry`runge (K : Set ℂ) (_hK : IsCompact K) (U : Set ℂ) (_hU : IsOpen U) (_hKU : K ⊆ U) (f : ℂ → ℂ) (_hf : AnalyticOnNhd ℂ f U) (ε : ℝ) (_hε : 0 < ε) : ∃ p q : ℂ[X], (∀ z ∈ K, q.eval z ≠ 0) ∧ (∀ z ∈ K, ‖f z - p.eval z / q.eval z‖ < ε) := K:Set ℂ_hK:IsCompact KU:Set ℂ_hU:IsOpen U_hKU:K ⊆ Uf:ℂ → ℂ_hf:AnalyticOnNhd ℂ f Uε:ℝ_hε:0 < ε⊢ ∃ p q, (∀ z ∈ K, Polynomial.eval z q ≠ 0) ∧ ∀ z ∈ K, ‖f z - Polynomial.eval z p / Polynomial.eval z q‖ < ε All goals completed! 🐙
#49
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Schauder fixed-point theorem
schauder_fixed_point

Verso theorem preview

theorem declaration uses `sorry`schauder_fixed_point {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [CompleteSpace E] {K : Set E} (_hK_compact : IsCompact K) (_hK_convex : Convex ℝ K) (_hK_nonempty : K.Nonempty) (f : E → E) (_hf_cont : ContinuousOn f K) (_hf_maps : Set.MapsTo f K K) : ∃ x ∈ K, f x = x := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:CompleteSpace EK:Set E_hK_compact:IsCompact K_hK_convex:Convex ℝ K_hK_nonempty:K.Nonemptyf:E → E_hf_cont:ContinuousOn f K_hf_maps:Set.MapsTo f K K⊢ ∃ x ∈ K, f x = x All goals completed! 🐙
#50
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Abel–Ruffini theorem
abel_ruffini

Verso theorem preview

theorem declaration uses `sorry`abel_ruffini (n : ℕ) (_hn : 1 ≤ n) : (∀ p : ℚ[X], p.natDegree = n → ∀ x : ℂ, aeval x p = 0 → x ∈ solvableByRad ℚ ℂ) ↔ n ≤ 4 := n:ℕ_hn:1 ≤ n⊢ (∀ (p : ℚ[X]), p.natDegree = n → ∀ (x : ℂ), (aeval x) p = 0 → x ∈ solvableByRad ℚ ℂ) ↔ n ≤ 4 All goals completed! 🐙
#51
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Brouwer fixed-point theorem
brouwer_fixed_point

Verso theorem preview

theorem declaration uses `sorry`brouwer_fixed_point {d : ℕ} {K : Set (EuclideanSpace ℝ (Fin d))} (_hK_compact : IsCompact K) (_hK_convex : Convex ℝ K) (_hK_nonempty : K.Nonempty) (f : EuclideanSpace ℝ (Fin d) → EuclideanSpace ℝ (Fin d)) (_hf_cont : ContinuousOn f K) (_hf_maps : MapsTo f K K) : ∃ x ∈ K, f x = x := d:ℕK:Set (EuclideanSpace ℝ (Fin d))_hK_compact:IsCompact K_hK_convex:Convex ℝ K_hK_nonempty:K.Nonemptyf:EuclideanSpace ℝ (Fin d) → EuclideanSpace ℝ (Fin d)_hf_cont:ContinuousOn f K_hf_maps:MapsTo f K K⊢ ∃ x ∈ K, f x = x All goals completed! 🐙
#52
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Bing's house with two rooms is contractible
contractibleSpace_houseWithTwoRooms

Verso theorem preview

theorem declaration uses `sorry`contractibleSpace_houseWithTwoRooms : ContractibleSpace LeanEval.Topology.HouseWithTwoRooms := ⊢ ContractibleSpace ↑HouseWithTwoRooms All goals completed! 🐙
#53
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Trace Cayley-Hamilton / Newton identity
trace_cayley_hamilton_newton

Verso theorem preview

theorem declaration uses `sorry`trace_cayley_hamilton_newton {R : Type*} [CommRing R] (A : Matrix n n R) {k : ℕ} (hk : 1 ≤ k) : (k : R) * charpolyDescendingCoeff A k + ∑ j ∈ Finset.Icc 1 k, trace (A ^ j) * charpolyDescendingCoeff A (k - j) = 0 := n:Type u_1inst✝²:Fintype ninst✝¹:DecidableEq nR:Type u_2inst✝:CommRing RA:Matrix n n Rk:ℕhk:1 ≤ k⊢ ↑k * charpolyDescendingCoeff A k + ∑ j ∈ Finset.Icc 1 k, (A ^ j).trace * charpolyDescendingCoeff A (k - j) = 0 All goals completed! 🐙
#54
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

von Neumann double commutant theorem
vonNeumann_doubleCommutant_tfae

Verso theorem preview

theorem declaration uses `sorry`vonNeumann_doubleCommutant_tfae {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H] (S : StarSubalgebra ℂ (H →L[ℂ] H)) : List.TFAE [ Set.centralizer (Set.centralizer (S : Set (H →L[ℂ] H))) = S , IsClosed (ContinuousLinearMapWOT.ofCLM '' (S : Set (H →L[ℂ] H))) , IsClosed (ContinuousLinearMap.toPointwiseConvergenceCLM ℂ (RingHom.id ℂ) H H '' (S : Set (H →L[ℂ] H))) ] := H:Type u_1inst✝²:NormedAddCommGroup Hinst✝¹:InnerProductSpace ℂ Hinst✝:CompleteSpace HS:StarSubalgebra ℂ (H →L[ℂ] H)⊢ [(↑S).centralizer.centralizer = ↑S, IsClosed (ContinuousLinearMapWOT.ofCLM '' ↑S), IsClosed (⇑(ContinuousLinearMap.toPointwiseConvergenceCLM ℂ (RingHom.id ℂ) H H) '' ↑S)].TFAE All goals completed! 🐙
#55
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Wiener's atom-detection formula
wiener_atom_detection

Verso theorem preview

theorem declaration uses `sorry`wiener_atom_detection (μ : Measure (AddCircle (2 * Real.pi))) [IsProbabilityMeasure μ] : Tendsto (fun N : ℕ => (1 / (N : ℝ)) * ∑ k ∈ Finset.Icc (1 : ℤ) N, ‖fourierCoeffMeasure μ k‖ ^ 2) atTop (𝓝 (∑' x : AddCircle (2 * Real.pi), ((μ {x}).toReal) ^ 2)) := μ:Measure (AddCircle (2 * π))inst✝:IsProbabilityMeasure μ⊢ Tendsto (fun N => 1 / ↑N * ∑ k ∈ Finset.Icc 1 ↑N, ‖fourierCoeffMeasure μ k‖ ^ 2) atTop (𝓝 (∑' (x : AddCircle (2 * π)), (μ {x}).toReal ^ 2)) All goals completed! 🐙
#56
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Real cyclotomic integer with house at most 2
cyclotomic_integer_house_le_two

Verso theorem preview

theorem declaration uses `sorry`cyclotomic_integer_house_le_two {K : Type*} [Field K] [NumberField K] [Algebra ℚ K] (n : ℕ) [NeZero n] [IsCyclotomicExtension {n} ℚ K] {β : K} (hβ_int : IsIntegral ℤ β) (hβ_real : β ∈ NumberField.maximalRealSubfield K) : house β ≤ 2 → house β = 2 ∨ ∃ m : ℕ, 0 < m ∧ house β = 2 * Real.cos (Real.pi / m) := K:Type u_1inst✝⁴:Field Kinst✝³:NumberField Kinst✝²:Algebra ℚ Kn:ℕinst✝¹:NeZero ninst✝:IsCyclotomicExtension {n} ℚ Kβ:Khβ_int:IsIntegral ℤ βhβ_real:β ∈ maximalRealSubfield K⊢ house β ≤ 2 → house β = 2 ∨ ∃ m, 0 < m ∧ house β = 2 * Real.cos (Real.pi / ↑m) All goals completed! 🐙
#57
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Koszul formula
koszul_formula

Verso theorem preview

theorem declaration uses `sorry`koszul_formula {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] [CompleteSpace E] {H : Type*} [TopologicalSpace H] {I : ModelWithCorners ℝ E H} {M : Type*} [TopologicalSpace M] [ChartedSpace H M] [IsManifold I ∞ M] [RiemannianBundle (fun (x : M) ↦ TangentSpace I x)] [IsContMDiffRiemannianBundle I ∞ E (fun (x : M) ↦ TangentSpace I x)] (cov : CovariantDerivative I E (TangentSpace I (M := M))) [ContMDiffCovariantDerivative cov ∞] (_htor : cov.torsion = 0) (_hmet : LeanEval.Geometry.KoszulFormula.IsMetricCompatible cov) (X Y Z : Π x : M, TangentSpace I x) (_hX : CMDiff ∞ (T% X)) (_hY : CMDiff ∞ (T% Y)) (_hZ : CMDiff ∞ (T% Z)) (x : M) : 2 * inner ℝ (cov Y x (X x)) (Z x) = mvfderiv I (fun y : M => inner ℝ (Y y) (Z y)) x (X x) + mvfderiv I (fun y : M => inner ℝ (X y) (Z y)) x (Y x) - mvfderiv I (fun y : M => inner ℝ (X y) (Y y)) x (Z x) - inner ℝ (X x) (mlieBracket I Y Z x) - inner ℝ (Y x) (mlieBracket I X Z x) + inner ℝ (Z x) (mlieBracket I X Y x) := E:Type u_1inst✝¹⁰:NormedAddCommGroup Einst✝⁹:NormedSpace ℝ Einst✝⁸:FiniteDimensional ℝ Einst✝⁷:CompleteSpace EH:Type u_2inst✝⁶:TopologicalSpace HI:ModelWithCorners ℝ E HM:Type u_3inst✝⁵:TopologicalSpace Minst✝⁴:ChartedSpace H Minst✝³:IsManifold I ∞ Minst✝²:RiemannianBundle fun x => TangentSpace I xinst✝¹:IsContMDiffRiemannianBundle I ∞ E fun x => TangentSpace I xcov:CovariantDerivative I E (TangentSpace I)inst✝:cov.ContMDiffCovariantDerivative ∞_htor:cov.torsion = 0_hmet:LeanEval.Geometry.KoszulFormula.IsMetricCompatible covX:(x : M) → TangentSpace I xY:(x : M) → TangentSpace I xZ:(x : M) → TangentSpace I x_hX:ContMDiff I I.tangent ∞ (T% X)_hY:ContMDiff I I.tangent ∞ (T% Y)_hZ:ContMDiff I I.tangent ∞ (T% Z)x:M⊢ 2 * Inner.inner ℝ ((↑cov Y x) (X x)) (Z x) = ((d% fun y => Inner.inner ℝ (Y y) (Z y)) x) (X x) + ((d% fun y => Inner.inner ℝ (X y) (Z y)) x) (Y x) - ((d% fun y => Inner.inner ℝ (X y) (Y y)) x) (Z x) - Inner.inner ℝ (X x) (mlieBracket I Y Z x) - Inner.inner ℝ (Y x) (mlieBracket I X Z x) + Inner.inner ℝ (Z x) (mlieBracket I X Y x) All goals completed! 🐙
#58
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Linear ODE with negative-real-part eigenvalues is asymptotically stable
linear_ode_asymptotic_stability

Verso theorem preview

theorem declaration uses `sorry`linear_ode_asymptotic_stability (n : ℕ) (A : Matrix (Fin n) (Fin n) ℝ) (hA : ∀ μ : ℂ, Module.End.HasEigenvalue (Matrix.toLin' (A.map (algebraMap ℝ ℂ))) μ → μ.re < 0) (x : ℝ → (Fin n → ℝ)) (hx : ∀ t : ℝ, 0 < t → HasDerivAt x (A.mulVec (x t)) t) : Filter.Tendsto (fun t : ℝ => ‖x t‖) Filter.atTop (nhds 0) := n:ℕA:Matrix (Fin n) (Fin n) ℝhA:∀ (μ : ℂ), Module.End.HasEigenvalue (Matrix.toLin' (A.map ⇑(algebraMap ℝ ℂ))) μ → μ.re < 0x:ℝ → Fin n → ℝhx:∀ (t : ℝ), 0 < t → HasDerivAt x (A *ᵥ x t) t⊢ Filter.Tendsto (fun t => ‖x t‖) Filter.atTop (nhds 0) All goals completed! 🐙
#59
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Bourbaki's locally convex extension of Banach–Alaoglu
banach_alaoglu_bourbaki

Verso theorem preview

theorem declaration uses `sorry`banach_alaoglu_bourbaki (E : Type*) [AddCommGroup E] [Module ℝ E] [TopologicalSpace E] [ContinuousAdd E] [ContinuousSMul ℝ E] [LocallyConvexSpace ℝ E] (U : Set E) (_hU : U ∈ 𝓝 (0 : E)) : IsCompact (LeanEval.Analysis.weakStarPolar E U) := E:Type u_1inst✝⁵:AddCommGroup Einst✝⁴:Module ℝ Einst✝³:TopologicalSpace Einst✝²:ContinuousAdd Einst✝¹:ContinuousSMul ℝ Einst✝:LocallyConvexSpace ℝ EU:Set E_hU:U ∈ 𝓝 0⊢ IsCompact (weakStarPolar E U) All goals completed! 🐙
#60
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Complementary polynomial on the unit circle
exists_complementary_polynomial_on_unit_circle

Verso theorem preview

theorem declaration uses `sorry`exists_complementary_polynomial_on_unit_circle (P : ℂ[X]) (hP : ∀ z : Circle, ‖P.eval (z : ℂ)‖ ≤ 1) : ∃ Q : ℂ[X], Q.natDegree ≤ P.natDegree ∧ ∀ z : Circle, ‖P.eval (z : ℂ)‖ ^ 2 + ‖Q.eval (z : ℂ)‖ ^ 2 = 1 := P:ℂ[X]hP:∀ (z : Circle), ‖eval (↑z) P‖ ≤ 1⊢ ∃ Q, Q.natDegree ≤ P.natDegree ∧ ∀ (z : Circle), ‖eval (↑z) P‖ ^ 2 + ‖eval (↑z) Q‖ ^ 2 = 1 All goals completed! 🐙
#61
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Perron-Frobenius for irreducible nonnegative matrices
irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius

Verso theorem preview

theorem declaration uses `sorry`irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius {n : Type*} [Fintype n] [DecidableEq n] [Nonempty n] (A : Matrix n n ℝ) (hA : A.IsIrreducible) : ∃ v : n → ℝ, Module.End.HasEigenvector (Matrix.toLin' A) (spectralRadius ℝ A).toReal v ∧ (∀ i, 0 < v i) := n:Type u_1inst✝²:Fintype ninst✝¹:DecidableEq ninst✝:Nonempty nA:Matrix n n ℝhA:A.IsIrreducible⊢ ∃ v, Module.End.HasEigenvector (Matrix.toLin' A) (spectralRadius ℝ A).toReal v ∧ ∀ (i : n), 0 < v i All goals completed! 🐙
#62
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Linear programming: maximum principle and vertex optimality
lp_maximum_principle

Verso theorem preview

/-- **Maximum principle for linear programming** (§101). A local maximiser of the LP objective on the feasible region is automatically a global maximiser; and whenever the objective is non-constant (`c ≠ 0`), the maximiser lies on the topological frontier of the feasible region. -/ theorem declaration uses `sorry`lp_maximum_principle {m n : ℕ} (lp : LinearProgram m n) (x : Fin m → ℝ) (_hx : x ∈ lp.feasible) (_hlocal : IsLocalMaxOn lp.objective lp.feasible x) : IsMaxOn lp.objective lp.feasible x ∧ (lp.c ≠ 0 → x ∈ frontier lp.feasible) := m:ℕn:ℕlp:LinearProgram m nx:Fin m → ℝ_hx:x ∈ lp.feasible_hlocal:IsLocalMaxOn lp.objective lp.feasible x⊢ IsMaxOn lp.objective lp.feasible x ∧ (lp.c ≠ 0 → x ∈ frontier lp.feasible) All goals completed! 🐙
/-- **Vertex optimality** (§101; the existence content of Dantzig's 1947 simplex algorithm). Every linear program with a nonempty bounded feasible region admits a global maximiser that is an extreme point (vertex) of the feasible region. -/ theorem declaration uses `sorry`simplex_algorithm {m n : ℕ} (lp : LinearProgram m n) (_hfeas : lp.feasible.Nonempty) (_hbdd : Bornology.IsBounded lp.feasible) : ∃ x ∈ lp.feasible, IsMaxOn lp.objective lp.feasible x ∧ x ∈ Set.extremePoints ℝ lp.feasible := m:ℕn:ℕlp:LinearProgram m n_hfeas:lp.feasible.Nonempty_hbdd:Bornology.IsBounded lp.feasible⊢ ∃ x ∈ lp.feasible, IsMaxOn lp.objective lp.feasible x ∧ x ∈ Set.extremePoints ℝ lp.feasible All goals completed! 🐙
#63
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Pell solutions are convergents of √d
pell_solution_convergent

Verso theorem preview

theorem declaration uses `sorry`pell_solution_is_convergent (d : ℤ) (_hd : Squarefree d) (_hd0 : 0 < d) (x y : ℤ) (_hx : 0 < x) (_hy : 0 < y) (_hsol : x ^ 2 - d * y ^ 2 = 1) : ∃ n : ℕ, (GenContFract.of (Real.sqrt (d : ℝ))).convs n = (x : ℝ) / (y : ℝ) := d:ℤ_hd:Squarefree d_hd0:0 < dx:ℤy:ℤ_hx:0 < x_hy:0 < y_hsol:x ^ 2 - d * y ^ 2 = 1⊢ ∃ n, (GenContFract.of √↑d).convs n = ↑x / ↑y All goals completed! 🐙
#64
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Rouche theorem via zero counting
rouche_zero_count_eq

Verso theorem preview

theorem declaration uses `sorry`rouche_zero_count_eq {f g : ℂ → ℂ} {R : ℝ} (hR : 0 < R) (hf : MeromorphicNFOn f Set.univ) (hg : AnalyticOn ℂ g Set.univ) (hbound : ∀ z : ℂ, ‖z‖ = R → ‖g z‖ < ‖f z‖) : (∑ᶠ z, ((divisor (f + g) (Metric.closedBall 0 R))⁺) z) = (∑ᶠ z, ((divisor f (Metric.closedBall 0 R))⁺) z) := f:ℂ → ℂg:ℂ → ℂR:ℝhR:0 < Rhf:MeromorphicNFOn f Set.univhg:AnalyticOn ℂ g Set.univhbound:∀ (z : ℂ), ‖z‖ = R → ‖g z‖ < ‖f z‖⊢ ∑ᶠ (z : ℂ), (divisor (f + g) (Metric.closedBall 0 R))⁺ z = ∑ᶠ (z : ℂ), (divisor f (Metric.closedBall 0 R))⁺ z All goals completed! 🐙
#65
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Symplectic matrices have determinant 1
symplectic_matrix_det

Verso theorem preview

theorem declaration uses `sorry`symplectic_matrix_det {l R : Type*} [DecidableEq l] [Fintype l] [CommRing R] {A : Matrix (l ⊕ l) (l ⊕ l) R} (_hA : A ∈ Matrix.symplecticGroup l R) : A.det = 1 := l:Type u_1R:Type u_2inst✝²:DecidableEq linst✝¹:Fintype linst✝:CommRing RA:Matrix (l ⊕ l) (l ⊕ l) R_hA:A ∈ symplecticGroup l R⊢ A.det = 1 All goals completed! 🐙
#66
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Gaussian heat kernel solves the 1D heat equation
heat_kernel_solves_heat_equation

Verso theorem preview

theorem declaration uses `sorry`heat_kernel_solves_heat_equation (f : ℝ → ℝ) (hf_cont : Continuous f) (hf_bdd : ∃ M : ℝ, ∀ x, |f x| ≤ M) : -- The PDE on (0, ∞) × ℝ. (∀ t : ℝ, 0 < t → ∀ x : ℝ, ∃ ux : ℝ → ℝ, ∃ uxx : ℝ, (∀ y : ℝ, HasDerivAt (fun z => heatSolution f t z) (ux y) y) ∧ HasDerivAt ux uxx x ∧ HasDerivAt (fun s => heatSolution f s x) uxx t) ∧ -- Initial condition recovered as a one-sided limit at t = 0. (∀ x : ℝ, Filter.Tendsto (fun t : ℝ => heatSolution f t x) (nhdsWithin (0 : ℝ) (Set.Ioi 0)) (nhds (f x))) := f:ℝ → ℝhf_cont:Continuous fhf_bdd:∃ M, ∀ (x : ℝ), |f x| ≤ M⊢ (∀ (t : ℝ), 0 < t → ∀ (x : ℝ), ∃ ux uxx, (∀ (y : ℝ), HasDerivAt (fun z => heatSolution f t z) (ux y) y) ∧ HasDerivAt ux uxx x ∧ HasDerivAt (fun s => heatSolution f s x) uxx t) ∧ ∀ (x : ℝ), Filter.Tendsto (fun t => heatSolution f t x) (nhdsWithin 0 (Set.Ioi 0)) (nhds (f x)) All goals completed! 🐙
#67
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Minkowski-Caratheodory theorem
mem_convexHull_finset_extremePoints_of_mem_compact_convex

Verso theorem preview

theorem declaration uses `sorry`mem_convexHull_finset_extremePoints_of_mem_compact_convex {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] {s : Set E} {x : E} (hscomp : IsCompact s) (hsconv : Convex ℝ s) (hx : x ∈ s) : ∃ t : Finset E, (↑t : Set E) ⊆ s.extremePoints ℝ ∧ t.card ≤ Module.finrank ℝ E + 1 ∧ x ∈ convexHull ℝ (↑t : Set E) := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:FiniteDimensional ℝ Es:Set Ex:Ehscomp:IsCompact shsconv:Convex ℝ shx:x ∈ s⊢ ∃ t, ↑t ⊆ extremePoints ℝ s ∧ t.card ≤ Module.finrank ℝ E + 1 ∧ x ∈ (convexHull ℝ) ↑t All goals completed! 🐙
#68
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Character values of finite groups lie in cyclotomic fields
brauer_character_in_cyclotomic

Verso theorem preview

theorem declaration uses `sorry`brauer_character_in_cyclotomic (G : Type) [Group G] [Fintype G] : ∃ φ : CyclotomicField (Monoid.exponent G) ℚ →+* ℂ, ∀ (V : Type) (_ : AddCommGroup V) (_ : Module ℂ V) (_ : FiniteDimensional ℂ V) (ρ : Representation ℂ G V) (g : G), LinearMap.trace ℂ V (ρ g) ∈ φ.range := G:Typeinst✝¹:Group Ginst✝:Fintype G⊢ ∃ φ, ∀ (V : Type) (x : AddCommGroup V) (x_1 : Module ℂ V), FiniteDimensional ℂ V → ∀ (ρ : Representation ℂ G V) (g : G), (LinearMap.trace ℂ V) (ρ g) ∈ φ.range All goals completed! 🐙
#69
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Oppenheim's inequality for Hadamard products
oppenheim_inequality

Verso theorem preview

theorem declaration uses `sorry`oppenheim_inequality {n : Type*} [Fintype n] [DecidableEq n] {A B : Matrix n n ℝ} (hA : A.PosSemidef) (hB : B.PosSemidef) : A.det * ∏ i, B i i ≤ (A ⊙ B).det := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℝB:Matrix n n ℝhA:A.PosSemidefhB:B.PosSemidef⊢ A.det * ∏ i, B i i ≤ (A ⊙ B).det All goals completed! 🐙
#70
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

pi_1 of the circle is Z
pi1_circle_mulEquiv_int

Verso theorem preview

theorem declaration uses `sorry`pi1_circle_mulEquiv_int : Nonempty (HomotopyGroup.Pi 1 Circle (1 : Circle) ≃* Multiplicative ℤ) := ⊢ Nonempty (HomotopyGroup.Pi 1 Circle 1 ≃* Multiplicative ℤ) All goals completed! 🐙
#71
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Dirichlet eigenvalues of -y'' = lambda y on [0,pi] are n^2
dirichlet_eigenvalues_eq_nat_sq

Verso theorem preview

theorem declaration uses `sorry`dirichlet_eigenvalues_eq_nat_sq (lam : ℝ) : (∃ (y : ℝ → ℝ) (J : Set ℝ), IsOpen J ∧ Set.Icc (0 : ℝ) Real.pi ⊆ J ∧ (∀ x ∈ J, HasDerivAt y (deriv y x) x) ∧ (∀ x ∈ J, HasDerivAt (deriv y) (-(lam * y x)) x) ∧ y 0 = 0 ∧ y Real.pi = 0 ∧ ∃ x ∈ Set.Ioo (0 : ℝ) Real.pi, y x ≠ 0) ↔ ∃ n : ℕ, 0 < n ∧ lam = (n : ℝ) ^ 2 := lam:ℝ⊢ (∃ y J, IsOpen J ∧ Set.Icc 0 π ⊆ J ∧ (∀ x ∈ J, HasDerivAt y (deriv y x) x) ∧ (∀ x ∈ J, HasDerivAt (deriv y) (-(lam * y x)) x) ∧ y 0 = 0 ∧ y π = 0 ∧ ∃ x ∈ Set.Ioo 0 π, y x ≠ 0) ↔ ∃ n, 0 < n ∧ lam = ↑n ^ 2 All goals completed! 🐙
#72
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Entrywise exponential of a PSD matrix is PSD
posSemidef_map_exp

Verso theorem preview

theorem declaration uses `sorry`posSemidef_map_exp {n : Type*} [Fintype n] [DecidableEq n] {A : Matrix n n ℝ} (hA : A.PosSemidef) : (A.map Real.exp).PosSemidef := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℝhA:A.PosSemidef⊢ (A.map Real.exp).PosSemidef All goals completed! 🐙
#73
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Sturm separation theorem
sturm_separation

Verso theorem preview

theorem declaration uses `sorry`sturm_separation (p q y₁ y₂ : ℝ → ℝ) (a b : ℝ) (hab : a < b) (J : Set ℝ) (hJ_open : IsOpen J) (hJ_conn : IsPreconnected J) (hJ_sub : Set.Icc a b ⊆ J) (hp : ContinuousOn p J) (hq : ContinuousOn q J) (hy₁ : ∀ x ∈ J, HasDerivAt y₁ (deriv y₁ x) x) (hy₁' : ∀ x ∈ J, HasDerivAt (deriv y₁) (-(p x * deriv y₁ x + q x * y₁ x)) x) (hy₂ : ∀ x ∈ J, HasDerivAt y₂ (deriv y₂ x) x) (hy₂' : ∀ x ∈ J, HasDerivAt (deriv y₂) (-(p x * deriv y₂ x + q x * y₂ x)) x) (hW : ∃ x₀ ∈ J, y₁ x₀ * deriv y₂ x₀ - y₂ x₀ * deriv y₁ x₀ ≠ 0) (hza : y₁ a = 0) (hzb : y₁ b = 0) (hne : ∀ x ∈ Set.Ioo a b, y₁ x ≠ 0) : ∃! c, c ∈ Set.Ioo a b ∧ y₂ c = 0 := p:ℝ → ℝq:ℝ → ℝy₁:ℝ → ℝy₂:ℝ → ℝa:ℝb:ℝhab:a < bJ:Set ℝhJ_open:IsOpen JhJ_conn:IsPreconnected JhJ_sub:Set.Icc a b ⊆ Jhp:ContinuousOn p Jhq:ContinuousOn q Jhy₁:∀ x ∈ J, HasDerivAt y₁ (deriv y₁ x) xhy₁':∀ x ∈ J, HasDerivAt (deriv y₁) (-(p x * deriv y₁ x + q x * y₁ x)) xhy₂:∀ x ∈ J, HasDerivAt y₂ (deriv y₂ x) xhy₂':∀ x ∈ J, HasDerivAt (deriv y₂) (-(p x * deriv y₂ x + q x * y₂ x)) xhW:∃ x₀ ∈ J, y₁ x₀ * deriv y₂ x₀ - y₂ x₀ * deriv y₁ x₀ ≠ 0hza:y₁ a = 0hzb:y₁ b = 0hne:∀ x ∈ Set.Ioo a b, y₁ x ≠ 0⊢ ∃! c, c ∈ Set.Ioo a b ∧ y₂ c = 0 All goals completed! 🐙
#74
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Polynomial decay rate of y' = -y^3
cubic_decay_asymptotic

Verso theorem preview

theorem declaration uses `sorry`cubic_decay_asymptotic (y : ℝ → ℝ) (hy_diff : ∀ t : ℝ, 0 < t → HasDerivAt y (-(y t) ^ 3) t) (hy_cont : ContinuousWithinAt y (Set.Ici 0) 0) (hy0 : y 0 = 1) : Tendsto (fun t : ℝ => y t * Real.sqrt t) atTop (𝓝 (1 / Real.sqrt 2)) := y:ℝ → ℝhy_diff:∀ (t : ℝ), 0 < t → HasDerivAt y (-y t ^ 3) thy_cont:ContinuousWithinAt y (Set.Ici 0) 0hy0:y 0 = 1⊢ Tendsto (fun t => y t * √t) atTop (𝓝 (1 / √2)) All goals completed! 🐙
#75
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Comparison principle for the Dirichlet BVP
bvp_comparison

Verso theorem preview

theorem declaration uses `sorry`bvp_comparison (J : Set ℝ) (hJ_open : IsOpen J) (hJ_sub : Set.Icc (0 : ℝ) 1 ⊆ J) (u v : ℝ → ℝ) (hu : ∀ x ∈ J, HasDerivAt u (deriv u x) x) (hu' : ∀ x ∈ J, HasDerivAt (deriv u) (deriv (deriv u) x) x) (hv : ∀ x ∈ J, HasDerivAt v (deriv v x) x) (hv' : ∀ x ∈ J, HasDerivAt (deriv v) (deriv (deriv v) x) x) (hineq : ∀ x ∈ Set.Ioo (0 : ℝ) 1, -deriv (deriv u) x ≤ -deriv (deriv v) x) (hu0 : u 0 ≤ v 0) (hu1 : u 1 ≤ v 1) : ∀ x ∈ Set.Icc (0 : ℝ) 1, u x ≤ v x := J:Set ℝhJ_open:IsOpen JhJ_sub:Set.Icc 0 1 ⊆ Ju:ℝ → ℝv:ℝ → ℝhu:∀ x ∈ J, HasDerivAt u (deriv u x) xhu':∀ x ∈ J, HasDerivAt (deriv u) (deriv (deriv u) x) xhv:∀ x ∈ J, HasDerivAt v (deriv v x) xhv':∀ x ∈ J, HasDerivAt (deriv v) (deriv (deriv v) x) xhineq:∀ x ∈ Set.Ioo 0 1, -deriv (deriv u) x ≤ -deriv (deriv v) xhu0:u 0 ≤ v 0hu1:u 1 ≤ v 1⊢ ∀ x ∈ Set.Icc 0 1, u x ≤ v x All goals completed! 🐙
#76
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Cayley graph connected iff generators generate the group
mulCayley_connected_iff_closure_eq_top

Verso theorem preview

theorem declaration uses `sorry`mulCayley_connected_iff_closure_eq_top {G : Type*} [Group G] (S : Set G) : (SimpleGraph.mulCayley S).Connected ↔ Subgroup.closure S = ⊤ := G:Type u_1inst✝:Group GS:Set G⊢ (SimpleGraph.mulCayley S).Connected ↔ Subgroup.closure S = ⊤ All goals completed! 🐙
#77
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Finite Ramsey theorem for graphs
finite_graph_ramsey_theorem

Verso theorem preview

theorem declaration uses `sorry`finite_graph_ramsey_theorem : ∀ r s : ℕ, 2 ≤ r → 2 ≤ s → ∃ n : ℕ, ∀ G : SimpleGraph (Fin n), ¬ G.CliqueFree r ∨ ¬ Gᶜ.CliqueFree s := ⊢ ∀ (r s : ℕ), 2 ≤ r → 2 ≤ s → ∃ n, ∀ (G : SimpleGraph (Fin n)), ¬G.CliqueFree r ∨ ¬Gᶜ.CliqueFree s All goals completed! 🐙
#78
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

Catalan generating function via compositional inversion
substInv_X_sub_X_sq_eq_catalan

Verso theorem preview

theorem declaration uses `sorry`substInv_X_sub_X_sq_eq_catalan (n : ℕ) : haveI : Invertible (coeff 1 ((X : ℚ⟦X⟧) - X ^ 2)) := n:ℕ⊢ Invertible ((coeff 1) (X - X ^ 2)) n:ℕ⊢ Invertible 1; All goals completed! 🐙 coeff (n + 1) (substInv ((X : ℚ⟦X⟧) - X ^ 2)) = (Nat.choose (2 * n) n : ℚ) / (↑n + 1) := n:ℕ⊢ (coeff (n + 1)) (X - X ^ 2).substInv = ↑((2 * n).choose n) / (↑n + 1) All goals completed! 🐙
#79
How produced

24-hour LeanEval speedrun; 79 independently verified problem(s): abel_ruffini, balanceable_bounded_partitions, banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, boone_higman_embedding, boone_higman_simple, brauer_character_in_cyclotomic, brauer_fowler, brouwer_fixed_point, bvp_comparison, choquet_representation_theorem, chudnovsky_formula_for_pi_inv, compact_group_semisimple, contractibleSpace_houseWithTwoRooms, cubic_decay_asymptotic, cyclotomic_integer_house_le_two, dirichlet_eigenvalues_eq_nat_sq, euler_lagrange_equation, exists_complementary_polynomial_on_unit_circle, fang_xia_tiling_partition_transitive, finite_graph_ramsey_theorem, fourier_dirichlet_fejer, fraser_kakeya_fourier_decay, frobenius_group_determinant, furstenberg_topological, glAction_range_eq_centralizer_symAction, halmos_generic_weak_mixing, hausdorff_absolute_continuity, hausdorff_hildebrandt_schoenberg, hausdorff_positivity_criterion, heat_kernel_solves_heat_equation, hippocrates_lunes, irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius, jordan_normal_form, kakutani_fixed_point, kirk_normal_structure, koszul_formula, landsberg_schaar, levi_civita_exists_unique, lindemann, lindemann_weierstrass, linear_ode_asymptotic_stability, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, monge_kantorovich, morley_theorem, mountain_pass, mulCayley_connected_iff_closure_eq_top, nash_equilibrium_exists, normal_spectral_theorem, nyquist_shannon_sampling, oppenheim_inequality, pascal, peano_existence, pell_solution_convergent, permute_to_unimodal, pi1_circle_mulEquiv_int, posSemidef_map_exp, radon_transform_inversion, regular_value_ae, rising_sun_lemma, rokhlin_lemma, rouche_zero_count_eq, runge_theorem, sard_theorem, schauder_fixed_point, shannon_capacity_pentagon, solvable_by_radicals_converse, sturm, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symAction_range_eq_centralizer_glAction, symplectic_matrix_det, trace_cayley_hamilton_newton, tverberg_theorem, vonNeumann_doubleCommutant_tfae, wiener_atom_detection, wiener_inverse_closed, wiener_levy_analytic_calculus. Timing, token, audit, and graph artifacts are recorded in [log/setup commit 146f3e62b25f](https://github.com/Vilin97/lean-eval-speedrun/tree/146f3e62b25f36f696de91caecb41835ed52765e).

First submissionAug 17, 2026
Last submissionAug 17, 2026
Vilin9779
10max gp (GPT-6)78 solved
Direct summand theorem and derived variant
direct_summand

Verso theorem preview

theorem declaration uses `sorry`derived_direct_summand [HasDerivedCategory (ModuleCat A)] (X : Scheme) (f : X ⟶ Spec (.of A)) [IsProper f] (surj : Function.Surjective f) [HasDerivedCategory (SheafOfModules X.ringCatSheaf)] : let φ : A →+* Γ(X, ⊤) := ((ΓSpec.adjunction.homEquiv _ _).symm f).unop.hom let : Algebra A Γ(X, ⊤) := φ.toAlgebra ∀ _ : EnoughInjectives (SheafOfModules X.ringCatSheaf), IsSplitMono <| (DerivedCategory.Plus.singleFunctor _ 0).map (ModuleCat.ofHom (Algebra.linearMap A Γ(X, ⊤))) ≫ (rightDerivedFunctorPlusUnit' (SheafOfModules.evaluation X.ringCatSheaf ⟨⊤⟩ ⋙ ModuleCat.restrictScalars φ) 0).app (SheafOfModules.unit X.ringCatSheaf) := A:Type u_1inst✝⁴:CommRing Ainst✝³:IsRegularRing Ainst✝²:HasDerivedCategory (ModuleCat A)X:Schemef:X ⟶ Spec ↧Ainst✝¹:IsProper fsurj:Function.Surjective ⇑finst✝:HasDerivedCategory (SheafOfModules X.ringCatSheaf)⊢ let φ := CommRingCat.Hom.hom ((ΓSpec.adjunction.homEquiv X (Opposite.op ↧A)).symm f).unop; let this := φ.toAlgebra; ∀ (x : EnoughInjectives (SheafOfModules X.ringCatSheaf)), IsSplitMono ((DerivedCategory.Plus.singleFunctor (ModuleCat A) 0).map (ModuleCat.ofHom (Algebra.linearMap A ↑Γ(X, ⊤))) ≫ (rightDerivedFunctorPlusUnit' (SheafOfModules.evaluation X.ringCatSheaf (Opposite.op ⊤) ⋙ ModuleCat.restrictScalars φ) 0).app (SheafOfModules.unit X.ringCatSheaf)) All goals completed! 🐙
theorem declaration uses `sorry`direct_summand (B : Type*) [CommRing B] [Algebra A B] [Module.Finite A B] [FaithfulSMul A B] : ∃ π : B →ₗ[A] A, π ∘ₗ Algebra.linearMap A B = .id := A:Type u_1inst✝⁵:CommRing Ainst✝⁴:IsRegularRing AB:Type u_2inst✝³:CommRing Binst✝²:Algebra A Binst✝¹:Module.Finite A Binst✝:FaithfulSMul A B⊢ ∃ π, π ∘ₗ Algebra.linearMap A B = LinearMap.id All goals completed! 🐙
#1
How produced

Credits: @ma4ypic4y and @haskiindahouse. The source README and PROVENANCE.json identify Claude Opus 5.5 and @haskiindahouse as the original campaign provenance. For this leaderboard entry, the owner declares a corrected model attribution: max gp (GPT-6), described as gpt 6.1 sol (gpt-6.1-sol). The historical runtime attribution has not been independently verified; the original provenance remains in the private source package. Completed official source-only verification against benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: lake test exit 0, Nanoda and Lean default kernel acceptance, no prohibited axioms. All 179 submitted Lean sources match the exact Git commit and the full verification receipt; protected files, dependency sources, pins and binaries remained unchanged. Receipt SHA256: b8524278406fd9f6a10e371901b6edccf37ef92b606c475c7c6f69bb75cf9048. The immutable Git archive, current evaluator discovery and overlay, and GitHub byte readback were checked. Hosted acceptance is not yet claimed. The proof imports pinned Mathlib and the official LeanEval dependencies; their authorship, licenses and notices remain with their original authors. No third-party source is vendored in the submitted package.

Wang-Zahl: the three-dimensional Kakeya conjecture
wang_zahl_kakeya_dimH

Verso theorem preview

theorem declaration uses `sorry`wang_zahl_kakeya_dimH {K : Set LeanEval.Analysis.WangZahlKakeya.Space} (hK : LeanEval.Analysis.WangZahlKakeya.IsKakeya K) : dimH K = 3 := K:Set SpacehK:IsKakeya K⊢ dimH K = 3 All goals completed! 🐙
#2
How produced

Contributor tags: @ma4ypic4y, @haskiindahouse. Submitter: ma4ypic4y. Problem: wang_zahl_kakeya_dimH (Wang–Zahl Kakeya dimension in R^3). Reuses existing public formalizations: project-numina/kakeya-3d at a26427e3c2fcaf9f98694fbd0d4dd49e41dcf5e3, including its unconditional bridge, and M32026/3d-sticky-kakeya at 42f739b484fd055e0aa29601c35677ad996f2ef2. Mathematical argument and major formalization are upstream work; original full-proof authorship is not claimed. Original attribution and individual notices are preserved in the private source snapshot, with exact per-file provenance. Contribution: GPT-6 import relocation, Lean 4.35 / Mathlib compatibility adaptation, an adapter to the exact benchmark hypothesis, and proof-term decomposition/auxiliary-lemma extraction for Nanoda. Harness: Codex multi-agent source-porting workflow with the unchanged pinned LeanEval comparator. Human selected the target/research direction, requested privacy and both contributor tags, and authorized this submission. This proof did not use the subsequent DeepSeek Flash campaign. Fresh source-only full local official verification passed both the Lean kernel and Nanoda against benchmark 0e093293afbe96be91504ae6e44947876d3fc84e, Lean v4.35.0-rc3 and Mathlib 5e0c4e5239cb0a2d86d68a884bf52cfd963fce22. All 5,566 submitted Lean files match the accepted receipt byte-for-byte. Exact Git archive discovery and overlay passed with protected workspace files unchanged. Local PASS is not a claim of server acceptance. Publication status: private, with no current publication plan. No public source release or Apache-2.0 relicensing of the combined closure is authorized by this submission. Numina is Apache-2.0; no repository-wide license grant covering the complete pinned sticky proof closure has been established. The private snapshot retains upstream licenses and notices with their proper scope. This uses the currently documented temporary GitHub issue intake. Only this Kakeya proof is being submitted; stopped proof/model campaigns remain stopped.

Finite-time singularity formation for C^{1,α} solutions to the incompressible Euler equations on ℝ³
annals_finite_time_singularity

Verso theorem preview

theorem declaration uses `sorry`theorem_1 : ∃ α > 0, ∃ u₀, div u₀ = 0 ∧ FiniteTimeSingularity.IsOdd u₀ ∧ IsContDiffHolder ℝ α u₀ ∧ (∃ C > 0, ∀ x, ‖(∇×u₀) x‖ ≤ C / (‖x‖ ^ (α : ℝ) + 1)) ∧ ∃ p, ∃ u, (∀ t ∈ Ico 0 1, FiniteTimeSingularity.IsOdd (u · t)) ∧ FiniteTimeSingularity.IsLocalEulerEquationSolution p u₀ 1 u ∧ (∀ T ∈ Ioo 0 1, IsContDiffHolderOn ℝ α u.uncurry (univ ×ˢ Icc 0 T)) ∧ Tendsto (fun t ↦ ∫ s in 0..t, ⨆ x, ‖(∇×(u · s)) x‖) (𝓝[<] 1) atTop := ⊢ ∃ α > 0, ∃ u₀, div u₀ = 0 ∧ IsOdd u₀ ∧ IsContDiffHolder ℝ α u₀ ∧ (∃ C > 0, ∀ (x : ℝ³), ‖(∇×u₀) x‖ ≤ C / (‖x‖ ^ ↑α + 1)) ∧ ∃ p u, (∀ t ∈ Ico 0 1, IsOdd fun x => u x t) ∧ IsLocalEulerEquationSolution p u₀ 1 u ∧ (∀ T ∈ Ioo 0 1, IsContDiffHolderOn ℝ α (Function.uncurry u) (univ ×ˢ Icc 0 T)) ∧ Tendsto (fun t => ∫ (s : ℝ) in 0..t, ⨆ x, ‖(∇×fun x => u x s) x‖) (𝓝[<] 1) atTop All goals completed! 🐙
#3
How produced

Credits: @ma4ypic4y and @haskiindahouse. The source README and PROVENANCE.json retain the original Claude Opus 5.5 campaign provenance. For this leaderboard entry, the owner declares a corrected model attribution: max gp (GPT-6), described as gpt 6.1 sol (gpt-6.1-sol). This is an owner-declared correction, not an independently verified historical runtime attribution. The proof was produced in an unattended campaign. Its provenance reports using public metadata of other submissions as hints, without using rival source code; it declares no third-party proof reuse. The pinned Mathlib and Lean Pool dependencies retain their authorship and licenses, and the benchmark Apache 2.0 license is included in the private package. The package VERIFICATION.json records an earlier benchmark pass. A separate full official source-only verification of the exact 154 submitted Lean files completed against the current benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: lake test exit 0, Nanoda and Lean default kernel acceptance, no prohibited axioms. The current receipt SHA256 is caa99810bc0a0af24a1916bd7a9bd8ab9900219dab66f321cac46c57af6300ba. All source hashes match the immutable Git commit and current receipt; protected files, dependency sources, pins and binaries remained unchanged. The Git archive, current evaluator discovery and overlay, and GitHub byte readback were checked. Hosted acceptance is not yet claimed.

Mandelbar (tricorn) is not path-connected (Hubbard–Schleicher)
mandelbar_not_path_connected

Verso theorem preview

theorem declaration uses `sorry`mandelbar_not_path_connected : ¬ IsPathConnected LeanEval.ComplexAnalysis.Mandelbar := ⊢ ¬IsPathConnected Mandelbar All goals completed! 🐙
#4
How produced

Credits: @ma4ypic4y, @haskiindahouse. Owner-declared authorship: @ma4ypic4y. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original model attribution retained in source documentation; historical runtime attribution has not been independently verified. Completed official source-only verification against benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: lake test exit 0, Nanoda and Lean default kernel acceptance, no prohibited axioms. All 783 submitted Lean sources match this exact commit; protected files, pins, binaries and dependency sources remained unchanged. Receipt SHA256: 269daab9aace05c943d642fc1db1806389336cd0e47466ddbee16d7165977dcb. Exact Git archive discovery/overlay preflight and remote byte readback passed. Hosted acceptance is not yet claimed. Permitted dependencies retain original licenses, authorship and notices.

Differentiable sphere theorem (Brendle–Schoen)
sphere_theorem_differentiable

Verso theorem preview

theorem declaration uses `sorry`differentiable_sphere_theorem [I.Boundaryless] [T2Space M] [CompactSpace M] [SimplyConnectedSpace M] (hdim : 2 ≤ Module.finrank ℝ E) (cov : CovariantDerivative I E (TangentSpace I (M := M))) [ContMDiffCovariantDerivative cov ∞] (_htor : cov.torsion = 0) (_hmet : LeanEval.Geometry.SphereTheorem.IsMetricCompatible cov) (_hpinch : LeanEval.Geometry.SphereTheorem.QuarterPinched cov) : Nonempty (M ≃ₘ⟮I, 𝓡 (Module.finrank ℝ E)⟯ (sphere (0 : EuclideanSpace ℝ (Fin (Module.finrank ℝ E + 1))) 1)) := E:Type u_1inst✝¹⁴:NormedAddCommGroup Einst✝¹³:NormedSpace ℝ Einst✝¹²:FiniteDimensional ℝ Einst✝¹¹:CompleteSpace EH:Type u_2inst✝¹⁰:TopologicalSpace HI:ModelWithCorners ℝ E HM:Type u_3inst✝⁹:TopologicalSpace Minst✝⁸:ChartedSpace H Minst✝⁷:IsManifold I ∞ Minst✝⁶:RiemannianBundle fun x => TangentSpace I xinst✝⁵:IsContMDiffRiemannianBundle I ∞ E fun x => TangentSpace I xinst✝⁴:I.Boundarylessinst✝³:T2Space Minst✝²:CompactSpace Minst✝¹:SimplyConnectedSpace Mhdim:2 ≤ Module.finrank ℝ Ecov:CovariantDerivative I E (TangentSpace I)inst✝:cov.ContMDiffCovariantDerivative ∞_htor:cov.torsion = 0_hmet:LeanEval.Geometry.SphereTheorem.IsMetricCompatible cov_hpinch:QuarterPinched cov⊢ Nonempty (M ≃ₘ⟮I, 𝓡 Module.finrank ℝ E⟯ ↑(sphere 0 1)) All goals completed! 🐙
#5
How produced

Credits: @ma4ypic4y, @haskiindahouse. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original Claude Opus 5.5 attribution retained in the source documentation; the historical runtime attribution has not been independently verified. Human direction included target selection and authorization of this private submission. Declared reuse: this package builds on qinz1yang/differential-geometry @ 777299070a5529e96345e0033979706fd00c7e62 (Apache-2.0), retaining 3,027 DG modules with original notices and documented adaptations. Its geometry, Ricci-flow and constant-curvature classification infrastructure remains credited to the original authors. The package also contains 133 BS modules, 30 Progress modules and the root/bridge helpers. Adaptations of DG proofs, including Hamilton's positive-Ricci classification, are documented in source headers; dependency proofs are not claimed as new work by this submission. Original source headers, LICENSE, Submission/DG/License.lean, provenance/LEAN-EVAL-LICENSE and historical provenance are preserved. This corrected package follows issue #1994 (16df01863bff77979e78d94c1dfb68d8ef3bdeb0), whose hosted evaluation exceeded the six-hour limit; the earlier large package #1993 failed during archive before evaluation. The new package has 3,192 Lean sources instead of 11,577, and its compressed source archive is approximately 10 MB. The dimension-three route now uses Hamilton's positive-Ricci theorem instead of the smooth Poincare/surgery route, maximal flow uses Zorn's lemma, unused declarations/modules were pruned, and a curvature lemma was rewritten to reduce kernel-checking cost. The current official benchmark statement, ChallengeDeps, oracle, comparator and tool pins were preserved. Local elapsed time does not guarantee the hosted runtime budget. Independent fresh source-only verification against unchanged official benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: completed lake test, exit 0, Nanoda and Lean default kernel acceptance. All 3,192 submitted Lean sources, protected files, pinned tools and 8,116 tracked Lean Pool files remained unchanged. Receipt SHA256: b68392452cfbe9f4d802a2fe8970d4cdd5043664662d77e53f32b60dfc490333. Exact Git archive discovery/overlay and remote byte readback passed. Hosted acceptance is not yet claimed. Private, with no current publication plan; no publication dates.

Gorenstein–Walter theorem (dihedral Sylow 2-subgroup)
gorenstein_walter

Verso theorem preview

theorem declaration uses `sorry`gorenstein_walter (G : Type) [Group G] [Finite G] [IsSimpleGroup G] (hnonab : ∃ a b : G, a * b ≠ b * a) (P : Sylow 2 G) (_hdih : ∃ n : ℕ, Nonempty ((P : Subgroup G) ≃* DihedralGroup n)) : Nonempty (G ≃* alternatingGroup (Fin 7)) ∨ ∃ p k : ℕ, ∃ _hp : Fact p.Prime, Odd p ∧ 5 ≤ p ^ k ∧ Nonempty (G ≃* PSL(2, GaloisField p k)) := G:Typeinst✝²:Group Ginst✝¹:Finite Ginst✝:IsSimpleGroup Ghnonab:∃ a b, a * b ≠ b * aP:Sylow 2 G_hdih:∃ n, Nonempty (↥↑P ≃* DihedralGroup n)⊢ Nonempty (G ≃* ↥(alternatingGroup (Fin 7))) ∨ ∃ p k, ∃ (_hp : Fact (Nat.Prime p)), Odd p ∧ 5 ≤ p ^ k ∧ Nonempty (G ≃* PSL(2, GaloisField p k)) All goals completed! 🐙
#6
How produced

Credits: @ma4ypic4y, @haskiindahouse. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original Claude Opus 5.5 attribution retained in the source documentation; the historical runtime attribution has not been independently verified. Human direction included target selection and authorization of this private submission. Declared reuse: this package vendors 1690 modules from Qiuzhen-CFSG/CFSG @ 96b2a02085dc678f3e0a97b334c31ada599c55fd (Apache-2.0), with module renames, provenance blocks and pinned Lean/Mathlib compatibility repairs, plus a bridge to the LeanEval statement in Submission/GWBridge.lean. Credit for the CFSG formalization remains with its original authors. Original full-proof authorship is not claimed. Source headers, LICENSE, Submission/CFSGSourceLicense.lean, provenance/LEAN-EVAL-LICENSE and original provenance are preserved. This is a corrected source snapshot following issue #1989 (baf6cf29fa5e4dfa2a9642a7f17fc60c2e3db8c9), whose hosted evaluation ended with a runner shutdown signal and exit 143. That log does not establish an OOM cause. Two expensive brute-force certificate proofs have been replaced with structured permutation proofs without changing their theorem statements; 71 other source files contain deprecated alias replacements. No comparator, ChallengeDeps, oracle or benchmark statement was weakened. Independent fresh source-only verification against unchanged official benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: completed lake test, exit 0, Nanoda and Lean default kernel acceptance. All 1,695 submitted Lean sources, protected files, pinned tools and 8,116 tracked Lean Pool files remained unchanged. Receipt SHA256: fb0c744ac4d3e9d8a27d6521a2724f3c6d4eccfa8dcb235506ab523ad0a33c66. Exact Git archive discovery/overlay and remote byte readback passed. Hosted acceptance is not yet claimed. Private, with no current publication plan; no publication dates.

Motivic invariants of birational maps
annals_motivic_invariants

Verso theorem preview

/-- Statement of Theorem 1.2 (1) (a): When `𝕜` is a number field, `Cr₃(𝕜)` is not generated by pseudo-regularizable elements. -/ theorem declaration uses `sorry`theorem_1_2_1_a [NumberField 𝕜] : ¬ GenByPseudoRegularizable 𝕜 3 := 𝕜:Typeinst✝¹:Field 𝕜inst✝:NumberField 𝕜⊢ ¬GenByPseudoRegularizable 𝕜 3 All goals completed! 🐙
/-- Statement of Theorem 1.2 (1) (b): When `𝕜` is a function field over a number field, `Cr₃(𝕜)` is not generated by pseudo-regularizable elements. Here by a function field, we mean a function field of a positive-dimensional `𝔽`-variety. -/ theorem declaration uses `sorry`theorem_1_2_1_b [NumberField 𝔽] (X : Scheme) [Variety 𝔽 X] (hX : 0 < topologicalKrullDim X) : ¬ GenByPseudoRegularizable X.functionField 3 := 𝔽:Typeinst✝²:Field 𝔽inst✝¹:NumberField 𝔽X:Schemeinst✝:Variety 𝔽 XhX:0 < topologicalKrullDim ↥X⊢ ¬GenByPseudoRegularizable (↑X.functionField) 3 All goals completed! 🐙
/-- Statement of Theorem 1.2 (1) (c): When `𝕜` is a function field over a finite field, `Cr₃(𝕜)` is not generated by pseudo-regularizable elements. Here by a function field, we mean a function field of a positive-dimensional `𝔽`-variety. -/ theorem declaration uses `sorry`theorem_1_2_1_c [Finite 𝔽] (X : Scheme) [Variety 𝔽 X] (hX : 0 < topologicalKrullDim X) : ¬ GenByPseudoRegularizable X.functionField 3 := 𝔽:Typeinst✝²:Field 𝔽inst✝¹:Finite 𝔽X:Schemeinst✝:Variety 𝔽 XhX:0 < topologicalKrullDim ↥X⊢ ¬GenByPseudoRegularizable (↑X.functionField) 3 All goals completed! 🐙
/-- Statement of Theorem 1.2 (1) (d): When `𝕜` is a function field over an algebraically closed field, `Cr₃(𝕜)` is not generated by pseudo-regularizable elements. Here by a function field, we mean a function field of a positive-dimensional `𝔽`-variety. -/ theorem declaration uses `sorry`theorem_1_2_1_d [IsAlgClosed 𝔽] (X : Scheme) [Variety 𝔽 X] (hX : 0 < topologicalKrullDim X) : ¬ GenByPseudoRegularizable X.functionField 3 := 𝔽:Typeinst✝²:Field 𝔽inst✝¹:IsAlgClosed 𝔽X:Schemeinst✝:Variety 𝔽 XhX:0 < topologicalKrullDim ↥X⊢ ¬GenByPseudoRegularizable (↑X.functionField) 3 All goals completed! 🐙
/-- Statement of Theorem 1.2 (2): For subfields `𝕜 ≤ ℂ` and `n ≥ 4`, `Crₙ(𝕜)` is not generated by pseudo-regularizable elements. -/ theorem declaration uses `sorry`theorem_1_2_2 {n : ℕ} (hn : 4 ≤ n) (𝕜 : Subfield ℂ) : ¬ GenByPseudoRegularizable 𝕜 n := n:ℕhn:4 ≤ n𝕜:Subfield ℂ⊢ ¬GenByPseudoRegularizable (↥𝕜) n All goals completed! 🐙
/-- Statement of Theorem 1.2 (3): For infinite fields `𝕜` and `n ≥ 5`, `Crₙ(𝕜)` is not generated by pseudo-regularizable elements. -/ theorem declaration uses `sorry`theorem_1_2_3 {n : ℕ} (hn : 5 ≤ n) [Infinite 𝕜] : ¬ GenByPseudoRegularizable 𝕜 n := 𝕜:Typeinst✝¹:Field 𝕜n:ℕhn:5 ≤ ninst✝:Infinite 𝕜⊢ ¬GenByPseudoRegularizable 𝕜 n All goals completed! 🐙
#7
How produced

Credits: @ma4ypic4y, @haskiindahouse. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original attribution retained in the source documentation. Human direction: target selection and private submission. All six required declarations passed fresh source-only official Lean and Nanoda verification locally. Builds on Lin–Shinder's Motivic invariants of birational maps and 167 vendored Tau Ceti modules (revisions 522706e83ca349c3d6bde045e56778d17354ae8d and 08199da22ef8b0ffe4204a3b0f3961ccdc3ed899, Apache-2.0). Original provenance, adaptations and notices are retained. Verified against benchmark 2e58dff1c3d3aa934614d46205e8f430f9a7ca7e, statement revision 1.

Shafarevich's theorem on solvable Galois groups
shafarevich_solvable_galois

Verso theorem preview

theorem declaration uses `sorry`shafarevich_solvable_galois (G : Type*) [Group G] [Finite G] [Group.IsSolvable G] : ∃ (K : Type) (_ : Field K) (_ : Algebra ℚ K) (_ : FiniteDimensional ℚ K) (_ : IsGalois ℚ K), Nonempty (G ≃* (K ≃ₐ[ℚ] K)) := G:Type u_1inst✝²:Group Ginst✝¹:Finite Ginst✝:Group.IsSolvable G⊢ ∃ K x x_1, ∃ (_ : FiniteDimensional ℚ K) (_ : IsGalois ℚ K), Nonempty (G ≃* Gal(K/ℚ)) All goals completed! 🐙
#8
How produced

Contributor tags: @ma4ypic4y, @haskiindahouse. Submitter: ma4ypic4y. Problem: shafarevich_solvable_galois (Shafarevich's theorem on solvable Galois groups), statement revision 1. This is distinct from the relation-rank bound. Reuses the public formalization Timeroot/InverseGaloisProblem at 973f72c1900fb72c460833448b472899fa659366. The mathematical argument and major formalization are upstream work; original full-proof authorship is not claimed. Original attribution and individual source notices are retained with per-file provenance in the private source snapshot. Contribution: reachable source extraction, import relocation, Lean 4.35 / pinned Mathlib compatibility migration, proved canonical-instance and API repairs, and an exact universe/equivalence adapter to the unchanged benchmark statement. The declared model/system name max gp (GPT-6) is our existing GPT-6-family system label; the final server-native migration used GPT-6.1 Sol (gpt-6.1-sol), xhigh reasoning. Earlier compatibility work used GPT-6 and DeepSeek-v4.1-flash. Harness: GenProof server-native Codex/MCP proof workflow on mike-gpu, followed by the unchanged official pinned verifier. Human selected targets and research direction, required private sources and both contributor tags, and authorized this submission. Fresh source-only full local official verification passed both the Lean kernel and Nanoda against benchmark 0e093293afbe96be91504ae6e44947876d3fc84e, Lean v4.35.0-rc3 and Mathlib 5e0c4e5239cb0a2d86d68a884bf52cfd963fce22. All 937 submitted Lean files match the accepted local receipt byte-for-byte. Exact Git archive discovery and overlay passed with protected workspace files unchanged. Local PASS is not a claim of server acceptance. Publication status: private, with no current publication plan and no publication date. No public source release or blanket relicensing of the combined closure is authorized by this submission. The snapshot retains upstream notices; 856 upstream files explicitly state Apache-2.0, while 79 have no explicit license header and the pinned upstream tree has no root LICENSE. No license is invented for those files. This uses the currently documented temporary GitHub issue intake. Only this Shafarevich solvable-Galois proof is submitted.

Baker-Wüstholz theorem on linear forms in logarithms
bakerWustholz_linearForms_logs

Verso theorem preview

theorem declaration uses `sorry`bakerWustholz_linearForms_logs {n : ℕ} (hn : 0 < n) {K : Type*} [Field K] [NumberField K] (φ : K →+* ℂ) (α : Fin n → K) (hα : ∀ i, α i ≠ 0) (b : Fin n → ℤ) {B : ℕ} (hB : 2 ≤ B) (hbB : ∀ i, (b i).natAbs ≤ B) (hΛ_ne_zero : (∑ i, (b i : ℂ) * Complex.log (φ (α i))) ≠ 0) : Real.log ‖∑ i, (b i : ℂ) * Complex.log (φ (α i))‖ ≥ -(BakerWustholz.C n (Module.finrank ℚ K) * max (Real.log B) (1 / (Module.finrank ℚ K : ℝ)) * ∏ i, BakerWustholz.modifiedHeight φ (α i)) := n:ℕhn:0 < nK:Type u_1inst✝¹:Field Kinst✝:NumberField Kφ:K →+* ℂα:Fin n → Khα:∀ (i : Fin n), α i ≠ 0b:Fin n → ℤB:ℕhB:2 ≤ BhbB:∀ (i : Fin n), (b i).natAbs ≤ BhΛ_ne_zero:∑ i, ↑(b i) * log (φ (α i)) ≠ 0⊢ Real.log ‖∑ i, ↑(b i) * log (φ (α i))‖ ≥ -(BakerWustholz.C n (Module.finrank ℚ K) * max (Real.log ↑B) (1 / ↑(Module.finrank ℚ K)) * ∏ i, BakerWustholz.modifiedHeight φ (α i)) All goals completed! 🐙
#9
How produced

Credits: @ma4ypic4y and @haskiindahouse. The source README and PROVENANCE.json retain the original Claude Opus 5.5 campaign provenance. For this leaderboard entry, the owner declares a corrected model attribution: max gp (GPT-6), described as gpt 6.1 sol (gpt-6.1-sol). This is an owner-declared correction, not an independently verified historical runtime attribution. The proof was produced in an unattended campaign. Its provenance reports using public metadata of other submissions as hints, without using rival source code; it declares no third-party proof reuse. The pinned Mathlib and Lean Pool dependencies retain their authorship and licenses, and the benchmark Apache 2.0 license is included in the private package. Completed official source-only verification against benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: lake test exit 0, Nanoda and Lean default kernel acceptance, no prohibited axioms. All 373 submitted Lean sources match the exact Git commit and full verification receipt; protected files, dependency sources, pins and binaries remained unchanged. Receipt SHA256: 36ae4b58ad091edaa93032376c3f9aea5c082f3e5564283d4044dbe008e23d59. The immutable Git archive, current evaluator discovery and overlay, and GitHub byte readback were checked. Hosted acceptance is not yet claimed.

Equichordal point theorem (convex curves have a unique equichordal point)
equichordal_point_unique

Verso theorem preview

theorem declaration uses `sorry`equichordal_point_unique {K : Set LeanEval.Geometry.Equichordal.Plane} (hK : IsCompact K) (hconv : Convex ℝ K) (hne : (interior K).Nonempty) : ¬ ∃ P Q : LeanEval.Geometry.Equichordal.Plane, P ≠ Q ∧ LeanEval.Geometry.Equichordal.IsEquichordalPoint K P ∧ LeanEval.Geometry.Equichordal.IsEquichordalPoint K Q := K:Set PlanehK:IsCompact Khconv:Convex ℝ Khne:(interior K).Nonempty⊢ ¬∃ P Q, P ≠ Q ∧ IsEquichordalPoint K P ∧ IsEquichordalPoint K Q All goals completed! 🐙
#10
How produced

Credits: @ma4ypic4y and @haskiindahouse. The source README and PROVENANCE.json identify Claude Opus 5.5 as the original campaign provenance. For this leaderboard entry, the owner declares a corrected model attribution: max gp (GPT-6), described as gpt 6.1 sol (gpt-6.1-sol). The historical runtime attribution has not been independently verified; the original provenance remains in the private source package. Completed official source-only verification against benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: lake test exit 0, Nanoda and Lean default kernel acceptance, no prohibited axioms. All 128 submitted Lean sources match the exact Git commit and full verification receipt; protected files, dependency sources, pins and binaries remained unchanged. Receipt SHA256: 9250170ca0c1315cdf0a7cd9627a8f7627a4d4fc8a7087e85e9538e3a3d572d3. The immutable Git archive, current evaluator discovery and overlay, and GitHub byte readback were checked. Hosted acceptance is not yet claimed. The source provenance declares no third-party proof reuse. Pinned Mathlib and Lean Pool dependencies retain their authorship and licenses; the benchmark license is included in the private package.

Existence of an aspherical integer homology 4-sphere
aspherical_integer_homology_four_sphere

Lean theorem statement

/-- **Existence of an aspherical integer homology 4-sphere** (Tschantz, answering
`[Kir97, Problem 4.17]`). There is a closed topological 4-manifold that is both
aspherical and an integer homology 4-sphere. -/
theorem aspherical_integer_homology_four_sphere :
    ∃ M : Closed4Manifold, M.IsAspherical ∧ M.IsIntegerHomologySphere := by
  sorry
#11
How produced

Credits: @ma4ypic4y, @haskiindahouse. Owner-declared authorship: @ma4ypic4y. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original model attribution retained in source documentation; historical runtime attribution has not been independently verified. Completed official source-only verification against benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: lake test exit 0, Nanoda and Lean default kernel acceptance, no prohibited axioms. All 358 submitted Lean sources match this exact commit; protected files, pins, binaries and dependency sources remained unchanged. Receipt SHA256: 0e00e0f113f346f32a4fe13187bcca94241c61eb4d282773199bb962bc97d597. Exact Git archive discovery/overlay preflight and remote byte readback passed. Hosted acceptance is not yet claimed. Permitted dependencies retain original licenses, authorship and notices. Dependency reuse: 107 TauCeti modules from TauCetiProject/TauCeti @522706e83ca349c3d6bde045e56778d17354ae8d match the original files after import-prefix renaming; original Tau Ceti and Lean FRO authorship and Apache-2.0 notices are retained.

On the coherence of one-relator groups and their group algebras
annals_on_coherence_of_one_relator_groups

Lean theorem statement

/--
Statement of Theorem 1.1:

Let `G` be a one-relator group and `K` be a field of characteristic zero.
Then `G` is a coherent group and the group algebra `K[G]` is a coherent ring.
-/
theorem theorem_1_1 (G K : Type*) [Group G] [Field K] [CharZero K] (hG : Group.OneRelator G) :
    Group.Coherent G ∧ Ring.Coherent (MonoidAlgebra K G) := by
  sorry
#12
How produced

Credits: @ma4ypic4y, @haskiindahouse. Owner-declared authorship: @ma4ypic4y. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original model attribution retained in source documentation; historical runtime attribution has not been independently verified. Completed official source-only verification against benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: lake test exit 0, Nanoda and Lean default kernel acceptance, no prohibited axioms. All 364 submitted Lean sources match this exact commit; protected files, pins, binaries and dependency sources remained unchanged. Receipt SHA256: c0962d338aa6376b00fab12e928a028fa100498043b67fff1d99a025d7059634. Exact Git archive discovery/overlay preflight and remote byte readback passed. Hosted acceptance is not yet claimed. Permitted dependencies retain original licenses, authorship and notices. Dependency attribution: NatAdd adapts the natural-ordinal addition definition and lemmas from vihdzp/combinatorial-games, CombinatorialGames/NatOrdinal/Basic.lean (reviewed immutable revision 21ece514a976880dd215f95bfee5e40ccc57b867). The adaptation uses Ordinal directly and its current iSup API; Apache-2.0 and Violeta Hernández Palacios attribution are retained. The reviewed donor revision does not independently establish the historical fetched revision.

Adams: S^n is an H-space iff n = 0, 1, 3, 7
hSpace_sphere_iff

Lean theorem statement

/-- **Adams' Hopf-invariant-one theorem** (H-space form). The sphere `𝕊ⁿ`
admits an H-space structure if and only if `n = 0`, `1`, `3`, or `7`. -/
theorem hSpace_sphere_iff (n : ℕ) :
    Nonempty (HSpace (Metric.sphere (0 : EuclideanSpace ℝ (Fin (n + 1))) 1)) ↔
      n = 0 ∨ n = 1 ∨ n = 3 ∨ n = 7 := by
  sorry
#13
How produced

Credits: @ma4ypic4y, @haskiindahouse. Owner-declared authorship: @ma4ypic4y. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original model attribution retained in source documentation; historical runtime attribution has not been independently verified. Completed official source-only verification against benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: lake test exit 0, Nanoda and Lean default kernel acceptance, no prohibited axioms. All 82 submitted Lean sources match this exact commit; protected files, pins, binaries and dependency sources remained unchanged. Receipt SHA256: 5fa556bfdea10b805c6dc3a8cdc72f80e3b4d0c72688e7c401204910fd651dcf. Exact Git archive discovery/overlay preflight and remote byte readback passed. Hosted acceptance is not yet claimed. Permitted dependencies retain original licenses, authorship and notices.

Bourgain's polynomial ergodic theorem
bourgain_polynomial_ergodic

Lean theorem statement

/-- Bourgain's polynomial ergodic theorem: for every integer-polynomial
iterate sequence and every `L^p`, `p > 1`, function, the polynomial ergodic
averages converge pointwise almost everywhere. -/
theorem bourgain_polynomial_ergodic
    [IsProbabilityMeasure μ] {p : ℝ≥0∞} (hp : 1 < p) (hp_ne_top : p ≠ ∞)
    {T : X → X} (hT : MeasurePreserving T μ μ)
    {a : ℕ → ℕ} (ha : IsIntegerPolynomialSequence a)
    {f : X → ℝ} (hf : MemLp f p μ) :
    ∃ F : X → ℝ,
      ∀ᵐ x ∂μ,
        Tendsto (fun n : ℕ => polynomialErgodicAverage a T f (n + 1) x) atTop (𝓝 (F x)) := by
  sorry
#14
How produced

Credits: @ma4ypic4y, @haskiindahouse. Owner-declared authorship: @ma4ypic4y. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original model attribution retained in source documentation; historical runtime attribution has not been independently verified. Completed official source-only verification against benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: lake test exit 0, Nanoda and Lean default kernel acceptance, no prohibited axioms. All 216 submitted Lean sources match this exact commit; protected files, pins, binaries and dependency sources remained unchanged. Receipt SHA256: 57f8eb2e8c7591f1e7fa1dd82db476b6b48ee679728305ab0a7eab19124ea33a. Exact Git archive discovery/overlay preflight and remote byte readback passed. Hosted acceptance is not yet claimed. Permitted dependencies retain original licenses, authorship and notices.

Topological sphere theorem (Berger–Klingenberg–Rauch)
sphere_theorem_topological

Lean theorem statement

/-- **Topological sphere theorem** (Berger–Klingenberg–Rauch 1960). A closed,
simply-connected, smooth `d`-manifold (`d ≥ 2`) whose Levi-Civita connection is
strictly quarter-pinched is homeomorphic to the standard `d`-sphere. -/
theorem sphere_theorem
    [I.Boundaryless] [T2Space M] [CompactSpace M] [SimplyConnectedSpace M]
    (hdim : 2 ≤ Module.finrank ℝ E)
    (cov : CovariantDerivative I E (TangentSpace I (M := M)))
    [ContMDiffCovariantDerivative cov ∞]
    (_htor : cov.torsion = 0) (_hmet : IsMetricCompatible cov)
    (_hpinch : QuarterPinched cov) :
    Nonempty
      (M ≃ₜ sphere (0 : EuclideanSpace ℝ (Fin (Module.finrank ℝ E + 1))) 1) := by
  sorry
#15
How produced

Credits: @ma4ypic4y, @haskiindahouse. Owner-declared authorship: @ma4ypic4y. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original model attribution retained in source documentation; historical runtime attribution has not been independently verified. Completed official source-only verification against benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: lake test exit 0, Nanoda and Lean default kernel acceptance, no prohibited axioms. All 819 submitted Lean sources match this exact commit; protected files, pins, binaries and dependency sources remained unchanged. Receipt SHA256: b5f13273638e288b4061f53f8d3197441f57b08728bad93ed8575ee33d9acdbc. Exact Git archive discovery/overlay preflight and remote byte readback passed. Hosted acceptance is not yet claimed. Permitted dependencies retain original licenses, authorship and notices. Explicitly authorized retry of #1975 after a terminal infrastructure failure; the previous workflow is completed and no accepted result exists for this submission. Recent successful benchmark/tool setup supports retrying; hosted success is not guaranteed. 752 vendored DifferentialGeometry modules from qinz1yang/differential-geometry at 777299070a5529e96345e0033979706fd00c7e62 supply geometry infrastructure; Apache-2.0, original headers and notices are retained. The 65 sphere proof modules under Submission/Progress are campaign code. Previous #1975 passed evaluation but its record step was cancelled.

Mostow rigidity
mostow_rigidity

Lean theorem statement

theorem mostow_rigidity (n : ℕ) (hn : 3 ≤ n) (Γ Λ : Subgroup (PO n 1))
    (disc_Γ : IsDiscrete (SetLike.coe Γ)) (disc_Λ : IsDiscrete (SetLike.coe Λ))
    [HasFundamentalDomain Γ (PO n 1)] [HasFundamentalDomain Λ (PO n 1)]
    (covol_Γ : covolume Γ (PO n 1) ≠ ⊤) (covol_Λ : covolume Λ (PO n 1) ≠ ⊤)
    (f : Γ ≃* Λ) : ∃ g : PO n 1, ∀ γ : Γ, f γ = g * γ * g⁻¹ := by
  sorry
#16
How produced

Credits: @ma4ypic4y, @haskiindahouse. Owner-declared authorship: @ma4ypic4y. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original model attribution retained in source documentation; historical runtime attribution has not been independently verified. Completed official source-only verification against benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: lake test exit 0, Nanoda and Lean default kernel acceptance, no prohibited axioms. All 163 submitted Lean sources match this exact commit; protected files, pins, binaries and dependency sources remained unchanged. Receipt SHA256: ccb77e971f026970a5a727f39c4643541f1c92a0888fff3699ac6a117981400a. Exact Git archive discovery/overlay preflight and remote byte readback passed. Hosted acceptance is not yet claimed. Permitted dependencies retain original licenses, authorship and notices.

Newlander–Nirenberg theorem
newlander_nirenberg

Lean theorem statement

/-- **The Newlander–Nirenberg theorem.** An almost complex structure with
vanishing Nijenhuis tensor is integrable. Formally: for every `x` in an open
set `U ⊆ ℝ^{2n}` carrying such a structure `J` there is a smooth local
diffeomorphism `φ` (an `OpenPartialHomeomorph`, smooth in both directions)
from a neighbourhood of `x` inside `U` onto an open subset of `ℂⁿ` whose
differential is complex linear:

  `dφ_y (J y v) = i · dφ_y v`.

Such charts are holomorphic coordinates for `J`. -/
theorem newlander_nirenberg {n : ℕ} {U : Set (E n)} (_hU : IsOpen U)
    (J : E n → E n →L[ℝ] E n) (_hJ : IsAlmostComplexOn J U)
    (_hN : NijenhuisVanishesOn J U) {x : E n} (_hx : x ∈ U) :
    ∃ φ : OpenPartialHomeomorph (E n) (EuclideanSpace ℂ (Fin n)),
      x ∈ φ.source ∧ φ.source ⊆ U ∧
      ContDiffOn ℝ ∞ (φ : E n → EuclideanSpace ℂ (Fin n)) φ.source ∧
      ContDiffOn ℝ ∞ (φ.symm : EuclideanSpace ℂ (Fin n) → E n) φ.target ∧
      ∀ y ∈ φ.source, ∀ v : E n,
        fderiv ℝ (φ : E n → EuclideanSpace ℂ (Fin n)) y (J y v)
          = Complex.I • fderiv ℝ (φ : E n → EuclideanSpace ℂ (Fin n)) y v := by
  sorry
#17
How produced

Credits: @ma4ypic4y, @haskiindahouse. Owner-declared authorship: @ma4ypic4y. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original model attribution retained in source documentation; historical runtime attribution has not been independently verified. Completed official source-only verification against benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: lake test exit 0, Nanoda and Lean default kernel acceptance, no prohibited axioms. All 77 submitted Lean sources match this exact commit; protected files, pins, binaries and dependency sources remained unchanged. Receipt SHA256: 877f73d73bb2f46656226fcca5c2516340d81667a456d6fda80844f83aaec3fa. Exact Git archive discovery/overlay preflight and remote byte readback passed. Hosted acceptance is not yet claimed. Permitted dependencies retain original licenses, authorship and notices. Explicitly authorized retry of #2067 after a terminal infrastructure failure; the previous workflow is completed and no accepted result exists for this submission. Recent successful benchmark/tool setup supports retrying; hosted success is not guaranteed.

Pardon's lower bound for torus-knot distortion
pardon_torus_knot_distortion

Lean theorem statement

/-- **Pardon's torus-knot distortion bound (smooth specialization).**

If `p` and `q` are positive and coprime, every smooth knot in the
orientation-preserving smooth ambient-isotopy class of the explicit standard
`(p, q)`-torus curve has distortion at least `min(p, q) / 160`. -/
theorem pardon_torus_knot_distortion
    (p q : ℕ) (_hp : 0 < p) (_hq : 0 < q) (_hc : Nat.Coprime p q)
    (K : Knot)
    (_hclass : ∃ Φ : AmbientIsotopy, ∃ σ : CircleReparam,
      ∀ t, Φ.H 1 (K.curve t) = standardTorusCurve p q (σ.f t)) :
    (1 / 160 : ℝ≥0∞) * (Nat.min p q : ℝ≥0∞) ≤ distortion K := by
  sorry
#18
How produced

Credits: @ma4ypic4y, @haskiindahouse. Owner-declared authorship: @ma4ypic4y. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original model attribution retained in source documentation; historical runtime attribution has not been independently verified. Completed official source-only verification against benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: lake test exit 0, Nanoda and Lean default kernel acceptance, no prohibited axioms. All 208 submitted Lean sources match this exact commit; protected files, pins, binaries and dependency sources remained unchanged. Receipt SHA256: 959378fd93a51d06621b0d96d47879e43f4fa30027b1f93ccd16abd663b53e38. Exact Git archive discovery/overlay preflight and remote byte readback passed. Hosted acceptance is not yet claimed. Permitted dependencies retain original licenses, authorship and notices. Explicitly authorized retry of #2057 after a terminal infrastructure failure; the previous workflow is completed and no accepted result exists for this submission. Recent successful benchmark/tool setup supports retrying; hosted success is not guaranteed.

Avila-Jitomirskaya Ten Martini Problem
ten_martini_problem

Lean theorem statement

/-- **Avila-Jitomirskaya Ten Martini theorem.** For irrational frequency
and nonzero coupling, the spectrum of the almost Mathieu operator is a
Cantor set. Here this means nonempty, compact, perfect, and totally
disconnected. -/
theorem ten_martini_problem (α coupling θ : ℝ)
    (hα : Irrational α) (hcoupling : coupling ≠ 0) :
    ∃ H : EllTwo →L[ℂ] EllTwo,
      IsAlmostMathieuOperator α coupling θ H ∧
        (spectrum ℂ H).Nonempty ∧
        IsCompact (spectrum ℂ H) ∧
        Perfect (spectrum ℂ H) ∧
        IsTotallyDisconnected (spectrum ℂ H) := by
  sorry
#19
How produced

Credits: @ma4ypic4y, @haskiindahouse. Owner-declared authorship: @ma4ypic4y. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original model attribution retained in source documentation; historical runtime attribution has not been independently verified. Completed official source-only verification against benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: lake test exit 0, Nanoda and Lean default kernel acceptance, no prohibited axioms. All 92 submitted Lean sources match this exact commit; protected files, pins, binaries and dependency sources remained unchanged. Receipt SHA256: 79f75cd9aac1c32e3a7d33a8a96a4b9497a08704f6fe385dbafd2ca57c5e6ea1. Exact Git archive discovery/overlay preflight and remote byte readback passed. Hosted acceptance is not yet claimed. Permitted dependencies retain original licenses, authorship and notices.

230 space groups (Fedorov 1891 / Schoenflies 1891)
space_groups_230

Lean theorem statement

/-- **230 space groups** (Fedorov 1891; Schoenflies 1891). In
dimension 3 there are 230 space groups (orientation-preserving
equivalence), 219 (general affine equivalence), and 65 orientation-
preserving subfamily. -/
theorem space_groups :
    crystallographicCountOP 3 = 230 ∧
      crystallographicCount 3 = 219 ∧
        crystallographicCountOPOnly 3 = 65 := by
  sorry
#20
How produced

Credits: @ma4ypic4y, @haskiindahouse. Owner-declared authorship: @ma4ypic4y. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original model attribution retained in source documentation; historical runtime attribution has not been independently verified. Completed official source-only verification against benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: lake test exit 0, Nanoda and Lean default kernel acceptance, no prohibited axioms. All 107 submitted Lean sources match this exact commit; protected files, pins, binaries and dependency sources remained unchanged. Receipt SHA256: 3b081865db8f1a38952a2d3b32c41e93d463505740af426dcdc52371712524fa. Exact Git archive discovery/overlay preflight and remote byte readback passed. Hosted acceptance is not yet claimed. Permitted dependencies retain original licenses, authorship and notices.

Jacobian of a smooth proper curve (Merten challenge)
jacobian_challenge_alggeo

Lean theorem statement

/-- The genus of a smooth proper curve. -/
def genus (C : Over (Spec (.of k))) [IsProper C.hom] [SmoothOfRelativeDimension 1 C.hom]
    [GeometricallyIrreducible C.hom] : ℕ :=
  sorry

/-- The Jacobian of a smooth, proper curve over a field `k`. -/
def Jacobian (C : Over (Spec (.of k))) [IsProper C.hom] [SmoothOfRelativeDimension 1 C.hom]
    [GeometricallyIrreducible C.hom] : Over (Spec (.of k)) :=
  sorry

/-- The group scheme structure on the Jacobian of the curve `C`. -/
instance instGrpObj : GrpObj (Jacobian C) :=
  sorry

/-- The Jacobian of `C` is smooth of relative dimension `g` over `k`, where `g` is the
genus of `C`. -/
instance smoothOfRelativeDimension_genus :
    SmoothOfRelativeDimension (genus C) (Jacobian C).hom :=
  sorry

/-- The Jacobian of `C` is proper over `k`. -/
instance instIsProper : IsProper (Jacobian C).hom :=
  sorry

/-- The Jacobian of `C` is geometrically irreducible over `k`. -/
instance instGeometricallyIrreducible : GeometricallyIrreducible (Jacobian C).hom :=
  sorry

/-- The Abel-Jacobi map from a smooth, proper curve to its Jacobian associated
to a `k`-rational point of `C`. -/
def ofCurve (P : 𝟙_ (Over (Spec (.of k))) ⟶ C) : C ⟶ Jacobian C :=
  sorry

/-- The Abel-Jacobi map sends the `k`-rational point `P` to `0`, where `0` (denoted by `η` below) is
the neutral element of the group scheme `Jacobian C`. -/
theorem comp_ofCurve (C : Over (Spec (.of k))) [IsProper C.hom]
    [SmoothOfRelativeDimension 1 C.hom] [GeometricallyIrreducible C.hom]
    (P : 𝟙_ (Over (Spec (.of k))) ⟶ C) :
    P ≫ ofCurve P = η[Jacobian C] :=
  sorry

/--
The universal property of the Jacobian variety: For any abelian variety `A`,
any morphism `f : C ⟶ A` such that `f(P) = 0` factors uniquely through the
Jacobian of `C`.
In other words, `Jacobian C` is the Albanese variety of `C`.
-/
theorem exists_unique_ofCurve_comp (C : Over (Spec (.of k))) [IsProper C.hom]
    [SmoothOfRelativeDimension 1 C.hom] [GeometricallyIrreducible C.hom]
    (P : 𝟙_ (Over (Spec (.of k))) ⟶ C)
    {A : Over (Spec (.of k))} [Smooth A.hom] [IsProper A.hom] [GrpObj A]
    [GeometricallyIrreducible A.hom] (f : C ⟶ A) (hf : P ≫ f = η[A]) :
    ∃! (g : Jacobian C ⟶ A), f = ofCurve P ≫ g :=
  sorry
#21
How produced

Credits: @ma4ypic4y, @haskiindahouse. Owner-declared authorship: @ma4ypic4y. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original model attribution retained in source documentation; historical runtime attribution has not been independently verified. Completed official source-only verification against benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: lake test exit 0, Nanoda and Lean default kernel acceptance, no prohibited axioms. All 129 submitted Lean sources match this exact commit; protected files, pins, binaries and dependency sources remained unchanged. Receipt SHA256: 65e38d713c066b0056d08513a7c0e2f0964b0b8e6d24fe8c706f66fa3a2dc90d. Exact Git archive discovery/overlay preflight and remote byte readback passed. Hosted acceptance is not yet claimed. Permitted dependencies retain original licenses, authorship and notices. Dependency adaptations include module import renames and attribution comments, field/domain specialization of smooth/reduced arguments, and an adapted rigidity argument. Original dependency authors and Apache-2.0 notices are preserved.

Existence of a 779247-dim irreducible e₈-representation with 40 tensor-square isotypic components
e8_irrep_tensor_square_decomp

Lean theorem statement

theorem e8_irrep_tensor_square_decomp :
    ∃ (V : Type) (_ : AddCommGroup V) (_ : Module ℂ V)
      (_ : LieRingModule (LieAlgebra.e₈ ℂ) V) (_ : LieModule ℂ (LieAlgebra.e₈ ℂ) V),
      Module.finrank ℂ V = 779247 ∧
      LieModule.IsIrreducible ℂ (LieAlgebra.e₈ ℂ) V ∧
      (isotypicComponents (UniversalEnvelopingAlgebra ℂ (LieAlgebra.e₈ ℂ))
        (V ⊗[ℂ] V)).ncard = 40 := by
  sorry
#22
How produced

Credits: @ma4ypic4y, @haskiindahouse. Owner-declared authorship: @ma4ypic4y. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original model attribution retained in source documentation; historical runtime attribution has not been independently verified. Completed official source-only verification against benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: lake test exit 0, Nanoda and Lean default kernel acceptance, no prohibited axioms. All 197 submitted Lean sources match the published commit; protected files, pins, binaries and dependency sources remained unchanged. Receipt SHA256: a3c82e55336a17fa760b2c927dfb908b889c9ed70f484b51e2bd0896be342efe. Exact Git archive preflight and remote byte readback passed. Hosted acceptance is not yet claimed. Permitted dependencies retain original licenses, authorship and notices.

A proof of the Erdős–Faber–Lovász conjecture
annals_erdos_faber_lovasz_conjecture

Lean theorem statement

/--
Statement of Theorem 1.1:

For sufficiently large `n : ℕ`, every linear hypergraph on `n` vertices has chromatic index
at most `n`.
-/
theorem theorem_1_1 :
    ∀ᶠ n in atTop, ∀ 𝓗 : Hypergraph (Fin n), 𝓗.IsLinear → 𝓗.chromaticIndex ≤ n := by
  sorry
#23
How produced

Credits: @ma4ypic4y, @haskiindahouse. Owner-declared authorship: @ma4ypic4y. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original model attribution retained in source documentation; historical runtime attribution has not been independently verified. Completed official source-only verification against benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: lake test exit 0, Nanoda and Lean default kernel acceptance, no prohibited axioms. All 249 submitted Lean sources match the published commit; protected files, pins, binaries and dependency sources remained unchanged. Receipt SHA256: ac1c24420a50bdf244bc23fdf0f7288dad6ab8ee395e0849d4814f32a90cd181. Exact Git archive preflight and remote byte readback passed. Hosted acceptance is not yet claimed. Permitted dependencies retain original licenses, authorship and notices.

Smallness of exceptional set to Littlewood's conjecture
einsiedler_katok_lindenstrauss

Lean theorem statement

theorem einsiedler_katok_lindenstrauss :
    dimH {(α, β) : ℝ × ℝ | Filter.atTop.liminf
      (fun n : ℕ ↦ n * distToNearestInt (n * α) * distToNearestInt (n * β)) > 0} = 0 := by
  sorry
#24
How produced

Credits: @ma4ypic4y, @haskiindahouse. Owner-declared authorship: @ma4ypic4y. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original model attribution retained in source documentation; historical runtime attribution has not been independently verified. Completed official source-only verification against benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: lake test exit 0, Nanoda and Lean default kernel acceptance, no prohibited axioms. All 152 submitted Lean sources match the published commit; protected files, pins, binaries and dependency sources remained unchanged. Receipt SHA256: 3f3a4ef5aceccbedab728079f315787bb93910f785f4bd61a155287147e04463. Exact Git archive preflight and remote byte readback passed. Hosted acceptance is not yet claimed. Permitted dependencies retain original licenses, authorship and notices.

The Hasse principle for random Fano hypersurfaces
annals_hasse_principle_random_fano

Lean theorem statement

/--
Statement of Theorem 1.1:

Let `d ≥ 2` and `n ≥ d` with `(d, n) ≠ (3, 3)`. Then we have `lim_{A → ∞} ρ_{d,n}(A) = ρˡᵒᶜ_{d,n}`.
-/
theorem theorem_1_1 (hd : 2 ≤ d) (h₁ : d ≤ n) (h₂ : (d, n) ≠ (3, 3)) :
    Tendsto (ρ d n) atTop (nhds (ρLoc d n)) := by
  sorry
#25
How produced

Credits: @ma4ypic4y, @haskiindahouse. Owner-declared authorship: @ma4ypic4y. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original model attribution retained in source documentation; historical runtime attribution has not been independently verified. Completed official source-only verification against benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: lake test exit 0, Nanoda and Lean default kernel acceptance, no prohibited axioms. All 149 submitted Lean sources match the published commit; protected files, pins, binaries and dependency sources remained unchanged. Receipt SHA256: 3aca0c040d2736da22c6e3c9c33395b3e760621678d34c2c6ffbc1a7f4b7c31c. Exact Git archive preflight and remote byte readback passed. Hosted acceptance is not yet claimed. Permitted dependencies retain original licenses, authorship and notices.

Pannwitz–Kuperberg quadrisecant theorem
smooth_knot_has_quadrisecant

Lean theorem statement

/-- **Quadrisecant theorem** (Pannwitz–Kuperberg). Every smooth nontrivial knot
has a quadrisecant. -/
theorem smooth_knot_has_quadrisecant
    {r : ℝ → Space} (_hknot : IsSmoothKnot r) (_hnontrivial : ¬ IsUnknotted r) :
    HasQuadrisecant r := by
  sorry
#26
How produced

Credits: @ma4ypic4y, @haskiindahouse. Owner-declared authorship: @ma4ypic4y. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original model attribution retained in source documentation; historical runtime attribution has not been independently verified. Completed official source-only verification against benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: lake test exit 0, Nanoda and Lean default kernel acceptance, no prohibited axioms. All 38 submitted Lean sources match the published commit; protected files, pins, binaries and dependency sources remained unchanged. Receipt SHA256: 4639aa5c6f7685856513563e7674ccf65a54f1060064a35601deacc6a605df93. Exact Git archive preflight and remote byte readback passed. Hosted acceptance is not yet claimed. Permitted dependencies retain original licenses, authorship and notices.

Inscribed rectangles in a smooth Jordan curve attain at least one third of all aspect ratios
annals_inscribed_rectangles

Lean theorem statement

/--
Statement of Theorem 1:

Let `γ` be a smooth Jordan curve, and let `X` be the set of all `r ∈ [0,1]` so that there is an
inscribed rectangle in `γ` of aspect ratio `tan(r·π/4)`.
Then the Lebesgue measure of `X` is at least `1/3`.
-/
theorem theorem_1 (γ : Circle → ℝ × ℝ) (hγ : IsSmoothEmbedding (𝓡 1) 𝓘(ℝ, ℝ × ℝ) ∞ γ) :
    volume (X γ) ≥ 1/3 := by
  sorry
#27
How produced

Credits: @ma4ypic4y, @haskiindahouse. Owner-declared authorship: @ma4ypic4y. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original model attribution retained in source documentation; historical runtime attribution has not been independently verified. Completed official source-only verification against benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: lake test exit 0, Nanoda and Lean default kernel acceptance, no prohibited axioms. All 82 submitted Lean sources match the published commit; protected files, pins, binaries and dependency sources remained unchanged. Receipt SHA256: 37b5f3ad1b43a3e7e50348bb36c6f59eff14819c6577b08e07ef4741c3238369. Exact Git archive preflight and remote byte readback passed. Hosted acceptance is not yet claimed. Permitted dependencies retain original licenses, authorship and notices. Dependency adaptation includes namespace/header changes and universe specialization.

The energy of dilute Bose gases
annals_bose_gases

Lean theorem statement

/-- Constant `η` in Theorem 1.2. -/
noncomputable def η : ℝ := sorry

/-- Constant `𝓒` in Theorem 1.2. -/
noncomputable def 𝓒 (𝓡 : ℝ) (r : ℝ) : ℝ := sorry

/--
Statement of Theorem 1.2 (The Lee-Huang-Yang Formula):

For any non-zero, non-negative, radial potential `v ∈ L¹(ℝ³)` with compact support contained
in some ball `B(0,R)`, there exists `η > 0` and `𝓒` (depending only on `𝓡`and `R / a`) such that
as `ρ → 0⁺`,

`e ρ v ≥ 4πρ²a(1 + 128/(15√π)√(ρa³) - 𝓒(ρa³)^{1/2 + η})`.

Note: We (equivalently) take the limit as `ρ → 0⁺` rather than `ρa³ → 0⁺` as in the paper.

Note: While the wording of Theorem 1.2 in the paper suggests that `η` should also be allowed to
depend on `𝓡` and `R / a`, Theorem 6.8 makes it clear that `η` is in fact a universal constant.

Note: Since `v` is in `L¹(ℝ³)`, we interpret `v ≠ 0` to mean that `v` is not zero in `L¹(ℝ³)`.
-/
theorem theorem_1_2 (v : ℝ³ → ℝ) (hv_ne_zero : ¬ v =ᵐ[volume] 0) (hv_nonneg : 0 ≤ v)
    (hv_radial : IsRadial v) (hv_memL1 : MemLp v 1) {R : ℝ} (hR : 0 < R)
    (hv_supp : tsupport v ⊆ ball 0 R) : 0 < η ∧ ∀ᶠ ρ in 𝓝[>] 0,
      e ρ v ≥ 4 * π * ρ ^ 2 * a v * (1 + (128 / (15 * √ π)) * √ (ρ * a v ^ 3) -
        𝓒 (𝓡 v) (R / a v) * (ρ * a v ^ 3) ^ (1 / 2 + η)) := by
  sorry
#28
How produced

Credits: @ma4ypic4y, @haskiindahouse. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original Claude Opus 5.5 attribution retained in the source documentation; the historical runtime attribution has not been independently verified. Human direction included target selection and authorization of this private submission. Audited completed source-only verification against unchanged official benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: completed lake test, exit 0, Nanoda and Lean default kernel acceptance. All 321 submitted Lean sources, protected files, pinned tools and 8,116 tracked Lean Pool files remained unchanged. Receipt SHA256: 4287bb32075719d303debb82ee7123fe6841160e7bd8f18834fbcce687f1aaff. Exact Git archive discovery/overlay and remote byte readback passed. Hosted acceptance is not yet claimed. Private, with no current publication plan; no publication dates.

Good Locally Testable Codes
annals_good_lt_codes

Lean theorem statement

/--
Statement of Theorem 1.2:

There exist explicit good locally testable codes (for every rate `ρ < 1`).
-/
theorem theorem_1_2 (ρ : ℝ≥0) (hρ : ρ < 1) :
    ∃ q, ∃ κ ≠ 0, ∃ (n : ℕ → ℕ), ∃ (𝒞 : (i : ℕ) → BinaryCode (n i)), IsGood 𝒞 ∧
      ∀ i, Nonempty (LTC q κ (𝒞 i)) ∧ rate (𝒞 i) ≥ ρ := by
  sorry
#29
How produced

Credits: @ma4ypic4y, @haskiindahouse. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original Claude Opus 5.5 attribution retained in the source documentation; the historical runtime attribution has not been independently verified. Human direction included target selection and authorization of this private submission. Original provenance is retained in PROVENANCE.json, including campaign source commit a700d5f43ef741f502d502153b82cb6e58541cd8. The package adapts two permitted Lean Pool proof modules: LeanPool/NonSoficGroup/Foundations.lean and Spectral.lean from Vilin97/lean-pool at e9d53e9cbcff8dfd0cc816ba94db7a26b082929f. Copyright 2026 OpenAI and Dean Cureton, authorship, Apache 2.0 terms and modification notices are retained. Module keywords were removed, only the property (T) declarations needed here were retained, and the namespace changed. This library reuse is part of the solution. The official benchmark license, root statement/template notices, dependency authorship and provenance/LEAN-EVAL-LICENSE are preserved. Independent fresh source-only verification against unchanged official benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: completed lake test, exit 0, Nanoda and Lean default kernel acceptance. All 30 submitted Lean sources, protected files, pinned tools and 8,116 tracked Lean Pool files remained unchanged. Receipt SHA256: 4acf2791304fab653e318e1a0b3430d30c8a6935934eedc57207d839d6216b64. Exact Git archive discovery/overlay and remote byte readback passed. Hosted acceptance is not yet claimed. Private, with no current publication plan; no publication dates.

Linear independence results of Calegari–Dimitrov–Tang
cdt_linearIndependent

Lean theorem statement

/--
Theorem A and C in arXiv:2408.15403.
-/
theorem cdt_linearIndependent :
    letI χ : ZMod 3 → ℂ := ![0, 1, -1]
    LinearIndependent ℚ ![1, riemannZeta 2, ZMod.LFunction χ 2] ∧
    ∀ m n : ℤ, m ≠ -1 → m ≠ 0 → n ≠ -1 → n ≠ 0 → 10 ^ 6 * |m - n| < |n| →
      letI lm := Real.log (1 + 1 / m)
      letI ln := Real.log (1 + 1 / n)
      Irrational (lm * ln) ∧
      (m ≠ n → LinearIndependent ℚ ![1, lm, ln, lm * ln]) := by
  sorry
#30
How produced

Credits: @ma4ypic4y, @haskiindahouse. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original Claude Opus 5.5 attribution retained in the source documentation; the historical runtime attribution has not been independently verified. Human direction included target selection and authorization of this private submission. Original provenance is retained in PROVENANCE.json, including the original Claude campaign integration-tree reference cc242a1 (a short reference, not an independently verified full historical commit). This is a replication/adaptation using permitted library proofs: 7 PrimeNumberTheoremAnd modules and 8 QSeries modules via Vilin97/lean-pool at e9d53e9cbcff8dfd0cc816ba94db7a26b082929f, and Lindemann analytic material from astrainfinita/mathlib4 at 2ec8b0e44647603dc096134c99901892b8105825. Original authors and modifications are recorded in the retained module notices. The three embedded License.lean modules retain the full upstream Apache 2.0 licenses. Official benchmark notices, dependency authorship and provenance/LEAN-EVAL-LICENSE are preserved. Independent fresh source-only verification against unchanged official benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: completed lake test, exit 0, Nanoda and Lean default kernel acceptance. All 252 submitted Lean sources, protected files, pinned tools and 8,116 tracked Lean Pool files remained unchanged. Receipt SHA256: be257c8ccbfa005ff851ea3698ad713acc9eec3e40f3ddf7494f6fc11b9cc8cd. Exact Git archive discovery/overlay and remote byte readback passed. Hosted acceptance is not yet claimed. Private, with no current publication plan; no publication dates.

Whitney embedding theorem (strong form, dimension 2n)
whitney_embedding

Lean theorem statement

/-- **Whitney embedding theorem** (Whitney 1944). Every smooth
`n`-manifold (`n ≥ 1`, Hausdorff, second-countable) admits a smooth
embedding into `ℝ^{2n}`. -/
theorem whitney_embedding (n : ℕ) (_hn : 1 ≤ n)
    {M : Type*} [TopologicalSpace M]
    [ChartedSpace (EuclideanSpace ℝ (Fin n)) M] [IsManifold (𝓡 n) ∞ M]
    [T2Space M] [SecondCountableTopology M] :
    ∃ e : M → EuclideanSpace ℝ (Fin (2 * n)),
      ContMDiff (𝓡 n) (𝓡 (2 * n)) ∞ e ∧
      IsEmbedding e ∧
      ∀ x : M, Function.Injective (mfderiv (𝓡 n) (𝓡 (2 * n)) e x) := by
  sorry
#31
How produced

Credits: @ma4ypic4y, @haskiindahouse. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original Claude Opus 5.5 attribution retained in the source documentation; the historical runtime attribution has not been independently verified. The original provenance also records earlier GLM campaign files. Human direction included target selection and authorization of this private submission. Declared reuse: the package retains 508 vendored modules from qinz1yang/differential-geometry @ 777299070a5529e96345e0033979706fd00c7e62 (Apache-2.0), supplying manifold, Morse-theory and differential-topology infrastructure. The 95 campaign modules and root bridge build on that library. Credit for the dependency remains with its original authors; its formalization is not claimed as new work by this submission. Original source headers, LICENSE, Submission/DG/License.lean, provenance/LEAN-EVAL-LICENSE and historical provenance are preserved. This corrected package follows issue #1997 (2c56892ed40cc23764f86693fa3c6e005bb07cfb), which failed before evaluation when GitHub's Contents API rejected the 42,290,921-byte archive as too large. The new compressed archive is 3,425,994 bytes. It retains the exact import closure of Submission.lean: all 604 retained Lean sources are byte-identical to the previous package, with 17,395 unused vendored files removed. No retained proof, comparator, ChallengeDeps, oracle or benchmark statement was weakened. Independent fresh source-only verification against unchanged official benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: completed lake test, exit 0, Nanoda and Lean default kernel acceptance. All 604 submitted Lean sources, protected files, pinned tools and 8,116 tracked Lean Pool files remained unchanged. Receipt SHA256: b95afd1c4b2753dd4c6c7875188ebf839edbd9679f6708f44fb9028c115a6e48. Exact Git archive discovery/overlay and remote byte readback passed. Hosted acceptance is not yet claimed. Private, with no current publication plan; no publication dates.

The Hopf problem: a complex structure on the 6-sphere
hopf_s6_complex_structure

Verso theorem preview

/-- **Hole 1 (data).** An atlas of charts from the 6-sphere — the unit sphere in `ℝ⁷`, with its subspace topology — into `ℂ³`, taken as the plain function type `Fin 3 → ℂ`: all norms on a finite-dimensional space are equivalent, so the choice of model norm is immaterial to the statement. -/ instance declaration uses `sorry`instChartedSpaceS6 : ChartedSpace (Fin 3 → ℂ) (Metric.sphere (0 : EuclideanSpace ℝ (Fin 7)) 1) := sorry
/-- **Hole 2 (proof).** The atlas of hole 1 is holomorphic: its transition functions are `ℂ`-analytic on their open domains. -/ instance declaration uses `sorry`instIsManifoldS6 : IsManifold 𝓘(ℂ, Fin 3 → ℂ) ω (Metric.sphere (0 : EuclideanSpace ℝ (Fin 7)) 1) := sorry
#32
How produced

Credits: @ma4ypic4y, @haskiindahouse. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original Claude attribution retained in the source documentation; the historical runtime attribution has not been independently verified. Human direction included target selection and authorization of this private submission. Replication using an allowed dependency. The full atlas theorem comes from the benchmark-pinned Lean Pool (Vilin97/lean-pool @ e9d53e9cbcff8dfd0cc816ba94db7a26b082929f): Mathoverflow1973.SixSphereComplexAtlas.exists_complex_analytic_atlas. Credit for that proof belongs to Boris Alexeev, Yury G. Kudryashov, Sebastian Kumar and The Formal Conjectures Authors, with upstream plby/HopfProblem @ 9ac8a456, describing a formalization of Levent Alpöge's construction. This package contributes model-space transport and the two benchmark instances; it does not claim a new mathematical proof by us. Original provenance and Apache-2.0 licenses/notices are preserved. Independent source-only verification against unchanged official benchmark 2e58dff1c3d3aa934614d46205e8f430f9a7ca7e, statement revision 1: completed lake test, exit 0, Nanoda and Lean default kernel acceptance, both official holes checked. All three submitted Lean sources, protected files, pins and 8,116 tracked Lean Pool files remained unchanged. Receipt SHA256: 65b00ea5053ef84c30cbdef04f461226929d998efcb8e0f8b18358433b6609ea. The official evaluator's private dependency build-cache layout was used. This independent run uses the official generated target without the problem_spec supplementation described by the older bundled report. Exact Git archive discovery/overlay and remote byte readback passed. Hosted acceptance is not yet claimed. Private, with no current publication plan; no publication dates.

Bender–Suzuki theorem (classification of finite simple groups with a strongly-embedded subgroup)
bender_suzuki

Lean theorem statement

/-- **Bender–Suzuki theorem.** -/
theorem bender_suzuki {X : Type*} [Group X] [Finite X] [IsSimpleGroup X]
    (M : Subgroup X) (h : IsStronglyEmbedded M) :
    IsSimpleBenderGroup X := by
  sorry
#33
How produced

Contributor tags: @ma4ypic4y, @haskiindahouse. Submitter: ma4ypic4y. Problem: bender_suzuki, statement revision 1. The declared model/system name max gp (GPT-6) is our existing GPT-6-family system label. This proof comes from the formalization-evaluation campaign via Codex CLI; the supplied provenance records backend: gpt-6.1-sol / gpt-6-astra; final assembly job made no model calls. Campaign contributor: @haskiindahouse. Human direction included selecting the campaign targets and authorizing this private submission. Declared reuse: adapts the existing public Apache-2.0 formalization https://github.com/Qiuzhen-CFSG/CFSG at `96b2a02085dc678f3e0a97b334c31ada599c55fd`. The campaign performed compatibility repairs for Lean 4.35.0-rc3 / pinned Mathlib and the exact benchmark adapter. Original full-proof authorship is not claimed; original declarations, headers and notices are retained. The bundled VERIFICATION.json records fresh source-only official local verification with the unchanged LeanEval comparator, both Nanoda and the Lean kernel accepted, against benchmark 0e093293afbe96be91504ae6e44947876d3fc84e, Lean v4.35.0-rc3 and pinned dependencies. Receipt: d3a65ebc2c944e0494bebbe6f6f66c60. All 907 submitted Lean source hashes were independently checked against that bundled receipt after downloading this exact GitHub commit archive. Server workspace discovery and overlay were checked using the unmodified evaluator at 6164cacbef4207b5c8d895e89ac58e4bb9bb23e3; the protected benchmark files remain unchanged. These archive/packaging checks do not repeat the Lean proof run, and the bundled local PASS is not a claim of organizer acceptance or leaderboard credit. Publication status: private, with no current publication plan and no publication date. No public release of the submitted source is authorized by this submission. Original source notices and provenance are retained. Only this exact problem snapshot is submitted through the currently documented GitHub issue intake.

pi_6 of the 3-sphere is Z/12
pi6_sphere_three_mulEquiv_zmod_twelve

Lean theorem statement

/-- **π₆ of the 3-sphere.** Toda's tables give `π₆(𝕊³) ≅ ℤ/12`. -/
theorem pi6_sphere_three_mulEquiv_zmod_twelve
    (x : Metric.sphere (0 : EuclideanSpace ℝ (Fin 4)) 1) :
    Nonempty
      (HomotopyGroup.Pi 6 (Metric.sphere (0 : EuclideanSpace ℝ (Fin 4)) 1) x ≃*
        Multiplicative (ZMod 12)) := by
  sorry
#34
How produced

Submitter: ma4ypic4y. Existing public proof from plby/lean-proofs at 8822f7ddef30fadbd92e1c6ab4ed897af356af5e, starting at src/latest/Wikipedia/HomotopyGroupsOfSpheres/SphereThreeSix.lean. Upstream attribution and individual source notices are preserved. Contribution: import relocation, Lean 4.35 / Mathlib compatibility migration and proof-term normalization, with the exact benchmark statement unchanged. Fresh source-only official verification of all 1793 files passed both unchanged kernels against benchmark 0e093293afbe96be91504ae6e44947876d3fc84e; source/trusted post-run audits passed. Publication choice: withheld. Specific reason: no blanket license grant covering the complete upstream proof closure has been established; no Apache-2.0 relicensing or public source release is claimed or authorized by this submission. Local verification is not a claim of server acceptance. Packaging repair: add the benchmark lakefile.toml discovery marker and toolchain metadata; all previously verified Submission sources are byte-identical. Supersedes submission 01a10090-0181-744a-ac57-d0507eac8690. Harness: Codex multi-agent source-porting workflow with the unmodified pinned LeanEval comparator (Lean and Nanoda). Human selected the benchmark, research direction and submission identity, and authorized submission. This reuses an existing public proof; original full-proof authorship is not claimed. This uses the documented temporary issue intake because the service evaluation-completion builder rejects the benchmark RC3 toolchain; the same corrected commit is in service run https://github.com/leanprover/lean-eval-submissions/actions/runs/37107509785. No change to verifier, benchmark pins, proof sources or attribution is requested.

Erdős's unit-distance conjecture is false
erdos_unit_distance_conjecture_false

Verso theorem preview

theorem declaration uses `sorry`erdos_unit_distance_conjecture_false : ∃ δ : ℝ, 0 < δ ∧ ∀ N : ℕ, ∃ (n : ℕ) (P : Finset (EuclideanSpace ℝ (Fin 2))), N ≤ n ∧ P.card = n ∧ (n : ℝ) ^ (1 + δ) ≤ (unitDist P : ℝ) := ⊢ ∃ δ, 0 < δ ∧ ∀ (N : ℕ), ∃ n P, N ≤ n ∧ P.card = n ∧ ↑n ^ (1 + δ) ≤ ↑(unitDist P) All goals completed! 🐙
#35
How produced

Credits: @ma4ypic4y, @haskiindahouse. Owner-declared authorship: @ma4ypic4y. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original model attribution retained in source documentation; historical runtime attribution has not been independently verified. Completed official source-only verification against benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: lake test exit 0, Nanoda and Lean default kernel acceptance, no prohibited axioms. All 1564 submitted Lean sources match this exact commit; protected files, pins, binaries and dependency sources remained unchanged. Receipt SHA256: bec26fb84a5f6542f7bb63a6313bf5404209a7b3efc10cd11bc1f078efc91993. Exact Git archive discovery/overlay preflight and remote byte readback passed. Hosted acceptance is not yet claimed. Permitted dependencies retain original licenses, authorship and notices. Dependency attribution: Submission/Nyll contains 1550 modules from n-yamaguchi-0729/SawinTotallyRealTowers @4b423fefd42383c629a962e36a686d160fa7aeb4. Reviewed sources match after import-prefix changes except two small ramification-index compatibility rewrites. Submission/LIEUD adapts logical-intelligence/erdos-unit-distance @b6493074dd103ca32ea4f5e9b0bc9cb3a0379f2e for the pinned Lean/Mathlib version. Original Apache-2.0, authors and notices are retained.

Fractal uncertainty in higher dimensions
annals_fractal_uncertainty

Lean theorem statement

/--
Statement of Theorem 1.1:

Let `ν > 0` and assume that
- `X ⊆ [−1,1]ᵈ` is `ν`-porous on balls from scales `h` to `1`, and
- `Y ⊆ [−h⁻¹,h⁻¹]ᵈ` is `ν`-porous on lines from scales `1` to `h⁻¹`.
Then there exist `β,C > 0` depending only on `ν` and `d` such that for all `f ∈ L²(ℝᵈ)`,
`supp (𝓕 f) ⊆ Y => ‖f * 1_X‖₂ ≤ C * h ^ β * ‖f‖₂`.
Note: We require `X` and `Y` to be measurable to make the statement more natural.
-/
theorem theorem_1_1 (ν : ℝ) (hν₀ : 0 < ν) :
    ∃ (β C : ℝ), β > 0 ∧ C > 0 ∧ ∀ (h : ℝ) (X Y : Set ℝᵈ)
      (hX : MeasurableSet X) (hY : MeasurableSet Y), h ∈ Set.Ioo 0 (1 / 100) →
        X ⊆ cube (-1) 1 → PorousOnBalls ν h 1 X → Y ⊆ cube (-h⁻¹) h⁻¹ →
          PorousOnLines ν 1 h⁻¹ Y → ∀ (f : Lp ℂ 2), (𝓕 f : Lp ℂ 2) =ᵐ[volume.restrict Yᶜ] 0 →
            (eLpNorm (X.indicator f) 2).toReal ≤ C * h ^ β * ‖f‖ := by
  sorry
#36
How produced

Credits: @ma4ypic4y, @haskiindahouse. Owner-declared authorship: @ma4ypic4y. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original model attribution retained in source documentation; historical runtime attribution has not been independently verified. Completed official source-only verification against benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: lake test exit 0, Nanoda and Lean default kernel acceptance, no prohibited axioms. All 80 submitted Lean sources match this exact commit; protected files, pins, binaries and dependency sources remained unchanged. Receipt SHA256: 7f3c94968e2834fec9815d78093ef7ec3eb570d8320f8c068d54bb18da08ce23. Exact Git archive discovery/overlay preflight and remote byte readback passed. Hosted acceptance is not yet claimed. Permitted dependencies retain original licenses, authorship and notices.

Neukirch–Uchida theorem
neukirch_uchida

Verso theorem preview

theorem declaration uses `sorry`neukirch_uchida {K₁ K₂ K₁' K₂' : Type*} [Field K₁] [Field K₂] [Field K₁'] [Field K₂'] [NumberField K₁] [NumberField K₂] [Algebra K₁ K₁'] [Algebra K₂ K₂'] [IsSepClosure K₁ K₁'] [IsSepClosure K₂ K₂'] (ϕ : Gal(K₁'/K₁) ≃* Gal(K₂'/K₂)) (he : IsHomeomorph ϕ) : ∃! σ : K₂' ≃+* K₁', (algebraMap K₂ K₂').range.map σ.toRingHom = (algebraMap K₁ K₁').range ∧ ∀ g : Gal(K₁'/K₁), ϕ g = σ.trans (g.toRingEquiv.trans σ.symm) := K₁:Type u_1K₂:Type u_2K₁':Type u_3K₂':Type u_4inst✝⁹:Field K₁inst✝⁸:Field K₂inst✝⁷:Field K₁'inst✝⁶:Field K₂'inst✝⁵:NumberField K₁inst✝⁴:NumberField K₂inst✝³:Algebra K₁ K₁'inst✝²:Algebra K₂ K₂'inst✝¹:IsSepClosure K₁ K₁'inst✝:IsSepClosure K₂ K₂'ϕ:Gal(K₁'/K₁) ≃* Gal(K₂'/K₂)he:IsHomeomorph ⇑ϕ⊢ ∃! σ, Subring.map σ.toRingHom (algebraMap K₂ K₂').range = (algebraMap K₁ K₁').range ∧ ∀ (g : Gal(K₁'/K₁)), (ϕ g).toRingEquiv = σ.trans (g.toRingEquiv.trans σ.symm) All goals completed! 🐙
#37
How produced

Credits: @ma4ypic4y, @haskiindahouse. Owner-declared authorship: @ma4ypic4y. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original model attribution retained in source documentation; historical runtime attribution has not been independently verified. Completed official source-only verification against benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: lake test exit 0, Nanoda and Lean default kernel acceptance, no prohibited axioms. All 141 submitted Lean sources match the published commit; protected files, pins, binaries and dependency sources remained unchanged. Receipt SHA256: 504a1af6e529a692ce32b9799172fa06146c92a3989bc766133496a559b60648. Exact Git archive preflight and remote byte readback passed. Hosted acceptance is not yet claimed. Permitted dependencies retain original licenses, authorship and notices.

New large value estimates for Dirichlet polynomials
annals_large_value_estimates

Verso theorem preview

theorem declaration uses `sorry`theorem_1_1 : ∃ o : ℝ → ℝ, o =o[Filter.atTop] (1 : ℝ → ℝ) ∧ ∀ (b : ℕ → ℂ) (_hb : ∀ n, ‖b n‖ ≤ 1) (N : ℕ) (V : ℝ) (T : ℝ) (R : ℕ) (t : Fin R → ℝ), N > 0 → V > 0 → T > 1 → -- these assumptions are necessary but not stated in the paper (∀ i j, i ≠ j → |t i - t j| ≥ 1) → (∀ i, t i ∈ Set.Icc 0 T) → (∀ r, ‖∑ n ∈ Finset.Icc N (2 * N), b n * n ^ (I * t r)‖ ≥ V) → R ≤ T ^ (o T) * bound N V T := ⊢ ∃ o, o =o[Filter.atTop] 1 ∧ ∀ (b : ℕ → ℂ), (∀ (n : ℕ), ‖b n‖ ≤ 1) → ∀ (N : ℕ) (V T : ℝ) (R : ℕ) (t : Fin R → ℝ), N > 0 → V > 0 → T > 1 → (∀ (i j : Fin R), i ≠ j → |t i - t j| ≥ 1) → (∀ (i : Fin R), t i ∈ Set.Icc 0 T) → (∀ (r : Fin R), ‖∑ n ∈ Finset.Icc N (2 * N), b n * ↑n ^ (I * ↑(t r))‖ ≥ V) → ↑R ≤ T ^ o T * bound N V T All goals completed! 🐙
#38
How produced

Credits: @ma4ypic4y, @haskiindahouse. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original Claude Opus 5.5 attribution retained in the source documentation; the historical runtime attribution has not been independently verified. Human direction included target selection and authorization of this private submission. Independent fresh source-only verification against unchanged official benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: completed lake test, exit 0, Nanoda and Lean default kernel acceptance. All 101 submitted Lean sources, protected files, pinned tools and 8,116 tracked Lean Pool files remained unchanged. Receipt SHA256: ab00ac0615cfa6947434782e5a4fb9a6df49a14865e03bbc42e10000a09fc948. Exact Git archive discovery/overlay and remote byte readback passed. Hosted acceptance is not yet claimed. Private, with no current publication plan; no publication dates.

Galois groups of random integer polynomials and van der Waerden's Conjecture
annals_van_der_waerden_conjecture

Verso theorem preview

theorem declaration uses `sorry`theorem_1 (n : ℕ) (hn : 3 ≤ n) : (fun H ↦ (vanDerWaerdenConjecture.E n H : ℝ)) =O[atTop] (fun H ↦ (H ^ (n - 1) : ℝ)) := n:ℕhn:3 ≤ n⊢ (fun H => ↑(E n H)) =O[atTop] fun H => ↑H ^ (n - 1) All goals completed! 🐙
#39
How produced

Credits: @ma4ypic4y, @haskiindahouse. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original Claude Opus 5.5 attribution retained in the source documentation; the historical runtime attribution has not been independently verified. Human direction included target selection and authorization of this private submission. Independent fresh source-only verification against unchanged official benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: completed lake test, exit 0, Nanoda and Lean default kernel acceptance. All 125 submitted Lean sources, protected files, pinned tools and 8,116 tracked Lean Pool files remained unchanged. Receipt SHA256: f8901a78c11478458dbb4dfd8b831c357307e89dd887711746397311ee64ac02. Exact Git archive discovery/overlay and remote byte readback passed. Hosted acceptance is not yet claimed. Private, with no current publication plan; no publication dates.

A negative answer to Ulam's Problem 19 from the Scottish Book
annals_ulam

Verso theorem preview

theorem declaration uses `sorry`theorem_1 (hd : 3 ≤ d) : letI : NeZero d := ⟨d:ℕhd:3 ≤ d⊢ d ≠ 0 All goals completed! 🐙⟩ ∃ K : Ulam.BodyOfRevolution d, Ulam.IsStrictlyConvexBody K.body ∧ ¬ Ulam.IsCentrallySymmetric K.body ∧ Ulam.FloatsInEquilibriumInEveryOrientationAtLevel K.body (volume.real K.body / 2) := d:ℕhd:3 ≤ d⊢ ∃ K, IsStrictlyConvexBody K.body ∧ ¬IsCentrallySymmetric K.body ∧ FloatsInEquilibriumInEveryOrientationAtLevel K.body (volume.real K.body / 2) All goals completed! 🐙
#40
How produced

Credits: @ma4ypic4y, @haskiindahouse. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original Claude Opus 5.5 attribution retained in the source documentation; the historical runtime attribution has not been independently verified. Human direction included target selection and authorization of this private submission. Independent fresh source-only verification against unchanged official benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: completed lake test, exit 0, Nanoda and Lean default kernel acceptance. All 97 submitted Lean sources, protected files, pinned tools and 8,116 tracked Lean Pool files remained unchanged. Receipt SHA256: c237421e5b35b9e5cbc4fdbd50cb0af0c4fd7bcf9608ec60b20e2fc471f419fb. Exact Git archive discovery/overlay and remote byte readback passed. Hosted acceptance is not yet claimed. Private, with no current publication plan; no publication dates.

Viscosity solutions and hyperbolic motions: a new PDE method for the N-body problem
annals_viscosity_solutions

Verso theorem preview

theorem declaration uses `sorry`theorem_1_1 (hE : 2 ≤ Module.finrank ℝ E) (m : ℝᴺ) (hm : ∀ i, 0 < m i) (x₀ a : Eᴺ) (a_nc : ViscositySolutions.WithoutCollisions a) (a_norm : ‖a‖_[m] = 1) (h : ℝ) (h_pos : h > 0) : ∃ x : ℝ → Eᴺ, ∃ o : ℝ → Eᴺ, (o =o[atTop] fun t ↦ t) ∧ x 0 = x₀ ∧ ViscositySolutions.IsNBodySolution m x ∧ (∀ t > 0, ViscositySolutions.WithoutCollisions (x t)) ∧ ∀ t ≥ 0, x t = (sqrt (2 * h) * t) • a + o t := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:InnerProductSpace ℝ Einst✝:FiniteDimensional ℝ EN:ℕhE:2 ≤ Module.finrank ℝ Em:Fin N → ℝhm:∀ (i : Fin N), 0 < m ix₀:Eᴺa:Eᴺa_nc:WithoutCollisions aa_norm:‖a‖_[m] = 1h:ℝh_pos:h > 0⊢ ∃ x o, (o =o[atTop] fun t => t) ∧ x 0 = x₀ ∧ IsNBodySolution m x ∧ (∀ t > 0, WithoutCollisions (x t)) ∧ ∀ t ≥ 0, x t = (√(2 * h) * t) • a + o t All goals completed! 🐙
#41
How produced

Credits: @ma4ypic4y, @haskiindahouse. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original Claude Opus 5.5 attribution retained in the source documentation; the historical runtime attribution has not been independently verified. Human direction included target selection and authorization of this private submission. Original provenance is retained in PROVENANCE.json, including campaign source commit 1ece0cb6bfa5e4915fec2b2cf284b4c2d813c553. The package declares no third-party proof source reuse. The official benchmark license, root statement/template notices, dependency authorship and provenance/LEAN-EVAL-LICENSE are preserved. Independent fresh source-only verification against unchanged official benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: completed lake test, exit 0, Nanoda and Lean default kernel acceptance. All 30 submitted Lean sources, protected files, pinned tools and 8,116 tracked Lean Pool files remained unchanged. Receipt SHA256: 6db104f799323f2a3b0b9957a21e6a591ddef582a5541d5795d2a21fbfc54fc1. Exact Git archive discovery/overlay and remote byte readback passed. Hosted acceptance is not yet claimed. Private, with no current publication plan; no publication dates.

On Zagier-Hoffman's conjectures in positive characteristic
annals_zagier_hoffman_positive_char

Lean theorem statement

/--
Statement of Theorem A (Brown's theorem in positive characteristic):

Let `w ∈ ℕ`, where `ℕ := {1,2,...}`. Then every MZV of weight `w` can be written as a `K`-linear
combination of MZV's in the set `𝒯_w`. In particular, `dim 𝒵_w ≤ d(w)`.
Note that `K` in the paper is `RatFunc F`.
-/
theorem theorem_A (w : ℕ+) :
    𝒵 F w = Submodule.span (RatFunc F) (𝒯 F w) ∧
    Module.rank (RatFunc F) (𝒵 F w) ≤ d F w := by
  sorry

/--
Statement of Theorem B:

Let `w ∈ ℕ`, where `ℕ := {1,2,...}`. MZVs of weight `w` in `𝒯0 w` are all linearly independent over
`K`. In particular, `dim 𝒵 w ≥ |𝒯0 w|`. Note that `K` in the paper is `RatFunc F`.
-/
theorem theorem_B (w : ℕ+) :
    LinearIndependent (RatFunc F) (Subtype.val : 𝒯0 F w → CompletionAtInfty F) ∧
    Module.rank (RatFunc F) (𝒵 F w) ≥ Set.ncard (𝒯0 F w) := by
  sorry

/--
Statement of Theorem D:

Let `w ∈ ℕ+` with `w ≤ 2q − 2`. Then `𝒯 w` is a `K`-basis for `𝒵 w`. In particular,
`dim_K (𝒵 w) = d(w)`. Note that `K` in the paper is `RatFunc F`.

Note: Theorem A establishes that `𝒯 w` spans `𝒵 w`. So to prove `𝒯 w` is a `K`-basis for `𝒵 w`, we
only need to show that `𝒯 w` are linearly independent in `𝒵 w`.
-/
theorem theorem_D (w : ℕ+) (hw : w ≤ 2 * Nat.card F - 2) :
    LinearIndependent (RatFunc F) (Subtype.val : 𝒯 F w → CompletionAtInfty F) ∧
    Module.rank (RatFunc F) (𝒵 F w) = d F w := by
  sorry
#42
How produced

Credits: @ma4ypic4y, @haskiindahouse. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original Claude Opus 5.5 attribution retained in the source documentation; the historical runtime attribution has not been independently verified. Human direction included target selection and authorization of this private submission. Original provenance is retained in PROVENANCE.json, including campaign source commit 5fd0921b8204740d93d574013ff90cbd585d8047. The package declares no third-party proof source reuse. The official benchmark license, root statement/template notices, dependency authorship and provenance/LEAN-EVAL-LICENSE are preserved. Independent fresh source-only verification against unchanged official benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: completed lake test, exit 0, Nanoda and Lean default kernel acceptance. All 27 submitted Lean sources, protected files, pinned tools and 8,116 tracked Lean Pool files remained unchanged. Receipt SHA256: e454e7bd3ce396c17ff0e70a29599a6d6598dab5f64691010646f41dab520075. Exact Git archive discovery/overlay and remote byte readback passed. Hosted acceptance is not yet claimed. Private, with no current publication plan; no publication dates.

Enumerating number fields
annals_enumerating_number_fields

Lean theorem statement

/--
Statement of Theorem 1 (Number fields have small models):

There exists a positive constant `Q` such that the following is true. Let `K` be a number field
of degree `n ≥ Q` and root discriminant `δ` over `ℚ`. Then there exist integers `r ≤ Q log n` and
`d ≤ Q log n` such that `(d + r) choose r ≤ Q n log n`, and there exist `r` polynomials
`E₁, ..., Eᵣ` of degree `≤ d` in `ℤ[x₁, ..., xᵣ]` all having coefficients bounded in absolute value
by `(n δ) ^ (Q log n)` such that the (smooth and zero-dimensional affine) scheme with equations
`E₁ = ... = Eᵣ = 0` and `det (∂Eᵢ/∂xⱼ) ≠ 0` contains `Spec K` as one of its irreducible components.
-/
theorem theorem_1 : ∃ Q > 0, ∀ n ≥ Q, ∀ K : NumberFieldOfDegree n, ∃ (r d : ℕ),
    r ≤ Q * log n ∧ d ≤ Q * log n ∧ (d + r).choose r ≤ Q * n * log n ∧
      ∃ E : Fin r → MvPolynomial (Fin r) ℤ, (∀ i, (E i).totalDegree ≤ d) ∧
        (∀ i j, |(E i).coeff j| ≤ (n * rootDiscr K) ^ (Q * log n)) ∧
          letI X := nonsingularOpen fun i ↦ (E i).map (algebraMap ℤ ℚ)
          ∃ Z, ∃ hZ : Z ∈ irreducibleComponents X,
            Nonempty (X.irreducibleComponent Z hZ ≅ Spec (.of K)) := by
  sorry

/--
Statement of Theorem 2 (Number fields with bounded discriminant):

There exists a positive constant `Q` such that the following is true. Let `n ≥ Q` be an integer.
Let `H ≥ 1` be an integer. The number of isomorphism classes of number fields
with degree `n` and discriminant `≤ H` is `≤ n^(Q n log^3 n) H^(Q log^3 n)`.
-/
theorem theorem_2 : ∃ Q > 0, ∀ n ≥ Q, ∀ H ≥ 1,
    (Nat.card (NumberFieldOfBoundedDiscriminantUpToIsomorphism n H) : ℝ) ≤
      n ^ (Q * n * log n ^ 3) * H ^ (Q * log n ^ 3) := by
  sorry
#43
How produced

Credits: @ma4ypic4y, @haskiindahouse. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original Claude Opus 5.5 attribution retained in the source documentation; the historical runtime attribution has not been independently verified. Human direction included target selection and authorization of this private submission. Original provenance is retained in PROVENANCE.json, including campaign source commit ef12356fb6db1dd4834158e8891cdea6536a37c0. The package declares no third-party proof source reuse. The official benchmark license, root statement/template notices, dependency authorship and provenance/LEAN-EVAL-LICENSE are preserved. Independent fresh source-only verification against unchanged official benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: completed lake test, exit 0, Nanoda and Lean default kernel acceptance. All 18 submitted Lean sources, protected files, pinned tools and 8,116 tracked Lean Pool files remained unchanged. Receipt SHA256: ef917665fdb7e09fe5c71955562ba87c0f1abbeacb938f7f2f99f8b73fe40e02. Exact Git archive discovery/overlay and remote byte readback passed. Hosted acceptance is not yet claimed. Private, with no current publication plan; no publication dates.

Bounded gaps between primes
zhang_bounded_prime_gaps

Verso theorem preview

theorem declaration uses `sorry`zhang_bounded_prime_gaps : ∀ n : ℕ, ∃ p q : ℕ, n ≤ p ∧ p.Prime ∧ q.Prime ∧ p < q ∧ q - p ≤ 246 := ⊢ ∀ (n : ℕ), ∃ p q, n ≤ p ∧ Nat.Prime p ∧ Nat.Prime q ∧ p < q ∧ q - p ≤ 246 All goals completed! 🐙
#44
How produced

Contributor tags: @ma4ypic4y, @haskiindahouse. Submitter: ma4ypic4y. Problem: zhang_bounded_prime_gaps, statement revision 1. Leaderboard system: max gp (GPT-6). Production model declared by the submitting owner: gpt 6.1 sol (gpt-6.1-sol). This is the owner's updated model attribution supplied on 2026-10-06; it supersedes the earlier model label in the snapshot documentation. The original snapshot documentation is retained for provenance. Human direction included selecting the targets and authorizing this private submission. New private submission; no previous submission or accepted result was found for this exact snapshot. Declared reuse: ports AxiomMath/PrimeGapsLib (`1faa7b14e82ddebc2772dfb9153922f01b106477`), kimihiro64/bombieri-vinogradov (`7a1748306e026825ed6a5555516cc2f28989b2ac`), kimihiro64/PrimeNumberTheoremAnd (`0f15a38c619298b5cd786d39a84dd4bb8997324c`, a fork of AlexKontorovich/PrimeNumberTheoremAnd) and three NicolasLandau files of kimihiro64/Robin1984 (`acab1a31f31e0499518a4416b63281e0b4838f9c`), all Apache-2.0, with module renames and provenance comments (no statement changes); license texts are kept under `Submission/{PrimeGaps,BV,PNT,Robin}/License.lean`. The PrimeGapsLib Gap246 certificate is embedded as a Lean string, and the bridge to the LeanEval statement (`ZhangBridge.bounded_prime_gaps_of_BV`) was written in this campaign by campaign agents. Original full-proof authorship is not claimed. The bundled VERIFICATION.json reports fresh source-only local acceptance by the unchanged official LeanEval comparator, both Nanoda and the Lean kernel, against benchmark 0e093293afbe96be91504ae6e44947876d3fc84e (receipt 5377c39ec0a14c7f846e3881947f7a18). All 1289 submitted Lean source hashes were checked against that receipt. Packaging, single-target discovery and overlay were rechecked using the official evaluator at fc878f28cb84abae21200482d12c11b95255c92b and current benchmark 2e58dff1c3d3aa934614d46205e8f430f9a7ca7e, preserving all protected benchmark files. The current benchmark has a newer WorkspaceTest harness; the bundled receipt predates that change. This preflight does not repeat Lean/Nanoda verification and is not a claim of hosted acceptance. Publication status: Private, with no current publication plan; no publication dates. Original licenses and author notices are retained.

Martinet's asymptotically-good totally real towers
martinet_totally_real_towers

Verso theorem preview

theorem declaration uses `sorry`exists_totallyReal_discr_le : ∃ C : ℝ, 0 < C ∧ ∀ N : ℕ, ∃ d : ℕ, N ≤ d ∧ ∃ (K : Type) (_ : Field K) (_ : NumberField K) (_ : NumberField.IsTotallyReal K), Module.finrank ℚ K = d ∧ |(NumberField.discr K : ℝ)| ≤ C ^ d := ⊢ ∃ C, 0 < C ∧ ∀ (N : ℕ), ∃ d, N ≤ d ∧ ∃ K x, ∃ (x_1 : NumberField K) (_ : IsTotallyReal K), Module.finrank ℚ K = d ∧ |↑(discr K)| ≤ C ^ d All goals completed! 🐙
#45
How produced

Contributor tags: @ma4ypic4y, @haskiindahouse. Submitter: ma4ypic4y. Problem: martinet_totally_real_towers, statement revision 1. The declared model/system name max gp (GPT-6) is our existing GPT-6-family system label. This proof comes from the formalization-evaluation campaign via Codex CLI; the supplied provenance records backend: gpt-6.1-sol / medium. Campaign contributor: @haskiindahouse. Human direction included selecting the campaign targets and authorizing this private submission. Declared reuse: adapts the existing public Apache-2.0 formalization https://github.com/n-yamaguchi-0729/SawinTotallyRealTowers at `b9cfda0ccad0175e215a212ab218bc51d101380f`. The campaign performed the benchmark adapter and minimal compatibility changes (1605 upstream modules preserved). Original full-proof authorship is not claimed; original declarations, headers and notices are retained. The bundled VERIFICATION.json records fresh source-only official local verification with the unchanged LeanEval comparator, both Nanoda and the Lean kernel accepted, against benchmark 0e093293afbe96be91504ae6e44947876d3fc84e, Lean v4.35.0-rc3 and pinned dependencies. Receipt: 83119bd314fb483c982adb700d365581. All 1608 submitted Lean source hashes were independently checked against that bundled receipt after downloading this exact GitHub commit archive. Server workspace discovery and overlay were checked using the unmodified evaluator at 6164cacbef4207b5c8d895e89ac58e4bb9bb23e3; the protected benchmark files remain unchanged. These archive/packaging checks do not repeat the Lean proof run, and the bundled local PASS is not a claim of organizer acceptance or leaderboard credit. Publication status: private, with no current publication plan and no publication date. No public release of the submitted source is authorized by this submission. Original source notices and provenance are retained. Only this exact problem snapshot is submitted through the currently documented GitHub issue intake.

Shafarevich's relation-rank bound
shafarevich_relation_rank_bound

Verso theorem preview

theorem declaration uses `sorry`shafarevich_relation_rank_bound (F : Type) [Field F] [NumberField F] (p : ℕ) [Fact p.Prime] (_hpOdd : Odd p) : LeanEval.NumberTheory.H2Finite p (MaxUnramifiedProPGaloisGroup F p) ∧ (open Classical in relationRank p (MaxUnramifiedProPGaloisGroup F p) ≤ generatorRank (MaxUnramifiedProPGaloisGroup F p) + (NumberField.InfinitePlace.nrRealPlaces F + NumberField.InfinitePlace.nrComplexPlaces F - 1) + (if ∃ ζ : F, IsPrimitiveRoot ζ p then 1 else 0)) := F:Typeinst✝²:Field Finst✝¹:NumberField Fp:ℕinst✝:Fact (Nat.Prime p)_hpOdd:Odd p⊢ H2Finite p (MaxUnramifiedProPGaloisGroup F p) ∧ relationRank p (MaxUnramifiedProPGaloisGroup F p) ≤ generatorRank (MaxUnramifiedProPGaloisGroup F p) + (InfinitePlace.nrRealPlaces F + InfinitePlace.nrComplexPlaces F - 1) + if ∃ ζ, IsPrimitiveRoot ζ p then 1 else 0 All goals completed! 🐙
#46
How produced

Contributor tags: @ma4ypic4y, @haskiindahouse. Submitter: ma4ypic4y. Problem: shafarevich_relation_rank_bound, statement revision 1. The declared model/system name max gp (GPT-6) is our existing GPT-6-family system label. This proof comes from the formalization-evaluation campaign via Codex CLI; the supplied provenance records backend: gpt-6.1-sol / medium. Campaign contributor: @haskiindahouse. Human direction included selecting the campaign targets and authorizing this private submission. Declared reuse: adapts the existing public Apache-2.0 formalization https://github.com/n-yamaguchi-0729/SawinTotallyRealTowers at `6db7120fa2e15346e3b0a9995666a37849235de1`. The campaign performed the exact benchmark adapter over the public ShafarevichRelationRankBound (1286-module closure) and compatibility repairs. Original full-proof authorship is not claimed; original declarations, headers and notices are retained. The bundled VERIFICATION.json records fresh source-only official local verification with the unchanged LeanEval comparator, both Nanoda and the Lean kernel accepted, against benchmark 0e093293afbe96be91504ae6e44947876d3fc84e, Lean v4.35.0-rc3 and pinned dependencies. Receipt: 3796160d0a1a4f599093dfc84508de0a. All 1289 submitted Lean source hashes were independently checked against that bundled receipt after downloading this exact GitHub commit archive. Server workspace discovery and overlay were checked using the unmodified evaluator at 6164cacbef4207b5c8d895e89ac58e4bb9bb23e3; the protected benchmark files remain unchanged. These archive/packaging checks do not repeat the Lean proof run, and the bundled local PASS is not a claim of organizer acceptance or leaderboard credit. Publication status: private, with no current publication plan and no publication date. No public release of the submitted source is authorized by this submission. Original source notices and provenance are retained. Only this exact problem snapshot is submitted through the currently documented GitHub issue intake.

Lagarias criterion is equivalent to RH
riemann_hypothesis_iff_lagarias_elementary_criterion

Verso theorem preview

theorem declaration uses `sorry`riemann_hypothesis_iff_lagarias_elementary_criterion : RiemannHypothesis ↔ LeanEval.NumberTheory.LagariasElementaryCriterion := ⊢ RiemannHypothesis ↔ LagariasElementaryCriterion All goals completed! 🐙
#47
How produced

Contributor tags: @ma4ypic4y, @haskiindahouse. Submitter: ma4ypic4y. Problem: riemann_hypothesis_iff_lagarias_elementary_criterion, statement revision 1. The declared model/system name max gp (GPT-6) is our existing GPT-6-family system label. This proof comes from the formalization-evaluation campaign via Codex CLI; the supplied provenance records backend: gpt-6.1-sol / gpt-6-astra; final assembly job made no model calls. Campaign contributor: @haskiindahouse. Human direction included selecting the campaign targets and authorizing this private submission. Declared reuse: adapts the existing public Apache-2.0 formalization https://github.com/kimihiro64/Robin1984. The campaign performed frozen-pin compatibility work and certificate-computation optimizations (pinned source commit recorded in the campaign records). Original full-proof authorship is not claimed; original declarations, headers and notices are retained. The bundled VERIFICATION.json records fresh source-only official local verification with the unchanged LeanEval comparator, both Nanoda and the Lean kernel accepted, against benchmark 0e093293afbe96be91504ae6e44947876d3fc84e, Lean v4.35.0-rc3 and pinned dependencies. Receipt: cb2f734112344be9b38516169ac9d661. All 584 submitted Lean source hashes were independently checked against that bundled receipt after downloading this exact GitHub commit archive. Server workspace discovery and overlay were checked using the unmodified evaluator at 6164cacbef4207b5c8d895e89ac58e4bb9bb23e3; the protected benchmark files remain unchanged. These archive/packaging checks do not repeat the Lean proof run, and the bundled local PASS is not a claim of organizer acceptance or leaderboard credit. Publication status: private, with no current publication plan and no publication date. No public release of the submitted source is authorized by this submission. Original source notices and provenance are retained. Only this exact problem snapshot is submitted through the currently documented GitHub issue intake.

On the Duffin-Schaeffer conjecture
annals_duffin_schaeffer_conjecture

Verso theorem preview

/-- Statement of Theorem 1: If for `ψ : ℕ → ℝ≥0`, the infinite series `∑ (ψ q * φ q) / q`, where `φ` is the Euler totient function, diverges, then the set `𝒜` defined above has Lebesgue measure `1`. -/ theorem declaration uses `sorry`theorem_1 (ψ : ℕ+ → ℝ≥0) (hdivergence : ¬ Summable fun q ↦ (ψ q * φ q) / q) : MeasurableSet (𝒜 ψ) ∧ volume (𝒜 ψ) = 1 := ψ:ℕ+ → ℝ≥0hdivergence:¬Summable fun q => ψ q * ↑(φ ↑q) / ↑↑q⊢ MeasurableSet (𝒜 ψ) ∧ volume (𝒜 ψ) = 1 All goals completed! 🐙
/-- Statement of Theorem 2(a): Let `ψ : ℕ → ℝ≥0`, `𝒦` and `ψ⋆` be as above. Then, if `∑ ψ⋆ (q)` converges, `𝒦` has Lebesgue measure `0`. -/ theorem declaration uses `sorry`theorem_2_a (ψ : ℕ+ → ℝ≥0) (hψ : ∑' q, ψ_star ψ q < ∞) : MeasurableSet (𝒦 ψ) ∧ volume (𝒦 ψ) = 0 := ψ:ℕ+ → ℝ≥0hψ:∑' (q : ℕ+), ψ_star ψ q < ∞⊢ MeasurableSet (𝒦 ψ) ∧ volume (𝒦 ψ) = 0 All goals completed! 🐙
/-- Statement of Theorem 2(b): Let `ψ : ℕ → ℝ≥0`, `𝒦` and `ψ⋆` be as above. Then, if `∑ ψ⋆ (q)` diverges, `𝒦` has Lebesgue measure `1`. -/ theorem declaration uses `sorry`theorem_2_b (ψ : ℕ+ → ℝ≥0) (hψ : ∑' q, ψ_star ψ q = ∞) : MeasurableSet (𝒦 ψ) ∧ volume (𝒦 ψ) = 1 := ψ:ℕ+ → ℝ≥0hψ:∑' (q : ℕ+), ψ_star ψ q = ∞⊢ MeasurableSet (𝒦 ψ) ∧ volume (𝒦 ψ) = 1 All goals completed! 🐙
/-- Statement of Corollary 3: For a function `ψ : ℕ → [0, 1/2]`, the set `𝒜` and the element `s` defined as above, the Hausdorff dimension of `𝒜` is the minimum of `s` and `1`. -/ theorem declaration uses `sorry`corollary_3 (ψ : ℕ+ → ℝ≥0) (hψ : ∀ n, ψ n ∈ Set.Icc 0 (1 / 2)) : dimH (𝒜 ψ) = min (s_inf ψ) 1 := ψ:ℕ+ → ℝ≥0hψ:∀ (n : ℕ+), ψ n ∈ Set.Icc 0 (1 / 2)⊢ dimH (𝒜 ψ) = ↑(min (s_inf ψ) 1) All goals completed! 🐙
#48
How produced

Credits: @ma4ypic4y, @haskiindahouse. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original Claude Opus 5.5 attribution retained in the source documentation; the historical runtime attribution has not been independently verified. Human direction included target selection and authorization of this private submission. Independent fresh source-only verification against unchanged official benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: completed lake test, exit 0, Nanoda and Lean default kernel acceptance. All 32 submitted Lean sources, protected files, pinned tools and 8,116 tracked Lean Pool files remained unchanged. Receipt SHA256: afe7f254e886a6f55f0d2e0cd9b61dcc3e138c1c41286b2a3c44ffa84dcb9ccc. Exact Git archive discovery/overlay and remote byte readback passed. Hosted acceptance is not yet claimed. Private, with no current publication plan; no publication dates.

Flat Littlewood polynomials exist
annals_flat_littlewood_poly

Verso theorem preview

theorem declaration uses `sorry`theorem_1_1 : ∃ Δ δ : ℝ, Δ > δ ∧ δ > 0 ∧ ∀ n ≥ 2, ∃ P : ℂ[X], FlatLittlewoodPoly.IsLittlewoodPolynomial P ∧ P.natDegree = n ∧ ∀ z : ℂ, ‖z‖ = 1 → δ * √n ≤ ‖P.eval z‖ ∧ ‖P.eval z‖ ≤ Δ * √n := ⊢ ∃ Δ δ, Δ > δ ∧ δ > 0 ∧ ∀ n ≥ 2, ∃ P, IsLittlewoodPolynomial P ∧ P.natDegree = n ∧ ∀ (z : ℂ), ‖z‖ = 1 → δ * √↑n ≤ ‖Polynomial.eval z P‖ ∧ ‖Polynomial.eval z P‖ ≤ Δ * √↑n All goals completed! 🐙
#49
How produced

Credits: @ma4ypic4y, @haskiindahouse. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original Claude Opus 5.5 attribution retained in the source documentation; the historical runtime attribution has not been independently verified. Human direction included target selection and authorization of this private submission. Original provenance is retained in PROVENANCE.json, including campaign source commit 734b5f9be0478177fc39c1dff50befad1d2cc56e. The package adapts Gabriel Dahia’s Komlos proof modules from Vilin97/lean-pool@e9d53e9cbcff8dfd0cc816ba94db7a26b082929f (LeanPool/Komlos), originally https://github.com/gdahia/Komlos. This is disclosed library reuse; original authorship, Apache-2.0 license, per-file notices and Submission/Komlos/License.lean provenance are preserved. Adaptations include local import paths and module syntax. The official benchmark license, root statement/template notices, dependency authorship and provenance/LEAN-EVAL-LICENSE are preserved. Independent fresh source-only verification against unchanged official benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: completed lake test, exit 0, Nanoda and Lean default kernel acceptance. All 40 submitted Lean sources, protected files, pinned tools and 8,116 tracked Lean Pool files remained unchanged. Receipt SHA256: 045039754a730a95263fe5d8cc839750f7582aa7150c8b0ac84220f40fc0d452. Exact Git archive discovery/overlay and remote byte readback passed. Hosted acceptance is not yet claimed. Private, with no current publication plan; no publication dates.

Vinogradov mean value theorem
vinogradov_mean_value

Verso theorem preview

theorem declaration uses `sorry`vinogradov_mean_value (s k : ℕ) (ε : ℝ) (hε : 0 < ε) : LeanEval.NumberTheory.VinogradovMeanValue.J s k =O[Filter.atTop] fun X ↦ (X ^ (s + ε) + X ^ ((2 * s : ℝ) - k * (k + 1) / 2 + ε) : ℝ) := s:ℕk:ℕε:ℝhε:0 < ε⊢ J s k =O[Filter.atTop] fun X => ↑X ^ (↑s + ε) + ↑X ^ (2 * ↑s - ↑k * (↑k + 1) / 2 + ε) All goals completed! 🐙
#50
How produced

Credits: @ma4ypic4y, @haskiindahouse. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original Claude Opus 5.5 attribution retained in the source documentation; the historical runtime attribution has not been independently verified. Human direction included target selection and authorization of this private submission. Original provenance is retained in PROVENANCE.json, including campaign source commit dafef644ca67e235083375f95c27f21b60a7c584. The package declares no third-party proof source reuse. The official benchmark license, root statement/template notices, dependency authorship and provenance/LEAN-EVAL-LICENSE are preserved. Independent fresh source-only verification against unchanged official benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: completed lake test, exit 0, Nanoda and Lean default kernel acceptance. All 18 submitted Lean sources, protected files, pinned tools and 8,116 tracked Lean Pool files remained unchanged. Receipt SHA256: 2105938367dd477002296dcd2119acd7559eea0333ff091e64d5ddb24eff1325. Exact Git archive discovery/overlay and remote byte readback passed. Hosted acceptance is not yet claimed. Private, with no current publication plan; no publication dates.

Pseudorandom sets in Grassmann graph have near-perfect expansion
annals_pseudorandom_grassmann

Verso theorem preview

theorem declaration uses `sorry`theorem_1_12 (α : ℝ) (hα : α ∈ Set.Ioo 0 1) : ∃ ε > 0, ∃ r, ∀ᶠ (ℓ : ℕ) (k : ℕ) in atTop, ∀ S : Finset (PseudorandomGrassmann.GrVertex k ℓ), (hS : S.Nonempty) → 2 * #S ≤ Fintype.card (PseudorandomGrassmann.GrVertex k ℓ) → Φ (PseudorandomGrassmann.Gr k ℓ) S hS ≤ α → ∃ (A B : Submodule 𝔽₂ (Fin k → 𝔽₂)), A ≤ B ∧ letI a := finrank 𝔽₂ A; letI b := k - finrank 𝔽₂ B a + b ≤ r ∧ #(S ∩ SubGr k ℓ A B) / #(SubGr k ℓ A B) ≥ (ε : ℝ) := α:ℝhα:α ∈ Set.Ioo 0 1⊢ ∃ ε > 0, ∃ r, ∀ᶠ (ℓ : ℕ) (k : ℕ) in atTop, ∀ (S : Finset (GrVertex k ℓ)) (hS : S.Nonempty), 2 * #S ≤ Fintype.card (GrVertex k ℓ) → ↑(Φ (Gr k ℓ) S hS) ≤ α → ∃ A B, A ≤ B ∧ finrank 𝔽₂ ↥A + (k - finrank 𝔽₂ ↥B) ≤ r ∧ ↑(#(S ∩ SubGr k ℓ A B)) / ↑(#(SubGr k ℓ A B)) ≥ ε All goals completed! 🐙
#51
How produced

Credits: @ma4ypic4y, @haskiindahouse. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original Claude Opus 5.5 attribution retained in the source documentation; the historical runtime attribution has not been independently verified. Human direction included target selection and authorization of this private submission. Original provenance is retained in PROVENANCE.json, including campaign source commit b1f97d84aa55258dd40e8cb5a4eee12e2a66a5c8. This package adapts work from openai/math at adc7f1241b42e322a6451854ab7e4b4c146bf78a under Apache-2.0; the full license in Submission/OAI/License.lean, original source authorship, per-file attribution and adaptation notices are preserved. This reuse is disclosed as adaptation of existing library proofs, rather than an independently originated proof. Official benchmark template and dependency authorship are retained. Independent fresh source-only verification against unchanged official benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: completed lake test, exit 0, Nanoda and Lean default kernel acceptance. All 68 submitted Lean sources, protected files, pinned tools and 8,116 tracked Lean Pool files remained unchanged. Receipt SHA256: b08cdd4ef060440f2d54d6152773aee7655cb479ea36c002329d6e1e87878112. Exact Git archive discovery/overlay and remote byte readback passed. Hosted acceptance is not yet claimed. Private, with no current publication plan; no publication dates.

Schmidt's subspace theorem
schmidt_subspace

Verso theorem preview

theorem declaration uses `sorry`schmidt_subspace (σ : Type*) [Fintype σ] (hσ : 2 ≤ Fintype.card σ) (L : σ → σ → ℂ) (alg : ∀ i j, IsAlgebraic ℚ (L i j)) (ind : LinearIndependent ℂ L) (ε : ℝ) (pos : 0 < ε) : ∃ s : Finset (σ → ℤ), 0 ∉ s ∧ ∀ x : σ → ℤ, ‖∏ i, ∑ j, L i j * x j‖ < ‖x‖ ^ (-ε) → ∃ c ∈ s, ∑ i, c i * x i = 0 := σ:Type u_1inst✝:Fintype σhσ:2 ≤ Fintype.card σL:σ → σ → ℂalg:∀ (i j : σ), IsAlgebraic ℚ (L i j)ind:LinearIndependent ℂ Lε:ℝpos:0 < ε⊢ ∃ s, 0 ∉ s ∧ ∀ (x : σ → ℤ), ‖∏ i, ∑ j, L i j * ↑(x j)‖ < ‖x‖ ^ (-ε) → ∃ c ∈ s, ∑ i, c i * x i = 0 All goals completed! 🐙
#52
How produced

Contributor tags: @ma4ypic4y, @haskiindahouse. Submitter: ma4ypic4y. Problem: schmidt_subspace, statement revision 1. Leaderboard system: max gp (GPT-6). Production model declared by the submitting owner: gpt 6.1 sol (gpt-6.1-sol). This is the owner's updated model attribution supplied on 2026-10-06; it supersedes the earlier model label in the snapshot documentation. The original snapshot documentation is retained for provenance. Human direction included selecting the target and authorizing this private submission. Declared reuse: the package vendors rwst/Subspace-Theorems at d12aa25a9725e8d28c1bfc018c664b7ceb8d35c5 (Apache-2.0, Ralf Stephan), with local module imports prefixed by Submission.Donor. The campaign bridge specializes the donor number-field subspace theorem to the benchmark statement over integer vectors, passing through the number field generated by the algebraic coefficients and converting proper rational subspaces to integer normal vectors. Original authorship of the donor subspace theorem proof is not claimed. Original licenses, author notices, and provenance are retained. The bundled VERIFICATION.json records official_verified=true against benchmark 0e093293afbe96be91504ae6e44947876d3fc84e and verifier revision d03acab154d269c06e60e4de7e4cc85deebff94b; it records service_accepted=false. All 133 submitted Lean source hashes were independently checked against its source map. Packaging, single-target discovery and overlay were rechecked using the official evaluator at 790cf703a88f7d592d1eeecfc75f747c54f017c2 and benchmark 2e58dff1c3d3aa934614d46205e8f430f9a7ca7e, preserving all protected benchmark files. This submission preflight did not rerun Lean/Nanoda or independently inspect the receipt/log whose hashes are recorded in VERIFICATION.json. Hosted acceptance remains pending. Publication status: Private, with no current publication plan; no publication dates.

Uniformization theorem for Riemann surfaces
uniformization

Verso theorem preview

theorem declaration uses `sorry`uniformization {X : Type*} [TopologicalSpace X] [T2Space X] [ConnectedSpace X] [SecondCountableTopology X] [ChartedSpace ℂ X] [IsManifold mℂ 1 X] (hX : ¬ CompactSpace X) (x : X) [Subsingleton <| Additive (FundamentalGroup X x) →+ ℝ] : Nonempty (X ≃ₘ⟮mℂ, mℂ⟯ ℂ) ∨ Nonempty (X ≃ₘ⟮mℂ, mℂ⟯ UpperHalfPlane) := X:Type u_1inst✝⁶:TopologicalSpace Xinst✝⁵:T2Space Xinst✝⁴:ConnectedSpace Xinst✝³:SecondCountableTopology Xinst✝²:ChartedSpace ℂ Xinst✝¹:IsManifold mℂ 1 XhX:¬CompactSpace Xx:Xinst✝:Subsingleton (Additive (FundamentalGroup X x) →+ ℝ)⊢ Nonempty (X ≃ₘ⟮mℂ, mℂ⟯ ℂ) ∨ Nonempty (X ≃ₘ⟮mℂ, mℂ⟯ UpperHalfPlane) All goals completed! 🐙
#53
How produced

Contributor tags: @ma4ypic4y, @haskiindahouse. Submitter: ma4ypic4y. Problem: uniformization, statement revision 1. Leaderboard system: max gp (GPT-6). Production model declared by the submitting owner: gpt 6.1 sol (gpt-6.1-sol). This is the owner's updated model attribution supplied on 2026-10-06; it supersedes the earlier model label in the snapshot documentation. The original snapshot documentation is retained for provenance. Human direction included selecting the targets and authorizing this private submission. New private submission; no previous submission or accepted result was found for this exact snapshot. Declared reuse with substantial campaign code: vendors RiemannDynamics (https://github.com/will1491/RiemannDynamics @ `b3fa37cc0f18a23ea66b654ea3f73eb472129010`, Apache-2.0, Will (Ziang) Li; 43 modules under `Submission/RD`) and RMT4 (Vincent Beffara, Apache-2.0, via Lean Pool @ `e9d53e9cbcff8dfd0cc816ba94db7a26b082929f`, under `Submission/RMT`) with renames and provenance headers. The official statement assumes only Hom(pi_1, R) = 0 rather than simple connectivity; the library's three simply-connectedness steps were generalized in this campaign (new code `Submission/UN/**`; adapted library files carry a 'Modified for LeanEval' note), and the bridge to the LeanEval statement was written by campaign agents. Original authorship of the library's uniformization argument is not claimed. The bundled VERIFICATION.json reports fresh source-only local acceptance by the unchanged official LeanEval comparator, both Nanoda and the Lean kernel, against benchmark 0e093293afbe96be91504ae6e44947876d3fc84e (receipt 10bb63d1f8ad4ab8b40821ffa1dbb595). All 72 submitted Lean source hashes were checked against that receipt. Packaging, single-target discovery and overlay were rechecked using the official evaluator at fc878f28cb84abae21200482d12c11b95255c92b and current benchmark 2e58dff1c3d3aa934614d46205e8f430f9a7ca7e, preserving all protected benchmark files. The current benchmark has a newer WorkspaceTest harness; the bundled receipt predates that change. This preflight does not repeat Lean/Nanoda verification and is not a claim of hosted acceptance. Publication status: Private, with no current publication plan; no publication dates. Original licenses and author notices are retained.

Lorentzian polynomials
annals_lorentzian_polynomials

Verso theorem preview

theorem declaration uses `sorry`theorem_2_25 (n d : ℕ) (hn : 0 < n) : closure (Ŀ n d) = LorentzianPolynomials.L n d := n:ℕd:ℕhn:0 < n⊢ closure (Ŀ n d) = L n d All goals completed! 🐙
#54
How produced

Contributor tags: @ma4ypic4y, @haskiindahouse. Submitter: ma4ypic4y. Problem: annals_lorentzian_polynomials, statement revision 1. The declared model/system name max gp (GPT-6) is our existing GPT-6-family system label. This proof comes from the formalization-evaluation campaign via Codex CLI; the supplied provenance records backend: gpt-6.1-sol / gpt-6-astra; final assembly job made no model calls. Campaign contributor: @haskiindahouse. Human direction included selecting the campaign targets and authorizing this private submission. Original campaign proof: the Lean proof code was generated in this campaign (machine-assisted, Codex CLI) and assembled over the pinned Apache-2.0 Lean Pool library (Vilin97/lean-pool @ e9d53e9cbcff8dfd0cc816ba94db7a26b082929f (Apache-2.0)); deterministic assembly of independently kernel-compiled campaign-generated proofs; no external theorem code. Statement headers and mathematics remain attributed to their original authors. The bundled VERIFICATION.json records fresh source-only official local verification with the unchanged LeanEval comparator, both Nanoda and the Lean kernel accepted, against benchmark 0e093293afbe96be91504ae6e44947876d3fc84e, Lean v4.35.0-rc3 and pinned dependencies. Receipt: a9ebc0e9792845248c1fc1b03e46077b. All 17 submitted Lean source hashes were independently checked against that bundled receipt after downloading this exact GitHub commit archive. Server workspace discovery and overlay were checked using the unmodified evaluator at 6164cacbef4207b5c8d895e89ac58e4bb9bb23e3; the protected benchmark files remain unchanged. These archive/packaging checks do not repeat the Lean proof run, and the bundled local PASS is not a claim of organizer acceptance or leaderboard credit. Publication status: private, with no current publication plan and no publication date. No public release of the submitted source is authorized by this submission. Original source notices and provenance are retained. Only this exact problem snapshot is submitted through the currently documented GitHub issue intake.

Chen's theorem
chen_theorem

Verso theorem preview

theorem declaration uses `sorry`chen_theorem : {p : ℕ | p.Prime ∧ LeanEval.NumberTheory.ChenTheorem.HasAtMostTwoPrimeFactors (p + 2)}.Infinite := ⊢ {p | Nat.Prime p ∧ HasAtMostTwoPrimeFactors (p + 2)}.Infinite All goals completed! 🐙
#55
How produced

Credits: @ma4ypic4y and @haskiindahouse. The source README and PROVENANCE.json identify Claude Opus 5.5 as the original campaign provenance. For this leaderboard entry, the owner declares a corrected model attribution: max gp (GPT-6), described as gpt 6.1 sol (gpt-6.1-sol). The historical runtime attribution has not been independently verified; the original provenance remains in the private source package. Completed official source-only verification against benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: lake test exit 0, Nanoda and Lean default kernel acceptance, no prohibited axioms. All 134 submitted Lean sources match the exact Git commit and the full verification receipt; protected files, dependency sources, pins and binaries remained unchanged. Receipt SHA256: eb230db7bde622801da7c143d34e0aa3e07db37ba9b2b7f38b603e10803c24a1. The immutable Git archive, current evaluator discovery and overlay, and GitHub byte readback were checked. Hosted acceptance is not yet claimed. Eight adapted source files retain their Mathlib and Lean Pool authorship and Apache 2.0 notices. Other pinned Mathlib and Lean Pool dependencies retain their authorship and licenses.

A reverse Minkowski theorem
annals_reverse_minkowski

Verso theorem preview

theorem declaration uses `sorry`theorem_1_2 (ℒ : Submodule ℤ ℝⁿ) [DiscreteTopology ℒ] (hℒ : IsZLattice ℝ ℒ) (h : ∀ ℒ' (_hℒℒ' : ℒ' ≤ ℒ) [DiscreteTopology ℒ'], determinant ℒ' ≥ 1) : let t : ℝ := 10 * (log n + 2) ρ (1 / t) ℒ ≤ 3 / 2 := n:ℕℒ:Submodule ℤ ℝⁿinst✝:DiscreteTopology ↥ℒhℒ:IsZLattice ℝ ℒh:∀ ℒ' ≤ ℒ, ∀ [inst : DiscreteTopology ↥ℒ'], determinant ℒ' ≥ 1⊢ let t := 10 * (log ↑n + 2); ρ (1 / t) ℒ ≤ 3 / 2 All goals completed! 🐙
#56
How produced

Credits: @ma4ypic4y, @haskiindahouse. Owner-declared authorship: @ma4ypic4y. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original model attribution retained in source documentation; historical runtime attribution has not been independently verified. Completed official source-only verification against benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: lake test exit 0, Nanoda and Lean default kernel acceptance, no prohibited axioms. All 54 submitted Lean sources match this exact commit; protected files, pins, binaries and dependency sources remained unchanged. Receipt SHA256: aeb1d1a851c03415dd02313eab9f13cdfa443e2e63e14e41af3c478b1330757f. Exact Git archive discovery/overlay preflight and remote byte readback passed. Hosted acceptance is not yet claimed. Permitted dependencies retain original licenses, authorship and notices.

The local-global conjecture for Apollonian circle packings is false
annals_local_global_apollonian_circle_packings

Lean theorem statement

/--
Statement of Theorem 1.6:

The Apollonian circle packing `A` generated by `(−3, 5, 8, 8)` has no square curvatures.
-/
theorem theorem_1_6 : ∀ n, n ^ 2 ∉ curvatureSet ⟦⟨![-3, 5, 8, 8], by decide⟩⟧ := by
  sorry

/--
Statement of Theorem 1.3:

There exist infinitely many `A` for which the number of missing curvatures up to `N` is `Ω(√N)`.
-/
theorem theorem_1_3 : {A : PrimitiveApollonianCirclePacking |
    Real.sqrt =O[Filter.atTop] missingCurvatures A}.Infinite := by
  sorry
#57
How produced

Credits: @ma4ypic4y, @haskiindahouse. Owner-declared authorship: @ma4ypic4y. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original model attribution retained in source documentation; historical runtime attribution has not been independently verified. Completed official source-only verification against benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: lake test exit 0, Nanoda and Lean default kernel acceptance, no prohibited axioms. All 10 submitted Lean sources match this exact commit; protected files, pins, binaries and dependency sources remained unchanged. Receipt SHA256: 0da3ff52f6e81401bff742dd5f71417abbe7bdbf18a185939263327d31545c57. Exact Git archive discovery/overlay preflight and remote byte readback passed. Hosted acceptance is not yet claimed. Permitted dependencies retain original licenses, authorship and notices. Explicitly authorized retry of #2066 after a terminal infrastructure failure; the previous workflow is completed and no accepted result exists for this submission. Recent successful benchmark/tool setup supports retrying; hosted success is not guaranteed.

Green–Tao theorem
green_tao

Verso theorem preview

theorem declaration uses `sorry`green_tao : LeanEval.NumberTheory.ContainsArbitraryAPs {p : ℕ | Nat.Prime p} := ⊢ ContainsArbitraryAPs {p | Nat.Prime p} All goals completed! 🐙
#58
How produced

Credits: @ma4ypic4y, @haskiindahouse. Owner-declared authorship: @ma4ypic4y. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original model attribution retained in source documentation; historical runtime attribution has not been independently verified. Completed official source-only verification against benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: lake test exit 0, Nanoda and Lean default kernel acceptance, no prohibited axioms. All 92 submitted Lean sources match the published commit; protected files, pins, binaries and dependency sources remained unchanged. Receipt SHA256: 417992e1f10213d80fdca27311c14edd231971f07d5620592906f0a8f06691b4. Exact Git archive preflight and remote byte readback passed. Hosted acceptance is not yet claimed. Permitted dependencies retain original licenses, authorship and notices.

Hessian estimates for the sigma-2 equation in dimension four
annals_hessian_estimates

Verso theorem preview

theorem declaration uses `sorry`theorem_1_1 : ∃ C : ℝ≥0∞ → ℝ, ∀ (u : ℝ⁴ → ℝ) (_smooth : ContDiffOn ℝ ∞ u B₁(0)) (_bounded : ‖u‖_C¹(B₁(0)) < (∞ : ℝ≥0∞)) (_positive_branch : ∀ x ∈ B₁(0), (Δ u) x > 0) (_solution : ∀ x ∈ B₁(0), σ₂ (H u B₁(0) x) = 1), ‖H u B₁(0) 0‖_F ≤ C (‖u‖_C¹(B₁(0))) := ⊢ ∃ C, ∀ (u : ℝ⁴ → ℝ), ContDiffOn ℝ ∞ u B₁(0) → ‖u‖_C¹(B₁(0)) < ∞ → (∀ x ∈ B₁(0), Δ u x > 0) → (∀ x ∈ B₁(0), σ₂ (H u B₁(0) x) = 1) → ‖H u B₁(0) 0‖_F ≤ C ‖u‖_C¹(B₁(0)) All goals completed! 🐙
#59
How produced

Credits: @ma4ypic4y, @haskiindahouse. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original Claude Opus 5.5 attribution retained in the source documentation; the historical runtime attribution has not been independently verified. Human direction included target selection and authorization of this private submission. Independent fresh source-only verification against unchanged official benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: completed lake test, exit 0, Nanoda and Lean default kernel acceptance. All 58 submitted Lean sources, protected files, pinned tools and 8,116 tracked Lean Pool files remained unchanged. Receipt SHA256: 75f29035e12646deac9891a62080b4e8f20533dbee71e916babe04b4a71a530c. Exact Git archive discovery/overlay and remote byte readback passed. Hosted acceptance is not yet claimed. Private, with no current publication plan; no publication dates.

Singularity of random Bernoulli matrices
annals_random_bernoulli_matrices

Verso theorem preview

/-- Statement of Theorem A: For every `p ∈ (0, 1/2]` and `ε > 0` there exists `N, C > 0` such that for any `n ≥ N` and any `n × n` random matrix `B` with mutually independent `Bernoulli(p)` entries, `P(σ_min (B + sIIᵀ) ≤ t/√n) ≤ (1 - p + ε)ⁿ + Ct` for all `s ∈ [-1,0]` and `t > 0`. -/ theorem declaration uses `sorry`theorem_A {p : I} {ε : ℝ} (hp₀ : 0 < p) (hp₁ : (p : ℝ) ≤ 1 / 2) (hε : 0 < ε) : ∃ N > 0, ∃ C > 0, ∀ n ≥ N, ∀ (Ω : Type*) (_mΩ : MeasurableSpace Ω) (P : Measure Ω) (B : Ω → Matrix (Fin n) (Fin n) ℝ) (_B_indep : iIndepFun (fun x : Fin n × Fin n ↦ (B · x.1 x.2)) P) (_B_bernoulli : ∀ i j, HasLaw (B · i j) (bernoulliMeasure 1 0 p) P), ∀ s : ℝ, -1 ≤ s ∧ s ≤ 0 → ∀ t : ℝ, 0 < t → P.real {ω : Ω | σ_min (B ω + of (fun _ _ ↦ s)) ≤ t / √n} ≤ (1 - p + ε) ^ n + C * t := p:↑Iε:ℝhp₀:0 < php₁:↑p ≤ 1 / 2hε:0 < ε⊢ ∃ N > 0, ∃ C > 0, ∀ n ≥ N, ∀ (Ω : Type u_1) (_mΩ : MeasurableSpace Ω) (P : Measure Ω) (B : Ω → Matrix (Fin n) (Fin n) ℝ), iIndepFun (fun x x_1 => B x_1 x.1 x.2) P → (∀ (i j : Fin n), HasLaw (fun x => B x i j) Ber(1, 0, p) P) → ∀ (s : ℝ), -1 ≤ s ∧ s ≤ 0 → ∀ (t : ℝ), 0 < t → P.real {ω | σ_min (B ω + of fun x x_1 => s) ≤ t / √↑n} ≤ (1 - ↑p + ε) ^ n + C * t All goals completed! 🐙
/-- This (unnamed) corollary appears directly below Theorem A in the paper: For every `p ∈ (0, 1/2]` and any sequence `Bₙ` of `n × n` random matrices with mutually independent `Bernoulli(p)` entries we have that `P(Bₙ is singular) = (1 - p + oₙ(1))ⁿ`. -/ theorem declaration uses `sorry`corollary_1 {p : I} (hp₀ : 0 < p) (hp₁ : (p : ℝ) ≤ 1 / 2) {Ω : ℕ → Type*} [mΩ : ∀ n, MeasurableSpace (Ω n)] {P : (n : ℕ) → Measure (Ω n)} {B : (n : ℕ) → Ω n → Matrix (Fin n) (Fin n) ℝ} (B_indep : ∀ n, iIndepFun (fun x : Fin n × Fin n ↦ (B n · x.1 x.2)) (P n)) (B_bernoulli : ∀ n i j, HasLaw (B n · i j) (bernoulliMeasure 1 0 p) (P n)) : ∃ o : ℕ → ℝ, o =o[atTop] (1 : ℕ → ℝ) ∧ ∀ n > 0, (P n).real {ω | (B n ω).det = 0} = (1 - p + o n) ^ n := p:↑Ihp₀:0 < php₁:↑p ≤ 1 / 2Ω:ℕ → Type u_1mΩ:(n : ℕ) → MeasurableSpace (Ω n)P:(n : ℕ) → Measure (Ω n)B:(n : ℕ) → Ω n → Matrix (Fin n) (Fin n) ℝB_indep:∀ (n : ℕ), iIndepFun (fun x x_1 => B n x_1 x.1 x.2) (P n)B_bernoulli:∀ (n : ℕ) (i j : Fin n), HasLaw (fun x => B n x i j) Ber(1, 0, p) (P n)⊢ ∃ o, o =o[atTop] 1 ∧ ∀ n > 0, (P n).real {ω | (B n ω).det = 0} = (1 - ↑p + o n) ^ n All goals completed! 🐙
/-- This is the result stated in the paper's abstract: For any sequence `Mₙ` of `n × n` random matrices with mutually independent `Rademacher` entries we have that `P(Mₙ is singular) = (1/2 + oₙ(1))ⁿ`. -/ theorem declaration uses `sorry`corollary_2 {Ω : ℕ → Type*} (mΩ : ∀ n, MeasurableSpace (Ω n)) {P : (n : ℕ) → Measure (Ω n)} {M : (n : ℕ) → Ω n → Matrix (Fin n) (Fin n) ℝ} (M_indep : ∀ n, iIndepFun (fun x : Fin n × Fin n ↦ (M n · x.1 x.2)) (P n)) (M_rademacher : ∀ n i j, HasLaw (M n · i j) rademacherMeasure (P n)) : ∃ o : ℕ → ℝ, o =o[atTop] (1 : ℕ → ℝ) ∧ ∀ n > 0, (P n).real {ω | (M n ω).det = 0} = (1 / 2 + o n) ^ n := Ω:ℕ → Type u_1mΩ:(n : ℕ) → MeasurableSpace (Ω n)P:(n : ℕ) → Measure (Ω n)M:(n : ℕ) → Ω n → Matrix (Fin n) (Fin n) ℝM_indep:∀ (n : ℕ), iIndepFun (fun x x_1 => M n x_1 x.1 x.2) (P n)M_rademacher:∀ (n : ℕ) (i j : Fin n), HasLaw (fun x => M n x i j) rademacherMeasure (P n)⊢ ∃ o, o =o[atTop] 1 ∧ ∀ n > 0, (P n).real {ω | (M n ω).det = 0} = (1 / 2 + o n) ^ n All goals completed! 🐙
#60
How produced

Credits: @ma4ypic4y, @haskiindahouse. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original Claude Opus 5.5 attribution retained in the source documentation; the historical runtime attribution has not been independently verified. Human direction included target selection and authorization of this private submission. Independent fresh source-only verification against unchanged official benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: completed lake test, exit 0, Nanoda and Lean default kernel acceptance. All 54 submitted Lean sources, protected files, pinned tools and 8,116 tracked Lean Pool files remained unchanged. Receipt SHA256: a98ed4a32eae58c5f8feda594b81e55105667e6c03d72188a8e77a6e3cb630e1. Exact Git archive discovery/overlay and remote byte readback passed. Hosted acceptance is not yet claimed. Private, with no current publication plan; no publication dates.

Hadwiger's theorem
hadwiger

Verso theorem preview

theorem declaration uses `sorry`hadwiger (n : ℕ) : Module.finrank ℝ (valuations n) = n + 1 := n:ℕ⊢ Module.finrank ℝ ↥(valuations n) = n + 1 All goals completed! 🐙
#61
How produced

Credits: @ma4ypic4y, @haskiindahouse. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original Claude Opus 5.5 attribution retained in the source documentation; the historical runtime attribution has not been independently verified. Human direction included target selection and authorization of this private submission. Independent fresh source-only verification against unchanged official benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: completed lake test, exit 0, Nanoda and Lean default kernel acceptance. All 39 submitted Lean sources, protected files, pinned tools and 8,116 tracked Lean Pool files remained unchanged. Receipt SHA256: 5306afa7198c06d29d14b5aad6c5d2b3c0ef42dd13429602825eb00928d4641d. Exact Git archive discovery/overlay and remote byte readback passed. Hosted acceptance is not yet claimed. Private, with no current publication plan; no publication dates.

Rational approximations to linear subspaces
annals_linear_subspaces

Verso theorem preview

theorem declaration uses `sorry`theorem_1 (hd : 2 ≤ d) (l : ℕ) (hl0 : 0 < l) (hld : l < d) (k : ℕ) (hk1 : 1 ≤ k) (hkl : k ≤ l) : (∀ x : Submodule ℝ ℝᵈ, finrank ℝ x = l → LinearSubspaces.diophantineExponent k x ≥ d / (k * (d - l))) ∧ (∃ x : Submodule ℝ ℝᵈ, finrank ℝ x = l ∧ LinearSubspaces.diophantineExponent k x = d / (k * (d - l))) := d:ℕhd:2 ≤ dl:ℕhl0:0 < lhld:l < dk:ℕhk1:1 ≤ khkl:k ≤ l⊢ (∀ (x : Submodule ℝ ℝᵈ), finrank ℝ ↥x = l → diophantineExponent k x ≥ ↑d / (↑k * (↑d - ↑l))) ∧ ∃ x, finrank ℝ ↥x = l ∧ diophantineExponent k x = ↑d / (↑k * (↑d - ↑l)) All goals completed! 🐙
#62
How produced

Credits: @ma4ypic4y, @haskiindahouse. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original Claude Opus 5.5 attribution retained in the source documentation; the historical runtime attribution has not been independently verified. Human direction included target selection and authorization of this private submission. Original provenance is retained in PROVENANCE.json, including campaign source commit 5545be59d27069920da4e719b6fc1f1c2f94ad27. The package declares no third-party proof source reuse. The official benchmark license, root statement/template notices, dependency authorship and provenance/LEAN-EVAL-LICENSE are preserved. Independent fresh source-only verification against unchanged official benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: completed lake test, exit 0, Nanoda and Lean default kernel acceptance. All 24 submitted Lean sources, protected files, pinned tools and 8,116 tracked Lean Pool files remained unchanged. Receipt SHA256: fec11307ec850c3037972b564ea34eb9f5a6c8d73afa79f91036cc300691a36c. Exact Git archive discovery/overlay and remote byte readback passed. Hosted acceptance is not yet claimed. Private, with no current publication plan; no publication dates.

The optimal paper Moebius band
annals_optimal_moebius

Lean theorem statement

/--
Statement of Theorem 1.1 (Main):

A smooth embedded paper Moebius band has aspect ratio greater than `√3`.
-/
theorem theorem_1_1 (a : ℝ) (ha : a > 0) (f : ℝ² → ℝ³) (hf : IsMoebiusEmbedding a f) :
    a > √3 := by
  sorry
#63
How produced

Credits: @ma4ypic4y, @haskiindahouse. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original Claude Opus 5.5 attribution retained in the source documentation; the historical runtime attribution has not been independently verified. Human direction included target selection and authorization of this private submission. Original provenance is retained in PROVENANCE.json, including campaign source commit 992fc52b2be3aae742782982abc49e731b7df370. The package declares no third-party proof source reuse. The official benchmark license, root statement/template notices, dependency authorship and provenance/LEAN-EVAL-LICENSE are preserved. Independent fresh source-only verification against unchanged official benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: completed lake test, exit 0, Nanoda and Lean default kernel acceptance. All 11 submitted Lean sources, protected files, pinned tools and 8,116 tracked Lean Pool files remained unchanged. Receipt SHA256: e6aef9837dcd9df891d29105df10f1a1a56bfc1734ea5244b08f59296582209c. Exact Git archive discovery/overlay and remote byte readback passed. Hosted acceptance is not yet claimed. Private, with no current publication plan; no publication dates.

Duffin-Schaeffer conjecture
duffin_schaeffer

Verso theorem preview

theorem declaration uses `sorry`duffin_schaeffer (δ : ℕ → ℝ) (hδ : ∀ n, 0 ≤ δ n) : volume (addWellApproximable UnitAddCircle δ) = 1 ↔ ¬ Summable fun n : ℕ => n.totient * δ n := δ:ℕ → ℝhδ:∀ (n : ℕ), 0 ≤ δ n⊢ volume (addWellApproximable UnitAddCircle δ) = 1 ↔ ¬Summable fun n => ↑n.totient * δ n All goals completed! 🐙
#64
How produced

Credits: @ma4ypic4y, @haskiindahouse. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original Claude Opus 5.5 attribution retained in the source documentation; the historical runtime attribution has not been independently verified. Human direction included target selection and authorization of this private submission. Original provenance is retained in PROVENANCE.json, including campaign source commit c0275190bd4bdaf108d6c5dc1b7fcd92cde3eebe. The package declares no third-party proof source reuse. The official benchmark license, root statement/template notices, dependency authorship and provenance/LEAN-EVAL-LICENSE are preserved. Independent fresh source-only verification against unchanged official benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: completed lake test, exit 0, Nanoda and Lean default kernel acceptance. All 22 submitted Lean sources, protected files, pinned tools and 8,116 tracked Lean Pool files remained unchanged. Receipt SHA256: 9ab5ebbc3bee6fe535b7e016e2a7090796cb3bd7b316e5b1c46c99ba694e8eb2. Exact Git archive discovery/overlay and remote byte readback passed. Hosted acceptance is not yet claimed. Private, with no current publication plan; no publication dates.

On approximation to a real number by algebraic numbers of bounded degree
annals_on_approximation_of_reals

Lean theorem statement

/--
Statement of Theorem 1.1:

Let `n` be an integer such that `n ≥ 2`. For any transcendental real number `ξ`, we have
`ω⋆_n(ξ) ≥ a * n`, where `a = 1 / (2 - log 2)`.
-/
theorem theorem_1_1 (n : ℕ) (hn : n ≥ 2) (ξ : ℝ) (hξ : Transcendental ℚ ξ) :
    letI a : ℝ := 1 / (2 - Real.log 2)
    (ω⋆ n ξ : EReal) ≥ (a : EReal) * n := by
  sorry
#65
How produced

Credits: @ma4ypic4y, @haskiindahouse. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original Claude Opus 5.5 attribution retained in the source documentation; the historical runtime attribution has not been independently verified. Human direction included target selection and authorization of this private submission. Original provenance is retained in PROVENANCE.json, including campaign source commit cc0de8cf9713e05822935650ea27e79d49e3591b. Submission/Poels/MinkowskiConvex.lean adapts LeanPool/SumsThreeSquares/MinkowskiConvex.lean from Vilin97/lean-pool at e9d53e9cbcff8dfd0cc816ba94db7a26b082929f under Apache-2.0, copyright Bhavik Mehta, Pietro Monticone and Abel Doñate Muñoz. Original authorship and licensing are preserved in the source and Submission/Poels/License.lean; adaptation removes module keywords and renames the namespace. This dependency reuse is disclosed. Official benchmark template, licensing and dependency authorship are retained. Independent fresh source-only verification against unchanged official benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: completed lake test, exit 0, Nanoda and Lean default kernel acceptance. All 19 submitted Lean sources, protected files, pinned tools and 8,116 tracked Lean Pool files remained unchanged. Receipt SHA256: a49b8ef66ab961bdafbee6087a104e4246ae817bc823f4dff51b4c73f88037cd. Exact Git archive discovery/overlay and remote byte readback passed. Hosted acceptance is not yet claimed. Private, with no current publication plan; no publication dates.

A counterexample to the periodic tiling conjecture
annals_periodic_tiling_conjecture

Lean theorem statement

/--
Statement of Theorem 1.4 (Counterexample to Conjecture 1.2, I):

There exists a finite abelian group `G₀` and a finite non-empty `F ⊆ ℤ² × G₀` such that
`F` forms an aperiodic tiling equation.
-/
theorem theorem_1_4 : ∃ (G₀ : Type) (_ : AddCommGroup G₀) (_ : Finite G₀),
    ∃ F : Set (ℤ × ℤ × G₀), F.Finite ∧ F.Nonempty ∧ IsAperiodicTilingEquation F := by
  sorry

/--
Statement of Corollary 1.6 (Counterexample to Conjecture 1.2, II):

For all sufficiently large `d`, there exists a finite non-empty `F ⊆ ℤᵈ` such that
`F` forms an aperiodic tiling equation.
-/
theorem corollary_1_6 : ∀ᶠ d in atTop, ∃ (F : Set (Fin d → ℤ)),
    F.Finite ∧ F.Nonempty ∧ IsAperiodicTilingEquation F := by
  sorry

/--
Statement of Corollary 1.7 (Counterexample to Conjecture 1.3):

For all sufficiently large `d`, there exists a bounded measurable set `σ ⊆ ℝᵈ` of positive
measure such that `σ` forms an aperiodic continuous tiling equation.
-/
theorem corollary_1_7 : ∀ᶠ d in atTop, ∃ σ : Set (Fin d → ℝ), IsBounded σ ∧ MeasurableSet σ ∧
    0 < volume σ ∧ IsAperiodicContinuousTilingEquation σ := by
  sorry
#66
How produced

Credits: @ma4ypic4y, @haskiindahouse. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original Claude Opus 5.5 attribution retained in the source documentation; the historical runtime attribution has not been independently verified. Human direction included target selection and authorization of this private submission. Original provenance is retained in PROVENANCE.json, including campaign source commit 1f225d996a0b30d91c7f94b0a2829a00b1baf4b5. This package adapts openai/math at adc7f1241b42e322a6451854ab7e4b4c146bf78a, directory lean/OAI/Geometry/PeriodicTiling, under Apache-2.0. Original authorship, per-file notices, the full license in Submission/OAI/License.lean and adaptation notices are preserved. This is disclosed reuse of existing library proofs. Official benchmark template copyright David Ledvinka, benchmark licensing and dependency authorship are retained. Independent fresh source-only verification against unchanged official benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: completed lake test, exit 0, Nanoda and Lean default kernel acceptance. All 99 submitted Lean sources, protected files, pinned tools and 8,116 tracked Lean Pool files remained unchanged. Receipt SHA256: 6aeb97c3c7cfced64bf17ee1c93dda2e1e0ea6dbc77636b6d59abd130cd760e4. Exact Git archive discovery/overlay and remote byte readback passed. Hosted acceptance is not yet claimed. Private, with no current publication plan; no publication dates.

Algebraic integers with conjugates in a prescribed distribution
annals_algebraic_integers

Verso theorem preview

theorem declaration uses `sorry`theorem_1_1 : lambda_SSS < 1.89831 := ⊢ lambda_SSS < 1.89831 All goals completed! 🐙
#67
How produced

Credits: @ma4ypic4y, @haskiindahouse. Model: gpt 6.1 sol (gpt-6.1-sol), an owner-declared correction to the original Claude Opus 5.5 attribution retained in the source documentation; the historical runtime attribution has not been independently verified. Human direction included target selection and authorization of this private submission. Original provenance is retained in PROVENANCE.json, including campaign source commit e83c80d89a18d9f2fb97c67d2d0e09beb7725ae5. The package declares no third-party proof source reuse. The official benchmark license, root statement/template notices, dependency authorship and provenance/LEAN-EVAL-LICENSE are preserved. Independent fresh source-only verification against unchanged official benchmark 38361be884302c7edce1908c4aef8296eb2cb27e, statement revision 1: completed lake test, exit 0, Nanoda and Lean default kernel acceptance. All 28 submitted Lean sources, protected files, pinned tools and 8,116 tracked Lean Pool files remained unchanged. Receipt SHA256: 2aaafbc3ed1a534dce3cc3d9222f78fb255acbef021d030b229dd86e580481f0. Exact Git archive discovery/overlay and remote byte readback passed. Hosted acceptance is not yet claimed. Private, with no current publication plan; no publication dates.

On a conjecture of Talagrand on selector processes and a consequence on positive empirical processes
annals_supremum_of_selector_processes

Lean theorem statement

/-- The constant `L` of Theorem 1.2. -/
noncomputable def L₂ : ℝ≥0 := sorry

/-- The constant of Theorem 1.2 is positive. -/
theorem L₂_pos : L₂ > 0 := sorry

/--
Statement of Theorem 1.2:

There exists `L > 0` such that for any `0 < p < 1`, finite type `X`, and set `Λ` of functions from
`X` to `ℝ≥0` such that `0 < 𝔼[sup_{f ∈ Λ} ∑ i ∈ Xp, f i] < ∞`, the collection of sets

`{s ⊆ X | sup_{f ∈ Λ} ∑ i ∈ s, f i ≥ L * 𝔼[sup_{f ∈ Λ} ∑ i ∈ Xp, f i]}`

is `p-small`, where `Xp` is a binomial random subset of `X` with parameter `p`.

Note: The assumption `0 < 𝔼[sup_{f ∈ Λ} ∑ i ∈ Xp, f i] < ∞` is not explicitly stated in the theorem
but used in the last step of the proof where `𝔼 ≥ (L/L') * 𝔼` is a contradiction for `L > L'`.
-/
theorem theorem_1_2 (p : I) (hp₀ : 0 < p) (hp₁ : p < 1) (X : Type*) [Fintype X] (Λ : Set (X → ℝ≥0))
    (hE₀ : 0 < 𝔼⁻[⨆ f ∈ Λ, ∑ i ∈ Xp, (f i : ℝ≥0∞); Xp ∼ binomialSetDistribution X p])
    (hE : 𝔼⁻[⨆ f ∈ Λ, ∑ i ∈ Xp, (f i : ℝ≥0∞); Xp ∼ binomialSetDistribution X p] < ∞) :
    IsSmall p {s : Set X | ⨆ f ∈ Λ, ∑ i ∈ s, (f i : ℝ≥0∞) ≥
        L₂ * 𝔼⁻[⨆ f ∈ Λ, ∑ i ∈ Xp, (f i : ℝ≥0∞); Xp ∼ binomialSetDistribution X p]} := by
  sorry

/-- The constant `L` of Theorem 1.3. -/
noncomputable def L₃ : ℝ≥0 := sorry

/-- The constant of Theorem 1.3 is positive. -/
theorem L₃_pos : L₃ > 0 := sorry

/--
Statement of Theorem 1.3:

There exists `L > 0` such that for any `N > 0`, i.i.d random variables `Y_1, …, Y_N` distributed
according to a Borel probability measure `ν` on a Polish space `𝕋`, if `𝓕` is a finite set of
non-negative functions in `L∞(𝕋)` and `0 < 𝔼[sup_{f ∈ 𝓕} Z Y f] < ∞` then there exists a finite
collection `𝓒` of pairs `(g, t)` where `g : 𝕋 → ℝ≥0`, `t > 0` such that

`{sup_{f ∈ 𝓕} Z N Y f ≥ L * 𝔼[sup_{f ∈ 𝓕} Z N Y f] } ⊆ ⋃ (g,t) ∈ 𝓒, {t ≤ Z N Y g}`

and

`∑ (g,t) ∈ 𝓒, P(t ≤ Z N Y g) ≤ 2⁻¹`.

Note: The requirement that the collection `𝓒` be finite is not explicitly stated in the paper.
However, `𝓒` must at least be assumed to be countable in order for the sum to make sense,
and the collections `𝓒` produced by the proof are indeed finite.

-/
theorem theorem_1_3 (N : ℕ) (N_pos : N > 0) (𝕋 : Type*) (t𝕋 : TopologicalSpace 𝕋)
    (p𝕋 : PolishSpace 𝕋)
    (m𝕋 : MeasurableSpace 𝕋) (b𝕋 : BorelSpace 𝕋) (ν : Measure 𝕋) (hν : IsProbabilityMeasure ν)
    (Ω : Type*) (mΩ : MeasurableSpace Ω) (P : Measure Ω) (Y : Fin N → Ω → 𝕋)
    (Y_indep : iIndepFun Y P) (Y_law_ν : ∀ i, HasLaw (Y i) ν P)
    (𝓕 : Set {f : 𝕋 → ℝ≥0 // Measurable f ∧ MemLp f ∞ ν}) (h𝓕 : Finite 𝓕)
    (hZ₀ : 0 < 𝔼⁻[⨆ f ∈ 𝓕, (Z N Y f ·); P]) (hZ : 𝔼⁻[⨆ f ∈ 𝓕, (Z N Y f ·); P] < ∞) :
    ∃ 𝓒 : Finset ({g : 𝕋 → ℝ≥0 // Measurable g} × {t : ℝ≥0 | t > 0}),
      {ω | ⨆ f ∈ 𝓕, Z N Y f ω ≥ L₃ * 𝔼⁻[⨆ f ∈ 𝓕, (Z N Y f ·); P]} ⊆ ⋃ c ∈ 𝓒, {ω | c.2 ≤ Z N Y c.1 ω}
      ∧ ∑ c : 𝓒, P {ω | c.val.2 ≤ Z N Y c.val.1 ω} ≤ 2⁻¹ := by
  sorry
#68
How produced

Contributor tags: @ma4ypic4y, @haskiindahouse. Submitter: ma4ypic4y. Problem: annals_supremum_of_selector_processes, statement revision 1. Leaderboard system: max gp (GPT-6). Production model declared by the submitting owner: gpt 6.1 sol (gpt-6.1-sol). This is the owner's updated model attribution supplied on 2026-10-06; it supersedes the earlier model label in the snapshot documentation. The original snapshot documentation is retained for provenance. Human direction included selecting the targets and authorizing this private submission. New private submission; no previous submission or accepted result was found for this exact snapshot. Original campaign proof: the Lean proof (8 modules) was generated in this campaign by campaign agents (machine-assisted) from the mathematics of J. Park and H. T. Pham, Ann. of Math. 199(3) 2024 (arXiv:2204.10309); it uses only the pinned Mathlib and vendors no external code. Statement headers and mathematics remain attributed to their original authors. The bundled VERIFICATION.json reports fresh source-only local acceptance by the unchanged official LeanEval comparator, both Nanoda and the Lean kernel, against benchmark 0e093293afbe96be91504ae6e44947876d3fc84e (receipt 9ac95244ae2b46dc837a617d885b816d). All 8 submitted Lean source hashes were checked against that receipt. Packaging, single-target discovery and overlay were rechecked using the official evaluator at fc878f28cb84abae21200482d12c11b95255c92b and current benchmark 2e58dff1c3d3aa934614d46205e8f430f9a7ca7e, preserving all protected benchmark files. The current benchmark has a newer WorkspaceTest harness; the bundled receipt predates that change. This preflight does not repeat Lean/Nanoda verification and is not a claim of hosted acceptance. Publication status: Private, with no current publication plan; no publication dates. Original licenses and author notices are retained.

Generalized topological Poincaré conjecture in dimensions ≥ 5 (Smale)
poincare_high_dim_topological

Verso theorem preview

theorem declaration uses `sorry`poincare_high_dim_topological {n : ℕ} (_h5 : 5 ≤ n) {M : Type*} [TopologicalSpace M] [T2Space M] [ChartedSpace (EuclideanSpace ℝ (Fin n)) M] (_h : M ≃ₕ sphere (0 : EuclideanSpace ℝ (Fin (n + 1))) 1) : Nonempty (M ≃ₜ sphere (0 : EuclideanSpace ℝ (Fin (n + 1))) 1) := n:ℕ_h5:5 ≤ nM:Type u_1inst✝²:TopologicalSpace Minst✝¹:T2Space Minst✝:ChartedSpace (EuclideanSpace ℝ (Fin n)) M_h:M ≃ₕ ↑(sphere 0 1)⊢ Nonempty (M ≃ₜ ↑(sphere 0 1)) All goals completed! 🐙
#69
How produced

Contributor tags: @ma4ypic4y, @haskiindahouse. Submitter: ma4ypic4y. Problem: poincare_high_dim_topological, statement revision 1. The declared model/system name max gp (GPT-6) is our existing GPT-6-family system label. This proof comes from the formalization-evaluation campaign via Codex CLI; the supplied provenance records backend: gpt-6.1-sol / medium. Campaign contributor: @haskiindahouse. Human direction included selecting the campaign targets and authorizing this private submission. Declared reuse: adapts the existing public Apache-2.0 formalization https://github.com/qinz1yang/differential-geometry at `777299070a5529e96345e0033979706fd00c7e62`. The campaign performed import remapping under Submission.DG (236-file closure, full LICENSE/NOTICE in Submission/DG/License.lean), the exact root application and axiom reports. Original full-proof authorship is not claimed; original declarations, headers and notices are retained. The bundled VERIFICATION.json records fresh source-only official local verification with the unchanged LeanEval comparator, both Nanoda and the Lean kernel accepted, against benchmark 0e093293afbe96be91504ae6e44947876d3fc84e, Lean v4.35.0-rc3 and pinned dependencies. Receipt: 18b27adb5b89483890cc342892168d01. All 239 submitted Lean source hashes were independently checked against that bundled receipt after downloading this exact GitHub commit archive. Server workspace discovery and overlay were checked using the unmodified evaluator at 6164cacbef4207b5c8d895e89ac58e4bb9bb23e3; the protected benchmark files remain unchanged. These archive/packaging checks do not repeat the Lean proof run, and the bundled local PASS is not a claim of organizer acceptance or leaderboard credit. Publication status: private, with no current publication plan and no publication date. No public release of the submitted source is authorized by this submission. Original source notices and provenance are retained. Only this exact problem snapshot is submitted through the currently documented GitHub issue intake.

Improved bounds for the sunflower lemma
annals_improved_bounds_sunflower_lemma

Lean theorem statement

/-- The absolute constant `C` in Theorem 1.4. Although not explicitly stated in the paper,
the constant `C` doesn't depend on `r`. -/
noncomputable def C : ℝ := sorry

/--
Statement of Theorem 1.4 (Main theorem, sunflowers):

Let `r ≥ 3`. For some constant `C`, any `w`-set system `F` of size
`|F| ≥ (C * r ^ 3 * log w * log log w) ^ w` contains an `r`-sunflower.

Note: We require `w ≥ 2`, as the paper assumes `log log w > 0`.
-/
theorem theorem_1_4 (r : ℕ) (hr : r ≥ 3) (X : Type*) [Finite X] (ℱ : Set (Set X)) (w : ℕ)
      (hw : w ≥ 2) (hℱ₁ : ℱ.IsSystem w) (hℱ₂ : ℱ.ncard ≥ lowerBound r C w) :
      ∃ S ⊆ ℱ, S.IsSunflower r := by
  sorry
#70
How produced

Contributor tags: @ma4ypic4y, @haskiindahouse. Submitter: ma4ypic4y. Problem: annals_improved_bounds_sunflower_lemma, statement revision 1. The declared model/system name max gp (GPT-6) is our existing GPT-6-family system label. This proof comes from the formalization-evaluation campaign via Codex CLI; the supplied provenance records backend: gpt-6.1-sol / medium. Campaign contributor: @haskiindahouse. Human direction included selecting the campaign targets and authorizing this private submission. Original campaign proof: the Lean proof code was generated in this campaign (machine-assisted, Codex CLI) and assembled over the pinned Apache-2.0 Lean Pool library (Vilin97/lean-pool @ e9d53e9cbcff8dfd0cc816ba94db7a26b082929f (Apache-2.0)); KahnKalai.park_pham_bound (Dan Clemens Posch, Lean Pool) is reused; incidence counting and the sunflower assembly are campaign code. Statement headers and mathematics remain attributed to their original authors. The bundled VERIFICATION.json records fresh source-only official local verification with the unchanged LeanEval comparator, both Nanoda and the Lean kernel accepted, against benchmark 0e093293afbe96be91504ae6e44947876d3fc84e, Lean v4.35.0-rc3 and pinned dependencies. Receipt: 5fe82b0cb45d47d1ae8041c3c440e9dc. All 9 submitted Lean source hashes were independently checked against that bundled receipt after downloading this exact GitHub commit archive. Server workspace discovery and overlay were checked using the unmodified evaluator at 6164cacbef4207b5c8d895e89ac58e4bb9bb23e3; the protected benchmark files remain unchanged. These archive/packaging checks do not repeat the Lean proof run, and the bundled local PASS is not a claim of organizer acceptance or leaderboard credit. The bundled semantic review covers the parameter-free positive universal constant supplied for the benchmark definition hole; it records no change to the target hypotheses or conclusion. Publication status: private, with no current publication plan and no publication date. No public release of the submitted source is authorized by this submission. Original source notices and provenance are retained. Only this exact problem snapshot is submitted through the currently documented GitHub issue intake.

Szemerédi's theorem
szemeredi

Verso theorem preview

theorem declaration uses `sorry`szemeredi (A : Set ℕ) (h : 0 < upperDensity A) : LeanEval.Combinatorics.ContainsArbitraryAPs A := A:Set ℕh:0 < upperDensity A⊢ ContainsArbitraryAPs A All goals completed! 🐙
#71
How produced

Contributor tags: @ma4ypic4y, @haskiindahouse. Submitter: ma4ypic4y. Problem: szemeredi, statement revision 1. Leaderboard system: max gp (GPT-6). Production model declared by the submitting owner: gpt 6.1 sol (gpt-6.1-sol). This is the owner's updated model attribution supplied on 2026-10-05; it supersedes the earlier model label in the snapshot documentation. The original snapshot documentation is retained for provenance. Human direction included selecting the targets and authorizing this private submission. New private submission; no previous submission or accepted result was found for this exact snapshot. Declared reuse: vendors the density Hales-Jewett / Szemeredi formalization by Gabriel Dahia (https://github.com/gdahia/DensityHalesJewett @ `1c2f5aa1b99caa8e2a87beacf80f07f066c309d3`, as included in Lean Pool https://github.com/Vilin97/lean-pool @ `7f224138830d46cb80314838bde60acbe47a26ca`, Apache-2.0): 13 modules under `Submission/DHJ` with module renames and explicit binders for `autoImplicit = false` (no statement changes); original headers and the Apache-2.0 license are retained. The bridge from the finite density theorem to the LeanEval statement (`Submission.lean`) was written in this campaign by a campaign agent. Original full-proof authorship is not claimed. The bundled VERIFICATION.json reports fresh source-only local acceptance by the unchanged official LeanEval comparator, both Nanoda and the Lean kernel, against benchmark 0e093293afbe96be91504ae6e44947876d3fc84e (receipt 0125bf1fe7104f80a20b9ef667b3fbfc). All 16 submitted Lean source hashes were checked against that receipt. Packaging, single-target discovery and overlay were rechecked using the official evaluator at 28c1ff359a331744a9bdb42791e6e876053e6a6b and current benchmark 2e58dff1c3d3aa934614d46205e8f430f9a7ca7e, preserving all protected benchmark files. The current benchmark has a newer WorkspaceTest harness; the bundled receipt predates that change. This preflight does not repeat Lean/Nanoda verification and is not a claim of hosted acceptance. Publication status: Private, with no current publication plan; no publication dates. Original licenses and author notices are retained.

Klartag's construction of lattice sphere packings
klartag_packing

Verso theorem preview

theorem declaration uses `sorry`klartag_packing : ∃ c : ℝ, 0 < c ∧ ∀ n : ℕ, let V := EuclideanSpace ℝ (Fin (n + 1)) ∃ φ : V →ₗ[ℝ] V, let E := φ '' Metric.ball (0 : V) 1 (MeasureTheory.volume E : EReal) = c * n ^ 2 ∧ {v ∈ E | ∀ i, v i ∈ Set.range ((↑) : ℤ → ℝ)} = {0} := ⊢ ∃ c, 0 < c ∧ ∀ (n : ℕ), let V := EuclideanSpace ℝ (Fin (n + 1)); ∃ φ, let E := ⇑φ '' Metric.ball 0 1; ↑(MeasureTheory.volume E) = ↑c * ↑n ^ 2 ∧ {v | v ∈ E ∧ ∀ (i : Fin (n + 1)), v.ofLp i ∈ Set.range Int.cast} = {0} All goals completed! 🐙
#72
How produced

Contributor tags: @ma4ypic4y, @haskiindahouse. Submitter: ma4ypic4y. Problem: klartag_packing, statement revision 1. The declared model/system name max gp (GPT-6) is our existing GPT-6-family system label. This proof comes from the formalization-evaluation campaign via Codex CLI; the supplied provenance records backend: gpt-6.1-sol / medium. Campaign contributor: @haskiindahouse. Human direction included selecting the campaign targets and authorizing this private submission. Declared reuse: adapts the existing public Apache-2.0 formalization https://github.com/mlgraham/lean-eval-klartag-submission at `270b3358a135f64a6688636660c07772e8db0173`. The campaign performed compatibility changes to 14 of 178 files and verification. Original full-proof authorship is not claimed; original declarations, headers and notices are retained. The bundled VERIFICATION.json records fresh source-only official local verification with the unchanged LeanEval comparator, both Nanoda and the Lean kernel accepted, against benchmark 0e093293afbe96be91504ae6e44947876d3fc84e, Lean v4.35.0-rc3 and pinned dependencies. Receipt: e1a0dda5c5f141f5a94210425de35f8f. All 178 submitted Lean source hashes were independently checked against that bundled receipt after downloading this exact GitHub commit archive. Server workspace discovery and overlay were checked using the unmodified evaluator at 6164cacbef4207b5c8d895e89ac58e4bb9bb23e3; the protected benchmark files remain unchanged. These archive/packaging checks do not repeat the Lean proof run, and the bundled local PASS is not a claim of organizer acceptance or leaderboard credit. Publication status: private, with no current publication plan and no publication date. No public release of the submitted source is authorized by this submission. Original source notices and provenance are retained. Only this exact problem snapshot is submitted through the currently documented GitHub issue intake.

Hopf–Rinow theorem
hopf_rinow

Verso theorem preview

theorem declaration uses `sorry`hopf_rinow {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] {H : Type*} [TopologicalSpace H] (I : ModelWithCorners ℝ E H) [I.Boundaryless] (M : Type*) [EMetricSpace M] [ChartedSpace H M] [IsManifold I ∞ M] [Bundle.RiemannianBundle (fun x : M => TangentSpace I x)] [IsContMDiffRiemannianBundle I ∞ E (fun x : M => TangentSpace I x)] [IsContinuousRiemannianBundle E (fun x : M => TangentSpace I x)] [IsRiemannianManifold I M] [LocallyCompactSpace M] [ConnectedSpace M] : LeanEval.Geometry.IsGeodesicallyComplete M ↔ CompleteSpace M := E:Type u_1inst✝¹³:NormedAddCommGroup Einst✝¹²:NormedSpace ℝ Einst✝¹¹:FiniteDimensional ℝ EH:Type u_2inst✝¹⁰:TopologicalSpace HI:ModelWithCorners ℝ E Hinst✝⁹:I.BoundarylessM:Type u_3inst✝⁸:EMetricSpace Minst✝⁷:ChartedSpace H Minst✝⁶:IsManifold I ∞ Minst✝⁵:RiemannianBundle fun x => TangentSpace I xinst✝⁴:IsContMDiffRiemannianBundle I ∞ E fun x => TangentSpace I xinst✝³:IsContinuousRiemannianBundle E fun x => TangentSpace I xinst✝²:IsRiemannianManifold I Minst✝¹:LocallyCompactSpace Minst✝:ConnectedSpace M⊢ IsGeodesicallyComplete M ↔ CompleteSpace M All goals completed! 🐙
#73
How produced

Contributor tags: @ma4ypic4y, @haskiindahouse. Submitter: ma4ypic4y. Problem: hopf_rinow, statement revision 1. The declared model/system name max gp (GPT-6) is our existing GPT-6-family system label. This proof comes from the formalization-evaluation campaign via Codex CLI; the supplied provenance records backend: gpt-6.1-sol / gpt-6-astra; final assembly job made no model calls. Campaign contributor: @haskiindahouse. Human direction included selecting the campaign targets and authorizing this private submission. Original campaign proof: the Lean proof code was generated in this campaign (machine-assisted, Codex CLI) and assembled over the pinned Apache-2.0 Lean Pool library (Vilin97/lean-pool @ e9d53e9cbcff8dfd0cc816ba94db7a26b082929f (Apache-2.0)); assembly of campaign-generated forward and reverse implications. Statement headers and mathematics remain attributed to their original authors. The bundled VERIFICATION.json records fresh source-only official local verification with the unchanged LeanEval comparator, both Nanoda and the Lean kernel accepted, against benchmark 0e093293afbe96be91504ae6e44947876d3fc84e, Lean v4.35.0-rc3 and pinned dependencies. Receipt: 13bab46fb4cb4ab6ad6dba1e5eddea2e. All 55 submitted Lean source hashes were independently checked against that bundled receipt after downloading this exact GitHub commit archive. Server workspace discovery and overlay were checked using the unmodified evaluator at 6164cacbef4207b5c8d895e89ac58e4bb9bb23e3; the protected benchmark files remain unchanged. These archive/packaging checks do not repeat the Lean proof run, and the bundled local PASS is not a claim of organizer acceptance or leaderboard credit. Publication status: private, with no current publication plan and no publication date. No public release of the submitted source is authorized by this submission. Original source notices and provenance are retained. Only this exact problem snapshot is submitted through the currently documented GitHub issue intake.

Thresholds versus fractional expectation-thresholds
annals_fractional_expectation_thresholds

Verso theorem preview

/-- The constant `K` in Theorem 1.1. -/ noncomputable def declaration uses `sorry`K : ℝ := sorry
/-- Statement of Theorem 1.1: There exists a universal constant `K` such that for any finite set `X` and any increasing collection of sets `𝓕` such that `l(𝓕)` is at least `2`, `p_c(𝓕) ≤ K * q_f(𝓕) * log l(𝓕)`. Note: The assumption that `l(𝓕)` is at least `2` is not explicitly in the paper but is needed because if `l(𝓕) = 1` then `Real.log (l 𝓕) = 0`, but `p_c 𝓕 ∈ (0,1)` (so the inequality clearly cannot hold). -/ theorem declaration uses `sorry`theorem_1_1 (X : Type*) [Fintype X] (𝓕 : Set (Set X)) (h𝓕 : IsUpperSet 𝓕) (hl𝓕 : 2 ≤ l 𝓕) : p_c 𝓕 ≤ K * q_f 𝓕 * Real.log (l 𝓕) := X:Type u_1inst✝:Fintype X𝓕:Set (Set X)h𝓕:IsUpperSet 𝓕hl𝓕:2 ≤ l 𝓕⊢ ↑(p_c 𝓕) ≤ K * ↑(q_f 𝓕) * Real.log ↑(l 𝓕) All goals completed! 🐙
#74
How produced

Contributor tags: @ma4ypic4y, @haskiindahouse. Submitter: ma4ypic4y. Problem: annals_fractional_expectation_thresholds, statement revision 1. The declared model/system name max gp (GPT-6) is our existing GPT-6-family system label. This proof comes from the formalization-evaluation campaign via Codex CLI; the supplied provenance records backend: gpt-6.1-sol / medium. Campaign contributor: @haskiindahouse. Human direction included selecting the campaign targets and authorizing this private submission. Original campaign proof: the Lean proof code was generated in this campaign (machine-assisted, Codex CLI) and assembled over the pinned Apache-2.0 Lean Pool library (Vilin97/lean-pool @ e9d53e9cbcff8dfd0cc816ba94db7a26b082929f (Apache-2.0)); the Park-Pham argument and cover-cost APIs come from Dan Clemens Posch's Lean Pool formalization; the adapter and remaining proof are campaign code. Statement headers and mathematics remain attributed to their original authors. The bundled VERIFICATION.json records fresh source-only official local verification with the unchanged LeanEval comparator, both Nanoda and the Lean kernel accepted, against benchmark 0e093293afbe96be91504ae6e44947876d3fc84e, Lean v4.35.0-rc3 and pinned dependencies. Receipt: 64e56d61bbe94d0eb7df5f5fdd28ecb8. All 5 submitted Lean source hashes were independently checked against that bundled receipt after downloading this exact GitHub commit archive. Server workspace discovery and overlay were checked using the unmodified evaluator at 6164cacbef4207b5c8d895e89ac58e4bb9bb23e3; the protected benchmark files remain unchanged. These archive/packaging checks do not repeat the Lean proof run, and the bundled local PASS is not a claim of organizer acceptance or leaderboard credit. The bundled semantic review covers the parameter-free positive universal constant supplied for the benchmark definition hole; it records no change to the target hypotheses or conclusion. Publication status: private, with no current publication plan and no publication date. No public release of the submitted source is authorized by this submission. Original source notices and provenance are retained. Only this exact problem snapshot is submitted through the currently documented GitHub issue intake.

Rademacher type and Enflo type coincide
annals_rademacher_enflo_type

Verso theorem preview

theorem declaration uses `sorry`theorem_1_1 (p : ℝ) (h1p : 1 ≤ p) (hp2 : p ≤ 2) : TR X p ≤ TE X p ∧ TE X p ≤ (pi / sqrt 2) * TR X p := X:Type u_2inst✝²:NormedAddCommGroup Xinst✝¹:NormedSpace ℝ Xinst✝:CompleteSpace Xp:ℝh1p:1 ≤ php2:p ≤ 2⊢ TR X p ≤ TE X p ∧ TE X p ≤ ↑pi / ↑(sqrt 2) * TR X p All goals completed! 🐙
#75
How produced

Contributor tags: @ma4ypic4y, @haskiindahouse. Submitter: ma4ypic4y. Problem: annals_rademacher_enflo_type, statement revision 1. The declared model/system name max gp (GPT-6) is our existing GPT-6-family system label. This proof comes from the formalization-evaluation campaign via Codex CLI; the supplied provenance records backend: gpt-6.1-sol / medium. Campaign contributor: @haskiindahouse. Human direction included selecting the campaign targets and authorizing this private submission. Original campaign proof: the Lean proof code was generated in this campaign (machine-assisted, Codex CLI) and assembled over the pinned Apache-2.0 Lean Pool library (Vilin97/lean-pool @ e9d53e9cbcff8dfd0cc816ba94db7a26b082929f (Apache-2.0)); mathematics: Ivanisvili, van Handel and Volberg, Annals 192 (2020); the Lean proofs are campaign code. Statement headers and mathematics remain attributed to their original authors. The bundled VERIFICATION.json records fresh source-only official local verification with the unchanged LeanEval comparator, both Nanoda and the Lean kernel accepted, against benchmark 0e093293afbe96be91504ae6e44947876d3fc84e, Lean v4.35.0-rc3 and pinned dependencies. Receipt: d1c9e1ce09294e76babfcb72490d9448. All 10 submitted Lean source hashes were independently checked against that bundled receipt after downloading this exact GitHub commit archive. Server workspace discovery and overlay were checked using the unmodified evaluator at 6164cacbef4207b5c8d895e89ac58e4bb9bb23e3; the protected benchmark files remain unchanged. These archive/packaging checks do not repeat the Lean proof run, and the bundled local PASS is not a claim of organizer acceptance or leaderboard credit. Publication status: private, with no current publication plan and no publication date. No public release of the submitted source is authorized by this submission. Original source notices and provenance are retained. Only this exact problem snapshot is submitted through the currently documented GitHub issue intake.

Equiangular lines with a fixed angle
annals_equiangular_lines_fixed_angle

Verso theorem preview

theorem declaration uses `sorry`theorem_1_2 (α : ℝ) (hα : α ∈ Set.Ioo 0 1) : let k := spectralRadiusOrder ((1 - α) / (2 * α)) (k < ⊤ → ∀ᶠ d in atTop, N α d = ⌊(k.toNat * (d - 1) : ℝ) / (k.toNat - 1 : ℝ)⌋₊) ∧ (k = ⊤ → ∃ e : ℕ → ℝ, e =o[atTop] (Nat.cast : ℕ → ℝ) ∧ ∀ d, N α d = d + e d) := α:ℝhα:α ∈ Set.Ioo 0 1⊢ let k := spectralRadiusOrder ((1 - α) / (2 * α)); (k < ⊤ → ∀ᶠ (d : ℕ) in atTop, N α d = ⌊↑k.toNat * (↑d - 1) / (↑k.toNat - 1)⌋₊) ∧ (k = ⊤ → ∃ e, e =o[atTop] Nat.cast ∧ ∀ (d : ℕ), ↑(N α d) = ↑d + e d) All goals completed! 🐙
#76
How produced

Contributor tags: @ma4ypic4y, @haskiindahouse. Submitter: ma4ypic4y. Problem: annals_equiangular_lines_fixed_angle, statement revision 1. The declared model/system name max gp (GPT-6) is our existing GPT-6-family system label. This proof comes from the formalization-evaluation campaign via Codex CLI; the supplied provenance records backend: gpt-6.1-sol / medium. Campaign contributor: @haskiindahouse. Human direction included selecting the campaign targets and authorizing this private submission. Original campaign proof: the Lean proof code was generated in this campaign (machine-assisted, Codex CLI) and assembled over the pinned Apache-2.0 Lean Pool library (Vilin97/lean-pool @ e9d53e9cbcff8dfd0cc816ba94db7a26b082929f (Apache-2.0)); Lean Pool spectral (Perron/top-spectrum) results are credited to their authors. Statement headers and mathematics remain attributed to their original authors. The bundled VERIFICATION.json records fresh source-only official local verification with the unchanged LeanEval comparator, both Nanoda and the Lean kernel accepted, against benchmark 0e093293afbe96be91504ae6e44947876d3fc84e, Lean v4.35.0-rc3 and pinned dependencies. Receipt: 95cbfde6fc204ea6bd3499108a6b5870. All 40 submitted Lean source hashes were independently checked against that bundled receipt after downloading this exact GitHub commit archive. Server workspace discovery and overlay were checked using the unmodified evaluator at 6164cacbef4207b5c8d895e89ac58e4bb9bb23e3; the protected benchmark files remain unchanged. These archive/packaging checks do not repeat the Lean proof run, and the bundled local PASS is not a claim of organizer acceptance or leaderboard credit. Publication status: private, with no current publication plan and no publication date. No public release of the submitted source is authorized by this submission. Original source notices and provenance are retained. Only this exact problem snapshot is submitted through the currently documented GitHub issue intake.

Dimitrov's lower bound for the house of a nonzero algebraic integer that is not a root of unity
dimitrov

Verso theorem preview

theorem declaration uses `sorry`dimitrov {K : Type*} [Field K] [NumberField K] (α : K) (α_int : IsIntegral ℤ α) (α_ne_zero : α ≠ 0) (α_not_rootOfUnity : ¬ IsOfFinOrder α) : (2 : ℝ) ^ (1 / (4 * (Finset.univ.image fun σ : K →+* ℂ ↦ (σ α).arg).card) : ℝ) ≤ NumberField.house α := K:Type u_1inst✝¹:Field Kinst✝:NumberField Kα:Kα_int:IsIntegral ℤ αα_ne_zero:α ≠ 0α_not_rootOfUnity:¬IsOfFinOrder α⊢ 2 ^ (1 / (4 * ↑(Finset.image (fun σ => (σ α).arg) Finset.univ).card)) ≤ NumberField.house α All goals completed! 🐙
#77
How produced

Submitter: ma4ypic4y. Existing proof reused under Apache-2.0 from https://github.com/mlgraham/lean-eval-dimitrov-submission at 661e66a9fb0830eea5084f2b6ca88a10813749df. Original attribution: Claude Fable 5 / various models, as reported upstream. Contribution: five source files adapted for Lean 4.35 / Mathlib API changes; original full-proof authorship is not claimed. Fresh local source-only verification of all 87 files passed both unchanged official kernels against benchmark 0e093293afbe96be91504ae6e44947876d3fc84e. Exact hashes and provenance are committed in the submitted repository. This local PASS is not a claim of server acceptance. Packaging repair: add the benchmark lakefile.toml discovery marker and toolchain metadata; all previously verified Submission sources are byte-identical. Supersedes submission 01a10085-0cd1-74f5-8baf-187c0e8f3619. Harness: Codex multi-agent proof-porting workflow with the unmodified pinned LeanEval comparator (Lean and Nanoda). Human selected the benchmark, research direction and submission identity, and authorized submission. Existing public proof reused; no claim that the campaign produced the original full proof. This uses the documented temporary issue intake because the service evaluation-completion builder rejects the benchmark RC3 toolchain; the same corrected commit is in service run https://github.com/leanprover/lean-eval-submissions/actions/runs/37107427923. No change to verifier, benchmark pins, proof sources or attribution is requested. The intended publication date is a best estimate consistent with the existing scheduled service submission; it is not a claim that this adapted source is already public.

A counterexample to the unit conjecture for group rings
annals_unit_conjecture

Verso theorem preview

theorem declaration uses `sorry`theorem_A : (∀ g : UnitConjecture.P, ∀ n ≠ 0, g ^ n = 1 → g = 1) ∧ IsUnit UnitConjecture.u ∧ ¬ ∃ g : UnitConjecture.P, UnitConjecture.u = g := ⊢ (∀ (g : P) (n : ℕ), n ≠ 0 → g ^ n = 1 → g = 1) ∧ IsUnit u ∧ ¬∃ g, u = (MonoidAlgebra.of (ZMod 2) P) g All goals completed! 🐙
#78
How produced

Contributor tags: @ma4ypic4y, @haskiindahouse. Submitter: ma4ypic4y. Problem: annals_unit_conjecture, statement revision 1. The declared model/system name max gp (GPT-6) is our existing GPT-6-family system label. This proof comes from the formalization-evaluation campaign via Codex CLI; the supplied provenance records backend: gpt-6.1-sol / medium. Campaign contributor: @haskiindahouse. Human direction included selecting the campaign targets and authorizing this private submission. Original campaign proof: the Lean proof code was generated in this campaign (machine-assisted, Codex CLI) and assembled over the pinned Apache-2.0 Lean Pool library (Vilin97/lean-pool @ e9d53e9cbcff8dfd0cc816ba94db7a26b082929f (Apache-2.0)); a new adapter over the Lean Pool Gardam formalization (Siddhartha Gadgil and Anand Rao) supplying the metabelian group model. Statement headers and mathematics remain attributed to their original authors. The bundled VERIFICATION.json records fresh source-only official local verification with the unchanged LeanEval comparator, both Nanoda and the Lean kernel accepted, against benchmark 0e093293afbe96be91504ae6e44947876d3fc84e, Lean v4.35.0-rc3 and pinned dependencies. Receipt: 3c8a47306af147fc81c0323e27c87c44. All 7 submitted Lean source hashes were independently checked against that bundled receipt after downloading this exact GitHub commit archive. Server workspace discovery and overlay were checked using the unmodified evaluator at 6164cacbef4207b5c8d895e89ac58e4bb9bb23e3; the protected benchmark files remain unchanged. These archive/packaging checks do not repeat the Lean proof run, and the bundled local PASS is not a claim of organizer acceptance or leaderboard credit. Publication status: private, with no current publication plan and no publication date. No public release of the submitted source is authorized by this submission. Original source notices and provenance are retained. Only this exact problem snapshot is submitted through the currently documented GitHub issue intake.

First submissionOct 3, 2026
Last submissionOct 13, 2026
ma4ypic4y78
11Aleph Prover(logicalintelligence.com)56 solved
Local stable/unstable sets at a hyperbolic fixed point (set-level Hadamard–Perron)
stable_unstable_manifolds

Verso theorem preview

theorem declaration uses `sorry`stable_unstable_manifolds_exist (n : ℕ) (f : LeanEval.Dynamics.StableUnstableManifoldsProblem.E n → LeanEval.Dynamics.StableUnstableManifoldsProblem.E n) (x₀ : LeanEval.Dynamics.StableUnstableManifoldsProblem.E n) (_hf : ContDiffAt ℝ 1 f x₀) (_hfix : f x₀ = x₀) (_hhyp : LeanEval.Dynamics.StableUnstableManifoldsProblem.IsHyperbolicLinear (fderiv ℝ f x₀)) (_hf_inv : (fderiv ℝ f x₀).IsInvertible) : ∃ U : Set (LeanEval.Dynamics.StableUnstableManifoldsProblem.E n), IsOpen U ∧ x₀ ∈ U ∧ ∃ Ws Wu : Set (LeanEval.Dynamics.StableUnstableManifoldsProblem.E n), Ws = {x | (∀ k : ℕ, f^[k] x ∈ U) ∧ Tendsto (fun k => f^[k] x) atTop (𝓝 x₀)} ∧ Wu = {x | ∃ y : ℕ → LeanEval.Dynamics.StableUnstableManifoldsProblem.E n, y 0 = x ∧ (∀ k : ℕ, y k ∈ U) ∧ (∀ k : ℕ, f (y (k + 1)) = y k) ∧ Tendsto y atTop (𝓝 x₀)} ∧ Ws ∩ Wu = {x₀} := n:ℕf:E n → E nx₀:E n_hf:ContDiffAt ℝ 1 f x₀_hfix:f x₀ = x₀_hhyp:IsHyperbolicLinear (fderiv ℝ f x₀)_hf_inv:(fderiv ℝ f x₀).IsInvertible⊢ ∃ U, IsOpen U ∧ x₀ ∈ U ∧ ∃ Ws Wu, Ws = {x | (∀ (k : ℕ), f^[k] x ∈ U) ∧ Tendsto (fun k => f^[k] x) atTop (𝓝 x₀)} ∧ Wu = {x | ∃ y, y 0 = x ∧ (∀ (k : ℕ), y k ∈ U) ∧ (∀ (k : ℕ), f (y (k + 1)) = y k) ∧ Tendsto y atTop (𝓝 x₀)} ∧ Ws ∩ Wu = {x₀} All goals completed! 🐙
#1
How produced

Solved completely autonomously without human intervention

Mountain Pass Theorem (Ambrosetti–Rabinowitz 1973)
mountain_pass

Verso theorem preview

theorem declaration uses `sorry`mountain_pass (f : E → ℝ) (_hf : ContDiff ℝ 1 f) (_hps : LeanEval.Analysis.MountainPassProblem.PalaisSmale f) {a b : E} {ε r : ℝ} (_hmr : LeanEval.Analysis.MountainPassProblem.MountainRange f a b ε r) : ∃ x : E, LeanEval.Analysis.MountainPassProblem.IsCriticalPoint f x ∧ f x = mountainPassLevel f a b ∧ ε ≤ mountainPassLevel f a b := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:CompleteSpace Ef:E → ℝ_hf:ContDiff ℝ 1 f_hps:PalaisSmale fa:Eb:Eε:ℝr:ℝ_hmr:MountainRange f a b ε r⊢ ∃ x, IsCriticalPoint f x ∧ f x = mountainPassLevel f a b ∧ ε ≤ mountainPassLevel f a b All goals completed! 🐙
#2
How produced

Solved completely autonomously without human intervention

Fraser: Fourier decay for finite-field Kakeya sets is q^{-1} and sharp
fraser_kakeya_fourier_decay

Verso theorem preview

theorem declaration uses `sorry`fraser_kakeya_fourier_decay_and_sharp {d : ℕ} (_hd : 2 ≤ d) {K : Set (LeanEval.Combinatorics.FraserKakeyaProblem.Space F d)} (_hK : LeanEval.Combinatorics.FraserKakeyaProblem.IsKakeya K) (χ : AddChar F ℂ) (_hχ : χ ≠ 1) : (∃ μ : LeanEval.Combinatorics.FraserKakeyaProblem.Space F d → ℝ, LeanEval.Combinatorics.FraserKakeyaProblem.IsProbabilityMeasureOn K μ ∧ ∀ ξ : LeanEval.Combinatorics.FraserKakeyaProblem.Space F d, ξ ≠ 0 → ‖fourier χ μ ξ‖ ≤ (Fintype.card F : ℝ)⁻¹) ∧ (∀ κ : ℝ, 0 < κ → κ < 1 → ∃ Q : ℕ, ∀ (F' : Type*) [Field F'] [Fintype F'] [DecidableEq F'], Q ≤ Fintype.card F' → ∃ K' : Set (LeanEval.Combinatorics.FraserKakeyaProblem.Space F' d), LeanEval.Combinatorics.FraserKakeyaProblem.IsKakeya K' ∧ ∀ μ : LeanEval.Combinatorics.FraserKakeyaProblem.Space F' d → ℝ, LeanEval.Combinatorics.FraserKakeyaProblem.IsProbabilityMeasureOn K' μ → ∃ ξ : LeanEval.Combinatorics.FraserKakeyaProblem.Space F' d, ξ ≠ 0 ∧ κ * (Fintype.card F' : ℝ)⁻¹ ≤ ‖fourier (AddChar.FiniteField.primitiveChar_to_Complex F') μ ξ‖) := F:Type u_1inst✝²:Field Finst✝¹:Fintype Finst✝:DecidableEq Fd:ℕ_hd:2 ≤ dK:Set (Space F d)_hK:IsKakeya Kχ:AddChar F ℂ_hχ:χ ≠ 1⊢ (∃ μ, IsProbabilityMeasureOn K μ ∧ ∀ (ξ : Space F d), ξ ≠ 0 → ‖LeanEval.Combinatorics.FraserKakeyaProblem.fourier χ μ ξ‖ ≤ (↑(Fintype.card F))⁻¹) ∧ ∀ (κ : ℝ), 0 < κ → κ < 1 → ∃ Q, ∀ (F' : Type u_2) [inst : Field F'] [inst_1 : Fintype F'] [DecidableEq F'], Q ≤ Fintype.card F' → ∃ K', IsKakeya K' ∧ ∀ (μ : Space F' d → ℝ), IsProbabilityMeasureOn K' μ → ∃ ξ, ξ ≠ 0 ∧ κ * (↑(Fintype.card F'))⁻¹ ≤ ‖LeanEval.Combinatorics.FraserKakeyaProblem.fourier (AddChar.FiniteField.primitiveChar_to_Complex F') μ ξ‖ All goals completed! 🐙
#3
How produced

Solved completely autonomously without human intervention

Liouville–Arnold theorem on integrable systems
liouville_arnold

Verso theorem preview

theorem declaration uses `sorry`liouville_arnold {n : ℕ} (F : Fin n → LeanEval.Geometry.LiouvilleArnold.E n → ℝ) (U : Set (LeanEval.Geometry.LiouvilleArnold.E n)) (_hU : IsOpen U) (_hLI : LeanEval.Geometry.LiouvilleArnold.IsLiouvilleIntegrable F U) (c : Fin n → ℝ) (_hMc_sub : LeanEval.Geometry.LiouvilleArnold.levelSet F c ⊆ U) (_hMc_compact : IsCompact (LeanEval.Geometry.LiouvilleArnold.levelSet F c)) (_hMc_connected : IsConnected (LeanEval.Geometry.LiouvilleArnold.levelSet F c)) : Nonempty ((LeanEval.Geometry.LiouvilleArnold.levelSet F c) ≃ₜ (Fin n → AddCircle (1 : ℝ))) := n:ℕF:Fin n → E n → ℝU:Set (E n)_hU:IsOpen U_hLI:IsLiouvilleIntegrable F Uc:Fin n → ℝ_hMc_sub:levelSet F c ⊆ U_hMc_compact:IsCompact (levelSet F c)_hMc_connected:IsConnected (levelSet F c)⊢ Nonempty (↑(levelSet F c) ≃ₜ (Fin n → AddCircle 1)) All goals completed! 🐙
#4
How produced

Two attempts were made, for the second one we added guidance to only focus on homeomorphism(asked by the challenge) and not diffeomorphism(which is what the actual theorem claims). The first attempt got stuck in the part that's not well developed in Mathlib.

Lidskii's inequality
lidskii_inequality

Verso theorem preview

theorem declaration uses `sorry`lidskii_inequality {n : Type*} [Fintype n] [DecidableEq n] {A B : Matrix n n ℂ} (hA : A.IsHermitian) (hB : B.IsHermitian) {p : ℝ} (_hp : 1 ≤ p) : ∑ j, |hA.eigenvalues₀ j - hB.eigenvalues₀ j| ^ p ≤ ∑ j, |(hB.sub hA).eigenvalues₀ j| ^ p := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℂB:Matrix n n ℂhA:A.IsHermitianhB:B.IsHermitianp:ℝ_hp:1 ≤ p⊢ ∑ j, |hA.eigenvalues₀ j - hB.eigenvalues₀ j| ^ p ≤ ∑ j, |⋯.eigenvalues₀ j| ^ p All goals completed! 🐙
#5
How produced

Solved completely autonomously without human intervention

Frobenius's theorem: the Frobenius kernel is normal
frobenius_kernel_isNormal

Verso theorem preview

theorem declaration uses `sorry`frobenius_kernel_isNormal (G X : Type) [Group G] [Fintype G] [Fintype X] [MulAction G X] [FaithfulSMul G X] (hcard : 2 ≤ Fintype.card X) (htrans : ∀ x y : X, ∃ g : G, g • x = y) (hstab : ∀ x : X, MulAction.stabilizer G x ≠ ⊥) (hfrob : ∀ g : G, g ≠ 1 → ∀ x y : X, g • x = x → g • y = y → x = y) : ∃ N : Subgroup G, N.Normal ∧ (N : Set G) = {1} ∪ {g : G | ∀ x : X, g • x ≠ x} := G:TypeX:Typeinst✝⁴:Group Ginst✝³:Fintype Ginst✝²:Fintype Xinst✝¹:MulAction G Xinst✝:FaithfulSMul G Xhcard:2 ≤ Fintype.card Xhtrans:∀ (x y : X), ∃ g, g • x = yhstab:∀ (x : X), MulAction.stabilizer G x ≠ ⊥hfrob:∀ (g : G), g ≠ 1 → ∀ (x y : X), g • x = x → g • y = y → x = y⊢ ∃ N, N.Normal ∧ ↑N = {1} ∪ {g | ∀ (x : X), g • x ≠ x} All goals completed! 🐙
#6
How produced

Solved completely autonomously without human intervention

Independence of the parallel postulate
parallel_postulate_independent

Verso theorem preview

theorem declaration uses `sorry`parallel_postulate_independent : (∃ (M : Type) (T : LeanEval.Geometry.TarskiAbsolute M), LeanEval.Geometry.Euclidean M T) ∧ (∃ (M : Type) (T : LeanEval.Geometry.TarskiAbsolute M), ¬ LeanEval.Geometry.Euclidean M T) := ⊢ (∃ M T, Euclidean M T) ∧ ∃ M T, ¬Euclidean M T All goals completed! 🐙
#7
How produced

Solved completely autonomously without human intervention

Chen theorem for Markoff graphs
dvd_card_connectedComponent_markoffGraph

Verso theorem preview

theorem declaration uses `sorry`dvd_card_connectedComponent_markoffGraph {p : ℕ} (hp : Nat.Prime p) (hgt : 3 < p) : ∀ c : (LeanEval.Combinatorics.markoffGraph p).ConnectedComponent, p ∣ Nat.card c := p:ℕhp:Nat.Prime phgt:3 < p⊢ ∀ (c : (markoffGraph p).ConnectedComponent), p ∣ Nat.card ↥c All goals completed! 🐙
#8
How produced

Solved completely autonomously without human intervention

Monge–Kantorovich existence theorem
monge_kantorovich

Verso theorem preview

theorem declaration uses `sorry`monge_kantorovich_exists {X Y : Type*} [TopologicalSpace X] [PolishSpace X] [MeasurableSpace X] [BorelSpace X] [TopologicalSpace Y] [PolishSpace Y] [MeasurableSpace Y] [BorelSpace Y] (P : Measure X) (Q : Measure Y) [IsProbabilityMeasure P] [IsProbabilityMeasure Q] (c : X × Y → ENNReal) (_hc : Continuous c) : ∃ π ∈ LeanEval.Analysis.Couplings P Q, ∀ π' ∈ LeanEval.Analysis.Couplings P Q, kantorovichCost c π ≤ kantorovichCost c π' := X:Type u_1Y:Type u_2inst✝⁹:TopologicalSpace Xinst✝⁸:PolishSpace Xinst✝⁷:MeasurableSpace Xinst✝⁶:BorelSpace Xinst✝⁵:TopologicalSpace Yinst✝⁴:PolishSpace Yinst✝³:MeasurableSpace Yinst✝²:BorelSpace YP:Measure XQ:Measure Yinst✝¹:IsProbabilityMeasure Pinst✝:IsProbabilityMeasure Qc:X × Y → ENNReal_hc:Continuous c⊢ ∃ π ∈ Couplings P Q, ∀ π' ∈ Couplings P Q, kantorovichCost c π ≤ kantorovichCost c π' All goals completed! 🐙
#9
How produced

Solved completely autonomously without human intervention

Lidskii–Last eigenvalue-perturbation theorem
lidskii_last

Verso theorem preview

theorem declaration uses `sorry`lidskii_last {n : Type*} [Fintype n] [DecidableEq n] {A B : Matrix n n ℂ} (hA : A.IsHermitian) (hB : B.IsHermitian) : ∑ j, |hA.eigenvalues₀ j - hB.eigenvalues₀ j| ≤ ∑ i, ∑ j, ‖A i j - B i j‖ := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℂB:Matrix n n ℂhA:A.IsHermitianhB:B.IsHermitian⊢ ∑ j, |hA.eigenvalues₀ j - hB.eigenvalues₀ j| ≤ ∑ i, ∑ j, ‖A i j - B i j‖ All goals completed! 🐙
#10
How produced

The proof required `lidskii_inequality` solution, it was previously solved by Aleph, then for this run it had access to that whole proof. At the end, only the `lidskii_inequality` theorem itself was needed. No other human intervention other wise.

Furstenberg–Weiss topological multiple recurrence (single-transformation form)
furstenberg_topological

Lean theorem statement

/-- **Furstenberg–Weiss topological multiple recurrence** (single-
transformation form). Every homeomorphism `T` of a nonempty compact
metric space `X` has a multiply recurrent point. -/
theorem furstenberg_topological_recurrence {X : Type*} [MetricSpace X]
    [CompactSpace X] [Nonempty X] (T : X ≃ₜ X) :
    ∃ x : X, IsMultiplyRecurrent (T : X → X) x := by
  sorry
#11
How produced

Solved completely autonomously without human intervention

Baer–Suzuki theorem
baer_suzuki

Verso theorem preview

theorem declaration uses `sorry`baer_suzuki {G : Type*} [Group G] [Finite G] {p : ℕ} [Fact p.Prime] (x : G) : x ∈ LeanEval.GroupTheory.Defs.pCore p G ↔ ∀ g : G, IsPGroup p (Subgroup.closure ({x, g * x * g⁻¹} : Set G)) := G:Type u_1inst✝²:Group Ginst✝¹:Finite Gp:ℕinst✝:Fact (Nat.Prime p)x:G⊢ x ∈ pCore p G ↔ ∀ (g : G), IsPGroup p ↥(Subgroup.closure {x, g * x * g⁻¹}) All goals completed! 🐙
#12
How produced

Solved completely autonomously without human intervention

Solvable extensions ↔ solvable groups (the missing converse in Abel–Ruffini)
solvable_by_radicals_converse

Lean theorem statement

/-- **Solvable extensions ↔ solvable groups.** For a field `F` of
characteristic zero and a nonzero `p : F[X]`, every root of `p` in
`AlgebraicClosure F` lies in `solvableByRad F (AlgebraicClosure F)`
iff `p.Gal` is solvable. -/
theorem solvable_iff_solvableByRad (F : Type*) [Field F] [CharZero F]
    (p : F[X]) (_hp : p ≠ 0) :
    (∀ x : AlgebraicClosure F, aeval x p = 0 →
        x ∈ solvableByRad F (AlgebraicClosure F)) ↔ Group.IsSolvable p.Gal := by
  sorry
#13
How produced

Solved completely autonomously without human intervention

Nash equilibrium existence theorem
nash_equilibrium_exists

Lean theorem statement

/-- **Nash equilibrium existence theorem.** Every finite `n`-player game
with nonempty finite pure-strategy sets and arbitrary real payoffs admits
at least one mixed-strategy Nash equilibrium. -/
theorem nash_equilibrium_exists {n : ℕ} {S : Fin n → Type*}
    [∀ i, Fintype (S i)] [∀ i, Nonempty (S i)]
    (u : Fin n → StrategyProfile n S → ℝ) :
    ∃ σ : ∀ i, S i → ℝ, IsNashEquilibrium u σ := by
  sorry
#14
How produced

The solution used schauder_fixed_point. Schauder fixed-point theorem was first proven by Aleph and then manually inlined. Other than that, the solution was produced autonomously.

Kakutani fixed-point theorem
kakutani_fixed_point

Lean theorem statement

/-- **Kakutani fixed-point theorem.** Every upper-hemicontinuous
correspondence `F` from a nonempty compact convex `K ⊆ ℝᵈ` to itself, with
nonempty convex closed values, has a fixed point `x ∈ F x`. -/
theorem kakutani_fixed_point {d : ℕ}
    {K : Set (EuclideanSpace ℝ (Fin d))}
    (_hK_compact : IsCompact K) (_hK_convex : Convex ℝ K)
    (_hK_nonempty : K.Nonempty)
    (F : EuclideanSpace ℝ (Fin d) → Set (EuclideanSpace ℝ (Fin d)))
    (_hF_uhc : IsUpperHemicontinuous F)
    (_hF_nonempty : ∀ x ∈ K, (F x).Nonempty)
    (_hF_convex : ∀ x ∈ K, Convex ℝ (F x))
    (_hF_closed : ∀ x ∈ K, IsClosed (F x))
    (_hF_maps : ∀ x ∈ K, F x ⊆ K) :
    ∃ x ∈ K, x ∈ F x := by
  sorry
#15
How produced

The solution used brouwer_fixed_point. Brouwer fixed-point theorem was first proved by Aleph and then manually inlined. Other than that, the solutions were produced autonomously.

Sturm's theorem
sturm

Lean theorem statement

/-- **Sturm's theorem.** For a squarefree real polynomial `p` and an interval
`(a, b)` with `a < b` whose endpoints are not roots of `p`, the number of
distinct roots of `p` in `(a, b)` equals `σ(a) − σ(b)`. -/
theorem sturm (p : ℝ[X]) (hp : Squarefree p) {a b : ℝ} (hab : a < b)
    (ha : p.eval a ≠ 0) (hb : p.eval b ≠ 0) :
    ((p.roots.toFinset).filter (fun x => a < x ∧ x < b)).card =
      sigma p a - sigma p b := by
  sorry
#16
How produced

Solved completely autonomously without human intervention

Brauer–Fowler theorem
brauer_fowler

Lean theorem statement

/-- **Brauer–Fowler theorem.** There is a function bounding the order
of a finite nonabelian simple group by the order of any involution
centralizer. -/
theorem brauer_fowler :
    ∃ f : ℕ → ℕ, ∀ (G : Type) [Group G] [Finite G],
      IsSimpleGroup G → (∃ a b : G, a * b ≠ b * a) →
      ∀ t : G, orderOf t = 2 →
        Nat.card G ≤ f (Nat.card (Subgroup.centralizer ({t} : Set G))) := by
  sorry
#17
How produced

Solved completely autonomously without human intervention

Balanceable k-bounded partitions
balanceable_bounded_partitions

Lean theorem statement

/--
For any `k`, the smallest `n` such that any `k`-bounded partition of `n` is
also balanceable is given by `2 * lcm(1, ..., k)`.
-/
theorem minimal_balanceable_of_bounded (k : ℕ) (hk : 0 < k) :
    Minimal (fun n => 0 < n ∧ ∀ p : n.Partition, Bounded k p → Balanceable p) (2 * (Finset.Icc 1 k).lcm id) := by
  sorry
#18
How produced

Solved without human intervention. Two `native_decide`'s were used in the AI-generated proof(one as `interval_cases k <;> native_decide`). Those were replaced with `decide` manually. The goals that were solved by `native_decide`->`decide` were: ``` ⊢ ∑ i ∈ Finset.Icc 1 0, i * (i - 2) ≤ 0 * (0 - 1) * (0 - 2) / 2 case pos.«0» k : ℕ ih : ∑ i ∈ Finset.Icc 1 0, i * (i - 2) ≤ 0 * (0 - 1) * (0 - 2) / 2 hk : 0 < 3 ⊢ ∑ i ∈ Finset.Icc 1 (0 + 1), i * (i - 2) ≤ (0 + 1) * (0 + 1 - 1) * (0 + 1 - 2) / 2 case pos.«1» k : ℕ ih : ∑ i ∈ Finset.Icc 1 1, i * (i - 2) ≤ 1 * (1 - 1) * (1 - 2) / 2 hk : 1 < 3 ⊢ ∑ i ∈ Finset.Icc 1 (1 + 1), i * (i - 2) ≤ (1 + 1) * (1 + 1 - 1) * (1 + 1 - 2) / 2 case pos.«2» k : ℕ ih : ∑ i ∈ Finset.Icc 1 2, i * (i - 2) ≤ 2 * (2 - 1) * (2 - 2) / 2 hk : 2 < 3 ⊢ ∑ i ∈ Finset.Icc 1 (2 + 1), i * (i - 2) ≤ (2 + 1) * (2 + 1 - 1) * (2 + 1 - 2) / 2 ``` (Aleph wasn't rerun in strict mode just to save time)

A competition programming problem about permuting a permutation to be unimodal
permute_to_unimodal

Lean theorem statement

/--
`minRearrange` correctly computes the smallest number of indices that need to be permuted in order to
turn `arr` into a unimodal permutation.
-/
theorem minRearrange_correct {arr : Array Nat} :
    arr.Perm (1...=arr.size).toArray →
      (∃ (x : Array Nat) (hx : x.Perm (1...=arr.size).toArray), Unimodal x ∧ differences (Vector.mk x (by simpa using hx.size_eq)) arr.toVector = minRearrange arr) ∧
      (∀ (x : Array Nat) (hx : x.Perm (1...=arr.size).toArray), Unimodal x → minRearrange arr ≤ differences (Vector.mk x (by simpa using hx.size_eq)) arr.toVector) := by
  sorry
#19
How produced

Solved completely autonomously without human intervention

Schur-Weyl duality: S_k image equals centralizer of GL(V) image
symAction_range_eq_centralizer_glAction

Verso theorem preview

theorem declaration uses `sorry`symAction_range_eq_centralizer_glAction {R : Type*} [Field R] {M : Type*} [AddCommGroup M] [Module R M] [FiniteDimensional R M] {k : ℕ} [Invertible (k.factorial : R)] : Algebra.adjoin R (Set.range (LeanEval.RepresentationTheory.symAction R M k)) = Subalgebra.centralizer R (Set.range (LeanEval.RepresentationTheory.glAction R M k)) := R:Type u_1inst✝⁴:Field RM:Type u_2inst✝³:AddCommGroup Minst✝²:Module R Minst✝¹:FiniteDimensional R Mk:ℕinst✝:Invertible ↑k.factorial⊢ Algebra.adjoin R (Set.range ⇑(symAction R M k)) = Subalgebra.centralizer R (Set.range ⇑(glAction R M k)) All goals completed! 🐙
#20
How produced

Solved without human intervention Solution to glAction_range_eq_centralizer_symAction was used for this proof as internally all the benchmark problems were put into a single Lean project. We manually inlined that solution.

Pointwise and Cesàro convergence of Fourier series (Dirichlet, Fejér)
fourier_dirichlet_fejer

Verso theorem preview

/-- **Dirichlet's pointwise convergence theorem** (§46). For every `C¹` 2π-periodic complex function `f`, the symmetric Fourier partial sums `S_N(f)(x)` converge to `f(x)` at every point `x ∈ ℝ`. -/ theorem declaration uses `sorry`dirichlet_pointwise {f : ℝ → ℂ} (_hperiod : Function.Periodic f (2 * Real.pi)) (_hC1 : ContDiff ℝ 1 f) (x : ℝ) : Tendsto (fun N : ℕ => fourierPartialSum f N x) atTop (𝓝 (f x)) := f:ℝ → ℂ_hperiod:Function.Periodic f (2 * Real.pi)_hC1:ContDiff ℝ 1 fx:ℝ⊢ Tendsto (fun N => fourierPartialSum f N x) atTop (𝓝 (f x)) All goals completed! 🐙
/-- **Fejér's theorem** (§46). For every *continuous* 2π-periodic complex function `f` — without the `C¹` hypothesis of Dirichlet's theorem — the Cesàro means `σ_N(f)` of the symmetric Fourier partial sums converge to `f` uniformly on `ℝ`. -/ theorem declaration uses `sorry`fejer {f : ℝ → ℂ} (_hperiod : Function.Periodic f (2 * Real.pi)) (_hcont : Continuous f) : TendstoUniformly (fun N : ℕ => fourierCesaroMean f N) f atTop := f:ℝ → ℂ_hperiod:Function.Periodic f (2 * Real.pi)_hcont:Continuous f⊢ TendstoUniformly (fun N => fourierCesaroMean f N) f atTop All goals completed! 🐙
#21
How produced

Solved completely autonomously without human intervention

Kuznetsov's theorem: finitely presented simple groups have solvable word problem
boone_higman_simple

Verso theorem preview

theorem declaration uses `sorry`boone_higman_simple {G : Type*} [Group G] [IsSimpleGroup G] {n : ℕ} (φ : FreeGroup (Fin n) →* G) (_hsurj : Function.Surjective φ) (_hker : (MonoidHom.ker φ).IsFinitelyNormallyGenerated) : LeanEval.GroupTheory.BooneHigmanSimpleProblem.WordProblemSolvable φ := G:Type u_1inst✝¹:Group Ginst✝:IsSimpleGroup Gn:ℕφ:FreeGroup (Fin n) →* G_hsurj:Function.Surjective ⇑φ_hker:φ.ker.IsFinitelyNormallyGenerated⊢ WordProblemSolvable φ All goals completed! 🐙
#22
How produced

Solved completely autonomously without human intervention

Euler–Lagrange equation
euler_lagrange_equation

Verso theorem preview

theorem declaration uses `sorry`euler_lagrange_equation {a b : ℝ} (L : ℝ → ℝ → ℝ → ℝ) (x : ℝ → ℝ) (_hab : a < b) (_hL : ContDiff ℝ 2 (fun p : ℝ × ℝ × ℝ => L p.1 p.2.1 p.2.2)) (_hx : ContDiff ℝ 2 x) (_hxe : LeanEval.Analysis.IsVariationalExtremum a b L x) : ∀ t ∈ Set.Ioo a b, lagrangianPartialX L x t = deriv (lagrangianPartialV L x) t := a:ℝb:ℝL:ℝ → ℝ → ℝ → ℝx:ℝ → ℝ_hab:a < b_hL:ContDiff ℝ 2 fun p => L p.1 p.2.1 p.2.2_hx:ContDiff ℝ 2 x_hxe:IsVariationalExtremum a b L x⊢ ∀ t ∈ Ioo a b, lagrangianPartialX L x t = deriv (lagrangianPartialV L x) t All goals completed! 🐙
#23
How produced

Solved completely autonomously without human intervention

Runge's theorem
runge_theorem

Verso theorem preview

theorem declaration uses `sorry`runge (K : Set ℂ) (_hK : IsCompact K) (U : Set ℂ) (_hU : IsOpen U) (_hKU : K ⊆ U) (f : ℂ → ℂ) (_hf : AnalyticOnNhd ℂ f U) (ε : ℝ) (_hε : 0 < ε) : ∃ p q : ℂ[X], (∀ z ∈ K, q.eval z ≠ 0) ∧ (∀ z ∈ K, ‖f z - p.eval z / q.eval z‖ < ε) := K:Set ℂ_hK:IsCompact KU:Set ℂ_hU:IsOpen U_hKU:K ⊆ Uf:ℂ → ℂ_hf:AnalyticOnNhd ℂ f Uε:ℝ_hε:0 < ε⊢ ∃ p q, (∀ z ∈ K, Polynomial.eval z q ≠ 0) ∧ ∀ z ∈ K, ‖f z - Polynomial.eval z p / Polynomial.eval z q‖ < ε All goals completed! 🐙
#24
How produced

Solved completely autonomously without human intervention

Schauder fixed-point theorem
schauder_fixed_point

Verso theorem preview

theorem declaration uses `sorry`schauder_fixed_point {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [CompleteSpace E] {K : Set E} (_hK_compact : IsCompact K) (_hK_convex : Convex ℝ K) (_hK_nonempty : K.Nonempty) (f : E → E) (_hf_cont : ContinuousOn f K) (_hf_maps : Set.MapsTo f K K) : ∃ x ∈ K, f x = x := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:CompleteSpace EK:Set E_hK_compact:IsCompact K_hK_convex:Convex ℝ K_hK_nonempty:K.Nonemptyf:E → E_hf_cont:ContinuousOn f K_hf_maps:Set.MapsTo f K K⊢ ∃ x ∈ K, f x = x All goals completed! 🐙
#25
How produced

The solution used brouwer_fixed_point. Brouwer fixed-point theorem was first proved by Aleph and then manually inlined. Other than that, the solutions were produced autonomously.

Existence of a non-isotopic pair of oriented two-component links
exists_nonisotopic_link

Verso theorem preview

theorem declaration uses `sorry`exists_nonisotopic_link : ∃ L₁ L₂ : LeanEval.KnotTheory.TwoLink, ¬ L₁.Isotopic L₂ := ⊢ ∃ L₁ L₂, ¬L₁.Isotopic L₂ All goals completed! 🐙
#26
How produced

Solved completely autonomously without human intervention

Schur-Weyl duality: GL(V) image equals centralizer of S_k image
glAction_range_eq_centralizer_symAction

Verso theorem preview

theorem declaration uses `sorry`glAction_range_eq_centralizer_symAction {R : Type*} [Field R] {M : Type*} [AddCommGroup M] [Module R M] [FiniteDimensional R M] {k : ℕ} [Invertible (k.factorial : R)] : Algebra.adjoin R (Set.range (LeanEval.RepresentationTheory.glAction R M k)) = Subalgebra.centralizer R (Set.range (LeanEval.RepresentationTheory.symAction R M k)) := R:Type u_1inst✝⁴:Field RM:Type u_2inst✝³:AddCommGroup Minst✝²:Module R Minst✝¹:FiniteDimensional R Mk:ℕinst✝:Invertible ↑k.factorial⊢ Algebra.adjoin R (Set.range ⇑(glAction R M k)) = Subalgebra.centralizer R (Set.range ⇑(symAction R M k)) All goals completed! 🐙
#27
How produced

Solved completely autonomously without human intervention

Burnside p^a q^b theorem
finite_group_isSolvable_of_card_eq_prime_pow_mul_prime_pow

Verso theorem preview

theorem declaration uses `sorry`finite_group_isSolvable_of_card_eq_prime_pow_mul_prime_pow {G : Type*} [Group G] [Fintype G] {p q a b : ℕ} (hp : Nat.Prime p) (hq : Nat.Prime q) (hpq : p ≠ q) (hcard : Fintype.card G = p ^ a * q ^ b) : Group.IsSolvable G := G:Type u_1inst✝¹:Group Ginst✝:Fintype Gp:ℕq:ℕa:ℕb:ℕhp:Nat.Prime phq:Nat.Prime qhpq:p ≠ qhcard:Fintype.card G = p ^ a * q ^ b⊢ Group.IsSolvable G All goals completed! 🐙
#28
How produced

Solved completely autonomously without human intervention

Abel–Ruffini theorem
abel_ruffini

Verso theorem preview

theorem declaration uses `sorry`abel_ruffini (n : ℕ) (_hn : 1 ≤ n) : (∀ p : ℚ[X], p.natDegree = n → ∀ x : ℂ, aeval x p = 0 → x ∈ solvableByRad ℚ ℂ) ↔ n ≤ 4 := n:ℕ_hn:1 ≤ n⊢ (∀ (p : ℚ[X]), p.natDegree = n → ∀ (x : ℂ), (aeval x) p = 0 → x ∈ solvableByRad ℚ ℂ) ↔ n ≤ 4 All goals completed! 🐙
#29
How produced

Solved completely autonomously without human intervention

Wiener's atom-detection formula
wiener_atom_detection

Verso theorem preview

theorem declaration uses `sorry`wiener_atom_detection (μ : Measure (AddCircle (2 * Real.pi))) [IsProbabilityMeasure μ] : Tendsto (fun N : ℕ => (1 / (N : ℝ)) * ∑ k ∈ Finset.Icc (1 : ℤ) N, ‖fourierCoeffMeasure μ k‖ ^ 2) atTop (𝓝 (∑' x : AddCircle (2 * Real.pi), ((μ {x}).toReal) ^ 2)) := μ:Measure (AddCircle (2 * π))inst✝:IsProbabilityMeasure μ⊢ Tendsto (fun N => 1 / ↑N * ∑ k ∈ Finset.Icc 1 ↑N, ‖fourierCoeffMeasure μ k‖ ^ 2) atTop (𝓝 (∑' (x : AddCircle (2 * π)), (μ {x}).toReal ^ 2)) All goals completed! 🐙
#30
How produced

Solved completely autonomously without human intervention

Brouwer fixed-point theorem
brouwer_fixed_point

Verso theorem preview

theorem declaration uses `sorry`brouwer_fixed_point {d : ℕ} {K : Set (EuclideanSpace ℝ (Fin d))} (_hK_compact : IsCompact K) (_hK_convex : Convex ℝ K) (_hK_nonempty : K.Nonempty) (f : EuclideanSpace ℝ (Fin d) → EuclideanSpace ℝ (Fin d)) (_hf_cont : ContinuousOn f K) (_hf_maps : MapsTo f K K) : ∃ x ∈ K, f x = x := d:ℕK:Set (EuclideanSpace ℝ (Fin d))_hK_compact:IsCompact K_hK_convex:Convex ℝ K_hK_nonempty:K.Nonemptyf:EuclideanSpace ℝ (Fin d) → EuclideanSpace ℝ (Fin d)_hf_cont:ContinuousOn f K_hf_maps:MapsTo f K K⊢ ∃ x ∈ K, f x = x All goals completed! 🐙
#31
How produced

First attempt used `pin_sphere_n_mulEquiv_int` which Aleph can't prove yet. For the second attempt we asked Aleph to use Milnor's proof instead and to avoid "`HomotopyGroup.Pi`, `pin_sphere_n_mulEquiv_int`, `pi1_circle_mulEquiv_int`, singular/cellular homology, or fundamental groups. Mathlib's algebraic-topology infrastructure is too thin to prove "S^(d-1) is not contractible"(that was human judgement).

Bing's house with two rooms is contractible
contractibleSpace_houseWithTwoRooms

Verso theorem preview

theorem declaration uses `sorry`contractibleSpace_houseWithTwoRooms : ContractibleSpace LeanEval.Topology.HouseWithTwoRooms := ⊢ ContractibleSpace ↑HouseWithTwoRooms All goals completed! 🐙
#32
How produced

Solved completely autonomously without human intervention

von Neumann double commutant theorem
vonNeumann_doubleCommutant_tfae

Verso theorem preview

theorem declaration uses `sorry`vonNeumann_doubleCommutant_tfae {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H] (S : StarSubalgebra ℂ (H →L[ℂ] H)) : List.TFAE [ Set.centralizer (Set.centralizer (S : Set (H →L[ℂ] H))) = S , IsClosed (ContinuousLinearMapWOT.ofCLM '' (S : Set (H →L[ℂ] H))) , IsClosed (ContinuousLinearMap.toPointwiseConvergenceCLM ℂ (RingHom.id ℂ) H H '' (S : Set (H →L[ℂ] H))) ] := H:Type u_1inst✝²:NormedAddCommGroup Hinst✝¹:InnerProductSpace ℂ Hinst✝:CompleteSpace HS:StarSubalgebra ℂ (H →L[ℂ] H)⊢ [(↑S).centralizer.centralizer = ↑S, IsClosed (ContinuousLinearMapWOT.ofCLM '' ↑S), IsClosed (⇑(ContinuousLinearMap.toPointwiseConvergenceCLM ℂ (RingHom.id ℂ) H H) '' ↑S)].TFAE All goals completed! 🐙
#33
How produced

Solved completely autonomously without human intervention

Koszul formula
koszul_formula

Verso theorem preview

theorem declaration uses `sorry`koszul_formula {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] [CompleteSpace E] {H : Type*} [TopologicalSpace H] {I : ModelWithCorners ℝ E H} {M : Type*} [TopologicalSpace M] [ChartedSpace H M] [IsManifold I ∞ M] [RiemannianBundle (fun (x : M) ↦ TangentSpace I x)] [IsContMDiffRiemannianBundle I ∞ E (fun (x : M) ↦ TangentSpace I x)] (cov : CovariantDerivative I E (TangentSpace I (M := M))) [ContMDiffCovariantDerivative cov ∞] (_htor : cov.torsion = 0) (_hmet : LeanEval.Geometry.KoszulFormula.IsMetricCompatible cov) (X Y Z : Π x : M, TangentSpace I x) (_hX : CMDiff ∞ (T% X)) (_hY : CMDiff ∞ (T% Y)) (_hZ : CMDiff ∞ (T% Z)) (x : M) : 2 * inner ℝ (cov Y x (X x)) (Z x) = mvfderiv I (fun y : M => inner ℝ (Y y) (Z y)) x (X x) + mvfderiv I (fun y : M => inner ℝ (X y) (Z y)) x (Y x) - mvfderiv I (fun y : M => inner ℝ (X y) (Y y)) x (Z x) - inner ℝ (X x) (mlieBracket I Y Z x) - inner ℝ (Y x) (mlieBracket I X Z x) + inner ℝ (Z x) (mlieBracket I X Y x) := E:Type u_1inst✝¹⁰:NormedAddCommGroup Einst✝⁹:NormedSpace ℝ Einst✝⁸:FiniteDimensional ℝ Einst✝⁷:CompleteSpace EH:Type u_2inst✝⁶:TopologicalSpace HI:ModelWithCorners ℝ E HM:Type u_3inst✝⁵:TopologicalSpace Minst✝⁴:ChartedSpace H Minst✝³:IsManifold I ∞ Minst✝²:RiemannianBundle fun x => TangentSpace I xinst✝¹:IsContMDiffRiemannianBundle I ∞ E fun x => TangentSpace I xcov:CovariantDerivative I E (TangentSpace I)inst✝:cov.ContMDiffCovariantDerivative ∞_htor:cov.torsion = 0_hmet:LeanEval.Geometry.KoszulFormula.IsMetricCompatible covX:(x : M) → TangentSpace I xY:(x : M) → TangentSpace I xZ:(x : M) → TangentSpace I x_hX:ContMDiff I I.tangent ∞ (T% X)_hY:ContMDiff I I.tangent ∞ (T% Y)_hZ:ContMDiff I I.tangent ∞ (T% Z)x:M⊢ 2 * Inner.inner ℝ ((↑cov Y x) (X x)) (Z x) = ((d% fun y => Inner.inner ℝ (Y y) (Z y)) x) (X x) + ((d% fun y => Inner.inner ℝ (X y) (Z y)) x) (Y x) - ((d% fun y => Inner.inner ℝ (X y) (Y y)) x) (Z x) - Inner.inner ℝ (X x) (mlieBracket I Y Z x) - Inner.inner ℝ (Y x) (mlieBracket I X Z x) + Inner.inner ℝ (Z x) (mlieBracket I X Y x) All goals completed! 🐙
#34
How produced

Solved completely autonomously without human intervention

Real cyclotomic integer with house at most 2
cyclotomic_integer_house_le_two

Verso theorem preview

theorem declaration uses `sorry`cyclotomic_integer_house_le_two {K : Type*} [Field K] [NumberField K] [Algebra ℚ K] (n : ℕ) [NeZero n] [IsCyclotomicExtension {n} ℚ K] {β : K} (hβ_int : IsIntegral ℤ β) (hβ_real : β ∈ NumberField.maximalRealSubfield K) : house β ≤ 2 → house β = 2 ∨ ∃ m : ℕ, 0 < m ∧ house β = 2 * Real.cos (Real.pi / m) := K:Type u_1inst✝⁴:Field Kinst✝³:NumberField Kinst✝²:Algebra ℚ Kn:ℕinst✝¹:NeZero ninst✝:IsCyclotomicExtension {n} ℚ Kβ:Khβ_int:IsIntegral ℤ βhβ_real:β ∈ maximalRealSubfield K⊢ house β ≤ 2 → house β = 2 ∨ ∃ m, 0 < m ∧ house β = 2 * Real.cos (Real.pi / ↑m) All goals completed! 🐙
#35
How produced

Solved completely autonomously without human intervention

Linear ODE with negative-real-part eigenvalues is asymptotically stable
linear_ode_asymptotic_stability

Verso theorem preview

theorem declaration uses `sorry`linear_ode_asymptotic_stability (n : ℕ) (A : Matrix (Fin n) (Fin n) ℝ) (hA : ∀ μ : ℂ, Module.End.HasEigenvalue (Matrix.toLin' (A.map (algebraMap ℝ ℂ))) μ → μ.re < 0) (x : ℝ → (Fin n → ℝ)) (hx : ∀ t : ℝ, 0 < t → HasDerivAt x (A.mulVec (x t)) t) : Filter.Tendsto (fun t : ℝ => ‖x t‖) Filter.atTop (nhds 0) := n:ℕA:Matrix (Fin n) (Fin n) ℝhA:∀ (μ : ℂ), Module.End.HasEigenvalue (Matrix.toLin' (A.map ⇑(algebraMap ℝ ℂ))) μ → μ.re < 0x:ℝ → Fin n → ℝhx:∀ (t : ℝ), 0 < t → HasDerivAt x (A *ᵥ x t) t⊢ Filter.Tendsto (fun t => ‖x t‖) Filter.atTop (nhds 0) All goals completed! 🐙
#36
How produced

Solved completely autonomously without human intervention

Linear programming: maximum principle and vertex optimality
lp_maximum_principle

Verso theorem preview

/-- **Maximum principle for linear programming** (§101). A local maximiser of the LP objective on the feasible region is automatically a global maximiser; and whenever the objective is non-constant (`c ≠ 0`), the maximiser lies on the topological frontier of the feasible region. -/ theorem declaration uses `sorry`lp_maximum_principle {m n : ℕ} (lp : LinearProgram m n) (x : Fin m → ℝ) (_hx : x ∈ lp.feasible) (_hlocal : IsLocalMaxOn lp.objective lp.feasible x) : IsMaxOn lp.objective lp.feasible x ∧ (lp.c ≠ 0 → x ∈ frontier lp.feasible) := m:ℕn:ℕlp:LinearProgram m nx:Fin m → ℝ_hx:x ∈ lp.feasible_hlocal:IsLocalMaxOn lp.objective lp.feasible x⊢ IsMaxOn lp.objective lp.feasible x ∧ (lp.c ≠ 0 → x ∈ frontier lp.feasible) All goals completed! 🐙
/-- **Vertex optimality** (§101; the existence content of Dantzig's 1947 simplex algorithm). Every linear program with a nonempty bounded feasible region admits a global maximiser that is an extreme point (vertex) of the feasible region. -/ theorem declaration uses `sorry`simplex_algorithm {m n : ℕ} (lp : LinearProgram m n) (_hfeas : lp.feasible.Nonempty) (_hbdd : Bornology.IsBounded lp.feasible) : ∃ x ∈ lp.feasible, IsMaxOn lp.objective lp.feasible x ∧ x ∈ Set.extremePoints ℝ lp.feasible := m:ℕn:ℕlp:LinearProgram m n_hfeas:lp.feasible.Nonempty_hbdd:Bornology.IsBounded lp.feasible⊢ ∃ x ∈ lp.feasible, IsMaxOn lp.objective lp.feasible x ∧ x ∈ Set.extremePoints ℝ lp.feasible All goals completed! 🐙
#37
How produced

Solved completely autonomously without human intervention

Bourbaki's locally convex extension of Banach–Alaoglu
banach_alaoglu_bourbaki

Verso theorem preview

theorem declaration uses `sorry`banach_alaoglu_bourbaki (E : Type*) [AddCommGroup E] [Module ℝ E] [TopologicalSpace E] [ContinuousAdd E] [ContinuousSMul ℝ E] [LocallyConvexSpace ℝ E] (U : Set E) (_hU : U ∈ 𝓝 (0 : E)) : IsCompact (LeanEval.Analysis.weakStarPolar E U) := E:Type u_1inst✝⁵:AddCommGroup Einst✝⁴:Module ℝ Einst✝³:TopologicalSpace Einst✝²:ContinuousAdd Einst✝¹:ContinuousSMul ℝ Einst✝:LocallyConvexSpace ℝ EU:Set E_hU:U ∈ 𝓝 0⊢ IsCompact (weakStarPolar E U) All goals completed! 🐙
#38
How produced

Solved completely autonomously without human intervention

Pell solutions are convergents of √d
pell_solution_convergent

Verso theorem preview

theorem declaration uses `sorry`pell_solution_is_convergent (d : ℤ) (_hd : Squarefree d) (_hd0 : 0 < d) (x y : ℤ) (_hx : 0 < x) (_hy : 0 < y) (_hsol : x ^ 2 - d * y ^ 2 = 1) : ∃ n : ℕ, (GenContFract.of (Real.sqrt (d : ℝ))).convs n = (x : ℝ) / (y : ℝ) := d:ℤ_hd:Squarefree d_hd0:0 < dx:ℤy:ℤ_hx:0 < x_hy:0 < y_hsol:x ^ 2 - d * y ^ 2 = 1⊢ ∃ n, (GenContFract.of √↑d).convs n = ↑x / ↑y All goals completed! 🐙
#39
How produced

Solved completely autonomously without human intervention

Symplectic matrices have determinant 1
symplectic_matrix_det

Verso theorem preview

theorem declaration uses `sorry`symplectic_matrix_det {l R : Type*} [DecidableEq l] [Fintype l] [CommRing R] {A : Matrix (l ⊕ l) (l ⊕ l) R} (_hA : A ∈ Matrix.symplecticGroup l R) : A.det = 1 := l:Type u_1R:Type u_2inst✝²:DecidableEq linst✝¹:Fintype linst✝:CommRing RA:Matrix (l ⊕ l) (l ⊕ l) R_hA:A ∈ symplecticGroup l R⊢ A.det = 1 All goals completed! 🐙
#40
How produced

Solved completely autonomously without human intervention

Rouche theorem via zero counting
rouche_zero_count_eq

Verso theorem preview

theorem declaration uses `sorry`rouche_zero_count_eq {f g : ℂ → ℂ} {R : ℝ} (hR : 0 < R) (hf : MeromorphicNFOn f Set.univ) (hg : AnalyticOn ℂ g Set.univ) (hbound : ∀ z : ℂ, ‖z‖ = R → ‖g z‖ < ‖f z‖) : (∑ᶠ z, ((divisor (f + g) (Metric.closedBall 0 R))⁺) z) = (∑ᶠ z, ((divisor f (Metric.closedBall 0 R))⁺) z) := f:ℂ → ℂg:ℂ → ℂR:ℝhR:0 < Rhf:MeromorphicNFOn f Set.univhg:AnalyticOn ℂ g Set.univhbound:∀ (z : ℂ), ‖z‖ = R → ‖g z‖ < ‖f z‖⊢ ∑ᶠ (z : ℂ), (divisor (f + g) (Metric.closedBall 0 R))⁺ z = ∑ᶠ (z : ℂ), (divisor f (Metric.closedBall 0 R))⁺ z All goals completed! 🐙
#41
How produced

Solved completely autonomously without human intervention

Perron-Frobenius for irreducible nonnegative matrices
irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius

Verso theorem preview

theorem declaration uses `sorry`irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius {n : Type*} [Fintype n] [DecidableEq n] [Nonempty n] (A : Matrix n n ℝ) (hA : A.IsIrreducible) : ∃ v : n → ℝ, Module.End.HasEigenvector (Matrix.toLin' A) (spectralRadius ℝ A).toReal v ∧ (∀ i, 0 < v i) := n:Type u_1inst✝²:Fintype ninst✝¹:DecidableEq ninst✝:Nonempty nA:Matrix n n ℝhA:A.IsIrreducible⊢ ∃ v, Module.End.HasEigenvector (Matrix.toLin' A) (spectralRadius ℝ A).toReal v ∧ ∀ (i : n), 0 < v i All goals completed! 🐙
#42
How produced

Solved completely autonomously without human intervention

Complementary polynomial on the unit circle
exists_complementary_polynomial_on_unit_circle

Verso theorem preview

theorem declaration uses `sorry`exists_complementary_polynomial_on_unit_circle (P : ℂ[X]) (hP : ∀ z : Circle, ‖P.eval (z : ℂ)‖ ≤ 1) : ∃ Q : ℂ[X], Q.natDegree ≤ P.natDegree ∧ ∀ z : Circle, ‖P.eval (z : ℂ)‖ ^ 2 + ‖Q.eval (z : ℂ)‖ ^ 2 = 1 := P:ℂ[X]hP:∀ (z : Circle), ‖eval (↑z) P‖ ≤ 1⊢ ∃ Q, Q.natDegree ≤ P.natDegree ∧ ∀ (z : Circle), ‖eval (↑z) P‖ ^ 2 + ‖eval (↑z) Q‖ ^ 2 = 1 All goals completed! 🐙
#43
How produced

Solved completely autonomously without human intervention

Gaussian heat kernel solves the 1D heat equation
heat_kernel_solves_heat_equation

Verso theorem preview

theorem declaration uses `sorry`heat_kernel_solves_heat_equation (f : ℝ → ℝ) (hf_cont : Continuous f) (hf_bdd : ∃ M : ℝ, ∀ x, |f x| ≤ M) : -- The PDE on (0, ∞) × ℝ. (∀ t : ℝ, 0 < t → ∀ x : ℝ, ∃ ux : ℝ → ℝ, ∃ uxx : ℝ, (∀ y : ℝ, HasDerivAt (fun z => heatSolution f t z) (ux y) y) ∧ HasDerivAt ux uxx x ∧ HasDerivAt (fun s => heatSolution f s x) uxx t) ∧ -- Initial condition recovered as a one-sided limit at t = 0. (∀ x : ℝ, Filter.Tendsto (fun t : ℝ => heatSolution f t x) (nhdsWithin (0 : ℝ) (Set.Ioi 0)) (nhds (f x))) := f:ℝ → ℝhf_cont:Continuous fhf_bdd:∃ M, ∀ (x : ℝ), |f x| ≤ M⊢ (∀ (t : ℝ), 0 < t → ∀ (x : ℝ), ∃ ux uxx, (∀ (y : ℝ), HasDerivAt (fun z => heatSolution f t z) (ux y) y) ∧ HasDerivAt ux uxx x ∧ HasDerivAt (fun s => heatSolution f s x) uxx t) ∧ ∀ (x : ℝ), Filter.Tendsto (fun t => heatSolution f t x) (nhdsWithin 0 (Set.Ioi 0)) (nhds (f x)) All goals completed! 🐙
#44
How produced

Solved completely autonomously without human intervention

Minkowski-Caratheodory theorem
mem_convexHull_finset_extremePoints_of_mem_compact_convex

Verso theorem preview

theorem declaration uses `sorry`mem_convexHull_finset_extremePoints_of_mem_compact_convex {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] {s : Set E} {x : E} (hscomp : IsCompact s) (hsconv : Convex ℝ s) (hx : x ∈ s) : ∃ t : Finset E, (↑t : Set E) ⊆ s.extremePoints ℝ ∧ t.card ≤ Module.finrank ℝ E + 1 ∧ x ∈ convexHull ℝ (↑t : Set E) := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:FiniteDimensional ℝ Es:Set Ex:Ehscomp:IsCompact shsconv:Convex ℝ shx:x ∈ s⊢ ∃ t, ↑t ⊆ extremePoints ℝ s ∧ t.card ≤ Module.finrank ℝ E + 1 ∧ x ∈ (convexHull ℝ) ↑t All goals completed! 🐙
#45
How produced

Solved completely autonomously without human intervention

Character values of finite groups lie in cyclotomic fields
brauer_character_in_cyclotomic

Verso theorem preview

theorem declaration uses `sorry`brauer_character_in_cyclotomic (G : Type) [Group G] [Fintype G] : ∃ φ : CyclotomicField (Monoid.exponent G) ℚ →+* ℂ, ∀ (V : Type) (_ : AddCommGroup V) (_ : Module ℂ V) (_ : FiniteDimensional ℂ V) (ρ : Representation ℂ G V) (g : G), LinearMap.trace ℂ V (ρ g) ∈ φ.range := G:Typeinst✝¹:Group Ginst✝:Fintype G⊢ ∃ φ, ∀ (V : Type) (x : AddCommGroup V) (x_1 : Module ℂ V), FiniteDimensional ℂ V → ∀ (ρ : Representation ℂ G V) (g : G), (LinearMap.trace ℂ V) (ρ g) ∈ φ.range All goals completed! 🐙
#46
How produced

Solved completely autonomously without human intervention

Oppenheim's inequality for Hadamard products
oppenheim_inequality

Verso theorem preview

theorem declaration uses `sorry`oppenheim_inequality {n : Type*} [Fintype n] [DecidableEq n] {A B : Matrix n n ℝ} (hA : A.PosSemidef) (hB : B.PosSemidef) : A.det * ∏ i, B i i ≤ (A ⊙ B).det := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℝB:Matrix n n ℝhA:A.PosSemidefhB:B.PosSemidef⊢ A.det * ∏ i, B i i ≤ (A ⊙ B).det All goals completed! 🐙
#47
How produced

Solved completely autonomously without human intervention

pi_1 of the circle is Z
pi1_circle_mulEquiv_int

Verso theorem preview

theorem declaration uses `sorry`pi1_circle_mulEquiv_int : Nonempty (HomotopyGroup.Pi 1 Circle (1 : Circle) ≃* Multiplicative ℤ) := ⊢ Nonempty (HomotopyGroup.Pi 1 Circle 1 ≃* Multiplicative ℤ) All goals completed! 🐙
#48
How produced

Solved completely autonomously without human intervention

Dirichlet eigenvalues of -y'' = lambda y on [0,pi] are n^2
dirichlet_eigenvalues_eq_nat_sq

Verso theorem preview

theorem declaration uses `sorry`dirichlet_eigenvalues_eq_nat_sq (lam : ℝ) : (∃ (y : ℝ → ℝ) (J : Set ℝ), IsOpen J ∧ Set.Icc (0 : ℝ) Real.pi ⊆ J ∧ (∀ x ∈ J, HasDerivAt y (deriv y x) x) ∧ (∀ x ∈ J, HasDerivAt (deriv y) (-(lam * y x)) x) ∧ y 0 = 0 ∧ y Real.pi = 0 ∧ ∃ x ∈ Set.Ioo (0 : ℝ) Real.pi, y x ≠ 0) ↔ ∃ n : ℕ, 0 < n ∧ lam = (n : ℝ) ^ 2 := lam:ℝ⊢ (∃ y J, IsOpen J ∧ Set.Icc 0 π ⊆ J ∧ (∀ x ∈ J, HasDerivAt y (deriv y x) x) ∧ (∀ x ∈ J, HasDerivAt (deriv y) (-(lam * y x)) x) ∧ y 0 = 0 ∧ y π = 0 ∧ ∃ x ∈ Set.Ioo 0 π, y x ≠ 0) ↔ ∃ n, 0 < n ∧ lam = ↑n ^ 2 All goals completed! 🐙
#49
How produced

Solved completely autonomously without human intervention

Entrywise exponential of a PSD matrix is PSD
posSemidef_map_exp

Verso theorem preview

theorem declaration uses `sorry`posSemidef_map_exp {n : Type*} [Fintype n] [DecidableEq n] {A : Matrix n n ℝ} (hA : A.PosSemidef) : (A.map Real.exp).PosSemidef := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℝhA:A.PosSemidef⊢ (A.map Real.exp).PosSemidef All goals completed! 🐙
#50
How produced

Solved completely autonomously without human intervention

Sturm separation theorem
sturm_separation

Verso theorem preview

theorem declaration uses `sorry`sturm_separation (p q y₁ y₂ : ℝ → ℝ) (a b : ℝ) (hab : a < b) (J : Set ℝ) (hJ_open : IsOpen J) (hJ_conn : IsPreconnected J) (hJ_sub : Set.Icc a b ⊆ J) (hp : ContinuousOn p J) (hq : ContinuousOn q J) (hy₁ : ∀ x ∈ J, HasDerivAt y₁ (deriv y₁ x) x) (hy₁' : ∀ x ∈ J, HasDerivAt (deriv y₁) (-(p x * deriv y₁ x + q x * y₁ x)) x) (hy₂ : ∀ x ∈ J, HasDerivAt y₂ (deriv y₂ x) x) (hy₂' : ∀ x ∈ J, HasDerivAt (deriv y₂) (-(p x * deriv y₂ x + q x * y₂ x)) x) (hW : ∃ x₀ ∈ J, y₁ x₀ * deriv y₂ x₀ - y₂ x₀ * deriv y₁ x₀ ≠ 0) (hza : y₁ a = 0) (hzb : y₁ b = 0) (hne : ∀ x ∈ Set.Ioo a b, y₁ x ≠ 0) : ∃! c, c ∈ Set.Ioo a b ∧ y₂ c = 0 := p:ℝ → ℝq:ℝ → ℝy₁:ℝ → ℝy₂:ℝ → ℝa:ℝb:ℝhab:a < bJ:Set ℝhJ_open:IsOpen JhJ_conn:IsPreconnected JhJ_sub:Set.Icc a b ⊆ Jhp:ContinuousOn p Jhq:ContinuousOn q Jhy₁:∀ x ∈ J, HasDerivAt y₁ (deriv y₁ x) xhy₁':∀ x ∈ J, HasDerivAt (deriv y₁) (-(p x * deriv y₁ x + q x * y₁ x)) xhy₂:∀ x ∈ J, HasDerivAt y₂ (deriv y₂ x) xhy₂':∀ x ∈ J, HasDerivAt (deriv y₂) (-(p x * deriv y₂ x + q x * y₂ x)) xhW:∃ x₀ ∈ J, y₁ x₀ * deriv y₂ x₀ - y₂ x₀ * deriv y₁ x₀ ≠ 0hza:y₁ a = 0hzb:y₁ b = 0hne:∀ x ∈ Set.Ioo a b, y₁ x ≠ 0⊢ ∃! c, c ∈ Set.Ioo a b ∧ y₂ c = 0 All goals completed! 🐙
#51
How produced

Solved completely autonomously without human intervention

Polynomial decay rate of y' = -y^3
cubic_decay_asymptotic

Verso theorem preview

theorem declaration uses `sorry`cubic_decay_asymptotic (y : ℝ → ℝ) (hy_diff : ∀ t : ℝ, 0 < t → HasDerivAt y (-(y t) ^ 3) t) (hy_cont : ContinuousWithinAt y (Set.Ici 0) 0) (hy0 : y 0 = 1) : Tendsto (fun t : ℝ => y t * Real.sqrt t) atTop (𝓝 (1 / Real.sqrt 2)) := y:ℝ → ℝhy_diff:∀ (t : ℝ), 0 < t → HasDerivAt y (-y t ^ 3) thy_cont:ContinuousWithinAt y (Set.Ici 0) 0hy0:y 0 = 1⊢ Tendsto (fun t => y t * √t) atTop (𝓝 (1 / √2)) All goals completed! 🐙
#52
How produced

Solved completely autonomously without human intervention

Cayley graph connected iff generators generate the group
mulCayley_connected_iff_closure_eq_top

Verso theorem preview

theorem declaration uses `sorry`mulCayley_connected_iff_closure_eq_top {G : Type*} [Group G] (S : Set G) : (SimpleGraph.mulCayley S).Connected ↔ Subgroup.closure S = ⊤ := G:Type u_1inst✝:Group GS:Set G⊢ (SimpleGraph.mulCayley S).Connected ↔ Subgroup.closure S = ⊤ All goals completed! 🐙
#53
How produced

Solved completely autonomously without human intervention

Comparison principle for the Dirichlet BVP
bvp_comparison

Verso theorem preview

theorem declaration uses `sorry`bvp_comparison (J : Set ℝ) (hJ_open : IsOpen J) (hJ_sub : Set.Icc (0 : ℝ) 1 ⊆ J) (u v : ℝ → ℝ) (hu : ∀ x ∈ J, HasDerivAt u (deriv u x) x) (hu' : ∀ x ∈ J, HasDerivAt (deriv u) (deriv (deriv u) x) x) (hv : ∀ x ∈ J, HasDerivAt v (deriv v x) x) (hv' : ∀ x ∈ J, HasDerivAt (deriv v) (deriv (deriv v) x) x) (hineq : ∀ x ∈ Set.Ioo (0 : ℝ) 1, -deriv (deriv u) x ≤ -deriv (deriv v) x) (hu0 : u 0 ≤ v 0) (hu1 : u 1 ≤ v 1) : ∀ x ∈ Set.Icc (0 : ℝ) 1, u x ≤ v x := J:Set ℝhJ_open:IsOpen JhJ_sub:Set.Icc 0 1 ⊆ Ju:ℝ → ℝv:ℝ → ℝhu:∀ x ∈ J, HasDerivAt u (deriv u x) xhu':∀ x ∈ J, HasDerivAt (deriv u) (deriv (deriv u) x) xhv:∀ x ∈ J, HasDerivAt v (deriv v x) xhv':∀ x ∈ J, HasDerivAt (deriv v) (deriv (deriv v) x) xhineq:∀ x ∈ Set.Ioo 0 1, -deriv (deriv u) x ≤ -deriv (deriv v) xhu0:u 0 ≤ v 0hu1:u 1 ≤ v 1⊢ ∀ x ∈ Set.Icc 0 1, u x ≤ v x All goals completed! 🐙
#54
How produced

Solved completely autonomously without human intervention

Finite Ramsey theorem for graphs
finite_graph_ramsey_theorem

Verso theorem preview

theorem declaration uses `sorry`finite_graph_ramsey_theorem : ∀ r s : ℕ, 2 ≤ r → 2 ≤ s → ∃ n : ℕ, ∀ G : SimpleGraph (Fin n), ¬ G.CliqueFree r ∨ ¬ Gᶜ.CliqueFree s := ⊢ ∀ (r s : ℕ), 2 ≤ r → 2 ≤ s → ∃ n, ∀ (G : SimpleGraph (Fin n)), ¬G.CliqueFree r ∨ ¬Gᶜ.CliqueFree s All goals completed! 🐙
#55
How produced

Solved without human intervention. Then manual one-line fix applied for 4.30 because, as of now, Aleph only supports lean/mathlib versions up to 4.29. ``` 34 - exact ⟨(SimpleGraph.Embedding.induce S).comp f⟩ 34 + exact ⟨(SimpleGraph.Copy.induce G S).comp f⟩ ```

Catalan generating function via compositional inversion
substInv_X_sub_X_sq_eq_catalan

Verso theorem preview

theorem declaration uses `sorry`substInv_X_sub_X_sq_eq_catalan (n : ℕ) : haveI : Invertible (coeff 1 ((X : ℚ⟦X⟧) - X ^ 2)) := n:ℕ⊢ Invertible ((coeff 1) (X - X ^ 2)) n:ℕ⊢ Invertible 1; All goals completed! 🐙 coeff (n + 1) (substInv ((X : ℚ⟦X⟧) - X ^ 2)) = (Nat.choose (2 * n) n : ℚ) / (↑n + 1) := n:ℕ⊢ (coeff (n + 1)) (X - X ^ 2).substInv = ↑((2 * n).choose n) / (↑n + 1) All goals completed! 🐙
#56
How produced

Solved completely autonomously without human intervention

First submissionMay 8, 2026
Last submissionJun 5, 2026
mayorov-m-a52antpavzhi4
12Midas39 solved
New large value estimates for Dirichlet polynomials
annals_large_value_estimates

Verso theorem preview

theorem declaration uses `sorry`theorem_1_1 : ∃ o : ℝ → ℝ, o =o[Filter.atTop] (1 : ℝ → ℝ) ∧ ∀ (b : ℕ → ℂ) (_hb : ∀ n, ‖b n‖ ≤ 1) (N : ℕ) (V : ℝ) (T : ℝ) (R : ℕ) (t : Fin R → ℝ), N > 0 → V > 0 → T > 1 → -- these assumptions are necessary but not stated in the paper (∀ i j, i ≠ j → |t i - t j| ≥ 1) → (∀ i, t i ∈ Set.Icc 0 T) → (∀ r, ‖∑ n ∈ Finset.Icc N (2 * N), b n * n ^ (I * t r)‖ ≥ V) → R ≤ T ^ (o T) * bound N V T := ⊢ ∃ o, o =o[Filter.atTop] 1 ∧ ∀ (b : ℕ → ℂ), (∀ (n : ℕ), ‖b n‖ ≤ 1) → ∀ (N : ℕ) (V T : ℝ) (R : ℕ) (t : Fin R → ℝ), N > 0 → V > 0 → T > 1 → (∀ (i j : Fin R), i ≠ j → |t i - t j| ≥ 1) → (∀ (i : Fin R), t i ∈ Set.Icc 0 T) → (∀ (r : Fin R), ‖∑ n ∈ Finset.Icc N (2 * N), b n * ↑n ^ (I * ↑(t r))‖ ≥ V) → ↑R ≤ T ^ o T * bound N V T All goals completed! 🐙
#1
A negative answer to Ulam's Problem 19 from the Scottish Book
annals_ulam

Verso theorem preview

theorem declaration uses `sorry`theorem_1 (hd : 3 ≤ d) : letI : NeZero d := ⟨d:ℕhd:3 ≤ d⊢ d ≠ 0 All goals completed! 🐙⟩ ∃ K : Ulam.BodyOfRevolution d, Ulam.IsStrictlyConvexBody K.body ∧ ¬ Ulam.IsCentrallySymmetric K.body ∧ Ulam.FloatsInEquilibriumInEveryOrientationAtLevel K.body (volume.real K.body / 2) := d:ℕhd:3 ≤ d⊢ ∃ K, IsStrictlyConvexBody K.body ∧ ¬IsCentrallySymmetric K.body ∧ FloatsInEquilibriumInEveryOrientationAtLevel K.body (volume.real K.body / 2) All goals completed! 🐙
#2
Vinogradov mean value theorem
vinogradov_mean_value

Verso theorem preview

theorem declaration uses `sorry`vinogradov_mean_value (s k : ℕ) (ε : ℝ) (hε : 0 < ε) : LeanEval.NumberTheory.VinogradovMeanValue.J s k =O[Filter.atTop] fun X ↦ (X ^ (s + ε) + X ^ ((2 * s : ℝ) - k * (k + 1) / 2 + ε) : ℝ) := s:ℕk:ℕε:ℝhε:0 < ε⊢ J s k =O[Filter.atTop] fun X => ↑X ^ (↑s + ε) + ↑X ^ (2 * ↑s - ↑k * (↑k + 1) / 2 + ε) All goals completed! 🐙
#3
Lorentzian polynomials
annals_lorentzian_polynomials

Verso theorem preview

theorem declaration uses `sorry`theorem_2_25 (n d : ℕ) (hn : 0 < n) : closure (Ŀ n d) = LorentzianPolynomials.L n d := n:ℕd:ℕhn:0 < n⊢ closure (Ŀ n d) = L n d All goals completed! 🐙
#4
Schmidt's subspace theorem
schmidt_subspace

Verso theorem preview

theorem declaration uses `sorry`schmidt_subspace (σ : Type*) [Fintype σ] (hσ : 2 ≤ Fintype.card σ) (L : σ → σ → ℂ) (alg : ∀ i j, IsAlgebraic ℚ (L i j)) (ind : LinearIndependent ℂ L) (ε : ℝ) (pos : 0 < ε) : ∃ s : Finset (σ → ℤ), 0 ∉ s ∧ ∀ x : σ → ℤ, ‖∏ i, ∑ j, L i j * x j‖ < ‖x‖ ^ (-ε) → ∃ c ∈ s, ∑ i, c i * x i = 0 := σ:Type u_1inst✝:Fintype σhσ:2 ≤ Fintype.card σL:σ → σ → ℂalg:∀ (i j : σ), IsAlgebraic ℚ (L i j)ind:LinearIndependent ℂ Lε:ℝpos:0 < ε⊢ ∃ s, 0 ∉ s ∧ ∀ (x : σ → ℤ), ‖∏ i, ∑ j, L i j * ↑(x j)‖ < ‖x‖ ^ (-ε) → ∃ c ∈ s, ∑ i, c i * x i = 0 All goals completed! 🐙
#5
Flat Littlewood polynomials exist
annals_flat_littlewood_poly

Verso theorem preview

theorem declaration uses `sorry`theorem_1_1 : ∃ Δ δ : ℝ, Δ > δ ∧ δ > 0 ∧ ∀ n ≥ 2, ∃ P : ℂ[X], FlatLittlewoodPoly.IsLittlewoodPolynomial P ∧ P.natDegree = n ∧ ∀ z : ℂ, ‖z‖ = 1 → δ * √n ≤ ‖P.eval z‖ ∧ ‖P.eval z‖ ≤ Δ * √n := ⊢ ∃ Δ δ, Δ > δ ∧ δ > 0 ∧ ∀ n ≥ 2, ∃ P, IsLittlewoodPolynomial P ∧ P.natDegree = n ∧ ∀ (z : ℂ), ‖z‖ = 1 → δ * √↑n ≤ ‖Polynomial.eval z P‖ ∧ ‖Polynomial.eval z P‖ ≤ Δ * √↑n All goals completed! 🐙
#6
Pseudorandom sets in Grassmann graph have near-perfect expansion
annals_pseudorandom_grassmann

Verso theorem preview

theorem declaration uses `sorry`theorem_1_12 (α : ℝ) (hα : α ∈ Set.Ioo 0 1) : ∃ ε > 0, ∃ r, ∀ᶠ (ℓ : ℕ) (k : ℕ) in atTop, ∀ S : Finset (PseudorandomGrassmann.GrVertex k ℓ), (hS : S.Nonempty) → 2 * #S ≤ Fintype.card (PseudorandomGrassmann.GrVertex k ℓ) → Φ (PseudorandomGrassmann.Gr k ℓ) S hS ≤ α → ∃ (A B : Submodule 𝔽₂ (Fin k → 𝔽₂)), A ≤ B ∧ letI a := finrank 𝔽₂ A; letI b := k - finrank 𝔽₂ B a + b ≤ r ∧ #(S ∩ SubGr k ℓ A B) / #(SubGr k ℓ A B) ≥ (ε : ℝ) := α:ℝhα:α ∈ Set.Ioo 0 1⊢ ∃ ε > 0, ∃ r, ∀ᶠ (ℓ : ℕ) (k : ℕ) in atTop, ∀ (S : Finset (GrVertex k ℓ)) (hS : S.Nonempty), 2 * #S ≤ Fintype.card (GrVertex k ℓ) → ↑(Φ (Gr k ℓ) S hS) ≤ α → ∃ A B, A ≤ B ∧ finrank 𝔽₂ ↥A + (k - finrank 𝔽₂ ↥B) ≤ r ∧ ↑(#(S ∩ SubGr k ℓ A B)) / ↑(#(SubGr k ℓ A B)) ≥ ε All goals completed! 🐙
#7
Singularity of random Bernoulli matrices
annals_random_bernoulli_matrices

Verso theorem preview

/-- Statement of Theorem A: For every `p ∈ (0, 1/2]` and `ε > 0` there exists `N, C > 0` such that for any `n ≥ N` and any `n × n` random matrix `B` with mutually independent `Bernoulli(p)` entries, `P(σ_min (B + sIIᵀ) ≤ t/√n) ≤ (1 - p + ε)ⁿ + Ct` for all `s ∈ [-1,0]` and `t > 0`. -/ theorem declaration uses `sorry`theorem_A {p : I} {ε : ℝ} (hp₀ : 0 < p) (hp₁ : (p : ℝ) ≤ 1 / 2) (hε : 0 < ε) : ∃ N > 0, ∃ C > 0, ∀ n ≥ N, ∀ (Ω : Type*) (_mΩ : MeasurableSpace Ω) (P : Measure Ω) (B : Ω → Matrix (Fin n) (Fin n) ℝ) (_B_indep : iIndepFun (fun x : Fin n × Fin n ↦ (B · x.1 x.2)) P) (_B_bernoulli : ∀ i j, HasLaw (B · i j) (bernoulliMeasure 1 0 p) P), ∀ s : ℝ, -1 ≤ s ∧ s ≤ 0 → ∀ t : ℝ, 0 < t → P.real {ω : Ω | σ_min (B ω + of (fun _ _ ↦ s)) ≤ t / √n} ≤ (1 - p + ε) ^ n + C * t := p:↑Iε:ℝhp₀:0 < php₁:↑p ≤ 1 / 2hε:0 < ε⊢ ∃ N > 0, ∃ C > 0, ∀ n ≥ N, ∀ (Ω : Type u_1) (_mΩ : MeasurableSpace Ω) (P : Measure Ω) (B : Ω → Matrix (Fin n) (Fin n) ℝ), iIndepFun (fun x x_1 => B x_1 x.1 x.2) P → (∀ (i j : Fin n), HasLaw (fun x => B x i j) Ber(1, 0, p) P) → ∀ (s : ℝ), -1 ≤ s ∧ s ≤ 0 → ∀ (t : ℝ), 0 < t → P.real {ω | σ_min (B ω + of fun x x_1 => s) ≤ t / √↑n} ≤ (1 - ↑p + ε) ^ n + C * t All goals completed! 🐙
/-- This (unnamed) corollary appears directly below Theorem A in the paper: For every `p ∈ (0, 1/2]` and any sequence `Bₙ` of `n × n` random matrices with mutually independent `Bernoulli(p)` entries we have that `P(Bₙ is singular) = (1 - p + oₙ(1))ⁿ`. -/ theorem declaration uses `sorry`corollary_1 {p : I} (hp₀ : 0 < p) (hp₁ : (p : ℝ) ≤ 1 / 2) {Ω : ℕ → Type*} [mΩ : ∀ n, MeasurableSpace (Ω n)] {P : (n : ℕ) → Measure (Ω n)} {B : (n : ℕ) → Ω n → Matrix (Fin n) (Fin n) ℝ} (B_indep : ∀ n, iIndepFun (fun x : Fin n × Fin n ↦ (B n · x.1 x.2)) (P n)) (B_bernoulli : ∀ n i j, HasLaw (B n · i j) (bernoulliMeasure 1 0 p) (P n)) : ∃ o : ℕ → ℝ, o =o[atTop] (1 : ℕ → ℝ) ∧ ∀ n > 0, (P n).real {ω | (B n ω).det = 0} = (1 - p + o n) ^ n := p:↑Ihp₀:0 < php₁:↑p ≤ 1 / 2Ω:ℕ → Type u_1mΩ:(n : ℕ) → MeasurableSpace (Ω n)P:(n : ℕ) → Measure (Ω n)B:(n : ℕ) → Ω n → Matrix (Fin n) (Fin n) ℝB_indep:∀ (n : ℕ), iIndepFun (fun x x_1 => B n x_1 x.1 x.2) (P n)B_bernoulli:∀ (n : ℕ) (i j : Fin n), HasLaw (fun x => B n x i j) Ber(1, 0, p) (P n)⊢ ∃ o, o =o[atTop] 1 ∧ ∀ n > 0, (P n).real {ω | (B n ω).det = 0} = (1 - ↑p + o n) ^ n All goals completed! 🐙
/-- This is the result stated in the paper's abstract: For any sequence `Mₙ` of `n × n` random matrices with mutually independent `Rademacher` entries we have that `P(Mₙ is singular) = (1/2 + oₙ(1))ⁿ`. -/ theorem declaration uses `sorry`corollary_2 {Ω : ℕ → Type*} (mΩ : ∀ n, MeasurableSpace (Ω n)) {P : (n : ℕ) → Measure (Ω n)} {M : (n : ℕ) → Ω n → Matrix (Fin n) (Fin n) ℝ} (M_indep : ∀ n, iIndepFun (fun x : Fin n × Fin n ↦ (M n · x.1 x.2)) (P n)) (M_rademacher : ∀ n i j, HasLaw (M n · i j) rademacherMeasure (P n)) : ∃ o : ℕ → ℝ, o =o[atTop] (1 : ℕ → ℝ) ∧ ∀ n > 0, (P n).real {ω | (M n ω).det = 0} = (1 / 2 + o n) ^ n := Ω:ℕ → Type u_1mΩ:(n : ℕ) → MeasurableSpace (Ω n)P:(n : ℕ) → Measure (Ω n)M:(n : ℕ) → Ω n → Matrix (Fin n) (Fin n) ℝM_indep:∀ (n : ℕ), iIndepFun (fun x x_1 => M n x_1 x.1 x.2) (P n)M_rademacher:∀ (n : ℕ) (i j : Fin n), HasLaw (fun x => M n x i j) rademacherMeasure (P n)⊢ ∃ o, o =o[atTop] 1 ∧ ∀ n > 0, (P n).real {ω | (M n ω).det = 0} = (1 / 2 + o n) ^ n All goals completed! 🐙
#8
Duffin-Schaeffer conjecture
duffin_schaeffer

Verso theorem preview

theorem declaration uses `sorry`duffin_schaeffer (δ : ℕ → ℝ) (hδ : ∀ n, 0 ≤ δ n) : volume (addWellApproximable UnitAddCircle δ) = 1 ↔ ¬ Summable fun n : ℕ => n.totient * δ n := δ:ℕ → ℝhδ:∀ (n : ℕ), 0 ≤ δ n⊢ volume (addWellApproximable UnitAddCircle δ) = 1 ↔ ¬Summable fun n => ↑n.totient * δ n All goals completed! 🐙
#9
Green–Tao theorem
green_tao

Verso theorem preview

theorem declaration uses `sorry`green_tao : LeanEval.NumberTheory.ContainsArbitraryAPs {p : ℕ | Nat.Prime p} := ⊢ ContainsArbitraryAPs {p | Nat.Prime p} All goals completed! 🐙
#10
A reverse Minkowski theorem
annals_reverse_minkowski

Verso theorem preview

theorem declaration uses `sorry`theorem_1_2 (ℒ : Submodule ℤ ℝⁿ) [DiscreteTopology ℒ] (hℒ : IsZLattice ℝ ℒ) (h : ∀ ℒ' (_hℒℒ' : ℒ' ≤ ℒ) [DiscreteTopology ℒ'], determinant ℒ' ≥ 1) : let t : ℝ := 10 * (log n + 2) ρ (1 / t) ℒ ≤ 3 / 2 := n:ℕℒ:Submodule ℤ ℝⁿinst✝:DiscreteTopology ↥ℒhℒ:IsZLattice ℝ ℒh:∀ ℒ' ≤ ℒ, ∀ [inst : DiscreteTopology ↥ℒ'], determinant ℒ' ≥ 1⊢ let t := 10 * (log ↑n + 2); ρ (1 / t) ℒ ≤ 3 / 2 All goals completed! 🐙
#11
Hessian estimates for the sigma-2 equation in dimension four
annals_hessian_estimates

Verso theorem preview

theorem declaration uses `sorry`theorem_1_1 : ∃ C : ℝ≥0∞ → ℝ, ∀ (u : ℝ⁴ → ℝ) (_smooth : ContDiffOn ℝ ∞ u B₁(0)) (_bounded : ‖u‖_C¹(B₁(0)) < (∞ : ℝ≥0∞)) (_positive_branch : ∀ x ∈ B₁(0), (Δ u) x > 0) (_solution : ∀ x ∈ B₁(0), σ₂ (H u B₁(0) x) = 1), ‖H u B₁(0) 0‖_F ≤ C (‖u‖_C¹(B₁(0))) := ⊢ ∃ C, ∀ (u : ℝ⁴ → ℝ), ContDiffOn ℝ ∞ u B₁(0) → ‖u‖_C¹(B₁(0)) < ∞ → (∀ x ∈ B₁(0), Δ u x > 0) → (∀ x ∈ B₁(0), σ₂ (H u B₁(0) x) = 1) → ‖H u B₁(0) 0‖_F ≤ C ‖u‖_C¹(B₁(0)) All goals completed! 🐙
#12
The local-global conjecture for Apollonian circle packings is false
annals_local_global_apollonian_circle_packings

Lean theorem statement

/--
Statement of Theorem 1.6:

The Apollonian circle packing `A` generated by `(−3, 5, 8, 8)` has no square curvatures.
-/
theorem theorem_1_6 : ∀ n, n ^ 2 ∉ curvatureSet ⟦⟨![-3, 5, 8, 8], by decide⟩⟧ := by
  sorry

/--
Statement of Theorem 1.3:

There exist infinitely many `A` for which the number of missing curvatures up to `N` is `Ω(√N)`.
-/
theorem theorem_1_3 : {A : PrimitiveApollonianCirclePacking |
    Real.sqrt =O[Filter.atTop] missingCurvatures A}.Infinite := by
  sorry
#13
Algebraic integers with conjugates in a prescribed distribution
annals_algebraic_integers

Verso theorem preview

theorem declaration uses `sorry`theorem_1_1 : lambda_SSS < 1.89831 := ⊢ lambda_SSS < 1.89831 All goals completed! 🐙
#14
On a conjecture of Talagrand on selector processes and a consequence on positive empirical processes
annals_supremum_of_selector_processes

Lean theorem statement

/-- The constant `L` of Theorem 1.2. -/
noncomputable def L₂ : ℝ≥0 := sorry

/-- The constant of Theorem 1.2 is positive. -/
theorem L₂_pos : L₂ > 0 := sorry

/--
Statement of Theorem 1.2:

There exists `L > 0` such that for any `0 < p < 1`, finite type `X`, and set `Λ` of functions from
`X` to `ℝ≥0` such that `0 < 𝔼[sup_{f ∈ Λ} ∑ i ∈ Xp, f i] < ∞`, the collection of sets

`{s ⊆ X | sup_{f ∈ Λ} ∑ i ∈ s, f i ≥ L * 𝔼[sup_{f ∈ Λ} ∑ i ∈ Xp, f i]}`

is `p-small`, where `Xp` is a binomial random subset of `X` with parameter `p`.

Note: The assumption `0 < 𝔼[sup_{f ∈ Λ} ∑ i ∈ Xp, f i] < ∞` is not explicitly stated in the theorem
but used in the last step of the proof where `𝔼 ≥ (L/L') * 𝔼` is a contradiction for `L > L'`.
-/
theorem theorem_1_2 (p : I) (hp₀ : 0 < p) (hp₁ : p < 1) (X : Type*) [Fintype X] (Λ : Set (X → ℝ≥0))
    (hE₀ : 0 < 𝔼⁻[⨆ f ∈ Λ, ∑ i ∈ Xp, (f i : ℝ≥0∞); Xp ∼ binomialSetDistribution X p])
    (hE : 𝔼⁻[⨆ f ∈ Λ, ∑ i ∈ Xp, (f i : ℝ≥0∞); Xp ∼ binomialSetDistribution X p] < ∞) :
    IsSmall p {s : Set X | ⨆ f ∈ Λ, ∑ i ∈ s, (f i : ℝ≥0∞) ≥
        L₂ * 𝔼⁻[⨆ f ∈ Λ, ∑ i ∈ Xp, (f i : ℝ≥0∞); Xp ∼ binomialSetDistribution X p]} := by
  sorry

/-- The constant `L` of Theorem 1.3. -/
noncomputable def L₃ : ℝ≥0 := sorry

/-- The constant of Theorem 1.3 is positive. -/
theorem L₃_pos : L₃ > 0 := sorry

/--
Statement of Theorem 1.3:

There exists `L > 0` such that for any `N > 0`, i.i.d random variables `Y_1, …, Y_N` distributed
according to a Borel probability measure `ν` on a Polish space `𝕋`, if `𝓕` is a finite set of
non-negative functions in `L∞(𝕋)` and `0 < 𝔼[sup_{f ∈ 𝓕} Z Y f] < ∞` then there exists a finite
collection `𝓒` of pairs `(g, t)` where `g : 𝕋 → ℝ≥0`, `t > 0` such that

`{sup_{f ∈ 𝓕} Z N Y f ≥ L * 𝔼[sup_{f ∈ 𝓕} Z N Y f] } ⊆ ⋃ (g,t) ∈ 𝓒, {t ≤ Z N Y g}`

and

`∑ (g,t) ∈ 𝓒, P(t ≤ Z N Y g) ≤ 2⁻¹`.

Note: The requirement that the collection `𝓒` be finite is not explicitly stated in the paper.
However, `𝓒` must at least be assumed to be countable in order for the sum to make sense,
and the collections `𝓒` produced by the proof are indeed finite.

-/
theorem theorem_1_3 (N : ℕ) (N_pos : N > 0) (𝕋 : Type*) (t𝕋 : TopologicalSpace 𝕋)
    (p𝕋 : PolishSpace 𝕋)
    (m𝕋 : MeasurableSpace 𝕋) (b𝕋 : BorelSpace 𝕋) (ν : Measure 𝕋) (hν : IsProbabilityMeasure ν)
    (Ω : Type*) (mΩ : MeasurableSpace Ω) (P : Measure Ω) (Y : Fin N → Ω → 𝕋)
    (Y_indep : iIndepFun Y P) (Y_law_ν : ∀ i, HasLaw (Y i) ν P)
    (𝓕 : Set {f : 𝕋 → ℝ≥0 // Measurable f ∧ MemLp f ∞ ν}) (h𝓕 : Finite 𝓕)
    (hZ₀ : 0 < 𝔼⁻[⨆ f ∈ 𝓕, (Z N Y f ·); P]) (hZ : 𝔼⁻[⨆ f ∈ 𝓕, (Z N Y f ·); P] < ∞) :
    ∃ 𝓒 : Finset ({g : 𝕋 → ℝ≥0 // Measurable g} × {t : ℝ≥0 | t > 0}),
      {ω | ⨆ f ∈ 𝓕, Z N Y f ω ≥ L₃ * 𝔼⁻[⨆ f ∈ 𝓕, (Z N Y f ·); P]} ⊆ ⋃ c ∈ 𝓒, {ω | c.2 ≤ Z N Y c.1 ω}
      ∧ ∑ c : 𝓒, P {ω | c.val.2 ≤ Z N Y c.val.1 ω} ≤ 2⁻¹ := by
  sorry
#15
A counterexample to the periodic tiling conjecture
annals_periodic_tiling_conjecture

Lean theorem statement

/--
Statement of Theorem 1.4 (Counterexample to Conjecture 1.2, I):

There exists a finite abelian group `G₀` and a finite non-empty `F ⊆ ℤ² × G₀` such that
`F` forms an aperiodic tiling equation.
-/
theorem theorem_1_4 : ∃ (G₀ : Type) (_ : AddCommGroup G₀) (_ : Finite G₀),
    ∃ F : Set (ℤ × ℤ × G₀), F.Finite ∧ F.Nonempty ∧ IsAperiodicTilingEquation F := by
  sorry

/--
Statement of Corollary 1.6 (Counterexample to Conjecture 1.2, II):

For all sufficiently large `d`, there exists a finite non-empty `F ⊆ ℤᵈ` such that
`F` forms an aperiodic tiling equation.
-/
theorem corollary_1_6 : ∀ᶠ d in atTop, ∃ (F : Set (Fin d → ℤ)),
    F.Finite ∧ F.Nonempty ∧ IsAperiodicTilingEquation F := by
  sorry

/--
Statement of Corollary 1.7 (Counterexample to Conjecture 1.3):

For all sufficiently large `d`, there exists a bounded measurable set `σ ⊆ ℝᵈ` of positive
measure such that `σ` forms an aperiodic continuous tiling equation.
-/
theorem corollary_1_7 : ∀ᶠ d in atTop, ∃ σ : Set (Fin d → ℝ), IsBounded σ ∧ MeasurableSet σ ∧
    0 < volume σ ∧ IsAperiodicContinuousTilingEquation σ := by
  sorry
#16
The optimal paper Moebius band
annals_optimal_moebius

Lean theorem statement

/--
Statement of Theorem 1.1 (Main):

A smooth embedded paper Moebius band has aspect ratio greater than `√3`.
-/
theorem theorem_1_1 (a : ℝ) (ha : a > 0) (f : ℝ² → ℝ³) (hf : IsMoebiusEmbedding a f) :
    a > √3 := by
  sorry
#17
On approximation to a real number by algebraic numbers of bounded degree
annals_on_approximation_of_reals

Lean theorem statement

/--
Statement of Theorem 1.1:

Let `n` be an integer such that `n ≥ 2`. For any transcendental real number `ξ`, we have
`ω⋆_n(ξ) ≥ a * n`, where `a = 1 / (2 - log 2)`.
-/
theorem theorem_1_1 (n : ℕ) (hn : n ≥ 2) (ξ : ℝ) (hξ : Transcendental ℚ ξ) :
    letI a : ℝ := 1 / (2 - Real.log 2)
    (ω⋆ n ξ : EReal) ≥ (a : EReal) * n := by
  sorry
#18
Rational approximations to linear subspaces
annals_linear_subspaces

Verso theorem preview

theorem declaration uses `sorry`theorem_1 (hd : 2 ≤ d) (l : ℕ) (hl0 : 0 < l) (hld : l < d) (k : ℕ) (hk1 : 1 ≤ k) (hkl : k ≤ l) : (∀ x : Submodule ℝ ℝᵈ, finrank ℝ x = l → LinearSubspaces.diophantineExponent k x ≥ d / (k * (d - l))) ∧ (∃ x : Submodule ℝ ℝᵈ, finrank ℝ x = l ∧ LinearSubspaces.diophantineExponent k x = d / (k * (d - l))) := d:ℕhd:2 ≤ dl:ℕhl0:0 < lhld:l < dk:ℕhk1:1 ≤ khkl:k ≤ l⊢ (∀ (x : Submodule ℝ ℝᵈ), finrank ℝ ↥x = l → diophantineExponent k x ≥ ↑d / (↑k * (↑d - ↑l))) ∧ ∃ x, finrank ℝ ↥x = l ∧ diophantineExponent k x = ↑d / (↑k * (↑d - ↑l)) All goals completed! 🐙
#19
Improved bounds for the sunflower lemma
annals_improved_bounds_sunflower_lemma

Lean theorem statement

/-- The absolute constant `C` in Theorem 1.4. Although not explicitly stated in the paper,
the constant `C` doesn't depend on `r`. -/
noncomputable def C : ℝ := sorry

/--
Statement of Theorem 1.4 (Main theorem, sunflowers):

Let `r ≥ 3`. For some constant `C`, any `w`-set system `F` of size
`|F| ≥ (C * r ^ 3 * log w * log log w) ^ w` contains an `r`-sunflower.

Note: We require `w ≥ 2`, as the paper assumes `log log w > 0`.
-/
theorem theorem_1_4 (r : ℕ) (hr : r ≥ 3) (X : Type*) [Finite X] (ℱ : Set (Set X)) (w : ℕ)
      (hw : w ≥ 2) (hℱ₁ : ℱ.IsSystem w) (hℱ₂ : ℱ.ncard ≥ lowerBound r C w) :
      ∃ S ⊆ ℱ, S.IsSunflower r := by
  sorry
#20
Hadwiger's theorem
hadwiger

Verso theorem preview

theorem declaration uses `sorry`hadwiger (n : ℕ) : Module.finrank ℝ (valuations n) = n + 1 := n:ℕ⊢ Module.finrank ℝ ↥(valuations n) = n + 1 All goals completed! 🐙
#21
Szemerédi's theorem
szemeredi

Verso theorem preview

theorem declaration uses `sorry`szemeredi (A : Set ℕ) (h : 0 < upperDensity A) : LeanEval.Combinatorics.ContainsArbitraryAPs A := A:Set ℕh:0 < upperDensity A⊢ ContainsArbitraryAPs A All goals completed! 🐙
#22
Rademacher type and Enflo type coincide
annals_rademacher_enflo_type

Verso theorem preview

theorem declaration uses `sorry`theorem_1_1 (p : ℝ) (h1p : 1 ≤ p) (hp2 : p ≤ 2) : TR X p ≤ TE X p ∧ TE X p ≤ (pi / sqrt 2) * TR X p := X:Type u_2inst✝²:NormedAddCommGroup Xinst✝¹:NormedSpace ℝ Xinst✝:CompleteSpace Xp:ℝh1p:1 ≤ php2:p ≤ 2⊢ TR X p ≤ TE X p ∧ TE X p ≤ ↑pi / ↑(sqrt 2) * TR X p All goals completed! 🐙
#23
Equiangular lines with a fixed angle
annals_equiangular_lines_fixed_angle

Verso theorem preview

theorem declaration uses `sorry`theorem_1_2 (α : ℝ) (hα : α ∈ Set.Ioo 0 1) : let k := spectralRadiusOrder ((1 - α) / (2 * α)) (k < ⊤ → ∀ᶠ d in atTop, N α d = ⌊(k.toNat * (d - 1) : ℝ) / (k.toNat - 1 : ℝ)⌋₊) ∧ (k = ⊤ → ∃ e : ℕ → ℝ, e =o[atTop] (Nat.cast : ℕ → ℝ) ∧ ∀ d, N α d = d + e d) := α:ℝhα:α ∈ Set.Ioo 0 1⊢ let k := spectralRadiusOrder ((1 - α) / (2 * α)); (k < ⊤ → ∀ᶠ (d : ℕ) in atTop, N α d = ⌊↑k.toNat * (↑d - 1) / (↑k.toNat - 1)⌋₊) ∧ (k = ⊤ → ∃ e, e =o[atTop] Nat.cast ∧ ∀ (d : ℕ), ↑(N α d) = ↑d + e d) All goals completed! 🐙
#24
Hopf–Rinow theorem
hopf_rinow

Verso theorem preview

theorem declaration uses `sorry`hopf_rinow {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] {H : Type*} [TopologicalSpace H] (I : ModelWithCorners ℝ E H) [I.Boundaryless] (M : Type*) [EMetricSpace M] [ChartedSpace H M] [IsManifold I ∞ M] [Bundle.RiemannianBundle (fun x : M => TangentSpace I x)] [IsContMDiffRiemannianBundle I ∞ E (fun x : M => TangentSpace I x)] [IsContinuousRiemannianBundle E (fun x : M => TangentSpace I x)] [IsRiemannianManifold I M] [LocallyCompactSpace M] [ConnectedSpace M] : LeanEval.Geometry.IsGeodesicallyComplete M ↔ CompleteSpace M := E:Type u_1inst✝¹³:NormedAddCommGroup Einst✝¹²:NormedSpace ℝ Einst✝¹¹:FiniteDimensional ℝ EH:Type u_2inst✝¹⁰:TopologicalSpace HI:ModelWithCorners ℝ E Hinst✝⁹:I.BoundarylessM:Type u_3inst✝⁸:EMetricSpace Minst✝⁷:ChartedSpace H Minst✝⁶:IsManifold I ∞ Minst✝⁵:RiemannianBundle fun x => TangentSpace I xinst✝⁴:IsContMDiffRiemannianBundle I ∞ E fun x => TangentSpace I xinst✝³:IsContinuousRiemannianBundle E fun x => TangentSpace I xinst✝²:IsRiemannianManifold I Minst✝¹:LocallyCompactSpace Minst✝:ConnectedSpace M⊢ IsGeodesicallyComplete M ↔ CompleteSpace M All goals completed! 🐙
#25
Thresholds versus fractional expectation-thresholds
annals_fractional_expectation_thresholds

Verso theorem preview

/-- The constant `K` in Theorem 1.1. -/ noncomputable def declaration uses `sorry`K : ℝ := sorry
/-- Statement of Theorem 1.1: There exists a universal constant `K` such that for any finite set `X` and any increasing collection of sets `𝓕` such that `l(𝓕)` is at least `2`, `p_c(𝓕) ≤ K * q_f(𝓕) * log l(𝓕)`. Note: The assumption that `l(𝓕)` is at least `2` is not explicitly in the paper but is needed because if `l(𝓕) = 1` then `Real.log (l 𝓕) = 0`, but `p_c 𝓕 ∈ (0,1)` (so the inequality clearly cannot hold). -/ theorem declaration uses `sorry`theorem_1_1 (X : Type*) [Fintype X] (𝓕 : Set (Set X)) (h𝓕 : IsUpperSet 𝓕) (hl𝓕 : 2 ≤ l 𝓕) : p_c 𝓕 ≤ K * q_f 𝓕 * Real.log (l 𝓕) := X:Type u_1inst✝:Fintype X𝓕:Set (Set X)h𝓕:IsUpperSet 𝓕hl𝓕:2 ≤ l 𝓕⊢ ↑(p_c 𝓕) ≤ K * ↑(q_f 𝓕) * Real.log ↑(l 𝓕) All goals completed! 🐙
#26
Jordan normal form
jordan_normal_form

Lean theorem statement

/-- **Jordan normal form.** Over an algebraically closed field, every
endomorphism of `Kⁿ` admits a Jordan-chain basis. -/
theorem jordan_normal_form {K : Type*} [Field K] [IsAlgClosed K] (n : ℕ)
    (f : Module.End K (StdSpace K n)) :
    Nonempty (JordanChainBasis f) := by
  sorry
#27
Morley's trisector theorem
morley_theorem

Verso theorem preview

theorem declaration uses `sorry`morley_theorem (A B C P Q R : LeanEval.Geometry.Morley.Plane) (h : LeanEval.Geometry.Morley.IsMorleyConfiguration A B C P Q R) : LeanEval.Geometry.Morley.IsEquilateralTriple P Q R := A:PlaneB:PlaneC:PlaneP:PlaneQ:PlaneR:Planeh:IsMorleyConfiguration A B C P Q R⊢ IsEquilateralTriple P Q R All goals completed! 🐙
#28
Normal spectral theorem
normal_spectral_theorem

Verso theorem preview

theorem declaration uses `sorry`normal_spectral_theorem (A : Matrix n n ℂ) : IsStarNormal A ↔ ∃ U ∈ unitary (Matrix n n ℂ), ∃ d : n → ℂ, A = U * diagonal d * star U := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℂ⊢ IsStarNormal A ↔ ∃ U ∈ unitary (Matrix n n ℂ), ∃ d, A = U * diagonal d * star U All goals completed! 🐙
#29
Riesz's rising sun lemma
rising_sun_lemma

Verso theorem preview

theorem declaration uses `sorry`rising_sun_lemma {a b : ℝ} (hab : a < b) {f : ℝ → ℝ} (hf : ContinuousOn f (Icc a b)) : LeanEval.Analysis.RisingSun.HasRisingSunProperty a b f := a:ℝb:ℝhab:a < bf:ℝ → ℝhf:ContinuousOn f (Icc a b)⊢ HasRisingSunProperty a b f All goals completed! 🐙
#30
Dimitrov's lower bound for the house of a nonzero algebraic integer that is not a root of unity
dimitrov

Verso theorem preview

theorem declaration uses `sorry`dimitrov {K : Type*} [Field K] [NumberField K] (α : K) (α_int : IsIntegral ℤ α) (α_ne_zero : α ≠ 0) (α_not_rootOfUnity : ¬ IsOfFinOrder α) : (2 : ℝ) ^ (1 / (4 * (Finset.univ.image fun σ : K →+* ℂ ↦ (σ α).arg).card) : ℝ) ≤ NumberField.house α := K:Type u_1inst✝¹:Field Kinst✝:NumberField Kα:Kα_int:IsIntegral ℤ αα_ne_zero:α ≠ 0α_not_rootOfUnity:¬IsOfFinOrder α⊢ 2 ^ (1 / (4 * ↑(Finset.image (fun σ => (σ α).arg) Finset.univ).card)) ≤ NumberField.house α All goals completed! 🐙
#31
Trace Cayley-Hamilton / Newton identity
trace_cayley_hamilton_newton

Verso theorem preview

theorem declaration uses `sorry`trace_cayley_hamilton_newton {R : Type*} [CommRing R] (A : Matrix n n R) {k : ℕ} (hk : 1 ≤ k) : (k : R) * charpolyDescendingCoeff A k + ∑ j ∈ Finset.Icc 1 k, trace (A ^ j) * charpolyDescendingCoeff A (k - j) = 0 := n:Type u_1inst✝²:Fintype ninst✝¹:DecidableEq nR:Type u_2inst✝:CommRing RA:Matrix n n Rk:ℕhk:1 ≤ k⊢ ↑k * charpolyDescendingCoeff A k + ∑ j ∈ Finset.Icc 1 k, (A ^ j).trace * charpolyDescendingCoeff A (k - j) = 0 All goals completed! 🐙
#32
A counterexample to the unit conjecture for group rings
annals_unit_conjecture

Verso theorem preview

theorem declaration uses `sorry`theorem_A : (∀ g : UnitConjecture.P, ∀ n ≠ 0, g ^ n = 1 → g = 1) ∧ IsUnit UnitConjecture.u ∧ ¬ ∃ g : UnitConjecture.P, UnitConjecture.u = g := ⊢ (∀ (g : P) (n : ℕ), n ≠ 0 → g ^ n = 1 → g = 1) ∧ IsUnit u ∧ ¬∃ g, u = (MonoidAlgebra.of (ZMod 2) P) g All goals completed! 🐙
#33
Dirichlet eigenvalues of -y'' = lambda y on [0,pi] are n^2
dirichlet_eigenvalues_eq_nat_sq

Verso theorem preview

theorem declaration uses `sorry`dirichlet_eigenvalues_eq_nat_sq (lam : ℝ) : (∃ (y : ℝ → ℝ) (J : Set ℝ), IsOpen J ∧ Set.Icc (0 : ℝ) Real.pi ⊆ J ∧ (∀ x ∈ J, HasDerivAt y (deriv y x) x) ∧ (∀ x ∈ J, HasDerivAt (deriv y) (-(lam * y x)) x) ∧ y 0 = 0 ∧ y Real.pi = 0 ∧ ∃ x ∈ Set.Ioo (0 : ℝ) Real.pi, y x ≠ 0) ↔ ∃ n : ℕ, 0 < n ∧ lam = (n : ℝ) ^ 2 := lam:ℝ⊢ (∃ y J, IsOpen J ∧ Set.Icc 0 π ⊆ J ∧ (∀ x ∈ J, HasDerivAt y (deriv y x) x) ∧ (∀ x ∈ J, HasDerivAt (deriv y) (-(lam * y x)) x) ∧ y 0 = 0 ∧ y π = 0 ∧ ∃ x ∈ Set.Ioo 0 π, y x ≠ 0) ↔ ∃ n, 0 < n ∧ lam = ↑n ^ 2 All goals completed! 🐙
#34
Entrywise exponential of a PSD matrix is PSD
posSemidef_map_exp

Verso theorem preview

theorem declaration uses `sorry`posSemidef_map_exp {n : Type*} [Fintype n] [DecidableEq n] {A : Matrix n n ℝ} (hA : A.PosSemidef) : (A.map Real.exp).PosSemidef := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℝhA:A.PosSemidef⊢ (A.map Real.exp).PosSemidef All goals completed! 🐙
#35
Polynomial decay rate of y' = -y^3
cubic_decay_asymptotic

Verso theorem preview

theorem declaration uses `sorry`cubic_decay_asymptotic (y : ℝ → ℝ) (hy_diff : ∀ t : ℝ, 0 < t → HasDerivAt y (-(y t) ^ 3) t) (hy_cont : ContinuousWithinAt y (Set.Ici 0) 0) (hy0 : y 0 = 1) : Tendsto (fun t : ℝ => y t * Real.sqrt t) atTop (𝓝 (1 / Real.sqrt 2)) := y:ℝ → ℝhy_diff:∀ (t : ℝ), 0 < t → HasDerivAt y (-y t ^ 3) thy_cont:ContinuousWithinAt y (Set.Ici 0) 0hy0:y 0 = 1⊢ Tendsto (fun t => y t * √t) atTop (𝓝 (1 / √2)) All goals completed! 🐙
#36
Comparison principle for the Dirichlet BVP
bvp_comparison

Verso theorem preview

theorem declaration uses `sorry`bvp_comparison (J : Set ℝ) (hJ_open : IsOpen J) (hJ_sub : Set.Icc (0 : ℝ) 1 ⊆ J) (u v : ℝ → ℝ) (hu : ∀ x ∈ J, HasDerivAt u (deriv u x) x) (hu' : ∀ x ∈ J, HasDerivAt (deriv u) (deriv (deriv u) x) x) (hv : ∀ x ∈ J, HasDerivAt v (deriv v x) x) (hv' : ∀ x ∈ J, HasDerivAt (deriv v) (deriv (deriv v) x) x) (hineq : ∀ x ∈ Set.Ioo (0 : ℝ) 1, -deriv (deriv u) x ≤ -deriv (deriv v) x) (hu0 : u 0 ≤ v 0) (hu1 : u 1 ≤ v 1) : ∀ x ∈ Set.Icc (0 : ℝ) 1, u x ≤ v x := J:Set ℝhJ_open:IsOpen JhJ_sub:Set.Icc 0 1 ⊆ Ju:ℝ → ℝv:ℝ → ℝhu:∀ x ∈ J, HasDerivAt u (deriv u x) xhu':∀ x ∈ J, HasDerivAt (deriv u) (deriv (deriv u) x) xhv:∀ x ∈ J, HasDerivAt v (deriv v x) xhv':∀ x ∈ J, HasDerivAt (deriv v) (deriv (deriv v) x) xhineq:∀ x ∈ Set.Ioo 0 1, -deriv (deriv u) x ≤ -deriv (deriv v) xhu0:u 0 ≤ v 0hu1:u 1 ≤ v 1⊢ ∀ x ∈ Set.Icc 0 1, u x ≤ v x All goals completed! 🐙
#37
Cayley graph connected iff generators generate the group
mulCayley_connected_iff_closure_eq_top

Verso theorem preview

theorem declaration uses `sorry`mulCayley_connected_iff_closure_eq_top {G : Type*} [Group G] (S : Set G) : (SimpleGraph.mulCayley S).Connected ↔ Subgroup.closure S = ⊤ := G:Type u_1inst✝:Group GS:Set G⊢ (SimpleGraph.mulCayley S).Connected ↔ Subgroup.closure S = ⊤ All goals completed! 🐙
#38
Finite Ramsey theorem for graphs
finite_graph_ramsey_theorem

Verso theorem preview

theorem declaration uses `sorry`finite_graph_ramsey_theorem : ∀ r s : ℕ, 2 ≤ r → 2 ≤ s → ∃ n : ℕ, ∀ G : SimpleGraph (Fin n), ¬ G.CliqueFree r ∨ ¬ Gᶜ.CliqueFree s := ⊢ ∀ (r s : ℕ), 2 ≤ r → 2 ≤ s → ∃ n, ∀ (G : SimpleGraph (Fin n)), ¬G.CliqueFree r ∨ ¬Gᶜ.CliqueFree s All goals completed! 🐙
#39
First submissionSep 19, 2026
Last submissionOct 1, 2026
sarjinius39
13github.com/mlgraham (various models)31 solved
Strong normalization and consistency for the calculus of constructions with a universe hierarchy
coc_strong_normalization

Verso theorem preview

/-- Anti-vacuity guard: the polymorphic identity `λ (A : Prop). λ (x : A). x` has type `Π (A : Prop). Π (x : A). A`. This is typable only because `Prop` is impredicative. -/ theorem declaration uses `sorry`typing_polyId : Typing [] (.lam (.srt .prop) (.lam (.var 0) (.var 0))) (.pi (.srt .prop) (.pi (.var 0) (.var 1))) := sorry
/-- Anti-vacuity guard: applying the polymorphic identity to `False` exercises application typing. Here `False` is encoded as `Π (P : Prop). P`. -/ theorem declaration uses `sorry`typing_polyId_app : Typing [] (.app (.lam (.srt .prop) (.lam (.var 0) (.var 0))) (.pi (.srt .prop) (.var 0))) (.pi (.pi (.srt .prop) (.var 0)) (.pi (.srt .prop) (.var 0))) := sorry
/-- Anti-vacuity guard: the same application takes its expected beta step. -/ theorem declaration uses `sorry`step_polyId_app : Step (.app (.lam (.srt .prop) (.lam (.var 0) (.var 0))) (.pi (.srt .prop) (.var 0))) (.lam (.pi (.srt .prop) (.var 0)) (.var 0)) := sorry
/-- Types are preserved by reduction. -/ theorem declaration uses `sorry`subject_reduction (Γ : List Tm) (t t' A : Tm) : Typing Γ t A → Step t t' → Typing Γ t' A := sorry
/-- Every well-typed term is strongly normalizing. -/ theorem declaration uses `sorry`strong_normalization (Γ : List Tm) (t A : Tm) : Typing Γ t A → SN t := sorry
/-- The system is logically consistent: `Π (P : Prop). P` is not inhabited. -/ theorem declaration uses `sorry`consistency : ¬ ∃ t : Tm, Typing [] t (.pi (.srt .prop) (.var 0)) := sorry
#1
How produced

**Relabel, not new work.** Identical source tree to the already-accepted submission (issue #1444): same private repository, same commit `c82122b6741bf68a344a4f480bb0bf9031f84083`, proof unchanged. The only change is the Model field, so that this solve joins the rest of this account's results under one honest bucket label. The duplicate result on this problem id is expected. This is the one accepted solve whose source is private, which is why it is relabelled here rather than in the consolidated public repository (issue #1494 covers the other 21). Why the label. Two facts make any single model string inaccurate for this account: 1. Private harnesses and components, drawn from private repositories under this account, take part in producing these submissions. What is evaluated is a model together with tooling that is neither public nor fixed, so naming one model implies the model alone produced the result. 2. Providers switch models mid-run. Some route or downgrade automatically during use, so a string naming one model can become false through no choice of ours and without our knowledge. Provenance for this particular solve, unchanged from #1444: original proof of all six `coc_strong_normalization` holes, produced under human direction from the Challenge, the published mathematics, and compiler feedback only, via a Melliès–Werner Λ-set model built inside Mathlib's `ZFSet`, so no axioms beyond Lean's own. That specific claim belongs in this free-text field rather than in the bucket label. The `lean-eval-bot` GitHub App is installed on the repository, as it was for the accepted submission.

Nyquist–Shannon sampling theorem
nyquist_shannon_sampling

Verso theorem preview

theorem declaration uses `sorry`nyquist_shannon_sampling (f : 𝓢(ℝ, ℂ)) (hf : LeanEval.Analysis.NyquistShannon.FourierSupportedInNyquist f) : ∀ t : ℝ, Summable (fun n : ℤ ↦ f (n : ℝ) * sinc (Real.pi * ((n : ℝ) - t))) ∧ f t = ∑' n : ℤ, f (n : ℝ) * sinc (Real.pi * ((n : ℝ) - t)) := f:𝓢(ℝ, ℂ)hf:FourierSupportedInNyquist f⊢ ∀ (t : ℝ), (Summable fun n => f ↑n * sinc (Real.pi * (↑n - t))) ∧ f t = ∑' (n : ℤ), f ↑n * sinc (Real.pi * (↑n - t)) All goals completed! 🐙
#2
How produced

Original proof of nyquist_shannon_sampling. Claude Opus 5 (Claude Code), under human direction, from the Challenge statement, Mathlib source search, and compiler feedback only; no published lean-eval solution consulted. Method. The obvious route expands `𝓕f` in a Fourier series on `[-1/2, 1/2]`: build the periodic extension as an `AddCircle 1` function via `AddCircle.liftIco`, compute its `fourierCoeff`, and apply `hasSum_fourier_series_of_summable`. That works but needs the endpoint values `𝓕f(±1/2) = 0` (a one-sided-limit argument), the `fourierCoeff_eq_intervalIntegral` shift to a non-standard base point, and completeness of the trigonometric system. **Poisson summation supplies the whole step for free** — provided it is applied to the *transform* rather than to the function. `SchwartzMap.tsum_eq_tsum_fourier` on `fourierTransformCLM ℂ f` reads ∑ₙ 𝓕f(ξ + n) = ∑ₖ 𝓕(𝓕f)(k) · e^{2πikξ}. On the *open* Nyquist band the left side collapses to the single term `n = 0`, because for `n ≠ 0` and `|ξ| < 1/2` the translate `ξ + n` leaves `[-1/2, 1/2]` (`tsum_eq_single`). The right side is `∑ₖ f(-k) e^{2πikξ}` because `𝓕(𝓕f)(v) = f(-v)`, which is Fourier inversion (`Continuous.fourierInv_fourier_eq`) composed with `Real.fourierInv_eq_fourier_neg`. So 𝓕f(ξ) = ∑ₖ f(-k) e^{2πikξ} on (-1/2, 1/2), with no `AddCircle` lift, no `fourierCoeff` computation, and no endpoint analysis — working on the open interval instead of the closed one is what removes the last of those, since `Ioo` and `Icc` differ by a null set and the integral cannot tell them apart. The rest is bookkeeping: - **Term-by-term integration.** `hasSum_integral_of_summable_integral_norm` over `Ioo (-1/2) (1/2)`; each `∫ ‖·‖` is exactly `‖f(-k)‖` since the exponential has modulus one and the interval has measure one. Summability of the samples comes from the Schwartz bound `‖x‖²‖f x‖ ≤ C` with `Real.summable_one_div_int_pow`, applied cofinitely so the `n = 0` term is not an obstruction. - **The total.** `∫_{Ioo} 𝓕f(ξ)e^{2πitξ} dξ = ∫_ℝ … = 𝓕⁻(𝓕f)(t) = f(t)`, the first step by `setIntegral_eq_integral_of_ae_compl_eq_zero` (the integrand vanishes off `Icc`, and `Icc ∖ Ioo = {±1/2}` is null). - **Each term.** `∫_{-1/2}^{1/2} e^{2πiuξ} dξ = sinc(πu)` from `integral_exp_mul_complex`, with `u = 0` handled separately since `sinc` is defined by cases. - **Reindex** `k ↦ -k` and use that `sinc` is even. One practical note for anyone rebuilding this: `𝓕 ⇑f` as written in the deps and `𝓕 f` as it appears after rewriting with `SchwartzMap.fourierTransformCLM_apply` are definitionally equal but not syntactically equal, so `rw` fails where `Eq.trans` and `calc` succeed. Several steps here are `calc` chains for exactly that reason. 219 lines of helpers, three lines of assembly. Zero `sorry`; `#print axioms` gives exactly propext, Classical.choice, Quot.sound.

Lidskii–Last eigenvalue-perturbation theorem
lidskii_last

Verso theorem preview

theorem declaration uses `sorry`lidskii_last {n : Type*} [Fintype n] [DecidableEq n] {A B : Matrix n n ℂ} (hA : A.IsHermitian) (hB : B.IsHermitian) : ∑ j, |hA.eigenvalues₀ j - hB.eigenvalues₀ j| ≤ ∑ i, ∑ j, ‖A i j - B i j‖ := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℂB:Matrix n n ℂhA:A.IsHermitianhB:B.IsHermitian⊢ ∑ j, |hA.eigenvalues₀ j - hB.eigenvalues₀ j| ≤ ∑ i, ∑ j, ‖A i j - B i j‖ All goals completed! 🐙
#3
How produced

Original proof of lidskii_last. Claude Opus 5 (Claude Code), under human direction, from the Challenge statement, Mathlib source search, and compiler feedback only; no published lean-eval solution consulted. Method. Two observations set the shape of the proof. **The inequality is tight, so nothing crude survives.** `A = I`, `B = 0` gives equality, which rules out `∑ⱼ |λⱼ(A) − λⱼ(B)| ≤ n·‖A−B‖_op ≤ n·∑|Mᵢⱼ|` and every other estimate carrying a dimension factor. What is needed is exactly the trace-norm-level bound. **But the full Lidskii majorization is not needed.** Write `M = A − B = P − N` with `P` and `N` the positive and negative parts of its spectral decomposition. Then the path B → B + P → B + P − N = A has only **two** steps, and on each of them the perturbation is positive semidefinite, so Weyl monotonicity makes *every* eigenvalue move in the same direction. A sum of absolute differences in which all the signs agree telescopes to a difference of traces: ∑ⱼ |λⱼ(A) − λⱼ(B)| ≤ (tr C − tr A) + (tr C − tr B) = tr N + tr P = ∑ᵢ |μᵢ|. No majorization theory, no Hardy–Littlewood–Pólya, no Ky Fan — just the triangle inequality applied once. (This is why the sibling problem `lidskii_inequality`, with its exponent `p`, is genuinely harder: for `p ≠ 1` the telescoping does not happen and the majorization is unavoidable.) That reduces everything to **Weyl monotonicity**, and Mathlib has no Courant–Fischer / min-max, so the variational characterisation is proved here at the level of a symmetric operator (more general than the matrix statement, and upstreamable): - `qf_eq_sum` : `⟪Tx, x⟫ = ∑ᵢ λᵢ ‖repr x i‖²`, from `repr (T x) i = λᵢ · repr x i`, itself a three-line consequence of symmetry. - `le_eigenvalue_of_forall_mem` : the *min* half of Courant–Fischer. A subspace `V` of dimension `j+1` on which the form is `≥ t` forces `t ≤ λⱼ`, because `V` and the span of the eigenvectors indexed `j … n−1` have dimensions summing to `n+1`, so they meet in a nonzero vector, and on that span the form is `≤ λⱼ‖x‖²`. - `eigenvalues_mono` : hence a form-monotone pair of symmetric operators has monotone sorted eigenvalues; `eigenvalues₀_mono` transfers this to Hermitian matrices through `Matrix.toEuclideanLin`. The entrywise step is elementary and needs no operator norms: `|μᵢ| = |(U* M U)ᵢᵢ|` expands to `|∑ⱼ∑ₖ conj(Uⱼᵢ) Mⱼₖ Uₖᵢ|`, and summing over `i` factors out `∑ᵢ |Uⱼᵢ||Uₖᵢ| ≤ 1`, which is Cauchy–Schwarz against rows of a unitary matrix having unit `ℓ²` norm. Two Mathlib facts worth flagging for anyone rebuilding this: `Matrix.PosSemidef` is stated over `n →₀ R` (finitely supported), so `posSemidef_iff_dotProduct_mulVec` is the usable form for a `Fintype`; and `RCLike.ofReal` and `Complex.ofReal` are definitionally equal but not syntactically equal, so `rw` fails against `spectral_theorem`'s `diagonal (RCLike.ofReal ∘ eigenvalues)` where a `show` succeeds. 381 lines of helpers, one line of assembly. Zero `sorry`; `#print axioms` gives exactly propext, Classical.choice, Quot.sound.

Peano existence theorem for ODEs
peano_existence

Verso theorem preview

theorem declaration uses `sorry`peano_existence {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] {f : E → E} (hf : Continuous f) (x₀ : E) : ∃ a : ℝ, 0 < a ∧ ∃ α : ℝ → E, α 0 = x₀ ∧ ∀ t ∈ Ioo (-a) a, HasDerivAt α (f (α t)) t := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:FiniteDimensional ℝ Ef:E → Ehf:Continuous fx₀:E⊢ ∃ a, 0 < a ∧ ∃ α, α 0 = x₀ ∧ ∀ t ∈ Ioo (-a) a, HasDerivAt α (f (α t)) t All goals completed! 🐙
#4
How produced

Original proof of peano_existence. Claude Opus 5 (Claude Code), under human direction, from the Challenge statement, Mathlib source search, and compiler feedback only; no published lean-eval solution consulted. Method. Mathlib has Picard-Lindelof (which needs a Lipschitz field), Arzela-Ascoli, and — the piece that makes this tractable — smooth approximation of continuous maps (Continuous.exists_contDiff_dist_le_of_forall_mem_ball_dist_le in Analysis/Calculus/BumpFunction/SmoothApprox.lean), which performs the mollification and installs the Borel/Haar structure internally, so no measure structure has to be assumed on E. The proof is the classical approximation argument: 1. Bound f by M on the closed unit ball around x0 and set L = M + 1, T = 1/(2L). 2. For each n take a smooth g_n with sup-error at most 1/(n+1) on that ball, so ‖g_n‖ ≤ L there. 3. Solve x' = g_n(x) exactly on the FIXED interval [-T, T]. This is the crux: the time interval in IsPicardLindelof is constrained only by mul_max_le, i.e. by the sup bound L, never by the Lipschitz constant — which is what keeps the interval from shrinking as the approximations get rougher. A ContDiffBump cutoff is applied first so the bound is global, which turns the a priori estimate ‖α(t) − x0‖ ≤ L|t| ≤ 1/2 into one application of the mean value inequality instead of a bootstrap, and simultaneously gives the uniform Lipschitz bound needed for equicontinuity. 4. Arzela-Ascoli (arzela_ascoli₂, over bounded continuous functions on the compact subtype [-T,T], with the limit transported back to ℝ by Set.IccExtend) yields a uniformly convergent subsequence. 5. Pass to the limit in the integral equation. The integrands converge uniformly because ‖g_n(β_n s) − f(v s)‖ splits into the approximation error 1/(n+1) plus the modulus of continuity of f on the compact ball. 6. Differentiate back with intervalIntegral.integral_hasDerivAt_right. The differential-to-integral step is done on the open interval, where HasDerivWithinAt on Icc upgrades to a genuine HasDerivAt and uIcc 0 t stays inside. Axioms: propext, Classical.choice, Quot.sound. No sorry. Built against the pinned Mathlib rev 6f1ef4e5dd604a435bddba4747b13970cd65d2a1, Lean v4.33.0.

Euler–Lagrange equation
euler_lagrange_equation

Verso theorem preview

theorem declaration uses `sorry`euler_lagrange_equation {a b : ℝ} (L : ℝ → ℝ → ℝ → ℝ) (x : ℝ → ℝ) (_hab : a < b) (_hL : ContDiff ℝ 2 (fun p : ℝ × ℝ × ℝ => L p.1 p.2.1 p.2.2)) (_hx : ContDiff ℝ 2 x) (_hxe : LeanEval.Analysis.IsVariationalExtremum a b L x) : ∀ t ∈ Set.Ioo a b, lagrangianPartialX L x t = deriv (lagrangianPartialV L x) t := a:ℝb:ℝL:ℝ → ℝ → ℝ → ℝx:ℝ → ℝ_hab:a < b_hL:ContDiff ℝ 2 fun p => L p.1 p.2.1 p.2.2_hx:ContDiff ℝ 2 x_hxe:IsVariationalExtremum a b L x⊢ ∀ t ∈ Ioo a b, lagrangianPartialX L x t = deriv (lagrangianPartialV L x) t All goals completed! 🐙
#5
How produced

Original proof of euler_lagrange_equation. Claude Opus 5 (Claude Code), under human direction, from the Challenge statement, Mathlib source search, and compiler feedback only; no published lean-eval solution consulted. Method. Mathlib supplies the hardest analytic input — `IsOpen.ae_eq_zero_of_integral_contDiff_smul_eq_zero`, the fundamental lemma of the calculus of variations — so the proof is the classical three steps, and the effort goes into the plumbing around them. **1. Currying.** The statement's partials are `deriv (fun y => L t y v) (x t)` and `deriv (fun z => L t (x t) z) (x' t)`, while the regularity hypothesis is `ContDiff ℝ 2` on the *uncurried* `L`. Each curried partial is the directional derivative of the uncurried Lagrangian along a basis vector: composing `fderiv` with the affine embedding `z ↦ (t, z, v)` (whose derivative is `(0,1,0)`) identifies them. That single observation is what lets everything downstream work with `fderiv ℝ (Lag L)` and never with the curried form again. **2. Differentiating the action.** `hasDerivAt_integral_of_dominated_loc_of_deriv_le` over `volume.restrict (Ioo a b)`. The dominating function is a **constant**: the perturbed path point `(t, x t + εh t, x' t + εh' t)` ranges over a compact box for `(ε,t) ∈ [-1,1] × [a,b]`, and `fderiv` of a `C²` function is continuous, so `IsCompact.exists_bound_of_continuousOn` gives the bound with no growth estimate at all. At `ε = 0` the derivative splits as `(0, h t, h' t) = h t • (0,1,0) + h' t • (0,0,1)`, giving exactly `P·h + Q·h'`. **3. Integration by parts.** `intervalIntegral.integral_mul_deriv_eq_deriv_mul` on `[a,b]`. The boundary terms vanish because `tsupport h ⊆ Ioo a b` puts `a` and `b` outside the support, so `h a = h b = 0` by `image_eq_zero_of_notMem_tsupport`. `Q = ∂L/∂x'` along the path is `C¹` — `ContDiff.contDiff_fderiv_apply` on the `C²` Lagrangian, composed with the `C¹` path point `t ↦ (t, x t, x' t)` (which needs `ContDiff.deriv'` to see that `x'` is `C¹`). **4. From a.e. to everywhere.** The fundamental lemma returns `∀ᵐ t, t ∈ Ioo a b → f t = 0`. Since `f = P - Q'` is continuous, `{f ≠ 0} ∩ Ioo a b` is *open*; a nonempty open subset of `ℝ` has positive measure (`IsOpen.measure_pos`), so it must be empty. 307 lines of helpers, one line of assembly. Zero `sorry`; `#print axioms` gives exactly propext, Classical.choice, Quot.sound.

Riesz's rising sun lemma
rising_sun_lemma

Verso theorem preview

theorem declaration uses `sorry`rising_sun_lemma {a b : ℝ} (hab : a < b) {f : ℝ → ℝ} (hf : ContinuousOn f (Icc a b)) : LeanEval.Analysis.RisingSun.HasRisingSunProperty a b f := a:ℝb:ℝhab:a < bf:ℝ → ℝhf:ContinuousOn f (Icc a b)⊢ HasRisingSunProperty a b f All goals completed! 🐙
#6
How produced

Original proof of rising_sun_lemma. Claude Opus 5 (Claude Code), under human direction, from the Challenge statement, Mathlib source search, and compiler feedback only; no published lean-eval solution consulted. The statement bundles three claims about the shadow set S = {x in (a,b) : f x < f t for some t in [x,b] with t > x}. 1. S is open. From continuity at an interior point, together with the witness t staying valid on a small enough neighbourhood. 2. S is empty iff f is antitone on [a,b]. The forward direction is immediate at interior points — x not in S says exactly that f dominates everything to its right — but the left endpoint a is not interior, so f y <= f a is obtained by passing to the limit along the filter within (a,b), using left_nhdsWithin_Ioo_neBot for the NeBot instance. 3. When nonempty, S decomposes into countably many disjoint open intervals with f(c) <= f(d). Mathlib has no structure theorem for open subsets of the reals, so this is built here: a nonempty bounded open preconnected set equals Ioo (sInf) (sSup) (using IsPreconnected.ordConnected for the reverse inclusion), and the connected component of a point in a bounded open set is such an interval whose endpoints lie outside the set — if an endpoint were in S, a slightly longer interval would still be preconnected and inside S, so by maximality of the component it would be contained in the component, which it is not. For the required indexing by the naturals, components are enumerated by "first rational": fixing a bijection from the naturals to the rationals, index n is good when its rational lies in S and no earlier rational lies in the same component. Every component has exactly one good index, distinct good indices give disjoint components, and bad indices are padded with the degenerate interval Ioo a a, which is empty and trivially satisfies f a <= f a. The mathematical heart is the endpoint inequality. On a maximal interval (c,d), the right endpoint d is not in S, so f dominates everything on [d,b]. If some interior x had f x > f d, the maximum of f over [x,d] would be attained at some xi < d, and xi lies in S, so f xi < f t for some t > xi with t <= b: if t <= d this contradicts maximality on [x,d], and if t > d then f t <= f d < f x <= f xi. Hence f x <= f d throughout (c,d), and continuity at c gives f c <= f d. Axioms: propext, Classical.choice, Quot.sound. No sorry. Built against the pinned Mathlib rev 6f1ef4e5dd604a435bddba4747b13970cd65d2a1, Lean v4.33.0.

Dimitrov's lower bound for the house of a nonzero algebraic integer that is not a root of unity
dimitrov

Verso theorem preview

theorem declaration uses `sorry`dimitrov {K : Type*} [Field K] [NumberField K] (α : K) (α_int : IsIntegral ℤ α) (α_ne_zero : α ≠ 0) (α_not_rootOfUnity : ¬ IsOfFinOrder α) : (2 : ℝ) ^ (1 / (4 * (Finset.univ.image fun σ : K →+* ℂ ↦ (σ α).arg).card) : ℝ) ≤ NumberField.house α := K:Type u_1inst✝¹:Field Kinst✝:NumberField Kα:Kα_int:IsIntegral ℤ αα_ne_zero:α ≠ 0α_not_rootOfUnity:¬IsOfFinOrder α⊢ 2 ^ (1 / (4 * ↑(Finset.image (fun σ => (σ α).arg) Finset.univ).card)) ≤ NumberField.house α All goals completed! 🐙
#7
How produced

Resubmission of the identical, already-accepted `dimitrov` source tree (issue #1474, accepted 2026-08-28) under this account's consolidated Model label. Same repository, same commit `661e66a9fb0830eea5084f2b6ca88a10813749df`, no change to the proof. The only change is the Model field. The earlier submission went out as `github.com/mlgraham (Claude Fable 5)`; that string is not accurate as a bucket label for this account's submissions, for two reasons that apply here as much as anywhere: 1. Private harnesses and components, drawn from private repositories under this account, take part in producing these submissions. What is evaluated is a model together with tooling that is neither public nor fixed, so naming one model implies the model alone produced the result. 2. Providers switch models mid-run. Some route or downgrade automatically during use, so a string naming a single model can become false through no choice of ours and without our knowledge. `(various models)` is chosen to stay true under both, and is now the standing label for this account. Provenance for this particular solve: the proof was produced by Claude Opus 5 (Claude Code) under human direction, from the Challenge statement, Mathlib source search, and compiler feedback only, with no published lean-eval solution consulted — that specific claim belongs in this free-text field rather than in the bucket label. Please treat this as a relabel rather than a new solve if the pipeline supports that; if it does not, the duplicate result on the same problem id is expected and harmless.

Bauer's uniqueness at extreme points
bauer_extreme_point_uniqueness

Verso theorem preview

theorem declaration uses `sorry`bauer_unique [MeasurableSpace X] [BorelSpace X] (K : Set X) (hK_cpt : IsCompact K) (hK_cvx : Convex ℝ K) {x : X} (hx : x ∈ K.extremePoints ℝ) (μ : Measure X) [IsProbabilityMeasure μ] (hμ : μ Kᶜ = 0) (hbar : x = ∫ y, y ∂μ) : μ = Measure.dirac x := X:Type u_1inst✝⁵:NormedAddCommGroup Xinst✝⁴:NormedSpace ℝ Xinst✝³:CompleteSpace Xinst✝²:MeasurableSpace Xinst✝¹:BorelSpace XK:Set XhK_cpt:IsCompact KhK_cvx:Convex ℝ Kx:Xhx:x ∈ Set.extremePoints ℝ Kμ:Measure Xinst✝:IsProbabilityMeasure μhμ:μ Kᶜ = 0hbar:x = ∫ (y : X), y ∂μ⊢ μ = Measure.dirac x All goals completed! 🐙
#8
How produced

Original proof of bauer_extreme_point_uniqueness. Claude Opus 5 (Claude Code), under human direction, from the Challenge statement, Mathlib source search, and compiler feedback only; no published lean-eval solution consulted. Method. The statement is the uniqueness half of Choquet theory: a probability measure carried by a compact convex set K, whose barycenter is an extreme point x of K, must be the Dirac mass at x. The proof splits on Mathlib's ae_eq_const_or_exists_average_ne_compl applied to the identity: either the identity is a.e. constant under mu, or there is a measurable set t with mu t and mu t^c both nonzero whose two conditional averages differ. - Non-constant branch: average_mem_openSegment_compl_self places the global barycenter in the open segment between the two conditional averages, and Convex.set_average_mem puts both of them in K (K is closed since it is compact). Extremality of x then forces the two averages to be equal to x, contradicting that they differ. - Constant branch: the identity is a.e. equal to x, so mu of the complement of {x} is zero and mu {x} = 1; comparing with Measure.dirac_apply' on an arbitrary measurable set finishes. Integrability of the identity is obtained by bounding it on K (compact, hence bounded) and getting strong measurability from aestronglyMeasurable_iff_aemeasurable_separable, using that a compact set is separable — the ambient space is a general normed space, so this separability step is needed. Axioms: propext, Classical.choice, Quot.sound. No sorry. Built against the pinned Mathlib rev 6f1ef4e5dd604a435bddba4747b13970cd65d2a1, Lean v4.33.0.

Normal spectral theorem
normal_spectral_theorem

Verso theorem preview

theorem declaration uses `sorry`normal_spectral_theorem (A : Matrix n n ℂ) : IsStarNormal A ↔ ∃ U ∈ unitary (Matrix n n ℂ), ∃ d : n → ℂ, A = U * diagonal d * star U := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℂ⊢ IsStarNormal A ↔ ∃ U ∈ unitary (Matrix n n ℂ), ∃ d, A = U * diagonal d * star U All goals completed! 🐙
#9
How produced

Original proof of normal_spectral_theorem. Claude Opus 5 (Claude Code), under human direction, from the Challenge statement, Mathlib source search, and compiler feedback only; no published lean-eval solution consulted. Method. Mathlib has the Hermitian spectral theorem (Matrix.IsHermitian.spectral_theorem) but no Schur triangulation, so the usual "unitarily triangularise, then normal + upper triangular implies diagonal" route is unavailable. This submission avoids triangulation entirely: - write A = H + i*K with H = (A + Aᴴ)/2 and K = -(i/2)*(A - Aᴴ), both Hermitian; - IsStarNormal A is equivalent to Commute H K (the evenness of the cross terms is exactly Aᴴ * A = A * Aᴴ); - transport to operators on EuclideanSpace and apply Mathlib's simultaneous diagonalisation of commuting symmetric operators, LinearMap.IsSymmetric.directSum_isInternal_of_commute, together with orthogonalFamily_eigenspace_inf_eigenspace; - DirectSum.IsInternal.subordinateOrthonormalBasis then yields an orthonormal basis of joint eigenvectors of H and K, which are eigenvectors of A with eigenvalue mu + i*nu. One wrinkle worth recording: subordinateOrthonormalBasis needs a Fintype index, and Mathlib's joint-eigenspace family is indexed by the whole of C x C. The index is cut down to Module.End.Eigenvalues H x Module.End.Eigenvalues K, which is finite for free, and the supremum over that finite index is still the whole space because a joint eigenspace for a non-eigenvalue is trivial. The unitary is then built as in Mathlib's Hermitian case (change-of-basis matrix against EuclideanSpace.basisFun, unitary by OrthonormalBasis.toMatrix_orthonormalBasis_mem_unitary), and A * U = U * diagonal d is checked entrywise. The converse direction is a short computation using that diagonal matrices commute with their stars. Axioms: propext, Classical.choice, Quot.sound. No sorry. Built against the pinned Mathlib rev 6f1ef4e5dd604a435bddba4747b13970cd65d2a1, Lean v4.33.0.

Trace Cayley-Hamilton / Newton identity
trace_cayley_hamilton_newton

Verso theorem preview

theorem declaration uses `sorry`trace_cayley_hamilton_newton {R : Type*} [CommRing R] (A : Matrix n n R) {k : ℕ} (hk : 1 ≤ k) : (k : R) * charpolyDescendingCoeff A k + ∑ j ∈ Finset.Icc 1 k, trace (A ^ j) * charpolyDescendingCoeff A (k - j) = 0 := n:Type u_1inst✝²:Fintype ninst✝¹:DecidableEq nR:Type u_2inst✝:CommRing RA:Matrix n n Rk:ℕhk:1 ≤ k⊢ ↑k * charpolyDescendingCoeff A k + ∑ j ∈ Finset.Icc 1 k, (A ^ j).trace * charpolyDescendingCoeff A (k - j) = 0 All goals completed! 🐙
#10
How produced

**Relabel, not new work.** This repository gathers every already-accepted solve from this account that has a public source tree, so they can all carry one honest Model string. The proofs are unchanged from the submissions that were already accepted; nothing here is a new claim, and duplicate results on those problem ids are expected. Problem ids present (21): banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, brauer_character_in_cyclotomic, bvp_comparison, cubic_decay_asymptotic, dimitrov, dirichlet_eigenvalues_eq_nat_sq, finite_graph_ramsey_theorem, koszul_formula, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, mulCayley_connected_iff_closure_eq_top, normal_spectral_theorem, oppenheim_inequality, peano_existence, pell_solution_convergent, posSemidef_map_exp, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symplectic_matrix_det, trace_cayley_hamilton_newton. Why one label. Two facts make any single model string inaccurate for this account: 1. Private harnesses and components, drawn from private repositories under this account, take part in producing these submissions. What is evaluated is a model together with tooling that is neither public nor fixed, so naming one model implies the model alone produced the result. 2. Providers switch models mid-run. Some route or downgrade automatically during use, so a string naming one model can become false through no choice of ours and without our knowledge. `(various models)` is chosen to stay true under both, and is now the standing label for this account. Per-solve provenance, where it is worth stating, belongs in this free-text field rather than in the bucket label; the individual submissions already carry it. Earlier submissions of these same proofs went out under `github.com/mlgraham (Claude Fable 5)` and `github.com/mlgraham — public accepted source, packaged (Claude Fable 5)`. Please treat this as a relabel of those results if the pipeline supports it. One further accepted solve, `coc_strong_normalization`, has a private source tree and is relabelled in a separate issue rather than being published here. Every workspace is self-contained, pins Mathlib rev 6f1ef4e5dd604a435bddba4747b13970cd65d2a1 on Lean v4.33.0, contains no `sorry`, and depends only on propext, Classical.choice and Quot.sound.

Wiener's atom-detection formula
wiener_atom_detection

Verso theorem preview

theorem declaration uses `sorry`wiener_atom_detection (μ : Measure (AddCircle (2 * Real.pi))) [IsProbabilityMeasure μ] : Tendsto (fun N : ℕ => (1 / (N : ℝ)) * ∑ k ∈ Finset.Icc (1 : ℤ) N, ‖fourierCoeffMeasure μ k‖ ^ 2) atTop (𝓝 (∑' x : AddCircle (2 * Real.pi), ((μ {x}).toReal) ^ 2)) := μ:Measure (AddCircle (2 * π))inst✝:IsProbabilityMeasure μ⊢ Tendsto (fun N => 1 / ↑N * ∑ k ∈ Finset.Icc 1 ↑N, ‖fourierCoeffMeasure μ k‖ ^ 2) atTop (𝓝 (∑' (x : AddCircle (2 * π)), (μ {x}).toReal ^ 2)) All goals completed! 🐙
#11
How produced

Original proof of wiener_atom_detection. Claude Opus 5 (Claude Code), under human direction, from the Challenge statement, Mathlib source search, and compiler feedback only; no published lean-eval solution consulted. Method. Writing mu-hat_k times its conjugate as an iterated integral turns the Cesaro average into the double integral of the kernel K_N(t) = (1/N) sum_{k=1}^N fourier k t, and the theorem follows from the behaviour of that kernel. 1. Kernel. K_N is bounded by 1 for every N (including N = 0, where it is 0), equals 1 at the identity, and tends to 0 elsewhere. The last point is a geometric sum: characters are powers of the single unit-modulus number toCircle t, and t nonzero gives toCircle t <> 1 by AddCircle.injective_toCircle, so the partial sums stay bounded by 2 / |z - 1| while the 1/N factor kills them. 2. Cesaro bridge. fourier k (x - y) = fourier k x * conj (fourier k y) gives mu-hat_k * conj(mu-hat_k) = int int fourier k (x - y), and pleasingly this needs no integrability hypotheses at all — integral_const_mul and integral_conj hold unconditionally for Bochner integrals. Summing and dividing gives that the double integral of K_N is exactly the real number (1/N) sum |mu-hat_k|^2. 3. Two dominated convergences, not a product measure. For fixed y the inner integral tends to mu({y}), the pointwise limit of K_N(x - y) being the indicator of the diagonal; then the outer integral tends to int mu({y}) dmu(y). Measurability for the outer step comes free by putting the inner integral in closed form, (N)^{-1} sum mu-hat_k conj(fourier k y), which is visibly continuous in y. 4. Diagonal mass. The atoms form a countable set (countable_meas_pos_of_disjoint_iUnion applied to singletons). The subtle point is that y -> mu({y}) is not obviously measurable; it is, because it vanishes off that countable set, so every preimage is either contained in it or differs from its complement by a subset of it. With measurability in hand, setIntegral_countable and tsum_subtype_eq_of_support_subset turn the integral into the sum of squared atom masses. Axioms: propext, Classical.choice, Quot.sound. No sorry. Built against the pinned Mathlib rev 6f1ef4e5dd604a435bddba4747b13970cd65d2a1, Lean v4.33.0.

Real cyclotomic integer with house at most 2
cyclotomic_integer_house_le_two

Verso theorem preview

theorem declaration uses `sorry`cyclotomic_integer_house_le_two {K : Type*} [Field K] [NumberField K] [Algebra ℚ K] (n : ℕ) [NeZero n] [IsCyclotomicExtension {n} ℚ K] {β : K} (hβ_int : IsIntegral ℤ β) (hβ_real : β ∈ NumberField.maximalRealSubfield K) : house β ≤ 2 → house β = 2 ∨ ∃ m : ℕ, 0 < m ∧ house β = 2 * Real.cos (Real.pi / m) := K:Type u_1inst✝⁴:Field Kinst✝³:NumberField Kinst✝²:Algebra ℚ Kn:ℕinst✝¹:NeZero ninst✝:IsCyclotomicExtension {n} ℚ Kβ:Khβ_int:IsIntegral ℤ βhβ_real:β ∈ maximalRealSubfield K⊢ house β ≤ 2 → house β = 2 ∨ ∃ m, 0 < m ∧ house β = 2 * Real.cos (Real.pi / ↑m) All goals completed! 🐙
#12
How produced

Original proof of cyclotomic_integer_house_le_two. Claude Opus 5 (Claude Code), under human direction, from the Challenge statement, Mathlib source search, and compiler feedback only; no published lean-eval solution consulted. Method, in four stages. 1. Kronecker on the Chebyshev orbit. Mathlib's Kronecker theorem needs all conjugates inside the closed unit disk; here they only satisfy |.| <= 2. The fix is to run the same finiteness argument on the orbit u_0 = 2, u_1 = beta, u_{j+1} = beta*u_j - u_{j-1}. Since beta is totally real with house at most 2, each conjugate is 2*cos(theta) and the orbit's conjugates are 2*cos(j*theta), so the whole orbit lands in {x : IsIntegral Z x and all conjugates of norm <= 2}, finite by Embeddings.finite_of_norm_le. Hence the orbit repeats. 2. The repetition factors algebraically. Writing the seed as z + z^{-1}, the recursion is exactly z^j + z^{-j}, and a repetition gives (z^a - z^b)(z^{a+b} - 1) = 0, so z is a root of unity. This avoids arccos and trigonometric identities entirely — one linear_combination. 3. The Galois orbit, cheaply. The only input needed is that a primitive d-th root of unity and its coprime powers share a minimal polynomial (both are cyclotomic d over Q). Composing f with X + X^{d-1} transfers any rational relation satisfied by z + z^{-1} to z^k + z^{-k}; combined with Embeddings.range_eval_eq_rootSet_minpoly, every orbit value is some psi(beta) and so is bounded by the house. 4. The maximisation. On the unit circle ||w + w^{-1}|| = 2|Re w|, so the question becomes max over j coprime to d of |cos(2 pi j / d)|. Comparing doubled angles removes all sign bookkeeping: |cos t| <= cos a iff cos 2t <= cos 2a, and cos(2*(2 pi j/d)) = cos(2 pi s/d) with s = 2j mod d by periodicity alone. Then s is nonzero because d dividing 2j with gcd(j,d)=1 forces d dividing 2, and for even d the reduced representative is itself even, hence at least 2. The bound is attained at j = 1 for even d and at j = (d+1)/2 for odd d, where 2j = d+1 gives both coprimality and cos(pi + pi/d) = -cos(pi/d). This yields m = d for odd d and m = d/2 for even d, with the degenerate orders d <= 2 giving house exactly 2. Axioms: propext, Classical.choice, Quot.sound. No sorry. Built against the pinned Mathlib rev 6f1ef4e5dd604a435bddba4747b13970cd65d2a1, Lean v4.33.0.

Koszul formula
koszul_formula

Verso theorem preview

theorem declaration uses `sorry`koszul_formula {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] [CompleteSpace E] {H : Type*} [TopologicalSpace H] {I : ModelWithCorners ℝ E H} {M : Type*} [TopologicalSpace M] [ChartedSpace H M] [IsManifold I ∞ M] [RiemannianBundle (fun (x : M) ↦ TangentSpace I x)] [IsContMDiffRiemannianBundle I ∞ E (fun (x : M) ↦ TangentSpace I x)] (cov : CovariantDerivative I E (TangentSpace I (M := M))) [ContMDiffCovariantDerivative cov ∞] (_htor : cov.torsion = 0) (_hmet : LeanEval.Geometry.KoszulFormula.IsMetricCompatible cov) (X Y Z : Π x : M, TangentSpace I x) (_hX : CMDiff ∞ (T% X)) (_hY : CMDiff ∞ (T% Y)) (_hZ : CMDiff ∞ (T% Z)) (x : M) : 2 * inner ℝ (cov Y x (X x)) (Z x) = mvfderiv I (fun y : M => inner ℝ (Y y) (Z y)) x (X x) + mvfderiv I (fun y : M => inner ℝ (X y) (Z y)) x (Y x) - mvfderiv I (fun y : M => inner ℝ (X y) (Y y)) x (Z x) - inner ℝ (X x) (mlieBracket I Y Z x) - inner ℝ (Y x) (mlieBracket I X Z x) + inner ℝ (Z x) (mlieBracket I X Y x) := E:Type u_1inst✝¹⁰:NormedAddCommGroup Einst✝⁹:NormedSpace ℝ Einst✝⁸:FiniteDimensional ℝ Einst✝⁷:CompleteSpace EH:Type u_2inst✝⁶:TopologicalSpace HI:ModelWithCorners ℝ E HM:Type u_3inst✝⁵:TopologicalSpace Minst✝⁴:ChartedSpace H Minst✝³:IsManifold I ∞ Minst✝²:RiemannianBundle fun x => TangentSpace I xinst✝¹:IsContMDiffRiemannianBundle I ∞ E fun x => TangentSpace I xcov:CovariantDerivative I E (TangentSpace I)inst✝:cov.ContMDiffCovariantDerivative ∞_htor:cov.torsion = 0_hmet:LeanEval.Geometry.KoszulFormula.IsMetricCompatible covX:(x : M) → TangentSpace I xY:(x : M) → TangentSpace I xZ:(x : M) → TangentSpace I x_hX:ContMDiff I I.tangent ∞ (T% X)_hY:ContMDiff I I.tangent ∞ (T% Y)_hZ:ContMDiff I I.tangent ∞ (T% Z)x:M⊢ 2 * Inner.inner ℝ ((↑cov Y x) (X x)) (Z x) = ((d% fun y => Inner.inner ℝ (Y y) (Z y)) x) (X x) + ((d% fun y => Inner.inner ℝ (X y) (Z y)) x) (Y x) - ((d% fun y => Inner.inner ℝ (X y) (Y y)) x) (Z x) - Inner.inner ℝ (X x) (mlieBracket I Y Z x) - Inner.inner ℝ (Y x) (mlieBracket I X Z x) + Inner.inner ℝ (Z x) (mlieBracket I X Y x) All goals completed! 🐙
#13
How produced

**Relabel, not new work.** This repository gathers every already-accepted solve from this account that has a public source tree, so they can all carry one honest Model string. The proofs are unchanged from the submissions that were already accepted; nothing here is a new claim, and duplicate results on those problem ids are expected. Problem ids present (21): banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, brauer_character_in_cyclotomic, bvp_comparison, cubic_decay_asymptotic, dimitrov, dirichlet_eigenvalues_eq_nat_sq, finite_graph_ramsey_theorem, koszul_formula, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, mulCayley_connected_iff_closure_eq_top, normal_spectral_theorem, oppenheim_inequality, peano_existence, pell_solution_convergent, posSemidef_map_exp, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symplectic_matrix_det, trace_cayley_hamilton_newton. Why one label. Two facts make any single model string inaccurate for this account: 1. Private harnesses and components, drawn from private repositories under this account, take part in producing these submissions. What is evaluated is a model together with tooling that is neither public nor fixed, so naming one model implies the model alone produced the result. 2. Providers switch models mid-run. Some route or downgrade automatically during use, so a string naming one model can become false through no choice of ours and without our knowledge. `(various models)` is chosen to stay true under both, and is now the standing label for this account. Per-solve provenance, where it is worth stating, belongs in this free-text field rather than in the bucket label; the individual submissions already carry it. Earlier submissions of these same proofs went out under `github.com/mlgraham (Claude Fable 5)` and `github.com/mlgraham — public accepted source, packaged (Claude Fable 5)`. Please treat this as a relabel of those results if the pipeline supports it. One further accepted solve, `coc_strong_normalization`, has a private source tree and is relabelled in a separate issue rather than being published here. Every workspace is self-contained, pins Mathlib rev 6f1ef4e5dd604a435bddba4747b13970cd65d2a1 on Lean v4.33.0, contains no `sorry`, and depends only on propext, Classical.choice and Quot.sound.

Perron-Frobenius for irreducible nonnegative matrices
irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius

Verso theorem preview

theorem declaration uses `sorry`irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius {n : Type*} [Fintype n] [DecidableEq n] [Nonempty n] (A : Matrix n n ℝ) (hA : A.IsIrreducible) : ∃ v : n → ℝ, Module.End.HasEigenvector (Matrix.toLin' A) (spectralRadius ℝ A).toReal v ∧ (∀ i, 0 < v i) := n:Type u_1inst✝²:Fintype ninst✝¹:DecidableEq ninst✝:Nonempty nA:Matrix n n ℝhA:A.IsIrreducible⊢ ∃ v, Module.End.HasEigenvector (Matrix.toLin' A) (spectralRadius ℝ A).toReal v ∧ ∀ (i : n), 0 < v i All goals completed! 🐙
#14
How produced

Original proof of irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius. Claude Opus 5 (Claude Code), under human direction, from the Challenge statement, Mathlib source search, and compiler feedback only; no published lean-eval solution consulted. Method. Mathlib already supplies the combinatorial half — `Matrix.IsIrreducible` and `isIrreducible_iff_exists_pow_pos` — so all the work is analytic, and the shape of the proof is chosen to keep it elementary. **Collatz–Wielandt without any continuity of a minimum.** The textbook route maximises `x ↦ minᵢ (Ax)ᵢ/xᵢ`, which is not continuous where a coordinate vanishes and forces a detour through upper semicontinuity or through a restricted positive cone. Instead, take r := sSup {s | ∃ x ∈ Δ, ∀ i, s·xᵢ ≤ (Ax)ᵢ} realised as `Prod.fst '' K`, where `K ⊆ [0, M] × Δ` is the set of admissible *pairs*. `K` is compact — the constraint `s·xᵢ ≤ (Ax)ᵢ` is closed, and `M := ∑ᵢⱼ |Aᵢⱼ|` bounds `s` because summing the constraints over `i` against `∑ xᵢ = 1` gives `s ≤ M`. So `IsCompact.sSup_mem` delivers attainment directly, with no semicontinuity argument and no maximising sequence. **The strictly positive smoothing matrix.** Irreducibility gives, for each `(i,j)`, some `k` with `(Aᵏ)ᵢⱼ > 0`; taking `N` to be the maximum over the finitely many pairs and using the entrywise bound `Aᵏ ≤ (1+A)ᴺ` for `k ≤ N` (a short induction — no binomial theorem needed) yields `B := (1+A)ᴺ` with **every** entry positive. **The improvement step.** `B` is a polynomial in `A`, so `B(Ay) = A(By)`, and `B` is nonnegative, so `Ay ≥ ry` transports to `A(By) ≥ r(By)`. Normalise `z := By/‖By‖₁ ∈ Δ`, which is strictly positive. If `Az - rz` were nonzero it would be nonnegative and nonzero, so `B(Az - rz)` is strictly positive in *every* coordinate; that is `A(Bz) - r(Bz) > 0` entrywise, and taking `ε := minᵢ ((Av')ᵢ - r·v'ᵢ)/v'ᵢ > 0` for the normalised `v'` exhibits `r + ε` as admissible, contradicting `r = sSup`. Hence `Az = rz` with `z > 0`. **Identifying `r` with the spectral radius.** Two inclusions. `r` is an eigenvalue, so `r ∈ spectrum ℝ A` (`Matrix.spectrum_toLin'` plus `hasEigenvalue_iff_mem_spectrum`). Conversely a real eigenvalue `λ` with eigenvector `u` satisfies, entrywise, `(A|u|)ᵢ = ∑ⱼ Aᵢⱼ|uⱼ| ≥ |∑ⱼ Aᵢⱼuⱼ| = |λ||uᵢ|`, so `|u|` normalised is admissible and `|λ| ≤ r`. Together these give `spectralRadius ℝ A = ↑(Real.toNNReal r)`, hence `.toReal = r`. 401 lines of helpers, one line of assembly. Zero `sorry`; `#print axioms` gives exactly propext, Classical.choice, Quot.sound.

Bourbaki's locally convex extension of Banach–Alaoglu
banach_alaoglu_bourbaki

Verso theorem preview

theorem declaration uses `sorry`banach_alaoglu_bourbaki (E : Type*) [AddCommGroup E] [Module ℝ E] [TopologicalSpace E] [ContinuousAdd E] [ContinuousSMul ℝ E] [LocallyConvexSpace ℝ E] (U : Set E) (_hU : U ∈ 𝓝 (0 : E)) : IsCompact (LeanEval.Analysis.weakStarPolar E U) := E:Type u_1inst✝⁵:AddCommGroup Einst✝⁴:Module ℝ Einst✝³:TopologicalSpace Einst✝²:ContinuousAdd Einst✝¹:ContinuousSMul ℝ Einst✝:LocallyConvexSpace ℝ EU:Set E_hU:U ∈ 𝓝 0⊢ IsCompact (weakStarPolar E U) All goals completed! 🐙
#15
How produced

**Relabel, not new work.** This repository gathers every already-accepted solve from this account that has a public source tree, so they can all carry one honest Model string. The proofs are unchanged from the submissions that were already accepted; nothing here is a new claim, and duplicate results on those problem ids are expected. Problem ids present (21): banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, brauer_character_in_cyclotomic, bvp_comparison, cubic_decay_asymptotic, dimitrov, dirichlet_eigenvalues_eq_nat_sq, finite_graph_ramsey_theorem, koszul_formula, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, mulCayley_connected_iff_closure_eq_top, normal_spectral_theorem, oppenheim_inequality, peano_existence, pell_solution_convergent, posSemidef_map_exp, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symplectic_matrix_det, trace_cayley_hamilton_newton. Why one label. Two facts make any single model string inaccurate for this account: 1. Private harnesses and components, drawn from private repositories under this account, take part in producing these submissions. What is evaluated is a model together with tooling that is neither public nor fixed, so naming one model implies the model alone produced the result. 2. Providers switch models mid-run. Some route or downgrade automatically during use, so a string naming one model can become false through no choice of ours and without our knowledge. `(various models)` is chosen to stay true under both, and is now the standing label for this account. Per-solve provenance, where it is worth stating, belongs in this free-text field rather than in the bucket label; the individual submissions already carry it. Earlier submissions of these same proofs went out under `github.com/mlgraham (Claude Fable 5)` and `github.com/mlgraham — public accepted source, packaged (Claude Fable 5)`. Please treat this as a relabel of those results if the pipeline supports it. One further accepted solve, `coc_strong_normalization`, has a private source tree and is relabelled in a separate issue rather than being published here. Every workspace is self-contained, pins Mathlib rev 6f1ef4e5dd604a435bddba4747b13970cd65d2a1 on Lean v4.33.0, contains no `sorry`, and depends only on propext, Classical.choice and Quot.sound.

Linear programming: maximum principle and vertex optimality
lp_maximum_principle

Verso theorem preview

/-- **Maximum principle for linear programming** (§101). A local maximiser of the LP objective on the feasible region is automatically a global maximiser; and whenever the objective is non-constant (`c ≠ 0`), the maximiser lies on the topological frontier of the feasible region. -/ theorem declaration uses `sorry`lp_maximum_principle {m n : ℕ} (lp : LinearProgram m n) (x : Fin m → ℝ) (_hx : x ∈ lp.feasible) (_hlocal : IsLocalMaxOn lp.objective lp.feasible x) : IsMaxOn lp.objective lp.feasible x ∧ (lp.c ≠ 0 → x ∈ frontier lp.feasible) := m:ℕn:ℕlp:LinearProgram m nx:Fin m → ℝ_hx:x ∈ lp.feasible_hlocal:IsLocalMaxOn lp.objective lp.feasible x⊢ IsMaxOn lp.objective lp.feasible x ∧ (lp.c ≠ 0 → x ∈ frontier lp.feasible) All goals completed! 🐙
/-- **Vertex optimality** (§101; the existence content of Dantzig's 1947 simplex algorithm). Every linear program with a nonempty bounded feasible region admits a global maximiser that is an extreme point (vertex) of the feasible region. -/ theorem declaration uses `sorry`simplex_algorithm {m n : ℕ} (lp : LinearProgram m n) (_hfeas : lp.feasible.Nonempty) (_hbdd : Bornology.IsBounded lp.feasible) : ∃ x ∈ lp.feasible, IsMaxOn lp.objective lp.feasible x ∧ x ∈ Set.extremePoints ℝ lp.feasible := m:ℕn:ℕlp:LinearProgram m n_hfeas:lp.feasible.Nonempty_hbdd:Bornology.IsBounded lp.feasible⊢ ∃ x ∈ lp.feasible, IsMaxOn lp.objective lp.feasible x ∧ x ∈ Set.extremePoints ℝ lp.feasible All goals completed! 🐙
#16
How produced

**Relabel, not new work.** This repository gathers every already-accepted solve from this account that has a public source tree, so they can all carry one honest Model string. The proofs are unchanged from the submissions that were already accepted; nothing here is a new claim, and duplicate results on those problem ids are expected. Problem ids present (21): banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, brauer_character_in_cyclotomic, bvp_comparison, cubic_decay_asymptotic, dimitrov, dirichlet_eigenvalues_eq_nat_sq, finite_graph_ramsey_theorem, koszul_formula, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, mulCayley_connected_iff_closure_eq_top, normal_spectral_theorem, oppenheim_inequality, peano_existence, pell_solution_convergent, posSemidef_map_exp, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symplectic_matrix_det, trace_cayley_hamilton_newton. Why one label. Two facts make any single model string inaccurate for this account: 1. Private harnesses and components, drawn from private repositories under this account, take part in producing these submissions. What is evaluated is a model together with tooling that is neither public nor fixed, so naming one model implies the model alone produced the result. 2. Providers switch models mid-run. Some route or downgrade automatically during use, so a string naming one model can become false through no choice of ours and without our knowledge. `(various models)` is chosen to stay true under both, and is now the standing label for this account. Per-solve provenance, where it is worth stating, belongs in this free-text field rather than in the bucket label; the individual submissions already carry it. Earlier submissions of these same proofs went out under `github.com/mlgraham (Claude Fable 5)` and `github.com/mlgraham — public accepted source, packaged (Claude Fable 5)`. Please treat this as a relabel of those results if the pipeline supports it. One further accepted solve, `coc_strong_normalization`, has a private source tree and is relabelled in a separate issue rather than being published here. Every workspace is self-contained, pins Mathlib rev 6f1ef4e5dd604a435bddba4747b13970cd65d2a1 on Lean v4.33.0, contains no `sorry`, and depends only on propext, Classical.choice and Quot.sound.

Symplectic matrices have determinant 1
symplectic_matrix_det

Verso theorem preview

theorem declaration uses `sorry`symplectic_matrix_det {l R : Type*} [DecidableEq l] [Fintype l] [CommRing R] {A : Matrix (l ⊕ l) (l ⊕ l) R} (_hA : A ∈ Matrix.symplecticGroup l R) : A.det = 1 := l:Type u_1R:Type u_2inst✝²:DecidableEq linst✝¹:Fintype linst✝:CommRing RA:Matrix (l ⊕ l) (l ⊕ l) R_hA:A ∈ symplecticGroup l R⊢ A.det = 1 All goals completed! 🐙
#17
How produced

**Relabel, not new work.** This repository gathers every already-accepted solve from this account that has a public source tree, so they can all carry one honest Model string. The proofs are unchanged from the submissions that were already accepted; nothing here is a new claim, and duplicate results on those problem ids are expected. Problem ids present (21): banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, brauer_character_in_cyclotomic, bvp_comparison, cubic_decay_asymptotic, dimitrov, dirichlet_eigenvalues_eq_nat_sq, finite_graph_ramsey_theorem, koszul_formula, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, mulCayley_connected_iff_closure_eq_top, normal_spectral_theorem, oppenheim_inequality, peano_existence, pell_solution_convergent, posSemidef_map_exp, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symplectic_matrix_det, trace_cayley_hamilton_newton. Why one label. Two facts make any single model string inaccurate for this account: 1. Private harnesses and components, drawn from private repositories under this account, take part in producing these submissions. What is evaluated is a model together with tooling that is neither public nor fixed, so naming one model implies the model alone produced the result. 2. Providers switch models mid-run. Some route or downgrade automatically during use, so a string naming one model can become false through no choice of ours and without our knowledge. `(various models)` is chosen to stay true under both, and is now the standing label for this account. Per-solve provenance, where it is worth stating, belongs in this free-text field rather than in the bucket label; the individual submissions already carry it. Earlier submissions of these same proofs went out under `github.com/mlgraham (Claude Fable 5)` and `github.com/mlgraham — public accepted source, packaged (Claude Fable 5)`. Please treat this as a relabel of those results if the pipeline supports it. One further accepted solve, `coc_strong_normalization`, has a private source tree and is relabelled in a separate issue rather than being published here. Every workspace is self-contained, pins Mathlib rev 6f1ef4e5dd604a435bddba4747b13970cd65d2a1 on Lean v4.33.0, contains no `sorry`, and depends only on propext, Classical.choice and Quot.sound.

Pell solutions are convergents of √d
pell_solution_convergent

Verso theorem preview

theorem declaration uses `sorry`pell_solution_is_convergent (d : ℤ) (_hd : Squarefree d) (_hd0 : 0 < d) (x y : ℤ) (_hx : 0 < x) (_hy : 0 < y) (_hsol : x ^ 2 - d * y ^ 2 = 1) : ∃ n : ℕ, (GenContFract.of (Real.sqrt (d : ℝ))).convs n = (x : ℝ) / (y : ℝ) := d:ℤ_hd:Squarefree d_hd0:0 < dx:ℤy:ℤ_hx:0 < x_hy:0 < y_hsol:x ^ 2 - d * y ^ 2 = 1⊢ ∃ n, (GenContFract.of √↑d).convs n = ↑x / ↑y All goals completed! 🐙
#18
How produced

Original proof of pell_solution_convergent. Claude Opus 5 (Claude Code), under human direction, from the Challenge statement, Mathlib source search, and compiler feedback only; no published lean-eval solution consulted. Method. Mathlib already has Legendre's theorem in the form needed (Real.exists_convs_eq_rat: if |xi - q| < 1/(2 * q.den^2) then q is a convergent of the continued fraction of xi), so the work is entirely in producing the approximation bound with the correct denominator. - Coprimality: gcd x y divides x^2 and d*y^2, hence divides x^2 - d*y^2 = 1, so gcd x y = 1. Rat.den_div_eq_of_coprime then gives that the denominator of x/y is exactly y, which is what makes the 1/(2 * den^2) threshold usable. - The estimate: from x^2 - d*y^2 = 1 one gets (x - y*sqrt d)(x + y*sqrt d) = 1, so |sqrt d - x/y| = 1/(y * (x + y*sqrt d)). Since d >= 1 forces x > y and sqrt d >= 1, we get x + y*sqrt d > 2y, hence the quantity is < 1/(2y^2). The final inequality is discharged by nlinarith from the factored identity together with x - y*sqrt d > 0 and x + y*sqrt d - 2y > 0, which is exactly the product-positivity that makes the bound work. Axioms: propext, Classical.choice, Quot.sound. No sorry. Built against the pinned Mathlib rev 6f1ef4e5dd604a435bddba4747b13970cd65d2a1, Lean v4.33.0.

Gaussian heat kernel solves the 1D heat equation
heat_kernel_solves_heat_equation

Verso theorem preview

theorem declaration uses `sorry`heat_kernel_solves_heat_equation (f : ℝ → ℝ) (hf_cont : Continuous f) (hf_bdd : ∃ M : ℝ, ∀ x, |f x| ≤ M) : -- The PDE on (0, ∞) × ℝ. (∀ t : ℝ, 0 < t → ∀ x : ℝ, ∃ ux : ℝ → ℝ, ∃ uxx : ℝ, (∀ y : ℝ, HasDerivAt (fun z => heatSolution f t z) (ux y) y) ∧ HasDerivAt ux uxx x ∧ HasDerivAt (fun s => heatSolution f s x) uxx t) ∧ -- Initial condition recovered as a one-sided limit at t = 0. (∀ x : ℝ, Filter.Tendsto (fun t : ℝ => heatSolution f t x) (nhdsWithin (0 : ℝ) (Set.Ioi 0)) (nhds (f x))) := f:ℝ → ℝhf_cont:Continuous fhf_bdd:∃ M, ∀ (x : ℝ), |f x| ≤ M⊢ (∀ (t : ℝ), 0 < t → ∀ (x : ℝ), ∃ ux uxx, (∀ (y : ℝ), HasDerivAt (fun z => heatSolution f t z) (ux y) y) ∧ HasDerivAt ux uxx x ∧ HasDerivAt (fun s => heatSolution f s x) uxx t) ∧ ∀ (x : ℝ), Filter.Tendsto (fun t => heatSolution f t x) (nhdsWithin 0 (Set.Ioi 0)) (nhds (f x)) All goals completed! 🐙
#19
How produced

Original proof of heat_kernel_solves_heat_equation. Claude Opus 5 (Claude Code), under human direction, from the Challenge statement, Mathlib source search, and compiler feedback only; no published lean-eval solution consulted. Method. The one structural observation that shapes the whole file: writing the kernel as G t x y = cst t * exp (-(x - y)^2 / (4 t)), cst t = (4 pi t)^(-1/2), its second x-derivative and its t-derivative are *literally the same expression*, G2 t x y = G t x y * ((x - y)^2 / (4 t^2) - 1 / (2 t)), because cst' t = -(1/(2t)) * cst t. So the PDE is not proved by comparing two computed quantities; the same `G2` is produced by all three differentiations, and the heat equation falls out of `hasDerivAt_G_t` and `hasDerivAt_G1_x` having the same value. That leaves the analysis, which is three applications of `hasDerivAt_integral_of_dominated_loc_of_deriv_le` and one dominated-convergence argument. 1. One domination lemma for everything. Every bound in the file reduces to polyGauss_le : (|z| + 1)^2 * exp (-(a z^2)) <= 2 * max 1 a⁻¹ (a > 0) proved from exp u >= 1 + u, with no calculus. Splitting the Gaussian as exp(-z^2/(8t)) = exp(-z^2/(16t)) * exp(-z^2/(16t)) lets the polynomial factor be absorbed by one half while the other half stays integrable. `G`, `G1` and `G2` then all share a single `G t x y * c` bound lemma, differing only in the choice of `c`. 2. Uniformity in x. For |x - x0| <= 1 the estimate (w - z)^2 >= z^2/2 - w^2 >= z^2/2 - 1 gives exp(-(x-y)^2/(4t)) <= exp(1/(4t)) * exp(-(y-x0)^2/(8t)), a bound independent of x. This is what makes the dominating function admissible on a whole neighbourhood. 3. Uniformity in t. For the time derivative the window is |s - t| <= t/2, so t/2 <= s <= 3t/2; monotonicity of `cst` and of exp(-(x-y)^2/(4s)) in s gives the same shape of bound with 1/(12t) in the exponent. 4. The initial condition. `tendsto_integral_peak_smul_of_integrable_of_tendsto` does not apply: it wants `Integrable f`, and here f is only continuous and bounded. Substituting y = x + 2 sqrt(t) s instead turns the solution into u(t,x) = pi^(-1/2) * INT exp(-s^2) * f (x + 2 sqrt(t) s) ds, with the normalisation collapsing exactly (cst t * 2 sqrt t = pi^(-1/2)). The limit is then ordinary dominated convergence against M * exp(-s^2), using only continuity of f at x, and `integral_gaussian 1` supplies INT exp(-s^2) = sqrt pi. Substrate used: `hasDerivAt_integral_of_dominated_loc_of_deriv_le`, `tendsto_integral_filter_of_dominated_convergence`, `integrable_exp_neg_mul_sq`, `integral_gaussian`, `Measure.integral_comp_mul_left`, `integral_add_left_eq_self`. Zero `sorry`; `#print axioms` gives exactly propext, Classical.choice, Quot.sound.

Minkowski-Caratheodory theorem
mem_convexHull_finset_extremePoints_of_mem_compact_convex

Verso theorem preview

theorem declaration uses `sorry`mem_convexHull_finset_extremePoints_of_mem_compact_convex {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] {s : Set E} {x : E} (hscomp : IsCompact s) (hsconv : Convex ℝ s) (hx : x ∈ s) : ∃ t : Finset E, (↑t : Set E) ⊆ s.extremePoints ℝ ∧ t.card ≤ Module.finrank ℝ E + 1 ∧ x ∈ convexHull ℝ (↑t : Set E) := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:FiniteDimensional ℝ Es:Set Ex:Ehscomp:IsCompact shsconv:Convex ℝ shx:x ∈ s⊢ ∃ t, ↑t ⊆ extremePoints ℝ s ∧ t.card ≤ Module.finrank ℝ E + 1 ∧ x ∈ (convexHull ℝ) ↑t All goals completed! 🐙
#20
How produced

Original proof of mem_convexHull_finset_extremePoints_of_mem_compact_convex. Claude Opus 5 (Claude Code), under human direction, from the Challenge statement, Mathlib source search, and compiler feedback only; no published lean-eval solution consulted. Note on method: the problem's informal solution suggests combining Krein-Milman with Caratheodory, but that is not sufficient on its own. Mathlib's closure_convexHull_extremePoints gives only closure (convexHull (extremePoints s)) = s, and the extreme points of a compact convex set need not be closed (already false in dimension 3), so the closure cannot simply be dropped -- Caratheodory applied to the closure yields points of closure (extremePoints s), not of extremePoints s as the statement requires. The submission therefore proves Minkowski's theorem proper, by strong induction on Module.finrank: - a transport lemma moving extreme points along the injective affine embedding of the direction space (vectorSpan) of the set, used to descend whenever the set spans a proper subspace; - for a set with nonempty interior, a chord through the target point meets the set in a compact segment whose endpoints are not interior; geometric_hahn_banach_open_point applied to the interior supplies a supporting functional at each endpoint (no limiting argument needed), whose argmax face is exposed, hence extreme, and lies in a hyperplane so its vectorSpan is proper; - the induction hypothesis applies to each face, and the target point is a convex combination of the two endpoints. Caratheodory's convexHull_eq_union then trims to an affinely independent finset, and AffineIndependent.card_le_finrank_succ with Submodule.finrank_le gives the finrank + 1 bound. Axioms: propext, Classical.choice, Quot.sound. No sorry. Built against the pinned Mathlib rev 6f1ef4e5dd604a435bddba4747b13970cd65d2a1, Lean v4.33.0.

pi_1 of the circle is Z
pi1_circle_mulEquiv_int

Verso theorem preview

theorem declaration uses `sorry`pi1_circle_mulEquiv_int : Nonempty (HomotopyGroup.Pi 1 Circle (1 : Circle) ≃* Multiplicative ℤ) := ⊢ Nonempty (HomotopyGroup.Pi 1 Circle 1 ≃* Multiplicative ℤ) All goals completed! 🐙
#21
How produced

Original proof of pi1_circle_mulEquiv_int. Claude Opus 5 (Claude Code), under human direction, from the Challenge statement, Mathlib source search, and compiler feedback only; no published lean-eval solution consulted. Method. Almost all of the mathematics is already in Mathlib; the work is in connecting four pieces. - Topology.Homotopy.Lifting has the covering-space computation of the fundamental group: IsAddQuotientCoveringMap.fundamentalGroupEquiv gives FundamentalGroup X x equivalent to (Multiplicative G) with the opposite multiplication, for a simply-connected covering space with deck group G. - Topology.Covering.AddCircle supplies the covering map R -> AddCircle (2 pi) with deck group zmultiples (2 pi), and R is simply connected because it is contractible (RealTopologicalVectorSpace.contractibleSpace, which lives in Analysis.Convex.Contractible and simply needs importing). - The deck group is infinite cyclic: zmultiplesHom R (2 pi) is injective because 2 pi is nonzero, and its range is zmultiples (2 pi). - Transporting from AddCircle (2 pi) to Circle along homeomorphCircle' needed a small piece that Mathlib does not package: a homeomorphism induces an equivalence of fundamental groupoids (built with Equivalence.mk from FundamentalGroupoid.map_comp and map_id), and then Functor.FullyFaithful.mulEquivEnd transports the vertex group. Note FundamentalGroup is defined as End, not Aut, so mulEquivEnd rather than autMulEquivOfFullyFaithful is the right tool. One wrinkle worth recording for anyone doing something similar: the group instance on HomotopyGroup depends on a DecidableEq argument, and homotopyGroupOfUniqueMulEquivFundamentalGroup derives that from Unique N (decidableEq_of_subsingleton) whereas the benchmark statement elaborates with instDecidableEqFin. The two are propositionally equal by Subsingleton.elim, so reverting and rewriting along that equality reconciles them. Axioms: propext, Classical.choice, Quot.sound. No sorry. Built against the pinned Mathlib rev 6f1ef4e5dd604a435bddba4747b13970cd65d2a1, Lean v4.33.0.

Character values of finite groups lie in cyclotomic fields
brauer_character_in_cyclotomic

Verso theorem preview

theorem declaration uses `sorry`brauer_character_in_cyclotomic (G : Type) [Group G] [Fintype G] : ∃ φ : CyclotomicField (Monoid.exponent G) ℚ →+* ℂ, ∀ (V : Type) (_ : AddCommGroup V) (_ : Module ℂ V) (_ : FiniteDimensional ℂ V) (ρ : Representation ℂ G V) (g : G), LinearMap.trace ℂ V (ρ g) ∈ φ.range := G:Typeinst✝¹:Group Ginst✝:Fintype G⊢ ∃ φ, ∀ (V : Type) (x : AddCommGroup V) (x_1 : Module ℂ V), FiniteDimensional ℂ V → ∀ (ρ : Representation ℂ G V) (g : G), (LinearMap.trace ℂ V) (ρ g) ∈ φ.range All goals completed! 🐙
#22
How produced

**Relabel, not new work.** This repository gathers every already-accepted solve from this account that has a public source tree, so they can all carry one honest Model string. The proofs are unchanged from the submissions that were already accepted; nothing here is a new claim, and duplicate results on those problem ids are expected. Problem ids present (21): banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, brauer_character_in_cyclotomic, bvp_comparison, cubic_decay_asymptotic, dimitrov, dirichlet_eigenvalues_eq_nat_sq, finite_graph_ramsey_theorem, koszul_formula, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, mulCayley_connected_iff_closure_eq_top, normal_spectral_theorem, oppenheim_inequality, peano_existence, pell_solution_convergent, posSemidef_map_exp, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symplectic_matrix_det, trace_cayley_hamilton_newton. Why one label. Two facts make any single model string inaccurate for this account: 1. Private harnesses and components, drawn from private repositories under this account, take part in producing these submissions. What is evaluated is a model together with tooling that is neither public nor fixed, so naming one model implies the model alone produced the result. 2. Providers switch models mid-run. Some route or downgrade automatically during use, so a string naming one model can become false through no choice of ours and without our knowledge. `(various models)` is chosen to stay true under both, and is now the standing label for this account. Per-solve provenance, where it is worth stating, belongs in this free-text field rather than in the bucket label; the individual submissions already carry it. Earlier submissions of these same proofs went out under `github.com/mlgraham (Claude Fable 5)` and `github.com/mlgraham — public accepted source, packaged (Claude Fable 5)`. Please treat this as a relabel of those results if the pipeline supports it. One further accepted solve, `coc_strong_normalization`, has a private source tree and is relabelled in a separate issue rather than being published here. Every workspace is self-contained, pins Mathlib rev 6f1ef4e5dd604a435bddba4747b13970cd65d2a1 on Lean v4.33.0, contains no `sorry`, and depends only on propext, Classical.choice and Quot.sound.

Oppenheim's inequality for Hadamard products
oppenheim_inequality

Verso theorem preview

theorem declaration uses `sorry`oppenheim_inequality {n : Type*} [Fintype n] [DecidableEq n] {A B : Matrix n n ℝ} (hA : A.PosSemidef) (hB : B.PosSemidef) : A.det * ∏ i, B i i ≤ (A ⊙ B).det := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℝB:Matrix n n ℝhA:A.PosSemidefhB:B.PosSemidef⊢ A.det * ∏ i, B i i ≤ (A ⊙ B).det All goals completed! 🐙
#23
How produced

**Relabel, not new work.** This repository gathers every already-accepted solve from this account that has a public source tree, so they can all carry one honest Model string. The proofs are unchanged from the submissions that were already accepted; nothing here is a new claim, and duplicate results on those problem ids are expected. Problem ids present (21): banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, brauer_character_in_cyclotomic, bvp_comparison, cubic_decay_asymptotic, dimitrov, dirichlet_eigenvalues_eq_nat_sq, finite_graph_ramsey_theorem, koszul_formula, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, mulCayley_connected_iff_closure_eq_top, normal_spectral_theorem, oppenheim_inequality, peano_existence, pell_solution_convergent, posSemidef_map_exp, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symplectic_matrix_det, trace_cayley_hamilton_newton. Why one label. Two facts make any single model string inaccurate for this account: 1. Private harnesses and components, drawn from private repositories under this account, take part in producing these submissions. What is evaluated is a model together with tooling that is neither public nor fixed, so naming one model implies the model alone produced the result. 2. Providers switch models mid-run. Some route or downgrade automatically during use, so a string naming one model can become false through no choice of ours and without our knowledge. `(various models)` is chosen to stay true under both, and is now the standing label for this account. Per-solve provenance, where it is worth stating, belongs in this free-text field rather than in the bucket label; the individual submissions already carry it. Earlier submissions of these same proofs went out under `github.com/mlgraham (Claude Fable 5)` and `github.com/mlgraham — public accepted source, packaged (Claude Fable 5)`. Please treat this as a relabel of those results if the pipeline supports it. One further accepted solve, `coc_strong_normalization`, has a private source tree and is relabelled in a separate issue rather than being published here. Every workspace is self-contained, pins Mathlib rev 6f1ef4e5dd604a435bddba4747b13970cd65d2a1 on Lean v4.33.0, contains no `sorry`, and depends only on propext, Classical.choice and Quot.sound.

Dirichlet eigenvalues of -y'' = lambda y on [0,pi] are n^2
dirichlet_eigenvalues_eq_nat_sq

Verso theorem preview

theorem declaration uses `sorry`dirichlet_eigenvalues_eq_nat_sq (lam : ℝ) : (∃ (y : ℝ → ℝ) (J : Set ℝ), IsOpen J ∧ Set.Icc (0 : ℝ) Real.pi ⊆ J ∧ (∀ x ∈ J, HasDerivAt y (deriv y x) x) ∧ (∀ x ∈ J, HasDerivAt (deriv y) (-(lam * y x)) x) ∧ y 0 = 0 ∧ y Real.pi = 0 ∧ ∃ x ∈ Set.Ioo (0 : ℝ) Real.pi, y x ≠ 0) ↔ ∃ n : ℕ, 0 < n ∧ lam = (n : ℝ) ^ 2 := lam:ℝ⊢ (∃ y J, IsOpen J ∧ Set.Icc 0 π ⊆ J ∧ (∀ x ∈ J, HasDerivAt y (deriv y x) x) ∧ (∀ x ∈ J, HasDerivAt (deriv y) (-(lam * y x)) x) ∧ y 0 = 0 ∧ y π = 0 ∧ ∃ x ∈ Set.Ioo 0 π, y x ≠ 0) ↔ ∃ n, 0 < n ∧ lam = ↑n ^ 2 All goals completed! 🐙
#24
How produced

**Relabel, not new work.** This repository gathers every already-accepted solve from this account that has a public source tree, so they can all carry one honest Model string. The proofs are unchanged from the submissions that were already accepted; nothing here is a new claim, and duplicate results on those problem ids are expected. Problem ids present (21): banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, brauer_character_in_cyclotomic, bvp_comparison, cubic_decay_asymptotic, dimitrov, dirichlet_eigenvalues_eq_nat_sq, finite_graph_ramsey_theorem, koszul_formula, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, mulCayley_connected_iff_closure_eq_top, normal_spectral_theorem, oppenheim_inequality, peano_existence, pell_solution_convergent, posSemidef_map_exp, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symplectic_matrix_det, trace_cayley_hamilton_newton. Why one label. Two facts make any single model string inaccurate for this account: 1. Private harnesses and components, drawn from private repositories under this account, take part in producing these submissions. What is evaluated is a model together with tooling that is neither public nor fixed, so naming one model implies the model alone produced the result. 2. Providers switch models mid-run. Some route or downgrade automatically during use, so a string naming one model can become false through no choice of ours and without our knowledge. `(various models)` is chosen to stay true under both, and is now the standing label for this account. Per-solve provenance, where it is worth stating, belongs in this free-text field rather than in the bucket label; the individual submissions already carry it. Earlier submissions of these same proofs went out under `github.com/mlgraham (Claude Fable 5)` and `github.com/mlgraham — public accepted source, packaged (Claude Fable 5)`. Please treat this as a relabel of those results if the pipeline supports it. One further accepted solve, `coc_strong_normalization`, has a private source tree and is relabelled in a separate issue rather than being published here. Every workspace is self-contained, pins Mathlib rev 6f1ef4e5dd604a435bddba4747b13970cd65d2a1 on Lean v4.33.0, contains no `sorry`, and depends only on propext, Classical.choice and Quot.sound.

Entrywise exponential of a PSD matrix is PSD
posSemidef_map_exp

Verso theorem preview

theorem declaration uses `sorry`posSemidef_map_exp {n : Type*} [Fintype n] [DecidableEq n] {A : Matrix n n ℝ} (hA : A.PosSemidef) : (A.map Real.exp).PosSemidef := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℝhA:A.PosSemidef⊢ (A.map Real.exp).PosSemidef All goals completed! 🐙
#25
How produced

**Relabel, not new work.** This repository gathers every already-accepted solve from this account that has a public source tree, so they can all carry one honest Model string. The proofs are unchanged from the submissions that were already accepted; nothing here is a new claim, and duplicate results on those problem ids are expected. Problem ids present (21): banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, brauer_character_in_cyclotomic, bvp_comparison, cubic_decay_asymptotic, dimitrov, dirichlet_eigenvalues_eq_nat_sq, finite_graph_ramsey_theorem, koszul_formula, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, mulCayley_connected_iff_closure_eq_top, normal_spectral_theorem, oppenheim_inequality, peano_existence, pell_solution_convergent, posSemidef_map_exp, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symplectic_matrix_det, trace_cayley_hamilton_newton. Why one label. Two facts make any single model string inaccurate for this account: 1. Private harnesses and components, drawn from private repositories under this account, take part in producing these submissions. What is evaluated is a model together with tooling that is neither public nor fixed, so naming one model implies the model alone produced the result. 2. Providers switch models mid-run. Some route or downgrade automatically during use, so a string naming one model can become false through no choice of ours and without our knowledge. `(various models)` is chosen to stay true under both, and is now the standing label for this account. Per-solve provenance, where it is worth stating, belongs in this free-text field rather than in the bucket label; the individual submissions already carry it. Earlier submissions of these same proofs went out under `github.com/mlgraham (Claude Fable 5)` and `github.com/mlgraham — public accepted source, packaged (Claude Fable 5)`. Please treat this as a relabel of those results if the pipeline supports it. One further accepted solve, `coc_strong_normalization`, has a private source tree and is relabelled in a separate issue rather than being published here. Every workspace is self-contained, pins Mathlib rev 6f1ef4e5dd604a435bddba4747b13970cd65d2a1 on Lean v4.33.0, contains no `sorry`, and depends only on propext, Classical.choice and Quot.sound.

Sturm separation theorem
sturm_separation

Verso theorem preview

theorem declaration uses `sorry`sturm_separation (p q y₁ y₂ : ℝ → ℝ) (a b : ℝ) (hab : a < b) (J : Set ℝ) (hJ_open : IsOpen J) (hJ_conn : IsPreconnected J) (hJ_sub : Set.Icc a b ⊆ J) (hp : ContinuousOn p J) (hq : ContinuousOn q J) (hy₁ : ∀ x ∈ J, HasDerivAt y₁ (deriv y₁ x) x) (hy₁' : ∀ x ∈ J, HasDerivAt (deriv y₁) (-(p x * deriv y₁ x + q x * y₁ x)) x) (hy₂ : ∀ x ∈ J, HasDerivAt y₂ (deriv y₂ x) x) (hy₂' : ∀ x ∈ J, HasDerivAt (deriv y₂) (-(p x * deriv y₂ x + q x * y₂ x)) x) (hW : ∃ x₀ ∈ J, y₁ x₀ * deriv y₂ x₀ - y₂ x₀ * deriv y₁ x₀ ≠ 0) (hza : y₁ a = 0) (hzb : y₁ b = 0) (hne : ∀ x ∈ Set.Ioo a b, y₁ x ≠ 0) : ∃! c, c ∈ Set.Ioo a b ∧ y₂ c = 0 := p:ℝ → ℝq:ℝ → ℝy₁:ℝ → ℝy₂:ℝ → ℝa:ℝb:ℝhab:a < bJ:Set ℝhJ_open:IsOpen JhJ_conn:IsPreconnected JhJ_sub:Set.Icc a b ⊆ Jhp:ContinuousOn p Jhq:ContinuousOn q Jhy₁:∀ x ∈ J, HasDerivAt y₁ (deriv y₁ x) xhy₁':∀ x ∈ J, HasDerivAt (deriv y₁) (-(p x * deriv y₁ x + q x * y₁ x)) xhy₂:∀ x ∈ J, HasDerivAt y₂ (deriv y₂ x) xhy₂':∀ x ∈ J, HasDerivAt (deriv y₂) (-(p x * deriv y₂ x + q x * y₂ x)) xhW:∃ x₀ ∈ J, y₁ x₀ * deriv y₂ x₀ - y₂ x₀ * deriv y₁ x₀ ≠ 0hza:y₁ a = 0hzb:y₁ b = 0hne:∀ x ∈ Set.Ioo a b, y₁ x ≠ 0⊢ ∃! c, c ∈ Set.Ioo a b ∧ y₂ c = 0 All goals completed! 🐙
#26
How produced

**Relabel, not new work.** This repository gathers every already-accepted solve from this account that has a public source tree, so they can all carry one honest Model string. The proofs are unchanged from the submissions that were already accepted; nothing here is a new claim, and duplicate results on those problem ids are expected. Problem ids present (21): banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, brauer_character_in_cyclotomic, bvp_comparison, cubic_decay_asymptotic, dimitrov, dirichlet_eigenvalues_eq_nat_sq, finite_graph_ramsey_theorem, koszul_formula, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, mulCayley_connected_iff_closure_eq_top, normal_spectral_theorem, oppenheim_inequality, peano_existence, pell_solution_convergent, posSemidef_map_exp, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symplectic_matrix_det, trace_cayley_hamilton_newton. Why one label. Two facts make any single model string inaccurate for this account: 1. Private harnesses and components, drawn from private repositories under this account, take part in producing these submissions. What is evaluated is a model together with tooling that is neither public nor fixed, so naming one model implies the model alone produced the result. 2. Providers switch models mid-run. Some route or downgrade automatically during use, so a string naming one model can become false through no choice of ours and without our knowledge. `(various models)` is chosen to stay true under both, and is now the standing label for this account. Per-solve provenance, where it is worth stating, belongs in this free-text field rather than in the bucket label; the individual submissions already carry it. Earlier submissions of these same proofs went out under `github.com/mlgraham (Claude Fable 5)` and `github.com/mlgraham — public accepted source, packaged (Claude Fable 5)`. Please treat this as a relabel of those results if the pipeline supports it. One further accepted solve, `coc_strong_normalization`, has a private source tree and is relabelled in a separate issue rather than being published here. Every workspace is self-contained, pins Mathlib rev 6f1ef4e5dd604a435bddba4747b13970cd65d2a1 on Lean v4.33.0, contains no `sorry`, and depends only on propext, Classical.choice and Quot.sound.

Polynomial decay rate of y' = -y^3
cubic_decay_asymptotic

Verso theorem preview

theorem declaration uses `sorry`cubic_decay_asymptotic (y : ℝ → ℝ) (hy_diff : ∀ t : ℝ, 0 < t → HasDerivAt y (-(y t) ^ 3) t) (hy_cont : ContinuousWithinAt y (Set.Ici 0) 0) (hy0 : y 0 = 1) : Tendsto (fun t : ℝ => y t * Real.sqrt t) atTop (𝓝 (1 / Real.sqrt 2)) := y:ℝ → ℝhy_diff:∀ (t : ℝ), 0 < t → HasDerivAt y (-y t ^ 3) thy_cont:ContinuousWithinAt y (Set.Ici 0) 0hy0:y 0 = 1⊢ Tendsto (fun t => y t * √t) atTop (𝓝 (1 / √2)) All goals completed! 🐙
#27
How produced

**Relabel, not new work.** This repository gathers every already-accepted solve from this account that has a public source tree, so they can all carry one honest Model string. The proofs are unchanged from the submissions that were already accepted; nothing here is a new claim, and duplicate results on those problem ids are expected. Problem ids present (21): banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, brauer_character_in_cyclotomic, bvp_comparison, cubic_decay_asymptotic, dimitrov, dirichlet_eigenvalues_eq_nat_sq, finite_graph_ramsey_theorem, koszul_formula, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, mulCayley_connected_iff_closure_eq_top, normal_spectral_theorem, oppenheim_inequality, peano_existence, pell_solution_convergent, posSemidef_map_exp, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symplectic_matrix_det, trace_cayley_hamilton_newton. Why one label. Two facts make any single model string inaccurate for this account: 1. Private harnesses and components, drawn from private repositories under this account, take part in producing these submissions. What is evaluated is a model together with tooling that is neither public nor fixed, so naming one model implies the model alone produced the result. 2. Providers switch models mid-run. Some route or downgrade automatically during use, so a string naming one model can become false through no choice of ours and without our knowledge. `(various models)` is chosen to stay true under both, and is now the standing label for this account. Per-solve provenance, where it is worth stating, belongs in this free-text field rather than in the bucket label; the individual submissions already carry it. Earlier submissions of these same proofs went out under `github.com/mlgraham (Claude Fable 5)` and `github.com/mlgraham — public accepted source, packaged (Claude Fable 5)`. Please treat this as a relabel of those results if the pipeline supports it. One further accepted solve, `coc_strong_normalization`, has a private source tree and is relabelled in a separate issue rather than being published here. Every workspace is self-contained, pins Mathlib rev 6f1ef4e5dd604a435bddba4747b13970cd65d2a1 on Lean v4.33.0, contains no `sorry`, and depends only on propext, Classical.choice and Quot.sound.

Comparison principle for the Dirichlet BVP
bvp_comparison

Verso theorem preview

theorem declaration uses `sorry`bvp_comparison (J : Set ℝ) (hJ_open : IsOpen J) (hJ_sub : Set.Icc (0 : ℝ) 1 ⊆ J) (u v : ℝ → ℝ) (hu : ∀ x ∈ J, HasDerivAt u (deriv u x) x) (hu' : ∀ x ∈ J, HasDerivAt (deriv u) (deriv (deriv u) x) x) (hv : ∀ x ∈ J, HasDerivAt v (deriv v x) x) (hv' : ∀ x ∈ J, HasDerivAt (deriv v) (deriv (deriv v) x) x) (hineq : ∀ x ∈ Set.Ioo (0 : ℝ) 1, -deriv (deriv u) x ≤ -deriv (deriv v) x) (hu0 : u 0 ≤ v 0) (hu1 : u 1 ≤ v 1) : ∀ x ∈ Set.Icc (0 : ℝ) 1, u x ≤ v x := J:Set ℝhJ_open:IsOpen JhJ_sub:Set.Icc 0 1 ⊆ Ju:ℝ → ℝv:ℝ → ℝhu:∀ x ∈ J, HasDerivAt u (deriv u x) xhu':∀ x ∈ J, HasDerivAt (deriv u) (deriv (deriv u) x) xhv:∀ x ∈ J, HasDerivAt v (deriv v x) xhv':∀ x ∈ J, HasDerivAt (deriv v) (deriv (deriv v) x) xhineq:∀ x ∈ Set.Ioo 0 1, -deriv (deriv u) x ≤ -deriv (deriv v) xhu0:u 0 ≤ v 0hu1:u 1 ≤ v 1⊢ ∀ x ∈ Set.Icc 0 1, u x ≤ v x All goals completed! 🐙
#28
How produced

**Relabel, not new work.** This repository gathers every already-accepted solve from this account that has a public source tree, so they can all carry one honest Model string. The proofs are unchanged from the submissions that were already accepted; nothing here is a new claim, and duplicate results on those problem ids are expected. Problem ids present (21): banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, brauer_character_in_cyclotomic, bvp_comparison, cubic_decay_asymptotic, dimitrov, dirichlet_eigenvalues_eq_nat_sq, finite_graph_ramsey_theorem, koszul_formula, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, mulCayley_connected_iff_closure_eq_top, normal_spectral_theorem, oppenheim_inequality, peano_existence, pell_solution_convergent, posSemidef_map_exp, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symplectic_matrix_det, trace_cayley_hamilton_newton. Why one label. Two facts make any single model string inaccurate for this account: 1. Private harnesses and components, drawn from private repositories under this account, take part in producing these submissions. What is evaluated is a model together with tooling that is neither public nor fixed, so naming one model implies the model alone produced the result. 2. Providers switch models mid-run. Some route or downgrade automatically during use, so a string naming one model can become false through no choice of ours and without our knowledge. `(various models)` is chosen to stay true under both, and is now the standing label for this account. Per-solve provenance, where it is worth stating, belongs in this free-text field rather than in the bucket label; the individual submissions already carry it. Earlier submissions of these same proofs went out under `github.com/mlgraham (Claude Fable 5)` and `github.com/mlgraham — public accepted source, packaged (Claude Fable 5)`. Please treat this as a relabel of those results if the pipeline supports it. One further accepted solve, `coc_strong_normalization`, has a private source tree and is relabelled in a separate issue rather than being published here. Every workspace is self-contained, pins Mathlib rev 6f1ef4e5dd604a435bddba4747b13970cd65d2a1 on Lean v4.33.0, contains no `sorry`, and depends only on propext, Classical.choice and Quot.sound.

Cayley graph connected iff generators generate the group
mulCayley_connected_iff_closure_eq_top

Verso theorem preview

theorem declaration uses `sorry`mulCayley_connected_iff_closure_eq_top {G : Type*} [Group G] (S : Set G) : (SimpleGraph.mulCayley S).Connected ↔ Subgroup.closure S = ⊤ := G:Type u_1inst✝:Group GS:Set G⊢ (SimpleGraph.mulCayley S).Connected ↔ Subgroup.closure S = ⊤ All goals completed! 🐙
#29
How produced

**Relabel, not new work.** This repository gathers every already-accepted solve from this account that has a public source tree, so they can all carry one honest Model string. The proofs are unchanged from the submissions that were already accepted; nothing here is a new claim, and duplicate results on those problem ids are expected. Problem ids present (21): banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, brauer_character_in_cyclotomic, bvp_comparison, cubic_decay_asymptotic, dimitrov, dirichlet_eigenvalues_eq_nat_sq, finite_graph_ramsey_theorem, koszul_formula, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, mulCayley_connected_iff_closure_eq_top, normal_spectral_theorem, oppenheim_inequality, peano_existence, pell_solution_convergent, posSemidef_map_exp, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symplectic_matrix_det, trace_cayley_hamilton_newton. Why one label. Two facts make any single model string inaccurate for this account: 1. Private harnesses and components, drawn from private repositories under this account, take part in producing these submissions. What is evaluated is a model together with tooling that is neither public nor fixed, so naming one model implies the model alone produced the result. 2. Providers switch models mid-run. Some route or downgrade automatically during use, so a string naming one model can become false through no choice of ours and without our knowledge. `(various models)` is chosen to stay true under both, and is now the standing label for this account. Per-solve provenance, where it is worth stating, belongs in this free-text field rather than in the bucket label; the individual submissions already carry it. Earlier submissions of these same proofs went out under `github.com/mlgraham (Claude Fable 5)` and `github.com/mlgraham — public accepted source, packaged (Claude Fable 5)`. Please treat this as a relabel of those results if the pipeline supports it. One further accepted solve, `coc_strong_normalization`, has a private source tree and is relabelled in a separate issue rather than being published here. Every workspace is self-contained, pins Mathlib rev 6f1ef4e5dd604a435bddba4747b13970cd65d2a1 on Lean v4.33.0, contains no `sorry`, and depends only on propext, Classical.choice and Quot.sound.

Finite Ramsey theorem for graphs
finite_graph_ramsey_theorem

Verso theorem preview

theorem declaration uses `sorry`finite_graph_ramsey_theorem : ∀ r s : ℕ, 2 ≤ r → 2 ≤ s → ∃ n : ℕ, ∀ G : SimpleGraph (Fin n), ¬ G.CliqueFree r ∨ ¬ Gᶜ.CliqueFree s := ⊢ ∀ (r s : ℕ), 2 ≤ r → 2 ≤ s → ∃ n, ∀ (G : SimpleGraph (Fin n)), ¬G.CliqueFree r ∨ ¬Gᶜ.CliqueFree s All goals completed! 🐙
#30
How produced

**Relabel, not new work.** This repository gathers every already-accepted solve from this account that has a public source tree, so they can all carry one honest Model string. The proofs are unchanged from the submissions that were already accepted; nothing here is a new claim, and duplicate results on those problem ids are expected. Problem ids present (21): banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, brauer_character_in_cyclotomic, bvp_comparison, cubic_decay_asymptotic, dimitrov, dirichlet_eigenvalues_eq_nat_sq, finite_graph_ramsey_theorem, koszul_formula, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, mulCayley_connected_iff_closure_eq_top, normal_spectral_theorem, oppenheim_inequality, peano_existence, pell_solution_convergent, posSemidef_map_exp, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symplectic_matrix_det, trace_cayley_hamilton_newton. Why one label. Two facts make any single model string inaccurate for this account: 1. Private harnesses and components, drawn from private repositories under this account, take part in producing these submissions. What is evaluated is a model together with tooling that is neither public nor fixed, so naming one model implies the model alone produced the result. 2. Providers switch models mid-run. Some route or downgrade automatically during use, so a string naming one model can become false through no choice of ours and without our knowledge. `(various models)` is chosen to stay true under both, and is now the standing label for this account. Per-solve provenance, where it is worth stating, belongs in this free-text field rather than in the bucket label; the individual submissions already carry it. Earlier submissions of these same proofs went out under `github.com/mlgraham (Claude Fable 5)` and `github.com/mlgraham — public accepted source, packaged (Claude Fable 5)`. Please treat this as a relabel of those results if the pipeline supports it. One further accepted solve, `coc_strong_normalization`, has a private source tree and is relabelled in a separate issue rather than being published here. Every workspace is self-contained, pins Mathlib rev 6f1ef4e5dd604a435bddba4747b13970cd65d2a1 on Lean v4.33.0, contains no `sorry`, and depends only on propext, Classical.choice and Quot.sound.

Catalan generating function via compositional inversion
substInv_X_sub_X_sq_eq_catalan

Verso theorem preview

theorem declaration uses `sorry`substInv_X_sub_X_sq_eq_catalan (n : ℕ) : haveI : Invertible (coeff 1 ((X : ℚ⟦X⟧) - X ^ 2)) := n:ℕ⊢ Invertible ((coeff 1) (X - X ^ 2)) n:ℕ⊢ Invertible 1; All goals completed! 🐙 coeff (n + 1) (substInv ((X : ℚ⟦X⟧) - X ^ 2)) = (Nat.choose (2 * n) n : ℚ) / (↑n + 1) := n:ℕ⊢ (coeff (n + 1)) (X - X ^ 2).substInv = ↑((2 * n).choose n) / (↑n + 1) All goals completed! 🐙
#31
How produced

**Relabel, not new work.** This repository gathers every already-accepted solve from this account that has a public source tree, so they can all carry one honest Model string. The proofs are unchanged from the submissions that were already accepted; nothing here is a new claim, and duplicate results on those problem ids are expected. Problem ids present (21): banach_alaoglu_bourbaki, bauer_extreme_point_uniqueness, brauer_character_in_cyclotomic, bvp_comparison, cubic_decay_asymptotic, dimitrov, dirichlet_eigenvalues_eq_nat_sq, finite_graph_ramsey_theorem, koszul_formula, lp_maximum_principle, mem_convexHull_finset_extremePoints_of_mem_compact_convex, mulCayley_connected_iff_closure_eq_top, normal_spectral_theorem, oppenheim_inequality, peano_existence, pell_solution_convergent, posSemidef_map_exp, sturm_separation, substInv_X_sub_X_sq_eq_catalan, symplectic_matrix_det, trace_cayley_hamilton_newton. Why one label. Two facts make any single model string inaccurate for this account: 1. Private harnesses and components, drawn from private repositories under this account, take part in producing these submissions. What is evaluated is a model together with tooling that is neither public nor fixed, so naming one model implies the model alone produced the result. 2. Providers switch models mid-run. Some route or downgrade automatically during use, so a string naming one model can become false through no choice of ours and without our knowledge. `(various models)` is chosen to stay true under both, and is now the standing label for this account. Per-solve provenance, where it is worth stating, belongs in this free-text field rather than in the bucket label; the individual submissions already carry it. Earlier submissions of these same proofs went out under `github.com/mlgraham (Claude Fable 5)` and `github.com/mlgraham — public accepted source, packaged (Claude Fable 5)`. Please treat this as a relabel of those results if the pipeline supports it. One further accepted solve, `coc_strong_normalization`, has a private source tree and is relabelled in a separate issue rather than being published here. Every workspace is self-contained, pins Mathlib rev 6f1ef4e5dd604a435bddba4747b13970cd65d2a1 on Lean v4.33.0, contains no `sorry`, and depends only on propext, Classical.choice and Quot.sound.

First submissionAug 29, 2026
Last submissionAug 29, 2026
mlgraham31
14MerLean-Prover30 solved
Hippocrates' theorem on lunes
hippocrates_lunes

Verso theorem preview

theorem declaration uses `sorry`hippocrates_lunes (a b : ℝ) (ha : 0 < a) (hb : 0 < b) : volume (LeanEval.Geometry.HippocratesLunes.horizontalLune a b) + volume (LeanEval.Geometry.HippocratesLunes.verticalLune a b) = volume (LeanEval.Geometry.HippocratesLunes.rightTriangle a b) := a:ℝb:ℝha:0 < ahb:0 < b⊢ volume (horizontalLune a b) + volume (verticalLune a b) = volume (rightTriangle a b) All goals completed! 🐙
#1
Schauder fixed-point theorem
schauder_fixed_point

Verso theorem preview

theorem declaration uses `sorry`schauder_fixed_point {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [CompleteSpace E] {K : Set E} (_hK_compact : IsCompact K) (_hK_convex : Convex ℝ K) (_hK_nonempty : K.Nonempty) (f : E → E) (_hf_cont : ContinuousOn f K) (_hf_maps : Set.MapsTo f K K) : ∃ x ∈ K, f x = x := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:CompleteSpace EK:Set E_hK_compact:IsCompact K_hK_convex:Convex ℝ K_hK_nonempty:K.Nonemptyf:E → E_hf_cont:ContinuousOn f K_hf_maps:Set.MapsTo f K K⊢ ∃ x ∈ K, f x = x All goals completed! 🐙
#2
Kuznetsov's theorem: finitely presented simple groups have solvable word problem
boone_higman_simple

Verso theorem preview

theorem declaration uses `sorry`boone_higman_simple {G : Type*} [Group G] [IsSimpleGroup G] {n : ℕ} (φ : FreeGroup (Fin n) →* G) (_hsurj : Function.Surjective φ) (_hker : (MonoidHom.ker φ).IsFinitelyNormallyGenerated) : LeanEval.GroupTheory.BooneHigmanSimpleProblem.WordProblemSolvable φ := G:Type u_1inst✝¹:Group Ginst✝:IsSimpleGroup Gn:ℕφ:FreeGroup (Fin n) →* G_hsurj:Function.Surjective ⇑φ_hker:φ.ker.IsFinitelyNormallyGenerated⊢ WordProblemSolvable φ All goals completed! 🐙
#3
Pointwise and Cesàro convergence of Fourier series (Dirichlet, Fejér)
fourier_dirichlet_fejer

Verso theorem preview

/-- **Dirichlet's pointwise convergence theorem** (§46). For every `C¹` 2π-periodic complex function `f`, the symmetric Fourier partial sums `S_N(f)(x)` converge to `f(x)` at every point `x ∈ ℝ`. -/ theorem declaration uses `sorry`dirichlet_pointwise {f : ℝ → ℂ} (_hperiod : Function.Periodic f (2 * Real.pi)) (_hC1 : ContDiff ℝ 1 f) (x : ℝ) : Tendsto (fun N : ℕ => fourierPartialSum f N x) atTop (𝓝 (f x)) := f:ℝ → ℂ_hperiod:Function.Periodic f (2 * Real.pi)_hC1:ContDiff ℝ 1 fx:ℝ⊢ Tendsto (fun N => fourierPartialSum f N x) atTop (𝓝 (f x)) All goals completed! 🐙
/-- **Fejér's theorem** (§46). For every *continuous* 2π-periodic complex function `f` — without the `C¹` hypothesis of Dirichlet's theorem — the Cesàro means `σ_N(f)` of the symmetric Fourier partial sums converge to `f` uniformly on `ℝ`. -/ theorem declaration uses `sorry`fejer {f : ℝ → ℂ} (_hperiod : Function.Periodic f (2 * Real.pi)) (_hcont : Continuous f) : TendstoUniformly (fun N : ℕ => fourierCesaroMean f N) f atTop := f:ℝ → ℂ_hperiod:Function.Periodic f (2 * Real.pi)_hcont:Continuous f⊢ TendstoUniformly (fun N => fourierCesaroMean f N) f atTop All goals completed! 🐙
#4
Burnside p^a q^b theorem
finite_group_isSolvable_of_card_eq_prime_pow_mul_prime_pow

Verso theorem preview

theorem declaration uses `sorry`finite_group_isSolvable_of_card_eq_prime_pow_mul_prime_pow {G : Type*} [Group G] [Fintype G] {p q a b : ℕ} (hp : Nat.Prime p) (hq : Nat.Prime q) (hpq : p ≠ q) (hcard : Fintype.card G = p ^ a * q ^ b) : Group.IsSolvable G := G:Type u_1inst✝¹:Group Ginst✝:Fintype Gp:ℕq:ℕa:ℕb:ℕhp:Nat.Prime phq:Nat.Prime qhpq:p ≠ qhcard:Fintype.card G = p ^ a * q ^ b⊢ Group.IsSolvable G All goals completed! 🐙
#5
Existence of a non-isotopic pair of oriented two-component links
exists_nonisotopic_link

Verso theorem preview

theorem declaration uses `sorry`exists_nonisotopic_link : ∃ L₁ L₂ : LeanEval.KnotTheory.TwoLink, ¬ L₁.Isotopic L₂ := ⊢ ∃ L₁ L₂, ¬L₁.Isotopic L₂ All goals completed! 🐙
#6
Runge's theorem
runge_theorem

Verso theorem preview

theorem declaration uses `sorry`runge (K : Set ℂ) (_hK : IsCompact K) (U : Set ℂ) (_hU : IsOpen U) (_hKU : K ⊆ U) (f : ℂ → ℂ) (_hf : AnalyticOnNhd ℂ f U) (ε : ℝ) (_hε : 0 < ε) : ∃ p q : ℂ[X], (∀ z ∈ K, q.eval z ≠ 0) ∧ (∀ z ∈ K, ‖f z - p.eval z / q.eval z‖ < ε) := K:Set ℂ_hK:IsCompact KU:Set ℂ_hU:IsOpen U_hKU:K ⊆ Uf:ℂ → ℂ_hf:AnalyticOnNhd ℂ f Uε:ℝ_hε:0 < ε⊢ ∃ p q, (∀ z ∈ K, Polynomial.eval z q ≠ 0) ∧ ∀ z ∈ K, ‖f z - Polynomial.eval z p / Polynomial.eval z q‖ < ε All goals completed! 🐙
#7
Abel–Ruffini theorem
abel_ruffini

Verso theorem preview

theorem declaration uses `sorry`abel_ruffini (n : ℕ) (_hn : 1 ≤ n) : (∀ p : ℚ[X], p.natDegree = n → ∀ x : ℂ, aeval x p = 0 → x ∈ solvableByRad ℚ ℂ) ↔ n ≤ 4 := n:ℕ_hn:1 ≤ n⊢ (∀ (p : ℚ[X]), p.natDegree = n → ∀ (x : ℂ), (aeval x) p = 0 → x ∈ solvableByRad ℚ ℂ) ↔ n ≤ 4 All goals completed! 🐙
#8
Wiener's atom-detection formula
wiener_atom_detection

Verso theorem preview

theorem declaration uses `sorry`wiener_atom_detection (μ : Measure (AddCircle (2 * Real.pi))) [IsProbabilityMeasure μ] : Tendsto (fun N : ℕ => (1 / (N : ℝ)) * ∑ k ∈ Finset.Icc (1 : ℤ) N, ‖fourierCoeffMeasure μ k‖ ^ 2) atTop (𝓝 (∑' x : AddCircle (2 * Real.pi), ((μ {x}).toReal) ^ 2)) := μ:Measure (AddCircle (2 * π))inst✝:IsProbabilityMeasure μ⊢ Tendsto (fun N => 1 / ↑N * ∑ k ∈ Finset.Icc 1 ↑N, ‖fourierCoeffMeasure μ k‖ ^ 2) atTop (𝓝 (∑' (x : AddCircle (2 * π)), (μ {x}).toReal ^ 2)) All goals completed! 🐙
#9
Brouwer fixed-point theorem
brouwer_fixed_point

Verso theorem preview

theorem declaration uses `sorry`brouwer_fixed_point {d : ℕ} {K : Set (EuclideanSpace ℝ (Fin d))} (_hK_compact : IsCompact K) (_hK_convex : Convex ℝ K) (_hK_nonempty : K.Nonempty) (f : EuclideanSpace ℝ (Fin d) → EuclideanSpace ℝ (Fin d)) (_hf_cont : ContinuousOn f K) (_hf_maps : MapsTo f K K) : ∃ x ∈ K, f x = x := d:ℕK:Set (EuclideanSpace ℝ (Fin d))_hK_compact:IsCompact K_hK_convex:Convex ℝ K_hK_nonempty:K.Nonemptyf:EuclideanSpace ℝ (Fin d) → EuclideanSpace ℝ (Fin d)_hf_cont:ContinuousOn f K_hf_maps:MapsTo f K K⊢ ∃ x ∈ K, f x = x All goals completed! 🐙
#10
von Neumann double commutant theorem
vonNeumann_doubleCommutant_tfae

Verso theorem preview

theorem declaration uses `sorry`vonNeumann_doubleCommutant_tfae {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H] (S : StarSubalgebra ℂ (H →L[ℂ] H)) : List.TFAE [ Set.centralizer (Set.centralizer (S : Set (H →L[ℂ] H))) = S , IsClosed (ContinuousLinearMapWOT.ofCLM '' (S : Set (H →L[ℂ] H))) , IsClosed (ContinuousLinearMap.toPointwiseConvergenceCLM ℂ (RingHom.id ℂ) H H '' (S : Set (H →L[ℂ] H))) ] := H:Type u_1inst✝²:NormedAddCommGroup Hinst✝¹:InnerProductSpace ℂ Hinst✝:CompleteSpace HS:StarSubalgebra ℂ (H →L[ℂ] H)⊢ [(↑S).centralizer.centralizer = ↑S, IsClosed (ContinuousLinearMapWOT.ofCLM '' ↑S), IsClosed (⇑(ContinuousLinearMap.toPointwiseConvergenceCLM ℂ (RingHom.id ℂ) H H) '' ↑S)].TFAE All goals completed! 🐙
#11
Linear ODE with negative-real-part eigenvalues is asymptotically stable
linear_ode_asymptotic_stability

Verso theorem preview

theorem declaration uses `sorry`linear_ode_asymptotic_stability (n : ℕ) (A : Matrix (Fin n) (Fin n) ℝ) (hA : ∀ μ : ℂ, Module.End.HasEigenvalue (Matrix.toLin' (A.map (algebraMap ℝ ℂ))) μ → μ.re < 0) (x : ℝ → (Fin n → ℝ)) (hx : ∀ t : ℝ, 0 < t → HasDerivAt x (A.mulVec (x t)) t) : Filter.Tendsto (fun t : ℝ => ‖x t‖) Filter.atTop (nhds 0) := n:ℕA:Matrix (Fin n) (Fin n) ℝhA:∀ (μ : ℂ), Module.End.HasEigenvalue (Matrix.toLin' (A.map ⇑(algebraMap ℝ ℂ))) μ → μ.re < 0x:ℝ → Fin n → ℝhx:∀ (t : ℝ), 0 < t → HasDerivAt x (A *ᵥ x t) t⊢ Filter.Tendsto (fun t => ‖x t‖) Filter.atTop (nhds 0) All goals completed! 🐙
#12
Linear programming: maximum principle and vertex optimality
lp_maximum_principle

Verso theorem preview

/-- **Maximum principle for linear programming** (§101). A local maximiser of the LP objective on the feasible region is automatically a global maximiser; and whenever the objective is non-constant (`c ≠ 0`), the maximiser lies on the topological frontier of the feasible region. -/ theorem declaration uses `sorry`lp_maximum_principle {m n : ℕ} (lp : LinearProgram m n) (x : Fin m → ℝ) (_hx : x ∈ lp.feasible) (_hlocal : IsLocalMaxOn lp.objective lp.feasible x) : IsMaxOn lp.objective lp.feasible x ∧ (lp.c ≠ 0 → x ∈ frontier lp.feasible) := m:ℕn:ℕlp:LinearProgram m nx:Fin m → ℝ_hx:x ∈ lp.feasible_hlocal:IsLocalMaxOn lp.objective lp.feasible x⊢ IsMaxOn lp.objective lp.feasible x ∧ (lp.c ≠ 0 → x ∈ frontier lp.feasible) All goals completed! 🐙
/-- **Vertex optimality** (§101; the existence content of Dantzig's 1947 simplex algorithm). Every linear program with a nonempty bounded feasible region admits a global maximiser that is an extreme point (vertex) of the feasible region. -/ theorem declaration uses `sorry`simplex_algorithm {m n : ℕ} (lp : LinearProgram m n) (_hfeas : lp.feasible.Nonempty) (_hbdd : Bornology.IsBounded lp.feasible) : ∃ x ∈ lp.feasible, IsMaxOn lp.objective lp.feasible x ∧ x ∈ Set.extremePoints ℝ lp.feasible := m:ℕn:ℕlp:LinearProgram m n_hfeas:lp.feasible.Nonempty_hbdd:Bornology.IsBounded lp.feasible⊢ ∃ x ∈ lp.feasible, IsMaxOn lp.objective lp.feasible x ∧ x ∈ Set.extremePoints ℝ lp.feasible All goals completed! 🐙
#13
Bourbaki's locally convex extension of Banach–Alaoglu
banach_alaoglu_bourbaki

Verso theorem preview

theorem declaration uses `sorry`banach_alaoglu_bourbaki (E : Type*) [AddCommGroup E] [Module ℝ E] [TopologicalSpace E] [ContinuousAdd E] [ContinuousSMul ℝ E] [LocallyConvexSpace ℝ E] (U : Set E) (_hU : U ∈ 𝓝 (0 : E)) : IsCompact (LeanEval.Analysis.weakStarPolar E U) := E:Type u_1inst✝⁵:AddCommGroup Einst✝⁴:Module ℝ Einst✝³:TopologicalSpace Einst✝²:ContinuousAdd Einst✝¹:ContinuousSMul ℝ Einst✝:LocallyConvexSpace ℝ EU:Set E_hU:U ∈ 𝓝 0⊢ IsCompact (weakStarPolar E U) All goals completed! 🐙
#14
Pell solutions are convergents of √d
pell_solution_convergent

Verso theorem preview

theorem declaration uses `sorry`pell_solution_is_convergent (d : ℤ) (_hd : Squarefree d) (_hd0 : 0 < d) (x y : ℤ) (_hx : 0 < x) (_hy : 0 < y) (_hsol : x ^ 2 - d * y ^ 2 = 1) : ∃ n : ℕ, (GenContFract.of (Real.sqrt (d : ℝ))).convs n = (x : ℝ) / (y : ℝ) := d:ℤ_hd:Squarefree d_hd0:0 < dx:ℤy:ℤ_hx:0 < x_hy:0 < y_hsol:x ^ 2 - d * y ^ 2 = 1⊢ ∃ n, (GenContFract.of √↑d).convs n = ↑x / ↑y All goals completed! 🐙
#15
Complementary polynomial on the unit circle
exists_complementary_polynomial_on_unit_circle

Verso theorem preview

theorem declaration uses `sorry`exists_complementary_polynomial_on_unit_circle (P : ℂ[X]) (hP : ∀ z : Circle, ‖P.eval (z : ℂ)‖ ≤ 1) : ∃ Q : ℂ[X], Q.natDegree ≤ P.natDegree ∧ ∀ z : Circle, ‖P.eval (z : ℂ)‖ ^ 2 + ‖Q.eval (z : ℂ)‖ ^ 2 = 1 := P:ℂ[X]hP:∀ (z : Circle), ‖eval (↑z) P‖ ≤ 1⊢ ∃ Q, Q.natDegree ≤ P.natDegree ∧ ∀ (z : Circle), ‖eval (↑z) P‖ ^ 2 + ‖eval (↑z) Q‖ ^ 2 = 1 All goals completed! 🐙
#16
Rouche theorem via zero counting
rouche_zero_count_eq

Verso theorem preview

theorem declaration uses `sorry`rouche_zero_count_eq {f g : ℂ → ℂ} {R : ℝ} (hR : 0 < R) (hf : MeromorphicNFOn f Set.univ) (hg : AnalyticOn ℂ g Set.univ) (hbound : ∀ z : ℂ, ‖z‖ = R → ‖g z‖ < ‖f z‖) : (∑ᶠ z, ((divisor (f + g) (Metric.closedBall 0 R))⁺) z) = (∑ᶠ z, ((divisor f (Metric.closedBall 0 R))⁺) z) := f:ℂ → ℂg:ℂ → ℂR:ℝhR:0 < Rhf:MeromorphicNFOn f Set.univhg:AnalyticOn ℂ g Set.univhbound:∀ (z : ℂ), ‖z‖ = R → ‖g z‖ < ‖f z‖⊢ ∑ᶠ (z : ℂ), (divisor (f + g) (Metric.closedBall 0 R))⁺ z = ∑ᶠ (z : ℂ), (divisor f (Metric.closedBall 0 R))⁺ z All goals completed! 🐙
#17
Gaussian heat kernel solves the 1D heat equation
heat_kernel_solves_heat_equation

Verso theorem preview

theorem declaration uses `sorry`heat_kernel_solves_heat_equation (f : ℝ → ℝ) (hf_cont : Continuous f) (hf_bdd : ∃ M : ℝ, ∀ x, |f x| ≤ M) : -- The PDE on (0, ∞) × ℝ. (∀ t : ℝ, 0 < t → ∀ x : ℝ, ∃ ux : ℝ → ℝ, ∃ uxx : ℝ, (∀ y : ℝ, HasDerivAt (fun z => heatSolution f t z) (ux y) y) ∧ HasDerivAt ux uxx x ∧ HasDerivAt (fun s => heatSolution f s x) uxx t) ∧ -- Initial condition recovered as a one-sided limit at t = 0. (∀ x : ℝ, Filter.Tendsto (fun t : ℝ => heatSolution f t x) (nhdsWithin (0 : ℝ) (Set.Ioi 0)) (nhds (f x))) := f:ℝ → ℝhf_cont:Continuous fhf_bdd:∃ M, ∀ (x : ℝ), |f x| ≤ M⊢ (∀ (t : ℝ), 0 < t → ∀ (x : ℝ), ∃ ux uxx, (∀ (y : ℝ), HasDerivAt (fun z => heatSolution f t z) (ux y) y) ∧ HasDerivAt ux uxx x ∧ HasDerivAt (fun s => heatSolution f s x) uxx t) ∧ ∀ (x : ℝ), Filter.Tendsto (fun t => heatSolution f t x) (nhdsWithin 0 (Set.Ioi 0)) (nhds (f x)) All goals completed! 🐙
#18
Minkowski-Caratheodory theorem
mem_convexHull_finset_extremePoints_of_mem_compact_convex

Verso theorem preview

theorem declaration uses `sorry`mem_convexHull_finset_extremePoints_of_mem_compact_convex {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] {s : Set E} {x : E} (hscomp : IsCompact s) (hsconv : Convex ℝ s) (hx : x ∈ s) : ∃ t : Finset E, (↑t : Set E) ⊆ s.extremePoints ℝ ∧ t.card ≤ Module.finrank ℝ E + 1 ∧ x ∈ convexHull ℝ (↑t : Set E) := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:FiniteDimensional ℝ Es:Set Ex:Ehscomp:IsCompact shsconv:Convex ℝ shx:x ∈ s⊢ ∃ t, ↑t ⊆ extremePoints ℝ s ∧ t.card ≤ Module.finrank ℝ E + 1 ∧ x ∈ (convexHull ℝ) ↑t All goals completed! 🐙
#19
Oppenheim's inequality for Hadamard products
oppenheim_inequality

Verso theorem preview

theorem declaration uses `sorry`oppenheim_inequality {n : Type*} [Fintype n] [DecidableEq n] {A B : Matrix n n ℝ} (hA : A.PosSemidef) (hB : B.PosSemidef) : A.det * ∏ i, B i i ≤ (A ⊙ B).det := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℝB:Matrix n n ℝhA:A.PosSemidefhB:B.PosSemidef⊢ A.det * ∏ i, B i i ≤ (A ⊙ B).det All goals completed! 🐙
#20
pi_1 of the circle is Z
pi1_circle_mulEquiv_int

Verso theorem preview

theorem declaration uses `sorry`pi1_circle_mulEquiv_int : Nonempty (HomotopyGroup.Pi 1 Circle (1 : Circle) ≃* Multiplicative ℤ) := ⊢ Nonempty (HomotopyGroup.Pi 1 Circle 1 ≃* Multiplicative ℤ) All goals completed! 🐙
#21
Character values of finite groups lie in cyclotomic fields
brauer_character_in_cyclotomic

Verso theorem preview

theorem declaration uses `sorry`brauer_character_in_cyclotomic (G : Type) [Group G] [Fintype G] : ∃ φ : CyclotomicField (Monoid.exponent G) ℚ →+* ℂ, ∀ (V : Type) (_ : AddCommGroup V) (_ : Module ℂ V) (_ : FiniteDimensional ℂ V) (ρ : Representation ℂ G V) (g : G), LinearMap.trace ℂ V (ρ g) ∈ φ.range := G:Typeinst✝¹:Group Ginst✝:Fintype G⊢ ∃ φ, ∀ (V : Type) (x : AddCommGroup V) (x_1 : Module ℂ V), FiniteDimensional ℂ V → ∀ (ρ : Representation ℂ G V) (g : G), (LinearMap.trace ℂ V) (ρ g) ∈ φ.range All goals completed! 🐙
#22
Entrywise exponential of a PSD matrix is PSD
posSemidef_map_exp

Verso theorem preview

theorem declaration uses `sorry`posSemidef_map_exp {n : Type*} [Fintype n] [DecidableEq n] {A : Matrix n n ℝ} (hA : A.PosSemidef) : (A.map Real.exp).PosSemidef := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℝhA:A.PosSemidef⊢ (A.map Real.exp).PosSemidef All goals completed! 🐙
#23
Dirichlet eigenvalues of -y'' = lambda y on [0,pi] are n^2
dirichlet_eigenvalues_eq_nat_sq

Verso theorem preview

theorem declaration uses `sorry`dirichlet_eigenvalues_eq_nat_sq (lam : ℝ) : (∃ (y : ℝ → ℝ) (J : Set ℝ), IsOpen J ∧ Set.Icc (0 : ℝ) Real.pi ⊆ J ∧ (∀ x ∈ J, HasDerivAt y (deriv y x) x) ∧ (∀ x ∈ J, HasDerivAt (deriv y) (-(lam * y x)) x) ∧ y 0 = 0 ∧ y Real.pi = 0 ∧ ∃ x ∈ Set.Ioo (0 : ℝ) Real.pi, y x ≠ 0) ↔ ∃ n : ℕ, 0 < n ∧ lam = (n : ℝ) ^ 2 := lam:ℝ⊢ (∃ y J, IsOpen J ∧ Set.Icc 0 π ⊆ J ∧ (∀ x ∈ J, HasDerivAt y (deriv y x) x) ∧ (∀ x ∈ J, HasDerivAt (deriv y) (-(lam * y x)) x) ∧ y 0 = 0 ∧ y π = 0 ∧ ∃ x ∈ Set.Ioo 0 π, y x ≠ 0) ↔ ∃ n, 0 < n ∧ lam = ↑n ^ 2 All goals completed! 🐙
#24
Sturm separation theorem
sturm_separation

Verso theorem preview

theorem declaration uses `sorry`sturm_separation (p q y₁ y₂ : ℝ → ℝ) (a b : ℝ) (hab : a < b) (J : Set ℝ) (hJ_open : IsOpen J) (hJ_conn : IsPreconnected J) (hJ_sub : Set.Icc a b ⊆ J) (hp : ContinuousOn p J) (hq : ContinuousOn q J) (hy₁ : ∀ x ∈ J, HasDerivAt y₁ (deriv y₁ x) x) (hy₁' : ∀ x ∈ J, HasDerivAt (deriv y₁) (-(p x * deriv y₁ x + q x * y₁ x)) x) (hy₂ : ∀ x ∈ J, HasDerivAt y₂ (deriv y₂ x) x) (hy₂' : ∀ x ∈ J, HasDerivAt (deriv y₂) (-(p x * deriv y₂ x + q x * y₂ x)) x) (hW : ∃ x₀ ∈ J, y₁ x₀ * deriv y₂ x₀ - y₂ x₀ * deriv y₁ x₀ ≠ 0) (hza : y₁ a = 0) (hzb : y₁ b = 0) (hne : ∀ x ∈ Set.Ioo a b, y₁ x ≠ 0) : ∃! c, c ∈ Set.Ioo a b ∧ y₂ c = 0 := p:ℝ → ℝq:ℝ → ℝy₁:ℝ → ℝy₂:ℝ → ℝa:ℝb:ℝhab:a < bJ:Set ℝhJ_open:IsOpen JhJ_conn:IsPreconnected JhJ_sub:Set.Icc a b ⊆ Jhp:ContinuousOn p Jhq:ContinuousOn q Jhy₁:∀ x ∈ J, HasDerivAt y₁ (deriv y₁ x) xhy₁':∀ x ∈ J, HasDerivAt (deriv y₁) (-(p x * deriv y₁ x + q x * y₁ x)) xhy₂:∀ x ∈ J, HasDerivAt y₂ (deriv y₂ x) xhy₂':∀ x ∈ J, HasDerivAt (deriv y₂) (-(p x * deriv y₂ x + q x * y₂ x)) xhW:∃ x₀ ∈ J, y₁ x₀ * deriv y₂ x₀ - y₂ x₀ * deriv y₁ x₀ ≠ 0hza:y₁ a = 0hzb:y₁ b = 0hne:∀ x ∈ Set.Ioo a b, y₁ x ≠ 0⊢ ∃! c, c ∈ Set.Ioo a b ∧ y₂ c = 0 All goals completed! 🐙
#25
Polynomial decay rate of y' = -y^3
cubic_decay_asymptotic

Verso theorem preview

theorem declaration uses `sorry`cubic_decay_asymptotic (y : ℝ → ℝ) (hy_diff : ∀ t : ℝ, 0 < t → HasDerivAt y (-(y t) ^ 3) t) (hy_cont : ContinuousWithinAt y (Set.Ici 0) 0) (hy0 : y 0 = 1) : Tendsto (fun t : ℝ => y t * Real.sqrt t) atTop (𝓝 (1 / Real.sqrt 2)) := y:ℝ → ℝhy_diff:∀ (t : ℝ), 0 < t → HasDerivAt y (-y t ^ 3) thy_cont:ContinuousWithinAt y (Set.Ici 0) 0hy0:y 0 = 1⊢ Tendsto (fun t => y t * √t) atTop (𝓝 (1 / √2)) All goals completed! 🐙
#26
Cayley graph connected iff generators generate the group
mulCayley_connected_iff_closure_eq_top

Verso theorem preview

theorem declaration uses `sorry`mulCayley_connected_iff_closure_eq_top {G : Type*} [Group G] (S : Set G) : (SimpleGraph.mulCayley S).Connected ↔ Subgroup.closure S = ⊤ := G:Type u_1inst✝:Group GS:Set G⊢ (SimpleGraph.mulCayley S).Connected ↔ Subgroup.closure S = ⊤ All goals completed! 🐙
#27
Comparison principle for the Dirichlet BVP
bvp_comparison

Verso theorem preview

theorem declaration uses `sorry`bvp_comparison (J : Set ℝ) (hJ_open : IsOpen J) (hJ_sub : Set.Icc (0 : ℝ) 1 ⊆ J) (u v : ℝ → ℝ) (hu : ∀ x ∈ J, HasDerivAt u (deriv u x) x) (hu' : ∀ x ∈ J, HasDerivAt (deriv u) (deriv (deriv u) x) x) (hv : ∀ x ∈ J, HasDerivAt v (deriv v x) x) (hv' : ∀ x ∈ J, HasDerivAt (deriv v) (deriv (deriv v) x) x) (hineq : ∀ x ∈ Set.Ioo (0 : ℝ) 1, -deriv (deriv u) x ≤ -deriv (deriv v) x) (hu0 : u 0 ≤ v 0) (hu1 : u 1 ≤ v 1) : ∀ x ∈ Set.Icc (0 : ℝ) 1, u x ≤ v x := J:Set ℝhJ_open:IsOpen JhJ_sub:Set.Icc 0 1 ⊆ Ju:ℝ → ℝv:ℝ → ℝhu:∀ x ∈ J, HasDerivAt u (deriv u x) xhu':∀ x ∈ J, HasDerivAt (deriv u) (deriv (deriv u) x) xhv:∀ x ∈ J, HasDerivAt v (deriv v x) xhv':∀ x ∈ J, HasDerivAt (deriv v) (deriv (deriv v) x) xhineq:∀ x ∈ Set.Ioo 0 1, -deriv (deriv u) x ≤ -deriv (deriv v) xhu0:u 0 ≤ v 0hu1:u 1 ≤ v 1⊢ ∀ x ∈ Set.Icc 0 1, u x ≤ v x All goals completed! 🐙
#28
Finite Ramsey theorem for graphs
finite_graph_ramsey_theorem

Verso theorem preview

theorem declaration uses `sorry`finite_graph_ramsey_theorem : ∀ r s : ℕ, 2 ≤ r → 2 ≤ s → ∃ n : ℕ, ∀ G : SimpleGraph (Fin n), ¬ G.CliqueFree r ∨ ¬ Gᶜ.CliqueFree s := ⊢ ∀ (r s : ℕ), 2 ≤ r → 2 ≤ s → ∃ n, ∀ (G : SimpleGraph (Fin n)), ¬G.CliqueFree r ∨ ¬Gᶜ.CliqueFree s All goals completed! 🐙
#29
Catalan generating function via compositional inversion
substInv_X_sub_X_sq_eq_catalan

Verso theorem preview

theorem declaration uses `sorry`substInv_X_sub_X_sq_eq_catalan (n : ℕ) : haveI : Invertible (coeff 1 ((X : ℚ⟦X⟧) - X ^ 2)) := n:ℕ⊢ Invertible ((coeff 1) (X - X ^ 2)) n:ℕ⊢ Invertible 1; All goals completed! 🐙 coeff (n + 1) (substInv ((X : ℚ⟦X⟧) - X ^ 2)) = (Nat.choose (2 * n) n : ℚ) / (↑n + 1) := n:ℕ⊢ (coeff (n + 1)) (X - X ^ 2).substInv = ↑((2 * n).choose n) / (↑n + 1) All goals completed! 🐙
#30
First submissionMay 31, 2026
Last submissionJun 25, 2026
doxtor630
15Antigravity (Multi-Model Ensemble: Gemini 3.1 Pro, Gemini 3 Flash, Claude 4.6 Sonnet/Opus)21 solved
Existence of a non-isotopic pair of oriented two-component links
exists_nonisotopic_link

Verso theorem preview

theorem declaration uses `sorry`exists_nonisotopic_link : ∃ L₁ L₂ : LeanEval.KnotTheory.TwoLink, ¬ L₁.Isotopic L₂ := ⊢ ∃ L₁ L₂, ¬L₁.Isotopic L₂ All goals completed! 🐙
#1
von Neumann double commutant theorem
vonNeumann_doubleCommutant_tfae

Verso theorem preview

theorem declaration uses `sorry`vonNeumann_doubleCommutant_tfae {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H] (S : StarSubalgebra ℂ (H →L[ℂ] H)) : List.TFAE [ Set.centralizer (Set.centralizer (S : Set (H →L[ℂ] H))) = S , IsClosed (ContinuousLinearMapWOT.ofCLM '' (S : Set (H →L[ℂ] H))) , IsClosed (ContinuousLinearMap.toPointwiseConvergenceCLM ℂ (RingHom.id ℂ) H H '' (S : Set (H →L[ℂ] H))) ] := H:Type u_1inst✝²:NormedAddCommGroup Hinst✝¹:InnerProductSpace ℂ Hinst✝:CompleteSpace HS:StarSubalgebra ℂ (H →L[ℂ] H)⊢ [(↑S).centralizer.centralizer = ↑S, IsClosed (ContinuousLinearMapWOT.ofCLM '' ↑S), IsClosed (⇑(ContinuousLinearMap.toPointwiseConvergenceCLM ℂ (RingHom.id ℂ) H H) '' ↑S)].TFAE All goals completed! 🐙
#2
Bing's house with two rooms is contractible
contractibleSpace_houseWithTwoRooms

Verso theorem preview

theorem declaration uses `sorry`contractibleSpace_houseWithTwoRooms : ContractibleSpace LeanEval.Topology.HouseWithTwoRooms := ⊢ ContractibleSpace ↑HouseWithTwoRooms All goals completed! 🐙
#3
How produced

POC of how a moderately advanced harness / scaffolding can deliver: antigravity, SKILLS.md / AGENTS.md , MCP server. The human in the loop is not a mathematician, nor a software engineer, just someone curious and armed with patience, and acting as a babysitter: with simple encouragements like "remember, if we dont have the needed bricks, we build them and lay them search online for guidance if needed step by step, brick by brick, we are progressing we have time, you are doing great, try to address 1 thing at a time think using sequential thinking tool as needed, take your time and proceed with care no shortcuts, no cheating, we have time the sky is the limit, this is not an open problem, you got this ! " AI did all the thinking. No golfing done. This 7,000+ line proof was produced interactively via an AI-driven pair-programming workflow using Antigravity, Google's agentic IDE (a VS Code fork). Due to the massive scale of the deformation retraction, the solution was driven by cycling through the entire suite of available frontier models as quota constraints required. The formal verification relied on a specialized scaffolding pipeline: Iterative Prompt Engineering: The task was initialized using structured prompts ([contractibleSpace_houseWithTwoRooms.md](https://github.com/user-attachments/files/27707778/contractibleSpace_houseWithTwoRooms.md) that enforce Mathlib style guides (e.g., "Rely on existing Mathlib structural lemmas" and "Abstract into lemmas parameterized by characteristics"). Failure Feedback Loop: When intermediate attempts failed (e.g., due to type class synthesis errors or unsolved goals), the raw lake build trace logs and compiler outputs were automatically captured and injected back into the prompt context. This allowed the models to iteratively diagnose and correct their own errors. Model Context Protocol (MCP): The agents interacted with the Lean 4 compiler in real-time via the lean-lsp MCP server, gaining high-fidelity "Language Server to Agent" access: Proof State Tracking (lean_goal): Real-time extraction of tactic states to track the 24 nested sub-cubes of the retraction. Diagnostics (lean_diagnostic_messages): Immediate compiler feedback on type mismatches and syntax errors to keep the massive 7,000-line construction mathematically sound. Structural Synthesis: The proof was built constructively by the ensemble over multiple sessions. The agents defined the 24 topological spaces (C_1 through C_24), constructed explicit piecewise continuous projections (proj_1 through proj_24), and systematically eliminated sorry placeholders until the full deformation retraction onto the point was rigorously verified by the Lean compiler.

Real cyclotomic integer with house at most 2
cyclotomic_integer_house_le_two

Verso theorem preview

theorem declaration uses `sorry`cyclotomic_integer_house_le_two {K : Type*} [Field K] [NumberField K] [Algebra ℚ K] (n : ℕ) [NeZero n] [IsCyclotomicExtension {n} ℚ K] {β : K} (hβ_int : IsIntegral ℤ β) (hβ_real : β ∈ NumberField.maximalRealSubfield K) : house β ≤ 2 → house β = 2 ∨ ∃ m : ℕ, 0 < m ∧ house β = 2 * Real.cos (Real.pi / m) := K:Type u_1inst✝⁴:Field Kinst✝³:NumberField Kinst✝²:Algebra ℚ Kn:ℕinst✝¹:NeZero ninst✝:IsCyclotomicExtension {n} ℚ Kβ:Khβ_int:IsIntegral ℤ βhβ_real:β ∈ maximalRealSubfield K⊢ house β ≤ 2 → house β = 2 ∨ ∃ m, 0 < m ∧ house β = 2 * Real.cos (Real.pi / ↑m) All goals completed! 🐙
#4
Linear ODE with negative-real-part eigenvalues is asymptotically stable
linear_ode_asymptotic_stability

Verso theorem preview

theorem declaration uses `sorry`linear_ode_asymptotic_stability (n : ℕ) (A : Matrix (Fin n) (Fin n) ℝ) (hA : ∀ μ : ℂ, Module.End.HasEigenvalue (Matrix.toLin' (A.map (algebraMap ℝ ℂ))) μ → μ.re < 0) (x : ℝ → (Fin n → ℝ)) (hx : ∀ t : ℝ, 0 < t → HasDerivAt x (A.mulVec (x t)) t) : Filter.Tendsto (fun t : ℝ => ‖x t‖) Filter.atTop (nhds 0) := n:ℕA:Matrix (Fin n) (Fin n) ℝhA:∀ (μ : ℂ), Module.End.HasEigenvalue (Matrix.toLin' (A.map ⇑(algebraMap ℝ ℂ))) μ → μ.re < 0x:ℝ → Fin n → ℝhx:∀ (t : ℝ), 0 < t → HasDerivAt x (A *ᵥ x t) t⊢ Filter.Tendsto (fun t => ‖x t‖) Filter.atTop (nhds 0) All goals completed! 🐙
#5
How produced

This solution was produced interactively via an AI-driven pair-programming workflow using Antigravity, Google's agentic IDE. The proof was built structurally by cycling through the available ensemble of frontier models over multiple sessions. The formal verification relied on a specialized scaffolding pipeline: (1) Iterative prompt engineering utilizing Mathlib style constraints. (2) A failure feedback loop that injected raw compiler diagnostics back into the prompt context to diagnose errors. (3) Real-time Model Context Protocol (MCP) integration with the lean-lsp server, providing high-fidelity "Language Server to Agent" access to lean_goal (tactic state tracking) and lean_diagnostic_messages (immediate compiler feedback).

Rouche theorem via zero counting
rouche_zero_count_eq

Verso theorem preview

theorem declaration uses `sorry`rouche_zero_count_eq {f g : ℂ → ℂ} {R : ℝ} (hR : 0 < R) (hf : MeromorphicNFOn f Set.univ) (hg : AnalyticOn ℂ g Set.univ) (hbound : ∀ z : ℂ, ‖z‖ = R → ‖g z‖ < ‖f z‖) : (∑ᶠ z, ((divisor (f + g) (Metric.closedBall 0 R))⁺) z) = (∑ᶠ z, ((divisor f (Metric.closedBall 0 R))⁺) z) := f:ℂ → ℂg:ℂ → ℂR:ℝhR:0 < Rhf:MeromorphicNFOn f Set.univhg:AnalyticOn ℂ g Set.univhbound:∀ (z : ℂ), ‖z‖ = R → ‖g z‖ < ‖f z‖⊢ ∑ᶠ (z : ℂ), (divisor (f + g) (Metric.closedBall 0 R))⁺ z = ∑ᶠ (z : ℂ), (divisor f (Metric.closedBall 0 R))⁺ z All goals completed! 🐙
#6
Complementary polynomial on the unit circle
exists_complementary_polynomial_on_unit_circle

Verso theorem preview

theorem declaration uses `sorry`exists_complementary_polynomial_on_unit_circle (P : ℂ[X]) (hP : ∀ z : Circle, ‖P.eval (z : ℂ)‖ ≤ 1) : ∃ Q : ℂ[X], Q.natDegree ≤ P.natDegree ∧ ∀ z : Circle, ‖P.eval (z : ℂ)‖ ^ 2 + ‖Q.eval (z : ℂ)‖ ^ 2 = 1 := P:ℂ[X]hP:∀ (z : Circle), ‖eval (↑z) P‖ ≤ 1⊢ ∃ Q, Q.natDegree ≤ P.natDegree ∧ ∀ (z : Circle), ‖eval (↑z) P‖ ^ 2 + ‖eval (↑z) Q‖ ^ 2 = 1 All goals completed! 🐙
#7
Perron-Frobenius for irreducible nonnegative matrices
irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius

Verso theorem preview

theorem declaration uses `sorry`irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius {n : Type*} [Fintype n] [DecidableEq n] [Nonempty n] (A : Matrix n n ℝ) (hA : A.IsIrreducible) : ∃ v : n → ℝ, Module.End.HasEigenvector (Matrix.toLin' A) (spectralRadius ℝ A).toReal v ∧ (∀ i, 0 < v i) := n:Type u_1inst✝²:Fintype ninst✝¹:DecidableEq ninst✝:Nonempty nA:Matrix n n ℝhA:A.IsIrreducible⊢ ∃ v, Module.End.HasEigenvector (Matrix.toLin' A) (spectralRadius ℝ A).toReal v ∧ ∀ (i : n), 0 < v i All goals completed! 🐙
#8
How produced

This solution was produced interactively via an AI-driven pair-programming workflow using Antigravity, Google's agentic IDE. The proof was built structurally by cycling through the available ensemble of frontier models over multiple sessions. The formal verification relied on a specialized scaffolding pipeline: (1) Iterative prompt engineering utilizing Mathlib style constraints. (2) A failure feedback loop that injected raw compiler diagnostics back into the prompt context to diagnose errors. (3) Real-time Model Context Protocol (MCP) integration with the lean-lsp server, providing high-fidelity "Language Server to Agent" access to lean_goal (tactic state tracking) and lean_diagnostic_messages (immediate compiler feedback).

Minkowski-Caratheodory theorem
mem_convexHull_finset_extremePoints_of_mem_compact_convex

Verso theorem preview

theorem declaration uses `sorry`mem_convexHull_finset_extremePoints_of_mem_compact_convex {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] {s : Set E} {x : E} (hscomp : IsCompact s) (hsconv : Convex ℝ s) (hx : x ∈ s) : ∃ t : Finset E, (↑t : Set E) ⊆ s.extremePoints ℝ ∧ t.card ≤ Module.finrank ℝ E + 1 ∧ x ∈ convexHull ℝ (↑t : Set E) := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:FiniteDimensional ℝ Es:Set Ex:Ehscomp:IsCompact shsconv:Convex ℝ shx:x ∈ s⊢ ∃ t, ↑t ⊆ extremePoints ℝ s ∧ t.card ≤ Module.finrank ℝ E + 1 ∧ x ∈ (convexHull ℝ) ↑t All goals completed! 🐙
#9
How produced

This solution was produced interactively via an AI-driven pair-programming workflow using Antigravity, Google's agentic IDE. The proof was built structurally by cycling through the available ensemble of frontier models over multiple sessions. The formal verification relied on a specialized scaffolding pipeline: (1) Iterative prompt engineering utilizing Mathlib style constraints. (2) A failure feedback loop that injected raw compiler diagnostics back into the prompt context to diagnose errors. (3) Real-time Model Context Protocol (MCP) integration with the lean-lsp server, providing high-fidelity "Language Server to Agent" access to lean_goal (tactic state tracking) and lean_diagnostic_messages (immediate compiler feedback).

Gaussian heat kernel solves the 1D heat equation
heat_kernel_solves_heat_equation

Verso theorem preview

theorem declaration uses `sorry`heat_kernel_solves_heat_equation (f : ℝ → ℝ) (hf_cont : Continuous f) (hf_bdd : ∃ M : ℝ, ∀ x, |f x| ≤ M) : -- The PDE on (0, ∞) × ℝ. (∀ t : ℝ, 0 < t → ∀ x : ℝ, ∃ ux : ℝ → ℝ, ∃ uxx : ℝ, (∀ y : ℝ, HasDerivAt (fun z => heatSolution f t z) (ux y) y) ∧ HasDerivAt ux uxx x ∧ HasDerivAt (fun s => heatSolution f s x) uxx t) ∧ -- Initial condition recovered as a one-sided limit at t = 0. (∀ x : ℝ, Filter.Tendsto (fun t : ℝ => heatSolution f t x) (nhdsWithin (0 : ℝ) (Set.Ioi 0)) (nhds (f x))) := f:ℝ → ℝhf_cont:Continuous fhf_bdd:∃ M, ∀ (x : ℝ), |f x| ≤ M⊢ (∀ (t : ℝ), 0 < t → ∀ (x : ℝ), ∃ ux uxx, (∀ (y : ℝ), HasDerivAt (fun z => heatSolution f t z) (ux y) y) ∧ HasDerivAt ux uxx x ∧ HasDerivAt (fun s => heatSolution f s x) uxx t) ∧ ∀ (x : ℝ), Filter.Tendsto (fun t => heatSolution f t x) (nhdsWithin 0 (Set.Ioi 0)) (nhds (f x)) All goals completed! 🐙
#10
How produced

This solution was produced interactively via an AI-driven pair-programming workflow using Antigravity, Google's agentic IDE. The proof was built structurally by cycling through the available ensemble of frontier models over multiple sessions. The formal verification relied on a specialized scaffolding pipeline: (1) Iterative prompt engineering utilizing Mathlib style constraints. (2) A failure feedback loop that injected raw compiler diagnostics back into the prompt context to diagnose errors. (3) Real-time Model Context Protocol (MCP) integration with the lean-lsp server, providing high-fidelity "Language Server to Agent" access to lean_goal (tactic state tracking) and lean_diagnostic_messages (immediate compiler feedback).

Oppenheim's inequality for Hadamard products
oppenheim_inequality

Verso theorem preview

theorem declaration uses `sorry`oppenheim_inequality {n : Type*} [Fintype n] [DecidableEq n] {A B : Matrix n n ℝ} (hA : A.PosSemidef) (hB : B.PosSemidef) : A.det * ∏ i, B i i ≤ (A ⊙ B).det := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℝB:Matrix n n ℝhA:A.PosSemidefhB:B.PosSemidef⊢ A.det * ∏ i, B i i ≤ (A ⊙ B).det All goals completed! 🐙
#11
Character values of finite groups lie in cyclotomic fields
brauer_character_in_cyclotomic

Verso theorem preview

theorem declaration uses `sorry`brauer_character_in_cyclotomic (G : Type) [Group G] [Fintype G] : ∃ φ : CyclotomicField (Monoid.exponent G) ℚ →+* ℂ, ∀ (V : Type) (_ : AddCommGroup V) (_ : Module ℂ V) (_ : FiniteDimensional ℂ V) (ρ : Representation ℂ G V) (g : G), LinearMap.trace ℂ V (ρ g) ∈ φ.range := G:Typeinst✝¹:Group Ginst✝:Fintype G⊢ ∃ φ, ∀ (V : Type) (x : AddCommGroup V) (x_1 : Module ℂ V), FiniteDimensional ℂ V → ∀ (ρ : Representation ℂ G V) (g : G), (LinearMap.trace ℂ V) (ρ g) ∈ φ.range All goals completed! 🐙
#12
How produced

Antigravity orchestrated the solving using [Jules](https://jules.google.com/) and guided the agent during the task. Direct Spectral Decomposition Approach Strategy: Instead of moving to the global virtual character ring, we perform a local eigenvalue decomposition at the element level. 1. We state that the trace of the linear operator $\rho(g)$ is the sum of its eigenvalues (roots of the characteristic polynomial) using the Mathlib lemma: Module.End.trace_eq_sum_roots_charpoly_of_splits 2. Because $g^{\exp(G)} = 1$ in the group, we have $\rho(g)^{\exp(G)} = 1$. 3. By the Spectral Mapping Theorem (spectrum.pow_mem_pow), if $x$ is an eigenvalue of $\rho(g)$, then $x^{\exp(G)}$ must be an eigenvalue of the identity operator, forcing $x^{\exp(G)} = 1$. 4. Thus, every individual eigenvalue is an $\exp(G)$-th root of unity. 5. The range of our cyclotomic embedding $\varphi$ contains the image of the primitive root $\zeta_{\exp(G)}$, which algebraically generates all $\exp(G)$-th roots of unity in $\mathbb{C}$. Hence, each individual eigenvalue lies in $\varphi\text{.range}$. 6. Since $\varphi\text{.range}$ is a subring (subsemiring in Mathlib), it is closed under addition, and the trace (the sum of the eigenvalues) automatically lies in $\varphi\text{.range}$.

pi_1 of the circle is Z
pi1_circle_mulEquiv_int

Verso theorem preview

theorem declaration uses `sorry`pi1_circle_mulEquiv_int : Nonempty (HomotopyGroup.Pi 1 Circle (1 : Circle) ≃* Multiplicative ℤ) := ⊢ Nonempty (HomotopyGroup.Pi 1 Circle 1 ≃* Multiplicative ℤ) All goals completed! 🐙
#13
How produced

This solution was produced interactively via an AI-driven pair-programming workflow using Antigravity, Google's agentic IDE. The proof was built structurally by cycling through the available ensemble of frontier models over multiple sessions. The formal verification relied on a specialized scaffolding pipeline: (1) Iterative prompt engineering utilizing Mathlib style constraints. (2) A failure feedback loop that injected raw compiler diagnostics back into the prompt context to diagnose errors. (3) Real-time Model Context Protocol (MCP) integration with the lean-lsp server, providing high-fidelity "Language Server to Agent" access to lean_goal (tactic state tracking) and lean_diagnostic_messages (immediate compiler feedback).

Dirichlet eigenvalues of -y'' = lambda y on [0,pi] are n^2
dirichlet_eigenvalues_eq_nat_sq

Verso theorem preview

theorem declaration uses `sorry`dirichlet_eigenvalues_eq_nat_sq (lam : ℝ) : (∃ (y : ℝ → ℝ) (J : Set ℝ), IsOpen J ∧ Set.Icc (0 : ℝ) Real.pi ⊆ J ∧ (∀ x ∈ J, HasDerivAt y (deriv y x) x) ∧ (∀ x ∈ J, HasDerivAt (deriv y) (-(lam * y x)) x) ∧ y 0 = 0 ∧ y Real.pi = 0 ∧ ∃ x ∈ Set.Ioo (0 : ℝ) Real.pi, y x ≠ 0) ↔ ∃ n : ℕ, 0 < n ∧ lam = (n : ℝ) ^ 2 := lam:ℝ⊢ (∃ y J, IsOpen J ∧ Set.Icc 0 π ⊆ J ∧ (∀ x ∈ J, HasDerivAt y (deriv y x) x) ∧ (∀ x ∈ J, HasDerivAt (deriv y) (-(lam * y x)) x) ∧ y 0 = 0 ∧ y π = 0 ∧ ∃ x ∈ Set.Ioo 0 π, y x ≠ 0) ↔ ∃ n, 0 < n ∧ lam = ↑n ^ 2 All goals completed! 🐙
#14
How produced

This solution was produced interactively via an AI-driven pair-programming workflow using Antigravity, Google's agentic IDE. The proof was built structurally by cycling through the available ensemble of frontier models over multiple sessions. The formal verification relied on a specialized scaffolding pipeline: (1) Iterative prompt engineering utilizing Mathlib style constraints. (2) A failure feedback loop that injected raw compiler diagnostics back into the prompt context to diagnose errors. (3) Real-time Model Context Protocol (MCP) integration with the lean-lsp server, providing high-fidelity "Language Server to Agent" access to lean_goal (tactic state tracking) and lean_diagnostic_messages (immediate compiler feedback).

Entrywise exponential of a PSD matrix is PSD
posSemidef_map_exp

Verso theorem preview

theorem declaration uses `sorry`posSemidef_map_exp {n : Type*} [Fintype n] [DecidableEq n] {A : Matrix n n ℝ} (hA : A.PosSemidef) : (A.map Real.exp).PosSemidef := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℝhA:A.PosSemidef⊢ (A.map Real.exp).PosSemidef All goals completed! 🐙
#15
How produced

This solution was produced interactively via an AI-driven pair-programming workflow using Antigravity, Google's agentic IDE. The proof was built structurally by cycling through the available ensemble of frontier models over multiple sessions. The formal verification relied on a specialized scaffolding pipeline: (1) Iterative prompt engineering utilizing Mathlib style constraints. (2) A failure feedback loop that injected raw compiler diagnostics back into the prompt context to diagnose errors. (3) Real-time Model Context Protocol (MCP) integration with the lean-lsp server, providing high-fidelity "Language Server to Agent" access to lean_goal (tactic state tracking) and lean_diagnostic_messages (immediate compiler feedback).

Sturm separation theorem
sturm_separation

Verso theorem preview

theorem declaration uses `sorry`sturm_separation (p q y₁ y₂ : ℝ → ℝ) (a b : ℝ) (hab : a < b) (J : Set ℝ) (hJ_open : IsOpen J) (hJ_conn : IsPreconnected J) (hJ_sub : Set.Icc a b ⊆ J) (hp : ContinuousOn p J) (hq : ContinuousOn q J) (hy₁ : ∀ x ∈ J, HasDerivAt y₁ (deriv y₁ x) x) (hy₁' : ∀ x ∈ J, HasDerivAt (deriv y₁) (-(p x * deriv y₁ x + q x * y₁ x)) x) (hy₂ : ∀ x ∈ J, HasDerivAt y₂ (deriv y₂ x) x) (hy₂' : ∀ x ∈ J, HasDerivAt (deriv y₂) (-(p x * deriv y₂ x + q x * y₂ x)) x) (hW : ∃ x₀ ∈ J, y₁ x₀ * deriv y₂ x₀ - y₂ x₀ * deriv y₁ x₀ ≠ 0) (hza : y₁ a = 0) (hzb : y₁ b = 0) (hne : ∀ x ∈ Set.Ioo a b, y₁ x ≠ 0) : ∃! c, c ∈ Set.Ioo a b ∧ y₂ c = 0 := p:ℝ → ℝq:ℝ → ℝy₁:ℝ → ℝy₂:ℝ → ℝa:ℝb:ℝhab:a < bJ:Set ℝhJ_open:IsOpen JhJ_conn:IsPreconnected JhJ_sub:Set.Icc a b ⊆ Jhp:ContinuousOn p Jhq:ContinuousOn q Jhy₁:∀ x ∈ J, HasDerivAt y₁ (deriv y₁ x) xhy₁':∀ x ∈ J, HasDerivAt (deriv y₁) (-(p x * deriv y₁ x + q x * y₁ x)) xhy₂:∀ x ∈ J, HasDerivAt y₂ (deriv y₂ x) xhy₂':∀ x ∈ J, HasDerivAt (deriv y₂) (-(p x * deriv y₂ x + q x * y₂ x)) xhW:∃ x₀ ∈ J, y₁ x₀ * deriv y₂ x₀ - y₂ x₀ * deriv y₁ x₀ ≠ 0hza:y₁ a = 0hzb:y₁ b = 0hne:∀ x ∈ Set.Ioo a b, y₁ x ≠ 0⊢ ∃! c, c ∈ Set.Ioo a b ∧ y₂ c = 0 All goals completed! 🐙
#16
How produced

This solution was produced interactively via an AI-driven pair-programming workflow using Antigravity, Google's agentic IDE. The proof was built structurally by cycling through the available ensemble of frontier models over multiple sessions. The formal verification relied on a specialized scaffolding pipeline: (1) Iterative prompt engineering utilizing Mathlib style constraints. (2) A failure feedback loop that injected raw compiler diagnostics back into the prompt context to diagnose errors. (3) Real-time Model Context Protocol (MCP) integration with the lean-lsp server, providing high-fidelity "Language Server to Agent" access to lean_goal (tactic state tracking) and lean_diagnostic_messages (immediate compiler feedback).

Polynomial decay rate of y' = -y^3
cubic_decay_asymptotic

Verso theorem preview

theorem declaration uses `sorry`cubic_decay_asymptotic (y : ℝ → ℝ) (hy_diff : ∀ t : ℝ, 0 < t → HasDerivAt y (-(y t) ^ 3) t) (hy_cont : ContinuousWithinAt y (Set.Ici 0) 0) (hy0 : y 0 = 1) : Tendsto (fun t : ℝ => y t * Real.sqrt t) atTop (𝓝 (1 / Real.sqrt 2)) := y:ℝ → ℝhy_diff:∀ (t : ℝ), 0 < t → HasDerivAt y (-y t ^ 3) thy_cont:ContinuousWithinAt y (Set.Ici 0) 0hy0:y 0 = 1⊢ Tendsto (fun t => y t * √t) atTop (𝓝 (1 / √2)) All goals completed! 🐙
#17
How produced

This solution was produced interactively via an AI-driven pair-programming workflow using Antigravity, Google's agentic IDE. The proof was built structurally by cycling through the available ensemble of frontier models over multiple sessions. The formal verification relied on a specialized scaffolding pipeline: (1) Iterative prompt engineering utilizing Mathlib style constraints. (2) A failure feedback loop that injected raw compiler diagnostics back into the prompt context to diagnose errors. (3) Real-time Model Context Protocol (MCP) integration with the lean-lsp server, providing high-fidelity "Language Server to Agent" access to lean_goal (tactic state tracking) and lean_diagnostic_messages (immediate compiler feedback).

Comparison principle for the Dirichlet BVP
bvp_comparison

Verso theorem preview

theorem declaration uses `sorry`bvp_comparison (J : Set ℝ) (hJ_open : IsOpen J) (hJ_sub : Set.Icc (0 : ℝ) 1 ⊆ J) (u v : ℝ → ℝ) (hu : ∀ x ∈ J, HasDerivAt u (deriv u x) x) (hu' : ∀ x ∈ J, HasDerivAt (deriv u) (deriv (deriv u) x) x) (hv : ∀ x ∈ J, HasDerivAt v (deriv v x) x) (hv' : ∀ x ∈ J, HasDerivAt (deriv v) (deriv (deriv v) x) x) (hineq : ∀ x ∈ Set.Ioo (0 : ℝ) 1, -deriv (deriv u) x ≤ -deriv (deriv v) x) (hu0 : u 0 ≤ v 0) (hu1 : u 1 ≤ v 1) : ∀ x ∈ Set.Icc (0 : ℝ) 1, u x ≤ v x := J:Set ℝhJ_open:IsOpen JhJ_sub:Set.Icc 0 1 ⊆ Ju:ℝ → ℝv:ℝ → ℝhu:∀ x ∈ J, HasDerivAt u (deriv u x) xhu':∀ x ∈ J, HasDerivAt (deriv u) (deriv (deriv u) x) xhv:∀ x ∈ J, HasDerivAt v (deriv v x) xhv':∀ x ∈ J, HasDerivAt (deriv v) (deriv (deriv v) x) xhineq:∀ x ∈ Set.Ioo 0 1, -deriv (deriv u) x ≤ -deriv (deriv v) xhu0:u 0 ≤ v 0hu1:u 1 ≤ v 1⊢ ∀ x ∈ Set.Icc 0 1, u x ≤ v x All goals completed! 🐙
#18
How produced

This solution was produced interactively via an AI-driven pair-programming workflow using Antigravity, Google's agentic IDE. The proof was built structurally by cycling through the available ensemble of frontier models over multiple sessions. The formal verification relied on a specialized scaffolding pipeline: (1) Iterative prompt engineering utilizing Mathlib style constraints. (2) A failure feedback loop that injected raw compiler diagnostics back into the prompt context to diagnose errors. (3) Real-time Model Context Protocol (MCP) integration with the lean-lsp server, providing high-fidelity "Language Server to Agent" access to lean_goal (tactic state tracking) and lean_diagnostic_messages (immediate compiler feedback).

Cayley graph connected iff generators generate the group
mulCayley_connected_iff_closure_eq_top

Verso theorem preview

theorem declaration uses `sorry`mulCayley_connected_iff_closure_eq_top {G : Type*} [Group G] (S : Set G) : (SimpleGraph.mulCayley S).Connected ↔ Subgroup.closure S = ⊤ := G:Type u_1inst✝:Group GS:Set G⊢ (SimpleGraph.mulCayley S).Connected ↔ Subgroup.closure S = ⊤ All goals completed! 🐙
#19
How produced

This solution was produced interactively via an AI-driven pair-programming workflow using Antigravity, Google's agentic IDE. The proof was built structurally by cycling through the available ensemble of frontier models over multiple sessions. The formal verification relied on a specialized scaffolding pipeline: (1) Iterative prompt engineering utilizing Mathlib style constraints. (2) A failure feedback loop that injected raw compiler diagnostics back into the prompt context to diagnose errors. (3) Real-time Model Context Protocol (MCP) integration with the lean-lsp server, providing high-fidelity "Language Server to Agent" access to lean_goal (tactic state tracking) and lean_diagnostic_messages (immediate compiler feedback).

Finite Ramsey theorem for graphs
finite_graph_ramsey_theorem

Verso theorem preview

theorem declaration uses `sorry`finite_graph_ramsey_theorem : ∀ r s : ℕ, 2 ≤ r → 2 ≤ s → ∃ n : ℕ, ∀ G : SimpleGraph (Fin n), ¬ G.CliqueFree r ∨ ¬ Gᶜ.CliqueFree s := ⊢ ∀ (r s : ℕ), 2 ≤ r → 2 ≤ s → ∃ n, ∀ (G : SimpleGraph (Fin n)), ¬G.CliqueFree r ∨ ¬Gᶜ.CliqueFree s All goals completed! 🐙
#20
How produced

This solution was produced interactively via an AI-driven pair-programming workflow using Antigravity, Google's agentic IDE. The proof was built structurally by cycling through the available ensemble of frontier models over multiple sessions. The formal verification relied on a specialized scaffolding pipeline: (1) Iterative prompt engineering utilizing Mathlib style constraints. (2) A failure feedback loop that injected raw compiler diagnostics back into the prompt context to diagnose errors. (3) Real-time Model Context Protocol (MCP) integration with the lean-lsp server, providing high-fidelity "Language Server to Agent" access to lean_goal (tactic state tracking) and lean_diagnostic_messages (immediate compiler feedback).

Catalan generating function via compositional inversion
substInv_X_sub_X_sq_eq_catalan

Verso theorem preview

theorem declaration uses `sorry`substInv_X_sub_X_sq_eq_catalan (n : ℕ) : haveI : Invertible (coeff 1 ((X : ℚ⟦X⟧) - X ^ 2)) := n:ℕ⊢ Invertible ((coeff 1) (X - X ^ 2)) n:ℕ⊢ Invertible 1; All goals completed! 🐙 coeff (n + 1) (substInv ((X : ℚ⟦X⟧) - X ^ 2)) = (Nat.choose (2 * n) n : ℚ) / (↑n + 1) := n:ℕ⊢ (coeff (n + 1)) (X - X ^ 2).substInv = ↑((2 * n).choose n) / (↑n + 1) All goals completed! 🐙
#21
How produced

This solution was produced interactively via an AI-driven pair-programming workflow using Antigravity, Google's agentic IDE. The proof was built structurally by cycling through the available ensemble of frontier models over multiple sessions. The formal verification relied on a specialized scaffolding pipeline: (1) Iterative prompt engineering utilizing Mathlib style constraints. (2) A failure feedback loop that injected raw compiler diagnostics back into the prompt context to diagnose errors. (3) Real-time Model Context Protocol (MCP) integration with the lean-lsp server, providing high-fidelity "Language Server to Agent" access to lean_goal (tactic state tracking) and lean_diagnostic_messages (immediate compiler feedback).

First submissionMay 13, 2026
Last submissionMay 22, 2026
daouid21
16savarin-6-hour-gpt-5.6-speedrun21 solved
Kirk's normal-structure fixed point theorem
kirk_normal_structure

Verso theorem preview

theorem declaration uses `sorry`kirk_normal_structure [CompleteSpace E] (hE_reflexive : Function.Surjective (NormedSpace.inclusionInDoubleDual ℝ E)) (K : Set E) (hK_nonempty : K.Nonempty) (hK_closed : IsClosed K) (hK_bounded : Bornology.IsBounded K) (hK_convex : Convex ℝ K) (hK_normal : LeanEval.Topology.KirkNormalStructure.HasNormalStructure K) (T : K → K) (hT : LeanEval.Topology.KirkNormalStructure.IsNonexpansiveSelfMap K T) : ∃ x : K, IsFixedPt T x := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:CompleteSpace EhE_reflexive:Surjective ⇑(NormedSpace.inclusionInDoubleDual ℝ E)K:Set EhK_nonempty:K.NonemptyhK_closed:IsClosed KhK_bounded:Bornology.IsBounded KhK_convex:Convex ℝ KhK_normal:HasNormalStructure KT:↑K → ↑KhT:IsNonexpansiveSelfMap K T⊢ ∃ x, IsFixedPt T x All goals completed! 🐙
#1
How produced

GPT-5.6 Sol driven by a deterministic Python orchestrator for an exact six-hour window after one hour of setup. Eight concurrent isolated workers attempted all 239 scored problems in leaderboard-count order, followed by eight targeted near-miss repairs in the remaining time. Every counted proof independently passed `lake build Solution`, a forbidden-construct scan, and trusted-file integrity checks. Result: 30 verified problems. Per-attempt parent-observed timing, raw token usage, API-equivalent cost, prompts, hashes, controller events, validation logs, chat transcript, and the logarithmic solves-over-time graph are published in the repository's full run branch. Known API-equivalent cost is $234.256248 for 127 usage-complete attempts; 119 deadline-truncated attempts are retained with incomplete cost rather than imputed as zero. No existing Lean-Eval solution content was searched or copied.

Chudnovsky formula for pi inverse
chudnovsky_formula_for_pi_inv

Verso theorem preview

theorem declaration uses `sorry`chudnovsky_formula_for_pi_inv : chudnovskySum = π⁻¹ := ⊢ chudnovskySum = π⁻¹ All goals completed! 🐙
#2
How produced

GPT-5.6 Sol driven by a deterministic Python orchestrator for an exact six-hour window after one hour of setup. Eight concurrent isolated workers attempted all 239 scored problems in leaderboard-count order, followed by eight targeted near-miss repairs in the remaining time. Every counted proof independently passed `lake build Solution`, a forbidden-construct scan, and trusted-file integrity checks. Result: 30 verified problems. Per-attempt parent-observed timing, raw token usage, API-equivalent cost, prompts, hashes, controller events, validation logs, chat transcript, and the logarithmic solves-over-time graph are published in the repository's full run branch. Known API-equivalent cost is $234.256248 for 127 usage-complete attempts; 119 deadline-truncated attempts are retained with incomplete cost rather than imputed as zero. No existing Lean-Eval solution content was searched or copied.

Complete reducibility for compact groups
compact_group_semisimple

Verso theorem preview

theorem declaration uses `sorry`compact_group_semisimple {G V : Type*} [Group G] [TopologicalSpace G] [IsTopologicalGroup G] [CompactSpace G] [NormedAddCommGroup V] [NormedSpace ℝ V] [FiniteDimensional ℝ V] (ρ : Representation ℝ G V) (hρ : Continuous fun p : G × V => ρ p.1 p.2) : ρ.IsSemisimpleRepresentation := G:Type u_1V:Type u_2inst✝⁶:Group Ginst✝⁵:TopologicalSpace Ginst✝⁴:IsTopologicalGroup Ginst✝³:CompactSpace Ginst✝²:NormedAddCommGroup Vinst✝¹:NormedSpace ℝ Vinst✝:FiniteDimensional ℝ Vρ:Representation ℝ G Vhρ:Continuous fun p => (ρ p.1) p.2⊢ ρ.IsSemisimpleRepresentation All goals completed! 🐙
#3
How produced

GPT-5.6 Sol driven by a deterministic Python orchestrator for an exact six-hour window after one hour of setup. Eight concurrent isolated workers attempted all 239 scored problems in leaderboard-count order, followed by eight targeted near-miss repairs in the remaining time. Every counted proof independently passed `lake build Solution`, a forbidden-construct scan, and trusted-file integrity checks. Result: 30 verified problems. Per-attempt parent-observed timing, raw token usage, API-equivalent cost, prompts, hashes, controller events, validation logs, chat transcript, and the logarithmic solves-over-time graph are published in the repository's full run branch. Known API-equivalent cost is $234.256248 for 127 usage-complete attempts; 119 deadline-truncated attempts are retained with incomplete cost rather than imputed as zero. No existing Lean-Eval solution content was searched or copied.

Sard's theorem (critical-set image has measure zero)
sard_theorem

Verso theorem preview

theorem declaration uses `sorry`sard {m n : ℕ} (f : LeanEval.Geometry.SardTheoremProblem.E m → LeanEval.Geometry.SardTheoremProblem.E n) (_hf : ContDiff ℝ ∞ f) : volume (LeanEval.Geometry.SardTheoremProblem.criticalValues f) = 0 := m:ℕn:ℕf:E m → E n_hf:ContDiff ℝ ∞ f⊢ volume (criticalValues f) = 0 All goals completed! 🐙
#4
How produced

GPT-5.6 Sol driven by a deterministic Python orchestrator for an exact six-hour window after one hour of setup. Eight concurrent isolated workers attempted all 239 scored problems in leaderboard-count order, followed by eight targeted near-miss repairs in the remaining time. Every counted proof independently passed `lake build Solution`, a forbidden-construct scan, and trusted-file integrity checks. Result: 30 verified problems. Per-attempt parent-observed timing, raw token usage, API-equivalent cost, prompts, hashes, controller events, validation logs, chat transcript, and the logarithmic solves-over-time graph are published in the repository's full run branch. Known API-equivalent cost is $234.256248 for 127 usage-complete attempts; 119 deadline-truncated attempts are retained with incomplete cost rather than imputed as zero. No existing Lean-Eval solution content was searched or copied.

Bauer's uniqueness at extreme points
bauer_extreme_point_uniqueness

Verso theorem preview

theorem declaration uses `sorry`bauer_unique [MeasurableSpace X] [BorelSpace X] (K : Set X) (hK_cpt : IsCompact K) (hK_cvx : Convex ℝ K) {x : X} (hx : x ∈ K.extremePoints ℝ) (μ : Measure X) [IsProbabilityMeasure μ] (hμ : μ Kᶜ = 0) (hbar : x = ∫ y, y ∂μ) : μ = Measure.dirac x := X:Type u_1inst✝⁵:NormedAddCommGroup Xinst✝⁴:NormedSpace ℝ Xinst✝³:CompleteSpace Xinst✝²:MeasurableSpace Xinst✝¹:BorelSpace XK:Set XhK_cpt:IsCompact KhK_cvx:Convex ℝ Kx:Xhx:x ∈ Set.extremePoints ℝ Kμ:Measure Xinst✝:IsProbabilityMeasure μhμ:μ Kᶜ = 0hbar:x = ∫ (y : X), y ∂μ⊢ μ = Measure.dirac x All goals completed! 🐙
#5
How produced

GPT-5.6 Sol driven by a deterministic Python orchestrator for an exact six-hour window after one hour of setup. Eight concurrent isolated workers attempted all 239 scored problems in leaderboard-count order, followed by eight targeted near-miss repairs in the remaining time. Every counted proof independently passed `lake build Solution`, a forbidden-construct scan, and trusted-file integrity checks. Result: 30 verified problems. Per-attempt parent-observed timing, raw token usage, API-equivalent cost, prompts, hashes, controller events, validation logs, chat transcript, and the logarithmic solves-over-time graph are published in the repository's full run branch. Known API-equivalent cost is $234.256248 for 127 usage-complete attempts; 119 deadline-truncated attempts are retained with incomplete cost rather than imputed as zero. No existing Lean-Eval solution content was searched or copied.

Brouwer fixed-point theorem
brouwer_fixed_point

Verso theorem preview

theorem declaration uses `sorry`brouwer_fixed_point {d : ℕ} {K : Set (EuclideanSpace ℝ (Fin d))} (_hK_compact : IsCompact K) (_hK_convex : Convex ℝ K) (_hK_nonempty : K.Nonempty) (f : EuclideanSpace ℝ (Fin d) → EuclideanSpace ℝ (Fin d)) (_hf_cont : ContinuousOn f K) (_hf_maps : MapsTo f K K) : ∃ x ∈ K, f x = x := d:ℕK:Set (EuclideanSpace ℝ (Fin d))_hK_compact:IsCompact K_hK_convex:Convex ℝ K_hK_nonempty:K.Nonemptyf:EuclideanSpace ℝ (Fin d) → EuclideanSpace ℝ (Fin d)_hf_cont:ContinuousOn f K_hf_maps:MapsTo f K K⊢ ∃ x ∈ K, f x = x All goals completed! 🐙
#6
How produced

GPT-5.6 Sol driven by a deterministic Python orchestrator for an exact six-hour window after one hour of setup. Eight concurrent isolated workers attempted all 239 scored problems in leaderboard-count order, followed by eight targeted near-miss repairs in the remaining time. Every counted proof independently passed `lake build Solution`, a forbidden-construct scan, and trusted-file integrity checks. Result: 30 verified problems. Per-attempt parent-observed timing, raw token usage, API-equivalent cost, prompts, hashes, controller events, validation logs, chat transcript, and the logarithmic solves-over-time graph are published in the repository's full run branch. Known API-equivalent cost is $234.256248 for 127 usage-complete attempts; 119 deadline-truncated attempts are retained with incomplete cost rather than imputed as zero. No existing Lean-Eval solution content was searched or copied.

Koszul formula
koszul_formula

Verso theorem preview

theorem declaration uses `sorry`koszul_formula {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] [CompleteSpace E] {H : Type*} [TopologicalSpace H] {I : ModelWithCorners ℝ E H} {M : Type*} [TopologicalSpace M] [ChartedSpace H M] [IsManifold I ∞ M] [RiemannianBundle (fun (x : M) ↦ TangentSpace I x)] [IsContMDiffRiemannianBundle I ∞ E (fun (x : M) ↦ TangentSpace I x)] (cov : CovariantDerivative I E (TangentSpace I (M := M))) [ContMDiffCovariantDerivative cov ∞] (_htor : cov.torsion = 0) (_hmet : LeanEval.Geometry.KoszulFormula.IsMetricCompatible cov) (X Y Z : Π x : M, TangentSpace I x) (_hX : CMDiff ∞ (T% X)) (_hY : CMDiff ∞ (T% Y)) (_hZ : CMDiff ∞ (T% Z)) (x : M) : 2 * inner ℝ (cov Y x (X x)) (Z x) = mvfderiv I (fun y : M => inner ℝ (Y y) (Z y)) x (X x) + mvfderiv I (fun y : M => inner ℝ (X y) (Z y)) x (Y x) - mvfderiv I (fun y : M => inner ℝ (X y) (Y y)) x (Z x) - inner ℝ (X x) (mlieBracket I Y Z x) - inner ℝ (Y x) (mlieBracket I X Z x) + inner ℝ (Z x) (mlieBracket I X Y x) := E:Type u_1inst✝¹⁰:NormedAddCommGroup Einst✝⁹:NormedSpace ℝ Einst✝⁸:FiniteDimensional ℝ Einst✝⁷:CompleteSpace EH:Type u_2inst✝⁶:TopologicalSpace HI:ModelWithCorners ℝ E HM:Type u_3inst✝⁵:TopologicalSpace Minst✝⁴:ChartedSpace H Minst✝³:IsManifold I ∞ Minst✝²:RiemannianBundle fun x => TangentSpace I xinst✝¹:IsContMDiffRiemannianBundle I ∞ E fun x => TangentSpace I xcov:CovariantDerivative I E (TangentSpace I)inst✝:cov.ContMDiffCovariantDerivative ∞_htor:cov.torsion = 0_hmet:LeanEval.Geometry.KoszulFormula.IsMetricCompatible covX:(x : M) → TangentSpace I xY:(x : M) → TangentSpace I xZ:(x : M) → TangentSpace I x_hX:ContMDiff I I.tangent ∞ (T% X)_hY:ContMDiff I I.tangent ∞ (T% Y)_hZ:ContMDiff I I.tangent ∞ (T% Z)x:M⊢ 2 * Inner.inner ℝ ((↑cov Y x) (X x)) (Z x) = ((d% fun y => Inner.inner ℝ (Y y) (Z y)) x) (X x) + ((d% fun y => Inner.inner ℝ (X y) (Z y)) x) (Y x) - ((d% fun y => Inner.inner ℝ (X y) (Y y)) x) (Z x) - Inner.inner ℝ (X x) (mlieBracket I Y Z x) - Inner.inner ℝ (Y x) (mlieBracket I X Z x) + Inner.inner ℝ (Z x) (mlieBracket I X Y x) All goals completed! 🐙
#7
How produced

GPT-5.6 Sol driven by a deterministic Python orchestrator for an exact six-hour window after one hour of setup. Eight concurrent isolated workers attempted all 239 scored problems in leaderboard-count order, followed by eight targeted near-miss repairs in the remaining time. Every counted proof independently passed `lake build Solution`, a forbidden-construct scan, and trusted-file integrity checks. Result: 30 verified problems. Per-attempt parent-observed timing, raw token usage, API-equivalent cost, prompts, hashes, controller events, validation logs, chat transcript, and the logarithmic solves-over-time graph are published in the repository's full run branch. Known API-equivalent cost is $234.256248 for 127 usage-complete attempts; 119 deadline-truncated attempts are retained with incomplete cost rather than imputed as zero. No existing Lean-Eval solution content was searched or copied.

Bourbaki's locally convex extension of Banach–Alaoglu
banach_alaoglu_bourbaki

Verso theorem preview

theorem declaration uses `sorry`banach_alaoglu_bourbaki (E : Type*) [AddCommGroup E] [Module ℝ E] [TopologicalSpace E] [ContinuousAdd E] [ContinuousSMul ℝ E] [LocallyConvexSpace ℝ E] (U : Set E) (_hU : U ∈ 𝓝 (0 : E)) : IsCompact (LeanEval.Analysis.weakStarPolar E U) := E:Type u_1inst✝⁵:AddCommGroup Einst✝⁴:Module ℝ Einst✝³:TopologicalSpace Einst✝²:ContinuousAdd Einst✝¹:ContinuousSMul ℝ Einst✝:LocallyConvexSpace ℝ EU:Set E_hU:U ∈ 𝓝 0⊢ IsCompact (weakStarPolar E U) All goals completed! 🐙
#8
How produced

GPT-5.6 Sol driven by a deterministic Python orchestrator for an exact six-hour window after one hour of setup. Eight concurrent isolated workers attempted all 239 scored problems in leaderboard-count order, followed by eight targeted near-miss repairs in the remaining time. Every counted proof independently passed `lake build Solution`, a forbidden-construct scan, and trusted-file integrity checks. Result: 30 verified problems. Per-attempt parent-observed timing, raw token usage, API-equivalent cost, prompts, hashes, controller events, validation logs, chat transcript, and the logarithmic solves-over-time graph are published in the repository's full run branch. Known API-equivalent cost is $234.256248 for 127 usage-complete attempts; 119 deadline-truncated attempts are retained with incomplete cost rather than imputed as zero. No existing Lean-Eval solution content was searched or copied.

Linear programming: maximum principle and vertex optimality
lp_maximum_principle

Verso theorem preview

/-- **Maximum principle for linear programming** (§101). A local maximiser of the LP objective on the feasible region is automatically a global maximiser; and whenever the objective is non-constant (`c ≠ 0`), the maximiser lies on the topological frontier of the feasible region. -/ theorem declaration uses `sorry`lp_maximum_principle {m n : ℕ} (lp : LinearProgram m n) (x : Fin m → ℝ) (_hx : x ∈ lp.feasible) (_hlocal : IsLocalMaxOn lp.objective lp.feasible x) : IsMaxOn lp.objective lp.feasible x ∧ (lp.c ≠ 0 → x ∈ frontier lp.feasible) := m:ℕn:ℕlp:LinearProgram m nx:Fin m → ℝ_hx:x ∈ lp.feasible_hlocal:IsLocalMaxOn lp.objective lp.feasible x⊢ IsMaxOn lp.objective lp.feasible x ∧ (lp.c ≠ 0 → x ∈ frontier lp.feasible) All goals completed! 🐙
/-- **Vertex optimality** (§101; the existence content of Dantzig's 1947 simplex algorithm). Every linear program with a nonempty bounded feasible region admits a global maximiser that is an extreme point (vertex) of the feasible region. -/ theorem declaration uses `sorry`simplex_algorithm {m n : ℕ} (lp : LinearProgram m n) (_hfeas : lp.feasible.Nonempty) (_hbdd : Bornology.IsBounded lp.feasible) : ∃ x ∈ lp.feasible, IsMaxOn lp.objective lp.feasible x ∧ x ∈ Set.extremePoints ℝ lp.feasible := m:ℕn:ℕlp:LinearProgram m n_hfeas:lp.feasible.Nonempty_hbdd:Bornology.IsBounded lp.feasible⊢ ∃ x ∈ lp.feasible, IsMaxOn lp.objective lp.feasible x ∧ x ∈ Set.extremePoints ℝ lp.feasible All goals completed! 🐙
#9
How produced

GPT-5.6 Sol driven by a deterministic Python orchestrator for an exact six-hour window after one hour of setup. Eight concurrent isolated workers attempted all 239 scored problems in leaderboard-count order, followed by eight targeted near-miss repairs in the remaining time. Every counted proof independently passed `lake build Solution`, a forbidden-construct scan, and trusted-file integrity checks. Result: 30 verified problems. Per-attempt parent-observed timing, raw token usage, API-equivalent cost, prompts, hashes, controller events, validation logs, chat transcript, and the logarithmic solves-over-time graph are published in the repository's full run branch. Known API-equivalent cost is $234.256248 for 127 usage-complete attempts; 119 deadline-truncated attempts are retained with incomplete cost rather than imputed as zero. No existing Lean-Eval solution content was searched or copied.

Pell solutions are convergents of √d
pell_solution_convergent

Verso theorem preview

theorem declaration uses `sorry`pell_solution_is_convergent (d : ℤ) (_hd : Squarefree d) (_hd0 : 0 < d) (x y : ℤ) (_hx : 0 < x) (_hy : 0 < y) (_hsol : x ^ 2 - d * y ^ 2 = 1) : ∃ n : ℕ, (GenContFract.of (Real.sqrt (d : ℝ))).convs n = (x : ℝ) / (y : ℝ) := d:ℤ_hd:Squarefree d_hd0:0 < dx:ℤy:ℤ_hx:0 < x_hy:0 < y_hsol:x ^ 2 - d * y ^ 2 = 1⊢ ∃ n, (GenContFract.of √↑d).convs n = ↑x / ↑y All goals completed! 🐙
#10
How produced

GPT-5.6 Sol driven by a deterministic Python orchestrator for an exact six-hour window after one hour of setup. Eight concurrent isolated workers attempted all 239 scored problems in leaderboard-count order, followed by eight targeted near-miss repairs in the remaining time. Every counted proof independently passed `lake build Solution`, a forbidden-construct scan, and trusted-file integrity checks. Result: 30 verified problems. Per-attempt parent-observed timing, raw token usage, API-equivalent cost, prompts, hashes, controller events, validation logs, chat transcript, and the logarithmic solves-over-time graph are published in the repository's full run branch. Known API-equivalent cost is $234.256248 for 127 usage-complete attempts; 119 deadline-truncated attempts are retained with incomplete cost rather than imputed as zero. No existing Lean-Eval solution content was searched or copied.

Symplectic matrices have determinant 1
symplectic_matrix_det

Verso theorem preview

theorem declaration uses `sorry`symplectic_matrix_det {l R : Type*} [DecidableEq l] [Fintype l] [CommRing R] {A : Matrix (l ⊕ l) (l ⊕ l) R} (_hA : A ∈ Matrix.symplecticGroup l R) : A.det = 1 := l:Type u_1R:Type u_2inst✝²:DecidableEq linst✝¹:Fintype linst✝:CommRing RA:Matrix (l ⊕ l) (l ⊕ l) R_hA:A ∈ symplecticGroup l R⊢ A.det = 1 All goals completed! 🐙
#11
How produced

GPT-5.6 Sol driven by a deterministic Python orchestrator for an exact six-hour window after one hour of setup. Eight concurrent isolated workers attempted all 239 scored problems in leaderboard-count order, followed by eight targeted near-miss repairs in the remaining time. Every counted proof independently passed `lake build Solution`, a forbidden-construct scan, and trusted-file integrity checks. Result: 30 verified problems. Per-attempt parent-observed timing, raw token usage, API-equivalent cost, prompts, hashes, controller events, validation logs, chat transcript, and the logarithmic solves-over-time graph are published in the repository's full run branch. Known API-equivalent cost is $234.256248 for 127 usage-complete attempts; 119 deadline-truncated attempts are retained with incomplete cost rather than imputed as zero. No existing Lean-Eval solution content was searched or copied.

Character values of finite groups lie in cyclotomic fields
brauer_character_in_cyclotomic

Verso theorem preview

theorem declaration uses `sorry`brauer_character_in_cyclotomic (G : Type) [Group G] [Fintype G] : ∃ φ : CyclotomicField (Monoid.exponent G) ℚ →+* ℂ, ∀ (V : Type) (_ : AddCommGroup V) (_ : Module ℂ V) (_ : FiniteDimensional ℂ V) (ρ : Representation ℂ G V) (g : G), LinearMap.trace ℂ V (ρ g) ∈ φ.range := G:Typeinst✝¹:Group Ginst✝:Fintype G⊢ ∃ φ, ∀ (V : Type) (x : AddCommGroup V) (x_1 : Module ℂ V), FiniteDimensional ℂ V → ∀ (ρ : Representation ℂ G V) (g : G), (LinearMap.trace ℂ V) (ρ g) ∈ φ.range All goals completed! 🐙
#12
How produced

GPT-5.6 Sol driven by a deterministic Python orchestrator for an exact six-hour window after one hour of setup. Eight concurrent isolated workers attempted all 239 scored problems in leaderboard-count order, followed by eight targeted near-miss repairs in the remaining time. Every counted proof independently passed `lake build Solution`, a forbidden-construct scan, and trusted-file integrity checks. Result: 30 verified problems. Per-attempt parent-observed timing, raw token usage, API-equivalent cost, prompts, hashes, controller events, validation logs, chat transcript, and the logarithmic solves-over-time graph are published in the repository's full run branch. Known API-equivalent cost is $234.256248 for 127 usage-complete attempts; 119 deadline-truncated attempts are retained with incomplete cost rather than imputed as zero. No existing Lean-Eval solution content was searched or copied.

pi_1 of the circle is Z
pi1_circle_mulEquiv_int

Verso theorem preview

theorem declaration uses `sorry`pi1_circle_mulEquiv_int : Nonempty (HomotopyGroup.Pi 1 Circle (1 : Circle) ≃* Multiplicative ℤ) := ⊢ Nonempty (HomotopyGroup.Pi 1 Circle 1 ≃* Multiplicative ℤ) All goals completed! 🐙
#13
How produced

GPT-5.6 Sol driven by a deterministic Python orchestrator for an exact six-hour window after one hour of setup. Eight concurrent isolated workers attempted all 239 scored problems in leaderboard-count order, followed by eight targeted near-miss repairs in the remaining time. Every counted proof independently passed `lake build Solution`, a forbidden-construct scan, and trusted-file integrity checks. Result: 30 verified problems. Per-attempt parent-observed timing, raw token usage, API-equivalent cost, prompts, hashes, controller events, validation logs, chat transcript, and the logarithmic solves-over-time graph are published in the repository's full run branch. Known API-equivalent cost is $234.256248 for 127 usage-complete attempts; 119 deadline-truncated attempts are retained with incomplete cost rather than imputed as zero. No existing Lean-Eval solution content was searched or copied.

Dirichlet eigenvalues of -y'' = lambda y on [0,pi] are n^2
dirichlet_eigenvalues_eq_nat_sq

Verso theorem preview

theorem declaration uses `sorry`dirichlet_eigenvalues_eq_nat_sq (lam : ℝ) : (∃ (y : ℝ → ℝ) (J : Set ℝ), IsOpen J ∧ Set.Icc (0 : ℝ) Real.pi ⊆ J ∧ (∀ x ∈ J, HasDerivAt y (deriv y x) x) ∧ (∀ x ∈ J, HasDerivAt (deriv y) (-(lam * y x)) x) ∧ y 0 = 0 ∧ y Real.pi = 0 ∧ ∃ x ∈ Set.Ioo (0 : ℝ) Real.pi, y x ≠ 0) ↔ ∃ n : ℕ, 0 < n ∧ lam = (n : ℝ) ^ 2 := lam:ℝ⊢ (∃ y J, IsOpen J ∧ Set.Icc 0 π ⊆ J ∧ (∀ x ∈ J, HasDerivAt y (deriv y x) x) ∧ (∀ x ∈ J, HasDerivAt (deriv y) (-(lam * y x)) x) ∧ y 0 = 0 ∧ y π = 0 ∧ ∃ x ∈ Set.Ioo 0 π, y x ≠ 0) ↔ ∃ n, 0 < n ∧ lam = ↑n ^ 2 All goals completed! 🐙
#14
How produced

GPT-5.6 Sol driven by a deterministic Python orchestrator for an exact six-hour window after one hour of setup. Eight concurrent isolated workers attempted all 239 scored problems in leaderboard-count order, followed by eight targeted near-miss repairs in the remaining time. Every counted proof independently passed `lake build Solution`, a forbidden-construct scan, and trusted-file integrity checks. Result: 30 verified problems. Per-attempt parent-observed timing, raw token usage, API-equivalent cost, prompts, hashes, controller events, validation logs, chat transcript, and the logarithmic solves-over-time graph are published in the repository's full run branch. Known API-equivalent cost is $234.256248 for 127 usage-complete attempts; 119 deadline-truncated attempts are retained with incomplete cost rather than imputed as zero. No existing Lean-Eval solution content was searched or copied.

Entrywise exponential of a PSD matrix is PSD
posSemidef_map_exp

Verso theorem preview

theorem declaration uses `sorry`posSemidef_map_exp {n : Type*} [Fintype n] [DecidableEq n] {A : Matrix n n ℝ} (hA : A.PosSemidef) : (A.map Real.exp).PosSemidef := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℝhA:A.PosSemidef⊢ (A.map Real.exp).PosSemidef All goals completed! 🐙
#15
How produced

GPT-5.6 Sol driven by a deterministic Python orchestrator for an exact six-hour window after one hour of setup. Eight concurrent isolated workers attempted all 239 scored problems in leaderboard-count order, followed by eight targeted near-miss repairs in the remaining time. Every counted proof independently passed `lake build Solution`, a forbidden-construct scan, and trusted-file integrity checks. Result: 30 verified problems. Per-attempt parent-observed timing, raw token usage, API-equivalent cost, prompts, hashes, controller events, validation logs, chat transcript, and the logarithmic solves-over-time graph are published in the repository's full run branch. Known API-equivalent cost is $234.256248 for 127 usage-complete attempts; 119 deadline-truncated attempts are retained with incomplete cost rather than imputed as zero. No existing Lean-Eval solution content was searched or copied.

Sturm separation theorem
sturm_separation

Verso theorem preview

theorem declaration uses `sorry`sturm_separation (p q y₁ y₂ : ℝ → ℝ) (a b : ℝ) (hab : a < b) (J : Set ℝ) (hJ_open : IsOpen J) (hJ_conn : IsPreconnected J) (hJ_sub : Set.Icc a b ⊆ J) (hp : ContinuousOn p J) (hq : ContinuousOn q J) (hy₁ : ∀ x ∈ J, HasDerivAt y₁ (deriv y₁ x) x) (hy₁' : ∀ x ∈ J, HasDerivAt (deriv y₁) (-(p x * deriv y₁ x + q x * y₁ x)) x) (hy₂ : ∀ x ∈ J, HasDerivAt y₂ (deriv y₂ x) x) (hy₂' : ∀ x ∈ J, HasDerivAt (deriv y₂) (-(p x * deriv y₂ x + q x * y₂ x)) x) (hW : ∃ x₀ ∈ J, y₁ x₀ * deriv y₂ x₀ - y₂ x₀ * deriv y₁ x₀ ≠ 0) (hza : y₁ a = 0) (hzb : y₁ b = 0) (hne : ∀ x ∈ Set.Ioo a b, y₁ x ≠ 0) : ∃! c, c ∈ Set.Ioo a b ∧ y₂ c = 0 := p:ℝ → ℝq:ℝ → ℝy₁:ℝ → ℝy₂:ℝ → ℝa:ℝb:ℝhab:a < bJ:Set ℝhJ_open:IsOpen JhJ_conn:IsPreconnected JhJ_sub:Set.Icc a b ⊆ Jhp:ContinuousOn p Jhq:ContinuousOn q Jhy₁:∀ x ∈ J, HasDerivAt y₁ (deriv y₁ x) xhy₁':∀ x ∈ J, HasDerivAt (deriv y₁) (-(p x * deriv y₁ x + q x * y₁ x)) xhy₂:∀ x ∈ J, HasDerivAt y₂ (deriv y₂ x) xhy₂':∀ x ∈ J, HasDerivAt (deriv y₂) (-(p x * deriv y₂ x + q x * y₂ x)) xhW:∃ x₀ ∈ J, y₁ x₀ * deriv y₂ x₀ - y₂ x₀ * deriv y₁ x₀ ≠ 0hza:y₁ a = 0hzb:y₁ b = 0hne:∀ x ∈ Set.Ioo a b, y₁ x ≠ 0⊢ ∃! c, c ∈ Set.Ioo a b ∧ y₂ c = 0 All goals completed! 🐙
#16
How produced

GPT-5.6 Sol driven by a deterministic Python orchestrator for an exact six-hour window after one hour of setup. Eight concurrent isolated workers attempted all 239 scored problems in leaderboard-count order, followed by eight targeted near-miss repairs in the remaining time. Every counted proof independently passed `lake build Solution`, a forbidden-construct scan, and trusted-file integrity checks. Result: 30 verified problems. Per-attempt parent-observed timing, raw token usage, API-equivalent cost, prompts, hashes, controller events, validation logs, chat transcript, and the logarithmic solves-over-time graph are published in the repository's full run branch. Known API-equivalent cost is $234.256248 for 127 usage-complete attempts; 119 deadline-truncated attempts are retained with incomplete cost rather than imputed as zero. No existing Lean-Eval solution content was searched or copied.

Polynomial decay rate of y' = -y^3
cubic_decay_asymptotic

Verso theorem preview

theorem declaration uses `sorry`cubic_decay_asymptotic (y : ℝ → ℝ) (hy_diff : ∀ t : ℝ, 0 < t → HasDerivAt y (-(y t) ^ 3) t) (hy_cont : ContinuousWithinAt y (Set.Ici 0) 0) (hy0 : y 0 = 1) : Tendsto (fun t : ℝ => y t * Real.sqrt t) atTop (𝓝 (1 / Real.sqrt 2)) := y:ℝ → ℝhy_diff:∀ (t : ℝ), 0 < t → HasDerivAt y (-y t ^ 3) thy_cont:ContinuousWithinAt y (Set.Ici 0) 0hy0:y 0 = 1⊢ Tendsto (fun t => y t * √t) atTop (𝓝 (1 / √2)) All goals completed! 🐙
#17
How produced

GPT-5.6 Sol driven by a deterministic Python orchestrator for an exact six-hour window after one hour of setup. Eight concurrent isolated workers attempted all 239 scored problems in leaderboard-count order, followed by eight targeted near-miss repairs in the remaining time. Every counted proof independently passed `lake build Solution`, a forbidden-construct scan, and trusted-file integrity checks. Result: 30 verified problems. Per-attempt parent-observed timing, raw token usage, API-equivalent cost, prompts, hashes, controller events, validation logs, chat transcript, and the logarithmic solves-over-time graph are published in the repository's full run branch. Known API-equivalent cost is $234.256248 for 127 usage-complete attempts; 119 deadline-truncated attempts are retained with incomplete cost rather than imputed as zero. No existing Lean-Eval solution content was searched or copied.

Comparison principle for the Dirichlet BVP
bvp_comparison

Verso theorem preview

theorem declaration uses `sorry`bvp_comparison (J : Set ℝ) (hJ_open : IsOpen J) (hJ_sub : Set.Icc (0 : ℝ) 1 ⊆ J) (u v : ℝ → ℝ) (hu : ∀ x ∈ J, HasDerivAt u (deriv u x) x) (hu' : ∀ x ∈ J, HasDerivAt (deriv u) (deriv (deriv u) x) x) (hv : ∀ x ∈ J, HasDerivAt v (deriv v x) x) (hv' : ∀ x ∈ J, HasDerivAt (deriv v) (deriv (deriv v) x) x) (hineq : ∀ x ∈ Set.Ioo (0 : ℝ) 1, -deriv (deriv u) x ≤ -deriv (deriv v) x) (hu0 : u 0 ≤ v 0) (hu1 : u 1 ≤ v 1) : ∀ x ∈ Set.Icc (0 : ℝ) 1, u x ≤ v x := J:Set ℝhJ_open:IsOpen JhJ_sub:Set.Icc 0 1 ⊆ Ju:ℝ → ℝv:ℝ → ℝhu:∀ x ∈ J, HasDerivAt u (deriv u x) xhu':∀ x ∈ J, HasDerivAt (deriv u) (deriv (deriv u) x) xhv:∀ x ∈ J, HasDerivAt v (deriv v x) xhv':∀ x ∈ J, HasDerivAt (deriv v) (deriv (deriv v) x) xhineq:∀ x ∈ Set.Ioo 0 1, -deriv (deriv u) x ≤ -deriv (deriv v) xhu0:u 0 ≤ v 0hu1:u 1 ≤ v 1⊢ ∀ x ∈ Set.Icc 0 1, u x ≤ v x All goals completed! 🐙
#18
How produced

GPT-5.6 Sol driven by a deterministic Python orchestrator for an exact six-hour window after one hour of setup. Eight concurrent isolated workers attempted all 239 scored problems in leaderboard-count order, followed by eight targeted near-miss repairs in the remaining time. Every counted proof independently passed `lake build Solution`, a forbidden-construct scan, and trusted-file integrity checks. Result: 30 verified problems. Per-attempt parent-observed timing, raw token usage, API-equivalent cost, prompts, hashes, controller events, validation logs, chat transcript, and the logarithmic solves-over-time graph are published in the repository's full run branch. Known API-equivalent cost is $234.256248 for 127 usage-complete attempts; 119 deadline-truncated attempts are retained with incomplete cost rather than imputed as zero. No existing Lean-Eval solution content was searched or copied.

Cayley graph connected iff generators generate the group
mulCayley_connected_iff_closure_eq_top

Verso theorem preview

theorem declaration uses `sorry`mulCayley_connected_iff_closure_eq_top {G : Type*} [Group G] (S : Set G) : (SimpleGraph.mulCayley S).Connected ↔ Subgroup.closure S = ⊤ := G:Type u_1inst✝:Group GS:Set G⊢ (SimpleGraph.mulCayley S).Connected ↔ Subgroup.closure S = ⊤ All goals completed! 🐙
#19
How produced

GPT-5.6 Sol driven by a deterministic Python orchestrator for an exact six-hour window after one hour of setup. Eight concurrent isolated workers attempted all 239 scored problems in leaderboard-count order, followed by eight targeted near-miss repairs in the remaining time. Every counted proof independently passed `lake build Solution`, a forbidden-construct scan, and trusted-file integrity checks. Result: 30 verified problems. Per-attempt parent-observed timing, raw token usage, API-equivalent cost, prompts, hashes, controller events, validation logs, chat transcript, and the logarithmic solves-over-time graph are published in the repository's full run branch. Known API-equivalent cost is $234.256248 for 127 usage-complete attempts; 119 deadline-truncated attempts are retained with incomplete cost rather than imputed as zero. No existing Lean-Eval solution content was searched or copied.

Finite Ramsey theorem for graphs
finite_graph_ramsey_theorem

Verso theorem preview

theorem declaration uses `sorry`finite_graph_ramsey_theorem : ∀ r s : ℕ, 2 ≤ r → 2 ≤ s → ∃ n : ℕ, ∀ G : SimpleGraph (Fin n), ¬ G.CliqueFree r ∨ ¬ Gᶜ.CliqueFree s := ⊢ ∀ (r s : ℕ), 2 ≤ r → 2 ≤ s → ∃ n, ∀ (G : SimpleGraph (Fin n)), ¬G.CliqueFree r ∨ ¬Gᶜ.CliqueFree s All goals completed! 🐙
#20
How produced

GPT-5.6 Sol driven by a deterministic Python orchestrator for an exact six-hour window after one hour of setup. Eight concurrent isolated workers attempted all 239 scored problems in leaderboard-count order, followed by eight targeted near-miss repairs in the remaining time. Every counted proof independently passed `lake build Solution`, a forbidden-construct scan, and trusted-file integrity checks. Result: 30 verified problems. Per-attempt parent-observed timing, raw token usage, API-equivalent cost, prompts, hashes, controller events, validation logs, chat transcript, and the logarithmic solves-over-time graph are published in the repository's full run branch. Known API-equivalent cost is $234.256248 for 127 usage-complete attempts; 119 deadline-truncated attempts are retained with incomplete cost rather than imputed as zero. No existing Lean-Eval solution content was searched or copied.

Catalan generating function via compositional inversion
substInv_X_sub_X_sq_eq_catalan

Verso theorem preview

theorem declaration uses `sorry`substInv_X_sub_X_sq_eq_catalan (n : ℕ) : haveI : Invertible (coeff 1 ((X : ℚ⟦X⟧) - X ^ 2)) := n:ℕ⊢ Invertible ((coeff 1) (X - X ^ 2)) n:ℕ⊢ Invertible 1; All goals completed! 🐙 coeff (n + 1) (substInv ((X : ℚ⟦X⟧) - X ^ 2)) = (Nat.choose (2 * n) n : ℚ) / (↑n + 1) := n:ℕ⊢ (coeff (n + 1)) (X - X ^ 2).substInv = ↑((2 * n).choose n) / (↑n + 1) All goals completed! 🐙
#21
How produced

GPT-5.6 Sol driven by a deterministic Python orchestrator for an exact six-hour window after one hour of setup. Eight concurrent isolated workers attempted all 239 scored problems in leaderboard-count order, followed by eight targeted near-miss repairs in the remaining time. Every counted proof independently passed `lake build Solution`, a forbidden-construct scan, and trusted-file integrity checks. Result: 30 verified problems. Per-attempt parent-observed timing, raw token usage, API-equivalent cost, prompts, hashes, controller events, validation logs, chat transcript, and the logarithmic solves-over-time graph are published in the repository's full run branch. Known API-equivalent cost is $234.256248 for 127 usage-complete attempts; 119 deadline-truncated attempts are retained with incomplete cost rather than imputed as zero. No existing Lean-Eval solution content was searched or copied.

First submissionAug 17, 2026
Last submissionAug 17, 2026
savarin21
17Claude Opus 4.7 (1M context)17 solved
Schur-Weyl duality: S_k image equals centralizer of GL(V) image
symAction_range_eq_centralizer_glAction

Verso theorem preview

theorem declaration uses `sorry`symAction_range_eq_centralizer_glAction {R : Type*} [Field R] {M : Type*} [AddCommGroup M] [Module R M] [FiniteDimensional R M] {k : ℕ} [Invertible (k.factorial : R)] : Algebra.adjoin R (Set.range (LeanEval.RepresentationTheory.symAction R M k)) = Subalgebra.centralizer R (Set.range (LeanEval.RepresentationTheory.glAction R M k)) := R:Type u_1inst✝⁴:Field RM:Type u_2inst✝³:AddCommGroup Minst✝²:Module R Minst✝¹:FiniteDimensional R Mk:ℕinst✝:Invertible ↑k.factorial⊢ Algebra.adjoin R (Set.range ⇑(symAction R M k)) = Subalgebra.centralizer R (Set.range ⇑(glAction R M k)) All goals completed! 🐙
#1
How produced

Claude Opus 4.7 (1M context) with human (Jeroen Zuiddam) direction.

Schur-Weyl duality: GL(V) image equals centralizer of S_k image
glAction_range_eq_centralizer_symAction

Verso theorem preview

theorem declaration uses `sorry`glAction_range_eq_centralizer_symAction {R : Type*} [Field R] {M : Type*} [AddCommGroup M] [Module R M] [FiniteDimensional R M] {k : ℕ} [Invertible (k.factorial : R)] : Algebra.adjoin R (Set.range (LeanEval.RepresentationTheory.glAction R M k)) = Subalgebra.centralizer R (Set.range (LeanEval.RepresentationTheory.symAction R M k)) := R:Type u_1inst✝⁴:Field RM:Type u_2inst✝³:AddCommGroup Minst✝²:Module R Minst✝¹:FiniteDimensional R Mk:ℕinst✝:Invertible ↑k.factorial⊢ Algebra.adjoin R (Set.range ⇑(glAction R M k)) = Subalgebra.centralizer R (Set.range ⇑(symAction R M k)) All goals completed! 🐙
#2
How produced

Claude Opus 4.7 (1M context) with human (Jeroen Zuiddam) direction.

Complementary polynomial on the unit circle
exists_complementary_polynomial_on_unit_circle

Verso theorem preview

theorem declaration uses `sorry`exists_complementary_polynomial_on_unit_circle (P : ℂ[X]) (hP : ∀ z : Circle, ‖P.eval (z : ℂ)‖ ≤ 1) : ∃ Q : ℂ[X], Q.natDegree ≤ P.natDegree ∧ ∀ z : Circle, ‖P.eval (z : ℂ)‖ ^ 2 + ‖Q.eval (z : ℂ)‖ ^ 2 = 1 := P:ℂ[X]hP:∀ (z : Circle), ‖eval (↑z) P‖ ≤ 1⊢ ∃ Q, Q.natDegree ≤ P.natDegree ∧ ∀ (z : Circle), ‖eval (↑z) P‖ ^ 2 + ‖eval (↑z) Q‖ ^ 2 = 1 All goals completed! 🐙
#3
Rouche theorem via zero counting
rouche_zero_count_eq

Verso theorem preview

theorem declaration uses `sorry`rouche_zero_count_eq {f g : ℂ → ℂ} {R : ℝ} (hR : 0 < R) (hf : MeromorphicNFOn f Set.univ) (hg : AnalyticOn ℂ g Set.univ) (hbound : ∀ z : ℂ, ‖z‖ = R → ‖g z‖ < ‖f z‖) : (∑ᶠ z, ((divisor (f + g) (Metric.closedBall 0 R))⁺) z) = (∑ᶠ z, ((divisor f (Metric.closedBall 0 R))⁺) z) := f:ℂ → ℂg:ℂ → ℂR:ℝhR:0 < Rhf:MeromorphicNFOn f Set.univhg:AnalyticOn ℂ g Set.univhbound:∀ (z : ℂ), ‖z‖ = R → ‖g z‖ < ‖f z‖⊢ ∑ᶠ (z : ℂ), (divisor (f + g) (Metric.closedBall 0 R))⁺ z = ∑ᶠ (z : ℂ), (divisor f (Metric.closedBall 0 R))⁺ z All goals completed! 🐙
#4
Gaussian heat kernel solves the 1D heat equation
heat_kernel_solves_heat_equation

Verso theorem preview

theorem declaration uses `sorry`heat_kernel_solves_heat_equation (f : ℝ → ℝ) (hf_cont : Continuous f) (hf_bdd : ∃ M : ℝ, ∀ x, |f x| ≤ M) : -- The PDE on (0, ∞) × ℝ. (∀ t : ℝ, 0 < t → ∀ x : ℝ, ∃ ux : ℝ → ℝ, ∃ uxx : ℝ, (∀ y : ℝ, HasDerivAt (fun z => heatSolution f t z) (ux y) y) ∧ HasDerivAt ux uxx x ∧ HasDerivAt (fun s => heatSolution f s x) uxx t) ∧ -- Initial condition recovered as a one-sided limit at t = 0. (∀ x : ℝ, Filter.Tendsto (fun t : ℝ => heatSolution f t x) (nhdsWithin (0 : ℝ) (Set.Ioi 0)) (nhds (f x))) := f:ℝ → ℝhf_cont:Continuous fhf_bdd:∃ M, ∀ (x : ℝ), |f x| ≤ M⊢ (∀ (t : ℝ), 0 < t → ∀ (x : ℝ), ∃ ux uxx, (∀ (y : ℝ), HasDerivAt (fun z => heatSolution f t z) (ux y) y) ∧ HasDerivAt ux uxx x ∧ HasDerivAt (fun s => heatSolution f s x) uxx t) ∧ ∀ (x : ℝ), Filter.Tendsto (fun t => heatSolution f t x) (nhdsWithin 0 (Set.Ioi 0)) (nhds (f x)) All goals completed! 🐙
#5
Minkowski-Caratheodory theorem
mem_convexHull_finset_extremePoints_of_mem_compact_convex

Verso theorem preview

theorem declaration uses `sorry`mem_convexHull_finset_extremePoints_of_mem_compact_convex {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] {s : Set E} {x : E} (hscomp : IsCompact s) (hsconv : Convex ℝ s) (hx : x ∈ s) : ∃ t : Finset E, (↑t : Set E) ⊆ s.extremePoints ℝ ∧ t.card ≤ Module.finrank ℝ E + 1 ∧ x ∈ convexHull ℝ (↑t : Set E) := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:FiniteDimensional ℝ Es:Set Ex:Ehscomp:IsCompact shsconv:Convex ℝ shx:x ∈ s⊢ ∃ t, ↑t ⊆ extremePoints ℝ s ∧ t.card ≤ Module.finrank ℝ E + 1 ∧ x ∈ (convexHull ℝ) ↑t All goals completed! 🐙
#6
Character values of finite groups lie in cyclotomic fields
brauer_character_in_cyclotomic

Verso theorem preview

theorem declaration uses `sorry`brauer_character_in_cyclotomic (G : Type) [Group G] [Fintype G] : ∃ φ : CyclotomicField (Monoid.exponent G) ℚ →+* ℂ, ∀ (V : Type) (_ : AddCommGroup V) (_ : Module ℂ V) (_ : FiniteDimensional ℂ V) (ρ : Representation ℂ G V) (g : G), LinearMap.trace ℂ V (ρ g) ∈ φ.range := G:Typeinst✝¹:Group Ginst✝:Fintype G⊢ ∃ φ, ∀ (V : Type) (x : AddCommGroup V) (x_1 : Module ℂ V), FiniteDimensional ℂ V → ∀ (ρ : Representation ℂ G V) (g : G), (LinearMap.trace ℂ V) (ρ g) ∈ φ.range All goals completed! 🐙
#7
pi_1 of the circle is Z
pi1_circle_mulEquiv_int

Verso theorem preview

theorem declaration uses `sorry`pi1_circle_mulEquiv_int : Nonempty (HomotopyGroup.Pi 1 Circle (1 : Circle) ≃* Multiplicative ℤ) := ⊢ Nonempty (HomotopyGroup.Pi 1 Circle 1 ≃* Multiplicative ℤ) All goals completed! 🐙
#8
Oppenheim's inequality for Hadamard products
oppenheim_inequality

Verso theorem preview

theorem declaration uses `sorry`oppenheim_inequality {n : Type*} [Fintype n] [DecidableEq n] {A B : Matrix n n ℝ} (hA : A.PosSemidef) (hB : B.PosSemidef) : A.det * ∏ i, B i i ≤ (A ⊙ B).det := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℝB:Matrix n n ℝhA:A.PosSemidefhB:B.PosSemidef⊢ A.det * ∏ i, B i i ≤ (A ⊙ B).det All goals completed! 🐙
#9
Sturm separation theorem
sturm_separation

Verso theorem preview

theorem declaration uses `sorry`sturm_separation (p q y₁ y₂ : ℝ → ℝ) (a b : ℝ) (hab : a < b) (J : Set ℝ) (hJ_open : IsOpen J) (hJ_conn : IsPreconnected J) (hJ_sub : Set.Icc a b ⊆ J) (hp : ContinuousOn p J) (hq : ContinuousOn q J) (hy₁ : ∀ x ∈ J, HasDerivAt y₁ (deriv y₁ x) x) (hy₁' : ∀ x ∈ J, HasDerivAt (deriv y₁) (-(p x * deriv y₁ x + q x * y₁ x)) x) (hy₂ : ∀ x ∈ J, HasDerivAt y₂ (deriv y₂ x) x) (hy₂' : ∀ x ∈ J, HasDerivAt (deriv y₂) (-(p x * deriv y₂ x + q x * y₂ x)) x) (hW : ∃ x₀ ∈ J, y₁ x₀ * deriv y₂ x₀ - y₂ x₀ * deriv y₁ x₀ ≠ 0) (hza : y₁ a = 0) (hzb : y₁ b = 0) (hne : ∀ x ∈ Set.Ioo a b, y₁ x ≠ 0) : ∃! c, c ∈ Set.Ioo a b ∧ y₂ c = 0 := p:ℝ → ℝq:ℝ → ℝy₁:ℝ → ℝy₂:ℝ → ℝa:ℝb:ℝhab:a < bJ:Set ℝhJ_open:IsOpen JhJ_conn:IsPreconnected JhJ_sub:Set.Icc a b ⊆ Jhp:ContinuousOn p Jhq:ContinuousOn q Jhy₁:∀ x ∈ J, HasDerivAt y₁ (deriv y₁ x) xhy₁':∀ x ∈ J, HasDerivAt (deriv y₁) (-(p x * deriv y₁ x + q x * y₁ x)) xhy₂:∀ x ∈ J, HasDerivAt y₂ (deriv y₂ x) xhy₂':∀ x ∈ J, HasDerivAt (deriv y₂) (-(p x * deriv y₂ x + q x * y₂ x)) xhW:∃ x₀ ∈ J, y₁ x₀ * deriv y₂ x₀ - y₂ x₀ * deriv y₁ x₀ ≠ 0hza:y₁ a = 0hzb:y₁ b = 0hne:∀ x ∈ Set.Ioo a b, y₁ x ≠ 0⊢ ∃! c, c ∈ Set.Ioo a b ∧ y₂ c = 0 All goals completed! 🐙
#10
Dirichlet eigenvalues of -y'' = lambda y on [0,pi] are n^2
dirichlet_eigenvalues_eq_nat_sq

Verso theorem preview

theorem declaration uses `sorry`dirichlet_eigenvalues_eq_nat_sq (lam : ℝ) : (∃ (y : ℝ → ℝ) (J : Set ℝ), IsOpen J ∧ Set.Icc (0 : ℝ) Real.pi ⊆ J ∧ (∀ x ∈ J, HasDerivAt y (deriv y x) x) ∧ (∀ x ∈ J, HasDerivAt (deriv y) (-(lam * y x)) x) ∧ y 0 = 0 ∧ y Real.pi = 0 ∧ ∃ x ∈ Set.Ioo (0 : ℝ) Real.pi, y x ≠ 0) ↔ ∃ n : ℕ, 0 < n ∧ lam = (n : ℝ) ^ 2 := lam:ℝ⊢ (∃ y J, IsOpen J ∧ Set.Icc 0 π ⊆ J ∧ (∀ x ∈ J, HasDerivAt y (deriv y x) x) ∧ (∀ x ∈ J, HasDerivAt (deriv y) (-(lam * y x)) x) ∧ y 0 = 0 ∧ y π = 0 ∧ ∃ x ∈ Set.Ioo 0 π, y x ≠ 0) ↔ ∃ n, 0 < n ∧ lam = ↑n ^ 2 All goals completed! 🐙
#11
Entrywise exponential of a PSD matrix is PSD
posSemidef_map_exp

Verso theorem preview

theorem declaration uses `sorry`posSemidef_map_exp {n : Type*} [Fintype n] [DecidableEq n] {A : Matrix n n ℝ} (hA : A.PosSemidef) : (A.map Real.exp).PosSemidef := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℝhA:A.PosSemidef⊢ (A.map Real.exp).PosSemidef All goals completed! 🐙
#12
Polynomial decay rate of y' = -y^3
cubic_decay_asymptotic

Verso theorem preview

theorem declaration uses `sorry`cubic_decay_asymptotic (y : ℝ → ℝ) (hy_diff : ∀ t : ℝ, 0 < t → HasDerivAt y (-(y t) ^ 3) t) (hy_cont : ContinuousWithinAt y (Set.Ici 0) 0) (hy0 : y 0 = 1) : Tendsto (fun t : ℝ => y t * Real.sqrt t) atTop (𝓝 (1 / Real.sqrt 2)) := y:ℝ → ℝhy_diff:∀ (t : ℝ), 0 < t → HasDerivAt y (-y t ^ 3) thy_cont:ContinuousWithinAt y (Set.Ici 0) 0hy0:y 0 = 1⊢ Tendsto (fun t => y t * √t) atTop (𝓝 (1 / √2)) All goals completed! 🐙
#13
Comparison principle for the Dirichlet BVP
bvp_comparison

Verso theorem preview

theorem declaration uses `sorry`bvp_comparison (J : Set ℝ) (hJ_open : IsOpen J) (hJ_sub : Set.Icc (0 : ℝ) 1 ⊆ J) (u v : ℝ → ℝ) (hu : ∀ x ∈ J, HasDerivAt u (deriv u x) x) (hu' : ∀ x ∈ J, HasDerivAt (deriv u) (deriv (deriv u) x) x) (hv : ∀ x ∈ J, HasDerivAt v (deriv v x) x) (hv' : ∀ x ∈ J, HasDerivAt (deriv v) (deriv (deriv v) x) x) (hineq : ∀ x ∈ Set.Ioo (0 : ℝ) 1, -deriv (deriv u) x ≤ -deriv (deriv v) x) (hu0 : u 0 ≤ v 0) (hu1 : u 1 ≤ v 1) : ∀ x ∈ Set.Icc (0 : ℝ) 1, u x ≤ v x := J:Set ℝhJ_open:IsOpen JhJ_sub:Set.Icc 0 1 ⊆ Ju:ℝ → ℝv:ℝ → ℝhu:∀ x ∈ J, HasDerivAt u (deriv u x) xhu':∀ x ∈ J, HasDerivAt (deriv u) (deriv (deriv u) x) xhv:∀ x ∈ J, HasDerivAt v (deriv v x) xhv':∀ x ∈ J, HasDerivAt (deriv v) (deriv (deriv v) x) xhineq:∀ x ∈ Set.Ioo 0 1, -deriv (deriv u) x ≤ -deriv (deriv v) xhu0:u 0 ≤ v 0hu1:u 1 ≤ v 1⊢ ∀ x ∈ Set.Icc 0 1, u x ≤ v x All goals completed! 🐙
#14
Cayley graph connected iff generators generate the group
mulCayley_connected_iff_closure_eq_top

Verso theorem preview

theorem declaration uses `sorry`mulCayley_connected_iff_closure_eq_top {G : Type*} [Group G] (S : Set G) : (SimpleGraph.mulCayley S).Connected ↔ Subgroup.closure S = ⊤ := G:Type u_1inst✝:Group GS:Set G⊢ (SimpleGraph.mulCayley S).Connected ↔ Subgroup.closure S = ⊤ All goals completed! 🐙
#15
How produced

Just asking to solve the problems in Claude Code.

Finite Ramsey theorem for graphs
finite_graph_ramsey_theorem

Verso theorem preview

theorem declaration uses `sorry`finite_graph_ramsey_theorem : ∀ r s : ℕ, 2 ≤ r → 2 ≤ s → ∃ n : ℕ, ∀ G : SimpleGraph (Fin n), ¬ G.CliqueFree r ∨ ¬ Gᶜ.CliqueFree s := ⊢ ∀ (r s : ℕ), 2 ≤ r → 2 ≤ s → ∃ n, ∀ (G : SimpleGraph (Fin n)), ¬G.CliqueFree r ∨ ¬Gᶜ.CliqueFree s All goals completed! 🐙
#16
How produced

Just asking to solve the problems in Claude Code.

Catalan generating function via compositional inversion
substInv_X_sub_X_sq_eq_catalan

Verso theorem preview

theorem declaration uses `sorry`substInv_X_sub_X_sq_eq_catalan (n : ℕ) : haveI : Invertible (coeff 1 ((X : ℚ⟦X⟧) - X ^ 2)) := n:ℕ⊢ Invertible ((coeff 1) (X - X ^ 2)) n:ℕ⊢ Invertible 1; All goals completed! 🐙 coeff (n + 1) (substInv ((X : ℚ⟦X⟧) - X ^ 2)) = (Nat.choose (2 * n) n : ℚ) / (↑n + 1) := n:ℕ⊢ (coeff (n + 1)) (X - X ^ 2).substInv = ↑((2 * n).choose n) / (↑n + 1) All goals completed! 🐙
#17
How produced

Just asking to solve the problems in Claude Code.

First submissionMay 2, 2026
Last submissionMay 24, 2026
rkirov15jzuiddam2
18GPT-5.516 solved
Bing's house with two rooms is contractible
contractibleSpace_houseWithTwoRooms

Verso theorem preview

theorem declaration uses `sorry`contractibleSpace_houseWithTwoRooms : ContractibleSpace LeanEval.Topology.HouseWithTwoRooms := ⊢ ContractibleSpace ↑HouseWithTwoRooms All goals completed! 🐙
#1
How produced

autonomous lmp

Linear ODE with negative-real-part eigenvalues is asymptotically stable
linear_ode_asymptotic_stability

Verso theorem preview

theorem declaration uses `sorry`linear_ode_asymptotic_stability (n : ℕ) (A : Matrix (Fin n) (Fin n) ℝ) (hA : ∀ μ : ℂ, Module.End.HasEigenvalue (Matrix.toLin' (A.map (algebraMap ℝ ℂ))) μ → μ.re < 0) (x : ℝ → (Fin n → ℝ)) (hx : ∀ t : ℝ, 0 < t → HasDerivAt x (A.mulVec (x t)) t) : Filter.Tendsto (fun t : ℝ => ‖x t‖) Filter.atTop (nhds 0) := n:ℕA:Matrix (Fin n) (Fin n) ℝhA:∀ (μ : ℂ), Module.End.HasEigenvalue (Matrix.toLin' (A.map ⇑(algebraMap ℝ ℂ))) μ → μ.re < 0x:ℝ → Fin n → ℝhx:∀ (t : ℝ), 0 < t → HasDerivAt x (A *ᵥ x t) t⊢ Filter.Tendsto (fun t => ‖x t‖) Filter.atTop (nhds 0) All goals completed! 🐙
#2
How produced

autonomous lmp

Perron-Frobenius for irreducible nonnegative matrices
irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius

Verso theorem preview

theorem declaration uses `sorry`irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius {n : Type*} [Fintype n] [DecidableEq n] [Nonempty n] (A : Matrix n n ℝ) (hA : A.IsIrreducible) : ∃ v : n → ℝ, Module.End.HasEigenvector (Matrix.toLin' A) (spectralRadius ℝ A).toReal v ∧ (∀ i, 0 < v i) := n:Type u_1inst✝²:Fintype ninst✝¹:DecidableEq ninst✝:Nonempty nA:Matrix n n ℝhA:A.IsIrreducible⊢ ∃ v, Module.End.HasEigenvector (Matrix.toLin' A) (spectralRadius ℝ A).toReal v ∧ ∀ (i : n), 0 < v i All goals completed! 🐙
#3
Gaussian heat kernel solves the 1D heat equation
heat_kernel_solves_heat_equation

Verso theorem preview

theorem declaration uses `sorry`heat_kernel_solves_heat_equation (f : ℝ → ℝ) (hf_cont : Continuous f) (hf_bdd : ∃ M : ℝ, ∀ x, |f x| ≤ M) : -- The PDE on (0, ∞) × ℝ. (∀ t : ℝ, 0 < t → ∀ x : ℝ, ∃ ux : ℝ → ℝ, ∃ uxx : ℝ, (∀ y : ℝ, HasDerivAt (fun z => heatSolution f t z) (ux y) y) ∧ HasDerivAt ux uxx x ∧ HasDerivAt (fun s => heatSolution f s x) uxx t) ∧ -- Initial condition recovered as a one-sided limit at t = 0. (∀ x : ℝ, Filter.Tendsto (fun t : ℝ => heatSolution f t x) (nhdsWithin (0 : ℝ) (Set.Ioi 0)) (nhds (f x))) := f:ℝ → ℝhf_cont:Continuous fhf_bdd:∃ M, ∀ (x : ℝ), |f x| ≤ M⊢ (∀ (t : ℝ), 0 < t → ∀ (x : ℝ), ∃ ux uxx, (∀ (y : ℝ), HasDerivAt (fun z => heatSolution f t z) (ux y) y) ∧ HasDerivAt ux uxx x ∧ HasDerivAt (fun s => heatSolution f s x) uxx t) ∧ ∀ (x : ℝ), Filter.Tendsto (fun t => heatSolution f t x) (nhdsWithin 0 (Set.Ioi 0)) (nhds (f x)) All goals completed! 🐙
#4
How produced

autonomous lmp

Minkowski-Caratheodory theorem
mem_convexHull_finset_extremePoints_of_mem_compact_convex

Verso theorem preview

theorem declaration uses `sorry`mem_convexHull_finset_extremePoints_of_mem_compact_convex {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] {s : Set E} {x : E} (hscomp : IsCompact s) (hsconv : Convex ℝ s) (hx : x ∈ s) : ∃ t : Finset E, (↑t : Set E) ⊆ s.extremePoints ℝ ∧ t.card ≤ Module.finrank ℝ E + 1 ∧ x ∈ convexHull ℝ (↑t : Set E) := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:FiniteDimensional ℝ Es:Set Ex:Ehscomp:IsCompact shsconv:Convex ℝ shx:x ∈ s⊢ ∃ t, ↑t ⊆ extremePoints ℝ s ∧ t.card ≤ Module.finrank ℝ E + 1 ∧ x ∈ (convexHull ℝ) ↑t All goals completed! 🐙
#5
Oppenheim's inequality for Hadamard products
oppenheim_inequality

Verso theorem preview

theorem declaration uses `sorry`oppenheim_inequality {n : Type*} [Fintype n] [DecidableEq n] {A B : Matrix n n ℝ} (hA : A.PosSemidef) (hB : B.PosSemidef) : A.det * ∏ i, B i i ≤ (A ⊙ B).det := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℝB:Matrix n n ℝhA:A.PosSemidefhB:B.PosSemidef⊢ A.det * ∏ i, B i i ≤ (A ⊙ B).det All goals completed! 🐙
#6
How produced

Autonomous lmp

pi_1 of the circle is Z
pi1_circle_mulEquiv_int

Verso theorem preview

theorem declaration uses `sorry`pi1_circle_mulEquiv_int : Nonempty (HomotopyGroup.Pi 1 Circle (1 : Circle) ≃* Multiplicative ℤ) := ⊢ Nonempty (HomotopyGroup.Pi 1 Circle 1 ≃* Multiplicative ℤ) All goals completed! 🐙
#7
Character values of finite groups lie in cyclotomic fields
brauer_character_in_cyclotomic

Verso theorem preview

theorem declaration uses `sorry`brauer_character_in_cyclotomic (G : Type) [Group G] [Fintype G] : ∃ φ : CyclotomicField (Monoid.exponent G) ℚ →+* ℂ, ∀ (V : Type) (_ : AddCommGroup V) (_ : Module ℂ V) (_ : FiniteDimensional ℂ V) (ρ : Representation ℂ G V) (g : G), LinearMap.trace ℂ V (ρ g) ∈ φ.range := G:Typeinst✝¹:Group Ginst✝:Fintype G⊢ ∃ φ, ∀ (V : Type) (x : AddCommGroup V) (x_1 : Module ℂ V), FiniteDimensional ℂ V → ∀ (ρ : Representation ℂ G V) (g : G), (LinearMap.trace ℂ V) (ρ g) ∈ φ.range All goals completed! 🐙
#8
Dirichlet eigenvalues of -y'' = lambda y on [0,pi] are n^2
dirichlet_eigenvalues_eq_nat_sq

Verso theorem preview

theorem declaration uses `sorry`dirichlet_eigenvalues_eq_nat_sq (lam : ℝ) : (∃ (y : ℝ → ℝ) (J : Set ℝ), IsOpen J ∧ Set.Icc (0 : ℝ) Real.pi ⊆ J ∧ (∀ x ∈ J, HasDerivAt y (deriv y x) x) ∧ (∀ x ∈ J, HasDerivAt (deriv y) (-(lam * y x)) x) ∧ y 0 = 0 ∧ y Real.pi = 0 ∧ ∃ x ∈ Set.Ioo (0 : ℝ) Real.pi, y x ≠ 0) ↔ ∃ n : ℕ, 0 < n ∧ lam = (n : ℝ) ^ 2 := lam:ℝ⊢ (∃ y J, IsOpen J ∧ Set.Icc 0 π ⊆ J ∧ (∀ x ∈ J, HasDerivAt y (deriv y x) x) ∧ (∀ x ∈ J, HasDerivAt (deriv y) (-(lam * y x)) x) ∧ y 0 = 0 ∧ y π = 0 ∧ ∃ x ∈ Set.Ioo 0 π, y x ≠ 0) ↔ ∃ n, 0 < n ∧ lam = ↑n ^ 2 All goals completed! 🐙
#9
Sturm separation theorem
sturm_separation

Verso theorem preview

theorem declaration uses `sorry`sturm_separation (p q y₁ y₂ : ℝ → ℝ) (a b : ℝ) (hab : a < b) (J : Set ℝ) (hJ_open : IsOpen J) (hJ_conn : IsPreconnected J) (hJ_sub : Set.Icc a b ⊆ J) (hp : ContinuousOn p J) (hq : ContinuousOn q J) (hy₁ : ∀ x ∈ J, HasDerivAt y₁ (deriv y₁ x) x) (hy₁' : ∀ x ∈ J, HasDerivAt (deriv y₁) (-(p x * deriv y₁ x + q x * y₁ x)) x) (hy₂ : ∀ x ∈ J, HasDerivAt y₂ (deriv y₂ x) x) (hy₂' : ∀ x ∈ J, HasDerivAt (deriv y₂) (-(p x * deriv y₂ x + q x * y₂ x)) x) (hW : ∃ x₀ ∈ J, y₁ x₀ * deriv y₂ x₀ - y₂ x₀ * deriv y₁ x₀ ≠ 0) (hza : y₁ a = 0) (hzb : y₁ b = 0) (hne : ∀ x ∈ Set.Ioo a b, y₁ x ≠ 0) : ∃! c, c ∈ Set.Ioo a b ∧ y₂ c = 0 := p:ℝ → ℝq:ℝ → ℝy₁:ℝ → ℝy₂:ℝ → ℝa:ℝb:ℝhab:a < bJ:Set ℝhJ_open:IsOpen JhJ_conn:IsPreconnected JhJ_sub:Set.Icc a b ⊆ Jhp:ContinuousOn p Jhq:ContinuousOn q Jhy₁:∀ x ∈ J, HasDerivAt y₁ (deriv y₁ x) xhy₁':∀ x ∈ J, HasDerivAt (deriv y₁) (-(p x * deriv y₁ x + q x * y₁ x)) xhy₂:∀ x ∈ J, HasDerivAt y₂ (deriv y₂ x) xhy₂':∀ x ∈ J, HasDerivAt (deriv y₂) (-(p x * deriv y₂ x + q x * y₂ x)) xhW:∃ x₀ ∈ J, y₁ x₀ * deriv y₂ x₀ - y₂ x₀ * deriv y₁ x₀ ≠ 0hza:y₁ a = 0hzb:y₁ b = 0hne:∀ x ∈ Set.Ioo a b, y₁ x ≠ 0⊢ ∃! c, c ∈ Set.Ioo a b ∧ y₂ c = 0 All goals completed! 🐙
#10
Entrywise exponential of a PSD matrix is PSD
posSemidef_map_exp

Verso theorem preview

theorem declaration uses `sorry`posSemidef_map_exp {n : Type*} [Fintype n] [DecidableEq n] {A : Matrix n n ℝ} (hA : A.PosSemidef) : (A.map Real.exp).PosSemidef := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℝhA:A.PosSemidef⊢ (A.map Real.exp).PosSemidef All goals completed! 🐙
#11
Polynomial decay rate of y' = -y^3
cubic_decay_asymptotic

Verso theorem preview

theorem declaration uses `sorry`cubic_decay_asymptotic (y : ℝ → ℝ) (hy_diff : ∀ t : ℝ, 0 < t → HasDerivAt y (-(y t) ^ 3) t) (hy_cont : ContinuousWithinAt y (Set.Ici 0) 0) (hy0 : y 0 = 1) : Tendsto (fun t : ℝ => y t * Real.sqrt t) atTop (𝓝 (1 / Real.sqrt 2)) := y:ℝ → ℝhy_diff:∀ (t : ℝ), 0 < t → HasDerivAt y (-y t ^ 3) thy_cont:ContinuousWithinAt y (Set.Ici 0) 0hy0:y 0 = 1⊢ Tendsto (fun t => y t * √t) atTop (𝓝 (1 / √2)) All goals completed! 🐙
#12
Comparison principle for the Dirichlet BVP
bvp_comparison

Verso theorem preview

theorem declaration uses `sorry`bvp_comparison (J : Set ℝ) (hJ_open : IsOpen J) (hJ_sub : Set.Icc (0 : ℝ) 1 ⊆ J) (u v : ℝ → ℝ) (hu : ∀ x ∈ J, HasDerivAt u (deriv u x) x) (hu' : ∀ x ∈ J, HasDerivAt (deriv u) (deriv (deriv u) x) x) (hv : ∀ x ∈ J, HasDerivAt v (deriv v x) x) (hv' : ∀ x ∈ J, HasDerivAt (deriv v) (deriv (deriv v) x) x) (hineq : ∀ x ∈ Set.Ioo (0 : ℝ) 1, -deriv (deriv u) x ≤ -deriv (deriv v) x) (hu0 : u 0 ≤ v 0) (hu1 : u 1 ≤ v 1) : ∀ x ∈ Set.Icc (0 : ℝ) 1, u x ≤ v x := J:Set ℝhJ_open:IsOpen JhJ_sub:Set.Icc 0 1 ⊆ Ju:ℝ → ℝv:ℝ → ℝhu:∀ x ∈ J, HasDerivAt u (deriv u x) xhu':∀ x ∈ J, HasDerivAt (deriv u) (deriv (deriv u) x) xhv:∀ x ∈ J, HasDerivAt v (deriv v x) xhv':∀ x ∈ J, HasDerivAt (deriv v) (deriv (deriv v) x) xhineq:∀ x ∈ Set.Ioo 0 1, -deriv (deriv u) x ≤ -deriv (deriv v) xhu0:u 0 ≤ v 0hu1:u 1 ≤ v 1⊢ ∀ x ∈ Set.Icc 0 1, u x ≤ v x All goals completed! 🐙
#13
Cayley graph connected iff generators generate the group
mulCayley_connected_iff_closure_eq_top

Verso theorem preview

theorem declaration uses `sorry`mulCayley_connected_iff_closure_eq_top {G : Type*} [Group G] (S : Set G) : (SimpleGraph.mulCayley S).Connected ↔ Subgroup.closure S = ⊤ := G:Type u_1inst✝:Group GS:Set G⊢ (SimpleGraph.mulCayley S).Connected ↔ Subgroup.closure S = ⊤ All goals completed! 🐙
#14
Finite Ramsey theorem for graphs
finite_graph_ramsey_theorem

Verso theorem preview

theorem declaration uses `sorry`finite_graph_ramsey_theorem : ∀ r s : ℕ, 2 ≤ r → 2 ≤ s → ∃ n : ℕ, ∀ G : SimpleGraph (Fin n), ¬ G.CliqueFree r ∨ ¬ Gᶜ.CliqueFree s := ⊢ ∀ (r s : ℕ), 2 ≤ r → 2 ≤ s → ∃ n, ∀ (G : SimpleGraph (Fin n)), ¬G.CliqueFree r ∨ ¬Gᶜ.CliqueFree s All goals completed! 🐙
#15
Catalan generating function via compositional inversion
substInv_X_sub_X_sq_eq_catalan

Verso theorem preview

theorem declaration uses `sorry`substInv_X_sub_X_sq_eq_catalan (n : ℕ) : haveI : Invertible (coeff 1 ((X : ℚ⟦X⟧) - X ^ 2)) := n:ℕ⊢ Invertible ((coeff 1) (X - X ^ 2)) n:ℕ⊢ Invertible 1; All goals completed! 🐙 coeff (n + 1) (substInv ((X : ℚ⟦X⟧) - X ^ 2)) = (Nat.choose (2 * n) n : ℚ) / (↑n + 1) := n:ℕ⊢ (coeff (n + 1)) (X - X ^ 2).substInv = ↑((2 * n).choose n) / (↑n + 1) All goals completed! 🐙
#16
First submissionMay 7, 2026
Last submissionJun 8, 2026
Morgan-Griffiths10sqrt-of-29A-M-Berns4
19github.com/mlgraham (Claude Fable 5)16 solved
Strong normalization and consistency for the calculus of constructions with a universe hierarchy
coc_strong_normalization

Verso theorem preview

/-- Anti-vacuity guard: the polymorphic identity `λ (A : Prop). λ (x : A). x` has type `Π (A : Prop). Π (x : A). A`. This is typable only because `Prop` is impredicative. -/ theorem declaration uses `sorry`typing_polyId : Typing [] (.lam (.srt .prop) (.lam (.var 0) (.var 0))) (.pi (.srt .prop) (.pi (.var 0) (.var 1))) := sorry
/-- Anti-vacuity guard: applying the polymorphic identity to `False` exercises application typing. Here `False` is encoded as `Π (P : Prop). P`. -/ theorem declaration uses `sorry`typing_polyId_app : Typing [] (.app (.lam (.srt .prop) (.lam (.var 0) (.var 0))) (.pi (.srt .prop) (.var 0))) (.pi (.pi (.srt .prop) (.var 0)) (.pi (.srt .prop) (.var 0))) := sorry
/-- Anti-vacuity guard: the same application takes its expected beta step. -/ theorem declaration uses `sorry`step_polyId_app : Step (.app (.lam (.srt .prop) (.lam (.var 0) (.var 0))) (.pi (.srt .prop) (.var 0))) (.lam (.pi (.srt .prop) (.var 0)) (.var 0)) := sorry
/-- Types are preserved by reduction. -/ theorem declaration uses `sorry`subject_reduction (Γ : List Tm) (t t' A : Tm) : Typing Γ t A → Step t t' → Typing Γ t' A := sorry
/-- Every well-typed term is strongly normalizing. -/ theorem declaration uses `sorry`strong_normalization (Γ : List Tm) (t A : Tm) : Typing Γ t A → SN t := sorry
/-- The system is logically consistent: `Π (P : Prop). P` is not inhabited. -/ theorem declaration uses `sorry`consistency : ¬ ∃ t : Tm, Typing [] t (.pi (.srt .prop) (.var 0)) := sorry
#1
How produced

Original proof of all six `coc_strong_normalization` holes. Claude Fable 5 (Claude Code) under human direction, from the Challenge, the published mathematics, and compiler feedback only; no lean-eval solution to this problem exists. Method: a Melliès–Werner Λ-set model (INRIA RR-3548, §6.3, which treats ECC as a PTS whose sorts, axioms and rules are literally this benchmark's `Srt`/`Ax`/`Rl`) built inside Mathlib's `ZFSet`, so no axioms beyond Lean's own. Saturated sets of terms; Λ-sets as ZFC sets of carrier/realizer pairs; degenerated Λ-sets for the impredicative sort, whose collapse gives Condition 1(3) for `(s, prop, prop)` — the rule the problem notes single out. Universe elements carry their index and level as tags, and the two ε-relations (`carRel` on carriers, `elemRel` on elements) are one well-founded recursion on `ZFSet.rank`; a universe's carrier relation *is* the element relation of its members. Predicative universes are built in stages with a level discipline in which a product's minimal stage equals its recorded level, which is what makes "same level" enough to place two products at a common stage. The interpretation of judgements is proof-irrelevant (any term at a proposition has value `∅`) and its conversion rule is semantically aligned (the annotation may change only to a type with the same interpretation). That pair of choices breaks the circularity between conversion invariance and β-preservation that blocks the textbook presentation, and it makes weakening, substitution and single-step preservation ordinary lemmas about raw derivations rather than facts entangled with soundness. Soundness is a single mutual induction over `Typing`/`Wf`. The motive carries soundness, uniformity in the valuation (Melliès–Werner Theorem 1, clause 2 — needed to place a product at a stage), the type's own soundness, and the Π-components of both the term and its type; the last is recursive on the type and required semantic weakening and substitution at arbitrary depth. Consistency is then syntactic and rests on the SN theorem: a normal form exists, subject reduction preserves the type, and in a context whose entries are convertible to sorts a normal term of product type must be an abstraction — so no normal inhabitant of `Π P:Prop. P` exists. Roughly 22 working sittings of model loop time under continuous human direction; ~11k lines of Lean across 22 solver-owned modules. `#print axioms` for the six holes gives, respectively: `propext`; `propext`; none; `propext, Quot.sound`; `propext, Classical.choice, Quot.sound`; `propext, Classical.choice, Quot.sound`. `Classical.choice` enters only through `ZFSet` and `Classical.epsilon` choices of designated carriers.

Dimitrov's lower bound for the house of a nonzero algebraic integer that is not a root of unity
dimitrov

Verso theorem preview

theorem declaration uses `sorry`dimitrov {K : Type*} [Field K] [NumberField K] (α : K) (α_int : IsIntegral ℤ α) (α_ne_zero : α ≠ 0) (α_not_rootOfUnity : ¬ IsOfFinOrder α) : (2 : ℝ) ^ (1 / (4 * (Finset.univ.image fun σ : K →+* ℂ ↦ (σ α).arg).card) : ℝ) ≤ NumberField.house α := K:Type u_1inst✝¹:Field Kinst✝:NumberField Kα:Kα_int:IsIntegral ℤ αα_ne_zero:α ≠ 0α_not_rootOfUnity:¬IsOfFinOrder α⊢ 2 ^ (1 / (4 * ↑(Finset.image (fun σ => (σ α).arg) Finset.univ).card)) ≤ NumberField.house α All goals completed! 🐙
#2
How produced

Original proof of dimitrov (Dimitrov's refined form of the Schinzel–Zassenhaus conjecture; McKee–Smyth, Around the Unit Circle, Theorem 4.1). Claude Opus 5 (Claude Code), under human direction, from the Challenge, Mathlib source search, the published literature, and compiler feedback only. No lean-eval solution was consulted; none exists for this problem. 86 modules, 13,167 lines, no `sorry`; `#print axioms dimitrov` reports exactly propext, Classical.choice, Quot.sound. No vendored or third-party code — every line is original to this submission. Mathlib pinned at 6f1ef4e5dd604a435bddba4747b13970cd65d2a1, toolchain v4.33.0. Verified from a fresh clone: `lake exe cache get && lake build` completes 8798 jobs, and the `pp.all` type of the proved theorem is identical to that of Challenge.dimitrov. Method, in the order the obstructions fell: - The Archimedean input is supplied by formalising the Konyagin–Lev conjecture (2003) from fedja's MathOverflow proof — Jensen's formula, the maximum principle, log-concavity and a rearrangement — rather than by Dubinin's theorem, to which it is equivalent. - Eremenko's explicit hedgehog Riemann map is identified with the tree's own `lift`, so the exterior map needs no branch surgery; univalence follows from the Noshiro–Warschawski criterion in the log coordinate, where the exterior is a convex half-plane. - The remaining geometric input — that the max–min arm configuration equalises — is proved by a polynomial root count on cotangent rows, since Mathlib has no Brouwer, no topological degree and no total positivity. Writing cot((θ−x)/2) in the circle variable turns a vanishing combination of active rows into a polynomial identity with more roots than its degree. - The capacity-comparison layer is then unnecessary: the hedgehog is shown to sit inside house(α)^4 · 4^(−1/N) · (an omitted set of an exterior map), whose conformal map is an explicit formula of derivative exactly that factor, so the Pólya rationality argument runs there and no Riemann mapping theorem is invoked anywhere.

Trace Cayley-Hamilton / Newton identity
trace_cayley_hamilton_newton

Verso theorem preview

theorem declaration uses `sorry`trace_cayley_hamilton_newton {R : Type*} [CommRing R] (A : Matrix n n R) {k : ℕ} (hk : 1 ≤ k) : (k : R) * charpolyDescendingCoeff A k + ∑ j ∈ Finset.Icc 1 k, trace (A ^ j) * charpolyDescendingCoeff A (k - j) = 0 := n:Type u_1inst✝²:Fintype ninst✝¹:DecidableEq nR:Type u_2inst✝:CommRing RA:Matrix n n Rk:ℕhk:1 ≤ k⊢ ↑k * charpolyDescendingCoeff A k + ∑ j ∈ Finset.Icc 1 k, (A ^ j).trace * charpolyDescendingCoeff A (k - j) = 0 All goals completed! 🐙
#3
How produced

Original proof of trace_cayley_hamilton_newton. Claude Fable 5 (Claude Code), under human direction, from the Challenge, Mathlib source search, and compiler feedback only; no published lean-eval solution consulted. Method (Faddeev-LeVerrier): (1) Jacobi's formula for the characteristic polynomial, derivative (charpoly A) = trace (adjugate (charmatrix A)), proved by a Taylor shift chi(X+Y) = det((X.1 - A) + Y.1) over R[X] and a multilinear expansion of the determinant in the rows to read off the coefficient of Y (Submission/CharpolyDerivative.lean); (2) from (X.1 - A) * adjugate = chi * 1 in (Matrix n n R)[X] via matPolyEquiv, the coefficient recursion D_j = A D_{j+1} + chi_{j+1} 1, D_j = 0 for j >= N, D_{N-1} = 1, A D_0 + chi_0 1 = 0; (3) the Faddeev matrices P_k = sum_{i<=k} c_i A^{k-i} equal D_{N-1-k} for k < N and vanish for k >= N, so taking traces gives the unified identity trace P_k = (N - k) c_k for every k, which is Newton's identity after reindexing (Submission/Newton.lean). No eigenvalues, no Cayley-Hamilton needed. Slim imports. Cost: 5 + 3 compile iterations, ~2.5 hours of model loop time. (Earlier workspaces on this branch are already recorded; results are sticky.)

Koszul formula
koszul_formula

Verso theorem preview

theorem declaration uses `sorry`koszul_formula {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] [CompleteSpace E] {H : Type*} [TopologicalSpace H] {I : ModelWithCorners ℝ E H} {M : Type*} [TopologicalSpace M] [ChartedSpace H M] [IsManifold I ∞ M] [RiemannianBundle (fun (x : M) ↦ TangentSpace I x)] [IsContMDiffRiemannianBundle I ∞ E (fun (x : M) ↦ TangentSpace I x)] (cov : CovariantDerivative I E (TangentSpace I (M := M))) [ContMDiffCovariantDerivative cov ∞] (_htor : cov.torsion = 0) (_hmet : LeanEval.Geometry.KoszulFormula.IsMetricCompatible cov) (X Y Z : Π x : M, TangentSpace I x) (_hX : CMDiff ∞ (T% X)) (_hY : CMDiff ∞ (T% Y)) (_hZ : CMDiff ∞ (T% Z)) (x : M) : 2 * inner ℝ (cov Y x (X x)) (Z x) = mvfderiv I (fun y : M => inner ℝ (Y y) (Z y)) x (X x) + mvfderiv I (fun y : M => inner ℝ (X y) (Z y)) x (Y x) - mvfderiv I (fun y : M => inner ℝ (X y) (Y y)) x (Z x) - inner ℝ (X x) (mlieBracket I Y Z x) - inner ℝ (Y x) (mlieBracket I X Z x) + inner ℝ (Z x) (mlieBracket I X Y x) := E:Type u_1inst✝¹⁰:NormedAddCommGroup Einst✝⁹:NormedSpace ℝ Einst✝⁸:FiniteDimensional ℝ Einst✝⁷:CompleteSpace EH:Type u_2inst✝⁶:TopologicalSpace HI:ModelWithCorners ℝ E HM:Type u_3inst✝⁵:TopologicalSpace Minst✝⁴:ChartedSpace H Minst✝³:IsManifold I ∞ Minst✝²:RiemannianBundle fun x => TangentSpace I xinst✝¹:IsContMDiffRiemannianBundle I ∞ E fun x => TangentSpace I xcov:CovariantDerivative I E (TangentSpace I)inst✝:cov.ContMDiffCovariantDerivative ∞_htor:cov.torsion = 0_hmet:LeanEval.Geometry.KoszulFormula.IsMetricCompatible covX:(x : M) → TangentSpace I xY:(x : M) → TangentSpace I xZ:(x : M) → TangentSpace I x_hX:ContMDiff I I.tangent ∞ (T% X)_hY:ContMDiff I I.tangent ∞ (T% Y)_hZ:ContMDiff I I.tangent ∞ (T% Z)x:M⊢ 2 * Inner.inner ℝ ((↑cov Y x) (X x)) (Z x) = ((d% fun y => Inner.inner ℝ (Y y) (Z y)) x) (X x) + ((d% fun y => Inner.inner ℝ (X y) (Z y)) x) (Y x) - ((d% fun y => Inner.inner ℝ (X y) (Y y)) x) (Z x) - Inner.inner ℝ (X x) (mlieBracket I Y Z x) - Inner.inner ℝ (Y x) (mlieBracket I X Z x) + Inner.inner ℝ (Z x) (mlieBracket I X Y x) All goals completed! 🐙
#4
How produced

Original proof of koszul_formula. Claude Fable 5 (Claude Code), under human direction, from the Challenge, Mathlib source search, and compiler feedback only; no published lean-eval solution consulted. Method: instantiate the problem's IsMetricCompatible hypothesis at the three cyclic pairs, replace the three Lie brackets via Mathlib's CovariantDerivative.torsion_eq_zero_iff, then bilinearity of the inner product (inner_sub_right), three real_inner_comm rewrites, and ring. Cost: 2 compile iterations, ~20 minutes of model loop time. (Earlier workspaces on this branch are already recorded; results are sticky.)

Linear programming: maximum principle and vertex optimality
lp_maximum_principle

Verso theorem preview

/-- **Maximum principle for linear programming** (§101). A local maximiser of the LP objective on the feasible region is automatically a global maximiser; and whenever the objective is non-constant (`c ≠ 0`), the maximiser lies on the topological frontier of the feasible region. -/ theorem declaration uses `sorry`lp_maximum_principle {m n : ℕ} (lp : LinearProgram m n) (x : Fin m → ℝ) (_hx : x ∈ lp.feasible) (_hlocal : IsLocalMaxOn lp.objective lp.feasible x) : IsMaxOn lp.objective lp.feasible x ∧ (lp.c ≠ 0 → x ∈ frontier lp.feasible) := m:ℕn:ℕlp:LinearProgram m nx:Fin m → ℝ_hx:x ∈ lp.feasible_hlocal:IsLocalMaxOn lp.objective lp.feasible x⊢ IsMaxOn lp.objective lp.feasible x ∧ (lp.c ≠ 0 → x ∈ frontier lp.feasible) All goals completed! 🐙
/-- **Vertex optimality** (§101; the existence content of Dantzig's 1947 simplex algorithm). Every linear program with a nonempty bounded feasible region admits a global maximiser that is an extreme point (vertex) of the feasible region. -/ theorem declaration uses `sorry`simplex_algorithm {m n : ℕ} (lp : LinearProgram m n) (_hfeas : lp.feasible.Nonempty) (_hbdd : Bornology.IsBounded lp.feasible) : ∃ x ∈ lp.feasible, IsMaxOn lp.objective lp.feasible x ∧ x ∈ Set.extremePoints ℝ lp.feasible := m:ℕn:ℕlp:LinearProgram m n_hfeas:lp.feasible.Nonempty_hbdd:Bornology.IsBounded lp.feasible⊢ ∃ x ∈ lp.feasible, IsMaxOn lp.objective lp.feasible x ∧ x ∈ Set.extremePoints ℝ lp.feasible All goals completed! 🐙
#5
How produced

Original proof of lp_maximum_principle (both holes: lp_maximum_principle and simplex_algorithm). Claude Fable 5 (Claude Code), under human direction, from the Challenge, Mathlib source search, and compiler feedback only; no published lean-eval solution consulted. Method: the feasible region {A x <= b, 0 <= x} is convex and closed (mulVecLin is continuous in finite dimension; isClosed_le on the Pi order); the objective c . x is concave (linear), so IsMaxOn.of_isLocalMaxOn_of_concaveOn gives the global maximum; for the frontier claim, an interior point could be moved by (eps / 2|c|) c and stay feasible while strictly increasing c . x (dotProduct_self_star_pos_iff), contradicting maximality. For vertex optimality: closed + bounded => compact (Metric.isCompact_of_isClosed_isBounded), the max is attained (IsCompact.exists_isMaxOn), the maximal face is an exposed face of the region (IsExposed with the objective as a StrongDual element), hence compact; the Krein-Milman lemma (IsCompact.extremePoints_nonempty) gives it an extreme point, which is extreme in the region via IsExposed.isExtreme and IsExtreme.extremePoints_subset_extremePoints. Cost: 2 compile iterations, ~25 minutes of model loop time. (Earlier workspaces on this branch are already recorded; results are sticky.)

Bourbaki's locally convex extension of Banach–Alaoglu
banach_alaoglu_bourbaki

Verso theorem preview

theorem declaration uses `sorry`banach_alaoglu_bourbaki (E : Type*) [AddCommGroup E] [Module ℝ E] [TopologicalSpace E] [ContinuousAdd E] [ContinuousSMul ℝ E] [LocallyConvexSpace ℝ E] (U : Set E) (_hU : U ∈ 𝓝 (0 : E)) : IsCompact (LeanEval.Analysis.weakStarPolar E U) := E:Type u_1inst✝⁵:AddCommGroup Einst✝⁴:Module ℝ Einst✝³:TopologicalSpace Einst✝²:ContinuousAdd Einst✝¹:ContinuousSMul ℝ Einst✝:LocallyConvexSpace ℝ EU:Set E_hU:U ∈ 𝓝 0⊢ IsCompact (weakStarPolar E U) All goals completed! 🐙
#6
How produced

Original proof of banach_alaoglu_bourbaki (Bourbaki's locally convex extension of Banach-Alaoglu, absent from Mathlib per the problem's own docstring). Claude Fable 5 (Claude Code), under human direction, worked from the Challenge, Mathlib source search, and compiler feedback only; no published lean-eval solution consulted. Method: choose an open absolutely convex V inside the given neighborhood (nhds_hasBasis_absConvex_open), take p := gaugeSeminorm of V, build a type synonym of E carrying p as a SeminormedAddCommGroup/NormedSpace structure, apply Mathlib's seminormed Banach-Alaoglu (WeakDual.isCompact_polar) to the unit ball there, and transport compactness through the pointwise-continuous inclusion of the p-dual into WeakDual of E; the weak-star polar of U is closed and contained in that compact image. Cost: 9 compile iterations, ~45 minutes of model loop time, ~$0 marginal spend. (Earlier workspaces on this branch are already recorded; results are sticky.)

Symplectic matrices have determinant 1
symplectic_matrix_det

Verso theorem preview

theorem declaration uses `sorry`symplectic_matrix_det {l R : Type*} [DecidableEq l] [Fintype l] [CommRing R] {A : Matrix (l ⊕ l) (l ⊕ l) R} (_hA : A ∈ Matrix.symplecticGroup l R) : A.det = 1 := l:Type u_1R:Type u_2inst✝²:DecidableEq linst✝¹:Fintype linst✝:CommRing RA:Matrix (l ⊕ l) (l ⊕ l) R_hA:A ∈ symplecticGroup l R⊢ A.det = 1 All goals completed! 🐙
#7
How produced

symplectic_matrix_det: a direct citation — the statement is Mathlib's own SymplecticGroup.det_eq_one, applied in one line. Found via Mathlib source search by Claude Fable 5 (Claude Code) under human direction, for a pre-registered research gate; no published lean-eval solution consulted. Disclosed as a citation rather than a new proof. Cost: 2 compile iterations (one namespace fix), ~5 minutes. (Earlier workspaces on this branch are already recorded; results are sticky.)

Oppenheim's inequality for Hadamard products
oppenheim_inequality

Verso theorem preview

theorem declaration uses `sorry`oppenheim_inequality {n : Type*} [Fintype n] [DecidableEq n] {A B : Matrix n n ℝ} (hA : A.PosSemidef) (hB : B.PosSemidef) : A.det * ∏ i, B i i ≤ (A ⊙ B).det := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℝB:Matrix n n ℝhA:A.PosSemidefhB:B.PosSemidef⊢ A.det * ∏ i, B i i ≤ (A ⊙ B).det All goals completed! 🐙
#8
How produced

Original proof of oppenheim_inequality. Claude Fable 5 (Claude Code), under human direction, from the Challenge, Mathlib source search, and compiler feedback only; no published lean-eval solution consulted. Method: induction on Fintype.card n. Trivial cases det A = 0 or some B i i = 0 reduce to det_nonneg of the Hadamard product (Schur product theorem, PosSemidef.hadamard). Otherwise A is positive definite; reindex along Equiv.sumCompl (. = i0) and split into blocks; the (1,1) blocks are 1x1 with positive entries, so PosDef.fromBlocks_11 gives positive semidefinite Schur complements S_A, S_B and det_fromBlocks_11 gives det A = a * det S_A and det (A o B) = a b * det S_AB. The entrywise identity S_AB = S_A o B_22 + (A_21 A_11^-1 A_12) o S_B exhibits S_AB as S_A o B_22 plus a positive semidefinite correction (rank-one PSD times inverse pivot, Hadamard with S_B). A self-proved lemma det X <= det (X + Y) for PSD X, Y (via CFC.sqrt X, conjugation to 1 + Z with Z PSD, and eigenvalues of 1 + Z being >= 1 from the orthonormal eigenvector basis) then combines with the induction hypothesis on S_A and B_22. Slim imports. Cost: 2 compile iterations, ~45 minutes of model loop time. (Earlier workspaces on this branch are already recorded; results are sticky.)

Character values of finite groups lie in cyclotomic fields
brauer_character_in_cyclotomic

Verso theorem preview

theorem declaration uses `sorry`brauer_character_in_cyclotomic (G : Type) [Group G] [Fintype G] : ∃ φ : CyclotomicField (Monoid.exponent G) ℚ →+* ℂ, ∀ (V : Type) (_ : AddCommGroup V) (_ : Module ℂ V) (_ : FiniteDimensional ℂ V) (ρ : Representation ℂ G V) (g : G), LinearMap.trace ℂ V (ρ g) ∈ φ.range := G:Typeinst✝¹:Group Ginst✝:Fintype G⊢ ∃ φ, ∀ (V : Type) (x : AddCommGroup V) (x_1 : Module ℂ V), FiniteDimensional ℂ V → ∀ (ρ : Representation ℂ G V) (g : G), (LinearMap.trace ℂ V) (ρ g) ∈ φ.range All goals completed! 🐙
#9
How produced

Original proof of brauer_character_in_cyclotomic. Claude Fable 5 (Claude Code), under human direction, from the Challenge, Mathlib source search, and compiler feedback only; no published lean-eval solution consulted. Method: embed CyclotomicField (exponent G) into C via IsAlgClosed.lift; rho(g)^exp = 1, so the trace equals the sum of charpoly roots (trace_eq_sum_roots_charpoly), each root is an eigenvalue (hasEigenvalue_iff_isRoot_charpoly) whose eigenvector forces mu^exp = 1, hence each root is a power of the image of zeta (IsPrimitiveRoot.eq_pow_of_pow_eq_one) and lies in the embedding's range, a subring. Cost: 3 compile iterations, ~35 minutes of model loop time, ~$0 marginal spend. (Earlier workspaces on this branch are already recorded; results are sticky.)

Dirichlet eigenvalues of -y'' = lambda y on [0,pi] are n^2
dirichlet_eigenvalues_eq_nat_sq

Verso theorem preview

theorem declaration uses `sorry`dirichlet_eigenvalues_eq_nat_sq (lam : ℝ) : (∃ (y : ℝ → ℝ) (J : Set ℝ), IsOpen J ∧ Set.Icc (0 : ℝ) Real.pi ⊆ J ∧ (∀ x ∈ J, HasDerivAt y (deriv y x) x) ∧ (∀ x ∈ J, HasDerivAt (deriv y) (-(lam * y x)) x) ∧ y 0 = 0 ∧ y Real.pi = 0 ∧ ∃ x ∈ Set.Ioo (0 : ℝ) Real.pi, y x ≠ 0) ↔ ∃ n : ℕ, 0 < n ∧ lam = (n : ℝ) ^ 2 := lam:ℝ⊢ (∃ y J, IsOpen J ∧ Set.Icc 0 π ⊆ J ∧ (∀ x ∈ J, HasDerivAt y (deriv y x) x) ∧ (∀ x ∈ J, HasDerivAt (deriv y) (-(lam * y x)) x) ∧ y 0 = 0 ∧ y π = 0 ∧ ∃ x ∈ Set.Ioo 0 π, y x ≠ 0) ↔ ∃ n, 0 < n ∧ lam = ↑n ^ 2 All goals completed! 🐙
#10
How produced

Original proof of dirichlet_eigenvalues_eq_nat_sq. Claude Fable 5 (Claude Code), under human direction, from the Challenge, Mathlib source search, and compiler feedback only; no published lean-eval solution consulted. Method: a second-order IVP uniqueness lemma obtained by passing to the first-order system in R x R with a continuous-linear vector field and Gronwall's trajectory estimate (dist_le_of_trajectories_ODE); then trichotomy on lam with explicit comparison solutions (sinh / linear / sine scaled by the initial slope), so the boundary condition at pi forces either a vanishing initial slope (contradicting the interior nonvanishing point) or sin(sqrt(lam) pi) = 0, giving lam = n^2 via sin_eq_zero_iff; the converse exhibits sin(n x). Slim imports per the evaluator-memory finding. Cost: 3 compile iterations, ~50 minutes of model loop time. (Earlier workspaces on this branch are already recorded; results are sticky.) Note: this is a retry of #1153, whose evaluation was canceled mid-run (workflow logs show `Run evaluate_submission.py: The operation was canceled` after ~45 min, plus an early `Mint lean-eval-bot installation token: Not Found` error) — the generic overlay-collision comment appears to be the catch-all failure message. The submission content is unchanged.

Entrywise exponential of a PSD matrix is PSD
posSemidef_map_exp

Verso theorem preview

theorem declaration uses `sorry`posSemidef_map_exp {n : Type*} [Fintype n] [DecidableEq n] {A : Matrix n n ℝ} (hA : A.PosSemidef) : (A.map Real.exp).PosSemidef := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℝhA:A.PosSemidef⊢ (A.map Real.exp).PosSemidef All goals completed! 🐙
#11
How produced

Retry of bvp_comparison and sturm_separation, which failed evaluation in #1130/#1131 with no error detail while sibling workspaces passed — consistent with the runner memory issue documented in #1078. This resubmission replaces `import Mathlib` with minimal targeted imports in both Submission.lean files to shrink the build/export footprint; the proofs are byte-identical otherwise. Both are original proofs by Claude Fable 5 (Claude Code) under human direction (methods described in #1130/#1131); no published lean-eval solution consulted. (Other workspaces on this branch are already recorded; results are sticky.)

Sturm separation theorem
sturm_separation

Verso theorem preview

theorem declaration uses `sorry`sturm_separation (p q y₁ y₂ : ℝ → ℝ) (a b : ℝ) (hab : a < b) (J : Set ℝ) (hJ_open : IsOpen J) (hJ_conn : IsPreconnected J) (hJ_sub : Set.Icc a b ⊆ J) (hp : ContinuousOn p J) (hq : ContinuousOn q J) (hy₁ : ∀ x ∈ J, HasDerivAt y₁ (deriv y₁ x) x) (hy₁' : ∀ x ∈ J, HasDerivAt (deriv y₁) (-(p x * deriv y₁ x + q x * y₁ x)) x) (hy₂ : ∀ x ∈ J, HasDerivAt y₂ (deriv y₂ x) x) (hy₂' : ∀ x ∈ J, HasDerivAt (deriv y₂) (-(p x * deriv y₂ x + q x * y₂ x)) x) (hW : ∃ x₀ ∈ J, y₁ x₀ * deriv y₂ x₀ - y₂ x₀ * deriv y₁ x₀ ≠ 0) (hza : y₁ a = 0) (hzb : y₁ b = 0) (hne : ∀ x ∈ Set.Ioo a b, y₁ x ≠ 0) : ∃! c, c ∈ Set.Ioo a b ∧ y₂ c = 0 := p:ℝ → ℝq:ℝ → ℝy₁:ℝ → ℝy₂:ℝ → ℝa:ℝb:ℝhab:a < bJ:Set ℝhJ_open:IsOpen JhJ_conn:IsPreconnected JhJ_sub:Set.Icc a b ⊆ Jhp:ContinuousOn p Jhq:ContinuousOn q Jhy₁:∀ x ∈ J, HasDerivAt y₁ (deriv y₁ x) xhy₁':∀ x ∈ J, HasDerivAt (deriv y₁) (-(p x * deriv y₁ x + q x * y₁ x)) xhy₂:∀ x ∈ J, HasDerivAt y₂ (deriv y₂ x) xhy₂':∀ x ∈ J, HasDerivAt (deriv y₂) (-(p x * deriv y₂ x + q x * y₂ x)) xhW:∃ x₀ ∈ J, y₁ x₀ * deriv y₂ x₀ - y₂ x₀ * deriv y₁ x₀ ≠ 0hza:y₁ a = 0hzb:y₁ b = 0hne:∀ x ∈ Set.Ioo a b, y₁ x ≠ 0⊢ ∃! c, c ∈ Set.Ioo a b ∧ y₂ c = 0 All goals completed! 🐙
#12
How produced

Retry of bvp_comparison and sturm_separation, which failed evaluation in #1130/#1131 with no error detail while sibling workspaces passed — consistent with the runner memory issue documented in #1078. This resubmission replaces `import Mathlib` with minimal targeted imports in both Submission.lean files to shrink the build/export footprint; the proofs are byte-identical otherwise. Both are original proofs by Claude Fable 5 (Claude Code) under human direction (methods described in #1130/#1131); no published lean-eval solution consulted. (Other workspaces on this branch are already recorded; results are sticky.)

Polynomial decay rate of y' = -y^3
cubic_decay_asymptotic

Verso theorem preview

theorem declaration uses `sorry`cubic_decay_asymptotic (y : ℝ → ℝ) (hy_diff : ∀ t : ℝ, 0 < t → HasDerivAt y (-(y t) ^ 3) t) (hy_cont : ContinuousWithinAt y (Set.Ici 0) 0) (hy0 : y 0 = 1) : Tendsto (fun t : ℝ => y t * Real.sqrt t) atTop (𝓝 (1 / Real.sqrt 2)) := y:ℝ → ℝhy_diff:∀ (t : ℝ), 0 < t → HasDerivAt y (-y t ^ 3) thy_cont:ContinuousWithinAt y (Set.Ici 0) 0hy0:y 0 = 1⊢ Tendsto (fun t => y t * √t) atTop (𝓝 (1 / √2)) All goals completed! 🐙
#13
How produced

Retry of cubic_decay_asymptotic, which failed evaluation in #1145 with no error detail while the eight sibling workspaces passed in the same run. This is the same evaluator memory pattern we hit and fixed in #1142 (see also #1078): the resubmission replaces `import Mathlib` with minimal targeted imports (and one tactic call with an explicit term); the proof is otherwise identical and builds locally. Original proof by Claude Fable 5 (Claude Code) under human direction; method described in #1145; no published lean-eval solution consulted. (Other workspaces on this branch are already recorded; results are sticky.)

Comparison principle for the Dirichlet BVP
bvp_comparison

Verso theorem preview

theorem declaration uses `sorry`bvp_comparison (J : Set ℝ) (hJ_open : IsOpen J) (hJ_sub : Set.Icc (0 : ℝ) 1 ⊆ J) (u v : ℝ → ℝ) (hu : ∀ x ∈ J, HasDerivAt u (deriv u x) x) (hu' : ∀ x ∈ J, HasDerivAt (deriv u) (deriv (deriv u) x) x) (hv : ∀ x ∈ J, HasDerivAt v (deriv v x) x) (hv' : ∀ x ∈ J, HasDerivAt (deriv v) (deriv (deriv v) x) x) (hineq : ∀ x ∈ Set.Ioo (0 : ℝ) 1, -deriv (deriv u) x ≤ -deriv (deriv v) x) (hu0 : u 0 ≤ v 0) (hu1 : u 1 ≤ v 1) : ∀ x ∈ Set.Icc (0 : ℝ) 1, u x ≤ v x := J:Set ℝhJ_open:IsOpen JhJ_sub:Set.Icc 0 1 ⊆ Ju:ℝ → ℝv:ℝ → ℝhu:∀ x ∈ J, HasDerivAt u (deriv u x) xhu':∀ x ∈ J, HasDerivAt (deriv u) (deriv (deriv u) x) xhv:∀ x ∈ J, HasDerivAt v (deriv v x) xhv':∀ x ∈ J, HasDerivAt (deriv v) (deriv (deriv v) x) xhineq:∀ x ∈ Set.Ioo 0 1, -deriv (deriv u) x ≤ -deriv (deriv v) xhu0:u 0 ≤ v 0hu1:u 1 ≤ v 1⊢ ∀ x ∈ Set.Icc 0 1, u x ≤ v x All goals completed! 🐙
#14
How produced

Retry of bvp_comparison and sturm_separation, which failed evaluation in #1130/#1131 with no error detail while sibling workspaces passed — consistent with the runner memory issue documented in #1078. This resubmission replaces `import Mathlib` with minimal targeted imports in both Submission.lean files to shrink the build/export footprint; the proofs are byte-identical otherwise. Both are original proofs by Claude Fable 5 (Claude Code) under human direction (methods described in #1130/#1131); no published lean-eval solution consulted. (Other workspaces on this branch are already recorded; results are sticky.)

Cayley graph connected iff generators generate the group
mulCayley_connected_iff_closure_eq_top

Verso theorem preview

theorem declaration uses `sorry`mulCayley_connected_iff_closure_eq_top {G : Type*} [Group G] (S : Set G) : (SimpleGraph.mulCayley S).Connected ↔ Subgroup.closure S = ⊤ := G:Type u_1inst✝:Group GS:Set G⊢ (SimpleGraph.mulCayley S).Connected ↔ Subgroup.closure S = ⊤ All goals completed! 🐙
#15
How produced

Original proofs (batch of 2: bvp_comparison, mulCayley_connected_iff_closure_eq_top), produced for a pre-registered research gate. Claude Fable 5 (Claude Code), under human direction, worked from each problem's Challenge.lean, the workspace's pinned Mathlib (source search), and compiler feedback only — no published lean-eval solution to any problem was consulted. bvp_comparison: w := u - v has w'' >= 0, so w is convex on [0,1] (convexOn_of_deriv2_nonneg) and bounded by its endpoint values. mulCayley: closure-membership transfers along walks (forward); closure_induction with left-translation as a graph homomorphism (backward). Cost: 3 and 1 compile iterations, ~20 and ~15 minutes of model loop time respectively, ~$0 marginal spend. (The previously submitted finite_graph_ramsey_theorem workspace is also on this branch; its result is sticky.)

Finite Ramsey theorem for graphs
finite_graph_ramsey_theorem

Verso theorem preview

theorem declaration uses `sorry`finite_graph_ramsey_theorem : ∀ r s : ℕ, 2 ≤ r → 2 ≤ s → ∃ n : ℕ, ∀ G : SimpleGraph (Fin n), ¬ G.CliqueFree r ∨ ¬ Gᶜ.CliqueFree s := ⊢ ∀ (r s : ℕ), 2 ≤ r → 2 ≤ s → ∃ n, ∀ (G : SimpleGraph (Fin n)), ¬G.CliqueFree r ∨ ¬Gᶜ.CliqueFree s All goals completed! 🐙
#16
How produced

Original proof, produced for a pre-registered research gate. Claude Fable 5 (Claude Code), under human direction, worked from the problem's Challenge.lean, the workspace's pinned Mathlib (source search), and compiler feedback only — no published lean-eval solution to any problem was consulted. (The same submitter maintains a separately-labeled packaging entry; the buckets and branches are kept disjoint on purpose.) Method: a Finset-strengthened Ramsey statement proved by double induction on r and s with the pivot-vertex pigeonhole (R(r+1,s+1) ≤ R(r,s+1) + R(r+1,s) + 1), all within a single vertex type, then specialized to Fin n with A = univ. Mathlib at this pin has no Ramsey theorem. Cost: 2 compile iterations, ~17 minutes of model loop time, ~$0 marginal spend.

First submissionAug 20, 2026
Last submissionAug 28, 2026
mlgraham16
20EVO (deepthought.com.au)8 solved
Pell solutions are convergents of √d
pell_solution_convergent

Verso theorem preview

theorem declaration uses `sorry`pell_solution_is_convergent (d : ℤ) (_hd : Squarefree d) (_hd0 : 0 < d) (x y : ℤ) (_hx : 0 < x) (_hy : 0 < y) (_hsol : x ^ 2 - d * y ^ 2 = 1) : ∃ n : ℕ, (GenContFract.of (Real.sqrt (d : ℝ))).convs n = (x : ℝ) / (y : ℝ) := d:ℤ_hd:Squarefree d_hd0:0 < dx:ℤy:ℤ_hx:0 < x_hy:0 < y_hsol:x ^ 2 - d * y ^ 2 = 1⊢ ∃ n, (GenContFract.of √↑d).convs n = ↑x / ↑y All goals completed! 🐙
#1
Dirichlet eigenvalues of -y'' = lambda y on [0,pi] are n^2
dirichlet_eigenvalues_eq_nat_sq

Verso theorem preview

theorem declaration uses `sorry`dirichlet_eigenvalues_eq_nat_sq (lam : ℝ) : (∃ (y : ℝ → ℝ) (J : Set ℝ), IsOpen J ∧ Set.Icc (0 : ℝ) Real.pi ⊆ J ∧ (∀ x ∈ J, HasDerivAt y (deriv y x) x) ∧ (∀ x ∈ J, HasDerivAt (deriv y) (-(lam * y x)) x) ∧ y 0 = 0 ∧ y Real.pi = 0 ∧ ∃ x ∈ Set.Ioo (0 : ℝ) Real.pi, y x ≠ 0) ↔ ∃ n : ℕ, 0 < n ∧ lam = (n : ℝ) ^ 2 := lam:ℝ⊢ (∃ y J, IsOpen J ∧ Set.Icc 0 π ⊆ J ∧ (∀ x ∈ J, HasDerivAt y (deriv y x) x) ∧ (∀ x ∈ J, HasDerivAt (deriv y) (-(lam * y x)) x) ∧ y 0 = 0 ∧ y π = 0 ∧ ∃ x ∈ Set.Ioo 0 π, y x ≠ 0) ↔ ∃ n, 0 < n ∧ lam = ↑n ^ 2 All goals completed! 🐙
#2
Entrywise exponential of a PSD matrix is PSD
posSemidef_map_exp

Verso theorem preview

theorem declaration uses `sorry`posSemidef_map_exp {n : Type*} [Fintype n] [DecidableEq n] {A : Matrix n n ℝ} (hA : A.PosSemidef) : (A.map Real.exp).PosSemidef := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℝhA:A.PosSemidef⊢ (A.map Real.exp).PosSemidef All goals completed! 🐙
#3
Sturm separation theorem
sturm_separation

Verso theorem preview

theorem declaration uses `sorry`sturm_separation (p q y₁ y₂ : ℝ → ℝ) (a b : ℝ) (hab : a < b) (J : Set ℝ) (hJ_open : IsOpen J) (hJ_conn : IsPreconnected J) (hJ_sub : Set.Icc a b ⊆ J) (hp : ContinuousOn p J) (hq : ContinuousOn q J) (hy₁ : ∀ x ∈ J, HasDerivAt y₁ (deriv y₁ x) x) (hy₁' : ∀ x ∈ J, HasDerivAt (deriv y₁) (-(p x * deriv y₁ x + q x * y₁ x)) x) (hy₂ : ∀ x ∈ J, HasDerivAt y₂ (deriv y₂ x) x) (hy₂' : ∀ x ∈ J, HasDerivAt (deriv y₂) (-(p x * deriv y₂ x + q x * y₂ x)) x) (hW : ∃ x₀ ∈ J, y₁ x₀ * deriv y₂ x₀ - y₂ x₀ * deriv y₁ x₀ ≠ 0) (hza : y₁ a = 0) (hzb : y₁ b = 0) (hne : ∀ x ∈ Set.Ioo a b, y₁ x ≠ 0) : ∃! c, c ∈ Set.Ioo a b ∧ y₂ c = 0 := p:ℝ → ℝq:ℝ → ℝy₁:ℝ → ℝy₂:ℝ → ℝa:ℝb:ℝhab:a < bJ:Set ℝhJ_open:IsOpen JhJ_conn:IsPreconnected JhJ_sub:Set.Icc a b ⊆ Jhp:ContinuousOn p Jhq:ContinuousOn q Jhy₁:∀ x ∈ J, HasDerivAt y₁ (deriv y₁ x) xhy₁':∀ x ∈ J, HasDerivAt (deriv y₁) (-(p x * deriv y₁ x + q x * y₁ x)) xhy₂:∀ x ∈ J, HasDerivAt y₂ (deriv y₂ x) xhy₂':∀ x ∈ J, HasDerivAt (deriv y₂) (-(p x * deriv y₂ x + q x * y₂ x)) xhW:∃ x₀ ∈ J, y₁ x₀ * deriv y₂ x₀ - y₂ x₀ * deriv y₁ x₀ ≠ 0hza:y₁ a = 0hzb:y₁ b = 0hne:∀ x ∈ Set.Ioo a b, y₁ x ≠ 0⊢ ∃! c, c ∈ Set.Ioo a b ∧ y₂ c = 0 All goals completed! 🐙
#4
Cayley graph connected iff generators generate the group
mulCayley_connected_iff_closure_eq_top

Verso theorem preview

theorem declaration uses `sorry`mulCayley_connected_iff_closure_eq_top {G : Type*} [Group G] (S : Set G) : (SimpleGraph.mulCayley S).Connected ↔ Subgroup.closure S = ⊤ := G:Type u_1inst✝:Group GS:Set G⊢ (SimpleGraph.mulCayley S).Connected ↔ Subgroup.closure S = ⊤ All goals completed! 🐙
#5
Comparison principle for the Dirichlet BVP
bvp_comparison

Verso theorem preview

theorem declaration uses `sorry`bvp_comparison (J : Set ℝ) (hJ_open : IsOpen J) (hJ_sub : Set.Icc (0 : ℝ) 1 ⊆ J) (u v : ℝ → ℝ) (hu : ∀ x ∈ J, HasDerivAt u (deriv u x) x) (hu' : ∀ x ∈ J, HasDerivAt (deriv u) (deriv (deriv u) x) x) (hv : ∀ x ∈ J, HasDerivAt v (deriv v x) x) (hv' : ∀ x ∈ J, HasDerivAt (deriv v) (deriv (deriv v) x) x) (hineq : ∀ x ∈ Set.Ioo (0 : ℝ) 1, -deriv (deriv u) x ≤ -deriv (deriv v) x) (hu0 : u 0 ≤ v 0) (hu1 : u 1 ≤ v 1) : ∀ x ∈ Set.Icc (0 : ℝ) 1, u x ≤ v x := J:Set ℝhJ_open:IsOpen JhJ_sub:Set.Icc 0 1 ⊆ Ju:ℝ → ℝv:ℝ → ℝhu:∀ x ∈ J, HasDerivAt u (deriv u x) xhu':∀ x ∈ J, HasDerivAt (deriv u) (deriv (deriv u) x) xhv:∀ x ∈ J, HasDerivAt v (deriv v x) xhv':∀ x ∈ J, HasDerivAt (deriv v) (deriv (deriv v) x) xhineq:∀ x ∈ Set.Ioo 0 1, -deriv (deriv u) x ≤ -deriv (deriv v) xhu0:u 0 ≤ v 0hu1:u 1 ≤ v 1⊢ ∀ x ∈ Set.Icc 0 1, u x ≤ v x All goals completed! 🐙
#6
Finite Ramsey theorem for graphs
finite_graph_ramsey_theorem

Verso theorem preview

theorem declaration uses `sorry`finite_graph_ramsey_theorem : ∀ r s : ℕ, 2 ≤ r → 2 ≤ s → ∃ n : ℕ, ∀ G : SimpleGraph (Fin n), ¬ G.CliqueFree r ∨ ¬ Gᶜ.CliqueFree s := ⊢ ∀ (r s : ℕ), 2 ≤ r → 2 ≤ s → ∃ n, ∀ (G : SimpleGraph (Fin n)), ¬G.CliqueFree r ∨ ¬Gᶜ.CliqueFree s All goals completed! 🐙
#7
Catalan generating function via compositional inversion
substInv_X_sub_X_sq_eq_catalan

Verso theorem preview

theorem declaration uses `sorry`substInv_X_sub_X_sq_eq_catalan (n : ℕ) : haveI : Invertible (coeff 1 ((X : ℚ⟦X⟧) - X ^ 2)) := n:ℕ⊢ Invertible ((coeff 1) (X - X ^ 2)) n:ℕ⊢ Invertible 1; All goals completed! 🐙 coeff (n + 1) (substInv ((X : ℚ⟦X⟧) - X ^ 2)) = (Nat.choose (2 * n) n : ℚ) / (↑n + 1) := n:ℕ⊢ (coeff (n + 1)) (X - X ^ 2).substInv = ↑((2 * n).choose n) / (↑n + 1) All goals completed! 🐙
#8
First submissionJun 6, 2026
Last submissionJun 23, 2026
test1-deepthought8
21Public accepted source + Codex packaging7 solved
Perron-Frobenius for irreducible nonnegative matrices
irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius

Verso theorem preview

theorem declaration uses `sorry`irreducible_nonnegative_matrix_has_positive_eigenvector_at_spectralRadius {n : Type*} [Fintype n] [DecidableEq n] [Nonempty n] (A : Matrix n n ℝ) (hA : A.IsIrreducible) : ∃ v : n → ℝ, Module.End.HasEigenvector (Matrix.toLin' A) (spectralRadius ℝ A).toReal v ∧ (∀ i, 0 < v i) := n:Type u_1inst✝²:Fintype ninst✝¹:DecidableEq ninst✝:Nonempty nA:Matrix n n ℝhA:A.IsIrreducible⊢ ∃ v, Module.End.HasEigenvector (Matrix.toLin' A) (spectralRadius ℝ A).toReal v ∧ ∀ (i : n), 0 < v i All goals completed! 🐙
#1
How produced

Copied from a public accepted Lean Eval submission, repackaged into a commit-pinned workspace, then checked locally with `lake build Submission`, `lake env lean Submission.lean`, and a solver-owned forbidden-token scan.

Rouche theorem via zero counting
rouche_zero_count_eq

Verso theorem preview

theorem declaration uses `sorry`rouche_zero_count_eq {f g : ℂ → ℂ} {R : ℝ} (hR : 0 < R) (hf : MeromorphicNFOn f Set.univ) (hg : AnalyticOn ℂ g Set.univ) (hbound : ∀ z : ℂ, ‖z‖ = R → ‖g z‖ < ‖f z‖) : (∑ᶠ z, ((divisor (f + g) (Metric.closedBall 0 R))⁺) z) = (∑ᶠ z, ((divisor f (Metric.closedBall 0 R))⁺) z) := f:ℂ → ℂg:ℂ → ℂR:ℝhR:0 < Rhf:MeromorphicNFOn f Set.univhg:AnalyticOn ℂ g Set.univhbound:∀ (z : ℂ), ‖z‖ = R → ‖g z‖ < ‖f z‖⊢ ∑ᶠ (z : ℂ), (divisor (f + g) (Metric.closedBall 0 R))⁺ z = ∑ᶠ (z : ℂ), (divisor f (Metric.closedBall 0 R))⁺ z All goals completed! 🐙
#2
How produced

Copied from a public accepted Lean Eval submission, repackaged into a commit-pinned workspace, then checked locally with `lake build Submission`, `lake env lean Submission.lean`, and a solver-owned forbidden-token scan.

Complementary polynomial on the unit circle
exists_complementary_polynomial_on_unit_circle

Verso theorem preview

theorem declaration uses `sorry`exists_complementary_polynomial_on_unit_circle (P : ℂ[X]) (hP : ∀ z : Circle, ‖P.eval (z : ℂ)‖ ≤ 1) : ∃ Q : ℂ[X], Q.natDegree ≤ P.natDegree ∧ ∀ z : Circle, ‖P.eval (z : ℂ)‖ ^ 2 + ‖Q.eval (z : ℂ)‖ ^ 2 = 1 := P:ℂ[X]hP:∀ (z : Circle), ‖eval (↑z) P‖ ≤ 1⊢ ∃ Q, Q.natDegree ≤ P.natDegree ∧ ∀ (z : Circle), ‖eval (↑z) P‖ ^ 2 + ‖eval (↑z) Q‖ ^ 2 = 1 All goals completed! 🐙
#3
How produced

Copied from a public accepted Lean Eval submission, repackaged into a commit-pinned workspace, then checked locally with `lake build Submission`, `lake env lean Submission.lean`, and a solver-owned forbidden-token scan.

Gaussian heat kernel solves the 1D heat equation
heat_kernel_solves_heat_equation

Verso theorem preview

theorem declaration uses `sorry`heat_kernel_solves_heat_equation (f : ℝ → ℝ) (hf_cont : Continuous f) (hf_bdd : ∃ M : ℝ, ∀ x, |f x| ≤ M) : -- The PDE on (0, ∞) × ℝ. (∀ t : ℝ, 0 < t → ∀ x : ℝ, ∃ ux : ℝ → ℝ, ∃ uxx : ℝ, (∀ y : ℝ, HasDerivAt (fun z => heatSolution f t z) (ux y) y) ∧ HasDerivAt ux uxx x ∧ HasDerivAt (fun s => heatSolution f s x) uxx t) ∧ -- Initial condition recovered as a one-sided limit at t = 0. (∀ x : ℝ, Filter.Tendsto (fun t : ℝ => heatSolution f t x) (nhdsWithin (0 : ℝ) (Set.Ioi 0)) (nhds (f x))) := f:ℝ → ℝhf_cont:Continuous fhf_bdd:∃ M, ∀ (x : ℝ), |f x| ≤ M⊢ (∀ (t : ℝ), 0 < t → ∀ (x : ℝ), ∃ ux uxx, (∀ (y : ℝ), HasDerivAt (fun z => heatSolution f t z) (ux y) y) ∧ HasDerivAt ux uxx x ∧ HasDerivAt (fun s => heatSolution f s x) uxx t) ∧ ∀ (x : ℝ), Filter.Tendsto (fun t => heatSolution f t x) (nhdsWithin 0 (Set.Ioi 0)) (nhds (f x)) All goals completed! 🐙
#4
How produced

Copied from a public accepted Lean Eval submission, repackaged into a commit-pinned workspace, then checked locally with `lake build Submission`, `lake env lean Submission.lean`, and a solver-owned forbidden-token scan.

Minkowski-Caratheodory theorem
mem_convexHull_finset_extremePoints_of_mem_compact_convex

Verso theorem preview

theorem declaration uses `sorry`mem_convexHull_finset_extremePoints_of_mem_compact_convex {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] {s : Set E} {x : E} (hscomp : IsCompact s) (hsconv : Convex ℝ s) (hx : x ∈ s) : ∃ t : Finset E, (↑t : Set E) ⊆ s.extremePoints ℝ ∧ t.card ≤ Module.finrank ℝ E + 1 ∧ x ∈ convexHull ℝ (↑t : Set E) := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:NormedSpace ℝ Einst✝:FiniteDimensional ℝ Es:Set Ex:Ehscomp:IsCompact shsconv:Convex ℝ shx:x ∈ s⊢ ∃ t, ↑t ⊆ extremePoints ℝ s ∧ t.card ≤ Module.finrank ℝ E + 1 ∧ x ∈ (convexHull ℝ) ↑t All goals completed! 🐙
#5
How produced

Copied from a public accepted Lean Eval submission, repackaged into a commit-pinned workspace, then checked locally with `lake build Submission`, `lake env lean Submission.lean`, and a solver-owned forbidden-token scan.

Oppenheim's inequality for Hadamard products
oppenheim_inequality

Verso theorem preview

theorem declaration uses `sorry`oppenheim_inequality {n : Type*} [Fintype n] [DecidableEq n] {A B : Matrix n n ℝ} (hA : A.PosSemidef) (hB : B.PosSemidef) : A.det * ∏ i, B i i ≤ (A ⊙ B).det := n:Type u_1inst✝¹:Fintype ninst✝:DecidableEq nA:Matrix n n ℝB:Matrix n n ℝhA:A.PosSemidefhB:B.PosSemidef⊢ A.det * ∏ i, B i i ≤ (A ⊙ B).det All goals completed! 🐙
#6
How produced

Copied from a public accepted Lean Eval submission, repackaged into a commit-pinned workspace, then checked locally with `lake build Submission`, `lake env lean Submission.lean`, and a solver-owned forbidden-token scan.

Catalan generating function via compositional inversion
substInv_X_sub_X_sq_eq_catalan

Verso theorem preview

theorem declaration uses `sorry`substInv_X_sub_X_sq_eq_catalan (n : ℕ) : haveI : Invertible (coeff 1 ((X : ℚ⟦X⟧) - X ^ 2)) := n:ℕ⊢ Invertible ((coeff 1) (X - X ^ 2)) n:ℕ⊢ Invertible 1; All goals completed! 🐙 coeff (n + 1) (substInv ((X : ℚ⟦X⟧) - X ^ 2)) = (Nat.choose (2 * n) n : ℚ) / (↑n + 1) := n:ℕ⊢ (coeff (n + 1)) (X - X ^ 2).substInv = ↑((2 * n).choose n) / (↑n + 1) All goals completed! 🐙
#7
How produced

Copied from a public accepted Lean Eval submission, repackaged into a commit-pinned workspace, then checked locally with `lake build Submission`, `lake env lean Submission.lean`, and a solver-owned forbidden-token scan.

First submissionJun 19, 2026
Last submissionJun 19, 2026
rishistyping7
22Humanize2 flame chase: GPT-5.6-sol + Claude Opus 57 solved
Galois groups of random integer polynomials and van der Waerden's Conjecture
annals_van_der_waerden_conjecture

Verso theorem preview

theorem declaration uses `sorry`theorem_1 (n : ℕ) (hn : 3 ≤ n) : (fun H ↦ (vanDerWaerdenConjecture.E n H : ℝ)) =O[atTop] (fun H ↦ (H ^ (n - 1) : ℝ)) := n:ℕhn:3 ≤ n⊢ (fun H => ↑(E n H)) =O[atTop] fun H => ↑H ^ (n - 1) All goals completed! 🐙
#1
On the Duffin-Schaeffer conjecture
annals_duffin_schaeffer_conjecture

Verso theorem preview

/-- Statement of Theorem 1: If for `ψ : ℕ → ℝ≥0`, the infinite series `∑ (ψ q * φ q) / q`, where `φ` is the Euler totient function, diverges, then the set `𝒜` defined above has Lebesgue measure `1`. -/ theorem declaration uses `sorry`theorem_1 (ψ : ℕ+ → ℝ≥0) (hdivergence : ¬ Summable fun q ↦ (ψ q * φ q) / q) : MeasurableSet (𝒜 ψ) ∧ volume (𝒜 ψ) = 1 := ψ:ℕ+ → ℝ≥0hdivergence:¬Summable fun q => ψ q * ↑(φ ↑q) / ↑↑q⊢ MeasurableSet (𝒜 ψ) ∧ volume (𝒜 ψ) = 1 All goals completed! 🐙
/-- Statement of Theorem 2(a): Let `ψ : ℕ → ℝ≥0`, `𝒦` and `ψ⋆` be as above. Then, if `∑ ψ⋆ (q)` converges, `𝒦` has Lebesgue measure `0`. -/ theorem declaration uses `sorry`theorem_2_a (ψ : ℕ+ → ℝ≥0) (hψ : ∑' q, ψ_star ψ q < ∞) : MeasurableSet (𝒦 ψ) ∧ volume (𝒦 ψ) = 0 := ψ:ℕ+ → ℝ≥0hψ:∑' (q : ℕ+), ψ_star ψ q < ∞⊢ MeasurableSet (𝒦 ψ) ∧ volume (𝒦 ψ) = 0 All goals completed! 🐙
/-- Statement of Theorem 2(b): Let `ψ : ℕ → ℝ≥0`, `𝒦` and `ψ⋆` be as above. Then, if `∑ ψ⋆ (q)` diverges, `𝒦` has Lebesgue measure `1`. -/ theorem declaration uses `sorry`theorem_2_b (ψ : ℕ+ → ℝ≥0) (hψ : ∑' q, ψ_star ψ q = ∞) : MeasurableSet (𝒦 ψ) ∧ volume (𝒦 ψ) = 1 := ψ:ℕ+ → ℝ≥0hψ:∑' (q : ℕ+), ψ_star ψ q = ∞⊢ MeasurableSet (𝒦 ψ) ∧ volume (𝒦 ψ) = 1 All goals completed! 🐙
/-- Statement of Corollary 3: For a function `ψ : ℕ → [0, 1/2]`, the set `𝒜` and the element `s` defined as above, the Hausdorff dimension of `𝒜` is the minimum of `s` and `1`. -/ theorem declaration uses `sorry`corollary_3 (ψ : ℕ+ → ℝ≥0) (hψ : ∀ n, ψ n ∈ Set.Icc 0 (1 / 2)) : dimH (𝒜 ψ) = min (s_inf ψ) 1 := ψ:ℕ+ → ℝ≥0hψ:∀ (n : ℕ+), ψ n ∈ Set.Icc 0 (1 / 2)⊢ dimH (𝒜 ψ) = ↑(min (s_inf ψ) 1) All goals completed! 🐙
#2
A reverse Minkowski theorem
annals_reverse_minkowski

Verso theorem preview

theorem declaration uses `sorry`theorem_1_2 (ℒ : Submodule ℤ ℝⁿ) [DiscreteTopology ℒ] (hℒ : IsZLattice ℝ ℒ) (h : ∀ ℒ' (_hℒℒ' : ℒ' ≤ ℒ) [DiscreteTopology ℒ'], determinant ℒ' ≥ 1) : let t : ℝ := 10 * (log n + 2) ρ (1 / t) ℒ ≤ 3 / 2 := n:ℕℒ:Submodule ℤ ℝⁿinst✝:DiscreteTopology ↥ℒhℒ:IsZLattice ℝ ℒh:∀ ℒ' ≤ ℒ, ∀ [inst : DiscreteTopology ↥ℒ'], determinant ℒ' ≥ 1⊢ let t := 10 * (log ↑n + 2); ρ (1 / t) ℒ ≤ 3 / 2 All goals completed! 🐙
#3
Algebraic integers with conjugates in a prescribed distribution
annals_algebraic_integers

Verso theorem preview

theorem declaration uses `sorry`theorem_1_1 : lambda_SSS < 1.89831 := ⊢ lambda_SSS < 1.89831 All goals completed! 🐙
#4
Hessian estimates for the sigma-2 equation in dimension four
annals_hessian_estimates

Verso theorem preview

theorem declaration uses `sorry`theorem_1_1 : ∃ C : ℝ≥0∞ → ℝ, ∀ (u : ℝ⁴ → ℝ) (_smooth : ContDiffOn ℝ ∞ u B₁(0)) (_bounded : ‖u‖_C¹(B₁(0)) < (∞ : ℝ≥0∞)) (_positive_branch : ∀ x ∈ B₁(0), (Δ u) x > 0) (_solution : ∀ x ∈ B₁(0), σ₂ (H u B₁(0) x) = 1), ‖H u B₁(0) 0‖_F ≤ C (‖u‖_C¹(B₁(0))) := ⊢ ∃ C, ∀ (u : ℝ⁴ → ℝ), ContDiffOn ℝ ∞ u B₁(0) → ‖u‖_C¹(B₁(0)) < ∞ → (∀ x ∈ B₁(0), Δ u x > 0) → (∀ x ∈ B₁(0), σ₂ (H u B₁(0) x) = 1) → ‖H u B₁(0) 0‖_F ≤ C ‖u‖_C¹(B₁(0)) All goals completed! 🐙
#5
Rational approximations to linear subspaces
annals_linear_subspaces

Verso theorem preview

theorem declaration uses `sorry`theorem_1 (hd : 2 ≤ d) (l : ℕ) (hl0 : 0 < l) (hld : l < d) (k : ℕ) (hk1 : 1 ≤ k) (hkl : k ≤ l) : (∀ x : Submodule ℝ ℝᵈ, finrank ℝ x = l → LinearSubspaces.diophantineExponent k x ≥ d / (k * (d - l))) ∧ (∃ x : Submodule ℝ ℝᵈ, finrank ℝ x = l ∧ LinearSubspaces.diophantineExponent k x = d / (k * (d - l))) := d:ℕhd:2 ≤ dl:ℕhl0:0 < lhld:l < dk:ℕhk1:1 ≤ khkl:k ≤ l⊢ (∀ (x : Submodule ℝ ℝᵈ), finrank ℝ ↥x = l → diophantineExponent k x ≥ ↑d / (↑k * (↑d - ↑l))) ∧ ∃ x, finrank ℝ ↥x = l ∧ diophantineExponent k x = ↑d / (↑k * (↑d - ↑l)) All goals completed! 🐙
#6
Singularity of random Bernoulli matrices
annals_random_bernoulli_matrices

Verso theorem preview

/-- Statement of Theorem A: For every `p ∈ (0, 1/2]` and `ε > 0` there exists `N, C > 0` such that for any `n ≥ N` and any `n × n` random matrix `B` with mutually independent `Bernoulli(p)` entries, `P(σ_min (B + sIIᵀ) ≤ t/√n) ≤ (1 - p + ε)ⁿ + Ct` for all `s ∈ [-1,0]` and `t > 0`. -/ theorem declaration uses `sorry`theorem_A {p : I} {ε : ℝ} (hp₀ : 0 < p) (hp₁ : (p : ℝ) ≤ 1 / 2) (hε : 0 < ε) : ∃ N > 0, ∃ C > 0, ∀ n ≥ N, ∀ (Ω : Type*) (_mΩ : MeasurableSpace Ω) (P : Measure Ω) (B : Ω → Matrix (Fin n) (Fin n) ℝ) (_B_indep : iIndepFun (fun x : Fin n × Fin n ↦ (B · x.1 x.2)) P) (_B_bernoulli : ∀ i j, HasLaw (B · i j) (bernoulliMeasure 1 0 p) P), ∀ s : ℝ, -1 ≤ s ∧ s ≤ 0 → ∀ t : ℝ, 0 < t → P.real {ω : Ω | σ_min (B ω + of (fun _ _ ↦ s)) ≤ t / √n} ≤ (1 - p + ε) ^ n + C * t := p:↑Iε:ℝhp₀:0 < php₁:↑p ≤ 1 / 2hε:0 < ε⊢ ∃ N > 0, ∃ C > 0, ∀ n ≥ N, ∀ (Ω : Type u_1) (_mΩ : MeasurableSpace Ω) (P : Measure Ω) (B : Ω → Matrix (Fin n) (Fin n) ℝ), iIndepFun (fun x x_1 => B x_1 x.1 x.2) P → (∀ (i j : Fin n), HasLaw (fun x => B x i j) Ber(1, 0, p) P) → ∀ (s : ℝ), -1 ≤ s ∧ s ≤ 0 → ∀ (t : ℝ), 0 < t → P.real {ω | σ_min (B ω + of fun x x_1 => s) ≤ t / √↑n} ≤ (1 - ↑p + ε) ^ n + C * t All goals completed! 🐙
/-- This (unnamed) corollary appears directly below Theorem A in the paper: For every `p ∈ (0, 1/2]` and any sequence `Bₙ` of `n × n` random matrices with mutually independent `Bernoulli(p)` entries we have that `P(Bₙ is singular) = (1 - p + oₙ(1))ⁿ`. -/ theorem declaration uses `sorry`corollary_1 {p : I} (hp₀ : 0 < p) (hp₁ : (p : ℝ) ≤ 1 / 2) {Ω : ℕ → Type*} [mΩ : ∀ n, MeasurableSpace (Ω n)] {P : (n : ℕ) → Measure (Ω n)} {B : (n : ℕ) → Ω n → Matrix (Fin n) (Fin n) ℝ} (B_indep : ∀ n, iIndepFun (fun x : Fin n × Fin n ↦ (B n · x.1 x.2)) (P n)) (B_bernoulli : ∀ n i j, HasLaw (B n · i j) (bernoulliMeasure 1 0 p) (P n)) : ∃ o : ℕ → ℝ, o =o[atTop] (1 : ℕ → ℝ) ∧ ∀ n > 0, (P n).real {ω | (B n ω).det = 0} = (1 - p + o n) ^ n := p:↑Ihp₀:0 < php₁:↑p ≤ 1 / 2Ω:ℕ → Type u_1mΩ:(n : ℕ) → MeasurableSpace (Ω n)P:(n : ℕ) → Measure (Ω n)B:(n : ℕ) → Ω n → Matrix (Fin n) (Fin n) ℝB_indep:∀ (n : ℕ), iIndepFun (fun x x_1 => B n x_1 x.1 x.2) (P n)B_bernoulli:∀ (n : ℕ) (i j : Fin n), HasLaw (fun x => B n x i j) Ber(1, 0, p) (P n)⊢ ∃ o, o =o[atTop] 1 ∧ ∀ n > 0, (P n).real {ω | (B n ω).det = 0} = (1 - ↑p + o n) ^ n All goals completed! 🐙
/-- This is the result stated in the paper's abstract: For any sequence `Mₙ` of `n × n` random matrices with mutually independent `Rademacher` entries we have that `P(Mₙ is singular) = (1/2 + oₙ(1))ⁿ`. -/ theorem declaration uses `sorry`corollary_2 {Ω : ℕ → Type*} (mΩ : ∀ n, MeasurableSpace (Ω n)) {P : (n : ℕ) → Measure (Ω n)} {M : (n : ℕ) → Ω n → Matrix (Fin n) (Fin n) ℝ} (M_indep : ∀ n, iIndepFun (fun x : Fin n × Fin n ↦ (M n · x.1 x.2)) (P n)) (M_rademacher : ∀ n i j, HasLaw (M n · i j) rademacherMeasure (P n)) : ∃ o : ℕ → ℝ, o =o[atTop] (1 : ℕ → ℝ) ∧ ∀ n > 0, (P n).real {ω | (M n ω).det = 0} = (1 / 2 + o n) ^ n := Ω:ℕ → Type u_1mΩ:(n : ℕ) → MeasurableSpace (Ω n)P:(n : ℕ) → Measure (Ω n)M:(n : ℕ) → Ω n → Matrix (Fin n) (Fin n) ℝM_indep:∀ (n : ℕ), iIndepFun (fun x x_1 => M n x_1 x.1 x.2) (P n)M_rademacher:∀ (n : ℕ) (i j : Fin n), HasLaw (fun x => M n x i j) rademacherMeasure (P n)⊢ ∃ o, o =o[atTop] 1 ∧ ∀ n > 0, (P n).real {ω | (M n ω).det = 0} = (1 / 2 + o n) ^ n All goals completed! 🐙
#7
First submissionAug 19, 2026
Last submissionAug 21, 2026
ZhengyangZhang067
23GPT-5.6 Sol7 solved
Shafarevich's relation-rank bound
shafarevich_relation_rank_bound

Verso theorem preview

theorem declaration uses `sorry`shafarevich_relation_rank_bound (F : Type) [Field F] [NumberField F] (p : ℕ) [Fact p.Prime] (_hpOdd : Odd p) : LeanEval.NumberTheory.H2Finite p (MaxUnramifiedProPGaloisGroup F p) ∧ (open Classical in relationRank p (MaxUnramifiedProPGaloisGroup F p) ≤ generatorRank (MaxUnramifiedProPGaloisGroup F p) + (NumberField.InfinitePlace.nrRealPlaces F + NumberField.InfinitePlace.nrComplexPlaces F - 1) + (if ∃ ζ : F, IsPrimitiveRoot ζ p then 1 else 0)) := F:Typeinst✝²:Field Finst✝¹:NumberField Fp:ℕinst✝:Fact (Nat.Prime p)_hpOdd:Odd p⊢ H2Finite p (MaxUnramifiedProPGaloisGroup F p) ∧ relationRank p (MaxUnramifiedProPGaloisGroup F p) ≤ generatorRank (MaxUnramifiedProPGaloisGroup F p) + (InfinitePlace.nrRealPlaces F + InfinitePlace.nrComplexPlaces F - 1) + if ∃ ζ, IsPrimitiveRoot ζ p then 1 else 0 All goals completed! 🐙
#1
Martinet's asymptotically-good totally real towers
martinet_totally_real_towers

Verso theorem preview

theorem declaration uses `sorry`exists_totallyReal_discr_le : ∃ C : ℝ, 0 < C ∧ ∀ N : ℕ, ∃ d : ℕ, N ≤ d ∧ ∃ (K : Type) (_ : Field K) (_ : NumberField K) (_ : NumberField.IsTotallyReal K), Module.finrank ℚ K = d ∧ |(NumberField.discr K : ℝ)| ≤ C ^ d := ⊢ ∃ C, 0 < C ∧ ∀ (N : ℕ), ∃ d, N ≤ d ∧ ∃ K x, ∃ (x_1 : NumberField K) (_ : IsTotallyReal K), Module.finrank ℚ K = d ∧ |↑(discr K)| ≤ C ^ d All goals completed! 🐙
#2
Furstenberg measure-preserving multiple recurrence
furstenberg_measure

Verso theorem preview

theorem declaration uses `sorry`furstenberg_measure_recurrence {Ω : Type*} [MeasurableSpace Ω] (μ : MeasureTheory.Measure Ω) [MeasureTheory.IsProbabilityMeasure μ] {T : Ω → Ω} (_hT : MeasureTheory.MeasurePreserving T μ μ) {A : Set Ω} (_hA : MeasurableSet A) (_h0 : 0 < μ A) (d : ℕ) (_hd : 1 ≤ d) : ∃ n : ℕ, 1 ≤ n ∧ 0 < μ (A ∩ ⋂ j ∈ Finset.Icc 1 d, T^[j * n] ⁻¹' A) := Ω:Type u_1inst✝¹:MeasurableSpace Ωμ:Measure Ωinst✝:IsProbabilityMeasure μT:Ω → Ω_hT:MeasurePreserving T μ μA:Set Ω_hA:MeasurableSet A_h0:0 < μ Ad:ℕ_hd:1 ≤ d⊢ ∃ n, 1 ≤ n ∧ 0 < μ (A ∩ ⋂ j ∈ Finset.Icc 1 d, T^[j * n] ⁻¹' A) All goals completed! 🐙
#3
How produced

Produced by gpt-5.6-Sol in Codex with user-directed autonomous implementation and review. The proof reuses the accepted arbitrary-rank ordered hypergraph-removal and finite Szemerédi machinery from the preceding public Szemerédi submission, then adds a 557-line benchmark-facing finite correspondence argument: a uniform dense-prefix endpoint, finite orbit-return averaging, countable witness extraction, and removal of the initial shift by measure preservation. Mathlib, Lean Pool, Tau Ceti, APAP, Formal Conjectures, and adjacent accepted submissions were surveyed before target selection. The proof and its detailed informal proof/Lean blueprint were independently audited; a pristine evaluator-style overlay passed a warnings-fatal 8,750-job build with 6.56 GB peak RSS.

Coherent cohomology of a proper scheme over ℚ is finite-dimensional
coherent_cohomology_finite_dimensional

Verso theorem preview

theorem declaration uses `sorry`coherent_cohomology_finite_dimensional (f : X ⟶ Spec (CommRingCat.of ℚ)) [IsProper f] [M.IsFiniteType] [M.IsQuasicoherent] (n : ℕ) : Module.Finite ℚ (ℚ ⊗[ℤ] M.sheaf.H n) := X:SchemeM:X.Modulesf:X ⟶ Spec ↧ℚinst✝²:IsProper finst✝¹:SheafOfModules.IsFiniteType Minst✝:SheafOfModules.IsQuasicoherent Mn:ℕ⊢ Module.Finite ℚ (ℚ ⊗[ℤ] Sheaf.H Scheme.Modules.sheaf n) All goals completed! 🐙
#4
How produced

Produced autonomously by GPT-5.6 Sol in Codex, directed by Vasily Ilin. The formalization run took about 26 hours and goal tracking reported 21,345,162 tokens.

Green–Tao theorem
green_tao

Verso theorem preview

theorem declaration uses `sorry`green_tao : LeanEval.NumberTheory.ContainsArbitraryAPs {p : ℕ | Nat.Prime p} := ⊢ ContainsArbitraryAPs {p | Nat.Prime p} All goals completed! 🐙
#5
How produced

Produced autonomously by gpt-5.6-Sol in Codex, with human direction. Builds on Mathlib and LeanEval's transference/majorant framework, adding a source-full ordered hypergraph-removal assembly. The submitted source contains no sorry, admit, added axioms, set_option, or native_decide.

Szemerédi's theorem
szemeredi

Verso theorem preview

theorem declaration uses `sorry`szemeredi (A : Set ℕ) (h : 0 < upperDensity A) : LeanEval.Combinatorics.ContainsArbitraryAPs A := A:Set ℕh:0 < upperDensity A⊢ ContainsArbitraryAPs A All goals completed! 🐙
#6
How produced

Produced by OpenAI Codex gpt-5.6-Sol with user-directed multi-agent scouting and lean-lsp-mcp verification. Reuses the submitter's comparator-accepted Green–Tao ordered hypergraph-removal development; this submission adds the upper-density/limsup bridge, collision-free finite-prefix embedding into ZMod, off-diagonal extraction, short-interval lift, and final Szemerédi assembly. The proof was fully rebuilt, warning-cleaned, source-audited, and documented in one agent session.

Cayley graph connected iff generators generate the group
mulCayley_connected_iff_closure_eq_top

Verso theorem preview

theorem declaration uses `sorry`mulCayley_connected_iff_closure_eq_top {G : Type*} [Group G] (S : Set G) : (SimpleGraph.mulCayley S).Connected ↔ Subgroup.closure S = ⊤ := G:Type u_1inst✝:Group GS:Set G⊢ (SimpleGraph.mulCayley S).Connected ↔ Subgroup.closure S = ⊤ All goals completed! 🐙
#7
How produced

Produced autonomously by gpt-5.6-Sol in a user-directed Codex lean-eval session. The proof characterizes the identity component of the multiplicative Cayley graph as the subgroup closure: walks preserve closure membership, while reachability is closed under generators, multiplication, and inverses via left-translation graph homomorphisms. Verified warning-free with Lean 4.32.2 and accepted end-to-end by comparator, the Lean kernel, and nanoda.

First submissionJul 26, 2026
Last submissionSep 8, 2026
Vilin975n-yamaguchi-07292
24trureturing7 solved
The Hopf problem: a complex structure on the 6-sphere
hopf_s6_complex_structure

Verso theorem preview

/-- **Hole 1 (data).** An atlas of charts from the 6-sphere — the unit sphere in `ℝ⁷`, with its subspace topology — into `ℂ³`, taken as the plain function type `Fin 3 → ℂ`: all norms on a finite-dimensional space are equivalent, so the choice of model norm is immaterial to the statement. -/ instance declaration uses `sorry`instChartedSpaceS6 : ChartedSpace (Fin 3 → ℂ) (Metric.sphere (0 : EuclideanSpace ℝ (Fin 7)) 1) := sorry
/-- **Hole 2 (proof).** The atlas of hole 1 is holomorphic: its transition functions are `ℂ`-analytic on their open domains. -/ instance declaration uses `sorry`instIsManifoldS6 : IsManifold 𝓘(ℂ, Fin 3 → ℂ) ω (Metric.sphere (0 : EuclideanSpace ℝ (Fin 7)) 1) := sorry
#1
How produced

The trureturing formalization campaign (Claude orchestration; Codex CLI implementation; independent Codex CLI and Claude review). The mathematical content is reused, not original: both holes are obtained from the public, sorry-free Lean Pool theorem `Mathoverflow1973.SixSphereComplexAtlas.exists_complex_analytic_atlas` (`LeanPool/HopfProblem`, Apache-2.0, by Boris Alexeev, formalizing the construction claimed by Alpöge 2026), imported from the benchmark-pinned lean-pool `e9d53e9cbcff8dfd0cc816ba94db7a26b082929f` as allowed for solutions. This submission adds only a model-space transport from `EuclideanSpace ℂ (Fin 3)` to `Fin 3 → ℂ` along `EuclideanSpace.equiv (Fin 3) ℂ`; the generic transport code is adapted (with attribution) from Lean Pool `LeanPool/HopfProblem/Threefold/SpecialPeriods7.lean`. Locally (Lean 4.35.0-rc3, Mathlib 5e0c4e5239cb0a2d86d68a884bf52cfd963fce22) Submission, the trusted Solution and Challenge compile and both holes print only propext, Classical.choice and Quot.sound. Official comparator and nanoda acceptance are requested, not presumed. No measured monetary-cost claim is made.

Bounded gaps between primes
zhang_bounded_prime_gaps

Verso theorem preview

theorem declaration uses `sorry`zhang_bounded_prime_gaps : ∀ n : ℕ, ∃ p q : ℕ, n ≤ p ∧ p.Prime ∧ q.Prime ∧ p < q ∧ q - p ≤ 246 := ⊢ ∀ (n : ℕ), ∃ p q, n ≤ p ∧ Nat.Prime p ∧ Nat.Prime q ∧ p < q ∧ q - p ≤ 246 All goals completed! 🐙
#2
How produced

The trureturing formalization campaign (Claude orchestration; Codex CLI implementation; independent Codex CLI and Claude review). The mathematics is reused, not original: the bound 246 is `bombieriVinogradov_implies_prime_gap_le_246` from AxiomMath/PrimeGapsLib (1faa7b14), made unconditional by the Bombieri–Vinogradov theorem of kimihiro64/bombieri-vinogradov (7a174830), with dependencies kimihiro64/PrimeNumberTheoremAnd (0f15a38c) and kimihiro64/Robin1984 (bfa72aec), all Apache-2.0. These are vendored under `Submission/` with renamed modules, Lean 4.35 / Mathlib API ports, per-file provenance and modification notices (see NOTICE.md); the PrimeGapsLib numerical certificate is embedded byte-for-byte as a Lean string and is still checked by the kernel. This submission adds only the vendoring, the ports and the final bridge. Locally, in a clean copy of the generated workspace containing only the submitted .lean files, all 1,282 Submission modules, Submission, the trusted Solution and Challenge compile with `-DautoImplicit=false` (Lean 4.35.0-rc3, Mathlib 5e0c4e5239cb0a2d86d68a884bf52cfd963fce22), and the hole prints only propext, Classical.choice and Quot.sound. Serial local compile time of the closure is about 70 minutes. Official comparator and nanoda acceptance are requested, not presumed. No measured monetary-cost claim is made.

Generalized topological Poincaré conjecture in dimensions ≥ 5 (Smale)
poincare_high_dim_topological

Verso theorem preview

theorem declaration uses `sorry`poincare_high_dim_topological {n : ℕ} (_h5 : 5 ≤ n) {M : Type*} [TopologicalSpace M] [T2Space M] [ChartedSpace (EuclideanSpace ℝ (Fin n)) M] (_h : M ≃ₕ sphere (0 : EuclideanSpace ℝ (Fin (n + 1))) 1) : Nonempty (M ≃ₜ sphere (0 : EuclideanSpace ℝ (Fin (n + 1))) 1) := n:ℕ_h5:5 ≤ nM:Type u_1inst✝²:TopologicalSpace Minst✝¹:T2Space Minst✝:ChartedSpace (EuclideanSpace ℝ (Fin n)) M_h:M ≃ₕ ↑(sphere 0 1)⊢ Nonempty (M ≃ₜ ↑(sphere 0 1)) All goals completed! 🐙
#3
How produced

Identity correction: this submission supersedes issue #1967 for scoring under the canonical project name `trureturing`. The exact source commit and proof are unchanged. The earlier issue accidentally declared `trureturning`; its already-running workflow freezes that old value, so editing the issue alone cannot correct the recorded identity. Please treat the two issues as the same proof with corrected metadata, not independent mathematical contributions. The trureturing formalization campaign. Human direction selected the benchmark, submission identity and public-source reuse policy. Codex performed source-closure packaging, import remapping and local Lean verification. This submission reuses the complete public Apache-2.0 formalization of `DifferentialGeometry.Topology.poincare_high_dim_topological` from https://github.com/qinz1yang/differential-geometry at commit `788efe97894474c032de6dfb1289d515f613d15a`; original full-proof authorship and new mathematical discovery are not claimed. The 237-module reachable closure is placed under `Submission/DifferentialGeometry/`, preserving original namespaces, proof bodies and headers while prefixing local imports. The root proof applies the existing theorem to the exact official revision-1 telescope. The source snapshot contains exactly one workspace, for `poincare_high_dim_topological`. The official Challenge, Solution, WorkspaceTest, configuration, toolchain and dependency declarations are unchanged. The candidate compiled with Lean v4.35.0-rc3 and Mathlib `5e0c4e5239cb0a2d86d68a884bf52cfd963fce22`; `lake build Submission` and `lake build Solution` passed. The theorem's printed transitive axiom closure contains only `propext`, `Classical.choice` and `Quot.sound`. All 240 overlaid Lean files were byte-compared against the locally verified workspace. Full upstream LICENSE, NOTICE and source provenance are additionally retained as comments in `Submission/Attribution/UpstreamLicense.lean` so the evaluated source-only overlay preserves them. No additional Lake dependency is requested. Local compilation is not an organizer acceptance claim. Local `lake test` could not launch because comparator/Nanoda are not installed on this host; official comparator and mandatory Nanoda verification are requested. This is an additional total-only submission; earlier accepted results by other teams are acknowledged. No measured monetary-cost or independent GPT Pro review claim is made.

Klartag's construction of lattice sphere packings
klartag_packing

Verso theorem preview

theorem declaration uses `sorry`klartag_packing : ∃ c : ℝ, 0 < c ∧ ∀ n : ℕ, let V := EuclideanSpace ℝ (Fin (n + 1)) ∃ φ : V →ₗ[ℝ] V, let E := φ '' Metric.ball (0 : V) 1 (MeasureTheory.volume E : EReal) = c * n ^ 2 ∧ {v ∈ E | ∀ i, v i ∈ Set.range ((↑) : ℤ → ℝ)} = {0} := ⊢ ∃ c, 0 < c ∧ ∀ (n : ℕ), let V := EuclideanSpace ℝ (Fin (n + 1)); ∃ φ, let E := ⇑φ '' Metric.ball 0 1; ↑(MeasureTheory.volume E) = ↑c * ↑n ^ 2 ∧ {v | v ∈ E ∧ ∀ (i : Fin (n + 1)), v.ofLp i ∈ Set.range Int.cast} = {0} All goals completed! 🐙
#4
How produced

This is a compatibility port of the complete Klartag lattice-packing proof from mlgraham/lean-eval-klartag-submission at immutable commit 270b3358a135f64a6688636660c07772e8db0173 (Apache-2.0): https://github.com/mlgraham/lean-eval-klartag-submission/tree/270b3358a135f64a6688636660c07772e8db0173 . As described in the original submission #1720, the original proof was produced with Claude Code under human direction. The full mathematical construction and proof are reused and attributed to that source; this campaign does not claim original mathematics. The trureturing campaign uses Codex coordination, Codex CLI compatibility implementation, and independent Codex CLI review. The port adapts Gaussian law/measurability interfaces, algebraic structure transparency and matrix equivalences, probability pushforward instances, and actual compiler/linter compatibility to the official fixed environment: Lean 4.35.0-rc3, Mathlib 5e0c4e5239cb0a2d86d68a884bf52cfd963fce22, and lean-pool e9d53e9cbcff8dfd0cc816ba94db7a26b082929f. The exact final benchmark statement is preserved, including one positive constant for all natural dimensions, exact ellipsoid volume c*n^2, and the integer-point conclusion. The source snapshot contains only this workspace and preserves the original license and attribution. Local validation at the official fixed pins completed successfully: the full 9137-job Submission build exited 0 with no errors or warnings. Fresh Solution and protected Challenge checks exited 0; the Challenge remains the unchanged benchmark sorry template and is not imported by the proof audit. The external audit imports the fresh Solution and checks both `Submission.klartag_packing` and global `klartag_packing`, each depending only on `propext`, `Classical.choice`, and `Quot.sound`. The source candidate was frozen after those checks and independently reviewed at the exact submitted commit before official intake. Official comparator/nanoda acceptance is requested, not presumed. Historical acceptance of the donor proof does not establish acceptance of this port. No measured monetary-cost claim is made.

Szemerédi's theorem
szemeredi

Verso theorem preview

theorem declaration uses `sorry`szemeredi (A : Set ℕ) (h : 0 < upperDensity A) : LeanEval.Combinatorics.ContainsArbitraryAPs A := A:Set ℕh:0 < upperDensity A⊢ ContainsArbitraryAPs A All goals completed! 🐙
#5
How produced

The trureturing formalization campaign (Claude orchestration; Codex CLI implementation; independent Codex CLI and Claude review). The core mathematics is reused, not original: Szemerédi's theorem in finite form (`Combinatorics.ArithmeticProgression.exists_of_density_nat_atTop`) comes from Gabriel Dahia's density Hales–Jewett formalization (https://github.com/gdahia/densityhalesjewett), as packaged in Lean Pool `LeanPool/DensityHalesJewett` at lean-pool `5e0b39aee56fe9e23bae9bed852a42fef9260b92` (Apache-2.0). Because that project is newer than the benchmark-pinned lean-pool, its 14 files are vendored under `Submission/DHJ/` (module renames, one provenance line per file, and explicit binders `θ κ` added to one `variable` line in `Subspace.lean` so the code builds under the workspace's `autoImplicit = false`; see NOTICE.md). This submission adds only the bridge from the finite statement to the benchmark's positive-upper-density formulation. Locally (Lean 4.35.0-rc3, Mathlib 5e0c4e5239cb0a2d86d68a884bf52cfd963fce22) all Submission files, the trusted Solution and Challenge compile with `-DautoImplicit=false`, and `szemeredi` prints only propext, Classical.choice and Quot.sound. This resubmission fixes the build failure of #1966. Official comparator and nanoda acceptance are requested, not presumed. No measured monetary-cost claim is made.

Thresholds versus fractional expectation-thresholds
annals_fractional_expectation_thresholds

Verso theorem preview

/-- The constant `K` in Theorem 1.1. -/ noncomputable def declaration uses `sorry`K : ℝ := sorry
/-- Statement of Theorem 1.1: There exists a universal constant `K` such that for any finite set `X` and any increasing collection of sets `𝓕` such that `l(𝓕)` is at least `2`, `p_c(𝓕) ≤ K * q_f(𝓕) * log l(𝓕)`. Note: The assumption that `l(𝓕)` is at least `2` is not explicitly in the paper but is needed because if `l(𝓕) = 1` then `Real.log (l 𝓕) = 0`, but `p_c 𝓕 ∈ (0,1)` (so the inequality clearly cannot hold). -/ theorem declaration uses `sorry`theorem_1_1 (X : Type*) [Fintype X] (𝓕 : Set (Set X)) (h𝓕 : IsUpperSet 𝓕) (hl𝓕 : 2 ≤ l 𝓕) : p_c 𝓕 ≤ K * q_f 𝓕 * Real.log (l 𝓕) := X:Type u_1inst✝:Fintype X𝓕:Set (Set X)h𝓕:IsUpperSet 𝓕hl𝓕:2 ≤ l 𝓕⊢ ↑(p_c 𝓕) ≤ K * ↑(q_f 𝓕) * Real.log ↑(l 𝓕) All goals completed! 🐙
#6
How produced

The trureturing formalization campaign (Claude orchestration; Codex CLI implementation; independent Codex CLI and Claude review). The core mathematics is reused, not original: the stronger Park–Pham (Kahn–Kalai) bound is taken from the public, sorry-free Lean Pool theorem `KahnKalai.park_pham_bound` (`LeanPool/KahnKalai`, Apache-2.0, by Dan Clemens Posch, upstream https://github.com/dcposch/kahn-kalai-lean, following arXiv:2303.02144), imported from the benchmark-pinned lean-pool `e9d53e9cbcff8dfd0cc816ba94db7a26b082929f` as allowed for solutions. This submission adds the transport to the benchmark statement of Frankston–Kahn–Narayanan–Park (universe change to `Fin n`, minimal elements and the bound by `l`, `setBernoulli` = explicit product measure, monotonicity of the Bernoulli measure of an upper family, comparison of `p_c` with the pool threshold, integral covers as fractional covers, log₂→ln with `K = 100000 / log 2`). Locally (Lean 4.35.0-rc3, Mathlib 5e0c4e5239cb0a2d86d68a884bf52cfd963fce22) Submission, the trusted Solution and Challenge compile, and `theorem_1_1` and `K` print only propext, Classical.choice and Quot.sound. Official comparator and nanoda acceptance are requested, not presumed. No measured monetary-cost claim is made.

A counterexample to the unit conjecture for group rings
annals_unit_conjecture

Verso theorem preview

theorem declaration uses `sorry`theorem_A : (∀ g : UnitConjecture.P, ∀ n ≠ 0, g ^ n = 1 → g = 1) ∧ IsUnit UnitConjecture.u ∧ ¬ ∃ g : UnitConjecture.P, UnitConjecture.u = g := ⊢ (∀ (g : P) (n : ℕ), n ≠ 0 → g ^ n = 1 → g = 1) ∧ IsUnit u ∧ ¬∃ g, u = (MonoidAlgebra.of (ZMod 2) P) g All goals completed! 🐙
#7
How produced

Resubmission under the corrected declared model name `trureturing`: the Lean sources are byte-for-byte identical to commit 92adfe225bb26dfed06f5ba77d9abbb7f680733f, already accepted as #1932 under the misspelled name `trureturning`; only a README note was added. The trureturing formalization campaign. Human direction selected the benchmark, campaign objective and submission identity; mathematical proof implementation used Codex CLI. Independent mathematical/source review passed with two Codex CLI seats and one GPT-6 Pro seat through the chrono-500 pool; the CLI tests seat freshly recompiled all seven candidate modules and the untouched official Solution. This is an attributed formalization of Giles Gardam's known counterexample, not a claim of a new mathematical counterexample. It builds on Gardam's paper (arXiv:2102.11818v2, sections 3.1–3.2) and pinned Mathlib APIs. The proof supplies a faithful two-sided normal-form equivalence for the exact PresentedGroup, torsion-freeness, explicit two-sided inverse identities, and group-ring support and transport arguments. It locally compiled with the benchmark's Lean 4.35.0-rc3 / Mathlib 5e0c4e5239cb0a2d86d68a884bf52cfd963fce22 pins, with only propext, Classical.choice and Quot.sound in the printed transitive axiom closures. No manual human proof edits are reported. Allowed LeanPool Polylean related machinery was discovered separately after this candidate was produced; it is not imported by the submitted proof. Official comparator and nanoda acceptance are requested and not presumed from local compilation. No measured monetary-cost claim is made.

First submissionOct 5, 2026
Last submissionOct 5, 2026
AlyciaBHZ7
25Opus-56 solved
Existence of a 64-dim irreducible g₂-representation with 14 tensor-square isotypic components
g2_irrep_tensor_square_decomp

Verso theorem preview

theorem declaration uses `sorry`g2_irrep_tensor_square_decomp : ∃ (V : Type) (_ : AddCommGroup V) (_ : Module ℂ V) (_ : LieRingModule (LieAlgebra.g₂ ℂ) V) (_ : LieModule ℂ (LieAlgebra.g₂ ℂ) V), Module.finrank ℂ V = 64 ∧ LieModule.IsIrreducible ℂ (LieAlgebra.g₂ ℂ) V ∧ (isotypicComponents (UniversalEnvelopingAlgebra ℂ (LieAlgebra.g₂ ℂ)) (V ⊗[ℂ] V)).ncard = 14 := ⊢ ∃ V x x_1 x_2, ∃ (x_3 : LieModule ℂ (LieAlgebra.g₂ ℂ) V), Module.finrank ℂ V = 64 ∧ LieModule.IsIrreducible ℂ (LieAlgebra.g₂ ℂ) V ∧ (isotypicComponents (UniversalEnvelopingAlgebra ℂ (LieAlgebra.g₂ ℂ)) (V ⊗[ℂ] V)).ncard = 14 All goals completed! 🐙
#1
How produced

Produced with Claude Code (Opus 5) driving a fleet of parallel subagents, from a single instruction to solve an unsolved benchmark problem end to end. No human wrote any Lean. The problem needs a 64-dimensional irreducible representation of the exceptional Lie algebra `g₂` whose tensor square has exactly 14 isotypic components. Mathlib defines `LieAlgebra.g₂` by the Serre presentation and proves essentially nothing about it — not that it is simple, not that it is finite-dimensional, and none of the highest-weight theory the statement needs. So the bulk of the work was filling in the representation theory. Route. Realise a concrete split `G₂` via `RootPairing.GeckConstruction`, prove it is `IsKilling` and simple, and surject `g₂ ℂ` onto it using the universal property of the Serre presentation (the easy half of Serre's theorem — no isomorphism is needed, since the challenge only asks for *some* module). Then build the missing theory: Weyl's theorem on complete reducibility for a general semisimple Lie algebra, the Casimir scalar `(λ, λ+2ρ)`, character theory with `ch(M⊗N) = ch M · ch N`, and Freudenthal's multiplicity formula. Freudenthal pins the character of a simple module from its highest weight; the fourteen characters are tabulated and verified by kernel computation (702 recursion checks), as is the tensor-square identity. Finally walk the chain `𝔤 → 𝔤⊗𝔤 ⊇ L(2ω₁) → L(2ω₁)⊗𝔤 ⊇ V=L(ω₁+ω₂)` with `dim V = 64`, decompose `V⊗V`, and transport the count back along the surjection. Two things were harder than expected and are worth recording. The positivity lemma that Freudenthal's uniqueness is normally stated with is *false* over the cone `λ − Q⁺`: the coefficient `‖λ+ρ‖² − ‖μ+ρ‖²` genuinely vanishes at lattice points there — the cleanest witness is `λ = 0`, `μ = −αᵢ`, where it vanishes precisely because `⟨ρ, αᵢ^∨⟩ = 1`. Restricting to the double cone does not fix it. So the recursion does not determine the multiplicity everywhere below `λ`, and the usual textbook argument does not go through as written. The resolution is to run the induction on the *tabulated* weight set `wtsOf (chrOf λ)`, where the verified recursion check is exactly what is needed, and move the entire burden onto showing that nothing outside it is a weight. That is done with no ambient support at all: if `p` is a weight of a highest-weight module then so is every reflection `s_α p` (Weyl-stability of the weight set), and every one of them lies in `λ − Q⁺`. Those seven linear constraints alone confine `p` to `[-10,10] × [-6,6]`, and a chunked `decide` over that box shows any such `p` is tabulated. Numerically the containment is an equality: the fourteen sets have exactly the fourteen character sizes. Only the six positive-root reflections are needed; three do not suffice. Freudenthal's formula itself turned out not to need the `sl₂`-string decomposition at all: `trace(A∘B) = trace(B∘A)` for the raise/lower maps between *different* weight spaces, plus one-dimensionality of root spaces, telescopes the hard half of the classical proof into about sixty lines. Engineering note. Elaboration against the Geck construction is expensive enough that `rw` routinely exhausts the default heartbeat budget — `RootPairing.root` is a bundled embedding, so a rewrite pattern is `DFunLike.coe`-headed and `kabstract` runs `isDefEq` against every other such subterm, unfolding Geck's matrices each time. Since the benchmark forbids `set_option`, the codebase is shaped around composing fully-applied lemmas with `Eq.trans`/`congrArg` instead, and splitting proofs into separate declarations to get per-declaration budgets. Constraints honoured throughout: no `sorry`, no `set_option`, no `native_decide`, and only `propext`, `Classical.choice`, `Quot.sound` in `#print axioms`. Tau Ceti (Apache-2.0) is vendored under `Submission/TauCeti/` for its highest-weight and Serre-presentation API, ported back from Lean v4.34.0-rc1 to v4.32.2.

Morley's categoricity theorem
morley_categoricity_theorem

Verso theorem preview

theorem declaration uses `sorry`morley_categoricity_theorem (L : FirstOrder.Language.{0, 0}) (hL : L.card ≤ ℵ₀) (T : L.Theory) (hT : T.IsComplete) (hInf : ∀ M : FirstOrder.Language.Theory.ModelType.{0, 0, 0} T, Infinite M) {κ : Cardinal.{0}} (hκ : ℵ₀ < κ) (hcat : κ.Categorical T) {μ : Cardinal.{0}} (hμ : ℵ₀ < μ) : μ.Categorical T := L:FirstOrder.LanguagehL:L.card ≤ ℵ₀T:L.TheoryhT:T.IsCompletehInf:∀ (M : T.ModelType), Infinite ↑Mκ:Cardinal.{0}hκ:ℵ₀ < κhcat:κ.Categorical Tμ:Cardinal.{0}hμ:ℵ₀ < μ⊢ μ.Categorical T All goals completed! 🐙
#2
How produced

Produced by Claude Opus 5 in Claude Code, user-directed, with ~20 parallel subagents (one per chapter) and lean-lsp-mcp for goal-directed iteration. Solves morley_categoricity_theorem. Morley's categoricity theorem has not previously been formalized in any proof assistant. 17,737 lines across 44 files. Mathlib gaps filled, all original: infinite Ramsey (Mathlib has only Hindman and Hales-Jewett); order indiscernibles; the OMITTING TYPES theorem (proved via Baire category on the Stone space rather than a Henkin construction -- Mathlib routes compactness through ultraproducts and has no term model, but already proves CompleteType compact, totally separated AND Baire); omega-stability and the binary-tree/Cantor-Bendixson characterisation; saturated models with transfinite back-and-forth uniqueness; prime and atomic models over ARBITRARY parameter sets; Ehrenfeucht-Mostowski models with their type-counting bound; MORLEY RANK and degree; STRONGLY MINIMAL SETS with the EXCHANGE LEMMA, algebraic closure, pregeometry and dimension; VAUGHT'S TWO-CARDINAL THEOREM; two-cardinal transfer from omega-stability; and EXISTENCE OF SATURATED ELEMENTARY EXTENSIONS (Mathlib contains no occurrence of "saturat" at all). Prior work reused with attribution: 2,673 of the 17,737 lines (Submission/Morley/Port/) are a verbatim copy of https://github.com/NoneMore/MorleyCategoricityTheorem by NoneMore, Apache 2.0, which is pinned to the identical Lean v4.32.2 / Mathlib 905b95818e, so only import paths were rewritten. That project supplies elementary chains, complete types, isolated types, IsOmegaStable and DefinablyFull; its blueprint is 23/67 statements complete, all in sections 1-2, and everything from section 3 onward (few-type models, Vaughtian pairs, two-cardinal transfer, strong minimality, Baldwin-Lachlan) is original here. Every ported file carries a header naming source repo, upstream path and licence. Seven substantive errors in the human-authored proof plan were caught and corrected by the verification process, each recorded in the git history: the indiscernibility statement is vacuous without injectivity; atomic implies prime is FALSE without countability (uncountable DLO); splittings of abelian extensions are obstructed by H^2, not H^1; the EM type-counting bound is false for general linear orders (DLO with index the reals); a tower invariant was unmaintainable at limit stages; a stated prime-model conclusion was vacuous without tying the model back by an elementary embedding; and DefinablyFullSaturation is outright FALSE, with an explicit counterexample. Verification: .lake/build deleted and rebuilt from scratch (8,704 jobs, all green); #print axioms morley_categoricity_theorem via import Solution (the trusted bridge, not our own module) gives exactly [propext, Classical.choice, Quot.sound]; strict scan finds no sorry/admit/set_option/native_decide/added axioms in Submission.lean or anywhere under Submission/; Challenge.lean, Solution.lean and config.json byte-identical to the generated originals.

Connective constant of the honeycomb lattice
honeycomb_connective_constant

Verso theorem preview

theorem declaration uses `sorry`honeycomb_connective_constant : Tendsto (fun n ↦ (LeanEval.Combinatorics.HoneycombConnectiveConstant.walkCount n : ℝ) ^ (1 / n : ℝ)) atTop (nhds (Real.sqrt (2 + Real.sqrt 2))) := ⊢ Tendsto (fun n => ↑(walkCount n) ^ (1 / ↑n)) atTop (𝓝 √(2 + √2)) All goals completed! 🐙
#3
How produced

Claude Opus 5 in Claude Code, user-directed, orchestrating parallel subagents in isolated build workspaces sharing one pre-built Mathlib, with lean-lsp-mcp. Duminil-Copin–Smirnov: the hexagonal-lattice self-avoiding-walk connective constant is `√(2+√2)`. Five parallel agents swept all 61 unsolved problems for statement loopholes and prior art. This was the only one self-contained, discrete, and free of missing prerequisite theories; scouting found **no prior art in any proof assistant** — no self-avoiding walks, connective constant, or parafermionic observable anywhere in Lean. Builds on ~4,500 sorry-free lines of scaffolding (walks, Fekete growth, the radius bridge, mid-edge geometry, the complex embedding, the contour identity, reflection symmetry, analytic bounds) carried over from an earlier session of the same submitter in the same repo, with its informal proof and blueprint. New here: - **Parafermionic local identity** (1842 lines): walks at a vertex are partitioned into pairs (reverse the walk after its visit to `v`, transported through a trace permutation) and triples (prolong through `v` two ways), via `Finset.sum_involution` and a fiberwise 2-to-1 bijection, at spin `5/8`. - **Strip identity** `cos(3π/8)·A + B + cos(π/4)·E = 1`, from the contour identity plus the four boundary windings `0, 2, -2, ±3` (1761 lines: `windingTurns ≡ 2·direction + 3(n+1) (mod 6)` combinatorially, plus explicit return paths outside the strip, proved simple by an ascending clock). - **Lower bound** (1884 lines): a contradiction argument avoiding the paper's case split — sloping-boundary families are disjoint across heights, so summability alone forces `E(T)=0`; a surgery on walks reaching the far side gives `B(T) ≤ B(T+1) + C·B(T+1)²`, hence `B(T) ≳ 1/T`. - **Upper bound** (3066 lines): Hammersley–Welsh at the level of direction words, via a height function changing by exactly `±1` per step, turning "bridge of width T" into "walk from height 0 to 2T-1 in a band". - **Discrete Hopf Umlaufsatz for the hexagonal lattice** (~7500 lines): face parity by an upward vertical ray, generic because face centres have real coordinate `≡1 (mod 3)` and vertices `≡0` or `≡2`; cyclic turning is `6×` a tangent-crossing count with no planarity input; the base point normalises to a vertex of maximal real coordinate where the escape is one step; the parity of the face *left* of a directed step is constant along the walk, recovering the orientation; the mask difference is the Euler characteristic by inclusion–exclusion; and the region is connected and hole-free, the latter by an extremal-face induction using a winding parity for closed paths of faces. 29,348 lines across 40 modules, of which 5,467 are a vendored Jordan-curve development (Apache-2.0, `mccorvie/classification-of-surfaces`, provenance in each module docstring); the proof ultimately goes through the shelling calculus and uses only its finiteness lemma. Method note: every load-bearing statement was validated by exhaustive enumeration in a Python mirror of the Lean definitions before formalising (`blueprint/*.py`; results in `blueprint/Validation.md`). This caught a lemma that was **false as written** (loop reversal without an orientation hypothesis: 12 of 60 loops), showed the local identity needs a domain with connected complement, refuted the naive ear-clipping route with explicit counterexamples, and confirmed `n₊-n₋` is `+6` for *both* orientations so the sign must come from the escape data. Verified from a pristine clone at the submitted commit: builds in ~2 min at 9.3 GB peak RSS, only warning the trusted `Challenge.lean` sorry; `#print axioms` on both the Solution and Submission forms gives `[propext, Classical.choice, Quot.sound]`; no sorry/admit/axiom/set_option/native_decide; trusted files byte-identical to upstream.

Ado–Iwasawa theorem over an arbitrary field
adoIwasawa

Verso theorem preview

theorem declaration uses `sorry`adoIwasawa [FiniteDimensional K L] : ∃ (V : Type u) (_ : AddCommGroup V) (_ : Module K V) (_ : FiniteDimensional K V) (ρ : L →ₗ⁅K⁆ Module.End K V), Function.Injective ρ := K:Type uL:Type uinst✝³:Field Kinst✝²:LieRing Linst✝¹:LieAlgebra K Linst✝:FiniteDimensional K L⊢ ∃ V x x_1, ∃ (_ : FiniteDimensional K V), ∃ ρ, Function.Injective ⇑ρ All goals completed! 🐙
#4
How produced

Produced by Claude Opus 5 in Claude Code, user-directed, with heavy use of parallel subagents and lean-lsp-mcp. Solves `adoIwasawa` (Ado's theorem over an arbitrary field), which strictly subsumes `adoCharZero` (accepted earlier today, issue #945). The positive-characteristic case required building, from scratch, the **Poincaré–Birkhoff–Witt theorem**, which did not exist in Lean 4 anywhere: not in Mathlib (`docs/1000.yaml:2123` lists it with no `decl:`, and `Algebra/Lie/Free.lean:44` and `Algebra/Lie/SerreConstruction.lean:46` both record in prose that they are blocked on it), not in any Mathlib PR (#36936 is categorical PBW for monads, a four-`sorry` draft), not in `Komyyy/ado` (characteristic zero by design, and it deliberately avoids PBW), not in Lean Pool or Tau Ceti, and not in GitHub code search. Restricted Lie algebras are likewise absent from Lean 4, so the textbook Strade–Farnsteiner route (restricted enveloping algebra, restricted PBW, p-envelope) was replaced by an argument that stays inside the PBW module. New sorry-free, axiom-clean theory (~4000 lines): the PBW module on `Poly K n = (Fin n →₀ ℕ) →₀ K` via Humphreys' recursion, made a structural recursion by a fuel parameter; clauses (A) and (B); the Lie relation (C), whose aligned case is true by construction and whose general case closes by the Jacobi identity; `U(L)` acting on the module; `ι : L → U(L)` is injective; unitriangular families are linearly independent and span; the spanning half of PBW by a straightening lemma; `pbwBasis : Module.Basis (Mon n) K (U(L))`, the Poincaré–Birkhoff–Witt theorem; `ev : U(L) ≃ₗ[K] Poly K n`; `ad(a)^(p^i) = ad(a^(p^i))` in characteristic p; p-polynomial relations for endomorphisms and the resulting central elements of `U(L)`; order-independence of word products of those central elements; the division-with-remainder bijection `Mon n ≃ {b : ∀ j, b j < q} × Mon n`; the restricted-monomial basis of `Poly K n` and the separation lemma; and the faithful finite-dimensional module `Q = Poly K n / ∑ⱼ range Cⱼ`. Verification, from a pristine clone at the submitted commit: `lake build` succeeds with 8716 jobs and 6.82 GB peak RSS; the only warning is the trusted `Challenge.lean:9:8` sorry; `#print axioms adoIwasawa` and `#print axioms Submission.adoIwasawa` both give `[propext, Classical.choice, Quot.sound]`; the submission tree contains no sorry, admit, added axiom, set_option or native_decide; and `Challenge.lean`, `ChallengeDeps.lean`, `Solution.lean` and `config.json` are byte-identical to the upstream benchmark. Informal proof, Lean blueprint, an API reference for the new theory, and machine-checked non-vacuity checks are in `notes/easiest-problems/` of the submission repository.

Ado's theorem in characteristic zero
adoCharZero

Verso theorem preview

theorem declaration uses `sorry`adoCharZero [CharZero K] [FiniteDimensional K L] : ∃ (V : Type u) (_ : AddCommGroup V) (_ : Module K V) (_ : FiniteDimensional K V) (ρ : L →ₗ⁅K⁆ Module.End K V), Function.Injective ρ := K:Type uL:Type uinst✝⁴:Field Kinst✝³:LieRing Linst✝²:LieAlgebra K Linst✝¹:CharZero Kinst✝:FiniteDimensional K L⊢ ∃ V x x_1, ∃ (_ : FiniteDimensional K V), ∃ ρ, Function.Injective ⇑ρ All goals completed! 🐙
#5
Hadwiger's theorem
hadwiger

Verso theorem preview

theorem declaration uses `sorry`hadwiger (n : ℕ) : Module.finrank ℝ (valuations n) = n + 1 := n:ℕ⊢ Module.finrank ℝ ↥(valuations n) = n + 1 All goals completed! 🐙
#6
How produced

Claude Opus 5 in Claude Code, driving a fleet of subagents (172 agent transcripts, including one 17-agent adversarial-review workflow). 7.5 hours wall-clock, 1.46B tokens, ~$1,242 at list price. No human mathematical input beyond the initial instruction to solve an unsolved lean-eval problem, and no human review of the proof. 17,975 lines across 37 modules, built from scratch: Mathlib has no valuations on convex bodies, no support functions, no intrinsic volumes, no polytope face lattice and no spherical harmonics. Architecture. Lower bound: the outer parallel volumes vol(K + tB) for t = 1..n+1, which avoids the Steiner formula and mixed volumes entirely. Upper bound: restriction to a hyperplane is linear with kernel exactly the simple valuations, reducing everything by induction to the volume theorem. Volume theorem: boxes, then right prisms, then orthogonal cylinders, then oblique cylinders (Schneider's exact stack-and-rearrange), then Hadwiger's canonical orthoscheme dissection. The crux was degree-one homogeneity. Transferring it from orthoschemes to all simplices appears to need Hadwiger's 1956 dissection conjecture, open for d >= 6. It does not: a valuation needs only a SIGNED identity of indicator functions, and one always exists. For any point o of the affine hull of a simplex, 1_F = sum_j sign(mu_j) * 1_{conv(G_j u {o})} almost everywhere. Simplicity converts an a.e. indicator identity into a valuation identity, the arrangement refinement replacing Groemer's extension theorem. Taking o to be the orthogonal projection of the apex onto the opposite facet's affine hull makes the recursion build mutually orthogonal edges, and sign(0) = 0 drops the already-fixed vertices, so every step stays full-dimensional and no measure on an affine subspace is ever needed. McMullen integer polynomiality is proved with no face lattice and no normal fan, via the frustum identity (k.C) n {j <= l <= j+1} = j.F + C for cones over flat bases, prismatoid slabs, and a level induction whose well-founded measure is the number of generator levels below the cut. Endgame: Minkowski additivity from degree-one homogeneity, then rotation averages converging to a ball. Mathlib has no topology on the isometry group and hence no Haar measure there, so equidistribution is done by an elementary contraction on equal-weight averages of the support function: one averaging step strictly reduces oscillation on the sphere, using transitivity of the rotation group and a finite subcover whose size does not depend on the centre. Mathlib gaps filled along the way, all reusable: support functions of convex bodies; compactness of the family of convex bodies inside a compact set (Blaschke selection in all but name); nonexpansiveness of Minkowski addition; Newton's forward-difference characterisation of polynomials plus a continuity upgrade; polytope faces with a finite H-representation; and additivity of a simple valuation over an arbitrary dissection. Constraints honoured throughout: no set_option of any kind (including maxHeartbeats), no native_decide, and axioms exactly propext, Classical.choice, Quot.sound.

First submissionAug 5, 2026
Last submissionAug 13, 2026
Vilin976
26Claude Fable 55 solved
Uniformization theorem for Riemann surfaces
uniformization

Verso theorem preview

theorem declaration uses `sorry`uniformization {X : Type*} [TopologicalSpace X] [T2Space X] [ConnectedSpace X] [SecondCountableTopology X] [ChartedSpace ℂ X] [IsManifold mℂ 1 X] (hX : ¬ CompactSpace X) (x : X) [Subsingleton <| Additive (FundamentalGroup X x) →+ ℝ] : Nonempty (X ≃ₘ⟮mℂ, mℂ⟯ ℂ) ∨ Nonempty (X ≃ₘ⟮mℂ, mℂ⟯ UpperHalfPlane) := X:Type u_1inst✝⁶:TopologicalSpace Xinst✝⁵:T2Space Xinst✝⁴:ConnectedSpace Xinst✝³:SecondCountableTopology Xinst✝²:ChartedSpace ℂ Xinst✝¹:IsManifold mℂ 1 XhX:¬CompactSpace Xx:Xinst✝:Subsingleton (Additive (FundamentalGroup X x) →+ ℝ)⊢ Nonempty (X ≃ₘ⟮mℂ, mℂ⟯ ℂ) ∨ Nonempty (X ≃ₘ⟮mℂ, mℂ⟯ UpperHalfPlane) All goals completed! 🐙
#1
Jacobian of a compact Riemann surface (Buzzard challenge)
jacobian_challenge_diffgeo

Verso theorem preview

def declaration uses `sorry`genus (X : Type u) [TopologicalSpace X] [T2Space X] [CompactSpace X] [ConnectedSpace X] [Nonempty X] [ChartedSpace ℂ X] [IsManifold (modelWithCornersSelf ℂ ℂ) ω X] : ℕ := sorry
theorem declaration uses `sorry`genus_eq_zero_iff_homeo : genus X = 0 ↔ Nonempty (X ≃ₜ (Metric.sphere (0 : EuclideanSpace ℝ (Fin 3)) 1)) := sorry
def declaration uses `sorry`Jacobian (X : Type u) [TopologicalSpace X] [T2Space X] [CompactSpace X] [ConnectedSpace X] [Nonempty X] [ChartedSpace ℂ X] [IsManifold (modelWithCornersSelf ℂ ℂ) ω X] : Type u := sorry
instance declaration uses `sorry`instAddCommGroup : AddCommGroup (Jacobian X) := sorry
instance declaration uses `sorry`instTopologicalSpace : TopologicalSpace (Jacobian X) := sorry
instance declaration uses `sorry`instT2Space : T2Space (Jacobian X) := sorry
instance declaration uses `sorry`instCompactSpace : CompactSpace (Jacobian X) := sorry
instance declaration uses `sorry`instChartedSpace : ChartedSpace (Fin (genus X) → ℂ) (Jacobian X) := sorry
instance declaration uses `sorry`instIsManifold : IsManifold (modelWithCornersSelf ℂ (Fin (genus X) → ℂ)) ω (Jacobian X) := sorry
instance declaration uses `sorry`instLieAddGroup : LieAddGroup (modelWithCornersSelf ℂ (Fin (genus X) → ℂ)) ω (Jacobian X) := sorry
def declaration uses `sorry`ofCurve (P : X) : X → Jacobian X := sorry
theorem declaration uses `sorry`ofCurve_contMDiff (P : X) : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ (Fin (genus X) → ℂ)) ω (ofCurve P) := sorry
theorem declaration uses `sorry`ofCurve_self (P : X) : ofCurve P P = 0 := sorry
theorem declaration uses `sorry`ofCurve_inj (P : X) (h : 0 < genus X) : Function.Injective (ofCurve P) := sorry
def declaration uses `sorry`pushforward (f : X → Y) (hf : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω f) : Jacobian X →ₜ+ Jacobian Y := sorry
theorem declaration uses `sorry`pushforward_contMDiff (f : X → Y) (hf : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω f) : ContMDiff (modelWithCornersSelf ℂ (Fin (genus X) → ℂ)) (modelWithCornersSelf ℂ (Fin (genus Y) → ℂ)) ω (pushforward f hf) := sorry
theorem declaration uses `sorry`pushforward_id_apply (P : Jacobian X) : pushforward id contMDiff_id P = P := sorry
theorem declaration uses `sorry`pushforward_comp_apply (f : X → Y) (hf : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω f) (g : Y → Z) (hg : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω g) (P : Jacobian X) : pushforward (g ∘ f) (hg.comp hf) P = pushforward g hg (pushforward f hf P) := sorry
def declaration uses `sorry`pullback (f : X → Y) (hf : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω f) : Jacobian Y →ₜ+ Jacobian X := sorry
theorem declaration uses `sorry`pullback_contMDiff (f : X → Y) (hf : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω f) : ContMDiff (modelWithCornersSelf ℂ (Fin (genus Y) → ℂ)) (modelWithCornersSelf ℂ (Fin (genus X) → ℂ)) ω (pullback f hf) := sorry
theorem declaration uses `sorry`pullback_id_apply (P : Jacobian X) : pullback id contMDiff_id P = P := sorry
theorem declaration uses `sorry`pullback_comp_apply (f : X → Y) (hf : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω f) (g : Y → Z) (hg : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω g) (P : Jacobian Z) : pullback (g.comp f) (hg.comp hf) P = pullback f hf (pullback g hg P) := sorry
def declaration uses `sorry`degree (f : X → Y) (hf : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω f) : ℕ := sorry -- 0 for constant case
theorem declaration uses `sorry`pushforward_pullback (f : X → Y) (hf : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω f) (P : Jacobian Y) : pushforward f hf (pullback f hf P) = (degree f hf) • P := sorry
#2
Pick's theorem
pick

Verso theorem preview

theorem declaration uses `sorry`pick {n : ℕ} (hn : 3 ≤ n) (v : Fin n → ℤ × ℤ) (hsimple : LeanEval.Geometry.PicksTheorem.IsSimple (LeanEval.Geometry.PicksTheorem.latPoly v)) : area ((LeanEval.Geometry.PicksTheorem.latPoly v).boundary (R := ℝ)) = (interiorPts v : ℝ) + (boundaryPts v : ℝ) / 2 - 1 := n:ℕhn:3 ≤ nv:Fin n → ℤ × ℤhsimple:IsSimple (latPoly v)⊢ area (Polygon.boundary ℝ (latPoly v)) = ↑(interiorPts v) + ↑(boundaryPts v) / 2 - 1 All goals completed! 🐙
#3
Radó's theorem on Riemann surfaces
rado_riemannSurface

Verso theorem preview

theorem declaration uses `sorry`rado_riemannSurface {X : Type*} [TopologicalSpace X] [T2Space X] [ConnectedSpace X] [ChartedSpace ℂ X] [IsManifold (modelWithCornersSelf ℂ ℂ) 1 X] : SecondCountableTopology X := X:Type u_1inst✝⁴:TopologicalSpace Xinst✝³:T2Space Xinst✝²:ConnectedSpace Xinst✝¹:ChartedSpace ℂ Xinst✝:IsManifold (modelWithCornersSelf ℂ ℂ) 1 X⊢ SecondCountableTopology X All goals completed! 🐙
#4
Jordan curve theorem
jordan_curve

Verso theorem preview

theorem declaration uses `sorry`jordan_curve (r : Metric.sphere (0 : EuclideanSpace ℝ (Fin 2)) 1 → EuclideanSpace ℝ (Fin 2)) (_hcont : Continuous r) (_hinj : Function.Injective r) : Nat.card (ConnectedComponents ((Set.range r)ᶜ : Set (EuclideanSpace ℝ (Fin 2)))) = 2 := r:↑(Metric.sphere 0 1) → EuclideanSpace ℝ (Fin 2)_hcont:Continuous r_hinj:Function.Injective r⊢ Nat.card (ConnectedComponents ↑(Set.range r)ᶜ) = 2 All goals completed! 🐙
#5
First submissionJul 7, 2026
Last submissionJul 28, 2026
rkirov4will14911
27Forge5 solved
Rademacher type and Enflo type coincide
annals_rademacher_enflo_type

Verso theorem preview

theorem declaration uses `sorry`theorem_1_1 (p : ℝ) (h1p : 1 ≤ p) (hp2 : p ≤ 2) : TR X p ≤ TE X p ∧ TE X p ≤ (pi / sqrt 2) * TR X p := X:Type u_2inst✝²:NormedAddCommGroup Xinst✝¹:NormedSpace ℝ Xinst✝:CompleteSpace Xp:ℝh1p:1 ≤ php2:p ≤ 2⊢ TR X p ≤ TE X p ∧ TE X p ≤ ↑pi / ↑(sqrt 2) * TR X p All goals completed! 🐙
#1
Equiangular lines with a fixed angle
annals_equiangular_lines_fixed_angle

Verso theorem preview

theorem declaration uses `sorry`theorem_1_2 (α : ℝ) (hα : α ∈ Set.Ioo 0 1) : let k := spectralRadiusOrder ((1 - α) / (2 * α)) (k < ⊤ → ∀ᶠ d in atTop, N α d = ⌊(k.toNat * (d - 1) : ℝ) / (k.toNat - 1 : ℝ)⌋₊) ∧ (k = ⊤ → ∃ e : ℕ → ℝ, e =o[atTop] (Nat.cast : ℕ → ℝ) ∧ ∀ d, N α d = d + e d) := α:ℝhα:α ∈ Set.Ioo 0 1⊢ let k := spectralRadiusOrder ((1 - α) / (2 * α)); (k < ⊤ → ∀ᶠ (d : ℕ) in atTop, N α d = ⌊↑k.toNat * (↑d - 1) / (↑k.toNat - 1)⌋₊) ∧ (k = ⊤ → ∃ e, e =o[atTop] Nat.cast ∧ ∀ (d : ℕ), ↑(N α d) = ↑d + e d) All goals completed! 🐙
#2
Hopf–Rinow theorem
hopf_rinow

Verso theorem preview

theorem declaration uses `sorry`hopf_rinow {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] {H : Type*} [TopologicalSpace H] (I : ModelWithCorners ℝ E H) [I.Boundaryless] (M : Type*) [EMetricSpace M] [ChartedSpace H M] [IsManifold I ∞ M] [Bundle.RiemannianBundle (fun x : M => TangentSpace I x)] [IsContMDiffRiemannianBundle I ∞ E (fun x : M => TangentSpace I x)] [IsContinuousRiemannianBundle E (fun x : M => TangentSpace I x)] [IsRiemannianManifold I M] [LocallyCompactSpace M] [ConnectedSpace M] : LeanEval.Geometry.IsGeodesicallyComplete M ↔ CompleteSpace M := E:Type u_1inst✝¹³:NormedAddCommGroup Einst✝¹²:NormedSpace ℝ Einst✝¹¹:FiniteDimensional ℝ EH:Type u_2inst✝¹⁰:TopologicalSpace HI:ModelWithCorners ℝ E Hinst✝⁹:I.BoundarylessM:Type u_3inst✝⁸:EMetricSpace Minst✝⁷:ChartedSpace H Minst✝⁶:IsManifold I ∞ Minst✝⁵:RiemannianBundle fun x => TangentSpace I xinst✝⁴:IsContMDiffRiemannianBundle I ∞ E fun x => TangentSpace I xinst✝³:IsContinuousRiemannianBundle E fun x => TangentSpace I xinst✝²:IsRiemannianManifold I Minst✝¹:LocallyCompactSpace Minst✝:ConnectedSpace M⊢ IsGeodesicallyComplete M ↔ CompleteSpace M All goals completed! 🐙
#3
Dimitrov's lower bound for the house of a nonzero algebraic integer that is not a root of unity
dimitrov

Verso theorem preview

theorem declaration uses `sorry`dimitrov {K : Type*} [Field K] [NumberField K] (α : K) (α_int : IsIntegral ℤ α) (α_ne_zero : α ≠ 0) (α_not_rootOfUnity : ¬ IsOfFinOrder α) : (2 : ℝ) ^ (1 / (4 * (Finset.univ.image fun σ : K →+* ℂ ↦ (σ α).arg).card) : ℝ) ≤ NumberField.house α := K:Type u_1inst✝¹:Field Kinst✝:NumberField Kα:Kα_int:IsIntegral ℤ αα_ne_zero:α ≠ 0α_not_rootOfUnity:¬IsOfFinOrder α⊢ 2 ^ (1 / (4 * ↑(Finset.image (fun σ => (σ α).arg) Finset.univ).card)) ≤ NumberField.house α All goals completed! 🐙
#4
A counterexample to the unit conjecture for group rings
annals_unit_conjecture

Verso theorem preview

theorem declaration uses `sorry`theorem_A : (∀ g : UnitConjecture.P, ∀ n ≠ 0, g ^ n = 1 → g = 1) ∧ IsUnit UnitConjecture.u ∧ ¬ ∃ g : UnitConjecture.P, UnitConjecture.u = g := ⊢ (∀ (g : P) (n : ℕ), n ≠ 0 → g ^ n = 1 → g = 1) ∧ IsUnit u ∧ ¬∃ g, u = (MonoidAlgebra.of (ZMod 2) P) g All goals completed! 🐙
#5
First submissionSep 11, 2026
Last submissionSep 15, 2026
xiaoyangliu-sjtu5
28Ivan Bogatyy4 solved
Chen's theorem
chen_theorem

Verso theorem preview

theorem declaration uses `sorry`chen_theorem : {p : ℕ | p.Prime ∧ LeanEval.NumberTheory.ChenTheorem.HasAtMostTwoPrimeFactors (p + 2)}.Infinite := ⊢ {p | Nat.Prime p ∧ HasAtMostTwoPrimeFactors (p + 2)}.Infinite All goals completed! 🐙
#1
Klartag's construction of lattice sphere packings
klartag_packing

Verso theorem preview

theorem declaration uses `sorry`klartag_packing : ∃ c : ℝ, 0 < c ∧ ∀ n : ℕ, let V := EuclideanSpace ℝ (Fin (n + 1)) ∃ φ : V →ₗ[ℝ] V, let E := φ '' Metric.ball (0 : V) 1 (MeasureTheory.volume E : EReal) = c * n ^ 2 ∧ {v ∈ E | ∀ i, v i ∈ Set.range ((↑) : ℤ → ℝ)} = {0} := ⊢ ∃ c, 0 < c ∧ ∀ (n : ℕ), let V := EuclideanSpace ℝ (Fin (n + 1)); ∃ φ, let E := ⇑φ '' Metric.ball 0 1; ↑(MeasureTheory.volume E) = ↑c * ↑n ^ 2 ∧ {v | v ∈ E ∧ ∀ (i : Fin (n + 1)), v.ofLp i ∈ Set.range Int.cast} = {0} All goals completed! 🐙
#2
Dimitrov's lower bound for the house of a nonzero algebraic integer that is not a root of unity
dimitrov

Verso theorem preview

theorem declaration uses `sorry`dimitrov {K : Type*} [Field K] [NumberField K] (α : K) (α_int : IsIntegral ℤ α) (α_ne_zero : α ≠ 0) (α_not_rootOfUnity : ¬ IsOfFinOrder α) : (2 : ℝ) ^ (1 / (4 * (Finset.univ.image fun σ : K →+* ℂ ↦ (σ α).arg).card) : ℝ) ≤ NumberField.house α := K:Type u_1inst✝¹:Field Kinst✝:NumberField Kα:Kα_int:IsIntegral ℤ αα_ne_zero:α ≠ 0α_not_rootOfUnity:¬IsOfFinOrder α⊢ 2 ^ (1 / (4 * ↑(Finset.image (fun σ => (σ α).arg) Finset.univ).card)) ≤ NumberField.house α All goals completed! 🐙
#3
A counterexample to the unit conjecture for group rings
annals_unit_conjecture

Verso theorem preview

theorem declaration uses `sorry`theorem_A : (∀ g : UnitConjecture.P, ∀ n ≠ 0, g ^ n = 1 → g = 1) ∧ IsUnit UnitConjecture.u ∧ ¬ ∃ g : UnitConjecture.P, UnitConjecture.u = g := ⊢ (∀ (g : P) (n : ℕ), n ≠ 0 → g ^ n = 1 → g = 1) ∧ IsUnit u ∧ ¬∃ g, u = (MonoidAlgebra.of (ZMod 2) P) g All goals completed! 🐙
#4
First submissionSep 19, 2026
Last submissionSep 19, 2026
bogatyy4
29DeepSeek V4 Flash3 solved
Polynomial decay rate of y' = -y^3
cubic_decay_asymptotic

Verso theorem preview

theorem declaration uses `sorry`cubic_decay_asymptotic (y : ℝ → ℝ) (hy_diff : ∀ t : ℝ, 0 < t → HasDerivAt y (-(y t) ^ 3) t) (hy_cont : ContinuousWithinAt y (Set.Ici 0) 0) (hy0 : y 0 = 1) : Tendsto (fun t : ℝ => y t * Real.sqrt t) atTop (𝓝 (1 / Real.sqrt 2)) := y:ℝ → ℝhy_diff:∀ (t : ℝ), 0 < t → HasDerivAt y (-y t ^ 3) thy_cont:ContinuousWithinAt y (Set.Ici 0) 0hy0:y 0 = 1⊢ Tendsto (fun t => y t * √t) atTop (𝓝 (1 / √2)) All goals completed! 🐙
#1
How produced

Setup: Opencode with lean-lsp MCP installed, model "DeepSeek V4 Flash Free" (under "Opencode Zen"). Prompt: "prove Submission.lean". Solve time: 40 minutes. Cost: $0.00.

Finite Ramsey theorem for graphs
finite_graph_ramsey_theorem

Verso theorem preview

theorem declaration uses `sorry`finite_graph_ramsey_theorem : ∀ r s : ℕ, 2 ≤ r → 2 ≤ s → ∃ n : ℕ, ∀ G : SimpleGraph (Fin n), ¬ G.CliqueFree r ∨ ¬ Gᶜ.CliqueFree s := ⊢ ∀ (r s : ℕ), 2 ≤ r → 2 ≤ s → ∃ n, ∀ (G : SimpleGraph (Fin n)), ¬G.CliqueFree r ∨ ¬Gᶜ.CliqueFree s All goals completed! 🐙
#2
How produced

Setup: Opencode with lean-lsp MCP installed, model "DeepSeek V4 Flash Free" (under "Opencode Zen"). Prompt: "prove Submission.lean", adding the informal solution. Solve time: 45 min. Cost: $0.00.

Catalan generating function via compositional inversion
substInv_X_sub_X_sq_eq_catalan

Verso theorem preview

theorem declaration uses `sorry`substInv_X_sub_X_sq_eq_catalan (n : ℕ) : haveI : Invertible (coeff 1 ((X : ℚ⟦X⟧) - X ^ 2)) := n:ℕ⊢ Invertible ((coeff 1) (X - X ^ 2)) n:ℕ⊢ Invertible 1; All goals completed! 🐙 coeff (n + 1) (substInv ((X : ℚ⟦X⟧) - X ^ 2)) = (Nat.choose (2 * n) n : ℚ) / (↑n + 1) := n:ℕ⊢ (coeff (n + 1)) (X - X ^ 2).substInv = ↑((2 * n).choose n) / (↑n + 1) All goals completed! 🐙
#3
How produced

Setup: Opencode with lean-lsp MCP installed, model "DeepSeek V4 Flash Free" (under "Opencode Zen"). Prompt: "prove Submission.lean". Solve time: 1 hours. Cost: $0.00.

First submissionJul 12, 2026
Last submissionJul 12, 2026
rwst3
30Grok 4.53 solved
Polynomial decay rate of y' = -y^3
cubic_decay_asymptotic

Verso theorem preview

theorem declaration uses `sorry`cubic_decay_asymptotic (y : ℝ → ℝ) (hy_diff : ∀ t : ℝ, 0 < t → HasDerivAt y (-(y t) ^ 3) t) (hy_cont : ContinuousWithinAt y (Set.Ici 0) 0) (hy0 : y 0 = 1) : Tendsto (fun t : ℝ => y t * Real.sqrt t) atTop (𝓝 (1 / Real.sqrt 2)) := y:ℝ → ℝhy_diff:∀ (t : ℝ), 0 < t → HasDerivAt y (-y t ^ 3) thy_cont:ContinuousWithinAt y (Set.Ici 0) 0hy0:y 0 = 1⊢ Tendsto (fun t => y t * √t) atTop (𝓝 (1 / √2)) All goals completed! 🐙
#1
How produced

Setup: Grok CLI, picking up lean4-skills and lean-lsp MCP. Prompt: "/lean4:prove @Submission.lean --commit=never --golf=yes". Time: 40 min. Cost: 0$ (currently free).

Finite Ramsey theorem for graphs
finite_graph_ramsey_theorem

Verso theorem preview

theorem declaration uses `sorry`finite_graph_ramsey_theorem : ∀ r s : ℕ, 2 ≤ r → 2 ≤ s → ∃ n : ℕ, ∀ G : SimpleGraph (Fin n), ¬ G.CliqueFree r ∨ ¬ Gᶜ.CliqueFree s := ⊢ ∀ (r s : ℕ), 2 ≤ r → 2 ≤ s → ∃ n, ∀ (G : SimpleGraph (Fin n)), ¬G.CliqueFree r ∨ ¬Gᶜ.CliqueFree s All goals completed! 🐙
#2
How produced

Setup: Grok CLI, picking up lean4-skills and lean-lsp MCP. Prompt: "/lean4:prove @Submission.lean --commit=never --golf=yes". Time: 15 min. Cost: 0$ (currently free).

Catalan generating function via compositional inversion
substInv_X_sub_X_sq_eq_catalan

Verso theorem preview

theorem declaration uses `sorry`substInv_X_sub_X_sq_eq_catalan (n : ℕ) : haveI : Invertible (coeff 1 ((X : ℚ⟦X⟧) - X ^ 2)) := n:ℕ⊢ Invertible ((coeff 1) (X - X ^ 2)) n:ℕ⊢ Invertible 1; All goals completed! 🐙 coeff (n + 1) (substInv ((X : ℚ⟦X⟧) - X ^ 2)) = (Nat.choose (2 * n) n : ℚ) / (↑n + 1) := n:ℕ⊢ (coeff (n + 1)) (X - X ^ 2).substInv = ↑((2 * n).choose n) / (↑n + 1) All goals completed! 🐙
#3
How produced

Setup: Grok CLI, picking up lean4-skills and lean-lsp MCP. Prompt: "/lean4:prove @Submission.lean --commit=never --golf=yes". Time: 15 min. Cost: 0$ (currently free).

First submissionJul 22, 2026
Last submissionJul 23, 2026
rwst3
31deepseek-v4 and gpt-5.x3 solved
Glauberman's Z* theorem for isolated involutions
glauberman_zStar

Verso theorem preview

theorem declaration uses `sorry`glauberman_zStar (G : Type) [Group G] [Fintype G] (t : G) (ht1 : t ≠ 1) (ht2 : t * t = 1) (hisolated : ∀ g : G, (g * t * g⁻¹) * t = t * (g * t * g⁻¹) → g * t * g⁻¹ = t) : ∃ N : Subgroup G, N.Normal ∧ Odd (Nat.card N) ∧ ∀ g : G, g * t * g⁻¹ * t⁻¹ ∈ N := G:Typeinst✝¹:Group Ginst✝:Fintype Gt:Ght1:t ≠ 1ht2:t * t = 1hisolated:∀ (g : G), g * t * g⁻¹ * t = t * (g * t * g⁻¹) → g * t * g⁻¹ = t⊢ ∃ N, N.Normal ∧ Odd (Nat.card ↥N) ∧ ∀ (g : G), g * t * g⁻¹ * t⁻¹ ∈ N All goals completed! 🐙
#1
Brauer–Suzuki theorem (quaternion Sylow 2-subgroup)
brauer_suzuki

Verso theorem preview

theorem declaration uses `sorry`brauer_suzuki {G : Type*} [Group G] [Finite G] (n : ℕ) (hn : 3 ≤ n) (P : Sylow 2 G) (hquat : Nonempty ((P : Subgroup G) ≃* QuaternionGroup (2 ^ (n - 2)))) (t : G) (ht_mem : t ∈ (P : Subgroup G)) (ht_ord : orderOf t = 2) : (QuotientGroup.mk t : G ⧸ LeanEval.GroupTheory.Defs.oddCore G) ∈ Subgroup.center (G ⧸ LeanEval.GroupTheory.Defs.oddCore G) := G:Type u_1inst✝¹:Group Ginst✝:Finite Gn:ℕhn:3 ≤ nP:Sylow 2 Ghquat:Nonempty (↥↑P ≃* QuaternionGroup (2 ^ (n - 2)))t:Ght_mem:t ∈ ↑Pht_ord:orderOf t = 2⊢ ↑t ∈ Subgroup.center (G ⧸ oddCore G) All goals completed! 🐙
#2
Feit–Thompson odd-order theorem
feit_thompson

Verso theorem preview

theorem declaration uses `sorry`feit_thompson {G : Type*} [Group G] [Finite G] (_h : Odd (Nat.card G)) : Group.IsSolvable G := G:Type u_1inst✝¹:Group Ginst✝:Finite G_h:Odd (Nat.card G)⊢ Group.IsSolvable G All goals completed! 🐙
#3
First submissionJul 24, 2026
Last submissionJul 27, 2026
ivwumupy3
32mostly ChatGPT 5.6 Sol3 solved
Topological classification of surfaces
topological_classification_of_surfaces

Verso theorem preview

theorem declaration uses `sorry`classification_of_surfaces (S : Type*) [TopologicalSpace S] [T2Space S] [ConnectedSpace S] [CompactSpace S] [ChartedSpace (EuclideanHalfSpace 2) S] [IsManifold (modelWithCornersEuclideanHalfSpace 2) 0 S] : Nonempty (S ≃ₜ Metric.sphere (0 : EuclideanSpace ℝ (Fin 3)) 1) ∨ ∃ p n, ((1 ≤ p ∨ 1 ≤ n) ∧ Nonempty (S ≃ₜ Quot (LeanEval.Topology.ClassificationOfSurfaces.OrientableRel p n))) ∨ (1 ≤ p ∧ Nonempty (S ≃ₜ Quot (LeanEval.Topology.ClassificationOfSurfaces.NonOrientableRel p n))) := S:Type u_1inst✝⁵:TopologicalSpace Sinst✝⁴:T2Space Sinst✝³:ConnectedSpace Sinst✝²:CompactSpace Sinst✝¹:ChartedSpace (EuclideanHalfSpace 2) Sinst✝:IsManifold (modelWithCornersEuclideanHalfSpace 2) 0 S⊢ Nonempty (S ≃ₜ ↑(Metric.sphere 0 1)) ∨ ∃ p n, (1 ≤ p ∨ 1 ≤ n) ∧ Nonempty (S ≃ₜ Quot (OrientableRel p n)) ∨ 1 ≤ p ∧ Nonempty (S ≃ₜ Quot (NonOrientableRel p n)) All goals completed! 🐙
#1
How produced

This is a collaborative project of the SF LEAN meetup, undertaken as an exercise in autoformalization. The proof strategies and source materials were selected by the human participants. Coordination was achieved via discord and github. Primarily formalized via ChatGPT 5.6 Sol, though not insignificant chunks were done by Claude Fable and a handful of older models. Multiple contributors pooled their tokens and subscriptions to generate the full proof. The project took four weeks to complete with contributors participating in their spare time. The formalization used the equivalent of approximately one ChatGPT Pro 5x subscriptions for one month ($100). Total agent work time was ~80 hours. If you are in the bay area, come to the [weekly meetup](https://luma.com/yi9idc15).

Schoenflies theorem
schoenflies

Verso theorem preview

theorem declaration uses `sorry`schoenflies (r : Metric.sphere (0 : EuclideanSpace ℝ (Fin 2)) 1 → EuclideanSpace ℝ (Fin 2)) (_hcont : Continuous r) (_hinj : Function.Injective r) : ∃ h : EuclideanSpace ℝ (Fin 2) ≃ₜ EuclideanSpace ℝ (Fin 2), h '' Set.range r = Metric.sphere (0 : EuclideanSpace ℝ (Fin 2)) 1 := r:↑(Metric.sphere 0 1) → EuclideanSpace ℝ (Fin 2)_hcont:Continuous r_hinj:Function.Injective r⊢ ∃ h, ⇑h '' Set.range r = Metric.sphere 0 1 All goals completed! 🐙
#2
How produced

This is an extension of a previous submission for the classification of surfaces to encompass two additional lean-eval challenge problems, the Jordan Curve Theorem and the Schoenflies theorem. JCT was vendored from rkirov/jordan_pick, and Schoenflies was built atop JCT and foundational work done for the classification of surfaces. Incremental work for Schoenflies was ~40hrs of mostly ChatGPT Sol xhigh with an assist from Fable.

Jordan curve theorem
jordan_curve

Verso theorem preview

theorem declaration uses `sorry`jordan_curve (r : Metric.sphere (0 : EuclideanSpace ℝ (Fin 2)) 1 → EuclideanSpace ℝ (Fin 2)) (_hcont : Continuous r) (_hinj : Function.Injective r) : Nat.card (ConnectedComponents ((Set.range r)ᶜ : Set (EuclideanSpace ℝ (Fin 2)))) = 2 := r:↑(Metric.sphere 0 1) → EuclideanSpace ℝ (Fin 2)_hcont:Continuous r_hinj:Function.Injective r⊢ Nat.card (ConnectedComponents ↑(Set.range r)ᶜ) = 2 All goals completed! 🐙
#3
How produced

This is an extension of a previous submission for the classification of surfaces to encompass two additional lean-eval challenge problems, the Jordan Curve Theorem and the Schoenflies theorem. JCT was vendored from rkirov/jordan_pick, and Schoenflies was built atop JCT and foundational work done for the classification of surfaces. Incremental work for Schoenflies was ~40hrs of mostly ChatGPT Sol xhigh with an assist from Fable.

First submissionJul 30, 2026
Last submissionAug 3, 2026
mccorvie3
33GPT-5.5 Codex2 solved
Sturm separation theorem
sturm_separation

Verso theorem preview

theorem declaration uses `sorry`sturm_separation (p q y₁ y₂ : ℝ → ℝ) (a b : ℝ) (hab : a < b) (J : Set ℝ) (hJ_open : IsOpen J) (hJ_conn : IsPreconnected J) (hJ_sub : Set.Icc a b ⊆ J) (hp : ContinuousOn p J) (hq : ContinuousOn q J) (hy₁ : ∀ x ∈ J, HasDerivAt y₁ (deriv y₁ x) x) (hy₁' : ∀ x ∈ J, HasDerivAt (deriv y₁) (-(p x * deriv y₁ x + q x * y₁ x)) x) (hy₂ : ∀ x ∈ J, HasDerivAt y₂ (deriv y₂ x) x) (hy₂' : ∀ x ∈ J, HasDerivAt (deriv y₂) (-(p x * deriv y₂ x + q x * y₂ x)) x) (hW : ∃ x₀ ∈ J, y₁ x₀ * deriv y₂ x₀ - y₂ x₀ * deriv y₁ x₀ ≠ 0) (hza : y₁ a = 0) (hzb : y₁ b = 0) (hne : ∀ x ∈ Set.Ioo a b, y₁ x ≠ 0) : ∃! c, c ∈ Set.Ioo a b ∧ y₂ c = 0 := p:ℝ → ℝq:ℝ → ℝy₁:ℝ → ℝy₂:ℝ → ℝa:ℝb:ℝhab:a < bJ:Set ℝhJ_open:IsOpen JhJ_conn:IsPreconnected JhJ_sub:Set.Icc a b ⊆ Jhp:ContinuousOn p Jhq:ContinuousOn q Jhy₁:∀ x ∈ J, HasDerivAt y₁ (deriv y₁ x) xhy₁':∀ x ∈ J, HasDerivAt (deriv y₁) (-(p x * deriv y₁ x + q x * y₁ x)) xhy₂:∀ x ∈ J, HasDerivAt y₂ (deriv y₂ x) xhy₂':∀ x ∈ J, HasDerivAt (deriv y₂) (-(p x * deriv y₂ x + q x * y₂ x)) xhW:∃ x₀ ∈ J, y₁ x₀ * deriv y₂ x₀ - y₂ x₀ * deriv y₁ x₀ ≠ 0hza:y₁ a = 0hzb:y₁ b = 0hne:∀ x ∈ Set.Ioo a b, y₁ x ≠ 0⊢ ∃! c, c ∈ Set.Ioo a b ∧ y₂ c = 0 All goals completed! 🐙
#1
Comparison principle for the Dirichlet BVP
bvp_comparison

Verso theorem preview

theorem declaration uses `sorry`bvp_comparison (J : Set ℝ) (hJ_open : IsOpen J) (hJ_sub : Set.Icc (0 : ℝ) 1 ⊆ J) (u v : ℝ → ℝ) (hu : ∀ x ∈ J, HasDerivAt u (deriv u x) x) (hu' : ∀ x ∈ J, HasDerivAt (deriv u) (deriv (deriv u) x) x) (hv : ∀ x ∈ J, HasDerivAt v (deriv v x) x) (hv' : ∀ x ∈ J, HasDerivAt (deriv v) (deriv (deriv v) x) x) (hineq : ∀ x ∈ Set.Ioo (0 : ℝ) 1, -deriv (deriv u) x ≤ -deriv (deriv v) x) (hu0 : u 0 ≤ v 0) (hu1 : u 1 ≤ v 1) : ∀ x ∈ Set.Icc (0 : ℝ) 1, u x ≤ v x := J:Set ℝhJ_open:IsOpen JhJ_sub:Set.Icc 0 1 ⊆ Ju:ℝ → ℝv:ℝ → ℝhu:∀ x ∈ J, HasDerivAt u (deriv u x) xhu':∀ x ∈ J, HasDerivAt (deriv u) (deriv (deriv u) x) xhv:∀ x ∈ J, HasDerivAt v (deriv v x) xhv':∀ x ∈ J, HasDerivAt (deriv v) (deriv (deriv v) x) xhineq:∀ x ∈ Set.Ioo 0 1, -deriv (deriv u) x ≤ -deriv (deriv v) xhu0:u 0 ≤ v 0hu1:u 1 ≤ v 1⊢ ∀ x ∈ Set.Icc 0 1, u x ≤ v x All goals completed! 🐙
#2
First submissionMay 7, 2026
Last submissionMay 7, 2026
A-M-Berns2
34Gemini 3.1 Pro2 solved
Cayley graph connected iff generators generate the group
mulCayley_connected_iff_closure_eq_top

Verso theorem preview

theorem declaration uses `sorry`mulCayley_connected_iff_closure_eq_top {G : Type*} [Group G] (S : Set G) : (SimpleGraph.mulCayley S).Connected ↔ Subgroup.closure S = ⊤ := G:Type u_1inst✝:Group GS:Set G⊢ (SimpleGraph.mulCayley S).Connected ↔ Subgroup.closure S = ⊤ All goals completed! 🐙
#1
Comparison principle for the Dirichlet BVP
bvp_comparison

Verso theorem preview

theorem declaration uses `sorry`bvp_comparison (J : Set ℝ) (hJ_open : IsOpen J) (hJ_sub : Set.Icc (0 : ℝ) 1 ⊆ J) (u v : ℝ → ℝ) (hu : ∀ x ∈ J, HasDerivAt u (deriv u x) x) (hu' : ∀ x ∈ J, HasDerivAt (deriv u) (deriv (deriv u) x) x) (hv : ∀ x ∈ J, HasDerivAt v (deriv v x) x) (hv' : ∀ x ∈ J, HasDerivAt (deriv v) (deriv (deriv v) x) x) (hineq : ∀ x ∈ Set.Ioo (0 : ℝ) 1, -deriv (deriv u) x ≤ -deriv (deriv v) x) (hu0 : u 0 ≤ v 0) (hu1 : u 1 ≤ v 1) : ∀ x ∈ Set.Icc (0 : ℝ) 1, u x ≤ v x := J:Set ℝhJ_open:IsOpen JhJ_sub:Set.Icc 0 1 ⊆ Ju:ℝ → ℝv:ℝ → ℝhu:∀ x ∈ J, HasDerivAt u (deriv u x) xhu':∀ x ∈ J, HasDerivAt (deriv u) (deriv (deriv u) x) xhv:∀ x ∈ J, HasDerivAt v (deriv v x) xhv':∀ x ∈ J, HasDerivAt (deriv v) (deriv (deriv v) x) xhineq:∀ x ∈ Set.Ioo 0 1, -deriv (deriv u) x ≤ -deriv (deriv v) xhu0:u 0 ≤ v 0hu1:u 1 ≤ v 1⊢ ∀ x ∈ Set.Icc 0 1, u x ≤ v x All goals completed! 🐙
#2
First submissionMay 10, 2026
Last submissionMay 10, 2026
sqrt-of-22
35[submission] aegis-of-the-unit-circle-logos2 solved
Real cyclotomic integer with house at most 2
cyclotomic_integer_house_le_two

Verso theorem preview

theorem declaration uses `sorry`cyclotomic_integer_house_le_two {K : Type*} [Field K] [NumberField K] [Algebra ℚ K] (n : ℕ) [NeZero n] [IsCyclotomicExtension {n} ℚ K] {β : K} (hβ_int : IsIntegral ℤ β) (hβ_real : β ∈ NumberField.maximalRealSubfield K) : house β ≤ 2 → house β = 2 ∨ ∃ m : ℕ, 0 < m ∧ house β = 2 * Real.cos (Real.pi / m) := K:Type u_1inst✝⁴:Field Kinst✝³:NumberField Kinst✝²:Algebra ℚ Kn:ℕinst✝¹:NeZero ninst✝:IsCyclotomicExtension {n} ℚ Kβ:Khβ_int:IsIntegral ℤ βhβ_real:β ∈ maximalRealSubfield K⊢ house β ≤ 2 → house β = 2 ∨ ∃ m, 0 < m ∧ house β = 2 * Real.cos (Real.pi / ↑m) All goals completed! 🐙
#1
How produced

Comparator-accepted Lean Eval solution for cyclotomic_integer_house_le_two. Developed and verified in a private repository. Local checks included direct Lean Eval comparator and CI-equivalent evaluate_submission.py.

pi_1 of the circle is Z
pi1_circle_mulEquiv_int

Verso theorem preview

theorem declaration uses `sorry`pi1_circle_mulEquiv_int : Nonempty (HomotopyGroup.Pi 1 Circle (1 : Circle) ≃* Multiplicative ℤ) := ⊢ Nonempty (HomotopyGroup.Pi 1 Circle 1 ≃* Multiplicative ℤ) All goals completed! 🐙
#2
How produced

Comparator-accepted Lean Eval solution for cyclotomic_integer_house_le_two. Developed and verified in a private repository. Local checks included direct Lean Eval comparator and CI-equivalent evaluate_submission.py.

First submissionMay 12, 2026
Last submissionMay 12, 2026
rishistyping2
36EVO2 solved
Comparison principle for the Dirichlet BVP
bvp_comparison

Verso theorem preview

theorem declaration uses `sorry`bvp_comparison (J : Set ℝ) (hJ_open : IsOpen J) (hJ_sub : Set.Icc (0 : ℝ) 1 ⊆ J) (u v : ℝ → ℝ) (hu : ∀ x ∈ J, HasDerivAt u (deriv u x) x) (hu' : ∀ x ∈ J, HasDerivAt (deriv u) (deriv (deriv u) x) x) (hv : ∀ x ∈ J, HasDerivAt v (deriv v x) x) (hv' : ∀ x ∈ J, HasDerivAt (deriv v) (deriv (deriv v) x) x) (hineq : ∀ x ∈ Set.Ioo (0 : ℝ) 1, -deriv (deriv u) x ≤ -deriv (deriv v) x) (hu0 : u 0 ≤ v 0) (hu1 : u 1 ≤ v 1) : ∀ x ∈ Set.Icc (0 : ℝ) 1, u x ≤ v x := J:Set ℝhJ_open:IsOpen JhJ_sub:Set.Icc 0 1 ⊆ Ju:ℝ → ℝv:ℝ → ℝhu:∀ x ∈ J, HasDerivAt u (deriv u x) xhu':∀ x ∈ J, HasDerivAt (deriv u) (deriv (deriv u) x) xhv:∀ x ∈ J, HasDerivAt v (deriv v x) xhv':∀ x ∈ J, HasDerivAt (deriv v) (deriv (deriv v) x) xhineq:∀ x ∈ Set.Ioo 0 1, -deriv (deriv u) x ≤ -deriv (deriv v) xhu0:u 0 ≤ v 0hu1:u 1 ≤ v 1⊢ ∀ x ∈ Set.Icc 0 1, u x ≤ v x All goals completed! 🐙
#1
Finite Ramsey theorem for graphs
finite_graph_ramsey_theorem

Verso theorem preview

theorem declaration uses `sorry`finite_graph_ramsey_theorem : ∀ r s : ℕ, 2 ≤ r → 2 ≤ s → ∃ n : ℕ, ∀ G : SimpleGraph (Fin n), ¬ G.CliqueFree r ∨ ¬ Gᶜ.CliqueFree s := ⊢ ∀ (r s : ℕ), 2 ≤ r → 2 ≤ s → ∃ n, ∀ (G : SimpleGraph (Fin n)), ¬G.CliqueFree r ∨ ¬Gᶜ.CliqueFree s All goals completed! 🐙
#2
First submissionMay 20, 2026
Last submissionMay 30, 2026
machinelearning20142test1-deepthought2
37Claude Opus 4.8 (1M context)2 solved
Pick's theorem
pick

Verso theorem preview

theorem declaration uses `sorry`pick {n : ℕ} (hn : 3 ≤ n) (v : Fin n → ℤ × ℤ) (hsimple : LeanEval.Geometry.PicksTheorem.IsSimple (LeanEval.Geometry.PicksTheorem.latPoly v)) : area ((LeanEval.Geometry.PicksTheorem.latPoly v).boundary (R := ℝ)) = (interiorPts v : ℝ) + (boundaryPts v : ℝ) / 2 - 1 := n:ℕhn:3 ≤ nv:Fin n → ℤ × ℤhsimple:IsSimple (latPoly v)⊢ area (Polygon.boundary ℝ (latPoly v)) = ↑(interiorPts v) + ↑(boundaryPts v) / 2 - 1 All goals completed! 🐙
#1
How produced

~1 week of grinding on $100/month subscription. Minimal human intervention.

Jordan curve theorem
jordan_curve

Verso theorem preview

theorem declaration uses `sorry`jordan_curve (r : Metric.sphere (0 : EuclideanSpace ℝ (Fin 2)) 1 → EuclideanSpace ℝ (Fin 2)) (_hcont : Continuous r) (_hinj : Function.Injective r) : Nat.card (ConnectedComponents ((Set.range r)ᶜ : Set (EuclideanSpace ℝ (Fin 2)))) = 2 := r:↑(Metric.sphere 0 1) → EuclideanSpace ℝ (Fin 2)_hcont:Continuous r_hinj:Function.Injective r⊢ Nat.card (ConnectedComponents ↑(Set.range r)ᶜ) = 2 All goals completed! 🐙
#2
How produced

~1 week of grinding on $100/month subscription. Minimal human intervention.

First submissionJul 1, 2026
Last submissionJul 1, 2026
rkirov2
38Kimi K2.72 solved
Polynomial decay rate of y' = -y^3
cubic_decay_asymptotic

Verso theorem preview

theorem declaration uses `sorry`cubic_decay_asymptotic (y : ℝ → ℝ) (hy_diff : ∀ t : ℝ, 0 < t → HasDerivAt y (-(y t) ^ 3) t) (hy_cont : ContinuousWithinAt y (Set.Ici 0) 0) (hy0 : y 0 = 1) : Tendsto (fun t : ℝ => y t * Real.sqrt t) atTop (𝓝 (1 / Real.sqrt 2)) := y:ℝ → ℝhy_diff:∀ (t : ℝ), 0 < t → HasDerivAt y (-y t ^ 3) thy_cont:ContinuousWithinAt y (Set.Ici 0) 0hy0:y 0 = 1⊢ Tendsto (fun t => y t * √t) atTop (𝓝 (1 / √2)) All goals completed! 🐙
#1
How produced

Freshly started Kimi Code with a Kimi version of the cameronfreer/lean4-skills plugin. Model K2.7, default settings. Command: /lean4:prove Submission.lean . Then only giving permissions that were asked for. When the context reached 60% of the window the commands "Prepare for compaction", "/compact", "continue" were given. Used one hour of a $20/month subscription.

Catalan generating function via compositional inversion
substInv_X_sub_X_sq_eq_catalan

Verso theorem preview

theorem declaration uses `sorry`substInv_X_sub_X_sq_eq_catalan (n : ℕ) : haveI : Invertible (coeff 1 ((X : ℚ⟦X⟧) - X ^ 2)) := n:ℕ⊢ Invertible ((coeff 1) (X - X ^ 2)) n:ℕ⊢ Invertible 1; All goals completed! 🐙 coeff (n + 1) (substInv ((X : ℚ⟦X⟧) - X ^ 2)) = (Nat.choose (2 * n) n : ℚ) / (↑n + 1) := n:ℕ⊢ (coeff (n + 1)) (X - X ^ 2).substInv = ↑((2 * n).choose n) / (↑n + 1) All goals completed! 🐙
#2
How produced

Freshly started Kimi Code with a Kimi version of the cameronfreer/lean4-skills plugin. Model K2.7, default settings. Command: `/lean4:prove Submission.lean` . Then only giving permissions that were asked for. No input during proof process. The question of golfing was answered positively. Uses small part of a $20/month subscription.

First submissionJul 6, 2026
Last submissionJul 10, 2026
rwst2
39GPT-5.6 and Fable 5 (human-in-the-loop)2 solved
pi_(n+1) of S^n is Z/2 for n at least 3
pi_succ_sphere_n_mulEquiv_zmod_two

Verso theorem preview

theorem declaration uses `sorry`pi_succ_sphere_n_mulEquiv_zmod_two (n : ℕ) (hn : 3 ≤ n) (x : Metric.sphere (0 : EuclideanSpace ℝ (Fin (n + 1))) 1) : Nonempty (HomotopyGroup.Pi (n + 1) (Metric.sphere (0 : EuclideanSpace ℝ (Fin (n + 1))) 1) x ≃* Multiplicative (ZMod 2)) := n:ℕhn:3 ≤ nx:↑(Metric.sphere 0 1)⊢ Nonempty (HomotopyGroup.Pi (n + 1) (↑(Metric.sphere 0 1)) x ≃* Multiplicative (ZMod 2)) All goals completed! 🐙
#1
How produced

This submission was developed by KitaKen1 (Kenta Kitamura) in a human-in-the-loop workflow using GPT-5.6 and Fable 5. The immutable Submission URL above is the exact artifact evaluated by Lean-Eval. A maintained version is available here: https://github.com/KitaKen1/lean-eval-pi-succ-sphere-n-mulequiv-zmod-two Re-files #956. There, `evaluate` passed with `{"passed": ["pi_succ_sphere_n_mulEquiv_zmod_two"]}` but `intake` was skipped (the issue form applies the `submission` label at creation, while `intake` requires that label to be absent at `opened`), so `record` was skipped as well. This issue is created via the API without labels so that `intake` can run.

Conway–Schneeberger fifteen theorem
conway_schneeberger_fifteen

Verso theorem preview

theorem declaration uses `sorry`conway_schneeberger_fifteen {n : ℕ} (Q : Matrix (Fin n) (Fin n) ℤ) (_hpos : Q.PosDef) : LeanEval.NumberTheory.ConwaySchneebergerFifteenProblem.IsUniversal Q ↔ ∀ k ∈ Finset.Icc (1 : ℤ) 15, LeanEval.NumberTheory.ConwaySchneebergerFifteenProblem.Represents Q k := n:ℕQ:Matrix (Fin n) (Fin n) ℤ_hpos:Q.PosDef⊢ IsUniversal Q ↔ ∀ k ∈ Finset.Icc 1 15, Represents Q k All goals completed! 🐙
#2
How produced

This submission was produced through a human-in-the-loop collaboration using GPT-5.6 and Fable 5. The human operator directed the proof strategy, reviewed intermediate claims, and controlled local and EC2 execution. The formalization follows the escalator-tree proof architecture and uses explicit finite certificates. The standalone workspace was rebuilt locally. The final theorem uses only propext, Classical.choice, and Quot.sound, with no sorry, admit, native_decide, or bv_decide in the submitted dependency graph. User-owned EC2 was used only as temporary compilation compute; the final durable build and axiom audit were completed locally.

First submissionAug 2, 2026
Last submissionAug 6, 2026
KitaKen12
40Humanize RLCR: GPT-5.6-sol (max) worker + reviewer2 solved
Viscosity solutions and hyperbolic motions: a new PDE method for the N-body problem
annals_viscosity_solutions

Verso theorem preview

theorem declaration uses `sorry`theorem_1_1 (hE : 2 ≤ Module.finrank ℝ E) (m : ℝᴺ) (hm : ∀ i, 0 < m i) (x₀ a : Eᴺ) (a_nc : ViscositySolutions.WithoutCollisions a) (a_norm : ‖a‖_[m] = 1) (h : ℝ) (h_pos : h > 0) : ∃ x : ℝ → Eᴺ, ∃ o : ℝ → Eᴺ, (o =o[atTop] fun t ↦ t) ∧ x 0 = x₀ ∧ ViscositySolutions.IsNBodySolution m x ∧ (∀ t > 0, ViscositySolutions.WithoutCollisions (x t)) ∧ ∀ t ≥ 0, x t = (sqrt (2 * h) * t) • a + o t := E:Type u_1inst✝²:NormedAddCommGroup Einst✝¹:InnerProductSpace ℝ Einst✝:FiniteDimensional ℝ EN:ℕhE:2 ≤ Module.finrank ℝ Em:Fin N → ℝhm:∀ (i : Fin N), 0 < m ix₀:Eᴺa:Eᴺa_nc:WithoutCollisions aa_norm:‖a‖_[m] = 1h:ℝh_pos:h > 0⊢ ∃ x o, (o =o[atTop] fun t => t) ∧ x 0 = x₀ ∧ IsNBodySolution m x ∧ (∀ t > 0, WithoutCollisions (x t)) ∧ ∀ t ≥ 0, x t = (√(2 * h) * t) • a + o t All goals completed! 🐙
#1
Schmidt's subspace theorem
schmidt_subspace

Verso theorem preview

theorem declaration uses `sorry`schmidt_subspace (σ : Type*) [Fintype σ] (hσ : 2 ≤ Fintype.card σ) (L : σ → σ → ℂ) (alg : ∀ i j, IsAlgebraic ℚ (L i j)) (ind : LinearIndependent ℂ L) (ε : ℝ) (pos : 0 < ε) : ∃ s : Finset (σ → ℤ), 0 ∉ s ∧ ∀ x : σ → ℤ, ‖∏ i, ∑ j, L i j * x j‖ < ‖x‖ ^ (-ε) → ∃ c ∈ s, ∑ i, c i * x i = 0 := σ:Type u_1inst✝:Fintype σhσ:2 ≤ Fintype.card σL:σ → σ → ℂalg:∀ (i j : σ), IsAlgebraic ℚ (L i j)ind:LinearIndependent ℂ Lε:ℝpos:0 < ε⊢ ∃ s, 0 ∉ s ∧ ∀ (x : σ → ℤ), ‖∏ i, ∑ j, L i j * ↑(x j)‖ < ‖x‖ ^ (-ε) → ∃ c ∈ s, ∑ i, c i * x i = 0 All goals completed! 🐙
#2
First submissionAug 22, 2026
Last submissionAug 22, 2026
ZhengyangZhang062
41Forall (Astrio)2 solved
Quantifier elimination for the theory of real closed fields
rcf_quantifier_elimination

Verso theorem preview

/-- Quantifier elimination: `qe φ` is a quantifier-free formula equivalent to `φ` over `ℝ` in every environment. Its syntax may mention additional variables vacuously. -/ def declaration uses `sorry`qe (φ : Formula) : Formula := sorry
/-- The output of `qe` is quantifier free. -/ theorem declaration uses `sorry`isQF_qe (φ : Formula) : (qe φ).IsQF := sorry
/-- The output of `qe` is equivalent to its input, under every environment. -/ theorem declaration uses `sorry`holds_qe (φ : Formula) (env : Nat → ℝ) : (qe φ).Holds env ↔ φ.Holds env := sorry
/-- Anti-vacuity guard for the semantics and de Bruijn convention: a real number is a square exactly when it is nonnegative. -/ theorem declaration uses `sorry`holds_ex_sq (env : Nat → ℝ) : (Formula.ex (.eq (.mul (.var 0) (.var 0)) (.var 1))).Holds env ↔ (Formula.not (.lt (.var 0) (.const 0))).Holds env := sorry
#1
Strong normalization and consistency for the calculus of constructions with a universe hierarchy
coc_strong_normalization

Verso theorem preview

/-- Anti-vacuity guard: the polymorphic identity `λ (A : Prop). λ (x : A). x` has type `Π (A : Prop). Π (x : A). A`. This is typable only because `Prop` is impredicative. -/ theorem declaration uses `sorry`typing_polyId : Typing [] (.lam (.srt .prop) (.lam (.var 0) (.var 0))) (.pi (.srt .prop) (.pi (.var 0) (.var 1))) := sorry
/-- Anti-vacuity guard: applying the polymorphic identity to `False` exercises application typing. Here `False` is encoded as `Π (P : Prop). P`. -/ theorem declaration uses `sorry`typing_polyId_app : Typing [] (.app (.lam (.srt .prop) (.lam (.var 0) (.var 0))) (.pi (.srt .prop) (.var 0))) (.pi (.pi (.srt .prop) (.var 0)) (.pi (.srt .prop) (.var 0))) := sorry
/-- Anti-vacuity guard: the same application takes its expected beta step. -/ theorem declaration uses `sorry`step_polyId_app : Step (.app (.lam (.srt .prop) (.lam (.var 0) (.var 0))) (.pi (.srt .prop) (.var 0))) (.lam (.pi (.srt .prop) (.var 0)) (.var 0)) := sorry
/-- Types are preserved by reduction. -/ theorem declaration uses `sorry`subject_reduction (Γ : List Tm) (t t' A : Tm) : Typing Γ t A → Step t t' → Typing Γ t' A := sorry
/-- Every well-typed term is strongly normalizing. -/ theorem declaration uses `sorry`strong_normalization (Γ : List Tm) (t A : Tm) : Typing Γ t A → SN t := sorry
/-- The system is logically consistent: `Π (P : Prop). P` is not inhabited. -/ theorem declaration uses `sorry`consistency : ¬ ∃ t : Tm, Typing [] t (.pi (.srt .prop) (.var 0)) := sorry
#2
First submissionSep 7, 2026
Last submissionSep 7, 2026
nolanlwin2
42trureturning2 solved
Generalized topological Poincaré conjecture in dimensions ≥ 5 (Smale)
poincare_high_dim_topological

Verso theorem preview

theorem declaration uses `sorry`poincare_high_dim_topological {n : ℕ} (_h5 : 5 ≤ n) {M : Type*} [TopologicalSpace M] [T2Space M] [ChartedSpace (EuclideanSpace ℝ (Fin n)) M] (_h : M ≃ₕ sphere (0 : EuclideanSpace ℝ (Fin (n + 1))) 1) : Nonempty (M ≃ₜ sphere (0 : EuclideanSpace ℝ (Fin (n + 1))) 1) := n:ℕ_h5:5 ≤ nM:Type u_1inst✝²:TopologicalSpace Minst✝¹:T2Space Minst✝:ChartedSpace (EuclideanSpace ℝ (Fin n)) M_h:M ≃ₕ ↑(sphere 0 1)⊢ Nonempty (M ≃ₜ ↑(sphere 0 1)) All goals completed! 🐙
#1
How produced

The trureturning formalization campaign. Human direction selected the benchmark, submission identity and public-source reuse policy. Codex performed source-closure packaging, import remapping and local Lean verification. This submission reuses the complete public Apache-2.0 formalization of `DifferentialGeometry.Topology.poincare_high_dim_topological` from https://github.com/qinz1yang/differential-geometry at commit `788efe97894474c032de6dfb1289d515f613d15a`; original full-proof authorship and new mathematical discovery are not claimed. The 237-module reachable closure is placed under `Submission/DifferentialGeometry/`, preserving original namespaces, proof bodies and headers while prefixing local imports. The root proof applies the existing theorem to the exact official revision-1 telescope. The source snapshot contains exactly one workspace, for `poincare_high_dim_topological`. The official Challenge, Solution, WorkspaceTest, configuration, toolchain and dependency declarations are unchanged. The candidate compiled with Lean v4.35.0-rc3 and Mathlib `5e0c4e5239cb0a2d86d68a884bf52cfd963fce22`; `lake build Submission` and `lake build Solution` passed. The theorem's printed transitive axiom closure contains only `propext`, `Classical.choice` and `Quot.sound`. All 240 overlaid Lean files were byte-compared against the locally verified workspace. Full upstream LICENSE, NOTICE and source provenance are additionally retained as comments in `Submission/Attribution/UpstreamLicense.lean` so the evaluated source-only overlay preserves them. No additional Lake dependency is requested. Local compilation is not an organizer acceptance claim. Local `lake test` could not launch because comparator/Nanoda are not installed on this host; official comparator and mandatory Nanoda verification are requested. This is an additional total-only submission; earlier accepted results by other teams are acknowledged. No measured monetary-cost or independent GPT Pro review claim is made.

A counterexample to the unit conjecture for group rings
annals_unit_conjecture

Verso theorem preview

theorem declaration uses `sorry`theorem_A : (∀ g : UnitConjecture.P, ∀ n ≠ 0, g ^ n = 1 → g = 1) ∧ IsUnit UnitConjecture.u ∧ ¬ ∃ g : UnitConjecture.P, UnitConjecture.u = g := ⊢ (∀ (g : P) (n : ℕ), n ≠ 0 → g ^ n = 1 → g = 1) ∧ IsUnit u ∧ ¬∃ g, u = (MonoidAlgebra.of (ZMod 2) P) g All goals completed! 🐙
#2
How produced

The trureturning formalization campaign. Human direction selected the benchmark, campaign objective and submission identity; mathematical proof implementation used Codex CLI. Independent mathematical/source review passed with two Codex CLI seats and one GPT-6 Pro seat through the chrono-500 pool; the CLI tests seat freshly recompiled all seven candidate modules and the untouched official Solution. This is an attributed formalization of Giles Gardam's known counterexample, not a claim of a new mathematical counterexample. It builds on Gardam's paper (arXiv:2102.11818v2, sections 3.1–3.2) and pinned Mathlib APIs. The proof supplies a faithful two-sided normal-form equivalence for the exact PresentedGroup, torsion-freeness, explicit two-sided inverse identities, and group-ring support and transport arguments. It locally compiled with the benchmark's Lean 4.35.0-rc3 / Mathlib 5e0c4e5239cb0a2d86d68a884bf52cfd963fce22 pins, with only propext, Classical.choice and Quot.sound in the printed transitive axiom closures. No manual human proof edits are reported. Allowed LeanPool Polylean related machinery was discovered separately after this candidate was produced; it is not imported by the submitted proof. Official comparator and nanoda acceptance are requested and not presumed from local compilation. No measured monetary-cost claim is made.

First submissionOct 3, 2026
Last submissionOct 5, 2026
AlyciaBHZ2
43Claude Opus 4.71 solved
Finite Ramsey theorem for graphs
finite_graph_ramsey_theorem

Verso theorem preview

theorem declaration uses `sorry`finite_graph_ramsey_theorem : ∀ r s : ℕ, 2 ≤ r → 2 ≤ s → ∃ n : ℕ, ∀ G : SimpleGraph (Fin n), ¬ G.CliqueFree r ∨ ¬ Gᶜ.CliqueFree s := ⊢ ∀ (r s : ℕ), 2 ≤ r → 2 ≤ s → ∃ n, ∀ (G : SimpleGraph (Fin n)), ¬G.CliqueFree r ∨ ¬Gᶜ.CliqueFree s All goals completed! 🐙
#1
First submissionApr 30, 2026
Last submissionApr 30, 2026
rkirov1
44Claude Opus 4.7 + GPT-5.5 (human-in-the-loop)1 solved
Baer–Suzuki theorem
baer_suzuki

Verso theorem preview

theorem declaration uses `sorry`baer_suzuki {G : Type*} [Group G] [Finite G] {p : ℕ} [Fact p.Prime] (x : G) : x ∈ LeanEval.GroupTheory.Defs.pCore p G ↔ ∀ g : G, IsPGroup p (Subgroup.closure ({x, g * x * g⁻¹} : Set G)) := G:Type u_1inst✝²:Group Ginst✝¹:Finite Gp:ℕinst✝:Fact (Nat.Prime p)x:G⊢ x ∈ pCore p G ↔ ∀ (g : G), IsPGroup p ↥(Subgroup.closure {x, g * x * g⁻¹}) All goals completed! 🐙
#1
How produced

Claude Opus 4.7 + GPT-5.5, human-in-the-loop direction and review. Self-contained: inlines a port of Isaacs, Finite Group Theory Ch. 1-2 (p-core / Fitting subgroup / minimal-normal machinery) under Submission/, since Mathlib has no pCore. Builds on Mathlib rev 5450b53e5ddc; proof routes through Aschbacher §31 (normal closure of x is a p-group)

First submissionMay 29, 2026
Last submissionMay 29, 2026
yawara1
45GPT-5 Codex + Aristotle1 solved
Symplectic matrices have determinant 1
symplectic_matrix_det

Verso theorem preview

theorem declaration uses `sorry`symplectic_matrix_det {l R : Type*} [DecidableEq l] [Fintype l] [CommRing R] {A : Matrix (l ⊕ l) (l ⊕ l) R} (_hA : A ∈ Matrix.symplecticGroup l R) : A.det = 1 := l:Type u_1R:Type u_2inst✝²:DecidableEq linst✝¹:Fintype linst✝:CommRing RA:Matrix (l ⊕ l) (l ⊕ l) R_hA:A ∈ symplecticGroup l R⊢ A.det = 1 All goals completed! 🐙
#1
How produced

Produced by GPT-5 Codex in a Lean Eval workspace with many focused Aristotle API runs and external research prompts. The final proof uses a block/paired-minor route for symplectic_matrix_det, with local Lean validation, forbidden-token scan, and axiom audit before submission. Local evidence before submission: lake env lean Submission/Helpers.lean, lake build Submission.Helpers, lake env lean Submission.lean, lake build Submission, and lake build all passed; forbidden constructs were absent; axiom audit reported only [propext, Classical.choice, Quot.sound].

First submissionJun 1, 2026
Last submissionJun 1, 2026
rishistyping1
46Autoform-Bot1 solved
Pointwise and Cesàro convergence of Fourier series (Dirichlet, Fejér)
fourier_dirichlet_fejer

Verso theorem preview

/-- **Dirichlet's pointwise convergence theorem** (§46). For every `C¹` 2π-periodic complex function `f`, the symmetric Fourier partial sums `S_N(f)(x)` converge to `f(x)` at every point `x ∈ ℝ`. -/ theorem declaration uses `sorry`dirichlet_pointwise {f : ℝ → ℂ} (_hperiod : Function.Periodic f (2 * Real.pi)) (_hC1 : ContDiff ℝ 1 f) (x : ℝ) : Tendsto (fun N : ℕ => fourierPartialSum f N x) atTop (𝓝 (f x)) := f:ℝ → ℂ_hperiod:Function.Periodic f (2 * Real.pi)_hC1:ContDiff ℝ 1 fx:ℝ⊢ Tendsto (fun N => fourierPartialSum f N x) atTop (𝓝 (f x)) All goals completed! 🐙
/-- **Fejér's theorem** (§46). For every *continuous* 2π-periodic complex function `f` — without the `C¹` hypothesis of Dirichlet's theorem — the Cesàro means `σ_N(f)` of the symmetric Fourier partial sums converge to `f` uniformly on `ℝ`. -/ theorem declaration uses `sorry`fejer {f : ℝ → ℂ} (_hperiod : Function.Periodic f (2 * Real.pi)) (_hcont : Continuous f) : TendstoUniformly (fun N : ℕ => fourierCesaroMean f N) f atTop := f:ℝ → ℂ_hperiod:Function.Periodic f (2 * Real.pi)_hcont:Continuous f⊢ TendstoUniformly (fun N => fourierCesaroMean f N) f atTop All goals completed! 🐙
#1
How produced

This was created by building on the Atlas-Lean repository.

First submissionJun 2, 2026
Last submissionJun 2, 2026
niketp031
47Leanstral 1.41 solved
Abel–Ruffini theorem
abel_ruffini

Verso theorem preview

theorem declaration uses `sorry`abel_ruffini (n : ℕ) (_hn : 1 ≤ n) : (∀ p : ℚ[X], p.natDegree = n → ∀ x : ℂ, aeval x p = 0 → x ∈ solvableByRad ℚ ℂ) ↔ n ≤ 4 := n:ℕ_hn:1 ≤ n⊢ (∀ (p : ℚ[X]), p.natDegree = n → ∀ (x : ℂ), (aeval x) p = 0 → x ∈ solvableByRad ℚ ℂ) ↔ n ≤ 4 All goals completed! 🐙
#1
How produced

Leanstral 1.4 produced it with the prompt "prove this theorem: {theorem statement}". Cost is 1.95 dollars. It used 4.31 so there was a bit of post-hoc modification to suit the submission. Second submission since the first one has some package import issue

First submissionJun 6, 2026
Last submissionJun 6, 2026
albertqjiang1
48Claude Opus 4.7, 4.8 and Fable 5 + OSS contributions1 solved
Jacobian of a compact Riemann surface (Buzzard challenge)
jacobian_challenge_diffgeo

Verso theorem preview

def declaration uses `sorry`genus (X : Type u) [TopologicalSpace X] [T2Space X] [CompactSpace X] [ConnectedSpace X] [Nonempty X] [ChartedSpace ℂ X] [IsManifold (modelWithCornersSelf ℂ ℂ) ω X] : ℕ := sorry
theorem declaration uses `sorry`genus_eq_zero_iff_homeo : genus X = 0 ↔ Nonempty (X ≃ₜ (Metric.sphere (0 : EuclideanSpace ℝ (Fin 3)) 1)) := sorry
def declaration uses `sorry`Jacobian (X : Type u) [TopologicalSpace X] [T2Space X] [CompactSpace X] [ConnectedSpace X] [Nonempty X] [ChartedSpace ℂ X] [IsManifold (modelWithCornersSelf ℂ ℂ) ω X] : Type u := sorry
instance declaration uses `sorry`instAddCommGroup : AddCommGroup (Jacobian X) := sorry
instance declaration uses `sorry`instTopologicalSpace : TopologicalSpace (Jacobian X) := sorry
instance declaration uses `sorry`instT2Space : T2Space (Jacobian X) := sorry
instance declaration uses `sorry`instCompactSpace : CompactSpace (Jacobian X) := sorry
instance declaration uses `sorry`instChartedSpace : ChartedSpace (Fin (genus X) → ℂ) (Jacobian X) := sorry
instance declaration uses `sorry`instIsManifold : IsManifold (modelWithCornersSelf ℂ (Fin (genus X) → ℂ)) ω (Jacobian X) := sorry
instance declaration uses `sorry`instLieAddGroup : LieAddGroup (modelWithCornersSelf ℂ (Fin (genus X) → ℂ)) ω (Jacobian X) := sorry
def declaration uses `sorry`ofCurve (P : X) : X → Jacobian X := sorry
theorem declaration uses `sorry`ofCurve_contMDiff (P : X) : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ (Fin (genus X) → ℂ)) ω (ofCurve P) := sorry
theorem declaration uses `sorry`ofCurve_self (P : X) : ofCurve P P = 0 := sorry
theorem declaration uses `sorry`ofCurve_inj (P : X) (h : 0 < genus X) : Function.Injective (ofCurve P) := sorry
def declaration uses `sorry`pushforward (f : X → Y) (hf : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω f) : Jacobian X →ₜ+ Jacobian Y := sorry
theorem declaration uses `sorry`pushforward_contMDiff (f : X → Y) (hf : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω f) : ContMDiff (modelWithCornersSelf ℂ (Fin (genus X) → ℂ)) (modelWithCornersSelf ℂ (Fin (genus Y) → ℂ)) ω (pushforward f hf) := sorry
theorem declaration uses `sorry`pushforward_id_apply (P : Jacobian X) : pushforward id contMDiff_id P = P := sorry
theorem declaration uses `sorry`pushforward_comp_apply (f : X → Y) (hf : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω f) (g : Y → Z) (hg : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω g) (P : Jacobian X) : pushforward (g ∘ f) (hg.comp hf) P = pushforward g hg (pushforward f hf P) := sorry
def declaration uses `sorry`pullback (f : X → Y) (hf : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω f) : Jacobian Y →ₜ+ Jacobian X := sorry
theorem declaration uses `sorry`pullback_contMDiff (f : X → Y) (hf : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω f) : ContMDiff (modelWithCornersSelf ℂ (Fin (genus Y) → ℂ)) (modelWithCornersSelf ℂ (Fin (genus X) → ℂ)) ω (pullback f hf) := sorry
theorem declaration uses `sorry`pullback_id_apply (P : Jacobian X) : pullback id contMDiff_id P = P := sorry
theorem declaration uses `sorry`pullback_comp_apply (f : X → Y) (hf : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω f) (g : Y → Z) (hg : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω g) (P : Jacobian Z) : pullback (g.comp f) (hg.comp hf) P = pullback f hf (pullback g hg P) := sorry
def declaration uses `sorry`degree (f : X → Y) (hf : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω f) : ℕ := sorry -- 0 for constant case
theorem declaration uses `sorry`pushforward_pullback (f : X → Y) (hf : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω f) (P : Jacobian Y) : pushforward f hf (pullback f hf P) = (degree f hf) • P := sorry
#1
How produced

vanilla Claude Code using Opus 4.7, 4.8 and Fable 5. Partial ports from https://github.com/Brsanch/jacobian-lean-challenge https://github.com/tangentstorm/JacobianChallenge and https://github.com/mrdouglasny/jacobian-challenge.

First submissionJun 11, 2026
Last submissionJun 11, 2026
rkirov1
49Community multi-model project1 solved
Jacobian of a compact Riemann surface (Buzzard challenge)
jacobian_challenge_diffgeo

Verso theorem preview

def declaration uses `sorry`genus (X : Type u) [TopologicalSpace X] [T2Space X] [CompactSpace X] [ConnectedSpace X] [Nonempty X] [ChartedSpace ℂ X] [IsManifold (modelWithCornersSelf ℂ ℂ) ω X] : ℕ := sorry
theorem declaration uses `sorry`genus_eq_zero_iff_homeo : genus X = 0 ↔ Nonempty (X ≃ₜ (Metric.sphere (0 : EuclideanSpace ℝ (Fin 3)) 1)) := sorry
def declaration uses `sorry`Jacobian (X : Type u) [TopologicalSpace X] [T2Space X] [CompactSpace X] [ConnectedSpace X] [Nonempty X] [ChartedSpace ℂ X] [IsManifold (modelWithCornersSelf ℂ ℂ) ω X] : Type u := sorry
instance declaration uses `sorry`instAddCommGroup : AddCommGroup (Jacobian X) := sorry
instance declaration uses `sorry`instTopologicalSpace : TopologicalSpace (Jacobian X) := sorry
instance declaration uses `sorry`instT2Space : T2Space (Jacobian X) := sorry
instance declaration uses `sorry`instCompactSpace : CompactSpace (Jacobian X) := sorry
instance declaration uses `sorry`instChartedSpace : ChartedSpace (Fin (genus X) → ℂ) (Jacobian X) := sorry
instance declaration uses `sorry`instIsManifold : IsManifold (modelWithCornersSelf ℂ (Fin (genus X) → ℂ)) ω (Jacobian X) := sorry
instance declaration uses `sorry`instLieAddGroup : LieAddGroup (modelWithCornersSelf ℂ (Fin (genus X) → ℂ)) ω (Jacobian X) := sorry
def declaration uses `sorry`ofCurve (P : X) : X → Jacobian X := sorry
theorem declaration uses `sorry`ofCurve_contMDiff (P : X) : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ (Fin (genus X) → ℂ)) ω (ofCurve P) := sorry
theorem declaration uses `sorry`ofCurve_self (P : X) : ofCurve P P = 0 := sorry
theorem declaration uses `sorry`ofCurve_inj (P : X) (h : 0 < genus X) : Function.Injective (ofCurve P) := sorry
def declaration uses `sorry`pushforward (f : X → Y) (hf : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω f) : Jacobian X →ₜ+ Jacobian Y := sorry
theorem declaration uses `sorry`pushforward_contMDiff (f : X → Y) (hf : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω f) : ContMDiff (modelWithCornersSelf ℂ (Fin (genus X) → ℂ)) (modelWithCornersSelf ℂ (Fin (genus Y) → ℂ)) ω (pushforward f hf) := sorry
theorem declaration uses `sorry`pushforward_id_apply (P : Jacobian X) : pushforward id contMDiff_id P = P := sorry
theorem declaration uses `sorry`pushforward_comp_apply (f : X → Y) (hf : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω f) (g : Y → Z) (hg : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω g) (P : Jacobian X) : pushforward (g ∘ f) (hg.comp hf) P = pushforward g hg (pushforward f hf P) := sorry
def declaration uses `sorry`pullback (f : X → Y) (hf : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω f) : Jacobian Y →ₜ+ Jacobian X := sorry
theorem declaration uses `sorry`pullback_contMDiff (f : X → Y) (hf : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω f) : ContMDiff (modelWithCornersSelf ℂ (Fin (genus Y) → ℂ)) (modelWithCornersSelf ℂ (Fin (genus X) → ℂ)) ω (pullback f hf) := sorry
theorem declaration uses `sorry`pullback_id_apply (P : Jacobian X) : pullback id contMDiff_id P = P := sorry
theorem declaration uses `sorry`pullback_comp_apply (f : X → Y) (hf : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω f) (g : Y → Z) (hg : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω g) (P : Jacobian Z) : pullback (g.comp f) (hg.comp hf) P = pullback f hf (pullback g hg P) := sorry
def declaration uses `sorry`degree (f : X → Y) (hf : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω f) : ℕ := sorry -- 0 for constant case
theorem declaration uses `sorry`pushforward_pullback (f : X → Y) (hf : ContMDiff (modelWithCornersSelf ℂ ℂ) (modelWithCornersSelf ℂ ℂ) ω f) (P : Jacobian Y) : pushforward f hf (pullback f hf P) = (degree f hf) • P := sorry
#1
How produced

Multi-agent community project (mrdouglasny/jacobian-challenge) under light human steering; zero human-written Lean. Claude Code with Opus 4.8 and Sonnet 4.6 as the primary models (Claude Fable 5 only in the final ~2 days), Codex/GPT-5.4 rescue passes, and Gemini deep-think axiom vetting; ~8 weeks wall-clock. An independent, complementary solution to Rado Kirov's (the first lean-eval pass): a different construction (period-lattice / H1 route), with explicit positive-genus curve instances (elliptic, hyperelliptic, plane) and a machine-checked finding that Buzzard's 24 requirements are non-categorical, plus the Albanese universal-property repair. All 24 obligations sorry-free and axiom-free [propext, Classical.choice, Quot.sound], confirmed by a local Lean FRO comparator run on main. Builds on Rado Kirov's Dolbeault library (rkirov/jacobian-claude, Apache 2.0, vendored) and Michal Wallace's modules (tangentstorm/JacobianChallenge, MIT).

First submissionJun 15, 2026
Last submissionJun 15, 2026
mrdouglasny1
50Codex (with human in the loop)1 solved
Erdős's unit-distance conjecture is false
erdos_unit_distance_conjecture_false

Verso theorem preview

theorem declaration uses `sorry`erdos_unit_distance_conjecture_false : ∃ δ : ℝ, 0 < δ ∧ ∀ N : ℕ, ∃ (n : ℕ) (P : Finset (EuclideanSpace ℝ (Fin 2))), N ≤ n ∧ P.card = n ∧ (n : ℝ) ^ (1 + δ) ≤ (unitDist P : ℝ) := ⊢ ∃ δ, 0 < δ ∧ ∀ (N : ℕ), ∃ n P, N ≤ n ∧ P.card = n ∧ ↑n ^ (1 + δ) ≤ ↑(unitDist P) All goals completed! 🐙
#1
First submissionJun 26, 2026
Last submissionJun 26, 2026
plby1
51Claude Opus 4.8 + Fable 5 (multi-agent)1 solved
Chudnovsky formula for pi inverse
chudnovsky_formula_for_pi_inv

Verso theorem preview

theorem declaration uses `sorry`chudnovsky_formula_for_pi_inv : chudnovskySum = π⁻¹ := ⊢ chudnovskySum = π⁻¹ All goals completed! 🐙
#1
How produced

Formalization of Mathlib's chudnovskySum = π⁻¹ following Milla's complex-analytic proof (arXiv:1809.00533v6). Produced by Claude Opus 4.8 and Fable 5 (Claude Code) via multi-agent, file-parallel orchestration across multiple sessions; human direction/review at the architecture level (statement pinning, wave planning, output review). ~20.8k lines across 30 modules under Submission/Pi/. Axiom-clean: #print axioms yields exactly [propext, Classical.choice, Quot.sound] (no sorryAx). Toolchain leanprover/lean4:v4.32.0-rc1, Mathlib rev 360da6f.

First submissionJul 5, 2026
Last submissionJul 5, 2026
ldct1
52Hy31 solved
Catalan generating function via compositional inversion
substInv_X_sub_X_sq_eq_catalan

Verso theorem preview

theorem declaration uses `sorry`substInv_X_sub_X_sq_eq_catalan (n : ℕ) : haveI : Invertible (coeff 1 ((X : ℚ⟦X⟧) - X ^ 2)) := n:ℕ⊢ Invertible ((coeff 1) (X - X ^ 2)) n:ℕ⊢ Invertible 1; All goals completed! 🐙 coeff (n + 1) (substInv ((X : ℚ⟦X⟧) - X ^ 2)) = (Nat.choose (2 * n) n : ℚ) / (↑n + 1) := n:ℕ⊢ (coeff (n + 1)) (X - X ^ 2).substInv = ↑((2 * n).choose n) / (↑n + 1) All goals completed! 🐙
#1
How produced

Setup: Opencode with lean-lsp MCP installed, model "Hy3 Free" (under "Opencode Zen". Prompt: "prove Submission.lean". Solve time: 2 hours. Cost: $0.00.

First submissionJul 12, 2026
Last submissionJul 12, 2026
rwst1
53UNICO/NOUS pipeline - Claude (Anthropic)1 solved
Morley's trisector theorem
morley_theorem

Verso theorem preview

theorem declaration uses `sorry`morley_theorem (A B C P Q R : LeanEval.Geometry.Morley.Plane) (h : LeanEval.Geometry.Morley.IsMorleyConfiguration A B C P Q R) : LeanEval.Geometry.Morley.IsEquilateralTriple P Q R := A:PlaneB:PlaneC:PlaneP:PlaneQ:PlaneR:Planeh:IsMorleyConfiguration A B C P Q R⊢ IsEquilateralTriple P Q R All goals completed! 🐙
#1
How produced

Produced by an autonomous theorem-proving and certification pipeline built with Claude Code, directed and operated by a non-mathematician developer. All mathematics is AI-generated (Claude by Anthropic); exact polynomial cofactors for the `linear_combination` steps were computed symbolically with sympy and verified before kernel certification. The pipeline accepts nothing unless the local Lean kernel certifies it; this workspace was additionally verified locally with the official comparator at the CI-pinned tool commits (landrun `5ed4a3db`, lean4export `3de59f10`, comparator `71b52ec2`) on the pinned toolchain (v4.32.0-rc1): "Your solution is okay!". The proof is independent of all previously recorded solutions (none were consulted). It transports the benchmark's unoriented-angle configuration, via barycentric coordinates that recover the orientation sign from the convex-hull hypothesis, onto an oriented-ray complex-plane Morley development (Connes-style algebraic core closed by `linear_combination` with exact cofactors; ray-intersection master lemma; `Complex.arg` toolkit). A standalone statement with existence/uniqueness and non-degeneracy companions lives in the same repository (`UnicoProofs/Morley.lean`). Axioms: `propext`, `Classical.choice`, `Quot.sound` only - no `sorry`, no `native_decide`. Estimated cost: one afternoon of wall-clock time end-to-end (bridge design + proof + hardening, ~25 local kernel verdicts), subscription-based model usage, consumer Apple Silicon hardware. Human role: direction, operation and review of process - not of the mathematics. Context: announced on the Lean Zulip ("Morley's theorem (#84): AI-generated proof, please check", 2026-07-13, #AI authored projects), where Jeremy Chen kindly pointed us to this benchmark.

First submissionJul 13, 2026
Last submissionJul 13, 2026
Solarys4311
54Claude Fable 5 (orchestrating Opus/Sonnet 4.8)1 solved
Burnside p^a q^b theorem
finite_group_isSolvable_of_card_eq_prime_pow_mul_prime_pow

Verso theorem preview

theorem declaration uses `sorry`finite_group_isSolvable_of_card_eq_prime_pow_mul_prime_pow {G : Type*} [Group G] [Fintype G] {p q a b : ℕ} (hp : Nat.Prime p) (hq : Nat.Prime q) (hpq : p ≠ q) (hcard : Fintype.card G = p ^ a * q ^ b) : Group.IsSolvable G := G:Type u_1inst✝¹:Group Ginst✝:Fintype Gp:ℕq:ℕa:ℕb:ℕhp:Nat.Prime phq:Nat.Prime qhpq:p ≠ qhcard:Fintype.card G = p ^ a * q ^ b⊢ Group.IsSolvable G All goals completed! 🐙
#1
How produced

Claude Fable 5 orchestrating fresh subagents (Fable/Sonnet implementers, adversarial reviewers per task) under human direction (Ian Klatzco, Rado Kirov). Clean-room w.r.t. the seven prior leaderboard solutions.

First submissionJul 14, 2026
Last submissionJul 14, 2026
ianklatzco1
55GPT-5.6 (human-in-the-loop)1 solved
Existence of a simple group of order 10200960 with a 22-dim irrep whose tensor square has 4 isotypic components
m23_irrep_tensor_square_decomp

Verso theorem preview

theorem declaration uses `sorry`m23_irrep_tensor_square_decomp : ∃ (G : Type) (_ : Group G) (_ : Fintype G), Fintype.card G = 10200960 ∧ IsSimpleGroup G ∧ ∃ (V : Type) (_ : AddCommGroup V) (_ : Module ℂ V) (ρ : Representation ℂ G V), Module.finrank ℂ V = 22 ∧ ρ.IsIrreducible ∧ (@isotypicComponents (MonoidAlgebra ℂ G) (V ⊗[ℂ] V) _ _ (Module.compHom (V ⊗[ℂ] V) (Representation.asAlgebraHom (ρ.tprod ρ)).toRingHom)).ncard = 4 := ⊢ ∃ G x x_1, Fintype.card G = 10200960 ∧ IsSimpleGroup G ∧ ∃ V x_2 x_3 ρ, Module.finrank ℂ V = 22 ∧ ρ.IsIrreducible ∧ (isotypicComponents (MonoidAlgebra ℂ G) (V ⊗[ℂ] V)).ncard = 4 All goals completed! 🐙
#1
How produced

Running GPT-5.6-sol in opencode with some minimal human guidance. Used most of a $20 Codex sub's weekly limit with estimated API cost of $106.

First submissionJul 14, 2026
Last submissionJul 14, 2026
matthewjasper1
56Various models ( with human in the loop )1 solved
Feit–Thompson odd-order theorem
feit_thompson

Verso theorem preview

theorem declaration uses `sorry`feit_thompson {G : Type*} [Group G] [Finite G] (_h : Odd (Nat.card G)) : Group.IsSolvable G := G:Type u_1inst✝¹:Group Ginst✝:Finite G_h:Odd (Nat.card G)⊢ Group.IsSolvable G All goals completed! 🐙
#1
How produced

This submission was produced with assistance from Codex 5.5 and 5.6, and Claude Code using Opus 4.7, Opus 4.8, and Fable 5, with human direction, review, and integration throughout.

First submissionJul 16, 2026
Last submissionJul 16, 2026
yawara1
57Trellis1 solved
Spencer-Szemerédi-Trotter unit-distance upper bound
unit_distance_upper_bound

Verso theorem preview

theorem declaration uses `sorry`unit_distance_upper_bound : ∃ C : ℝ, 0 < C ∧ ∀ P : Finset (EuclideanSpace ℝ (Fin 2)), (unitDist P : ℝ) ≤ C * (P.card : ℝ) ^ ((4 : ℝ) / 3) := ⊢ ∃ C, 0 < C ∧ ∀ (P : Finset (EuclideanSpace ℝ (Fin 2))), ↑(unitDist P) ≤ C * ↑P.card ^ (4 / 3) All goals completed! 🐙
#1
How produced

Trellis ran autonomously for 3 weeks, from 6/29/2026 through 7/20/2026 on the usage budget of a single ChatGPT Pro account. The only input was a 16-page .tex manuscript based on Székely's paper, “Crossing Numbers and Hard Erdős Problems in Discrete Geometry," but including detailed plane graph preliminaries. The public Trellis repo for this formalization is at https://github.com/wpegden/crossing-consequences/ It includes a cycle-by-cycle view of every edit made over time to the formalization by the Trellis process. The reference paper (prepared by ChatGPT Pro) is also available there. This single Trellis run formalized the following theorems (all consequences of the Crossing Lemma, below): *) Szemerédi–Trotter / Point-line incidences: There is an absolute constant C such that for any n points and ℓ lines in the plane, the number of point-line incidences is at most C·((nℓ)^(2/3) + n + ℓ). *) Rich lines: There is an absolute constant C such that, for 2 ≤ k ≤ √n, the number of lines containing at least k points from an n-point set is at most C·n²/k³. *) Unit distances (the challenge target) There is an absolute constant C such that every set of n points in the plane determines at most C·n^(4/3) unit distances. Trellis formalized these by defining plane drawings of graphs with polygonal edges and formalizing the Crossing Lemma with respect to polygonal drawings: For a simple graph with n ≥ 1 vertices and e edges, if e ≥ 4n then the crossing number satisfies cr(G) ≥ e³/(100n²). From the time Trellis started the challenge to when it finished, the pinned mathlib version changed from v4.30.0-rc2 to v4.32.0-rc1. Thus, after the autonomous run completed, minor edits were necessary to make the project still build against the new challenge mathlib version. These were made by a single codex agent outside the Trellis formalization, given precisely that task. The version before these edits can be seen either at the public repo linked above or as the first commit of this challenge repo.

First submissionJul 20, 2026
Last submissionJul 20, 2026
wpegden1
58UNICO/NOUS: Claude (Fable 5 + Opus 4.8) + GPT-5.6-Sol1 solved
Platonic classification
platonic_classification

Verso theorem preview

theorem declaration uses `sorry`platonic_classification : platonicCount 2 = ⊤ ∧ platonicCount 3 = 5 ∧ platonicCount 4 = 6 ∧ ∀ d, 5 ≤ d → platonicCount d = 3 := ⊢ platonicCount 2 = ⊤ ∧ platonicCount 3 = 5 ∧ platonicCount 4 = 6 ∧ ∀ (d : ℕ), 5 ≤ d → platonicCount d = 3 All goals completed! 🐙
#1
How produced

Produced by UNICO/NOUS, a multi-model pipeline: Claude Fable 5 as the orchestrator in the main loop, with GPT-5.6-Sol (via Codex CLI) and Claude Opus 4.8 as prover/builder agents. A Python numerical scout computed exact golden-ratio data (flags, exposing functionals, wall reflections of the 24-cell, 600-cell and 120-cell) that guided the Lean formalization; every step was then proved from scratch and kernel-checked. Human direction throughout (strategy, adversarial review gates, final audits). The final theorem depends only on [propext, Classical.choice, Quot.sound]; no sorry, axiom or native_decide anywhere in the submission. Solved 2026-07-18 to 2026-07-21. (Third attempt: the repo is now structured as a generated workspace importing ChallengeDeps, root theorem in the Submission namespace; Solution.lean builds in a local replica of the CI environment.)

First submissionJul 21, 2026
Last submissionJul 21, 2026
Solarys4311
59various model (deepseek-v4, gpt-5.*)1 solved
Feit–Thompson odd-order theorem
feit_thompson

Verso theorem preview

theorem declaration uses `sorry`feit_thompson {G : Type*} [Group G] [Finite G] (_h : Odd (Nat.card G)) : Group.IsSolvable G := G:Type u_1inst✝¹:Group Ginst✝:Finite G_h:Odd (Nat.card G)⊢ Group.IsSolvable G All goals completed! 🐙
#1
First submissionJul 24, 2026
Last submissionJul 24, 2026
ivwumupy1
60Fable 5 and GPT-5.61 solved
Neukirch–Uchida theorem
neukirch_uchida

Verso theorem preview

theorem declaration uses `sorry`neukirch_uchida {K₁ K₂ K₁' K₂' : Type*} [Field K₁] [Field K₂] [Field K₁'] [Field K₂'] [NumberField K₁] [NumberField K₂] [Algebra K₁ K₁'] [Algebra K₂ K₂'] [IsSepClosure K₁ K₁'] [IsSepClosure K₂ K₂'] (ϕ : Gal(K₁'/K₁) ≃* Gal(K₂'/K₂)) (he : IsHomeomorph ϕ) : ∃! σ : K₂' ≃+* K₁', (algebraMap K₂ K₂').range.map σ.toRingHom = (algebraMap K₁ K₁').range ∧ ∀ g : Gal(K₁'/K₁), ϕ g = σ.trans (g.toRingEquiv.trans σ.symm) := K₁:Type u_1K₂:Type u_2K₁':Type u_3K₂':Type u_4inst✝⁹:Field K₁inst✝⁸:Field K₂inst✝⁷:Field K₁'inst✝⁶:Field K₂'inst✝⁵:NumberField K₁inst✝⁴:NumberField K₂inst✝³:Algebra K₁ K₁'inst✝²:Algebra K₂ K₂'inst✝¹:IsSepClosure K₁ K₁'inst✝:IsSepClosure K₂ K₂'ϕ:Gal(K₁'/K₁) ≃* Gal(K₂'/K₂)he:IsHomeomorph ⇑ϕ⊢ ∃! σ, Subring.map σ.toRingHom (algebraMap K₂ K₂').range = (algebraMap K₁ K₁').range ∧ ∀ (g : Gal(K₁'/K₁)), (ϕ g).toRingEquiv = σ.trans (g.toRingEquiv.trans σ.symm) All goals completed! 🐙
#1
First submissionJul 25, 2026
Last submissionJul 25, 2026
adamtopaz1
61OpenAI Codex (GPT-5.6 Sol), Claude Code (Opus 5 and Opus 4.8)1 solved
Schoenflies theorem
schoenflies

Verso theorem preview

theorem declaration uses `sorry`schoenflies (r : Metric.sphere (0 : EuclideanSpace ℝ (Fin 2)) 1 → EuclideanSpace ℝ (Fin 2)) (_hcont : Continuous r) (_hinj : Function.Injective r) : ∃ h : EuclideanSpace ℝ (Fin 2) ≃ₜ EuclideanSpace ℝ (Fin 2), h '' Set.range r = Metric.sphere (0 : EuclideanSpace ℝ (Fin 2)) 1 := r:↑(Metric.sphere 0 1) → EuclideanSpace ℝ (Fin 2)_hcont:Continuous r_hinj:Function.Injective r⊢ ∃ h, ⇑h '' Set.range r = Metric.sphere 0 1 All goals completed! 🐙
#1
How produced

Produced with OpenAI Codex (GPT-5.6 Sol), following initial evaluator-format investigation with Claude Opus 5 / 4.8. The proof builds on TauCeti and Jordan curve theorem ports. Human involvement focused on direction, review, and submission approval. Approximate effort: 4 hours human time and 4 days AI harness runtime; token and monetary costs were not tracked.

First submissionAug 4, 2026
Last submissionAug 4, 2026
rigwild1
62GPT-5.6 Codex (public-proof reproduction)1 solved
pi_(n+1) of S^n is Z/2 for n at least 3
pi_succ_sphere_n_mulEquiv_zmod_two

Verso theorem preview

theorem declaration uses `sorry`pi_succ_sphere_n_mulEquiv_zmod_two (n : ℕ) (hn : 3 ≤ n) (x : Metric.sphere (0 : EuclideanSpace ℝ (Fin (n + 1))) 1) : Nonempty (HomotopyGroup.Pi (n + 1) (Metric.sphere (0 : EuclideanSpace ℝ (Fin (n + 1))) 1) x ≃* Multiplicative (ZMod 2)) := n:ℕhn:3 ≤ nx:↑(Metric.sphere 0 1)⊢ Nonempty (HomotopyGroup.Pi (n + 1) (↑(Metric.sphere 0 1)) x ≃* Multiplicative (ZMod 2)) All goals completed! 🐙
#1
How produced

This is a provenance-explicit reproduction of Kenta Kitamura's public Apache-2.0 proof, originally accepted by lean-eval in issue #957 from commit `5bef8d13ebee0f36b74d525ca968a88ab097d0f4`. Codex orchestrated subagents to transplant that proof to benchmark commit `5334853`, apply mechanical Lean 4.32.2 linter/deprecation cleanups, and verify it. No claim of original proof authorship is made.

First submissionAug 7, 2026
Last submissionAug 7, 2026
Vilin971
63GPT-5 Codex1 solved
Cayley graph connected iff generators generate the group
mulCayley_connected_iff_closure_eq_top

Verso theorem preview

theorem declaration uses `sorry`mulCayley_connected_iff_closure_eq_top {G : Type*} [Group G] (S : Set G) : (SimpleGraph.mulCayley S).Connected ↔ Subgroup.closure S = ⊤ := G:Type u_1inst✝:Group GS:Set G⊢ (SimpleGraph.mulCayley S).Connected ↔ Subgroup.closure S = ⊤ All goals completed! 🐙
#1
How produced

Produced autonomously by OpenAI Codex in a user-directed lean-eval session. The proof characterizes the identity component of the multiplicative Cayley graph as the subgroup closure: walks preserve closure membership, while reachability is closed under generators, multiplication, and inverses via left-translation graph homomorphisms. Verified warning-free with Lean 4.32.2 and accepted end-to-end by comparator, the Lean kernel, and nanoda.

First submissionAug 12, 2026
Last submissionAug 12, 2026
Vilin971
64OpenAI Codex (GPT-5)1 solved
Mihăilescu's theorem
mihailescu

Verso theorem preview

theorem declaration uses `sorry`mihailescu {x y m n : ℕ} (hx : 0 < x) (hy : 0 < y) (hm : 1 < m) (hn : 1 < n) (h : x ^ m = y ^ n + 1) : x = 3 ∧ y = 2 ∧ m = 2 ∧ n = 3 := x:ℕy:ℕm:ℕn:ℕhx:0 < xhy:0 < yhm:1 < mhn:1 < nh:x ^ m = y ^ n + 1⊢ x = 3 ∧ y = 2 ∧ m = 2 ∧ n = 3 All goals completed! 🐙
#1
How produced

Produced by OpenAI Codex (GPT-5) in a persistent multi-agent coding session, with the user specifying the theorem, formal constraints, and official-submission requirement. The primary agent integrated parallel mathlib/API scouting, proof development, and independent case audits. The development includes a complete formal proof, a detailed informal proof, and a dependency blueprint; final validation used warnings-as-errors, prohibited-token scans, project target builds, repository policy validation, and an axiom audit showing only `propext`, `Classical.choice`, and `Quot.sound`. Approximately 33 hours of agent wall-clock work and 33 million model tokens were used.

First submissionAug 13, 2026
Last submissionAug 13, 2026
Vilin971
65Claude Fable 5 (Claude Code)1 solved
On a conjecture of Marton
annals_conjecture_of_marton

Verso theorem preview

theorem declaration uses `sorry`theorem_1_2 (A : Set (ConjectureOfMarton.F n)) (K : ℝ) (h₀ : A.Nonempty) (h : (A + A).ncard ≤ K * A.ncard) : ∃ H : AddSubgroup (ConjectureOfMarton.F n), Nat.card H ≤ A.ncard ∧ CovByVAdd (ConjectureOfMarton.F n) (2 * K ^ 12) A H := n:ℕA:Set (F n)K:ℝh₀:A.Nonemptyh:↑(A + A).ncard ≤ K * ↑A.ncard⊢ ∃ H, Nat.card ↥H ≤ A.ncard ∧ CovByVAdd (F n) (2 * K ^ 12) A ↑H All goals completed! 🐙
#1
How produced

Claude Fable 5 running in Claude Code, directed by a human. The mathematical content is the public [teorth/pfr](https://github.com/teorth/pfr) project — the Lean 4 formalization of Gowers–Green–Manners–Tao, *On a conjecture of Marton*, led by Terence Tao with many contributors. The agent vendored the import closure of `PFR.Main` (41 modules, pfr commit `7d6404b79b`, Lean v4.33.0, Apache 2.0, license and attribution included) under `Submission/PFR/` with imports renamed `PFR.*` → `Submission.PFR.*`, then wrote a ~12-line glue proof bridging `PFR_conjecture` to the benchmark statement (`Submodule (ZMod 2)` → `AddSubgroup`, finite cover → `Finset` for `CovByVAdd`, `K ^ (12 : ℝ)` rpow → `K ^ (12 : ℕ)`). All credit for the mathematics and formalization belongs to the paper's authors and the pfr contributors; this submission is an integration, not an original proof. Roughly 1.5 hours wall clock end to end, including selecting the target and verifying axioms (`propext`, `Classical.choice`, `Quot.sound` only).

First submissionAug 18, 2026
Last submissionAug 18, 2026
homeowmorphism1
66github.com/mlgraham — public accepted source, packaged (Claude Fable 5)1 solved
Catalan generating function via compositional inversion
substInv_X_sub_X_sq_eq_catalan

Verso theorem preview

theorem declaration uses `sorry`substInv_X_sub_X_sq_eq_catalan (n : ℕ) : haveI : Invertible (coeff 1 ((X : ℚ⟦X⟧) - X ^ 2)) := n:ℕ⊢ Invertible ((coeff 1) (X - X ^ 2)) n:ℕ⊢ Invertible 1; All goals completed! 🐙 coeff (n + 1) (substInv ((X : ℚ⟦X⟧) - X ^ 2)) = (Nat.choose (2 * n) n : ℚ) / (↑n + 1) := n:ℕ⊢ (coeff (n + 1)) (X - X ^ 2).substInv = ↑((2 * n).choose n) / (↑n + 1) All goals completed! 🐙
#1
How produced

This is a packaged copy of a published, previously accepted solution — not an original proof. Source: the `savarin-6-hour-gpt-5.6-speedrun` entry's public repository (savarin/lean-eval-speedrun @ ab459a1ea7a89ec6db93da77d522ea384a45d0aa, Apache-2.0, published 2026-08-17), whose solution to this problem was accepted by the comparator. Claude Fable 5 (Claude Code), under human direction, located the published source via the public results store, verified its Apache-2.0 license, regenerated a fresh workspace from the current leanprover/lean-eval benchmark, copied `Submission.lean`/`Submission/Helpers.lean` unmodified, and rebuilt locally against the current trusted `Challenge.lean` (`lake build`; the full comparator replay was left to this pipeline because `landrun` is Linux-only). The original LICENSE is included in the submission repository. Purpose: pipeline validation for a pre-registered research gate; est. cost ~$0 API spend, <1h combined human/AI time for this problem.

First submissionAug 20, 2026
Last submissionAug 20, 2026
mlgraham1
67DeepScientist + GPT-5.61 solved
A counterexample to the unit conjecture for group rings
annals_unit_conjecture

Verso theorem preview

theorem declaration uses `sorry`theorem_A : (∀ g : UnitConjecture.P, ∀ n ≠ 0, g ^ n = 1 → g = 1) ∧ IsUnit UnitConjecture.u ∧ ¬ ∃ g : UnitConjecture.P, UnitConjecture.u = g := ⊢ (∀ (g : P) (n : ℕ), n ≠ 0 → g ^ n = 1 → g = 1) ∧ IsUnit u ∧ ¬∃ g, u = (MonoidAlgebra.of (ZMod 2) P) g All goals completed! 🐙
#1
How produced

DeepScientist mathematical research and Team mode using GPT-5.6, with Lean 4 kernel-guided iteration and official LeanEval comparator, nanoda, and Lean kernel verification.

First submissionAug 22, 2026
Last submissionAug 22, 2026
LikC16061
68OpenAI Codex (GPT-5.6 Sol)1 solved
Chen's theorem
chen_theorem

Verso theorem preview

theorem declaration uses `sorry`chen_theorem : {p : ℕ | p.Prime ∧ LeanEval.NumberTheory.ChenTheorem.HasAtMostTwoPrimeFactors (p + 2)}.Infinite := ⊢ {p | Nat.Prime p ∧ HasAtMostTwoPrimeFactors (p + 2)}.Infinite All goals completed! 🐙
#1
How produced

OpenAI Codex (GPT-5.6 Sol) migrated and adapted an existing Lean formalization into the generated Lean Eval workspace under user direction, normalized local module paths and namespaces, added the final theorem bridge, repaired Lean 4.33 compatibility issues, and completed local `lake build Solution` and default builds. The final theorem was audited to use only the permitted axioms.

First submissionAug 31, 2026
Last submissionAug 31, 2026
Cond-t1
69LeanEval production launch canary 3dc17f41ccd0c86fa443687fac784a42f37981831 solved
Catalan generating function via compositional inversion
substInv_X_sub_X_sq_eq_catalan

Verso theorem preview

theorem declaration uses `sorry`substInv_X_sub_X_sq_eq_catalan (n : ℕ) : haveI : Invertible (coeff 1 ((X : ℚ⟦X⟧) - X ^ 2)) := n:ℕ⊢ Invertible ((coeff 1) (X - X ^ 2)) n:ℕ⊢ Invertible 1; All goals completed! 🐙 coeff (n + 1) (substInv ((X : ℚ⟦X⟧) - X ^ 2)) = (Nat.choose (2 * n) n : ℚ) / (↑n + 1) := n:ℕ⊢ (coeff (n + 1)) (X - X ^ 2).substInv = ↑((2 * n).choose n) / (↑n + 1) All goals completed! 🐙
#1
First submissionSep 2, 2026
Last submissionSep 2, 2026
kim-em1
70BRILLiant + ChatGPT 5.6 Sol1 solved
A counterexample to the unit conjecture for group rings
annals_unit_conjecture

Verso theorem preview

theorem declaration uses `sorry`theorem_A : (∀ g : UnitConjecture.P, ∀ n ≠ 0, g ^ n = 1 → g = 1) ∧ IsUnit UnitConjecture.u ∧ ¬ ∃ g : UnitConjecture.P, UnitConjecture.u = g := ⊢ (∀ (g : P) (n : ℕ), n ≠ 0 → g ^ n = 1 → g = 1) ∧ IsUnit u ∧ ¬∃ g, u = (MonoidAlgebra.of (ZMod 2) P) g All goals completed! 🐙
#1
First submissionSep 2, 2026
Last submissionSep 2, 2026
LexBrill1
71OpenAI Codex (GPT-6 + GPT-5.6 Sol)1 solved
Chen's theorem
chen_theorem

Verso theorem preview

theorem declaration uses `sorry`chen_theorem : {p : ℕ | p.Prime ∧ LeanEval.NumberTheory.ChenTheorem.HasAtMostTwoPrimeFactors (p + 2)}.Infinite := ⊢ {p | Nat.Prime p ∧ HasAtMostTwoPrimeFactors (p + 2)}.Infinite All goals completed! 🐙
#1
How produced

Developed under human direction in OpenAI Codex using GPT-6 and GPT-5.6 Sol. This submission adapts the completed formalization at https://github.com/lixiang90/chen_theorem/tree/3264ad6acafa64ada18a309f48350d9acfd261ef and specializes its fixed-even-shift theorem to shift 2, proving the benchmark's exact prime-or-semiprime predicate. The original Lean 4.32.2 project passed its full build and a transitive axiom audit of all 9,571 declarations across 415 local modules. This exact submission now also passes the complete `lake build Solution` under the benchmark's fixed Lean 4.33.0 and Mathlib revision (9,120 Lake jobs). Both `Submission.chen_theorem` and the trusted `Solution` theorem `chen_theorem` were audited with `#print axioms`, and each depends only on propext, Classical.choice, and Quot.sound. Official comparator and independent nanoda verification is requested for this exact snapshot. All local helpers are included under Submission/. Prior work includes Mathlib and selected Apache-2.0 PNT, Mertens, and Perron proofs from PrimeNumberTheoremAnd commit c6c73610b406689c4b58325cbe1342ecca25d755, with notices and provenance retained. The sieve and Dirichlet zero-free-region proof chain, including the final ineffective real Siegel bound, is included locally. No first-proof or first-submission priority is claimed. This is a corrected resubmission of https://github.com/leanprover/lean-eval-submissions/issues/1695. Seven module-level version compatibility adjustments are recorded in COMPATIBILITY.json and hashed in PROVENANCE.json. They update proof steps for the pinned library without changing theorem statements or adding assumptions. The trusted benchmark files remain byte-for-byte unchanged.

First submissionSep 7, 2026
Last submissionSep 7, 2026
lixiang901
72(various models)1 solved
Klartag's construction of lattice sphere packings
klartag_packing

Verso theorem preview

theorem declaration uses `sorry`klartag_packing : ∃ c : ℝ, 0 < c ∧ ∀ n : ℕ, let V := EuclideanSpace ℝ (Fin (n + 1)) ∃ φ : V →ₗ[ℝ] V, let E := φ '' Metric.ball (0 : V) 1 (MeasureTheory.volume E : EReal) = c * n ^ 2 ∧ {v ∈ E | ∀ i, v i ∈ Set.range ((↑) : ℤ → ℝ)} = {0} := ⊢ ∃ c, 0 < c ∧ ∀ (n : ℕ), let V := EuclideanSpace ℝ (Fin (n + 1)); ∃ φ, let E := ⇑φ '' Metric.ball 0 1; ↑(MeasureTheory.volume E) = ↑c * ↑n ^ 2 ∧ {v | v ∈ E ∧ ∀ (i : Fin (n + 1)), v.ofLp i ∈ Set.range Int.cast} = {0} All goals completed! 🐙
#1
How produced

Original proof of klartag_packing (Klartag, "Lattice packing of spheres in high dimensions using a stochastically evolving ellipsoid": an ellipsoid in R^(n+1) of volume c·n^2 whose only lattice point is the origin). Produced with Claude Code under human direction, from the Challenge, Mathlib source search, the published paper and compiler feedback only. No lean-eval solution was consulted; none exists for this problem. 176 modules in the import closure of the final theorem, 42,009 lines (the whole Submission/ tree is 186 modules, 42,821 lines); no `sorry`, no `native_decide`; `#print axioms klartag_packing` reports exactly propext, Classical.choice, Quot.sound, and every one of the 4,076 declarations in the closure was swept. No vendored or third-party code: every line is original to this submission. Mathlib pinned at 6f1ef4e5dd604a435bddba4747b13970cd65d2a1, toolchain v4.33.0. Verified from a fresh clone: `lake exe cache get && lake build` completes 8889 jobs; the proved theorem's type is definitionally the challenge statement (both directions elaborate). Method, in the order the obstructions fell: - The stochastically evolving ellipsoid is discretised: a Gaussian chain with step h = n^-9 over N = ceil(16 n^7 log n) steps replaces the diffusion, so no stochastic calculus is formalised; the only analysis is a one-step log-determinant inequality (an upper form and a sharp lower form) and a Gaussian fourth-moment bound. - The lattice is a Construction-A lattice (the kernel of a linear form modulo a prime), which replaces the Siegel mean-value argument; the contact points are counted through a radial profile bound (the paper's Lemma 4.3) with an explicit peak, and a light-contact vector is selected by averaging a weighted count over the nonzero forms. - The good event is controlled by a stopped chain: the log-determinant is a supermartingale-type sum whose variance is bounded (Var ≤ T·n/m^2), and the shortfall is bounded directly, without tail estimates or a Markov floor. - Every log n in the final budget is cancelled by another log n; the constants are explicit (C' = 10^7, terminal weight coefficient 140/n^2, count threshold 10^4·n^2, integrated threshold n-free at 2.8·10^6), and the proved ceilings give a budget of 0.545 < 1 uniformly in n.

First submissionSep 13, 2026
Last submissionSep 13, 2026
mlgraham1
73LeanEval P1 launch canary1 solved
Klartag's construction of lattice sphere packings
klartag_packing

Verso theorem preview

theorem declaration uses `sorry`klartag_packing : ∃ c : ℝ, 0 < c ∧ ∀ n : ℕ, let V := EuclideanSpace ℝ (Fin (n + 1)) ∃ φ : V →ₗ[ℝ] V, let E := φ '' Metric.ball (0 : V) 1 (MeasureTheory.volume E : EReal) = c * n ^ 2 ∧ {v ∈ E | ∀ i, v i ∈ Set.range ((↑) : ℤ → ℝ)} = {0} := ⊢ ∃ c, 0 < c ∧ ∀ (n : ℕ), let V := EuclideanSpace ℝ (Fin (n + 1)); ∃ φ, let E := ⇑φ '' Metric.ball 0 1; ↑(MeasureTheory.volume E) = ↑c * ↑n ^ 2 ∧ {v | v ∈ E ∧ ∀ (i : Fin (n + 1)), v.ofLp i ∈ Set.range Int.cast} = {0} All goals completed! 🐙
#1
First submissionSep 13, 2026
Last submissionSep 13, 2026
kim-em1
74Codex 5.6 Sol + HITL1 solved
Lagarias criterion is equivalent to RH
riemann_hypothesis_iff_lagarias_elementary_criterion

Verso theorem preview

theorem declaration uses `sorry`riemann_hypothesis_iff_lagarias_elementary_criterion : RiemannHypothesis ↔ LeanEval.NumberTheory.LagariasElementaryCriterion := ⊢ RiemannHypothesis ↔ LagariasElementaryCriterion All goals completed! 🐙
#1
How produced

Codex with ChatGPT 5.6 Sol (Extra High) was used with a custom context system that locates/translates source theorems and plans the autoformalization using human input along the way when issues arose. Subscription billing, not tracked. Overall about 4 days for Robin's theorem, about 1 day for extension to Lagarias's theorem.

First submissionSep 13, 2026
Last submissionSep 13, 2026
kimihiro641
75Fable 5.1 and GPT-61 solved
Generalized topological Poincaré conjecture in dimensions ≥ 5 (Smale)
poincare_high_dim_topological

Verso theorem preview

theorem declaration uses `sorry`poincare_high_dim_topological {n : ℕ} (_h5 : 5 ≤ n) {M : Type*} [TopologicalSpace M] [T2Space M] [ChartedSpace (EuclideanSpace ℝ (Fin n)) M] (_h : M ≃ₕ sphere (0 : EuclideanSpace ℝ (Fin (n + 1))) 1) : Nonempty (M ≃ₜ sphere (0 : EuclideanSpace ℝ (Fin (n + 1))) 1) := n:ℕ_h5:5 ≤ nM:Type u_1inst✝²:TopologicalSpace Minst✝¹:T2Space Minst✝:ChartedSpace (EuclideanSpace ℝ (Fin n)) M_h:M ≃ₕ ↑(sphere 0 1)⊢ Nonempty (M ≃ₜ ↑(sphere 0 1)) All goals completed! 🐙
#1
First submissionSep 26, 2026
Last submissionSep 26, 2026
will14911
Coverage

Per-problem coverage

Which problems each model has solved. Hidden on narrow screens.

ProblemAxiom Prover (Axiom Math)Humanifa + GPT 5.6 solTau (caj.al)Aristotle (Harmonic)Seed Prover (ByteDance)GPT-5.6Stealth ModelNEAR AI w/ DeepSeek V4Vasily-24-hour-gpt-5.6-speedrunmax gp (GPT-6)Aleph Prover(logicalintelligence.com)Midasgithub.com/mlgraham (various models)MerLean-ProverAntigravity (Multi-Model Ensemble: Gemini 3.1 Pro, Gemini 3 Flash, Claude 4.6 Sonnet/Opus)savarin-6-hour-gpt-5.6-speedrunClaude Opus 4.7 (1M context)GPT-5.5github.com/mlgraham (Claude Fable 5)EVO (deepthought.com.au)Public accepted source + Codex packagingHumanize2 flame chase: GPT-5.6-sol + Claude Opus 5GPT-5.6 SoltrureturingOpus-5Claude Fable 5ForgeIvan BogatyyDeepSeek V4 FlashGrok 4.5deepseek-v4 and gpt-5.xmostly ChatGPT 5.6 SolGPT-5.5 CodexGemini 3.1 Pro[submission] aegis-of-the-unit-circle-logosEVOClaude Opus 4.8 (1M context)Kimi K2.7GPT-5.6 and Fable 5 (human-in-the-loop)Humanize RLCR: GPT-5.6-sol (max) worker + reviewerForall (Astrio)trureturningClaude Opus 4.7Claude Opus 4.7 + GPT-5.5 (human-in-the-loop)GPT-5 Codex + AristotleAutoform-BotLeanstral 1.4Claude Opus 4.7, 4.8 and Fable 5 + OSS contributionsCommunity multi-model projectCodex (with human in the loop)Claude Opus 4.8 + Fable 5 (multi-agent)Hy3UNICO/NOUS pipeline - Claude (Anthropic)Claude Fable 5 (orchestrating Opus/Sonnet 4.8)GPT-5.6 (human-in-the-loop)Various models ( with human in the loop )TrellisUNICO/NOUS: Claude (Fable 5 + Opus 4.8) + GPT-5.6-Solvarious model (deepseek-v4, gpt-5.*)Fable 5 and GPT-5.6OpenAI Codex (GPT-5.6 Sol), Claude Code (Opus 5 and Opus 4.8)GPT-5.6 Codex (public-proof reproduction)GPT-5 CodexOpenAI Codex (GPT-5)Claude Fable 5 (Claude Code)github.com/mlgraham — public accepted source, packaged (Claude Fable 5)DeepScientist + GPT-5.6OpenAI Codex (GPT-5.6 Sol)LeanEval production launch canary 3dc17f41ccd0c86fa443687fac784a42f3798183BRILLiant + ChatGPT 5.6 SolOpenAI Codex (GPT-6 + GPT-5.6 Sol)(various models)LeanEval P1 launch canaryCodex 5.6 Sol + HITLFable 5.1 and GPT-6
No bounded projection from L^1 onto H^1main✓✓✓✓✓✓✓————————————————————————————————————————————————————————————————————
Abel–Ruffini theoremmain✓✓✓✓✓✓✓—✓—✓——✓————————————————————————————————✓————————————————————————————
Ado's theorem in characteristic zeromain✓✓✓✓✓———————————————————✓——————————————————————————————————————————————————
Ado–Iwasawa theorem over an arbitrary fieldmain✓✓✓✓————————————————————✓——————————————————————————————————————————————————
The alternating sign matrix theoremmain✓✓✓✓✓——————————————————————————————————————————————————————————————————————
Absolute profinite rigidity and hyperbolic geometrymain———————————————————————————————————————————————————————————————————————————
Algebraic integers with conjugates in a prescribed distributionmain✓✓✓————✓—✓—✓—————————✓—————————————————————————————————————————————————————
The energy of dilute Bose gasesmain✓✓—————✓—✓—————————————————————————————————————————————————————————————————
Higher uniformity of bounded multiplicative functions in short intervals on averagemain✓✓—————✓———————————————————————————————————————————————————————————————————
On the Chowla and twin primes conjectures over 𝔽_q[T]main———————————————————————————————————————————————————————————————————————————
On a conjecture of Martonmain✓✓✓—————————————————————————————————————————————————————————————✓——————————
The Weyl bound for Dirichlet L-functions of cube-free conductormain———————————————————————————————————————————————————————————————————————————
On the Duffin-Schaeffer conjecturemain✓✓✓————✓—✓———————————✓—————————————————————————————————————————————————————
Enumerating number fieldsmain✓✓✓————✓—✓—————————————————————————————————————————————————————————————————
Equiangular lines with a fixed anglemain✓✓✓✓———✓—✓—✓——————————————✓————————————————————————————————————————————————
A proof of the Erdős–Faber–Lovász conjecturemain✓✓—————✓—✓—————————————————————————————————————————————————————————————————
A conjecture of Erdős, supersingular primes and short character sumsmain———————————————————————————————————————————————————————————————————————————
Finite-time singularity formation for C^{1,α} solutions to the incompressible Euler equations on ℝ³main✓✓———————✓—————————————————————————————————————————————————————————————————
Flat Littlewood polynomials existmain✓✓✓————✓—✓—✓———————————————————————————————————————————————————————————————
Fractal uncertainty in higher dimensionsmain✓✓✓————✓—✓—————————————————————————————————————————————————————————————————
Thresholds versus fractional expectation-thresholdsmain✓✓✓✓———✓—✓—✓———————————✓———————————————————————————————————————————————————
Good Locally Testable Codesmain✓✓—————✓—✓—————————————————————————————————————————————————————————————————
The Hasse principle for random Fano hypersurfacesmain✓✓—————✓—✓—————————————————————————————————————————————————————————————————
Hessian estimates for the sigma-2 equation in dimension fourmain✓✓✓————✓—✓—✓—————————✓—————————————————————————————————————————————————————
Improved bounds for the sunflower lemmamain✓✓✓✓———✓—✓—✓———————————————————————————————————————————————————————————————
Inscribed rectangles in a smooth Jordan curve attain at least one third of all aspect ratiosmain✓✓—————✓—✓—————————————————————————————————————————————————————————————————
Integer multiplication in time O(n log n)main✓✓—————✓———————————————————————————————————————————————————————————————————
New large value estimates for Dirichlet polynomialsmain✓✓—————✓—✓—✓———————————————————————————————————————————————————————————————
Rational approximations to linear subspacesmain✓✓✓————✓—✓—✓—————————✓—————————————————————————————————————————————————————
The local-global conjecture for Apollonian circle packings is falsemain✓✓✓✓———✓—✓—✓———————————————————————————————————————————————————————————————
Lorentzian polynomialsmain✓✓✓————✓—✓—✓———————————————————————————————————————————————————————————————
The McKay Conjecture on character degreesmain———————————————————————————————————————————————————————————————————————————
Motivic invariants of birational mapsmain✓——————✓—✓—————————————————————————————————————————————————————————————————
On approximation to a real number by algebraic numbers of bounded degreemain✓✓✓✓———✓—✓—✓———————————————————————————————————————————————————————————————
On the coherence of one-relator groups and their group algebrasmain✓✓—————✓—✓—————————————————————————————————————————————————————————————————
On property (T) for Aut(F_n) and SL_n(Z)main✓✓—————✓———————————————————————————————————————————————————————————————————
The optimal paper Moebius bandmain✓✓✓✓———✓—✓—✓———————————————————————————————————————————————————————————————
A counterexample to the periodic tiling conjecturemain✓✓✓✓———✓—✓—✓———————————————————————————————————————————————————————————————
Pointwise ergodic theorems for non-conventional bilinear polynomial averagesmain✓✓—————✓———————————————————————————————————————————————————————————————————
Pseudorandom sets in Grassmann graph have near-perfect expansionmain✓✓✓————✓—✓—✓———————————————————————————————————————————————————————————————
Rademacher type and Enflo type coincidemain✓✓✓✓———✓—✓—✓——————————————✓————————————————————————————————————————————————
Singularity of random Bernoulli matricesmain✓✓✓————✓—✓—✓—————————✓—————————————————————————————————————————————————————
The rectangular peg problemmain✓✓—————✓———————————————————————————————————————————————————————————————————
A reverse Minkowski theoremmain✓✓✓————✓—✓—✓—————————✓—————————————————————————————————————————————————————
Proof of the simplicity conjecturemain———————————————————————————————————————————————————————————————————————————
The spread of a finite groupmain———————————————————————————————————————————————————————————————————————————
On a conjecture of Talagrand on selector processes and a consequence on positive empirical processesmain✓✓✓✓———✓—✓—✓———————————————————————————————————————————————————————————————
Symplectic monodromy at radius zero and equimultiplicity of μ-constant familiesmain———————————————————————————————————————————————————————————————————————————
A negative answer to Ulam's Problem 19 from the Scottish Bookmain✓✓—————✓—✓—✓———————————————————————————————————————————————————————————————
Uniformity in Mordell–Lang for curvesmain———————————————————————————————————————————————————————————————————————————
A counterexample to the unit conjecture for group ringsmain✓✓✓✓———✓—✓—✓———————————✓——✓✓—————————————✓————————————————————————✓——✓—————
Galois groups of random integer polynomials and van der Waerden's Conjecturemain✓✓—————✓—✓———————————✓—————————————————————————————————————————————————————
Viscosity solutions and hyperbolic motions: a new PDE method for the N-body problemmain✓✓—————✓—✓—————————————————————————————✓———————————————————————————————————
Wilkie's conjecture for Pfaffian structuresmain✓✓—————✓———————————————————————————————————————————————————————————————————
On Zagier-Hoffman's conjectures in positive characteristicmain✓✓✓————✓—✓—————————————————————————————————————————————————————————————————
The Annulus Theorem in dimension 4 (Quinn)main———————————————————————————————————————————————————————————————————————————
The Annulus Theorem in dimension ≥ 5 (Kirby)main———————————————————————————————————————————————————————————————————————————
Anosov–Bowen shadowing lemmamain✓✓✓✓✓✓✓————————————————————————————————————————————————————————————————————
Existence of an aspherical integer homology 4-spheremain✓✓—————✓—✓—————————————————————————————————————————————————————————————————
Baer–Suzuki theoremmain✓✓✓✓✓✓✓———✓————————————————————————————————✓———————————————————————————————
Baker-Wüstholz theorem on linear forms in logarithmsmain✓✓—————✓—✓—————————————————————————————————————————————————————————————————
Balanceable k-bounded partitionsmain✓✓✓✓✓✓✓—✓—✓————————————————————————————————————————————————————————————————
Bourbaki's locally convex extension of Banach–Alaoglumain✓✓✓✓✓✓✓—✓—✓—✓✓—✓——✓————————————————————————————————————————————————————————
Bauer's uniqueness at extreme pointsmain✓✓✓✓✓✓✓—✓———✓——✓———————————————————————————————————————————————————————————
Bender–Suzuki theorem (classification of finite simple groups with a strongly-embedded subgroup)main✓✓—————✓—✓—————————————————————————————————————————————————————————————————
Bézout's theorem (projective, with multiplicity)main✓✓✓✓✓——————————————————————————————————————————————————————————————————————
Boone–Higman theorem (easy direction)main✓✓✓✓✓✓✓—✓——————————————————————————————————————————————————————————————————
Kuznetsov's theorem: finitely presented simple groups have solvable word problemmain✓✓✓✓✓✓✓—✓—✓——✓—————————————————————————————————————————————————————————————
Bourgain's polynomial ergodic theoremmain✓✓—————✓—✓—————————————————————————————————————————————————————————————————
Character values of finite groups lie in cyclotomic fieldsmain✓✓✓✓✓✓✓—✓—✓—✓✓✓✓✓✓✓————————————————————————————————————————————————————————
Brauer–Fowler theoremmain✓✓✓✓✓✓✓—✓—✓————————————————————————————————————————————————————————————————
Brauer's splitting field theoremmain✓✓✓✓✓——————————————————————————————————————————————————————————————————————
Brauer–Suzuki theorem (quaternion Sylow 2-subgroup)main✓✓✓—✓—————————————————————————✓————————————————————————————————————————————
Brouwer fixed-point theoremmain✓✓✓✓✓✓✓—✓—✓——✓—✓———————————————————————————————————————————————————————————
Brun's theorem (convergence of the twin-prime reciprocal sum)main✓✓✓✓✓✓✓————————————————————————————————————————————————————————————————————
Budney--Gabai knotted three-spheres in S¹ × S³main———————————————————————————————————————————————————————————————————————————
Comparison principle for the Dirichlet BVPmain✓✓✓✓✓✓✓—✓—✓✓✓✓✓✓✓✓✓✓————————————✓✓—✓———————————————————————————————————————
Cauchy–Kovalevskaya theoremmain✓✓✓✓✓✓✓————————————————————————————————————————————————————————————————————
Linear independence results of Calegari–Dimitrov–Tangmain✓✓—————✓—✓—————————————————————————————————————————————————————————————————
Cerf's theorem: every self-diffeomorphism of S3 is smoothly isotopic to a linear isometrymain———————————————————————————————————————————————————————————————————————————
Hardy–Littlewood sign-change for the prime race mod 4main✓✓✓—✓——————————————————————————————————————————————————————————————————————
Chen's theoremmain✓✓—————✓—✓—————————————————✓———————————————————————————————————————✓——✓————
Choquet's representation theoremmain✓✓✓✓✓✓✓—✓——————————————————————————————————————————————————————————————————
Chudnovsky formula for pi inversemain✓✓✓✓✓—✓—✓——————✓——————————————————————————————————✓————————————————————————
Fourier interpolation in dimensions 8 and 24main✓✓—————✓———————————————————————————————————————————————————————————————————
The classification of finite simple groupsmain———————————————————————————————————————————————————————————————————————————
Strong normalization and consistency for the calculus of constructions with a universe hierarchymain✓✓——————————✓—————✓—————————————————————✓——————————————————————————————————
Coherent cohomology of a proper scheme over ℚ is finite-dimensionalmain✓✓✓✓——————————————————✓————————————————————————————————————————————————————
Commuting probabilities are closedmain✓✓✓✓✓——————————————————————————————————————————————————————————————————————
Complete reducibility for compact groupsmain✓✓✓✓✓✓✓—✓——————✓———————————————————————————————————————————————————————————
Bing's house with two rooms is contractiblemain✓✓✓✓✓✓✓—✓—✓———✓——✓—————————————————————————————————————————————————————————
The Conway knot is not smoothly slicemain———————————————————————————————————————————————————————————————————————————
The Conway knot is topologically slicemain———————————————————————————————————————————————————————————————————————————
Conway–Schneeberger fifteen theoremmain✓✓✓—✓—————————————————————————————————✓————————————————————————————————————
Polynomial decay rate of y' = -y^3main✓✓✓✓✓✓✓—✓—✓✓✓✓✓✓✓✓✓—————————✓✓———————✓—————————————————————————————————————
Real cyclotomic integer with house in (2, 76/33)main—✓✓————————————————————————————————————————————————————————————————————————
Real cyclotomic integer with house at most 2main✓✓✓✓✓✓✓—✓—✓—✓—✓———————————————————✓————————————————————————————————————————
Darboux's theorem (symplectic forms are locally standard)main✓✓✓✓✓——————————————————————————————————————————————————————————————————————
De Branges's theorem (Bieberbach conjecture)main✓✓✓—✓——————————————————————————————————————————————————————————————————————
Dehn–Sommerville equations for simplicial spheresmain✓✓✓✓✓——————————————————————————————————————————————————————————————————————
Derived solidification of free CW complexes (light condensed mathematics)main———————————————————————————————————————————————————————————————————————————
Dimitrov's lower bound for the house of a nonzero algebraic integer that is not a root of unitymain✓✓✓————✓—✓—✓✓—————✓———————✓✓———————————————————————————————————————————————
Direct summand theorem and derived variantmain✓————————✓—————————————————————————————————————————————————————————————————
Dirichlet eigenvalues of -y'' = lambda y on [0,pi] are n^2main✓✓✓✓✓✓✓—✓—✓✓✓✓✓✓✓✓✓✓———————————————————————————————————————————————————————
Duffin-Schaeffer conjecturemain✓✓✓✓———✓—✓—✓———————————————————————————————————————————————————————————————
Chen theorem for Markoff graphsmain✓✓✓✓✓✓✓———✓————————————————————————————————————————————————————————————————
Existence of a 779247-dim irreducible e₈-representation with 40 tensor-square isotypic componentsmain✓✓—————✓—✓—————————————————————————————————————————————————————————————————
Smallness of exceptional set to Littlewood's conjecturemain✓✓—————✓—✓—————————————————————————————————————————————————————————————————
Lai-Sang Young entropy–dimension–Lyapunov theoremmain✓✓✓————————————————————————————————————————————————————————————————————————
Equichordal point theorem (convex curves have a unique equichordal point)main✓✓—————✓—✓—————————————————————————————————————————————————————————————————
Erdős's unit-distance conjecture is falsemain✓✓—————✓—✓———————————————————————————————————————✓—————————————————————————
Euler–Lagrange equationmain✓✓✓✓✓✓✓—✓—✓—✓——————————————————————————————————————————————————————————————
Existence of a chiral oriented knotmain✓✓✓—✓——————————————————————————————————————————————————————————————————————
Complementary polynomial on the unit circlemain✓✓✓✓✓✓✓—✓—✓——✓✓—✓———✓——————————————————————————————————————————————————————
Existence of a non-isotopic pair of oriented knotsmain✓✓✓✓✓✓✓————————————————————————————————————————————————————————————————————
Existence of a non-isotopic pair of oriented two-component linksmain✓✓✓✓✓✓✓———✓——✓✓————————————————————————————————————————————————————————————
Existence of a topologically slice, not smoothly slice knotmain———————————————————————————————————————————————————————————————————————————
Faltings' theorem (Mordell conjecture)main———————————————————————————————————————————————————————————————————————————
Morrison–Walker Lemma B.0.1: adapting families of maps to open coversmain✓✓✓✓✓✓✓————————————————————————————————————————————————————————————————————
Fang–Xia: tiling of the symmetric group by transpositions implies λ-transitivitymain✓✓✓✓✓✓✓—✓——————————————————————————————————————————————————————————————————
Fáry–Milnor theorem (knot total curvature ≤ 4π implies unknotted)main✓✓✓✓✓——————————————————————————————————————————————————————————————————————
Fatou–Julia / Cantor dichotomymain✓✓✓✓✓——————————————————————————————————————————————————————————————————————
Feit–Thompson odd-order theoremmain✓—✓——✓————————————————————————✓————————————————————————✓——✓————————————————
Fermat's Last Theoremmain———————————————————————————————————————————————————————————————————————————
Finite Ramsey theorem for graphsmain✓✓✓✓✓✓✓—✓—✓✓✓✓✓✓✓✓✓✓————————✓✓—————✓——————✓————————————————————————————————
Burnside p^a q^b theoremmain✓✓✓✓✓✓✓———✓——✓———————————————————————————————————————✓—————————————————————
Possible orders of 5-transitive finite permutation groupsmain———————————————————————————————————————————————————————————————————————————
Freedman's non-smoothability theoremmain———————————————————————————————————————————————————————————————————————————
Pointwise and Cesàro convergence of Fourier series (Dirichlet, Fejér)main✓✓✓✓✓✓——✓—✓——✓———————————————————————————————✓—————————————————————————————
Fraser: Fourier decay for finite-field Kakeya sets is q^{-1} and sharpmain✓✓✓✓✓✓——✓—✓————————————————————————————————————————————————————————————————
Friedlander–Iwaniec theoremmain✓✓—————✓———————————————————————————————————————————————————————————————————
Frobenius determinant theoremmain✓✓✓✓✓✓✓—✓——————————————————————————————————————————————————————————————————
Frobenius's theorem: the Frobenius kernel is normalmain✓✓✓✓✓✓✓———✓————————————————————————————————————————————————————————————————
Fundamental theorem of topos theorymain✓✓✓✓✓✓✓————————————————————————————————————————————————————————————————————
Furstenberg measure-preserving multiple recurrencemain✓✓✓—✓—————————————————✓————————————————————————————————————————————————————
Furstenberg–Weiss topological multiple recurrence (single-transformation form)main✓✓✓✓✓✓✓—✓—✓————————————————————————————————————————————————————————————————
Existence of a 64-dim irreducible g₂-representation with 14 tensor-square isotypic componentsmain✓✓——————————————————————✓——————————————————————————————————————————————————
Gauss-Wantzel constructible regular polygon theoremmain✓✓✓✓✓✓✓————————————————————————————————————————————————————————————————————
Schur-Weyl duality: GL(V) image equals centralizer of S_k imagemain✓✓✓✓✓✓✓—✓—✓—————✓——————————————————————————————————————————————————————————
Glauberman's Z* theorem for isolated involutionsmain✓✓✓———————————————————————————✓————————————————————————————————————————————
Gleason's theorem (finite-dimensional)main✓✓✓✓✓——————————————————————————————————————————————————————————————————————
Gleason's theorem (separable Hilbert space)main✓✓✓✓✓——————————————————————————————————————————————————————————————————————
The Golod–Shafarevich inequalitymain✓✓✓✓✓✓✓————————————————————————————————————————————————————————————————————
Gorenstein–Walter theorem (dihedral Sylow 2-subgroup)main✓——————✓—✓—————————————————————————————————————————————————————————————————
Green–Tao theoremmain✓✓✓————✓—✓—✓——————————✓————————————————————————————————————————————————————
Adams: S^n is an H-space iff n = 0, 1, 3, 7main✓✓—————✓—✓—————————————————————————————————————————————————————————————————
Hadwiger's theoremmain✓✓✓————✓—✓—✓————————————✓——————————————————————————————————————————————————
Halmos's generic weak-mixing theoremmain✓✓✓✓✓✓✓—✓——————————————————————————————————————————————————————————————————
Hausdorff moment problem: absolute-continuity criterionmain✓✓✓✓✓✓✓—✓——————————————————————————————————————————————————————————————————
The Hausdorff–Hildebrandt–Schoenberg moment theoremmain✓✓✓✓✓✓✓—✓——————————————————————————————————————————————————————————————————
The Hausdorff positivity (complete-monotonicity) criterionmain✓✓✓✓✓✓✓—✓——————————————————————————————————————————————————————————————————
Gaussian heat kernel solves the 1D heat equationmain✓✓✓✓✓✓✓—✓—✓—✓✓✓—✓✓——✓——————————————————————————————————————————————————————
Higman's infinite finitely-presented simple groupmain✓✓✓✓✓——————————————————————————————————————————————————————————————————————
No continuous faithful ℤ_p action on a connected 3-manifold (Pardon 2013)main✓——————————————————————————————————————————————————————————————————————————
Hippocrates' theorem on lunesmain✓✓✓✓✓✓✓—✓————✓—————————————————————————————————————————————————————————————
Connective constant of the honeycomb latticemain✓✓✓✓————————————————————✓——————————————————————————————————————————————————
Hopf–Rinow theoremmain✓✓✓—✓——✓—✓—✓——————————————✓————————————————————————————————————————————————
The Hopf problem: a complex structure on the 6-spheremain✓✓———————✓—————————————✓———————————————————————————————————————————————————
The Hopf Umlaufsatz (theorem of turning tangents)main✓✓✓✓✓✓✓————————————————————————————————————————————————————————————————————
Hurewicz theorem in degree 1 (H₁ = abelianization of π₁)main✓✓✓✓✓✓✓————————————————————————————————————————————————————————————————————
Perron-Frobenius for irreducible nonnegative matricesmain✓✓✓✓✓✓✓—✓—✓—✓—✓——✓——✓——————————————————————————————————————————————————————
Onsager's 2D Ising phase transitionmain✓✓✓✓✓——————————————————————————————————————————————————————————————————————
Isoperimetric inequality (n-dim, topological-frontier form)main✓✓✓—✓——————————————————————————————————————————————————————————————————————
Jacobian of a smooth proper curve (Merten challenge)main✓✓—————✓—✓—————————————————————————————————————————————————————————————————
Jacobian of a compact Riemann surface (Buzzard challenge)main✓✓✓——————————————————————✓—————————————————————✓✓——————————————————————————
Jordan–Brouwer separation theoremmain✓✓✓✓✓——————————————————————————————————————————————————————————————————————
Jordan curve theoremmain✓✓✓✓✓————————————————————✓—————✓————✓——————————————————————————————————————
Jordan normal formmain✓✓✓✓✓✓✓—✓——✓———————————————————————————————————————————————————————————————
Kakutani fixed-point theoremmain✓✓✓✓✓✓✓—✓—✓————————————————————————————————————————————————————————————————
KAM persistence of an invariant curvemain✓✓✓✓✓——————————————————————————————————————————————————————————————————————
Kepler conjecture (optimal sphere packing in ℝ³)main———————————————————————————————————————————————————————————————————————————
Kirk's normal-structure fixed point theoremmain✓✓✓✓✓✓——✓——————✓———————————————————————————————————————————————————————————
Klartag's construction of lattice sphere packingsmain✓✓—————✓—✓—————————————✓———✓———————————————————————————————————————————✓✓——
Topological reconstruction theorems for varietiesmain———————————————————————————————————————————————————————————————————————————
Kolmogorov–Arnold superposition theorem (non-universal Lorentz form)main✓✓✓✓✓✓✓————————————————————————————————————————————————————————————————————
Koszul formulamain✓✓✓✓✓✓✓—✓—✓—✓——✓——✓————————————————————————————————————————————————————————
The Landsberg–Schaar relationmain✓✓✓✓✓✓——✓——————————————————————————————————————————————————————————————————
Lax's approximation theorem for toral homeomorphismsmain✓✓✓✓✓✓✓————————————————————————————————————————————————————————————————————
Fundamental theorem of Riemannian geometry (Levi-Civita)main✓✓✓✓✓✓✓—✓——————————————————————————————————————————————————————————————————
Lidskii's inequalitymain✓✓✓✓✓✓✓———✓————————————————————————————————————————————————————————————————
Lidskii–Last eigenvalue-perturbation theoremmain✓✓✓✓✓✓✓———✓—✓——————————————————————————————————————————————————————————————
Lindemann's theorem (e and π transcendental)main✓✓✓✓✓✓✓—✓——————————————————————————————————————————————————————————————————
The Lindemann–Weierstrass theoremmain✓✓✓✓✓✓✓—✓——————————————————————————————————————————————————————————————————
Linear ODE with negative-real-part eigenvalues is asymptotically stablemain✓✓✓✓✓✓✓—✓—✓——✓✓——✓—————————————————————————————————————————————————————————
Linnik's theorem (L = 5.5)main✓✓—————✓———————————————————————————————————————————————————————————————————
Liouville–Arnold theorem on integrable systemsmain✓✓✓✓✓✓✓———✓————————————————————————————————————————————————————————————————
Linear programming: maximum principle and vertex optimalitymain✓✓✓✓✓✓✓—✓—✓—✓✓—✓——✓————————————————————————————————————————————————————————
Existence of a simple group of order 10200960 with a 22-dim irrep whose tensor square has 4 isotypic componentsmain✓✓✓✓✓—————————————————————————————————————————————————✓————————————————————
Mandelbar (tricorn) is not path-connected (Hubbard–Schleicher)main✓——————✓—✓—————————————————————————————————————————————————————————————————
Hausdorff dimension of the Mandelbrot boundary (Shishikura)main✓✓—————✓———————————————————————————————————————————————————————————————————
Mandelbrot set is connected (Douady–Hubbard)main✓✓✓✓✓——————————————————————————————————————————————————————————————————————
Manolescu's disproof of the triangulation conjecturemain———————————————————————————————————————————————————————————————————————————
Margulis–Ruelle inequalitymain✓✓✓✓✓——————————————————————————————————————————————————————————————————————
Martinet's asymptotically-good totally real towersmain✓✓—————✓—✓————————————✓————————————————————————————————————————————————————
Mazur's torsion theoremmain———————————————————————————————————————————————————————————————————————————
Minkowski-Caratheodory theoremmain✓✓✓✓✓✓✓—✓—✓—✓✓✓—✓✓——✓——————————————————————————————————————————————————————
Mergelyan's theoremmain✓✓✓✓✓——————————————————————————————————————————————————————————————————————
Mihăilescu's theoremmain✓✓✓————————————————————————————————————————————————————————————✓———————————
Milnor's exotic 7-spheremain✓✓—————✓———————————————————————————————————————————————————————————————————
Monge–Kantorovich existence theoremmain✓✓✓✓✓✓✓—✓—✓————————————————————————————————————————————————————————————————
Moran's equality for affine-symmetric iterated function systemsmain✓✓✓✓✓✓—————————————————————————————————————————————————————————————————————
Morley's categoricity theoremmain✓✓✓—————————————————————✓——————————————————————————————————————————————————
Morley's trisector theoremmain✓✓✓✓✓✓✓—✓——✓————————————————————————————————————————✓——————————————————————
Morse inequalitiesmain✓✓✓✓✓——————————————————————————————————————————————————————————————————————
Mostow rigiditymain✓✓—————✓—✓—————————————————————————————————————————————————————————————————
Mountain Pass Theorem (Ambrosetti–Rabinowitz 1973)main✓✓✓✓✓✓——✓—✓————————————————————————————————————————————————————————————————
Cayley graph connected iff generators generate the groupmain✓✓✓✓✓✓✓—✓—✓✓✓✓✓✓✓✓✓✓——✓——————————✓————————————————————————————✓————————————
Nash equilibrium existence theoremmain✓✓✓✓✓✓✓—✓—✓————————————————————————————————————————————————————————————————
Neukirch–Uchida theoremmain✓✓—————✓—✓—————————————————————————————————————————————————✓———————————————
Newlander–Nirenberg theoremmain✓✓—————✓—✓—————————————————————————————————————————————————————————————————
Nikolov–Segal strong completeness theoremmain———————————————————————————————————————————————————————————————————————————
A 3-manifold group with no faithful representation into GL(4, ℝ)main✓✓✓✓✓✓✓————————————————————————————————————————————————————————————————————
Normal spectral theoremmain✓✓✓✓✓✓✓—✓——✓✓——————————————————————————————————————————————————————————————
Novikov's theorem: the word problem is undecidable for finitely presented groupsmain✓✓✓✓✓——————————————————————————————————————————————————————————————————————
Nyquist–Shannon sampling theoremmain✓✓✓✓✓✓——✓———✓——————————————————————————————————————————————————————————————
Oppenheim's inequality for Hadamard productsmain✓✓✓✓✓✓✓—✓—✓—✓✓✓—✓✓✓—✓——————————————————————————————————————————————————————
The Ore conjecture: every element of a finite nonabelian simple group is a commutatormain———————————————————————————————————————————————————————————————————————————
Ornstein–Weiss ℤᵈ Rokhlin lemmamain✓✓✓✓✓✓✓————————————————————————————————————————————————————————————————————
Independence of the parallel postulatemain✓✓✓✓✓✓✓———✓————————————————————————————————————————————————————————————————
Pardon's lower bound for torus-knot distortionmain✓✓—————✓—✓—————————————————————————————————————————————————————————————————
Pascal's theoremmain✓✓✓✓✓✓✓—✓——————————————————————————————————————————————————————————————————
Peano existence theorem for ODEsmain✓✓✓✓✓✓✓—✓———✓——————————————————————————————————————————————————————————————
Pell solutions are convergents of √dmain✓✓✓✓✓✓✓—✓—✓—✓✓—✓———✓———————————————————————————————————————————————————————
A competition programming problem about permuting a permutation to be unimodalmain✓✓✓✓✓✓✓—✓—✓————————————————————————————————————————————————————————————————
Pesin entropy formula (symplectic surface case)main✓✓✓✓———————————————————————————————————————————————————————————————————————
pi_1 of the circle is Zmain✓✓✓✓✓✓✓—✓—✓—✓✓✓✓✓✓————————————————✓————————————————————————————————————————
pi_3 of the 2-sphere is Zmain✓✓✓✓✓——————————————————————————————————————————————————————————————————————
pi_6 of the 3-sphere is Z/12main✓✓—————✓—✓—————————————————————————————————————————————————————————————————
Serre finiteness for homotopy groups of spheresmain✓✓—————✓———————————————————————————————————————————————————————————————————
pi_(n+1) of S^n is Z/2 for n at least 3main✓✓✓———————————————————————————————————✓——————————————————————✓—————————————
Pick's theoremmain✓✓✓✓✓————————————————————✓——————————✓——————————————————————————————————————
pi_n of the n-sphere is Zmain✓✓✓✓✓——————————————————————————————————————————————————————————————————————
Platonic classificationmain✓✓✓—✓————————————————————————————————————————————————————✓—————————————————
3D smooth Poincaré conjecture (Perelman)main———————————————————————————————————————————————————————————————————————————
3D topological Poincaré conjecture (Perelman)main———————————————————————————————————————————————————————————————————————————
4D topological Poincaré conjecture (Freedman)main———————————————————————————————————————————————————————————————————————————
Poincaré–Bendixson theoremmain✓✓✓✓✓——————————————————————————————————————————————————————————————————————
Generalized topological Poincaré conjecture in dimensions ≥ 5 (Smale)main✓✓—————✓—✓—————————————✓—————————————————✓————————————————————————————————✓
Poincaré–Siegel linearisation theoremmain✓✓✓✓✓✓✓————————————————————————————————————————————————————————————————————
Entrywise exponential of a PSD matrix is PSDmain✓✓✓✓✓✓✓—✓—✓✓✓✓✓✓✓✓✓✓———————————————————————————————————————————————————————
The q-TSPP theoremmain———————————————————————————————————————————————————————————————————————————
Radó's theorem on Riemann surfacesmain✓✓✓✓✓—✓——————————————————✓—————————————————————————————————————————————————
Radon transform: Fourier-slice diagonalization and pseudo-inversionmain✓✓✓✓✓✓——✓——————————————————————————————————————————————————————————————————
Ramanujan–Petersson conjecture for the τ-function (Deligne's theorem)main———————————————————————————————————————————————————————————————————————————
Quantifier elimination for the theory of real closed fieldsmain✓✓✓—————————————————————————————————————✓——————————————————————————————————
Sard's regular-value corollarymain✓✓✓✓✓✓✓—✓——————————————————————————————————————————————————————————————————
Lagarias criterion is equivalent to RHmain✓✓—————✓—✓———————————————————————————————————————————————————————————————✓—
Riesz brothers' theoremmain✓✓✓✓✓✓✓————————————————————————————————————————————————————————————————————
Riesz's rising sun lemmamain✓✓✓✓✓✓✓—✓——✓✓——————————————————————————————————————————————————————————————
Rokhlin lemmamain✓✓✓✓✓✓✓—✓——————————————————————————————————————————————————————————————————
Rouche theorem via zero countingmain✓✓✓✓✓✓✓—✓—✓——✓✓—✓———✓——————————————————————————————————————————————————————
Runge's theoremmain✓✓✓✓✓✓✓—✓—✓——✓—————————————————————————————————————————————————————————————
Sard's theorem (critical-set image has measure zero)main✓✓✓✓✓✓✓—✓——————✓———————————————————————————————————————————————————————————
Schauder fixed-point theoremmain✓✓✓✓✓✓✓—✓—✓——✓—————————————————————————————————————————————————————————————
Schläfli classification of regular polytopesmain✓✓✓—✓——————————————————————————————————————————————————————————————————————
Schmidt's subspace theoremmain✓✓—————✓—✓—✓———————————————————————————✓———————————————————————————————————
Schoenflies theoremmain✓✓✓————————————————————————————✓————————————————————————————✓——————————————
Schreier's conjecture: outer automorphism group of a finite simple group is solvablemain———————————————————————————————————————————————————————————————————————————
Radial symmetry for positive semilinear Poisson solutionsmain✓✓✓✓✓✓✓————————————————————————————————————————————————————————————————————
Shafarevich's relation-rank boundmain✓✓—————✓—✓————————————✓————————————————————————————————————————————————————
Shafarevich's theorem on solvable Galois groupsmain✓——————✓—✓—————————————————————————————————————————————————————————————————
Shannon capacity of the pentagonmain✓✓✓✓✓✓✓—✓——————————————————————————————————————————————————————————————————
Smale conjecture (Hatcher) in relative parameterized formmain———————————————————————————————————————————————————————————————————————————
Pannwitz–Kuperberg quadrisecant theoremmain✓✓—————✓—✓—————————————————————————————————————————————————————————————————
Sobolev embedding theorem (Morrey regime)main✓✓✓✓✓✓✓————————————————————————————————————————————————————————————————————
Solvable extensions ↔ solvable groups (the missing converse in Abel–Ruffini)main✓✓✓✓✓✓✓—✓—✓————————————————————————————————————————————————————————————————
230 space groups (Fedorov 1891 / Schoenflies 1891)main✓✓—————✓—✓—————————————————————————————————————————————————————————————————
Differentiable sphere theorem (Brendle–Schoen)main—✓—————✓—✓—————————————————————————————————————————————————————————————————
Topological sphere theorem (Berger–Klingenberg–Rauch)main✓✓—————✓—✓—————————————————————————————————————————————————————————————————
Local stable/unstable sets at a hyperbolic fixed point (set-level Hadamard–Perron)main✓✓✓✓✓✓✓———✓————————————————————————————————————————————————————————————————
Strong Mason conjecture for matroid independent setsmain✓✓✓✓✓——————————————————————————————————————————————————————————————————————
Strong Subadditivity of von Neumann Entropymain✓✓✓✓✓✓✓————————————————————————————————————————————————————————————————————
Sturm's theoremmain✓✓✓✓✓✓✓—✓—✓————————————————————————————————————————————————————————————————
Sturm separation theoremmain✓✓✓✓✓✓✓—✓—✓—✓✓✓✓✓✓✓✓————————————✓——————————————————————————————————————————
Catalan generating function via compositional inversionmain✓✓✓✓✓✓✓—✓—✓—✓✓✓✓✓✓—✓✓———————✓✓———————✓—————————————✓—————————————✓——✓——————
Schur-Weyl duality: S_k image equals centralizer of GL(V) imagemain✓✓✓✓✓✓——✓—✓—————✓——————————————————————————————————————————————————————————
Symplectic matrices have determinant 1main✓✓✓✓✓✓✓—✓—✓—✓——✓——✓—————————————————————————✓——————————————————————————————
Szemerédi's theoremmain✓✓✓————✓—✓—✓——————————✓✓———————————————————————————————————————————————————
Avila-Jitomirskaya Ten Martini Problemmain✓✓—————✓—✓—————————————————————————————————————————————————————————————————
Thue–Siegel–Roth theorem (irrationality measure ≤ 2 for algebraic irrationals)main✓✓✓✓✓——————————————————————————————————————————————————————————————————————
Topological classification of surfacesmain✓✓✓————————————————————————————✓———————————————————————————————————————————
Trace Cayley-Hamilton / Newton identitymain✓✓✓✓✓✓✓—✓——✓✓—————✓————————————————————————————————————————————————————————
General recursive equals Turing computablemain✓✓✓✓✓✓✓————————————————————————————————————————————————————————————————————
Tverberg's theoremmain✓✓✓✓✓✓✓—✓——————————————————————————————————————————————————————————————————
The 290 theoremmain———————————————————————————————————————————————————————————————————————————
Uniformization theorem for Riemann surfacesmain✓✓✓————✓—✓———————————————✓—————————————————————————————————————————————————
Spencer-Szemerédi-Trotter unit-distance upper boundmain✓✓✓✓✓———————————————————————————————————————————————————✓——————————————————
Upper bound theorem for geometric simplicial spheres (Stanley 1975)main✓✓✓✓✓——————————————————————————————————————————————————————————————————————
Vinogradov mean value theoremmain✓✓—✓———✓—✓—✓———————————————————————————————————————————————————————————————
von Neumann double commutant theoremmain✓✓✓✓✓✓✓—✓—✓——✓✓————————————————————————————————————————————————————————————
Seventeen wallpaper groups (Pólya–Niggli 1924)main✓✓✓✓✓——————————————————————————————————————————————————————————————————————
Wang-Zahl: the three-dimensional Kakeya conjecturemain✓————————✓—————————————————————————————————————————————————————————————————
Watanabe's disproof of the 4-dimensional Smale conjecturemain———————————————————————————————————————————————————————————————————————————
Weak Goldbach theoremmain———————————————————————————————————————————————————————————————————————————
Weak Morse inequalitiesmain✓✓✓✓✓——————————————————————————————————————————————————————————————————————
Weil conjectures in terms of point countsmain———————————————————————————————————————————————————————————————————————————
Weinstein conjecture in dimension three (Taubes 2007)main———————————————————————————————————————————————————————————————————————————
Whitney embedding theorem (strong form, dimension 2n)main✓✓—————✓—✓—————————————————————————————————————————————————————————————————
Wieferich's theorem g(3) = 9main✓✓✓✓✓——————————————————————————————————————————————————————————————————————
Wiener's atom-detection formulamain✓✓✓✓✓✓✓—✓—✓—✓✓—————————————————————————————————————————————————————————————
Wiener's 1/f theoremmain✓✓✓✓✓✓✓—✓——————————————————————————————————————————————————————————————————
Wiener–Lévy theoremmain✓✓✓✓✓✓✓—✓——————————————————————————————————————————————————————————————————
Wigner semicircle lawmain✓✓✓✓✓✓✓————————————————————————————————————————————————————————————————————
Bounded gaps between primesmain✓✓—————✓—✓—————————————✓———————————————————————————————————————————————————

Welcome to lean-eval, a Lean formalization benchmark and public leaderboard.

You can submit new problems for review, and solutions for existing problems. New problems will be carefully reviewed and added to future benchmark releases if they are accepted. Solutions are automatically verified using comparator and added to the public leaderboard.

This benchmark intends to capture hard Lean formalization problems, consisting of mathematical problems that are currently stateable mostly using existing Mathlib definitions, perhaps with a page or so of additional setup. They should be hard, but usually not open problems: in fact, it's preferred if the problem has a known informal solution which is publicly available.

Our hope is that at launch, the problem set will be mostly, but not entirely, out of reach for current publicly available frontier models, or simple orchestration layers built on top of these. So some genuine mathematical subtlety is required!

It's also important to say what this benchmark is not: we are not trying to capture the ability to write readable or reusable code, or to follow best practices in Lean. In particular, the only requirement for a solution to be accepted is that it is correct and passes the comparator tests.

I'd like to acknowledge the use of Aristotle, Claude Code, and Codex in the preparation of many of the problems here. In particular I should point out that Aristotle has a handicap on the leaderboard: typically, if a single query to Aristotle could resolve a problem, I would deem it too easy and drop it from consideration for the eval set. I think it's a testament to the public service that Aristotle provides that this is both possible, and useful!