Foundations

Foundations

Sep 12, 2025

Document Status and Current Reference

This page preserves an earlier formulation or research method. Its notation, formulas, and embedded demonstrations belong to that version and should not be treated as the specification of the current binary radial kernels.

Read the current formulation and its analytical verification. Historical performance statements and implementation behaviour require separate validation. Earlier references to circular constants remain in this historical document; they are not inputs to the current geometric kernel definitions.

Mathematical Foundations: Turns Trigonometry & Radial Discretization

Category: Generative Radial Geometry (GRG)

GRG measures angles in turns with period‑1 primitives c(u), s(u) (no π assumed in discrete steps). Constructions proceed on quarters/sectors, summing center‑seeded primitives (chords and radial strips). Below are the core identities used across methods.

Turns Trigonometry (period‑1)

Let a full rotation be one turn. The functions c(u), s(u) are period‑1 and satisfy the usual symmetries and addition rules:

$$ c(u+1)=c(u),\quad s(u+1)=s(u),\quad c(-u)=c(u),\quad s(-u)=-s(u) $$
$$ c(u+v)=c(u)c(v)-s(u)s(v),\qquad s(u+v)=s(u)c(v)+c(u)s(v) $$

Quarter symmetry and parity yield the relations needed for GRG’s inside‑out sums, without introducing π in the discrete formulas.

Chord, Sagitta, and Radial Strip Area

For a unit circle with step Δu between consecutive samples u_L and u_R=u_L+Δu:

$$ \operatorname{chord}(\Delta u)=2\,s\!\left(\tfrac{\Delta u}{2}\right) $$
$$ \operatorname{sagitta}(\Delta u)=1-c\!\left(\tfrac{\Delta u}{2}\right) $$

The area of the center‑seeded strip (triangle O–p(u_L)–p(u_R)) equals half the cross‑product magnitude, i.e. a period‑1 sine of the step:

$$ A_{\text{strip}}(\Delta u)=\tfrac{1}{2}\,\Big(c(u_L)\,s(u_R)-s(u_L)\,c(u_R)\Big) =\tfrac{1}{2}\,s(\Delta u) $$

Discrete Perimeter and Area on a Quarter

With uniform steps Δu=\tfrac{1}{4N} on a quarter (N samples):

$$ P_{\tfrac14}(N;\text{rule})=\sum_{k=1}^{N}\operatorname{chord}(\Delta u),\qquad P(N)=4\,P_{\tfrac14}(N;\text{rule}) $$
$$ A_{\tfrac14}(N)=\sum_{k=1}^{N}\tfrac{1}{2}\,s(\Delta u)=\tfrac{N}{2}\,s\!\left(\tfrac{1}{4N}\right),\qquad A(N)=4\,A_{\tfrac14}(N) $$

Rule choice (midpoint / right‑endpoint / averaged) governs bias for arc length; strip areas use the exact triangle formula per step, remaining π‑free at finite N.

π as an Emergent Limit (turns)

From the full polygon with Δu=1/N:

$$ \pi=\lim_{N\to\infty} N\,s\!\left(\tfrac{1}{2N}\right) $$

Background & Positioning

Category: Generative Radial Geometry (GRG)

Generative Radial Geometry (GRG) builds shapes from the inside via discrete radial scans. Measurements arise by summing chords and radial trapezoids without assuming π in advance. Angles are measured in turns (period‑1), using primitives c(u), s(u) with u \in [0,1). We present GRG as a digital‑native (2025) center‑seeded approach—π‑free and complementary to classical, formula‑first geometry.

Motivation

Classical geometry is top‑down, continuous, formula‑centric. GRG is inside‑out: pick a resolution N, rotate a central ray with step Δu, and accumulate discrete contributions that converge as N grows.

Key Idea (Quarter Aggregation)

Build a quarter from center‑seeded primitives, then use symmetry.

$$\operatorname{chord}(\Delta u)=2\, s\!\left(\tfrac{\Delta u}{2}\right)$$

Quarter arc length follows from summing chords (upper/lower/midpoint/average rules). Area uses radial trapezoids on the quarter, scaled ×4. The one‑step sagitta is

$$\operatorname{sagitta}(\Delta u)=1-c\!\left(\tfrac{\Delta u}{2}\right)$$

π as an Emergent Limit (in turns)

Let the full polygon have N chords with Δu = 1/N. The chord between consecutive samples is 2·s(Δu/2), hence the polygon perimeter is C_N = 2N·s(1/(2N)). Define π (in turns) as half the circumference of the unit circle. Then:

$$\pi \,=\, \lim_{N\to\infty} N\, s\!\left(\tfrac{1}{2N}\right)$$

Dyadic variant: letting N = 2^B, we also have π = lim_{B→∞} 2^{B}·s(2^{-(B+1)}).

What GRG Adds

  • Deterministic control: explicitly choose N, the step Δu, and the rule (midpoint / right‑endpoint / average / radial‑trapezoidal Δu).
  • Turns‑based formalism: period‑1 trigonometry with c(u), s(u); quarter aggregation unifies perimeter and area.
  • Inside‑out convergence: measurements as discrete sums of center‑seeded primitives.

Page Takeaways

  • GRG is a center‑seeded, π‑free discretization framework (2025).
  • Angles are measured in turns with period‑1 primitives c(u), s(u).
  • Quarter aggregation gives simple, reproducible formulas for perimeter and area.
Overview

Overview

Sep 12, 2025

GRG Overview

Generative Radial Geometry studies finite radial constructions and their measurement kernels. The current two-dimensional reference uses equal binary sectors, internal chord triangles, and external tangent triangles.

Current Reference

Definitions, kernel formulas, bounds, and exact-arithmetic error proofs.

Research History

Original Projection, Cartesian trapezoidal methods, and earlier Turns formulations retain their own definitions and scope. They are not interchangeable specifications.

Evidence

Geometric accuracy, floating-point stability, computational performance, and originality are separate questions. See Results and the benchmark protocol for their status.

Circumference & Sphere

Circumference & Sphere

Aug 23, 2025

Why “Certainly on the Circumference” (and on the Sphere)

Category: Debate

Most ways to “draw a circle” are approximations: they split the arc into chords, use regular polygons, or compute points from arc lengths (where \(\pi\) eventually appears). In GRG we do the opposite: we do not measure the arc, we enforce the distance. We fix a radius \(R\) and choose a geometric direction; the generated point is the endpoint of a segment of length \(R\) from a center \(O\). By definition, that point is at distance \(R\) from \(O\): therefore it is certainly on the circumference. No approximation, no \(\pi\) needed.

What we prove, in plain words

In 2D, every point built as \((x,y)=(R\cos\varphi,\,R\sin\varphi)\) identically satisfies

$$x^{2}+y^{2}=R^{2}.$$

It does not “tend” to the circle: it is on the circle.

In 3D, take a unit direction \(\mathbf{u}\) and set \(\mathbf{P}=R\,\mathbf{u}\). By construction \(\|\mathbf{P}\|=R\): the point is certainly on the sphere

$$x^{2}+y^{2}+z^{2}=R^{2}.$$

The heart of it is: distance first. If the distance from the center is enforced to be \(R\), every generated point belongs to the locus of points at distance \(R\). That is the very definition of circle/sphere.

“Then what are sine and cosine for?”

Here they are not approximate numbers: they are ratios of sides in similar right triangles. They serve as a language to express the Cartesian projections of the chosen direction: \[ x=R\cos\varphi,\qquad y=R\sin\varphi. \] Even if, in a digital controller, you compute them with finite precision, the geometric law you implement remains exact: the commanded points are those of the ideal object defined by \(x^{2}+y^{2}=R^{2}\) (or \(x^{2}+y^{2}+z^{2}=R^{2}\)).

If you wish to avoid direct computation of \(\sin\) and \(\cos\) altogether, there is an equivalent incremental form: rotate the vector \((x,y)\) by multiplying it with an orthogonal matrix. Orthogonal matrices preserve the norm: every step remains on the circle by construction.

“What about error accumulating at each step?”

Distinguish carefully:

  • Geometric law (GRG): exact. The norm is preserved at each step (rotations), therefore there is no geometric drift.
  • Physical implementation: it can introduce errors (backlash, compliance, friction, encoder resolution, numerical rounding). These are real-world errors, not flaws of the idea.

In digital control, the small loss/gain of norm due to rounding is removed with three simple techniques:

\(\text{(i) adequate precision}\quad \text{(ii) occasional renormalization enforcing }x^{2}+y^{2}=R^{2}\quad \text{(iii) periodic recomputation from }\varphi.\)

In all cases, the reference object remains the perfect circle/sphere.

“But the machine moves in straight lines, not curves!”

What you often see is the visualization (a polyline between samples). It is not the definition of the path. The GRG law commands instantaneous poses that lie on the circle/sphere. The drive’s interpolation between samples may be linear or spline-based: that is a control choice. If you want a “fuller” trajectory, increase the sampling rate or use an arc interpolator; in any case, the nodes remain exactly on the geometric locus.

Why \(\pi\) is not needed

\(\pi\) is needed when you measure the arc (lengths, areas, times along an arc). In GRG we do not measure the arc: we enforce the distance from the center and the direction. Therefore \(\pi\) is irrelevant to guarantee that points lie on a circle/sphere. You may use \(\pi\) later if you care about arc length, but not to construct the point.

Natural extension to the sphere (including the \(Z\) axis)

What holds in \(X\!-\!Y\) holds in \(X\!-\!Y\!-\!Z\). A unit direction in 3D (obtained via Cartesian projections, without “walking on the surface”) is scaled by \(R\). The result has norm \(R\). That is all. Azimuth–elevation formulas are just a convenient way to obtain \((x,y,z)\). The key property remains the preservation of distance.

Practical consequences for robotics, CNC, and 3D printers

If your machine moves on Cartesian axes and you command \((x,y)\) (or \((x,y,z)\)) according to the GRG law, the ideal path is exactly the circumference (or the sphere).

Any deviations you might measure on a real part come from mechanics and numerics: backlash, compliance, calibration, friction, quantization. Improve the machine, the controller, and the metrology, and you approach the ideal without changing the GRG law.

Typical objections, short answers

  • “Without \(\pi\) I cannot make a circle.” False: a circle is the locus of points at distance \(R\) from a center. No \(\pi\) is needed to guarantee that distance.
  • “Sine and cosine are approximate numeric functions.” In geometry they are exact ratios; in control you can use incremental orthogonal rotations that preserve the norm by construction.
  • “Steps accumulate error.” Rotations do not change the norm. In digital control, rounding errors are contained with renormalization or periodic recomputation.
  • “Points on the sphere are not uniformly distributed.” Different topic: sampling uniformity does not affect the fact that each point lies on the sphere.

The key takeaway

GRG does not approximate the circle or the sphere: it imposes them. With a radius \(R\) fixed and a direction chosen, the distance from the center is \(R\) by construction: therefore the point is certainly on the circumference (or on the sphere). In a Cartesian system, the geometric precision of the trajectory does not depend on \(\pi\) nor on arc approximations: it depends only on your machine and numerics.

Certainly on the Circumference — and the Sphere

Category: Rigor of GRG

GRG conventions. Angles in turns \(u\in[0,1)\) with step \(\Delta u=1/N\). Radial computations (perimeter & radial area) on the full turn; Cartesian area on the quarter (×4). Trig appears only as classical cross-check.

Certainly on the Circumference

  • Circle \(R\): \(x^2+y^2=R^2\).

  • Direction (turns): \(u\in[0,1)\) → radial pose (no arc lengths).

  • GRG border: certificate \(x(u)^2+y(u)^2=R^2\) (Pythagoras on quarter or tangent intersections on turn).

Classical (optional): with \(\varphi=2\pi u\): \(x=R\cos\varphi,\ y=R\sin\varphi\).

Theorem

Every GRG point \(P(u)\) satisfies \(x(u)^2+y(u)^2=R^2\) ⇒ it lies on the circle.

Fig. — Radial construction / orthogonal update preserves norm.

Certainly on the Sphere

  • Sphere \(R\): \(x^2+y^2+z^2=R^2\).

  • Unit direction: build \(\mathbf{u}\) constructively; \(\mathbf{P}=R\,\mathbf{u}\) certifies \(\|\mathbf{P}\|=R\).

Classical (optional): \((\varphi,\theta)\) → \(x=R\cos\varphi\,\sin\theta,\ y=R\sin\varphi\,\sin\theta,\ z=R\cos\theta\).

Theorem

\(\|R\,\mathbf{u}\|^2=R^2\|\mathbf{u}\|^2=R^2\) ⇒ point on the sphere.

Fig. — 3D orthogonal rotations preserve the norm.

GRG · Operative summary (turns & quarter)

Params. Pick \(N\). Full turn: \(u_j=j/N\) with \(\Delta u=1/N\). Generate \(P_j=(x_j,y_j)\) with \(x_j^2+y_j^2=R^2\). Quarter: \(\Delta x=R/N\).

Perimeter — full turn (radial)

Inscribed (lower)

\[ L_{\mathrm{in}}(N)=\sum_{j=0}^{N-1}\sqrt{(x_{j+1}-x_j)^2+(y_{j+1}-y_j)^2}. \]

Circumscribed (upper) — tangents at \(P_j\): \(x\,x_j+y\,y_j=R^2\); intersections \(T_j\) with \(\det_j=x_jy_{j+1}-y_jx_{j+1}\), \(T_j^x=\frac{R^2(y_{j+1}-y_j)}{\det_j}\), \(T_j^y=\frac{R^2(x_j-x_{j+1})}{\det_j}\).

\[ L_{\mathrm{out}}(N)=\sum_{j=0}^{N-1}\lVert T_{j+1}-T_j\rVert. \]

Radial area — full turn

\[ A_{\mathrm{in}}(N)=\tfrac12\sum_{j=0}^{N-1}(x_jy_{j+1}-x_{j+1}y_j),\qquad A_{\mathrm{out}}(N)=\tfrac12\sum_{j=0}^{N-1}(T_j^xT_{j+1}^y-T_{j+1}^xT_j^y). \]

Cartesian area — quarter (Δx) → ×4

Abscissas \(x_i=i\Delta x\), \(\Delta x=R/N\); heights \(y_i=\sqrt{R^2-(i\Delta x)^2}\).

\[ A_{\mathrm{right,q}}=\sum_{i=1}^{N}y_i\Delta x,\quad A_{\mathrm{mid,q}}=\sum_{i=1}^{N}y\!\left(x_{i-\tfrac12}\right)\Delta x,\quad A_{\mathrm{trap,q}}=\sum_{i=1}^{N}\tfrac{y_{i-1}+y_i}{2}\Delta x. \]

Bounds: \(A_{\mathrm{right,q}}\le A_{\mathrm{quarter}}\le A_{\mathrm{mid,q}}\); disk via ×4. π remains outside the computation; trig only as cross-check.

Rigor of GRG

Rigor of GRG

Aug 22, 2025

Earlier Formulation

This page preserves a historical GRG method. Its notation and formulas belong to that version. The current binary radial formulation and verification are available here. Historical computational claims require separate validation.

Generative Radial Geometry (GRG)

A Constructive Alternative to Classical Circle Measurement

Introduction

Generative Radial Geometry (GRG) is a digital, constructive approach: it does not assume π in the build step. Circles are generated from the radius with finite operators (Pythagoras, chords, tangents); classical values (e.g. π) then emerge as limits or comparisons.

Two complementary builds

  • Quarter / Cartesian (Δx): work on one quarter of the disk, sum rectangles/trapezoids with \(\Delta x=R/N\), then ×4. Certified right/midpoint corridor.
  • Full turn / Radial (Δu): work on the full loop in turns \(u\in[0,1)\), step \(Δu=1/U\); equal-angle chords/tangents give in/out polygons (inscribed/circumscribed).

Notation in turns: \(c(u)=\cos(2\pi u),\ s(u)=\sin(2\pi u)\). π appears only when comparing to classical formulas.

Quarter coordinates (Δx, no trig in the step)

On the quarter, sample \(x_k=k\,\Delta x\) with \(\Delta x=R/N\) and heights by Pythagoras:

$$ y_k=\sqrt{R^2-x_k^2},\qquad k=0,\dots,N. $$

Area — Cartesian quarter (GRG)

Δx Trapezoidal (lower)

$$ A_{\text{quarter}}^{\text{trap}}(R,N)=\sum_{k=1}^{N}\frac{y_{k-1}+y_k}{2}\,\Delta x,\quad A_{\text{GRG}}^{\text{trap}}=4\,A_{\text{quarter}}^{\text{trap}}. $$

Projection corridor (certified bounds)

$$ A_{\text{quarter}}^{\mathrm{right}}=\!\sum_{k=1}^{N} y_k\,\Delta x,\qquad A_{\text{quarter}}^{\mathrm{mid}}=\!\sum_{k=1}^{N} y\!\left(x_{k-\tfrac12}\right)\Delta x, $$
$$ A_{\text{quarter}}^{\mathrm{right}}\le A_{\text{quarter}}\le A_{\text{quarter}}^{\mathrm{mid}},\qquad 4A_{\text{quarter}}^{\mathrm{right}}\le A_{\text{GRG}}\le 4A_{\text{quarter}}^{\mathrm{mid}}. $$

Circumference — Radial full turn (GRG)

With \(U\) equal sectors per full turn (step \(Δu=1/U\)), all chords are equal. The inscribed polygon length is:

$$ C_U \;=\; 2\,U\,R\,s\!\Big(\tfrac{1}{2U}\Big) \;=\; 2\,U\,R\,\sin\!\Big(\tfrac{\pi}{U}\Big)\quad\text{(classical cross-check)}. $$

On a quarter with \(N\) steps set \(U=4N\) and get \(C=8NR\,s\!\big(\tfrac{1}{8N}\big)\).

Radial area — in/out corridor on the full turn

Inscribed polygon area (lower, shoelace)

Let \(P_j=(x_j,y_j)\) be border points in CCW order, \(j=0,\dots,U-1\) and \(P_U=P_0\) with \(x_j^2+y_j^2=R^2\).

$$ A_{\text{in}}(R,U)=\tfrac12\sum_{j=0}^{U-1}\bigl(x_jy_{j+1}-x_{j+1}y_j\bigr)\ \le\ A. $$

Circumscribed polygon area (upper, tangents)

The tangent at \(P_j\) is \(x\,x_j+y\,y_j=R^2\). Intersecting tangents at \(P_j,P_{j+1}\) yields \(T_j\):

$$ \det_j=x_jy_{j+1}-y_jx_{j+1},\qquad T_j=\Bigl(\frac{R^2\,(y_{j+1}-y_j)}{\det_j},\ \frac{R^2\,(x_j-x_{j+1})}{\det_j}\Bigr), $$
$$ A_{\text{out}}(R,U)=\tfrac12\sum_{j=0}^{U-1}\bigl(T_j^xT_{j+1}^y-T_{j+1}^xT_j^y\bigr)\ \ge\ A. $$

Hence \(A_{\text{in}}\le A \le A_{\text{out}}\) and the corridor collapses as \(U\) increases.

Answering common objections

“This is nothing new”

GRG constructs perimeter and area from the radius alone in two certified ways: quarter/Δx (right–mid corridor) and full-turn/Δu (inscribed–circumscribed corridor).

“It is only an approximation”

Accuracy is controlled by \(N\) or \(U\); both builds provide bounding pairs that converge.

“It lacks rigor”

Only algebraic steps (Pythagoras, chords, tangents, polygon sums). π is used solely for external comparison, not as an input.

“It is less practical”

Finite sums with elementary operations are ideal for digital computation and come with a transparent error model.

Conclusion

GRG complements classical geometry with a generative language. On the quarter, Δx gives fast areas with bounds; on the full turn, equal-angle chords/tangents give circumference and radial area—letting π emerge as a limit.

Circle with inscribed (lower) and circumscribed (upper) polygons; arrows suggest convergence. A_in A_out U ↑ ⇒ A_in ↑, A_out ↓ inscribed (lower) circumscribed (upper)
The Circle

The Circle

Aug 18, 2025

The Circle — Radius-First (Three Methods)

Principle

The circle is generated from the center. The radius is the only primitive; the perimeter is the path traced by the radius, and the area is the surface swept by its rotation. We work in turns (fractions of a full rotation), not in sexagesimal degrees.

Angles in turns & radial node

Let \(u\in[0,1)\) be an angle in turns (period \(1\)). We use period-1 trigonometric functions \(c(u), s(u)\) with \(c(0)=1, s(0)=0\) and \((c(\tfrac14), s(\tfrac14))=(0,1)\). The exact radial node is:

$$ P(u)=\bigl(r\,c(u),\; r\,s(u)\bigr). $$

Bit-friendly turns

Use fixed-point angles \(u = k/2^B\). Picking \(N\) that divides \(2^B\) makes equal-angle steps exact (\(\Delta u=1/N\)).
Optional: LUT + interpolation for \(c(u), s(u)\).

Method scope & scaling (quick key)

  • Radial Sectors (equal-angle, full turn) → no ×4.
  • Δx Trapezoidal (quarter tiling) → ×4 to get the full circle.
  • Original Projection (midpoint/right on a quadrant) → ×4.
Perimeter (equal-angle chords) is naturally full-turn (no ×4) and shared across methods.

Perimeter (shared across methods)

Equal-angle chords (full turn)

$$ \boxed{\, C_N \;=\; 2\,N\,r\,s\!\Bigl(\tfrac{1}{2N}\Bigr) \,} $$
Inscribed regular \(N\)-gon in turns. Monotone ↑ in \(N\). No quadrant scaling.
Perimeter by equal-angle chords (Δu = 1/N turns) Cartesian axes; circle r=100; sample radii and dashed chords (example N=12).
Perimeter by equal-angle chords: \(C_N = 2N r\, s(1/(2N))\) (full turn).

Area — three interchangeable builds (pick one)

Δx Trapezoidal (quarter → ×4)

$$ \Delta x=\frac{r}{N},\quad x_k=k\,\Delta x,\quad y_k=\sqrt{r^2-x_k^2} $$
$$ A_{\text{quarter}}(N)=\frac{\Delta x}{2}\!\left(y_0+2\sum_{k=1}^{N-1}y_k+y_N\right),\qquad A(N)=4\,A_{\text{quarter}}(N). $$
Under-approx on a concave arc; smooth convergence \(O(N^{-2})\).

Original Projection (midpoint/right corridor, quarter → ×4)

$$ \Delta x=\frac{r}{N},\ \ x_{k+\tfrac12}=(k+\tfrac12)\Delta x,\ \ y(x)=\sqrt{r^2-x^2} $$
$$ A^{\text{quad}}_{\text{mid}}=\sum_{k=0}^{N-1} y\!\bigl(x_{k+\tfrac12}\bigr)\,\Delta x,\qquad A^{\text{quad}}_{\text{right}}=\sum_{k=0}^{N-1} y\!\bigl(x_{k+1}\bigr)\,\Delta x, $$
$$ A_{\text{mid/right}}=4\,A^{\text{quad}}_{\text{mid/right}},\qquad A_{\text{right}}\le A_{\text{true}}\le A_{\text{mid}}. $$
Midpoint is second-order; corridor shrinks with \(N\).

Radial Sectors (equal-angle sectors, full turn)

$$ \boxed{\, A_N = \tfrac{N}{2}\,r^2\,s\!\Bigl(\tfrac{1}{N}\Bigr) \,} $$
Sum of \(N\) congruent isosceles triangles with included angle \(1/N\) turns (inscribed lower; monotone ↑ in \(N\)). No ×4.
Quarter area by Δx trapezoids (under the arc) Cartesian x–y axes; quarter arc with Δx verticals and interior trapezoids. Δx trapezoids
Quarter area by Δx trapezoids; multiply by 4 for the full circle.
Radial sector tiling (equal-angle sectors, full turn) Two example sectors on a unit circle (illustrative N=8).
Radial sectors: \(A_N=\tfrac{N}{2}r^2\,s(1/N)\) (full turn, no ×4).

Practical notes

  • Pick \(N\). If angles are \(k/2^B\) turns, choose \(N\mid 2^B\). Use step-doubling (\(N\!\to\!2N\)) to gauge the gap.
  • Monotonicity. \(C_N\) ↑ with \(N\). Δx trapezoids ↑ toward area (under-tiling). Original corridor shrinks. Radial sectors ↑ (inscribed).
  • All in turns. No degrees, no π in the constructive steps.