Addition and scaling are coefficient-wise (that is exactly why P2 behaves like R3).
2p=4+6x−2x2.2p−q=(4−(−1))+(6−1)x+(−2−4)x2=5+5x−6x2.
Coordinate vector: 55−6.
Recall Solution 2.2
Over R: scalars are real, so z=3⋅1+(−2)⋅i gives coordinates (3−2).
Over C: scalars are complex, one basis vector {1} suffices — z=(3−2i)⋅1, coordinate (3−2i). The scalar field changes what counts as "one step", so dimRC=2 but dimCC=1. (See Fields and scalars.)
Closed under +: take u=(x1,y1,z1),v=(x2,y2,z2) with each coordinate-sum 0. Then
(x1+x2)+(y1+y2)+(z1+z2)=(x1+y1+z1)+(x2+y2+z2)=0+0=0. So u+v∈W. ✓
Closed under scaling:a⋅(x,y,z)=(ax,ay,az) and ax+ay+az=a(x+y+z)=a⋅0=0. ✓
All three pass, so Wis a subspace. (Geometrically it's a plane through the origin; dimW=2.)
Recall Solution 3.2
No. The fastest disqualifier is the zero test: (0,0,0) gives 0+0+0=0=1, so 0∈/U. That already kills it (Axiom 3 fails inside U).
To make the failure vivid, closure also fails: (1,0,0)∈U and (0,1,0)∈U, but their sum (1,1,0) has coordinate-sum 2=1, so (1,1,0)∈/U. In the figure, the plane U (coral) is shifted off the origin; the plane W (mint) passes through it. Only planes through the origin can be subspaces.
Yes — this is a genuine vector space in disguise. Check the requested axioms.
Closure: product of positives is positive; a positive raised to any real power is positive. ✓
Axiom 3 (zero vector): we need e with x⊕e=x, i.e. x⋅e=x, so e=1. The zero vector is 0=1. ✓
Axiom 4 (inverse): need x⊕x′=1, i.e. x⋅x′=1, so x′=1/x (positive). Thus −v here means 1/v. ✓
Axiom 5 (scalar identity):1⊙x=x1=x. ✓
Axiom 8 (distribute over scalar sum):(a+b)⊙x=xa+b=xaxb=(a⊙x)⊕(b⊙x). ✓
(The other axioms check similarly.) In fact the map x↦lnx turns ⊕→+ and ⊙→ ordinary scaling, an isomorphism to R — so dimV=1, basis {e} (since lne=1).
Recall Solution 4.2
Play the two identities against each other.
0=0+0′(since 0′ is a zero, use it on v=0)0+0′=0′+0(Axiom 1, commutativity)0′+0=0′(since 0 is a zero, use it on v=0′)
Chaining: 0=0′. ■ The proof used only axioms, so it holds in every vector space.
(a) Differentiate each basis vector and read off coordinates in {1,x,x2}:
D(1)=0,D(x)=1,D(x2)=2x.
Columns are the coordinate vectors of these outputs:
[D]=000100020.(b)D(p)=0 means p′=0, so p is a constant: kerD={a⋅1}=span{1}, dimkerD=1.
(c) Outputs are p′ for p∈P2; derivatives of degree ≤2 give all polynomials of degree ≤1. So imD=P1=span{1,x}, dimimD=2.
(d) Rank–nullity: dimkerD+dimimD=1+2=3=dimP2. ✓
Recall Solution 5.2
Orthogonality:⟨sinx,cosx⟩=∫−ππsinxcosxdx. Using sinxcosx=21sin2x,
∫−ππ21sin2xdx=21[−2cos2x]−ππ=21⋅(−2cos2π−cos(−2π))=0.
So sinx⊥cosx. ✓ (Also, the integrand is an odd function, forcing 0.)
Norm-squared: using sin2x=21−cos2x,
⟨sinx,sinx⟩=∫−ππ21−cos2xdx=21[x−2sin2x]−ππ=21(2π−0)=π.
So ∥sinx∥=π. These orthogonal functions are exactly the building blocks of Fourier series.