Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)judge 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.

Simple solid regions in a coordinate direction and their cyclic coordinate projection

Definition

Coordinates on R3 are named x,y,z for the indices 0,1,2 of The Euclidean inner product x,y=k<nxkyk on Rn. For each k{x,y,z} the cyclic coordinate projection πk:R3R2 drops the kth coordinate and keeps the other two in cyclic order:

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

A simple description of a solid in the direction k is a quadruple (k,D,γ1,γ2) in which DR2 is compact, Jordan measurable and has nonempty interior, and γ1,γ2:DR are continuous with γ1γ2 on D and γ1<γ2 on the interior of D. The simple solid region it describes is

E={pR3:πk(p)D, γ1(πk(p))pkγ2(πk(p))}.

The set D is the base, γ2 the upper graph function and γ1 the lower graph function of the description. A solid is simple in the direction k when some such description of it is supplied; the description is part of the data and is not inferred from the set E.

Writing σk for the cyclic permutation of A cyclic permutation of the coordinates of R3 preserves Jordan measurability and integrals, so that σk(p)=(πk(p),pk), the image σk[E] is exactly the solid between the graphs of γ1 and γ2 over the base D in the sense of A solid between continuous graphs over a compact Jordan base. That set is compact and Jordan measurable by A solid between continuous graphs over a compact Jordan base is Jordan measurable and integrates by vertical sections, and σk1 is again a cyclic coordinate permutation, so E is compact and Jordan measurable as well; integration over E is that of The Riemann integral of a bounded function over a bounded Jordan measurable set, and interiors, closures and boundaries are those of Interior, closure, boundary, limit point, isolated point and dense subset of a metric space.

Remarks

  • Weak inequality on the base, strict inside. The graphs are allowed to meet on D, so a vertical section of E over a boundary point of the base may be a single point; that is what lets a ball be described in every direction, since its two hemispherical graph functions agree exactly on the equatorial circle. The strictness on the interior of D is what makes the interior of E nonempty and is used where the outward normal is identified.

  • The cyclic order is not cosmetic. With πy(p)=(pz,px) rather than (px,pz), each σk has determinant 1 and each coordinate of an oriented area vector is the Jacobian determinant of the matching projection; taking the surviving coordinates in increasing order would reverse both signs in the case k=y and no statement on this page would hold uniformly in k.

  • Nonempty interior of the base. A base with empty interior need not make E a graph: a line-segment base with γ1<γ2 produces a vertical rectangle. It does, however, make E three-dimensionally content zero and makes the strictness condition on the interior vacuous. Requiring nonempty interior keeps every simple solid region a genuine solid. The boundary of D has content zero by A bounded set in Rm is Jordan measurable iff its boundary is null, equivalently of content zero, which is what makes the base the closure of its interior up to a negligible set in the arguments that follow.

Depends on

Used by

Dependency tree · two levels

47 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