Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Actual large-node initialization phase

Open
Lax263307Proofs.NativeNodeTrace.large_segment

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

algorithmscomputational-complexitygraph-theory

Fix a graph, native core configuration, target, precision denominator and recursion fuel. Assume the published large-node numeric bounds, initialized graph/stack state and running phase. The phase machine performs the complete large-node initializer, preserves the required input/frame data and reaches the oracle-entry state with the declared initialization cost:

phaseout=4,LargeNodeOutput(σout).\mathrm{phase}_{\rm out}=4,\qquad\mathrm{LargeNodeOutput}(\sigma_{\rm out}).phaseout​=4,LargeNodeOutput(σout​).

This is a reusable source interface for composing the complete finite-program implementation.

Retired because the namespace-wrapped declaration compiled during publication but the proof-comparison parser rejects that header (expected token / unknown full theorem identifier). The mathematically identical, fully qualified declaration is Lax263307Proofs.NativeNodeTrace.large_segment_native.

Preamble
import Definitions.Def_EdgeSublinearMWIS_Main_NativeDetailedInterfaces
Formal statement
namespace Lax263307Proofs.NativeNodeTrace
theorem large_segment : ∀ {n : Nat} (B : Nat) (cfg : Lax263307Proofs.NativeCoreMachine.Config) (D k fuel : Nat) (G : SimpleGraph (Fin n))
  [inst : @DecidableRel (Fin n) (Fin n) (@SimpleGraph.Adj (Fin n) G)],
  Nat.lt ((0:Nat)) n →
    Nat.lt ((0:Nat)) cfg.K →
      Nat.lt
          (Nat.add
            (Nat.add
              (Nat.add
                (Lax263307Proofs.NativeNodeParameters.guard cfg.a cfg.K cfg.b n D) k)
              cfg.b)
            ((5:Nat)))
          B →
        Nat.lt
            (Lax263307Proofs.NativeMomentSetup.guardBound n k
              (Lax263307.AlgorithmParameters.level cfg.a cfg.K cfg.b n D))
            B →
          Nat.lt
              (@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@NPow.toPow Nat (@Monoid.toNPow Nat Nat.instMonoid)))
                ((2:Nat)) n)
              B →
            Nat.lt
                (Lax263307Proofs.NativeNodePrecision.guard n D
                  (Lax263307.MomentLP.dimension n (Lax263307.AlgorithmParameters.level cfg.a cfg.K cfg.b n D))
                  (Lax263307.AlgorithmParameters.floorDenominator cfg.a cfg.K cfg.b n D)
                  (Lax263307.AlgorithmParameters.level cfg.a cfg.K cfg.b n D))
                B →
              Nat.lt
                  (Nat.add
                    (Nat.add
                      (Nat.mul
                        ((3:Nat))
                        (Nat.mul
                          (Lax263307.MomentLP.dimension n (Lax263307.AlgorithmParameters.level cfg.a cfg.K cfg.b n D))
                          (Lax263307.MomentLP.dimension n (Lax263307.AlgorithmParameters.level cfg.a cfg.K cfg.b n D))))
                      (Nat.mul
                        ((3:Nat))
                        (Lax263307.MomentLP.dimension n (Lax263307.AlgorithmParameters.level cfg.a cfg.K cfg.b n D))))
                    ((20:Nat)))
                  B →
                ∀ (σ : Lax808846Proofs.Imp.Env),
                  @Lax263307Proofs.NativeLargeNode.Input n B cfg.a cfg.K cfg.b D k G inst σ →
                    @Eq Nat (σ.vars "recursion.fuel") fuel →
                      @Eq Nat (σ.vars "machine.running") ((1:Nat)) →
                        @Eq Nat (σ.vars "machine.phase") ((3:Nat)) →
                          ∃ (τ : Lax808846Proofs.Imp.Env),
                            And
                              (Lax263307Proofs.NativeMachineSegment.Segment B
                                (Lax263307Proofs.NativeCoreMachine.phases cfg)
                                ((1:Nat))
                                (Nat.add
                                  (Lax263307Proofs.NativeLargeNode.cost cfg.a n
                                    (Lax263307.AlgorithmParameters.level cfg.a cfg.K cfg.b n D))
                                  ((2:Nat)))
                                σ τ)
                              (And (@Lax263307Proofs.NativeLargeNode.Output n cfg.a cfg.K cfg.b D k G inst τ)
                                (And (@Eq Nat (τ.vars "recursion.fuel") fuel)
                                  (And
                                    (@Eq Nat (τ.vars "machine.running")
                                      ((1:Nat)))
                                    (@Eq Nat (τ.vars "machine.phase")
                                      ((4:Nat)))))) := by sorry
end Lax263307Proofs.NativeNodeTrace
Source
https://github.com/EdouardBonnet/lax-263307/blob/68b2d26aa2075e2ef80fd9d355ea748d2a818fd1/proofs/Lax263307Proofs/NativeNodeTrace.lean, theorem large_segment (lines 133–168)

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