I'm learning about regression decision trees and I was wondering if there always exists a split in each of the terminal nodes that will reduce the sum of squared errors (assuming there is more than one data point in the node). If there is, is there a proof?
Edit: I don't mean reduced in the strict sense.