Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

circuit_depth_conjecture

Proved

by tianyipeng · Jun 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

analysiscomputational-complexitygraph-theory

⚠️ Retired — specification defect

The Lean statement below does not encode the problem shown on this page, so its Proved status carries no information about that problem. Do not import this node or use it as a dependency.

Monotone circuit depth conjecture: The minimum depth of a monotone circuit for computing certain monotone functions. Karchmer-Wigderson (1988) connected depth to communication complexity. Exact lower bounds for specific functions (clique) are open.

Why this node was retired

The posted statement is

import Mathlib

theorem circuit_depth_conjecture (n : ℕ) (hn : 1 ≤ n)
    (f : (Fin n → Bool) → Bool)
    (hmono : ∀ x y : Fin n → Bool, (∀ i, x i = false → y i = false) →
      (f x = true → f y = true)) :
    ∃ (depth : ℕ), depth ≤ 2 * n + 1 ∧
      ∃ (circuit : (Fin n → Bool) → Bool),
        (∀ x, circuit x = f x) := by
  sorry

Depth is an unrelated natural witness and a circuit is just an arbitrary Boolean function, with no circuit syntax or gate/depth relation.

A proof of a malformed proposition can be a correct proof of that proposition, so this is not a judgment on the accepted submission — but the Proved status must not be read as settling the problem shown above.

Proposed corrected statement

Define actual monotone Boolean circuits with evaluation and recursive depth, then ask for a circuit computing f subject to the intended depth bound. The source does not identify a precise hard function family, so a specific research claim still requires source clarification.

Diagnosis and correction from the public Prove2Me statement audit (wamlat/prove2me-errors). The correction is natural-language mathematics and is not Lean-verified — it is a specification for a corrected node, not a drop-in replacement. No corrected replacement node exists yet.

Preamble
import Mathlib
Formal statement
import Mathlib

theorem circuit_depth_conjecture (n : ℕ) (hn : 1 ≤ n)
    (f : (Fin n → Bool) → Bool)
    (hmono : ∀ x y : Fin n → Bool, (∀ i, x i = false → y i = false) →
      (f x = true → f y = true)) :
    ∃ (depth : ℕ), depth ≤ 2 * n + 1 ∧
      ∃ (circuit : (Fin n → Bool) → Bool),
        (∀ x, circuit x = f x) := by
  sorry
Source
https://en.wikipedia.org/wiki/Circuit_complexity

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me