| phenomenon | arithmetic progressions in the primes— “It is a well-known conjecture that there are arbitrarily long arithmetic progressions of prime numbers.” |
| claim-type | existence— “We prove that there are arbitrarily long arithmetic progressions of primes.” |
| method — evidence | — “Interestingly, the proof requires no Fourier analysis, additive combinatorics, or number theory; the argument is instead a blend of quantitative ergodic theory arguments with some combinatorial estimates related to Gowers uniformity and sparse hypergraph regularity.” |
| transfer | from ergodic theory / harmonic analysis (dynamical systems): adapting ergodic-theory and Szemeredi-style combinatorial methods, plus a transference principle, to prove the primes contain arbitrarily long arithmetic progressions— “our paper has at least as much in common with the ergodic-theoretic approach as it does with the harmonic analysis approach” | transfers[0] |
| mechanism | a transference principle: embed the primes inside a pseudorandom set of positive relative density, then transfer Szemeredi theorem (which holds for dense sets) to this sparse set to find long arithmetic progressions— “our argument can be described instead as a transference principle which allows us to deduce” | mechanisms[0] |
| mechanism | A TERM IS ADMITTED TO BE LESS ACCURATE THAN AN AVAILABLE ALTERNATIVE AND CHOSEN ANYWAY, FOR A REASON THAT HAS NOTHING TO DO WITH ACCURACY: THE TERM NORMALIZED PROBABILITY DENSITY MIGHT BE MORE ACCURATE HERE, BUT MEASURE HAS THE ADVANTAGE OF BREVITY. The more accurate name is named, the trade is stated, and the choice is made against accuracy in a footnote by the authors themselves— “The term normalized probability density might be more accurate here, but measure has the advantage of brevity.” | mechanisms[1] |
| mechanism | A TERM IS DECLARED TO BE USED LOOSELY, IN THE SENTENCE THAT INTRODUCES IT: WE WILL USE THE TERM GOWERS UNIFORM LOOSELY to describe a function which is small in some norm. The looseness is not discovered by a reader; it is announced, so every later use inherits the warning— “We will use the term Gowers uniform loosely to describe a function which is small in some U d norm.” | mechanisms[2] |
| mechanism | AND A SECOND TERM IS RESERVED FOR ONE CLASS OF OBJECT, WITH AN EXPLICIT WARNING AGAINST CONFLATING THE TWO: THIS SHOULD NOT BE CONFUSED WITH THE TERM PSEUDORANDOM, WHICH WILL BE RESERVED FOR MEASURES. Two neighbouring technical words, one used loosely and one reserved, and the boundary between them is stated rather than left to context— “This should not be confused with the term pseudorandom, which will be reserved for measures on ZN .” | mechanisms[3] |
| mechanism | A METHOD IS GIVEN A COINED NAME AND THEN DESCRIBED AS BASICALLY ONE RESTRICTION: we get around this using something WHICH WE REFER TO AS THE W -TRICK, which BASICALLY CONSISTS OF RESTRICTING THE PRIMES TO an arithmetic progression. The name is minted for a manoeuvre, and the word `basically` marks the description as a simplification of it— “We get around this using something which we refer to as the W -trick, which basically consists of restricting the primes to the arithmetic progression” | mechanisms[4] |
| mechanism | AND THE AUTHORS CALL THEIR OWN MANOEUVRE A TRICK AND THEN INSIST IT IS NOT ONE: ALTHOUGH THIS LOOKS LIKE A TRICK, IT IS ACTUALLY AN EXTREMELY IMPORTANT FEATURE of that part of our argument which concerns primes. The word they chose for it is the word they then have to argue against, which is what a name does when it is picked for how a step looks rather than for what it does— “Although this looks like a trick, it is actually an extremely important feature of that part of our argument which concerns primes.” | mechanisms[5] |
| mechanism | A SECTION IS INTRODUCED AS DOING NOTHING BUT FIXING WHAT A TERM MEANS: in this section WE SPECIFY EXACTLY WHAT WE MEAN BY A PSEUDORANDOM MEASURE. The definitional work is given a section of its own and announced as its whole content - and the same word, `pseudorandom`, is the one reserved elsewhere in the paper against confusion with `Gowers uniform`— “In this section we specify exactly what we mean by a pseudorandom measure on ZN . First, however, we set up some notation.” | mechanisms[6] |
| mechanism | A PROPERTY IS DEFINED BY NAMING A CONJUNCTION OF NUMBERED HYPOTHESES, SO THE TERM IS AN ABBREVIATION FOR A LIST: WE SAY THAT ν IS k-PSEUDORANDOM IF IT SATISFIES the linear forms condition **AND ALSO** the correlation condition. What the word denotes is exactly two earlier definitions holding at once, with parameters fixed - a term whose content is entirely inherited— “We say that ν is k-pseudorandom if it satisfies the (k·2k−1, 3k−4, k)-linear forms condition and also the 2k−1-correlation condition.” | mechanisms[7] |
| mechanism | A CROSS-FIELD ANALOGY IS DRAWN AND HEDGED TWICE IN ONE SENTENCE: VERY ROUGHLY SPEAKING, Gowers uniform functions are **ANALOGOUS TO** the notion of “weakly mixing” functions that appear in ergodic theory proofs, whereas Gowers anti-uniform functions are SOMEWHAT ANALOGOUS TO the notion of almost periodic functions. Two fields' vocabularies mapped onto each other, with the strength of the mapping qualified separately for each half— “Very roughly speaking, Gowers uniform functions are analogous to the notion of “weakly mixing” functions that appear in ergodic theory proofs of Szemer´edi’s theorem, whereas Gowers anti-uniform functions are somewhat analogous to the notion of “almost periodic” functions.” | mechanisms[8] |
| mechanism | A NEW METHOD IS PLACED INSIDE AN OLD TRADITION RATHER THAN AGAINST IT: the idea of using a majorant to study the primes is BY NO MEANS NEW - indeed IN SOME SENSE SIEVE THEORY IS PRECISELY THE STUDY OF SUCH OBJECTS. The novelty claim is withdrawn in the same breath as the method is introduced, and an existing field is named as having been doing it all along— “The idea of using a majorant to study the primes is by no means new — indeed in some sense sieve theory is precisely the study of such objects.” | mechanisms[9] |
| mechanism | A CONDITION IS RESTATED IN ANOTHER FIELD'S LANGUAGE, WITH THE BORROWED WORDS IN SCARE QUOTES: from a probabilistic point of view, the linear forms condition is ASSERTING A TYPE OF JOINT INDEPENDENCE between the “random variables”. The quotation marks concede that the objects are not random variables, and the translation is offered as a point of view rather than as an identity— “From a probabilistic point of view, the linear forms condition is asserting a type of joint independence between the “random variables”” | mechanisms[10] |
| mechanism | A HOPED-FOR THEORY IS NAMED IN SCARE QUOTES BEFORE IT EXISTS, AS A SUSPICION: particularly exciting is THE SUSPICION that the notion of a k-step nilsystem might be ANALOGOUS TO A KIND OF “higher order Fourier analysis” which **COULD BE USED** to deal with systems of linear equations that cannot be handled by conventional Fourier analysis. A name is coined for something that does not yet exist, and every hedge in the sentence marks that— “Particularly exciting is the suspicion that the notion of a k-step nilsystem, explored in many ergodictheoretical works (see e.g. [27], [28], [29], [44]), might be analogous to a kind of “higher order Fourier analysis” which could be used to deal with systems of linear equations that cannot be handled by conventional Fourier analysis” | mechanisms[11] |
| mechanism | A STRUCTURE IS DEFINED AS A CONJUNCTION OF TWO CHECKABLE PROPERTIES: then we say that Φ is a UNIFORM COVER of B by A if Φ is **SURJECTIVE** and all the fibers HAVE THE SAME CARDINALITY. The term abbreviates exactly those two tests, either of which a reader can apply without knowing what the term is for— “Then we say that Φ is a uniform cover of B by A if Φ is surjective and all the fibers {Φ−1(b) : b ∈ B} have the same cardinality” | mechanisms[12] |
| builds-on | Szemeredi theorem— “any subset of the integers of positive density contains progressions of arbitrary length” | claim_relations[0] |
| builds-on | ergodic theory (dynamics)— “our methods here have a more ergodic theory flavour” | claim_relations[1] |
| builds-on | Szemeredi's theorem [37], [38]— “Thus, in this paper, we must assume Szemer´edi’s theorem.” | claim_relations[2] |
| builds-on | Goldston and Yildirim [17]— “The third ingredient is a recent result of Goldston and Yıldırım, which we reproduce here.” | claim_relations[3] |
| extends | Green [21], the first author's k=3 case— “special case k = 3 of Theorem 1.2 was recently established by the first author [21] using methods of Fourier analysis.” | claim_relations[4] |
| extends | Gowers [19], the generalised von Neumann theorem for the constant measure— “Such a theorem, in the case ν = νconst, was proved by Gowers [19] as a first step in his proof of Szemer´edi’s theorem, using k−2 applications of the Cauchy-Schwarz inequality.” | claim_relations[5] |
| sense | density - TWO SENSES IN ONE ABSTRACT, AND THE PAPER'S CONTRIBUTION IS THE MOVE BETWEEN THEM: density relative to THE INTEGERS, which is what Szemerédi's theorem requires and the primes do not have, versus RELATIVE density inside a pseudorandom set of almost primes, which they do— “There are three major ingredients. The first is Szemer´edi’s theorem, which asserts that any subset of the integers of positive density contains progressions of arbitrary length. The second, which is the main new ingredient of this paper, is a certain transference principle. This allows us to deduce from Szemer´edi’s theorem that any subset… | senses[0] |
| sense | `k-pseudorandom` - A NAME THAT PROMISES RANDOMNESS AND DELIVERS A CONJUNCTION OF TWO TESTS. `We say that ν is k-pseudorandom if it satisfies the (k·2k−1, 3k−4, k)-linear forms condition and also the 2k−1-correlation condition.` Nothing in the definition is about randomness; the word is a promise about what the two conditions are FOR. The paper's own remark says the parameter values were chosen for convenience, so even the constants are not load-bearing - a reader who imports `pseudorandom` from another paper imports a different object.— “We say that ν is k-pseudorandom if it satisfies the (k·2k−1, 3k−4, k)-linear forms condition and also the 2k−1-correlation condition.” | senses[1] |
| sense | `uniform cover` - A DEFINITION ADOPTED FOR A PROOF STEP AND SAID SO OUTRIGHT. `To facilitate this we adopt the following definition ... Φ is a uniform cover of B by A if Φ is surjective and all the fibers ... have the same cardinality.` The term is local to this argument and the paper does not claim it for the field. A definition introduced to make an expectation swap legal is a different kind of object from one introduced to name a phenomenon, and both live in the same layer.— “Then we say that Φ is a uniform cover of B by A if Φ is surjective and all the fibers {Φ−1(b) : b ∈ B} have the same cardinality” | senses[2] |
| differs in | positive relative density —distinct-from→ positive density — WHAT THE DENSITY IS MEASURED AGAINST. Szemerédi's theorem is about 'any subset of THE INTEGERS of positive density'; the primes are not such a subset. The transference principle is about 'any subset of a sufficiently PSEUDORANDOM SET (or measure) of POSITIVE RELATIVE DENSITY'. Same word, two ambient sets, and the whole proof lives in the gap between them— “There are three major ingredients. The first is Szemer´edi’s theorem, which asserts that any subset of the integers of positive density contains progressions of arbitrary length. The second, which is the main new ingredient of this paper, is a certain transference principle. This allows us to deduce from Szemer´edi’s theorem that any subset…— “any subset of the integers of positive density contains progressions of arbitrary length” | concept_edges[0] |
| note | positive relative density —distinct-from→ positive density — CHANGING THE DENOMINATOR IS THE PROOF TECHNIQUE, NOT AN ARTEFACT OF ONE. The primes are too sparse for Szemerédi; so '…(a large fraction of) THE PRIMES INSIDE A PSEUDORANDOM SET…', and the transference principle carries the theorem across. The object is not changed and the theorem is not reproved - THE AMBIENT SET AGAINST WHICH DENSITY IS COUNTED IS CHANGED.— “There are three major ingredients. The first is Szemer´edi’s theorem, which asserts that any subset of the integers of positive density contains progressions of arbitrary length. The second, which is the main new ingredient of this paper, is a certain transference principle. This allows us to deduce from Szemer´edi’s theorem that any subset… | concept_edges[0] |
| weight | positive relative density —distinct-from→ positive density — 0.9— “There are three major ingredients. The first is Szemer´edi’s theorem, which asserts that any subset of the integers of positive density contains progressions of arbitrary length. The second, which is the main new ingredient of this paper, is a certain transference principle. This allows us to deduce from Szemer´edi’s theorem that any subset… | concept_edges[0] |
| audit | prime numbers —part-of→ almost primes — Audit 2026-09-28: DOUBTFUL - read against its full span and kept, but the primes lie 'inside' a pseudorandom set such as the almost primes; part-of is loose.— “The methods in this paper suggest a more general “transference principle”, in that if a type of pattern (such as an arithmetic progression) is forced to arise infinitely often within sets of positive density, then it should also be forced to arise infinitely often inside the prime numbers, or more generally inside any subset of a pseudorandom… | concept_edges[1] |
| note | prime numbers —part-of→ almost primes — The containment is the load-bearing step: 'one may place (a large fraction of) the primes inside…'. Note A LARGE FRACTION, not all - the edge holds for the fraction the argument needs, which is what makes the relative density positive.— “The methods in this paper suggest a more general “transference principle”, in that if a type of pattern (such as an arithmetic progression) is forced to arise infinitely often within sets of positive density, then it should also be forced to arise infinitely often inside the prime numbers, or more generally inside any subset of a pseudorandom… | concept_edges[1] |
| weight | prime numbers —part-of→ almost primes — 0.85— “The methods in this paper suggest a more general “transference principle”, in that if a type of pattern (such as an arithmetic progression) is forced to arise infinitely often within sets of positive density, then it should also be forced to arise infinitely often inside the prime numbers, or more generally inside any subset of a pseudorandom… | concept_edges[1] |
| evidence status note | mechanism — The span contains “Szemer´edi’s” - the acute accent detached from its vowel by the extractor. Quoted verbatim, because the quote must be the staged file's characters; the paper spells it Szemerédi.— “Very roughly speaking, Gowers uniform functions are analogous to the notion of “weakly mixing” functions that appear in ergodic theory proofs of Szemer´edi’s theorem, whereas Gowers anti-uniform functions are somewhat analogous to the notion of “almost periodic” functions.” | mechanisms[8] |
| evidence status note | mechanism — The span contains “ergodictheoretical” - the space between “ergodic” and “theoretical” lost by the extractor. Quoted verbatim for the same reason. The guards on this paper test for glyph codes, split capitals, running heads and mathematics, and NOT for a fused word, which has no detector (damage shape 8).— “Particularly exciting is the suspicion that the notion of a k-step nilsystem, explored in many ergodictheoretical works (see e.g. [27], [28], [29], [44]), might be analogous to a kind of “higher order Fourier analysis” which could be used to deal with systems of linear equations that cannot be handled by conventional Fourier analysis” | mechanisms[11] |
| replication | untested |
| no type for this | the (linear forms condition AND correlation condition) conjunction → k-pseudorandom — IS-A-DEFINING-CONDITION-OF / CONSTITUTES, AND THE VOCABULARY HAS NO TYPE FOR A DEFINIENS. 'We say that ν is…' The two conditions do not sit INSIDE k-pseudorandomness the way a part sits in a whole - they ARE it, jointly and by stipulation. I tried 'part-of' and the gate refused it for want of a containment cue ('within / part of / comprises / consists of / includes / belongs to'), correctly: 'if it satisfies A and also B' is a biconditional definition, not a mereology. 'operationalised-as' fails the same way - its cue list wants 'measured / defined as / quantified / computed as' and this paper writes 'Definition 3.3' and 'we say that'. This is the FOURTH distinct missing relation type met in one evening's tagging, after 'is-an-aspect-of' (bouchaud2008), 'a claim about a usage' (marill1956) and 'prerequisite-for' (botker2018, already live and mistyped). the project, 2026-08-26.— “We say that ν is k-pseudorandom if it satisfies the (k·2k−1, 3k−4, k)-linear forms condition and also the 2k−1-correlation condition.” | unhoused_relations[0] |
| limitation | The proof yields only a weak lower bound on the count of k-term progressions, far from the conjectured Hardy-Littlewood asymptotic.— “we do not come close to establishing this conjecture here, obtaining instead a lower bound (γ(k) + o(1))N 2/ logk N for some very small γ(k) > 0” | limitations[0] |
| limitation | The methods give no progress on the Hardy-Littlewood prime tuples conjecture, which is why a pseudorandom majorant is used instead of the von Mangoldt function itself.— “Unfortunately, verifying the linear forms condition and the correlation condition for the von Mangoldt function (or minor variants thereof) is strictly harder than proving that the primes contain long arithmetic progressions; indeed, this task is comparable in difficulty to the notorious Hardy-Littlewood prime tuples conjecture, for which our… | limitations[1] |
| limitation | The argument neither requires nor delivers progress on the prime tuple conjecture.— “However we emphasise that our argument does not give (or require) any progress on this very difficult prime tuple conjecture, as we allow K to be nonzero.” | limitations[2] |
| limitation | A restriction-type property used in the k=3 case does not follow from pseudorandomness, and its generalisation to higher k is unclear.— “Such a property does not seem to follow simply from the pseudorandomness of ν, and generalisation to U k−1, k > 3, seems very difficult (it is not even clear what the form of such a generalisation would be).” | limitations[3] |
| limitation | The paper marks the size of its own assumption in a bracket, with an exclamation mark: 'Thus, in this paper, we must assume Szemerédi's theorem. However with this one (rather large!) caveat our paper is self-contained.' The result is a conditional one - long progressions in the primes GIVEN Szemerédi - and the conditionality is carried by a parenthesis rather than by the statement of the theorem.— “In one sentence, our argument can be described instead as a transference principle which allows us to deduce Theorems 1.1 and 1.2 from Szemer´edi’s theorem, regardless of what bound we know for N0(δ, k); in fact we prove a more general statement in Theorem 3.5 below. Thus, in this paper, we must assume Szemer´edi’s theorem. However with this… | limitations[4] |