What's the smallest difference in a group?
In general, groups that can be endowed with an order that is compatible with the binary operation - that is, left- and/or right-invariant, in the sense that $$\forall a,b,c,\qquad a<b\implies ca<cb\quad(\text{respectively, }ac<bc)$$ are very sparse in the landscape of groups. Apart from $\Bbb Z$, all subgroups of $\Bbb R$ can be - and you can already see that in $\Bbb Q$ and $\Bbb R$ there is no smallest difference (or smallest element).
The braid group is one quite non-trivial example where this can be done, although the Dehornoy order is only left-invariant (no order on the braid group $B_n,n\geq 3$ can be both left- and right-invariant).
In the rare cases where there is such an order, then you can define positive to mean larger than the identity element, and it is immediate that the "smallest difference", if any, is going to be equivalent to the smallest element of the group in the sense that any difference between two elements can be translated into the difference between some element and the identity.
In the group $\Bbb S^1$ for instance, you can see that there is no smallest difference, and that it is impossible to define a compatible order. In the group $\Bbb Z^2$, you could define the smallest difference by using the distance $\sqrt{x^2+y^2}$; this would be compatible with the binary operation (translations don't distort distances), but not with any order.
For a general group, no, there's no notion of a "smallest difference" between two elements. In order to speak of such a thing, we need some additional structure, namely a way to compare sizes of group elements. This is the notion of a length function on the group, also known as a normed group. If we have a length function on our group, then we can define distances between group elements, making the group into a metric space.
However, even if we have a normed group, there isn't necessarily a smallest distance between two distinct elements; as was pointed out in a comment, in the group of rationals or reals (where the usual absolute value is a length function), there are arbitrarily close pairs of distinct elements.
This answer mainly comes from Dale Rolfsen’s Ordered Groups and Topology.
Amazingly, sometimes groups do have smallest elements!
Before we ask questions about the smallest element, we should define what we mean.
A left-ordering on a group $G$ is a total order $<$ on the group so that if $g<h$ then $xg < xh$ for every $x\in G$.
Not all groups are left-orderable! Notice that the invariance under multiplication shows that any left-orderable group has no finite order elements. (Prove this yourself!). Given the identity element $e\in G$, let’s define the smallest element of $G$ to be the smallest element of the set
$$\mathcal{P}^+ = \{g\in G ~|~ e<g\}.$$
This is called the positive cone of $G$. Some examples of left-orderable groups are:
- Free groups
- Surface groups
- Mapping class groups of surfaces with boundary
- In particular, braid groups
and all their subgroups. Now, a sufficient condition to have a smallest element is for the order $<$ to be a well order.
An order $<$ on $G$ is a well order if any subset $S$ of $G$ has an element $s\in S$ such that $s<x$ for all other $x\in S$.
This property, applied to the positive cone $\mathcal{P}^+$, allows us to prove that $G$ would have a smallest element.
Fact: The positive pure braid group is well ordered under the Magnus ordering. Thus, it has a smallest element. This is also true for the positive braid group under the Dehornoy ordering.
However, the full (pure) braid group itself under this order is order dense; that is, for any $g<h$ there is some $x$ so that $g<x<h$. Thus, it can never have a smallest element.
It isn’t clear to me if there are algebraic obstructions to having a well ordering, what the smallest element is in the two above examples, or whether you can have a smallest element without having a well order.