OAI/Combinatorics/LowSpaceSubsetSum/Counting/FiniteRepetition.lean
17 declarations, 0 contain sorry, 0 declared as axioms
Independent complete rounds and the fixed finite repetition schedule
The product law retains both actual outcomes, including sampler exhaustion. Repetition draws fresh complete rounds and accepts if any round accepts.
- def
OAI.LowSpaceSubsetSum.FiniteLaw.prodline 26Source documentation
Independent actual outcomes. A failure value in either coordinate does not prevent the other coordinate from being drawn.
def prod (μ : FiniteLaw Ω) (ν : FiniteLaw Ψ) : FiniteLaw (Ω × Ψ) where …
Mentions: OAI.LowSpaceSubsetSum.FiniteLaw
- theorem
OAI.LowSpaceSubsetSum.FiniteLaw.prod_first_probabilityline 34 - theorem
OAI.LowSpaceSubsetSum.FiniteLaw.prod_second_probabilityline 44 - theorem
OAI.LowSpaceSubsetSum.FiniteLaw.prod_or_ge_leftline 55 - theorem
OAI.LowSpaceSubsetSum.FiniteLaw.prod_or_ge_rightline 61 - def
OAI.LowSpaceSubsetSum.FiniteLaw.piline 68Source documentation
Fresh independent draws, allowing a different finite law at each index.
def pi {I : Type*} [Fintype I] [DecidableEq I] (A : I → Type*) [∀ i, Fintype (A i)] (μ : ∀ i, FiniteLaw (A i)) : FiniteLaw (∀ i, A i) where …Mentions: OAI.LowSpaceSubsetSum.FiniteLaw
- theorem
OAI.LowSpaceSubsetSum.FiniteLaw.pi_forall_probabilityline 77 - def
OAI.LowSpaceSubsetSum.FiniteLaw.iidline 93 - theorem
OAI.LowSpaceSubsetSum.FiniteLaw.iid_forall_probabilityline 96 - theorem
OAI.LowSpaceSubsetSum.FiniteLaw.iid_exists_probabilityline 101 - def
OAI.LowSpaceSubsetSum.repeatAcceptline 114Source documentation
The executable finite OR of complete trial outcomes.
def repeatAccept {Ω : Type*} {k : ℕ} (test : Ω → Bool) (draws : Fin k → Ω) : Bool := … - theorem
OAI.LowSpaceSubsetSum.repeatAccept_eq_trueline 117 - theorem
OAI.LowSpaceSubsetSum.repeatAccept_soundline 122 - theorem
OAI.LowSpaceSubsetSum.repetition_acceptance_probabilityline 128 - def
OAI.LowSpaceSubsetSum.optionAcceptline 142Source documentation
Exhaustion is a rejecting actual outcome, without conditioning the law.
def optionAccept {α : Type*} (test : α → Bool) : Option α → Bool | none => false | some x => test x - theorem
OAI.LowSpaceSubsetSum.optionAccept_eq_trueline 146 - theorem
OAI.LowSpaceSubsetSum.bounded_repetition_acceptance_probabilityline 150