Asymptotic properties of welfare relations

We introduce and discuss notions of efficiency in the aggregation of infinite utility streams. For any utility streams x and y, our efficiency criteria roughly require this: If a utility stream x dominates another utility stream y and if the asymptotic density of the set of coordinates in favor of x is strictly positive, then x is socially preferred to y. As a robustness check of the proposed efficiency axioms we explore the consistency of the axioms with notions of equity. Our main results characterize one period utility domains, i.e., the set of utilities Y attainable by each generation, admitting a social welfare aggregator with the desired properties.


854
H. Petri 2009; Mitra 2011, 2015), a fundamental problem with this approach is that the Pareto axiom is generally inconsistent with equity as formalized by anonymity. 1 This will be discussed in more detail later in the introduction. To circumvent the problem we propose weaker versions of some well-known Pareto axioms. For any utility streams x and y, our criteria roughly speaking require this: If a utility stream x dominates another utility stream y and if the (lower asymptotic) density of the set of coordinates in favor of x is strictly positive, then x is socially preferred to y.
A crucial ingredient in our formalization of efficiency is the notion of asymptotic density (or natural density), which is a notion designed to measure how large certain subsets of the natural numbers are. It formalizes the intuition that the set of even numbers is larger than the set of multiples of three, even though there is a one to one correspondence between them (both are countable). Heuristically, if we let the set of natural numbers have measure one, the even numbers should have measure 1 2 , since "half" of the members of N are even, and similarly the set of multiples of three should be assigned measure 1 3 . Part of our motivation is that existing notions of efficiency, as formalized by various Pareto principles, are economically either too strict or too weak. Crespo et al. (2009) argue that the strong Pareto axiom is too strict since the welfare of a society should not be influenced by the utility of a single generation. In consequence they introduce the infinite Pareto principle. 2 But even infinite Pareto seems too strict economically since, intuitively, the welfare of a society should not be affected by the utilities of certain "small" subsets of generations. To see this, suppose that any generation n with n = 10 k receive an increase in their utility. According to infinite Pareto the new stream of utilities should be ranked above the old stream. However, the distance between any consecutive pair of generations receiving a strict increase in utility goes to infinity as k increases. Hence, it is not clear that the new stream of utilities should be ranked strictly above the old stream.
The weak Pareto axiom takes the issues mentioned in the previous paragraph into account and demands that if every generation is strictly better off then society should be strictly better off. Hence, it is insensitive to an increase in the utilities of a "small" subset of generations. However, this axiom seems too weak economically. Suppose for example that every second generation, n = 2k for k ∈ N, receives an increase in their utility and every other generations' utility remains the same. Then, it seems intuitively clear that the former stream should be ranked above the latter; however, the weak Pareto axiom does not necessarily see the difference.
As a suggested remedy to the issues mentioned above, we propose a criterion that we call asymptotic Pareto. It is intermediate in strength between infinite Pareto and weak Pareto. Roughly speaking, it requires the following: If every generation receives a higher utility, and if every generation in a set of strictly positive lower asymptotic density receives a strict increase in utility, then society is better off.
In addition, we propose a weak version of asymptotic Pareto. Consider utility streams x = (1, 1, 1, 1, 1, 1, 1, . . .) and y = (1, 0.99, 1, 0.999, 1, 0.9999, 1, . . .). According asymptotic Pareto x is socially preferred to y. But since, for any given threshold, there are at most a finite number of generations receiving an increase above the threshold it is not clear that x should be ranked above y. Weak asymptotic Pareto takes this into account by ranking a stream of utilities above another stream only if a subset of generations with positive lower asymptotic density receive an increase exceeding some fixed threshold ε > 0.
Due to its intuitive interpretation, asymptotic density has gained considerable interest as a tool in the theory of social welfare aggregation. Notable are the papers by Lauwers (1998), Lauwers (2011) and Fey (2004Fey ( , 2005. Fey (2004) characterizes majority rules with infinitely many voters, and uses asymptotic density to measure the size of large societies. In his characterization, Fey (2004) uses a criterion called density positive responsiveness, which requires ties to be broken if a set of voters with positive asymptotic density change their preference. The criterion that we propose is also sensitive to societies of positive asymptotic density. Lauwers (1998) considers an equity principle based on asymptotic density, bounded anonymity. He restricts attention to linear social welfare functions and discusses the compatibility of bounded anonymity with efficiency. One implication of his work is that, although strong Pareto is generally incompatible with bounded anonymity, a weak form of the Pareto axiom is not. We discuss the relation between our and his results further below.
The conflict between equity and efficiency is well known in the literature on intertemporal welfare economics (Koopmans 1960;Diamond 1965;Basu and Mitra 2003). It has been noted that equity, as formalized by anonymity, generally is inconsistent with the Pareto principle. Basu and Mitra (2003) show that there is no social welfare function with these properties. Even if one restricts attention to social welfare orders, anonymity and Pareto, implies the existence of a non-Ramsey set, and is thus a non-constructive object (Lauwers 2010). The literature has found several ways around the problems posed above. For instance, one could agree to drop the completeness axiom and several interesting relations emerge satisfying Pareto and anonymity. See for instance Bossert et al. 2007;Zuber and Asheim 2012) and references therein. Alternatively one could consider other versions of equity and efficiency as in , Mitra (2011, 2015) and Alcantud (2012Alcantud ( , 2013. Our proposed solution is to consider weakened versions of the Pareto axiom.
As a robustness check of our efficiency axioms and as a main goal of the paper, we investigate the "degree of conflict" between the proposed efficiency principles and various notions of equity. The paper is divided into two parts.
In the first part of the paper, we characterize one period utility domains Y admitting a social welfare function satisfying asymptotic Pareto and finite anonymity. Thus, we identify the exact limitations imposed by our axioms on the domain of a prospective social welfare function. The results are analogous to the results obtained in Dubey and Mitra (2011) and Dubey and Mitra (2015).
In the second part of the paper, we then proceed to derive limitations imposed on Y by a social binary relation satisfying asymptotic Pareto and bounded anonymity. We do not impose any explicit transitivity/completeness requirements on welfare relations considered in this part of the paper.
To see why it may be of economic interest to consider bounded anonymity, in addition to finite anonymity, note that finite anonymity only requires every single generation to count the same in social evaluation. However, it does not necessarily require sets of generations with "equal size" to count the same. Consider for example utility streams x = (1, 0, 1, 0, 1, . . .) and y = (0, 1, 0, 1, 0, . . .). A strict preference between x and y is consistent with finite anonymity. But intuitively it could be argued that these two sequences should be regarded as equally important, since in both cases "half of the generations" receive a utility of one. Bounded anonymity demands a social welfare order to be left invariant by permutations switching subsets of equally large lower asymptotic density. Thus bounded anonymity implies that society regards x and y as equally important.
Since every function is a binary relation, one would expect the conditions on Y derived in the second part of the paper to be more permissive than the corresponding conditions obtained in the first part of the paper. The answer to this question depends on whether we impose finite or bounded anonymity as an axiom on welfare aggregators. By theorem 2 in Svensson (1980), there is a social welfare relation satisfying finite anonymity and (asymptotic) Pareto on arbitrary domains Y ⊆ [0, 1]. However, by assuming bounded anonymity, it turns out that the domains Y admitting a binary relation satisfying bounded anonymity and asymptotic Pareto exactly coincides with domains Y admitting a social welfare function satisfying finite anonymity and asymptotic Pareto.
A corollary to the results discussed above is that there is a social welfare function satisfying bounded anonymity and asymptotic Pareto if and only if there is a binary relation with these properties. This result is in quite sharp contrast to previous results in the literature. For example, Dubey and Mitra (2011) derive characterizing conditions on Y such that Y admits a social welfare function satisfying weak Pareto and finite anonymity. However, for all subsets Y that fail to admit such a function there is a social welfare relation with the desired properties (theorem 2 in Svensson 1980). The paper is organized as follows. Preliminaries are in Sect. 2. The model and efficiency axioms are introduced and discussed in Sect. 3. Section 4, the first part of the paper, is devoted to the discussion of the consistency between asymptotic Pareto and anonymity. The second part of the paper, Sect. 5 then discusses the consistency of bounded anonymity with our proposed efficiency principles. We conclude in Sect. 6.

Notation and preliminaries
Notation: A binary relation on a set X is a subset ⊆ X × X . As usual, we denote by ∼ the symmetric part of and by the asymmetric part of . Bold letters N, Z and R are used to denote the set of natural numbers, integers and real numbers. It is assumed that 0 / ∈ N. For every n ∈ N we set [1, n] := {1, . . . , n}. A set X with order X is order isomorphic to a set Y with order Y if and only if there is a bijective function f : X → Y such that x X y if and only if f (x) Y f (y). We will denote by w the natural numbers with canonical order ≥ and by w * the natural numbers with reverse order ≤ (defined by y ≤ x if and only if y ≥ x for all x, y ∈ X ). Alternatively, w * can be defined as the set of negative integers M with order inherited from Z.
Asymptotic density: We recall some basic notions from the theory of uniformly distributed sequences and natural densities. For a thorough account see Kuipers and Niederreiter (2012). As mentioned in the introduction, the asymptotic density of a set is designed to capture our intuition that the set of even numbers has "half the size" of the set of natural numbers. Let |A| denote the cardinality of a finite set A. The lower (upper) asymptotic density of a set of natural numbers is defined as: , which is the asymptotic density of A. The collection of sets with an asymptotic density is denoted A. For a large class of sets, the asymptotic density is not defined, the collection A is not a Boolean algebra and d is not a finitely additive measure. However, by use of the Hahn Banach theorem, it is possible to extend d to a finitely additive density measure 3 defined on the algebra of all subsets of natural numbers. Another approach is to use free ultrafilters as outlined in Fey (2005) and Lauwers (1998). Also note that the lower (upper) asymptotic density is defined for all subsets of natural numbers.
for all a, b ∈ [0, 1]. An example of a uniformly distributed sequence, is the binary Van der Corput sequence, defined as follows: For every n ≥ 2 let n − 1 = k i=0 a i 2 i be the binary expansion of n − 1 and set x n := k i=0 a i 2 i+1 and x 1 := 0. The binary Van der Corput sequence plays a crucial role in the proof of Lemma 4.5. It is a standard fact in the theory of uniformly distributed sequences that the binary Van der Corput sequence is uniformly distributed modulo 1. 4 Permutations: A permutation is a bijective function π : N → N. A permutation π : N → N is a finite permutation if there is a n ∈ N, such that π(k) = k for all k ≥ n, i.e., π "switches" a finite number of coordinates. A permutation π : N → N is a bounded permutation if lim n→∞ |{k : k ≤ n < π(k)}| n = 0.
Roughly speaking, a bounded permutation switches subsets of equally large asymptotic density. The permutation π : N → N defined by π(1) = 1, π(n) = n + 1 if n is even and π(n) = n − 1 otherwise (i.e., swapping the odd and even numbers, except n = 1) is a bounded permutation. The set of all bounded permutations is denoted by G. Similarly, we denote the set of all finite permutations by G f . For every sequence x = (x n ) and permutation π : N → N we let, with a slight abuse of notation, π • x denote the sequence (x π(n) ) obtained after permuting the coordinates of x.

Welfare aggregators and axioms
In this section, we define welfare aggregators on infinite utility streams, and then move on to discuss axioms for such welfare aggregators.
Let Y ⊆ R be a non-empty set of utilities attainable by each generation. Then and, for all n ∈ N, x n ∈ Y is the utility experienced by generation n. A social welfare function (SWF) is a function W : X → R, a social welfare order (SWO) is a reflexive, transitive and complete order O on X . Similarly a binary welfare relation (BWR) is a binary relation R on X . A distinguishing feature of a binary welfare relation, compared to any other binary relation, is its domain of definition X .

Axioms and discussion
We introduce some axioms for binary welfare relations. Since every social welfare function/order is a binary welfare relation, whenever we say that a social welfare function/order satisfies a certain axiom, we mean that the induced binary welfare relation satisfies it. A list of efficiency (Pareto) axioms, roughly ordered in decreasing order of logical strength, is now given: Some other axioms that we will use/discuss are listed below.
We comment on some simple relationships between the axioms. It is clear that P ⇒ IP ⇒ AP ⇒ WAP, and that AP ⇒ WP. However, the relationship between WP, AP and WAP is a little subtle. Consider for example utility streams and 0 (where 0 is the utility stream with all one period utilities equal to zero). A social welfare function satisfying WP or AP ranks x above 0. But an SWF satisfying WAP is not necessarily able to rank x above 0: for every ε > 0 there are at most finitely many i ∈ I such that x i > ε, and since every finite subset of natural numbers has lower asymptotic density zero, the hypothesis of WAP does not hold. An example of a social welfare function satisfying WAP and x ∼ 0 is the function in Sect. 4.1, equation (1). None of the implications above can be reversed without adding additional hypotheses. For instance, if Y is finite then a social welfare function W : X → R satisfies WAP if and only if it satisfies AP.
In Basu and Mitra (2003) it was shown that there is no social welfare function satisfying anonymity A and Pareto P. If we agree that an SWF should satisfy the finite anonymity axiom A, then in light of the impossibility results by Basu and Mitra (2003), we should look for a weakening of the Pareto axiom. Several weakenings of the Pareto axiom have been considered in the literature, such as the infinite Pareto axiom (IP) in Crespo et al. (2009). Even though IP, a priori, seems like a considerably weaker condition than P, the quite surprising result by Crespo et al. (2009) shows that there is no social welfare function satisfying infinite IP and A. Another very weak version of the Pareto axiom, the weak Pareto axiom, was studied in Dubey and Mitra (2011), where one period utility domains Y , admitting an SWF satisfying WP and A, were characterized. Asymptotic Pareto fits in between weak Pareto WP and infinite Pareto IP in logical strength, and hence we expect a characterizing condition on Y to be stronger than the condition in Dubey and Mitra (2011). As we will show finite Y is both necessary and sufficient for the existence of a social welfare function satisfying asymptotic Pareto AP and anonymity A. Lauwers (1998) mentions an efficiency concept similar to weak approximate Pareto WAP, which we state below.

LWAP Lauwers' weak asymptotic Pareto
For all x, y ∈ X , if x ≥ y and there exists a subset A of N with d(A) > 0 and an ε > 0 such that Note that LWAP is verbatim identical to WAP, except that the occurrence of lower asymptotic density d is replaced with asymptotic density d. Our efficiency principle is less permissive than Lauwers' since any social welfare function satisfying WAP satisfies his efficiency axiom. However, WAP imposes a similar restriction on one period utility domains, as Lauwers' criteria does.
The following axiom corresponds to our AP-axiom but replaces lower asymptotic density with asymptotic density.
Axiom dAP is not considered by Lauwers (1998). He deals with welfare aggregators defined on bounded sequences (with ranges x(N) that are possibly infinite.) Adopting the arguments in the present paper one can show that there is no welfare function satisfying dAP and A on the set of bounded sequences. This may be why axiom dAP is not discussed by him.

Part 1: The conflict between finite anonymity and efficiency
In this section, we characterize one period utility domains Y admitting a social welfare function satisfying (weak) asymptotic Pareto and anonymity. The theorem below summarizes the main results of part 1 of the paper.
1. There is a social welfare function W : X → R satisfying asymptotic Pareto AP and anonymity A if and only if Y is finite. 2. There is a social welfare function W : X → R satisfying weak asymptotic Pareto WAP and anonymity A if and only if Y is bounded.
The theorem above is convenient in that it helps to identify domains admitting a social welfare aggregator satisfying asymptotic Pareto and anonymity. It also serves as a consistency check of the proposed efficiency axioms, since it is not a priori clear that a social welfare aggregator satisfying these properties exists. Before proving Theorem 4.1, we give some examples illustrating the usefulness of the result.
Clearly Y is not finite and hence by Theorem 4.1 it follows that there is no SWF satisfying AP and A on Y . However, since Y is a bounded subset of R, by weakening AP to WAP, we see by Theorem 4.1 again, that there is an SWF satisfying A and WAP.
Then Y is neither finite nor bounded. Hence, there is no social welfare function satisfying (weak) asymptotic Pareto WAP and anonymity A on Y .
Example 4.3 Let Y = N and let W : X → R be a social welfare function satisfying anonymity. Then W : X → R cannot satisfy either AP or WAP.
We proceed to discuss the proof of Theorem 4.1. The first subsection (section 4.1) proves the "if"-direction of the claim by giving an example of a social welfare function with the stated properties. In the second subsection (Sect. 4.2), we discuss the other direction of Theorem 4.1 by deriving the exact limitations imposed on Y by a social welfare function satisfying A and AP.

Positive results
The main goal of this section is to exhibit an example of a social welfare function W : Y N → R satisfying anonymity A and asymptotic Pareto AP (WAP) on finite (bounded) domains Y .
Let W n (x) := 1 n n k=1 x k for all n ≥ 1 and x ∈ X . Our candidate social welfare function, satisfying anonymity A and asymptotic Pareto AP, is the function W : X → R defined by: for all x ∈ X . Note that W : X → R is well defined whenever Y is bounded. 5 It is easy to see that W (x) satisfies finite anonymity A: The limit inferior of a sequence does not depend on the values assumed by a finite number of its terms. In Proposition 4.3, we show the stronger claim that W satisfies bounded anonymity BA. We will discuss the consistency of BA with AP and WAP further in section 5.
In part 1 of Proposition 4.3, we show that W : X → R satisfies WAP and BA whenever Y ⊆ R is bounded. The existence of a social welfare function satisfying AP and BA on finite Y is then derived as a corollary in part 2 of the proposition.
In our proof that W : X → R satisfies asymptotic Pareto and bounded anonymity we will need Lemma 4.2, showing that the Cesáro mean, lim n→∞ 1 n n k=1 x k , of a sequence x ∈ X , with bounded one period utilities, is invariant under the action of bounded permutations: We provide a Proof of Lemma 4.2 in Appendix A.1. We are now ready to give our main result of this section.
1. If Y is bounded then W : X → R satisfies bounded anonymity BA and weak asymptotic Pareto WAP. 2. If Y is finite then W : X → R satisfies bounded anonymity BA and asymptotic Pareto AP.
Proof (Part 1) Weak asymptotic Pareto: Assume that x, y ∈ X are such that x i ≥ y i for all i ∈ N and that there is a subset A of N with d(A) > 0 and an ε > 0 such that  Rudin (1964), [Ex.5,p.78] it follows that lim sup(x n + y n ) ≤ lim sup x n +lim sup y n . Hence by noting that lim inf x n = − lim sup −x n for all sequences (x n ) we have lim inf(x n + y n ) = − lim sup −(x n + y n ) ≥ − lim sup −x n − lim sup −y n = lim inf x n + lim inf y n .
Bounded anonymity: Let π ∈ G, then by Lemma 4.2 it follows that lim n→∞ (W n (x)− W n (π • x)) = 0, but then also lim inf n→∞ (W n (x) − W n (π • x)) = 0, and hence W (x − π • x) = 0. Similar reasoning gives W (π • x − x) = 0. By super additivity of limit inferior we have (Part 2) This part of the proposition follows immediately by part 1 and by noting that if Y is finite then there is an ε > 0 such that |x − y| > ε for all distinct x, y ∈ Y .
There are many other social welfare functions satisfying A and AP. By use of the Hahn Banach theorem, it is possible to define a welfare function by letting W (x) = xdμ, where μ : 2 N → [0, +∞] is a density measure.

Negative results
The result in Sect. 4.1 implies that there is a social welfare function satisfying AP (WAP) and A on X = Y N whenever Y is finite (bounded). The main result of this section, Proposition 4.4, shows that finite (bounded) Y is also necessary for the existence of a social welfare function with the desired properties. This completes the proof of Theorem 4.1.
1. If there is a social welfare function W : X → R satisfying asymptotic Pareto AP and anonymity A then Y is finite. 2. If there is a social welfare function on W : X → R satisfying weak asymptotic Pareto WAP and anonymity A then Y is bounded.
To prove Proposition 4.4, part 1, we first note that every infinite subset Y of R contains a subset order isomorphic to w or w * (see Lemma A.3 in Appendix A.3). The existence of an SWF W : X → R satisfying A and AP on X with infinite Y then implies the existence of an SWF with the same properties on X = Y N where Y is the set of natural numbers N. The main technical difficulty is then to show Lemma 4.5 implying that there is no SWF satisfying A and AP whenever Y = N.
Part 2 of Proposition 4.4 follows using similar arguments as in part 1. First Lemma A.4 in Appendix A.4 shows that every unbounded subset of R contains a subset order isomorphic to w or w * without any accumulation points. Using this, the existence of an SWF satisfying WAP and A on an unbounded subset Y of R implies the existence of an SWF with such properties on X = Y N where Y = N. Hence, as for part 1, the proof of part 2 reduces to showing Lemma 4.5. We now state Lemma 4.5 and give some comments on the strategy of proof. The full Proof of Lemma 4.5 is in Appendix A.2. The technique is inspired by a similar technique in Dubey and Mitra (2011), which in turn is a (very) refined version of an argument, attributed to Debreu (1954), showing that the lexicographic order on R 2 is not representable by a utility function. The basic idea of proof is the following. By using asymptotic Pareto and finite anonymity, for every α ∈ (0, 1) we construct sequences x(α), z(α) ∈ X such that W (z(α)) > W (x(α)) and W (x(β)) > W (z(α)) whenever 1 > β > α.
The sequences constructed above and a standard argument Debreu (1954) then implies an injection from R to Q, contradicting countability of Q. More precisely the argument goes as follows. For every t ∈ (0, 1) define an interval [W (x(t)), W (z(t))]. Since W (z(t)) > W (x(t)) the interval is non-empty and by density of the rational numbers we may pick a rational number q t ∈ [W (x(t)), W (z(t))] for every t ∈ (0, 1). Define a function f : (0, 1) → Q by f (t) := q t . We claim that f is injective. Let s > t then W (x(s)) > W (z(t)) and hence [W (x(t)), W (z(t))] and [W (x(s)), W (z(s))] are disjoint, in turn implying that q s = q t . Thus f is an injection from (0, 1) to Q.
We briefly explain how the technique used to prove the impossibility result in Dubey and Mitra (2011) is adapted to our setting. In their proof subsets A(t) of N corresponding to Dedekind cuts are used, i.e. subsets of the form A(t) = {n ∈ N : r n ∈ [0, t)} for t ∈ R where (r n ) is some enumeration of the rational numbers. These sets have the property that A(t)\A(s) is infinite whenever s < t. 7 However, for our purposes an even stronger property is needed. We would like to find an uncountable collection of sets A(t) such that A(t)\A(s) has positive asymptotic density whenever s < t. The solution is to let (r n ) not just be any enumeration of the rational numbers, but a specific one, the binary Van der Corput sequence (d n ). As explained in section 2 the binary Van der Corput sequence is uniformly distributed modulo 1 (by well-known results), and hence sets of the form A(t) := {n ∈ N : d n ∈ [0, t)} have the desired property. These sets are then used to define sequences x(α), z(α) ∈ X with properties mentioned above.
By inspecting the Proof of Lemma 4.5 in Appendix A.2, it is evident that we only need to use asymptotic density d (instead of d as in the definition of AP) in order to derive a contradiction. Hence, Lemma 4.5 directly implies that no social welfare function satisfying A and LWAP exists for Y = N. It is clear that if an SWF is such that it satisfies WAP then it satisfies LWAP (Since if d(A) > 0 then d(A) > 0). Hence, the SWF constructed in Proposition 4.1 satisfies LWAP. It follows that the characterizing condition on Y such that Y admits an SWF satisfying LWAP and A is identical to the characterizing condition on Y such that Y admits an SWF satisfying WAP and A.

Part 2: The conflict between bounded anonymity and efficiency principles
We study the compatibility of bounded anonymity with efficiency principles introduced in Sect. 3. Bounded anonymity is a stronger axiom than anonymity, and hence we expect bounded anonymity to put a harsher restriction on one period utility domains admitting a social welfare function. This is, however, not the case since Proposition 4.3 implies that there is a social welfare function satisfying BA and AP if Y is finite. The channel in which BA limits the possibility of a welfare aggregator is another one: It turns out that BA limits the domains Y admitting a binary welfare relation. We characterize one period utility domains admitting a binary welfare relation satisfying bounded anonymity and asymptotic Pareto. In Appendix B, we show that a similar characterization holds in the setting of Dubey and Mitra (2011), i.e., when weak Pareto WP is imposed. A quite remarkable consequence of the main result is that for a wide range of equity concepts X , the class of domains Y with a binary welfare relation satisfying BA and X coincides with the class of utility domains Y admitting a social welfare function satisfying BA and X . We summarize the main results of the second part of the paper in Theorem 5.1. The remainder of this section will be devoted to a proof of Theorem 5.1 and some implications/corollaries to the theorem.

There is a binary welfare relation R on X = Y N , satisfying bounded anonymity BA and approximate Pareto AP if and only if Y is finite. 2. There is a binary welfare relation R on X = Y N , satisfying bounded anonymity BA and weak approximate Pareto WAP if and only if Y is bounded.
We only give a full proof of part 1 of theorem 5.1. The proof of part 2 uses similar arguments and is in Appendix A.5. The idea of proof is simple. We exhibit two sequences x and y, such that x can be obtained from y using a bounded permutation, and such that x Pareto dominates y in the sense that a society of positive asymptotic density is strictly better off under x compared to y. Bounded anonymity then implies that x ∼ y, whereas asymptotic Pareto implies x y. This yields the desired contradiction.
Proof One direction follows by part 2 of proposition 4.3. To show the other direction of the characterization result, let X = Y N where Y is some infinite subset of R. Assume by way of contradiction that there is a binary welfare relation on X such that it satisfies BA and AP. Since Y has total order ≥ induced from R, by Lemma A.3 there is a subset Z ⊆ Y order isomorphic to w or w * . Assume that Z is order isomorphic to w. Then there is an order isomorphism f : N → Z . Define a binary welfare relation on X = N N by for all x, y ∈ X . Arguing as in the Proof of Proposition 4.4, part 1, it follows that satisfies asymptotic Pareto AP and bounded anonymity BA. If Z is order isomorphic to w * , one can similarily show that this implies the existence of a binary welfare relation on X = N N satisfying AP and BA.
Remark: If a binary welfare relation R satisfies (bounded) anonymity, then R is reflexive. Hence, it is implicitly assumed that R is reflexive in Theorem 5.1.
The results in Sect. 4.2 imply that there is a social welfare function satisfying BA and AP if and only if Y is finite. Thus we are naturally led to the question if there for every Y ⊆ [0, 1] is a social welfare order satisfying BA and AP. Theorem 5.1 shows that this is not the case. In fact, even if we lower our demands and hope for the possibility of a binary welfare relation R satisfying BA and AP, we hope for too much by Theorem 5.1.
Theorem 4.1 (together with Proposition 4.3) implies that there is a social welfare function satisfying BA and AP (WAP) if and only if Y is finite (bounded). The following is then an immediate corollary to Theorem 5.1.

Corollary 5.2 There is a binary welfare relation on X = Y N satisfying BA and AP (WAP) if and only if there is a social welfare function W : X → R on X , satisfying BA and AP (WAP).
Theorem 5.1 limits the domains Y admitting a binary welfare relation satisfying BA and AP (WAP). One may hope that relaxing BA by requiring A would make part of the negative result above go away. If we require a social welfare function satisfying A and AP, Theorem 4.1 implies that this is not the case. However, it may still be possible to find a binary welfare relation/order satisfying A and AP. Svensson (1980) shows, by use of the axiom of choice, that a social welfare order O satisfying A and P exists on arbitrary domains Y ⊆ [0, 1]. Hence, since P ⇒ AP, there is a social welfare order satisfying A and AP whenever Y ⊆ [0, 1]. welfare functions and/or relations satisfying efficiency and equity properties. Although perhaps mainly a technical endeavor, a discussion of welfare criteria is not really meaningful until the limitations imposed by them are known. First of all, it is important to know if there is any social welfare aggregator with the desired properties, since otherwise the properties are logically inconsistent. Once existence is established, it is nice to know whether it is possible to find such aggregators on arbitrary domains, or if not, what the exact limitations are. This perhaps has some technical value, but even normatively such a result could be useful, since it saves decision makers from engaging in a futile search for aggregation procedures that do not exist. A corollary to the results obtained in this paper is that there is a binary welfare relation satisfying bounded anonymity and (weak) asymptotic Pareto if and only if there is a social welfare function with such properties. It would be interesting to see if this result continues to hold for other equity notions as well. In Appendix, we verify that the result holds in the setting of Dubey and Mitra (2011), i.e., whenever the weak Pareto axiom is imposed.
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
Hence, since π is a bijection, it follows that k≤n:k=π(l),l≤n x k = k≤n:π(k)≤n x π(k) . (2) Let n ≥ N . Now rewrite the sum we wish to estimate as follows: We proceed to estimate the sum in (3) above.
The first (in)equality follows by equation (2). The second (in)equality follows by the triangle inequality and the fact that (x n ) is a sequence bounded by M ∈ R. The third in(equality) follows since π −1 ({k ≤ n : k = π(l), l > n}) ⊆ {k : π(k) ≤ n < k}. By the estimates above we have |W n (x) − W n (π • x)| < ε for all n ≥ N , so lim n→∞ (W n (x) − W n (π • x)) = 0, as we had to show!

A.2 Proof of Lemma 4.5
In the Proof of Lemma 4.5 we will need the following well-known result. (0, 1). The topological closure of (d n ) is the closed unit interval [0, 1].

Lemma A.1 The binary Van der Corput sequence (d n ) is uniformly distributed in the unit interval
Proof The proof follows by theorem 1.1 (page 89) together with theorem 3.5 (page 127) in Kuipers and Niederreiter (2012).
We will also need the following intuitive result about asymptotic densities:

Lemma A.2 If A ⊆ N is such that d(A) > 0, and B is a finite subset of A, then d(A\B) > 0.
Proof Straightforward and hence omitted.
We now give our Proof of Lemma 4.5.
Proof Assume Y = N and X = Y N and that there is a social welfare function W : X → R such that W is asymptotically paretian AP and anonymous A. We shall prove that this leads to a contradiction. Let (d n ) be the binary Van der Corput sequence, and for each real number t ∈ (0, 1) let A(t) := {n ∈ N : d n ∈ [0, t)} and B(t) := {n ∈ N : d n ∈ [t, 1)}.
We show that x n (β) ≥ x n (α) for all n ∈ N and x n (β) − x n (α) ≥ 2 for all n ∈ A(α) with n > N .
STEP 2: For each t ∈ (0, 1) define a sequence z(t) by: It is then evident that W (z(α)) > W (x(α)), since the asymptotic density of A(α) is greater than zero.
We claim that z (α) ≤ x(β). If n = l i for some i ∈ {1, . . . , m} then . The last inequality follows by the fact that for all m, k, l, n ∈ N if x k (t) = 2m + 1 and x n (t) = 2l + 1 with k > n then n m (t) = k > n = n l (t), and since the sequence (n k (t)) is increasing in k, this in turn implies that m > l . Hence, x k (t) = 2m + 1 ≥ 2l + 3 = x n (t) + 2.

A.3 Proof of Proposition 4.4 part 1
We will need the following elementary result from order theory in our proof of Proposition 4.4 part 1.

Lemma A.3
Every infinite set Y with total order 9 contains a subset order isomorphic to w or w * .
Proof If Y contains a countable well ordered set X then X has a subset X ⊆ X order isomorphic to w. To see this pick a minimal element x 1 ∈ X . Assume that x 1 , . . . , x n have been chosen such that for all k, l ∈ {1, . . . , n}: x k x l if and only if k > l, and such that x i+1 is minimal in X \{x 1 , . . . , x i } for all i ∈ {1, . . . , n − 1}. Let x n+1 be a minimal element in X \{x 1 , . . . , x n }. Then, since x n+1 ∈ X and x n+1 ∈ X \{x 1 , . . . , x i } for all i ∈ {1, . . . , n − 1}, it follows by the induction hypothesis that x n+1 x i for all i ∈ {1, . . . , n}. This defines a sequence (x n ) recursively. Let X = x(N). Then X is a subset order isomorphic to N.
If Y contains no countable well ordered set, then there is a countable subset Z ⊆ Y such that Z contains no smallest element. We may then recursively construct a sequence (x n ) in Z such that x 1 x 2 . . .. It then follows that x(N) with order is order isomorphic to w * .
We now give our Proof of Proposition 4.4 part 1: Assume there is a social welfare function W : X → R that satisfies asymptotic Pareto AP and finite anonymity A. Since Y is totally ordered by the natural order ≥ induced from R, by Lemma A.3 there is a subset Z ⊆ Y order isomorphic to w or w * . Assume Z is order isomorphic to w. Then there is an order isomorphism f : . It remains to show that W is asymptotically paretian AP and anonymous A, which by Lemma 4.5 yields a contradiction. That W satisfies anonymity A is clear. To see that W satisfies AP, let x, y ∈ X be such that x ≥ y and If Y contains a set Z order isomorphic to w * , then there is an order isomorphism g : M → Z , where M is the set of negative integers. Now, consider a social welfare function W : N N → R defined by W (x 1 , . . . , x n , . . .) := −W (g(−x 1 ), . . . , g(−x n ), . . .). That W satisfies anonymity A is easy to see. We show AP: Let x, y ∈ X be such that x ≥ y and x i − y i > 0 for all i ∈ A for some A ⊆ N with d(A) > 0. Then since g : M → Z is an order isomorphism we have g(−y i )−g(−x i ) > 0 for all i ∈ A and g(−y i ) ≥ g(−x i ) for all i ∈ N. Since W satisfies AP we have W (g(−x 1 ), . . . , g(−x n ), . . .) < W (g(−y 1 ), . . . , g(−y n ), . . .). By definition of W it then follows that W (x 1 , . . . , x n , . . .) > W (y 1 , . . . , y n , . . .). Since W satisfies A and AP, we have a contradiction by Lemma 4.5.

A.4 Proof of Proposition 4.4 part 2
The following characterization of unbounded subsets of R is used in our proof of proposition 4.4 part 2.
Lemma A.4 Let ε > 0. Then Y ⊆ R is unbounded if and only if there is a subset Z ⊆ Y , order isomorphic to w or w * , such that the following (distance) condition holds: 0 < ε < δ(Z ) := inf{|x − y| : x = y and x, y ∈ Z }.
That is the distance between any pair of distinct points in Z is larger than ε > 0.
Proof If Y is not bounded, then either Y lacks an upper bound, or otherwise a lower bound. Suppose that Y has no upper bound. Pick some x 1 ∈ Y , then there is an x 2 ∈ Y such that x 2 > x 1 + ε. Assume that x 1 , . . . , x n have been chosen such that x i+1 − x i > ε. Since Y has no upper bound there is a point x n+1 ∈ Y such that x n+1 > x n + ε. This defines a sequence (x n ) recursively. If we let Z = x(N) and give Z the order induced from R, then Z is order isomorphic to w and has the property that δ(Z ) > ε. If Y is not bounded below a similar argument shows that there is a subset Z order isomorphic to w * such that δ(Z ) > ε in equation (4) holds.
We now give our proof of proposition 4.4 part 2.
Proof Let X = Y N , where Y is an unbounded subset of R. Assume there is a social welfare function W : X → R satisfying WAP and A. By Lemma A.4, Y contains a subset order isomorphic to w or w * such that every pair of distinct points are at distance ε > 0 apart. If Y contains a subset Z order isomorphic to w, with δ(Z ) > ε, then there is an order isomorphism f : N → Z with the property that f (x)− f (y) > ε if and only if x − y > 0 for all x, y ∈ N. Define W : X → R, where X = N N , by W (x 1 , . . . , x n , . . .) := W ( f (x 1 ), . . . , f (x n ), . . .). It remains to show that W is asymptotically paretian AP and anonymous A, which by Lemma 4.5 yields a contradiction. It is clear that W satisfies anonymity A. To see that W satisfies AP, let x, y ∈ X be such that x ≥ y and x i − y i > 0 for all i ∈ A for some A ⊆ N with d(A) > 0. Then since f : N → Z is an order isomorphism, we have f (x i ) − f (y i ) > ε for all i ∈ A and f (x i ) ≥ f (y i ) for all i ∈ N. But W satisfies WAP and hence W ( f (x 1 ), . . . , f (x n ), . . .) > W ( f (y 1 ), . . . , f (y n ), . . .). By definition of W it follows that W (x 1 , . . . , x n , . . .) > W (y 1 , . . . , y n , . . .).
If Y does not contain a subset Z order isomorphic to w with δ(Z ) > ε, then by Lemma A.4 Y contains a subset Z order isomorphic to w * with δ(Z ) > ε. In this case W (x 1 , . . . , x n , . . .) := −W (g(−x 1 ), . . . , g(−x n ), . . .), where g : M → Z is an order isomorphism, does the job. Note that there is an ε > 0 such that g(x) − g(y) > ε if and only if x − y > 0 for all x, y ∈ M. Anonymity A of W is obvious. We show AP. Let x, y ∈ X be such that x ≥ y and x i − y i > 0 for all i ∈ A for some A ⊆ N with d(A) > 0, then since g : M → Z is an order isomorphism, we have g(−y i )−g(−x i ) > ε for all i ∈ A and g(−y i ) ≥ g(−x i ) for all i ∈ N. But W satisfies WAP and hence W (g(−x 1 ), . . . , g(−x n ), . . .) < W (g(−y 1 ), . . . , g(−y n ), . . .). By definition of W it then follows that W (x 1 , . . . , x n , . . .) > W (y 1 , . . . , y n , . . .).

A.5 Proof of theorem 5.1 part 2
Proof One direction follows by part (1) of proposition 4.3. To show the other direction of the characterization result, let X = Y N where Y is some unbounded subset of R. Assume by way of contradiction that there is a binary welfare relation on X satisfying BA and WAP. Since Y has a total order ≥ induced from R, by Lemma A.4 there is a subset Z ⊆ Y order isomorphic to w or w * such that 0 < ε < δ(Z ) = inf{|x − y| : x = y and x, y ∈ Z }. Assume that Z is order isomorphic to w. Then there is an order isomorphism f : N → Z . Define a binary welfare relation on for all x, y ∈ X . By arguing as in the Proof of Proposition 4.4, part 2, it follows that satisfies asymptotic Pareto AP and bounded anonymity BA. Hence, we have a binary welfare relation on X = N N such that BA and AP holds. From here on the proof is exactly the same as the proof of part 1 of Theorem 5.1.
Let π : N → N be a permutation defined by π(2) := 1,π(1) := 3 and π(2n) := 2n − 2 and π(2n − 1) = 2n + 1 for all n ≥ 2. It is easy to verify that π is a bounded permutation and since π • y = x it follows by bounded anonymity BA of that x ∼ y. But notice that y n > x n for all n ∈ N. Hence, WP implies that y x which together with x ∼ y yields a contradiction.