AngouriMath
Navigation
AreEqual(AngouriMath.Entity,AngouriMath.Entity,AngouriMath.Core.Budgets.WorkBudget,AngouriMath.Core.Transformations.Soundness,AngouriMath.Core.Domain)
Method (no overloads)
Summary
Whether left and right are equal: proved by the
rewrite rules over one e-graph, refuted at a point, or neither within
budget .
rewrite rules over one e-graph, refuted at a point, or neither within
Parameter "left"
One side.
Parameter "right"
The other.
Parameter "budget"
What the question may spend. Steps counts work -- a point
tried, a rule's match attempt, a node the graph grows by -- so the same question under
the same steps gets the same answer on any machine; a Time makes it depend on the machine, and Budget says when it
did. Budget, where set, caps this: the smaller limit on each axis
applies, so an ambient Unlimited leaves it as passed.
tried, a rule's match attempt, a node the graph grows by -- so the same question under
the same steps gets the same answer on any machine; a Time makes it depend on the machine, and Budget says when it
did. Budget, where set, caps this: the smaller limit on each axis
applies, so an ambient Unlimited leaves it as passed.
Parameter "weakest"
The weakest soundness a proof may rest on. Sound, the default,
admits only rules that hold with no side condition -- reordering the terms of a sum or
the factors of a product among them -- and a proof that needs more is
Unknown. SoundUnderAssumptions admits the conditional rules and the canonical-form pass as well, and names those it
used in Assumptions.
admits only rules that hold with no side condition -- reordering the terms of a sum or
the factors of a product among them -- and a proof that needs more is
Unknown. SoundUnderAssumptions admits the conditional rules and the canonical-form pass as well, and names those it
used in Assumptions.
Parameter "domain"
Complex, the default, or Real: where the
variables range, and so where a witness may be looked for. A name is a number here, so
a * b and b * a are equal; a question with a matrix or a matrix operation
anywhere in it has no product reordered, since a name in it may stand for a matrix.
variables range, and so where a witness may be looked for. A name is a number here, so
anywhere in it has no product reordered, since a name in it may stand for a matrix.
Returns
Equal only with a proof;
NotEqual only with a point at which both sides are
defined and enclosures of their values are disjoint;
Unknown otherwise -- which is not "unequal".
NotEqual only with a point at which both sides are
defined and enclosures of their values are disjoint;
Unknown otherwise -- which is not "unequal".
Remarks
per input by cost, and two equal inputs can settle on different ones; a graph holding
both merges their classes whether or not an extraction would agree. And a
simplification has no third answer: a difference that does not simplify to zero is
read as "unequal" by whoever compares it.
undecidable over this language, so Unknown is an
answer this gives often and honestly.
#1251
Angouri © 2019-2026 · Project's repo · Site's repo · Octicons · Transparency · 6003 pages online