Expression of type Equals

from the theory of proveit.physics.quantum.algebra

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 A_1_to_m, C_1_to_n, Q__b_1_to_j, b_1_to_j, f__b_1_to_j
from proveit.linear_algebra import VecSum
from proveit.linear_algebra.addition import vec_summation_b1toj_fQ
from proveit.logic import Equals
from proveit.physics.quantum import Qmult

# build up the expression from sub-expressions
expr = Equals(Qmult(A_1_to_m, vec_summation_b1toj_fQ, C_1_to_n), VecSum(index_or_indices = [b_1_to_j], summand = Qmult(A_1_to_m, f__b_1_to_j, C_1_to_n), condition = Q__b_1_to_j)).with_wrapping_at(1)

expr:

# 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

# Show the LaTeX representation of the expression for convenience if you need it.
print(stored_expr.latex())

\begin{array}{c} \begin{array}{l} \left(A_{1} \thinspace  A_{2} \thinspace  \ldots \thinspace  A_{m} \thinspace \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]\thinspace C_{1} \thinspace  C_{2} \thinspace  \ldots \thinspace  C_{n}\right) \\  = \left[\sum_{b_{1}, b_{2}, \ldots, b_{j}~|~Q\left(b_{1}, b_{2}, \ldots, b_{j}\right)}~\left(A_{1} \thinspace  A_{2} \thinspace  \ldots \thinspace  A_{m} \thinspace f\left(b_{1}, b_{2}, \ldots, b_{j}\right)\thinspace C_{1} \thinspace  C_{2} \thinspace  \ldots \thinspace  C_{n}\right)\right] \end{array} \end{array}

stored_expr.style_options()

name	description	default	current value	related methods
operation	'infix' or 'function' style formatting	infix	infix
wrap_positions	position(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')
justification	if any wrap positions are set, justify to the 'left', 'center', or 'right'	center	center	('with_justification',)
direction	Direction of the relation (normal or reversed)	normal	normal	('with_direction_reversed', 'is_reversed')

# display the expression information
stored_expr.expr_info()

	core type	sub-expressions	expression
0	Operation	operator: 1 operands: 2
1	Literal
2	ExprTuple	3, 4
3	Operation	operator: 15 operands: 5
4	Operation	operator: 9 operand: 8
5	ExprTuple	18, 7, 20
6	ExprTuple	8
7	Operation	operator: 9 operand: 12
8	Lambda	parameters: 25 body: 11
9	Literal
10	ExprTuple	12
11	Conditional	value: 13 condition: 17
12	Lambda	parameters: 25 body: 14
13	Operation	operator: 15 operands: 16
14	Conditional	value: 19 condition: 17
15	Literal
16	ExprTuple	18, 19, 20
17	Operation	operator: 21 operands: 25
18	ExprRange	lambda_map: 22 start_index: 33 end_index: 23
19	Operation	operator: 24 operands: 25
20	ExprRange	lambda_map: 26 start_index: 33 end_index: 27
21	Variable
22	Lambda	parameter: 39 body: 28
23	Variable
24	Variable
25	ExprTuple	29
26	Lambda	parameter: 39 body: 30
27	Variable
28	IndexedVar	variable: 31 index: 39
29	ExprRange	lambda_map: 32 start_index: 33 end_index: 34
30	IndexedVar	variable: 35 index: 39
31	Variable
32	Lambda	parameter: 39 body: 36
33	Literal
34	Variable
35	Variable
36	IndexedVar	variable: 37 index: 39
37	Variable
38	ExprTuple	39
39	Variable