WorksMathematics
A remark on the independence step in Shkredov's approach to Zaremba's conjecture
Abstract
The proof of Proposition 35 in Shkredov's preprint arXiv:2603.14116v2 applies a repulsion inequality (Corollary 34) to three denominators x, y, z, which must be C-independent for the vector C of formula (116) of that paper. We show that, in the situation of that proof, this independence cannot hold: the identity (75) of the paper, d(y,z)x + d(z,x)y + d(x,y)z = 0, is a nonzero integer relation whose coefficients lie in the box defined by C as soon as two of the three inequalities needed for the contradiction in that proof are satisfied. The same holds for the triple (x, y_0, z) to which Lemma 32 is applied. We also record that the deduction drawn from Proposition 35 in Section 5.2 does not address the second alternative of that proposition. These remarks concern the proofs only: they do not contradict the statements of the theorems of that paper, nor of arXiv:2605.02518v2, whose Section 4 follows the same framework. Nothing in this note has been checked by a professional mathematician or by any third party.
Setting
We use the notation of [1] (version 2). Let be large, , and . If an integer is the denominator of a convergent of a fraction, write for the corresponding numerator, and put
For all such one has the identity
[1 (75)].
By [1 Definition 24], elements of are -independent if with integers forces . A relation in is in particular such a congruence. The conclusion of [1 Lemma 32] is stated for equations in integers.
The step in question. In the proof of [1 Proposition 35] one has points of an interval , with , and the following integers:
, a convergent denominator of ;
and , distinct -critical denominators of and supplied by [1 Lemma 32], with ; the proof treats the case ;
, a convergent denominator of with , and the number defined by .
Thus . The bounds (121)–(122) of [1] are obtained through the numerators of these convergents and read
The vector is the one given by [1 (116)] with :
The second part of Corollary 34 of [1] is applied in (123) to and the point , with this ; its hypothesis includes the -independence of . It yields , and the proof obtains a contradiction by establishing
through its inequalities (124)–(127). With (2) one computes
so that the first two inequalities of (3) are equivalent to
The obstruction
Lemma 2.1. Let be integers and let be convergent denominators with numerators . Then
Proof. The terms in cancel, and what remains is .
Proposition 2.2. Let be convergent denominators with , let , and assume (2) and the first two inequalities of (3). Put
Then is a nonzero vector of integers with , and
In particular is not -independent, and Corollary 34 of [1] does not apply to it.
Proof. The relation is (1). If , then with both fractions in lowest terms, so , which is excluded; hence . By Lemma 2.1 and (2),
Comparing squares with (4):
the bound for is at most if and only if ;
the bounds for and are at most and respectively if and only if .
The first condition follows from the first inequality of (5). For the second, , so (5) gives
Proposition 2.2 uses nothing beyond the bounds (2) and two of the inequalities (3) that the proof of [1 Proposition 35] needs for its contradiction. Hence, whenever that contradiction is available, the hypothesis of Corollary 34 fails for .
Proposition 2.3. In the setting of Section 1, assume moreover , , , and . Then
is a nonzero vector of integers with and , , , for the same vector .
Proof. As before since , and the bound for is unchanged. By Lemma 2.1,
In each bound the first term is at most , respectively , if and only if , which follows from (5) and . The second term is at most , respectively , if and only if , and indeed . □
Remark 2.4. In [1] the hypotheses of Proposition 2.3 come from the statement of Lemma 32 (, and is -critical) and from the range of : the critical denominators of considered there are at most , and lies at most steps beyond them with partial quotients bounded by , so that for large . Thus the conclusion of Lemma 32, in the form in which it is used in the proof of Proposition 35, cannot hold in this range of parameters.
The remark following (77) in [1] anticipates small relations coming from (1) when are close, and the points are separated for this reason. Propositions 2.2 and 2.3 show that this separation does not suffice here: the coefficients of (1) are controlled by the residues modulo at the single point , and the inequalities that produce the contradiction are those that place the coefficients in the box.
The deduction drawn from Proposition 35
Proposition 35 of [1] concludes with an alternative: either does not satisfy the -Assumption, or some has a large partial quotient (at least ) at a denominator in . In §5.2, Proposition 35 is invoked to conclude that subintervals of the relevant length “cannot satisfy -Assumption”. This requires the second alternative to fail for every . The sentence preceding the deduction gives, for points of , an upper bound on the denominators ; it does not treat the partial quotients of the points of at denominators in . The text before Proposition 35 remarks that one should work with the smaller set ; we did not find this restriction carried out in the statement or proof of Proposition 35, nor an argument excluding the second alternative in §5.2. We record this as a point that we could not complete from the text, independently of Section 2.
Scope
Section 2 is a statement about the proof of [1 Proposition 35] as written in version 2: the triples to which Lemma 32 and Corollary 34 are applied there carry the relation (1) with coefficients in the box of . The results of [1] whose proofs pass through Proposition 35 (§5.2, and §5.4 which uses its conclusion) depend on a replacement for this step.
The introduction of [2] states that its §4 outlines Shkredov’s argument and that its expansion theorem is implemented in the framework of the proof of Theorem 8 of [1]. To that extent Theorem 1.2 of [2] depends on the same step. We have not examined [2] beyond this.
These remarks do not contradict the statements of the theorems of [1] or [2]. Results that do not use this step, such as the bound of [3], are not concerned.
(4) Status. Lemma 2.1 and Propositions 2.2 and 2.3 are proved above. Their application to [1] rests on our reading of formulas (70), (75), (116), (121)–(127), of Definition 24, Lemma 32 and Corollary 34 of that paper.
(5) No external check. Nothing in this note has been checked by a professional mathematician or by any third party: neither the proofs, nor the reading of [1], nor the ancillary script. The only checks are those carried out by the author with the AI model named below.
Ancillary file
anc/cramer_identity.py checks in exact integer arithmetic: Lemma 2.1 and identity (1) on convergents of random fractions (2993 configurations with ); and the inequalities , , of Proposition 2.2 on 5000 random parameter sets satisfying (5), together with those of Proposition 2.3 on the 4957 of these sets that satisfy . Its output is in anc/cramer_identity-output.log. These checks support the algebra; they are not part of the proofs.
Use of AI
This note was prepared with the assistance of an AI model (Claude, Anthropic), which carried out the reading of [1], the computations and the drafting under the author’s direction. The author takes responsibility for the content.
Independent researcher, France. ORCID 0009-0009-1526-1178
References
- [1]I. D. Shkredov, On some results of Korobov and Larcher and Zaremba’s conjecture, arXiv:2603.14116v2 (24 June 2026).arxiv.org/abs/2603.14116
- [2]X. Z. Zhang, Expansion in SL₂(Z/qZ) and Zaremba’s conjecture, arXiv:2605.02518v2 (8 May 2026).
- [3]N. G. Moschevitin, B. Murphy, I. D. Shkredov, On Korobov bound concerning Zaremba’s conjecture, arXiv:2212.14646.