Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)audited 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\mathbb{R}^m, their cells, refinements and mesh

Definition

A grid partition PP of a nondegenerate rectangle Q=[a,b]RmQ=[a,b]\subseteq\mathbb R^m is a family, one for each j<mj<m, of one-dimensional partitions aj=tj,0<<tj,nj=bja_j=t_{j,0}<\cdots<t_{j,n_j}=b_j (Partition of [a,b][a,b] as a finite strictly increasing list a=t0<t1<<tn=ba = t_0 < t_1 < \dots < t_n = b, its subintervals and their lengths, its mesh, refinement, and the common refinement of two partitions). For a multi-index i=(i0,,im1)i=(i_0,\ldots,i_{m-1}) with ij<nji_j<n_j, its cell is Qi:=j<m[tj,ij,tj,ij+1].Q_i:=\prod_{j<m}[t_{j,i_j},t_{j,i_j+1}]. A sum over cells means the iterated recursive sum i0<n0im1<nm1\sum_{i_0<n_0}\cdots\sum_{i_{m-1}<n_{m-1}} of Finite sums and finite products, by recursion. The mesh is maxj<m,ij<nj(tj,ij+1tj,ij)\max_{j<m,i_j<n_j}(t_{j,i_j+1}-t_{j,i_j}), which exists by Every nonempty finite set of reals has a maximum and a minimum and is the largest dd_\infty-diameter (The pp-norms xp\lVert x\rVert_p for rational p1p \ge 1, and x\lVert x\rVert_\infty, Each p\lVert\cdot\rVert_p is a norm on Rn\mathbb{R}^n, and the induced metrics are exactly d1d_1, d2d_2 and dd_\infty of the published metric-spaces page).

Refinement is coordinatewise. Coordinatewise union gives a common refinement. The cells cover QQ and have pairwise disjoint interiors. Repeated splitting of finite sums and induction on mm give ivol(Qi)=vol(Q).\sum_i\operatorname{vol}(Q_i)=\operatorname{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 · next 3 levels

Direct dependencies and their dependencies through the next three levels: 120 results over 23 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources