Sigma additivité

In mathematics, an additive set function is a function mapping sets to numbers, with the property that its value on a union of two disjoint sets equals the sum of its values on these sets, namely, If this additivity property holds for any two sets, then it also holds for any finite number of sets, namely, the function value on the union of k disjoint sets (where k is a finite number) equals the sum of its values on the sets. Therefore, an additive set function is also called a finitely additive set function (the terms are equivalent). However, a finitely additive set function might not have the additivity property for a union of an infinite number of sets. A σ-additive set function is a function that has the additivity property even for countably infinite many sets, that is, Additivity and sigma-additivity are particularly important properties of measures. They are abstractions of how intuitive properties of size (length, area, volume) of a set sum when considering multiple objects. Additivity is a weaker condition than σ-additivity; that is, σ-additivity implies additivity. The term modular set function is equivalent to additive set function; see modularity below. Let be a set function defined on an algebra of sets with values in (see the extended real number line). The function is called or , if whenever and are disjoint sets in then A consequence of this is that an additive function cannot take both and as values, for the expression is undefined. One can prove by mathematical induction that an additive function satisfies for any disjoint sets in Suppose that is a σ-algebra. If for every sequence of pairwise disjoint sets in holds then is said to be or . Every sigma-additive function is additive but not vice versa, as shown below. Suppose that in addition to a sigma algebra we have a topology If for every directed family of measurable open sets we say that is -additive. In particular, if is inner regular (with respect to compact sets) then it is τ-additive. Useful properties of an additive set function include the following.

À propos de ce résultat

Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Concepts associés (14)

Cours associés (64)

Séances de cours associées (678)

MOOCs associés (9)

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 a

CS-308: Introduction to quantum computation

The course introduces the paradigm of quantum computation in an axiomatic way. We introduce the notion of quantum bit, gates, circuits and we treat the most important quantum algorithms. We also touch

COM-300: Stochastic models in communication

L'objectif de ce cours est la maitrise des outils des processus stochastiques utiles pour un ingénieur travaillant dans les domaines des systèmes de communication, de la science des données et de l'i

Mesure spectrale

En mathématiques, plus précisément en analyse fonctionnelle, une mesure spectrale est une application définie sur une tribu à valeurs dans l'espace des projections orthogonales d'un espace hilbertien et vérifiant des axiomes semblables à ceux qui définissent les mesures positives. Les mesures spectrales sont utilisées pour exprimer des résultats en théorie spectrale, tels que le théorème spectral pour les opérateurs auto-adjoints. Les mesures spectrales ont des propriétés similaires aux mesures réelles positives.

Sigma additivité

vignette|Illustration de la sigma additivité La sigma additivité, appelé aussi additivité dénombrable, est un concept en théorie de la mesure. Soit un ensemble et un ensemble de parties de . On dit que l'application μ est σ-additive sur lorsqu'elle vérifie la propriété suivante : si E1, E2, ... est une suite d'éléments de , si ces parties de sont deux à deux disjointes et si leur réunion E est aussi un élément de , alors la valeur μ(E) de μ sur cette réunion E est égale à la somme des valeurs de μ sur les parties Ek : Il s'agit d'une version plus forte de l'additivité simple.

Set function

In mathematics, especially measure theory, a set function is a function whose domain is a family of subsets of some given set and that (usually) takes its values in the extended real number line which consists of the real numbers and A set function generally aims to subsets in some way. Measures are typical examples of "measuring" set functions. Therefore, the term "set function" is often used for avoiding confusion between the mathematical meaning of "measure" and its common language meaning.

Digital Signal Processing I

Basic signal processing concepts, Fourier analysis and filters. This module can be used as a starting point or a basic refresher in elementary DSP

Digital Signal Processing II

Adaptive signal processing, A/D and D/A. This module provides the basic tools for adaptive filtering and a solid mathematical framework for sampling and quantization

Digital Signal Processing III

Advanced topics: this module covers real-time audio processing (with examples on a hardware board), image processing and communication system design.

Hypothèse de thermalisation d'état propre

Explore l'hypothèse de thermalisation d'état propre dans les systèmes quantiques, en mettant l'accent sur la théorie de la matrice aléatoire et le comportement des observables dans l'équilibre thermique.

Sans titre MATH-417: Number theory II.b - selected topics

Applications phénoménologiques du modèle standard

Explore la vérification du modèle standard à travers des expériences de diffusion et les implications de modèles de matière noire minimes.