Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Orthogonal vectors and randomized hypothesis

Definition
NearLogSetCover966_Main_Supplement_OV

by mikedeng1 · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

p2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1parameterized-complexityset-cover

An orthogonal-vectors instance consists of kkk indexed groups of nnn distinct binary vectors in dimension ddd. Its YES condition is

∃(a1,…,ak),∀j∈[d],∃i∈[k]:ai[j]=0.\exists(a_1,\ldots,a_k),\quad \forall j\in[d],\quad\exists i\in[k]:a_i[j]=0.∃(a1​,…,ak​),∀j∈[d],∃i∈[k]:ai​[j]=0.

The randomized logarithmic-dimension hypothesis says that for every fixed k≥2k\ge2k≥2 and ε>0\varepsilon>0ε>0, there is c>0c>0c>0 excluding a two-sided bounded-error randomized O(nk−ε)O(n^{k-\varepsilon})O(nk−ε) solver on d≤clog⁡2nd\le c\log_2 nd≤clog2​n. The solver uses the same operational random-program model and succeeds with probability at least 2/32/32/3 on both input classes. This premise is used only in Theorem 4.8.

Definition code
import Definitions.Def_NearLogSetCover966_Main_Supplement_Random

set_option autoImplicit false

namespace NearLogSetCover966.Main.Supplement

structure OrthogonalVectors where
  k : ℕ
  n : ℕ
  d : ℕ
  vectors : Fin k → Fin n → Bits d
  distinct : ∀ i, Function.Injective (vectors i)

def OrthogonalVectors.yes (I : OrthogonalVectors) : Prop :=
  ∃ a : Fin I.k → Fin I.n, ∀ j : Fin I.d, ∃ i : Fin I.k, I.vectors i (a i) j = false

def OrthogonalVectors.encode (I : OrthogonalVectors) : Str :=
  unary I.k ++ unary I.n ++ unary I.d ++
    (List.ofFn fun i => (List.ofFn fun a => List.ofFn (I.vectors i a)).flatten).flatten

/-- Two-sided bounded error, including actual worst-case time on every random path. -/
noncomputable def OVSolver (k : ℕ) (c exponent C : ℝ) (P : RandomProgram) (n₀ : ℕ) : Prop :=
  ∀ I : OrthogonalVectors, I.k = k → max 2 n₀ ≤ I.n →
    (I.d : ℝ) ≤ c * log2 I.n →
    let B := C * (I.n : ℝ) ^ exponent
    P.halts I.encode B ∧
    P.prob I.encode B (fun y => (I.yes ∧ y = [true]) ∨ (¬ I.yes ∧ y = [false])) ≥ 2 / 3

noncomputable def RandomizedOVHypothesis : Prop :=
  ∀ k : ℕ, 2 ≤ k → ∀ ε : ℝ, 0 < ε → ∃ c : ℝ, 0 < c ∧
    ¬ ∃ (P : RandomProgram) (C : ℝ) (n₀ : ℕ),
      0 < C ∧ OVSolver k c ((k : ℝ) - ε) C P n₀

end NearLogSetCover966.Main.Supplement
Source
Bingkai Lin, Xin Zheng, STOC 2027 submission #966 (October 2026), Hypothesis 2.2, printed p.9 (PDF p.11)

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