Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

One bounded step of ranked subset enumeration

Proved
Lax263307Proofs.NativeCombinations.subset_entry_spec_native

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

algorithmscomputational-complexitygraph-theory

Suppose i<ni<ni<n, the remaining selection count is at most kkk, the current rank is below BBB, and all required binomial coefficients and table addresses are below BBB. Given the full binomial table prefix, the fixed subset-entry command returns the next inclusion bit and updates the remaining count and rank exactly according to the enumeration transition:

(b,u′,r′)=advance⁡(n−i,u,r).(b,u',r')=\operatorname{advance}(n-i,u,r).(b,u′,r′)=advance(n−i,u,r).

The operational cost is at most forty steps.

Preamble
import Definitions.Def_EdgeSublinearMWIS_Main_NativeNextInterfaces
namespace Lax263307Proofs.NativeCombinations
end Lax263307Proofs.NativeCombinations
Formal statement
theorem Lax263307Proofs.NativeCombinations.subset_entry_spec_native : ∀ (B n k i need rank : Nat),
  @LT.lt Nat instLTNat i n →
    @LE.le Nat instLENat need k →
      @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)
                (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
                  (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) n
                    (@OfNat.ofNat Nat (nat_lit 1) (instOfNatNat (nat_lit 1))))
                  (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) k
                    (@OfNat.ofNat Nat (nat_lit 1) (instOfNatNat (nat_lit 1)))))
                n)
              k)
            (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3))))
          B →
        @LT.lt Nat instLTNat rank B →
          (∀ (i : Nat),
              @LE.le Nat instLENat i n → ∀ (j : Nat), @LE.le Nat instLENat j k → @LT.lt Nat instLTNat (i.choose j) B) →
            Lax808846Proofs.Reasoning.Spec B
              (fun (σ : Lax808846Proofs.Imp.Env) =>
                And (@Eq Nat (σ.vars "choose.n") n)
                  (And
                    (@Eq Nat (σ.vars "choose.cols")
                      (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) k
                        (@OfNat.ofNat Nat (nat_lit 1) (instOfNatNat (nat_lit 1)))))
                    (And (@Eq Nat (σ.vars "subset.i") i)
                      (And (@Eq Nat (σ.vars "subset.need") need)
                        (And (@Eq Nat (σ.vars "subset.rank") rank)
                          (Lax455465Proofs.RamVirtualState.Prefix (Lax263307Proofs.NativeCombinations.table n k)
                            "choose.table" σ))))))
              Lax263307Proofs.NativeCombinations.subsetEntry
              (fun (x τ : Lax808846Proofs.Imp.Env) =>
                And
                  (@Eq Nat (τ.vars "subset.bit")
                    (@Prod.fst Nat (Prod Nat Nat)
                      (Lax263307Proofs.NativeCombinations.advance
                        (@HSub.hSub Nat Nat Nat (@instHSub Nat instSubNat) n i) need rank)))
                  (And
                    (@Eq Nat (τ.vars "subset.need")
                      (@Prod.fst Nat Nat
                        (@Prod.snd Nat (Prod Nat Nat)
                          (Lax263307Proofs.NativeCombinations.advance
                            (@HSub.hSub Nat Nat Nat (@instHSub Nat instSubNat) n i) need rank))))
                    (@Eq Nat (τ.vars "subset.rank")
                      (@Prod.snd Nat Nat
                        (@Prod.snd Nat (Prod Nat Nat)
                          (Lax263307Proofs.NativeCombinations.advance
                            (@HSub.hSub Nat Nat Nat (@instHSub Nat instSubNat) n i) need rank))))))
              (@OfNat.ofNat Nat (nat_lit 40) (instOfNatNat (nat_lit 40))) := by sorry
Source
https://github.com/EdouardBonnet/lax-263307/blob/68b2d26aa2075e2ef80fd9d355ea748d2a818fd1/proofs/Lax263307Proofs/NativeCombinations.lean#L304

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