<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article">
 <front>
  <journal-meta>
   <journal-id journal-id-type="publisher-id">
    jamp
   </journal-id>
   <journal-title-group>
    <journal-title>
     Journal of Applied Mathematics and Physics
    </journal-title>
   </journal-title-group>
   <issn pub-type="epub">
    2327-4352
   </issn>
   <issn publication-format="print">
    2327-4379
   </issn>
   <publisher>
    <publisher-name>
     Scientific Research Publishing
    </publisher-name>
   </publisher>
  </journal-meta>
  <article-meta>
   <article-id pub-id-type="doi">
    10.4236/jamp.2025.139182
   </article-id>
   <article-id pub-id-type="publisher-id">
    jamp-146197
   </article-id>
   <article-categories>
    <subj-group subj-group-type="heading">
     <subject>
      Articles
     </subject>
    </subj-group>
    <subj-group subj-group-type="Discipline-v2">
     <subject>
      Physics 
     </subject>
     <subject>
       Mathematics
     </subject>
    </subj-group>
   </article-categories>
   <title-group>
    Geometric Information: A Paradigm Shift in Energy Conversion Efficiency 
   </title-group>
   <contrib-group>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Louis M.
      </surname>
      <given-names>
       Houston
      </given-names>
     </name>
    </contrib>
   </contrib-group> 
   <aff id="affnull">
    <addr-line>
     aDepartment of Research and Innovation, University of Louisiana, Lafayette, LA, USA
    </addr-line> 
   </aff> 
   <pub-date pub-type="epub">
    <day>
     09
    </day> 
    <month>
     09
    </month>
    <year>
     2025
    </year>
   </pub-date> 
   <volume>
    13
   </volume> 
   <issue>
    09
   </issue>
   <fpage>
    3202
   </fpage>
   <lpage>
    3212
   </lpage>
   <history>
    <date date-type="received">
     <day>
      8,
     </day>
     <month>
      June
     </month>
     <year>
      2025
     </year>
    </date>
    <date date-type="published">
     <day>
      26,
     </day>
     <month>
      June
     </month>
     <year>
      2025
     </year> 
    </date> 
    <date date-type="accepted">
     <day>
      26,
     </day>
     <month>
      September
     </month>
     <year>
      2025
     </year> 
    </date>
   </history>
   <permissions>
    <copyright-statement>
     © Copyright 2014 by authors and Scientific Research Publishing Inc. 
    </copyright-statement>
    <copyright-year>
     2014
    </copyright-year>
    <license>
     <license-p>
      This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/
     </license-p>
    </license>
   </permissions>
   <abstract>
    This paper introduces a novel concept of information as the logarithm of a countable subset drawn from an uncountable power set, where the countable subset represents “bits” (or mass) and the power set represents the “image” (or structure). Experimentally, the macroscopic deformation of author-related information-bearing materials is reported, showing a physical manifestation of this relationship between information and structure. Theoretically, a multi-directional projection function with floor functions creates directional cuboid volumes, connecting countable information to spatial structures. The observed conversion of information to mechanical energy associated with this deformation displays energy scales much greater than the thermodynamic limits set by Landauer’s Principle for information erasure. This significant increase indicates a potentially different and more efficient mechanism for utilizing the physical consequences of information, suggesting a potential change in the approach to energy transduction.
   </abstract>
   <kwd-group> 
    <kwd>
     Dimensional Projection
    </kwd> 
    <kwd>
      Cuboids
    </kwd> 
    <kwd>
      Vector Spaces
    </kwd> 
    <kwd>
      Information
    </kwd> 
    <kwd>
      Entropy
    </kwd> 
    <kwd>
      Isobaric
    </kwd> 
    <kwd>
      Energy Conversion
    </kwd>
   </kwd-group>
  </article-meta>
 </front>
 <body>
  <sec id="s1">
   <title>1. Introduction</title>
   <p>The energetic implications of information processing are conventionally understood through the lens of Landauer’s Principle <xref ref-type="bibr" rid="scirp.146197-1">
     [1]
    </xref>, which posits a minimal thermodynamic cost for information erasure rooted in entropy increase. In contrast, this work explores a fundamentally different regime by conceptualizing information as the logarithm of a countable subset derived from an uncountable power set <xref ref-type="bibr" rid="scirp.146197-2">
     [2]
    </xref>, where the countable part represents discrete “bits” or mass (a bit = 1 of 2 equally probable choices) and the uncountable power set encompasses the “image” volume or structural complexity. Such bits or mass geometrically manifest into Shannon Entropy <xref ref-type="bibr" rid="scirp.146197-3">
     [3]
    </xref>. We present experimental evidence of macroscopic deformation in author-related information-bearing materials, demonstrating a direct conversion of information into mechanical energy. The theoretical framework, employing a multi-directional projection function <xref ref-type="bibr" rid="scirp.146197-4">
     [4]
    </xref> with floor functions to generate spatial structures from countable information, provides a potential mechanism for this conversion. Strikingly, the energy scales associated with this observed macroscopic deformation are orders of magnitude larger than the minuscule energies dictated by Landauer’s Principle. This extreme augmentation of information-to-mechanical energy conversion suggests a pathway to harness the physical content of information with unprecedented efficiency, potentially bypassing the inherent thermodynamic limitations of information erasure and signifying a revolutionary shift in our understanding of information and energy transduction.</p>
   <p>This relationship invites reconsideration of how dimensionality interacts with physical systems, suggesting that current paradigms may overlook vital aspects of geometric influence. By emphasizing the interplay of structure and information, a pathway emerges for redefining how we conceptualize dimensional extensions in mathematical and physical contexts. The implications extend to energy systems, where geometry-driven mechanisms could challenge conventional interpretations of spatial compression and expansion. Such an approach requires rigorous mathematical foundations to ensure compatibility with established physical laws and to propose viable alternatives to traditional theories.</p>
  </sec><sec id="s2">
   <title>2. Multidimensional Projection</title>
   <p>Normally, dimensional extensions beyond a point, line-segment, square, or cube increase inwardly. This is illustrated in a tesseract <xref ref-type="bibr" rid="scirp.146197-5">
     [5]
    </xref> or 4-dimensional cube, shown in <xref ref-type="fig" rid="fig1">
     Figure 1
    </xref>.</p>
   <fig id="fig1" position="float">
    <label>Figure 1</label>
    <caption>
     <title>
      <xref ref-type="bibr" rid="scirp.146197-"></xref>Figure 1. A four-dimensional cube known as a “tesseract”.</title>
    </caption>
    <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1724230-rId15.jpeg?20251015114129" />
   </fig>
   <p>We argue that since such extensions do not expand, but compress “volume”, which is not consistent with the first 4 physical extensions, that expand orthogonally, then there must be an alternative method of expanding or compressing dimensions that is consistent, while remaining compatible with both mathematics and physics. The latter condition is a result of geometry that images structure with lines, which are visible as edge effects.</p>
   <p>We will first prove the Projection Theorem <xref ref-type="bibr" rid="scirp.146197-6">
     [6]
    </xref>. This theorem derives the mathematics needed to expand a positive integer into a finite sum of a predetermined length.</p>
  </sec><sec id="s3">
   <title>3. Theorem 1</title>
   <p>If 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        n 
      </mi> 
      <mo>
        , 
      </mo> 
      <mi>
        k 
      </mi> 
      <mo>
        ∈ 
      </mo> 
      <msup> 
       <mi>
         ℤ 
       </mi> 
       <mo>
         + 
       </mo> 
      </msup> 
      <mo>
        ∪ 
      </mo> 
      <mn>
        0 
      </mn> 
     </mrow> 
    </math> and 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        m 
      </mi> 
      <mo>
        ∈ 
      </mo> 
      <msup> 
       <mi>
         ℤ 
       </mi> 
       <mo>
         + 
       </mo> 
      </msup> 
     </mrow> 
    </math>.</p>
   <p>Then</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        n 
      </mi> 
      <mo>
        = 
      </mo> 
      <mstyle displaystyle="true"> 
       <msubsup> 
        <mo>
          ∑ 
        </mo> 
        <mrow> 
         <mi>
           k 
         </mi> 
         <mo>
           = 
         </mo> 
         <mn>
           0 
         </mn> 
        </mrow> 
        <mrow> 
         <mi>
           m 
         </mi> 
         <mo>
           − 
         </mo> 
         <mn>
           1 
         </mn> 
        </mrow> 
       </msubsup> 
       <mrow> 
        <mrow> 
         <mo>
           ⌊ 
         </mo> 
         <mrow> 
          <mfrac> 
           <mrow> 
            <mi>
              n 
            </mi> 
            <mo>
              + 
            </mo> 
            <mi>
              k 
            </mi> 
           </mrow> 
           <mi>
             m 
           </mi> 
          </mfrac> 
         </mrow> 
         <mo>
           ⌋ 
         </mo> 
        </mrow> 
       </mrow> 
      </mstyle> 
     </mrow> 
    </math></p>
   <p>With 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mrow> 
       <mo>
         ⌊ 
       </mo> 
       <mtext>
           
       </mtext> 
       <mo>
         ⌋ 
       </mo> 
      </mrow> 
     </mrow> 
    </math> representing the greatest integer function (i.e., floor function).</p>
   <p>PROOF:</p>
   <p>Let:</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        S 
      </mi> 
      <mo>
        = 
      </mo> 
      <mrow> 
       <mo>
         ⌊ 
       </mo> 
       <mrow> 
        <mfrac> 
         <mi>
           n 
         </mi> 
         <mi>
           m 
         </mi> 
        </mfrac> 
       </mrow> 
       <mo>
         ⌋ 
       </mo> 
      </mrow> 
      <mo>
        + 
      </mo> 
      <mrow> 
       <mo>
         ⌊ 
       </mo> 
       <mrow> 
        <mfrac> 
         <mrow> 
          <mi>
            n 
          </mi> 
          <mo>
            + 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
         <mi>
           m 
         </mi> 
        </mfrac> 
       </mrow> 
       <mo>
         ⌋ 
       </mo> 
      </mrow> 
      <mo>
        + 
      </mo> 
      <mrow> 
       <mo>
         ⌊ 
       </mo> 
       <mrow> 
        <mfrac> 
         <mrow> 
          <mi>
            n 
          </mi> 
          <mo>
            + 
          </mo> 
          <mn>
            2 
          </mn> 
         </mrow> 
         <mi>
           m 
         </mi> 
        </mfrac> 
       </mrow> 
       <mo>
         ⌋ 
       </mo> 
      </mrow> 
      <mo>
        + 
      </mo> 
      <mo>
        ⋯ 
      </mo> 
      <mo>
        + 
      </mo> 
      <mrow> 
       <mo>
         ⌊ 
       </mo> 
       <mrow> 
        <mfrac> 
         <mrow> 
          <mi>
            n 
          </mi> 
          <mo>
            + 
          </mo> 
          <mi>
            m 
          </mi> 
          <mo>
            − 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
         <mi>
           m 
         </mi> 
        </mfrac> 
       </mrow> 
       <mo>
         ⌋ 
       </mo> 
      </mrow> 
     </mrow> 
    </math></p>
   <p>Case (1): 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        n 
      </mi> 
      <mo>
        ≤ 
      </mo> 
      <mi>
        m 
      </mi> 
     </mrow> 
    </math>:</p>
   <p>We can rewrite S as:</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        S 
      </mi> 
      <mo>
        = 
      </mo> 
      <mrow> 
       <mo>
         [ 
       </mo> 
       <mrow> 
        <mn>
          1 
        </mn> 
        <mo>
          + 
        </mo> 
        <mfrac> 
         <mrow> 
          <mi>
            n 
          </mi> 
          <mo>
            − 
          </mo> 
          <mi>
            m 
          </mi> 
         </mrow> 
         <mi>
           m 
         </mi> 
        </mfrac> 
       </mrow> 
       <mo>
         ] 
       </mo> 
      </mrow> 
      <mo>
        + 
      </mo> 
      <mrow> 
       <mo>
         [ 
       </mo> 
       <mrow> 
        <mn>
          1 
        </mn> 
        <mo>
          + 
        </mo> 
        <mfrac> 
         <mrow> 
          <mi>
            n 
          </mi> 
          <mo>
            − 
          </mo> 
          <mi>
            m 
          </mi> 
          <mo>
            + 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
         <mi>
           m 
         </mi> 
        </mfrac> 
       </mrow> 
       <mo>
         ] 
       </mo> 
      </mrow> 
      <mo>
        + 
      </mo> 
      <mrow> 
       <mo>
         [ 
       </mo> 
       <mrow> 
        <mn>
          1 
        </mn> 
        <mo>
          + 
        </mo> 
        <mfrac> 
         <mrow> 
          <mi>
            n 
          </mi> 
          <mo>
            − 
          </mo> 
          <mi>
            m 
          </mi> 
          <mo>
            + 
          </mo> 
          <mn>
            2 
          </mn> 
         </mrow> 
         <mi>
           m 
         </mi> 
        </mfrac> 
       </mrow> 
       <mo>
         ] 
       </mo> 
      </mrow> 
      <mo>
        + 
      </mo> 
      <mo>
        ⋯ 
      </mo> 
      <mo>
        + 
      </mo> 
      <mrow> 
       <mo>
         ⌊ 
       </mo> 
       <mrow> 
        <mfrac> 
         <mi>
           n 
         </mi> 
         <mi>
           m 
         </mi> 
        </mfrac> 
       </mrow> 
       <mo>
         ⌋ 
       </mo> 
      </mrow> 
     </mrow> 
    </math></p>
   <p>If 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        n 
      </mi> 
      <mo>
        = 
      </mo> 
      <mi>
        m 
      </mi> 
     </mrow> 
    </math>, then 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        S 
      </mi> 
      <mo>
        = 
      </mo> 
      <mi>
        m 
      </mi> 
     </mrow> 
    </math>. If 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        n 
      </mi> 
      <mo>
        = 
      </mo> 
      <mi>
        m 
      </mi> 
      <mo>
        − 
      </mo> 
      <mn>
        1 
      </mn> 
     </mrow> 
    </math>, then 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        S 
      </mi> 
      <mo>
        = 
      </mo> 
      <mi>
        m 
      </mi> 
      <mo>
        − 
      </mo> 
      <mn>
        1 
      </mn> 
     </mrow> 
    </math>. If 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        m 
      </mi> 
      <mo>
        = 
      </mo> 
      <mn>
        1 
      </mn> 
     </mrow> 
    </math>, then 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        S 
      </mi> 
      <mo>
        = 
      </mo> 
      <mn>
        1 
      </mn> 
     </mrow> 
    </math>.</p>
   <p>
    <xref ref-type="bibr" rid="scirp.146197-"></xref>Case (2): 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        n 
      </mi> 
      <mo>
        &gt; 
      </mo> 
      <mi>
        m 
      </mi> 
     </mrow> 
    </math>:</p>
   <p>Let 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        S 
      </mi> 
      <mo>
        = 
      </mo> 
      <mi>
        m 
      </mi> 
      <mi>
        P 
      </mi> 
      <mo>
        + 
      </mo> 
      <mi>
        R 
      </mi> 
     </mrow> 
    </math>, 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        R 
      </mi> 
      <mo>
        &lt; 
      </mo> 
      <mi>
        m 
      </mi> 
     </mrow> 
    </math>. Then S can be written as:</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        S 
      </mi> 
      <mo>
        = 
      </mo> 
      <mrow> 
       <mo>
         [ 
       </mo> 
       <mrow> 
        <mn>
          1 
        </mn> 
        <mo>
          + 
        </mo> 
        <mfrac> 
         <mrow> 
          <mi>
            m 
          </mi> 
          <mi>
            p 
          </mi> 
          <mo>
            + 
          </mo> 
          <mi>
            R 
          </mi> 
          <mo>
            − 
          </mo> 
          <mi>
            m 
          </mi> 
         </mrow> 
         <mi>
           m 
         </mi> 
        </mfrac> 
       </mrow> 
       <mo>
         ] 
       </mo> 
      </mrow> 
      <mo>
        + 
      </mo> 
      <mrow> 
       <mo>
         [ 
       </mo> 
       <mrow> 
        <mn>
          1 
        </mn> 
        <mo>
          + 
        </mo> 
        <mfrac> 
         <mrow> 
          <mi>
            m 
          </mi> 
          <mi>
            p 
          </mi> 
          <mo>
            + 
          </mo> 
          <mi>
            R 
          </mi> 
          <mo>
            − 
          </mo> 
          <mi>
            m 
          </mi> 
          <mo>
            + 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
         <mi>
           m 
         </mi> 
        </mfrac> 
       </mrow> 
       <mo>
         ] 
       </mo> 
      </mrow> 
      <mo>
        + 
      </mo> 
      <mo>
        ⋯ 
      </mo> 
      <mo>
        + 
      </mo> 
      <mrow> 
       <mo>
         [ 
       </mo> 
       <mrow> 
        <mn>
          1 
        </mn> 
        <mo>
          + 
        </mo> 
        <mfrac> 
         <mrow> 
          <mi>
            m 
          </mi> 
          <mi>
            p 
          </mi> 
          <mo>
            + 
          </mo> 
          <mi>
            R 
          </mi> 
          <mo>
            − 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
         <mi>
           m 
         </mi> 
        </mfrac> 
       </mrow> 
       <mo>
         ] 
       </mo> 
      </mrow> 
     </mrow> 
    </math></p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        S 
      </mi> 
      <mo>
        = 
      </mo> 
      <mi>
        m 
      </mi> 
      <mi>
        p 
      </mi> 
      <mo>
        + 
      </mo> 
      <mrow> 
       <mo>
         [ 
       </mo> 
       <mrow> 
        <mn>
          1 
        </mn> 
        <mo>
          + 
        </mo> 
        <mfrac> 
         <mrow> 
          <mi>
            R 
          </mi> 
          <mo>
            − 
          </mo> 
          <mi>
            m 
          </mi> 
         </mrow> 
         <mi>
           m 
         </mi> 
        </mfrac> 
       </mrow> 
       <mo>
         ] 
       </mo> 
      </mrow> 
      <mo>
        + 
      </mo> 
      <mrow> 
       <mo>
         [ 
       </mo> 
       <mrow> 
        <mn>
          1 
        </mn> 
        <mo>
          + 
        </mo> 
        <mfrac> 
         <mrow> 
          <mi>
            R 
          </mi> 
          <mo>
            − 
          </mo> 
          <mi>
            m 
          </mi> 
          <mo>
            + 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
         <mi>
           m 
         </mi> 
        </mfrac> 
       </mrow> 
       <mo>
         ] 
       </mo> 
      </mrow> 
      <mo>
        + 
      </mo> 
      <mo>
        ⋯ 
      </mo> 
      <mo>
        + 
      </mo> 
      <mrow> 
       <mo>
         [ 
       </mo> 
       <mrow> 
        <mn>
          1 
        </mn> 
        <mo>
          + 
        </mo> 
        <mfrac> 
         <mrow> 
          <mi>
            R 
          </mi> 
          <mo>
            − 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
         <mi>
           m 
         </mi> 
        </mfrac> 
       </mrow> 
       <mo>
         ] 
       </mo> 
      </mrow> 
     </mrow> 
    </math></p>
   <p>Which reduces to</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        S 
      </mi> 
      <mo>
        = 
      </mo> 
      <mi>
        m 
      </mi> 
      <mi>
        P 
      </mi> 
      <mo>
        + 
      </mo> 
      <mi>
        R 
      </mi> 
     </mrow> 
    </math> ⊡</p>
   <p>Hence, when R is restricted within the bounds of m, the projection results in a cyclical alignment owing to the modular arithmetic principles governing the sequence. Each incremental shift of R contributes to the refinement of the corresponding n-dimensional volume compressed into m-dimensional space. This compression serves as the basis for defining transformations that preserve essential characteristics while reducing dimensions.</p>
   <p>Corollary:</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msup> 
       <mi>
         x 
       </mi> 
       <mi>
         n 
       </mi> 
      </msup> 
      <mo>
        = 
      </mo> 
      <msup> 
       <mi>
         x 
       </mi> 
       <mrow> 
        <mstyle displaystyle="true"> 
         <msubsup> 
          <mo>
            ∑ 
          </mo> 
          <mrow> 
           <mi>
             k 
           </mi> 
           <mo>
             = 
           </mo> 
           <mn>
             0 
           </mn> 
          </mrow> 
          <mrow> 
           <mi>
             m 
           </mi> 
           <mo>
             − 
           </mo> 
           <mn>
             1 
           </mn> 
          </mrow> 
         </msubsup> 
         <mrow> 
          <mrow> 
           <mo>
             ⌊ 
           </mo> 
           <mrow> 
            <mfrac> 
             <mrow> 
              <mi>
                n 
              </mi> 
              <mo>
                + 
              </mo> 
              <mi>
                k 
              </mi> 
             </mrow> 
             <mi>
               m 
             </mi> 
            </mfrac> 
           </mrow> 
           <mo>
             ⌋ 
           </mo> 
          </mrow> 
         </mrow> 
        </mstyle> 
       </mrow> 
      </msup> 
      <mo>
        , 
      </mo> 
      <mtext>
          
      </mtext> 
      <mi>
        x 
      </mi> 
      <mo>
        ∈ 
      </mo> 
      <mi>
        ℝ 
      </mi> 
     </mrow> 
    </math>(1)</p>
   <p>More specifically,</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msubsup> 
       <mi>
         x 
       </mi> 
       <mi>
         m 
       </mi> 
       <mi>
         n 
       </mi> 
      </msubsup> 
      <mo>
        = 
      </mo> 
      <msup> 
       <mi>
         x 
       </mi> 
       <mrow> 
        <mrow> 
         <mo>
           ⌊ 
         </mo> 
         <mrow> 
          <mfrac> 
           <mi>
             n 
           </mi> 
           <mi>
             m 
           </mi> 
          </mfrac> 
         </mrow> 
         <mo>
           ⌋ 
         </mo> 
        </mrow> 
       </mrow> 
      </msup> 
      <mo>
        ∗ 
      </mo> 
      <msup> 
       <mi>
         x 
       </mi> 
       <mrow> 
        <mrow> 
         <mo>
           ⌊ 
         </mo> 
         <mrow> 
          <mfrac> 
           <mrow> 
            <mi>
              n 
            </mi> 
            <mo>
              + 
            </mo> 
            <mn>
              1 
            </mn> 
           </mrow> 
           <mi>
             m 
           </mi> 
          </mfrac> 
         </mrow> 
         <mo>
           ⌋ 
         </mo> 
        </mrow> 
       </mrow> 
      </msup> 
      <mo>
        ⋯ 
      </mo> 
      <msup> 
       <mi>
         x 
       </mi> 
       <mrow> 
        <mrow> 
         <mo>
           ⌊ 
         </mo> 
         <mrow> 
          <mfrac> 
           <mrow> 
            <mi>
              n 
            </mi> 
            <mo>
              + 
            </mo> 
            <mi>
              m 
            </mi> 
            <mo>
              − 
            </mo> 
            <mn>
              1 
            </mn> 
           </mrow> 
           <mi>
             m 
           </mi> 
          </mfrac> 
         </mrow> 
         <mo>
           ⌋ 
         </mo> 
        </mrow> 
       </mrow> 
      </msup> 
     </mrow> 
    </math>(2)</p>
   <p>To understand the implications of the corollary, let us delve deeper into the mathematical relationship between n and m in these projections. When defining the transformation, the interplay between dimensions highlights the inherent reduction or preservation of volume depending on the relative values of n and m. It becomes evident that the range of R, where R &lt; m, plays a pivotal role in determining the sequence alignment within the projection calculations. Such nuances form the backbone of how these projection systems operate mathematically.</p>
   <p>We define 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mfrac> 
       <mi>
         n 
       </mi> 
       <mi>
         m 
       </mi> 
      </mfrac> 
     </mrow> 
    </math> as the projection ratio.</p>
   <p>This sequence projects an n-dimensional “volume” into an m-dimensional “volume”. We note that this can be visualized by building the images with unit cubes or voxels (see <xref ref-type="fig" rid="fig2">
     Figure 2
    </xref>).</p>
   <fig id="fig2" position="float">
    <label>Figure 2</label>
    <caption>
     <title>Note the self-similarity in the horizontally organized cuboids.<xref ref-type="bibr" rid="scirp.146197-"></xref>Figure 2. Some examples of cuboids (cubes, long cuboids, and wide cuboids) produced by the finite series given in (1).</title>
    </caption>
    <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1724230-rId60.jpeg?20251015114130" />
   </fig>
   <p>If we project from an n = 3-dimensional volume, (2) becomes:</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msubsup> 
       <mi>
         x 
       </mi> 
       <mn>
         3 
       </mn> 
       <mn>
         3 
       </mn> 
      </msubsup> 
      <mo>
        = 
      </mo> 
      <msup> 
       <mi>
         x 
       </mi> 
       <mrow> 
        <mrow> 
         <mo>
           ⌊ 
         </mo> 
         <mrow> 
          <mfrac> 
           <mn>
             3 
           </mn> 
           <mn>
             3 
           </mn> 
          </mfrac> 
         </mrow> 
         <mo>
           ⌋ 
         </mo> 
        </mrow> 
       </mrow> 
      </msup> 
      <mo>
        ∗ 
      </mo> 
      <msup> 
       <mi>
         x 
       </mi> 
       <mrow> 
        <mrow> 
         <mo>
           ⌊ 
         </mo> 
         <mrow> 
          <mfrac> 
           <mrow> 
            <mn>
              3 
            </mn> 
            <mo>
              + 
            </mo> 
            <mn>
              1 
            </mn> 
           </mrow> 
           <mn>
             3 
           </mn> 
          </mfrac> 
         </mrow> 
         <mo>
           ⌋ 
         </mo> 
        </mrow> 
       </mrow> 
      </msup> 
      <mo>
        ∗ 
      </mo> 
      <msup> 
       <mi>
         x 
       </mi> 
       <mrow> 
        <mrow> 
         <mo>
           ⌊ 
         </mo> 
         <mrow> 
          <mfrac> 
           <mrow> 
            <mn>
              3 
            </mn> 
            <mo>
              + 
            </mo> 
            <mn>
              2 
            </mn> 
           </mrow> 
           <mn>
             3 
           </mn> 
          </mfrac> 
         </mrow> 
         <mo>
           ⌋ 
         </mo> 
        </mrow> 
       </mrow> 
      </msup> 
     </mrow> 
    </math>(3)</p>
   <p>or</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msubsup> 
       <mi>
         x 
       </mi> 
       <mn>
         3 
       </mn> 
       <mn>
         3 
       </mn> 
      </msubsup> 
      <mo>
        = 
      </mo> 
      <msup> 
       <mi>
         x 
       </mi> 
       <mrow> 
        <mfrac> 
         <mn>
           3 
         </mn> 
         <mn>
           3 
         </mn> 
        </mfrac> 
       </mrow> 
      </msup> 
     </mrow> 
    </math>(4)</p>
   <p>Expanding upon these principles, the projection for m = 3 yields an intriguing insight into the modular behavior of dimensions. By employing voxels as visualization units, the projection illustrates the inherent symmetry and cyclic arrangement of sequences. This method, grounded in modular arithmetic, ensures both precision and mathematical elegance when compressing higher dimensions into reduced ones. The visualization of cuboidal structures in this projection lays the groundwork for understanding transitions between states of dimensionality. The interplay between the ranges of R and m becomes increasingly vital in decoding the patterns of sequence alignment, particularly when visual configurations are applied to higher-dimensional volumes.</p>
   <p>This projection behavior becomes increasingly intriguing when considering higher-dimensional transformations. The elegance of the projection ratio is evident as it governs the reduction or preservation of dimensional integrity. For example, in the case where n exceeds m, the inherent structure of the sequence undergoes a fundamental shift. This transition highlights the critical importance of sequential alignment and the geometric interplay between dimensions. Furthermore, the sequence alignment illustrated through cuboids in various configurations demonstrates the underlying mathematical harmony that emerges, even amidst dimensional reduction.</p>
   <p>If we project from an n = 6-dimensional volume, (3) becomes:</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msubsup> 
       <mi>
         x 
       </mi> 
       <mn>
         3 
       </mn> 
       <mn>
         6 
       </mn> 
      </msubsup> 
      <mo>
        = 
      </mo> 
      <msup> 
       <mi>
         x 
       </mi> 
       <mrow> 
        <mrow> 
         <mo>
           ⌊ 
         </mo> 
         <mrow> 
          <mfrac> 
           <mn>
             6 
           </mn> 
           <mn>
             3 
           </mn> 
          </mfrac> 
         </mrow> 
         <mo>
           ⌋ 
         </mo> 
        </mrow> 
       </mrow> 
      </msup> 
      <mo>
        ∗ 
      </mo> 
      <msup> 
       <mi>
         x 
       </mi> 
       <mrow> 
        <mrow> 
         <mo>
           ⌊ 
         </mo> 
         <mrow> 
          <mfrac> 
           <mrow> 
            <mn>
              6 
            </mn> 
            <mo>
              + 
            </mo> 
            <mn>
              1 
            </mn> 
           </mrow> 
           <mn>
             3 
           </mn> 
          </mfrac> 
         </mrow> 
         <mo>
           ⌋ 
         </mo> 
        </mrow> 
       </mrow> 
      </msup> 
      <mo>
        ∗ 
      </mo> 
      <msup> 
       <mi>
         x 
       </mi> 
       <mrow> 
        <mrow> 
         <mo>
           ⌊ 
         </mo> 
         <mrow> 
          <mfrac> 
           <mrow> 
            <mn>
              6 
            </mn> 
            <mo>
              + 
            </mo> 
            <mn>
              2 
            </mn> 
           </mrow> 
           <mn>
             3 
           </mn> 
          </mfrac> 
         </mrow> 
         <mo>
           ⌋ 
         </mo> 
        </mrow> 
       </mrow> 
      </msup> 
     </mrow> 
    </math>(5)</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msubsup> 
       <mi>
         x 
       </mi> 
       <mn>
         3 
       </mn> 
       <mn>
         6 
       </mn> 
      </msubsup> 
      <mo>
        = 
      </mo> 
      <msup> 
       <mi>
         x 
       </mi> 
       <mrow> 
        <mfrac> 
         <mn>
           6 
         </mn> 
         <mn>
           3 
         </mn> 
        </mfrac> 
       </mrow> 
      </msup> 
     </mrow> 
    </math>(6)</p>
   <p>or a projection ratio = 2.</p>
   <p>The self-similarity observed in these cuboids suggests a recursive pattern intrinsic to multi-dimensional projections. This phenomenon resonates with concepts in fractal geometry, where structures exhibit repeating patterns at varying scales. Such projections are not only of theoretical interest but also hold practical applications in data compression and visualization, enabling the encapsulation of higher-dimensional data within comprehensible three-dimensional representations. This aligns with the mathematical framework underpinning projection ratios, which facilitate the translation of complex spatial arrangements into quantifiable formats.</p>
   <p>Image information is defined as countable volume, with its “mass” being the logarithm, base 2 of this volume. Wheeler’s concept <xref ref-type="bibr" rid="scirp.146197-4">
     [4]
    </xref> about “it” from “bit” is geometrically shown in <xref ref-type="fig" rid="fig3">
     Figure 3
    </xref>, suggesting that “mass” comes from information. Note that the cuboids are spatially ordered and not temporally ordered. This is consistent with Schrodinger’s time-independent equation in quantum mechanics.</p>
  </sec><sec id="s4">
   <title>4. Comparison to Matrix Mechanics</title>
   <p>Recall Equation (3): 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msubsup> 
       <mi>
         x 
       </mi> 
       <mn>
         3 
       </mn> 
       <mi>
         n 
       </mi> 
      </msubsup> 
      <mo>
        = 
      </mo> 
      <msup> 
       <mi>
         x 
       </mi> 
       <mrow> 
        <mrow> 
         <mo>
           ⌊ 
         </mo> 
         <mrow> 
          <mfrac> 
           <mi>
             n 
           </mi> 
           <mn>
             3 
           </mn> 
          </mfrac> 
         </mrow> 
         <mo>
           ⌋ 
         </mo> 
        </mrow> 
       </mrow> 
      </msup> 
      <mo>
        ∗ 
      </mo> 
      <msup> 
       <mi>
         x 
       </mi> 
       <mrow> 
        <mrow> 
         <mo>
           ⌊ 
         </mo> 
         <mrow> 
          <mfrac> 
           <mrow> 
            <mi>
              n 
            </mi> 
            <mo>
              + 
            </mo> 
            <mn>
              1 
            </mn> 
           </mrow> 
           <mn>
             3 
           </mn> 
          </mfrac> 
         </mrow> 
         <mo>
           ⌋ 
         </mo> 
        </mrow> 
       </mrow> 
      </msup> 
      <mo>
        ∗ 
      </mo> 
      <msup> 
       <mi>
         x 
       </mi> 
       <mrow> 
        <mrow> 
         <mo>
           ⌊ 
         </mo> 
         <mrow> 
          <mfrac> 
           <mrow> 
            <mi>
              n 
            </mi> 
            <mo>
              + 
            </mo> 
            <mn>
              2 
            </mn> 
           </mrow> 
           <mn>
             3 
           </mn> 
          </mfrac> 
         </mrow> 
         <mo>
           ⌋ 
         </mo> 
        </mrow> 
       </mrow> 
      </msup> 
     </mrow> 
    </math>. We can construct a diagonal matrix representation from (3), adding directions, via unit vectors 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        i 
      </mi> 
      <mo>
        , 
      </mo> 
      <mi>
        j 
      </mi> 
     </mrow> 
    </math> and 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       k 
     </mi> 
    </math>: (i.e., 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mover accent="true"> 
       <mi>
         x 
       </mi> 
       <mo>
         ^ 
       </mo> 
      </mover> 
      <mo>
        , 
      </mo> 
      <mover accent="true"> 
       <mi>
         y 
       </mi> 
       <mo>
         ^ 
       </mo> 
      </mover> 
      <mo>
        , 
      </mo> 
      <mover accent="true"> 
       <mi>
         z 
       </mi> 
       <mo>
         ^ 
       </mo> 
      </mover> 
     </mrow> 
    </math>).</p>
   <p>Consider the following example case for a projection of image data from n-dimensions to 3-dimensions;</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mtable> 
      <mtr> 
       <mtd> 
        <mstyle mathvariant="bold" mathsize="normal"> 
         <mi>
           B 
         </mi> 
        </mstyle> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mn>
            3 
          </mn> 
          <mo>
            , 
          </mo> 
          <mi>
            n 
          </mi> 
          <mo>
            , 
          </mo> 
          <mi>
            x 
          </mi> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          = 
        </mo> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mtable> 
           <mtr> 
            <mtd> 
             <mrow> 
              <msup> 
               <mi>
                 x 
               </mi> 
               <mrow> 
                <mrow> 
                 <mo>
                   ⌊ 
                 </mo> 
                 <mrow> 
                  <mfrac> 
                   <mi>
                     n 
                   </mi> 
                   <mn>
                     3 
                   </mn> 
                  </mfrac> 
                 </mrow> 
                 <mo>
                   ⌋ 
                 </mo> 
                </mrow> 
               </mrow> 
              </msup> 
             </mrow> 
            </mtd> 
            <mtd> 
             <mn>
               0 
             </mn> 
            </mtd> 
            <mtd> 
             <mn>
               0 
             </mn> 
            </mtd> 
           </mtr> 
           <mtr> 
            <mtd> 
             <mn>
               0 
             </mn> 
            </mtd> 
            <mtd> 
             <mrow> 
              <msup> 
               <mi>
                 x 
               </mi> 
               <mrow> 
                <mrow> 
                 <mo>
                   ⌊ 
                 </mo> 
                 <mrow> 
                  <mfrac> 
                   <mrow> 
                    <mi>
                      n 
                    </mi> 
                    <mo>
                      + 
                    </mo> 
                    <mn>
                      1 
                    </mn> 
                   </mrow> 
                   <mn>
                     3 
                   </mn> 
                  </mfrac> 
                 </mrow> 
                 <mo>
                   ⌋ 
                 </mo> 
                </mrow> 
               </mrow> 
              </msup> 
             </mrow> 
            </mtd> 
            <mtd> 
             <mn>
               0 
             </mn> 
            </mtd> 
           </mtr> 
           <mtr> 
            <mtd> 
             <mn>
               0 
             </mn> 
            </mtd> 
            <mtd> 
             <mn>
               0 
             </mn> 
            </mtd> 
            <mtd> 
             <mrow> 
              <msup> 
               <mi>
                 x 
               </mi> 
               <mrow> 
                <mrow> 
                 <mo>
                   ⌊ 
                 </mo> 
                 <mrow> 
                  <mfrac> 
                   <mrow> 
                    <mi>
                      n 
                    </mi> 
                    <mo>
                      + 
                    </mo> 
                    <mn>
                      2 
                    </mn> 
                   </mrow> 
                   <mn>
                     3 
                   </mn> 
                  </mfrac> 
                 </mrow> 
                 <mo>
                   ⌋ 
                 </mo> 
                </mrow> 
               </mrow> 
              </msup> 
             </mrow> 
            </mtd> 
           </mtr> 
          </mtable> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mtable> 
           <mtr> 
            <mtd> 
             <mi>
               i 
             </mi> 
            </mtd> 
           </mtr> 
           <mtr> 
            <mtd> 
             <mi>
               j 
             </mi> 
            </mtd> 
           </mtr> 
           <mtr> 
            <mtd> 
             <mi>
               k 
             </mi> 
            </mtd> 
           </mtr> 
          </mtable> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          + 
        </mo> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mtable> 
           <mtr> 
            <mtd> 
             <mrow> 
              <msup> 
               <mi>
                 x 
               </mi> 
               <mrow> 
                <mrow> 
                 <mo>
                   ⌊ 
                 </mo> 
                 <mrow> 
                  <mfrac> 
                   <mrow> 
                    <mi>
                      n 
                    </mi> 
                    <mo>
                      + 
                    </mo> 
                    <mn>
                      2 
                    </mn> 
                   </mrow> 
                   <mn>
                     3 
                   </mn> 
                  </mfrac> 
                 </mrow> 
                 <mo>
                   ⌋ 
                 </mo> 
                </mrow> 
               </mrow> 
              </msup> 
             </mrow> 
            </mtd> 
            <mtd> 
             <mn>
               0 
             </mn> 
            </mtd> 
            <mtd> 
             <mn>
               0 
             </mn> 
            </mtd> 
           </mtr> 
           <mtr> 
            <mtd> 
             <mn>
               0 
             </mn> 
            </mtd> 
            <mtd> 
             <mrow> 
              <msup> 
               <mi>
                 x 
               </mi> 
               <mrow> 
                <mrow> 
                 <mo>
                   ⌊ 
                 </mo> 
                 <mrow> 
                  <mfrac> 
                   <mi>
                     n 
                   </mi> 
                   <mn>
                     3 
                   </mn> 
                  </mfrac> 
                 </mrow> 
                 <mo>
                   ⌋ 
                 </mo> 
                </mrow> 
               </mrow> 
              </msup> 
             </mrow> 
            </mtd> 
            <mtd> 
             <mn>
               0 
             </mn> 
            </mtd> 
           </mtr> 
           <mtr> 
            <mtd> 
             <mn>
               0 
             </mn> 
            </mtd> 
            <mtd> 
             <mn>
               0 
             </mn> 
            </mtd> 
            <mtd> 
             <mrow> 
              <msup> 
               <mi>
                 x 
               </mi> 
               <mrow> 
                <mrow> 
                 <mo>
                   ⌊ 
                 </mo> 
                 <mrow> 
                  <mfrac> 
                   <mrow> 
                    <mi>
                      n 
                    </mi> 
                    <mo>
                      + 
                    </mo> 
                    <mn>
                      1 
                    </mn> 
                   </mrow> 
                   <mn>
                     3 
                   </mn> 
                  </mfrac> 
                 </mrow> 
                 <mo>
                   ⌋ 
                 </mo> 
                </mrow> 
               </mrow> 
              </msup> 
             </mrow> 
            </mtd> 
           </mtr> 
          </mtable> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mtable> 
           <mtr> 
            <mtd> 
             <mi>
               k 
             </mi> 
            </mtd> 
           </mtr> 
           <mtr> 
            <mtd> 
             <mi>
               i 
             </mi> 
            </mtd> 
           </mtr> 
           <mtr> 
            <mtd> 
             <mi>
               j 
             </mi> 
            </mtd> 
           </mtr> 
          </mtable> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mtd> 
      </mtr> 
      <mtr> 
       <mtd> 
        <mtext>
            
        </mtext> 
        <mtext>
            
        </mtext> 
        <mtext>
            
        </mtext> 
        <mo>
          + 
        </mo> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mtable> 
           <mtr> 
            <mtd> 
             <mrow> 
              <msup> 
               <mi>
                 x 
               </mi> 
               <mrow> 
                <mrow> 
                 <mo>
                   ⌊ 
                 </mo> 
                 <mrow> 
                  <mfrac> 
                   <mrow> 
                    <mi>
                      n 
                    </mi> 
                    <mo>
                      + 
                    </mo> 
                    <mn>
                      1 
                    </mn> 
                   </mrow> 
                   <mn>
                     3 
                   </mn> 
                  </mfrac> 
                 </mrow> 
                 <mo>
                   ⌋ 
                 </mo> 
                </mrow> 
               </mrow> 
              </msup> 
             </mrow> 
            </mtd> 
            <mtd> 
             <mn>
               0 
             </mn> 
            </mtd> 
            <mtd> 
             <mn>
               0 
             </mn> 
            </mtd> 
           </mtr> 
           <mtr> 
            <mtd> 
             <mn>
               0 
             </mn> 
            </mtd> 
            <mtd> 
             <mrow> 
              <msup> 
               <mi>
                 x 
               </mi> 
               <mrow> 
                <mrow> 
                 <mo>
                   ⌊ 
                 </mo> 
                 <mrow> 
                  <mfrac> 
                   <mrow> 
                    <mi>
                      n 
                    </mi> 
                    <mo>
                      + 
                    </mo> 
                    <mn>
                      2 
                    </mn> 
                   </mrow> 
                   <mn>
                     3 
                   </mn> 
                  </mfrac> 
                 </mrow> 
                 <mo>
                   ⌋ 
                 </mo> 
                </mrow> 
               </mrow> 
              </msup> 
             </mrow> 
            </mtd> 
            <mtd> 
             <mn>
               0 
             </mn> 
            </mtd> 
           </mtr> 
           <mtr> 
            <mtd> 
             <mn>
               0 
             </mn> 
            </mtd> 
            <mtd> 
             <mn>
               0 
             </mn> 
            </mtd> 
            <mtd> 
             <mrow> 
              <msup> 
               <mi>
                 x 
               </mi> 
               <mrow> 
                <mrow> 
                 <mo>
                   ⌊ 
                 </mo> 
                 <mrow> 
                  <mfrac> 
                   <mi>
                     n 
                   </mi> 
                   <mn>
                     3 
                   </mn> 
                  </mfrac> 
                 </mrow> 
                 <mo>
                   ⌋ 
                 </mo> 
                </mrow> 
               </mrow> 
              </msup> 
             </mrow> 
            </mtd> 
           </mtr> 
          </mtable> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mtable> 
           <mtr> 
            <mtd> 
             <mi>
               j 
             </mi> 
            </mtd> 
           </mtr> 
           <mtr> 
            <mtd> 
             <mi>
               k 
             </mi> 
            </mtd> 
           </mtr> 
           <mtr> 
            <mtd> 
             <mi>
               i 
             </mi> 
            </mtd> 
           </mtr> 
          </mtable> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mtd> 
      </mtr> 
     </mtable> 
    </math>(7)</p>
   <p>Given a (3 × n) data matrix A, the expectation of A’s image in the information space involves the density operator and trace (sum of diagonal elements). <xref ref-type="fig" rid="fig3">
     Figure 3
    </xref> shows that local Euclidean spaces are directionally cyclic. Since local inner products are zero, Equation (5) defines a vector space. Time is not an observable like position or momentum in standard quantum mechanics <xref ref-type="bibr" rid="scirp.146197-5">
     [5]
    </xref>.</p>
   <fig id="fig3" position="float">
    <label>Figure 3</label>
    <caption>
     <title>Note that n indicates the number of bits. Also observe that the objects are geometrically cyclic, characteristic of phase changes.<xref ref-type="bibr" rid="scirp.146197-"></xref>Figure 3. Some examples of cuboids (cubes, long cuboids, and wide cuboids) illustrated as a vector space, produced by the finite series given in (1). The phases evolve vertically, from top to bottom or devolve from bottom to top.</title>
    </caption>
    <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1724230-rId79.jpeg?20251015114130" />
   </fig>
  </sec><sec id="s5">
   <title>5. Comparison to Shannon Entropy, H (Binary Case)</title>
   <p>Shannon entropy is an average information approximation.</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         H 
       </mi> 
       <mi>
         n 
       </mi> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mo>
        − 
      </mo> 
      <mstyle displaystyle="true"> 
       <msubsup> 
        <mo>
          ∑ 
        </mo> 
        <mn>
          1 
        </mn> 
        <mi>
          n 
        </mi> 
       </msubsup> 
       <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
        <msub> 
         <mrow> 
          <mi>
            log 
          </mi> 
         </mrow> 
         <mn>
           2 
         </mn> 
        </msub> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
       </mrow> 
      </mstyle> 
     </mrow> 
    </math>(8)</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         H 
       </mi> 
       <mn>
         2 
       </mn> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mo>
        − 
      </mo> 
      <msub> 
       <mi>
         p 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
      <msub> 
       <mrow> 
        <mi>
          log 
        </mi> 
       </mrow> 
       <mn>
         2 
       </mn> 
      </msub> 
      <msub> 
       <mi>
         p 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
      <mo>
        − 
      </mo> 
      <msub> 
       <mi>
         p 
       </mi> 
       <mn>
         2 
       </mn> 
      </msub> 
      <msub> 
       <mrow> 
        <mi>
          log 
        </mi> 
       </mrow> 
       <mn>
         2 
       </mn> 
      </msub> 
      <msub> 
       <mi>
         p 
       </mi> 
       <mn>
         2 
       </mn> 
      </msub> 
     </mrow> 
    </math>(9)</p>
   <p>In which normalization requires that the total probability is one:</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         p 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
      <mo>
        + 
      </mo> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mn>
          1 
        </mn> 
        <mo>
          − 
        </mo> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        = 
      </mo> 
      <mn>
        1 
      </mn> 
     </mrow> 
    </math>(10)</p>
   <p>If we let the probability amplitudes be equal, we get:</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         p 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
      <mo>
        = 
      </mo> 
      <msub> 
       <mi>
         p 
       </mi> 
       <mn>
         2 
       </mn> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mfrac> 
       <mn>
         1 
       </mn> 
       <mn>
         2 
       </mn> 
      </mfrac> 
     </mrow> 
    </math>(11)</p>
   <p>Thus,</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         H 
       </mi> 
       <mn>
         2 
       </mn> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mfrac> 
       <mn>
         1 
       </mn> 
       <mn>
         2 
       </mn> 
      </mfrac> 
      <msub> 
       <mrow> 
        <mi>
          log 
        </mi> 
       </mrow> 
       <mn>
         2 
       </mn> 
      </msub> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mn>
         2 
       </mn> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        + 
      </mo> 
      <mfrac> 
       <mn>
         1 
       </mn> 
       <mn>
         2 
       </mn> 
      </mfrac> 
      <msub> 
       <mrow> 
        <mi>
          log 
        </mi> 
       </mrow> 
       <mn>
         2 
       </mn> 
      </msub> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mn>
         2 
       </mn> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math>(12)</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         H 
       </mi> 
       <mn>
         2 
       </mn> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mn>
        1 
      </mn> 
      <mtext>
          
      </mtext> 
      <mtext>
        bit 
      </mtext> 
      <mo>
        . 
      </mo> 
     </mrow> 
    </math>(13)</p>
   <p>The 2-D image volume is:</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        I 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mn>
          2 
        </mn> 
        <mo>
          , 
        </mo> 
        <mi>
          n 
        </mi> 
        <mo>
          , 
        </mo> 
        <mi>
          x 
        </mi> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        = 
      </mo> 
      <msup> 
       <mi>
         x 
       </mi> 
       <mrow> 
        <mrow> 
         <mo>
           ⌊ 
         </mo> 
         <mrow> 
          <mfrac> 
           <mi>
             n 
           </mi> 
           <mn>
             2 
           </mn> 
          </mfrac> 
         </mrow> 
         <mo>
           ⌋ 
         </mo> 
        </mrow> 
       </mrow> 
      </msup> 
      <mo>
        ∗ 
      </mo> 
      <msup> 
       <mi>
         x 
       </mi> 
       <mrow> 
        <mrow> 
         <mo>
           ⌊ 
         </mo> 
         <mrow> 
          <mfrac> 
           <mrow> 
            <mi>
              n 
            </mi> 
            <mo>
              + 
            </mo> 
            <mn>
              1 
            </mn> 
           </mrow> 
           <mn>
             2 
           </mn> 
          </mfrac> 
         </mrow> 
         <mo>
           ⌋ 
         </mo> 
        </mrow> 
       </mrow> 
      </msup> 
     </mrow> 
    </math>(14)</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        I 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mn>
          2 
        </mn> 
        <mo>
          , 
        </mo> 
        <mn>
          2 
        </mn> 
        <mo>
          , 
        </mo> 
        <mn>
          2 
        </mn> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        = 
      </mo> 
      <msup> 
       <mn>
         2 
       </mn> 
       <mrow> 
        <mrow> 
         <mo>
           ⌊ 
         </mo> 
         <mrow> 
          <mfrac> 
           <mn>
             2 
           </mn> 
           <mn>
             2 
           </mn> 
          </mfrac> 
         </mrow> 
         <mo>
           ⌋ 
         </mo> 
        </mrow> 
       </mrow> 
      </msup> 
      <mo>
        ∗ 
      </mo> 
      <msup> 
       <mn>
         2 
       </mn> 
       <mrow> 
        <mrow> 
         <mo>
           ⌊ 
         </mo> 
         <mrow> 
          <mfrac> 
           <mn>
             3 
           </mn> 
           <mn>
             2 
           </mn> 
          </mfrac> 
         </mrow> 
         <mo>
           ⌋ 
         </mo> 
        </mrow> 
       </mrow> 
      </msup> 
     </mrow> 
    </math>(15)</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        I 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mn>
          2 
        </mn> 
        <mo>
          , 
        </mo> 
        <mn>
          2 
        </mn> 
        <mo>
          , 
        </mo> 
        <mn>
          2 
        </mn> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        = 
      </mo> 
      <msup> 
       <mn>
         2 
       </mn> 
       <mn>
         1 
       </mn> 
      </msup> 
      <mo>
        ∗ 
      </mo> 
      <msup> 
       <mn>
         2 
       </mn> 
       <mn>
         1 
       </mn> 
      </msup> 
      <mo>
        = 
      </mo> 
      <mn>
        4 
      </mn> 
     </mrow> 
    </math> voxels (i.e., the countable volume)(16)</p>
   <p>Think of sweeping a line segment of length 2 orthogonally through a distance of 2. This yields the image.</p>
   <p>Consequently, the image magnitude is:</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mrow> 
        <mi>
          log 
        </mi> 
       </mrow> 
       <mn>
         2 
       </mn> 
      </msub> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mi>
          I 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mn>
            2 
          </mn> 
          <mo>
            , 
          </mo> 
          <mn>
            2 
          </mn> 
          <mo>
            , 
          </mo> 
          <mn>
            2 
          </mn> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        = 
      </mo> 
      <msub> 
       <mrow> 
        <mi>
          log 
        </mi> 
       </mrow> 
       <mn>
         2 
       </mn> 
      </msub> 
      <mn>
        4 
      </mn> 
     </mrow> 
    </math> (17)</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mrow> 
        <mi>
          log 
        </mi> 
       </mrow> 
       <mn>
         2 
       </mn> 
      </msub> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mi>
          I 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mn>
            2 
          </mn> 
          <mo>
            , 
          </mo> 
          <mn>
            2 
          </mn> 
          <mo>
            , 
          </mo> 
          <mn>
            2 
          </mn> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        = 
      </mo> 
      <mn>
        2 
      </mn> 
      <mtext>
          
      </mtext> 
      <mtext>
        bits 
      </mtext> 
     </mrow> 
    </math> (18)</p>
  </sec><sec id="s6">
   <title>6. Classical Mechanics: The Geometry of Macroscopic Information</title>
   <p>Based on the fact that cuboids are scale invariant (or that the density is variable), we show in <xref ref-type="fig" rid="fig4">
     Figure 4
    </xref>. That the path traced out by macroscopic cuboids (large n) is approximately that of a simple helix:</p>
   <fig id="fig4" position="float">
    <label>Figure 4</label>
    <caption>
     <title>
      <xref ref-type="bibr" rid="scirp.146197-"></xref>Figure 4. The simple helical approximate path of cuboids at the macroscopic level is shown in (a) (courtesy of Wikipedia). The path is similar to the path of an electron in a magnetic field, solenoidal current, the DNA molecule and various and sundry mechanical objects like screws. (b) shows the exact microscopic path of cuboids.</title>
    </caption>
    <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1724230-rId102.jpeg?20251015114131" />
   </fig>
  </sec><sec id="s7">
   <title>7. The Conversion of Information into Energy: Some Experimental Evidence</title>
   <p>The following examinations that we are calling experimental evidence are presented without rigorous details, but are sufficient to display essential information about future, more intense analysis. The major goal of this paper was to introduce a new, wholly physical definition of information that the addition of geometry creates. <xref ref-type="fig" rid="figFigures 5-8">
     Figures 5-8
    </xref> attempt to illustrate that claim.</p>
   <fig id="fig5" position="float">
    <label>Figure 5</label>
    <caption>
     <title>
      <xref ref-type="bibr" rid="scirp.146197-"></xref>Figure 5. A single initial undeformed business card sitting on a non-reflective surface for ~5 minutes. The card remained undistorted during that time interval.</title>
    </caption>
    <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1724230-rId103.jpeg?20251015114132" />
   </fig>
   <fig id="fig6" position="float">
    <label>Figure 6</label>
    <caption>
     <title><p class="imgGroupCss_v"><img class=" imgMarkCss lazy" data-original="https://html.scirp.org/file/1724230-rId105.jpeg?20251015114132" /></p><xref ref-type="bibr" rid="scirp.146197-"></xref>Figure 6. Experiment 2: Several cards independently deforming on the top and several cards independently deforming on the bottom. Photos taken after ~8 hours.</title>
    </caption>
    <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1724230-rId104.jpeg?20251015114132" />
   </fig>
   <fig id="fig7" position="float">
    <label>Figure 7</label>
    <caption>
     <title>
      <xref ref-type="bibr" rid="scirp.146197-"></xref>Figure 7. Experiment 3: Deformation of two very different materials; thin, pink, paper on the left versus thicker cardboard on the right. On the left, handwritten notes filling the area. On the right, machine-written identity information filling about one half of the area. In addition, the information is oriented orthogonally between the cards.</title>
    </caption>
    <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1724230-rId106.jpeg?20251015114132" />
   </fig>
   <fig id="fig8" position="float">
    <label>Figure 8</label>
    <caption>
     <title>
      <xref ref-type="bibr" rid="scirp.146197-"></xref>Figure 8. Experiment 4. A presentation of the cards in <xref ref-type="fig" rid="fig8">
       Figure 8
      </xref> after a vertical flip.</title>
    </caption>
    <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1724230-rId107.jpeg?20251015114131" />
   </fig>
   <p>In <xref ref-type="fig" rid="fig5">
     Figure 5
    </xref>, we show a business card on a dark, non-reflective surface. Undisturbed for about 5 minutes:</p>
   <p>The two card shapes (i.e., concave and convex) are simply due to the same attractive force of information existing on only one side of the cards.</p>
  </sec><sec id="s8">
   <title>8. Calculations of Energy due to Newly Defined Information</title>
   <p>From physics, we know the relationship:</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        E 
      </mi> 
      <mo>
        = 
      </mo> 
      <mi>
        P 
      </mi> 
      <mo>
        × 
      </mo> 
      <mi>
        V 
      </mi> 
     </mrow> 
    </math> (19)</p>
   <p>where E is energy, P is pressure and V is volume.</p>
   <p>Let the process be isobaric, with constant pressure causing concave or bending, depending on which side contains information.</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mtext>
        Δ 
      </mtext> 
      <mi>
        P 
      </mi> 
      <mo>
        = 
      </mo> 
      <mn>
        0 
      </mn> 
     </mrow> 
    </math>(20)</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         E 
       </mi> 
       <mi>
         n 
       </mi> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mi>
        P 
      </mi> 
      <mo>
        × 
      </mo> 
      <msub> 
       <mi>
         V 
       </mi> 
       <mi>
         n 
       </mi> 
      </msub> 
     </mrow> 
    </math>(21)</p>
   <p>For 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        n 
      </mi> 
      <mo>
        = 
      </mo> 
      <mn>
        0 
      </mn> 
      <mo>
        , 
      </mo> 
      <mn>
        1 
      </mn> 
      <mo>
        , 
      </mo> 
      <mn>
        2 
      </mn> 
      <mo>
        , 
      </mo> 
      <mo>
        ⋯ 
      </mo> 
     </mrow> 
    </math>.</p>
   <p>Apply the new definition: information 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mo>
       ≡ 
     </mo> 
    </math> the logarithm of countable volume.</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         I 
       </mi> 
       <mi>
         n 
       </mi> 
      </msub> 
      <mo>
        = 
      </mo> 
      <msub> 
       <mrow> 
        <mi>
          log 
        </mi> 
       </mrow> 
       <mn>
         2 
       </mn> 
      </msub> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mi>
           n 
         </mi> 
        </msub> 
        <mo>
          ∗ 
        </mo> 
        <mrow> 
         <mo>
           [ 
         </mo> 
         <mrow> 
          <msup> 
           <mtext>
             m 
           </mtext> 
           <mrow> 
            <mo>
              − 
            </mo> 
            <mn>
              3 
            </mn> 
           </mrow> 
          </msup> 
         </mrow> 
         <mo>
           ] 
         </mo> 
        </mrow> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math>(22)</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msup> 
       <mn>
         2 
       </mn> 
       <mrow> 
        <msub> 
         <mi>
           I 
         </mi> 
         <mi>
           n 
         </mi> 
        </msub> 
       </mrow> 
      </msup> 
      <mo>
        = 
      </mo> 
      <msub> 
       <mi>
         V 
       </mi> 
       <mi>
         n 
       </mi> 
      </msub> 
      <mo>
        ∗ 
      </mo> 
      <mrow> 
       <mo>
         [ 
       </mo> 
       <mrow> 
        <msup> 
         <mtext>
           m 
         </mtext> 
         <mrow> 
          <mo>
            − 
          </mo> 
          <mn>
            3 
          </mn> 
         </mrow> 
        </msup> 
       </mrow> 
       <mo>
         ] 
       </mo> 
      </mrow> 
     </mrow> 
    </math>(23)</p>
   <p>Substitute (24) into (22):</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         E 
       </mi> 
       <mi>
         n 
       </mi> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mrow> 
       <mo>
         〈 
       </mo> 
       <mi>
         P 
       </mi> 
       <mo>
         〉 
       </mo> 
      </mrow> 
      <mo>
        × 
      </mo> 
      <msup> 
       <mn>
         2 
       </mn> 
       <mrow> 
        <msub> 
         <mi>
           I 
         </mi> 
         <mi>
           n 
         </mi> 
        </msub> 
       </mrow> 
      </msup> 
      <mrow> 
       <mo>
         [ 
       </mo> 
       <mrow> 
        <msup> 
         <mtext>
           m 
         </mtext> 
         <mn>
           3 
         </mn> 
        </msup> 
       </mrow> 
       <mo>
         ] 
       </mo> 
      </mrow> 
     </mrow> 
    </math>(24)</p>
   <p>P is in Pascals, with units:</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mrow> 
       <mo>
         [ 
       </mo> 
       <mi>
         P 
       </mi> 
       <mo>
         ] 
       </mo> 
      </mrow> 
      <mo>
        = 
      </mo> 
      <mrow> 
       <mo>
         [ 
       </mo> 
       <mrow> 
        <mrow> 
         <mtext>
           N 
         </mtext> 
         <mo>
           / 
         </mo> 
         <mrow> 
          <msup> 
           <mtext>
             m 
           </mtext> 
           <mtext>
             2 
           </mtext> 
          </msup> 
         </mrow> 
        </mrow> 
       </mrow> 
       <mo>
         ] 
       </mo> 
      </mrow> 
      <mo>
        = 
      </mo> 
      <mrow> 
       <mo>
         [ 
       </mo> 
       <mrow> 
        <mn>
          1 
        </mn> 
        <mtext>
            
        </mtext> 
        <mrow> 
         <mrow> 
          <mtext>
            Joule 
          </mtext> 
         </mrow> 
         <mo>
           / 
         </mo> 
         <mrow> 
          <msup> 
           <mtext>
             m 
           </mtext> 
           <mtext>
             3 
           </mtext> 
          </msup> 
         </mrow> 
        </mrow> 
       </mrow> 
       <mo>
         ] 
       </mo> 
      </mrow> 
     </mrow> 
    </math>(25)</p>
   <p>The average atmospheric pressure is</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mrow> 
       <mo>
         〈 
       </mo> 
       <mi>
         P 
       </mi> 
       <mo>
         〉 
       </mo> 
      </mrow> 
      <mo>
        = 
      </mo> 
      <mn>
        101325 
      </mn> 
      <mtext>
          
      </mtext> 
      <mrow> 
       <mtext>
         N 
       </mtext> 
       <mo>
         / 
       </mo> 
       <mrow> 
        <msup> 
         <mtext>
           m 
         </mtext> 
         <mtext>
           2 
         </mtext> 
        </msup> 
       </mrow> 
      </mrow> 
     </mrow> 
    </math>(26)</p>
   <p>The experiment involves ID cards inscribed with information on a non-reflective surface.</p>
   <p>The area of the information on the card is 5.5 mm × 2.5 mm = 13.7 mm<sup>2</sup> = 13.7 × 10<sup>−</sup><sup>6</sup> m<sup>2</sup>.</p>
   <p>The energy within one bit is determined as follows. Recall Equation (24):</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         E 
       </mi> 
       <mi>
         n 
       </mi> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mrow> 
       <mo>
         〈 
       </mo> 
       <mi>
         P 
       </mi> 
       <mo>
         〉 
       </mo> 
      </mrow> 
      <mo>
        × 
      </mo> 
      <msup> 
       <mn>
         2 
       </mn> 
       <mrow> 
        <msub> 
         <mi>
           I 
         </mi> 
         <mi>
           n 
         </mi> 
        </msub> 
       </mrow> 
      </msup> 
      <mrow> 
       <mo>
         [ 
       </mo> 
       <mrow> 
        <msup> 
         <mtext>
           m 
         </mtext> 
         <mn>
           3 
         </mn> 
        </msup> 
       </mrow> 
       <mo>
         ] 
       </mo> 
      </mrow> 
     </mrow> 
    </math>(27)</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         E 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mn>
          101325 
        </mn> 
        <mtext>
            
        </mtext> 
        <mrow> 
         <mtext>
           N 
         </mtext> 
         <mo>
           / 
         </mo> 
         <mrow> 
          <msup> 
           <mtext>
             m 
           </mtext> 
           <mtext>
             2 
           </mtext> 
          </msup> 
         </mrow> 
        </mrow> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        × 
      </mo> 
      <mn>
        2 
      </mn> 
      <mrow> 
       <mo>
         [ 
       </mo> 
       <mrow> 
        <msup> 
         <mtext>
           m 
         </mtext> 
         <mn>
           3 
         </mn> 
        </msup> 
       </mrow> 
       <mo>
         ] 
       </mo> 
      </mrow> 
     </mrow> 
    </math>(28)</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         E 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mn>
          202650 
        </mn> 
        <mtext>
            
        </mtext> 
        <mrow> 
         <mtext>
           N 
         </mtext> 
         <mo>
           / 
         </mo> 
         <mrow> 
          <msup> 
           <mtext>
             m 
           </mtext> 
           <mtext>
             2 
           </mtext> 
          </msup> 
         </mrow> 
        </mrow> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        ∗ 
      </mo> 
      <mrow> 
       <mo>
         [ 
       </mo> 
       <mrow> 
        <msup> 
         <mtext>
           m 
         </mtext> 
         <mn>
           3 
         </mn> 
        </msup> 
       </mrow> 
       <mo>
         ] 
       </mo> 
      </mrow> 
     </mrow> 
    </math>(29)</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         E 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mn>
          202650 
        </mn> 
        <mtext>
            
        </mtext> 
        <mtext>
          N 
        </mtext> 
        <mo>
          ⋅ 
        </mo> 
        <mtext>
          m 
        </mtext> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        ∗ 
      </mo> 
      <mn>
        1.37 
      </mn> 
      <mo>
        × 
      </mo> 
      <msup> 
       <mrow> 
        <mn>
          10 
        </mn> 
       </mrow> 
       <mrow> 
        <mo>
          − 
        </mo> 
        <mn>
          5 
        </mn> 
       </mrow> 
      </msup> 
      <mtext>
          
      </mtext> 
      <msup> 
       <mtext>
         m 
       </mtext> 
       <mn>
         2 
       </mn> 
      </msup> 
     </mrow> 
    </math>(30)</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         E 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mn>
        277630.5 
      </mn> 
      <mo>
        × 
      </mo> 
      <msup> 
       <mrow> 
        <mn>
          10 
        </mn> 
       </mrow> 
       <mrow> 
        <mo>
          − 
        </mo> 
        <mn>
          5 
        </mn> 
       </mrow> 
      </msup> 
      <mtext>
          
      </mtext> 
      <mtext>
        N 
      </mtext> 
      <mo>
        ⋅ 
      </mo> 
      <mtext>
        m 
      </mtext> 
     </mrow> 
    </math>(31)</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         E 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mn>
        2.78 
      </mn> 
      <mtext>
          
      </mtext> 
      <mtext>
        J 
      </mtext> 
     </mrow> 
    </math>(32)</p>
   <p>or</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        E 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mn>
          1 
        </mn> 
        <mtext>
            
        </mtext> 
        <mtext>
          bit 
        </mtext> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        = 
      </mo> 
      <mn>
        2.78 
      </mn> 
      <mtext>
          
      </mtext> 
      <mtext>
        J 
      </mtext> 
     </mrow> 
    </math>(33)</p>
   <p>Compare this to the Landauer limit <xref ref-type="bibr" rid="scirp.146197-1">
     [1]
    </xref>:</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        E 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mn>
          1 
        </mn> 
        <mtext>
            
        </mtext> 
        <mtext>
          bit 
        </mtext> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        = 
      </mo> 
      <mn>
        4 
      </mn> 
      <mo>
        × 
      </mo> 
      <msup> 
       <mrow> 
        <mn>
          10 
        </mn> 
       </mrow> 
       <mrow> 
        <mo>
          − 
        </mo> 
        <mn>
          21 
        </mn> 
       </mrow> 
      </msup> 
      <mtext>
          
      </mtext> 
      <mtext>
        J 
      </mtext> 
     </mrow> 
    </math> (34)</p>
   <p>This is an example of an experimental study that provided direct evidence supporting Landauer’s principle at the single-bit level. Clearly, our results greatly augment their evidence, with much more efficiency.</p>
  </sec><sec id="s9">
   <title>9. Conclusions</title>
   <p>The central focus of our research was to establish a direct, physical, non-stochastic interpretation of information. Our insight was to show that, essentially, image information is not statistical, but an exact measure in a vector space of countable volume or cuboids, derived from multi-dimensional projections, which are both physical and mathematical. Nonetheless, statistical measures, like entropy can give accurate results for the magnitude of information.</p>
   <p>The experimental observation of macroscopic deformation, coupled with the theoretical demonstration of cuboid volume generation through floor functions, suggests a novel physical phenomenon and a significant improvement over computer processing limits due to Landauer’s Principle. The proposed framework, involving geometric quantization and multi-dimensional space, provides a potential foundation for understanding this interaction.</p>
  </sec><sec id="s10">
   <title>10. Future Work</title>
   <p>Future studies will focus on the quantitative measurement of the bending deformation and cuboid dimensions, allowing for a detailed analysis of the relationship between the cuboid volumes and the bending. An investigation of the spatial frequency and its correlation with deformation will be conducted. The effect on other materials will be explored, and a more comprehensive theoretical model incorporating the observed phenomena will be developed. This model will refine the mathematical description of the force, and further experiments will characterize its properties and limitations. Exploration of the connection between this force and existing theories of gravity and quantum mechanics will be undertaken, and the impact of different information patterns on the force’s behavior will be examined.</p>
  </sec>
 </body><back>
  <ref-list>
   <title>References</title>
   <ref id="scirp.146197-ref1">
    <label>1</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Bérut, A., Arakelyan, A., Petrosyan, A., Ciliberto, S., Dillenschneider, R. and Lutz, E. (2012) Experimental Verification of Landauer’s Principle Linking Information and Thermodynamics. Nature, 483, 187-189. &gt;https://doi.org/10.1038/nature10872 
    </mixed-citation>
   </ref>
   <ref id="scirp.146197-ref2">
    <label>2</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Halmos, P.R. (1960) Naive Set Theory. Van Nostrand Company.
    </mixed-citation>
   </ref>
   <ref id="scirp.146197-ref3">
    <label>3</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Houston, L.M. (2023) Projections between Euclidean Volumes with Information Due to Spontaneous Symmetry Breaking. Journal of Applied Mathematics and Physics, 11, 3519-3528. &gt;https://doi.org/10.4236/jamp.2023.1111223 
    </mixed-citation>
   </ref>
   <ref id="scirp.146197-ref4">
    <label>4</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Barzegar, A., Shafiee, A. and Taqavi, M. (2020) “It from Bit” and Quantum Mechanics. Foundations of Science, 25, 375-384. &gt;https://doi.org/10.1007/s10699-019-09644-1 
    </mixed-citation>
   </ref>
   <ref id="scirp.146197-ref5">
    <label>5</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Busch, P., Grabowski, M. and Lahti, P.J. (1995) Operational Quantum Physics. Springer-Verlag. &gt;https://doi.org/10.1007/978-3-540-49239-9
    </mixed-citation>
   </ref>
   <ref id="scirp.146197-ref6">
    <label>6</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Houston, L.M. (2024) Imaging n-Dimensional Spaces within m-Dimensional Spaces: An Extension of Hinton’s Method. Applied Physics Research, 16, 209-214. &gt;https://doi.org/10.5539/apr.v16n1p209
    </mixed-citation>
   </ref>
  </ref-list>
 </back>
</article>