On real functions with graphs either connected or locally connected

This paper establishes that the family of graphs of real-valued functions contains uncountably many pairwise non-embeddable spaces with specific topological properties, while simultaneously proving that the locally connected members of this family form a countable, linearly ordered chain under embeddability and fully classifying separable, locally connected refinements of the real line's topology.

The Gist

Imagine the real number line (the infinite line of numbers from negative infinity to positive infinity) not just as a ruler, but as a piece of clay. Usually, we shape this clay into a smooth, unbroken line. This is the standard "Euclidean" way we think about numbers.

However, mathematician Gerald Kuba asks a fascinating question: What if we could reshape this line in weird, wild, and disconnected ways, while still keeping it "connected" in a topological sense?

He explores two main ways to reshape this line:

1. Connected: The line is one single piece; you can travel from any point to any other without jumping.
2. Locally Connected: The line is not only one piece, but every tiny neighborhood you look at is also a single, unbroken piece (like a smooth road, not a road made of scattered stepping stones).

Here is the breakdown of his discoveries using simple analogies.

1. The "Wild" Connected Shapes (The $2^{\mathfrak{c}}$ Family)

Kuba proves that there is a massive, almost unimaginable number of ways to make a connected shape that looks like a function graph (a line that goes up and down but never doubles back on itself).

• The Analogy: Imagine you have a piece of string. Usually, you lay it down straight. But Kuba shows you can twist, knot, and scatter this string across the entire 2D plane (the floor) in such a chaotic way that it touches every patch of floor you care to name, yet it remains one single, unbroken string.
• The "Incomparable" Magic: The most mind-bending part is that he found $2^{\mathfrak{c}}$ (a number so big it dwarfs the number of stars in the universe) of these shapes.
  • The Rule: If you take any two of these shapes, they are "incomparable."
  • What does that mean? Imagine trying to fit a puzzle piece from Shape A into Shape B. You can't. You can't even fit a smaller piece of Shape A into Shape B. They are so fundamentally different in their structure that they cannot be transformed into one another, nor can one be hidden inside the other. They are like unique fingerprints that don't match anything else, even their own smaller parts.
• The Catch: These shapes are "everywhere discontinuous." If you tried to draw them, your pen would never stop jumping. They are mathematically connected, but visually they look like static on a broken TV screen.

2. The "Well-Behaved" Locally Connected Shapes (The Countable Family)

On the other end of the spectrum, Kuba looks at shapes that are locally connected. These are the "smooth" versions.

• The Analogy: Think of these as a road made of distinct segments. Some segments are single points (stops), some are short bridges (intervals), and some are long highways.
• The Discovery: There are only countably many (a small, listable number like 1, 2, 3...) of these unique shapes.
• The "Nested" Rule: Unlike the wild shapes, these smooth shapes are comparable. If you have two of them, one can almost always be found inside the other.
  • The Metaphor: Imagine Russian nesting dolls. You can always find a smaller doll inside a bigger one. In this family, if you have two different locally connected shapes, one is essentially a "sub-version" of the other. They are all variations of the same basic theme.

3. The "Refinement" of the Real Line

Kuba also studies what happens if we change the "rules of distance" (topology) on the number line.

• The Euclidean Line: The standard line where distance is measured normally.
• The Refined Line: A line where the rules are stricter. Points that were close before might now feel "farther apart" or have different neighborhoods.

The Big Conclusion:

• If you want a wild, chaotic, connected line that is totally different from every other wild line, you have an infinite ocean of options ($2^{\mathfrak{c}}$).
• If you want a smooth, locally connected line, your options are very limited (countable), and they all fit inside each other like nesting dolls.
• The Surprise: If you try to make a line that is both wild (discontinuous) and smooth (locally connected), it's impossible. You can't have your cake and eat it too. If it's smooth everywhere, it must be the standard Euclidean line. If you mess with the smoothness, you lose the local connectedness.

Summary in One Sentence

Kuba discovered that while there are uncountably many unique, chaotic, and mutually incompatible ways to twist a connected line, there are only a few simple ways to make a smooth, locally connected line, and those simple ways are all just smaller versions of each other.

Technical Summary

Here is a detailed technical summary of the paper "On real functions with graphs either connected or locally connected" by Gerald Kuba.

1. Problem Statement and Context

The paper investigates the topological properties of the graphs of real functions $F: \mathbb{R} \to \mathbb{R}$ when viewed as subspaces of the Euclidean plane $\mathbb{R}^2$. The central focus is on two specific topological properties: connectedness and local connectedness.

The author explores the family $\mathcal{G}$ of all such graphs and seeks to classify them based on:

1. Cardinality: How many non-homeomorphic (or "incomparable") graphs exist with specific properties?
2. Incomparability: Two spaces $X$ and $Y$ are defined as incomparable if neither is homeomorphic to a subspace of the other (including proper subspaces).
3. Refinements of the Real Line: The paper establishes a correspondence between these graphs and topologies $\tau$ on $\mathbb{R}$ that are finer than the standard Euclidean topology $\eta$. Specifically, for a function $F$, the topology $\tau[F]$ is defined such that the map $x \mapsto (x, F(x))$ is a homeomorphism from $(\mathbb{R}, \tau[F])$ to the graph $F$.

The core question is: What is the structural diversity of connected and locally connected real functions, and how do they relate to refinements of the real line?

2. Methodology

The author employs a combination of classical topology, set theory, and transfinite induction.

• Transfinite Induction: Used extensively in Section 4 to construct specific families of functions. By well-ordering the continuum $\mathbb{R}$ (with order type $\mathfrak{c}$), the author constructs points in the plane step-by-step, ensuring that at each stage, the constructed set avoids previously defined "bad" sets (such as Borel sets or images of previous homeomorphisms).
• Massive Sets: The paper utilizes the concept of "massive" sets (sets intersecting every set of positive Lebesgue measure) to construct functions that are not Lebesgue measurable and are dense in $\mathbb{R}^2$.
• Path-Component Analysis: In the construction of completely metrizable connected functions (Theorem 3), the author analyzes the structure of path-components (specifically counting non-cut points) to distinguish between non-homeomorphic spaces.
• Interval Partitions: For locally connected spaces, the methodology shifts to analyzing the partition of $\mathbb{R}$ into intervals. The author proves that a locally connected refinement of $\mathbb{R}$ is essentially a topological sum of intervals, classified by the cardinality of singletons, compact intervals, half-open intervals, and open intervals.
• Ultrafilters and Vector Spaces: In the final section, the author uses the vector space structure of $\mathbb{R}$ over $\mathbb{Q}$ and ultrafilters to construct non-metrizable, separable, connected refinements.

3. Key Contributions and Results

A. Connected Real Functions

The paper distinguishes sharply between connected and locally connected functions.

• Theorem 1 (Massive Connected Functions): There exist $2^{\mathfrak{c}}$(where$\mathfrak{c} = 2^{\aleph_0}$) real functions whose graphs are:

  • Connected.
  • Dense in $\mathbb{R}^2$ (and even "massive," intersecting every set of positive measure).
  • Incomparable: No graph is homeomorphic to a subspace of another.
  • Note: These functions are nowhere continuous and not completely metrizable.

• Theorem 2 (Discontinuity of Metrizable Connected Functions): If a connected function $F$ is completely metrizable (i.e., its graph is a $G_\delta$ set), then the set of its discontinuity points is a meager subset of $\mathbb{R}$. This implies that "wild" connected functions (like those in Theorem 1) cannot be completely metrizable.

• Theorem 3 (Completely Metrizable Connected Functions): There exist $\mathfrak{c}$ real functions that are:

  • Connected.
  • Completely metrizable.
  • Incomparable.
  • Construction: These are built using sequences of path-components (sine curves and intervals) where the sequence of component types encodes a unique binary sequence, ensuring non-homeomorphism.

B. Locally Connected Real Functions

The behavior of locally connected functions is drastically different and much more rigid.

• Proposition 1: A real function cannot be both connected and locally connected unless it is continuous (i.e., the graph is homeomorphic to the standard real line). If a refinement is strictly finer than the Euclidean topology at any point, it cannot be both connected and locally connected.
• Theorem 4 (Classification of Locally Connected Refinements):
  • There are only countably many mutually non-homeomorphic locally connected refinements of $\mathbb{R}$.
  • If such a space is separable, it is homeomorphic to the graph of a function $F$ where the set of discontinuity points $\Gamma(\tau[F])$ is countable and Euclidean closed.
  • Incomparability Failure: Unlike the connected case, locally connected spaces are never incomparable. Every locally connected refinement is homeomorphic to a proper subspace of itself (and of others).

C. Classification of Topologies

• Theorem 5: The author provides a complete classification of locally connected refinements based on the "type" of the interval partition of $\mathbb{R}$. The type is a quadruple $(\alpha, \beta, \gamma, \delta)$ representing the cardinalities of singletons, compact intervals, half-open intervals, and open intervals.
  • Countable partitions correspond to separable spaces.
  • Uncountable partitions correspond to non-separable spaces.
• Theorem 6 (Non-Metrizable Case): If the requirement of metrizability is dropped, the cardinality of incomparable, separable, connected refinements jumps to $2^{2^{\mathfrak{c}}}$. This is achieved using ultrafilters on a basis of$\mathbb{R}$over$\mathbb{Q}$.

4. Significance and Implications

1. Dichotomy of Connectedness: The paper highlights a profound dichotomy in the realm of real functions.

   • Connected: The space of connected graphs is vast ($2^{\mathfrak{c}}$ incomparable types), allowing for extreme topological complexity (massive, non-measurable, non-metrizable).
   • Locally Connected: The space is extremely small (countable types) and rigid. Local connectedness forces the structure to be a simple sum of intervals, destroying the "wild" behavior seen in general connected graphs.

2. Topological Refinements: The work provides a complete taxonomy of how the real line can be topologically refined while maintaining connectedness. It clarifies the boundary between metrizable and non-metrizable refinements, showing that removing metrizability explodes the cardinality of incomparable structures from $2^{\mathfrak{c}}$to$2^{2^{\mathfrak{c}}}$.

3. Counterexamples and Existence: The paper constructs explicit counterexamples to intuitive notions, such as the existence of connected, dense, non-metrizable graphs that are "incomparable" to one another, and the impossibility of a discontinuous function being both connected and locally connected.

4. Methodological Impact: The techniques used, particularly the combination of transfinite induction with the analysis of path-components and interval partitions, offer a robust framework for constructing and classifying pathological topological spaces.

In summary, Kuba's paper rigorously maps the landscape of real function graphs, demonstrating that while connectedness allows for a universe of $2^{\mathfrak{c}}$ distinct, incomparable topological structures, the addition of local connectedness collapses this universe to a countable, well-understood classification.