You are on page 1of 2

Generalizations of the Reverse Double Integral

Parker Emmerson
June 2023

1 Introduction
Where f (x, y) is the function that needs to be integrated.The technique of per-
forming a reverse double integral is to integrate the bounds of the inner integral
with respect to the outer integrand, and to integrate the limits of the outer
integral
R with respect to
R  the
R inner
R integrand. This process can be summarized
as: dy dxf(x, y)dx × dx dyf(x, y)dy
In other words, performing aR double
R integrall can
 beR expressed
R mathemati-

cally as the following equation: dy dxf (x, y)dx × dx dyf (x, y)dy =
Z Z  Z Z 
dx dyf (x, y)dy × dy dxf (x, y)dx T : G → RT (g) =ζ,ω f [ζ, ω]dζdω

This defines a function T which transforms a given element of the group G


to a real number.
Let Ω be a set of functions {f1 , f2 , . . . , fn }. The generalized reverse double
integral function is defined as: FRDI : Ω → R
Z
FRDI : Ω RsothatFRDI (f1 , f2 , . . . , fn ) = . . . (f1 f2 . . . fn ) dx1 dx2 . . . dxn .

Leto ∈ Sn be an element from the symmetric group Sn , and define a function


σ
FRDI such that
Z
FσRDI (f1 , f2 , . . . , fn ) = . . .

fσ(1) fσ(2) . . . fσ(n) dx1 dx2 . . . dxn

Step 1 : Simplify any terms in the expression that can be simplified. Step
2: Unsimplify any simplified terms . Step 3: Unrestructure any restructured
terms . Step 4: After all the steps have been completed, the original expression
should be restored.
Let Ω be a set of functions {f1 , f2 , . . . , fn }, and let σ ∈ Sn be an element
from the symmetric group Sn . The generalized reverse double integral function
FRDI : Ω → R is defined as:
Z
σ

FRDI (f1 , f2 , . . . , fn ) = . . . fσ(1) fσ(2) . . . fσ(n) dx1 dx2 . . . dxn

1
The generalized reverse double integral is related to other concepts, such as the
generalized double integral, which can be expressed using calculus notation in
the following way :
Let Ω be a set of functions {f1 , f2 , . . . , fn }. The generalized double in-
tegral
R function is defined as FDI : Ω → R so that FDI (f1 , f2 , . . . , fn ) =
R 1 2 . . . fn ) dx1 dx2 . . . dxn . FDI : Ω → R so that FDI (f1 , f2 , . . . , fn ) =
(f f
(f1 f2 . . . fn ) dx1 dx2 . . . dxn Let Ω be a set of functions {f1 , f2 , . . . , fn }. The
R integral function is defined as FI : Ω → R so that FI (f1 , f2 , . . . , fn ) =
double
. . . (f1 f2 . . . fn ) dxn dxn−1 . . . dx1 .
Z
FI : Ω → R, FI (f1 , f2 , . . . , fn ) = . . . (f1 f2 . . . fn ) dxn dxn−1 . . . dx1

Proof for the Generalized Reverse Double Integral: Let Ω be a set of func-
tions {f1 , f2 , . . . , fn }. For any element σ ∈ Sn , we have
Z
σ

FRDI (f1 , f2 , . . . , fn ) = . . . fσ(1) fσ(2) . . . fσ(n) dx1 dx2 . . . dxn

By the fundamental Theorem of Calculus, it stands to reason that :


Z Z Z Z
   
= ... fσ(1) fσ(2)··· . . . fσ(n) dx1 dx2 . . . dxn = fσ(1) dx1 fσ(2) dx2 . . . fσ(n) dxn

Proof for the Reverted Double Integral: By the fundamental theorem of


calculus,
Z Z Z Z
FI (f1 , f2 , . . . , fn ) = . . . (f1 f2 . . . fn ) dxn dxn−1 . . . dx1 = (fn dxn ) (fn−1 dxn−1 ) . . . (f1 dx1 )
Z Z Z
FI (f1 , f2 , . . . , fn ) = · · · (f1 f2 . . . fn ) dxn dxn−1 . . . dx1
| {z }
ntimes
R R R R
(f1 f2 . . . fn ) dxn dxn−1 . . . dx1 = (fn dxn ) (fn−1 dxn−1 ) . . . (f1 dx1 )

Group theory allows for other possible rotations on the function.For exam-
ple, we could use the permutation group of order, n, Pn , to find other possible
rotations, such as the cyclic permutation group Cn , or the alternating per-
mutation group An , which is a subgroup of the symmetric group Sn . The
cyclic permutation group Cn consists of all rotations σ : Ω −→ Ω of order n.
That is, for any element σR ∈ Cn , |σ| = n. Let σ be an element of Cn . Then
σ
FRDI (f1 , f2 , . . . , fn ) = . . . fσ(1) fσ(2) . . . fσ(n) dx1 dx2 . . . dxn
The alternating permutation group An is a subgroup of Sn consisting of
all even permutations of order n. That is, an element σ ∈ An is an even
permutation if and only if σ ∈ Sn and |σ| = n. Let σ be an element of An .
Then
Z
σ

FRDI (f1 , f2 , . . . , fn ) = . . . fσ(1) fσ(2) . . . fσ(n) dx1 dx2 . . . dxn

You might also like