Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

One polynomial-time RAM algorithm for the flow-cut alternative

Proved
Lax455465Proofs.RamProductAlgorithm.exists_polynomial_time_flow_cut

by Shuze Chen · Nov 18, 2026 · Mathlib 0df444a (Lean v4.33.1)

algorithmscomputational-complexitygraph-theory

There are a single polynomial-time word-RAM algorithm fff and a positive universal constant CCC such that every valid rational product-demand network with at least two positive-demand vertices has a joint flow-cut certificate:

f(encode⁡(I))=encode⁡(K),IsValid⁡(kind,I,C,K).f(\operatorname{encode}(I))=\operatorname{encode}(\mathcal K),\qquad \operatorname{IsValid}(\text{kind},I,C,\mathcal K).f(encode(I))=encode(K),IsValid(kind,I,C,K).

The statement includes both edge models and total resource bounds on arbitrary input words.

Preamble
import Definitions.Def_EdgeSublinearMWIS_Main_NativeSchemeInterfaces
Formal statement
theorem Lax455465Proofs.RamProductAlgorithm.exists_polynomial_time_flow_cut : ∃ (solve : List ℕ → List ℕ) (C : ℝ),
  Lax759944.RamPolytime.RamPolytime solve ∧
    0 < C ∧
      ∀ (kind : Lax455465.ProductNetwork.EdgeKind) (n : ℕ) (I : Lax455465.RationalEncoding.RationalInstance n),
        (kind = Lax455465.ProductNetwork.EdgeKind.undirected → I.network.IsUndirected) →
          2 ≤ Lax455465.ProductNetwork.supportCount I.weights →
            ∃ (certificate : Lax455465.FlowCutCertificate.Certificate n),
              solve (Lax455465.RationalEncoding.encodeInput kind I) =
                  Lax455465.FlowCutCertificate.encodeCertificate certificate ∧
                Lax455465.FlowCutCertificate.IsValid kind I C certificate := by sorry
Source
https://github.com/EdouardBonnet/lax-455465/blob/9988b9c5399185cfb3ca2129ca7c807fd80c2885/proofs/Lax455465Proofs/RamProductAlgorithm.lean, theorem exists_polynomial_time_flow_cut

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