Lecture

Functions: Introduction and Terminology

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 course

CS-101: Advanced information, computation, communication I

Discrete mathematics is a discipline with applications to almost all areas of study. It provides a set of indispensable tools to computer science in particular. This course reviews (familiar) topics as diverse as mathematical reasoning, combinatorics, disc ...

Description

This lecture introduces the concept of functions as an assignment of elements from one set to another, covering terminology such as domain, codomain, image, preimage, and range. It explains how functions can be represented and explores the properties of injections, surjections, and bijections.

Instructor

Karl Aberer

Karl Aberer received his PhD in mathematics in 1991 from the ETH Zürich. From 1991 to 1992 he was postdoctoral fellow at the International Computer Science Institute (ICSI) at the University of California, Berkeley. In 1992, he joined the Integrated Publication and Information Systems institute (IPSI) of GMD in Germany, where he was leading the research division Open Adaptive Information Management Systems. In 2000 he joined EPFL as full professor. Since 2005 he is the director of the Swiss National Research Center for Mobile Information and Communication Systems ( NCCR-MICS, www.mics.ch ). He is member of the editorial boards of VLDB Journal, ACM Transaction on Autonomous and Adaptive Systems and World Wide Web Journal. He has been consulting for the Swiss government in research and science policy as a member of the Swiss Research and Technology Council ( SWTR ) from 2003 - 2011.

Official source

Related concepts (32)

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.

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.

Bijection

In mathematics, a bijection, also known as a bijective function, one-to-one correspondence, or invertible function, is a function between the elements of two sets, where each element of one set is paired with exactly one element of the other set, and each element of the other set is paired with exactly one element of the first set; there are no unpaired elements between the two sets. In mathematical terms, a bijective function f: X → Y is a one-to-one (injective) and onto (surjective) mapping of a set X to a set Y.

Codomain

In mathematics, the codomain or set of destination of a function is the set into which all of the output of the function is constrained to fall. It is the set Y in the notation f: X → Y. The term range is sometimes ambiguously used to refer to either the codomain or of a function. A codomain is part of a function f if f is defined as a triple (X, Y, G) where X is called the domain of f, Y its codomain, and G its graph. The set of all elements of the form f(x), where x ranges over the elements of the domain X, is called the of f.

Image (mathematics)

In mathematics, the image of a function is the set of all output values it may produce. More generally, evaluating a given function at each element of a given subset of its domain produces a set, called the "image of under (or through) ". Similarly, the inverse image (or preimage) of a given subset of the codomain of is the set of all elements of the domain that map to the members of Image and inverse image may also be defined for general binary relations, not just functions. The word "image" is used in three related ways.

Related lectures (64)

Linear Algebra: Surjections and Bijections

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

Set Theory: Operations and Functions

Covers set theory operations and functions, including injections and surjections.

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

Covers the definitions and notations related to functions.

Linear Algebra: Injections, Surjections, Bijections

Explores injections, surjections, and bijections in linear algebra, highlighting their significance in mathematics.

Operations on Sets: Parts, Intersection, and Difference