# MLE for Uniform $(0,\theta)$

I am a bit confused about the derivation of MLE of Uniform$$(0,\theta)$$.

I understand that $$L(\theta)={\theta}^{-n}$$ is a decreasing function and to find the MLE we want to maximize the likelihood function.

What is confusing me is that if a function is decreasing, then wouldn't the function be maximized at the smallest input rather than the largest?

• Your formula for $L(\theta)$ is incorrect. What happens when you have data points with values larger than $\theta$? – Brian Borchers Oct 3 '18 at 19:29
• I did. No matter where I look at they say that the function is decreasing therefore the maximum X maximizes L(theta), as if it is self evident. I know that there must be a misunderstanding on my part, but I cannot figure out. – hyg17 Oct 3 '18 at 19:31
• Brian: I am assuming that you are referring to the fact that all X_is are between 0 and theta. – hyg17 Oct 3 '18 at 19:32
• A more detailed explanation of what @BrianBorchers comments above is given in this (highly upvoted) Answer to a previous Question. – hardmath Oct 3 '18 at 21:40
• @hardmath Highly upvoted but highly incorrect in my mind. – StubbornAtom Oct 4 '18 at 18:47

Welcome back to MSE.

This is one of those things that once you're explained it correctly the first time, without any gaps in explanation, that it makes sense. Unfortunately, most answers and even professors don't explain all of the details, in my experience.

Suppose $$X_1, \dots, X_n$$ are independent and distributed $$\text{Uniform}(0, \theta)$$, with $$\theta > 0$$.

Let $$\mathbf{I}$$ denote the indicator function, where $$\mathbf{I}(\cdot) = \begin{cases} 1, & \cdot \text{ is true} \\ 0, & \cdot \text{ is false.} \end{cases}$$

The probability density function of any of the $$X_i$$, for $$i \in \{1, \dots, n\}$$, can be written like so: $$f_{X_i}(x_i \mid \theta) = \dfrac{1}{\theta}\cdot\mathbf{I}(0 The likelihood function is thus given by \begin{align} L(\theta)&=f_{X_1, \dots, X_n}(x_1, \dots, x_n \mid \theta)\\ &=\prod_{i=1}^{n}f_{X_i}(x_i \mid \theta) \\ &= \dfrac{1}{\theta^n}\prod_{i=1}^{n}\mathbf{I}(0 < x_i < \theta)\text{.} \end{align}

The following claim, although used, is often omitted from explanations:

Claim. Let $$A$$ and $$B$$ be events. Then $$\mathbf{I}(A)\cdot \mathbf{I}(B)=\mathbf{I}(A \cap B)$$.

I leave the proof of this to you. Note that $$0 < x_i < \theta$$ is the same as requiring both $$x_i > 0$$ and $$x_i < \theta$$. Hence, we write \begin{align} L(\theta)&=\dfrac{1}{\theta^n}\prod_{i=1}^{n}\mathbf{I}(0 < x_i < \theta) \\ &= \dfrac{1}{\theta^n}\prod_{i=1}^{n}[\mathbf{I}(x_i > 0)\mathbf{I}(x_i < \theta)] \\ &= \dfrac{1}{\theta^n}\prod_{i=1}^{n}[\mathbf{I}(x_i > 0)]\prod_{j=1}^{n}[\mathbf{I}(x_j < \theta)]\text{.} \end{align}

It will be clear why I split the product as above in a bit.

The claim given above is true if we were to extend to an arbitrary number of events as well. Thus,

$$\prod_{i=1}^{n}[\mathbf{I}(x_i > 0)] = \mathbf{I}(x_1 > 0 \cap x_2 > 0 \cap \cdots \cap x_n > 0)$$ and $$\prod_{j=1}^{n}[\mathbf{I}(x_j < \theta)] = \mathbf{I}(x_1 < \theta \cap x_2 < \theta \cap \cdots \cap x_n < \theta)\text{.}$$

The next claims are often omitted as well from explanations:

Claim 1. Given $$x_1, \dots, x_n \in \mathbb{R}$$, $$x_1, \dots, x_n < k$$ if and only if $$x_{(n)}:=\max_{1 \leq i \leq n}x_i < k\text{.}$$

Claim 2. Given $$x_1, \dots, x_n \in \mathbb{R}$$, $$x_1, \dots, x_n > k$$ if and only if $$x_{(1)}:=\min_{1 \leq i \leq n}x_i > k\text{.}$$

Thus $$\prod_{i=1}^{n}[\mathbf{I}(x_i > 0)] = \mathbf{I}(x_1 > 0 \cap x_2 > 0 \cap \cdots \cap x_n > 0) = \mathbf{I}(x_{(1)} > 0)$$ and $$\prod_{j=1}^{n}[\mathbf{I}(x_j < \theta)] = \mathbf{I}(x_1 < \theta \cap x_2 < \theta \cap \cdots \cap x_n < \theta) = \mathbf{I}(x_{(n)} < \theta)\text{.}$$ The likelihood function is thus $$L(\theta) = \dfrac{1}{\theta^n}\mathbf{I}(x_{(1)} > 0)\mathbf{I}(x_{(n)} < \theta)\text{.}\tag{*}$$ Now, consider the above as a function of $$\theta$$. For all intents and purposes, $$\mathbf{I}(x_{(1)} > 0)$$ is irrelevant when it comes to maximization of $$L$$ with respect to $$\theta$$, because it is independent of $$\theta$$. So, the part that really matters is $$L(\theta) \propto \dfrac{1}{\theta^n}\mathbf{I}(x_{(n)} < \theta) = \dfrac{1}{\theta^n}\mathbf{I}(\theta > x_{(n)})\text{.}\tag{**}$$ Remember to view this as a function of $$\theta$$. If $$\theta \leq x_{(n)}$$, note that $$L(\theta) = 0$$ because of the indicator function. This is not the maximized value of $$L$$; $$L$$ is, at its crux, a probability density function: $$0$$ is in fact the smallest value that a probability density function can take.

So, in attempting to maximize $$L$$, suppose that $$\theta > x_{(n)}$$. Then we obtain $$L(\theta) \propto\dfrac{1}{\theta^n}\text{.}$$ Now, note that $$\dfrac{1}{\theta^n}$$ is indeed a decreasing function of $$\theta$$. Thus, we must make $$\theta$$ as small as possible, given our restriction of $$\theta > x_{(n)}$$. Thus, it follows that the maximum likelihood estimator of $$\theta$$ is $$\hat{\theta}_{\text{MLE}} = X_{(n)}\text{.}$$

Note that, therefore, the support of the uniform PDF must include $$\theta$$ itself (because the maximum likelihood estimator equals one of the $$X_i$$), so that at the very least, $$x_i \leq \theta$$. The reason for this is discussed in the Lecture 2: Maximum Likelihood Estimators from MIT OpenCourseWare 18-443 Statistics for Applications, found here. As the question currently stands, at the very least, $$(0, \theta)$$ should be $$(0, \theta]$$ or $$[0, \theta]$$.

• +1. Perfect! I've saw so many solutions of this on MSE and google, but none was unable to explain how they "jump" from likelihood function to ML. Thanks! – Ankit Kumar Feb 7 at 4:13