Connected Reduced Products

Abstract: If

h o

is a binary relation on a set

X

, the structure

m a t h b b X = l a n g l e X, h o a n g l e

is connected iff the minimal equivalence relation containing

h o

is the full relation on

X

. We show that, for a set

I

the following conditions are equivalent (a)

| I |

is less than the first measurable cardinal, (b) For each filter

P h i s u b s e t P (I)

and each family

{m a t h b b X}_{i} : i i n I

of binary structures, the reduced product

p r o d_{P} h i {m a t h b b X}_{i}

is connected, iff there are a finite set

K s u b s e t I

and

n i n o m e g a

such that

{m a t h b b X}_{i}

is connected, for each

i i n K

, and

i i n I : {m a t h b b X}_{i} m b o x i s o f d i a m e t e r l e q n c u p K i n P h i

, (c)The ultraproduct

p r o d_{m a t h c a l U} {m a t h b b G}_{o m e g a}

is a disconnected graph for each non-principal ultrafilter

m a t h c a l U s u b s e t P (I)

, where

{m a t h b b G}_{o m e g a}

is the linear graph on

o m e g a

. Moreover, the implication "

L e f t a r r o w

" in (b) holds in ZFC.

This page was built for publication: Connected Reduced Products