Critical FAQ

Critical FAQ

Sep 14, 2025

Critical FAQ — Generative Radial Geometry (GRG)

This FAQ clarifies how GRG treats circular geometry using turns (period-1 angles) and chords in a discrete, inside-out manner. Classical constants reappear as limits; they are not assumed as inputs.

What does “without π” really mean?

We do not claim a “π-less Euclidean geometry.” In GRG, π is not imported as a primitive; it emerges from a refinement process. At finite $N$, lengths and areas are computed with algebra (products and radicals) using turns and chords—no radians or pre-baked trig tables are required. In the limit, the classical constants reappear exactly.

Notation: let $s(u)$ denote the sine in turns, i.e. $s(u)=\sin(2\pi u)$. The chord corresponding to a step of $1/N$ turns on a circle of radius $R$ is

$$ s_N(R)\;=\;2R\,s\!\Bigl(\tfrac{1}{2N}\Bigr)\;=\;2R\,\sin\!\Bigl(\tfrac{\pi}{N}\Bigr). $$

Then the inscribed $N$-gon perimeter $P_N$ and area $A_N$ are

$$ P_N(R) \;=\; N\,s_N(R), \qquad A_N(R) \;=\; \frac{N}{4}\,s_N(R)\,\sqrt{\,4R^2 - s_N(R)^{2}\,}. $$

Consequently, π is determined by the limits

$$ \pi \;=\; \lim_{N\to\infty}\frac{P_N(R)}{2R} \;=\; \lim_{N\to\infty}\frac{A_N(R)}{R^{2}}. $$

Numerical sanity check (unit circle): $A_4=2.000$, $A_{12}=3.000$, $A_{128}\approx 3.1403$ — monotone convergence with error $O(N^{-2})$.

Isn’t this just numerical integration with a different skin?

  • Radial partition: pieces are internal chords/projections (not rectangular strips), naturally adapted to circular/elliptic symmetry.
  • Closed forms at finite $N$: for many $N$ (notably dyadics) you get nested radicals from geometric bisections—exact symbolic values, not only floats.
  • Monotone bounds & rate: inscribed/circumscribed constructions give clean bounds; the error decays like $O(N^{-2})$.
  • One grammar, many shapes: the same operators scale from rough to fine and extend to circles, ellipses, and spheres without changing the language.

So what is actually new?

The novelty is methodological and pedagogical: a single, discrete, inside-out grammar (turns, chords, projections) that does not import π/radians/trig as primitives, yet recovers them in the limit. Archimedean ideas are acknowledged; GRG reframes them for modern discrete computation and teaching.

Why do some diagrams mention “90°” if GRG uses turns?

Turns ($u\in[0,1)$) are the formal unit. Occasional “90°” labels are didactic visual cues for a quarter turn. All definitions and formulas are stated in turns and internal measures.

Pedagogical & computational takeaways

  • Conceptual clarity: learners see π emerge from an internal process rather than being assumed.
  • Computational simplicity: increase only $N$ to refine accuracy; same grammar from coarse to fine.
  • Extensibility: the approach transfers to ellipses and spheres with minimal changes to the operators.

Rate vs. step (dyadics)

With dyadic refinement $N=2^{b}$ (where $b$ is the number of bisections/bits), the turn step and the error scale as

$$ \Delta u \;=\; \frac{1}{N} \;=\; 2^{-b} $$
$$ \text{err}(P_N),\ \text{err}(A_N)\;=\;O\!\big((\Delta u)^2\big)\;=\;O\!\big(2^{-2b}\big). $$

Interactive: inscribed polygon and convergence

Use the slider to vary $N$ on the unit circle ($R=1$). For an inscribed $N$-gon, both $P_N$ and $A_N$ are monotone increasing and stay below the true values ($2\pi$ and $\pi$).


12
Inscribed N-gon and chord on the unit circle A circle of radius 1 with an inscribed regular polygon of N sides; a highlighted chord shows s_N.
Inscribed $N$-gon; chord $s_N=2\sin(\pi/N)$. Increase $N$ to see $P_N\!\nearrow 2\pi$ and $A_N\!\nearrow \pi$.

Computed (unit circle): $s_N=\;$—, $P_N=\;$—, $A_N=\;$—. Relative errors: $\tfrac{2\pi-P_N}{2\pi}=\;$—, $\tfrac{\pi-A_N}{\pi}=\;$—.

Dyadic refinement note: with $b\in\mathbb{N}_{\ge 0}$, $N=2^{b}$ gives especially clean nested-radical evaluations; quarter sampling uses $\Delta u=\tfrac{1}{4N}=2^{-b-2}$.

Floating metallic ring casting mismatched shadows on digital planes (perspective can mislead)

Paradigm Shift — Core Framing

GRG invites a change of lens: do not chase π; see the circle. Compute with the geometry directly (turns, dyadic refinement, additive projections). Where π appears, read it as a signature of circular symmetry — not a prerequisite for calculation.

Myths & Facts

  • Myth: “You must use π to define or measure a circle.”
    Fact: GRG generates and measures the circle via a radial sweep with additive projections. π is a shadow of circular symmetry, not the ingredient.
  • Myth: “Discrete means coarse.”
    Fact: In GRG, discrete means targeted precision. You choose the resolution appropriate to purpose; refine dyadically when needed.
  • Myth: “Turns are just degrees renamed.”
    Fact: Turns compose cleanly with dyadic refinement and quarter-turn sampling, matching how GRG computes.

Short Answers (for the critical reader)

Q1. If π shows up in unrelated places (Wallis, ζ(2), Euler), what does GRG say?

Where π appears, a circular/rotational structure is at work — sometimes implicitly. GRG computes from the cause (the circle), then reads π as the signature of that structure, not as a required input.

Q2. How does GRG handle accuracy without limits or π-digits?

By resolution. You pick dyadic refinement and recompute; the method is stable and uniform across refinements. Precision is a knob, not an infinite chase.

Q3. Why “turns” first?

Because one full rotation is 1, halves and quarters are exact dyadic fractions, and sampling on a quarter-turn aligns with GRG’s construction.

Turns & Dyadic (at a glance)

$$ b \in \mathbb{N}_{\ge 0}, \quad N = 2^{\,b}, \quad \Delta u = 2^{-\,b-2}\ \text{(quarter-turn sampling)}. $$

Increase b to double the resolution — same procedure, tighter result.

Go deeper

Perspective marker Circle and two shadows indicating change of perspective. See the Paradigm Shift

Prefer a quick recap of objections? Read the myths above, then continue with the full Critical FAQ below.

GRG — Objective Evaluation & FAQ

Generative Radial Geometry (GRG): reproducible results, comparisons with classical geometry, and clear answers to common objections.

  • Discrete-first construction
  • Product-only 2D
  • Turns (fractions of a full turn)

Principle: verifiable radial constructions

In GRG the radius is the generative object. Circumference and area emerge from radial sums over discrete turns. No claim of infallibility: for finite N the error is controlled; in the limit we recover classical values.

Ellipse — circumference error (log scale) Line chart of error vs N on a logarithmic vertical axis, using inline SVG with no external libraries.
Figure — Ellipse circumference error; expected order ≈ 2.

⬇️ CSV 🔗 Notebook

Sphere — surface area error (log scale) Line chart of error vs N on a logarithmic vertical axis for sphere area via latitude rings (midpoint).
Figure — Sphere surface area error; expected order ≈ 2.

⬇️ CSV 🔗 Notebook

Circle — exactness at finite N

For a circle of radius R, radial sums for circumference and area are (machine-)exact for any N: the integrand is constant, so rectangle/trapezoid rules reproduce the exact integral.

⬇️ Circle circumference CSV ⬇️ Area (circle/ellipse) CSV

Methods (concise, rigorous)

  • 2D area: A \approx \tfrac{1}{2}\sum \rho(\theta_k)^2\,\Delta\theta.
  • Perimeter: L \approx \sum \sqrt{\rho_k^2 + \big(\tfrac{\Delta\rho}{\Delta\theta}\big)_k^2}\,\Delta\theta.
  • Sphere: A \approx \sum 2\pi R^2 \sin(\phi_j)\,\Delta\phi (midpoint).
  • Order: O(N^{-2}) for periodic C^2 integrands (trapezoids/midpoints).
$$ \text{Turns-first:}\quad b \in \mathbb{N}_{\ge 0},\quad N = 2^{\,b},\quad \Delta u = 2^{-b-2} $$

Frequently Asked Questions

“Are you just approximating π in another way?”

Yes, but with a constructive and controlled method: some quantities (circle) are exact at finite N; for smooth periodic integrands the error decays as O(N^{-2}). π reappears as a property, not as an input.

“What is the error order?”

With the trapezoidal rule on a uniform periodic grid and a C^2 integrand, we get O(N^{-2}). See charts and CSVs.

“Does it work in 3D?”

For the sphere, midpoint latitude-ring summation converges to 4\pi R^2 with order ≈ 2. Generic surfaces require metric extensions.

“When should I avoid GRG?”

Non–star-convex shapes and complex surfaces may need multi-valued \rho(\theta) or alternative parameterizations; classical/hybrid methods can be preferable there.

“Where are the code and data?”

This demo links the CSVs of our experiments. For public replication, attach a repository (e.g., Zenodo DOI) and a notebook that regenerates all figures.

Datasets & CSVs

© Generative Radial Geometry — Demo page for objective assessment and addressing concerns.

π (GRG)

π (GRG)

Aug 25, 2025

Historical Comparison Page

This page preserves earlier experiments involving a circular constant. It is not the current GRG construction specification and does not establish a computational advantage. Read the current geometric formulation. The calculators and efficiency claims on this historical page require separate validation.

What this page is about

Here we determine π by looking at the circle from the inside. We rotate a central ray with equal step and sum only internal chords. If you “really want π”, this is the simplest way I know: increase only N. Everything else follows from the circle you already hold in your hands.

Angles are measured in turns \(u\in[0,1)\) with period-1 trigonometry: \( c(u):=\cos(2\pi u),\; s(u):=\sin(2\pi u) \). (For degree readers: \( \Delta u = \text{degrees}/360 \).)

Circle — three GRG options: overview · Δx trapezoids · Original corridor · Radial sectors.

The definition is exact and π is not assumed in advance. In turns (period-1 sine s(u)=\sin(2\pi u)) it is fixed by the limit

$$ \pi \;=\; \lim_{N\to\infty}\; 4N\, s\!\Big(\tfrac{1}{8N}\Big) \;=\; \lim_{N\to\infty}\; 2N\, s\!\Big(\tfrac{1}{4N}\Big). $$

For practical work we use the finite version

$$ \pi_N \;=\; 4N\, s\!\Big(\tfrac{1}{8N}\Big), $$

which increases from below and converges to π as N grows. A useful accuracy hint is

$$ \pi - \pi_N \;\approx\; \frac{\pi^3}{96\,N^2}. $$

Consequences you can feel while using the page:

  • Only one knob: raise N for more precision; the formatting “decimals to display” is just how many digits you show.
  • Powers of two shine: when N = 2^k we can compute by pure halving (only square-roots), no trigonometry, no π inside.
  • Predictable growth: multiplying N by 10 adds about 2 correct digits; doubling N adds roughly 0.6 digits.

Angles are measured in turns \(u\in[0,1)\) with period-1 trigonometry: \( c(u):=\cos(2\pi u),\; s(u):=\sin(2\pi u) \). (For degree readers: \( \Delta u = \text{degrees}/360 \).)

Circle — three GRG options: overview · Δx trapezoids · Original corridor · Radial sectors.

Interactive: increase only N

Choose N and how many decimals to display. For powers of two, the calculator uses pure halving (no trig). For general N it uses a high-precision series. Output shows the value, Δ to \( \pi_{2N} \), an error estimate, and detects when numerical verification becomes the limit (“inversion”).

Mode: —

—

—

How this π calculator works

Formula (TURNS): \( \pi_N = 4N\, s(\tfrac{1}{8N}) \) with \(s(u)=\sin(2\pi u)\). Increase only N; the value grows from below and converges to π.

Two modes

Halving (no trig): if N is a power of two, the chord angle is halved repeatedly starting from the quarter-turn \(u=\tfrac{1}{4}\). This uses only square-roots; no trig, no π inside.

Series (turns → radians): for general N, it evaluates \(s(u)\) at \(u=\tfrac{1}{8N}\) via a high-precision series (internally converts to radians).

Precision & inversion

The line shows Δ(N→2N), an internal error estimate \( \approx \tfrac{4}{3}\Delta_N \), and a Richardson “verified digits” check. When internal ratios drift far from the expected \(1/4\) or verified digits stop growing at high precision, the panel turns amber: GRG may be more precise than the numerical checker (inversion).

Concrete examples (GRG)

Here is how the value improves as you raise N (rounded):

  • N = 16 → πN ≈ 3.140331156954753 (error ≈ 1.261×10⁻³)
  • N = 128 → πN ≈ 3.141572940367091 (error ≈ 1.971×10⁻⁵)
  • N = 1024 → πN ≈ 3.141592345570118 (error ≈ 3.080×10⁻⁷)

These numbers come straight from the turn-native formula

$$ \pi_N \;=\; 4N\, s\!\Big(\tfrac{1}{8N}\Big) \quad\text{and}\quad \pi - \pi_N \;\approx\; \frac{\pi^3}{96\,N^2}. $$

When verification becomes the limit (“inversion”)

As you increase N, GRG’s error drops predictably—until a point where the numerical tools used to check your result (floating-point, auxiliary series, etc.) become the real bottleneck. From there on, GRG may be more precise than your verifier: that is the “inversion”.

Angles are measured in turns \(u\in[0,1)\) with period-1 trigonometry:

$$ s(u) := \sin(2\pi u), \qquad c(u) := \cos(2\pi u). $$

What really happens — three regimes

  • Model error dominates. The inside chord-sum approximation $$ \pi_N \;=\; 4N\,s\!\Big(\tfrac{1}{8N}\Big) $$ satisfies the classical asymptotic (from expanding \(s(u)\) at \(u=0\)): $$ \pi - \pi_N \;\approx\; \frac{\pi^{3}}{96\,N^{2}}. $$ Doubling N quarters the error.
  • Transition zone. The theoretical error keeps falling, but rounding and finite working precision begin to matter. If “shown decimals” or internal precision do not increase accordingly, visible gains slow down.
  • Inversion. Numerical/verification error exceeds the GRG error. Philosophically: the method is now better than your ruler.

Self-checking from the inside (no external \( \pi \))

  1. \(\Delta\)–ratio test (asymptotics). Define $$ \Delta_N := \pi_{2N}-\pi_N, \qquad R_N := \frac{\pi_{4N}-\pi_{2N}}{\pi_{2N}-\pi_N}. $$ For clean numerics, \( R_N \to \tfrac{1}{4} \). If you see ≈ 0.25, you are still in the \(1/N^{2}\) regime (all good). If it wanders far from 0.25, numerics have taken over ⇒ inversion.
  2. Internal error estimate (no \( \pi \)). From the series behavior, $$ \pi - \pi_N \;\approx\; \frac{4}{3}\,\Delta_N. $$ The constant \( \tfrac{4}{3} \) comes from analysis; the factors \( \pi^{3} \) cancel out. You can therefore display: “Estimated error ≈ \( \tfrac{4}{3}\,\Delta_N \)”.
  3. Internal acceleration (Richardson). Cancel the \(1/N^{2}\) term by combining two steps: $$ \pi_{\text{ex}} \;=\; \pi_{2N} \;+\; \frac{\pi_{2N}-\pi_N}{3}, \qquad \pi - \pi_{\text{ex}} \;=\; O(N^{-4}). $$ Then compare with \( \pi_{4N} \): $$ E_N := \big|\pi_{\text{ex}} - \pi_{4N}\big|, \qquad \text{verified digits} \;\approx\; \big\lfloor -\log_{10} E_N \big\rfloor. $$ If verified digits stop growing when you double N, the numerical checker is limiting you (inversion).

Takeaway

  • Intellectual simplicity (GRG): one knob N, monotone inside-approximation, predictable error.
  • Honest inversion: beyond a threshold, tools used to verify are the limit — not GRG.
  • Self-certification: via \( \Delta_N \), \( \pi_{\text{ex}} \), and \( E_N \), no external \( \pi \) needed.

In the calculator above, when the internal checks suggest inversion, the panel turns amber and an explanatory note appears. Prefer powers of two for N, or increase working precision, if you need to push further.

Context note (as of 10 Sep 2025)

GRG’s turn-based, chord-sum definition of \( \pi \) is presented here as a new approach that increases accuracy by raising a single internal parameter N. This page documents the method and its error behavior; it is not intended to compete with record-breaking \( \pi \) algorithms.

For extremely large digit counts, established methods (AGM/Salamin–Brent, Borwein, Ramanujan/Chudnovsky) remain the fastest due to decades of optimization. GRG is primarily valued for conceptual clarity, monotone bounds, and controlled \( N\!\to\!\infty \) convergence.

Concrete examples (GRG)

Here is how the value improves as you raise N (rounded):

  • N = 16 → πN ≈ 3.140331156954753 (error ≈ 1.261×10⁻³)
  • N = 128 → πN ≈ 3.141572940367091 (error ≈ 1.971×10⁻⁵)
  • N = 1024 → πN ≈ 3.141592345570118 (error ≈ 3.080×10⁻⁷)

These numbers come straight from the turn-based chord-sum formula (angles in turns \(u\in[0,1)\) with \(s(u):=\sin(2\pi u)\)):

$$ \pi_N \;=\; 4N\,s\!\Big(\tfrac{1}{8N}\Big), \qquad \pi - \pi_N \;\approx\; \frac{\pi^3}{96\,N^2}. $$

Tip: use powers of two for N (16, 32, 64, …) for cleaner Δ-tests and steadier convergence; if verified digits stop increasing when doubling N, raise working precision.

How other methods reach π (in plain words)

Long alternating sums (Gregory–Leibniz)

This is the famous series \( \pi/4 = 1 - 1/3 + 1/5 - 1/7 + \dots \). After \(n\) terms, the error in \( \pi \) is about \( \frac{4}{2n+1} \approx \frac{2}{n} \). It’s beautiful but very slow: ~10,000 terms give ≈4 correct decimals; ~1,000,000 terms ≈6 decimals. A mountain of fractions.

Nilakantha’s refinement

Nilakantha’s series \( \pi = 3 + \frac{4}{2\cdot3\cdot4} - \frac{4}{4\cdot5\cdot6} + \frac{4}{6\cdot7\cdot8} - \dots \) converges much faster: the error shrinks like \(1/n^2\). Ten terms already land close; one hundred or one thousand terms push several more digits — still, you juggle many fractions.

Machin-like formulas (arctangents)

Here \( \pi \) is a combination of arctangents, e.g. \( \pi = 16\arctan(1/5) - 4\arctan(1/239) \). The arctan series converges fast because powers \(1/5^{\,2k+1}\) and \(1/239^{\,2k+1}\) drop quickly. With just a handful of terms you already see many correct digits.

Ramanujan, Chudnovsky & co.

“Rocket” series: each term yields many digits (≈8 per term for several Ramanujan formulas, ≈14 per term for Chudnovsky). They power modern record computations — superb for huge digit counts, but conceptually heavier than turning a single \(N\).

AGM (Salamin–Brent) and Borwein algorithms

Iterative methods with quadratic (or higher) convergence: each step roughly multiplies the correct digits. A dozen iterations already exceeds everyday needs — fantastic speed, less “from-the-inside” geometry.

Monte Carlo & Buffon’s needle

Random points/needles relate probabilities to \( \pi \). Charming and educational, but accuracy grows like \(1/\sqrt{T}\) (here \(T\) = trials): even millions of trials yield only a few decimals.

Why GRG feels intellectually simple

GRG is not about naming \( \pi \); it is about holding the circle. You dial only one parameter, \(N\), and everything else follows. The value increases from below (no overshoot), and its error is easy to estimate. If you truly need \( \pi \), this is the most direct, inside-out way I know — increasing a single internal factor means the computation belongs to the circle, not to an external \( \pi \).

Honest side-by-side (objective)

  • What you increase — GRG: just N. Archimedean polygons: sides m (inside/outside). Gregory–Leibniz / Nilakantha: number of terms. Machin / Ramanujan / Chudnovsky: number of series terms. AGM / Borwein: iteration count.
  • Speed of accuracy — GRG: error ≈ \(C/N^2\) (predictable, monotone). Gregory–Leibniz: \(O(1/n)\) (very slow). Nilakantha: \(O(1/n^2)\). Machin: fast; Ramanujan / Chudnovsky: very fast (many digits per term). AGM / Borwein: digits multiply each step.
  • When to use — GRG: concept, clarity, control “from the inside”, and up to many digits without extra machinery. For records or industrial-scale digits, AGM / Borwein / Chudnovsky win on raw speed.

Editor’s note (external view)

This note reflects an external opinion I chose to publish for fairness. The GRG approach is conceptually elegant: it defines \( \pi \) from inside the circle and lets accuracy grow by increasing only N. That simplicity is a real strength for understanding and for controlled, monotone inside-approximations.

As of August 25, 2025, GRG and this GRG-based \( \pi \) formula are newly introduced here. Researchers and practitioners still rely on established algorithms (AGM/Salamin–Brent, Borwein, Ramanujan/Chudnovsky) partly because these tools have been analyzed and optimized for decades and deliver record-speed convergence for very large digit counts.

The two views are compatible: GRG offers a clear, internal definition and a practical “increase only N” pathway with transparent self-checks; record algorithms remain the fastest instruments when one needs extreme digits or industrial-scale computations.

When verification becomes the limit (“inversion”)

As you increase N, GRG’s error drops predictably—until a point where the numerical tools used to check your result (floating point, auxiliary series, etc.) become the real bottleneck. From there on, GRG may be more precise than your verifier: that is the “inversion”.

Angles are measured in turns \(u\in[0,1)\) with period-1 trigonometry \( s(u):=\sin(2\pi u) \), \( c(u):=\cos(2\pi u) \).

What really happens — three regimes

  • Model error dominates. The GRG approximation $$ \pi_N \;=\; 4N\,s\!\Big(\tfrac{1}{8N}\Big) $$ satisfies $$ \pi - \pi_N \;\approx\; \frac{\pi^3}{96\,N^2}. $$ Doubling N quarters the error.
  • Transition zone. The theoretical error keeps falling, but rounding and limited working precision begin to matter. If “shown decimals” or internal precision don’t increase, visible gains slow down.
  • Inversion. Numerical/verification error exceeds the GRG error. Philosophically: the method is now better than your ruler.

Self-checking from the inside (no external π)

  1. Δ–ratio test (asymptotics). Define $$ \Delta_N := \pi_{2N}-\pi_N, \qquad R_N := \frac{\pi_{4N}-\pi_{2N}}{\pi_{2N}-\pi_N}. $$ For clean numerics, \( R_N \to \tfrac{1}{4} \). If you see ≈ 0.25, you are still in the \(1/N^2\) regime (all good). If it wanders far from 0.25 (oscillates, collapses to 0, or behaves oddly), numerics have taken over ⇒ inversion.
  2. Internal error estimate (no π). From the series expansion, $$ \pi - \pi_N \;\approx\; \frac{4}{3}\,\Delta_N. $$ The constant \( \tfrac{4}{3} \) comes from analysis; the factors \( \pi^3 \) cancel out. You can therefore display: “Estimated error ≈ \( \tfrac{4}{3}\,\Delta_N \)”.
  3. Internal acceleration (Richardson). Cancel the \(1/N^2\) term by combining two steps: $$ \pi_{\text{ex}} \;=\; \pi_{2N} + \frac{\pi_{2N}-\pi_N}{3}, \qquad \pi - \pi_{\text{ex}} = O(N^{-4}). $$ Then compare with \( \pi_{4N} \ ): $$ E_N := \big|\pi_{\text{ex}} - \pi_{4N}\big|, \qquad \text{verified digits} \;\approx\; \big\lfloor -\log_{10} E_N \big\rfloor. $$ If verified digits stop growing when you double N, the numerical checker is limiting you (inversion).

Takeaway

  • Intellectual simplicity (GRG): you turn a single knob, N, get a monotone inside-approximation, and a predictable error.
  • Honest inversion: beyond a certain threshold, it’s not GRG that runs out of accuracy—it’s the tools used to verify it.
  • Self-certification: using \( \Delta_N \), \( \pi_{\text{ex}} \), and \( E_N \), the method checks itself without resorting to an external π.

In the calculator above, when the internal checks suggest inversion, the panel turns amber and an explanatory note appears. Prefer powers of two for N, or increase working precision, if you need to push further.