logo

Expression of type Equals

from the theory of proveit.linear_algebra.tensors

In [1]:
import proveit
# Automation is not needed when building an expression:
proveit.defaults.automation = False # This will speed things up.
proveit.defaults.inline_pngs = False # Makes files smaller.
%load_expr # Load the stored expression as 'stored_expr'
# import Expression classes needed to build the expression
from proveit.core_expr_types import Q__b_1_to_j, a_1_to_i, b_1_to_j, c_1_to_k, f__b_1_to_j
from proveit.linear_algebra import TensorProd, VecSum
from proveit.linear_algebra.addition import vec_summation_b1toj_fQ
from proveit.logic import Equals
In [2]:
# build up the expression from sub-expressions
expr = Equals(VecSum(index_or_indices = [b_1_to_j], summand = TensorProd(a_1_to_i, f__b_1_to_j, c_1_to_k), condition = Q__b_1_to_j), TensorProd(a_1_to_i, vec_summation_b1toj_fQ, c_1_to_k)).with_wrapping_at(1)
expr:
In [3]:
# check that the built expression is the same as the stored expression
assert expr == stored_expr
assert expr._style_id == stored_expr._style_id
print("Passed sanity check: expr matches stored_expr")
Passed sanity check: expr matches stored_expr
In [4]:
# Show the LaTeX representation of the expression for convenience if you need it.
print(stored_expr.latex())
\begin{array}{c} \begin{array}{l} \left[\sum_{b_{1}, b_{2}, \ldots, b_{j}~|~Q\left(b_{1}, b_{2}, \ldots, b_{j}\right)}~\left(a_{1} {\otimes}  a_{2} {\otimes}  \ldots {\otimes}  a_{i} {\otimes} f\left(b_{1}, b_{2}, \ldots, b_{j}\right){\otimes} c_{1} {\otimes}  c_{2} {\otimes}  \ldots {\otimes}  c_{k}\right)\right] \\  = \left(a_{1} {\otimes}  a_{2} {\otimes}  \ldots {\otimes}  a_{i} {\otimes} \left[\sum_{b_{1}, b_{2}, \ldots, b_{j}~|~Q\left(b_{1}, b_{2}, \ldots, b_{j}\right)}~f\left(b_{1}, b_{2}, \ldots, b_{j}\right)\right]{\otimes} c_{1} {\otimes}  c_{2} {\otimes}  \ldots {\otimes}  c_{k}\right) \end{array} \end{array}
In [5]:
stored_expr.style_options()
namedescriptiondefaultcurrent valuerelated methods
operation'infix' or 'function' style formattinginfixinfix
wrap_positionsposition(s) at which wrapping is to occur; '2 n - 1' is after the nth operand, '2 n' is after the nth operation.()(1)('with_wrapping_at', 'with_wrap_before_operator', 'with_wrap_after_operator', 'without_wrapping', 'wrap_positions')
justificationif any wrap positions are set, justify to the 'left', 'center', or 'right'centercenter('with_justification',)
directionDirection of the relation (normal or reversed)normalnormal('with_direction_reversed', 'is_reversed')
In [6]:
# display the expression information
stored_expr.expr_info()
 core typesub-expressionsexpression
0Operationoperator: 1
operands: 2
1Literal
2ExprTuple3, 4
3Operationoperator: 10
operand: 7
4Operationoperator: 14
operands: 6
5ExprTuple7
6ExprTuple17, 8, 18
7Lambdaparameters: 27
body: 9
8Operationoperator: 10
operand: 13
9Conditionalvalue: 12
condition: 20
10Literal
11ExprTuple13
12Operationoperator: 14
operands: 15
13Lambdaparameters: 27
body: 16
14Literal
15ExprTuple17, 19, 18
16Conditionalvalue: 19
condition: 20
17ExprRangelambda_map: 21
start_index: 34
end_index: 22
18ExprRangelambda_map: 23
start_index: 34
end_index: 24
19Operationoperator: 25
operands: 27
20Operationoperator: 26
operands: 27
21Lambdaparameter: 39
body: 28
22Variable
23Lambdaparameter: 39
body: 29
24Variable
25Variable
26Variable
27ExprTuple30
28IndexedVarvariable: 31
index: 39
29IndexedVarvariable: 32
index: 39
30ExprRangelambda_map: 33
start_index: 34
end_index: 35
31Variable
32Variable
33Lambdaparameter: 39
body: 36
34Literal
35Variable
36IndexedVarvariable: 37
index: 39
37Variable
38ExprTuple39
39Variable