Common binary_lin_comb_ax_by of type VecAdd

from the theory of proveit.linear_algebra

import proveit
# Automation is not needed when only 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 the special expression
from proveit.linear_algebra import binary_lin_comb_ax_by

# check that the built expression is the same as the stored expression
assert binary_lin_comb_ax_by == stored_expr
assert binary_lin_comb_ax_by._style_id == stored_expr._style_id
print("Passed sanity check: binary_lin_comb_ax_by matches stored_expr")

Passed sanity check: binary_lin_comb_ax_by matches stored_expr

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

\left(a \cdot x\right) + \left(b \cdot y\right)

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.	()	()	('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',)

# 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: 6 operands: 5
4	Operation	operator: 6 operands: 7
5	ExprTuple	8, 9
6	Literal
7	ExprTuple	10, 11
8	Variable
9	Variable
10	Variable
11	Variable