OctoInformBeta

OpenAI preprint, September 2026 · Section 8. Contraction on ordered intervals

Lemma 8.1: The good small-prime probability satisfies 0<ρ≤10<\rho\le1

Distinct small primes admit good residue assignments.

Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its declaration both in Lean and in words.

The Setting

Assigning residues to permutation tuples imposes local square conditions on their successive differences. The admissibility question is whether the conditions at all the small primes can hold along the same cycle of twenty-four tuple vertices.

Let II be a finite index set and (pi)i∈I(p_i)_{i\in I} a family of small primes. The local quadratic modulus q(p)q(p) of a natural modulus pp and the combined small-prime modulus M0M_0 of this family are the integers defined by (1): q(p)={8,p=2,p,p≠2,M0=∏i∈Iq(pi).q(p)=\begin{cases}8,&p=2,\\p,&p\ne2,\end{cases} \qquad M_0=\prod_{i\in I}q(p_i).(1) Write R=ℤ/M0ℤR=\mathbb Z/M_0\mathbb Z. For i∈Ii\in I, the small-prime residue projection πi:R→ℤ/q(pi)ℤ\pi_i:R\to\mathbb Z/q(p_i)\mathbb Z is the canonical reduction homomorphism.✦

The strict local squares form the subset Qp*Q_p^\ast of ℤ/q(p)ℤ\mathbb Z/q(p)\mathbb Z defined by (2): Qp*={{1},p=2,{x∈ℤ/q(p)ℤ:x≠0 and x=y2 for some y∈ℤ/q(p)ℤ},p≠2.Q_p^\ast= \begin{cases} \{1\},&p=2,\\ \{x\in\mathbb Z/q(p)\mathbb Z:x\ne0\text{ and }x=y^2 \text{ for some }y\in\mathbb Z/q(p)\mathbb Z\},&p\ne2. \end{cases}(2)✦ The strict quadratic residue pairs for (pi)i∈I(p_i)_{i\in I} form the subset 𝒫⊆R2\mathcal P\subseteq R^2 in (3): 𝒫={(a,b)∈R2:πi(b−a)∈Qpi* for every i∈I}.\mathcal P=\{(a,b)\in R^2:\pi_i(b-a)\in Q_{p_i}^\ast \text{ for every }i\in I\}.(3)✦

For a block set BB and a nonnegative integer rr, a permutation word vv of height rr on BB is a function assigning to each block of BB a permutation of {0,…,r−1}\{0,\ldots,r-1\}.✦ The block cutoff is T=80T=80✦, the block set is B={0,…,2T}B=\{0,\ldots,2T\}, and the block count is 2T+1=1612T+1=161✦; the tuple vertex set VV consists of the permutation words with height h=24h=24 on BB.✦

The cyclic shift τ\tau is the permutation of {0,…,h−1}\{0,\ldots,h-1\} sending each position to the next and the last to zero.✦ For a nonnegative integer jj, the cyclic tuple vertex cj∈Vc_j\in V is the permutation word specified by (4): cj(b)=τj(b∈B).c_j(b)=\tau^j\qquad(b\in B).(4)✦ A good small-prime assignment s:V→Rs:V\to R is a function belonging to the set 𝒢\mathcal G defined by (5): 𝒢={s∈RV:(s(ck),s(ck+1))∈𝒫 for every integer 0≤k<24}.\mathcal G=\{s\in R^V:(s(c_k),s(c_{k+1}))\in\mathcal P \text{ for every integer }0\le k<24\}.(5)✦ Write ρ∈ℝ\rho\in\mathbb R for the probability that a uniformly chosen function from VV to RR belongs to 𝒢\mathcal G.✦

The Claim

Theorem 1. Let (pi)i∈I(p_i)_{i\in I} be a finite family of small primes. If the family is injective, then (6) and (7) hold: 𝒢≠⌀.\mathcal G\ne\varnothing.(6)✦ 0<ρ.0<\rho.(7)✦ For every such family, the upper bound is (8): ρ≤1.\rho\le1.(8)✦

In the paper, the result reads: the proportion ρ\rho of good small-residue assignments satisfies ρ≥M0−23>0\rho\ge M_0^{-23}>0.

What Is Checked

The statements concern residue assignments on the fixed permutation tuple set and finite small-prime families, with injectivity required for (6) and (7).

For any finite family (ni)i∈I(n_i)_{i\in I} of natural moduli, local modulus divisibility has the form (9): q(ni)∣∏j∈Iq(nj)(i∈I).q(n_i)\mid\prod_{j\in I}q(n_j)\qquad(i\in I).(9)✦