Concept

Closure operator

In mathematics, a closure operator on a set S is a function from the power set of S to itself that satisfies the following conditions for all sets {| border="0" |- |

(cl is extensive),

(cl is increasing),
-

(cl is idempotent).
}
Closure operators are determined by their closed sets, i.e., by the sets of the form cl(X), since the closure cl(X) of a set X is the smallest closed set containing X. Such families of "closed sets" are sometimes called closure systems or "Moore families". A set together with a closure operator on it is sometimes called a closure space. Closure operators are also called "hull operators", which prevents confusion with the "closure operators" studied in topology.
E. H. Moore studied closure operators in his 1910 Introduction to a form of general analysis, whereas the concept of the closure of a subset originated in the work of Frigyes Riesz in connection with topological spaces. Though not formalized at the time, the idea of closure originated in the late 19th century with notable contributions by Ernst Schröder, Richard Dedekind and Georg Cantor.
The usual set closure from topology is a closure operator. Other examples include the linear span of a subset of a vector space, the convex hull or affine hull of a subset of a vector space or the lower semicontinuous hull of a function , where is e.g. a normed space, defined implicitly , where is the epigraph of a function .
The relative interior is not a closure operator: although it is idempotent, it is not increasing and if is a cube in and is one of its faces, then , but and , so it is not increasing.
In topology, the closure operators are topological closure operators, which must satisfy
for all (Note that for this gives ).
In algebra and logic, many closure operators are finitary closure operators, i.e. they satisfy
In the theory of partially ordered sets, which are important in theoretical computer science, closure operators have a more general definition that replaces with . (See .

Official source

https://en.wikipedia.org/wiki/Closure_operator

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.

Related courses (24)

CS-420: Advanced compiler construction

Students learn several implementation techniques for modern functional and object-oriented programming languages. They put some of them into practice by developing key parts of a compiler and run time system for a simple functional programming language. ...

ME-443: Hydroacoustic for hydropower plants

Introduction to pressure wave propagation phenomena in hydraulic circuits, water hammer calculations, transient behaviour of hydroelectric plants, 1D numerical simulation of the dynamic behaviour of Francis, Pelton and Kaplan turbines, and study of the sta ...

PHYS-432: Quantum field theory II

The goal of the course is to introduce relativistic quantum field theory as the conceptual and mathematical framework describing fundamental interactions such as Quantum Electrodynamics. ...

Related lectures (32)

Passivity, Stability and Circle Criterion

Explores passivity, stability, and circle criterion in control systems, emphasizing system behavior and design considerations.

Algebraic Closure of Qp

Covers the algebraic closure of Qp and the definition of p-adic complex numbers, exploring roots' continuous dependence on coefficients.

Decomposing CW complexes

Covers the decomposition of a CW complex based on characteristic maps and cell containment.

Related people (3)

Viktor Kuncak

Viktor Kunčak joined EPFL in 2007, after receiving a PhD degree from MIT. Since then has been leading the Laboratory for Automated Reasoning and Analysis and supervised at least 12 completed PhD theses. His works on languages, algorithms and systems for verification and automated reasoning. He served as an initiator and one of the coordinators of a European network (COST action) in the area of automated reasoning, verification, and synthesis. In 2012 he received a 5-year single-investigator European Research Council (ERC) grant of 1.5M EUR. His invited talks include those at Lambda Days, Scala Days, NFM, LOPSTR, SYNT, ICALP, CSL, RV, VMCAI, and SMT. A paper on test generation he co-authored received an ACM SIGSOFT distinguished paper award at ICSE. A PLDI paper he co-authored was published in the Communications of the ACM as a Research Highlight article. His Google Scholar profile reports an over-approximate H-index of 38. He was an associate editor of ACM Transactions on Programming Languages and Systems (TOPLAS) and served as a co-chair of conferences on Computer-Aided Verification (CAV), Formal Methods in Computer Aided Design (FMCAD), Workshop on Synthesis (SYNT), and Verification, Model Checking, and Abstract Interpretation (VMCAI). At EPFL he teaches courses on functional and parallel programming, compilers, and verification. He has co-taught the MOOC "Parallel Programming" that was visited by over 100'000 learners and completed by thousands of students from all over the world.

Simon Guilloud

Expertise My main domains of research are proof assistants and algorithms for logic-related problems.I also have interests in various areas of computer science and mathematics and their applicability in proof systems such as probabilistic proofs, type theory, quantum computing and more. Expertise My main domains of research are proof assistants and algorithms for logic-related problems.I also have interests in various areas of computer science and mathematics and their applicability in proof systems such as

Yves Wiaux

Graph Chat

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.

In mathematics, a closure operator on a set S is a function from the power set of S to itself that satisfies the following conditions for all sets {| border="0" |- |

(cl is extensive),

(cl is increasing),
-

(cl is idempotent).
}
Closure operators are determined by their closed sets, i.e., by the sets of the form cl(X), since the closure cl(X) of a set X is the smallest closed set containing X. Such families of "closed sets" are sometimes called closure systems or "Moore families". A set together with a closure operator on it is sometimes called a closure space. Closure operators are also called "hull operators", which prevents confusion with the "closure operators" studied in topology.
E. H. Moore studied closure operators in his 1910 Introduction to a form of general analysis, whereas the concept of the closure of a subset originated in the work of Frigyes Riesz in connection with topological spaces. Though not formalized at the time, the idea of closure originated in the late 19th century with notable contributions by Ernst Schröder, Richard Dedekind and Georg Cantor.
The usual set closure from topology is a closure operator. Other examples include the linear span of a subset of a vector space, the convex hull or affine hull of a subset of a vector space or the lower semicontinuous hull of a function , where is e.g. a normed space, defined implicitly , where is the epigraph of a function .
The relative interior is not a closure operator: although it is idempotent, it is not increasing and if is a cube in and is one of its faces, then , but and , so it is not increasing.
In topology, the closure operators are topological closure operators, which must satisfy
for all (Note that for this gives ).
In algebra and logic, many closure operators are finitary closure operators, i.e. they satisfy
In the theory of partially ordered sets, which are important in theoretical computer science, closure operators have a more general definition that replaces with . (See .

Official source

https://en.wikipedia.org/wiki/Closure_operator

About this result

Related courses (24)

CS-420: Advanced compiler construction

ME-443: Hydroacoustic for hydropower plants

PHYS-432: Quantum field theory II

The goal of the course is to introduce relativistic quantum field theory as the conceptual and mathematical framework describing fundamental interactions such as Quantum Electrodynamics. ...

Related lectures (32)

Passivity, Stability and Circle Criterion

Explores passivity, stability, and circle criterion in control systems, emphasizing system behavior and design considerations.

Algebraic Closure of Qp

Covers the algebraic closure of Qp and the definition of p-adic complex numbers, exploring roots' continuous dependence on coefficients.

Decomposing CW complexes

Covers the decomposition of a CW complex based on characteristic maps and cell containment.

Related publications (14)

Integrated equilibrium model for electrified logistics and power systems

This paper proposes an integrated equilibrium model to characterize the complex interactions between electrified logistics systems and electric power delivery systems. The model consists of two major players: an electrified logistics operator (ELO) and a power system operator (PSO). The ELO aims to maximize its profit by strategically scheduling and routing its electric delivery vehicles (e-trucks) for deliveries and charging, in response to the locational marginal price (LMP) set by the PSO. The routing, d

IEEE2025

Sentiment Analysis on the Young People’s Perception About the Mobile Internet Costs in Senegal

Jérôme Chenal

Internet penetration rates in Africa are rising steadily, and mobile Internet is getting an even bigger boost with the availability of smartphones. Young people are increasingly using the Internet, especially social networks, and Senegal is no exception to this revolution. Social networks have become the main means of expression for young people. Despite this evolution in Internet access, there are few operators on the market, which limits the alternatives available in terms of value for money. In this pape

Springer Nature Singapore2025

Quantum groups as global symmetries II. Coulomb gas construction

We study a conformal field theory that arises in the infinite-volume limit of a spin chain with U_q(sl_2) global symmetry. Most operators in the theory are defect-ending operators which allows U_q(sl_2) symmetry transformations to act on them in a consistent way. We use Coulomb gas techniques to construct correlation functions and compute all OPE coefficients of the model in closed form, as well as to prove that the properties imposed by the quantum group symmetry are indeed satisfied by the correlation fun

Stichting SciPost2025

Related people (3)

Viktor Kuncak

Simon Guilloud

Yves Wiaux

Related concepts (17)

Formal concept analysis

In information science, formal concept analysis (FCA) is a principled way of deriving a concept hierarchy or formal ontology from a collection of objects and their properties. Each concept in the hierarchy represents the objects sharing some set of properties; and each sub-concept in the hierarchy represents a subset of the objects (as well as a superset of the properties) in the concepts above it. The term was introduced by Rudolf Wille in 1981, and builds on the mathematical theory of lattices and ordered sets that was developed by Garrett Birkhoff and others in the 1930s.

Kuratowski closure axioms

In topology and related branches of mathematics, the Kuratowski closure axioms are a set of axioms that can be used to define a topological structure on a set. They are equivalent to the more commonly used open set definition. They were first formalized by Kazimierz Kuratowski, and the idea was further studied by mathematicians such as Wacław Sierpiński and António Monteiro, among others. A similar set of axioms can be used to define a topological structure using only the dual notion of interior operator.

Duality (order theory)

In the mathematical area of order theory, every partially ordered set P gives rise to a dual (or opposite) partially ordered set which is often denoted by Pop or Pd. This dual order Pop is defined to be the same set, but with the inverse order, i.e. x ≤ y holds in Pop if and only if y ≤ x holds in P. It is easy to see that this construction, which can be depicted by flipping the Hasse diagram for P upside down, will indeed yield a partially ordered set. In a broader sense, two partially ordered sets are also said to be duals if they are dually isomorphic, i.

Related notebooks (2)

Ewald Sphere

::: {role="main"} ::: {.jp-Cell .jp-MarkdownCell .jp-Notebook-cell} ::: {.jp-Cell-inputWrapper tabindex="0"} ::: {.jp-Collapser .jp-InputCollapser .jp-Cell-inputCollapser} ::: ::: {.jp-InputArea .jp-Cell-inputArea} ::: {.jp-InputPrompt .jp-InputArea-prompt} ::: ::: {.jp-RenderedHTMLCommon .jp-RenderedMarkdown .jp-MarkdownOutput mime-type="text/markdown"}

Ewald Sphere¶{.anchor-link} {#Ewald-Sphere}

Play with the Ewald Sphere This schematics represent the Ewald sphere for a typical high

Voice Transformation Techniques Using Digital Signal Processing

A Gallery of Voice Transformers[1]¶

                                      [2]Paolo Prandoni, [3]LCAV, EPFL

In this notebook we will explore various ways to implement a system that changes the voice of a speaker. Typical applications for these techniques, strictly sorted by plausibility, include international spy missions and prank telephone calls, and devices such as the one displayed here can be easily bought on the web... or in a novelty shop. No description has been provided for t