OAI/Combinatorics/KServer/Experiments.lean
52 declarations, 0 contain sorry, 0 declared as axioms
- def
OAI.KServer.FiniteExperiment.optimalTraceline 18Source documentation
A fixed minimizing labeled trajectory for each complete input.
def optimalTrace (s : Configuration k Y) (σ : Fin H → Y) : List (Y × Fin k) := …
Mentions: OAI.KServer.Configuration
- lemma
OAI.KServer.FiniteExperiment.optimalTrace_requestsline 22 - lemma
OAI.KServer.FiniteExperiment.optimalTrace_costline 27 - lemma
OAI.KServer.FiniteExperiment.optimalTrace_lengthline 33 - def
OAI.KServer.FiniteExperiment.hiddenline 39Source documentation
The genuine hidden configuration, frozen when the finite input ends.
def hidden (s : Configuration k Y) (σ : Fin H → Y) (t : ℕ) : Configuration k Y := …
Mentions: OAI.KServer.Configuration
- lemma
OAI.KServer.FiniteExperiment.hidden_zeroline 43 - def
OAI.KServer.FiniteExperiment.moverline 47Source documentation
Current designated occurrence in the selected optimum; it is not observed.
def mover (s : Configuration k Y) (σ : Fin H → Y) (t : Fin H) : Fin k := …
Mentions: OAI.KServer.Configuration
- lemma
OAI.KServer.FiniteExperiment.optimalTrace_get_requestline 51 - lemma
OAI.KServer.FiniteExperiment.hidden_stepline 60 - lemma
OAI.KServer.FiniteExperiment.hidden_coversline 69 - def
OAI.KServer.FiniteExperiment.requestPrefixline 75Source documentation
A finite observation sufficient for exactly the request requestPrefix.
def requestPrefix (σ : Fin H → Y) (t : ℕ) : Fin H → Option Y := …
- lemma
OAI.KServer.FiniteExperiment.prefix_refinesline 79 - lemma
OAI.KServer.FiniteExperiment.prefix_requestline 88 - def
OAI.KServer.FiniteExperiment.historyline 97Source documentation
Histories include the independent partition tape from time zero. Coding a finite observation by a natural number is injective, not a loss of information.
def history (t : ℕ) (ω : (Fin H → Y) × T) : ℕ := …
- lemma
OAI.KServer.FiniteExperiment.history_eq_iffline 101 - lemma
OAI.KServer.FiniteExperiment.history_refinesline 107 - def
OAI.KServer.FiniteExperiment.weightline 113Source documentation
Literal independent product weights, before any requestPrefix is revealed.
def weight (law : FiniteDistribution (Fin H → Y)) (tape : FiniteDistribution T) (ω : (Fin H → Y) × T) : ℝ := law.val ω.1*tape.val ω.2 …Mentions: OAI.KServer.FiniteDistribution
- lemma
OAI.KServer.FiniteExperiment.weight_nonnegline 117 - lemma
OAI.KServer.FiniteExperiment.weight_sumline 122 - def
OAI.KServer.FiniteExperiment.countline 129Source documentation
All ranks queried by the allocation are actual conditional hidden counts. The online map may depend on the partition tape and request requestPrefix; it never changes how the old hidden quantity is filtered.
def count (s : Configuration k Y) {V : Type*} (map : ℕ → ((Fin H → Y) × T) → Y → V) (under : V → V → Bool) (v : V) (t : ℕ) (ω : (Fin H → Y) × T) : ℕ := …Mentions: OAI.KServer.Configuration
- lemma
OAI.KServer.FiniteExperiment.count_leline 134 - def
OAI.KServer.FiniteExperiment.ranksline 142Source documentation
This concrete process discharges the signed all-step filtering premise.
def ranks (s : Configuration k Y) (law : FiniteDistribution (Fin H → Y)) (tape : FiniteDistribution T) {V : Type*} (map : ℕ → ((Fin H → Y) × T) → Y → V) (under : V → V → Bool) (v : V) (a : Fin k) : RankTracking.FilteredRanks (weight law tape) := …Mentions: OAI.KServer.Configuration, OAI.KServer.FiniteDistribution, OAI.KServer.RankTracking.FilteredRanks, OAI.KServer.FiniteExperiment.weight
- lemma
OAI.KServer.FiniteExperiment.ranks_driftline 148 - lemma
OAI.KServer.FiniteExperiment.hidden_movementline 162 - lemma
OAI.KServer.FiniteExperiment.hidden_total_costline 170 - lemma
OAI.KServer.FiniteExperiment.expected_hidden_costline 193 - def
OAI.KServer.FiniteExperiment.requestHistoryline 203Source documentation
True request history alone, for computing the metric posterior independently of the partition tape.
def requestHistory (t : ℕ) (σ : Fin H → Y) : ℕ := …
- lemma
OAI.KServer.FiniteExperiment.requestHistory_eq_iffline 207 - lemma
OAI.KServer.FiniteExperiment.mass_productline 213 - lemma
OAI.KServer.FiniteExperiment.numerator_productline 228 - lemma
OAI.KServer.FiniteExperiment.posterior_tape_irrelevantline 246Source documentation
The precise independence statement legitimately used by the manuscript. It does not assert independence of partition events after conditioning on the tape, nor does it select reset events in a martingale estimate.
lemma posterior_tape_irrelevant (law : FiniteDistribution (Fin H → Y)) (tape : FiniteDistribution T) (t : ℕ) (ω : (Fin H → Y) × T) (ht : tape.val ω.2≠0) (f : (Fin H → Y) → ℝ) : posterior (weight law tape) (history t) (fun z => f z.1) ω= posterior law.val (requestHistory t) f ω.1 := by …Mentions: OAI.KServer.FiniteDistribution, OAI.KServer.FiniteExperiment.weight, OAI.KServer.FiniteExperiment.history, OAI.KServer.FiniteExperiment.requestHistory
- def
OAI.KServer.FiniteExperiment.metricCountline 255Source documentation
Counting measure of a labeled configuration; repetitions contribute separately.
def metricCount (c : Configuration k Y) (y : Y) : ℝ := by …
Mentions: OAI.KServer.Configuration
- lemma
OAI.KServer.FiniteExperiment.metricCount_nonnegline 260 - lemma
OAI.KServer.FiniteExperiment.metricCount_totalline 265 - lemma
OAI.KServer.FiniteExperiment.metricCount_atline 272 - def
OAI.KServer.FiniteExperiment.muline 281Source documentation
The true-metric posterior after t requests, independent of algorithmic tapes.
def mu (s : Configuration k Y) (law : FiniteDistribution (Fin H → Y)) (t : ℕ) (σ : Fin H → Y) (y : Y) : ℝ := …Mentions: OAI.KServer.Configuration, OAI.KServer.FiniteDistribution
- lemma
OAI.KServer.FiniteExperiment.mu_nonnegline 285 - lemma
OAI.KServer.FiniteExperiment.mu_totalline 289 - lemma
OAI.KServer.FiniteExperiment.request_of_historyline 296 - lemma
OAI.KServer.FiniteExperiment.mu_servedline 301 - lemma
OAI.KServer.FiniteExperiment.mu_adaptedline 312 - lemma
OAI.KServer.FiniteExperiment.metricCount_moveline 317 - def
OAI.KServer.FiniteExperiment.muBeforeline 333Source documentation
Old counting measure filtered through the new true request.
def muBefore (s : Configuration k Y) (law : FiniteDistribution (Fin H → Y)) (t : Fin H) (σ : Fin H → Y) (y : Y) : ℝ := …Mentions: OAI.KServer.Configuration, OAI.KServer.FiniteDistribution
- def
OAI.KServer.FiniteExperiment.nuline 338Source documentation
The conditional old-location law of the single designated optimum mover.
def nu (s : Configuration k Y) (law : FiniteDistribution (Fin H → Y)) (t : Fin H) (σ : Fin H → Y) (y : Y) : ℝ := by …Mentions: OAI.KServer.Configuration, OAI.KServer.FiniteDistribution
- lemma
OAI.KServer.FiniteExperiment.muBefore_nonnegline 344 - lemma
OAI.KServer.FiniteExperiment.nu_nonnegline 348 - lemma
OAI.KServer.FiniteExperiment.nu_totalline 354 - lemma
OAI.KServer.FiniteExperiment.nu_le_muBeforeline 363 - lemma
OAI.KServer.FiniteExperiment.muBefore_totalline 371 - lemma
OAI.KServer.FiniteExperiment.mu_moveline 378Source documentation
Exact one-mover decomposition used by the pilot potential.
lemma mu_move (s : Configuration k Y) (law : FiniteDistribution (Fin H → Y)) (t : Fin H) (σ : Fin H → Y) (hσ : 0<law.val σ) (y : Y) : mu s law (t.val+1) σ y=muBefore s law t σ y-nu s law t σ y+ (if σ t=y then 1 else 0) := by …Mentions: OAI.KServer.Configuration, OAI.KServer.FiniteDistribution, OAI.KServer.FiniteExperiment.mu, OAI.KServer.FiniteExperiment.muBefore, OAI.KServer.FiniteExperiment.nu
- lemma
OAI.KServer.FiniteExperiment.conditional_moveCostline 391 - lemma
OAI.KServer.FiniteExperiment.expected_moveCostline 410Source documentation
The entire physical-drift budget is the expectation of the attained optimum, not a separate assumed bound or a policy-dependent comparator.
lemma expected_moveCost (s : Configuration k Y) (law : FiniteDistribution (Fin H → Y)) : (∑ t : Fin H,∑ σ,law.val σ*(∑ y,nu s law t σ y*dist y (σ t)))= ∑ σ,law.val σ*optimalCost s (List.ofFn σ) := by …Mentions: OAI.KServer.Configuration, OAI.KServer.FiniteDistribution, OAI.KServer.FiniteExperiment.nu