math / data /lean /OAI /MeasureTheory /DyadicAvoidance /RoutedFirstDefault.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
2.56 kB
import OAI.MeasureTheory.DyadicAvoidance.CenterFirstDefault
import OAI.MeasureTheory.DyadicAvoidance.FirstDefaultSelection
namespace OAI
noncomputable section
namespace Problem310.FiniteTableModel
/-- Exact no-default probability for the actual depth-`d` spatial router
under the finite selector/terminal outcome law. All randomness is instantiated. -/
theorem outcomeLaw_routed_no_default {M d : β„•}
(bS : Node M d β†’ Fin M β†’ β„•) (bT : Leaf M d β†’ β„•)
(p : ℝ) (hp0 : 0 ≀ p) (hp1 : p ≀ 1) (x : ℝ) :
(ConcreteLabels.outcomeLaw (SelectorAddress bS) (TerminalAddress bT) p hp0 hp1)
{Ο‰ : SelectorTable bS Γ— TerminalTable bT |
Fin.last M βˆ‰ RoutingPath.routeFrom
(fun P y => OrderedRouting.chooseChild (fun i => selectorValue bS Ο‰.1 P i y))
d [] x} = (1 - ((2 : ENNReal)⁻¹) ^ M) ^ d := by
have heq : {Ο‰ : SelectorTable bS Γ— TerminalTable bT |
Fin.last M βˆ‰ RoutingPath.routeFrom
(fun P y => OrderedRouting.chooseChild (fun i => selectorValue bS Ο‰.1 P i y))
d [] x} =
⋃ f : FirstDefault.Path M d, {Ο‰ : SelectorTable bS Γ— TerminalTable bT |
βˆ€ i : FirstDefault.Tests f,
selectorValue bS Ο‰.1 (FirstDefault.address f i).1 (FirstDefault.address f i).2 x =
FirstDefault.requiredBit f i} := by
ext Ο‰
exact FirstDefault.spatial_default_not_mem_iff
(fun Ο‰ P i y => selectorValue bS Ο‰.1 P i y) Ο‰ x
rw [heq]
exact outcomeLaw_center_no_default bS bT p hp0 hp1 x
/-- The same exact law stated with the step-by-step absence of a default.
This form pairs directly with first-default decomposition of the exposure atoms. -/
theorem outcomeLaw_no_default_steps {M d : β„•}
(bS : Node M d β†’ Fin M β†’ β„•) (bT : Leaf M d β†’ β„•)
(p : ℝ) (hp0 : 0 ≀ p) (hp1 : p ≀ 1) (x : ℝ) :
(ConcreteLabels.outcomeLaw (SelectorAddress bS) (TerminalAddress bT) p hp0 hp1)
{Ο‰ : SelectorTable bS Γ— TerminalTable bT |
βˆ€ k < d,
OrderedRouting.chooseChild (fun i => selectorValue bS Ο‰.1
(RoutingPath.routeFrom
(fun P y => OrderedRouting.chooseChild (fun i => selectorValue bS Ο‰.1 P i y))
k [] x) i x) β‰  Fin.last M} =
(1 - ((2 : ENNReal)⁻¹) ^ M) ^ d := by
convert outcomeLaw_routed_no_default bS bT p hp0 hp1 x using 1
congr 1
ext Ο‰
exact RoutingPath.noDefault_iff_not_mem
(fun P y => OrderedRouting.chooseChild (fun i => selectorValue bS Ο‰.1 P i y)) (Fin.last M) d x
end Problem310.FiniteTableModel
end
end OAI