Setwise and Pointwise Betweenness via Hyperspaces Qays Shakir joint - - PowerPoint PPT Presentation

setwise and pointwise betweenness via hyperspaces
SMART_READER_LITE
LIVE PREVIEW

Setwise and Pointwise Betweenness via Hyperspaces Qays Shakir joint - - PowerPoint PPT Presentation

Setwise and Pointwise Betweenness via Hyperspaces Qays Shakir joint with Aisling McCluskey National University of Ireland,Galway 12th Symposium on General Topology and its Relations to Modern Analysis and Algebra 25 29 July 2016 Prague,


slide-1
SLIDE 1

Setwise and Pointwise Betweenness via Hyperspaces

Qays Shakir joint with Aisling McCluskey

National University of Ireland,Galway 12th Symposium on General Topology and its Relations to Modern Analysis and Algebra 25−29 July 2016 Prague, Czech Republic

slide-2
SLIDE 2

Overview

1

Motivation

2

Setwise Betweenness via 2X and Fn(X)

3

Pointwise Betweenness via 2X and Fn(X)

slide-3
SLIDE 3

Motivation

An intuitive view of betweenness arises naturally in any order-theoretic structure; given a preorder ≤ on a set X, with a, b, c ∈ X such that a ≤ c ≤ b, we say that ”c is between a and b”. Let (X, ≤) be a partially ordered set. Define for a ≤ b, [a, b]O = {c ∈ X : a ≤ c ≤ b}. If (X, ≤) is a tree with a common lower bound d of a, b. O(a, b, d) = [d, a]O [d, b]O.

b a

slide-4
SLIDE 4

Motivation

An intuitive view of betweenness arises naturally in any order-theoretic structure; given a preorder ≤ on a set X, with a, b, c ∈ X such that a ≤ c ≤ b, we say that ”c is between a and b”. Let (X, ≤) be a partially ordered set. Define for a ≤ b, [a, b]O = {c ∈ X : a ≤ c ≤ b}. If (X, ≤) is a tree with a common lower bound d of a, b. Define O(a, b, d) = [d, a]O [d, b]O. Define [a, b]T = {c ∈ O(a, b, d) : d ≤ a, b}

d d d b a

slide-5
SLIDE 5

Motivation

An intuitive view of betweenness arises naturally in any order-theoretic structure; given a preorder ≤ on a set X, with a, b, c ∈ X such that a ≤ c ≤ b, we say that ”c is between a and b”. Let (X, ≤) be a partially ordered set. Define for a ≤ b, [a, b]O = {c ∈ X : a ≤ c ≤ b}. If (X, ≤) is a tree with a common lower bound d of a, b. Define O(a, b, d) = [d, a]O [d, b]O. Define [a, b]T = {c ∈ O(a, b, d) : d ≤ a, b}

d d d c c b c a

slide-6
SLIDE 6

Motivation

Let X be a vector space over the real field R and let a, b ∈ X. The convex interval can be defined as follows: A vector c ∈ X is between a and b if c ∈ [a, b]conv = {at + (1 − t)b : t ∈ [0, 1]}. So [a, b]conv is the set of all convex combinations of a and b.

  • a

b

slide-7
SLIDE 7

Motivation

Let X be a vector space over the real field R and let a, b ∈ X. The convex interval can be defined as follows: A vector c ∈ X is between a and b if c ∈ [a, b]conv = {at + (1 − t)b : t ∈ [0, 1]}. So [a, b]conv is the set of all convex combinations of a and b.

O a b c

slide-8
SLIDE 8

Road Systems and Pointwise Betweenness

Paul Bankston introduced the following definitions:

Definition

A road system is a pair X, R, where X is a nonempty set and R is a collection of nonempty subsets of X -called the roads- such that:

1 For each a ∈ X, the singleton set {a} is a road. 2 Each two points a, b ∈ X belong to at least one road.

slide-9
SLIDE 9

Road Systems and Pointwise Betweenness

Paul Bankston introduced the following definitions:

Definition

A road system is a pair X, R, where X is a nonempty set and R is a collection of nonempty subsets of X -called the roads- such that:

1 For each a ∈ X, the singleton set {a} is a road. 2 Each two points a, b ∈ X belong to at least one road.

Definition

Let X, R be a road system and a, b, c ∈ X. Then c ∈ [a, b]R if every road containing a and b also contain c. Then c ∈ [a, b]R if c ∈ {R ∈ R : R ∈ R(a, b)} where R(a, b) denotes the set of roads that contain both a and b

slide-10
SLIDE 10

Road Systems and Setwise Betweenness

There is a natural generalisation from pointwise betweenness to setwise betweenness as follows:

Definition

Let X, R be a road system with a, b ∈ X and ∅ = C ⊆ X. We say that C is between a and b if C R = ∅ for all R ∈ R(a, b)

slide-11
SLIDE 11

Vietoris Hyperspace (2X)

Definition

Let X be a T1 space. The Vietoris topology 2X on CL(X), the collection of all non-empty closed subsets of X, is the one generated by sets of the form U+ = {A ∈ CL(X) : A ⊂ U} U− = {A ∈ CL(X) : A U = ∅} where U is an open subset of X. A basis of the Vietoris topology consists of the collection of sets of the form U1, U2, ..., Un = {A ∈ CL(X) : A ⊆

n

  • i=1

Ui and if i ≤ n, A

  • Ui = ∅}

where U1, U2, ..., Un are non-empty open subsets of X.

slide-12
SLIDE 12

n-fold Symmetric Product hyperspace Fn(X)

Definition

Let X be a T1 space, the hyperspace Fn(X), called n-fold symmetric product of X, is a subspace of the Vietoris space 2X defined as follows Fn(X) = {A ∈ X : |A| ≤ n}

Some properties of Fn(X)

F1(X) ∼ = X Fn(X) ⊆ Fn+1(X) If X is a Hausdorff space then Fn(X) is a closed subspace in the Vietoris hyperspace.

slide-13
SLIDE 13

Setwise Betweenness via 2X and Fn(X)

slide-14
SLIDE 14

Setwise Betweenness via 2X and Fn(X)

Notation

Let X be a topological space and a, b ∈ X, the collection of sets that satisfies a topological property P forms a road system. The collection of sets that contain a and b and satisfy a topological property P is denoted by P(a, b).

Definition

Let X be a T1 space. Define the setwise interval with respect to a property P and a hyperspace H as follows: [a, b]SP

H = {C ∈ H : C K = ∅ for every K ∈ P(a, b)}

slide-15
SLIDE 15

The Setwise Interval [a, b]SCO

2X

slide-16
SLIDE 16

The Setwise Interval [a, b]SCO

2X

Definition

Let X be a topological space. Define the setwise interval with respect to the Vietoris hyperspace 2X as follows: [a, b]SCO

2X

= {C ∈ 2X : C K = ∅ for every K ∈ CO(a, b)} where CO(a, b) the collection of all connected sets that contains a and b.

slide-17
SLIDE 17

The Setwise Interval [a, b]SCO

2X

Example

Let X = C B be a subspace of the R2 where C = [ 1

2, 1] and

B = {(0, 0)} ∞

n=1 Cn. Now if a ∈ Ci and b ∈ Cj with i = j then for a

A ∈ 2X to be lie in the interval [a, b]SCO

2X

it is necessary and sufficient that (0, 0) ∈ A.

slide-18
SLIDE 18

Some Properties of The Interval [a, b]SCO

2X

Let X be a T1 space with a, b ∈ X. Then

1 {a}, {b} ∈ [a, b]SCO

2X

2 [a, b]SCO

2X

⊆ [a, a]SCO

2X

, [b, b]SCO

2X

slide-19
SLIDE 19

Some Properties of The Interval [a, b]SCO

2X

Let X be a topological space with a, b ∈ X. Then

1 {a}, {b} ∈ [a, b]SCO

2X

2 [a, b]SCO

2X

⊆ [a, a]SCO

2X

, [b, b]SCO

2X

Theorem

If f : X − → Y be a homeomorphism then f ([a, b]SCO

2X

) = [f (a), f (b)]SCO

2Y

slide-20
SLIDE 20

The Setwise Interval [a, b]SCO

n(X)

slide-21
SLIDE 21

The Setwise Interval [a, b]SCO

n(X)

Definition

Let X be a topological space. Define the setwise interval with respect to the n-fold symmetric product hyperspace Fn(X) as follows: [a, b]SCO

n(X) = {C ∈ Fn(X) : C K = ∅ for every K ∈ CO(a, b)}

slide-22
SLIDE 22

The Setwise Interval [a, b]SCO

n(X)

Example

Let X be the comb space and A = {[x, 0] [0.2, y] : where 0.2 ≤ x ≤ 0.6 and 0 ≤ y ≤ 0.4}. It is clear that A ∈ CO(a, b). Thus for C ∈ Fn(X) to lie between a and b, i.e. to be sure that C ∈ [a, b]PCO

n(X) it is enough for C to intersect A.

slide-23
SLIDE 23

Some Properties of The Interval [a, b]SCO

n(X) continue ....

Some properties of the setwise interval [a, b]SCO

n(X)

Let X be a topological space with a, b ∈ X. Then

1 {a}, {b} ∈ [a, b]SCO

n(X)

2 [a, b]SCO

n(X) ⊆ [a, a]SCO n(X), [b, b]SCO n(X)

3 For n ≥ 3, we have [a, b]SCO

n(X)

[b, c]SCO

n(X) = ∅

4 [a, b]SCO

1(X) ⊆ [a, b]SCO 2(X) ⊆ ... ⊆ [a, b]SCO n(X)

slide-24
SLIDE 24

Some Properties of The Interval [a, b]SCO

n(X) continue ....

Some properties of the setwise interval [a, b]SCO

n(X)

Let X be a topological space with a, b ∈ X. Then

1 {a}, {b} ∈ [a, b]SCO

n(X)

2 [a, b]SCO

n(X) ⊆ [a, a]SCO n(X), [b, b]SCO n(X)

3 For n ≥ 3, we have [a, b]SCO

n(X)

[b, c]SCO

n(X) = ∅

4 [a, b]SCO

1(X) ⊆ [a, b]SCO 2(X) ⊆ ... ⊆ [a, b]SCO n(X)

Proposition

Proposition: Let X be a topological space with a, b ∈ X and Ci ∈ Fn(X) for i = 1, 2, ... such that C1 ⊂ C2 ⊂ .... If C1 ∈ [a, b]SCO

n(X) then

Ci ∈ [a, b]SCO

n(X) for each i = 2, 3, ...

slide-25
SLIDE 25

Some Properties of The Interval [a, b]SCO

n(X) continue ....

Theorem

If f : X − → Y be a homeomorphism then f ([a, b]SCO

n(X)) = [f (a), f (b)]SCO n(Y )

slide-26
SLIDE 26

Pointwise Betweenness via 2X and Fn(X)

Definition

Let X be a topological space with x ∈ X. The hyperstar collection of x with respect to a hyperspace H is defined by st(x, H) = {C ∈ H : x ∈ C}

slide-27
SLIDE 27

Pointwise Betweenness via 2X and Fn(X)

Definition

Let X be a topological space with x ∈ X. We define the hyperstar collection of x with respect to a hyperspace H as follows: st(x, H) = {C ∈ H : x ∈ C} st(x, 2X) = {C ∈ 2X : x ∈ C} st(x, Fn(X)) = {C ∈ Fn(X) : x ∈ C}

slide-28
SLIDE 28

Pointwise Betweenness via 2X and Fn(X)

Definition

Let X be a topological space with x ∈ X. We define the hyperstar collection of x with respect to a hyperspace H is defined by st(x, H) = {C ∈ H : x ∈ C} st(x, 2X) = {C ∈ 2X : x ∈ C} st(x, Fn(X)) = {C ∈ Fn(X) : x ∈ C} Some properties of st(x, Fn(X)) st(x, F1(X)) = {{x}} st(x, Fn(X)) ⊂ st(x, Fn+1(X))

slide-29
SLIDE 29

Pointwise Betweenness via 2X and Fn(X)

Definition

Let X be a T1 space. We define the hyperstar collection of a set C ⊂ X as follows: st(C, Fn(X)) =

  • c∈C

st(c, Fn(X))

slide-30
SLIDE 30

Pointwise Betweenness via 2X and Fn(X)

slide-31
SLIDE 31

Pointwise Betweenness via 2X and Fn(X)

slide-32
SLIDE 32

Pointwise Betweenness via 2X and Fn(X)

Definition

Let X be a topological space with a, b, c ∈ X. We say that c lies between a and b with respect to a hyperspace H ( denoted by c ∈ [a, b]PP

H

) if st(c, H) ⊂ [a, b]SP

H .

slide-33
SLIDE 33

Pointwise Betweenness via 2X and Fn(X)

Definition

Let X be a topological space with a, b, c ∈ X. We say that c lies between a and b with respect to a hyperspace H ( denoted by c ∈ [a, b]PP

H

) if st(c, H) ⊂ [a, b]SP

H .

Pointwise interval via 2X Definition

Let X be a topological space. Define the pointwise interval with respect to 2X as follows: [a, b]PCO

2X

= {c ∈ X : st(c, 2X) ⊂ [a, b]SCO

2X

}

slide-34
SLIDE 34

Pointwise Betweenness via 2X and Fn(X)

slide-35
SLIDE 35

Pointwise Betweenness via 2X and Fn(X)

Pointwise interval via Fn(X) Definition

Let X be a topological space. Define the pointwise interval with respect to Fn(X) as follows: [a, b]PCO

n(X) = {c ∈ X : st(c, Fn(X)) ⊂ [a, b]SCO n(X)}

slide-36
SLIDE 36

Pointwise Betweenness via 2X and Fn(X)

Pointwise interval via Fn(X) Definition

Let X be a topological space. Define the pointwise interval with respect to Fn(X) as follows: [a, b]PCO

n(X) = {c ∈ X : st(c, Fn(X)) ⊂ [a, b]SCO n(X)}

Some properties

{a, b} ⊂ [a, b]PCO

n(X)

[a, b]PCO

n(X) = [b, a]PCO n(X)

[a, b]PCO

n(X) ⊂ [a, b]PCO n+1(X)

Let f : X → Y be a homeomorphism map, then f ([a, b]PCO

n(X)) = [f (a), f (b)]PCO n(Y )

slide-37
SLIDE 37

A New Set Arose from Betweenness Setwise Interval [a, b]SCO

n(X)

Definition

Let X be a topological space with a, b, c ∈ X. C n(X)

a,b

= {c ∈ X : c ∈ [a, b]PCO

Fn(X)}

slide-38
SLIDE 38

A New Set Arose from Betweenness Setwise Interval [a, b]SCO

n(X)

Definition

Let X be a topological space with a, b, c ∈ X. C n(X)

a,b

= {c ∈ X : c ∈ [a, b]PCO

Fn(X)}

Let X be a topological space with a, b ∈ X. Then

1 a, b ∈ C n(X)

a,b

2 If |C n(X)

a,b

| ≤ n then C n(X)

a,b

∈ [a, b]SCO

n(X)

3 C n(X)

a,b

⊆ C n+1(X)

a,b

4 C n(X)

a,b

⊂ C n(X)

a,a

, C n(X)

b,b

slide-39
SLIDE 39

A New Set Arose from Betweenness Setwise Interval [a, b]SCO

n(X)

Definition

Let X be a topological space with a, b, c ∈ X. We define the following set: C n(X)

a,b

= {c ∈ X : c ∈ [a, b]PCO

n(X)}

Let X be a topological space with a, b ∈ X. Then

1 a, b ∈ C n(X)

a,b

2 If |C n(X)

a,b

| ≤ n then C n(X)

a,b

∈ [a, b]SCO

n(X)

3 C n(X)

a,b

⊆ C n+1(X)

a,b

4 C n(X)

a,b

⊂ C n(X)

a,a

, C n(X)

b,b

Theorem

If f : X − → Y be a homeomorphism between two topological spaces then f (C n(X)

a,b

) = C n(Y )

f (a),f (b)

slide-40
SLIDE 40

Thank You