Notes: Repeated Binary Distance Subdivision¶
Dyadic Rationals and Algorithmic Succession
Dyadic Point Generation¶
Mascheroni’s § 67 establishes the constructibility with compass alone of the complete ring of dyadic rationals:
\[\mathbb{Z}\left[\frac{1}{2}\right] = \left\{ \frac{k}{2^n} \cdot AB \;\middle|\; k, n \in \mathbb{Z}_{\ge 0} \right\}.\]
Because any real number in \([0, 1]\) possesses a binary expansion \(\sum_{i=1}^\infty b_i 2^{-i}\), this provides the theoretical basis for Libro XII’s arbitrary-precision approximations of transcendental and algebraic quantities.
Apollonius’ Theorem Application¶
Mascheroni’s demonstration relies on Apollonius’ theorem for the median of a triangle: for any triangle with sides \(a, b\), base \(c\), and median \(m\):
\[a^2 + b^2 = 2 m^2 + \frac{1}{2} c^2.\]
Here \(c = BE = 2 AB\), \(a = BP' = AB\), \(b = P'E = 2 AB\), and the median is \(m = AP'\). Hence:
\[AB^2 + 4 AB^2 = 2 (AP')^2 + 2 AB^2 \implies 2 (AP')^2 = 3 AB^2 \implies AP' = \sqrt{\frac{3}{2}} AB.\]
Archival Witness¶
Facsimile Scan: Folio
0060(p. 35), Fig. 19 crop embedded (mascheroni-1797).