Pub Date : 2019-07-30DOI: 10.2174/9789811415081119010008
Artur Korni
The terminology and notation used here have been introduced in the following articles: [9], [12], [1], [10], [11], [13], [14], [2], [3], [4], [6], [5], [8], and [7]. Let r be a real number. Observe that r r is non negative. Let r be a real number. Observe that r · r is non negative and r · r is non negative. Let r be a non negative real number. One can check that √ r is non negative. Let r be a positive real number. Observe that √ r is positive. We now state the proposition (1) For every function f and for every set A such that f is one-to-one and A ⊆ dom(f) holds f(f)A = A. Let f be a non-empty function. One can verify that f−1({0}) is empty. Let R be a binary relation. We say that R is positive yielding if and only if: (Def. 1) For every real number r such that r ∈ rng R holds 0 < r. We say that R is negative yielding if and only if: (Def. 2) For every real number r such that r ∈ rng R holds 0 > r. We say that R is non-positive yielding if and only if: (Def. 3) For every real number r such that r ∈ rng R holds 0 ≥ r. We say that R is non-negative yielding if and only if: (Def. 4) For every real number r such that r ∈ rng R holds 0 ≤ r. Let X be a set and let r be a positive real number. Observe that X 7−→ r is positive yielding. Let X be a set and let r be a negative real number. Note that X 7−→ r is negative yielding.
{"title":"Real–Valued Functions","authors":"Artur Korni","doi":"10.2174/9789811415081119010008","DOIUrl":"https://doi.org/10.2174/9789811415081119010008","url":null,"abstract":"The terminology and notation used here have been introduced in the following articles: [9], [12], [1], [10], [11], [13], [14], [2], [3], [4], [6], [5], [8], and [7]. Let r be a real number. Observe that r r is non negative. Let r be a real number. Observe that r · r is non negative and r · r is non negative. Let r be a non negative real number. One can check that √ r is non negative. Let r be a positive real number. Observe that √ r is positive. We now state the proposition (1) For every function f and for every set A such that f is one-to-one and A ⊆ dom(f) holds f(f)A = A. Let f be a non-empty function. One can verify that f−1({0}) is empty. Let R be a binary relation. We say that R is positive yielding if and only if: (Def. 1) For every real number r such that r ∈ rng R holds 0 < r. We say that R is negative yielding if and only if: (Def. 2) For every real number r such that r ∈ rng R holds 0 > r. We say that R is non-positive yielding if and only if: (Def. 3) For every real number r such that r ∈ rng R holds 0 ≥ r. We say that R is non-negative yielding if and only if: (Def. 4) For every real number r such that r ∈ rng R holds 0 ≤ r. Let X be a set and let r be a positive real number. Observe that X 7−→ r is positive yielding. Let X be a set and let r be a negative real number. Note that X 7−→ r is negative yielding.","PeriodicalId":176999,"journal":{"name":"Advanced Calculus Fundamentals of Mathematics","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126069936","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：