1. Not finding help here? Sign up for a free 30min tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Maximality continuous concave functions

  1. Nov 26, 2012 #1
    Let [itex]g(x)=max_{i=1,...,m} f_{i}(x)[/itex] where [itex]f_{i}[/itex] are continuous concave functions and
    let [itex]X = \{x: a_{j}^T x \geq b_{j} [/itex] for [itex] j=1,\cdots, k \}[/itex] be a polytope; [itex]M(x) = \{i: f_{i}(x) = g (x) \}[/itex] and [itex]J(x) = \{j: a_{j}^T x = b_{j} \}[/itex].


    We define a "special" point to be a point [itex]\hat{x}[/itex] for which the set [itex]M(\hat{x}) \cup J(\hat{x}) [/itex] is maximal, i.e., there is no point [itex]y \in X[/itex] for which [itex]M(\hat{x})[/itex] is properly contained in [itex]M(y)[/itex] and [itex]J(\hat{x})[/itex] is properly contained in [itex]J(y)[/itex].



    Assume [itex]x^*[/itex] is the minimizer of [itex]g[/itex] (i.e. [itex] g(x^*) \leq g(x) [/itex] for any [itex]x \in X[/itex] ).

    We show there exists a "special point" [itex]\hat{x}[/itex] such that

    [itex] M(x^*) \subseteq M(\hat{x})[/itex] and [itex] J(x^*) \subseteq J(\hat{x})[/itex].


    I am trying to prove by contradiction. So assume there is no "special" point [itex]\hat{x}[/itex] for which [itex] M(x^*) \subseteq M(\hat{x})[/itex]. Let [itex] \hat{x}[/itex] be a "special point". Hence, there exist an [itex] i \in M(x^*)[/itex] such that [itex] i \notin M(\hat{x})[/itex].
    So we have [itex] f_{i}(x^*) = g(x^*) \leq g(\hat{x}) \neq f_{i}(\hat{x})[/itex]

    I think the contradiction comes from the maximality of [itex]M(\hat{x})[/itex]. But I am not sure how to prove this.
    I also think that the part with [itex] J(x^*) \subseteq J(\hat{x})[/itex] can be proven in a similar way, but I am not sure how.
     
    Last edited by a moderator: Feb 5, 2013
  2. jcsd
  3. Nov 26, 2012 #2
    Re: Maximality

    What are the domain and codomains of the [itex]f_i[/itex]?

    What are the [itex]a_j[/itex] and [itex]b_j[/itex]? Do the [itex]j[/itex]s run over a finite index set?


    Not that it really matters though. It looks to me like the bulk of the set up for this problem is smoke and mirrors. It's basically there to define a partial ordering on whatever the domain space of the [itex]f_i[/itex] is using the partial ordering on [itex]I\times J[/itex] (where [itex]I[/itex] is the index set for the [itex]f_i[/itex] and [itex]J[/itex] is the index set for the [itex]a_j[/itex] and [itex]b_j[/itex]) induced by set inclusion.


    I would advise you to ask yourself what must be true if a point [itex]x[/itex] is not maximal; i.e. what if [itex]x[/itex] is not "the biggest"?

    Edit: Note that, for partial orderings, there is not necessarily a single largest element (there may be many). Also for an arbitrary ordering, we may not have a largest element; though it appears that we do have at least one largest element here (why?).

    Edit: I should have said "partial ordering on the power set of [itex]I\times J[/itex]." Sorry about that.
     
    Last edited: Nov 26, 2012
  4. Nov 26, 2012 #3
    Re: Maximality

    The [itex]f_i[/itex] are defined on the polytope [itex]X[/itex] and [itex]f_i(x)[/itex] is a real number.

    [itex] j [/itex] is an index in a finite index set. The [itex]a_j; b_j [/itex] 's are just vectors with the same dimension as [itex]x [/itex].

    Your question makes me think about Zorn's Lemma which says that "Suppose a partially ordered set P has the property that every chain (i.e. totally ordered subset) has an upper bound in P. Then the set P contains at least one maximal element."

    So I am thinking about defining the set:

    [itex]R=\{ M(x): M(x^*) \subseteq M(x)[/itex] where [itex]x[/itex] is a special point [itex]\} [/itex] .

    I am tempted to say that every totally ordered subset of R has an upper bound in R. (which I don't know how to prove here, I am not even sure why R is would not be empty) If that's the case, then by Zorn's Lemma, there is a maximal point [itex]M(\hat{x})[/itex] of R and so [itex] \hat{x}[/itex] exists with [itex] M(x^*) \subseteq M(\hat{x})[/itex].
     
  5. Nov 26, 2012 #4
    Re: Maximality

    I am also thinking about saying that the polytope X is compact, so if the set of "special points " is closed, then it is compact too. And then consider a sequence [itex]x_1, x_2, \cdots [/itex] of special points such that [itex]M(x^*) \subseteq M(x_1)\subseteq M(x_2)\subseteq \cdots[/itex]

    Then there exists a subsequence [itex] x_{k_i}[/itex] which converges to a "special point" [itex]x'[/itex].

    Hence [itex]M(x_k) \subseteq M(x')[/itex] for each k, i.e. every totally ordered subset of R has an upperbound in R.


    my question is, why is the set of "special points " closed? And also, why would there exist a sequence [itex]x_1, x_2, \cdots [/itex] of special points such that [itex]M(x^*) \subseteq M(x_1)\subseteq M(x_2)\subseteq \cdots[/itex]?
     
  6. Nov 26, 2012 #5
    Re: Maximality

    I think you should run with your Zorn's lemma idea, though you really don't need to use it. Use the finiteness of the index sets to get maximal elements.

    As for your issues with showing that certain sets are nonempty, I'll remind you of the reflexive property of "less than or equal to". Hopefully that's enough to get you through.

    Also, I should have said "the power set of the disjoint union of [itex]I[/itex] and [itex]J[/itex]" instead of "the power set of [itex]I\times J[/itex]". I'm not sure what's wrong with me today.
     
  7. Nov 26, 2012 #6
    Re: Maximality

    I am trying to think about how I can use the finiteness of the index set I to show that there must be a special point [itex]\hat{x}[/itex] such that [itex]M(\hat{x}) \supseteq M(x^*) [/itex]. But I am not sure how to go about it. Can you give another hint?
     
  8. Nov 26, 2012 #7
    Re: Maximality

    hmm let see

    Let [itex]C = \{M(x) \cup J(x): M(x^*) \cup J(x^*) \subseteq M(x) \cup J(x) , x \in X \}[/itex]. [itex] M(x^*)\cup J(x^*) \in C[/itex] by the reflexive property of " is contained in or is equal to", so [itex] C[/itex] is not empty.

    C is a set of subsets of a (disjoint union) of finite sets. So C contains a maximal element. Call it [itex] M(x')\cup J(x') [/itex]. Assume [itex] M(x')\cup J(x') [/itex] is not maximal with respect to all [itex] M(x)\cup J(x) [/itex] with [itex] x \in X [/itex] (not just the ones in [itex] C [/itex]). Then [itex] \exists y \in X [/itex] s.t. [itex] M(x')\cup J(x') [/itex] is contained properly in [itex] M(y)\cup J(y) [/itex]. But then [itex] M(x^*) \cup J(x^*)\subseteq M(x')\cup J(x') \subset M(y)\cup J(y) [/itex], thus [itex] M(y)\cup J(y) \in C [/itex]. Contadiction.
    Hence [itex] M(x') \cup J(x' ) [/itex] is maximal, and hence [itex] x'[/itex] is a "special point" such that [itex] M(x^*) \cup J(x^*)\subseteq M(x')\cup J(x') [/itex]. Let [itex] x'=\hat{x} [/itex]

    Does this work?
     
  9. Nov 27, 2012 #8
    Re: Maximality

    That's pretty much how I see it. Good job.
     
  10. Nov 27, 2012 #9
    Re: Maximality

    Thanks a lot.
     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook




Similar Discussions: Maximality continuous concave functions
  1. Concave Function (Replies: 1)

  2. Maximizing a Function (Replies: 1)

  3. Concave Functions (Replies: 3)

Loading...