Minimal matchings of point processes

Suppose that red and blue points form independent homogeneous Poisson processes of equal intensity in Rd\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathbb {R}}}^d$$\end{document}. For a positive (respectively, negative) parameter γ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma $$\end{document} we consider red-blue matchings that locally minimize (respectively, maximize) the sum of γ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma $$\end{document}th powers of the edge lengths, subject to locally minimizing the number of unmatched points. The parameter can be viewed as a measure of fairness. The limit γ→-∞\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma \rightarrow -\infty $$\end{document} is equivalent to Gale-Shapley stable matching. We also consider limits as γ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma $$\end{document} approaches 0, 1-\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$1-$$\end{document}, 1+\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$1+$$\end{document} and ∞\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\infty $$\end{document}. We focus on dimension d=1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$d=1$$\end{document}. We prove that almost surely no such matching has unmatched points. (This question is open for higher d). For each γ<1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma <1$$\end{document} we establish that there is almost surely a unique such matching, and that it can be expressed as a finitary factor of the points. Moreover, its typical edge length has finite rth moment if and only if r<1/2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$r<1/2$$\end{document}. In contrast, for γ=1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma =1$$\end{document} there are uncountably many matchings, while for γ>1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma >1$$\end{document} there are countably many, but it is impossible to choose one in a translation-invariant way. We obtain existence results in higher dimensions (covering many but not all cases). We address analogous questions for one-colour matchings also.


Introduction
Let R and B be discrete subsets of a metric space.We call their elements red points and blue points respectively.We are primarily interested in random infinite sets, and in particular the case where R and B are independent homogeneous Poisson processes of equal intensity on R d .We will focus especially on dimension d = 1.
A 2-colour perfect matching of R and B is a set M of ordered pairs r, b , called edges, with r ∈ R and b ∈ B, such that each red or blue point belongs to exactly one edge.We wish to address matchings that minimize the distances between matched pairs.To make this precise, one must decide on the relative weighting of short versus long edges, and also make sense of minimization of infinitely many variables together.
We therefore introduce the following concept.Suppose R, B ⊆ R d and let γ ∈ (0, ∞) be a parameter.We say that a perfect matching M is γ-minimal if for every finite set of edges { r 1 , b 1 , . . ., r n , b n } ⊆ M we have where |•| denotes the Euclidean norm, and the minimum is over all permutations σ of 1, . . ., n.In other words, M locally minimizes the total cost given by the sum of γth powers of the edge lengths.
We also define γ-minimal matchings for negative γ ∈ (−∞, 0) in the same way, except that, since x → x γ is decreasing, we replace | • | γ with −| • | γ on both sides of (1) (which is equivalent to replacing "min" with "max").We also consider matchings given by replacing | • | γ with log | • | in (1).We call such matchings 0-minimal, because they can be interpreted via the limit γ → 0 (applied to finite sets of edges).One could choose to minimize other functions of distance, but it turns out that powers and logarithms are the only scale-invariant choices.(We spell out and prove this and other such claims in Section 2.) We can imagine each point as an agent that wants a partner as close as possible.The parameter γ can then be interpreted as a measure of fairness or altruism.For large γ, long edges are heavily penalized, so that costs tend to be shared evenly among many points.In contrast, for small γ, points that can match close by tend to do so selfishly, regardless of impact on others.
We will also consider ∞-minimal and (−∞)-minimal matchings, which arise as the limits γ → ±∞.Here, any finite set of edges is required to minimize the length of the longest or the shortest edge, respectively.Subject to a regularity condition on the point sets (satisfied almost surely by Poisson processes), a matching is (−∞)-minimal if and only if it is stable, which is defined to mean that there do not exist a red-blue pair that are both strictly closer to each other than their partners.Stable matching was introduced in the celebrated work of Gale and Shapley [11] and has been studied in the context of point processes in [16] and a number of subsequent articles.At the other extreme, we sometimes call ∞-minimal matchings altruistic.Under stable matching, a point exclusively pursues its self-interest, whereas in the altruistic case it promotes the needs of any less fortunate point.
The case γ = 1 in dimension d = 1 is special in that there are many ties: for any r, r ′ ∈ R and b, b ′ ∈ B with r < r ′ < b ′ < b, the costs |r − b| + |r ′ − b ′ | and |r − b ′ | + |r ′ − b| of the two possible matchings are equal.It is therefore natural to consider the limits γ ↑ 1 and γ ↓ 1, which amounts to insisting that such ties are always resolved in favour of the first or the second matching respectively.We call the resulting matchings (1−)-minimal and (1+)-minimal respectively.All (1−)-and (1+)-minimal matchings are also 1-minimal.Uniformly random red and blue points in equal numbers on a square, together with γ-minimal matchings for γ = ∞ (altruistic; top-left), 1 (top-right), and −∞ (stable; bottom).Of these, only the last is known to exist on the infinite plane.
See Figures 1 and 2 for pictures of minimal matchings of random points on bounded regions.A primary motivation is to understand when such pictures can be meaningfully extended to infinite space.
We will address the questions: when do γ-minimal matchings exist?When are they unique?When are they translation-invariant?When can they be constructed locally, and when is extra randomness needed to do so?How do the Figure 2. Uniformly random red and blue points in equal numbers on an interval, together with γ-minimal matchings for γ = 3, 2, 1, 0, −1, −2, −3 (top to bottom).The points are identical for each matching, and are shown as vertical lines.Edges are shown as upward or downward arcs depending on whether the red or blue point is on the left.typical edge lengths behave?These questions are natural under the interpretation of points as agents: given a societal choice about how much fairness is appropriate (i.e. a choice of γ), does an optimal solution exist?If so, are there multiple solutions (leading to potential conflict)?Are there solutions that treat all locations equally?Can a solution be obtained by local procedures, without recourse to a central authority?Such questions are of interest far more broadly, but matching provides a clean mathematical setting in which answers are already intricate and subtle.Our results indicate that fairness tends to lead to difficulties: larger γ means that the set of minimal matchings is less well-behaved.
Besides the 2-colour case introduced above, we consider 1-colour matching.A perfect 1-colour matching of R is a set M of unordered pairs in which each point of R appears exactly once.All the above definitions apply analogously to the 1-colour case.
We introduce one further complication.Unless stated otherwise we allow partial matchings, in which each point belongs to at most one edge.Points that belong to no edge are unmatched.A matching is perfect if it has no unmatched points.We extend the definition of γ-minimality to a partial matching M by declaring each unmatched point to have infinite cost (where infinities add to give strictly larger infinities in the manner of infinite ordinals).More precisely, we insist that for any finite set of edges together with any finite set of unmatched points, the restriction of M to the incident and unmatched points has as few unmatched points as possible, and then subject to that constraint, the total cost of the edges is minimized (as before).Our first main result is that in fact unmatched points never occur in dimension d = 1.
The conclusion of Theorem 1 is stronger and more subtle than it might at first appear.Indeed, for random R (and B) we call a random matching M on a joint probability space with R (respectively, and B) a matching scheme, and we say that it is invariant if the joint law of (R, M) (respectively (R, B, M)) is invariant under the action of every translation of R d .Standard arguments imply relatively easily that any invariant matching scheme is a.s.perfect, for any d.However, γ-minimal matchings need not be invariant (as we shall see).Proving Theorem 1 requires ruling out all the uncountably many possible nonperfect matchings simultaneously, for almost every choice of R and B. Note that we do not know whether the same conclusion holds in R d for d ≥ 2.
Our next goal is to classify the set of all γ-minimal matchings according to the value of γ.We start with the 2-colour case in dimension d = 1, where our picture is essentially complete.It turns out that there is a pronounced change in behavior at γ = 1.We also address matching schemes, and besides invariance we distinguish the following properties.We say that a matching scheme is a factor if it is invariant, and if M can be expressed as a deterministic function of R (respectively, of (R, B)).We say that an edge crosses a set S if the closed line segment joining its endpoints intersects S. We call a matching locally finite if every bounded set is crossed by only finitely many edges; otherwise it is locally infinite.Theorem 2 (2-colour classification).Let R and B be independent Poisson processes of intensity 1 on R, and fix γ.Almost surely, the set of all γ-minimal 2-colour matchings of R and B is as follows. (i The γ-minimal matchings form a countable family (M k ) k∈Z .Each M k is locally finite.There is no invariant γ-minimal matching scheme.(ii) Let γ = 1.There are uncountably many γ-minimal matchings.There are uncountably many factor γ-minimal matching schemes.(iii) Let γ = 1−.The γ-minimal matchings consist of a countable family (M k ) k∈Z of locally finite matchings together with two locally infinite matchings M ∞ and M −∞ .The only factor schemes are M ∞ and M −∞ , and the only invariant schemes are these two and mixtures of them.1).There is exactly one γ-minimal matching M. It is locally infinite and a factor.
We next compare the matchings for different γ.As suggested by Figure 2, for all γ > 1 the sets of matchings are identical, while for γ < 1 they are closely related.Given two matchings M and M ′ of the same set(s) of points, their union forms the edge-set of a multigraph.If each of its components is finite then we say that M and M ′ have finite differences.Theorem 3 (2-colour comparisons).Let R and B be independent Poisson processes of intensity 1 on R, and consider their 2-colour matchings.
(i) Almost surely, the set of γ-minimal matchings is identical to the set of γ ′ -minimal matchings for all γ, γ Almost surely, the γ-minimal matching and any γ ′ -minimal matching have finite differences.
We next turn to quantitative questions: how efficient are the matchings, and how locally can they be determined?The following standard concept allows us to consider typical points.For an invariant perfect 2-colour matching scheme M, let (R * , B * , M * ) be the Palm process of R, with (B, M) as background processes.This can be interpreted as (R, B, M) viewed from a typical red point, or conditioned to have a red point at 0. (See Section 2 or [19,Ch. 7] or [16] for details).We denote the associated Palm probability measure P * .Analogous definitions apply in the 1-colour case.The matching distance X of M is the random distance from the origin to its partner under the Palm measure, i.e.X := |M * (0)| where M * (0) is defined by 0, M * (0) ∈ M * .
Suppose that M is a factor matching scheme.We say that it is finitary if, under the Palm measure, the partner M * (0) of the origin can be determined by examining the restriction of the point processes (R * , B * ) (or R * in the 1-colour case) to a ball {x ∈ R d : |x| < L}, where the coding radius L is an almost surely finite random variable (itself a function of (R * , B * ), or R * respectively).When this holds it is immediate that X ≤ L almost surely.
Theorem 4 (2-colour tail bounds).Let R and B be independent Poisson processes of intensity 1 on R, and consider 2-colour matchings.Let γ ∈ [−∞, 1) and let M be the unique γ-minimal matching, or let γ = 1− and let M be one of the two γ-minimal factor matchings M ∞ , M −∞ .
Turning to the 1-colour case, there is again a sharp change in behavior at γ = 1, but some details are different.The γ > 1 regime features a matching scheme that is invariant but not a factor.In fact we can make a slightly stronger statement: assign i.i.d.labels, each uniform on [0, 1], to the points of R (conditional on R).We say that M is a factor of i.i.d.labels if M can be expressed as a deterministic function of R and the labels, where the function commutes with translations.
Almost surely there exist exactly two γ-minimal matchings, which we denote M + , M − .Both are locally finite.The set of matchings is identical for all such γ.The only invariant γ-minimal matching scheme is an equal mixture of M + , M − .It is not a factor, nor a factor of i.i.d.labels.1).There exists an invariant γ-minimal 1-colour matching scheme.
For 1-colour matchings in the γ < 1 regime we lack proofs of uniqueness and finite differences (although we expect that they hold), and we do not know whether there exist factor matching schemes.An exception is γ = −∞: stable matchings are almost surely unique and perfect (for all d and for 1 and 2 colours), and much more is known about them -see [16].Turning to matching distance, we establish the following bounds.
Theorem 6 (1-colour tail bounds).Let R be a Poisson processes of intensity 1 on R.
We have If it could be established that there were a unique γ-minimal 1-colour matching for γ ∈ (−∞, 1) (as in the 2-colour case, and the case γ = −∞) then it would automatically be a factor.By [16,Theorem 3(i)] it would follow that E * X = ∞, complementing the bound in Theorem 6(ii) and establishing a sharp change in tail behavior across γ = 1.
In higher dimensions the picture is much less complete.We establish existence of γ-minimal matchings, and even of invariant schemes, in many but not all cases.
Theorem 7 (Higher dimensions).Let R (and B) be (independent) Poisson process(es) of intensity 1 on R d and let γ ∈ [−∞, ∞].There exists an invariant perfect γ-minimal matching scheme in each of the following three cases: It is far from clear whether any γ-minimal matching exists in the remaining cases.The cases γ = 1 and γ = ∞ of 2-colour matching in R 2 seem particularly interesting.The former case was discussed in [14], where in particular it was shown that any such matching must be locally finite.

Related work.
Minimal matchings of finitely many random points on bounded regions have been studied extensively.Much of the focus has been on asymptotic behaviour of the total cost, which of course can be bounded without considering the structure of the minimal matching itself.See for example [1,4,10,13,21].We mention in particular the recent remarkably precise analysis of 2-minimal matchings in dimension 2 in [2,3].
Our focus on infinite point sets and the structure of the set of minimal matchings is, for the most part, new.An exception is stable matchings (or (−∞)minimal matchings in our terminology).Gale and Shapley [11] introduced stable matching of finite sets under general preference orders.Stable matching of infinite point processes was first considered in [17] and investigated further in [16].Various extensions and applications appear in [5-9, 12, 15].Note that perfectness, existence and uniqueness are straightforward to prove for the stable case [16].As we shall see, the subcritical regime γ < 1 shares certain features with the stable case.Some arguments from stable matching carry over relatively easily to the more general setting, but others apparently do not, providing a useful perspective on their limitations.
The closest approach to the questions considered here is the article [14] by one of the current authors, where 1-minimal matchings were considered in relation to the problem of non-crossing matchings in the plane.A notion of minimality is also considered for the related problem of allocations between the Poisson process and Lebesgue measure in [18].
Outline of the paper.Section 2 contains detailed definitions and elementary results; particularly useful are uniqueness of minimal matchings of finite point sets (Proposition 9) and classification of edge arrangements in dimension 1 (Figure 3).In Section 3 we prove perfectness, Theorem 1, via a somewhat surprising alternating path argument.Sections 4 and 5 analyse supercritical and critical matchings in dimension 1.The arguments are combinatorial in nature and involve precise characterizations of the matchings.A key tool is a random walk representation introduced in Section 5.In Section 6 we give two different limiting arguments for establishing existence of minimal matchings, proving Theorem 7 as well as parts of the earlier theorems.Moreover this section introduces quasistability, a key property of the subcritical regime.In Section 7 we use quasistability and random walk properties to establish uniqueness (Theorem 2(iv)) as well as finite differences (Theorem 3(ii)) and finitariness (Theorem 4) in the 2-colour subcritical regime.Section 8 proves a further structural property of this regime, and Section 9 proves the remaining tail bounds of Theorems 4 and 6.

Preliminaries
In this section we give full formal definitions and establish some basic facts, including the various side remarks made in the introduction.
2.1.Matchings.Let R be a set, whose elements we call points.A 1-colour matching M of R is a set of unordered pairs of points, called edges, such that each point belongs to at most one edge.Similarly, let R and B be two sets whose points we call red and blue respectively.A 2-colour matching of R and B is a set M ⊆ R × B of ordered pairs, called edges, such that each point belongs to at most one edge.We denote an edge e = x, y , where x, y are its endpoints.If a point x belongs to some edge of a matching M then we call x matched and write M(x) for its partner, i.e. the unique other point belonging to the edge.Otherwise we write M(x) = ∞ and call x unmatched.The set of unmatched points is M −1 (∞).A matching is perfect if it has no unmatched points.
2.2.Minimal matchings of finite sets.We are interested in matchings in R d that minimize a cost function of the edge lengths; we start with finite point sets.Let f : (0, ∞) → R be a non-decreasing function, and let | • | denote the Euclidean norm.Let R (resp.R and B) be (resp.disjoint) finite subset(s) of R d , and let M be a 1-colour matching of R (resp.a 2-colour matching of R and B).We write We sometimes call f a cost function, and f [M] the cost of the matching.
Let ≺ denote the lexicographic order on real sequences: where i is the smallest index for which a i = b i , while sequences of unequal length are compared by padding the shorter one with −∞ entries at the end.We say that M is f (•)-minimal if for every 1-colour (resp.2-colour) matching m of the same set(s) we have (So we first minimize unmatched points, and then cost).Note that for any f , an f (•)-minimal 1-colour matching has 0 or 1 unmatched points according to the parity of #R, while in the 2-colour case there are |#R − #B| unmatched points, all of the more numerous colour.We focus on power laws and logarithms.For γ ∈ R define We abbreviate f γ (•)-minimal to γ-minimal.When γ is clear from context we sometimes simply say minimal.
We will show later in this section that the function f = log arises as the limit γ → 0, justifying the notation f 0 .Similarly, the cases γ = ±∞, 1± defined next arise as the appropriate limits.
For a 1-or 2-colour matching M of finite set(s) we write |M| ↑ and |M| ↓ respectively for the increasing and decreasing orderings of the multiset of edge lengths (|x − y| : x, y ∈ M).We say that M is (−∞)-minimal if for any matching m of the same set(s) we have (where (x, (y 1 , y 2 , . ..)) is interpreted as (x, y 1 , y 2 . ..) for purposes of the order ).An ∞-minimal matching is defined in the same way but using the decreasing orderings | • | ↓ .
Consider the special case of dimension 1.Let e and e ′ be two edges of a matching in R, with all four endpoints pairwise distinct.We call them entwined if exactly one endpoint of e lies between the endpoints of e ′ (and hence vice versa).We say that e straddles e ′ if both endpoints of e ′ lie between the endpoints of e.If two edges neither entwine nor straddle then we call them separate.We call a matching M of finite set(s) (1+)-minimal if it is 1-minimal and no two edges straddle, and (1−)-minimal if it is 1-minimal and no two edges are entwined.Also, in a 2-colour matching, we say that an edge r, b ∈ R × B is oriented right if r < b and left if b < r.

2.3.
Infinite sets.Now we extend the definitions to infinite sets.Let M be a 1colour (resp.2-colour) matching of a countable set R (resp.sets R and B).Call a subset R ′ ⊆ R (resp.a pair of subsets R ′ ⊆ R and B ′ ⊆ B) compatible with M if all partners of points in R ′ (resp.R ′ ∪B ′ ) also belong to R ′ (resp.R ′ ∪B ′ ); in other words the subset(s) consist only of matched pairs and unmatched points.In that case we write M| R ′ (resp.M| R ′ ,B ′ ) for the restriction: the set of edges whose endpoints belong to R ′ (resp. Here is our key definition.For γ ∈ [−∞, ∞] ∪ {1−, 1+} we say that M is γ-minimal if for any finite compatible subset(s) R ′ ⊆ R (and B ′ ⊆ B), the restriction M| R ′ (resp.M| R ′ ,B ′ ) is a γ-minimal matching of R ′ (and B ′ ).Note that these definitions agree with the original ones when R (and B) are finite.Note moreover that the restriction of a γ-minimal matching to infinite compatible set(s) is γ-minimal.We observe also that the definitions for γ = 1± extend in the expected way: a matching of infinite sets is (1+)-minimal if and only if it is 1-minimal and no two edges straddle, and similarly for 1−.We could extend the concept of f (•)-minimality for a general function f to infinite sets in the same way.
We next note an alternative characterization of (−∞)-minimal matchings.Recall that if x is unmatched in M then we write M(x) = ∞.In that case we also write |x − M(x)| := ∞.We write ∨ and ∧ for maximum and minimum respectively.We say that a 1-or 2-colour matching M is stable if for any two points x, y (of opposite colours, in the 2-colour case) we have The interpretation is that no two points would both prefer to be matched to each other over their current situations.As remarked earlier, stable matchings have been studied extensively [11,16].
Lemma 8 (Stability).Let R (and B) be countable (disjoint) subset(s) of R d , and suppose that all distances between pairs of points (resp. of opposite colours) are distinct.A 1-colour (resp.2-colour) matching is (−∞)-minimal if and only if it is stable.
Proof.Suppose that M is not stable, so (3) fails.If x and y are both unmatched then we can match them to each other.If only y (without loss of generality) is unmatched then we could match x to y instead of M(x).If both points are matched then we could match x to y and M(x) to M(y).In each case, the modification shows that M is not minimal.Suppose that M is not minimal.Consider a finite compatible set of points on which its restriction m is not minimal, and let m ′ be a minimal matching of the same points.We can assume that every point either has different partners in m and m ′ or is unmatched in one but not the other (otherwise reduce the compatible set).Minimality implies that the shortest edge x, y of m ′ is no longer than any edge of m, so by the distinct distances assumption it is strictly shorter than every edge of m.But then x, y violate (3), so M is not stable.
2.4.Point processes.We are interested in matching random sets.Let R be a simple point process on R d , which is formally a locally finite random measure, where R(S) represents the number of points in S ⊆ R d .We take R to be its support, which is the random discrete set of its points: Let B be another simple point process, and let B = supp B. A 2-colour matching scheme of R and B is a simple point process M on (R d ) 2 such that a.s.M := supp M is a matching of R and B (where R, B, M are assumed to be defined on some shared probability space).Similarly, a 1-colour matching scheme of R is a simple point process M on the space of unordered pairs whose support is a 1-colour matching of R a.s.Usually we suppress explicit mention of the random measures, and simply call R and B point processes, and M a matching scheme.

s., one can show that F can be chosen to commute with translations if and only if
One can similarly consider invariance under isometries or other transformations, but we focus on translations.
We call a matching scheme γ-minimal if the matching is a.s.γ-minimal, and similarly for other properties, such as perfectness.We emphasize two distinct viewpoints.We can consider the random set of all possible minimal matchings, as a function of the random sets R and B. Or we can consider a minimal matching scheme, which means that for almost every choice of R and B we pick a minimal matching from that set (perhaps using additional randomness, if the scheme is not a factor).Matching schemes are mainly of interest when they are invariant.Note that if there is a.s. a unique γ-minimal matching then automatically there is an a.s.unique γ-minimal matching scheme (obtained by simply choosing the minimal matching as a function of the points).Moreover if R is invariant (resp.(R, B) is jointly invariant) then this scheme is invariant and a factor.(One can check that a matching scheme obtained in this way is indeed measurable in the appropriate sense by using [20,Lemma 1.6] to re-express point processes as sums of point measures at random locations, together with the 'selection theorem' [19,Theorem A.1.4].) We focus on 1-colour matchings of a homogeneous Poisson process R of intensity 1, or 2-colour matchings of independent Poisson processes R and B of intensity 1, on R d .
The following useful result says that minimal matchings are locally unique, with the exception of the case γ = 1 in dimension d = 1 where a weaker statement holds.A matching is finitely supported if only finitely many points are matched.
If (d, γ) = (1, 1) then almost surely there do not exist finitely supported matchings m and m ′ with distinct matched sets that satisfy (4).
Proof.It suffices to consider matchings whose matched points lie within a fixed bounded set, and by scaling and conditioning we can take it to be the unit cube [0, 1] d .Moreover, we can condition on the number of points in the cube, and consider two fixed matchings of them.Therefore, let x 1 , . . ., x n be points in [0, 1] d , where x i = (x i,1 , . . ., x i,d ).Consider two fixed matchings of the set {1, . . ., n} and let m and m ′ be the corresponding matchings of x 1 , . . ., x n .
] as a function of the positions of the points.It suffices to show that under the claimed conditions ∆ = 0 for a.e.choice of the variables (x i,j ) with respect to Lebesgue measure on [0, 1] dn .We will do this using Fubini's theorem, by showing that ∆ has a null set of zeros as a function of one variable, for almost all choices of the others.Firstly, suppose that the two matchings have distinct matched sets.Without loss of generality suppose that x 1 is matched in m but not in m ′ , and consider the dependence of ∆ on the first coordinate x 1,1 .We have where a, b, c are functions of the other variables (x i,j ) (i,j) =(1,1) .Clearly for every choice of a, b, c this has only finitely many zeros as a function of x 1,1 .
Secondly, suppose that the two matchings are distinct, and without loss of generality suppose that x 1 has different partners in m and m ′ .The dependence on x 1,1 is then of the form where a, b, a ′ , b ′ , c are functions of the other variables.This expression is piecewise real analytic so it either has only finitely many zeros or it has non-trivial intervals of constancy.Moreover, a = a ′ unless the partners of x 1 in the two matchings have the same first coordinate, which happens only on a null set with respect to the other variables.If a = a ′ then ∆ has intervals of constancy only if γ = 1 and b = b ′ = 0.But for d ≥ 2 the latter condition requires that two points have some coordinates equal, which again happens on a null set with respect to the other variables.
Note that Proposition 9 immediately implies the analogous conclusion for 2colour matchings of independent Poisson processes R and B, since any 2-colour matching is a 1-colour matching of the Poisson process R ∪ B.
Corollary 10 (Distinct distances).Almost surely, all distances between pairs of points of a Poisson process are distinct.
Proof.Apply Proposition 9 to matchings consisting of only one edge.
In particular, Corollary 10 shows that the assumption in Lemma 8 applies a.s. to Poisson processes.
For invariant minimal matching schemes, perfectness is easily established thanks to the following fact.

Lemma 11 (Unmatched points).
(i) Let M be any 1-colour invariant matching scheme of an invariant point process R on R d .Almost surely, M is either perfect or has infinitely many unmatched points.(ii) Let M be any invariant 2-colour matching scheme of jointly ergodic invariant point processes of equal intensity R and B on R d .Almost surely, either M is perfect or has unmatched points of both colours.
Proof of Lemma 11.In the 1-colour case (i), suppose for some positive finite k that there are exactly k unmatched points with positive probability.Conditional on this event, the process of unmatched points is still invariant and has exactly k points.Let p be the (conditional) probability that it has at least one point in the unit cube; then the expected number of points is 0 if p = 0 and ∞ if p > 0, giving a contradiction.
In the 2-colour case (ii), consider the ergodic decomposition of (R, B, M) with respect to the group of all translations of R d [19,Theorem 10.26].Since (R, B) is ergodic, in each ergodic component the processes of red and blue points have the same joint law as (R, B) (otherwise we would have a non-trivial ergodic decomposition of (R, B)), and the matching is an invariant matching scheme.Therefore we can assume without loss of generality that (R, B, M) is ergodic.If there are unmatched red points with positive probability then a.s.there are infinitely many, and they form an ergodic point process of positive intensity.The same applies to blue points.But by [16,Proposition 7] (a simple consequence of the mass transport principle), the processes of unmatched red and unmatched blue points have equal intensity.For 2-colour matchings in dimension 1, the following result from [14] will be useful.Note that for discrete sets R, B ∈ R (for instance, Poisson processes), each bounded interval contains only finitely many points.Therefore a matching is local infinite if and only if some x ∈ R is crossed by infinitely many edges, which in turn is equivalent to the condition that every x ∈ R is.
Proposition 13 (Local infiniteness).Let R and B be independent Poisson processes of intensity 1 on R. Any invariant perfect 2-colour matching scheme of R and B is a.s.locally infinite.
For an invariant 2-colour matching scheme M of R and B, the Palm process (R * , B * , M * ) may be characterized as follows.Let θ x denote the translation by x ∈ R d .Then for any non-negative measurable map h on the appropriate space, We give a more detailed definition of finitary factors.Let the matching scheme M be a factor of R and B. Under the Palm measure, there is a map H such that M * (0) = H(R * , B * ) a.s.Suppose that H can be chosen, together with another map L to [0, ∞], in such a way that for any deterministic sets r, b and any r ′ , b ′ that agree with them on the ball {x ∈ R s. then M is a finitary factor of (R, B) with coding radius L. Lemma 14.Let a, b, c > 0 and γ ∈ R, and let f = f γ be as in (2).We have Proof.The quantity f (t + c) − f (t) is strictly increasing in t > 0 if γ > 1 and strictly decreasing if γ < 1; take t = a + b and t = a.
Obviously if γ = 1 (so that f is the identity) then For all γ, since f γ is strictly increasing it is also obvious that Any two edges of a γ-minimal matching in R must be either entwined, straddling, or separate.In the 2-colour case, one of the three arrangements is disallowed, because we cannot match red-red and blue-blue.For γ ∈ (1, ∞), the ordering of the three costs is fixed: separate < entwined < straddling, while the second inequality becomes an equality for γ = 1.For γ ∈ (−∞, 1), entwined has the highest cost, with the relative costs of the other two arrangements depending on the distances.Consequently, for each choice of γ and the colour-ordering of the points (rbbr, rbrb, rrbb, and the analogous sequences obtained by reversing the colours) there are either one or two possibilities, which we summarize in Figure 3.Moreover, it is easy to identify the possibilities for γ = 1− and γ = 1+, and to check that the possibilities for γ = −∞ and γ = ∞ are identical to those for γ ∈ (−∞, 1) and γ ∈ (1, ∞) respectively.2.6.Limiting cases.Next we justify the naming of the cases γ = 0, ±∞, 1± by showing that they arise as appropriate limits of γ for minimal matchings of finite sets, subject to certain regularity conditions.These conditions vary slightly according to γ. (i) Fix γ ∈ R and suppose that there is a unique γ-minimal matching M.
Then for all µ ∈ R sufficiently close to γ, M is the unique µ-minimal matching.(ii) Suppose that all pairs of points (of opposite colours in the 2-colour case) have distinct distances.There is a unique ∞-minimal matching M, and for all µ sufficiently large, M is the unique µ-minimal matching.The same statements hold for (−∞)-minimal matching and µ sufficiently negative.(iii) Let d = 1 and suppose that there is a unique (1+)-minimal matching M.
Then for all µ > 1 sufficiently close to 1, M is the unique µ-minimal matching.The same applies to (1−)-minimal matchings and µ < 1.
To apply Proposition 15 we must verify its assumptions.Proposition 9 gives conditions for uniqueness of minimal matchings, while the following gives existence.In particular, for finite subsets of Poisson processes, Proposition 15(i) with γ = 0 combined with Proposition 9 and Lemma 16 justifies the notation 0minimal for f = log, and also shows there are no further limiting cases to be considered besides those under discussion here.Corollary 10 similarly provides the distinct distances condition for Proposition 15(ii).Verifying the assumptions of Proposition 15(iii) is a little more delicate.Lemma 16 gives existence of (1±)-minimal matchings.For uniqueness, Proposition 9 shows that the set of matched points is uniquely determined, so we can restrict attention to perfect matchings of that set.Uniqueness then follows from a more detailed analysis of the various cases, which can be found in the proofs of Theorem 2(i,iii) and Theorem 5(i) later in this article.Proposition 15 is not needed for these proofs, nor for any other results of the article.
The proofs of Proposition 15 and Lemma 16 both use the next simple fact.
Proof.Every g(•)-minimal matching M has the same number of unmatched points u and the same cost g[M] := c, say.Let δ > 0 be such that for every other matching m with u unmatched points, Let ℓ 1 , . . ., ℓ n be the distances between all pairs of points of R ∪ B (with multiplicities), and take η sufficiently small that This ensures that |g η [m] − g[m]| < δ/2 for every matching m.We deduce that for every g(•)-minimal matching M and non-g(•)-minimal matching m with u unmatched points we have g This implies that m cannot be g η (•)-minimal, as required.
Proof of Lemma 16.The cases γ ∈ [−∞, ∞] are trivial: there are only finitely many matchings, so at least one of them must be minimal.For d = 1 and γ = 1+, by the previous case, for every µ > 1 there exists a µ-minimal matching.By Lemma 17, for µ > 1 sufficiently close to 1, any such matching M is also 1-minimal.But by Lemma 14 (see also Figure 3), such an M has no straddling edges, so it is (1+)-minimal.An analogous argument applies for γ = 1−.
Proof of Proposition 15.For γ = 0 the result of (i) follows immediately from Lemma 17, since f µ → f γ as µ → γ and there is at least one µ-minimal matching.For γ = 0, note that applying an increasing affine transformation to a function f does not change the notion of f (•)-minimality, so for µ = 0 we can replace f µ with the function g µ (x) = (x µ −1)/µ, and observe that g µ (x) → log x as µ → 0.
Let ℓ 1 < • • • < ℓ n be the ordered distances between all pairs of points (of opposite colours in the 2-colour case).For the ∞-minimal case it suffices to take µ large enough that Finally, for (iii), suppose M is the unique (1+)-minimal matching.By Lemma 17, for µ > 1 sufficiently close to 1, every µ-minimal matching is 1minimal.But by Lemma 14 (see also Figure 3), any such matching has no straddling edges, so it must be M.The argument for 1− is analogous.2.7.Scale invariance.The functions f γ have a scale-invariance property: for any s > 0, the expression f γ (sx) can be written as an increasing affine function of f γ (x).But applying an increasing affine map to the cost function does not change the minimal matchings.Therefore, the set of γ-minimal 1-colour matchings of a scaled set sR is precisely the set of scaled matchings sM, for M a γ-minimal matching of R, and similarly for the 2-colour case.The next result shows that essentially no other functions have this property, justifying our focus on f γ .Again, this result is not needed for the proofs of the main theorems.
Proposition 18 (Scale invariance).Let f : (0, ∞) → R be continuously differentiable, non-decreasing and not constant.Suppose that for every finite set R ⊂ R and every s > 0, we have that M is an f (•)-minimal 1-colour matching of R if and only if sM is an f (•)-minimal 1-colour matching of sR.Then there exist a, b, γ ∈ R such that We break the proof into several lemmas.First, since f is not constant, note that f ′ (t) > 0 for some t > 0. Replacing f (x) by f (tx), we may assume (for notational convenience) that f ′ (1) > 0. In particular, this implies f (2 and, furthermore, Fix this δ for the remainder of the argument.
Lemma 19.Suppose that x, y, z, w ∈ [1, 1 + δ] and s > 0. Then Proof.Assume By symmetry, we may assume x ≥ y and z ≥ w.Consider the set of 5 points R = {r 1 , . . ., r 5 } with successive gaps, in order, x, w, y, z.Any minimal matching must have exactly one unmatched point.Consider first the matchings consisting only of nearest neighbours; there are three such matchings, with costs which contradicts (10).Hence, z ≥ y, which together with (10) shows that the matching M := { r 1 , r 2 , r 3 , r 4 } with cost f (x) + f (y) is minimal among these three.Furthermore, the cost of this matching is at most 2f (1 + δ), while every matching including a non-neighbour pair costs at least f (2) + f (1); hence (7) shows that M is a minimal matching.
By the scale-invariance assumption, sM is a minimal matching of sR.In particular, f (sx Proof. The assumption (8) implies that f : By continuity, it suffices to consider x, y Then Hence, Lemma 19 (twice) yields f (sx) + f (sy) = f (sz) + f (sw); in other words, Since ( 14) holds for every small ǫ ≥ 0, we may take the (right) derivative at ǫ = 0 and obtain, by the chain rule, recalling g(f (z)) = z and g(f which yields (11) by (12).

Perfectness
In this section we prove Theorem 1 which states that minimal matchings are perfect in dimension 1.The key step is Proposition 23 below, which holds in all dimensions.
Fix d and γ, and consider 1-colour (respectively, 2-colour) matchings of set(s) of points R (and B).We say that a point x is potentially unmatched if there exists a γ-minimal matching of R (and B) in which it is unmatched.
Proposition 23.Fix d ≥ 1 and γ ∈ (−∞, ∞], and let R (and B) be (independent) Poisson process(es) of intensity 1 on R d .Consider γ-minimal 1colour matchings of R (respectively, 2-colour matchings of R and B).Almost surely, if x and y are any two potentially unmatched points (respectively, of opposite colours) there exists an infinite sequence of distinct points x 0 , x 1 , x 2 , . . .∈ R(∪B) (respectively, of alternating colours), with x 0 = x, such that Proof.Let x and y be potentially unmatched, and let M and N be γ-minimal matchings in which each of them is unmatched, respectively.Since a 1-colour minimal matching can have at most one unmatched point, and a 2-colour minimal matching cannot have unmatched points of both colours, x is matched in N and y is matched in M. Let G be the multigraph with vertex set R(∪B) and whose edges are the edges of M and N.Each vertex has degree at most 2, and x and y each have degree 1.Let H be the component of G containing x, which must be a finite or infinite path starting from x, with edges alternately in N and M. In the 2-colour case, the colours of the points alternate also.
Suppose that H is finite.The vertex set V of H is compatible with both M and N, so the restrictions of M and N are γ-minimal matchings of V , with different matched sets.This contradicts Proposition 9 if γ < ∞, or Corollary 10 if γ = ∞.
So H is infinite.Let x = x 0 , x 1 , x 2 , . . .be its vertices in order along the path.First suppose γ < ∞.
For k ≥ 0, consider modifying N by switching matched and non-matched edges along the alternating sequence y, x 0 , x 1 , . . ., x 2k+1 , so that x 2k+1 becomes unmatched instead of y.Since N is γ-minimal, this modification cannot decrease cost, so we conclude Similarly, switching M along x 0 , x 1 , . . ., x 2k gives Adding the two inequalities and cancelling the repeated terms gives c 0 ≥ c 2k+1 .Doing the same but using the k+1 case of the second inequality gives c 0 ≥ c 2k+2 .Since f γ is nondecreasing we obtain the claimed bound for both odd and even indices.
The argument for γ = ∞ is similar.Let ℓ 0 = |x 0 − y| and ℓ i = |x i − x i−1 | for i ≥ 1.The same modifications as above yield for k ≥ 0. Therefore, for all j ≥ 0, and we conclude by induction on j that ℓ 0 ≥ ℓ j for all j.
Let γ ∈ (−∞, ∞].Suppose for a contradiction that there exist non-perfect γ-minimal matchings with positive probability.The set of all potentially unmatched points forms an ergodic invariant point process.Since it is not a.s.empty it has infinitely many points a.s.In 2-colour case, the same argument applies to each colour, so by colour symmetry a.s.there are potentially unmatched points of both colours.Therefore, by Proposition 23, there exists an infinite sequence of points x 0 , x 1 , . . . of R(∪B) with the distances |x i − x i+1 | bounded above (by a random but a.s.finite quantity).However, this is impossible for a Poisson process in R. (Indeed, a.s.for every positive integer n, every point lies between two intervals of length at least n that contain no points).

The supercritical case
In this section we analyse the γ-minimal matchings for γ > 1 (together with some of γ = 1, 1±, depending on the number of colours) in d = 1.These cases are relatively straightforward, and permit simple explicit descriptions of the matchings.We start with the 1-colour case.
First suppose that R has finite even cardinality, say R = {x 1 , . . ., x 2n } where x 1 < • • • < x 2n .By Lemma 16 there is a minimal matching, and it must be perfect.The only perfect matching with pairwise separate edges is m = x 1 , x 2 , x 3 , x 4 , . . ., x 2n−1 , x 2n , therefore this is the unique minimal matching.Now let R be a Poisson process.By Theorem 1 a.s.every minimal matching is perfect.Let • • • < x −1 < x 0 < x 1 < • • • be the points of R in order, indexed so that x −1 < 0 < x 0 say.There are exactly two perfect matchings with pairwise separate edges: We call these two the alternating matchings.(They may be defined for any discrete set {x i : i ∈ Z} ⊂ R unbounded in both directions).These are therefore the only possible candidates for minimal matchings.Both are indeed minimal, because any restriction to a finite compatible set gives a finite matching of the form of m above.
We turn to matching schemes.Any minimal matching scheme M must concentrate on the alternating matchings {M + , M − }.Such a scheme is characterised by the conditional probability and indeed φ can be chosen to be any measurable map from point configurations to [0, 1].It is easy to check that taking φ ≡ 1  2 gives an invariant matching scheme M.This scheme amounts to flipping a fair coin independently of R, and choosing M + or M − according to the outcome.Equivalently, if we write X t = 1[t is crossed by an edge] then (X t ) t∈R is the stationary continuous-time Markov chain with state space {0, 1} and transition rate 1 between the states in each direction.
The scheme just defined is not a factor, and no other choice of the function φ gives an invariant scheme.These unsurprising but slightly delicate facts are proved in [16, Lemma 11 and the following Remark].Briefly, the argument is as follows.First, no alternating factor matching exists.This is proved using local approximations of events and mixing properties of the Poisson process.Second, from any invariant scheme other than the one with φ ≡ 1 2 one could construct an alternating factor matching, a contradiction.Finally, the mixing argument from [16] extends immediately to show that no alternating matching can be expressed as a factor of i.i.d.labels.Now we turn to the 2-colour case.
Proof of Theorem 2(i) and Theorem 3(i).Let γ ∈ (1, ∞] ∪ {1+} and consider any 2-colour γ-minimal matching of sets R, B ⊂ R. By Lemma 14 and ( 5), ( 6), (see also Figure 3), two edges cannot straddle, and they can only be entwined if they have the same orientation.Hence, for any two red points r < r ′ and two blue points b < b ′ , the matching cannot contain both r, b ′ and r ′ , b : the matching respects order.
Suppose that R and B are of equal finite cardinality, say R = {r 1 , . . ., r n } and Minimal matchings exist by Lemma 16, and must be perfect.Hence, by the above remark, the unique minimal matching is Now let R and B be independent Poisson processes of intensity 1.By Theorem 1, a.s.every minimal matching is perfect.Let the red points be By the remark in the first paragraph, the matching must respect the orderings.That is, any minimal matching is of the form for some k ∈ Z.Moreover, each M k is indeed minimal, because any restriction to a finite compatible set gives a finite matching of the form of m above.
The number of edges of M k that cross 0 is exactly |k|.Hence the number of edges that cross a bounded interval containing 0 is at most |k| plus the number of points in the interval, which is finite.Hence M k is locally finite.
Any invariant minimal matching scheme would therefore be locally finite, and this contradicts Proposition 13, so there is no such scheme.

Levels and critical cases
Next we address γ ∈ {1−, 1} in the 2-colour case.We start by introducing a simple tool that will be important for γ < 1 as well.
Given disjoint discrete sets R, B ⊂ R we define the associated walk W = W R,B : R → Z by The walk takes a step up at a red point and down at a blue point.The choice of starting point W (0−) = 0 will be convenient for later technical steps involving the Palm process.For the current discussions we can (optionally) assume that there is no point at 0 so that W (0) = 0.If R and B are independent Poisson processes of intensity 1 then W is a continuous-time simple symmetric random walk.More precisely, the jump times of W form a Poisson process of intensity 2, and W considered at these times is a symmetric simple random walk; thus W is a particular case of a compound Poisson process.For k ∈ Z, define level k to be the set Λ k = Λ k (R, B) of points where the walk moves between k and k + 1: Note that the levels (Λ k ) k∈Z form a partition of R ∪ B, and that the elements of a level alternate in colour.
Remark 24.Walks and levels will be most useful for γ ≤ 1, but they also provide a convenient description of the matchings (M k ) k∈Z d introduced in Section 4 in the context of γ > 1.In the matching M k , some elements of R are not crossed by any edge: these form precisely the interior of the set {x : W (x) = k}.
The closure of {x : W (x) > k} is a disjoint union of bounded intervals (corresponding to excursions of W above k) containing the points of j≥k Λ j .Each such interval contains equal numbers of red and blue points.Within each such interval, the ith red point in the interval is matched to the ith blue point, via a right oriented edge.Similarly, each interval of the closure of {x : W (x) < k} contains points in j<k Λ j , with the ith red point to the ith blue point via a left oriented edge.
Now we focus on matchings with no entwined edges, as holds for γ-minimal matchings with γ < 1 and γ = 1−.Lemma 25 (Levels).Let R, B ⊂ R be disjoint discrete sets, and define levels as above.Let M be any perfect 2-colour matching of R and B in which no two edges are entwined.Any point and its partner belong to the same level.Proof of Theorem 2(iii).First consider any (1−)-minimal 2-colour matching of any disjoint discrete sets R, B ⊂ R. By ( 5), (6) and the definition of (1−)minimality (see also Figure 3), no two edges are entwined, and no two edges of opposite orientations straddle.
Consider any matching with the properties: perfect, no entwined edges, no straddling edges of opposite orientations.( 22) By Lemma 25, each point is in the same level as its partner.We claim that within a given level, no two edges can straddle.Indeed, suppose r, b is a right-oriented edge (without loss of generality) that straddles another edge in the same level.Let b ′ be the first point in the level to the right of r.Then b ′ is blue and b ′ = b, but its partner r ′ must be to its right to avoid entwining, so the two straddling edges r, b and r ′ , b ′ have opposite orientations, a contradiction which establishes the claim.Now let R and B be of equal finite cardinality.We claim that there is a unique (1−)-minimal matching, and that it is the unique matching with the properties (22).To establish this, note that every minimal matching has these properties, and there is at least one minimal matching by Lemma 16.On the other hand, let M be any perfect matching with the properties.By the claim above, there are no straddling edges within a level.Therefore, there is only one possible matching of each level: { x 1 , x 2 , . . ., x 2n−1 , x 2n } where x 1 < • • • < x 2n are the points of the level.Hence there is at most one matching with the given properties, completing the proof of the claims.Now let R, B be independent Poisson processes of intensity 1.Let M be any (1−)-minimal matching (if one exists).By Theorem 1, a.s.M is perfect, so by the previous discussions, the matching is confined to levels and has no entwined edges or straddling edges within levels.By the recurrence of the random walk W , each level Λ k is unbounded in both directions.Therefore, restricted to a given level Λ k , there are two possible matchings -the alternating matchings defined in the proof of Theorem 5(i).One has all edges oriented left, and the other all right.We denote them m − k and m + k respectively.We now address the relationship between levels.For each k ∈ Z, a.s.there exist two red points r < r ′ with no other points between them and with r ∈ Λ k , and hence r ′ ∈ Λ k+1 .Suppose that the matching at level k is m + k , so that r is matched to the right.Then r ′ must also be matched to the right, otherwise the edges would be entwined.Therefore the matching at level k + 1 must be m + k+1 .Consequently, there must exist some k ∈ Z ∪ {−∞, ∞} such that the matching M takes the form (Here the first union in empty if k = −∞, and the last is empty if k = ∞.) We need to check that each of the matchings M k defined above is indeed minimal.We claim that they each have the properties in (22).Once this is established, the same obviously holds for any finite subset of the edges, and therefore by the earlier discussion, every restriction to a finite compatible set is minimal, so the matching M k is minimal.To prove the claim, consider two edges r, b and r ′ , b ′ at respective levels j and j ′ .If k − 1 2 does not lie between j, j ′ then without loss of generality suppose k − 1 2 < j ≤ j ′ .Then r < b, and W > j throughout the interval (r, b).Suppose that one of r ′ , b ′ , say r ′ without loss of generality, lies between r and b.Since W makes a step from j ′ to j ′ + 1 at r ′ , it must step back down to j ′ between r ′ and b.So r, b straddles r ′ , b ′ and both are oriented right.Now suppose that k − 1 2 lies between j and j ′ , say j < k − 1 2 < j ′ .Then W < k on the interval (b, r) and W > k on the interval (r ′ , b ′ ), so the two edges are separate.Thus M k is minimal.Consequently, a.s. the minimal matchings are precisely ( Next we address local finiteness.The points of a level alternate in colour, and in M k , the intervals between them alternate between being crossed by no edge and one edge of that level. ) is crossed by an edge of level j if and only if W (x) > j; for j < k − 1 2 the condition becomes W (x) ≤ j.Therefore the total number of edges of M k that cross In particular, M −∞ and M ∞ are locally infinite, while (M k : k ∈ Z) are all locally finite.Now suppose that M is an invariant minimal matching scheme.By Proposition 13, M is locally infinite a.s., so it must concentrate on {M −∞ , M ∞ }.On the other hand, M −∞ can be described as follows: the partner of a red point r is And M ∞ has a similar characterization with the colours reversed.Therefore both M −∞ and M ∞ are invariant, and indeed they are factors, and hence ergodic.For a general invariant minimal matching scheme M, the event A = {M = M −∞ } is a.s.equivalent to the event that every edge is oriented right, which is translation-invariant.Therefore if M is ergodic then A has probability 0 or 1. Hence there are no further ergodic matching schemes besides M −∞ and M ∞ , and in particular no other factors.Finally, by ergodic decomposition [19,Theorem 10.26], every invariant minimal matching scheme M is a mixture of M −∞ and M ∞ (that is, M = M η where η is independent of (R, B) and takes value ∞ with probability p and −∞ otherwise, where p ∈ [0, 1] is arbitrary).) Therefore, we get uncountably many minimal matchings by performing this modification at an arbitrary set of 4tuples.Moreover, if E is a measurable subset of [0, ∞) then we can perform the modification at those tuples for which |r ′ − b ′ | ∈ E. Each choice of E gives a minimal factor matching scheme, and varying E (for example over sets of the form E I := i∈I [i, i + 1) for I ⊆ N) gives uncountably many such schemes.

Quasistability, and existence via limits
In this section we present two different limiting arguments that establish existence of minimal matchings, and indeed of invariant matching schemes, in certain cases.The first involves a limit of minimal matchings on large finite boxes.The second, an extension of methods of [14], involves matchings whose average cost approaches the infimum.In both cases the key step is to establish that no points are 'matched to infinity' in the limit.In the first case this relies on a property of the subcritical regime γ < 1 which we call quasistability.This property will be important for later proofs also.The second case relies on a uniform bound on the average cost.Recall that invariant minimal matching schemes are perfect by Corollary 12.
Proposition 27 (Existence via finite average cost).Let γ ∈ (0, ∞) and d ≥ 1, and consider 1-colour (respectively 2-colour) matchings of (independent) Poisson process(es) R (and B) of intensity 1 on R d .Suppose that there exists some invariant perfect matching scheme whose matching distance X satisfies E * X γ < ∞.Then there exists an invariant perfect γ-minimal matching scheme.
Quasistability is analogous to stability (3), but with an extra multiplicative constant.Recall that if x is an unmatched point of M then we write The same holds for a γ-minimal 2-colour matching provided x and y have different colours.
Proof.The points x and y cannot be both unmatched in a minimal matching.Moreover, if only y (say) is unmatched then, since κ ≥ 1, if (25) fails then |x − y| < |x − M(x)|, so matching x to y instead of M(x) would reduce the cost.Therefore we can assume x and y are both matched.We can also assume that they are not matched to each other, otherwise (25) holds trivially.Suppose that (25) fails, i.e.
We claim that, with the appropriate choice of κ, modifying M by matching instead the pairs x, y and M(x), M(y) strictly reduces the cost, in contradiction to minimality.For γ = −∞ we can take κ = 1 and the claim is immediate.For −∞ < γ < 0 we can take any κ > 2 −1/γ , for then For the remaining cases 0 ≤ γ < 1 we write |x − y| so that the assumption (26) becomes u, v > κ.By the triangle inequality, Therefore, in the case γ = 0, the change in cost associated with the modification is We can take κ = 3, so that this is at most log( 1 9 + 2 3 ) < 0. Finally, for 0 < γ < 1, let so that the reduction in cost is at least |x − y| g(u, v).By differentiating we see that g is increasing in u and v, so we need only show that g(u, u) > 0 for some u.But in fact we have Proof of Proposition 26.We address the 2-colour case first.Fix d ≥ 1 and γ ∈ (−∞, 1).We will construct the desired matching scheme as a limit, and for this we interpret point processes and matchings as random measures.Let L denote Lebesgue measure on R d .
Let n be a positive integer.Let R n and B n be independent Poisson processes of intensity 1 on R d .Let Q n be uniformly distributed on the cube [0, n) d and independent of (R n , B n ).Define a n-tile to be any set of the form [0, n) d +z+Q n for z ∈ Z d .The n-tiles form a random partition of R d .By Proposition 9 and Lemma 16, within each n-tile there is a.s. a unique γ-minimal 2-colour matching of the points of R n and B n that lie in the tile.Let M n be the point process on (R d ) 2 whose support is the union over all tiles of these matchings.Then M n is an invariant matching scheme of R n and B n .
Let X n = (R n , B n , M n ), which we interpret as a point process on the disjoint union R d ⊔R d ⊔(R d ) 2 .We claim that the sequence (X n ) ∞ n=1 is relatively compact in distribution with respect to the vague topology on point measures on this space.This follows from [19,Lemma 16.15].Indeed, for any bounded ) is a tight sequence.Hence there is a subsequence (n(k)) and a point process X = (R, B, M) for which in the aforementioned topology.Let S be the set of all bounded Borel subsets of R d with L-null boundaries (which includes balls and rectangles).Note that any L-null set D ⊂ R d is contained in an open set D ′ with LD ′ arbitrarily small, and [19,Lemma 16.16] for U ∈ S, and similarly for B.Moreover, these convergence in distribution statements hold jointly for any finite collection of such sets.
Applying the above to R(U i ) for a family of disjoint U i ∈ S and similarly for B we deduce that R and B are independent Poisson processes of intensity 1. Comparing sets in S with their translations shows that X inherits the translation invariance of X n .For any U, V ∈ S we have so the same holds in the limit.Hence, M is an invariant matching scheme of R and B.
Next we show that M is perfect.We claim first that a.s. it has unmatched points of at most one colour.Denote the ball S t := {x ∈ R d : |x| < t}.Let κ = κ(γ) be the constant from Proposition 28.Fix t > 0 and let T = (2κ + 1)t.Consider the matching M n .By Proposition 28, if S T is contained entirely within an n-tile then S t cannot contain points of both colours that do not have partners in S T .Thus, Since the right side tends to 0 as n → ∞, we deduce that in M, a.s.S t does not contain points of both colours that do not have partners in S T .In particular, S t contains unmatched points of at most one colour.Since t was arbitrary this proves the claim.Now Lemma 11 implies that M is perfect.
Finally, we will show that M is γ-minimal.First note that by the Skorohod coupling theorem [19,Theorem 4.30] we can assume that the convergence (27) holds a.s.Passing to a suitable further subsequence and using the Borel-Cantelli lemma, we can also assume that a.s., for each t < ∞, the ball S t lies in an n(k)tile for all sufficiently large k.
Suppose that M is not a.s.minimal.Then with positive probability it has some finite set of edges { r i , b i } N i=1 whose endpoints admit a 2-colour perfect matching of strictly lower cost.On this event, by continuity of the cost function, there exists (random) δ > 0 such that, defining the balls U i = r i + S δ and is also not minimal.By further reducing δ if necessary, we can assume that no U i or V i contains another point of R or B (besides the point r i or b i at its centre).Since M n(k) → M in the vague topology, and since U i × V i is a bounded set with no point of M on its boundary, for all k sufficiently large, M n(k) has points (r k i , b k i ) ∈ U i × V i for each i = 1, . . ., N. But we can find t < ∞ (again, random) such that r i , b i ∈ S t for all i, and then r k i , b k i ∈ S t+δ .Then r k i , b k i belong to the same n(k)-tile for all k sufficiently large, but this contradicts the non-minimality assumption.
The proof in the 1-colour case is very similar, with the following differences.We interpret a matching scheme of R as a point process M on (R d ) 2 , where an edge x, y is represented by point masses at both (x, y) and (y, x).We define (M n , R n ) and the limit (M, R) as above.We can rule out points of the form (x, x) in the limit M, because M n {(x, y) : x, y ∈ S t , |x − y| < ǫ} is bounded above by the number of ordered pairs of distinct points x, y of a Poisson process that lie in S t and are at distance at most ǫ, which converges to 0 in distribution as ǫ → 0 for fixed t > 0. To show that M is a matching scheme of R we use the fact that M n (U × V ) ≤ R n (U) ∧ R n (V ) for disjoint U, V ∈ S. To prove that M is perfect we use quasistability to show that S t contains at most one point with no partner in S T , and then use Lemma 11.Minimality is proved as before.
Remark 29.The quasistability property (Proposition 28) is essential for the above argument.In particular, we know by Theorem 2(i) that the conclusion of Proposition 26 fails in the case of 2-colour matching on R with γ > 1.In that case one may check that the limiting matching M is empty and thus has all points unmatched -indeed, all red points are 'matched to infinity' in the same direction (left or right) in the limit, and all blue points are matched to infinity in the opposite direction.
Proof of Proposition 27.The argument is a straightforward extension of the proof in [14,Section 6] from γ = 1 to γ ∈ (0, ∞), and involves similar formalism to the proof of Proposition 26 above.We summarize the main ideas here, referring the reader to [14] for more detail.We define the average cost of a perfect matching scheme M to be which equals E * X γ for an invariant matching scheme.Assuming the existence of an invariant matching scheme M with η(M) < ∞, let I be the infimum of η(M) over all invariant schemes, and take a sequence of invariant schemes (M n ) with η(M n ) < C for some C < ∞ and η(M n ) → I.As in the previous proof we can take a subsequential limit M in distribution with respect to the vague topology.We can use the uniform bound η(M n ) < C to conclude that M is perfect and η( M) = I.See [14, Proof of Corollary 11].It is important that the cost function f γ (x) = x γ is nonnegative and tends to ∞ as x → ∞.Finally, M is γ-minimal, because otherwise it could be modified locally to obtain another matching with η strictly less than I. See [14, Proof of Theorem 2(i), case d ≥ 3].

Uniqueness and finite differences
In this section we use quasistability and levels to prove uniqueness and finite differences for γ-minimal 2-colour matchings in the subcritical regime γ < 1 with d = 1.(Recall that we do not know whether similar results hold for 1colour matchings.)Here is the key step, a property of the random walk W whose proof we defer until after its applications.
Proposition 30.Let R and B be independent Poisson processes of intensity 1 on R, and define the walk W as in (20).Fix any a > 1.There exists an a.s.positive, finite random variable Moreover we can take Y to be supported in the discrete set {(3a) n : n ∈ Z + }, and to satisfy the tail bound P(Y > y) < y −α for some α = α(a) > 0.
Proof of Theorem 2(iv).Let γ ∈ [−∞, 1).There exists a γ-minimal 2-colour matching by Proposition 26.Let V = min((R ∪ B) ∩ [0, ∞)) be the first point to the right of the origin.To establish uniqueness, it suffices to prove that a.s.V has the same partner in all γ-minimal matchings.Let κ = κ(γ) be as in Proposition 28, and let a = 2κ + 1.By Proposition 30 there exists Y such that W > 0 on [−aY, −Y ] ∪ [Y, aY ].This implies that there is some point in (0, Y ], so V lies in this interval.Let Λ be the level containing V , which is either Λ 0 or Λ −1 depending on the colour of V .Then Λ has no points in ) contains equal numbers of red and blue points.
Recall that a.s.every γ-minimal matching is perfect (Theorem 1).Let M be any perfect γ-minimal matching.We claim that every point in H has its partner in H.If not, since the colours balance, there must exist a red point We have shown that a.s. in every γ-minimal matching, H is matched to itself.But H is finite, so by Proposition 9 it a.s.has only one γ-minimal matching, m say.So every γ-minimal matching M has M(V ) = m(V ).Hence, there is a.s. a unique minimal matching.
Since the minimal matching is unique, it must be a factor, and it is locally infinite by Proposition 13.
We will use the following estimate for the walk, the analogue of a standard fact for simple symmetric random walk in discrete time.
Lemma 31.Let R and B be independent Poisson processes of intensity 1 on R, and define the walk W as in (20).The hitting time T := min{t > 0 : W (t) = 1} satisfies P(T > t) ∼ ct −1/2 as t → ∞ for some fixed c > 0.
Proof.An application of the reflection principle gives P(T ≤ t, W (t) ≤ 0) = P(T ≤ t, W (t) ≥ 2), which implies that P(T > t) = P(W (t) ∈ {0, 1}).The latter quantity can be analysed by conditioning on the number of jumps of the walk by time t to reduce it to the discrete random walk analogue, and using standard Binomial distribution asymptotics.Combining the two cases {0, 1} eliminates parity issues.Proof of Theorem 3(ii), case γ, γ ′ < 1.Here we prove finite differences for the minimal matchings with γ, γ ′ ∈ (−∞, 1).(The case γ = 1− will require a different argument, to be given later.)We apply the same construction as in the proof of Theorem 2(iv) above, but using the constant a = 2[κ(γ)∨κ(γ ′ )]+1.Then the set H defined in (28) is matched to itself in both the γ-minimal matching M and γ ′ -minimal matching M ′ .Hence the component containing V in the graph with edge set M ∪ M ′ is confined to H, and is thus finite.Now we turn to the proof of Proposition 30, which we break into lemmas.
Lemma 32.The random walk W satisfies By the strong Markov property at T and symmetry we have Therefore, defining D r = {W (2r) > 0}, it is enough to prove that lim inf We consider two cases.If L = r then W (r) > 0. But for any integer k > 0 we have by symmetry.On the other hand, if L ∈ [0, r) then W (L) = 0 and W ≤ 0 on [L, r].Moreover, for t < r, which by Lemma 32 (with s = r − t) is bounded away from 0 as r → ∞ uniformly in t.Combining the two cases we obtain (31).
Proof of Proposition 30.Fix a > 1, and for integer n ≥ 1 define events By symmetry and independence of the left and right half lines it follows that for n ≥ N, for n ≥ N, and since this conditional probability is positive for all n, it is bounded below for all n ≥ 0. We deduce that P(∪ ∞ n=1 A n ) = 1, and moreover that P(∩ n i=1 A n ) decays exponentially as n → ∞.Since on A n we can set Y = (3a) n we obtain the claimed result.

Edge Orientations in the subcritical case
In this section we prove a structural property of the 2-colour γ-minimal matching for γ < 1.In addition to being interesting in its own right, this will enable us to prove finite differences between γ < 1 and γ = 1−.Recall that, for γ < 1, each point is matched within its own level (Lemma 25).
Theorem 35 (Locally infinite levels).Let R and B be independent Poisson processes of intensity 1 on R. Let γ ∈ [−∞, 1) and consider the γ-minimal 2colour matching.Almost surely, for any x ∈ R and k ∈ Z, the level Λ k contains infinitely many edges that cross x.These edges can be ordered as e 1 , e 2 , . .., where e i+1 straddles e i for each i ≥ 1; then their orientations alternate.
Proof.The argument will be similar to the proof of Theorem 2(iii) concerning γ = 1− (but more intricate).Let M be the minimal matching, which is unique by Theorem 2(iv) and perfect by Theorem 1.No two edges are entwined, so each point is matched within its level by Lemma 25.
Fix k ∈ Z and let m k = M| Λ k be the restriction of the matching to level k.Since bounded intervals contain finitely many points, either m k is locally finite or every x ∈ R is crossed by infinitely many edges of m k .Consider any location x ∈ R \ (R ∪ B) and let e 1 , e 2 , . . ., e n (, . ..) be the edges of m k that cross x, ordered so that e i+1 straddles e i for each i.We claim that their orientations alternate.Indeed, suppose that e ′ = r ′ , b ′ straddles e = r, b , and that they belong to the same level and have the same orientation, say right.Since the points of the level alternate in colour, it has more blue than red points in the interval (r ′ , r).Since edges do not entwine, at least one of these blue points must be matched to a red point between b and b ′ , giving an edge of m k of the opposite orientation straddling e and straddled by e ′ .This proves the claim.
Call an edge of m k outer if it not straddled by any other edge of m k .If m k is locally finite then it has infinitely many outer edges, and, since the colours alternate, all its outer edges must have the same orientation; m k partitions R into an alternating sequence of outer edges and gaps, i.e. intervals crossed by no edges.(The outer edges may straddle other edges of m k .)We say that m k has left type if all its outer edges are oriented left, or right type if they are oriented right, or ∞ type if it is locally infinite.Now we consider how different levels are related.Suppose that m k has right type, and consider a gap, which is an interval I = (b, r) where b, r ∈ Λ k with b blue and r red, and no edges of m k crossing I.The walk W satisfies W ≤ k on I.In particular I contains no points of Λ k+1 .Moreover, since the same applies to each gap and there are no entwined edges, I is crossed by no edges of m k+1 .On the other hand, a.s., some outer edge of m k must cross some point of Λ k+1 , otherwise we would have W ≤ k + 1 on R. Suppose that r, m k (r) is such an outer edge.Let r ′ be the first point of Λ k+1 to the right of r, which must be red because W (r+) = k + 1.The partner b ′ = m k+1 (r ′ ) must be to the right of r ′ , since edges do not entwine, and by the previous remarks, r ′ , b ′ is an outer edge.Therefore, m k+1 also has right type.A similar argument shows that if m k has left type then so does m k−1 .
We conclude that there exist (random) K − , K + ∈ Z ∪ {−∞, ∞} with K − ≤ K + such that for each j ∈ Z, m j has type: . So far we have used that M is perfect and has no entwined edges, and that each level is unbounded in both directions.Next we will use invariance properties to show that K − = −∞ and K + = ∞.
First we claim that all levels have the same type; the idea is that it is impossible to specify a level in an invariant way.Recall the (1−)-minimal matchings (M k : k ∈ Z ∪ {−∞, ∞}) defined in (23).Construct the new matching M K − , where K − is the random variable above.This is a perfect matching of R and B, and it can be constructed as a translation-equivariant function of M: within each level j we replace the matching m j with one of the two matchings from the earlier proof: either m − j (if m j has left type) or m + j (if m j has right or ∞ type).Therefore, M K − is an invariant matching scheme, so by Proposition 13, it is locally infinite a.s.But as shown in the proof of Theorem 2(iii), M k is locally finite for finite k.Therefore, K − ∈ {−∞, ∞} a.s.Similarly, considering the matching M K + shows that K + ∈ {−∞, ∞} a.s.Thus, a.s., all levels of M have the same type.
Since the γ-minimal matching M is unique, it is a factor, and thus ergodic.The event that all levels have left type is translation invariant, and similarly for right and type ∞ types.Therefore for one of the three types, a.s.all levels have that type.Finally, we can rule out left type and right type, because M is invariant in law under reflections of R. Thus all levels are locally infinite, completing the proof.
We can now prove finite differences in the remaining case.
Proof of Theorem 3(ii), case γ ′ = 1−.Let γ ∈ [−∞, 1) and let M be the γminimal matching.Let M ′ be one of the (1−)-minimal matchings (M k : k ∈ Z∪{−∞, ∞}).Since both M and M ′ match within levels, it is enough to prove finite differences within a level, say Λ j .Recall that the restriction of M ′ to Λ j is one of the two alternating matchings, say without loss of generality m Remark 36.Notwithstanding the above proof, the finite differences property does not hold between any two of the distinct (1−)-minimal 2-colour matchings M k , as is easily checked by considering a level on which they differ.9. Tail Bounds Proof of Theorem 4(i).The condition E * X 1/2 = ∞ holds for any invariant 2colour matching scheme of R and B, by [16,Theorem 2].We therefore turn to the claimed upper tail bound.
For γ = 1− and M = M −∞ the argument was already given in the proof of Theorem 4(ii): by (24), X = M * (0) is the first return time of the walk W * to 0 (29), so the claimed bound holds by Lemma 31.The case M = M ∞ is similar.
Let γ ∈ [−∞, 1) and let M be the unique γ-minimal 2-colour matching in d = 1.Let κ = κ(γ) be the constant from Proposition 28.Let t > 0 and call a red or blue point x bad if |x − M(x)| > κt, and good otherwise.By Proposition 28, the interval [0, t] cannot contain bad points of both colours.
Suppose that [0, t] contains bad red points, and let U and V be the first and last bad red point in the interval.Then no good point in [U, V ] is matched outside [U, V ], since that would entail entwined edges, in contradiction to Lemma 14 (see also Figure 3).Hence [U, V ] contains good red and good blue points in equal numbers, and so the number of bad red points in [0, t] equals W (V +)−W (U−), where W is the random walk of (20).We deduce that t P * (X > κt) = E# x ∈ R ∩ [0, t] : x is bad Proof of Theorem 6.Part (i) (γ ≥ 1−) is a trivial consequence of the proof of Theorem 5(i).The invariant matching scheme M is an equal mixture of the two alternating matchings M + and M − .Therefore the same is true for the Palm version, and thus X is a standard exponential variable.Part (ii) (γ < 1) is the d = 1 case of Theorem 37.

Figure 1 .
Figure1.Uniformly random red and blue points in equal numbers on a square, together with γ-minimal matchings for γ = ∞ (altruistic; top-left), 1 (top-right), and −∞ (stable; bottom).Of these, only the last is known to exist on the infinite plane.

Proposition 9 (
Local uniqueness).Fix d ≥ 1 and γ ∈ R. Let R be a Poisson process of intensity 1 on R d .If (d, γ) = (1, 1) then almost surely there do not exist distinct finitely supported matchings m and m ′ of R for which

Corollary 12 (
Invariant perfectness).Let d ≥ 1 and let R be an invariant point process (resp.let (R, B) be jointly ergodic invariant point processes of equal intensity) on R d and let γ ∈ [−∞, ∞].Any invariant 1-colour (resp.2-colour) γ-minimal matching scheme is perfect.Proof.A γ-minimal 1-colour matching can have at most one unmatched point, and a γ-minimal 2-colour matching can have unmatched points of at most one colour.Now apply Lemma 11.

Figure 3 .
Figure 3. Possible arrangements (separate, nested, or entwined) of two edges in a γ-minimal matching on R, in the 1-colour case (top row) and 2-colour case (bottom three rows, according to the ordering of the colours).The figures indicate only the order of the points, not their distances.Solid lines and dashed lines indicate two different possible matchings; in the bottom row with γ = 1 both possibilities are 1-minimal (with the tie broken as indicated for γ = 1±), while in the other two cases the minimal choice depends on the distances between points.

2. 5 .
Dimension one.The simple inequalities below are of central importance to the analysis of γ-minimal matchings in dimension d = 1.Consider four points in R with successive distances a, b, c between neighbouring pairs from left to right.The following enables us to compare the cost of entwined versus straddling edges.

Proof.
Suppose on the contrary that r and b are partners that belong to different levels, where r < b say.Then W (b−) − W (r+) = 0, so the numbers of red and blue points in the open interval I = (r, b) are unequal.So, since the matching is perfect, some point x in I must have its partner outside I.But then r, b and x, M(x) are entwined.Now we address (1−)-minimal 2-colour matchings.We can explicitly characterize all the matchings.

Proof of Theorem 2 (
ii).We address 1-minimal 2-colour matchings of Poisson processes.The (1−)-minimal matching M −∞ from the proof of part (iii) above is by definition 1-minimal.We will modify it.Let r < r ′ < b ′ < b be 4 consecutive points, with r, r ′ ∈ R and b, b ′ ∈ B and no other points between r and b.A.s. there are infinitely many such 4-tuples, and no two of them overlap with each other.The matching M −∞ matches the pairs r, b , r ′ , b ′ .Matching r, b ′ , r ′ , b instead gives another 1-minimal matching.(It suffices to consider finite compatible subsets containing r, r ′ , b, b ′ , and then the two induced matchings have the same cost. r and a blue point b in H both with partners outside H.By Lemma 25, the partners M(r), M(b) are in Λ and therefore outside [−aY, aY ].Therefore |r − M(r)|, |b − M(b)| > (a − 1)Y = 2κY.But since |r − b| ≤ 2Y , this contradicts Proposition 28.

Proof of Theorem 4 (
ii).Let us couple the Palm process (R * , B * ) with (R, B) by adding a red point at the origin: R * = R ∪ {0} and B * = B. Let the walk W be defined in terms of (R, B) via(20) as usual, and let W * be defined similarly in terms of (R * , B * ), so thatW * (x) = W (x) + 1[x ≥ 0].First consider the (1−)-minimal matching M = M −∞ under the Palm measure.By (24), the partner of the point at 0 equals the first return time of W * to 0:M * (0) = min{t > 0 : W * (t) = 0},(29)and moreover, M * (0) can be determined from the restrictions of (R * , B * ) to [0, M * (0)], so the matching is a finitary factor with L = M * (0).But the right side of (29) equals min{t > 0 :W (t) = −1},which by symmetry is equal in law to the time T in Lemma 31.So the claimed tail bound holds with α = 1/2.By symmetry, the same conclusion holds for M ∞ .Now let γ ∈ [−∞, 1).With a = 2κ + 1 as in the proof of Theorem 2(iv) above, let Y := min y : W > 0 on [−ay, −y] ∪ [y, ay] where y = (3a) n for some n ∈ Z + , and let Y * be defined similarly in terms of W * .(The restriction to y of the form (3a) n avoids complications involving minima versus infima.)Since W * ≥ W we have Y * ≤ Y .By Proposition 30, Y satisfies a power law tail bound, therefore so does Y * , and so does L := aY * .We can determine L from the restriction of (R * , B * ) to [−L, L].Moreover, by the argument in proof of Theorem 2(iv) (applied to the Palm process, with V = 0) we can also determine the partner of 0 in the minimal matching.
3a) n ] , and write A n := A + n ∩ A − n .Define the random sets S + n := x ∈ (0, a(3a) n ] : W (x) > 0 ; S − n := x ∈ [−a(3a) n , 0) : W (x) > 0 , and let S n = S + n ∪ S − n .By Corollary 34 there exist δ = δ(a) > 0 and N = N(a) < ∞ such that for all n ≥ N, + j .Fix a point x ∈ Λ j .By Theorem 35 there exists a right-oriented edge r, b ∈ M| Λ j with r < x < b.Since all edges of m + j are oriented right, r and b are matched in the interval [r, b] in M ′ .Since there are no entwined edges, every point in Λ j ∩ [r, b] is matched within this set in both M and M ′ .