OAI/Combinatorics/ContingencyTables/Sampling/ExactPublicCost.lean
7 declarations, 0 contain sorry, 0 declared as axioms
Cost-preserving literal wrapping of exact-sampling prefixes
- def
OAI.ContingencyTables.ExactPublicCost.middleOutputline 17 - def
OAI.ContingencyTables.ExactPublicCost.outputline 22 - theorem
OAI.ContingencyTables.ExactPublicCost.wrap_prefixline 26 - theorem
OAI.ContingencyTables.ExactPublicCost.table_prefixline 94Source documentation
Table decoding preserves the finite-prefix work bound.
theorem table_prefix (htotal : (∑ i,r i)=∑ j,c j) (N B : ℕ) (hB : ∀ X : Table r c,GreedyFeasibleTable.printMatrixRealizer.cost (matrixCode X.val)≤B) : ∃ p,Implements ExactPhysicalProgram.program.table (ExactTablePrefix.output r c) (ExactPhysicalProgram.program.initial (Tape.mk₁ (TreePost.packed (ExactTablePrefix.input r c)))) p ∧ (∀ g : Option (Table r c) → ℚ,p.mean g=(ExactTablePrefix.experiment r c N).mean g) ∧ p.cost≤ExactPhysicalCost.budget (ExactTablePrefix.input r c) N B := by …Mentions: OAI.ContingencyTables.Table, OAI.ContingencyTables.ExactTablePrefix.output, OAI.ContingencyTables.ExactTablePrefix.input, OAI.ContingencyTables.ExactTablePrefix.experiment, OAI.ContingencyTables.ExactPhysicalCost.budget
- def
OAI.ContingencyTables.ExactPublicCost.budgetline 121 - theorem
OAI.ContingencyTables.ExactPublicCost.prefix_correct_costline 125 - lemma
OAI.ContingencyTables.ExactPublicCost.quadratic_budgetline 142