Download data/lean/OAI/MeasureTheory/DyadicAvoidance/CenterFirstDefault.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 4.37 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/MeasureTheory/DyadicAvoidance/CenterFirstDefault.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/MeasureTheory/DyadicAvoidance/CenterFirstDefault.lean
-
curl -L -o CenterFirstDefault.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/MeasureTheory/DyadicAvoidance/CenterFirstDefault.lean
4.37 kB
| import OAI.MeasureTheory.DyadicAvoidance.FiniteTableModel | |
| import OAI.MeasureTheory.DyadicAvoidance.FiniteTableFirstDefault | |
| import OAI.MeasureTheory.DyadicAvoidance.ConcreteLabelMeasures | |
| namespace OAI | |
| universe u_T | |
| noncomputable section | |
| open MeasureTheory ProbabilityTheory | |
| namespace Problem310.FiniteTableModel | |
| /-- Center-table coordinate in the bounded-address convention used by the | |
| first-default probability theorem. -/ | |
| def centerTableAddress {M d : β} (b : Node M d β Fin M β β) (x : β) | |
| (a : FirstDefault.BoundedAddress M d) : SelectorAddress b := | |
| selectorAddress b β¨a.1.1, a.2β© a.1.2 x | |
| lemma centerTableAddress_injective {M d : β} (b : Node M d β Fin M β β) (x : β) : | |
| Function.Injective (centerTableAddress b x) := by | |
| intro a c h | |
| have hp := congrArg Sigma.fst h | |
| apply Subtype.ext | |
| apply Prod.ext | |
| Β· exact congrArg (fun z : Node M d Γ Fin M => z.1.val) hp | |
| Β· exact congrArg (fun z : Node M d Γ Fin M => z.2) hp | |
| /-- Exact no-default probability for the canonical spatial selector tables, | |
| at every real center and every choice of deterministic grid resolutions. -/ | |
| theorem measure_center_no_default {M d : β} (b : Node M d β Fin M β β) | |
| (Ξ½ : Measure Bool) [IsProbabilityMeasure Ξ½] | |
| (hfair : β bit, Ξ½ {bit} = (2 : ENNReal)β»ΒΉ) (x : β) : | |
| (Measure.pi (fun _ : SelectorAddress b => Ξ½)) | |
| (β f : FirstDefault.Path M d, {Ο | β i : FirstDefault.Tests f, | |
| selectorValue b Ο (FirstDefault.address f i).1 (FirstDefault.address f i).2 x = | |
| FirstDefault.requiredBit f i}) = | |
| (1 - ((2 : ENNReal)β»ΒΉ) ^ M) ^ d := by | |
| have h := FirstDefault.measure_no_default_finite_table Ξ½ hfair | |
| (centerTableAddress b x) (centerTableAddress_injective b x) | |
| simpa only [centerTableAddress, FirstDefault.boundedAddress, | |
| selectorValue, dite_eq_left (FirstDefault.address_length_lt _ _)] using h | |
| /-- Adding the independent terminal tables does not change the center-path | |
| survival probability. This is the full outcome-space form used by repair. -/ | |
| theorem measure_center_no_default_prod {M d : β} | |
| {T : Type u_T} [MeasurableSpace T] (Ο : Measure T) [IsProbabilityMeasure Ο] | |
| (b : Node M d β Fin M β β) | |
| (Ξ½ : Measure Bool) [IsProbabilityMeasure Ξ½] | |
| (hfair : β bit, Ξ½ {bit} = (2 : ENNReal)β»ΒΉ) (x : β) : | |
| ((Measure.pi (fun _ : SelectorAddress b => Ξ½)).prod Ο) | |
| (β f : FirstDefault.Path M d, {Ο : SelectorTable b Γ T | | |
| β i : FirstDefault.Tests f, | |
| selectorValue b Ο.1 (FirstDefault.address f i).1 (FirstDefault.address f i).2 x = | |
| FirstDefault.requiredBit f i}) = | |
| (1 - ((2 : ENNReal)β»ΒΉ) ^ M) ^ d := by | |
| let E : Set (SelectorTable b) := β f : FirstDefault.Path M d, | |
| {Ο | β i : FirstDefault.Tests f, | |
| selectorValue b Ο (FirstDefault.address f i).1 (FirstDefault.address f i).2 x = | |
| FirstDefault.requiredBit f i} | |
| have hE : MeasurableSet E := (Set.to_countable E).measurableSet | |
| have heq : (β f : FirstDefault.Path M d, {Ο : SelectorTable b Γ T | | |
| β i : FirstDefault.Tests f, | |
| selectorValue b Ο.1 (FirstDefault.address f i).1 (FirstDefault.address f i).2 x = | |
| FirstDefault.requiredBit f i}) = Prod.fst β»ΒΉ' E := by | |
| ext Ο | |
| simp only [E, Set.mem_iUnion, Set.mem_ofPred_eq, Set.mem_preimage] | |
| rw [heq, measurePreserving_fst.measure_preimage hE.nullMeasurableSet] | |
| exact measure_center_no_default b Ξ½ hfair x | |
| /-- The survival estimate with all probability measures instantiated, including | |
| the Bernoulli terminal labels in the canonical complete outcome space. -/ | |
| theorem outcomeLaw_center_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) | |
| (β 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}) = | |
| (1 - ((2 : ENNReal)β»ΒΉ) ^ M) ^ d := by | |
| exact measure_center_no_default_prod | |
| (ConcreteLabels.terminalLaw (TerminalAddress bT) p hp0 hp1) | |
| bS ConcreteLabels.fairLaw ConcreteLabels.fairLaw_singleton x | |
| end Problem310.FiniteTableModel | |
| end | |
| end OAI | |