Calc Q: Line Int. Depends on Area, Not Placement

  • Thread starter Thread starter Sneaksuit
  • Start date Start date
  • Tags Tags
    Calculus
AI Thread Summary
The discussion centers on evaluating a line integral over a rectangular region in R2, emphasizing that the result depends solely on the area of the rectangle rather than its position. Participants highlight the relevance of Green's Theorem, which relates the line integral around a simple closed curve to a double integral over the region it encloses. The importance of parametrizing the boundary of the rectangle is noted, with suggestions on how to express the integral in terms of the area. It is concluded that applying Green's Theorem is the most straightforward approach to solve the problem. Overall, the consensus is that Green's Theorem is essential for incorporating the area into the integral evaluation.
Sneaksuit
Messages
20
Reaction score
0
Anyone know how to do this question?
Let C be the boundary of any rectangular region in R2. Show that the value of the line integral
\oint (x^2 y^3 -3y)dx + x^3 y^2 dy
depends only on the area of the rectangle and not on its placement in R2.
 
Physics news on Phys.org
Can you think of a good way to start the question (I'm assuming you've learned a few useful theorems on line integrals)?

BIG HINT: What theorem will let you incorporate the area of the rectangle into the evaluation of the integral?
 
Last edited:
Well, we are working on Green's Theorem right now but i don't remember it incorporating the area of a rectangle. So, to answer your question...no, i don't even know where to begin.
 
You must parametrize your boundary:
Let "t" be in some interval, so that the perimeter of the rectangle is given as some path (x(t),y(t)). Note that dx=\frac{dx}{dt}dt
similarly for dy, and that on regions where say x=constant, dx must equal 0.
 
Green's theorem applies to rectangles, and any curves that have a finite number of corners and don't cross themselves.
 
Crosson said:
Green's theorem applies to rectangles, and any curves that have a finite number of corners and don't cross themselves.
I din't imply that you couldn't use Green's theorem.
Of course you can, and it is probably the easiest way to do this.

(I thought to be "creative" in giving an alternative way of doing this, but reviewing the problem, following my earlier "advice" is simply inadvisable..)
 
Last edited:
Green's Theorem is definitely the way to go for this problem. Just apply it and see where it leads you.
 
Back
Top