Interval dependency problem
ID: interval-dependency-problem
The interval dependency problem is the loss of relationships between repeated occurrences of the same input. For , interval subtraction gives : it permits with independent choices . But the function has actual image of a function . Giving both operands the name does not tell an interval arithmetic calculation to enforce .
For the polynomial on , the natural interval extension isThis allows the impossible combination in the first factor and in the second, producing the spurious upper bound . In the actual function, both occurrences use the same . Completing the square gives , which lies between and on ; every value between these bounds occurs, by continuity and the intermediate value theorem. The maximum occurs at , while either endpoint gives the minimum .
Independent interval inputs lose the diagonal constraint; subdivision tightens the enclosure of x times one minus x
. Left: the Cartesian product permits separate choices , while the actual function uses only . Right: rectangles from four pieces contain the polynomial curve. Below: one, two and four pieces give interval enclosures with upper bounds , and ; the interval square range gives the exact . Details. New to topics? Read the docs here!
