OAI/Computability/FourierCircuit/MultiWord.lean
47 declarations, 0 contain sorry, 0 declared as axioms
- inductive
OAI.ExactFourier.Packing.Stepline 11 - def
OAI.ExactFourier.Packing.Step.matrixline 18 - def
OAI.ExactFourier.Packing.Step.kindline 22 - def
OAI.ExactFourier.Packing.Step.embedline 26 - theorem
OAI.ExactFourier.Packing.Step.matrix_embedline 30 - theorem
OAI.ExactFourier.Packing.Step.kind_embedline 36 - abbrev
OAI.ExactFourier.Packing.Wordline 38 - def
OAI.ExactFourier.Packing.Word.matrixline 41 - def
OAI.ExactFourier.Packing.Word.callsline 43 - def
OAI.ExactFourier.Packing.Word.countline 45 - def
OAI.ExactFourier.Packing.Word.embedline 47 - theorem
OAI.ExactFourier.Packing.Word.matrix_nilline 49 - theorem
OAI.ExactFourier.Packing.Word.matrix_consline 50 - theorem
OAI.ExactFourier.Packing.Word.matrix_appendline 52 - theorem
OAI.ExactFourier.Packing.Word.calls_appendline 54 - theorem
OAI.ExactFourier.Packing.Word.count_appendline 56 - theorem
OAI.ExactFourier.Packing.Word.matrix_embedline 59 - theorem
OAI.ExactFourier.Packing.Word.calls_embedline 67 - theorem
OAI.ExactFourier.Packing.Word.count_embedline 70 - theorem
OAI.ExactFourier.Packing.Word.unitline 73 - def
OAI.ExactFourier.Packing.monoWordline 82 - def
OAI.ExactFourier.Packing.callWordline 83 - theorem
OAI.ExactFourier.Packing.matrix_monoWordline 84 - theorem
OAI.ExactFourier.Packing.matrix_callWordline 86 - theorem
OAI.ExactFourier.Packing.calls_monoWordline 88 - theorem
OAI.ExactFourier.Packing.calls_callWordline 90 - theorem
OAI.ExactFourier.Packing.pattern_wordline 93 - def
OAI.ExactFourier.Embedded.sigmaInline 119 - theorem
OAI.ExactFourier.Embedded.matrix_sigmaInline 121 - theorem
OAI.ExactFourier.Embedded.list_update_prodline 141 - theorem
OAI.ExactFourier.Embedded.blockDiagonal'_productline 155 - theorem
OAI.ExactFourier.Embedded.card_complementline 184 - theorem
OAI.ExactFourier.Embedded.exists_completionline 190Source documentation
Complete a prescribed active-tuple matching with untouched spectator wires.
theorem exists_completion (e : β ↪ α) (f : β ↪ γ) (hcard : Fintype.card α≤Fintype.card γ) : ∃ g : α ↪ γ,e.trans g=f := by … - theorem
OAI.ExactFourier.Embedded.realize_activeline 206 - def
OAI.ExactFourier.Embedded.sigmaEmbedline 216 - theorem
OAI.ExactFourier.Embedded.matrix_sigmaEmbedline 226 - theorem
OAI.ExactFourier.Packing.Word.matrix_flattenline 284 - theorem
OAI.ExactFourier.Packing.Word.calls_flattenline 290 - def
OAI.ExactFourier.Packing.Word.reindexline 296 - theorem
OAI.ExactFourier.Packing.Word.matrix_reindexline 299 - theorem
OAI.ExactFourier.Packing.Word.calls_reindexline 302 - def
OAI.ExactFourier.Packing.Word.blockSumline 308 - theorem
OAI.ExactFourier.Packing.Word.matrix_blockSumline 311 - theorem
OAI.ExactFourier.Packing.Word.calls_blockSumline 317 - theorem
OAI.ExactFourier.Packing.Word.count_blockSumline 322 - theorem
OAI.ExactFourier.Packing.prod_filter_mapline 337Source documentation
Deleting only identity factors preserves a noncommutative product.
theorem prod_filter_map {X M : Type*} [Monoid M] (L : List X) (p : X→Prop) [DecidablePred p] (f : X→M) (hf : ∀ x∈L,¬p x → f x=1) : ((L.filter p).map f).prod=(L.map f).prod := by …Mentions: OAI.ExactFourier.L
- theorem
OAI.ExactFourier.Packing.ordered_paddingline 349Source documentation
Physical slot padding retains every local program's exact multiplication order.
theorem ordered_padding {M : Type*} [Monoid M] {k T : ℕ} (time : Fin k→Fin T) (ht : StrictMono time) (f : Fin k→M) : (List.ofFn (Function.extend time f (fun _=>1))).prod=(List.ofFn f).prod := by …