trureturingGitHub MATHEMATICAL ATLAS

Phase / CONCEPT

Golden Beatty Count

The golden shift s(v)=floor((v+1)/phi) satisfies s(v)<=N exactly when v<floor((N+1)phi), so the count of such v is floor((N+1)phi).

Closed Authored exposition
DIRECT PREREQUISITES0
DIRECT CONSEQUENCES0
PROOF DEPTH0
DOCUMENT LINKS1
THEOREM

The golden shift threshold is a Beatty floor

RELATIONSHIP ATLAS

Every connection, in context.

Explore in 3D
Direct recorded relationships
Golden Beatty CountGolden Beatty Count
Proof dependencyStructural affinityDocument link

Certified topology / UPSTREAM

Prerequisites

None recorded in this release.

Certified topology / DOWNSTREAM

Consequences

None recorded in this release.

RELATED KNOWLEDGE

Structural connections

None recorded in this release.

Documents & exposition

Other authored & advisory relationships

None recorded in this release.

LIBRARY / RELEASE VERSIONS

Content history

Loading release versions...
Browse the archive

Certified provenance

Exact release coordinate

Lean sourceResearch workspace
Status
Closed
Depth
0
Layer
D5/S1
Domain
Phase
Node ID
D5/S1/Phase/GoldenBeattyCount
Repository path
D5/S1/Phase/GoldenBeattyCount.lean
Truth release
sha256:c0d04258d27972c1cf58485e21d64dbcbe336405346ba95133913c64ba2856aa
Source commit
745bf90812f7175f83e1235688249f9495f23bfc
Source tree
143bc6c9ab9054c406f0cdd7f3b296eb38768b5c

Authority boundary

Dependency edges, status, and source coordinates come from the verified release and certified topology. Blueprint exposition is labeled separately. A fallback title carries no additional mathematical authority.