Lean module · Frontier
BanditRLProof.DelayedFeedback.ActionLaw
Generated source map for this Lean module.
Module map
Imports
BanditRLProof.DelayedFeedback.Elimination, BanditRLProof.Exp3ConditionalMoments
Imported by
Declarations
Open an item to read its exact compact statement and source link. Detailed teaching notes are linked when registered.
structure
BanditRLProof.DelayedFeedback.DelayedSAPOAllocation
Compiled
A line-15 allocation together with the exact hypotheses needed to make its coordinates a probability distribution. EAP must eventually construct these fields; this structure does not assume that obligation away.
Used in these reading views: Bandit Book
10. Automation, resources, and open routes
Canonical node identity
declaration:BanditRLProof.DelayedFeedback.DelayedSAPOAllocationReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
structure DelayedSAPOAllocation (K : Nat) where
def
BanditRLProof.DelayedFeedback.DelayedSAPOAllocation.probability
Compiled
The Algorithm 5 line-15 probability coordinate associated with a certified allocation.
Used in these reading views: Bandit Book
10. Automation, resources, and open routes
Canonical node identity
declaration:BanditRLProof.DelayedFeedback.DelayedSAPOAllocation.probabilityReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
noncomputable def probability {K : Nat} (allocation : DelayedSAPOAllocation K) (i : Fin K) : ℝ
theorem
BanditRLProof.DelayedFeedback.DelayedSAPOAllocation.probability_nonnegative
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book
10. Automation, resources, and open routes
Canonical node identity
declaration:BanditRLProof.DelayedFeedback.DelayedSAPOAllocation.probability_nonnegativeReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem probability_nonnegative {K : Nat} (allocation : DelayedSAPOAllocation K) (i : Fin K) : 0 ≤ allocation.probability i
theorem
BanditRLProof.DelayedFeedback.DelayedSAPOAllocation.sum_probability_eq_one
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book
10. Automation, resources, and open routes
Canonical node identity
declaration:BanditRLProof.DelayedFeedback.DelayedSAPOAllocation.sum_probability_eq_oneReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem sum_probability_eq_one {K : Nat} (allocation : DelayedSAPOAllocation K) : ∑ i, allocation.probability i = 1
theorem
BanditRLProof.DelayedFeedback.DelayedSAPOAllocation.finiteActionDistribution
Compiled
Reuse the library's finite-action probability-vector interface instead of introducing a second ad hoc sampling semantics for Delayed SAPO.
Used in these reading views: Bandit Book
10. Automation, resources, and open routes
Canonical node identity
declaration:BanditRLProof.DelayedFeedback.DelayedSAPOAllocation.finiteActionDistributionReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem finiteActionDistribution {K : Nat} (allocation : DelayedSAPOAllocation K) : Exp3.FiniteActionDistribution (Finset.univ : Finset (Fin K)) allocation.probability where
def
BanditRLProof.DelayedFeedback.DelayedSAPOAllocation.actionMeasure
Compiled
One-round randomized action law induced by the certified line-15 allocation. A measurable history kernel and recursive generated trajectory remain separate obligations.
Used in these reading views: Bandit Book
10. Automation, resources, and open routes
Canonical node identity
declaration:BanditRLProof.DelayedFeedback.DelayedSAPOAllocation.actionMeasureReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
noncomputable def actionMeasure {K : Nat} (allocation : DelayedSAPOAllocation K) : Measure (Fin K)
theorem
BanditRLProof.DelayedFeedback.DelayedSAPOAllocation.actionMeasure_isProbabilityMeasure
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book
10. Automation, resources, and open routes
Canonical node identity
declaration:BanditRLProof.DelayedFeedback.DelayedSAPOAllocation.actionMeasure_isProbabilityMeasureReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem actionMeasure_isProbabilityMeasure {K : Nat} (allocation : DelayedSAPOAllocation K) : IsProbabilityMeasure allocation.actionMeasure
def
BanditRLProof.DelayedFeedback.causalDelayedSAPOActionMeasureRule
Compiled
Convert a causal allocation rule into a causal, measure-valued action rule. The only input remains `ActionTimeView`; hidden delays and unobserved losses are not added to the algorithm interface.
Used in these reading views: Bandit Book
10. Automation, resources, and open routes
Canonical node identity
declaration:BanditRLProof.DelayedFeedback.causalDelayedSAPOActionMeasureRuleReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
noncomputable def causalDelayedSAPOActionMeasureRule {K : Nat} {Loss : Type*} (rule : CausalDecisionRule (Fin K) Loss (DelayedSAPOAllocation K)) : CausalDecisionRule (Fin K) Loss (Measure (Fin K))
theorem
BanditRLProof.DelayedFeedback.causalDelayedSAPOActionMeasureRule_isProbabilityMeasure
Compiled
Every output of the causal measure-valued rule is a probability measure.
Used in these reading views: Bandit Book
10. Automation, resources, and open routes
Canonical node identity
declaration:BanditRLProof.DelayedFeedback.causalDelayedSAPOActionMeasureRule_isProbabilityMeasureReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem causalDelayedSAPOActionMeasureRule_isProbabilityMeasure {K : Nat} {Loss : Type*} (rule : CausalDecisionRule (Fin K) Loss (DelayedSAPOAllocation K)) (t : Nat) (view : ActionTimeView (Fin K) Loss) : IsProbabilityMeasure (causalDelayedSAPOActionMeasureRule rule t view)
theorem
BanditRLProof.DelayedFeedback.causalDelayedSAPOActionMeasureRule_eq_of_observation_equivalent
Compiled
Observation-equivalent hidden worlds induce exactly the same one-round Delayed SAPO action law for every allocation rule typed on the causal view.
Used in these reading views: Bandit Book
10. Automation, resources, and open routes
Canonical node identity
declaration:BanditRLProof.DelayedFeedback.causalDelayedSAPOActionMeasureRule_eq_of_observation_equivalentReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem causalDelayedSAPOActionMeasureRule_eq_of_observation_equivalent {K : Nat} {Loss : Type*} (rule : CausalDecisionRule (Fin K) Loss (DelayedSAPOAllocation K)) (delay₁ delay₂ : Nat → Nat) (action₁ action₂ : Nat → Fin K) (loss₁ loss₂ : Nat → Loss) (t : Nat) (hvisible : observedBefore delay₁ t = observedBefore delay₂ t) (haction : ∀ s, s < t → action₁ s = action₂ s) (hloss : ∀ s, s ∈ observedBefore delay₁ t → loss₁ s = loss₂ s) : causalDelayedSAPOActionMeasureRule rule t (actionTimeViewAt delay₁ action₁ loss₁ t) = causalDelayedSAPOActionMeasureRule rule t (actionTimeViewAt delay₂ action₂ loss₂ t)