OAI/Combinatorics/MatrixRemoval/SampledPath.lean
31 declarations, 0 contain sorry, 0 declared as axioms
Concrete common-leaf path positions.
The variable-position type is Fin (2*h+1) × Fin (2^h): even classes are
plus, odd classes are minus, and class 2*h is the shared leaf class.
- abbrev
OAI.Problem348.SampledPath.VariablePositionline 13 - def
OAI.Problem348.SampledPath.blockSizeline 15 - theorem
OAI.Problem348.SampledPath.blockSize_posline 17 - theorem
OAI.Problem348.SampledPath.blockSize_mul_nodesline 20 - def
OAI.Problem348.SampledPath.mixline 25Source documentation
Retain the sampled leaf's node but choose the within-node offset from
u.def mix (b z u : ℕ) : ℕ := z / b * b + u % b
- theorem
OAI.Problem348.SampledPath.mix_ltline 27 - theorem
OAI.Problem348.SampledPath.mix_divline 34 - theorem
OAI.Problem348.SampledPath.mix_modline 40 - def
OAI.Problem348.SampledPath.mixFinline 46 - theorem
OAI.Problem348.SampledPath.mixFin_nodeline 55 - theorem
OAI.Problem348.SampledPath.mixFin_rootline 59 - theorem
OAI.Problem348.SampledPath.mixFin_leafline 64 - def
OAI.Problem348.SampledPath.classAtline 70Source documentation
The plus and minus names coincide precisely at the leaf level.
def classAt (h i : ℕ) (hi : i ≤ h) (plus : Bool) : Fin (2 * h + 1) := …
- theorem
OAI.Problem348.SampledPath.classAt_depthline 76 - theorem
OAI.Problem348.SampledPath.classAt_leafline 85 - theorem
OAI.Problem348.SampledPath.classAt_internalline 89 - theorem
OAI.Problem348.SampledPath.classAt_leaf_iffline 93 - theorem
OAI.Problem348.SampledPath.classAt_signs_eq_iffline 103 - def
OAI.Problem348.SampledPath.sampleline 110 - def
OAI.Problem348.SampledPath.depthline 114 - def
OAI.Problem348.SampledPath.nodeline 116 - theorem
OAI.Problem348.SampledPath.sample_depthline 119 - theorem
OAI.Problem348.SampledPath.sample_nodeline 123 - theorem
OAI.Problem348.SampledPath.sample_node_ltline 130 - theorem
OAI.Problem348.SampledPath.sample_nodes_eqline 138Source documentation
The two axes may use different offset seeds and still follow one common path.
theorem sample_nodes_eq (h i : ℕ) (hi : i ≤ h) (s t : Bool) (z u v : Fin (2 ^ h)) : node (sample h i hi s z u) = node (sample h i hi t z v) := by …Mentions: OAI.Problem348.SampledPath.node, OAI.Problem348.SampledPath.sample
- theorem
OAI.Problem348.SampledPath.ancestor_parentline 143 - theorem
OAI.Problem348.SampledPath.sample_parentline 149 - theorem
OAI.Problem348.SampledPath.sample_shared_leafline 156 - theorem
OAI.Problem348.SampledPath.sample_leaf_offsetline 161 - theorem
OAI.Problem348.SampledPath.sample_root_offsetline 165 - theorem
OAI.Problem348.SampledPath.sample_root_nodeline 169