Inmal sets. Properties and applications
|
|
- Jayson Carr
- 7 years ago
- Views:
Transcription
1 Inmal sets. Properties and applications Andreas Löhne Martin-Luther-Universität Halle-Wittenberg
2 How to generalize the inmum in R to the vectorial case? A inf A
3 The inmal set (Nieuwenhuis 1980) Inf A = { y R q {y} + int R q + A + int Rq + y A + int Rq + } Inf A Inmal set of A A inf A Inmum of A
4 The inmal set is a generalization of the inmum in R Inf A = { y R q {y} + int R q + A + int Rq + y A + int Rq + } For A R: a A : inf A a inf A A + int R +
5 The inmal set is a generalization of the inmum in R Inf A = { y R q {y} + int R q + A + int Rq + y A + int Rq + } For A R: ( a A : z a) = inf A z z A + int R + = z inf A + int R + inf A + int R + A + int R +
6 Part 1 Properties of inmal sets
7 The setting I: Denition Let Y be a vector space, let τ be a topology. The pair (Y, τ) is called a topological vector space if the following two axioms are satised: (L1) (y 1, y 2 ) y 1 + y 2 is continuous on Y Y into Y, (L2) (λ, y) λy is continuous on R Y into Y. Let be a partial ordering on Y. The triple (Y, τ, ) is called a partially ordered topological vector space if additionally: (O1) (y 1 y 2, y Y ) y 1 + y y 2 + y (O2) (y 1 y 2, α R + ) αy 1 αy 2
8 A basic result: Theorem 1. Let Y be a topological vector space, B Y convex and cl A B. Then, cl A B int A = A B. Proof. Let a cl A B and assume there is some b B \ A. Consider λ := inf{λ 0 λa + (1 λ)b A}. There exists (λ n ) λ such that λ n a + (1 λ n )b A for all n N. As B is convex and λ [0, 1], we get λa + (1 λ)b cl A B int A. In particular λ > 0. On the other hand, there is a sequence (λ n ) λ such that λ n a+(1 λ n )b A for all n N. This yields the contradiction λa + (1 λ)b int A.
9 The setting II: Y := Y {± } is an extended p. o. t. v. s., ordering cone C Y = int C Y (+ ) + ( ) = +
10 A close relative of the inmal set Denition. The upper closure of a subset A Y (with respect to C) is the set Cl + A := Y if A if A = {+ } {y Y {y} + int C A \ {+ } + int C} otherwise. Proposition. It holds Cl + A := Y cl ( A \ {+ } + C ) if A if A = {+ } otherwise.
11 Denition. The set of weakly minimal vectors of a subset A Y (with respect to C) is dened by wmin A := {y A ({y} int C) A = }. Lemma 1. Let A Y be an arbitrary set and let B Y be a convex set. Let Cl + A B and B \ Cl + A. Then, it holds wmin(cl + A B). A B
12 Denition. The set of weakly minimal vectors of a subset A Y (with respect to C) is dened by wmin A := {y A ({y} int C) A = }. Lemma 1. Let A Y be an arbitrary set and let B Y be a convex set. Let Cl + A B and B \ Cl + A. Then, it holds wmin(cl + A B). A B
13 Denition. The set of weakly minimal vectors of a subset A Y (with respect to C) is dened by wmin A := {y A ({y} int C) A = }. Lemma 1. Let A Y be an arbitrary set and let B Y be a convex set. Let Cl + A B and B \ Cl + A. Then, it holds wmin(cl + A B). A B
14 Lemma 1. Let A Y be an arbitrary set and let B Y be a convex set. Let Cl + A B and B \ Cl + A. Then, it holds wmin(cl + A B). Proof. Assuming that wmin(cl + A B) is empty, we get This implies y Cl + A B, z Cl + A B : y {z} + int C. Cl + A B (Cl + A B) + int C (Cl + A + int C) (B + int C) Cl + A + int C int Cl + A. Theorem 1 yields Cl + A B, which contradicts B \ Cl + A.
15 Special case Corollary. For every set A Y the following is equivalent: (i) = Cl + A Y, (ii) wmin Cl + A. Proof. (i) = (ii). Follows from Lemma 1 for the choice B = Y. (ii) = (i). directly from the denition of wmin.
16 Denition of inmal sets The inmal set of A Y (with respect to C) is dened by Inf A := wmin Cl + A if = Cl + A Y { } if Cl + A = Y {+ } if Cl + A =. Inf A A
17 Another result Lemma 2. Let A Y be an arbitrary set and let B Y be an open set. Then, it holds wmin(cl + A B) = (wmin Cl + A) B.
18 A basic result on inmal sets Lemma 3. For A Y with = Cl + A Y it holds Cl + A + int C Inf A + int C. Proof. Let y Cl + A + int C, then ( {y} int C ) Cl + A. We set B := {y} int C. As B is convex and open, Lemma 1 and Lemma 2 imply that = wmin(cl + A B) = (wmin Cl + A) B. Thus, there exists some z wmin Cl + A = Inf A such that y {z} + int C, whence y Inf A + int C.
19 Another basic result on inmal sets Lemma 4. For A Y with = Cl + A Y it holds Cl + A (Inf A int C) = Y. Proof. Let y Y \ Cl + A. The set B := {y} + int C is open and convex. We have Cl + A B (otherwise the contradiction y Cl + A int C = Y ). Moreover, B \ Cl + A (otherwise B Cl + A and hence the contradiction y cl B Cl + A). Lemma 1 and Lemma 2 imply = wmin(cl + A B) = (wmin Cl + A) B. Thus there is some z wmin Cl + A = Inf A such that z {y} int C, whence y Inf A int C.
20 Properties of inmal sets: Let A, B Y, = Cl + A Y, = Cl + B Y, then: Cl + A + int C = Inf A + int C, Inf A = { y Y {y} + int C Cl + A + int C y Cl + A + int C }, int Cl + A = Cl + A + int C, Inf A = bd Cl + A, Inf A = Cl + A \ ( Cl + A + int C ), Cl + A = Cl + B Inf A = Inf B, Cl + A = Cl + B Cl + A + int C = Cl + B + int C, Inf A = Inf B Inf A + int C = Inf B + int C, Cl + A = Inf A (Inf A + int C), Inf A, (Inf A int C) and (Inf A + int C) are disjoint, Inf A (Inf A int C) (Inf A + int C) = Y.
21 Properties of inmal sets: Let A, B Y, = Cl + A Y, = Cl + B Y, then: Cl + A + int C = Inf A + int C, Inf A = { y Y {y} + int C Cl + A + int C y Cl + A + int C }, int Cl + A = Cl + A + int C, Inf A = bd Cl + A, Inf A = Cl + A \ ( Cl + A + int C ), Cl + A = Cl + B Inf A = Inf B, Cl + A = Cl + B Cl + A + int C = Cl + B + int C, Inf A = Inf B Inf A + int C = Inf B + int C, Cl + A = Inf A (Inf A + int C), Inf A, (Inf A int C) and (Inf A + int C) are disjoint, Inf A (Inf A int C) (Inf A + int C) = Y.
22 Properties of inmal sets: Let A, B Y, = Cl + A Y, = Cl + B Y, then: Cl + A + int C = Inf A + int C, Inf A = { y Y {y} + int C Cl + A + int C y Cl + A + int C }, int Cl + A = Cl + A + int C, Inf A = bd Cl + A, Inf A = Cl + A \ ( Cl + A + int C ), Cl + A = Cl + B Inf A = Inf B, Cl + A = Cl + B Cl + A + int C = Cl + B + int C, Inf A = Inf B Inf A + int C = Inf B + int C, Cl + A = Inf A (Inf A + int C), Inf A, (Inf A int C) and (Inf A + int C) are disjoint, Inf A (Inf A int C) (Inf A + int C) = Y.
23 Properties of inmal sets: Let A, B Y, = Cl + A Y, = Cl + B Y, then: Cl + A + int C = Inf A + int C, Inf A = { y Y {y} + int C Cl + A + int C y Cl + A + int C }, int Cl + A = Cl + A + int C, Inf A = bd Cl + A, Inf A = Cl + A \ ( Cl + A + int C ), Cl + A = Cl + B Inf A = Inf B, Cl + A = Cl + B Cl + A + int C = Cl + B + int C, Inf A = Inf B Inf A + int C = Inf B + int C, Cl + A = Inf A (Inf A + int C), Inf A, (Inf A int C) and (Inf A + int C) are disjoint, Inf A (Inf A int C) (Inf A + int C) = Y.
24 Properties of inmal sets: Let A, B Y, = Cl + A Y, = Cl + B Y, then: Cl + A + int C = Inf A + int C, Inf A = { y Y {y} + int C Cl + A + int C y Cl + A + int C }, int Cl + A = Cl + A + int C, Inf A = bd Cl + A, Inf A = Cl + A \ ( Cl + A + int C ), Cl + A = Cl + B Inf A = Inf B, Cl + A = Cl + B Cl + A + int C = Cl + B + int C, Inf A = Inf B Inf A + int C = Inf B + int C, Cl + A = Inf A (Inf A + int C), Inf A, (Inf A int C) and (Inf A + int C) are disjoint, Inf A (Inf A int C) (Inf A + int C) = Y.
25 Properties of inmal sets: Let A, B Y, = Cl + A Y, = Cl + B Y, then: Cl + A + int C = Inf A + int C, Inf A = { y Y {y} + int C Cl + A + int C y Cl + A + int C }, int Cl + A = Cl + A + int C, Inf A = bd Cl + A, Inf A = Cl + A \ ( Cl + A + int C ), Cl + A = Cl + B Inf A = Inf B, Cl + A = Cl + B Cl + A + int C = Cl + B + int C, Inf A = Inf B Inf A + int C = Inf B + int C, Cl + A = Inf A (Inf A + int C), Inf A, (Inf A int C) and (Inf A + int C) are disjoint, Inf A (Inf A int C) (Inf A + int C) = Y.
26 Properties of inmal sets: Let A, B Y, = Cl + A Y, = Cl + B Y, then: Cl + A + int C = Inf A + int C, Inf A = { y Y {y} + int C Cl + A + int C y Cl + A + int C }, int Cl + A = Cl + A + int C, Inf A = bd Cl + A, Inf A = Cl + A \ ( Cl + A + int C ), Cl + A = Cl + B Inf A = Inf B, Cl + A = Cl + B Cl + A + int C = Cl + B + int C, Inf A = Inf B Inf A + int C = Inf B + int C, Cl + A = Inf A (Inf A + int C), Inf A, (Inf A int C) and (Inf A + int C) are disjoint, Inf A (Inf A int C) (Inf A + int C) = Y.
27 Properties of inmal sets: Let A, B Y, = Cl + A Y, = Cl + B Y, then: Cl + A + int C = Inf A + int C, Inf A = { y Y {y} + int C Cl + A + int C y Cl + A + int C }, int Cl + A = Cl + A + int C, Inf A = bd Cl + A, Inf A = Cl + A \ ( Cl + A + int C ), Cl + A = Cl + B Inf A = Inf B, Cl + A = Cl + B Cl + A + int C = Cl + B + int C, Inf A = Inf B Inf A + int C = Inf B + int C, Cl + A = Inf A (Inf A + int C), Inf A, (Inf A int C) and (Inf A + int C) are disjoint, Inf A (Inf A int C) (Inf A + int C) = Y.
28 Properties of inmal sets: Let A, B Y, = Cl + A Y, = Cl + B Y, then: Cl + A + int C = Inf A + int C, Inf A = { y Y {y} + int C Cl + A + int C y Cl + A + int C }, int Cl + A = Cl + A + int C, Inf A = bd Cl + A, Inf A = Cl + A \ ( Cl + A + int C ), Cl + A = Cl + B Inf A = Inf B, Cl + A = Cl + B Cl + A + int C = Cl + B + int C, Inf A = Inf B Inf A + int C = Inf B + int C, Cl + A = Inf A (Inf A + int C), Inf A, (Inf A int C) and (Inf A + int C) are disjoint, Inf A (Inf A int C) (Inf A + int C) = Y.
29 Properties of inmal sets: Let A, B Y, = Cl + A Y, = Cl + B Y, then: Cl + A + int C = Inf A + int C, Inf A = { y Y {y} + int C Cl + A + int C y Cl + A + int C }, int Cl + A = Cl + A + int C, Inf A = bd Cl + A, Inf A = Cl + A \ ( Cl + A + int C ), Cl + A = Cl + B Inf A = Inf B, Cl + A = Cl + B Cl + A + int C = Cl + B + int C, Inf A = Inf B Inf A + int C = Inf B + int C, Cl + A = Inf A (Inf A + int C), Inf A, (Inf A int C) and (Inf A + int C) are disjoint, Inf A (Inf A int C) (Inf A + int C) = Y.
30 Properties of inmal sets: Let A, B Y, = Cl + A Y, = Cl + B Y, then: Cl + A + int C = Inf A + int C, Inf A = { y Y {y} + int C Cl + A + int C y Cl + A + int C }, int Cl + A = Cl + A + int C, Inf A = bd Cl + A, Inf A = Cl + A \ ( Cl + A + int C ), Cl + A = Cl + B Inf A = Inf B, Cl + A = Cl + B Cl + A + int C = Cl + B + int C, Inf A = Inf B Inf A + int C = Inf B + int C, Cl + A = Inf A (Inf A + int C), Inf A, (Inf A int C) and (Inf A + int C) are disjoint, Inf A (Inf A int C) (Inf A + int C) = Y.
31 Further properties of inmal sets: Let A Y, then: Inf Inf A = Inf A, Cl + Cl + A = Cl + A, Inf Cl + A = Inf A, Cl + Inf A = Cl + A, Inf(Inf A + Inf B) = Inf(A + B), α Inf A = Inf(αA) for α > 0.
32 Further properties of inmal sets: Let A Y, then: Inf Inf A = Inf A, Cl + Cl + A = Cl + A, Inf Cl + A = Inf A, Cl + Inf A = Cl + A, Inf(Inf A + Inf B) = Inf(A + B), α Inf A = Inf(αA) for α > 0.
33 Further properties of inmal sets: Let A Y, then: Inf Inf A = Inf A, Cl + Cl + A = Cl + A, Inf Cl + A = Inf A, Cl + Inf A = Cl + A, Inf(Inf A + Inf B) = Inf(A + B), α Inf A = Inf(αA) for α > 0.
34 Further properties of inmal sets: Let A Y, then: Inf Inf A = Inf A, Cl + Cl + A = Cl + A, Inf Cl + A = Inf A, Cl + Inf A = Cl + A, Inf(Inf A + Inf B) = Inf(A + B), α Inf A = Inf(αA) for α > 0.
35 Part 2 Applications
36 Applications The concept of inmal sets is useful in vector optimization Nieuwenhuis (1980), Tanino (1988, 1992),... : mmmmmmmmmm n inmal sets used for duality results in vector optimization Hamel, Heyde, L. and Tammer ( ): mmmmmmmmmm n set-valued approach to vector optimization: space I of self-inmal subsets of Y shown to be a complete lattice Y isomorphic to a subspace of I mn vector optimization theory with inmum/supremum possible results: solution concepts and existence, duality theory, algorithms advantage: high degree of anaology to the scalar theory
37 Applications The concept of inmal sets is useful in vector optimization Nieuwenhuis (1980), Tanino (1988, 1992),... : mmmmmmmmmm n inmal sets used for duality results in vector optimization Hamel, Heyde, L. and Tammer ( ): mmmmmmmmmm n set-valued approach to vector optimization: space I of self-inmal subsets of Y shown to be a complete lattice Y isomorphic to a subspace of I mn vector optimization theory with inmum/supremum possible results: solution concepts and existence, duality theory, algorithms advantage: high degree of anaology to the scalar theory
38 Applications The concept of inmal sets is useful in vector optimization Nieuwenhuis (1980), Tanino (1988, 1992),... : mmmmmmmmmm n inmal sets used for duality results in vector optimization Hamel, Heyde, L. and Tammer ( ): mmmmmmmmmm n set-valued approach to vector optimization: space I of self-inmal subsets of Y shown to be a complete lattice Y isomorphic to a subspace of I mn vector optimization theory with inmum/supremum possible results: solution concepts and existence, duality theory, algorithms advantage: high degree of anaology to the scalar theory
39 Applications The concept of inmal sets is useful in vector optimization Nieuwenhuis (1980), Tanino (1988, 1992),... : mmmmmmmmmm n inmal sets used for duality results in vector optimization Hamel, Heyde, L. and Tammer ( ): mmmmmmmmmm n set-valued approach to vector optimization: space I of self-inmal subsets of Y shown to be a complete lattice Y isomorphic to a subspace of I mn vector optimization theory with inmum/supremum possible results: solution concepts and existence, duality theory, algorithms advantage: high degree of anaology to the scalar theory
40 Applications The concept of inmal sets is useful in vector optimization Nieuwenhuis (1980), Tanino (1988, 1992),... : mmmmmmmmmm n inmal sets used for duality results in vector optimization Hamel, Heyde, L. and Tammer ( ): mmmmmmmmmm n set-valued approach to vector optimization: space I of self-inmal subsets of Y shown to be a complete lattice Y isomorphic to a subspace of I mn vector optimization theory with inmum/supremum possible results: solution concepts and existence, duality theory, algorithms advantage: high degree of anaology to the scalar theory
41 Applications The hyperspace I of self-inmal sets B Y is called self-inmal if Inf B = B I... the space of all self-inmal subsets of Y addition: B 1 B 2 := Inf(B 1 + B 2 ), multiplication: α B := Inf(α B) ordering: B 1 B 2 : Cl + B 1 Cl + B 2.
42 Applications addition in I ordering relation in I A 2 A 1 A 2 A 1 A 3 A 2 A 1 A 1 A 2 A 1 A 3 A 2 A 3
43 2. Applications Inmum and supremum in I Theorem 2. I is a complete lattice. For nonempty sets A I we have inf A = Inf A A A, sup A = Sup A A A. A I sup A inf A
44 2. Applications Embedding of the (VOP) Let X be a set and A X. (VOP) Minimize p : X Y with respect to C over A. p : X I, p(x) := Inf { p(x)} = { p(x)} + bd C (IVP) Minimize p : X I with respect to over A.
45 2. Applications Example: The conjugate of an I-valued function Let X, X be a dual pairing, f : X I and c int C: f : X I, f (x ) := sup x X { x, x {c} f(x)}, Note that A I A I.
46 2. Applications Example: Conjugate duality Let f : R n I, g : R m I, A R m n, c int C primal objective: p : R n I, p(x) = f(x) g(ax) dual objective: d : R m I, d(u) = f (A T u) g ( u) (P) (D) P := inf x R n p (x) D := sup u R m d(u) Duality theorem. (P) and (D) satisfy the weak duality inequality D P. If f and g are convex, 0 ri (dom g A dom f), then we have strong duality, i.e., D = P.
47 2. Applications Vector optimization with inmum and supremum What else works? solution concepts existence od solutions vectorial saddle points existence of saddle points Langrange duality Attainment of the solution of the dual problem symmetric linear theory duality interpretation of cutting plane mehtods and dual methods
48 Choice of literature: Nieuwenhuis: Supremal points and generalized duality, Math. Operationsforsch. Stat., Ser. Optimization, 1980 L.; Tammer: A new approach to duality in vector optimization, Optimization, 2007 Heyde; L.; Tammer: Set-valued duality theory for multiple objective linear programs and application to mathematical nance, Math. Meth. Operations Research, 2009 Heyde; L.: Geometric duality in multiple objective linear programming, SIAM J. Optim., 2008 Hamel: A Duality Theory for Set-Valued Functions I: Fenchel Conjugation Theory, manuscript Heyde; L.: Solution concepts in vector optimization. A fresh look at an old story, submitted to Optimization. L.: Vector optimization with inmum and supremum, habilitation thesis, October 2009 (I hope so ;-)
Duality of linear conic problems
Duality of linear conic problems Alexander Shapiro and Arkadi Nemirovski Abstract It is well known that the optimal values of a linear programming problem and its dual are equal to each other if at least
More informationSeparation Properties for Locally Convex Cones
Journal of Convex Analysis Volume 9 (2002), No. 1, 301 307 Separation Properties for Locally Convex Cones Walter Roth Department of Mathematics, Universiti Brunei Darussalam, Gadong BE1410, Brunei Darussalam
More informationSOLUTIONS TO ASSIGNMENT 1 MATH 576
SOLUTIONS TO ASSIGNMENT 1 MATH 576 SOLUTIONS BY OLIVIER MARTIN 13 #5. Let T be the topology generated by A on X. We want to show T = J B J where B is the set of all topologies J on X with A J. This amounts
More informationFurther Study on Strong Lagrangian Duality Property for Invex Programs via Penalty Functions 1
Further Study on Strong Lagrangian Duality Property for Invex Programs via Penalty Functions 1 J. Zhang Institute of Applied Mathematics, Chongqing University of Posts and Telecommunications, Chongqing
More informationConvex analysis and profit/cost/support functions
CALIFORNIA INSTITUTE OF TECHNOLOGY Division of the Humanities and Social Sciences Convex analysis and profit/cost/support functions KC Border October 2004 Revised January 2009 Let A be a subset of R m
More informationResearch Article Stability Analysis for Higher-Order Adjacent Derivative in Parametrized Vector Optimization
Hindawi Publishing Corporation Journal of Inequalities and Applications Volume 2010, Article ID 510838, 15 pages doi:10.1155/2010/510838 Research Article Stability Analysis for Higher-Order Adjacent Derivative
More information(Basic definitions and properties; Separation theorems; Characterizations) 1.1 Definition, examples, inner description, algebraic properties
Lecture 1 Convex Sets (Basic definitions and properties; Separation theorems; Characterizations) 1.1 Definition, examples, inner description, algebraic properties 1.1.1 A convex set In the school geometry
More informationMathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
More informationLECTURE 5: DUALITY AND SENSITIVITY ANALYSIS. 1. Dual linear program 2. Duality theory 3. Sensitivity analysis 4. Dual simplex method
LECTURE 5: DUALITY AND SENSITIVITY ANALYSIS 1. Dual linear program 2. Duality theory 3. Sensitivity analysis 4. Dual simplex method Introduction to dual linear program Given a constraint matrix A, right
More informationMATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set.
MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set. Vector space A vector space is a set V equipped with two operations, addition V V (x,y) x + y V and scalar
More information2.3 Convex Constrained Optimization Problems
42 CHAPTER 2. FUNDAMENTAL CONCEPTS IN CONVEX OPTIMIZATION Theorem 15 Let f : R n R and h : R R. Consider g(x) = h(f(x)) for all x R n. The function g is convex if either of the following two conditions
More information1 Norms and Vector Spaces
008.10.07.01 1 Norms and Vector Spaces Suppose we have a complex vector space V. A norm is a function f : V R which satisfies (i) f(x) 0 for all x V (ii) f(x + y) f(x) + f(y) for all x,y V (iii) f(λx)
More information1. Prove that the empty set is a subset of every set.
1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since
More informationALMOST COMMON PRIORS 1. INTRODUCTION
ALMOST COMMON PRIORS ZIV HELLMAN ABSTRACT. What happens when priors are not common? We introduce a measure for how far a type space is from having a common prior, which we term prior distance. If a type
More informationConvex Programming Tools for Disjunctive Programs
Convex Programming Tools for Disjunctive Programs João Soares, Departamento de Matemática, Universidade de Coimbra, Portugal Abstract A Disjunctive Program (DP) is a mathematical program whose feasible
More informationNo: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics
No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results
More informationFUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES
FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES CHRISTOPHER HEIL 1. Cosets and the Quotient Space Any vector space is an abelian group under the operation of vector addition. So, if you are have studied
More informationHow To Prove The Dirichlet Unit Theorem
Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if
More informationMathematical Methods of Engineering Analysis
Mathematical Methods of Engineering Analysis Erhan Çinlar Robert J. Vanderbei February 2, 2000 Contents Sets and Functions 1 1 Sets................................... 1 Subsets.............................
More informationON COMPLETELY CONTINUOUS INTEGRATION OPERATORS OF A VECTOR MEASURE. 1. Introduction
ON COMPLETELY CONTINUOUS INTEGRATION OPERATORS OF A VECTOR MEASURE J.M. CALABUIG, J. RODRÍGUEZ, AND E.A. SÁNCHEZ-PÉREZ Abstract. Let m be a vector measure taking values in a Banach space X. We prove that
More informationLet H and J be as in the above lemma. The result of the lemma shows that the integral
Let and be as in the above lemma. The result of the lemma shows that the integral ( f(x, y)dy) dx is well defined; we denote it by f(x, y)dydx. By symmetry, also the integral ( f(x, y)dx) dy is well defined;
More informationHow To Find Out How To Calculate A Premeasure On A Set Of Two-Dimensional Algebra
54 CHAPTER 5 Product Measures Given two measure spaces, we may construct a natural measure on their Cartesian product; the prototype is the construction of Lebesgue measure on R 2 as the product of Lebesgue
More informationInner Product Spaces and Orthogonality
Inner Product Spaces and Orthogonality week 3-4 Fall 2006 Dot product of R n The inner product or dot product of R n is a function, defined by u, v a b + a 2 b 2 + + a n b n for u a, a 2,, a n T, v b,
More informationThese axioms must hold for all vectors ū, v, and w in V and all scalars c and d.
DEFINITION: A vector space is a nonempty set V of objects, called vectors, on which are defined two operations, called addition and multiplication by scalars (real numbers), subject to the following axioms
More informationLinear Algebra. A vector space (over R) is an ordered quadruple. such that V is a set; 0 V ; and the following eight axioms hold:
Linear Algebra A vector space (over R) is an ordered quadruple (V, 0, α, µ) such that V is a set; 0 V ; and the following eight axioms hold: α : V V V and µ : R V V ; (i) α(α(u, v), w) = α(u, α(v, w)),
More informationMINIMIZATION OF ENTROPY FUNCTIONALS UNDER MOMENT CONSTRAINTS. denote the family of probability density functions g on X satisfying
MINIMIZATION OF ENTROPY FUNCTIONALS UNDER MOMENT CONSTRAINTS I. Csiszár (Budapest) Given a σ-finite measure space (X, X, µ) and a d-tuple ϕ = (ϕ 1,..., ϕ d ) of measurable functions on X, for a = (a 1,...,
More informationOrthogonal Diagonalization of Symmetric Matrices
MATH10212 Linear Algebra Brief lecture notes 57 Gram Schmidt Process enables us to find an orthogonal basis of a subspace. Let u 1,..., u k be a basis of a subspace V of R n. We begin the process of finding
More informationThe Ideal Class Group
Chapter 5 The Ideal Class Group We will use Minkowski theory, which belongs to the general area of geometry of numbers, to gain insight into the ideal class group of a number field. We have already mentioned
More informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights
More informationINCIDENCE-BETWEENNESS GEOMETRY
INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full
More informationConvex Rationing Solutions (Incomplete Version, Do not distribute)
Convex Rationing Solutions (Incomplete Version, Do not distribute) Ruben Juarez rubenj@hawaii.edu January 2013 Abstract This paper introduces a notion of convexity on the rationing problem and characterizes
More informationSimilarity and Diagonalization. Similar Matrices
MATH022 Linear Algebra Brief lecture notes 48 Similarity and Diagonalization Similar Matrices Let A and B be n n matrices. We say that A is similar to B if there is an invertible n n matrix P such that
More informationDEGREES OF ORDERS ON TORSION-FREE ABELIAN GROUPS
DEGREES OF ORDERS ON TORSION-FREE ABELIAN GROUPS ASHER M. KACH, KAREN LANGE, AND REED SOLOMON Abstract. We construct two computable presentations of computable torsion-free abelian groups, one of isomorphism
More informationMath 4310 Handout - Quotient Vector Spaces
Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable
More informationAdaptive Online Gradient Descent
Adaptive Online Gradient Descent Peter L Bartlett Division of Computer Science Department of Statistics UC Berkeley Berkeley, CA 94709 bartlett@csberkeleyedu Elad Hazan IBM Almaden Research Center 650
More information1 Sets and Set Notation.
LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most
More information4.6 Linear Programming duality
4.6 Linear Programming duality To any minimization (maximization) LP we can associate a closely related maximization (minimization) LP. Different spaces and objective functions but in general same optimal
More informationClassification of Cartan matrices
Chapter 7 Classification of Cartan matrices In this chapter we describe a classification of generalised Cartan matrices This classification can be compared as the rough classification of varieties in terms
More informationA CHARACTERIZATION OF C k (X) FOR X NORMAL AND REALCOMPACT
Bol. Soc. Mat. Mexicana (3) Vol. 12, 2006 A CHARACTERIZATION OF C k (X) FOR X NORMAL AND REALCOMPACT F. MONTALVO, A. A. PULGARÍN AND B. REQUEJO Abstract. We present some internal conditions on a locally
More information4: SINGLE-PERIOD MARKET MODELS
4: SINGLE-PERIOD MARKET MODELS Ben Goldys and Marek Rutkowski School of Mathematics and Statistics University of Sydney Semester 2, 2015 B. Goldys and M. Rutkowski (USydney) Slides 4: Single-Period Market
More informationSome representability and duality results for convex mixed-integer programs.
Some representability and duality results for convex mixed-integer programs. Santanu S. Dey Joint work with Diego Morán and Juan Pablo Vielma December 17, 2012. Introduction About Motivation Mixed integer
More informationBANACH AND HILBERT SPACE REVIEW
BANACH AND HILBET SPACE EVIEW CHISTOPHE HEIL These notes will briefly review some basic concepts related to the theory of Banach and Hilbert spaces. We are not trying to give a complete development, but
More informationMEASURE AND INTEGRATION. Dietmar A. Salamon ETH Zürich
MEASURE AND INTEGRATION Dietmar A. Salamon ETH Zürich 12 May 2016 ii Preface This book is based on notes for the lecture course Measure and Integration held at ETH Zürich in the spring semester 2014. Prerequisites
More informationRend. Istit. Mat. Univ. Trieste Suppl. Vol. XXX, 111{121 (1999) Fuzziness in Chang's Fuzzy Topological Spaces Valentn Gregori and Anna Vidal () Summary. - It is known that fuzziness within the concept
More informationSMALL SKEW FIELDS CÉDRIC MILLIET
SMALL SKEW FIELDS CÉDRIC MILLIET Abstract A division ring of positive characteristic with countably many pure types is a field Wedderburn showed in 1905 that finite fields are commutative As for infinite
More informationA NEW LOOK AT CONVEX ANALYSIS AND OPTIMIZATION
1 A NEW LOOK AT CONVEX ANALYSIS AND OPTIMIZATION Dimitri Bertsekas M.I.T. FEBRUARY 2003 2 OUTLINE Convexity issues in optimization Historical remarks Our treatment of the subject Three unifying lines of
More informationMetric Spaces. Chapter 7. 7.1. Metrics
Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some
More informationI. GROUPS: BASIC DEFINITIONS AND EXAMPLES
I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called
More informationMatrix Representations of Linear Transformations and Changes of Coordinates
Matrix Representations of Linear Transformations and Changes of Coordinates 01 Subspaces and Bases 011 Definitions A subspace V of R n is a subset of R n that contains the zero element and is closed under
More informationTHE DIMENSION OF A VECTOR SPACE
THE DIMENSION OF A VECTOR SPACE KEITH CONRAD This handout is a supplementary discussion leading up to the definition of dimension and some of its basic properties. Let V be a vector space over a field
More informationAbout the inverse football pool problem for 9 games 1
Seventh International Workshop on Optimal Codes and Related Topics September 6-1, 013, Albena, Bulgaria pp. 15-133 About the inverse football pool problem for 9 games 1 Emil Kolev Tsonka Baicheva Institute
More informationORIENTATIONS. Contents
ORIENTATIONS Contents 1. Generators for H n R n, R n p 1 1. Generators for H n R n, R n p We ended last time by constructing explicit generators for H n D n, S n 1 by using an explicit n-simplex which
More informationIntroduction to Topology
Introduction to Topology Tomoo Matsumura November 30, 2010 Contents 1 Topological spaces 3 1.1 Basis of a Topology......................................... 3 1.2 Comparing Topologies.......................................
More informationIRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction
IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL R. DRNOVŠEK, T. KOŠIR Dedicated to Prof. Heydar Radjavi on the occasion of his seventieth birthday. Abstract. Let S be an irreducible
More informationMetric Spaces Joseph Muscat 2003 (Last revised May 2009)
1 Distance J Muscat 1 Metric Spaces Joseph Muscat 2003 (Last revised May 2009) (A revised and expanded version of these notes are now published by Springer.) 1 Distance A metric space can be thought of
More information4. Expanding dynamical systems
4.1. Metric definition. 4. Expanding dynamical systems Definition 4.1. Let X be a compact metric space. A map f : X X is said to be expanding if there exist ɛ > 0 and L > 1 such that d(f(x), f(y)) Ld(x,
More informationON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS
ON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS DANIEL RABAYEV AND JACK SONN Abstract. Let f(x) be a monic polynomial in Z[x] with no rational roots but with roots in Q p for
More informationFuzzy Differential Systems and the New Concept of Stability
Nonlinear Dynamics and Systems Theory, 1(2) (2001) 111 119 Fuzzy Differential Systems and the New Concept of Stability V. Lakshmikantham 1 and S. Leela 2 1 Department of Mathematical Sciences, Florida
More information10. Proximal point method
L. Vandenberghe EE236C Spring 2013-14) 10. Proximal point method proximal point method augmented Lagrangian method Moreau-Yosida smoothing 10-1 Proximal point method a conceptual algorithm for minimizing
More informationThe Banach-Tarski Paradox
University of Oslo MAT2 Project The Banach-Tarski Paradox Author: Fredrik Meyer Supervisor: Nadia S. Larsen Abstract In its weak form, the Banach-Tarski paradox states that for any ball in R, it is possible
More information1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
More informationFinite dimensional topological vector spaces
Chapter 3 Finite dimensional topological vector spaces 3.1 Finite dimensional Hausdorff t.v.s. Let X be a vector space over the field K of real or complex numbers. We know from linear algebra that the
More informationMixedÀ¾ нOptimization Problem via Lagrange Multiplier Theory
MixedÀ¾ нOptimization Problem via Lagrange Multiplier Theory Jun WuÝ, Sheng ChenÞand Jian ChuÝ ÝNational Laboratory of Industrial Control Technology Institute of Advanced Process Control Zhejiang University,
More informationOn Nicely Smooth Banach Spaces
E extracta mathematicae Vol. 16, Núm. 1, 27 45 (2001) On Nicely Smooth Banach Spaces Pradipta Bandyopadhyay, Sudeshna Basu Stat-Math Unit, Indian Statistical Institute, 203 B.T. Road, Calcutta 700035,
More informationT ( a i x i ) = a i T (x i ).
Chapter 2 Defn 1. (p. 65) Let V and W be vector spaces (over F ). We call a function T : V W a linear transformation form V to W if, for all x, y V and c F, we have (a) T (x + y) = T (x) + T (y) and (b)
More informationDate: April 12, 2001. Contents
2 Lagrange Multipliers Date: April 12, 2001 Contents 2.1. Introduction to Lagrange Multipliers......... p. 2 2.2. Enhanced Fritz John Optimality Conditions...... p. 12 2.3. Informative Lagrange Multipliers...........
More informationMA651 Topology. Lecture 6. Separation Axioms.
MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples
More informationBasic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011
Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011 A. Miller 1. Introduction. The definitions of metric space and topological space were developed in the early 1900 s, largely
More informationChapter 3. Cartesian Products and Relations. 3.1 Cartesian Products
Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing
More informationBuered Probability of Exceedance: Mathematical Properties and Optimization Algorithms
Buered Probability of Exceedance: Mathematical Properties and Optimization Algorithms Alexander Mafusalov, Stan Uryasev RESEARCH REPORT 2014-1 Risk Management and Financial Engineering Lab Department of
More informationLogic, Algebra and Truth Degrees 2008. Siena. A characterization of rst order rational Pavelka's logic
Logic, Algebra and Truth Degrees 2008 September 8-11, 2008 Siena A characterization of rst order rational Pavelka's logic Xavier Caicedo Universidad de los Andes, Bogota Under appropriate formulations,
More informationSystems of Linear Equations
Systems of Linear Equations Beifang Chen Systems of linear equations Linear systems A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where a, a,, a n and
More informationON SOME CLASSES OF GOOD QUOTIENT RELATIONS
Novi Sad J. Math. Vol. 32, No. 2, 2002, 131-140 131 ON SOME CLASSES OF GOOD QUOTIENT RELATIONS Ivica Bošnjak 1, Rozália Madarász 1 Abstract. The notion of a good quotient relation has been introduced as
More informationNOTES ON LINEAR TRANSFORMATIONS
NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all
More informationA domain of spacetime intervals in general relativity
A domain of spacetime intervals in general relativity Keye Martin Department of Mathematics Tulane University New Orleans, LA 70118 United States of America martin@math.tulane.edu Prakash Panangaden School
More informationOn Minimal Valid Inequalities for Mixed Integer Conic Programs
On Minimal Valid Inequalities for Mixed Integer Conic Programs Fatma Kılınç Karzan June 27, 2013 Abstract We study mixed integer conic sets involving a general regular (closed, convex, full dimensional,
More informationCODING TRUE ARITHMETIC IN THE MEDVEDEV AND MUCHNIK DEGREES
CODING TRUE ARITHMETIC IN THE MEDVEDEV AND MUCHNIK DEGREES PAUL SHAFER Abstract. We prove that the first-order theory of the Medvedev degrees, the first-order theory of the Muchnik degrees, and the third-order
More informationE3: PROBABILITY AND STATISTICS lecture notes
E3: PROBABILITY AND STATISTICS lecture notes 2 Contents 1 PROBABILITY THEORY 7 1.1 Experiments and random events............................ 7 1.2 Certain event. Impossible event............................
More information1 VECTOR SPACES AND SUBSPACES
1 VECTOR SPACES AND SUBSPACES What is a vector? Many are familiar with the concept of a vector as: Something which has magnitude and direction. an ordered pair or triple. a description for quantities such
More informationThe Henstock-Kurzweil-Stieltjes type integral for real functions on a fractal subset of the real line
The Henstock-Kurzweil-Stieltjes type integral for real functions on a fractal subset of the real line D. Bongiorno, G. Corrao Dipartimento di Ingegneria lettrica, lettronica e delle Telecomunicazioni,
More informationFollow links for Class Use and other Permissions. For more information send email to: permissions@pupress.princeton.edu
COPYRIGHT NOTICE: Ariel Rubinstein: Lecture Notes in Microeconomic Theory is published by Princeton University Press and copyrighted, c 2006, by Princeton University Press. All rights reserved. No part
More informationMATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix.
MATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix. Nullspace Let A = (a ij ) be an m n matrix. Definition. The nullspace of the matrix A, denoted N(A), is the set of all n-dimensional column
More informationOn duality of modular G-Riesz bases and G-Riesz bases in Hilbert C*-modules
Journal of Linear and Topological Algebra Vol. 04, No. 02, 2015, 53-63 On duality of modular G-Riesz bases and G-Riesz bases in Hilbert C*-modules M. Rashidi-Kouchi Young Researchers and Elite Club Kahnooj
More informationTwo-Sided Matching Theory
Two-Sided Matching Theory M. Utku Ünver Boston College Introduction to the Theory of Two-Sided Matching To see which results are robust, we will look at some increasingly general models. Even before we
More informationZORN S LEMMA AND SOME APPLICATIONS
ZORN S LEMMA AND SOME APPLICATIONS KEITH CONRAD 1. Introduction Zorn s lemma is a result in set theory that appears in proofs of some non-constructive existence theorems throughout mathematics. We will
More informationInvertible elements in associates and semigroups. 1
Quasigroups and Related Systems 5 (1998), 53 68 Invertible elements in associates and semigroups. 1 Fedir Sokhatsky Abstract Some invertibility criteria of an element in associates, in particular in n-ary
More informationFixed Point Theorems For Set-Valued Maps
Fixed Point Theorems For Set-Valued Maps Bachelor s thesis in functional analysis Institute for Analysis and Scientific Computing Vienna University of Technology Andreas Widder, July 2009. Preface In this
More informationF. ABTAHI and M. ZARRIN. (Communicated by J. Goldstein)
Journal of Algerian Mathematical Society Vol. 1, pp. 1 6 1 CONCERNING THE l p -CONJECTURE FOR DISCRETE SEMIGROUPS F. ABTAHI and M. ZARRIN (Communicated by J. Goldstein) Abstract. For 2 < p
More informationDiscernibility Thresholds and Approximate Dependency in Analysis of Decision Tables
Discernibility Thresholds and Approximate Dependency in Analysis of Decision Tables Yu-Ru Syau¹, En-Bing Lin²*, Lixing Jia³ ¹Department of Information Management, National Formosa University, Yunlin, 63201,
More informationSection 4.4 Inner Product Spaces
Section 4.4 Inner Product Spaces In our discussion of vector spaces the specific nature of F as a field, other than the fact that it is a field, has played virtually no role. In this section we no longer
More informationLEARNING OBJECTIVES FOR THIS CHAPTER
CHAPTER 2 American mathematician Paul Halmos (1916 2006), who in 1942 published the first modern linear algebra book. The title of Halmos s book was the same as the title of this chapter. Finite-Dimensional
More informationNotes on metric spaces
Notes on metric spaces 1 Introduction The purpose of these notes is to quickly review some of the basic concepts from Real Analysis, Metric Spaces and some related results that will be used in this course.
More informationTOPOLOGY: THE JOURNEY INTO SEPARATION AXIOMS
TOPOLOGY: THE JOURNEY INTO SEPARATION AXIOMS VIPUL NAIK Abstract. In this journey, we are going to explore the so called separation axioms in greater detail. We shall try to understand how these axioms
More informationSo let us begin our quest to find the holy grail of real analysis.
1 Section 5.2 The Complete Ordered Field: Purpose of Section We present an axiomatic description of the real numbers as a complete ordered field. The axioms which describe the arithmetic of the real numbers
More informationMathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson
Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement
More informationINTEGRAL OPERATORS ON THE PRODUCT OF C(K) SPACES
INTEGRAL OPERATORS ON THE PRODUCT OF C(K) SPACES FERNANDO BOMBAL AND IGNACIO VILLANUEVA Abstract. We study and characterize the integral multilinear operators on a product of C(K) spaces in terms of the
More informationWalrasian Demand. u(x) where B(p, w) = {x R n + : p x w}.
Walrasian Demand Econ 2100 Fall 2015 Lecture 5, September 16 Outline 1 Walrasian Demand 2 Properties of Walrasian Demand 3 An Optimization Recipe 4 First and Second Order Conditions Definition Walrasian
More informationGeometrical Characterization of RN-operators between Locally Convex Vector Spaces
Geometrical Characterization of RN-operators between Locally Convex Vector Spaces OLEG REINOV St. Petersburg State University Dept. of Mathematics and Mechanics Universitetskii pr. 28, 198504 St, Petersburg
More informationLinear Algebra I. Ronald van Luijk, 2012
Linear Algebra I Ronald van Luijk, 2012 With many parts from Linear Algebra I by Michael Stoll, 2007 Contents 1. Vector spaces 3 1.1. Examples 3 1.2. Fields 4 1.3. The field of complex numbers. 6 1.4.
More informationIdeal Class Group and Units
Chapter 4 Ideal Class Group and Units We are now interested in understanding two aspects of ring of integers of number fields: how principal they are (that is, what is the proportion of principal ideals
More information