Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Set Theory: Operations and Functions

Description

This lecture covers set theory operations such as intersection, powerset, and functions, including domain, codomain, injections, and surjections. It also discusses bijections between natural numbers and power sets.

Official source

Related concepts (32)

Surjective function

In mathematics, a surjective function (also known as surjection, or onto function ˈɒn.tuː) is a function f such that every element y can be mapped from some element x such that f(x) = y. In other words, every element of the function's codomain is the of one element of its domain. It is not required that x be unique; the function f may map one or more elements of X to the same element of Y.

Intersection (set theory)

In set theory, the intersection of two sets and denoted by is the set containing all elements of that also belong to or equivalently, all elements of that also belong to Intersection is written using the symbol "" between the terms; that is, in infix notation. For example: The intersection of more than two sets (generalized intersection) can be written as: which is similar to capital-sigma notation. For an explanation of the symbols used in this article, refer to the table of mathematical symbols.

Set theory

Set theory is the branch of mathematical logic that studies sets, which can be informally described as collections of objects. Although objects of any kind can be collected into a set, set theory, as a branch of mathematics, is mostly concerned with those that are relevant to mathematics as a whole. The modern study of set theory was initiated by the German mathematicians Richard Dedekind and Georg Cantor in the 1870s. In particular, Georg Cantor is commonly considered the founder of set theory.

Naive set theory

Naive set theory is any of several theories of sets used in the discussion of the foundations of mathematics. Unlike axiomatic set theories, which are defined using formal logic, naive set theory is defined informally, in natural language. It describes the aspects of mathematical sets familiar in discrete mathematics (for example Venn diagrams and symbolic reasoning about their Boolean algebra), and suffices for the everyday use of set theory concepts in contemporary mathematics.

Bijection, injection and surjection

In mathematics, injections, surjections, and bijections are classes of functions distinguished by the manner in which arguments (input expressions from the domain) and (output expressions from the codomain) are related or mapped to each other. A function maps elements from its domain to elements in its codomain. Given a function : The function is injective, or one-to-one, if each element of the codomain is mapped to by at most one element of the domain, or equivalently, if distinct elements of the domain map to distinct elements in the codomain.

Related lectures (28)

Operations on Sets: Parts, Intersection, and Difference

Explores operations on sets, Cartesian products, and functions' properties.

Linear Algebra: Surjections and Bijections

Explains surjections and bijections in linear algebra, focusing on function properties and inverse identification.

Functions: Introduction and Terminology

Covers the introduction and terminology of functions, including injections, surjections, and bijections.

Introduction to Functions

Covers the basics of functions, including domain, codomain, image, and range, as well as injections, surjections, and bijections.

Definitions and Notations MOOC: Analysis I (part 1): Prelude, basic concepts, real numbers MOOC: Analysis I