Class _ProofPref

x.__init__(...) initializes x; see x.__class__.__doc__ for signature

Overrides: object.__init__

(inherited documentation)

Controls the default proof strategy for integer arithmetic algorithms (such as primality testing).

INPUT:
    t -- boolean or None

OUTPUT:
    If t == True, requires integer arithmetic operations to (by default) return results that are true unconditionally: the correctness will not depend on an algorithm with a nonzero probability of returning an incorrect answer or on the truth of any unproven conjectures.
    If t == False, allows integer arithmetic operations to (by default) return results that may depend on unproven conjectures or on probabilistic algorithms.  Such algorithms often have a substantial speed improvement over those requiring proof.
    If t is None, returns the integer arithmetic proof status.

EXAMPLES:
    sage: proof.arithmetic()
    True
    sage: proof.arithmetic(False)
    sage: proof.arithmetic()
    False
    sage: proof.arithmetic(True)
    sage: proof.arithmetic()
    True

Controls the default proof strategy for elliptic curve algorithms.

INPUT:
    t -- boolean or None
    
OUTPUT:
    If t == True, requires elliptic curve algorithms to (by default) return results that are true unconditionally: the correctness will not depend on an algorithm with a nonzero probability of returning an incorrect answer or on the truth of any unproven conjectures.
    If t == False, allows elliptic curve algorithms to (by default) return results that may depend on unproven conjectures or on probabilistic algorithms.  Such algorithms often have a substantial speed improvement over those requiring proof.
    If t is None, returns the current elliptic curve proof status.

EXAMPLES:
    sage: proof.elliptic_curve()
    True
    sage: proof.elliptic_curve(False)
    sage: proof.elliptic_curve()
    False
    sage: proof.elliptic_curve(True)
    sage: proof.elliptic_curve()
    True

Controls the default proof strategy for linear algebra algorithms.

INPUT:
    t -- boolean or None

OUTPUT:
    If t == True, requires linear algebra algorithms to (by default) return results that are true unconditionally: the correctness will not depend on an algorithm with a nonzero probability of returning an incorrect answer or on the truth of any unproven conjectures.
    If t == False, allows linear algebra algorithms to (by default) return results that may depend on unproven conjectures or on probabilistic algorithms.  Such algorithms often have a substantial speed improvement over those requiring proof.
    If t is None, returns the current linear algebra proof status.

EXAMPLES:
    sage: proof.linear_algebra()
    True
    sage: proof.linear_algebra(False)
    sage: proof.linear_algebra()
    False
    sage: proof.linear_algebra(True)
    sage: proof.linear_algebra()
    True

Controls the default proof strategy for number field algorithms.

INPUT:
    t -- boolean or None

OUTPUT:
    If t == True, requires number field algorithms to (by default) return results that are true unconditionally: the correctness will not depend on an algorithm with a nonzero probability of returning an incorrect answer or on the truth of any unproven conjectures.
    If t == False, allows number field algorithms to (by default) return results that may depend on unproven conjectures or on probabilistic algorithms.  Such algorithms often have a substantial speed improvement over those requiring proof.
    If t is None, returns the current number field proof status.
    
EXAMPLES:
    sage: proof.number_field()
    True
    sage: proof.number_field(False)
    sage: proof.number_field()
    False
    sage: proof.number_field(True)
    sage: proof.number_field()
    True

Controls the default proof strategy for polynomial algorithms.

INPUT:
    t -- boolean or None

OUTPUT:
    If t == True, requires polynomial algorithms to (by default) return results that are true unconditionally: the correctness will not depend on an algorithm with a nonzero probability of returning an incorrect answer or on the truth of any unproven conjectures.
    If t == False, allows polynomial algorithms to (by default) return results that may depend on unproven conjectures or on probabilistic algorithms.  Such algorithms often have a substantial speed improvement over those requiring proof.
    If t is None, returns the current polynomial proof status.
    
EXAMPLES:
    sage: proof.polynomial()
    True
    sage: proof.polynomial(False)
    sage: proof.polynomial()
    False
    sage: proof.polynomial(True)
    sage: proof.polynomial()
    True