Tuples are immutable in Python, so in theory it should be able to but I have no idea if Python actually makes that optimization.
Even if it does, this is probably not a good approach in Python because Python does not optimize away tail recursion.
Regardless, even if that optimization is present, the overhead of checking and deduping the tuples against the intern cache as they are constructed after the split operations would likely be considerable. Indexes would likely remain the very fastest strategy.
An optimization theoretically exists which could make tuple splitting as fast as index accounting (representing split results as slices/views into the original tuple), but I do not believe python does that, as it would cause unexpected memory growth in some situations, unless accompanied by a very specialized garbage collection scheme.