Metric currents and the Poincaré inequality

We show that a complete doubling metric space (X,d,μ)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(X,d,\mu )$$\end{document} supports a weak 1-Poincaré inequality if and only if it admits a pencil of curves (PC) joining any pair of points s,t∈X\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$s,t \in X$$\end{document}. This notion was introduced by S. Semmes in the 90’s, and has been previously known to be a sufficient condition for the weak 1-Poincaré inequality. Our argument passes through the intermediate notion of a generalised pencil of curves (GPC). A GPC joining s and t is a normal 1-current T, in the sense of Ambrosio and Kirchheim, with boundary ∂T=δt-δs\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\partial T = \delta _{t} - \delta _{s}$$\end{document}, support contained in a ball of radius ∼d(s,t)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\sim d(s,t)$$\end{document} around {s,t}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{s,t\}$$\end{document}, and satisfying ‖T‖≪μ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Vert T\Vert \ll \mu $$\end{document}, with d‖T‖dμ(y)≲d(s,y)μ(B(s,d(s,y)))+d(t,y)μ(B(t,d(t,y))).\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} \frac{d\Vert T\Vert }{d\mu }(y) \lesssim \frac{d(s,y)}{\mu (B(s,d(s,y)))} + \frac{d(t,y)}{\mu (B(t,d(t,y)))}. \end{aligned}$$\end{document}We show that the 1-Poincaré inequality implies the existence of GPCs joining any pair of points in X. Then, we deduce the existence of PCs from a recent decomposition result for normal 1-currents due to Paolini and Stepanov.


Introduction
Let (X , d, μ) be a complete metric space, where μ is a doubling locally finite Borel measure. It is known, see for example [7,9], that plenty of analysis can be conducted on (X , d, μ) whenever the weak p-Poincaré inequality is satisfied for some C, p, λ ≥ 1, for all balls B ⊂ X , for all locally integrable Borel functions u : X → R, and for all upper gradients ρ of u. So, it is worthwhile to find necessary and sufficient conditions for the validity of (1.1). One well-known sufficient condition is the existence of pencils of curves, introduced by Semmes [15] in the 90's. To motivate the results in the present paper, we first discuss Semmes' condition in some detail; our definition is the one given in Section 14.2 in [9], where the setting is somewhat more general than in Semmes' original work [15]. g(y) (s, d(s, y)) + g(y) (t, d(t, y)) dμ(y).
A doubling space (X , d, μ) admitting PCs satisfies the weak 1-Poincaré inequality. This was proven by Semmes for Q-regular spaces, see [15,Theorem B.15], and the general case can be found for instance in Heinonen's book [8,Chapter 4].
Of course, Semmes in [15] also gives sufficient conditions for finding PCs: his Standard Assumptions (see [15,Theorem 1.11] and above) include the space (X , d, μ) to be an orientable topological n-manifold, with μ = H n . Moreover, X has to be locally contractible (for more precise statements, see [15,Definition 1.7] or [15,Definition 1.15], but also the discussion in [15,Remark A.35]). These assumptions are certainly not necessary for a space (X , d, μ) to admit PCs or support a Poincaré inequality; notably, the Laakso spaces [11] have PCs, hence satisfy (1.1) with p = 1, but are generally not integer-dimensional.
The main result of our paper shows that, in complete doubling metric measure spaces, the weak 1-Poincaré inequality implies the existence of PCs. We achieve this by passing through an intermediate notion, the generalised pencils of curves.
The main novelty of the present paper is the following result: It turns out that the existence of GPCs implies the existence of PCs. This is a consequence of a recent decomposition result for normal 1-currents, due to Paolini and Stepanov [13]. Combined with Theorem 1.3, we obtain the following characterisation. Remark 1. 5 The first version of this paper only contained Theorem 1.3, as we were not aware of the decomposition result of Paolini and Stepanov. Shortly afterwards, Theorem 1.4 was obtained by Durand-Cartagena et al. [4,Theorem 3.7]. Their proof uses the modulus of curve families instead of metric currents. So, Theorem 1.4 first appeared in [4].
The structure of the paper is the following. In Sect. 2, we briefly recall the definition of, and some basic concepts related to, the metric currents of Ambrosio and Kirchheim. Then, in Sect. 3, we prove the easy "if" implication GPCs ⇒ weak 1-PI of Theorem 1.3, mostly using classical methods in metric analysis. We chose to retain a direct proof of this implication, as it indicates how GPCs can be applied in practice. Another proof would be GPCs ⇒ PCs ⇒ weak 1-PI, where the first implication follows from Paolini and Stepanov's work. As explained above, the second implication follows from [15,Theorem B.15] in the Q-regular case, and in full generality from [8,Chapter 4]. Section 4 is the core of the paper, containing the proof of the "only if" implication of Theorem 1.3. In short, the idea is to translate the problem of finding currents in (X , d, μ) to finding "network flows" in certain graphs derived from δ-nets in X . The existence of such flows is guaranteed by the famous max flow-min cut theorem of Ford and Fulkerson [5]. Then, the main task will be to verify that there are no "small cuts" in the graph, and this can be done by using the weak 1-Poincaré inequality. Finally, in Sect. 5, we explain how to deduce Theorem 1.4 from Theorem 1.3 using the results of Paolini and Stepanov.

Basic notation
Open balls in a metric space (X , d) will be denoted by B(x, r ), with x ∈ X and r > 0. A measure on (X , d) will always refer to a Borel measure μ with μ(B(x, r )) < ∞ for all balls B(x, r ) ⊂ X . The notation A B means that there exists a constant C ≥ 1 such that A ≤ C B: the constant C will typically depend on the "data" of the ambient space, for example the doubling constant of μ, or the constant in the Poincaré inequality (1.1) (whenever (1.1) is assumed to hold). The two-sided inequality A B A is abbreviated to A ∼ B.

Background on currents
The main result in the paper mentions currents in metric spaces, so we include here a brief introduction. We claim no originality for anything in this section. We use the definition of metric currents given by Ambrosio and Kirchheim, see Definition 3.1 in [1].
Let X be a complete metric space, and let Lip(X ) and Lip b (X ) be the families of Lipschitz, and bounded Lipschitz functions on X . For k ≥ 1, We typically denote the (k + 1)-tuples in D k (X ) by ( f , π 1 , . . . , π k ). Following Definition 2.2 in [1], we consider subadditive, positively 1-homogenous functionals T : D k (X ) → R. These are denoted by M F k (X ). We say T ∈ M F k (X ) has finite mass, if there exists a finite Borel measure ν on X such that As in Definition 2.6 in [1], the minimal measure ν satisfying (2.1) is denoted by T (this is well-defined, as discussed below (2.2) in [1]).
A k-dimensional current, or just a k-current, is then a (k + 1)-multilinear functional T ∈ M F k (X ) with finite mass, satisfying a few additional requirements which we will not need explicitly, see Definition 3.1 in [1]. If T is a k-current, so that T is a finite Borel measure, then bounded Lipschitz functions are dense in L 1 (X , T ), and in particular in the space of bounded Borel functions B(X ) equipped with the L 1 ( T )-norm. This fact, and (2.1), together imply that T has a canonical extension to B(X ) × [Lip(X )] k , which we also denote by T .
We review a few basic concepts related to currents. .
Definition 2.3 (Push-forward) Let X , Y be complete metric spaces, and let ϕ : The following is a special instance of Definition 2.5 in [1].

Definition 2.4 (Restriction)
Let X be a complete metric space, T ∈ M F 1 (X ), and g ∈ Lip b (X ). Then we define an element T g ∈ M F 1 (X ) by setting If T is a 1-current, then Definition 2.4 can be extended to g ∈ B(X ) using the canonical extension of T to B(X ) × Lip(X ), see [1, p.11]. Moreover, in that case, T g is again a current, see [1, p.16 and p.19]. If E is a Borel subset of X and g = χ E , we write T E for the restriction T g . We have for all ( f , π 1 ) ∈ D 1 (X ). Since χ E is merely Borel but not Lipschitz, (2.2) does not follow directly from the definition of T given by (2.1), but it can be deduced by the density argument alluded to earlier, see [1, (2.3)]. Finally, (2.2) and the minimality of T E show that We record the following lemma, which follows from general measure theory:

Lemma 2.5
Assume that T is a k-current on a σ -compact metric space X . Then, for any Borel set B ⊂ X and any > 0, there exists a compact set K ⊂ B with T (B \ K ) < .
Proof By assumption T is a finite Borel measure. The claim now follows from [12, Theorem 1.10], and the Note directly below it.
We next describe a simple example, which will be useful later on.

Example 2.6
Given a non-degenerate interval [a, b] ⊂ R we may define the 1-current a, b as follows: . This is a particular case of Example 3.2 in [1], and it is noted there that a, b = H 1 | [a,b] . The boundary of a, b is the measure (or 0-current) δ b − δ a , as shown by the following computation: Next, consider an isometric embedding γ : [a, b] → X , where X is any complete metric space. Then γ a, b defines a current in X given by (spelling out Definition 2.3) It is noted in [1, (2.6)], and in the discussion directly below, that The last equation follows from the isometry assumption. Finally, because boundary and push-forward commute by [1, (2.1)], we have We end the section by recalling (a slightly simplified) version of the compactness theorem for normal currents. The original reference, and the full version of the theorem, is [1, Theorem 5.2].

Theorem 2.7 (Compactness) Let (T n ) n∈N be a sequence of normal k-currents with
sup n ( T n (X ) + ∂ T n (X )) < ∞, and such that spt T n ⊂ K for some fixed compact set K ⊂ X , for all n ∈ N. Then there exists a subsequence (T n m ) m∈N , and a normal k-current T supported on K , such that

Generalised pencils of curves imply the 1-Poincaré inequality
In this section we prove that if X as in Theorem 1.3 admits generalised pencils of curves, then it supports a weak 1-Poincaré inequality. It is well known, see for instance [9,Theorem 8.1.7], that doubling metric measure spaces which support a Poincaré inequality can be characterised in terms of the validity of pointwise inequalities between functions and their upper gradients. We will use the existence of GPCs to derive such an inequality between an arbitrary Lipschitz function u : X → R and its (upper) pointwise Lipschitz constant The desired inequality will be based on the following lemma.

Lemma 3.1 Let X be a complete σ -compact metric space and let u : X → R be a Lipschitz function. Then, for any 1-current T , we have
Proof The idea of the proof is the following: By definition of ∂ T and since T is a finite Borel measure on X satisfying (2.1), we know that The desired inequality in Lemma 3.1 is similar, but Lip(u) is replaced by the pointwise Lipschitz constant Lip(u, ·). To achieve this, we will essentially decompose X into pieces where Lip(u, ·) is almost constant. We now turn to the details. Write We perform countable decompositions of the sets E and Z . Consider fix > 0, and define Note that Lip(u, x) = lim R→0 u R (x) and that for every j ∈ Z fixed, the sequences (E 1/i, j ) i∈N and (Z 1/i, j ) i∈N are nested. Then, we can write Notice that the restriction of u to the set Moreover, A similar argument as for (3.2) applies if x ∈ X , and Then the conclusion is simply that the restriction of u to the set Z x it is separable and hence we can pick a countable dense subset {x n } n∈N ⊆ X . Then for arbitrarily small δ ∈ [0, 1/2), the family E ∪ Z with constitutes a countable cover of X by Borel sets. Using the cover E ∪ Z, we can further produce a countable disjoint Borel cover of X of the form Second, the function u can be decomposed as where for some finite constants L i > 0, and where δ > 0 can be taken arbitrarily small. To achieve such a disjoint cover {E i } i∈N ∪{Z i } i∈N , consider first the family The sets in E form a countable cover of E and we enumerate them as (E i ) i∈N . Then we arrive at a disjoint cover of E by setting E 1 := E 1 and defining iteratively To obtain the sets {Z i } i∈N , apply the same procedure with Z = {A ∩ Z : A ∈ Z} in place of E . The decomposition (3.4) then holds by construction. To establish (3.5) and (3.6), we note that the properties (3.2) and (3.3) (and the 2 − j -Lipschitz continuity of u on Z x 1/(2i), j ) are preserved under taking subsets of E x 1/(2i), j (and Z x 1/(2i), j ). Next, Lemma 2.5 allows us to remove for every i ∈ N a Borel set N i from E i (or similarly Z i ) such that Thus, we may assume that the sets and we can write . We now estimate the terms involving χ E i . By definition of the restriction operation, see Definition 2.4 and the comment below it, we can write This is useful information since, according to [1, (3.6)], the values of a 1-current agree on ( f , π 1 ) and ( f , π 1 ) whenever f = f and π 1 = π 1 on the support of T . Using that spt T E i ⊆ E i , we apply this fact to the current T E i and the pairs This shows that Finally, by (2.2) and the property (3.5) of u E i , it holds for every i ∈ N that (3.10) Combining (3.8), (3.9), and (3.10), and using the pairwise disjointedness of the sets Letting → 0 and δ → 0 in (3.7) completes the proof of Lemma 3.1.
We next apply Lemma 3.1 to deduce the validity of a weak 1-Poincaré inequality from the existence of GPCs. [10], see also Theorem 8.4.2 in [9], it suffices to verify the Poincaré inequality for a priori Lipschitz continuous functions u and for the pointwise Lipschitz constant ρ = Lip(u, ·) instead of arbitrary upper gradients. So, let u :

Proof of "if" implication in Theorem 1.3 By a result of Keith
Recalling that we will first check that for distinct points s, t ∈ X . Start by fixing such points s, t, let T be a GPC joining s to t, and recall that spt T ⊂ B(s, C 0 d(s, t)). Then, using Lemma 3.1 and property (P3) in Definition 1.2. (Since a complete doubling metric space is proper, see [9, Lemma 4.1.14], and a proper metric space is σ -compact, the space (X , d) satisfies the assumptions of Lemma 3.1). This proves (3.11), which is (almost) a wellknown sufficient condition for the weak 1-Poincaré inequality. The only technicality here is that we only know (3.11) for the particular upper gradient Lip(u, ·). To complete the proof, we will now briefly argue that that this suffices to imply the weak 1-Poincaré inequality in full generality. Indeed, [8,Theorem 9.5] lists several conditions that imply weak Poincaré inequalities in doubling spaces (see also the references in [8]). Our estimate (3.11) shows that condition (2) in [8,Theorem 9.5] holds for p = 1, μ, u Lipschitz, the particular upper gradient ρ = Lip(u, ·), C 2 = C 3 = C 0 . It then follows from the proof in [8] that also condition (3) in the theorem holds for the same pair (u, ρ) (by this, we mean that to obtain condition (3) for u and ρ, one only needs to have condition (2) for u and ρ, and no other upper gradients). We rephrase condition (3) in a slightly peculiar manner for future application: there exists a constant C ≥ 1 (again depending on C 0 ) such that if 2B := B(z, 2r ) is any ball in X , and x, y ∈ 2B, then |u(x) − u(y)| d(x, y) M Cd(x,y) ρ(x) + M Cd(x,y) ρ(y) . (3.12) Here M R is the restricted maximal function Next we need to verify that inequality (3.12) implies that the very same pair (u, ρ) satisfies the weak 1-Poincaré inequality. To this end, we apply Theorem 8.1.18 in [9] (originally due to Hajłasz [6]) with h = M 4Cr ρ and Q = log 2 C μ for the doubling constant C μ of μ, to deduce that Finally, following verbatim the argument on p. 224 of [9], we conclude that Hence the inequality (1.1) holds with p = 1 and λ = 6C (depending on C 0 ) for all open balls B ⊂ X and all pairs (u, ρ), where u : X → R is Lipschitz and ρ = Lip(u, ·). According to [9,Theorem 8.4.2], this shows that (X , d, μ) supports the weak 1-Poincaré inequality.

An initial reduction
The main effort in the rest of the paper consists of proving the following statement:  (X , d, μ) supports a weak 1-Poincaré inequality, then d is biLipschitz equivalent to a geodesic metric d g . Clearly, the measure μ remains doubling with respect to this new metric d g . Further, by [9,Lemma 8.3.18], the space (X , d g , μ) still supports a weak 1-Poincaré inequality. In fact, since (X , d g ) is geodesic, it follows from [9, Remark 9.1.19] that (X , d g , μ) even satisfies the weak 1-Poincaré inequality (1.1) with constant λ = 1; this is often called the 1-Poincaré inequality (without the attribute "weak").
We can thus apply Theorem 4.1 to (X , d g , μ) in order to find a GPC between any pair of distinct points s, t ∈ X . Then T is also a GPC joining s to t in (X , d, μ), since the conditions (P1)-(P3) in Definition 1.2 are obviously invariant under bi-Lipschitz changes of metric. The least obvious is (P3), where one needs to recall that μ is a doubling measure, whence d (s, d(s, y)) ∼ d g (s, d g (s, y)) and d (t, d(t, y)) ∼ d g (t, d g (t, y)) for all y ∈ X .
As in the assumptions of Theorem 4.1, we now suppose that (X , d, μ) is a complete geodesic doubling metric measure space supporting the Poincaré inequality (1.1) with p = 1 and λ = 1.

Proof of Theorem 4.1
Fix two points s, t ∈ X , and write B 0 := B(s, C 0 d(s, t)) for the ball inside (the closure of) which we should find the current T as in Definition 1.2; the constant C 0 ≥ 1 will be specified later, and its size only depends on the data of (X , d, μ), such as the doubling constant of μ, and the constant in the Poincaré inequality. We find the current T by initially constructing a sequence of approximating currents, each of them a sum of finitely many currents of the form discussed in Example 2.6. We start by defining a sequence of covers of B 0 by balls. For n ∈ N, write r n := 2 −n , and let X n ⊂ B 0 be an r n -net, that is, some maximal family of points X n ⊂ B 0 satisfying d(x, x ) ≥ r n for all distinct x, x ∈ X n . We assume that r n is far smaller than d(s, t), and we require that {s, t} ⊂ X n . (4.1) We note that the collection of open balls B n := {B(x, 2r n ) : x ∈ X n } is now a cover of B 0 . In fact, already the balls B(x, r n ) would be a cover of B 0 : by the maximality of X n , for every y ∈ B 0 there exists x ∈ X n such that y ∈ B(x, r n ). This follows by using the doubling property of μ and the consequential relative lower volume decay (see [9, Lemma 8.1.13]), and noting that the balls B(x, r n /2), x ∈ X n , are disjoint.
We will now construct a current T n supported in n = B(s, C 0 d(s, t) + Cr n ) for suitable constants C 0 , C ≥ 1 (depending on the constants in the 1-Poincaré inequality). The current T n will be constructed using the max flow-min cut theorem from graph theory, and a subsequence of the currents T n will eventually be shown, using the compactness theorem for normal currents, to converge to the desired current T supported onB 0 .

Graphs and flows
To apply the max flow-min cut theorem, we need to define a graph G n = (V n , E n ) associated to our problem, where V n is a collection of vertices, and E n ⊂ V n × V n is a collection of edges. We set V n := X n , and Note that (x, x ) ∈ E n if and only if (x , x) ∈ E n , and that the maximum degree of any vertex is uniformly bounded by (4.3). We also define a capacity function c n : E n → Q + satisfying We do not specify the values of c n (x, x ) more precisely: we will only use that c n (x, y) is a rational number within a constant multiple of the right hand side of (4.4). Note that c n (x, x ) ∼ c n (x , x) for all (x, x ) ∈ E n ; in fact, we may as well define c n (x, x ) = c n (x , x).
A flow in G n is a function f : E n → R satisfying the following three conditions: Informally, (F2) means that the total flow entering any vertex x ∈ V n equals the total flow leaving x (except for the "source" and "sink" vertices s and t), and (F3) says that the flow is bounded by the capacity function. Here, and in the sequel, we write where E n (U, W) = {(x, x ) ∈ E n : x ∈ U and x ∈ W}, and analogously The norm of a flow f : E n → R is defined to be the quantity A cut is any pair (S, S c ), where S ⊂ V n is a set with s ∈ S and t ∈ S c . As usual, S c denotes the complement of S (in V n ). The "total flow" of f over any cut (S, S c ) equals f : In where the min runs over all cuts (S, S c ). In other words, the norm of any flow is bounded from above by the capacity of any cut in the graph.
A well-known theorem in graph theory due to Ford and Fulkerson [5] states that if c n is integer-valued, then (4.6) is sharp: there exists a flow f with f = min c n (S, S c ). We learned the theorem from Diestel's graph theory book, see [3,Theorem 6.2.2]. Our capacity c n is not integer valued, but since c n (x, x ) ∈ Q + , and the cardinality of E n is finite, we may assume that c n (x, x ) ∈ N by initially multiplying all quantities by a suitable integer.
The reader should view flows in G n as discrete models for the current T n : we will make the connection rigorous in Sect. 4.4. For now, we wish to find a uniform lower bound for the numbers c n (S, S c ), where (S, S c ) is an arbitrary cut. We claim that c n (S, S c ) 1. (4.7) To this end, fix a cut (S, S c ), and recall that s ∈ S and t ∈ S c by definition. Also by definition, d(s, x)) d(t, x )) . (4.8) To be precise, (4.8) only holds if none of the edges in E n (S, S c ) start or end in {s, t}. We may assume this, since, for example, if (s, x ) ∈ E n (S, S c ), then c n (S, S c ) ≥ c n (s, x ) 1, and (4.7) follows. In fact, the same argument holds a little more generally: if (x, x ) ∈ E n (S, S c ) satisfies dist(x, {s, t}) r n or dist(x , {s, t}) r n , then again c n (S, S c ) 1, using the assumption that μ is doubling. So, without loss of generality, we assume that where C ≥ 1 is a suitable large constant to be specified later. If C ≥ 20, say, then (4.9) has the following consequence: for all y ∈ B(x, 5r n ) ∪ B(x , 5r n ), and all pairs (x, x ) ∈ E n (S, S c ), since d(x, x ) ≤ 4r n for such pairs. Note that (4.10), combined with the doubling property of μ, also allows us to replace the denominators in (4.9) by some comparable quantities, as indicated by (4.10), for example Evidently, the proof of (4.7) should somehow use our only assumption: the Poincaré inequality (1.1) with p = 1. To this end, we define a Lipschitz function u = u n : B 0 → R associated to the cut (S, S c ), using a Lipschitz partition of unity on B 0 , subordinate to the cover B n . For x ∈ V n , let Then 2r n ), (4.12) and ψ x and is (C/r n )-Lipschitz on B 0 : this is easy to check, noting that by (4.2) and the bounded overlap of the balls in B n . Evidently, so the family {ψ x } x∈V n is the partition of unity on B 0 we were after. We set Evidently, u takes values in [0, 1], and is L n -Lipschitz on B 0 for some L n ∼ 1/r n . For y ∈ X and any subset U ⊂ V n , write Clearly S(y), S c (y) ⊂ V n (y) and V n (y) = S(y) ∪ S c (y) for all y ∈ X . Proof If u(y) = 1, then .
which forces S(y) = V n (y). The converse implication is clear. If u(y) = 0, then ψ x (y) = 0 for all x ∈ S, so S(y) = ∅. Consequently, V n (y) ⊂ S c , as claimed. The converse implication is again clear.

Corollary 4.3 We have u(s) = 1 and u(t) = 0.
Proof This is, in fact, a corollary of Lemma 4.2 and (4.9). Start with s: if u(s) < 1, then φ x (s) > 0 for some x ∈ S c , hence s ∈ B(x, 2r n ) by (4.12). On the other hand, s ∈ S (by the very definition of a cut), so the fact that s ∈ spt ψ x ⊆ B(x, 2r n ) implies (s, x) ∈ E n (S, S c ). This contradicts (4.9) as soon as C ≥ 2, and hence we deduce that u(s) = 1.
The treatment of t is essentially symmetric: if u(t) > 0, then φ x (t) > 0 for some x ∈ S. But since t ∈ S c , this implies that (x, t) ∈ E n (S, S c ), again violating (4.9).
Next, still using Lemma 4.2, we investigate where Lip(u, y) = 0. where Bd(S) := {x ∈ S : ∃ x ∈ S c such that (x, x ) ∈ E n }, Proof Pick y ∈ B 0 with Lip(u, y) = 0. We claim that this has the following consequence: for all x ∈ V n (y), the set N (x) := {x} ∪ {x ∈ V n : (x, x ) ∈ E n } intersects both S and S c .
Assume to the contrary that there is some x ∈ V n (y) with N (x) ⊂ S or N (x) ⊂ S c : we start with the case N (x) ⊂ S. Pick z ∈ B 0 ∩ B(x, 2r n ) arbitrarily, and consider any x ∈ V n (z). Then z ∈ B(x , 2r n ) by definition, so This shows that V n (z) ⊂ S, hence u(z) = 1 by Lemma 4.2. But z ∈ B 0 ∩ B(x, 2r n ) was arbitrary, so we have inferred that u ≡ 1 on the neighbourhood B 0 ∩ B(x, 2r n ) of y. In particular Lip(u, y) = 0, a contradiction.
Next, consider the case N (x) ⊂ S c . As before, pick z ∈ B 0 ∩ B(x, 2r n ) arbitrarily, and deduce as above that x ∈ S c for all x ∈ V n (z). This implies by Lemma 4.2 that u(z) = 0, and hence u ≡ 0 on B 0 ∩ B(x, 2r n ). This contradicts Lip(u, y) = 0. Now that we have proven the claim in italics, we finish the proof of the lemma. Fix y ∈ B 0 with Lip(u, y) = 0, pick any x ∈ V n (y), and assume first that x ∈ S. Then there exists x ∈ S c with (x, x ) ∈ E n . Hence x ∈ Bd(S) by definition, and y ∈ B(x, 2r n ) ⊂ B(x, 5r n ), as claimed. Next, if x ∈ S c , then we have shown that there exists x ∈ S with (x , x) ∈ E n . This means that x ∈ Bd(S). Since B(x, 2r n ) ∩ B(x , 2r n ) = ∅, we infer that y ∈ B(x , 5r n ), and the proof is complete.
We extend u to an L n -Lipschitz map X → R without change in the notation. Then, we note that (u, Lip(u, ·)) is a function-upper gradient pair on X , and we apply Theorem 9.5 in [8], more precisely the implication "(4) ⇒ (2)", which requires the space (X , d) to be geodesic. This implication gives the following estimate: d(s, y)) assuming that s, t are "deep enough inside" the ball B 0 . This can be arranged by choosing C 0 ≥ 1 in the definition of B 0 large enough. Then, from Lemma 4.4, we obtain further Using the definition of Bd(S), and recalling (4.10)-(4.11), we may continue the estimate (4.13) as follows: d(s, x)) recalling (4.8) in the last inequality. This proves (4.7). By multiplying the c n by a constant (rational) factor, we may now arrange c n (S, S c ) ≥ 1 for all cuts (S, S c ) with s ∈ S and t ∈ S c . Then, we are in a position to apply the max flow-min cut theorem: there exists a flow f n : E n → R such that f n ≥ 1. Moreover, recalling (4.6), the norm of the flow f n is bounded from above by the capacity of the cut ({s}, V n \ {s}). Since there are only boundedly many edges in E n of the form (s, x), x ∈ V n , and the capacity of each one of them is c n (s, x) ∼ 1, we get f n ∼ 1. (4.14)

Currents
In this section, we use the flow f n constructed above to find a metric current T n supported in a neighborhood of B 0 . We define the current T n as follows. For all edges e = (x, x ) ∈ E n , write I e := [0, d(x, x )], and let γ e : I e → X be an isometric embedding with γ e (0) = x and γ e (d(x, x )) = x . Then H 1 (γ e (I e )) = d(x, x ) ∼ r n . We define where I e is the current discussed in Example 2.6. First, we compute the boundary of T n , based on the facts that the boundary operation is linear, and we already know (recall (2.4)) the boundary of each term γ e I e : (4.15) To simplify the expression further, we use the flow property (F2) of f n , which says that It follows, using also the flow property (F1), namely f (x, y) = − f (y, x), that if x ∈ V n \ {s, t}, then the terms in (4.15) containing δ x cancel out: Consequently, all that remains in (4.15) are the terms containing s and t: Recalling (4.14), this yields that which in particular verifies that T n is a normal current. Next, we estimate the measures T n and find a uniform upper bound for T n (X ). We recall from (2.3) that γ I e = H 1 γ e (I e ) . It follows that Recalling that | f n (e)| ≤ c n (e) (using the flow property (F3) and the fact that c n (x, x ) = c n (x , x) for all (x, x ) ∈ E n ), we may now easily estimate T n (B) from above for all balls B = B(x, r ) ⊂ X with r ≥ r n . We claim that d(s, y)) d(t, y) But if B intersects γ e (I e ) for an edge e ∈ E n (s), then 10B contains B(s, r n ), and the second term above is bounded from above by the right hand side of (4.19): d(s, y)) ≤ 10B 1 (s, d(s, y)) d(t, y)) dμ(y), using in the first inequality that d(s, y) ∼ r n for y ∈ B(s, r n ) \ B(s, r n /2) =: A(s, r n ), and μ(A(s, r n )) ∼ μ(B(s, r n )) by the doubling hypothesis (this also requires A(s, r n ) = ∅, which easily follows from the path connectedness of (X , d); see also [9, (8.1.17)]). We may dispose similarly of the situation where B meets γ e (I e ) for some e ∈ E n (t) (defined in the same way as E n (s)). In other words, it remains to estimate the sum : γ e (I e ) ∩ B = ∅}. We used in (4.20) that To proceed, we recall again that every x ∈ V n only has boundedly many neighbours in G n , and all the vertices x ∈ V n with at least one edge (x, y) ∈ E n (B) must lie at distance ≤ r n from B, and at distance ≥ 5r n from {s, t}. We denote the collection of such vertices by V n (B). The observations above, and the bounded overlap of the balls B(x, r n ), x ∈ V n , allow us to continue (4.20) as follows: (4.20) Here we used, once again, that d(s, y) ∼ d(s, x) and d(t, y) ∼ d(t, x) for all y ∈ B(x, r n ), whenever dist(x, {s, t}) ≥ 5r n . This concludes the proof of (4.19). Finally, since the sets γ e (I e ), e ∈ E n , are geodesics connecting vertices in V n , we infer that spt T n = spt T n ⊂ B(s, C 0 d(s, t) + 5r n ) ⊂ 2B 0 .
In particular, the supports of the currents T n are contained in the fixed compact set 2B 0 . Moreover, noting that 20B 0 = B(s, 20C 0 d(s, t)) ⊂ B(t, 21C 0 d(s, t)), we can write either For j ∈ N fixed, we can use the doubling property of the measure μ to estimate d(s, y) dμ(y) μ (B(s, d(s, y) and a similar bound holds with s replaced by t. Hence, using first (4.19), and then splitting the integration domain as in (4.21), we obtain the following uniform upper bound for the masses of the currents T n : d(s, y)) d(t, y)) dμ(y) Recalling also (4.17), we are now in a position to use the compactness theorem for normal currents, Theorem 2.7: there exists a normal current T , supported onB 0 , such that lim m→∞ T n m (g, π) = T (g, π), for some subsequence (n m ) m∈N . From the proof of the compactness theorem [1, Theorem 5.2] in the paper of Ambrosio and Kirchheim, in particular " Step 2", one can read that the measure T is bounded from above by a certain measure which is obtained as a weak limit of the measures T n m . As a consequence, we infer that (4.19) holds for the measure T , and for all balls B(x, r ) ⊂ X . This fact, combined with the Lebesgue differentiation theorem, shows that T is absolutely continuous with respect to the measure μ, with Radon-Nikodym derivative bounded by d(t, x)) .
So, to conclude the proof of Theorem 4.1, it remains to show that ∂ T = Cδ t − Cδ s for some constant C ∼ 1. From (4.23) we infer that Apply this to a bump function g satisfying g(t) = 1 and g(s) = 0 to find that the numbers f n m ∼ 1 converge to a limit C = ∂ T (g), which evidently also satisfies C ∼ 1. Thus ∂ T (g) = Cg(t)−Cg(s) for all g ∈ Lip b (X ), which by definition means that ∂ T = Cδ t −Cδ s . Finally, to be precise, the current mentioned in the definition of generalised pencil of curves can be obtained by dividing T by C. The proof of Theorem 4.1 is complete.

GPC and pencils of curves
In this section, we prove Theorem 1.4. As explained in the introduction, the implication X admits PCs ⇒ X satisfies the weak 1 − Poincaré inequality is due to Semmes for Q-regular spaces (X , d, μ), see [15,Theorem B.15], and a proof of the general case can be found in [8,Chapter 4]. So, we concentrate on the reverse implication. By the main result of this paper, Theorem 1.3, it suffices to verify the following: X admits GPCs ⇒ X admits PCs.
The proof is a straightforward application of a decomposition result [13, Theorem 5.1] of Paolini and Stepanov, which we now recall for the reader's convenience. Let C, T be 1currents on X . We say that C is a subcurrent of T , denoted C ≤ T , if T − C (X ) + C (X ) ≤ T (X ).
We say that C is a cycle of T , if C ≤ T and ∂C = 0. A 1-current T is acyclic, if its only cycle is the trivial 1-current C = 0.
By a curve in X , we mean the image of a Lipschitz map θ : [0, 1] → X . The space of curves in X is denoted by . We slightly abuse notation by using the letter θ to denote both Lipschitz mappings [0, 1] → X , and elements in . There is a natural metric d on , defined in [13, (2.1)], and Borel sets in are defined using the topology induced by d . Following the terminology above [13, (4.1)], a finite positive Borel measure on is called a transport. If θ ∈ has an injective parametrisation, then θ is called an arc.
By [13, Theorem 5.1], a normal acyclic 1-current T on X is decomposable in arcs. Combining [13,Definition 4.4] and [13,Lemma 4.17], this means that there exists a transport η on such that η almost every curve in is an arc, and moreover the following equalities hold: If the reader checks carefully [13,Lemma 4.17], then she will find the measure "μ [[θ ]] " (in our notation θ [[0, 1]] ) in place of "H 1 θ " in (5.1), but these measures coincide if θ is an arc. Indeed, in that case [14,Lemma 2.2] shows that θ [[0, 1]] = θ (|θ|L 1 ), where |θ | denotes the metric derivative. Then it can be seen for instance by [2, Theorem 4.1.6] that θ (|θ |L 1 ) agrees with H 1 θ . Now, we apply the decomposition result to our concrete situation. Assume that s, t ∈ X , and T is a GPC joining s to t, as in Definition 1.2. There is no guarantee that T is acyclic, but [13, Proposition 3.8] comes to our rescue: it gives a cycle C ≤ T such that T = T − C is acyclic. Clearly Moreover, T + C = T by [13, (3.1)], so in particular T ≤ T . It follows that T is an acyclic GPC joining s to t. With this argument in mind, we may assume that T was acyclic to begin with.
Hence, a decomposition as in (5.1)-(5.2) exists. In particular, (5.2) implies that  s, d(s, y)) + g(y) (t, d(t, y)) dμ(y), taking into account that spt T ⊂ B(s, C 0 d(s, t)) by (P2). The only point we are still missing from Definition 1.1 is the claim that the arcs in s,t are quasiconvex. This need not be true to begin with, but we note that

T (X ) d(s, t).
This can be easily seen from (P2)-(P3). Alternatively, our specific construction for T gives this estimate, see (4.22). So, it follows from (5.1) that half of the arcs θ ∈ , relative to the measure η, satisfy the quasiconvexity requirement H 1 (θ ) d(s, t). The proof is now completed by restricting s,t to this "good half" of the arcs.