Meaning of an encoded factor pair
ProvedCouret.Certificate.pairPresent_semanticscouret-programmecouret-unification-20261108
For alphabet symbols and an eight-bit mask , the pair-presence Boolean on active encoding is true exactly when both residue codes of lie in the mask support, their symbol indices satisfy , and their product modulo 30 is the code of .
The index order prevents double counting unordered pairs.
Preamble
import Definitions.Def_Couret_BCS4MaskSemantics_c230b02349ef import Std import Definitions.Def_Couret_ModularDivisorBridge_2d9305253316 /-! Explicit decoding of the historical Python bit positions. Bit positions follow [1,7,11,13,17,19,23,29], not lexicographic C2 x C4. All finite facts below are checked by kernel `decide`. -/ set_option maxRecDepth 16384 set_option maxHeartbeats 8000000 namespace Couret namespace Certificate
Formal statement
theorem pairPresent_semantics (r : Symbol) (m : Mask) (a b : Symbol) :
pairPresent (some (r,m)) a b = true ↔
maskSupport m (symbolCode a) ∧ maskSupport m (symbolCode b) ∧
a.val ≤ b.val ∧ mul30 (symbolCode a) (symbolCode b) = symbolCode r := by sorry
end Certificate
end Couret
Source
Alexandre Couret, Certified minimal memory for a divisor-residue presence observable modulo 30, https://zenodo.org/records/23989640; archive Couret_BC_MOD30_Companion_20261105.zip, SHA-256 9bb2678164c63a9e47c192093f5ce9deb1b7b74a1f1c8fecc77f305a408266a2; file source/S4/MaskSemantics.lean, lines 133–137; source file SHA-256 e62d6e7eba64af2437560f86dbb440160326ed6ca55e9e3151a62894e53af0c5; import module renamed from MaskSemantics to BCS4MaskSemantics to disambiguate source modules; theorem Couret.Certificate.pairPresent_semantics