Problem 1. Let Ao be the collection of admissible functions on [a, b], i.e., A₁ = {v: [a, b] → R | v(a) = 0 = v(b)} Suppose that u Є C+1 ([a, b]). Prove that u(x) is a polynomial of degree at most n if and only if for all vЄ Ao we have .b L² dnu v'(x)dx = 0. dxn a Make sure you prove both directions of this statement.
Problem 1. Let Ao be the collection of admissible functions on [a, b], i.e., A₁ = {v: [a, b] → R | v(a) = 0 = v(b)} Suppose that u Є C+1 ([a, b]). Prove that u(x) is a polynomial of degree at most n if and only if for all vЄ Ao we have .b L² dnu v'(x)dx = 0. dxn a Make sure you prove both directions of this statement.
Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
Related questions
Question
![Problem 1.
Let Ao be the collection of admissible functions on [a, b], i.e.,
A₁ = {v : [a, b] → R | v(a) = 0 = v(b)}
Suppose that u Є Cn+1 ([a, b]). Prove that u(x) is a polynomial of degree at most n if and only if for all
vЄ Ao we have
b
dnu
v'(x)dx = 0.
dxn
a
Make sure you prove both directions of this statement.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fe60e14a8-856f-447c-ac90-795ae43e00b4%2Fa5627388-5d2e-4bfa-a9f2-1a9d5e90a127%2F2m6vyl_processed.png&w=3840&q=75)
Transcribed Image Text:Problem 1.
Let Ao be the collection of admissible functions on [a, b], i.e.,
A₁ = {v : [a, b] → R | v(a) = 0 = v(b)}
Suppose that u Є Cn+1 ([a, b]). Prove that u(x) is a polynomial of degree at most n if and only if for all
vЄ Ao we have
b
dnu
v'(x)dx = 0.
dxn
a
Make sure you prove both directions of this statement.
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 20 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Advanced Engineering Mathematics](https://www.bartleby.com/isbn_cover_images/9780470458365/9780470458365_smallCoverImage.gif)
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
![Numerical Methods for Engineers](https://www.bartleby.com/isbn_cover_images/9780073397924/9780073397924_smallCoverImage.gif)
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
![Introductory Mathematics for Engineering Applicat…](https://www.bartleby.com/isbn_cover_images/9781118141809/9781118141809_smallCoverImage.gif)
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
![Advanced Engineering Mathematics](https://www.bartleby.com/isbn_cover_images/9780470458365/9780470458365_smallCoverImage.gif)
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
![Numerical Methods for Engineers](https://www.bartleby.com/isbn_cover_images/9780073397924/9780073397924_smallCoverImage.gif)
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
![Introductory Mathematics for Engineering Applicat…](https://www.bartleby.com/isbn_cover_images/9781118141809/9781118141809_smallCoverImage.gif)
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
![Mathematics For Machine Technology](https://www.bartleby.com/isbn_cover_images/9781337798310/9781337798310_smallCoverImage.jpg)
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
![Basic Technical Mathematics](https://www.bartleby.com/isbn_cover_images/9780134437705/9780134437705_smallCoverImage.gif)
![Topology](https://www.bartleby.com/isbn_cover_images/9780134689517/9780134689517_smallCoverImage.gif)