Prev: distance to quadratic surface
Next: ListLinePlot Labels
From: Richard Fateman on 28 Jan 2010 02:45
Daniel Lichtblau wrote:
.....

Let us further define two intervals to be equal
> whenever they have nonempty intersection.
>
> With these definitions, which I think are sensible, ..

I disagree.
The general meaning of a binary operation f on intervals A,B
is

f(A,B) = {f(a,b) | a in A and b in B}.

This works for f defined as +,-, *, /, >, <, min, max, ...

Now for f being "Equal" we get

Equal(A,B) = { Equal(a,b) | a in A and b in B}, so the only way
that two intervals can be equal is if they each contain only one point,
and it is the same point.

Even Mathematica disagrees with DanL's definition of equality of intervals:

Interval[{1,4}]==Interval[{2,4}] is False, but DanL's def would say True.

unfortunately, Mathematica (7.0) also does this:

Interval[{-1,1}] == Interval[{-1,1}] comes out True

which would make most people who work with Reliable Computation
(intervals) unhappy.

On the plus side,
Interval[{-1,1}] - Interval[{-1,1}] is not zero, but Interval[{-2,2}]

which is OK, assuming, as we probably should, that the two intervals are
independent.










 | 
Pages: 1
Prev: distance to quadratic surface
Next: ListLinePlot Labels