Fixed native separator-call output and component masks
OpenLax263307Proofs.NativeSeparatorOutput.exists_programLet be any polynomial word-RAM function. There is one fixed native program, fixed natural word/time/output polynomials and an encoding of its width polynomial. For every positive-order graph, positive load and bounded nonnegative rational load vector meeting the stated word and workspace guards, the native command preserves its complete context and writes the masks and records decoded from the same function :
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.NativeSeparatorOutput.exists_program_native.
import Definitions.Def_EdgeSublinearMWIS_Main_NativeDetailedInterfaces
namespace Lax263307Proofs.NativeSeparatorOutput
theorem exists_program : ∀ (f : List Nat → List Nat),
Lax759944.RamPolytime.RamPolytime f →
∃ (p : Lax808846.Ram.Program) (wp : @Polynomial Nat Nat.instSemiring) (tp : @Polynomial Nat Nat.instSemiring) (op :
@Polynomial Nat Nat.instSemiring) (coeff : List Nat),
And
(∀ (z : Nat),
@Eq Nat (Lax455465Proofs.RamPolynomial.value coeff z) (@Polynomial.eval Nat Nat.instSemiring z wp))
(∀ (b n load k h : Nat) (G : SimpleGraph (Fin n))
[inst : @DecidableRel (Fin n) (Fin n) (@SimpleGraph.Adj (Fin n) G)] (x : Fin n → NNRat),
Nat.lt ((0:Nat)) n →
Nat.lt ((0:Nat)) load →
(∀ (v : Fin n),
Lax263307Proofs.NativeSignedArithmetic.Bounded
(@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@NPow.toPow Nat (@Monoid.toNPow Nat Nat.instMonoid)))
((2:Nat)) h)
(@NNRat.cast Rat Rat.instNNRatCast (x v))) →
have H := Lax263307Proofs.NativeLargeResources.heightExponent b n load k h;
∀ (w : Nat),
Nat.le (Lax263307Proofs.NativeUniformFlow.wordHeight n H p wp tp op) w →
have cs :=
@Lax263307.ComputedSeparators.cuts n (@Lax263307.ComputedSeparators.step n f G inst x b load k) n
(@Finset.univ (Fin n) (Fin.fintype n));
Lax808846Proofs.Reasoning.Spec
(@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@NPow.toPow Nat (@Monoid.toNPow Nat Nat.instMonoid)))
((2:Nat)) w)
(fun (σ : Lax808846Proofs.Imp.Env) =>
And
(@Lax263307Proofs.NativeSeparatorContext.Context n G inst x b load k
(Lax263307Proofs.NativeUniformFlow.spaceBound n H tp) σ)
(Nat.le
(Nat.add n
((1:Nat)))
(@List.length Nat (σ.arrs "separator.pieces"))))
(Lax263307Proofs.NativeSeparatorOutput.command p coeff)
(fun (x_1 τ : Lax808846Proofs.Imp.Env) =>
And
(@Lax263307Proofs.NativeSeparatorContext.Context n G inst x b load k
(Lax263307Proofs.NativeUniformFlow.spaceBound n H tp) τ)
(And
(@Eq Nat (τ.vars "separator.remaining")
(@Lax263307Proofs.NativeMasks.mask n
(@Lax263307.ComputedSeparators.remaining n (@Finset.univ (Fin n) (Fin.fintype n)) cs)))
(And
(@Eq Nat (τ.vars "separator.value")
(@Lax263307Proofs.NativeMasks.mask n (@Lax263307.ComputedSeparators.separator n cs)))
(And
(@Eq Nat (τ.vars "separator.count")
(@List.length (Prod (Finset (Fin n)) (Finset (Fin n))) cs))
(And
(Lax455465Proofs.RamVirtualState.Prefix (@Lax263307Proofs.NativeCutRecords.words n cs)
"separator.cuts" τ)
(And
(@Eq Nat (τ.vars "separator.position")
(Nat.mul
((2:Nat))
(@List.length (Prod (Finset (Fin n)) (Finset (Fin n))) cs)))
(Lax455465Proofs.RamVirtualState.Prefix
(@Lax263307Proofs.NativeCutPieces.words n cs) "separator.pieces" τ)))))))
(Lax263307Proofs.NativeSeparatorOutput.timeBound n H p coeff tp)) := by sorry
end Lax263307Proofs.NativeSeparatorOutput