WHY MATHEMATICS?
Why Mathematics? | Green–Tao Theorem: Arithmetic Progressions in the Primes, Transference and Pseudorandomness
A landmark theorem showing that primes contain arithmetic progressions of every finite length, even though the primes become sparser among the integers.
Why mathematics is important becomes clear when a research theorem can be rebuilt from definitions, tested on finite data and limited by its exact quantifiers. This guide follows the real mechanism, separates published evidence from original teaching calculations, and keeps each conclusion close to the equation that supports it.
Choose a reading route
- State the theorem without turning existence into a density claim
- See why ordinary Szemerédi cannot be applied directly to the primes
- Understand the W-trick, pseudorandom majorant and transference step
- Use finite prime progressions as examples rather than proofs of arbitrary length
Chapter map
- 1. Arithmetic progressions
- 2. Exact theorem statement
- 3. Why primes are sparse
- 4. Why Szemerédi is not direct
- 5. Relative density idea
- 6. The W-trick
- 7. Weighted prime indicator
- 8. Selberg-sieve majorant
- 9. Pseudorandom measures
- 10. Transference principle
- 11. Role of Gowers norms
- 12. Three major ingredients
- 13. What the theorem does not quantify
- 14. Finite computational search
- 15. Common misconceptions
- 16. Student learning route
- 17. Parent guidance and transfer
- 18. A responsible report
Read in order for a complete argument, or use the map to move between definitions, worked arithmetic, limitations, student practice and reporting. The same mathematical name can hide different normalisations, so every chapter states the local claim and the check that makes it trustworthy.
1. Arithmetic progressions
A k-term arithmetic progression has the form a,a+d,…,a+(k−1)d with d>0. This is the point where the idea becomes more than terminology: the objects, conditions and quantifiers can be named precisely.
How the mathematics works
The common difference makes the pattern additive rather than multiplicative. Write the defining equation before simplifying it, preserve exact quantities as long as practical and identify which step uses a theorem rather than arithmetic alone.
A concrete calculation or interpretation
The numbers 5,11,17,23,29 are five primes with d=6. Reconstruct the calculation independently, label every cutoff or norm and keep rounded values separate from exact expressions.
Limits, evidence and transfer
One example proves only one length and starting point. Verify every term and the constant differences. A careful conclusion reports the range, normalisation, comparison method and remaining uncertainty instead of turning one successful example into a universal promise.
2. Exact theorem statement
For every k≥1, there exist primes p_1<…<p_k in arithmetic progression. This is the point where the idea becomes more than terminology: the objects, conditions and quantifiers can be named precisely.
How the mathematics works
The quantifier allows the progression to depend on k. Write the defining equation before simplifying it, preserve exact quantities as long as practical and identify which step uses a theorem rather than arithmetic alone.
A concrete calculation or interpretation
No finite ceiling on progression length exists. Reconstruct the calculation independently, label every cutoff or norm and keep rounded values separate from exact expressions.
Limits, evidence and transfer
The theorem does not say that every interval contains such a progression. Keep existence separate from frequency. A careful conclusion reports the range, normalisation, comparison method and remaining uncertainty instead of turning one successful example into a universal promise.
3. Why primes are sparse
The prime number theorem says the number of primes up to N is asymptotic to N/log N. This is the point where the idea becomes more than terminology: the objects, conditions and quantifiers can be named precisely.
How the mathematics works
Thus their proportion among 1,…,N tends to zero. Write the defining equation before simplifying it, preserve exact quantities as long as practical and identify which step uses a theorem rather than arithmetic alone.
A concrete calculation or interpretation
A random integer near a large N has prime probability on the scale 1/log N. Reconstruct the calculation independently, label every cutoff or norm and keep rounded values separate from exact expressions.
Limits, evidence and transfer
This heuristic is not an independence statement. Distinguish asymptotic density from local probability language. A careful conclusion reports the range, normalisation, comparison method and remaining uncertainty instead of turning one successful example into a universal promise.
4. Why Szemerédi is not direct
Szemerédi’s theorem guarantees long progressions in subsets of positive upper density. This is the point where the idea becomes more than terminology: the objects, conditions and quantifiers can be named precisely.
How the mathematics works
The primes have zero density, so its hypothesis fails in the ambient integers. Write the defining equation before simplifying it, preserve exact quantities as long as practical and identify which step uses a theorem rather than arithmetic alone.
A concrete calculation or interpretation
A direct substitution of the prime set into the theorem proves nothing. Reconstruct the calculation independently, label every cutoff or norm and keep rounded values separate from exact expressions.
Limits, evidence and transfer
Sparsity is a logical obstruction, not a technical footnote. Check hypotheses before citing a theorem. A careful conclusion reports the range, normalisation, comparison method and remaining uncertainty instead of turning one successful example into a universal promise.
Did You Know? The five primes 5,11,17,23,29 form an arithmetic progression with common difference six. It is a clean example of the pattern, but the theorem must produce progressions of every requested finite length.
5. Relative density idea
Instead of comparing primes with all integers, compare a weighted prime set with a sparse majorising measure. This is the point where the idea becomes more than terminology: the objects, conditions and quantifiers can be named precisely.
How the mathematics works
Inside that reference measure, the primes can have positive relative density. Write the defining equation before simplifying it, preserve exact quantities as long as practical and identify which step uses a theorem rather than arithmetic alone.
A concrete calculation or interpretation
A transference theorem then mimics the dense setting if the measure is pseudorandom enough. Reconstruct the calculation independently, label every cutoff or norm and keep rounded values separate from exact expressions.
Limits, evidence and transfer
Relative density depends on the chosen measure and normalisation. Name the majorant explicitly. A careful conclusion reports the range, normalisation, comparison method and remaining uncertainty instead of turning one successful example into a universal promise.
6. The W-trick
Let W be the product of small primes and study numbers Wn+b with gcd(b,W)=1. This is the point where the idea becomes more than terminology: the objects, conditions and quantifiers can be named precisely.
How the mathematics works
This removes obvious local divisibility biases from small primes. Write the defining equation before simplifying it, preserve exact quantities as long as practical and identify which step uses a theorem rather than arithmetic alone.
A concrete calculation or interpretation
If W is divisible by 2, the admissible residue b must be odd. Reconstruct the calculation independently, label every cutoff or norm and keep rounded values separate from exact expressions.
Limits, evidence and transfer
Choosing W too quickly or without the source’s limit order breaks estimates. State how W grows. A careful conclusion reports the range, normalisation, comparison method and remaining uncertainty instead of turning one successful example into a universal promise.
7. Weighted prime indicator
A normalised von Mangoldt-type weight gives prime inputs the correct average scale after the W-trick. This is the point where the idea becomes more than terminology: the objects, conditions and quantifiers can be named precisely.
How the mathematics works
Weights convert a sparse set into an object with mean comparable to one on the selected progression. Write the defining equation before simplifying it, preserve exact quantities as long as practical and identify which step uses a theorem rather than arithmetic alone.
A concrete calculation or interpretation
The logarithmic weight compensates for prime sparsity. Reconstruct the calculation independently, label every cutoff or norm and keep rounded values separate from exact expressions.
Limits, evidence and transfer
Prime powers and endpoints require controlled treatment. State whether Λ or a truncated variant is used. A careful conclusion reports the range, normalisation, comparison method and remaining uncertainty instead of turning one successful example into a universal promise.
8. Selberg-sieve majorant
Green and Tao use a Goldston–Yıldırım construction based on truncated divisor sums to dominate the relevant prime weight. This is the point where the idea becomes more than terminology: the objects, conditions and quantifiers can be named precisely.
How the mathematics works
The majorant is chosen to be nonnegative and analytically tractable. Write the defining equation before simplifying it, preserve exact quantities as long as practical and identify which step uses a theorem rather than arithmetic alone.
A concrete calculation or interpretation
Quadratic divisor-sum weights create a measure concentrated around almost-prime behaviour. Reconstruct the calculation independently, label every cutoff or norm and keep rounded values separate from exact expressions.
Limits, evidence and transfer
A pointwise upper bound alone does not provide pseudorandomness. Check every correlation condition. A careful conclusion reports the range, normalisation, comparison method and remaining uncertainty instead of turning one successful example into a universal promise.
9. Pseudorandom measures
The proof requires linear-forms and correlation conditions showing that selected averages of the measure resemble those of the constant measure. This is the point where the idea becomes more than terminology: the objects, conditions and quantifiers can be named precisely.
How the mathematics works
These are deterministic estimates for specific systems of forms. Write the defining equation before simplifying it, preserve exact quantities as long as practical and identify which step uses a theorem rather than arithmetic alone.
A concrete calculation or interpretation
They let repeated Cauchy–Schwarz steps avoid unexpected concentration. Reconstruct the calculation independently, label every cutoff or norm and keep rounded values separate from exact expressions.
Limits, evidence and transfer
Passing a few numerical tests is not the full condition. List the forms and uniformity range. A careful conclusion reports the range, normalisation, comparison method and remaining uncertainty instead of turning one successful example into a universal promise.
Did You Know? Szemerédi’s theorem concerns subsets of the integers with positive density, while the primes have density zero. Green and Tao built a route that transfers a dense-set theorem into a carefully controlled sparse setting.
10. Transference principle
A dense-model or transference argument replaces a function bounded by the pseudorandom measure with a bounded dense surrogate for the relevant tests. This is the point where the idea becomes more than terminology: the objects, conditions and quantifiers can be named precisely.
How the mathematics works
Szemerédi-type machinery can then act on the surrogate. Write the defining equation before simplifying it, preserve exact quantities as long as practical and identify which step uses a theorem rather than arithmetic alone.
A concrete calculation or interpretation
The final progression is transferred back to the sparse prime setting. Reconstruct the calculation independently, label every cutoff or norm and keep rounded values separate from exact expressions.
Limits, evidence and transfer
Approximation must be strong in the norm governing progression counts. Name the test class. A careful conclusion reports the range, normalisation, comparison method and remaining uncertainty instead of turning one successful example into a universal promise.
11. Role of Gowers norms
Uniformity norms control multilinear averages that count arithmetic progressions. This is the point where the idea becomes more than terminology: the objects, conditions and quantifiers can be named precisely.
How the mathematics works
They quantify the pseudorandom component left after structured parts are separated. Write the defining equation before simplifying it, preserve exact quantities as long as practical and identify which step uses a theorem rather than arithmetic alone.
A concrete calculation or interpretation
A small appropriate norm limits the error in a k-term progression count. Reconstruct the calculation independently, label every cutoff or norm and keep rounded values separate from exact expressions.
Limits, evidence and transfer
The required order grows with pattern complexity. Do not use U² for every k. A careful conclusion reports the range, normalisation, comparison method and remaining uncertainty instead of turning one successful example into a universal promise.
12. Three major ingredients
The published abstract identifies Szemerédi’s theorem, a transference principle and the Goldston–Yıldırım pseudorandom majorant as the three major ingredients. This is the point where the idea becomes more than terminology: the objects, conditions and quantifiers can be named precisely.
How the mathematics works
Each solves a distinct problem: dense patterns, sparse transfer and analytic domination. Write the defining equation before simplifying it, preserve exact quantities as long as practical and identify which step uses a theorem rather than arithmetic alone.
A concrete calculation or interpretation
Removing any one leaves a gap between prime sparsity and dense combinatorics. Reconstruct the calculation independently, label every cutoff or norm and keep rounded values separate from exact expressions.
Limits, evidence and transfer
A summary does not replace the detailed verification. Map each lemma to its job. A careful conclusion reports the range, normalisation, comparison method and remaining uncertainty instead of turning one successful example into a universal promise.
13. What the theorem does not quantify
The theorem is existential and its original quantitative bounds are enormous. This is the point where the idea becomes more than terminology: the objects, conditions and quantifiers can be named precisely.
How the mathematics works
It does not efficiently locate the smallest progression for a requested length. Write the defining equation before simplifying it, preserve exact quantities as long as practical and identify which step uses a theorem rather than arithmetic alone.
A concrete calculation or interpretation
Computational searches and theoretical existence answer different questions. Reconstruct the calculation independently, label every cutoff or norm and keep rounded values separate from exact expressions.
Limits, evidence and transfer
A found record progression does not improve the proof automatically. Report algorithmic cost separately. A careful conclusion reports the range, normalisation, comparison method and remaining uncertainty instead of turning one successful example into a universal promise.
14. Finite computational search
To search up to X, sieve primes, group them by candidate common difference and test complete k-term chains. This is the point where the idea becomes more than terminology: the objects, conditions and quantifiers can be named precisely.
How the mathematics works
Modular restrictions can prune differences that force divisibility by small primes. Write the defining equation before simplifying it, preserve exact quantities as long as practical and identify which step uses a theorem rather than arithmetic alone.
A concrete calculation or interpretation
For k=5, the progression 5+6j for j=0,…,4 is an immediate benchmark. Reconstruct the calculation independently, label every cutoff or norm and keep rounded values separate from exact expressions.
Limits, evidence and transfer
Search completeness depends on the declared range and algorithm. Verify results against the prime list. A careful conclusion reports the range, normalisation, comparison method and remaining uncertainty instead of turning one successful example into a universal promise.
Did You Know? “Pseudorandom” in the proof is a list of verifiable correlation and linear-forms conditions for a majorising measure. It is not a claim that prime numbers are produced by chance.
15. Common misconceptions
Arbitrarily long means every finite length, not an infinite progression. This is the point where the idea becomes more than terminology: the objects, conditions and quantifiers can be named precisely.
How the mathematics works
Pseudorandom does not mean random, and positive relative density does not mean positive density in all integers. Write the defining equation before simplifying it, preserve exact quantities as long as practical and identify which step uses a theorem rather than arithmetic alone.
A concrete calculation or interpretation
The theorem concerns existence inside primes, not automatic abundance in short intervals. Reconstruct the calculation independently, label every cutoff or norm and keep rounded values separate from exact expressions.
Limits, evidence and transfer
Arithmetic progressions are additive patterns, not consecutive primes. Use the exact nouns. A careful conclusion reports the range, normalisation, comparison method and remaining uncertainty instead of turning one successful example into a universal promise.
16. Student learning route
Begin with arithmetic progressions, prime sieves and density. This is the point where the idea becomes more than terminology: the objects, conditions and quantifiers can be named precisely.
How the mathematics works
Next learn why positive-density theorems miss the primes, then study the W-trick and relative majorants conceptually. Write the defining equation before simplifying it, preserve exact quantities as long as practical and identify which step uses a theorem rather than arithmetic alone.
A concrete calculation or interpretation
Only after that approach Gowers norms and transference. Reconstruct the calculation independently, label every cutoff or norm and keep rounded values separate from exact expressions.
Limits, evidence and transfer
Starting from the final paper can hide the elementary logical gap. Explain sparsity in one equation. A careful conclusion reports the range, normalisation, comparison method and remaining uncertainty instead of turning one successful example into a universal promise.
17. Parent guidance and transfer
Ask which theorem hypothesis fails and what new structure repairs it. This is the point where the idea becomes more than terminology: the objects, conditions and quantifiers can be named precisely.
How the mathematics works
The topic builds systems thinking: combine a dense theorem, an analytic model and an approximation bridge. Write the defining equation before simplifying it, preserve exact quantities as long as practical and identify which step uses a theorem rather than arithmetic alone.
A concrete calculation or interpretation
These habits transfer to modelling, computing and scientific collaboration. Reconstruct the calculation independently, label every cutoff or norm and keep rounded values separate from exact expressions.
Limits, evidence and transfer
They do not guarantee a specific academic or career outcome. Reward a clear dependency map. A careful conclusion reports the range, normalisation, comparison method and remaining uncertainty instead of turning one successful example into a universal promise.
18. A responsible report
State k, the progression definition, density distinction and three proof ingredients. This is the point where the idea becomes more than terminology: the objects, conditions and quantifiers can be named precisely.
How the mathematics works
Label finite examples and computer searches separately from the theorem. Write the defining equation before simplifying it, preserve exact quantities as long as practical and identify which step uses a theorem rather than arithmetic alone.
A concrete calculation or interpretation
Use the original paper for transference and pseudorandomness claims. Reconstruct the calculation independently, label every cutoff or norm and keep rounded values separate from exact expressions.
Limits, evidence and transfer
Do not claim efficient bounds or infinite prime progressions. Finish with the exact existence result. A careful conclusion reports the range, normalisation, comparison method and remaining uncertainty instead of turning one successful example into a universal promise.
Research notebook: ten reproducible checks
Notebook check 1: Arithmetic progressions
Copy the exact definition, data and claim used in “Arithmetic progressions”. The common difference makes the pattern additive rather than multiplicative. Rebuild the finite step without copying its final number: The numbers 5,11,17,23,29 are five primes with d=6. Keep exact and rounded results in separate columns, then compare the observation with the theorem’s actual hypotheses. The principal caution is this: One example proves only one length and starting point. Change one cutoff, coefficient, interval, parameter or normalisation while keeping all other choices fixed. Verify every term and the constant differences. Record the changed value, benchmark difference and computational work. End with one sentence stating what the experiment supports and another stating what it does not prove. That limit is part of the mathematics because it protects finite evidence from becoming an unsupported asymptotic claim.
Notebook check 2: Exact theorem statement
Copy the exact definition, data and claim used in “Exact theorem statement”. The quantifier allows the progression to depend on k. Rebuild the finite step without copying its final number: No finite ceiling on progression length exists. Keep exact and rounded results in separate columns, then compare the observation with the theorem’s actual hypotheses. The principal caution is this: The theorem does not say that every interval contains such a progression. Change one cutoff, coefficient, interval, parameter or normalisation while keeping all other choices fixed. Keep existence separate from frequency. Record the changed value, benchmark difference and computational work. End with one sentence stating what the experiment supports and another stating what it does not prove. That limit is part of the mathematics because it protects finite evidence from becoming an unsupported asymptotic claim.
Notebook check 3: Why primes are sparse
Copy the exact definition, data and claim used in “Why primes are sparse”. Thus their proportion among 1,…,N tends to zero. Rebuild the finite step without copying its final number: A random integer near a large N has prime probability on the scale 1/log N. Keep exact and rounded results in separate columns, then compare the observation with the theorem’s actual hypotheses. The principal caution is this: This heuristic is not an independence statement. Change one cutoff, coefficient, interval, parameter or normalisation while keeping all other choices fixed. Distinguish asymptotic density from local probability language. Record the changed value, benchmark difference and computational work. End with one sentence stating what the experiment supports and another stating what it does not prove. That limit is part of the mathematics because it protects finite evidence from becoming an unsupported asymptotic claim.
Notebook check 4: Why Szemerédi is not direct
Copy the exact definition, data and claim used in “Why Szemerédi is not direct”. The primes have zero density, so its hypothesis fails in the ambient integers. Rebuild the finite step without copying its final number: A direct substitution of the prime set into the theorem proves nothing. Keep exact and rounded results in separate columns, then compare the observation with the theorem’s actual hypotheses. The principal caution is this: Sparsity is a logical obstruction, not a technical footnote. Change one cutoff, coefficient, interval, parameter or normalisation while keeping all other choices fixed. Check hypotheses before citing a theorem. Record the changed value, benchmark difference and computational work. End with one sentence stating what the experiment supports and another stating what it does not prove. That limit is part of the mathematics because it protects finite evidence from becoming an unsupported asymptotic claim.
Notebook check 5: Relative density idea
Copy the exact definition, data and claim used in “Relative density idea”. Inside that reference measure, the primes can have positive relative density. Rebuild the finite step without copying its final number: A transference theorem then mimics the dense setting if the measure is pseudorandom enough. Keep exact and rounded results in separate columns, then compare the observation with the theorem’s actual hypotheses. The principal caution is this: Relative density depends on the chosen measure and normalisation. Change one cutoff, coefficient, interval, parameter or normalisation while keeping all other choices fixed. Name the majorant explicitly. Record the changed value, benchmark difference and computational work. End with one sentence stating what the experiment supports and another stating what it does not prove. That limit is part of the mathematics because it protects finite evidence from becoming an unsupported asymptotic claim.
Notebook check 6: The W-trick
Copy the exact definition, data and claim used in “The W-trick”. This removes obvious local divisibility biases from small primes. Rebuild the finite step without copying its final number: If W is divisible by 2, the admissible residue b must be odd. Keep exact and rounded results in separate columns, then compare the observation with the theorem’s actual hypotheses. The principal caution is this: Choosing W too quickly or without the source’s limit order breaks estimates. Change one cutoff, coefficient, interval, parameter or normalisation while keeping all other choices fixed. State how W grows. Record the changed value, benchmark difference and computational work. End with one sentence stating what the experiment supports and another stating what it does not prove. That limit is part of the mathematics because it protects finite evidence from becoming an unsupported asymptotic claim.
Notebook check 7: Weighted prime indicator
Copy the exact definition, data and claim used in “Weighted prime indicator”. Weights convert a sparse set into an object with mean comparable to one on the selected progression. Rebuild the finite step without copying its final number: The logarithmic weight compensates for prime sparsity. Keep exact and rounded results in separate columns, then compare the observation with the theorem’s actual hypotheses. The principal caution is this: Prime powers and endpoints require controlled treatment. Change one cutoff, coefficient, interval, parameter or normalisation while keeping all other choices fixed. State whether Λ or a truncated variant is used. Record the changed value, benchmark difference and computational work. End with one sentence stating what the experiment supports and another stating what it does not prove. That limit is part of the mathematics because it protects finite evidence from becoming an unsupported asymptotic claim.
Notebook check 8: Selberg-sieve majorant
Copy the exact definition, data and claim used in “Selberg-sieve majorant”. The majorant is chosen to be nonnegative and analytically tractable. Rebuild the finite step without copying its final number: Quadratic divisor-sum weights create a measure concentrated around almost-prime behaviour. Keep exact and rounded results in separate columns, then compare the observation with the theorem’s actual hypotheses. The principal caution is this: A pointwise upper bound alone does not provide pseudorandomness. Change one cutoff, coefficient, interval, parameter or normalisation while keeping all other choices fixed. Check every correlation condition. Record the changed value, benchmark difference and computational work. End with one sentence stating what the experiment supports and another stating what it does not prove. That limit is part of the mathematics because it protects finite evidence from becoming an unsupported asymptotic claim.
Notebook check 9: Pseudorandom measures
Copy the exact definition, data and claim used in “Pseudorandom measures”. These are deterministic estimates for specific systems of forms. Rebuild the finite step without copying its final number: They let repeated Cauchy–Schwarz steps avoid unexpected concentration. Keep exact and rounded results in separate columns, then compare the observation with the theorem’s actual hypotheses. The principal caution is this: Passing a few numerical tests is not the full condition. Change one cutoff, coefficient, interval, parameter or normalisation while keeping all other choices fixed. List the forms and uniformity range. Record the changed value, benchmark difference and computational work. End with one sentence stating what the experiment supports and another stating what it does not prove. That limit is part of the mathematics because it protects finite evidence from becoming an unsupported asymptotic claim.
Notebook check 10: Transference principle
Copy the exact definition, data and claim used in “Transference principle”. Szemerédi-type machinery can then act on the surrogate. Rebuild the finite step without copying its final number: The final progression is transferred back to the sparse prime setting. Keep exact and rounded results in separate columns, then compare the observation with the theorem’s actual hypotheses. The principal caution is this: Approximation must be strong in the norm governing progression counts. Change one cutoff, coefficient, interval, parameter or normalisation while keeping all other choices fixed. Name the test class. Record the changed value, benchmark difference and computational work. End with one sentence stating what the experiment supports and another stating what it does not prove. That limit is part of the mathematics because it protects finite evidence from becoming an unsupported asymptotic claim.
A practical seven-day learning plan
- Day 1: Define every arithmetic function, variable and quantifier in plain language.
- Day 2: Build a small exact table by hand and check the defining identities.
- Day 3: Derive the central finite calculation before reading the asymptotic conclusion.
- Day 4: Reproduce the calculation in code and compare exact with rounded output.
- Day 5: Change one cutoff, interval, coefficient or model and explain the effect.
- Day 6: Compare the theorem with one related result that answers a different question.
- Day 7: Present one supported conclusion, one limitation and one next experiment.
This plan develops problem-solving skills because it moves repeatedly between definition, calculation, evidence and communication. A parent can ask to see the notebook rather than a polished graph, while a student learns that a theorem becomes useful only when its conditions and conclusion are kept together.
Frequently asked questions
What does the Green–Tao theorem say?
For every positive integer k, the prime numbers contain a k-term arithmetic progression.
Does it say the primes have positive density?
No. The primes have density zero in the integers, and overcoming that sparsity is a central difficulty.
What is transference?
It is a principle that lets a dense combinatorial theorem operate relative to a sufficiently pseudorandom sparse measure.
What is the W-trick?
It restricts attention to residue classes after removing biases caused by small prime divisors.
Does the theorem find the smallest progression of each length?
No. It proves existence; finding minimal examples is a different computational problem.
Is this SEC Mathematics?
No claim is made that the proof is an SEC syllabus requirement. Arithmetic progressions are elementary, while the proof uses advanced number theory and combinatorics.
Primary source and current Singapore context
Ben Green and Terence Tao, “The primes contain arbitrarily long arithmetic progressions,” Annals of Mathematics 167(2) (2008), 481–547.
Open the primary or authoritative source record
The source supports the theorem’s definition and research context. The finite calculations here are original teaching examples and are checked directly against their stated equations.
For current Singapore terminology, the official SEAB Secondary Education Certificate page states that the SEC begins with the 2027 graduating cohort and reports subjects at G1, G2 and G3 levels. This article does not claim that the named advanced theorem is an SEC syllabus requirement. It shows how school algebra, functions, statistics and complex numbers can connect to later mathematical sciences.
SEAB: Secondary Education Certificate
Useful next reading
Choose the next article by mechanism rather than by prestige. Compare what is averaged, which structure can obstruct cancellation, how the error is measured and whether the result is pointwise, typical, weighted or asymptotic. Those distinctions make advanced mathematics easier to transfer into new problems.