Download data/lean/OAI/MeasureTheory/DyadicAvoidance/RoutedAddressInjectivity.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 2.17 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/MeasureTheory/DyadicAvoidance/RoutedAddressInjectivity.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/MeasureTheory/DyadicAvoidance/RoutedAddressInjectivity.lean
-
curl -L -o RoutedAddressInjectivity.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/MeasureTheory/DyadicAvoidance/RoutedAddressInjectivity.lean
2.17 kB
| import OAI.MeasureTheory.DyadicAvoidance.AddressInjectivity | |
| import OAI.MeasureTheory.DyadicAvoidance.RoutingPath | |
| namespace OAI | |
| universe u_I u_A u_X u_K | |
| noncomputable section | |
| namespace Problem310.AddressInjectivity | |
| /-- The terminal-address bridge specialized to the canonical recursive router. | |
| This applies separately to every selector outcome, with no probabilistic | |
| independence assumption on the selected leaves. -/ | |
| theorem routedTerminalAddress_injective {I : Type u_I} {A : Type u_A} {X : Type u_X} {K : Type u_K} | |
| (choose : List A β X β A) (r : β) (U : List A) | |
| (child : I β A) (point : I β X) | |
| (base : A β β) (level : List A β β) (key : β β X β K) | |
| (hlevel : β i, base (child i) β€ | |
| level (RoutingPath.routeFrom choose r (U ++ [child i]) (point i))) | |
| (hrefine : β {b B : β} {x y : X}, b β€ B β | |
| key B x = key B y β key b x = key b y) | |
| (hseparate : β {i j : I}, child i = child j β i β j β | |
| key (base (child i)) (point i) β key (base (child i)) (point j)) : | |
| Function.Injective (fun i => | |
| (RoutingPath.routeFrom choose r (U ++ [child i]) (point i), | |
| key (level (RoutingPath.routeFrom choose r (U ++ [child i]) (point i))) | |
| (point i))) := by | |
| apply terminalAddress_injective U child point | |
| (fun i => RoutingPath.routeFrom choose r (U ++ [child i]) (point i)) | |
| base level key | |
| Β· intro i | |
| exact RoutingPath.prefix_routeFrom choose r (U ++ [child i]) (point i) | |
| Β· exact hlevel | |
| Β· exact hrefine | |
| Β· exact hseparate | |
| /-- In particular, routes starting in distinct child subtrees always end at | |
| distinct leaves, even at different spatial points. -/ | |
| theorem routed_leaves_ne_of_child_ne {A : Type u_A} {X : Type u_X} | |
| (choose : List A β X β A) (r s : β) (U : List A) | |
| {i j : A} (hij : i β j) (x y : X) : | |
| RoutingPath.routeFrom choose r (U ++ [i]) x β | |
| RoutingPath.routeFrom choose s (U ++ [j]) y := by | |
| intro h | |
| exact hij (child_eq_of_common_descendant | |
| (RoutingPath.prefix_routeFrom choose r (U ++ [i]) x) | |
| (h.symm βΈ RoutingPath.prefix_routeFrom choose s (U ++ [j]) y)) | |
| end Problem310.AddressInjectivity | |
| end | |
| end OAI | |