Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Bounded construction of the rounded independent blow-up

Proved
Lax263307Proofs.NativeBlowUp.prepare_spec_native

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

algorithmscomputational-complexitygraph-theory

Let GGG be a graph on nnn labelled vertices, www rational signed vertex weights and ε>0\varepsilon>0ε>0 rational. Suppose their numerator and denominator magnitudes are bounded by M≥1M\ge1M≥1, with n≤Mn\le Mn≤M, and the published arithmetic, dimension and buffer guards hold for word bound BBB. Put cv=copies⁡(max⁡(w,0),ε)vc_v=\operatorname{copies}(\max(w,0),\varepsilon)_vcv​=copies(max(w,0),ε)v​ and N=∑vcvN=\sum_v c_vN=∑v​cv​. From the encoded input, the fixed preparation command stores the independent blow-up adjacency matrix, its owner map, its order and the original input tail:

matrix⁡out=Adj⁡(G[c]),owner⁡out=owners⁡(c),nout=N.\operatorname{matrix}_{\rm out}=\operatorname{Adj}(G[c]),\qquad\operatorname{owner}_{\rm out}=\operatorname{owners}(c),\qquad n_{\rm out}=N.matrixout​=Adj(G[c]),ownerout​=owners(c),nout​=N.

Its instruction bound is the source's explicit cost⁡(n,N)\operatorname{cost}(n,N)cost(n,N); it preserves prior output and the original graph order. This is the operational bridge from signed weighted input to an unweighted graph.

Preamble
import Definitions.Def_EdgeSublinearMWIS_Main_NativePhaseInterfaces
namespace Lax263307Proofs.NativeBlowUp
end Lax263307Proofs.NativeBlowUp
Formal statement
theorem Lax263307Proofs.NativeBlowUp.prepare_spec_native : ∀ {n : Nat} (B M : Nat),
  @LE.le Nat instLENat (@OfNat.ofNat Nat (nat_lit 1) (instOfNatNat (nat_lit 1))) M →
    @LE.le Nat instLENat n M →
      ∀ (G : SimpleGraph (Fin n)) [inst : @DecidableRel (Fin n) (Fin n) (@SimpleGraph.Adj (Fin n) G)] (w : Fin n → Rat)
        (ε : Rat),
        @LT.lt Rat Rat.instLT (@OfNat.ofNat Rat (nat_lit 0) (@Rat.instOfNat (nat_lit 0))) ε →
          (∀ (v : Fin n), And (@LE.le Nat instLENat (w v).num.natAbs M) (@LE.le Nat instLENat (w v).den M)) →
            And (@LE.le Nat instLENat ε.num.natAbs M) (@LE.le Nat instLENat ε.den M) →
              @LT.lt Nat instLTNat
                  (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
                    (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
                      (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))
                      (@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@NPow.toPow Nat (@Monoid.toNPow Nat Nat.instMonoid)))
                        M (@OfNat.ofNat Nat (nat_lit 4) (instOfNatNat (nat_lit 4)))))
                    (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3))))
                  B →
                @LT.lt Nat instLTNat
                    (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
                      (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
                        (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) n n)
                        (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
                          (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3))) n))
                      (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3))))
                    B →
                  @LT.lt Nat instLTNat
                      (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
                        (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
                          (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
                            (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
                              (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) n n)
                              (@HPow.hPow Nat Nat Nat
                                (@instHPow Nat Nat (@NPow.toPow Nat (@Monoid.toNPow Nat Nat.instMonoid)))
                                (∑ v : Fin n,
                                  @Lax263307.WeightRounding.copies n
                                    (fun (v : Fin n) =>
                                      @Max.max Rat Rat.instSup (w v)
                                        (@OfNat.ofNat Rat (nat_lit 0) (@Rat.instOfNat (nat_lit 0))))
                                    ε v)
                                (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))))
                            n)
                          (∑ v : Fin n,
                            @Lax263307.WeightRounding.copies n
                              (fun (v : Fin n) =>
                                @Max.max Rat Rat.instSup (w v)
                                  (@OfNat.ofNat Rat (nat_lit 0) (@Rat.instOfNat (nat_lit 0))))
                              ε v))
                        (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3))))
                      B →
                    have cs :=
                      @Lax263307.WeightRounding.copies n
                        (fun (v : Fin n) =>
                          @Max.max Rat Rat.instSup (w v) (@OfNat.ofNat Rat (nat_lit 0) (@Rat.instOfNat (nat_lit 0))))
                        ε;
                    have N := ∑ v : Fin n, cs v;
                    Lax808846Proofs.Reasoning.Spec B
                      (fun (σ : Lax808846Proofs.Imp.Env) =>
                        And (@Eq (List Nat) σ.inp (@Lax263307.IndependentSetEncoding.encodeInput n G inst w ε))
                          (And
                            (@LE.le Nat instLENat
                              (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
                                (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
                                  (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) n n)
                                  (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
                                    (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3))) n))
                                (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3))))
                              (@List.length Nat (σ.arrs "input.data")))
                            (And (@LE.le Nat instLENat n (@List.length Nat (σ.arrs "copy.counts")))
                              (And (@LE.le Nat instLENat N (@List.length Nat (σ.arrs "blowup.owner")))
                                (@LE.le Nat instLENat (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) N N)
                                  (@List.length Nat (σ.arrs "blowup.matrix")))))))
                      Lax263307Proofs.NativeBlowUp.prepare
                      (fun (σ τ : Lax808846Proofs.Imp.Env) =>
                        And
                          (Lax455465Proofs.RamVirtualState.Prefix
                            (@Lax263307Proofs.NativeBlowUp.numberedMatrix n G inst cs) "blowup.matrix" τ)
                          (And
                            (Lax455465Proofs.RamVirtualState.Prefix (@Lax263307Proofs.NativeBlowUp.owners n cs)
                              "blowup.owner" τ)
                            (And (@Eq Nat (τ.vars "blowup.length") N)
                              (And
                                (Lax455465Proofs.RamVirtualState.Prefix
                                  (@Lax263307Proofs.NativeFrontend.tailInput n G inst w ε) "input.data" τ)
                                (And (@Eq (List Nat) τ.out σ.out) (@Eq Nat (τ.vars "input.n") n))))))
                      (Lax263307Proofs.NativeBlowUp.cost n N) := by sorry
Source
https://github.com/EdouardBonnet/lax-263307/blob/68b2d26aa2075e2ef80fd9d355ea748d2a818fd1/proofs/Lax263307Proofs/NativeBlowUp.lean, theorem Lax263307Proofs.NativeBlowUp.prepare_spec, line 459

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