Fact-checked by Grok 2 weeks ago

Discrete space

In topology, a discrete space is a topological space (X, \tau) where \tau is the discrete topology, consisting of all subsets of X as open sets. This makes the discrete topology the finest (largest) possible topology on the set X, as its collection of open sets is precisely the power set \mathcal{P}(X). Discrete spaces possess the strongest separation properties among topological spaces. Every singleton \{x\} for x \in X is an open set, which implies that discrete spaces are T_0, T_1, Hausdorff (T_2), (T_3), and (T_4); specifically, for distinct points x, y \in X, the open sets \{x\} and \{y\} are disjoint neighborhoods separating them. They contain no accumulation points, as every point is isolated. Furthermore, every function f: X \to Y from a discrete space X to any topological space Y is continuous, since the preimage f^{-1}(U) of any open set U \subseteq Y is a subset of X, and all subsets of X are open. A discrete space is compact if and only if the underlying set X is finite, because an infinite discrete space admits an open cover by singletons with no finite subcover. Discrete spaces are metrizable via the discrete metric, defined by d(x, y) = 1 if x \neq y and d(x, x) = 0, which generates the by making open balls around each point equal to singletons for sufficiently small radii. Common examples include any equipped with the , where the space is both compact and totally disconnected. The set of integers \mathbb{Z} with the inherited from the \mathbb{R} () is also discrete, as each integer is an with neighborhood (n-0.5, n+0.5) intersecting \mathbb{Z} only at n. In contrast, the \mathbb{Q} as a subspace of \mathbb{R} are not discrete, due to the presence of accumulation points everywhere.

Definitions

Topological definition

In , a discrete space is a X in which every subset of X is an . This means that the topology on X consists precisely of all possible subsets of X, forming the power set \mathcal{P}(X). Equivalently, a space is discrete if every set \{x\} for x \in X is open, since singletons are subsets and thus open by definition. This topology represents the finest possible topology on the set X, as it includes every conceivable collection of open sets and is finer than any other topology on X. In such a space, the open sets satisfy the topological axioms—namely, the empty set and X are open, arbitrary unions of open sets are open, and finite intersections of open sets are open—trivially, since all subsets qualify as open. The discrete topology can be induced by equipping X with the discrete , though this metric characterization is explored separately. The framework for abstract topological spaces was established by in his seminal 1914 work Grundzüge der Mengenlehre, where he axiomatized topological structures using systems of neighborhoods to generalize concepts. The topology exemplifies an extremal case within this framework.

Metric characterization

A on a nonempty set X is defined by d(x, y) = \begin{cases} 0 & \text{if } x = y, \\ 1 & \text{if } x \neq y. \end{cases} This satisfies the properties of a , including the , and in fact strengthens it to the ultrametric inequality d(x, z) \leq \max\{d(x, y), d(y, z)\}. The topology induced by the discrete metric on X is the discrete topology. To see this, consider an open ball B(x, r) for x \in X and r > 0. If r \leq 1, then B(x, r) = \{x\}, which is open in the discrete topology. If r > 1, then B(x, r) = X, also open. Thus, every is open. Conversely, any U \subseteq X is a of singletons \{u\} for u \in U, so every subset is open. More generally, a (X, d) induces the discrete topology every point x \in X is isolated, meaning there exists \epsilon_x > 0 such that B(x, \epsilon_x) = \{x\}. The discrete metric provides one such realization, but other metrics can also work as long as distances between distinct points are bounded away from zero uniformly or per point. The discrete metric is a particular ultrametric variant, where the strong ensures hierarchical distance structures, though not all ultrametrics yield the discrete topology. Unlike the Euclidean on \mathbb{R}^n, which clusters points in dense subsets and fails to isolate them in spaces, the discrete renders every point isolated irrespective of the of X, emphasizing its role in abstract separation over geometric .

Properties

Separation and Hausdorff properties

In the discrete topology on a set X, every singleton subset \{x\} for x \in X is an , which immediately implies that the space satisfies the T_0 (Kolmogorov) : for any distinct points x, y \in X, there exists an containing one but not the other, such as \{x\}. Similarly, the space is T_1 (Fréchet), as singletons are both open and closed, ensuring that for distinct x, y, there are open sets separating them in both directions. The discrete topology also satisfies the Hausdorff (T_2) property: for any distinct x, y \in X, the singletons \{x\} and \{y\} are disjoint open neighborhoods separating the points. This extends to regularity (T_3), where for any point x and closed set C not containing x, \{x\} and X \setminus \{x\} (which contains C) are disjoint open sets; thus, every discrete space is T_3. Beyond these, discrete spaces exhibit even stronger separation properties. They are hereditarily normal, meaning every subspace is normal (T_4), as any subspace inherits the discrete topology where disjoint closed sets can be separated by their complements, which are open. Discrete spaces are also completely regular, allowing continuous functions to separate points from closed sets, a consequence of their metrizability. Additionally, they are paracompact, as every open cover admits a locally finite open refinement—namely, a refinement selecting singletons where needed. These separation features underscore the discrete topology's status as the finest topology on X, making every discrete space metrizable via the discrete metric d(x,y) = 1 if x \neq y and $0 otherwise, which induces precisely the discrete topology.

Compactness, connectedness, and countability

In discrete topological spaces, compactness is characterized by finiteness. Specifically, a discrete space is compact its underlying set is finite. To see this, note that if the space is finite, it is compact as a finite union of s. Conversely, if the space is infinite, the collection of all open sets forms an open with no finite subcover, since any finite subcollection covers only finitely many points. Discrete spaces exhibit strong disconnection properties. A discrete space with more than one point is totally disconnected, meaning its only connected subsets are the and singletons; thus, the connected components are precisely the singletons. This follows from the fact that for any two distinct points, there exist disjoint open neighborhoods (the singletons themselves) separating them, preventing any larger connected subsets. Regarding countability axioms, a discrete space is second-countable if and only if it is countable. The collection of all singletons serves as a basis for the , and this basis is countable precisely when the underlying set is countable. Moreover, an uncountable discrete space is not separable, as any dense subset must intersect every nonempty (i.e., every ), requiring it to be the entire uncountable set, which contradicts countability of dense subsets. The Lindelöf property also ties directly to countability in discrete spaces. A discrete space is Lindelöf it is countable, since every open cover admits a refinement to the singleton cover, and a countable subcover exists only if the space has countably many points.

Examples

Finite discrete spaces

A finite discrete space consists of a X equipped with the discrete topology, in which every of X is declared open. For example, consider the set X = \{1, 2, 3\}; the discrete topology on X includes all $2^3 = 8 possible s as open sets, such as the \{1\}, \{2\}, and \{3\}, the pairs \{1,2\}, \{1,3\}, and \{2,3\}, the full set X, and the . These spaces exhibit several key topological properties due to their finiteness and the nature of the topology. They are always compact, as any open cover can be reduced to a finite subcover by selecting one set containing each point, leveraging the finite number of points. Finite spaces are Hausdorff, since for any distinct points x, y \in X, the singletons \{x\} and \{y\} serve as disjoint open neighborhoods separating them. Additionally, they are , as the metric d(x, y) = 1 if x \neq y and d(x, x) = 0 induces precisely the discrete topology. Up to , finite spaces are classified solely by their n, where |X| = n; any between two such sets of the same size is a homeomorphism, as it maps open sets to open sets bijectively. This classification underscores their simplicity, with exactly $2^n open sets in each case. In pedagogical contexts, finite spaces serve as the simplest non-trivial examples for introducing concepts like open sets, bases, and the structure of topologies on small sets. As noted in the properties section, their follows directly from the general result that any finite topological space is compact.

Infinite discrete spaces

In infinite discrete spaces, the topology consists of all subsets of the underlying set being open, leading to behaviors that contrast with many familiar topological properties. A prototypical example is the set of natural numbers \mathbb{N} equipped with the discrete topology. Here, the collection of singletons \{\{n\} \mid n \in \mathbb{N}\} forms an open cover with no finite subcover, demonstrating that the space is not compact. A natural example arises as a : the set of integers \mathbb{Z} with the inherited from \mathbb{R} under its topology is . For each n \in \mathbb{Z}, the open interval (n-0.5, n+0.5) in \mathbb{R} intersects \mathbb{Z} at exactly \{n\}, making every open in the subspace. For an uncountable instance, consider the real numbers \mathbb{R} with the topology. This space is non-separable, as no countable dense subset exists, and it is not second-countable; the of singletons has $2^{\aleph_0}, exceeding any countable basis. The topology on such sets can be induced by the , defined by d(x,y)=1 if x \neq y and d(x,x)=0. These spaces exhibit pathological features relative to standard expectations in . No non-trivial sequences converge; the only convergent sequences are those that are eventually constant, since every is open and isolates points. Furthermore, every is both open and closed (clopen), as the topology includes the power set of the underlying set. Regarding classification up to , all countably infinite spaces are homeomorphic to (\mathbb{N}, \tau_d), where \tau_d denotes the topology, via any between the sets. Uncountable spaces are homeomorphic precisely when their underlying sets have the same , as bijections preserve the full .

Applications

In and contexts

In the context of structures, the on a set X induces the uniform , defined by taking all supersets of the diagonal \Delta_X = \{(x,x) \mid x \in X\} as . This is the finest (strongest) uniformity on X, making the space uniformly in the sense that points are isolated with respect to any . As a consequence, every from a space equipped with the uniformity to any uniform space is uniformly continuous, since for any V in the codomain, the \Delta_X in the domain suffices to ensure the graph of the lies in V. Regarding convergence and completeness, a in a discrete metric space (X, d) to a x \in X it is eventually constant, equal to x from some index onward. This follows because open balls of radius less than 1 around any point are , so requires the terms to eventually lie in that . Discrete metric spaces are always : any must be eventually constant (since for \epsilon = 1/2, all terms from some point are within distance less than 1/2, hence equal), and thus . In functional analysis, discrete spaces often serve as the underlying index sets for sequence spaces such as \ell^\infty(X), the space of bounded real-valued functions on X equipped with the supremum norm \|f\|_\infty = \sup_{x \in X} |f(x)|. When X is countably infinite (e.g., \mathbb{N}), the resulting metric topology on \ell^\infty(X) is that of uniform convergence, which is strictly coarser than the discrete topology on the set of all functions from X to \mathbb{R}; for instance, sequences of functions converging pointwise but not uniformly demonstrate that singletons are not open in this norm topology. A similar situation holds for the space c_0(X) of functions vanishing at infinity with the sup norm. In , the isolation of points in spaces precludes the direct application of certain integral definitions; for example, the , which relies on partitions of a closed [a,b], is undefined for functions on domains lacking such continuum structure. Instead, spaces find utility in , where methods approximate solutions to equations on grids of isolated points, enabling the replacement of continuous derivatives with quotients like \frac{f(x+h) - f(x)}{h} to model behaviors on the approximating set.

In discrete mathematics and computing

In graph theory, the vertex set of a is commonly equipped with the discrete topology, under which every is open, ensuring that all maps from the vertex set to another discrete space are continuous by default. This setup is crucial for analyzing homomorphisms, defined as adjacency-preserving functions between vertex sets, as the discrete topology imposes no additional continuity constraints beyond structural preservation, simplifying proofs of existence and properties like injectivity or surjectivity in homomorphism counts. For example, in constructions of topological graphs from discrete topologies, the vertex set consists of all non-empty proper of a base set X, with edges connecting disjoint subsets, yielding graphs with specific parameters such as clique number equal to |X| and 3 for |X| \geq 3. Furthermore, in , the discrete topology on the finite vertex set V facilitates the definition of the graph Laplacian as a Dirichlet form on functions over V, where is automatic, enabling the of for applications like graph partitioning and processes. The then acts as a on \ell^2(V), with the discrete structure ensuring that the and random walks are well-defined without metric assumptions. Seminal works establish this framework by treating graphs as discrete metric spaces, where the supports quadratic forms for resistance distances and expansion properties. In combinatorics, infinite spaces such as \mathbb{Z}^d with the topology serve as foundational models for problems and generating functions, where the isolation of points simplifies enumerations and periodicity checks. For translational tilings, a finite tile set F with the topology generates a product space of configurations over \mathbb{Z}^d, allowing combinatorial of periodic versus aperiodic tilings via the tiling equation F \oplus A = \mathbb{Z}^d, where \oplus denotes disjoint Minkowski sum. This structure has been pivotal in resolving aspects of the periodic tiling conjecture, demonstrating that most tile sets admit periodic tilings while counterexamples exist for specific cases, with the topology ensuring compactness in the space of valid patchings for enumeration. As noted in examples of infinite spaces, such as \mathbb{Z}, this topology underpins countable models for generating functions in sequence enumeration. In , particularly and , the on finite or countable data points models isolated clusters in algorithms like k-nearest neighbors (k-NN), where the metric d(x,y) = 1 if x \neq y induces the , treating points as open sets for neighborhood computations. k-NN filtrations extend this to simplicial complexes, building higher-dimensional structures from point clouds to compute , which captures topological features like holes and connectivity without relying on continuous embeddings, offering stability guarantees for convergence in applications such as analysis on graphs. This approach enhances query optimization in finite-domain databases by viewing attribute domains as spaces, where openness of singletons streamlines join operations and index selections, though primary focus remains on combinatorial efficiency.

Indiscrete topology

The indiscrete topology on a set X, also known as the , is the coarsest possible topology, consisting solely of the \emptyset and X itself as open sets. Equivalently, the only closed sets are \emptyset and X. This structure forms the extremal opposite to the topology, which is the finest topology where every subset is open. In this topology, the space is connected for any nonempty X, as there are no nontrivial open subsets to disconnect it, and it is compact since the single open cover \{X\} admits a finite subcover. It fails to be Hausdorff unless |X| \leq 1, because distinct points cannot be separated by disjoint open neighborhoods. Every function into an indiscrete space is continuous. Continuous functions from an indiscrete space (with more than one point) to a are necessarily constant, since the domain is connected and the image must be connected. Every function from an indiscrete space to any topological space is continuous. Thus, between an indiscrete space with more than one point and a with more than one point, non-constant continuous maps exist only from the to the indiscrete space. No nontrivial can induce the indiscrete topology on a set with more than one point, as all points are non-isolated and inseparable by . The indiscrete serves as a minimal example in proofs of connectedness and other topological invariants, highlighting boundary cases in .

Partially discrete structures

In topological spaces, the discrete exhibits the hereditary property, meaning that any inherits the discrete from the ambient space. This occurs because, in a discrete space, every is open, and the on a Y consists of intersections of opens from the original space with Y, which are precisely the subsets of Y, rendering them open in the . A point in a is isolated if it possesses a neighborhood intersecting the only at that point; a is discrete precisely when all its points are isolated. In contrast, certain subspaces may feature discrete subsets that are not dense, such as the s embedded in the real line with the standard topology, where each is isolated in the due to the existence of small intervals containing no other s. However, subsets like in the reals form a dense subspace with no isolated points, as every neighborhood of a rational contains infinitely many others, highlighting s where discreteness applies only partially to subsets rather than the whole. Weaker variants of discrete spaces include Alexandrov spaces, which are topologies closed under arbitrary intersections of open sets; such spaces coincide with the discrete topology when combined with the T1 , as the T1 condition ensures singletons are closed, and the Alexandrov property forces them to be open. These structures, also known as Alexandroff spaces, generalize discrete topologies by associating them with preorders where open sets are upward-closed, providing a framework for singleton-closed topologies beyond the fully discrete case. Another weakening appears in quasi-discrete topologies, where every is also closed (clopen), allowing partitions of the space into clopen components without requiring singletons to be open, thus relaxing the full separation of points in spaces. This property is particularly relevant in digital topology for image processing, where finite approximations of continuous images use quasi-discrete structures to model pixel adjacencies while preserving topological invariants like in or grids. For instance, in digital images, the topology induced by adjacency relations often yields quasi-discrete spaces, enabling algorithms for or that maintain Euler characteristics.

References

  1. [1]
    Discrete Topology -- from Wolfram MathWorld
    The largest topology contains all subsets as open sets, and is called the discrete topology. In particular, every point in X is an open set in the discrete ...
  2. [2]
    discrete space - PlanetMath.org
    Mar 22, 2013 · The discrete topology on a set X is the topology given by the power set. of X . That is, every subset of X is open in the discrete topology. A ...Missing: mathematics | Show results with:mathematics
  3. [3]
    Discrete space | EPFL Graph Search
    A topological space is discrete if and only if its singletons are open, which is the case if and only if it doesn't contain any accumulation points. The ...
  4. [4]
    [PDF] Pointed spaces - Math 535 - General Topology Additional notes
    Oct 29, 2012 · Because every function from a discrete space is continuous, there is a natural bijection. HomTop (Dis(S),(Y,T )). ∼. = HomSet (S, U(Y,T )).
  5. [5]
    [PDF] 14 | Compact Spaces
    A space X is compact if every open cover of X contains a finite subcover. 14.5 Example. A discrete topological space X is compact if and only if X consists of ...
  6. [6]
    [PDF] Notes on Introductory Point-Set Topology - Cornell Mathematics
    The collection O of all subsets of X defines a topology on X called the discrete topology. If we let O consist of just X itself and ∅, this defines a topology, ...
  7. [7]
    [PDF] Chapter 4: Topological Spaces - UC Davis Math
    The power set V(X) of X, consisting of all subsets of X, is a topology on X, called the discrete topology. Example 4.3 Let (X, d) be a metric space. Then the ...
  8. [8]
    [PDF] A topology on a set X is a collection T of subsets of X having the ...
    ∅ and X are both open. Example: X: any set, T: the collection of all subsets of X. (X,T) is called the discrete topology.
  9. [9]
    Grundzüge der Mengenlehre : Hausdorff, Felix, 1868-1942
    Dec 2, 2008 · Grundzüge der Mengenlehre ; Publication date: 1914 ; Topics: Set theory ; Publisher: Leipzig Viet ; Collection: gerstein; toronto; ...Missing: discrete topology
  10. [10]
    topological space in nLab
    ### Summary of History of Topological Spaces (Point-Set Topology and Discrete Topology)
  11. [11]
    [PDF] An introduction to the geometry of ultrametric spaces - arXiv
    Nov 5, 2007 · The discrete metric on any set M is defined by setting d(x, y) = 1 when x 6= y. This is an ultrametric, and there are also more interesting ...
  12. [12]
    [PDF] Chapter 4. Metric Spaces
    Note that the discrete metric on a nonempty set X induces the discrete topology on X. 11. Page 12. Interior and Closure. 4.43 Definition: Let X be a metric ...
  13. [13]
    [PDF] Introduction to topology - Patrick Orson
    (i) Prove that the discrete metric on X induces the discrete topology. (ii) Prove that if X has at least 2 elements then no metric on X induces the ...
  14. [14]
    [PDF] arXiv:1209.3962v1 [math.GN] 18 Sep 2012
    Sep 18, 2012 · A metric is said to be discrete if it induces the discrete topology. ... 3A proper and discrete metric space is also said to be locally finite.
  15. [15]
    [PDF] 9. Stronger separation axioms
    Regularity is supposed to be a separation axiom that says you can do even better than separating points, and yet the indiscrete topology is regular despite.
  16. [16]
    S3: Discrete topology on $\mathbb R$ | π-Base
    Also known as: Discrete topology on the real numbers, Uncountable Discrete Topology ; P32 · Countably paracompact ; P33 · Countably metacompact.
  17. [17]
    [PDF] Introduction to general topology - NIE
    Thus every metric space is completely regular. In particular, R, R2 and Rn are completely regular. 5.3.6 Theorem a) Every subspace of a completely regular ...
  18. [18]
    [PDF] Paracompact subspaces in the box product topology - Scholar ...
    For example, a discrete space is paracompact, yet even a closed discrete subspace of a regular space need not have the property in the conclusion. Indeed ...
  19. [19]
    [PDF] Metric and Topological Spaces Blow-by-blow account of the module ...
    In particular, the discrete metric induces the discrete topology, where every subset is open and the indiscrete pseudometric induces the indiscrete topology ...
  20. [20]
    [PDF] 16. Compactness
    If X is a set, then (X,Tdiscrete) is compact if and only if X is finite, and Lindelöf if and only if X is countable. More generally, any finite topological ...
  21. [21]
    Section 5.7 (004R): Connected components—The Stacks project
    Definition 5.7. 8. A topological space is totally disconnected if the connected components are all singletons. A discrete space is totally disconnected.Missing: source | Show results with:source
  22. [22]
    [PDF] 5 Lecture 5
    A discrete metric space is separable if and only if it is countable. My favourite example of a non-separable space is a hedgehog space of uncountable ...
  23. [23]
    [PDF] 3. Hausdorff Spaces and Compact Spaces
    For a discrete space X the one-element sets {x} form a basis, i.e. B = {{x}|x ∈ X} is a basis since, for any U in X we have U = Jx∈U {x}. The set of open sets B ...
  24. [24]
    [PDF] Metrizable spaces
    In other words, the discrete metric induces the discrete topology on X. Now, a basis for the discrete topology must have every singleton since every ...
  25. [25]
    [PDF] FINITE TOPOLOGICAL SPACES 1. Introduction - UChicago Math
    The compact–open topology on Y X is the topology in which a subset is open if and only if it is a union of finite intersections of sets W(C, U) = {f|f(C) ⊂ U}, ...
  26. [26]
    [PDF] A first course in topology : an introduction to mathematical thinking ...
    This is the simplest topology that it is possible to assign to a set because ... The Discrete Topology. The smallest (in the sense of having the fewest ...
  27. [27]
    [PDF] 3 | Open Sets
    If X is equipped with this topology then we say that it is a discrete topological space. Note that the discrete topology is induced by the discrete metric ρdisc.
  28. [28]
    [PDF] Section 11.3. Countability and Separability
    Dec 21, 2016 · In a general topological space, second countable implies separable (Problem 11.19) but a separable space (even one which is first countable).
  29. [29]
    [PDF] Topology - UT Math - University of Texas at Austin
    Jun 5, 2008 · Example 4 (discrete topology). For a set X, let 2X be the set of all subsets of X. Then T = 2X is called the discrete topology on X. The ...
  30. [30]
    [PDF] MTH 427/527 Introduction to Topology I
    Aug 7, 2018 · A set A is countable if it is either finite or infinitely countable. 1.33 Example. The set of natural numbers N = {0,1,2,...} ... discrete topology ...
  31. [31]
    [PDF] arXiv:2001.00548v1 [math.GR] 2 Jan 2020
    Jan 2, 2020 · Trivial structures. On any set X, the collection of all supersets of the diagonal is a uniform structure, called the discrete uniform structure.
  32. [32]
    [PDF] Lecture 24 - Continuous Functions on a Metric Space
    So, on a discrete metric space not only that every function is continuous, but it is also uniformly continuous.
  33. [33]
    [PDF] Metric Spaces Worksheet
    If (X,d) is a discrete metric space then every convergent sequence is eventually constant. Hint . What happens when <ε< in a discrete metric space?
  34. [34]
    [PDF] The Riemann Integral - UC Davis Math
    The Riemann integral is the simplest integral to define, and it allows one to integrate every continuous function as well as some not-too-badly discontinuous.
  35. [35]
    Finite Difference Method - an overview | ScienceDirect Topics
    The finite difference method is defined as a numerical technique that approximates derivatives in governing equations using finite difference approximations ...
  36. [36]
    [PDF] arXiv:2211.07025v1 [math.CO] 13 Nov 2022
    Nov 13, 2022 · Let X be a non-empty set and τ be a discrete topology on X. The ... Harary, Graph Theory, Addison-Wessley, Reading Mass. (1969). [6] ...
  37. [37]
    Abstract homomorphisms from locally compact groups to discrete ...
    Nov 15, 2019 · We show that every abstract homomorphism φ from a locally compact group L to a graph product G Γ , endowed with the discrete topology, ...
  38. [38]
    [PDF] a notion of graph homeomorphism - Harvard Mathematics Department
    Jan 12, 2014 · This is in particular the case for the discrete topology generated by star graphs attached to vertices. 9) Any two wheel graphs Wn with n ≥ 4 ...<|control11|><|separator|>
  39. [39]
    [PDF] Graphs and Discrete Dirichlet Spaces Matthias Keller Daniel Lenz ...
    ... spectral theory of Laplacians and the heat flow of the underlying graph. ... (Discrete topology and continuity). Consider a finite set X with the discrete ...
  40. [40]
    [PDF] Notes on Elementary Spectral Graph Theory Applications to Graph ...
    Feb 17, 2013 · By a discrete group, we mean a group equipped with the discrete topology (every subset is open). In other words, we don't care about the ...
  41. [41]
    None
    ### Summary of Discrete Topology in Tiling Problems on ℤ for Combinatorics
  42. [42]
  43. [43]
  44. [44]
    None
    ### Summary of Discrete Topology in k-NN for Machine Learning or TDA
  45. [45]
    Persistent homology with k-nearest-neighbor filtrations reveals ...
    By constructing filtrations using discrete sets, our approach relies on discrete topology, thereby contrasting approaches that are tied to continuous ...
  46. [46]
    [PDF] Parallel, Distributed, and Quantum Exact Single-Source Shortest ...
    Dec 19, 2024 · Abstract. This paper presents parallel, distributed, and quantum algorithms for single-source shortest paths.
  47. [47]
    indiscrete topology - PlanetMath.org
    Mar 22, 2013 · X X many properties: •. Every subset of X X is sequentially compact. •. Every function to a space with the indiscrete topology is continuous ...
  48. [48]
    discrete and indiscrete topology in nLab
    Aug 25, 2021 · Disc ( S ) Disc(S) is the topological space on S S in which every subset is an open set,. this is called the discrete topology on S S , it is ...
  49. [49]
    [PDF] 1. Introduction
    Define Tdiscrete := P(X). That is, Tdiscrete is the collection of all subsets of X. Then Tdiscrete is called the discrete topology on X. Example 3.5.<|control11|><|separator|>
  50. [50]
    Discrete space - Topospaces
    Jan 28, 2012 · This property of topological spaces is hereditary, or subspace-closed. In other words, any subspace (subset with the subspace topology) of a ...
  51. [51]
    Discrete Set -- from Wolfram MathWorld
    On any reasonable space, a finite set is discrete. A set is discrete if it has the discrete topology, that is, if every subset is open. In the case of a subset ...<|separator|>
  52. [52]
    [PDF] a brief overview of alexandrov spaces
    Proposition 4.5. If a topological space X is both T1 and Alexandrov, then the topology on it is discrete.
  53. [53]
  54. [54]
    [PDF] Digital Topology - Temple CIS
    In the discrete topology Td. (in the strict sense) all subsets of X are declared to be open and in the indiscrete topology Ti the only open sets are the empty ...