Actual large-node initialization phase
OpenLax263307Proofs.NativeNodeTrace.large_segmentFix 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:
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.
import Definitions.Def_EdgeSublinearMWIS_Main_NativeDetailedInterfaces
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