The Collatz Conjecture: A New Proof using Algebraic Inverse Trees

Eduardo Diedrich

doi:10.20944/preprints202310.0773.v13

Submit preprint
How it Works
Instructions for Authors
Subject Areas
Advisory Board
screening preprints
About
Awards
Log in/Register

Instructions for Authors
Awards
About
FAQ
Submit Log in/Register

Share this article with

Create alert

Email:

Load new image

preprints.org > computer science and mathematics > mathematics > doi: 10.20944/preprints202310.0773.v13

Preprint Article Version 13 Preserved in Portico This version is not peer-reviewed

The Collatz Conjecture: A New Proof using Algebraic Inverse Trees

Eduardo Diedrich

Version 1 : Received: 11 October 2023 / Approved: 12 October 2023 / Online: 12 October 2023 (04:43:40 CEST)
Version 2 : Received: 13 October 2023 / Approved: 13 October 2023 / Online: 13 October 2023 (04:48:03 CEST)
Version 3 : Received: 13 October 2023 / Approved: 17 October 2023 / Online: 17 October 2023 (10:26:40 CEST)
Version 4 : Received: 17 October 2023 / Approved: 18 October 2023 / Online: 18 October 2023 (10:09:49 CEST)
Version 5 : Received: 19 October 2023 / Approved: 20 October 2023 / Online: 20 October 2023 (10:28:38 CEST)
Version 6 : Received: 21 October 2023 / Approved: 23 October 2023 / Online: 23 October 2023 (10:35:42 CEST)
Version 7 : Received: 26 October 2023 / Approved: 26 October 2023 / Online: 27 October 2023 (09:14:36 CEST)
Version 8 : Received: 28 October 2023 / Approved: 30 October 2023 / Online: 30 October 2023 (09:38:23 CET)
Version 9 : Received: 30 October 2023 / Approved: 31 October 2023 / Online: 31 October 2023 (11:01:44 CET)
Version 10 : Received: 1 November 2023 / Approved: 2 November 2023 / Online: 2 November 2023 (08:16:04 CET)
Version 11 : Received: 8 November 2023 / Approved: 8 November 2023 / Online: 8 November 2023 (07:53:02 CET)
Version 12 : Received: 21 November 2023 / Approved: 22 November 2023 / Online: 24 November 2023 (04:11:49 CET)
Version 13 : Received: 27 December 2023 / Approved: 28 December 2023 / Online: 29 December 2023 (01:14:06 CET)
Version 14 : Received: 16 March 2024 / Approved: 17 March 2024 / Online: 18 March 2024 (10:42:38 CET)
Version 15 : Received: 24 March 2024 / Approved: 25 March 2024 / Online: 26 March 2024 (11:50:16 CET)
Version 16 : Received: 28 March 2024 / Approved: 28 March 2024 / Online: 29 March 2024 (11:23:27 CET)
Version 17 : Received: 30 March 2024 / Approved: 1 April 2024 / Online: 2 April 2024 (11:53:22 CEST)

How to cite: Diedrich, E. The Collatz Conjecture: A New Proof using Algebraic Inverse Trees. Preprints 2023, 2023100773. https://doi.org/10.20944/preprints202310.0773.v13 Diedrich, E. The Collatz Conjecture: A New Proof using Algebraic Inverse Trees. Preprints 2023, 2023100773. https://doi.org/10.20944/preprints202310.0773.v13

Cite

Export citation file: Bib TeX | RIS

MDPI and ACS Style

Diedrich, E. The Collatz Conjecture: A New Proof using Algebraic Inverse Trees. Preprints 2023, 2023100773. https://doi.org/10.20944/preprints202310.0773.v13

APA Style

Diedrich, E. (2023). The Collatz Conjecture: A New Proof using Algebraic Inverse Trees. Preprints. https://doi.org/10.20944/preprints202310.0773.v13

Chicago/Turabian Style

Diedrich, E. 2023 "The Collatz Conjecture: A New Proof using Algebraic Inverse Trees" Preprints. https://doi.org/10.20944/preprints202310.0773.v13

Abstract

This paper presents a novel approach to demonstrate the Collatz Conjecture, an unsolved problem in mathematics stating that all positive integers will eventually converge to 1 when subjected to a recursive sequence of operations. We introduce Algebraic Inverse Trees (AITs), innovative data structures that characterize relationships within the Collatz sequence by tracing inverse transformations back to the origin. Leveraging properties unveiled through this inverted representation, including absence of non-trivial cycles and guaranteed convergence of paths, we construct a topological framework to formally prove that all trajectories invariably lead to 1 under the Collatz iterative process. This modern technique provides not only the machinery to manifest a rigorous proof, but also grants intuitive insights into the deep complexity of this notorious yet elementary conjecture.

Keywords

Collatz Conjecture; Algebraic Inverse Trees; Formal Proof; Topological Framework; Inverse Graph Characterization; Path Convergence; Cycles Absence; Recursive Number Sequences; Discrete Mathematics Structures

Subject

Computer Science and Mathematics, Mathematics

Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Download PDF

Comments (1)

Comment 1

Received: 29 December 2023
Commenter: Eduardo Diedrich
Commenter's Conflict of Interests: Author

Comment: The current version has significantly increased in size, expanding from 22 to 98 pages.
Numerous new sections have been added, highlighting:
Analysis of the need for new approaches to the Conjecture (Section 3.2)
Introductory topological concepts (Section 4)
Formalization of the Collatz function and its inverse (Section 6)
Definitions and fundamental properties of Algebraic Inverse Trees (Section 7)
Extension to the general case of recursive functions(Section 8)
Expansion on potential practical applicationsAdditional details about the proof

The existing sections have also been significantly expanded. For example:
More historical context and relevance (Section 3.1)
A more comprehensive comparison with other approaches (Section 3)
More complete formalizations on topology (Section 5)
A deeper analysis of special cases (Section 7)
Overall, there is a much higher level of mathematical formalization noted, with an extensive introduction of formal definitions, lemmas, theorems, and their associated proofs. New sections on empirical and experimental validation are also included.In summary, the updated version presents significant expansion and deepening in both scope and the level of mathematical formalism, resulting in a much more comprehensive and detailed exposition on the use of Algebraic Inverse Trees to address the Collatz Conjecture.

+ Respond to this comment

Not displayed online.

Importance: How significant is the paper to the field?

Outstanding/highlight paper

Significant contribution

Incremental contribution

No contribution

I am not qualified to judge

Soundness of evidence/arguments presented:

Conclusions well supported

Most conclusions supported (minor revision needed)

Incomplete evidence (major revision needed)

Hypothesis, unsupported conclusions, or proof-of-principle

I am not qualified to judge

Please leave your comment to this article below.

Mathematical equations can be typed in either LaTeX formats \\[ ... \\] or $$ ... $$, or MathML format <math> ... </math>. Try the LaTeX or MathML example.

Type equation:

Preview:

Copy equation into message below

Close menu

Please click a symbol to insert it into the message box below:

Please enter the link here:

Please enter a valid URL

Optionally, you can enter text that should appear as linked text:

Copy link into message below

Close menu

Please enter or paste the URL to the image here (please only use links to jpg/jpeg, png and gif images):

Please enter a valid URL

Copy image into message below

Close menu

Type author name or keywords to filter the list of references in this group (you can add a new citation under Bibliography):

No existing citations in Discussion Group

Wikify editor is a simple editor for wiki-style mark-up. It was written by MDPI for Sciforum in 2014. The rendering of the mark-up is based on Wiky.php with some tweaks. Rendering of mathematical equations is done with MathJax. Please send us a message for support or for reporting bugs.

Close menu

Please declare any conflicts of interest you may have with this paper, financial or otherwise.

I do not have a conflict of interest

I would like to declare a conflict of interest

Display my name on the website Send my name and email address to the authors

Captcha

Renew

I accept the following conditions:

Comments must follow the standards of professional discourse and should focus on the scientific content of the article. Insulting or offensive language, personal attacks and off-topic remarks will not be permitted. Comments must be written in English. Preprints reserves the right to remove comments without notice. Readers who post comments are obliged to declare any competing interests, financial or otherwise.

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)

* All users must log in before leaving a comment

what’s this?

Add a record of this review to Publons to track and showcase your reviewing expertise across the world’s journals.

Downloads 0

Comments 1

Metrics 0

Get PDF Cite Share 0

Bookmark BibSonomy Mendeley Reddit Delicious

Alerts

Notify me about updates to this article or when a peer-reviewed version is published.

Preprints.org is a free preprint server subsidized by MDPI in Basel, Switzerland.

MDPI Initiatives

SciProfiles
Sciforum
Encyclopedia
MDPI Books
Scilit
Proceedings
JAMS

Important links

How it Works
Advisory Board
FAQ
Friendly Journals
Instructions for Authors
About
Statistics

Choose the area that interest you and we will send you notifications of new preprints at your preferred frequency.

Disclaimer

We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.

RSS feed for

Preprints: The Multidisciplinary Preprint Platform

Paste the URL in your RSS reader:

https://www.preprints.org/rss

If you want to subscribe our website in subject-wide, you could find the URL by choosing in the following:

https://www.preprints.org/rss

Please note that by using ScienceDirect RSS feeds, you agree to our Terms of Use and Privacy Policy.