Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableaudited 2026-08-01
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.

Grid partitions of a rectangle in Rm, their cells, refinements and mesh

Definition

A grid partition P of a nondegenerate rectangle Q=[a,b]⊆Rm is a family, one for each j<m, of one-dimensional partitions aj=tj,0<⋯<tj,nj=bj (Partition of [a,b] as a finite strictly increasing list a=t0<t1<⋯<tn=b, its subintervals and their lengths, its mesh, refinement, and the common refinement of two partitions). For a multi-index i=(i0,…,im−1) with ij<nj, its cell is Qi:=∏j<m[tj,ij,tj,ij+1]. A sum over cells means the iterated recursive sum ∑i0<n0⋯∑im−1<nm−1 of Finite sums and finite products, by recursion. The mesh is max⁡j<m,ij<nj(tj,ij+1−tj,ij), which exists by Every nonempty finite set of reals has a maximum and a minimum and is the largest d∞-diameter (The p-norms ∥x∥p for rational p≥1, and ∥x∥∞, Each ∥⋅∥p is a norm on Rn, and the induced metrics are exactly d1, d2 and d∞ of the published metric-spaces page).

Refinement is coordinatewise. Coordinatewise union gives a common refinement. The cells cover Q and have pairwise disjoint interiors. Repeated splitting of finite sums and induction on m give ∑ivol⁡(Qi)=vol⁡(Q). These statements include boundary overlaps: boundaries may meet, but interiors do not, and volume splitting is algebraic.

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