A topology $T$ on a set $X$ is the set of open sets (more precisely: the sets we will afterwards call open sets when working with this topology $T$; openness is no absolute and inherent property of a subset of $X$), that is a set of subsets of $X$ such that
- $X\in T$
- If $I$ is an index set and $U_i\in T$ for each $i\in I$, then $\bigcup_{i\in I}U_i \in T$
- If $U,V\in T$ then $U\cap V\in T$.
Hence for any nonempty set $X$ there is one topology, where checking conditions 1., 2., 3. is trivial, i.e. does not require "any" computational effort: $T=\{\emptyset,X\}$. That's why this topology is called the trivial topology on $X$ (also: the indiscrete topology).
As a matter of fact, verifying conditions 1., 2., 3. is also trivial if one choses $T$ to be the powerset of $X$, however that topology runs by the name of discrete topology. This is so even hough the verification of the above conditions is "even more trivial" in this case: If all sets are in $T$ anyway, there is nothing to check. Rule of thumb: If ever you have two choices for naming trivial objects, the "smaller" one wins.
Compare this to other cases where objects are called trivial, such as the trivial group having only a single element $e$ with composition $e\cdot e=e$ (often occurring in phrases such as "the kernel of ... is trivial")