A DICHOTOMY THEOREM FOR GRAPHS INDUCED BY COMMUTING FAMILIES OF BOREL INJECTIONS BENJAMIN D. MILLER Abstract. We prove a dichotomy theorem for oriented graphs induced by certain families of commuting partial injections.

An embedding of a graph G on a Polish space X into a graph H on a Polish space Y is an injective Borel function π : X → Y such that ∀x1 , x2 ∈ X ((x1 , x2 ) ∈ G ⇔ (π(x1 ), π(x2 )) ∈ H). So as to maintain consistency with the notation of Kechris-Solecki-Todorˇcevi´c [1], we write G v↔ c H to indicate the existence of a continuous embedding. Given partial injections f and g on X, we use f ◦g to denote the partial injection such that dom(f ◦ g) = dom(g) ∩ g −1 (dom(f )) and [f ◦ g](x) = f (g(x)), for all x ∈ dom(f ◦ g). We say that a partial injection is Borel if its graph is Borel. (Our results here generalize to partial injections with Σ11 graphs; we make the stronger assumption so as to simplify some of the proofs.) Suppose now that hg0 , g1 , . . .i is a sequence of Borel partial injections. Let g∅ denote the empty partial injection, and for each s ∈ 2n+1 , set s(0)

gs = g0

◦ · · · ◦ gns(n) .

Let supp(s) = {k < |s| : s(k) = 1}. We say that a sequence hg0 , g1 , . . .i of commuting Borel partial injections is prismatic if for all n ∈ N, s, t ∈ 2n , and k ∈ N such that supp(t) 6= supp(s) q {k}, the composition gt−1 ◦ gk ◦ gs is fixed-point free. We say that a directed graph G on a Polish space is an oriented prism if there is a prismatic sequence hg0 , g1 , . . .i such that G = n∈N graph(gn ). For each n ∈ N, let gn2 be the partial injection of 2N such that dom(gn2 ) = {x ∈ X : x(n) = 0} and gn2 (s0x) = s1x, for all s ∈ 2n and x ∈ 2N . It is clear that hg02 , g12 , . . .i is a prismatic sequence whose induced equivalence relation is E0 , so → that the directed graph G2 = n∈N graph(gn2 ) is an oriented prism whose sym→ → metrization is a graphing of E0 . As G0→ ⊆ G2 , it follows that χB (G2 ) = c.

S

S

Theorem 1. Suppose that X is a Polish space and G is an oriented prism on X. Then exactly one of the following holds: 1. χB (G) ≤ ℵ0 . → v↔ 2. G2 c G.

S

Proof. As (1) ⇒ ¬(2) is straightforward, we shall prove only ¬(1) ⇒ (2). Fix a prismatic sequence hg0 , g1 , . . .i such that G = n∈N graph(gn ), and let EG denote the equivalence relation induced by the symmetrization of G. It is sufficient to produce a continuous injection π : 2N → X such that: 1

2

BENJAMIN D. MILLER

→ (i) ∀αE0 β ((α, β) ∈ G2 ⇔ (π(α), π(β)) ∈ G).

(ii) ∀α, β ∈ 2N (π(α)EG π(β) ⇒ αE0 β). Towards this end, let I denote the σ-ideal generated by G-discrete Borel sets, and let Hn denote the finite set of Borel partial injections of the form gi±1 ◦ · ◦ gi±1 , 1 m where i1 , . . . , im , m ≤ n. By standard change of topology results, we can assume that X is a zero-dimensional Polish space and each gn is a partial homeomorphism with clopen domain and range. We will find clopen sets An ⊆ X and natural numbers kn , from which we define hs : X → X, for s ∈ 2
s(n)

hs = gk0 . . . gkn , for s ∈ 2n+1 . We will ensure that, for all n ∈ N, the following conditions hold: (a) An 6∈ I. (An ). (b) An+1 ⊆ An ∩ gk−1 n (c) ∀s, t ∈ 2n ∀h ∈ Hn (h ◦ hs (An+1 ) ∩ ht ◦ gkn (An+1 ) = ∅). (d) ∀s ∈ 2n+1 (diam(hs (An+1 )) ≤ 1/n). We begin by setting A0 = X. Suppose now that we have found hAi ii≤n and hki ii
S

Proof. As An 6∈ I, it is enough to show that the set A = An \ k∈N Uk is in I. Towards this end, let G|A = G ∩ (A × A), and note that if (x, y) ∈ G|A, then there exists s, t ∈ 2n and h ∈ Hn such that y = h−1 ◦ h ◦ hs (x). It follows that the t symmetrization of G|A is of bounded vertex degree. Proposition 4.6 of KechrisSolecki-Todorˇcevi´c [1] then ensures that χB (G|A) < ℵ0 , thus A ∈ I. 2 By Lemma 2, there exists k ∈ N such that Uk ∈ / I. Set kn = k. As each gn is a partial homeomorphism with clopen domain and range, we can write Uk as the union of countably many clopen sets U such that: (c0 ) ∀s, t ∈ 2n ∀h ∈ Hn (h ◦ hs (U ) ∩ ht ◦ gkn (U ) = ∅). (d0 ) ∀s ∈ 2n+1 (diam(hs (U )) ≤ 1/n). Fix such a U which is not in I, and set An+1 = U . This completes the recursive construction. For each s ∈ 2n , put Bs = hs (An ). Conditions (b) and (d) ensure that, for each α ∈ 2N , the sets Bα|0 , Bα|1 , . . . are decreasing, clopen, and of vanishing diameter, and therefore have singleton intersection. Define π : 2N → X by π(α) = the unique element of

\

Bα|n .

n∈N

It follows from conditions (c) and (d) that π is a continuous injection, so it only remains to check conditions (i) and (ii). We note first the following lemma:

3

A DICHOTOMY THEOREM

Lemma 3. Suppose that n ∈ N, s ∈ 2n , and α ∈ 2N . Then π(sα) = hs ◦ π(0n α). Proof. Simply observe that

\

{π(sα)} =

\

B(sα)|i

i≥n

=

hs h0n (α|i) (Ai+n )

„

i≥0

= hs

„

\

h0n (α|i) (Ai+n )

Ž

i≥0

= hs

\

Ž

B(0n α)|i

i≥n

= {hs ◦ π(0n α)}, 2

thus π(sα) = hs ◦ π(0n α).

→ To see (i), suppose first that (α, β) ∈ G2 , fix n ∈ N maximal such that α(n) 6= N β(n), set s = α|n = β|n, and fix γ ∈ 2 such that α = s0γ and β = s1γ. Then Lemma 3 and the fact that hg0 , g1 , . . .i is prismatic ensure that

π(β)

= = = =

π(s1γ) hs ◦ gkn ◦ π(0n+1 γ) gkn ◦ hs ◦ π(0n+1 γ) gkn ◦ π(α),

thus (π(α), π(β)) ∈ G. Suppose now that αE0 β and (π(α), π(β)) ∈ G. Fix n ∈ N, s, t ∈ 2n+1 , and γ ∈ 2N such that α = sγ and β = tγ. Then Lemma 3 ensures that π(α) = hs ◦π(0n γ) and π(β) = ht ◦π(0n γ), so there exists k ∈ N such that gk ◦hs ◦π(0n γ) = ht ◦π(0n γ). Let m = maxi≤n ki , and for each u ∈ 2n+1 , let u0 be the element of 2m+1 such that supp(u0 ) = {ki : i ∈ supp(u)}, so that hu = gu0 . Then gk ◦gs0 ◦π(0n γ) = gt0 ◦π(0n γ), and since hg0 , g1 , . . .i is prismatic, it follows that supp(t0 ) = supp(s0 ) q {k}, thus k = ki , for some i ≤ n, and supp(t) = supp(s) q {ki }, so gi2 (α) = gi2 (sγ) = tγ = β, → so (α, β) ∈ G2 . To see (ii), it is enough to check that if α, β ∈ 2N and α(n) 6= β(n), then there is no h ∈ Hn such that h ◦ π(α) = π(β). Suppose, towards a contradiction, that there is such an h ∈ Hn . As Hn is symmetric, we can assume that α(n) = 0 and β(n) = 1. Set s = α|n and t = β|n, and fix γ, δ ∈ 2N such that α = s0γ and β = t1δ. Lemma 3 ensures that π(α) = hs ◦ π(0n+1 γ) and π(β) = ht ◦ gkn ◦ π(0n+1 δ). As π(0n+1 γ), π(0n+1 δ) ∈ An+1 , it follows that π(β) ∈ h ◦ hs (An+1 ) ∩ ht ◦ gkn (An+1 ), which contradicts condition (c). 2 References [1] A. Kechris, S. Solecki, and S. Todorˇcevi´c. Borel chromatic numbers. Adv. Math., 141 (1), (1999), 1–44

a dichotomy theorem for graphs induced by commuting ...

is a prismatic sequence whose induced equivalence relation is E0, so that the directed graph G→. 2. = S n∈N graph(g. 2 n ) is an oriented prism whose sym-.

129KB Sizes 2 Downloads 238 Views

Recommend Documents

a dichotomy theorem for graphs induced by commuting families of ...
Then gk ◦gs' ◦π(0nγ) = gt' ◦π(0nγ), and since 〈g0,g1,...〉 is prismatic, it follows that supp(t ) = supp(s )∐ {k}, thus k = ki, for some i ≤ n, and supp(t) = supp(s)∐ {ki}, ...

A STRUCTURE THEOREM FOR RATIONALIZABILITY ...
under which rti (ai) is a best reply for ti and margΘXT−i. (πti,rti (ai)) = κti . Define a mapping φti,rti (ai),m : Θ* → Θ* between the payoff functions by setting. (A.5).

A STRUCTURE THEOREM FOR RATIONALIZABILITY IN ... - STICERD
We show that in any game that is continuous at infinity, if a plan of action ai is rationalizable ... Following Chen, we will use the notation customary in incomplete ...

A STRUCTURE THEOREM FOR RATIONALIZABILITY IN ... - STICERD
particular, there, we have extensively discussed the meaning of perturbing interim ..... assumption that Bi (h), the set of moves each period, is finite restricts the ...

Drug-induced Hypersensitivity Syndrome (DIHS): A Reaction Induced ...
Email: tpshio@kyorin―u.ac.jp. Received 2 November .... nally return to normal on full recovery. Another .... strong positive after recovery (Manuscript in prepara-.

Polynomial algorithm for graphs isomorphism's
Polynomial algorithm for graphs isomorphism's i. Author: Mohamed MIMOUNI. 20 Street kadissia Oujda 60000 Morocco. Email1 : mimouni.mohamed@gmail.

A Game Theoretic Approach to Distributed Coverage of Graphs by ...
A Game Theoretic Approach to. Distributed Coverage of Graphs by. Heterogeneous Mobile Agents. A. Yasin Yazıcıo˘glu ∗ Magnus Egerstedt ∗ Jeff S. Shamma ...

ATF3 attenuates cyclosporin A-induced nephrotoxicity by ... - GitHub
ation, cell cycle arrest, and apoptosis. In response to CsA challenge, stress-inducible genes such as ATF3 are expressed, facilitating cell survival. ATF3 downregulates CHOP, which is the principal media- tor of CsA-induced nephrotoxicity. The knockd

A minmax theorem for concave-convex mappings with ...
Sion [4] or see Sorin [5] and the first chapter of Mertens-Sorin-Zamir [2] for a .... (5). Then X and Y are both finite dimensional but unbounded, f is concave-.

A NOTE ON THE TRACE THEOREM FOR DOMAINS ...
is to fill that gap and generalize that result for ω ⊂ Rn−1, n > 1, and arbitrary ..... the Texas Higher Education Coordinating Board, Advanced Research Program.

A Folk Theorem for Minority Games
May 27, 2004 - Email addresses: [email protected] (Jérôme Renault), ... tion: The players repeat a known one-shot game and after each stage ...

A Representation Theorem for (q-)Holonomic Sequences
Jan 9, 2013 - Preprint submitted to Journal of Computer and System Sciences .... We say a class K of structures of vocabulary ρ is definable in MSOL if there ...... D. Hirschberg, editors, Computer Programming and Formal Systems, pages ...

A decomposition theorem for characteristic 0 henselian ...
Nov 6, 2007 - Swiss cheese. Definition. A swiss cheese is a subset of K of the form B\(C1 ∪...∪Cn), where B,C1,...,Cn are all balls (or K itself), with Ci ⊊ B.

A Folk Theorem for Stochastic Games with Private ...
Page 1 ... Keywords: Stochastic games, private monitoring, folk theorem ... belief-free approach to prove the folk theorem in repeated prisoners' dilemmas.

A Structure Theorem for Rationalizability in Infinite ...
For any type t1 in this game, consider a rationalizable plan of action ... This is because a plan of action cannot be strictly ... However, continuity at infinity turns out ...

A Folk Theorem for Minority Games
May 27, 2004 - phases which use, in an unusual way, the pure actions that were ...... Cc m.. ≤ ϵ. One may also assume that for all m ≥ M2, we have. 3/. √.

A Survey on Efficiently Indexing Graphs for Similarity ...
Keywords: Similarity Search, Indexing Graphs, Graph Edit Distance. 1. Introduction. Recently .... graph Q, we also generate its k-ATs, and for each graph G in the data set we calculate the number of common k-ATs of Q and G. Then we use inequality (1)