VIEW THIS AS

Auto mode follows the Route Engine until you choose a viewpoint.

YOU ARE HERE

ROUTE CHECK

CONNECTED TO

WHAT NEXT

Use the canonical route for this room, or HELP if you are unsure.

Why Mathematics? | Ruzsa Triangle Inequality: Difference Sets, Additive Distance and Injective Maps

WHY MATHEMATICS?

Why Mathematics? | Ruzsa Triangle Inequality: Difference Sets, Additive Distance and Injective Maps

A cardinality inequality that makes additive combinatorics feel geometric: one set can serve as the intermediate point in a triangle of difference-set sizes.

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

  • Define sumsets, difference sets and representation choices
  • Prove the inequality with an injective encoding
  • Normalise set sizes into Ruzsa distance
  • Use the tool without confusing cardinality with Euclidean geometry

1. Difference-set notation

For finite sets A,B in an abelian group, A−B={a−b:a∈A,b∈B}. This is the point where the idea becomes more than terminology: the objects, conditions and quantifiers can be named precisely.

How the mathematics works

Distinct pairs may create the same difference. 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 A={0,1,3}, A−A={−3,−2,−1,0,1,2,3}. Reconstruct the calculation independently, label every cutoff or norm and keep rounded values separate from exact expressions.

Limits, evidence and transfer

Ordered pair counts differ from set cardinality. List distinct outputs. A careful conclusion reports the range, normalisation, comparison method and remaining uncertainty instead of turning one successful example into a universal promise.


2. Statement of the inequality

For finite nonempty A,B,C, |B−C||A|≤|B−A||A−C|. 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 set A acts as an intermediate object between B and C. 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

Taking A=B=C gives |A−A||A|≤|A−A|², which is consistent. Reconstruct the calculation independently, label every cutoff or norm and keep rounded values separate from exact expressions.

Limits, evidence and transfer

Nonemptiness is needed for representation choices and normalisation. State the group operation. A careful conclusion reports the range, normalisation, comparison method and remaining uncertainty instead of turning one successful example into a universal promise.


3. Choose representations

For each x∈B−C choose one pair (b_x,c_x) with x=b_x−c_x. This is the point where the idea becomes more than terminology: the objects, conditions and quantifiers can be named precisely.

How the mathematics works

Only one representative pair is kept for each distinct x. 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 deterministic rule such as lexicographic order makes a finite computation reproducible. Reconstruct the calculation independently, label every cutoff or norm and keep rounded values separate from exact expressions.

Limits, evidence and transfer

Different choices give different maps but the same bound. Record the choice rule. A careful conclusion reports the range, normalisation, comparison method and remaining uncertainty instead of turning one successful example into a universal promise.


4. The injective map

Map (x,a)∈(B−C)×A to (b_x−a,a−c_x)∈(B−A)×(A−C). 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 two coordinates add to x. 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

From an image (u,v), recover x=u+v and then the chosen b_x,c_x, so a=b_x−u. Reconstruct the calculation independently, label every cutoff or norm and keep rounded values separate from exact expressions.

Limits, evidence and transfer

The recovery uses the fixed representation choice. Write the inverse reconstruction. 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 proof is an injection: for every difference b−c, choose one representation and combine it with a∈A. Recovering the inputs from the two recorded differences proves that nothing was counted twice.


5. Cardinality conclusion

An injection from a domain into a codomain gives the desired product inequality. This is the point where the idea becomes more than terminology: the objects, conditions and quantifiers can be named precisely.

How the mathematics works

No averaging or asymptotic limit is required. 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 domain size is |B−C||A| and the codomain size is |B−A||A−C|. Reconstruct the calculation independently, label every cutoff or norm and keep rounded values separate from exact expressions.

Limits, evidence and transfer

Surjectivity is unnecessary and usually false. Separate injection from bijection. A careful conclusion reports the range, normalisation, comparison method and remaining uncertainty instead of turning one successful example into a universal promise.


6. A small numerical check

Take A={0,1}, B={0,2}, C={0,3}. This is the point where the idea becomes more than terminology: the objects, conditions and quantifiers can be named precisely.

How the mathematics works

Then B−C={−3,−1,0,2}, B−A={−1,0,1,2}, and A−C={−3,−2,0,1}; both sides equal eight and sixteen respectively after multiplication. 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 inequality holds with 8≤16. Reconstruct the calculation independently, label every cutoff or norm and keep rounded values separate from exact expressions.

Limits, evidence and transfer

One example does not prove the theorem. Recompute all distinct differences. A careful conclusion reports the range, normalisation, comparison method and remaining uncertainty instead of turning one successful example into a universal promise.


7. Sum variants

Replacing sets by their negatives converts difference inequalities into sumset versions. This is the point where the idea becomes more than terminology: the objects, conditions and quantifiers can be named precisely.

How the mathematics works

In an abelian group, signs can be arranged to bound |B+C| with related sumsets. 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

Because |−A|=|A|, negation preserves cardinality. Reconstruct the calculation independently, label every cutoff or norm and keep rounded values separate from exact expressions.

Limits, evidence and transfer

Not every nonabelian rearrangement is valid. Track order in noncommutative groups. A careful conclusion reports the range, normalisation, comparison method and remaining uncertainty instead of turning one successful example into a universal promise.


8. Normalised distance

Define d(A,B)=log(|A−B|/sqrt(|A||B|)). 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 denominator removes scale and makes the expression symmetric. 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 B=A+x is a translate, then |A−B|=|A−A|, so distance behaviour reflects additive shape. Reconstruct the calculation independently, label every cutoff or norm and keep rounded values separate from exact expressions.

Limits, evidence and transfer

Zero distance can occur for distinct sets in quotient interpretations. Call it a pseudometric when appropriate. A careful conclusion reports the range, normalisation, comparison method and remaining uncertainty instead of turning one successful example into a universal promise.


9. Triangle inequality for distance

Taking logarithms of the cardinality inequality yields d(B,C)≤d(B,A)+d(A,C). This is the point where the idea becomes more than terminology: the objects, conditions and quantifiers can be named precisely.

How the mathematics works

Products become sums, which creates the geometric form. 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 intermediate size |A| cancels under the square-root normalisations. Reconstruct the calculation independently, label every cutoff or norm and keep rounded values separate from exact expressions.

Limits, evidence and transfer

Log bases rescale the distance but do not change the inequality. Use one base consistently. 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? Ruzsa distance is symmetric after normalisation even though the raw expression uses A−B. It is a pseudometric because distinct translates can have distance zero.


10. Small doubling consequences

If |A+A| is small, triangle variants control |A−A| and other combinations. 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 lets a proof move between sums and differences. 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 bound on one growth set can feed into covering and Freiman arguments. Reconstruct the calculation independently, label every cutoff or norm and keep rounded values separate from exact expressions.

Limits, evidence and transfer

Constants and powers accumulate. Write each substitution explicitly. A careful conclusion reports the range, normalisation, comparison method and remaining uncertainty instead of turning one successful example into a universal promise.


11. Relation to entropy

Cardinality inequalities have analogues involving entropy of sums of independent random variables. 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 analogy treats log set size as an information scale. 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

Some inequalities transfer exactly while others only suggest a probabilistic form. Reconstruct the calculation independently, label every cutoff or norm and keep rounded values separate from exact expressions.

Limits, evidence and transfer

Entropy statements need their own independence assumptions. Do not infer them automatically. A careful conclusion reports the range, normalisation, comparison method and remaining uncertainty instead of turning one successful example into a universal promise.


12. Nonabelian caution

In a general group, products and inverses must retain order. This is the point where the idea becomes more than terminology: the objects, conditions and quantifiers can be named precisely.

How the mathematics works

A version uses sets such as BA^{-1} and AC^{-1}. 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 recovery map must respect multiplication order. Reconstruct the calculation independently, label every cutoff or norm and keep rounded values separate from exact expressions.

Limits, evidence and transfer

Commuting notation can invalidate the proof. Write group products in full. A careful conclusion reports the range, normalisation, comparison method and remaining uncertainty instead of turning one successful example into a universal promise.


13. Computational experiment

Generate finite sets, compute all difference sets, and verify the inequality across many triples. This is the point where the idea becomes more than terminology: the objects, conditions and quantifiers can be named precisely.

How the mathematics works

Store chosen representatives to test the injection directly. 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

Hash maps make distinct differences and recovery checks efficient. Reconstruct the calculation independently, label every cutoff or norm and keep rounded values separate from exact expressions.

Limits, evidence and transfer

Random tests find bugs but do not replace proof. Save sets and representative tables. A careful conclusion reports the range, normalisation, comparison method and remaining uncertainty instead of turning one successful example into a universal promise.


14. Why the tool matters

The inequality turns one difficult set size into two more convenient comparison sizes. 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 is a routing lemma used repeatedly in additive-combinatorial proofs. 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

Choosing A strategically can connect an unknown B−C to known growth estimates. Reconstruct the calculation independently, label every cutoff or norm and keep rounded values separate from exact expressions.

Limits, evidence and transfer

A poor intermediate set gives a weak bound. Explain why A was chosen. 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? A cardinality inequality can behave like geometry without placing sets in physical space. The “triangle” compares information loss under addition and subtraction.


15. Common misconceptions

Ruzsa distance is not Euclidean distance between elements and need not distinguish translates. 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 inequality concerns distinct set elements, not representation multiplicities. 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

An injection proves an upper bound, not equality. Reconstruct the calculation independently, label every cutoff or norm and keep rounded values separate from exact expressions.

Limits, evidence and transfer

Difference-set notation depends on group order outside abelian settings. Keep all four distinctions. 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 explicit difference tables and injective maps. This is the point where the idea becomes more than terminology: the objects, conditions and quantifiers can be named precisely.

How the mathematics works

Then take logarithms to derive the pseudometric form. 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 theorem once inside a small-doubling argument. Reconstruct the calculation independently, label every cutoff or norm and keep rounded values separate from exact expressions.

Limits, evidence and transfer

Starting from abstract distance can hide the recovery proof. Explain the injection aloud. 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 how information can be encoded without collisions. 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 proof builds reversible reasoning, compression awareness and strategic comparison. 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 algorithms and data structures. Reconstruct the calculation independently, label every cutoff or norm and keep rounded values separate from exact expressions.

Limits, evidence and transfer

A mathematical pseudometric is not a real-world similarity guarantee. Reward an explicit recovery step. 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 group, sets, nonemptiness, sign convention and representation rule. This is the point where the idea becomes more than terminology: the objects, conditions and quantifiers can be named precisely.

How the mathematics works

Show the injection and inverse recovery before using logarithms. 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

Label pseudometric limitations and track constant losses. Reconstruct the calculation independently, label every cutoff or norm and keep rounded values separate from exact expressions.

Limits, evidence and transfer

Do not call examples proofs. Finish with the exact cardinality inequality. 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: Difference-set notation

Copy the exact definition, data and claim used in “Difference-set notation”. Distinct pairs may create the same difference. Rebuild the finite step without copying its final number: For A={0,1,3}, A−A={−3,−2,−1,0,1,2,3}. Keep exact and rounded results in separate columns, then compare the observation with the theorem’s actual hypotheses. The principal caution is this: Ordered pair counts differ from set cardinality. Change one cutoff, coefficient, interval, parameter or normalisation while keeping all other choices fixed. List distinct outputs. 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: Statement of the inequality

Copy the exact definition, data and claim used in “Statement of the inequality”. The set A acts as an intermediate object between B and C. Rebuild the finite step without copying its final number: Taking A=B=C gives |A−A||A|≤|A−A|², which is consistent. Keep exact and rounded results in separate columns, then compare the observation with the theorem’s actual hypotheses. The principal caution is this: Nonemptiness is needed for representation choices and normalisation. Change one cutoff, coefficient, interval, parameter or normalisation while keeping all other choices fixed. State the group operation. 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: Choose representations

Copy the exact definition, data and claim used in “Choose representations”. Only one representative pair is kept for each distinct x. Rebuild the finite step without copying its final number: A deterministic rule such as lexicographic order makes a finite computation reproducible. Keep exact and rounded results in separate columns, then compare the observation with the theorem’s actual hypotheses. The principal caution is this: Different choices give different maps but the same bound. Change one cutoff, coefficient, interval, parameter or normalisation while keeping all other choices fixed. Record the choice rule. 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: The injective map

Copy the exact definition, data and claim used in “The injective map”. The two coordinates add to x. Rebuild the finite step without copying its final number: From an image (u,v), recover x=u+v and then the chosen b_x,c_x, so a=b_x−u. Keep exact and rounded results in separate columns, then compare the observation with the theorem’s actual hypotheses. The principal caution is this: The recovery uses the fixed representation choice. Change one cutoff, coefficient, interval, parameter or normalisation while keeping all other choices fixed. Write the inverse reconstruction. 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: Cardinality conclusion

Copy the exact definition, data and claim used in “Cardinality conclusion”. No averaging or asymptotic limit is required. Rebuild the finite step without copying its final number: The domain size is |B−C||A| and the codomain size is |B−A||A−C|. Keep exact and rounded results in separate columns, then compare the observation with the theorem’s actual hypotheses. The principal caution is this: Surjectivity is unnecessary and usually false. Change one cutoff, coefficient, interval, parameter or normalisation while keeping all other choices fixed. Separate injection from bijection. 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: A small numerical check

Copy the exact definition, data and claim used in “A small numerical check”. Then B−C={−3,−1,0,2}, B−A={−1,0,1,2}, and A−C={−3,−2,0,1}; both sides equal eight and sixteen respectively after multiplication. Rebuild the finite step without copying its final number: The inequality holds with 8≤16. 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 does not prove the theorem. Change one cutoff, coefficient, interval, parameter or normalisation while keeping all other choices fixed. Recompute all distinct 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 7: Sum variants

Copy the exact definition, data and claim used in “Sum variants”. In an abelian group, signs can be arranged to bound |B+C| with related sumsets. Rebuild the finite step without copying its final number: Because |−A|=|A|, negation preserves cardinality. Keep exact and rounded results in separate columns, then compare the observation with the theorem’s actual hypotheses. The principal caution is this: Not every nonabelian rearrangement is valid. Change one cutoff, coefficient, interval, parameter or normalisation while keeping all other choices fixed. Track order in noncommutative groups. 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: Normalised distance

Copy the exact definition, data and claim used in “Normalised distance”. The denominator removes scale and makes the expression symmetric. Rebuild the finite step without copying its final number: If B=A+x is a translate, then |A−B|=|A−A|, so distance behaviour reflects additive shape. Keep exact and rounded results in separate columns, then compare the observation with the theorem’s actual hypotheses. The principal caution is this: Zero distance can occur for distinct sets in quotient interpretations. Change one cutoff, coefficient, interval, parameter or normalisation while keeping all other choices fixed. Call it a pseudometric when appropriate. 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: Triangle inequality for distance

Copy the exact definition, data and claim used in “Triangle inequality for distance”. Products become sums, which creates the geometric form. Rebuild the finite step without copying its final number: The intermediate size |A| cancels under the square-root normalisations. Keep exact and rounded results in separate columns, then compare the observation with the theorem’s actual hypotheses. The principal caution is this: Log bases rescale the distance but do not change the inequality. Change one cutoff, coefficient, interval, parameter or normalisation while keeping all other choices fixed. Use one base consistently. 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: Small doubling consequences

Copy the exact definition, data and claim used in “Small doubling consequences”. This lets a proof move between sums and differences. Rebuild the finite step without copying its final number: A bound on one growth set can feed into covering and Freiman arguments. Keep exact and rounded results in separate columns, then compare the observation with the theorem’s actual hypotheses. The principal caution is this: Constants and powers accumulate. Change one cutoff, coefficient, interval, parameter or normalisation while keeping all other choices fixed. Write each substitution 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.


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 is the Ruzsa triangle inequality?

For finite nonempty subsets A,B,C of an abelian group, |B−C||A|≤|B−A||A−C|.

Why is it called a triangle inequality?

After logarithmic normalisation it yields d(B,C)≤d(B,A)+d(A,C).

What is Ruzsa distance?

A common definition is d(A,B)=log(|A−B|/sqrt(|A||B|)).

Is it a true metric?

It is a pseudometric on finite nonempty sets because translates can have zero distance.

Does the proof require probability?

No. It uses a deterministic choice of representations and an injective map.

Is this SEC Mathematics?

No claim is made that it is. It extends sets, logarithms and inequalities into additive combinatorics.


Primary source and current Singapore context

Imre Z. Ruzsa, “Sums of finite sets,” Number Theory: New York Seminar 1991–1995, Springer (1996), 281–293.

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

NTU Mathematics course information

NUS Applied and Computational Mathematics research


Useful next reading

Balog–Szemerédi–Gowers theorem

Freiman’s theorem

Gowers uniformity norms

Number Theory Hub

Mathematics World

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.