The tight performance bounds for Union-Find data structures are ridiculously complicated to prove given how simple the algorithm is, even in a mathematical sense.

There isn't a lot of theory-building in algorithms, compared to the more traditional fields of maths, but the combinatorics are formidable.