Polyhedral Optimization Lecture 4 – Part 3 M. Pawan Kumar Slides available online

Slides:



Advertisements
Similar presentations
Functions Reading: Epp Chp 7.1, 7.2, 7.4
Advertisements

DEFINITION Let f : A  B and let X  A and Y  B. The image (set) of X is f(X) = {y  B : y = f(x) for some x  X} and the inverse image of Y is f –1 (Y)
1 Decomposing Hypergraphs with Hypertrees Raphael Yuster University of Haifa - Oranim.
Algebraic Structures: Group Theory II
Section 13 Homomorphisms Definition A map  of a group G into a group G’ is a homomorphism if the homomophism property  (ab) =  (a)  (b) Holds for.
Lecture 3 Set Operations & Set Functions. Recap Set: unordered collection of objects Equal sets have the same elements Subset: elements in A are also.
Snick  snack CPSC 121: Models of Computation 2008/9 Winter Term 2 Functions Steve Wolfman, based on notes by Patrice Belleville and others.
Functions f( ) = A B Lecture 15: Nov 4.
Functions Goals Introduce the concept of function Introduce injective, surjective, & bijective functions.
Lecture 10 Matroid. Independent System Consider a finite set S and a collection C of subsets of S. (S,C) is called an independent system if i.e., it is.
Polyhedral Optimization Lecture 3 – Part 3 M. Pawan Kumar Slides available online
1 Section 1.8 Functions. 2 Loose Definition Mapping of each element of one set onto some element of another set –each element of 1st set must map to something,
CS 2210 (22C:019) Discrete Structures Sets and Functions Spring 2015 Sukumar Ghosh.
Sullivan PreCalculus Section 4.2 Inverse Functions
Polyhedral Optimization Lecture 3 – Part 2
2.1 Sets 2.2 Set Operations 2.3 Functions ‒Functions ‒ Injections, Surjections and Bijections ‒ Inverse Functions ‒Composition 2.4 Sequences and Summations.
Inverse Functions By Dr. Carol A. Marinas. A function is a relation when each x-value is paired with only 1 y-value. (Vertical Line Test) A function f.
Polyhedral Optimization Lecture 5 – Part 1 M. Pawan Kumar Slides available online
INVERSE FUNCTIONS Section 3.3. Set X Set Y Remember we talked about functions--- taking a set X and mapping into a Set Y An inverse.
Functions. Copyright © Peter Cappello2 Definition Let D and C be nonempty sets. A function f from D to C, for each element d  D, assigns exactly 1 element.
Martin Grötschel  Institute of Mathematics, Technische Universität Berlin (TUB)  DFG-Research Center “Mathematics for key technologies” (M ATHEON ) 
Discrete Mathematics and Its Applications Sixth Edition By Kenneth Rosen Copyright  The McGraw-Hill Companies, Inc. Permission required for reproduction.
1 Annoucement n Skills you need: (1) (In Thinking) You think and move by Logic Definitions Mathematical properties (Basic algebra etc.) (2) (In Exploration)
Chapter 2 Greedy Strategy I. Independent System Ding-Zhu Du.
Polyhedral Optimization Lecture 4 – Part 2 M. Pawan Kumar Slides available online
Great Theoretical Ideas in Computer Science for Some.
1 Discrete Structures – CNS 2300 Text Discrete Mathematics and Its Applications (5 th Edition) Kenneth H. Rosen Chapter 1 The Foundations: Logic, Sets,
Example Prove that: “IF 3n + 2 is odd, then n is odd” Proof by Contradiction: -p = 3n + 2 is odd, q = n is odd. -Assume that ~(p  q) is true OR -(p 
Basic Structures: Functions Muhammad Arief download dari
Agenda Week 10 Lecture coverage: –Functions –Types of Function –Composite function –Inverse of a function.
Discrete Optimization Lecture 4 – Part 1 M. Pawan Kumar Slides available online
Polyhedral Optimization Lecture 5 – Part 2 M. Pawan Kumar Slides available online
What is a set? A set is a collection of objects.
Optimization - Lecture 4, Part 1 M. Pawan Kumar Slides available online
Great Theoretical Ideas in Computer Science.
Functions.
Introduction to Graph Theory
1 Functions CS 202 Epp section ??? Aaron Bloomfield.
Martin Grötschel  Institute of Mathematics, Technische Universität Berlin (TUB)  DFG-Research Center “Mathematics for key technologies” (M ATHEON ) 
Math 1304 Calculus I 1.6 Inverse Functions. 1.6 Inverse functions Definition: A function f is said to be one-to- one if f(x) = f(y) implies x = y. It.
FUNCTIONS COSC-1321 Discrete Structures 1. Function. Definition Let X and Y be sets. A function f from X to Y is a relation from X to Y with the property.
Equivalence Relations Lecture 45 Section 10.3 Fri, Apr 8, 2005.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
Discrete Optimization Lecture 5 – Part 1 M. Pawan Kumar Slides available online
Optimization - Lecture 5, Part 1 M. Pawan Kumar Slides available online
Submodularity Reading Group Submodular Function Minimization via Linear Programming M. Pawan Kumar
Submodularity Reading Group Matroids, Submodular Functions M. Pawan Kumar
Polyhedral Optimization Lecture 5 – Part 3 M. Pawan Kumar Slides available online
Summary of the Last Lecture This is our second lecture. In our first lecture, we discussed The vector spaces briefly and proved some basic inequalities.
Section 2.5. Cardinality Definition: A set that is either finite or has the same cardinality as the set of positive integers (Z + ) is called countable.
Main Menu Main Menu (Click on the topics below) Pigeonhole Principle Example Generalized Pigeonhole Principle Example Proof of Pigeonhole Principle Click.
Discrete Optimization Lecture 3 – Part 1 M. Pawan Kumar Slides available online
1 Lecture 5 Functions. 2 Functions in real applications Curve of a bridge can be described by a function Converting Celsius to Fahrenheit.
FUNCTIONS.
Submodularity Reading Group Matroid Polytopes, Polymatroid M. Pawan Kumar
Submodularity Reading Group Matroids, Submodular Functions M. Pawan Kumar
Polyhedral Optimization Lecture 2 – Part 2 M. Pawan Kumar Slides available online
Discrete Mathematics CS 2610
Unit-III Algebraic Structures
CS 2210:0001 Discrete Structures Sets and Functions
Submodularity Reading Group More Examples of Matroids
Set Topology MTH 251 Lecture # 8.
Lecture 11 Overview Self-Reducibility.
Ch 5 Functions Chapter 5: Functions
Sullivan Algebra and Trigonometry: Section 6.1
Lecture 43 Section 10.1 Wed, Apr 6, 2005
Applied Discrete Mathematics Week 3: Sets
Functions Rosen 2.3, 2.5 f( ) = A B Lecture 5: Oct 1, 2.
Ch 6.3: Step Functions Some of the most interesting elementary applications of the Laplace Transform method occur in the solution of linear equations.
Ch 6.3: Step Functions Some of the most interesting elementary applications of the Laplace Transform method occur in the solution of linear equations.
Presentation transcript:

Polyhedral Optimization Lecture 4 – Part 3 M. Pawan Kumar Slides available online

Matroid Mapping Matroid Union Outline

Mapping M’ = (S’, I’ ) s’ 1 s’ 2 s’ 3 s’ 4 s’ 5 s1s1 s2s2 s3s3 s4s4 s5s5 f: S’ → S f(X’) = {f(s), s ∈ X’} for any X’ ⊆ S’ I = {f(X’), X’ ∈ I’ } Bijective M = (S, I )

Mapping M’ = (S’, I’ ) s’ 1 s’ 2 s’ 3 s’ 4 s’ 5 s1s1 s2s2 s3s3 s4s4 s5s5 f: S’ → S Is M a matroid? I = {f(X’), X’ ∈ I’ } Bijective M = (S, I )

Mapping M’ = (S’, I’ ) s’ 1 s’ 2 s’ 3 s’ 4 s’ 5 s1s1 s2s2 s3s3 s4s4 s5s5 f: S’ → S I = {f(X’), X’ ∈ I’ } One-to-One M = (S, I ) Is M a matroid?

Mapping M’ = (S’, I’ ) s’ 1 s’ 2 s’ 3 s’ 4 s’ 5 s1s1 s2s2 s3s3 s4s4 s5s5 f: S’ → S I = {f(X’), X’ ∈ I’ } M = (S, I ) Is M a matroid? YESProof?

Proof Sketch M = (S, I ) is a subset systemProof is trivial Let X ∈ I and Y ∈ I, with |X| < |Y| There has to exist s ∈ Y\X, X ∪ {s} ∈ I Let X’ ∈ I’ with f(X’) = X and |X’| = |X| Let Y’ ∈ I’ with f(Y’) = Y and |Y’| = |Y| X’ and Y’ are not necessarily unique

Proof Sketch M = (S, I ) is a subset systemProof is trivial Let X ∈ I and Y ∈ I, with |X| < |Y| There has to exist s ∈ Y\X, X ∪ {s} ∈ I Let X’ ∈ I’ with f(X’) = X and |X’| = |X| Let Y’ ∈ I’ with f(Y’) = Y and |Y’| = |Y| Choose X’ and Y’ by maximizing |X’ ∩ Y’|

Proof Sketch |X’| < |Y’| There has to exist s’ ∈ Y’\X’, X’ ∪ {s’} ∈ I’ If f(s’) = s ∉ X, then X ∪ {s} ∈ I M is a matroid

Proof Sketch |X’| < |Y’| There has to exist s’ ∈ Y’\X’, X’ ∪ {s’} ∈ I’ Let f(s’) = s ∈ X There exists s’’ ∈ X’ such that f(s’’) = s s’’ ∉ Y’ Why? Otherwise, |Y’| > |Y| since f(s’) = f(s’’)

Proof Sketch |X’| < |Y’| There has to exist s’ ∈ Y’\X’, X’ ∪ {s’} ∈ I’ Let f(s’) = s ∈ X There exists s’’ ∈ X’ such that f(s’’) = s s’’ ∉ Y’ X’’ = X’ – {s’’} + {s’} |X’’ ∩ Y’| > |X’ ∩ Y’| Contradiction

Matroid Mapping –Inverse Function –Rank Function Matroid Union Outline

Inverse Function M’ = (S’, I’ ) s’ 1 s’ 2 s’ 3 s’ 4 s’ 5 s1s1 s2s2 s3s3 s4s4 s5s5 f: S’ → S I = {f(X’), X’ ∈ I’ } M = (S, I ) f -1 (s) = {s’ ∈ S’, f(s’) = s} f -1 (s 1 )?{s’ 1,s’ 2 }

Inverse Function M’ = (S’, I’ ) s’ 1 s’ 2 s’ 3 s’ 4 s’ 5 s1s1 s2s2 s3s3 s4s4 s5s5 f: S’ → S I = {f(X’), X’ ∈ I’ } M = (S, I ) f -1 (s) = {s’ ∈ S’, f(s’) = s} f -1 (s 3 )?{s’ 4 }

Inverse Function M’ = (S’, I’ ) s’ 1 s’ 2 s’ 3 s’ 4 s’ 5 s1s1 s2s2 s3s3 s4s4 s5s5 f: S’ → S I = {f(X’), X’ ∈ I’ } M = (S, I ) f -1 (X) = ∪ s ∈ S f -1 (s) f -1 ({s 1,s 3 })? {s’ 1,s’ 2,s’ 4 }

Matroid Mapping –Inverse Function –Rank Function Matroid Union Outline

Mapping M’ = (S’, I’ ) s’ 1 s’ 2 s’ 3 s’ 4 s’ 5 s1s1 s2s2 s3s3 s4s4 s5s5 f: S’ → S I = {f(X’), X’ ∈ I’ } M = (S, I ) Given U ⊆ S, what is r(U)?

Rank Function Is r(U) = r’(f -1 (U))? NO |f -1 (s)| can be greater than 1 for some s ∈ U Let us construct sets X’ ⊆ f -1 (U) X’ contain at most 1 pre-image of each s ∈ U How?

Rank Function Is r(U) = r’(f -1 (U))? NO |f -1 (s)| can be greater than 1 for some s ∈ U Let us construct sets X’ ⊆ f -1 (U) X’ contain at most 1 pre-image of each s ∈ U Partition Matroid P U Parts = f -1 (s), s ∈ U Limits = 1 for all parts

Rank Function Take the intersection of M’ and P U r(U) = max |X|, X is independent in M’ and P U Why? Matroid Intersection Theorem r(U) = min T ⊆ U {|U\T| + r’(f -1 (T))}

Matroid Mapping Matroid Union Outline

Matroid Union M 1 = (S 1, I 1 )M 2 = (S 2, I 2 ) S 1 and S 2 are disjoint M = (S 1 ∪ S 2, {X 1 ∪ X 2, X 1 ∈ I 1, X 2 ∈ I 2 }) Is M a matroid?YES Proof is trivial

Matroid Union M 1 = (S 1, I 1 )M 2 = (S 2, I 2 ) Is M a matroid?YES Proof? M = (S 1 ∪ S 2, {X 1 ∪ X 2, X 1 ∈ I 1, X 2 ∈ I 2 })

Matroid Union M 1 = (S 1, I 1 )M 2 = (S 2, I 2 ) Make a copy of S’ 1 of S 1 Make a copy of S’ 2 of S 2

Matroid Union M’ 1 = (S’ 1, I’ 1 )M’ 2 = (S’ 2, I’ 2 ) Make a copy of S’ 1 of S 1 Make a copy of S’ 2 of S 2 S’ 1 and S’ 2 are disjoint M’ = (S’ 1 ∪ S’ 2, {X’ 1 ∪ X’ 2, X 1 ∈ I’ 1, X 2 ∈ I’ 2 }) Matroid

Matroid Union M’ 1 = (S’ 1, I’ 1 )M’ 2 = (S’ 2, I’ 2 ) f: S’ 1 ∪ S’ 2 → S 1 ∪ S 2 M = (S 1 ∪ S 2, {X 1 ∪ X 2, X 1 ∈ I 1, X 2 ∈ I 2 }) r M (U) = min T ⊆ U {|U\T| + r 1 (T∩S 1 ) + r 2 (T∩S 2 )} Left as exercise !! Matroid