Elements of Abstract AnalysisSpringer Science & Business Media, 6 dec. 2012 - 300 pagini In nature's infinite book ofsecrecy A little I can read. Antony and Cleopatra, l. ii. This is a book about a few elementary concepts of analysis and the mathe matical structures which enfold them. It is more concerned with the interplay amongst these concepts than with their many applications. The book is self-contained; in the first chapter, after acknowledging the fundamental role ofmathematical logic, wepresent seven axioms of Set Theory; everything else is developed from these axioms. It would therefore be true, if misleading, to say that the reader requires no prior knowledge of mathematics. In reality, the reader we have in mind has that level of sophistication achieved in about three years of undergraduate study of mathematics and is already well acquainted with most of the structures discussed-rings, linear spaces, metric spaces, and soon-and with many ofthe principal analytical concepts convergence, connectedness, continuity,compactness and completeness. Indeed, it is only after gaining familiarity with these concepts and their applications that it is possible to appreciate their place within a broad framework of set based mathematics and to consolidate an understanding of them in such a framework. To aid in these pursuits, wepresent our reader with things familiar and things new side by side in most parts of the book-and we sometimes adopt an unusual perspective. That this is not an analysis textbook is clear from its many omissions. |
Din interiorul cărții
Rezultatele 1 - 5 din 54
Pagina 14
... function f is called a CONSTANT FUNCTION if and only if its range is a singleton set . If f is an injective function , then { ( y , x ) | ( x , y ) = ƒ } is a function ; it is denoted by f - 1 and called the INVERSE of f ; this inverse ...
... function f is called a CONSTANT FUNCTION if and only if its range is a singleton set . If f is an injective function , then { ( y , x ) | ( x , y ) = ƒ } is a function ; it is denoted by f - 1 and called the INVERSE of f ; this inverse ...
Pagina 15
... function { ( x , ( x , x ) ) | x Є X } where the domain X is either stated ... bijective . Suppose X is a non - empty set . Then X , Xo and oo have been ... bijective . Suppose Y is a superset of X. The mapping inc : X → Y which maps ...
... function { ( x , ( x , x ) ) | x Є X } where the domain X is either stated ... bijective . Suppose X is a non - empty set . Then X , Xo and oo have been ... bijective . Suppose Y is a superset of X. The mapping inc : X → Y which maps ...
Pagina 16
... injective . Example 1.2.15 Suppose that X is a set and that F is a collection of functions with domain X. For each Є X , the set { ( f , f ( x ) ) | ƒ € F } is a function . We shall generally denote this function by â , its domain F ...
... injective . Example 1.2.15 Suppose that X is a set and that F is a collection of functions with domain X. For each Є X , the set { ( f , f ( x ) ) | ƒ € F } is a function . We shall generally denote this function by â , its domain F ...
Pagina 17
... bijective function between the two sets . In this case , the sets are said to be in one - to - one correspondence ... bijective function from A to B. Theorem 1.2.20 Suppose A , B and C are sets . Then • A≈ A ; • A≈ B ÷ B≈ A ; • ( A ...
... bijective function between the two sets . In this case , the sets are said to be in one - to - one correspondence ... bijective function from A to B. Theorem 1.2.20 Suppose A , B and C are sets . Then • A≈ A ; • A≈ B ÷ B≈ A ; • ( A ...
Pagina 18
... function from I to X is called also a FAMILY in X. The set I will then be ... injective family x : I → X is called an INDEXED SUBSET of X ; if the family ... function x is a bijective family . So X can be indexed by itself . Products The ...
... function from I to X is called also a FAMILY in X. The set I will then be ... injective family x : I → X is called an INDEXED SUBSET of X ; if the family ... function x is a bijective family . So X can be indexed by itself . Products The ...
Cuprins
21 | |
Alls Well that Ends Well Viii | 29 |
Counting | 61 |
Algebraic Structure | 80 |
Analytic Structure | 91 |
Linear Structure | 115 |
Geometric Structure | 133 |
Topological Structure | 159 |
Continuity and Openness | 177 |
Connectedness | 207 |
Convergence | 215 |
Compactness | 231 |
91 | 242 |
Completeness | 245 |
Solutions | 269 |
Bibliography | 285 |
Alte ediții - Afișează-le pe toate
Termeni și expresii frecvente
acc(A arbitrary Axiom of Choice bijective bounded called cardinal closed subset compact space compact subset complete connected converges Corollary counting number defined Definition denote dense disjoint domain endowed ensures equivalent Example EXERCISES Q exists field F filter finite subset follows ƒ is continuous Hausdorff space Hilbert space homomorphism includes induced inequality initial topology injective injective function inner product inverse Lemma linear subspace linearly independent maximal subspace maximal wedge metric space nbd(x non-empty set non-empty subset non-trivial normed linear space open ball open intervals open neighbourhood open sets open subset ordered set ordinal Proof Suppose ps(X ran(u real linear space Recursive relative topology second countable semimetric space seminormed seminormed linear space sequence sequentially Show subbase surjective T₁ topological space topology determined totally ordered ultrafilter union unique unit ball usual topology vector space whence