Formal Verification of Syntactic Boolean Circuits and Unconditional Gate-Count Lower Bounds in Lean 4 (CTAV DeepCore, Part 1)
Year: 2026
Type: preprint
Abstract: html text This release is Part 1 of a modular series formalizing syntactic computational complexity in pure Lean 4.35.0 without external dependencies (zero Mathlib or Std imports). Mathematical Motivation: Formalizing complexity classes such as P or P/poly via abstract runtime functions risks decoupling the resource bound from the syntactic structure of the computation. To prevent trivializing runtime witnesses, this module defines an explicit inductive syntax tree for Boolean circuits (BoolCircuit), exact logical gate counting (gateCount), and a strict syntactic definition of InClassPPoly. Verified Results (0 sorry): 1. essential_var_must_appear_in_circuit: Proves unconditionally that any syntactic Boolean circuit computing a language L on inputs of length n must explicitly contain a variable leaf node (.var i) for every essential input bit i < n. 2. unconditional_gate_count_lower_bound: Combines unique variable extraction (distinctVars) with a constructive pigeonhole covering lemma (pigeonhole_range_le_length) to prove that any Boolean circuit computing a language L that depends essentially on all n input bits requires at least n - 1 logic gates (n <= gateCount(C) + 1). Reproducibility & Audit: Verified strictly against the standard Lean 4 axioms [propext, Classical.choice, Quot.sound]. To reproduce the compiled artifact from scratch: lean -o CTAV_DeepCore_Part1_SyntacticCircuits.olean CTAV_DeepCore_Part1_SyntacticCircuits.lean SHA-256 Checksums: - CTAV_DeepCore_Part1_SyntacticCircuits.lean: 489b2949dc68d25829e5d88c207a7c19b9c2633635b6b001055487abbf1556b5 - CTAV_DeepCore_Part1_SyntacticCircuits.olean: 187d861d09abd13511e81e627d40bdd6280ba9d949a1bef5
Author: Antsipau, Ivan
Language: English
Subfield: Software
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7236695381
