The paper constructs large, torsion-free, countably compact topological groups based on direct sums of rationals, which are $p$-compact without non-trivial convergent sequences, under certain ultrafilter conditions.
Contribution
It provides the first examples of large, torsion-free, countably compact groups lacking non-trivial convergent sequences, using $p$-compact topologies and selective ultrafilters.
Findings
01
Existence of $p$-compact group topologies on ${f Q}^{(oldsymbol{rown})}$
02
Construction of arbitrarily large countably compact torsion-free groups
03
Groups lack non-trivial convergent sequences under specified conditions
Abstract
We prove that if p is a selective ultrafilter then Q(κ) has a p-compact group topology without non-trivial convergent sequences, for each infinite cardinal κ=κω. In particular, this gives the first arbitrarily large examples of countably compact groups without non-trivial convergent sequences that are torsion-free.
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Advanced Banach Space Theory · Mathematical and Theoretical Analysis
Full text
On p-compact group topologies on direct sums of Q
Matheus Koveroff Bellini
,
Vinicius de Oliveira Rodrigues
and
Artur Hideyuki Tomita
Depto de Matemática, Instituto de Matemática e Estatística, Universidade de São Paulo, Rua do Matão, 1010 – CEP 05508-090, São Paulo, SP - Brazil
We prove that if p is a selective ultrafilter then Q(κ) has a p-compact group topology without non-trivial convergent sequences, for each infinite cardinal κ=κω. In particular, this gives the first arbitrarily large examples of countably compact groups without non-trivial convergent sequences that are torsion-free.
Key words and phrases:
Topological group, countable compactness, selective ultrafilter, Q-vector spaces, Wallace’s problem
The first listed author has received financial support from FAPESP 2017/15709-6.
The second listed author has received financial support from FAPESP 2017/15502-2.
The third listed author has received financial support from FAPESP 2016/26216-8.
1. Introduction
1.1. Some history
Halmos proved that R can be endowed with a compact group topology, which in particular contains non-trivial convergent sequences [4]. Tkachenko and Yashenko showed from Martin’s Axiom that R can be endowed with a countably compact group topology without non-trivial convergent sequences [6]. Madariaga-Garcia and Tomita assumed the existence of 2c selective ultrafilters to obtain a countably compact group topology on the free Abelian group of cardinality 2c without non-trivial convergent sequences. The construction does not yield any example of larger cardinality [5].
Fuchs showed that there are no compact free Abelian groups [3] and Tomita showed that there are no free Abelian groups whose countable power is countably compact [7]. In particular, there are no p-compact free Abelian groups. Using what was called integer stacks, Tomita showed that there exists a group topology in the free Abelian group with c generators whose every finite power is countably compact [8].
Assuming the existence of a selective ultrafilter p and a cardinal arithmetic assumption weaker than GCH, Castro-Pereira and Tomita classified the torsion groups that admit a countably compact group topology without non-trivial convergent sequences [2]. These torsion Abelian groups coincide with
the torsion Abelian groups that admit a p-compact group topology without non-trivial convergent sequences. In particular, it is shown that there exist large countably compact torsion groups without non-trivial convergent sequences.
Comfort called the direct sums of Q the test space for pseudocompactness for non-torsion groups. Our aim is to show the result in the abstract. This gives the first example of arbitrarily large torsion free countably compact groups without non-trivial convergent sequences. Also, it follows that R can be endowed with a p-compact group topology without non-trivial convergent sequences whenever p is a selective ultrafilter.
For the construction in this work, we will adapt the idea of integer stacks in [8], used for direct sums of Z’s, to work with direct sums of Q’s. There are some key changes in how the stack is organized and we will give a complete description of rational stacks without assuming knowledge of the previous construction.
We will also use some ideas in [9]
to solve arc equations.
We notice that this construction uses the fact that the ultrapower of direct sums of Q is again a Q-vector space. The ultrapower of a free Abelian group is no longer a free Abelian group and as mentioned above, there are no p-compact free Abelian groups.
1.2. Some basic notation
Fix an infinite cardinal κ such that κ=κω.
Let T be the Abelian group R/Z.
Let G be the Abelian additive group Q(κ)={g∈Qκ:∣supp g∣<ω} and let H be the Abelian additive group Z(κ)={g∈Zκ:∣supp g∣<ω}. If C⊆κ, let Q(C)={g∈G:supp g⊆C}.
Definition 1.1**.**
Given a μ∈κ, we denote by χμ the element of G such that supp χμ={μ} and χμ(μ)=1.
Given μ∈κ, we define μ the sequence such that μ(n)=μ for every n∈ω.
If A⊆ω and ζ:A⟶κ then we define χζ∈GA such that χζ(n)=χζ(n) for each n∈dom ζ.
Definition 1.2**.**
Given f∈GA and s=(sn:n∈A) a sequence of rational numbers, we will we denote by s.f or sf the function from A into G such that (s.f)(n)=sn.f(n), for each n∈A.
Definition 1.3**.**
Given A⊆GA and s=(sn:n∈A) a sequence of rational numberss, we define sA={sf:f∈A}. If s:A→Q∖{0}, we define sA={s1f:f∈A}.
Given an ultrafilter q, we define a equivalence relation on Gω by letting f≃qg iff {n∈ω:f(n)=g(n)}∈q. We let [f]q be the equivalence class determined by f and Gω/q be Gω/≃q. Notice that this set has a natural Q-vector space structure.
A rough idea of the construction framework is the following:
•
Define an associated family of stacks (Lemma 3.1).
•
Solve arc equations in a level of a stack (Lemma 3.2).
•
Find a relation between the arc equations related to a finite sequence of functions and some arc equations in the associated stack (Lemma 3.3).
•
Find the levels of the stacks within an element of the ultrafilter p. Solve the arc equations in the stack and build the homomorphism.
(Proof of Lemma 2.3 in Section 4).
2. Homomorphisms, arc functions and arc equations
The way to construct the group topology is through homomorphisms that preserve p-compactness for the representatives of a base for the ultrapower p. The homomorphisms are constructed by defining smaller and smaller arcs that will give an approximation of the homomorphism. These approximations are arc equations that need to have a solution inside an element of the ultrafilter.
Definition 2.1**.**
Let B={I+Z:I⊂R is an open interval} be the family of all the open arcs in T, including T itself.
We will call an arc function a function ϕ:κ⟶B such that {ξ∈κ:ϕ(ξ)=T} is finite. This set will be called the support of the arc function. If the arcs ϕ(ξ) have length ϵ for each ξ in the support of ϕ, we will call it an ϵ-arc function.
Given two arc functions ψ and ϕ, we will say that ψ≤ϕ if ψ(ξ)=ϕ(ξ) or ψ(ξ)⊆ϕ(ξ), for each ξ∈κ.
Given an arc function ϕ and a positive integer S, S.ϕ is the arc function with support supp ϕ such that (S.ϕ)(μ)=S.ϕ(μ) for every μ∈κ.
Below we give the definition of what we will call solutions of an arc equation.
Definition 2.2**.**
An arc equation is a quintuple (ϕ,A,A,S,U) where ϕ is an arc function, A⊆ω, A⊆(Z(κ))A, S is a positive integer and U=(Uf:f∈A) is a family of elements of B.
Given n∈A, an n-solution for the arc equation (ϕ,A,A,S,U) is an arc function ψ with Sψ≤ϕ such that ∑μ∈supp f(n)f(n)(μ)ψ(μ)⊆Uf, for each f∈A.
We will use arc functions as approximations of a homomorphism function in a countable subgroup. The solutions of these equations will depend on the notion of stacks that will be defined later in this work.
The goal is to prove the following:
Lemma 2.3** (Main Lemma).**
Fix a selective ultrafilter p.
Let F⊆Gω be a countable collection of distinct elements mod p such that {[f]p:f∈F}∪˙{[χμ]p:μ∈κ} is Q-linearly independent in Gω/p.
Let d,d0,d1∈G∖{0} with supp d, supp d0, supp d1 pairwise disjoint, and C be a countably infinite subset of κ such that ω∪supp d∪supp d0∪supp d1∪⋃f∈F,n∈ωsupp f(n)⊆C. For each f∈F, choose ξf∈C.
Then there exists a homomorphism ϕ:Q(C)⟶T
such that
a)
ϕ(d)=0, ϕ(d0)=ϕ(d1), and
2. b)
p-lim(ϕ(N1.f))=ϕ(N1.χξf), for each f∈F and N∈ω.
For the remaining of this section, let {fα:ω≤α<κ} be an enumeration of Gω such that
[TABLE]
By applying the Main Lemma, we get the following result:
Lemma 2.4**.**
Fix a selective ultrafilter p.
Let I⊆[ω,κ) be such that {[fξ]p:ξ∈I}∪{[χμ]p:μ∈κ} is a Q-basis for Gω/p.
Let d∈G∖{0}, D∈[I]<ω∖{∅}, r∈G of support D and B∈p. Let C be a countably infinite subset of κ such that ω∪D∪supp d⊆C and ⋃n∈ωsupp fξ(n)⊆C for every ξ∈C∩I.
Then there exists a homomorphism ϕ:Q(C)⟶T
such that
a)
ϕ(d)=0,
2. b)
p-lim(ϕ(N1.fξ))=ϕ(N1.χξ), for each ξ∈I∩C and N∈ω, and
3. c)
(ϕ(∑μ∈Dr(μ)fμ(n)):n∈B) does not converge.
Proof.
Let B′∈p a subset of B such that (∑μ∈Dr(μ)fμ(n):n∈B′) is a 1-1 sequence. Let A be an almost disjoint family on B′ of cardinality c and hx:ω⟶{∑μ∈Dr(μ)fμ(n):n∈x} be a bijection for each x∈A.
Claim: There exist x0,x1∈A such that {[fξ]p:ξ∈C∩I}∪{[χμ]p:μ∈κ}∪{[hx0]p,[hx1]p} is a linearly independent subset.
Proof of the claim: Given x0,x1∈A, notice that hx1(n)=hx2(n) for all but a finite numbers of n’s, so [hx1]p=[hx2]p. Since Q is countable, it follows that ⟨[hx]p:x∈A⟩ has cardinality c, so there is J⊆A such that ∣J∣=c and that ([hx]p:x∈J) is linearly independent. Now notice that ⟨fξ:ξ∈I∩C⟩⊕⟨χξ:ξ∈C⟩ is countable, so there exists x0,x1∈J such that {[fξ]p:ξ∈C∩I}∪{[χμ]p:μ∈C}∪{[hx0]p,[hx1]p} is linearly independent. Since all the supports of these elements are contained in C, it is straightforward to see that {[fξ]p:ξ∈C∩I}∪{[χμ]p:μ∈κ}∪{[hx0]p,[hx1]p} is a linearly independent. ∎
Let F={fξ:ξ∈C∩I}∪{hx0,hx1}. Set ξf=μ if f=fμ for some μ∈C∩I and ξf=mi if f=hxi for some i<2 where m0=m1 and m0,m1∈ω∖supp d. Let d0=χm0, d1=χm1 and ϕ be as in Lemma 2.3.
Clearly conditions a) and b) of Lemma 2.4 are satisfied.
Furthermore,
(ϕ(hxi(k)):k∈ω) has ϕ(χmi) as an accumulation point for i<2. Since these sequences are reorderings of a subsequence of
(ϕ(∑μ∈Dr(μ)fμ(n)):n∈B) and ϕ(χm0)=ϕ(χm1), it follows that c) is satisfied.
∎
Finally, we may extend the above homomorphism to G:
Lemma 2.5**.**
Fix a selective ultrafilter p.
Let I⊆[ω,κ) be such that {[fξ]p:ξ∈I}∪{[χμ]p:μ∈κ} is a Q-basis for Gω/p.
Let d∈G∖{0}, D∈[I]<ω∖{∅}, r:D→Q∖{0} and B∈p.
Then there exists a homomorphism ϕ:G⟶T
such that
a)
ϕ(d)=0,
2. b)
p-limϕ(N1.fξ)=ϕ(N1.χξ), for each ξ∈I and N∈ω, and
3. c)
(ϕ(∑μ∈Dr(μ)fμ(n)):n∈B) does not converge.
Proof.
Let C be a countably infinite subset of κ such that ω∪supp d⊆C and ⋃n∈ωsupp fξ(n)⊆C for every ξ∈C∩I. Such a C exists by standard closing off arguments. Let (ξα:α<κ) be a strictly increasing enumeration of κ∖C. Let ϕ be as in the Main Lemma.
For each α<κ, let Cα=C∪{ξβ:β<α} (so C0=C and Cκ=κ). Notice that for each α and n∈ω, supp fξα(n)⊆ξα⊆Cα.
Recursively we define homomorphisms ϕα:Q(Cα)→T for α≤κ satisfying:
a)
ϕ0=ϕ,
2. b)
ϕβ⊆ϕα whenever β≤α≤κ, and
3. c)
p-limϕα(N1.fξ)=ϕ(N1.χξ), for each ξ∈I∩Cα and N∈ω.
We let ϕ0=ϕ. For the limit step, just take unions. For the successor step α+1 we proceed as follows:
Notice that Q(Cα+1)=Q(Cα)⊕{qχξα:q∈Q}.
First, we define ϕ~α:{qχξα:q∈Q}→T by letting ϕ~α(NMχξα)=M(p-limϕξα(N1.fξα))· Since multiplying a group element by an integer is a continuous function and since ϕα is a homomorphism, it follows that ϕ~α is well-defined and a group homomorphism. Now let ϕα+1=ϕα⊕ϕ~α.
The required homomorphism is ϕκ.
∎
From this lemma follows the result in the title:
Theorem 2.6**.**
Assume that p is a selective ultrafilter and κ=κω is an infinite cardinal. Then, there exists a p-compact group topology on G=Q(κ) without non-trivial convergent sequences.
Proof.
Let p be a selective ultrafilter, let I be as in the previous theorem. For each d∈G∖{0},D∈[I]<ω∖{∅}, r:D→Q∖{0} and B∈p, let ϕd,D,r,B:G→T be as in the previous theorem.
The group topology induced by these homomorphisms is such that the p-lim(N1.fξ)=N1.χξ, for each ξ∈I and N∈ω.
If h is any element of Gω, there exist families (rξ:ξ∈I) and (sμ:μ∈κ) of rational numbers where all but a finite quantity of them is [math] such that:
[h]p=∑ξ∈Irξ[fξ]p+∑μ∈κsμ[χμ]p. Then ∑ξ∈Irξ.χξ+∑μ∈κsμ.χμ is the p-limit of h. Therefore, G is p-compact.
To check that there are no non-trivial convergent sequences, fix a 1-1 sequence g. Let (rξ:ξ∈I) and (sμ:μ∈κ) be families of rational numbers where all but a finite quantity of them is [math] such that:
[g]p=∑ξ∈Irξ[fξ]p+∑μ∈κsμ[χμ]p. Then there are B∈p and D∈[I]<ω∖{∅} such that: g(n)=∑ξ∈Drξfξ(n)+∑μ∈κsμχμ, for all n∈B.
By Lemma 2.5(c), we have that (ϕd,D,r,B(∑ξ∈Drξfξ(n)):n∈B) does not converge in T, and so (∑ξ∈Drξfξ(n):n∈B) does not converge in G. Since
∑μ∈κsμχμ is constant, it follows that (g(n):n∈B) does not converge,and therefore g does not converge.
∎
3. A preliminar discussion on rational stacks
We will start this section with an informal discussion about rational stacks. A rational stack will be a nonuple ⟨B,ν,ζ,K,A,k0,k1,l,T⟩, where:
•
A⊆ω is infinite,
•
k0≤k1 are natural numbers with k1>0,
•
l:k1→ω,
•
ν:k0→κ,
•
ζ:k1→κω,
•
K:A→ω∖2 is such that for every n∈A, n!T∣Kn,
•
B=(Bi,j:i<k1,j<li) is such that each Bi,j⊆Hω is finite.
•
T>0 is an integer.
In order to be a rational stack, this nonuple must satisfy additional properties. The full definition of rational stack will be given in Section 5. This definition was designed to solve arc equations to construct the homomorphisms we want.
Roughly speaking, we associate each finite family of sequences to a stack. We transform the arc equations associated to this finite family to arc equations associated to the stack, solve the arc equation using the properties of the stack then return to a solution of the original arc equations. We want to solve infinitely many equations, thus, this process is made back and forth, including more equations at each step. At each stage, the stack is different and there is no containment relation between the stacks, even though we use a larger finite subfamily of sequences.
The idea is that before each iteration we have arc equations related to a certain arc size. We might need to shrink the arcs when we write the arc equations related to the stack so that the solution of arc equation associated to the stack can be transformed into a solution of the original equations. After each step, the output arcs will be smaller and will be the input arcs for the next iteration. We have to estimate the size of the output arcs according to its input arc so that the sets of arc equations can be solved ultrafilter often. For this, we use the happiness of the selective ultrafilter.
Before we even define the stack, we will list the main results that motivated its definition.
The Lemma below associates each finite subset of functions to a stack that will be used to solve arc equations associated to this family.
Lemma 3.1**.**
Let B∈p and G be a finite subset of Gω whose elements are distinct mod p and none of them is constant mod p such that {[f]p:f∈G}∪{[χν]p:ν∈κ} is linearly independent. Then there exists a rational stack S=⟨B,ν,ζ,K,A,k0,k1,l,T⟩ such that, by defining
A=G∪{χνi:i<k0} and C=K⋃i<k1,j<liBi,j, there exist M:A×C→Z, N:C×A→Z satisfying:
(1)
{[f]p:f∈A} and {[h]p:h∈C} generate the same subspace;
2. (2)
f(n)=∑h∈CMf,hh(n), for each n∈A and f∈A,
3. (3)
h(n)=T21.∑f∈ANh,ff(n), for each n∈A and h∈C,
4. (4)
KA⊆Hω,
5. (5)
KC⊆Hω, and
6. (6)
A⊆B.
Proof.
The proof is quite technical and will be presented in a later section.
∎
Notice that if we interpret M and N as matrices, then M and T21N are inverse matrices.
Lemma 3.2**.**
Let S, A, C, M and N be as in Lemma 3.1. Let ϵ be a positive real and D be a finite subset of κ. Then there exist B⊆A cofinite in A and a family of positive real numbers (γn:n∈B) such that:
For every n∈B, for every family (Wh:h∈C) of open arcs of length ϵ, and for every arc function ψ of length ϵ such that supp ψ⊆D∖{ν0,…νk0−1}, there exists an n-solution of length γn for the arc equation (ψ,B,K.C,Kn,W).
Proof.
The proof is quite technical and will be presented in a later section.
∎
Lemma 3.3**.**
Let S, A, C, M and N be as in Lemma 3.1. Let δ be a positive real such that ϵ=∑f∈A,h∈C∣Mf,h∣δ<1.
Let (Uf:f∈A) be a family of open arcs of length δ. Let ϱ be an arc function of length δ such that Uχνi=ϱ(νi) for i<k0.
Furthermore, assume that {νi:i<k0}⊆supp ϱ.
Then there exist (Wh:h∈C) a family of open arcs of length ϵ and ψ an ϵ-arc function with support supp ϱ∖{ν0,…,νk0−1} such that for every n∈A, every n-solution for the arc equation (ψ,A,K.C,Kn,W) is an n-solution for (ϱ,A,K.A,Kn,U).
Proof.
Given f∈A, let yf∈R be such that yf+Z is the center of the arc Uf.
For each h∈C, let zh=∑f∈ANh,f.T2yf.
Since N is an integer matrix, it follows that zh+Z=∑f∈ANh,f.(T2yf+Z). Let Wh be an arc centered in zh+Z whose length is ϵ.
Let ψ(μ) be an arc of same center as ϱ(μ) of length ϵ for each μ∈supp ϱ∖{ν0,…,νk0−1} and ψ(νi)=T for each i<k0.
Suppose ϕ is an n-solution for (ψ,A,K.C,Kn,W). Then ∑μ∈supp h(n)Kn.h(n)(μ).ϕ(μ)⊆Wh, for each h∈C. Also, we have that, for each μ∈κ∖{ν0,…,νk0−1}:
[TABLE]
Let f∈A.
We have that for each μ, ∑h∈CMf,h.Kn.h(n)(μ).ϕ(μ)=Kn.f(n)(μ)ϕ(μ). Therefore, ∑h∈CMf,h.∑μ∈supp h(n)Kn.h(n)(μ).ϕ(μ)=∑μ∈supp f(n)Kn.f(n)(μ).ϕ(μ).
It then follows that ∑μ∈supp f(n)Kn.f(n)(μ).ϕ(μ)⊆∑h∈CMf,h.Wh. The arc ∑h∈CMf,h.Wh is centered in ∑h∈CMf,h.(zh+Z)=∑h∈CMf,h∑g∈ANh,g.(T2yg+Z)=∑g∈A∑h∈CMf,hNh,g.(T2yg+Z)=yf+Z, and has length ϵ⋅∑h∈C∣Mf,h∣≤δ. Therefore,
[TABLE]
Thus, ϕ is an n-solution for (ϱ,A,K.A,Kn,U), as required, provided that we show Kn.ϕ≤ϱ.
From \eqrefpermaps, if f=χνi then Kn.ϕ(νi)=Knχνi(n)(νi)ϕ(νi)⊆Uf=ϱ(νi), hence Kn.ϕ(νi)≤ϱ(νi) for each 0≤i<k0. This and (# ‣ 3) implies that Knϕ≤ϱ.
∎
4. Selective ultrafilters and the proof of the Main Lemma using the properties of the stacks
Our goal in this section is to prove Lemma 2.3 using the Lemmas in the previous section. First we state the following Lemma:
Lemma 4.1**.**
Fix a selective ultrafilter p.
Let F⊆Gω be a countable collection of distinct elements mod p such that {[f]p:f∈F}∪˙{[χμ]p:μ∈κ} is Q-linearly independent in Gω/p.
Let d,d0,d1∈G∖{0} with supp d, supp d0, supp d1 pairwise disjoint, and C be a countably infinite subset of κ such that ω∪supp d∪supp d0∪supp d1∪⋃f∈F,n∈ωsupp f(n)⊆C. For each f∈F, choose ξf∈C. Let (Fn:n∈ω) be an increasing sequence of finite sets whose union is F.
Then there exist stacks Sm=⟨Bm,νm,ζm,Km,Am,k0m,k1m,lm,Tm⟩ and Am, Cm, Mm, Nm related to the stacks as in Lemma 3.1, r:ω∪{−1}→ω such that r[ω]∈p and r(−1)=0, and a sequence of arc functions (ϱr(m):m≥−1) with C⊆⋃m≥−1supp ϱr(m), satisfying the following:
a)
0∈/∑μ∈supp dd(μ).ϱ0(μ) and ∑μ∈supp d0d0(μ).ϱ0(μ)∩∑μ∈supp d1d1(μ).ϱ0(μ)=∅.
2. b)
For every m′,m≥−1 with m′≤m and for every ξ∈supp ϱr(m+1), we have (∏i=m′mKr(i+1)r(i)).ϱr(m+1)(ξ)⊆ϱr(m′)(ξ) and (∏i=m′mKr(i+1)r(i)).ϱr(m+1)(ξ) has length ≤2r(m)+11.
3. c)
For every m≥−1 and f∈Fr(m), we have ∑μ∈supp f(r(m+1))f(r(m+1))(μ)Kr(m+1)r(m)ϱr(m+1)(μ)⊆ϱr(m)(ξf).
4. d)
For every m,m′≥−1 with m′≤m and f∈Fr(m), we have ∑μ∈supp f(r(m+1))f(r(m+1))(μ)(∏i=m′mKr(i+1)r(i))ϱr(m+1)(μ)⊆ϱr(m′)(ξf).
5. e)
For every m≥−1, supp ϱr(m)⊆supp ϱr(m+1).
Proof.
Let p, F, d, d0, d1,C and (ξf:f∈F) be given. Write C as an increasing sequence of finite sets (Cn:n∈ω) such that for each n∈ω, ⋃{supp f(k):f∈Fn and k≤n}⊂Cn, and supp d∪supp d0∪supp d1⊂C0.
Apply Lemma 3.1 to G=F0 and B=ω to obtain a rational stack S0=⟨B0,ν0,ζ0,K0,A0,k00,k10,l0,T0⟩ and A0, C0, M0 and N0 satisfying (1)-(7) as in the Lemma.
Fix δ0∈R such that 0<δ0<1 and ϱ0 a δ0-arc function such that 0∈/∑μ∈supp dd(μ).ϱ0(μ) and ∑μ∈supp d0d0(μ).ϱ0(μ)∩∑μ∈supp d1d1(μ).ϱ0(μ)=∅. We will also assume that C0∪{νi0:i<k00}⊆supp ϱ0.
Let ϵ0=∑f∈A0,h∈B0∣Mf,h0∣δ0. Notice that with this ϵ0 we may apply Lemma 3.3.
Now we apply Lemma 3.2 with D=C0 to obtain B0⊆A0∖1 and γ0=(γn0:n∈B0) as in the Lemma.
Suppose that Bt∈p with (Bt:t≤m) decreasing family of subsets of ω, γnt for t≤m and n∈Bt are defined.
Apply Lemma 3.1 with G=Fm+1 and B=Bm to obtain a stack Sm+1=⟨Bm+1,νm+1,ζm+1,Km+1,Am+1,k0m+1,k1m+1,lm+1,Tm+1⟩ and Am+1, Cm+1,Mm+1,Nm+1 related to the stack as in the lemma. Then Am+1⊆Bm. Let ϵm+1=∑f∈Am+1,h∈Bm+1∣Mf,hm+1∣δm+1. Notice that with this ϵm+1 we may apply Lemma 3.3.
Now we apply Lemma 3.2 with D=Cm+1 using to obtain Bm+1⊆Am+1∖m+2 and γm+1=(γnm+1:n∈Bm+1) as in the Lemma.
We will use the happiness of the selective ultrafilter p: the sets constructed previously B0⊇B1… are all elements of p, so there exists a function r∈ωω such that r[ω]∈p, r(0)∈B0 and, for all n∈ω, r(n+1)∈Br(n).
Define U0=(Uf0:f∈A0), where Uf0=ϱ0(ξf) if f∈F0 or Uf0=ϱ0(νi0) if f=χνi0. By Lemma 3.3 applied on stage 0, we obtain ψ and W as in the conclusion of Lemma 3.3. Now, according to the conclusion of Lemma 3.2 used in stage 0 of the construction, since r(0)∈B0, we obtain a r(0)-solution ϕ0 of length γr(0)0 to the arc equation (ψ,B0,K0.C0,Kr(0)0,W).
Now, using the conclusion of Lemma 3.3, we have that ϕ0 is a r(0)-solution to (ϱ0,B0,K0.A0,Kr(0)0,U0).
In particular, we have, for each f∈F0,
∑μ∈supp f(r(0))f(r(0))(μ)Kr(0)0ϕ0(μ)⊆ϱ0(ξf).
Let r(−1)=0. We can inductively to construct ϕr(m), ϱr(m) a δr(m)-arc function with Cr(m)⊆supp ϱr(m), and Ur(m) such that:
For every m≥−1, ϕr(m) is a r(m+1)-solution of length γr(m+1)r(m) of the arc equation (ϱr(m),Br(m),Kr(m).Ar(m),Kr(m+1)r(m),Ur(m)),
2. 2)
For every m≥−1, ϱr(m+1)≤ϕr(m),
3. 3)
For every m′,m≥−1 with m′≤m and for every ξ∈supp ϱr(m+1), we have (∏i=m′mKr(i+1)r(i)).ϱr(m+1)(ξ)⊆ϱr(m′)(ξ) and (∏i=m′mKr(i+1)r(i)).ϱr(m+1)(ξ) has length ≤2r(m)+11,
4. 4)
For every m≥−1 and f∈Fr(m), we have ∑μ∈supp f(r(m+1))f(r(m+1))(μ)Kr(m+1)r(m)ϱr(m+1)(μ)⊆ϱr(m)(ξf),
5. 5)
For every m,m′≥−1 with m′≤m and f∈Fr(m), we have ∑μ∈supp f(r(m+1))f(r(m+1))(μ)(∏i=m′mKr(i+1)r(i))ϱr(m+1)(μ)⊆ϱr(m′)(ξf),
6. 6)
For every m≥−1, supp ϱr(m)⊆supp ϱr(m+1), and
7. 7)
Ur(m)=(Ufr(m):f∈Ar(m)), where Ufr(m)=ϱr(m)(ξf) if f∈Fr(m) or Ufr(m)=ϱr(m)(νir(m)) if f=χνir(m).
The base of the recursion is already done. Suppose the construction is done until step m and let us define ϱr(m+1) and ϕr(m+1).
Let ϱr(m+1) be a δr(m+1)-arc funtion such that supp ϱr(m)∪Cr(m+1)∪{νir(m+1):i<k0r(m+1)}⊆supp ϱr(m+1) and ϱr(m+1)≤ϕr(m).
Now define Ur(m+1)=(Ufr(m+1):f∈Ar(m+1)), where Ufr(m+1)=ϱr(m+1)(ξf) if f∈Fr(m+1) or Ufr(m+1)=ϱr(m+1)(νir(m+1)) if f=χνir(m+1). By Lemma 3.3 applied on stage m+1, we obtain ψ and W as in the conclusion of Lemma 3.3. Now, according to the conclusion of Lemma 3.2 used in stage m+1 of the construction, since r(m+2)∈Br(m+1), we obtain a r(m+2)-solution ϕr(m+1) of length γr(m+2)r(m+1) to the arc equation (ψ,Br(m+1),Kr(m+1).Cr(m+1),Kr(m+2)r(m+1),W).
Now, using the conclusion of Lemma 3.3, we have that ϕr(m+1) is a r(m+2)-solution to (ϱr(m+1),Br(m+1),Kr(m+1).Ar(m+1),Kr(m+2)r(m+1),Ur(m+1)).
With , ϱr(m+1) and ϕr(m+1) thus defined, items 1), 2), 6) and 7) of the recursion are immediately satisfied.
In order to verify item 3): the second statement follows from the definition of δr(m+1). As for the first, use items 1) and 2) and then use item 3) iteratively.
Item 4) follows from items 1) and 2) and the definiton of Ur(m).
Item 5) follows from multiplying the expression in 4) by (∏i=m′m−1Kr(i+1)r(i)) and then applying item 3) for m′ and m−1.
Now that the recursion is complete, notice that items a)-e) of the statement of the Lemma are clearly satisfied.
∎
Lemma** (Main Lemma).**
Fix a selective ultrafilter p.
Let F⊆Gω be a countable collection of distinct elements mod p such that {[f]p:f∈F}∪˙{[χμ]p:μ∈κ} is Q-linearly independent in Gω/p.
Let d,d0,d1∈G∖{0} with supp d, supp d0, supp d1 pairwise disjoint, and C be a countably infinite subset of κ such that ω∪supp d∪supp d0∪supp d1∪⋃f∈F,n∈ωsupp f(n)⊆C. For each f∈F, choose ξf∈C.
Then there exists a homomorphism ϕ:Q(C)⟶T
such that
a)
ϕ(d)=0, ϕ(d0)=ϕ(d1), and
2. b)
p-lim(ϕ(P1.f))=ϕ(P1.χξf), for each f∈F and P∈ω∖{0}.
Proof.
Let Sm, Am, Cm, Mm, Nm, Fm and ϱr(m), (m∈ω), and ϱ0 be as in the previous lemma.
For each m∈ω, let Qm=∏i=−1m−1Kr(i+1)r(i). Now given a positive integer m′ and ξ∈C∩supp ϱr(m′), define ϕ(Qm′1.χξ) as the unique element of ⋂m≥m′Qm′Qmϱr(m)(ξ). Furthermore, if P divides Qm′ then define ϕ(P1.χξ)=PQm′ϕ(Qm′1.χξ). Then, since n!∣Knm for every n,m, ϕ(P1.χξ) is well-defined and does not depend on Qm′ and ϕ can be extended to a homomorphism.
Notice that since 0∈/∑μ∈supp dd(μ).ϱ0(μ) and
[TABLE]
it follows that ϕ(d)=0 and ϕ(d0)=ϕ(d1).
Let f∈F and P be a positive integer. Let M be positive such that f∈FM.
Claim: (ϕ(P1.f(r(m))):m∈ω) converges to ϕ(P1.χξf).
Proof.
Let m≥M be such that P divides Qm−1 and ξf∈C∩supp ϱr(m−1). Then
This last set is a neighborhood of
ϕ(P1.χξf) and has length at most 2r(m−2)+11.
This proves the claim.
∎
Since r[ω]∈p it follows that the p-limit of (ϕ(P1.f(n)):n∈ω) is ϕ(P1.χξf).∎
5. Defining rational stacks
We define stacks as a tool to solve a system of arc equations. The way the rational stack is constructed is motivated by the construction in [8].
We want to solve arc equations related to the representatives of the basis for Gω/p. We construct a stack, associate the original arc equations to arc equations for the stack, solve the arc equations for the stack and these solutions will lead to a solution to the original system of arc equations.
For the most basic example, if we take a stack with a single element ⟨{h},{Zn:n∈A}⟩, we choose a point ζ(n) (condition iii)) in the support of h(n). The values of
h(n)(ζ(n)) and Zn and their ratio (condition v)) are the main ingredients to solve the arc equation. According to the size of the arc entry, either the denominator Zn or the numerator h(n)(ζ(n)) must be large enough (condition v)).
The output arc will shrink proportionally to the sizes of the numerator Zn and the denominator h(n)(ζ(n)).
If we are dealing with a stack with more elements, the same ζ might have to be used for different sequences. Those h(n)(ζ(n)) that increase at a proportional speed (condition vi)) will be solved together. But there may have other sequences using the same ζ that have different speeds.
The arc equations of the bricks whose denominator h(n)(ζ(n)) is smaller will be solved first, since they require larger input arcs.
To continue using the same ζ for arc equations for the next brick with the same ζ, the h(n)(ζ(n)) must be much larger to compensate that the output arcs have shrunk to solve the equations for the previous brick (condition vii)).
The sequences may use a different element of the support, but the shrinking of the arcs that solved previous equations must not interfere with the size of the arc related to a different point in the support. For this reason we need conditions ii), iv) and vii).
The idea to use the stacks to solve arc equations back and forth is based on the idea in [9].
The order used in the stack corresponds to the order we construct a stack associated to a finite number of elements of the representatives of a basis. The order to solve the arc equations is the reverse order of the stack.
Definition 5.1**.**
A rational stack is an nonuple ⟨B,ν,ζ,K,A,k0,k1,l,T⟩, where:
•
A⊆ω is infinite,
•
k0≤k1 are natural numbers with k1>0,
•
l:k1→ω,
•
ν:k0→κ,
•
ζ:k1→κω,
•
K:ω→ω∖2 is such that for every n∈A, n!T∣Kn,
•
B=(Bi,j:i<k1,j<li) is such that each Bi,j⊆Hω is finite,
•
T>0 is an integer.
i)
ζi(n)=νi for every i<k0 and n∈A,
2. ii)
The elements νi(i<k0) and ζj(n)(k0≤j<k1,n∈A) are pairwise distinct,
3. iii)
ζi(n)∈supp h(n), for each i<k1, j<li, h∈Bi,j and n∈A,
4. iv)
ζi(n)∈/supp h(n), for each, i<i∗<k1, j<li∗ and h∈Bi∗,j and n∈A,
5. v)
(Knh(n)(ζi(n)))n∈A converges monotonically to +∞, −∞ or a real number, for each i<k1, j<li and h∈Bi,j,
6. vi)
For every i<k1,j<li, there exists h∗∈Bi,j such that for every h∈Bi,j, (h∗(n)(ζi(n))h(n)(ζi(n)))n∈A converges to a real number θh∗h and (θh∗h:h∈Bi,j) is linearly independent (as a Q-vector space),
7. vii)
For each i<k1, j′<j<li, h∈Bi,j and h′∈Bi,j′, (h′(n)(ζi(n))h(n)(ζi(n)))n∈A converges monotonically to [math],
8. viii)
For each i<k0 there exists j<li such that TK.χνi∈Bi,j,
9. ix)
(∣h(n)(ζi(n))∣)n∈A is strictly increasing, for each i<k1,j<li and h∈Bi,j, and
10. x)
For each i<k1,j<li and distinct h,h∗∈Bi,j, either
•
∣h(n)(ζi(n))∣>∣h∗(n)(ζi(n))∣ for each n∈A, or
•
∣h(n)(ζi(n))∣=∣h∗(n)(ζi(n))∣ for each n∈A, or
•
∣h(n)(ζi(n))∣<∣h∗(n)(ζi(n))∣ for each n∈A.
11. xi)
for all μ∈κ, i∈ω such that k0≤i<k1 and g∈⋃j<liBi,j, if {n∈ω:μ∈supp g(n)(μ)} then (Kng(n)(μ))n∈A is constant.
The family Bi,j is named (i,j)-brick. This concept is inspired on the concepts defined in [8].
Notice that vi) implies that for every i<k1j<li, h∗∈Bi,j, for every h∈Bi,j, (h∗(n)(ζi(n))h(n)(ζi(n)))n∈A converges to a real number θh∗h and (θh∗h:h∈Bi,j) is linearly independent.
6. Constructing a sequence of rational stacks
Given a finite sequence of functions we want to find an element of the ultrafilter p that makes the restricted functions closer to the properties we want for the stack.
Lemma 6.1**.**
Suppose that G is a finite subset Gω, p is a selective ultrafilter and C∈p. Suppose ζ,ζ∗∈κω are such that there exist g∗∈G such that {n∈C:ζ(n)∈supp g∗(n)}∈p and {n∈C:ζ(n)=ζ∗(n)}∈/p.
Then there exist B′∈p, B′⊆C and H⊆G such that:
(⋆1)
(ζ(n))n∈B′ is either constant or 1-1,
2. (⋆2)
for each g∈G, either ζ(n)∈supp g(n) for each n∈B′ or ζ(n)∈/supp g(n) for each n∈B′,
3. (⋆3)
H={g∈G:∀n∈B′ζ(n)∈supp g(n)} is nonempty,
4. (⋆4)
(g(n)(ζ(n)))n∈B′ converges strictly monotonically to an element of the extended real line, or it is constant and equal to a rational number, for each g∈H,
5. (⋆5)
given f,g∈H either ∣g(n)(ζ(n))>f(n)(ζ(n))∣ for each n∈B′, ∣g(n)(ζ(n))∣=∣f(n)(ζ(n))∣ for each n∈B′ or
∣g(n)(ζ(n))∣<∣f(n)(ζ(n))∣ for each n∈B′,
6. (⋆6)
for each pair g,h∈H, the sequence (h(n)(ζ(n))g(n)(ζ(n)))n∈B′ converges to +∞, −∞ or to a real number, and
7. (⋆7)
ζ(n)=ζ∗(m) for each n,m∈B′.
Proof.
Everything follows from the selectivity of p.
∎
Notice that if B∈p is such that B⊆B′, then (⋆1)−(⋆8) also hold for B.
Lemma 6.2**.**
Suppose that G, C, p, ζ, ζ∗, B′ and H be as in Lemma 6.1.
Suppose g#∈H is such that for every g∈H, (g#(n)(ζ(n))g(n)(ζ(n)))n∈B′ converges to a real number (or, equivalently, is bounded).
Then there exist B∈p, with B⊆B′, B⊆H, σ:H∖B→Gω and a family of real numbers (θg#,g:g∈H) such that:
(⋆9)
g#∈B,
2. (⋆10)
(g#(n)(ζ(n))g(n)(ζ(n)))n∈B converges to θg#,g, for every g∈H,
3. (⋆11)
(θg#,g:g∈B) is a linearly independent set that generates the same Q-vector space as (θg#,g:g∈H),
4. (⋆12)
for each g∈H∖B, B∪{g} and B∪{σ(g)} generate the same Q-vector subspace of Gω,
5. (⋆13)
for each g∈H∖B and h∈B, (h(n)(ζ(n))σ(g)(n)(ζ(n)))n∈B converges to [math],
6. (⋆14)
If g∈H∖B and θg#,g=0, then σ(g)=g.
7. (⋆15)
If ζ is constant and equal to ν, B={χν} and there exists g∗∈H such that (g∗(n)(ν))n∈B is not constant mod p, then {n∈ω:ν∈supp σ(g∗(n))}∈p.
Proof.
Consider {θg#,g:g∈H} as a subset of the Q-vector space R and take B⊆H containing g# such that (θg#,h:h∈B) is a basis for the vector space generated by {θg#,g:g∈H}.
For the existence of σ, define (rg,h:g∈H,h∈B) by the expressions θg#,g=∑h∈Brg,hθg#,h. Now define
σ(g)=g−∑h∈Brg,hh for each g∈H∖B.
∎
Lemma 6.3**.**
Let B∈p. Suppose that ζ∈κω, m∈ω, ζi∈κω for i<m, are such that {n∈B:∀i<mζ(n)=νi}∈p. Suppose G is a finite subset of Gω whose elements are distinct mod p, none of them is constant mod p and such that {[f]p:f∈G}∪{[χξ]p:ξ∈κ} is linearly independent and there exists g∈G such that {n∈ω:ζ(n)∈supp g(n)}∈p.
If ζ is constant, let ν be its value.
Then there exist finite G′⊂Gω, l∈ω∖{0}, finite non-empty Bj⊂Gω for each j<l, A⊂B such that:
(1)
For every g∈G′, {n∈ω:ζ(n)∈supp g(n)}∈/p and {n∈ω:νi∈supp g(n)}∈/p for each i<m,
2. (2)
Bj∩Bj′=∅ for j=j′, Bj∩G′=∅ for each j<l and {[f]p:f∈G′∪⋃j<lBj} is a linearly independent subset of Gω/p. Also, if f,h∈G′∪˙⋃˙k<lBk are distinct, then [f]p=[h]p.
3. (3)
As vector subspaces of Gω, ⟨G′∪⋃j<lBj⟩=⟨G∪{χν}⟩ if ζ is constant and ⟨G′∪⋃j<lBj⟩=⟨G⟩ otherwise,
4. (4)
ζ(n)∈supp h(n), for each j<l, h∈Bj and n∈A,
5. (5)
νi∈/supp h(n), for each i<m, j<l and h∈Bj and n∈A,
6. (6)
(h(n)(ζ(n)))n∈A converges strictly monotonically to an element of the extended real line, or it is constant and equal to a rational number, for each j<l and h∈Bj,
7. (7)
For every j<l, there exists h∗∈Bj such that for every h∈Bj, (h∗(n)(ζ(n))h(n)(ζ(n)))n∈A converges to a real number θh∗h and (θh∗h:h∈Bj) is linearly independent (as a Q-vector space),
8. (8)
For each j′<j<l, h∈Bj and h′∈Bj′(h′(n)(ζ(n))h(n)(ζ(n)))n∈A converges monotonically to [math],
9. (9)
If ζ is constant, there exists j<l such that χν∈Bj,
10. (10)
For each j<l and distinct h,h′∈Bj, either
•
∣h(n)(ζ(n))∣>∣h′(n)(ζ(n))∣ for each n∈A, or
•
∣h(n)(ζ(n))∣=∣h′(n)(ζ(n))∣ for each n∈A, or
•
∣h(n)(ζ(n))∣<∣h′(n)(ζ(n))∣ for each n∈A.
11. (11)
No element of G′ is constant mod p and {[f]p:f∈G′}∪{[χξ]p:ξ∈κ} is linearly independent,
12. (12)
if i<m and n,n′∈A are distinct, then ζ(n)=ζi(n′), and
13. (13)
∣G′∣<∣G∣.
Proof.
Since p is selective, we may suppose by shrinking B is necessary that if i<m and n,n′∈B are distinct, then ζ(n)=ζi(n′). Clearly, this property will hold for any subset of B.
If ζ is constant, let G0=G∪{χν}. If not, let G0=G. We will construct:
•
Aj∈p for j∈ω, with Aj⊆B,
•
Gj⊆Gω for j∈ω,
•
Hj⊆Gj for j∈ω,
•
Bj⊆Hj for j∈ω,
•
σj:Hj∖Bj→Gω for j∈ω,
satisfying:
i)
Aj⊆Aj−1 for every j<l,
2. ii)
for each j<l, {[f]p:f∈Gj∪˙⋃˙k<jBk} is a linearly independent subset of Gω/p. Also, if f,h∈Gj∪˙⋃˙k<jBk are distinct, then [f]p=[h]p.
3. iii)
if j∈ω, h∈Hj and n∈Aj, then ζ(n)∈supp h(n),
4. iv)
if j∈ω, h∈Gj∖Hj and n∈Aj, then ζ(n)∈/supp h(n),
5. v)
if j∈ω, h∈Hj, i<m and n∈Aj, then νi∈/supp h(n),
6. vi)
if j∈ω and h∈Hj, then (h(n)(ζ(n)))n∈Aj converges strictly monotonically to an element of the extended real line, or it is constant and equal to a rational number,
7. vii)
for every j∈ω, Bj=∅ iff ∃g∈Gj{n∈ω:ζ(n)∈supp g(n)}∈p,
8. viii)
for every j<ω, if Bj=∅, then there exists h∗∈Bj such that for every h∈Bj, (h∗(n)(ζ(n))h(n)(ζ(n)))n∈Aj converges to a real number θh∗h and (θh∗h:h∈Bj) is linearly independent (as a Q-vector space),
9. ix)
for every j,j′∈ω, if j′<j, h∈Bj and h′∈Bj′, then (h′(n)(ζ(n))h(n)(ζ(n)))n∈Aj converges monotonically to [math],
10. x)
if ζ is constant, there exists j∈ω such that χν∈Bj,
11. xi)
if j∈ω and h,h′∈Bj, either
•
∣h(n)(ζ(n))∣>∣h′(n)(ζ(n))∣ for each n∈Aj, or
•
∣h(n)(ζ(n))∣=∣h′(n)(ζ(n))∣ for each n∈Aj, or
•
∣h(n)(ζ(n))∣<∣h′(n)(ζ(n))∣ for each n∈Aj.
12. xii)
for each j∈ω and g∈Hj, (∣g(n)(ζ(n))∣)n∈Aj is either constant or strictly increasing,
13. xiii)
for each j∈ω and g∈Hj∖Bj, Bj∪{g} and Bj∪{σ(g)} generate the same Q-vector subspace of Gω,
14. xiv)
for each j∈ω, g∈Gj and i<m, {n∈ω:νi∈supp g(n)}∈/p,
15. xv)
for each j,j′∈ω, Gj∪⋃k<jBk generates the same subspace of Gω as Gj′∪⋃k<j′Bk
16. xvi)
if ζ is constant, then for each j∈ω, χν∈⋃k<jBj∪Gj,
17. xvii)
Gj+1=(Gj∖Hj)∪ranσj, and
18. xviii)
if ζ is constant, j∈ω and χν∈Hj∖Bj, then σj(χν)=χν.
19. xix)
if ζ is constant and B0={χν}, then there exists g∈H0∖B0 such that {n∈ω:ν∈supp σ0(g)}∈p.
Suppose we have carried on such a recursion. By ii) and xviii), one of the Bj’s must be empty. Let l be the first j such that Bj=∅. By vii), ∀g∈Gl,{n∈ω:ζ(n)∈/g(n)}∈p. Since there exists g∈G such that {n∈ω:ζ(n)∈supp g(n)}∈p, it follows that j>0. Let A=Al−1, G′=Gl. Notice that every Bj is nonempty for j<l.
(1) holds by the previous observation, i), v) and by the fact that Bj⊆Hj. (2) holds by (ii). (3) follows from xvii) using j=l, j′=0. (4)-(8), (10) and (11) follow easily from (i), (iii)-(vii), (viii), (ix), (xi) and (xii). Suppose (9) doesn’t hold. Then by xviii), χν∈Gl. But then, by vii), Bl=∅, a contradiction.
(13) holds by ii), because ⟨G′⟩⊆⟨G0⟩ and because, if ζ is constant then, by xviii) and (9), G′∪{χν} is linearly independent.
(14) holds: if ζ is not constant, it follows from (2) and (3). If it is constant, first, notice that, by xxi), xix) for j=0, and vii) for j=1, it follows that l>1 or B0={χν}. Either way, B=⋃i<lBi∖{χν} is nonempty. By (2), (3) and (9), analyzing dimensions it follows that 1+∣B∣+∣G′∣=1+∣G∣, so ∣G′∣<∣G∣.
Construction: For step [math], G0 is already defined. We apply Lemma 6.1m times using ζ(n)=ζ(n) and ζ∗(n)=νi for every n. If m=0 we apply it once using ζ∗(n)=ζ(n)′ for every n for some ζ(n)′=ζ(n). We now have H0 and A0′⊂B.
If it is the case that (h(n)(ζ(n)))n∈A0 converges to a real number for every h∈H0 and that ζ is constant, then we apply Lemma 6.2 with g#=χν, and obtain A0⊂A0′, B0⊂H0 and σ0. If not, then we take any g#∈H0 that satisfies the hypothesis of Lemma 6.2 – one does exist because of (⋆5), which also implies that for such a g#, (g#(n)(ζ(n))1)n∈A0 converges to 0, and thus in case ζ is constant, σ0(χν)=χν. Either way, we obtain σ0, B0 and A0. It is straightforward to verify that (i)−(xxi) hold for this step.
For the inductive step, we define Gj+1 as in xix). If ∄g∈Gj+1{n∈ω:ζ(n)∈supp g(n)}∈p, then we define Hj+1=∅, Aj+1⊆Aj satisfying v) with j swapped by j+1 and Bj+1=σj+1=∅. If not, we proceed as in step [math]: we first apply Lemma 6.1 to obtain Hj+1 and Aj+1′⊂Aj and then similarly apply Lemma 6.2 to obtain Bj+1, Aj+1 and σj+1. It is straightforward to verify that (i)-(xix) hold for this step.
∎
Lemma 6.4**.**
Suppose G is a finite subset of Gω whose elements are distinct mod p and none of them is constant mod p such that {[f]p:f∈G}∪{[χν]p:ν∈κ} is a linearly independent subset of Gω/p. Then: either there exist μ∈κ, g∗∈G and A∈p such that (g∗(n)(μ))n∈A is one-to-one, or there exists A∈p such that for every g∈G there exists ζg∈κω satisfying ζg(n)∈supp g(n) for all n∈A and ζg∣A is one-to-one.
Proof.
Suppose that for all μ∈κ, for all g∈G and for all A∈p, (g(n)(μ))n∈A is not one-to-one. Then by the selectivity of p, for all μ∈κ there exist Bμ∈p such that for all g∈G, (g(n)(μ))n∈Bμ is constant.
Fix a g∈G. By selectivity, there exists B∈p such that either the sequence (∣supp g(n)∣)n∈B is strictly increasing or it is constant. If it is strictly increasing, then we may pick recursively ζ~g(n)∈supp g(n) for each n∈B in a way that ζ~g is one-to-one. Define Ag=B.
If it is constant, let k∈ω be that constant. Since g is not 0 mod p, k≥1. For each i<k, let wi∈κω be such that supp g(n)={w0(n),…,wk−1(n)} for each n∈B. Then there exists C⊂B, C∈p such that for each i<k, (wi(n))n∈C is one-to-one or constant.
We claim that there is a j<k such that (wj(n))n∈C is one-to-one. Suppose all of them are constant; take μj for each j<k so that wj(n)=μj for all n∈C. Then, since (g(n)(μj))n∈Bμj is constant for each j<k, let rj be those constants. Let D=C∩⋂j<kBμj. We have that D∈p and g(n)=(∑j<krjχμj)(n) for all n∈D, and so [g]p=∑j<krj[χμj]p. This contradicts the hypothesis that {[f]p:f∈G}∪{[χν]p:ν∈κ} is a linearly independent subset of Gω/p.
Therefore, there exists a j<k such that (wj(n))n∈C is one-to-one, and so we define ζ~g=wj and Ag=C.
Thus if we define A=⋂g∈GAg and ζg∈κω such that ζg∣A=ζ~g∣A, we have the desired result.
∎
Now we restate Lemma 3.1, which we are going to prove.
Lemma**.**
Let B∈p and G be a finite subset of Gω whose elements are distinct mod p and none of them is constant mod p such that {[f]p:f∈G}∪{[χν]p:ν∈κ} is linearly independent. Then
there exist a rational stack S=⟨B,ν,ζ,K,A,k0,k1,l⟩ and a positive integer S such that, by defining
A=G∪{χνi:i<k0} and C=K⋃i<k1,j<liBi,j, there exist M:A×C→Z, N:C×A→Z satisfying:
(1)
{[f]p:f∈A} and {[h]p:h∈C} generate the same subspace;
2. (2)
f(n)=∑h∈CMf,hh(n), for each n∈A and f∈A,
3. (3)
h(n)=S1.∑f∈ANh,ff(n), for each n∈A and h∈C,
4. (4)
KA⊆Hω,
5. (5)
KC⊆Hω, and
6. (6)
A⊆B.
Proof.
(of Lemma 3.1)
We will start building a sequence that will almost be the stack S which we will associate with G.
Claim: There exist:
•
A′∈p with A′⊆B,
•
k0∈ω
•
l′:k0→ω∖{0},
•
ν:k0→κ,
•
ζ′:k0→κω,
•
G′⊂Gω,
•
(B^i,j:i<k0,j<li) a family of nonempty subsets of Gω,
Satisfying:
(1)
ζi′(n)=νi for every i<k0 and n∈A′,
2. (2)
The elements νi(i<k0) are pairwise distinct,
3. (3)
νi∈supp h(n), for each i<k0, j<li, h∈B^i,j and n∈A,
4. (4)
νi∈/supp h(n), for each, i<i∗<k0, j<li∗ and h∈B^i∗,j and n∈A,
5. (5)
(h(n)(νi))n∈A converges strictly monotonically to an element of the extended real line, or it is constant and equal to a rational number, for each i<k0, j<li and h∈B^i,j,
6. (6)
For every i<k0,j<li, there exists h∗∈B^i,j such that for every h∈B^i,j, (h∗(n)(νi)h(n)(νi))n∈A converges to a real number θh∗h and (θh∗h:h∈B^i,j) is linearly independent (as a Q-vector space),
7. (7)
For each i<k0, j′<j<li, h∈B^i,j and h′∈B^i,j′, (h′(n)(νi)h(n)(νi))n∈A converges monotonically to [math],
8. (8)
(∣h(n)(νi)∣)n∈A′ is constant or strictly increasing, for each i<k0,j<li and h∈B^i,j,
9. (9)
For each i<k0 there exists j<li such that χνi∈B^i,j,
10. (10)
For each i<k0,j<li and distinct h,h∗∈B^i,j, either
•
∣h(n)(νi)∣>∣h∗(n)(νi)∣ for each n∈A, or
•
∣h(n)(νi)∣=∣h∗(n)(νi)∣ for each n∈A, or
•
∣h(n)(νi)∣<∣h∗(n)(νi)∣ for each n∈A.
11. (11)
for all μ∈κ, for every g∈G′, if {n∈ω:μ∈supp g(n)(μ)}∈p then (g(n)(μ))n∈A is constant,
12. (12)
for all g∈G′ and all i<k0, {n∈ω:νi∈supp g(n)}∈/p,
13. (13)
If i,i′<k0, j<li′, j′<li′′ and (i,j)=(i′,j′), then B^i,j∩B^i′,j′=∅, B^i,j∩G′=∅ for each j<l and {[f]p:f∈G′∪⋃i<k0⋃j<liB^i,j} is a linearly independent subset of Gω/p. Also, if f,h∈G′∪˙⋃˙i<k0⋃˙j<liB^i,j are distinct, then [f]p=[h]p.
14. (14)
As vector subspaces of Gω, ⟨G′∪⋃i<k0⋃j<liB^i,j⟩=⟨G∪{χνi:i<k0}⟩
15. (15)
No element of G′ is constant mod p and {[f]p:f∈G′}∪{[χξ]p:ξ∈κ} is linearly independent.
If (11) already holds for G and A=B, we let G′=G, A′=B, k0=0 and the other sequences be ∅.
If not, then we may take a ν0∈κ such that there exist g∈G and B′⊂B, B′∈p such that {n∈ω:ν0∈supp g(n)}∈p and (g(n)(ν0))n∈B′ is one-to-one.
We define G0=G and apply Lemma 6.3 to B′, m=0, G0, ζ(n)=ν0 for all n∈B′ and obtain G0′, A0, l0 and B^0,j for j<l0 satisfying everything but (11) (possibly) by using k0=0 .
Suppose the recursion has been done up to m∈ω and we have, for i<m, νiGi′, Ai, li and B^i,j for j<li satisfying everything but (10) (possibly) by using k0=m. If (10) holds for Gm−1′, then we let A′=Am−1, k0=m and G′=Gm−1′ and the recursion is over. If not, we take νm∈κ such that there exist g∈Gm−1′ and B′⊂Am−1, B′∈p such that {n∈ω:νm∈supp g(n)}∈p and (g(n)(νm))n∈B′ is one-to-one. Notice that item (11) implies that νm=νi for every i<m. We then apply Lemma 6.3 to B′, m, Gm−1′, ζ(n)=νm for all n∈B′, ζi(n)=νi for all n∈B′ and i<m, and obtain Gm′, Am, lm and B^m,j for j<lm satisfying everything but (11) (possibly) by using k0=m.
The recursion must eventually stop due to items (12), (13) and the fact that the B^i,j’s are nonempty. We now have A′, k0, l′, ν, ζ′, G′ and (B^i,j:i<k0,j<li) as in the Claim above.
Claim: There exist:
•
A′′∈p with A′′⊆A′,
•
k1∈ω\{0}
•
l:k1→ω∖{0} extending l′,
•
ζ:k1→κω extending ζ′,
•
(B^i,j:i<k1,j<li) a family of nonempty subsets of Gω,
Satisfying:
(1)
ζi(n)=νi for every i<k1 and n∈A′′,
2. (2)
The elements νi(i<k0) and ζj(n)(k0≤j<k1,n∈A) are pairwise distinct,
3. (3)
ζi(n)∈supp h(n), for each i<k1, j<li, h∈B^i,j and n∈A′′,
4. (4)
ζi(n)∈/supp h(n), for each, i<i∗<k1, j<li∗ and h∈B^i∗,j and n∈A′′,
5. (5)
(h(n)(ζi(n)))n∈A′′ converges strictly monotonically to an element of the extended real line, or it is constant and equal to a rational number, for each i<k1, j<li and h∈B^i,j,
6. (6)
For every i<k1,j<li, there exists h∗∈B^i,j such that for every h∈B^i,j, (h∗(n)(ζi(n))h(n)(ζi(n)))n∈A′′ converges to a real number θh∗h and (θh∗h:h∈B^i,j) is linearly independent (as a Q-vector space),
7. (7)
For each i<k1, j′<j<li, h∈B^i,j and h′∈B^i,j′, (h′(n)(ζi(n))h(n)(ζi(n)))n∈A′′ converges monotonically to [math],
8. (8)
(∣h(n)(ζi(n))∣)n∈A′′ is strictly increasing, for each i<k1,j<li and h∈B^i,j,
9. (9)
For each i<k0 there exists j<li such that χνi∈B^i,j,
10. (10)
For each i<k1,j<li and distinct h,h∗∈B^i,j, either
•
∣h(n)(ζi(n))∣>∣h∗(n)(ζi(n))∣ for each n∈A′′, or
•
∣h(n)(ζi(n))∣=∣h∗(n)(ζi(n))∣ for each n∈A′′, or
•
∣h(n)(ζi(n))∣<∣h∗(n)(ζi(n))∣ for each n∈A′′.
11. (11)
for all μ∈κ, for every i≥k0, j<li and g∈B^i,j, if {n∈ω:μ∈supp g(n)(μ)}∈p then (g(n)(μ))n∈A′′ is constant,
12. (12)
As vector subspaces of Gω, ⟨⋃i<k0⋃j<liB^i,j⟩=⟨G∪{χνi:i<k0}⟩,
13. (13)
If i,i′<k1, j<li′, j′<li′′ and (i,j)=(i′,j′), then B^i,j∩B^i′,j′=∅, and {[f]p:f∈⋃i<k0⋃j<liB^i,j} is a linearly independent subset of Gω/p. Also, if f,h∈⋃i<k0⋃j<liB^i,j are distinct, then [f]p=[h]p.
For the initial step k0 of the recursion, we first notice that by item (11) of the previous Claim, applying Lemma 6.4 we may take Ak0′′∈p such that for every g∈G′ there exists ζg∈κω such that ζg(n)∈supp g(n) for all n∈Ak0′′ and ζg∣Ak0′′ is one-to-one. Define Gk0=G′, and apply Lemma 6.3 to B=Ak0′′, m=k0, Gk0, ζ=ζg for an arbitrary g∈G′, and obtain Gk0′, Ak0+1′′, lk0+1 and B^k0+1,j for j<lk0+1. We then repeat this step until for some k1≥k0, Gk1′=∅. Such a k1 exists since, by Lemma 6.3, ∣Gm′∣<∣Gm−1′∣ for each m>k0.
It follows from items (12) and (13) that ⋃i<k0⋃j<liB^i,j and G∪{χνi:i<k0}, mod p, are bases for the same subspace of Gω/p. Let A=G∪{χνi:i<k0} and B′=⋃i<k0⋃j<liB^i,j.
Fix families of integers M^=(M^f,h:f∈A,g∈B′) and N^=(N^h,f:h∈B′,f∈A) and a positive integer T such that:
(3′)[f]p=T1∑h∈B′M^f,h[h]p, for each f∈A and
(4′)[h]p=T1∑f∈AN^h,f[f]p, for each h∈B′.
Let C={Th:h∈B′} and M, N be such that Mf,Th=M^f,h and NTh,f=N^h,f. Then:
(3′′)[f]p=∑h∈BMf,h[h]p, for each f∈A and
(4′′)[h]p=T21∑f∈ANh,f[f]p, for each h∈C.
Let A⊂A′′, A∈p be such that for every n∈A, f∈A and h∈C, f(n)=∑h∈CMf,hh(n) and h(n)=T21.∑f∈ANh,ff(n).
Now let K be a strictly increasing sequence of positive integers such that K0>1, n!T∣Kn for all n∈ω, and K.C⊂Hω. We now have that by defining Bi,j=K.TB^i,j, we have the desired rational stack.
∎
7. Solving arc functions on a level of a rational stack
The main tool to solve the arc equation of rational stacks is the same used for integer stacks and we state the lemmas used in [8]. However, there is a crucial difference in the way the stack was defined so that we separate when the denominator grows compared to the numerator, when the numerator and denominator are pretty much at even speed and when the numerator grows compared to the denominator.
7.1. An application of Kronecker’s Lemma
Kronecker’s Lemma says that if {1,θ0,…,θk−1} is a linearly independent subset of the vector space R over the
field Q then {(θ0.n+Z,…,θk−1.n+Z):n∈Z} is a dense subset of Tk (see [1]).
Lemma 7.1**.**
( Lemma 4.3 [8]) If (θ0,…,θr−1) is linearly independent subset of the Q-vector space R and ϵ>0 then there exists a positive integer L such that {(θ0.x+Z,…,θr−1.x+Z):x∈I} is ϵ-dense in the usual Euclidean metric topology, for any interval I of length at least L.
Given ϵ>0 and θ=(θi:i∈I) a finite linearly independent subset of R as a Q-vector space, fix an integer L(θ,ϵ) satisfying the conditions in Lemma 7.1.
Lemma 7.2**.**
(Lemma 4.4 of [8]) Fix a positive real ϵ∗<81. Let θ=(θ0,…,θr−1) be a linearly independent subset of R as a Q-vector space.
Set L=L(θ,ϵ∗) and (a0,…,ar−1) be a sequence of integers such that
i)∣a0∣>…>∣ar−1∣ and
ii)∣θk−a0ak∣<r.Lϵ∗ for each k<r.
Then
a){(a0.x,…,ar−1.x):x∈J} is 2.ϵ∗-dense for any arc J
of length at least ∣a0∣L and
b) for any arc J of length at least 3.∣a0∣L and U any open ball of radius 4.ϵ∗ (in Tr with the Euclidean metric), there exists an arc K contained in J of length r.∣a0∣4.ϵ∗ such that {(a0.x,…,ar−1.x):x∈K}⊆U.
7.2. Solving arc equations on a level of a rational stack
We will present the proof of the remaining technical lemma.
Let S, A, C, M and N be as in Lemma 3.1. Let ϵ be a positive real and D be a finite subset of κ. Then there exist B⊆A cofinite in A and a family of positive real numbers (γn:n∈B) such that:
For every n∈B, for every family (Wh:h∈C) of open arcs of length ϵ, and for every arc function ψ of length ϵ such that supp ψ⊆D∖{ν0,…νk0−1}, there exists an n-solution of length γn for the arc equation (ψ,B,K.C,Kn,W).
Proof.
For each (i,j) with i<k1 and j<li, let ui,j∈Bi,j and vi,j be such that for every h∈Bi,j and n∈A, ∣ui,j(n)(ζi(n))∣≤∣h(n)(ζi(n))∣≤∣vi,j(n)(ζi(n))∣. Fix ϵ∗<min{81,81ϵ}. For each i<k1, j<li and h∈Bi,j, let θh be the limit of (vi,j(n)(ζi(n))h(n)(ζi(n)))n∈A. Let θi,j=(θh:h∈Bi,j) and let L be a fixed integer greater than L(θi,j,ϵ∗) for any i<k1 and j<li.
Let B⊂A be the set of n’s in A is such that
a)θh−vi,j(n)(ζi(n))h(n)(ζi(n))<∣A∣+1.Lϵ∗, for each i<k1, j<li and h∈Bi,j;
b)3.∣vi,li−1(n)(ζi(n))∣L<ϵ∗, for
each i<k1.
c)∣ui,j−1(n)(ζi(n))∣3L≤∣A∣+1.∣vi,j(n)(ζi(n))∣4.ϵ∗, for each i<k1 and j<li, and
d){ζi(n):k0≤i<k1}∩D=∅.
Notice that B is cofinite in A, therefore is in p. Let γn=(∣A∣+1)max{∥h(n)∥:h∈B}ϵ∗ for each n∈B, where ∥h(n)∥=∑μ∈supp h(n)∣h(n)(μ)∣. Now let (Wh:h∈C) and ψ be given. Fix n∈B.
For each h∈C, fix Vh⊆Wh with Vh an arc of length 4ϵ∗.
Given an arbitrary ϵ-arc function ψ as required, fix ψ∗ an ϵ∗-arc function such that supp ψ∗⊇D, supp ψ∗∩{ζi(n):0≤i<k1}=∅, ψ∗≤ψ and supp h(n)∖{ζi(n):k0≤i<k1}⊆supp ψ∗, for each i<k1, j<li and h∈Bi,j.
For each μ∈supp ψ∗ choose xμ such that Knxμ is the center of ψ∗(μ).
For each 0≤i<k1, j<li, notice that {ζ0(n),…,ζk1−1(n)}∩supp h⊂{ζi(n),…,ζk1−1(n)} for each h∈Bi,j.
We will define by downward recursion, for 0<i≤k1−1, an arc Qi,0⊂T.
For the first step i⋆=k1−1, we will define Qi⋆,j for j<li⋆, also by downward recursion. So let j⋆=li⋆−1 be the first step.
Let Oh=Vh−∑μsupp h(n)∖{ζi∗(n)}h(n)(μ)xμ, for each h∈Bi∗,j∗.
Fix an arbitrary arc J of length at least 3.∣vi⋆,j⋆(n)(ζi⋆(n))∣L and Ui⋆,j⋆ the ball of radius 4.ϵ∗ contained in the product of ∏h∈Bi⋆,j⋆Oh. By Lemma 7.2, there exists
an interval Qi⋆,j⋆ contained in J of length ∣A∣+1.∣vi⋆,j⋆(n)(ζi⋆(n))∣4.ϵ∗ such that {(h(n)(ζi⋆(n)).x:h∈Bi⋆,j⋆):x∈Qi⋆,j⋆}⊆Ui⋆,j⋆⊆TBi⋆,j⋆.
Suppose j′<li⋆ and we have defined Qi⋆,j for all j′≤j<li⋆. If j′=0 then we are done for step i⋆=k1−1.
If not: by c), it follows that ∣ui⋆,j′−1(n)(ζi⋆(n))∣3L≤∣A∣+1.∣vi⋆,j′(n)(ζi⋆(n))∣4.ϵ∗ and Qi⋆,j′ has size exactly the right side of the inequality above. Let Ui⋆,j′−1 be a ball of length 4ϵ∗ contained in ∏h∈Bi⋆,j′−1Oh. Applying Lemma 7.2, there exists an arc Qi⋆,j′−1 of length ∣A∣+1.∣vi⋆,j′−1(n)(ζi⋆(n))∣4.ϵ∗ contained in Qi⋆,j′ such that {(h(n)(ζi⋆(n)).x:h∈Bi⋆,j′−1):x∈Qi⋆,j′−1}⊆Ui⋆,j′−1.
We thus obtain, for i⋆=k1−1, Qi⋆,0 an arc of length ∣A∣+1.∣vi⋆,0,(n)(ζi⋆(n))∣4.ϵ∗ such that
{(h(n)(ζi⋆).x:h∈Bi⋆,j):x∈Qi⋆,j}⊆∏h∈Bi⋆,jOh, for each j<li⋆. At the end, we will have defined Qi⋆,0.
Let xζi⋆(n) be the center of Qi⋆,0. By definition of Oh we have
Oh=Vh−∑μ∈supp h(n)∖{ζi⋆(n)}h(n)(μ)xμ, for each j<li⋆ and h∈Bi⋆,j.
Then ∑μ∈supp h(n)h(n)(μ)xμ∈∑μ∈supp h(n)∖{ζi⋆(n)}h(n)(μ)xμ+Oh=Vh, for each j<li⋆ and h∈Bi⋆,j.
The first step of the recursion has been carried out. Suppose 0≤i′<k1 and Qi,0 has been defined for all i′≤i<k1.
If i′=0 then we are done. Otherwise if i′−1≥0:
Let Oh=Vh−∑μ∈supp h(n)∖{ζi′−1(n)}h(n)(μ)xμ, for each j<li′−1 and h∈Bi′−1,j.
It is important here that {ζ0(n),…,ζi′−1(n)}∩supp h={ζi′−1(n)}, for each j<li′−1 and h∈Bi′−1,j.
We are in similar conditions as for i′ to obtain Qi′−1,0 and xζi′−1(n) the center of Qi′−1,0 an arc of length
∣A∣+1.∣vi′−1,0(n)(ζi′−1(n))∣4.ϵ∗ such that
∑μ∈supp h(n)h(n)(μ)xμ∈∑μ∈supp h(n)∖{ζi′−1(n)}h(n)(μ)xμ+Oh=Vh, for each j<li′−1 and h∈Bi′−1,j.
This ends the construction of xμ for each μ∈supp ψ∗∪{ζ0(n),…,ζk1−1(n)}. Choose an arbitrary xμ for μ∈D∖(supp ψ∗∪{ζ0(n),…,ζk0−1(n)}).
Let ϕ(μ) be the arc of center xμ and length γn. We show that ϕ is the solution we are looking for.
By the choice of xμ and since ψ∗≤ψ, it follows Kn.ϕ≤ψ.
Secondly, if h∈Bi,j then ∑μ∈supp h(n)h(n)(μ)xμ∈Vh. It follows that the center of ∑μ∈supp h(n)h(n)(μ)ϕ(μ) is contained in Vh and this arc has length at most ∑μ∈supp h(n)∣h(n)(μ)∣.γn=∑μ∈supp h(n)∣h(n)(μ)∣.(∣A∣+1)max{∥h(n)∥:h∈B}ϵ∗<ϵ∗. Therefore, a point of the arc ∑μ∈supp h(n)h(n)(μ)ϕ(μ) is at a distance smaller than 2ϵ∗+ϵ∗ from the center of Vh. Since Wh and Vh have the same center and 3ϵ∗<2ϵ it follows that ∑μ∈supp h(n)h(n)(μ)ϕ(μ)⊆Wh. Thus,
ϕ is as required.
∎
Dedication
The third listed author would like to dedicate this work to his long term collaborator and friend, Dr. Salvador Garcia Ferreira on the occasion of his 60th birthday.
Bibliography9
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] T. Br o ¨ ¨ o \mathrm{\ddot{o}} cker and T. tom Dieck, Representations of compact Lie groups , Springer, 1985.
2[2] I. Castro-Pereira and A. H. Tomita, Abelian torsion groups with a countably compact group topology , Topology Appl. 157 (2010), 44–52.
3[3] L. Fuchs, Infinite abelian groups , Pure and Applied Mathematics, Elsevier Science, 1970.
4[4] P. R. Halmos, Comment on the real line , Bull. Amer. Math. Soc. 50 (1944), 877–878.
5[5] R. E. Madariaga-Garcia and A. H. Tomita, Countably compact topological group topologies on free Abelian groups from selective ultrafilters , Topology Appl. 154 (2007), 1470–1480.
6[6] M. G. Tkachenko and I. Yaschenko, Independent group topologies on Abelian groups , Topology Appl. 122 (2002), 425–451.
7[7] A. H. Tomita, The existence of initially ω 1 subscript 𝜔 1 \omega_{1} -compact group topologies on free Abelian groups is independent of ZFC , Comment. Math. Univ. Carolinae 39 (1998), 401–413.
8[8] by same author, A group topology on the free abelian group of cardinality 𝔠 𝔠 {\mathfrak{c}} that makes its finite powers countably compact , Topology Appl. 196 (2015), 976–998.