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 coordinate scaling and a coordinate transposition send the unit cube to a set of measure equal to the absolute value of the determinant
Statement
Let and assume the Axiom of Countable Choice (The Axiom of Countable Choice ()). Work with real matrices and identify a matrix with the linear map it defines by (Every Euclidean linear map has a unique matrix and satisfies for some ).
- Coordinate scaling. Let , let be real and let be the elementary matrix obtained from the identity by multiplying row by (Elementary matrices obtained by applying one elementary row operation to an identity matrix). Then sends to the point whose -th coordinate is and whose other coordinates are those of , the image is Lebesgue measurable, and
- Coordinate transposition. Let , let be below and let be the elementary matrix interchanging rows and . Then exchanges the -th and -th coordinates, , and
Facts & Assumptions
Given: A natural number , the Axiom of Countable Choice, and the elementary matrices and over .
If are real for , then any box obtained from the coordinate interval product by independently choosing for each endpoint whether it is included has Lebesgue measure (A box in with parameters is Lebesgue measurable of measure , whichever of its faces are included). In particular (Half-open boxes in and their volume).
An elementary matrix is a matrix obtained by applying one elementary row operation to the identity matrix ; there are three types: interchanges rows and ; multiplies row by ; and adds times row to the distinct row (Elementary matrices obtained by applying one elementary row operation to an identity matrix, Rectangular matrix multiplication and the identity matrix , including zero-sized shapes).
Let and let be a matrix over a commutative ring; interchanging two rows changes to , and multiplying one row by any changes it to (For every square matrix, including singular ones, a row swap negates the determinant, scaling a row by any scalar scales it, and row addition leaves it unchanged, claims 1 and 2; For , the determinant over a commutative ring by the Leibniz formula, and for a real matrix).
If is upper or lower triangular over a commutative ring, with , then (The determinant of a triangular matrix is the product of its diagonal entries).
For every linear there is a unique matrix such that (Every Euclidean linear map has a unique matrix and satisfies for some ).
The absolute value satisfies for , for and for (Absolute value in an ordered field, Basic properties of the absolute value).
Proof
The identity matrix is triangular with every diagonal entry , so ; the row-operation table applied to then gives and , hence and .
Reading off the matrix entries, sends to the point with -th coordinate and the other coordinates unchanged, and sends to the point with -th coordinate , -th coordinate and the others unchanged.
For claim 1, . When this is the half-open box with -th side ; when it is the box with -th side and all other sides . In either case [L1] gives Lebesgue measurability and measure .
For claim 2, restricts to a bijection of onto itself, since exchanging two coordinates of a point all of whose coordinates lie in again gives such a point and the map is its own inverse; hence the image is , of measure .
Steps 1.1, 2.1 and 2.2 are the two claims.
Depends on
- A box in $\mathbb{R}^n$ with parameters $a_i\le b_i$ is Lebesgue measurable of measure $\prod_{i<n}(b_i-a_i)$, whichever of its faces are included
- Assuming countable choice, $\mathcal{L}(\mathbb{R}^n)$ is a sigma-algebra containing every elementary set and $\lambda_n$ is a complete measure extending elementary volume
- Elementary matrices obtained by applying one elementary row operation to an identity matrix
- For $n\ge1$, the determinant over a commutative ring by the Leibniz formula, and $|\det A|$ for a real matrix
- For every square matrix, including singular ones, a row swap negates the determinant, scaling a row by any scalar scales it, and row addition leaves it unchanged
- The determinant of a triangular matrix is the product of its diagonal entries
- Rectangular matrix multiplication and the identity matrix $I_n$, including zero-sized shapes
- Half-open boxes in $\mathbb{R}^n$ and their volume
- Every Euclidean linear map has a unique matrix and satisfies $\|Lh\|_2\le K\|h\|_2$ for some $K\ge0$
- Absolute value in an ordered field
- Basic properties of the absolute value
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
Dependency tree · two levels
60 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
- John K. Hunter, Measure Theory (UC Davis lecture notes), Proposition 2.32 (standard reference, not scraped)
- E. A. Carlen, Notes on Lebesgue Measure on $\mathbb{R}^n$ and $S^{n-1}$ (Rutgers Math 501), Section 3 (standard reference, not scraped)