Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

A cyclic permutation of the coordinates of R3 preserves Jordan measurability and integrals

Statement

For k{x,y,z} let σk:R3R3 be given by

σx(p)=(py,pz,px),σy(p)=(pz,px,py),σz(p)=(px,py,pz).

Each σk is a linear bijection with detDσk=1 everywhere. Let ER3 be compact and Jordan measurable. Then σk[E] is compact and Jordan measurable, and for every bounded H:σk[E]R the function H is Riemann integrable over σk[E] if and only if Hσk is Riemann integrable over E; when either holds, the integral over the permuted set equals the integral of the composite with the permutation over the original set,

σk[E]H=EHσk.

Facts & Assumptions

Given: The index k{x,y,z}, the map σk displayed in the Statement, the compact Jordan measurable set ER3 and the bounded function H on σk[E].

[F1]

For a commutative ring R, n1 and A=(aij)Mn(R), detA=σSnsgn(σ)i<naσ(i),i, with columns indexed by i<n and rows by σ(i) (For n1, the determinant over a commutative ring by the Leibniz formula, and detA for a real matrix).

[F2]

An inversion of σSn is a pair (i,j) with i<j<n and σ(i)>σ(j), and sgn(σ)=(1)inv(σ), where inv(σ) is the number of inversions (Inversions, inversion number, the sign sgn(σ)=(1)inv(σ), and even and odd permutations).

[F3]

For a C1 map g of an open subset of Rn into Rn, the Jacobian determinant is detDg(x), and the change-of-variables scale factor is detDg(x) (The Jacobian determinant of a square-dimensional C1 map is the determinant of its Jacobian matrix).

[F4]

If every partial derivative jfi(a) exists, the Jacobian matrix is Jf(a)=(jfi(a))i<n,j<m (The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case).

[F5]

Integration over a bounded Jordan measurable set is integration of the zero extension over a bounding rectangle (The Riemann integral of a bounded function over a bounded Jordan measurable set).

[L1]

Let URn be open, let g:URn be injective and C1 with Dg(x) invertible for every xU, and let KU be compact and Jordan measurable. For bounded f:g(K)R, integrability of f on g(K) is equivalent to integrability of xf(g(x))detDg(x) on K, and when either holds g(K)f(y)dy=Kf(g(x))detDg(x)dx (Change of variables for an injective C1 map on a compact Jordan set).

[L2]

Under those hypotheses, if KU is compact and Jordan measurable then g(K) is compact and Jordan measurable (An injective C1 map with invertible derivative sends compact Jordan sets to compact Jordan sets).

Proof

technique · direct
1.1

Each σk is linear: writing coordinates as indices 0,1,2 for x,y,z, the map σx sends p to the point with coordinates (p1,p2,p0), so by [F4] its partial derivatives are the constants j(σx)i, and its Jacobian matrix Ax at every point has (Ax)ij=1 exactly for (i,j){(0,1),(1,2),(2,0)} and 0 elsewhere. Likewise σy sends p to (p2,p0,p1), with matrix Ay having entry 1 exactly at (0,2),(1,0),(2,1), and σz is the identity with matrix the identity matrix. All three matrices have exactly one entry 1 in each row and in each column, so each σk is a bijection of R3 with Dσk constant and invertible.

givenF4
1.2

In the Leibniz sum [F1] for detAx, a term is nonzero only when (Ax)σ(i),i=1 for every i<3, that is when σ(0)=2, σ(1)=0 and σ(2)=1; exactly one permutation does this. Its inversions are (0,1), since 2>0, and (0,2), since 2>1, while (1,2) is not one, since 0<1; so inv(σ)=2 and sgn(σ)=+1 by [F2], giving detAx=1.

F1F2algebra
1.3

In the Leibniz sum for detAy, the only nonzero term has σ(0)=1, σ(1)=2 and σ(2)=0; its inversions are (0,2), since 1>0, and (1,2), since 2>0, while (0,1) is not one, since 1<2; so again inv(σ)=2 and detAy=1 by [F1] and [F2]. For Az the identity matrix, the only nonzero term is the identity permutation, with no inversion, so detAz=1.

F1F2algebra
2.1

By steps 1.1, 1.2 and 1.3 each σk is a C1 injection of the open set R3 into R3 whose derivative is invertible at every point, with detDσk=1 and hence detDσk=1 by [F3]. So [L2] applies with U=R3, g=σk and K=E, and σk[E] is compact and Jordan measurable.

step 1.1step 1.2step 1.3F3L2
3.1

With the same data, [L1] gives that H is integrable over σk[E] if and only if xH(σk(x))detDσk(x)=H(σk(x)) is integrable over E, that is if and only if Hσk is, and that in that case σk[E]H=EH(σk(x))1dx=EHσk, the integrals being those of [F5].

step 2.1L1F3F5

Remarks

  • Why the cyclic order and not the increasing one. The three maps above send the coordinate k to the last slot and keep the other two in the cyclic order xyzx. Taking instead the two surviving coordinates in increasing order would transpose them in the case k=y, and a transposition has one inversion and hence determinant 1; every identity on this page that treats the three directions alike depends on the cyclic choice.

Depends on

Used by

Dependency tree · two levels

46 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources