math / data /lean /OAI /Algorithms /SubexponentialSAT /SqrtLog /BucketProgramProducedRankLiteral.lean
Download data/lean/OAI/Algorithms/SubexponentialSAT/SqrtLog/BucketProgramProducedRankLiteral.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 5.69 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Algorithms/SubexponentialSAT/SqrtLog/BucketProgramProducedRankLiteral.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Algorithms/SubexponentialSAT/SqrtLog/BucketProgramProducedRankLiteral.lean
-
curl -L -o BucketProgramProducedRankLiteral.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Algorithms/SubexponentialSAT/SqrtLog/BucketProgramProducedRankLiteral.lean
5.69 kB
| import OAI.Algorithms.SubexponentialSAT.LeanCompat | |
| import OAI.Algorithms.SubexponentialSAT.SqrtLog.BucketProgramProducedRankFiber | |
| import OAI.Algorithms.SubexponentialSAT.SqrtLog.BucketProgramProducedRankTables | |
| import OAI.Algorithms.SubexponentialSAT.SqrtLog.LayoutProducedMatrixNatural | |
| namespace OAI.Algorithms | |
| /-! The native fiber relation realizes the literal owner-sum matrix. Signed | |
| component mass bounds imply both safe shifting and a signature-height bound. -/ | |
| namespace SubexponentialSAT.SqrtLog.BucketProgram.ProducedRank | |
| open scoped BigOperators | |
| open SubexponentialSAT.MulticolorTypes SubexponentialSAT.Subexp.ConstructivePacking | |
| variable {r Q D n : β} | |
| def entryNat (P : PackingData (Fin D) (UniversalType r Q 1)) | |
| (A R : β) (t : Fin Q) (j i : β) : β€ := | |
| if hj : j < D then if hi : i < D then | |
| LayoutProgram.localEntry P A R t β¨j,hjβ© β¨i,hiβ© else 0 else 0 | |
| def FiberRel (ps : List (β Γ β)) (value : β β β β β€) (H : β) | |
| (j v : β) (p : LayoutMatrixProgram.Pair) : Prop := | |
| RowSelectionProgram.pairValue p= | |
| ((LayoutOwnerFiberProgram.fiberIndices v 0 ps).map (value j)).sum β§ | |
| RowSelectionProgram.pairTotal p.1 p.2 β€ H | |
| theorem fiber_value_literal (P : PackingData (Fin D) (UniversalType r Q 1)) | |
| (owner : Fin D β Fin n) (A R : β) (t : Fin Q) | |
| (ps : Fin D β β Γ β) (hp : β i,(ps i).1=(owner i).val) | |
| (j : Fin D) (v : Fin n) : | |
| ((LayoutOwnerFiberProgram.fiberIndices v.val 0 (List.ofFn ps)).map | |
| (entryNat P A R t j.val)).sum=LayoutProducedMatrix.literalNat P owner A R t j.val v.val := by | |
| rw [LayoutProducedMatrix.literalNat_fin] | |
| exact fiber_sum_eq_matrix owner ps hp (LayoutProgram.localEntry P A R t) | |
| (entryNat P A R t) (by intro j i; simp [entryNat]) j v | |
| theorem pair_abs_le_mass (p : LayoutMatrixProgram.Pair) (H : β) | |
| (hp : RowSelectionProgram.pairTotal p.1 p.2 β€ H) : | |
| |RowSelectionProgram.pairValue p| β€ (H:β€) := by | |
| unfold RowSelectionProgram.pairTotal at hp | |
| unfold RowSelectionProgram.pairValue RowSelectionProgram.signedValue | |
| have hp' : (SubexponentialSAT.BinaryArithmetic.toNat p.1 : β€)+ | |
| (SubexponentialSAT.BinaryArithmetic.toNat p.2 : β€) β€ (H:β€) := by exact_mod_cast hp | |
| have h1 := Int.natCast_nonneg (SubexponentialSAT.BinaryArithmetic.toNat p.1) | |
| have h2 := Int.natCast_nonneg (SubexponentialSAT.BinaryArithmetic.toNat p.2) | |
| rw [abs_le] | |
| omega | |
| theorem fiberRel_realizes (P : PackingData (Fin D) (UniversalType r Q 1)) | |
| (owner : Fin D β Fin n) (A R : β) (t : Fin Q) | |
| (ps : Fin D β β Γ β) (hp : β i,(ps i).1=(owner i).val) | |
| (H : β) (j v : β) (p : LayoutMatrixProgram.Pair) (hj : j < D) (hv : v < n) | |
| (hr : FiberRel (List.ofFn ps) (entryNat P A R t) H j v p) : | |
| RowSelectionProgram.pairValue p=LayoutProducedMatrix.literalNat P owner A R t j v β§ | |
| |LayoutProducedMatrix.literalNat P owner A R t j v| β€ (H:β€) := by | |
| have he := hr.1.trans (fiber_value_literal P owner A R t ps hp β¨j,hjβ© β¨v,hvβ©) | |
| exact β¨he,he βΈ pair_abs_le_mass p H hr.2β© | |
| /-- A single physical head table is bounded by the rank of its literal | |
| selected integer matrix, in exactly the emitted column order. -/ | |
| theorem producedHead_fiber_length {base : LeafHeadSetupProgram.Data} {N B z : β} | |
| {rows : List (List Bool)} {low : List Bool} | |
| (P : PackingData (Fin D) (UniversalType r Q 1)) | |
| (owner : Fin D β Fin n) (A R : β) (t : Fin Q) | |
| (ps : Fin D β β Γ β) (hp : β i,(ps i).1=(owner i).val) (H : β) | |
| {table : BucketTupleProgram.HeadTable} | |
| (ht : LeafHeadSetupProgram.ProducedHead base n N D rows low | |
| (FiberRel (List.ofFn ps) (entryNat P A R t) H) B z table) | |
| (hW : H β€ SubexponentialSAT.BinaryArithmetic.toNat (base.stacks 141)) : | |
| table.buckets.length β€ (commonBase n H)^ | |
| headRank (LayoutProducedMatrix.literalNat P owner A R t) D n rows low z := by | |
| apply producedHead_length_le_rank ht (LayoutProducedMatrix.literalNat P owner A R t) H | |
| Β· intro j v p hj hv hr | |
| have he := fiberRel_realizes P owner A R t ps hp H j v p hj hv hr | |
| refine β¨?_,he.1β© | |
| have hm := hr.2 | |
| unfold RowSelectionProgram.pairTotal at hm | |
| omega | |
| Β· intro j v p hj hv hr | |
| exact (fiberRel_realizes P owner A R t ps hp H j v p hj hv hr).2 | |
| /-- The actual r-table product, obtained from an original-address fiber | |
| entry relation. No head-cardinality bounds are hypotheses. -/ | |
| theorem producedHeads_fiber_product {base : LeafHeadSetupProgram.Data} {N B : β} | |
| {rows : List (List Bool)} {low : List Bool} | |
| (P : PackingData (Fin D) (UniversalType r Q 1)) | |
| (owner : Fin D β Fin n) (A R : β) (t : Fin Q) | |
| (ps : Fin D β β Γ β) (hp : β i,(ps i).1=(owner i).val) (H : β) | |
| {tables : List BucketTupleProgram.HeadTable} | |
| (ht : LeafHeadSetupProgram.ProducedHeads base n N D rows low | |
| (FiberRel (List.ofFn ps) (entryNat P A R t) H) B (t.val*r) tables) | |
| (hlen : tables.length=r) (hW : H β€ SubexponentialSAT.BinaryArithmetic.toNat (base.stacks 141)) : | |
| (tables.map fun table=>table.buckets.length).prod β€ (commonBase n H)^ | |
| (β g : Fin r,headRank (LayoutProducedMatrix.literalNat P owner A R t) | |
| D n rows low (t.val*r+g.val)) := by | |
| subst r | |
| have hh := producedHeads_product_le_rankSum ht | |
| (LayoutProducedMatrix.literalNat P owner A R t) H | |
| (fun j v p hj hv hr=>by | |
| have he := fiberRel_realizes P owner A R t ps hp H j v p hj hv hr | |
| refine β¨?_,he.1β© | |
| have hm := hr.2 | |
| unfold RowSelectionProgram.pairTotal at hm | |
| omega) | |
| (fun j v p hj hv hr=>(fiberRel_realizes P owner A R t ps hp H j v p hj hv hr).2) | |
| exact hh | |
| end SubexponentialSAT.SqrtLog.BucketProgram.ProducedRank | |
| end OAI.Algorithms | |