← Mathematical compendium

Published equation contexts

log⁡4(49)=log⁡2(7)≈2.8074log⁡4(48)≈2.7925\log_4(49) = \log_2(7) \approx 2.8074 \qquad \log_4(48) \approx 2.7925

Why this formula appears here

Because a genuine tensor decomposition composes with itself, the rank number converts directly into an asymptotic cost exponent, and DeepMind’s own paper does not spell out what that conversion yields — this is the article’s own arithmetic, shown rather than asserted. Applying Strassen’s 2×2 trick twice to reach 4×4 gives an algorithm whose cost scales as nlog⁡27n^{\log_2 7} ; applying it k times to reach a 2^k ×\times 2^k matrix costs 7^k multiplications for n = 2^k , the same exponent however you slice the recursion. A genuine rank-48 4×4 decomposition, applied the same way, would scale as nlog⁡448n^{\log_4 48} instead: log⁡4(49)=log⁡2(7)≈2.8074log⁡4(48)≈2.7925\log_4(49) = \log_2(7) \approx 2.8074 \qquad \log_4(48) \approx 2.7925. The gap is small — about 0.015 in the exponent, on the order of…

Read the full article-specific guide →

How to interpret it

Its accuracy depends on the assumptions and range of use described in the article. Read it with the definitions, units, and assumptions supplied by the article.

Research cited beside this formula

Published contexts (1)

A symbol can carry a different meaning in another article. Each occurrence keeps its own guide and term definitions.

log⁡4(49)=log⁡2(7)≈2.8074log⁡4(48)≈2.7925\log_4(49) = \log_2(7) \approx 2.8074 \qquad \log_4(48) \approx 2.7925

Equation 6 · Technological Evolution

Mathematicians Finished the Job After an Evolutionary Search Beat 56 Years of Human Proofs

This equation gives an approximation: it relates the quantities while allowing an approximation.

Because a genuine tensor decomposition composes with itself, the rank number converts directly into an asymptotic cost exponent, and DeepMind’s own paper does not spell out what that conversion yields — this is the article’s own arithmetic, shown rather than asserted. Applying Strassen’s 2×2 trick twice to reach 4×4 gives an algorithm whose cost scales as nlog⁡27n^{\log_2 7} ; applying it k times to reach a 2^k ×\times 2^k matrix costs 7^k multiplications for n = 2^k , the same exponent however you slice the recursion. A genuine rank-48 4×4 decomposition, applied the same way, would scale as nlog⁡448n^{\log_4 48} instead: log⁡4(49)=log⁡2(7)≈2.8074log⁡4(48)≈2.7925\log_4(49) = \log_2(7) \approx 2.8074 \qquad \log_4(48) \approx 2.7925. The gap is small — about 0.015 in the exponent, on the order of…

Equation guide → · Article →