Buchumschlag

A Finite–Depth Structural Resolution of the Collatz Conjecture via Hierarchical Height Functions and Mother Chains (JNT Submission Version)

Fuente: Zenodo

Gespeichert in:

Bibliographische Detailangaben
1. Verfasser:	Matsuua, Yoshihito
Format:	Recurso digital
Veröffentlicht:	Zenodo 2025
Schlagworte:	Collatz Conjecture finite descent height function odd reduction Mother Chain Mathematical logic structural number theory Coq formalization Matsuura Structural Hierarchy formal verification mechanized proof well-foundedness termination proof
Online-Zugang:	Acceder al recurso
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Ähnliche Einträge

Collatz Topology and Modular Backwash: A Structural Framework for Residue Recurrence and Folding
von: Moon, KyungUp
Veröffentlicht: (2025)

The Matsuura Structural Hierarchy: A Unified Depth Framework for Odd Integers and Collatz-Type Dynamics
von: Matsuura, Yoshihito
Veröffentlicht: (2025)

Machine-Checkable Weak Covering for the Collatz (3x+1) Problem
von: Kawanishi, Yoshihito
Veröffentlicht: (2025)

The Global Odd Tower: A Unified Structural Framework for Odd Integers, Prime Geometry, Twin Symmetry, Collatz Descent, and Finite-Cell Factorization
von: Matsuua, Yoshihito
Veröffentlicht: (2025)

Collatz Conjecture: A Reverse Construction Bijective Proof via Layered Directed Acyclic Graphs
von: Aaron Brolin Fish
Veröffentlicht: (2025)

General Theory of Finite Descent Authority
von: Carroll, Jeremy H.
Veröffentlicht: (2026)

Proofing Collatz with AI: A Retrospective on an Experimental Publication Process
von: Thaler, Mario Heinrich
Veröffentlicht: (2025)

Completing the Cohomological Extension Package: Section Cocycles and Splitting Criterion for Mathlib
von: Spivack, Nova
Veröffentlicht: (2026)

Canonical Certification Does Not Exhaust Reflective Structure: Reflective Split, Strict Refinement, and Fiber Structure in Infinity Compression
von: Spivack, Nova
Veröffentlicht: (2026)

Automated Reasoning with Analytic Tableaux and Related Methods
Veröffentlicht: (2023)

FLT-Coq: Two Conditional Routes (Coverage Parameter and GN(2))
von: Dedenko, Grigoriy
Veröffentlicht: (2025)

FLT-Coq v0.3.0 — GlobalNormalization module and maximum-coverage API
von: Dedenko, Grigoriy
Veröffentlicht: (2025)

Arithmetic Extermination II–IV: Rigorous Descent Proofs for Fermat's Last Theorem in the Energy-Lattice Framework
von: scott, eron
Veröffentlicht: (2025)

Abstract Zeta–Möbius Inversion: A Minimal Monoid-Based Schema for Formal Verification
von: Jefferson, Bob
Veröffentlicht: (2026)

Carry Mixing and Spectral Gap Analysis of the Collatz Conjecture: 202 Lean4 Theorems and the Fibonacci Firewall
von: Fujimoto, Nobuki, et al.
Veröffentlicht: (2026)

A Necessary Formation-Theoretic Invariant Against Illegitimate Propositional Lifting 3
von: Salhab, Najih
Veröffentlicht: (2026)

Proof Engine Verification (PROVED): Training and running today's frontier AI models consumes more electricity than entire small countries.
von: Proof Engine
Veröffentlicht: (2026)

Claim Verification: "GLP-1 drugs like Ozempic cause unavoidable major muscle loss and "Ozempic face" even with exercise and high protein intake" — Disproved
von: Proof Engine
Veröffentlicht: (2026)

Claim Verification: "The Pyramid of Giza was built by slaves." — Disproved
von: Proof Engine
Veröffentlicht: (2026)

Claim Verification: "AI hallucinations occur on fewer than 5% of factual questions" — Disproved
von: Proof Engine
Veröffentlicht: (2026)

Layered Recursive Compression as a Structural Proof of the Collatz Conjecture (Version 92)
von: Kawanishi, Yoshihito
Veröffentlicht: (2025)

The Shadow Collatz Conjecture: The Journey of All Integers Toward −1
von: Miyazawa, Ryosuke
Veröffentlicht: (2025)

Claim Verification: "The binary operator eml is defined by the expression \(\text{eml}(a, b) = \exp(a) - \ln(b)\) (where exp is the exponential function and ln is the principal branch of the natural logarithm). For every real \(x > 0\), the nested expression \(\text{eml}(1, \text{eml}(\text{eml}(1, x), 1))\) equals the natural logarithm \(\ln(x)\)." — Proved
von: Proof Engine
Veröffentlicht: (2026)

Claim Verification: "The binary operator eml is defined by the expression \(\text{eml}(a, b) = \exp(a) - \ln(b)\). There exists a finite binary tree consisting solely of eml operations, whose 9 leaves are drawn from \(\{1, x, y\}\), such that the tree evaluates exactly to \(x \times y\). The tree has K = 17 tokens (8 eml operations and 9 leaves), and the identity holds for all complex \(x\) and \(y\) (in the algebraic setting where \(\ln \circ \exp\) is the identity)." — Proved
von: Proof Engine
Veröffentlicht: (2026)

Claim Verification: "Quantum entanglement enables the transmission of usable information faster than the speed of light when the distant parties pre-agree on a measurement basis." — Disproved
von: Proof Engine
Veröffentlicht: (2026)

Dyadic Geometry of the Zeta Function — Formal Lean Verification
von: Motta, Thiago F.
Veröffentlicht: (2026)

On the non-existence of non-trivial Collatz cycles: a conditional formal proof in Lean 4 with documented structural obstructions
von: Merle, Eric
Veröffentlicht: (2026)

Fake Cycles, Spectral Gap, and the BIP Property in Collatz Dynamics
von: okabe, arata
Veröffentlicht: (2026)

Collatz Conjecture: 100% Universal Coverage ? All 10 Mod Cases Proven forall-n, Zero Sorry, Lean4 Verified
von: Fujimoto, Nobuki, et al.
Veröffentlicht: (2026)

Collatz Conjecture: Universal Cycle Descent (27n+19)/32 < n ? Lean4 Verified for All n>=4
von: Fujimoto, Nobuki, et al.
Veröffentlicht: (2026)

A Universal Drift Invariant and the Resolution of the Collatz Conjecture
von: Thaler, Mario Heinrich
Veröffentlicht: (2025)

The δ-Gene: Inference-Time Physical Unclonable Functions from Architecture-Invariant Output Geometry
von: Coslett, Anthony
Veröffentlicht: (2026)

A Lean 4 Proof Architecture for a Normalized 4D Mass Gap Theorem Phase 3 Spectral Gap Formalization and External-Audit Boundary
von: Itakura, Hidetoshi
Veröffentlicht: (2026)

(Hyper)sequent Calculi for the ALC(S4) Description Logics
von: Juan Pablo Muñoz
Veröffentlicht: (2016)

Receipts That Move: The Transportable Proof Conjecture (TPC) — A Proposal for Verifiable Decisions
von: Figurelli, Rogério
Veröffentlicht: (2025)

Semi-formal specifications and formal verification improving the digital design: some statistics
von: D. Torres
Veröffentlicht: (2009)

More efficient proof-search for sequents of temporal logic
von: Romas Alonderis
Veröffentlicht: (2022)

Methodological Generalization of the Collatz Sequences to (1 + 2^k )n + S_k(n) with Computational Verification for k = 1 up to k = 42
von: Ammar, HAMDOUS
Veröffentlicht: (2025)

Why Trust-Scores Always Fail — And Why Proof-Based Systems Are the Only Scalable Alternative
von: Papp, László
Veröffentlicht: (2026)

Proof of Intent Consensus
von: Andrews, Ronald Jason
Veröffentlicht: (2026)