Astrophysics Galaxy Clustering3 From Jcost

Galaxy clustering and the cost function

Galaxy clustering measures how galaxies cluster on large scales. The standard tool is the two-point correlation function ξ(r), which gives the excess probability, over a random distribution, of finding two galaxies separated by distance r. Observations show a power law: ξ(r) ~ (r/r₀)^(-1.8), with a correlation length r₀ around 5 Mpc/h. This means clustering is stronger at small separations and fades as r grows.

In Recognition Science, the framework models recognition cost with a function J(x) = (x + 1/x)/2 - 1. The module named galaxy clustering3 defines a domain cost as J(m/e), where m and e are two quantities. The machine-checked library of formal theorems proves exactly three facts: the cost vanishes when m equals e, it is nonnegative for positive inputs, and a threshold constant φ - 3/2 is positive. These are general properties of the cost function, not results about galaxies.

The framework's research note compares its predicted exponent, -(1 + J(φ)) = -1.118, with the empirical -1.8. The framework underpredicts the clustering strength. This is a structural discrepancy, not a theorem. The module proves nothing specific to galaxy clustering because the definition of m and e in astronomical terms is absent. What would make this a theorem about its subject is a definition of m and e in that subject's own terms.

The honest takeaway: the module is a template. It shows the cost function's basic properties hold for any ratio, but the leap to galaxy clustering remains open. The framework's library is a collection of formal theorems; this one is a placeholder awaiting a physical bridge.

theorem domainCost_at_eq (r : ℝ) (h : r ≠ 0) : domainCost r r = 0 := by
  unfold domainCost; rw [div_self h]; exact Jcost_unit0

theorem domainCost_nonneg (m e : ℝ) (hm : 0 < m) (he : 0 < e) : 0 ≤ domainCost m e := by
  unfold domainCost; exact Jcost_nonneg (div_pos hm he)

theorem canonicalThreshold_pos : 0 < canonicalThreshold := by
  unfold canonicalThreshold; linarith [phi_gt_onePointFive]

def domainCost (m e : ℝ) : ℝ := Jcost (m / e)

What this page does not claim

The module does not prove the galaxy clustering power law. The framework does not match the observed clustering exponent. No physical bridge between the cost function and galaxy positions is established.

Verify this page

Every tagged claim above names its theorem. To check one yourself rather than trust this page, elaborate the source module with Lean 4 and audit its axiom basis:

$ lake env lean IndisputableMonolith/Astrophysics/GalaxyClustering3_FromJCost.lean
expected axiom basis: [propext, Classical.choice, Quot.sound] (the Lean kernel's standard three; no RS-specific axioms)

A page whose claims cannot be reproduced this way does not ship. In production, every anchor links to the exact declaration in the public source release, and this block carries the build receipt for the page itself.

Derived articles

This page is generated by a question-recursion engine: the questions its answers raise become the next pages. The current agenda, with open targets marked red: