Talk:Min-max theorem

From Wikipedia, the free encyclopedia
Revision as of 09:36, 27 January 2025 by imported>The-erinaceous-one (To-do: Make inner product notation consistent: new section)
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Latest comment: 27 January by The-erinaceous-one in topic To-do: Make inner product notation consistent
Jump to navigation Jump to search

Template:WikiProject banner shell

Merge with Courant minimax principle?

This article appears to cover the same topic as en.wikipedia.org/wiki/Courant_minimax_principle. Perhaps someone with an actual wikipedia account should propose a merger. 73.26.155.105 (talk) 00:32, 22 June 2024 (UTC)Reply

[Untitled]

What happens if a positive eigenvalue occurs with multiplicity 2? Also, the statement as it stands precludes the possibility that there is no minimal strictly positive eigenvalue. I'm changing it accordingly... Lupin 15:49, 30 July 2005 (UTC)Reply

compact operators

For infinitely dimensional spaces, there might well be only a finite number of positive eigenvalues or no eigenvalues at all, contrary to what is stated in the demonstration in the section devoted to compact operators. In this case, there is of course an infinite number of negative eigenvalues. The demonstration should be modified accordingly. For example when the number of positive eigenvalues is a finite n and Sk has k>n, then it seems to me that maxSkminxSk,x=1(Ax,x)=0. Similar considerations should apply also for negative eigenvalues. Luca.Argenti (talk) 09:23, 29 May 2008 (UTC)Reply

min max principle for singular values

I have found many other sources, which change the place of min and max in the equations, so It seems incorrect here.14.139.38.11 (talk) 05:10, 17 February 2014 (UTC)Reply

However, we hould have a section on this. I will se if I can find good references. Kjetil B Halvorsen 14:47, 25 April 2014 (UTC) — Preceding unsigned comment added by Kjetil1001 (talkcontribs)

compact operators, question concerning the proof

In the article it is written: "But A is compact, therefore the function f(x) = (Ax, x) is weakly continuous.". I don't see how this follows. I can easily prove that f(x) is weakly sequentially continuous by using that a compact operator maps weakly convergent sequences into norm convergent sequences. However, it is well known that this is not true for nets. As far as I know, however, there is no guarantee that a functional attains its minimum if it is only sequentially (lower semi-)continuous. Maybe there is some theorem behind here that I don't know. If so, could someone please give a reference? I think it should be cited in the article then. — Preceding unsigned comment added by 138.246.2.201 (talk) 00:34, 30 January 2017 (UTC)Reply

In fact, various claims in that proof are simply wrong.

  • First of all, it is not true that any bounded set in Template:Mvar is weakly compact. If Template:Mvar is infinite-dimensional, then the weak closure of {xH:x=1} is all of {xH:x1} (c.f. Conway, A Course in Functional Analysis, Exercise V.1.10, or this question on Mathematics Stack Exchange). As a concrete example, note that any orthonormal sequence converges weakly to zero; see Weak convergence (Hilbert space).
  • Secondly, to answer the question above, it is not true that the function f(x) = (Ax, x) is weakly continuous. If Template:Mvar is infinite-dimensional, Template:Mvar is injective, and we take the net from this answer on Mathematics Stack Exchange, then the image net is not eventually bounded (perpetually unbounded?), whereas the original net converges to zero.
  • To see that the minimum minxSk,x=1(Ax,x) is attained, you may use that Template:Tmath is finite-dimensional (so its unit sphere is compact in the norm topology).
  • Finally, it is simply not true that the maximum maxxSk1,x=1(Ax,x) is always attained. If Template:Mvar is infinite-dimensional and Template:Mvar is negative definite on Template:Tmath (by which I mean negative and injective; we still have Template:Tmath because Template:Mvar is compact), then the supremum is 0 but we have Template:Tmath for all Template:Tmath. This is not a big problem: the mere existence of a subspace Template:Tmath with this property is enough to conclude that there are fewer than Template:Mvar positive eigenvalues to begin with, so Template:Tmath doesn't even exist in this case. Nevertheless, it shows that the current proof is way too optimistic, and the compactness argument is beyond repair.

I suggest that the proof be revised or removed in favour of a reference to the literature. I am not sure how to deal with this; I delegate this to someone who is a little more experienced on Wikipedia and/or a little more "in" on the discussion regarding mathematical proofs on Wikipedia (see Wikipedia:WikiProject_Mathematics/Proofs).

Min-max vs Inf-sup

it seems to me the proof only argues for Inf-sup rather than Min-max (OK, the Min is quite obvious). I'd say the fact that the min is achieved is through the specific subspace span(u1,…uk) and the sup is achieved because R_A is continuous and we can restrict it to a compact (the closed unit ball). Doesn't that need to be mentionned? Jeanlesquare (talk) 08:44, 10 November 2018 (UTC)Reply

To-do: Make inner product notation consistent

This article uses two notations for inner product: (x,y) and x,y. We should make the article consistent throughout. I support using x,y since this seems to be more standard in the literature I'm familiar with. The-erinaceous-one (talk) 09:36, 27 January 2025 (UTC)Reply