Residue-compatible divisor pairs are factor pairs
ProvedCouret.Certificate.arithmeticPair_iff_factorPaircouret-programmecouret-unification-20261108
Let satisfy , and let index the unit residues . The following are equivalent:
This identifies the arithmetic pair predicate with genuine complementary factor residues.
Preamble
import Definitions.Def_Couret_CertificateProofs_3244eb90a0e1 import Std import Theorems.Thm_Couret_coprime30_of_dvd import Theorems.Thm_Couret_decode_encode30 import Theorems.Thm_Couret_mul30_residue import Theorems.Thm_Couret_residue30_injective import Definitions.Def_Couret_CertificateData_653c7a96c17c /-! Universal consequences of the finite certificate checks. -/ set_option maxRecDepth 16384 set_option maxHeartbeats 8000000 namespace Couret namespace Certificate
Formal statement
theorem arithmeticPair_iff_factorPair (n : Nat) (hc : Nat.gcd n 30 = 1) (a b : Symbol) :
arithmeticPair n a b ↔ factorPair n a b := 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/CertificateProofs.lean, lines 149–186; source file SHA-256 34105504de63d99f05e7d3427ba82853380bac1d8c053b618776cd7d98da83b2; theorem Couret.Certificate.arithmeticPair_iff_factorPair