# from the theory of proveit.linear_algebra¶

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.
# import Expression classes needed to build the expression
from proveit import B, ExprTuple
from proveit.core_expr_types import A_1_to_m

In [2]:
# build up the expression from sub-expressions

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())

\left(A_{1} +  A_{2} +  \ldots +  A_{m} + B, \left(A_{1} +  A_{2} +  \ldots +  A_{m}\right) + B\right)

In [5]:
stored_expr.style_options()

namedescriptiondefaultcurrent valuerelated methods
wrap_positionsposition(s) at which wrapping is to occur; 'n' is after the nth comma.()()('with_wrapping_at',)
justificationif any wrap positions are set, justify to the 'left', 'center', or 'right'leftleft('with_justification',)
In [6]:
# display the expression information
stored_expr.expr_info()

core typesub-expressionsexpression
0ExprTuple1, 2
1Operationoperator: 7
operands: 3
2Operationoperator: 7
operands: 4
3ExprTuple9, 6
4ExprTuple5, 6
5Operationoperator: 7
operands: 8
6Variable
7Literal
8ExprTuple9
9ExprRangelambda_map: 10
start_index: 11
end_index: 12
10Lambdaparameter: 16
body: 13
11Literal
12Variable
13IndexedVarvariable: 14
index: 16
14Variable
15ExprTuple16
16Variable