Axiom:Content Axioms
Jump to navigation
Jump to search
![]() | This page has been identified as a candidate for refactoring of basic complexity. In particular: Use axiom template Until this has been finished, please leave {{Refactor}} in the code.
New contributors: Refactoring is a task which is expected to be undertaken by experienced editors only. Because of the underlying complexity of the work needed, it is recommended that you do not embark on a refactoring task until you have become familiar with the structural nature of pages of $\mathsf{Pr} \infty \mathsf{fWiki}$.To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{Refactor}} from the code. |
Definition
Let $X$ be a set.
Let $C \subset \powerset X$ be a set of subsets of $X$.
Let $\lambda : C \to \R_{\mathop \ge 0}$ be a function from $C$ to the non-negative real numbers.
Then $\lambda$ is a content on $C$ if and only if, for any $A,B \in C$:
- $(1): \quad A \subset B \implies \map \lambda A \le \map \lambda B$
- $(2): \quad A \cap B = \empty \implies \map \lambda {A \cup B} = \map \lambda A + \map \lambda B$
- $(3): \quad \map \lambda {A \cup B} \le \map \lambda A + \map \lambda B$
Sources
![]() | The validity of the material on this page is questionable. In particular: The below was published in $1950$. Which edition are you channeling? You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by resolving the issues. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{Questionable}} from the code.If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page. |
- 1974: Paul R. Halmos: Measure Theory