ArticleslgStudy

mathematics

Matching distance

Matching distance is a mathematics topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Matching distance rather than just read about it. In short: In mathematics, the matching distance is a metric on the space of size functions. The core of the definition of matching distance is the observation that the information contained in a size function can be combinatorially stored in a formal series of lines and points of the plane, called respectively cornerlines and cornerpoints.

Matching distance — main illustration
Matching distance — illustration

Key takeaways

  • Matching distance belongs to mathematics; place it in that map before memorising details.
  • Learn the definition first, then one example that makes the definition concrete.
  • Connect Matching distance to a quantity you can measure, compute or draw — that is where exam questions come from.
  • Reproduce the core statement of Matching distance from memory before moving on to harder problems.

Reference excerpt

In mathematics, the matching distance is a metric on the space of size functions.

The core of the definition of matching distance is the observation that the information contained in a size function can be combinatorially stored in a formal series of lines and points of the plane, called respectively cornerlines and cornerpoints. Given two size functions ℓ 1 {\displaystyle \ell _{1}} and ℓ 2 {\displaystyle \ell _{2}} , let C 1 {\displaystyle C_{1}} (resp. C 2 {\displaystyle C_{2}} ) be the multiset of all cornerpoints and cornerlines for ℓ 1 {\displaystyle \ell _{1}} (resp. ℓ 2 {\displaystyle \ell _{2}} ) counted with their multiplicities, augmented by adding a countable infinity of points of the diagonal { ( x , y ) ∈ R 2 : x = y } {\displaystyle \{(x,y)\in \mathbb {R} ^{2}:x=y\}} . The matching distance between ℓ 1 {\displaystyle \ell _{1}} and ℓ 2 {\displaystyle \ell _{2}} is given by

d match ( ℓ 1 , ℓ 2 ) = min σ max p ∈ C 1 δ ( p , σ ( p ) ) {\displaystyle d_{\text{match}}(\ell _{1},\ell _{2})=\min _{\sigma }\max _{p\in C_{1}}\delta (p,\sigma (p))}

where σ {\displaystyle \sigma } varies among all the bijections between C 1 {\displaystyle C_{1}} and C 2 {\displaystyle C_{2}} and

δ ( ( x , y ) , ( x ′ , y ′ ) ) = min { max { | x − x ′ | , | y − y ′ | } , max { y − x 2 , y ′ − x ′ 2 } } . {\displaystyle \delta \left((x,y),(x',y')\right)=\min \left\{\max\{|x-x'|,|y-y'|\},\max \left\{{\frac {y-x}{2}},{\frac {y'-x'}{2}}\right\}\right\}.}

Roughly speaking, the matching distance d match {\displaystyle d_{\text{match}}}

between two size functions is the minimum, over all the matchings between the cornerpoints of the two size functions, of the maximum of the L ∞ {\displaystyle L_{\infty }} -distances between two matched cornerpoints. Since two size functions can have a different number of cornerpoints, these can be also matched to points of the diagonal Δ {\displaystyle \Delta } . Moreover, the definition of δ {\displaystyle \delta } implies that matching two points of the diagonal has no cost.

See also Size theory Size function Size functor Size homotopy group Natural pseudodistance

References

Worked examples

Example 1 — a first encounter with Matching distance

Start with the simplest possible case. Write down what Matching distance claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In mathematics, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Matching distance before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Matching distance ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Matching distance

In research
Matching distance appears in mathematics research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry
Engineering practice reuses Matching distance in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom
Matching distance is common in secondary-school and first-year university syllabi. It links to neighbouring topics Topology, so understanding it makes those chapters shorter.
In everyday life
Look for Matching distance outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Matching distance in 20 minutes

  1. Read the reference excerpt below once, without taking notes.
  2. Close the page and write down what Matching distance means in your own words.
  3. Compare your version with the excerpt and mark what you missed.
  4. Work through the three examples above with pen and paper.
  5. Explain Matching distance out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Matching distance in simple terms?

In mathematics, the matching distance is a metric on the space of size functions. The core of the definition of matching distance is the observation that the information contained in a size function can be combinatorially stored in a formal series of lines and points of the plane, called respective…

Why does Matching distance matter?

Because it connects several mathematics ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Matching distance?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Matching distance.

Tags

  • Topology

Keep exploring