Problem 1
Yes; it is the nullspace of [1 1 1] and is closed under linear combinations.
Faculty use
Reward correct mathematics, explicit dimensions/hypotheses, interpretation, and verification. Equivalent valid reasoning should receive credit.
Yes; it is the nullspace of [1 1 1] and is closed under linear combinations.
No; it is not closed under multiplication by negative scalars and excludes zero.
Definitions should identify the vector/matrix/space/transformation, dimensions or domain/codomain, and the hypotheses behind checking zero inclusion and closure efficiently. Use the formulas W≤V iff 0∈W and au+bv∈W for u,v∈W.
A strong error analysis identifies the first step that violates a definition, dimension, theorem hypothesis, or matrix-operation rule; then repairs that step and re-verifies the final result.
Application responses vary. Require defined variables, a compatible matrix/vector model connected to solution structure, function approximation, matrix spaces, networks, and abstract modelling, a complete computation, interpretation, and limitations.
Accept two independent checks appropriate to the task: reconstruction, residual, RREF comparison, determinant/rank test, orthogonality, substitution, eigenpair check Av=λv, factorization product, or a second method.
Six problems × 10 points: 5 mathematical accuracy, 2 structure/justification, 2 verification/interpretation, 1 notation and communication.