OAI/NumberTheory/Ostmann/Tree/RationalQuartetCut.lean
15 declarations, 0 contain sorry, 0 declared as axioms
Cutting an actual rational tree at its bottom quartets
The option-valued state records ancestor validity. On a valid cut each state contains the original depth-two tree and its propagated current entries. No quartet replacement or independence hypothesis is used.
- def
OAI.Ostmann.treeLeafMapline 17 - def
OAI.Ostmann.treeLeafZipProductline 22 - theorem
OAI.Ostmann.treeLeafProduct_quartetBlocksline 27 - def
OAI.Ostmann.RationalTreeData.cutTwoline 38 - theorem
OAI.Ostmann.RationalTreeData.frequency_cutTwoline 44 - structure
OAI.Ostmann.RationalQuartetStateline 51 - def
OAI.Ostmann.rationalQuartetStatesline 58 - def
OAI.Ostmann.quartetCutValueline 72 - theorem
OAI.Ostmann.quartetCutValue_pairline 78 - def
OAI.Ostmann.rationalQuartetStateAmplitudeline 84 - theorem
OAI.Ostmann.rationalTreeAmplitude_cutline 90Source documentation
Holding all bottom-quartet products fixes the entire upper recursion.
theorem rationalTreeAmplitude_cut {p : ℕ} [Fact p.Prime] (g : ZMod p → ℂ) (D : (ZMod p)ˣ) (n : ℕ) {C : (ZMod p)ˣ} (T : RationalTreeData (ZMod p)ˣ (n + 2) C) (XL XR : (ZMod p)ˣ) (c : TreeLeafTuple Bool (n + 2)) (m : TreeLeafTuple (ZMod p)ˣ (n + 2)) : rationalTreeAmplitude g D T XL XR c m = quartetCutValue (rationalQuartetStateAmplitude g D) n (rationalQuartetStates n T XL XR c (treeLeafMap (treeLeafProduct 2) n (quartetBlockTupleEquiv (ZMod p)ˣ n m))) (quartetBlockTupleEquiv (ZMod p)ˣ n m) := by …Mentions: OAI.Ostmann.RationalTreeData, OAI.Ostmann.TreeLeafTuple, OAI.Ostmann.rationalTreeAmplitude, OAI.Ostmann.quartetCutValue, OAI.Ostmann.rationalQuartetStateAmplitude, OAI.Ostmann.rationalQuartetStates, OAI.Ostmann.treeLeafMap, OAI.Ostmann.treeLeafProduct, OAI.Ostmann.quartetBlockTupleEquiv
- def
OAI.Ostmann.treeLeafZipline 117 - def
OAI.Ostmann.rationalQuartetStateArgumentline 122 - theorem
OAI.Ostmann.rationalQuartetStates_profileline 128Source documentation
The weighted arguments exposed at the cut are exactly the leaves of the truncated rational tree, with the same invalid-ancestor zeros.
theorem rationalQuartetStates_profile {p : ℕ} [Fact p.Prime] (D : (ZMod p)ˣ) (n : ℕ) {C : (ZMod p)ˣ} (T : RationalTreeData (ZMod p)ˣ (n + 2) C) (XL XR : (ZMod p)ˣ) (c : TreeLeafTuple Bool (n + 2)) (P : TreeLeafTuple (ZMod p)ˣ n) (w : TreeLeafTuple (ZMod p → ℝ) n) : quartetCutValue (fun S (wp : (ZMod p → ℝ) × (ZMod p)ˣ) => wp.1 (rationalQuartetStateArgument D S wp.2)) n (rationalQuartetStates n T XL XR c P) (treeLeafZip n w P) = rationalProfileLeafValue D (T.cutTwo n) w XL XR P := by …Mentions: OAI.Ostmann.RationalTreeData, OAI.Ostmann.TreeLeafTuple, OAI.Ostmann.quartetCutValue, OAI.Ostmann.rationalQuartetStateArgument, OAI.Ostmann.rationalQuartetStates, OAI.Ostmann.treeLeafZip, OAI.Ostmann.rationalProfileLeafValue
- theorem
OAI.Ostmann.rationalQuartetStates_profile_mean_leline 151Source documentation
Horizontal density domination applies directly to the genuine cut states, even though their current entries depend on the product vector.
theorem rationalQuartetStates_profile_mean_le {p : ℕ} [Fact p.Prime] (D : (ZMod p)ˣ) (n : ℕ) {C : (ZMod p)ˣ} (T : RationalTreeData (ZMod p)ˣ (n + 2) C) (XL XR : (ZMod p)ˣ) (c : TreeLeafTuple Bool (n + 2)) (w : TreeLeafTuple (ZMod p → ℝ) n) (hw : treeWeightsNonneg n w) : (∑ P : TreeLeafTuple (ZMod p)ˣ n, quartetCutValue (fun S (wp : (ZMod p → ℝ) × (ZMod p)ˣ) => wp.1 (rationalQuartetStateArgument D S wp.2)) n (rationalQuartetStates n T XL XR c P) (treeLeafZip n w P)) / (Fintype.card (TreeLeafTuple (ZMod p)ˣ n) : ℝ) ≤ (2 : ℝ) ^ (2 ^ n - 1) * treeProfileMean n w := by …Mentions: OAI.Ostmann.RationalTreeData, OAI.Ostmann.TreeLeafTuple, OAI.Ostmann.treeWeightsNonneg, OAI.Ostmann.quartetCutValue, OAI.Ostmann.rationalQuartetStateArgument, OAI.Ostmann.rationalQuartetStates, OAI.Ostmann.treeLeafZip, OAI.Ostmann.treeProfileMean