Complete native collection of recursively solved parts
ProvedLax263307Proofs.NativeCollectionExecution.collect_segment_nativealgorithmscomputational-complexitygraph-theory
Fix the finite family of parts, core configuration, graph and child procedure. Assume the source membership and eligibility hypotheses, the complete collection context, allocated frames and bounded executions for all required children. The actual collection phase returns the exact functional collection result while retaining its stored context and root frame:
This is a reusable source interface for composing the complete finite-program implementation.
Preamble
import Definitions.Def_EdgeSublinearMWIS_Main_NativeDetailedInterfaces namespace Lax263307Proofs.NativeCollectionExecution end Lax263307Proofs.NativeCollectionExecution
Formal statement
theorem Lax263307Proofs.NativeCollectionExecution.collect_segment_native : ∀ {n : Nat} {ι : Type} [inst : Fintype ι] (D k r fuel S h T childSteps childTime : Nat)
(cfg : Lax263307Proofs.NativeCoreMachine.Config) (G : SimpleGraph (Fin n))
[inst_1 : @DecidableRel (Fin n) (Fin n) (@SimpleGraph.Adj (Fin n) G)] (x : Fin n → NNRat) (parts : ι → Finset (Fin n))
(order : List ι) (A : Finset (Fin n)) (extent : String → Nat) (front : List Nat) (base : Lax808846Proofs.Imp.Env)
(child : (C : Finset (Fin n)) → Nat → Option (Finset (Fin (@Finset.card (Fin n) C)))),
(∀ (i : ι), @Membership.mem ι (List ι) (@List.instMembership ι) order i) →
@LT.lt Nat instLTNat (@OfNat.ofNat Nat (nat_lit 0) (instOfNatNat (nat_lit 0))) n →
@LT.lt Nat instLTNat (@OfNat.ofNat Nat (nat_lit 0) (instOfNatNat (nat_lit 0))) D →
(∀ (v : Fin n),
Lax263307Proofs.NativeSignedArithmetic.Bounded
(@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@NPow.toPow Nat (@Monoid.toNPow Nat Nat.instMonoid)))
(@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))) h)
(@NNRat.cast Rat Rat.instNNRatCast (x v))) →
∀ (w : Nat),
@LE.le Nat instLENat (Lax263307Proofs.NativeComponentDecision.wordHeight n D k h) w →
@LE.le Nat instLENat (@List.length ι order)
(@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) n
(@OfNat.ofNat Nat (nat_lit 1) (instOfNatNat (nat_lit 1)))) →
@LT.lt Nat instLTNat
(@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@NPow.toPow Nat (@Monoid.toNPow Nat Nat.instMonoid)))
(@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))) n)
(@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@NPow.toPow Nat (@Monoid.toNPow Nat Nat.instMonoid)))
(@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))) w) →
@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)
(@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)
(@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) (@List.length Nat front)
(@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) S
(@List.length String (Lax263307Proofs.NativeCoreMachine.frameArrays cfg))))
(@List.length String (Lax263307Proofs.NativeCoreMachine.frameScalars cfg)))
(@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) n n))
(@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
(@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))) n))
(@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
(@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))) (@List.length ι order)))
T)
fuel)
(@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
(@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3)))
(Lax263307Proofs.NativeCatalogMetadata.N n r)))
(@OfNat.ofNat Nat (nat_lit 80) (instOfNatNat (nat_lit 80))))
(@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@NPow.toPow Nat (@Monoid.toNPow Nat Nat.instMonoid)))
(@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))) w) →
(∀ (i : ι),
@Membership.mem ι (List ι) (@List.instMembership ι) order i →
@LE.le Nat instLENat
(Lax263307.ComputedRounding.target
(@HDiv.hDiv Rat Rat Rat (@instHDiv Rat Rat.instDiv)
(@OfNat.ofNat Rat (nat_lit 1) (@Rat.instOfNat (nat_lit 1)))
(@Nat.cast Rat Rat.instNatCast D))
(∑ v ∈ parts i, @NNRat.cast Rat Rat.instNNRatCast (x v)))
T) →
(∀ (a : String),
@Membership.mem String (List String) (@List.instMembership String)
(Lax263307Proofs.NativeCoreMachine.frameArrays cfg) a →
@Eq Nat (extent a) S) →
@LE.le Nat instLENat
(@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
(@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) (@List.length Nat front)
(@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) S
(@List.length String (Lax263307Proofs.NativeCoreMachine.frameArrays cfg))))
(@List.length String (Lax263307Proofs.NativeCoreMachine.frameScalars cfg)))
(extent "recursion.frames") →
@LE.le Nat instLENat (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) n n)
(extent "child.graph") →
@LE.le Nat instLENat (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) n n)
(extent "search.graph") →
@LE.le Nat instLENat n (extent "subset.bits") →
@LE.le Nat instLENat n (extent "restrict.vertices") →
@LT.lt Nat instLTNat
(@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
(@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3))) n)
(extent "lp.word") →
@LE.le Nat instLENat
(@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
(@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3))) n)
(extent "sum.input") →
@LE.le Nat instLENat
(@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
(@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3)))
(Lax263307Proofs.NativeCatalogMetadata.N n r))
(extent "lp.input") →
@LE.le Nat instLENat
(@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
(@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3)))
(Lax263307Proofs.NativeCatalogMetadata.N n r))
(extent "round.normal") →
(∀ (i : ι),
@Membership.mem ι (List ι) (@List.instMembership ι) order i →
@LT.lt Rat Rat.instLT
(@HDiv.hDiv Rat Rat Rat (@instHDiv Rat Rat.instDiv)
(@HMul.hMul Rat Rat Rat (@instHMul Rat Rat.instMul)
(@HDiv.hDiv Rat Rat Rat (@instHDiv Rat Rat.instDiv)
(@OfNat.ofNat Rat (nat_lit 1) (@Rat.instOfNat (nat_lit 1)))
(@Nat.cast Rat Rat.instNatCast D))
(@Nat.cast Rat Rat.instNatCast k))
(@HMul.hMul Rat Rat Rat (@instHMul Rat Rat.instMul)
(@OfNat.ofNat Rat (nat_lit 4) (@Rat.instOfNat (nat_lit 4)))
(@Nat.cast Rat Rat.instNatCast n)))
(∑ v ∈ parts i, @NNRat.cast Rat Rat.instNNRatCast (x v)) →
∀ (σ : Lax808846Proofs.Imp.Env),
@Lax263307Proofs.NativeCollectionExecution.Invariant n
(@HPow.hPow Nat Nat Nat
(@instHPow Nat Nat
(@NPow.toPow Nat (@Monoid.toNPow Nat Nat.instMonoid)))
(@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))) w)
D k r fuel S G inst_1 x
(@List.map ι (Finset (Fin n)) parts order) A extent front base
σ →
@Lax263307Proofs.NativeRestrictionRead.Data n G inst_1
(fun (v : Fin n) => @NNRat.cast Rat Rat.instNNRatCast (x v))
(parts i) σ →
@Eq Nat (σ.vars "component.mask")
(@Lax263307Proofs.NativeMasks.mask n (parts i)) →
@Eq Nat (σ.vars "component.target")
(Lax263307.ComputedRounding.target
(@HDiv.hDiv Rat Rat Rat (@instHDiv Rat Rat.instDiv)
(@OfNat.ofNat Rat (nat_lit 1)
(@Rat.instOfNat (nat_lit 1)))
(@Nat.cast Rat Rat.instNatCast D))
(∑ v ∈ parts i,
@NNRat.cast Rat Rat.instNNRatCast (x v))) →
@Eq Nat (σ.vars "machine.running")
(@OfNat.ofNat Nat (nat_lit 1)
(instOfNatNat (nat_lit 1))) →
@Eq Nat (σ.vars "machine.phase")
(@OfNat.ofNat Nat (nat_lit 11)
(instOfNatNat (nat_lit 11))) →
@Lax263307Proofs.NativeCollectionChild.Recursive n
(@HPow.hPow Nat Nat Nat
(@instHPow Nat Nat
(@NPow.toPow Nat
(@Monoid.toNPow Nat Nat.instMonoid)))
(@OfNat.ofNat Nat (nat_lit 2)
(instOfNatNat (nat_lit 2)))
w)
S fuel childSteps childTime cfg G inst_1 (parts i)
(Lax263307.ComputedRounding.target
(@HDiv.hDiv Rat Rat Rat (@instHDiv Rat Rat.instDiv)
(@OfNat.ofNat Rat (nat_lit 1)
(@Rat.instOfNat (nat_lit 1)))
(@Nat.cast Rat Rat.instNatCast D))
(∑ v ∈ parts i,
@NNRat.cast Rat Rat.instNNRatCast (x v)))
front σ
(child (parts i)
(Lax263307.ComputedRounding.target
(@HDiv.hDiv Rat Rat Rat
(@instHDiv Rat Rat.instDiv)
(@OfNat.ofNat Rat (nat_lit 1)
(@Rat.instOfNat (nat_lit 1)))
(@Nat.cast Rat Rat.instNatCast D))
(∑ v ∈ parts i,
@NNRat.cast Rat Rat.instNNRatCast (x v))))) →
∀ (σ : Lax808846Proofs.Imp.Env),
@Lax263307Proofs.NativeCollectionTrace.At n
(@Lax263307Proofs.NativeCollectionExecution.Invariant n
(@HPow.hPow Nat Nat Nat
(@instHPow Nat Nat
(@NPow.toPow Nat (@Monoid.toNPow Nat Nat.instMonoid)))
(@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))) w)
D k r fuel S G inst_1 x (@List.map ι (Finset (Fin n)) parts order) A
extent front base)
(@OfNat.ofNat Nat (nat_lit 0) (instOfNatNat (nat_lit 0)))
(@EmptyCollection.emptyCollection (Finset (Fin n))
(@Finset.instEmptyCollection (Fin n)))
σ →
∃ (τ : Lax808846Proofs.Imp.Env) (transitions : Nat) (total : Nat),
And
(Lax263307Proofs.NativeMachineSegment.Segment
(@HPow.hPow Nat Nat Nat
(@instHPow Nat Nat
(@NPow.toPow Nat (@Monoid.toNPow Nat Nat.instMonoid)))
(@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))) w)
(Lax263307Proofs.NativeCoreMachine.phases cfg) transitions total σ
τ)
(And
(@LE.le Nat instLENat transitions
(@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
(@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
(@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
childSteps
(@OfNat.ofNat Nat (nat_lit 5) (instOfNatNat (nat_lit 5))))
(@List.length ι order))
(@OfNat.ofNat Nat (nat_lit 1) (instOfNatNat (nat_lit 1)))))
(And
(@LE.le Nat instLENat total
(@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
(@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
(Lax263307Proofs.NativeCollectionExecution.partCost cfg n
r S h childTime)
(@List.length ι order))
(@OfNat.ofNat Nat (nat_lit 10)
(instOfNatNat (nat_lit 10)))))
(@Lax263307Proofs.NativeCollectionTrace.ResultOutput n
(@Lax263307Proofs.NativeCollectionExecution.Invariant n
(@HPow.hPow Nat Nat Nat
(@instHPow Nat Nat
(@NPow.toPow Nat (@Monoid.toNPow Nat Nat.instMonoid)))
(@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))
w)
D k r fuel S G inst_1 x
(@List.map ι (Finset (Fin n)) parts order) A extent front
base)
(@Lax263307Proofs.NativeCollectionExecution.Cut n r A)
(@Lax263307.ComputedRounding.collect n ι inst order parts
(@HDiv.hDiv Rat Rat Rat (@instHDiv Rat Rat.instDiv)
(@OfNat.ofNat Rat (nat_lit 1)
(@Rat.instOfNat (nat_lit 1)))
(@Nat.cast Rat Rat.instNatCast D))
k
(fun (i : ι) =>
∑ v ∈ parts i, @NNRat.cast Rat Rat.instNNRatCast (x v))
fun (i : ι) (t : Nat) =>
@Option.map (Finset (Fin (@Finset.card (Fin n) (parts i))))
(Finset (Fin n))
(fun
(I : Finset (Fin (@Finset.card (Fin n) (parts i)))) =>
@Finset.image (Fin (@Finset.card (Fin n) (parts i)))
(Fin n) (instDecidableEqFin n)
(@DFunLike.coe
(@OrderEmbedding
(Fin (@Finset.card (Fin n) (parts i))) (Fin n)
(@instLEFin (@Finset.card (Fin n) (parts i)))
(@instLEFin n))
(Fin (@Finset.card (Fin n) (parts i)))
(fun (x : Fin (@Finset.card (Fin n) (parts i))) =>
Fin n)
(@instFunLikeOrderEmbedding
(Fin (@Finset.card (Fin n) (parts i))) (Fin n)
(@instLEFin (@Finset.card (Fin n) (parts i)))
(@instLEFin n))
(@Lax263307.ComputedSeparators.label n (parts i)))
I)
(child (parts i) t))
τ))) := by sorrySource