Concept

Axiom of countability

In mathematics, an axiom of countability is a property of certain mathematical objects that asserts the existence of a countable set with certain properties. Without such an axiom, such a set might not provably exist. Important countability axioms for topological spaces include: sequential space: a set is open if every sequence convergent to a point in the set is eventually in the set first-countable space: every point has a countable neighbourhood basis (local base) second-countable space: the topology has a countable base separable space: there exists a countable dense subset Lindelöf space: every open cover has a countable subcover σ-compact space: there exists a countable cover by compact spaces These axioms are related to each other in the following ways: Every first-countable space is sequential. Every second-countable space is first countable, separable, and Lindelöf. Every σ-compact space is Lindelöf. Every metric space is first countable. For metric spaces, second-countability, separability, and the Lindelöf property are all equivalent. Other examples of mathematical objects obeying axioms of countability include sigma-finite measure spaces, and lattices of countable type.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.