trureturingGitHub MATHEMATICAL ATLAS

Words / CONCEPT

Strict Positive Uniform Hierarchy

For every positive k, the finite graphs represented by two k-uniform words form a proper subclass of those represented by two (k+1)-uniform words.

Closed Authored exposition
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES0
PROOF DEPTH3
DOCUMENT LINKS1
THEOREM

Every adjacent inclusion is proper

RELATIONSHIP ATLAS

Every connection, in context.

Explore in 3D
Direct recorded relationships
Uniform Extension by One VertexUniform Extension by One VertexStrict Positive Uniform HierarchyStrict Positive UniformHierarchy
Proof dependencyStructural affinityDocument link

Certified topology / UPSTREAM

Prerequisites

Certified topology / DOWNSTREAM

Consequences

None recorded in this release.

RELATED KNOWLEDGE

Structural connections

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
3
Layer
D5/S1
Domain
Words
Node ID
D5/S1/Words/GraphRepresentation/UniformHierarchy
Repository path
D5/S1/Words/GraphRepresentation/UniformHierarchy.lean
Truth release
sha256:76a8db6a0f78609b1b9d4a959c8392f2752f2daaddc1930e046e34ce07d0f608
Source commit
b52262a023c4db9bb30a128ebfd80ea4ef4c1a53
Source tree
37a24ddf3b9983bdabf0acbfd9b32b06c35c28d3

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.