OAI/NumberTheory/TwoPoint/Bounds/PrimeSlotCode.lean
15 declarations, 0 contain sorry, 0 declared as axioms
A complete equality-pattern code for tuple and padding prime occurrences.
- structure
OAI.TwoPointCorrelations.PrimeSlotDataline 15Source documentation
Each occurrence records its step, whether it belongs to the padding, and its numerical prime. Unused slots are avoided by taking the actual total length.
structure PrimeSlotData (R N : ℕ) where …
- def
OAI.TwoPointCorrelations.PrimeSlotData.slotsline 25 - def
OAI.TwoPointCorrelations.PrimeSlotData.factorline 28 - def
OAI.TwoPointCorrelations.PrimeSlotData.wordline 31 - def
OAI.TwoPointCorrelations.PrimeSlotData.codeline 34 - lemma
OAI.TwoPointCorrelations.PrimeSlotData.code_class_eq_iffline 37 - lemma
OAI.TwoPointCorrelations.PrimeSlotData.code_class_primeline 41 - def
OAI.TwoPointCorrelations.CrudeWordCode.usedClassesline 51 - def
OAI.TwoPointCorrelations.CrudeWordCode.classAtline 53 - def
OAI.TwoPointCorrelations.CrudeWordCode.primeDataline 56 - def
OAI.TwoPointCorrelations.CrudeWordCode.numericalWordline 62 - lemma
OAI.TwoPointCorrelations.CrudeWordCode.primeData_encodeline 65 - lemma
OAI.TwoPointCorrelations.CrudeWordCode.numericalWord_encodeline 74 - lemma
OAI.TwoPointCorrelations.CrudeWordCode.numericalWord_lengthline 78 - lemma
OAI.TwoPointCorrelations.CrudeWordCode.numericalWord_getline 84Source documentation
Padding is reconstructed from the same prime classes as tuple factors, so repetitions across steps never introduce new independent numerical choices.
lemma numericalWord_get (c : CrudeWordCode R N R) (value : c.usedClasses → ℕ) (i : Fin R) : (c.numericalWord value)[i.val]'(by rw [numericalWord_length]; exact i.isLt) = ⟨c.1 i, ∏ j ∈ univ.filter (fun j => c.2.2.1 j = i ∧ c.2.2.2 j = false), value (c.classAt j), ∏ j ∈ univ.filter (fun j => c.2.2.1 j = i ∧ c.2.2.2 j = true), value (c.classAt j)⟩ := by …Mentions: OAI.TwoPointCorrelations.CrudeWordCode, OAI.TwoPointCorrelations.CrudeWordCode.numericalWord_length