14 N. H. Bingham <strong>and</strong> A. J. Ostaszewskigiving, by Theorem 2.8 <strong>and</strong> because ‖xy‖ ≥ ‖x‖ − ‖y‖,p ∗ (y) := lim sup x→∞p(xy)p(x) ≤ µ2 .The left-sided inequality is proved dually (interchanging the roles of the upper <strong>and</strong> lowerbounds on ‖π(x)‖ Y ).Remarks. 1. In the case of the general (µ-γ)-quasi-isometry, p exhibits the normed<strong>groups</strong>O-analogue of slow-variation; compare [BGT, Cor. 2.0.5 p. 65].2. When X = R the weaker boundedness property: “p ∗ (y) < ∞ on a large enough set ofys” implies that p satisfiesz d ≤ p ∗ (z) ≤ p ∗ (z) ≤ z c , (z ≥ Z)for some constants c, d, Z (so is extended regularly varying in the sense of [BGT, Ch. 2,2.2 p. 65]). Some generalizations are given in Theorems 7.10 <strong>and</strong> 7.11.3. We pause to consider briefly some classical examples. If X = H = R is construedadditively, so that e H = e X = 0 <strong>and</strong> ‖x‖ := |x − 0| = |x| in both cases, <strong>and</strong> withthe action tx denoting t + x, the function f(x) := |x| is not slowly varying, because(x + t) − x = t ↛ 0 = e H . On the other h<strong>and</strong> a multiplicative construction on H = R ∗ +,for which e H = 1 <strong>and</strong> ‖h‖ H := | log h|, but with X = R still additive <strong>and</strong> tx still meaningt + x, yields f as having slow variation (as in the Theorem 2.8), asf(tx)f(x) −1 = (x + t)/x → 1 = e H as x → ∞.We note that in this context the regularly varying functions h on X have h(tx)h(x) −1 =h(t + x) − h(x) → at, for some constant a.Note that, for X = H = R ∗ +, <strong>and</strong> with tx meaning t·x, since ‖x‖ = | log x| (as just noted)is the group-norm, we have heref(tx)f(x) −1 = ‖tx‖/‖x‖ =| log tx|| log x|=| log t + log x|| log x|→ 1 = e H , as x → ∞,which again illustrates the content of Theorem 2.7. Here the regularly varying functionsh(tx)h(x) −1 → e at , for some constant a. See [BGT, Ch. 1] for background on additive<strong>and</strong> multiplicative formulations of regular variation in the classical setting of functionsf : G → H with G, H = R or R + .Definitions. 1. Say that ξ ∈ X is infinitely divisible if, for each positive integer n, thereis x with x n = ξ. (Compare Section 3.)2. Say that the infinitely divisible element ξ is embeddable if, for some one-parametersubgroup T in X, we have ξ ∈ T. When such a T exists it is unique (the elements ξ m/n ,for m, n integers, are dense in T ); we write T (ξ) for it.Clearly any element of a one-parameter subgroup is both infinitely divisible <strong>and</strong> embeddable.For results on this see Davies [D], Heyer [Hey], McCrudden [McC]. With these
<strong>Normed</strong> <strong>groups</strong> 15definitions, our previous analysis allows the First Limit Theorem for subadditive functions(cf. Th. 2.8 <strong>and</strong> [BOst-GenSub]) to be restated in the context of normed <strong>groups</strong>.Proposition 2.10. Let ξ be infinitely divisible <strong>and</strong> embeddable in the one-parametersubgroup T (ξ) of X. Suppose that lim n→∞ ‖x n ‖ = ∞ for x ≠ e X . Then for any Bairesubadditive p : X → R + <strong>and</strong> t ∈ T (ξ),∂ T (ξ) p(t) := lim s∈T, ‖s‖→∞p(ts)‖s‖ = ‖p‖ T ,i.e., treating the subgroup T (ξ) as a direction, the limit function is determined by thedirection.Proof. By subadditivity, p(s) = p(t −1 ts) ≤ p(t −1 ) + p(ts), sop(s) − p(t −1 ) ≤ p(ts) ≤ p(t) + p(s).For s ∈ T with s ≠ e, divide through by ‖s‖ <strong>and</strong> let ‖s‖ → ∞ (as in Th. 2.8):‖p‖ T ≤ ∂ T p(t) ≤ ‖p‖ T .(We consider this in detail in Section 4.)Definition (Supremum metric, supremum norm). Let X have a metric d X . As beforeG is a fixed subgroup of Auth(X), for example T r L (X) the group of left-translations λ x(cf. Th. 3.12), defined byλ x (z) = xz.For g, h ∈ G, define the possibly infinite numberˆd G (g, h), or ˆd X (g, h) := sup x∈X d X (g(x), h(x)),where the notation identifies either the domain of the metric or the source metric d X .PutH(X) = H(X, G) := {g ∈ G : ˆd G (g, id X ) < ∞},<strong>and</strong> call these the bounded elements of G. We write ˆd H for the metric ˆd G restricted toH = H(X) <strong>and</strong> call ˆd H (g, h) the supremum metric on H; the associated norm‖h‖ H = ‖h‖ H(X) := ˆd H (h, id X ) = sup x∈X d X (h(x), x)is the supremum norm. This metric notion may also be h<strong>and</strong>led in the setting of uniformities(cf. the notion of functions limited by a cover U arising in [AnB, Section 2];see also [BePe, Ch. IV Th. 1.2] ); in such a context excursions into invariant measuresrather than use of Haar measure (as in Section 6) would refer to corresponding resultsestablished by Itzkowitz [Itz] (cf. [SeKu, §7.4]).Our next result justifies the terminology of the definition above.
- Page 1 and 2: N. H. BINGHAM and A. J. OSTASZEWSKI
- Page 3 and 4: Normed groups 3ContentsContents . .
- Page 5 and 6: 1. IntroductionGroup-norms, which b
- Page 7 and 8: Normed groups 3Topological complete
- Page 9 and 10: Normed groups 5abelian group has se
- Page 11 and 12: Normed groups 74 (Topological permu
- Page 13 and 14: Normed groups 9The following result
- Page 15 and 16: Normed groups 11Corollary 2.4. For
- Page 17: Normed groups 13More generally, for
- Page 21 and 22: Normed groups 17so that fg is in th
- Page 23 and 24: Normed groups 19(iii) The ¯d H -to
- Page 25 and 26: Normed groups 21so‖αβ‖ ≤
- Page 27 and 28: Normed groups 23Remark. Note that,
- Page 29 and 30: Normed groups 25shows that [z n , y
- Page 31 and 32: Normed groups 27Denoting this commo
- Page 33 and 34: Normed groups 29Theorem 3.4 (Equiva
- Page 35 and 36: Normed groups 31argument as again p
- Page 37 and 38: Normed groups 33(ii) For α ∈ H u
- Page 39 and 40: Normed groups 35Definition. A group
- Page 41 and 42: Normed groups 37We now give an expl
- Page 43 and 44: Normed groups 39Theorem 3.19 (Abeli
- Page 45 and 46: Normed groups 412. Further recall t
- Page 47 and 48: Normed groups 43Theorem 3.22 (Lipsc
- Page 49 and 50: Normed groups 45Proof. Z γ = G (cf
- Page 51 and 52: Normed groups 47Theorem 3.30. Let G
- Page 53 and 54: Normed groups 49Remark. On the matt
- Page 55 and 56: Normed groups 51As for the conclusi
- Page 57 and 58: Normed groups 53By (C-adm), we may
- Page 59 and 60: Normed groups 55equipped with an in
- Page 61 and 62: Normed groups 57Proof. To apply Th.
- Page 63 and 64: Normed groups 59Definition. A point
- Page 65 and 66: Normed groups 61Proposition 3.46 (M
- Page 67 and 68: Normed groups 63Thus ω δ (s) ≤
- Page 69 and 70:
Normed groups 65Remark. In the penu
- Page 71 and 72:
Normed groups 67The result confirms
- Page 73 and 74:
Normed groups 69Proof. By the Baire
- Page 75 and 76:
Normed groups 715. Generic Dichotom
- Page 77 and 78:
Normed groups 73Returning to the cr
- Page 79 and 80:
Normed groups 75Examples. Here are
- Page 81 and 82:
Normed groups 77cf. [Eng, 4.3.23].)
- Page 83 and 84:
Normed groups 79Remarks. 1. See [Fo
- Page 85 and 86:
Normed groups 81Theorem 6.1 (Catego
- Page 87 and 88:
Normed groups 83is continuous at th
- Page 89 and 90:
Normed groups 85compact. Evidently,
- Page 91 and 92:
Normed groups 87j ∈ ω} which enu
- Page 93 and 94:
Normed groups 89The result below ge
- Page 95 and 96:
Normed groups 91left-shift, not in
- Page 97 and 98:
Normed groups 93As a corollary of t
- Page 99 and 100:
Normed groups 953. For X a normed g
- Page 101 and 102:
Normed groups 97Proof. Note that‖
- Page 103 and 104:
Normed groups 99Taking h(x) := ‖
- Page 105 and 106:
Normed groups 1019. The Semigroup T
- Page 107 and 108:
Normed groups 103Theorem 9.5 (Semig
- Page 109 and 110:
Normed groups 105By the Category Em
- Page 111 and 112:
Normed groups 107Proof. Say f is bo
- Page 113 and 114:
Normed groups 109Thus G is locally
- Page 115 and 116:
Normed groups 111Theorem 10.10 (Bar
- Page 117 and 118:
Normed groups 113K-analyticity was
- Page 119 and 120:
Normed groups 115Theorem 11.6 (Disc
- Page 121 and 122:
Normed groups 117restricted to X\M
- Page 123 and 124:
Normed groups 119groups need not be
- Page 125 and 126:
Normed groups 121Proof. In the meas
- Page 127 and 128:
Normed groups 123Hence, as t i n
- Page 129 and 130:
Normed groups 125The corresponding
- Page 131 and 132:
Normed groups 127(t, x) ✛✻Φ T
- Page 133 and 134:
Normed groups 129Fix s. Since s is
- Page 135 and 136:
Normed groups 131Hence,‖x‖ −
- Page 137 and 138:
Normed groups 133converging to the
- Page 139 and 140:
Normed groups 135Definition. Let {
- Page 141 and 142:
Normed groups 137However, whilst th
- Page 143 and 144:
Normed groups 139embeddable, 14enab
- Page 145 and 146:
Normed groups 141Bibliography[AL]J.
- Page 147 and 148:
Normed groups 143Series 378, 2010.[
- Page 149 and 150:
Normed groups 145abelian groups, Ma
- Page 151 and 152:
Normed groups 147[Kak] S. Kakutani,
- Page 153 and 154:
Normed groups 149fields. I. Basic p
- Page 155:
Normed groups 151[So]R. M. Solovay,