Let $f(n) = \sum_{i=0}^n 2^{-i}$
Let $g(n) = \begin{cases} \text{False}, & f(n) < 2\\ \text{True}, & f(n) \geq 2 \end{cases}$
I’m trying to find $\lim_{n \to \infty} g(n)$
Clearly $\lim_{n \to \infty} f(n) =2$
I do not think it is valid to say that because $f(n)=2$ in the limit then $g(n) = \text{True}$ in the limit.
For any finite $n$ the value of $g(n)$ is False which leads me to believe that the limit is False but I’m sure about this.
Possibly this depends on the domain of $f$. If the domain of $f$ is $\mathbb{N} \cup \{\infty\}$ then is the limit different to the case when the domain of $f$ is $\mathbb{N}$?
You are correct: $\lim\limits_{n\to\infty}g(n)=\text{False}$. This is true whether $f$ is defined on $\Bbb N$ or on $\Bbb N\cup\{\infty\}$. Just as the value of $\lim\limits_{x\to 0}h(x)$ does not depend on the value of $h$ at $x=0$ (which may not even be defined), so the limit here as $n\to\infty$ does not depend on the value of $g$ at $\infty$. The sequence $\langle g(n):n\in\Bbb N\rangle$ is constant with value $\text{False}$, so its limit is $\text{False}$ irrespective of whether $g(\infty)$ is defined or, if so, what its value is.