TheoremBase

The Functions f ↦ f⁺ and f ↦ f⁻ on the Real-Valued Functions on a Set, and a Predicative Form of g = f⁺ and g = f⁻

For a set X, the positive and negative parts are maps on the set of real-valued maps on X, the conditions g = f⁺ and g = f⁻ are expressed by predicative formulas, and z = max{a,0} is characterized by order conditions.

Statement

In the setting of Routine Facts Used Without Citation: Arithmetic, Maps, Predicativity and Indices, functions and their values are as in Sets and Maps: Ordinary Notation (v). The order ≤\le of R\mathbb{R} is total (Arithmetic and Order Rules in the Real Numbers, Stated for ℝ (viii)), and for a∈Ra\in\mathbb{R}, max⁡{a,0}\max\{a,0\} is the greatest element of {a,0}\{a,0\} (The Maximum and Minimum of Two Elements of a Total Order (i)). Let XX be a set and let RX\mathbb{R}^{X} be the class of functions from XX to R\mathbb{R}; it is a set (The Elements of the Class of Functions from a Set to a Set, and This Class Is a Set (ii)) whose elements are exactly the functions X→RX\to\mathbb{R} (The Elements of the Class of Functions from a Set to a Set, and This Class Is a Set (i)). For f∈RXf\in\mathbb{R}^{X}, its positive part f+f^{+} and negative part f−f^{-} are functions X→RX\to\mathbb{R}, so elements of RX\mathbb{R}^{X}.

The maximum with 00. For all a,z∈Ra,z\in\mathbb{R},

z=max⁡{a,0}  ⟺  (z=a or z=0),a≤zand0≤z.z=\max\{a,0\}\iff(z=a\ \text{or}\ z=0),\quad a\le z\quad\text{and}\quad 0\le z.

Predicative form. This clause is a statement of the metatheory; conditions expressed by a predicative formula, parameters and their fixed values are as in Conditions Expressed by a Predicative Formula, and Guards (i). Let ff and gg be distinct set variables, and take XX, R\mathbb{R}, the addition ++ and the order ≤\le of R\mathbb{R}, and its element 00 as parameters. Then each of the two conditions

f∈RX and g=f+,f∈RX and g=f−f\in\mathbb{R}^{X}\ \text{and}\ g=f^{+},\qquad\qquad f\in\mathbb{R}^{X}\ \text{and}\ g=f^{-}

on ff and gg is expressed by a predicative formula.

The functions f↦f+f\mapsto f^{+} and f↦f−f\mapsto f^{-}. There is exactly one function P:RX→RXP:\mathbb{R}^{X}\to\mathbb{R}^{X}, and exactly one function N:RX→RXN:\mathbb{R}^{X}\to\mathbb{R}^{X}, such that

P(f)=f+andN(f)=f−(f∈RX).P(f)=f^{+}\quad\text{and}\quad N(f)=f^{-}\qquad(f\in\mathbb{R}^{X}).

Moreover, for every f∈RXf\in\mathbb{R}^{X} and every set gg: g=f+g=f^{+} if and only if (f,g)∈P(f,g)\in P, and g=f−g=f^{-} if and only if (f,g)∈N(f,g)\in N.

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…