Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1.3 — exact c-to-c transfer including running time

Open
ConstrainedCorrelationRepulsion.Main.Supplement.theorem_1_3

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

approximationcorrelation-clusteringp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1

Fix any real c>1c>1c>1, let k=⌈c/[2(c−1)]⌉k=\lceil c/[2(c-1)]\rceilk=⌈c/[2(c−1)]⌉ and c′=k+1c'=k+1c′=k+1. If one finite word program is a pointwise ccc-approximation for cluster deletion, with an at-most-NNN worst-case time envelope f(N)f(N)f(N), then there is a finite word program giving a ccc-approximation for vertex cover on every nnn-vertex graph in time

O(f(c′n2)+n4).O\bigl(f(c'n^2)+n^4\bigr).O(f(c′n2)+n4).

More precisely, a positive constant CCC, depending only on ccc and the fixed machine convention, works uniformly over the deletion program, fff, nnn and the graph; the cover program's budget is at most C(f(c′n2)+max⁡{1,n}4)C(f(c'n^2)+\max\{1,n\}^4)C(f(c′n2)+max{1,n}4). Every supported output is a vertex cover of size at most cτ(G)c\tau(G)cτ(G). The envelope fff is arbitrary and need not be polynomial or supplied as a monotone function. Runtime is a conclusion about executions. The two deletion calls are charged through the resulting finite program, rather than treated as free oracles.

This exact-ratio transfer supplies both hardness clauses through the cited vertex-cover results. The source construction removes each endpoint of an input edge in turn, complements, joins a large universal clique, chooses the smaller deletion output, and extracts the clique; complete and edgeless inputs have direct outputs.

Differences from the source:

  • encoding: ordinary adjacency-matrix word algorithms and O(f(c′n²)+n⁴) → finite charged word executions with an at-most-size envelope and max(1,n)⁴ at the empty input; reason: this gives uniform O-notation constants, charges both calls, avoids assuming monotonicity of f, and includes the source empty graph
Preamble
import Definitions.Def_ConstrainedCorrelationRepulsion_Main_Supplement_WordAlgorithms
Formal statement
namespace ConstrainedCorrelationRepulsion.Main.Supplement

/-- Exact c-to-c transfer, including the source's arbitrary time envelope. C depends only
on c and fixed machine conventions, not on the input, algorithm or envelope. The two calls
are charged within the conclusion, not granted as zero-cost oracles. Empty inputs are covered
by max 1 n in the uniform O-notation convention. -/
theorem theorem_1_3 (c : ℝ) (hc : 1 < c) :
    ∃ C : ℕ, 0 < C ∧ ∀ code : Program, ∀ f : ℕ → ℕ,
      DeletionAlgorithm code c f →
      ∃ coverCode : Program, ∀ n (G : Graph n),
        ∃ B ≤ C * (f (blowupCoefficient c * n^2) + (max 1 n)^4),
          CoverRun coverCode G c B := by sorry

end ConstrainedCorrelationRepulsion.Main.Supplement
Source
Yixin Cao, Ying Xu, STOC 2027 submission #869 (October 2026), Theorem 1.3, printed p.2 (PDF p.3), repeated statement and proof printed pp.36–37 (PDF pp.37–38)

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