The upper bound c_d ≤ 2ᵈ #
Let E = {M f > α}. Every x ∈ E is the centre of a cube Q_x with α |Q_x| < ∫_{Q_x} |f|;
these cubes have bounded radii. Mathlib's Vitali lemma with enlargement τ > 1 selects a disjoint
subfamily such that every Q_x meets a selected Q_b with r_x ≤ τ r_b. Then the centre
x lies in the cube of radius (1 + τ) r_b about b; covering only the centres is what saves
the factor 3ᵈ of the uncentred argument. Summing over the disjoint selected cubes gives
α |E| ≤ (1 + τ)ᵈ ‖f‖₁, and letting τ → 1 gives 2ᵈ (Tao, 245A Notes 5, Exercise 42, whose
hint notes that one needs an epsilon of room).
In dimension 0 the space Fin 0 → ℝ is a single point of volume 1, and 1 is a weak type
bound. This is the case d = 0 of isWeakTypeBound_two_pow.
In positive dimension, a cube whose volume times α ∈ (0, ∞) stays below a finite K has
radius at most max 1 (K / α). With K = ‖f‖₁ this is the uniform bound on the radii of the
cubes in mul_volume_le_of_one_lt, which the Vitali covering lemma requires.
Weak type bound with an epsilon of room: in positive dimension,
α |{M f > α}| ≤ (1 + τ)ᵈ ‖f‖₁ for every τ > 1. Letting τ → 1 gives the bound 2ᵈ of
isWeakTypeBound_two_pow; the case d = 0 is isWeakTypeBound_zero_one.
2ᵈ is a weak type bound in dimension d, so weakTypeConstant d ≤ 2 ^ d by
weakTypeConstant_le. Compare mul_volume_le_of_one_lt, which gives only the weaker bound
(1 + τ)ᵈ for each fixed τ > 1, and only in positive dimension.