logo

Optimal Solution: Maximum and Minimum Factors 📂Optimization

Optimal Solution: Maximum and Minimum Factors

Difficult Definitions

Let’s assume an arbitrary set XX and a totally ordered set (Y,)\left( Y, \le \right) are given.

For a subset SXS \subset X of XX, the argument of maxima arg maxS:YX2X\argmax_{S} : Y^{X} \to 2^{X} and argument of minima arg minS:YX2X\argmin_{S} : Y^{X} \to 2^{X} of the function f:XYf : X \to Y are defined as follows. arg maxSf:={xS:f(x)f(x),xX}arg minSf:={xS:f(x)f(x),xX} \argmax_{S} f := \left\{ x_{\ast} \in S : f \left( x_{\ast} \right) \ge f(x) , \forall x \in X \right\} \\ \argmin_{S} f := \left\{ x_{\ast} \in S : f \left( x_{\ast} \right) \le f(x) , \forall x \in X \right\}


  • 2X2^{X} is the power set of XX, YXY^{X} is the set of functions whose domain is XX and codomain is YY.
  • The term ‘argument of maxima’ is not official at all, and is arbitrarily coined by the author due to the lack of a proper conventional term.

Explanation

If you’re studying statistics, you’ll probably first come across this in the method of maximum likelihood estimation.

The argument of maxima and minima are collectively referred to as the optimizer. This is because in an optimization problem where you find the function’s maximum or minimum value, the argument of maxima and minima make up the solution set.

At first, the function seems intimidating because it uses up to six letters of the alphabet. The above definitions are written in the most general and difficult terms possible but to put it simply, they are just the points that make the function’s value the largest or smallest.

The definitions introduced are similar to what you would find on Wikipedia, but honestly, there’s no need to define them in such an overly complicated way by mentioning power sets, function sets, totally ordered sets, etc. While it might make the writer’s life easier, it doesn’t help the reader at all. Let’s look at an example to understand this directly.

Simple Example

If we say f(x):=(xa)(xb)f(x) := \left| (x-a)(x-b) \right| then f:RRf : \mathbb{R} \to \mathbb{R} has the minimum value f(a)=f(b)=0f(a) = f(b) = 0 at a,ba,b. Since the inequality f(a)=f(b)f(x)f(a) = f(b) \le f(x) holds for all real numbers xRx \in \mathbb{R}, the argument of minima for ff can be expressed as follows. arg minRf={a,b} \argmin_{\mathbb{R}} f = \left\{ a, b \right\}

Why the Codomain is a Power Set

As seen in the example above, while the function’s minimum value may or may not exist, if it does, it is unique. However, if the function is not injective, multiple arguments may correspond to the same value, which is why.