You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
InClass.yield_known_memberships does this properly where it checks 'is_applicable'. However, this doesn't appear done properly for yield_known_hilbert_spaces in the linear_algebra package or when using MatrixSpace.known_memberships in qmult.py. This can cause funny behavior when assumptions change. There may be other places where this is done incorrectly.
The text was updated successfully, but these errors were encountered:
As an addendum to this Issue, I'd like to like to add further InClass.conclude (and thereby InSet.conclude) automation, checking to see if the element has a "readily_provable_membership" method. If so, and if it returns True when given the domain for the membership we are trying to prove in "conclude", than call the element's "deduce_membership" method, letting the element handle things. Other automation works from the domain side, but sometimes it is better to handle it on the element side.
as well as the domain side via 'readily_provable_membership', if
the element has this attribute, and 'deduce_membership'. This is
the addendum for Issue #320.
InClass.yield_known_memberships does this properly where it checks 'is_applicable'. However, this doesn't appear done properly for yield_known_hilbert_spaces in the linear_algebra package or when using MatrixSpace.known_memberships in qmult.py. This can cause funny behavior when assumptions change. There may be other places where this is done incorrectly.
The text was updated successfully, but these errors were encountered: