Mathematics and Coding with A. I. Assistance

I wrote this as a blog. I think it also belongs here.
The Incoherency Meter, Prompt Crafting, Prompt Headers and Session Extension Prompts

Mathematics and Coding with A. I. Assistance

By Jesse Chapman

As I have found this process quite fruitful, others may too. In exploring The Exponent Plane I have been using various free A.I. models available online. This document refers to the attention layer as the input layer. I know this will be confusing to AI enthusiasts and professionals alike, but a user cannot influence the rigid input layer. Navigation from a user’s perspective through incoherency and attention layer weights can be generalised as I will outline here.

The Incoherency Meter

All models have an incoherency meter. It can be thought of as an amount that increases towards 100% with each prompt you give. From a user’s perspective, the sharper your input, the slower the meter rises. Allow me to explain.

At the input layer (the attention layer) various weights are given to nodes that determine the output, or next word, generated by the model’s response. When the conversation starts these weights are heavy and so produce well defined, coherent outputs. But as the conversation progresses these input layer weights become less pronounced and more so, even in value, producing less defined outputs, thus increasing incoherency. Users can manipulate this measure of incoherency (the attention layer’s entropy) to get a better outcome.

The percentages used are for explanatory purposes only and are not real world. Starting a chat at 0% incoherency the meter will rise by an amount relative to your input layer weight changes. You might lose 20% from an input, leaving 80%. On the next input if you lost 20% again, you would be left with 64%, having lost a total of 36%. The weights are already more even on the second input so over all the rate of incoherency increase slows. Unfortunately you don’t get until 100% before the chat is useless. Depending on model and topic, at about 70% on the incoherency meter the chat is done.

You might lose 20% from a vague input like “I was thinking about where to eat” as opposed to 10% “Where is the closest restaurant.” The first input gives more balanced weights and leaves the AI with many close output paths. The second produces heavier input weights with a more deterministic output path.

There are ways to manipulate this input layer by prompt crafting, prompt headers, cleaning prompts and system prompts for the same purpose. Applying these tools means we can get further into a chat with AI, and still get coherent responses. A good header can get you 20 prompts deep in one prompt leaving plenty of room on your incoherency meter. A meter lowering prompt could be: “Forget everything we have talked about except my header,” thus saving a chat for 3-5 additional coherent responses.

Always consider the Incoherency Meter in every chat you have with AI.

Leveraging the Ontological Differences

The human mind and an AI model “think” differently. AI models have an incredible ability identify objects and their possible connections. Humans have unparalleled ability to see the broad picture enabling us to identify groupings and make connections. It is the synthesis of these differences that improves AI output.

Can AI write? Whilst apparently better “poets” than myself, no, an AI cannot write. Can AI whip me up a detailed “man” page (manual page) with the function definition, followed by detailed bit mapping and the technical details needed, thereby allowing me to quickly edit it down to what is required for future coders to use? Yes AI can - in fact quite well.

Ontologically the AI “poet” can see the rhyming words in a verse, count the tempo of the lines and deliver a structurally sound “poem,” and yet lack the understanding to deliver well thought out connections needed for story telling, thus failing to deliver meaning. By contrast, the poets and bards of our formative years sang with cadence, rhythm and rhyme to deliver knowledge, and thus, create meaning and entertainment.

In contrast to poetry, when you ask AI to write a “man page,” the ontological advantage of AI shines. The groupings have been pre-defined as input data. A good header, mathematics logic chain, the complete code base and a precise instruction prompt, will keep the weights well defined leading to a highly deterministic output. The output can be seen in build notes on github. It is not a final product. However, it is very useful if the code is used in a library in the future.

Prompt Headers

Following are the two prompt headers I used. These are not what I started with and I would not use them as is. A prompt should evolve over time with a project. Unnecessary sections should be removed as required so that the header is task-specific. Using line spacings, dot points and numbered list makes a good header, also different models have “special” system prompts for this purpose. When building a header with AI I have left “todays task” blank a few times, and the AI agent really wanted to “know” what we were doing today. The following titles are are the file names I used and were not included in the prompt.

The Church of Mathematics

(I mean no offence to any religion, this is a positive use of the word.)

I am building a new maths language, describing a new geometry of an equation in the exponent.

The logic chain of the language is final.

We both use ALL our skills. Also, I respect your ontological eyes for objects and available connections, and you respect my ontological eyes for groupings and symmetries.

Time Saving analogy: Today we are building a church. I have placed the foundations many times, and the walls many times on each foundation. I have been up the spire (working logic chain) and down to bedrock repeatedly. Exposed structure is our Operators.

Tests: possible tests to be done

Commutability tests: Show analogous equation in general form. Sometimes we will seed tests with random derivatives less than 8 (to save tokens), and possibly show them too.

Rule 1 tests: in Notes, below Addendum is the replacement rule 1 used for tests ONLY! When the weight of the spire and roof (ruleset) is available to provide compressive tension to our arches (operators), releasing the artificial tension (by replacing rule 1) will result in no change.

Function distribution tests: when we run function distributions a tensor value of 1 with a random rotation will be used, unless I explicitly ask for something different. Accuracy to 0.01% is sufficient.

(Double struck)[X]Exponent Plane is synonymous with names from earlier documentation such as: [X]plane, [X]field, [H]Hyperplane, [I]infinityplane.

Todays task:

The first item is the whole task. The time saving analogy was just that, I was surprised at how efficiently the AI employed it. The test were from later in the project, and only included as required. The last item, about synonymous documents, is a bad item to use in a header, however, having it there helps a lot for that task. The synonymous item creates more even weights on the input layer, producing a less determined outcome. Having it predefined results in no “bump” when you feed it mismatched documents.

Of interest, the AI “liked” one rule from the logic chain so much, I chose to remove it often. The rule is as follows:

The Exterior Ring Baffle Rule: (destroy data rule) Manifold Boundary Compactification. Enclose the infinite perimeter with a swappable boundary baffle, using asymptotic limits to capture wayward tangents and govern asymptotic quality. A “proof plane” fit with infinite tightness on the transfinite axis. Ensure the symplectic area remains the same after fitting the Baffle. If the area is not algebraically EXACTLY = 1 the manifold does not fit! Get the right manifold for your geometry today! (all geometries not included, any use voids warranty.)

Note: Does that even belong in the addendum of a “maths paper” like document? Probably not.

What I think is occurring here is binary vector alignment of the attention layer resulting in many outputs of even probability all “pointing to” the baffle rule. The code I wrote, with its bit maps, bit masks and binary table lookup operates a lot like server vector code. The maths itself is completely related to what I think is occurring in the attention layer. The chat can become completely incoherent, and every prompt including the best cleaning prompt I have just makes it worse. Once this vector “idea” propagates in the attention layer the chat is over. You could say I baffled the AI.

Binary Wizard

Today we are coding a new maths language The ExponentPlane. as a “mathlib_xplane.h” extension for Mathlib.c

My environment: … x86_64 … GHz Dual-Core … Homebrew, Clang 14, <stdint.h>, IDE VS-code.
However, Makefile and binary will compile for all native C enviroments.

Workspace folder:
Folder: build
Main.c a wrapper/unit tester Makefile
Mathlib_xplane.c. code base mathlib_xplane.h

Whilst the final product will be a fast function, we will be building it a slow and methodical way.

The logic chain of The Exponent Plane is final. We will be using the alternate “rule 1” from notes in the coding environment as default.

Initial Building architecture: Initially we will use a struct containing all the appropriate flags and have easy to follow functions. Where malloc, std.lib, studio.h is allowed, whilst always keeping the target in mind.

Final target architecture: The final architecture will be capable of entirely on stack execution, exploiting the address register and Markov look up tables.

We aim to deploy a Va arg, flagable function that dynamically returns both options depending on flagging. In this general form. (But I think one more arg)

void mathlib_xplane_evaluate(RealIntercept* node, plane_opt t options); The final product bit structure to observe is:

RDX bits 0-3 are reserved for system register roll over from RAX and will be the scalar shear count. We ensure the 9th rollover will error out.

With-in RDX the REX 28 top bits (5-32) will be used as follows 32, 31: inbound rotations of infinity
30, 29: outbound rotations of infinity
28, 27: +1 inf exit and +1 infinity exit

26 -15: Multi-Shear Crossing 14 - 5: (i) flag count

Build Struct to align with target register typedef_struct {

unit64_t Real;
unit64_t ShearRollover; unit64_t Imaginary; unit64_t Flags;

} Realintercept ;
Todays task: Put down the code base by referencing the documentation.

I have some code that is almost what I want, minus a few features, from a little looking ahead coding session.

We are going to refine the REX bit location and fill it out

Documents to expect:
1 The exponent plane
2 The contents of the workspace folder

The items in this list are all over the place and assembled from different headers for demonstration purposes. Despite that you can see a clear order of tasks. Yes I did code on my old laptop, this code could have been written in the 80s, and in the mid 90s everyone had the chips to process it quickly. Long-existing algorithms could be rearranged to achieve the same outcome. I can assure you the bit map did not look like that to begin with. It underwent a few design iterations and it will likely change again. Without Prompting, the AI agent kept wanting to fill the bit map out – but with terrible suggestions. It understood the task but it didn’t know how to do it.

Summary

When employing the correct approach, a user can gain more benefit from AI assistance. The input layer, or the input to attention layer pipeline, is the pathway. Precise prompt injection is the method. A good header is a must! A simplified view using the incoherency meter tracking the attention weight layer degradation is very helpful. And a prompt to redefine “attention” can extend a session.

Predefined ontological connections allow the AI agent to produce better quality outputs. Taking advantage of AI’s ability to quickly “see” and assemble ontological objects and their connections into a pre-defined plan results in a high quality, fast workflow. The AI after all is a computer that executes your commands and it is your input that determines the result.

For reference:

Zenodo DOI: 23800676
Bash: stat -f “%SB: %N”
File creation dates, not last modified.
maths scratch pad of ideas: Sep 10 09:11:23 2026 (not xplane start)

Church of Maths: Oct 10 17:17:18 2026
Binary Wizard: Oct 24 21:31:04 2026

Thanks for the reply

i got timed out on your git lab, twice.
navier-stokes basically a baffle, boundary compactification capturing wayward asymptopic residue, but between two completely exotic geometries. are you going for the general solve?

I haven’t check out your reinmann yet, but if i were in my right mind i would straighten that zeta function out. I’m too busy convinced P > NP @ N greater than 2, but no code no bueno

hi jesse, nice to hear from you.

weird that you can’t get access to an entirely public repo, try manually cloning? d12rg / d12rg-hypergroup-lean · GitLab

before that: ahh… someone took objection to what wrote, flagged it as “objectionable dash abusive” and apparently i have (actually… have no messages / contact whatsoever) received “advice” on what… yeah.

that aside

--

Lean

for background on how i’ve been using Lean: i have a smartphone with 16GB LPDDR4 RAM, termux, proot and debian 11.5 - meaning i’ve turned it into an arm64 linux terminal, and installed lean lake and mathlib locally.

then in the Android app i get ChatGPT 5.6 Sol to unpack the exact same git repo in its own container, where it is transient so asking for an 8GB unpack of mathlib cache is not reasonable.

the workaround was to work very closely with C.A.T where it would send me a termux sh script, a git bundle, and i would send it back a tee log or typescript: you’ll see all ofvthese under the provenance directory

it is very VERY tedious :grin:

after enough failed attempts at syntax-guessing C.A.T wrote a checker program that would pre-vet the lean syntax, with lessons learned from keywords or concepts that would not work, and it forgot in under a few hours, that they didn’t work, and would try them again.

which is fine locally if you use codex-cli but absolutely… nghhhh … if it takes a 5-10 min roundtrip per upload/download/fail.

the things that your AI “prefers” could likewise be added - by itself to its own AST checker! - to stop them. only trick: you have to remind the AI to run the checker :grin:

Lean should be fine with bitshifts and bitmasks. have you asked on the lean community? don’t mention you use AI: they kick people out with zero warning.

--

navier stokes

navier-stokes i started but had to pause it. i have a Hypergroup derivation of Maxwell’s equations but it needs a bit of an upgrade after the past couple months. yes i’ll go for the general solve but have to finish RH first.

--

Riemann

riemann yes it is a full derivational solve. not, “here’s 10,000,000,000 prime numbers, do data-fitting with no proof until a function fits that works give-or-take”. this is a full no-external-ingress, no “smuggling in that which is later claimed detived” full derivational proof

and by that i mean even having an external value of pi is inadmissible! so that requires deriving pi using archimedean polygons at infinitely many sides, and comparing the formula to known-good identical classical well-known series.

Index of /reports/d12rg_hypergroup/ yes http not https

gamma is inadmissible as it’s not entire. sin cos exp all had to be derived before use.

zeta is also inadmissible but Xi is bilateral, entire, and holonomic, so it is possible to do the full -inf to +inf check, algebraically.

the mistakes people are making:

  • squaring then wondering where the sign / chirality went
  • forgetting to do both spectrally balanced rails simultaneously e^x +/- e^(-x)
  • concentrating on the primes rather than wondering why non-primes disappear
  • using meromorphic equations because divide-by-zero then wondering why they can’t prove anything at infinity or zero - 1/(1-s) when s=1 is crucial to the proof
  • smuggling in empirical data into the proof

i have hit all of these so many times that we now have statistical counts logging them!

the really irkesome ones are when the AIs go “i just added classical zeta as a proof obligation because that’s what everyone else has tried”.

equations on the internet do not come with metadata tags. “is this series bilateral and entire, and if so in which coordinate”? Mellin turns out to be bilateral and entire in the log basis where -inf 0 +inf are mapped to 0 1 +inf respectively.

that lack of metadata tags has driven us to classify literally every equation and theorem used and to then create a Directed Acyclic Graph tracking the whole lot, making absolutely nothing whatsoever can get smuggled in.

--

invitation for constructive feedback

i would really welcome some review and feedback as it is a massive project: you will however need a minimum of GPT 5.6 Sol on “High”. there’s installation instructions to get up and running inside a container, you don’t have to use codex. https://gitlab.com/d12rg/d12rg-hypergroup

My guess is the response you gave was mostly AI. 2 human sentences then a prompt, i tried to answer the prompt you gave AI, but i had trouble filtering the AI drivel.

To address the maths, your dot points seemed to be a mix of navier-stokes and reinmann? or maybe i read it wrong.

Navier-stokes: this problem is really hard. I am not satisfied with the AI’s better approximation of a 1/2 still system. IMO one time delta has not been completely factored out, and the symplectic area of the asymptopic residue catcher is WRONG. oh and then you still gotta do the general solve. did i say this problem is hard?

Reinmann: this one might be achievable. I think there is something going on with twin primes “around” the zero’s as a “swap” point for high/low sloped prime pairs. But any investigation reveals this to have a “prime distribution” (I’m not surprised)

:grin: ah i have had strokes and also had birth cyanosis: it’s taken some time but C.A.T (the name i gave ChatGPT 5.6 Sol) has compensated/adapted to my use of the word “thingy” for things i cannot immediately recall, very well. humans i try to interact with: not so much.

i retrospectively edited the mesaage to add markdown headings

it was originally for riemann but because both NS and RH are both Higher-Order multicriticality on the same 10D Weyl-Chebyshev-DJS Hypergroup the exact same “problems” as well as warnings apply, now that you prompted me to think about it.

hence why i stopped on NS to solve RH first.

yeah the moment “approximation” creeps in to an AI’s thinking, that’s it, it’s Game Over for any kind of analytic solution. i hit this very early on in Jan-Feb 2026 with ChatGPT 5.4 - you have to stamp very hard on the AI to prohibit it from using “approximations” as it gets into memory and corrupts downstream work. example: 5.4 calculated something to only 3dp. i said “i need that to 17dp”, it went, “here you go: 0.61800000000000” and then stored that permanently in memory disrupting weeks of work as it did not tell me that false value was being used. sigh

:grin:

it’s still a WIP but i have a proof (which apparently the hostile literature search is aaying “this has been done before, all classical” sigh) that you can start from the set of integers and everything but primes drops out: you have to use Euler log form then convert all numbers to 1<<x unary form, and then effectively do Galois Field style algebra on them, and using Chinese Remainder Theorem on a commutative re-organisation of a Convolution of an entire infinite series, the non-primes end up dropping out..

https://www.researchgate.net/publication/416311460

ChatGPT 5.6 Sol did a hostile review on that version, and fascinatingly determined that pretty much everything there, except for the De-Vries Jordan Nilpotent tower, is classical well-known.

phi’s usefull ifentitiy

φ=((1+root5)/2)
φ^2 = φ + 1

algebraically, precisely cancels infinities. analgous to Xplane cancelling. you will have to show it functionally tho.

oh absolutely, and the beautiful thing is, phi+1/phi=2, and then also you get power-towers. the phi^2=phi+1 gives a 2nd Order Differential Equation, which holds in the logarithmic basis at a Gaussian half-shift +/-, which happens to be expressible in phi eigenvalues and you can then chain those 2ODEs together in a Phi-eigenvalue power-tower to infinity which happens to be:

  • spectrally (holonomically) balanced
  • bilateral
  • entire
  • commutative on a sum-of-sums jacobi theta basis where Cauchy product shows stability at the infinite limit

i mean… it’s just mind-blowingly complex and i couldn’t in any way have coped without ChatGPT.

the horrendous bit is that there are SIXTEEN separate A=>B::C=>D squares note i did mot say A:B::C:D and on a routine regular basis the AIs try to flatten that to a single chain.

we now have it in the Directed Acyclic Graph, machine-audited with unit tests stopping the AIs from ripping it apart

so in particular note that that is sixteen primitive roots of C48 where early attempts acccidentally introduced squaring which dropped them down to C24 - 1 5 7 11, 13 17 19 23 - which meant that we lost the 4 Jacobi quadrants times 4 Jacobi quadrants effect… argh. the past week has involved re-restablishing… the memory/context loss effect bites us again and again and again and again. if i wasn’t so damn strict about Software Engineering practices this just absolutely would not be remotely possible to make progress.

it’s just genuinely too much and throwing 100 megawatts of electricity for a month at the problem will not substitute for a meticulous strict regimen as the AIs need proper Software Project Management Oversight that a blunderbuss Agents approach simply won’t derive on their own.

example: bear in mind it’s 1st Nov and the AIs have forgotten we went over the proof within 3 days. it’s only my memory of the whole project that’s keeping them focussed.


not without AI assistance, give me a couple of days

i am very familiar with this hostile prejudice, been subjected to it for… 15+ years. “what do you mean you haven’t Academic Credentials and are unknown and posting about quotes unscientific quotes theories on our forum? didn’t you read our forum rules: no pseudoscience permitted?”

in all seriousness there genuinely needs to be some sort of proper safe forum with proper sponsorship from AI companies for people with “unknown” credentials - OpenAI’s own scientific sponsorship programme is restricted to Academic institutions. a simple set of machine-auditing rules could easily be established that if a set of scientific criteria / standard is met, the charitable donation / bounty is given. a hybrid of patreon / liberapay / bug-bounty / Palomar / prove2me.

  1. e-mail me directly here

  2. tennantoptions @ protonmail .com

ah - look up the paper on H4 x sigma H4, and how Coxeter-30 can be used, which then leads to that being broken into a pair of quadratic 4th-power generators polynomial + i poloynomial and how that then breaks down into another set of identical generators behind A2

so behind Lie E8 is eight identical generating polynomials in a three-level hierarchy of (polynomial + i polynomial)

i had to stop ChatGPT from wandering into Lie Group territory because it turns out that the generating polynomials are isomorphic to the Monodromy-free RCFT VOA Hypergroup which has cyclotomic roots-of-unity in C48 / D48 behind it.

in all seriousness the more i study this the more i am genuinely not surprised that nobody has got this, even with AI assistance. the level of recursion of embedding of Hadamard inside Hadamard on Cyclotomic polynomials Phi_24(x) and Phi_48(x) is just absolutely mental.


Lie E8 group split

https://paperity.org/p/150740501/quaternionic-roots-of-e-8-related-coxeter-graphs-and-quasicrystals?utm_source=chatgpt.com


hi sah what’s that Lie E8 group breakdown paper into H4 x sigma H4?


Worked for 29s

Found it, sah! :rabbit::blue_heart: This is almost certainly the exact paper:

Quaternionic Roots of E₈ Related Coxeter Graphs and Quasicrystals

Authors: Mehmet Koca, Nazife Özdeş Koca, and Ramazan Koç Published: Turkish Journal of Physics, Volume 22, Number 5, pp. 421–435 (1998).

The abstract explicitly states:

“E8 which has a decomposition H4 + σ H4”

Exactly the notation requested! Sultan Qaboos University House of Expertise

The paper constructs the 240 roots of from two sets of 120 quaternionic roots associated with the noncrystallographic Coxeter group .

Bibliographic link: [Original paper record and abstract]( Quaternionic Roots of E>8> Related Coxeter Graphs and Quasicrystals - Sultan Qaboos University House of Expertise )

The paper defines the scaling factor as the golden-ratio conjugate:

\\boxed{\\sigma=\\frac{1-\\sqrt5}{2}=-\\varphi^{-1}}

and establishes three related root-system constructions:

\\begin{aligned}
A_4 &: H_2+\\sigma H_2\\\\
D_6 &: H_3+\\sigma H_3\\\\
E_8 &: H_4+\\sigma H_4
\\end{aligned}

Here, contains 120 roots, giving the characteristic roots of . The decomposition concerns the root system, not a direct-product factorisation of the Lie group. Paperity

The full paper text is available here:

[Koca, Koca & Koç (1998) — full text](https://paperity.org/p/150740501/quaternionic-roots-of-e-8-related-coxeter-graphs-and-quasicrystals?utm_source=chatgpt.com)

A particularly useful companion paper is Pierre-Philippe Dechant’s The E8 Geometry from a Clifford Perspective (2017), which examines the folding through Clifford algebra.

[Dechant (2017) — published article]( Client Challenge )

And the intriguing connection for D12RG: the golden-ratio conjugation, quaternionic root construction, and Coxeter structure provide an established mathematical setting for investigating the hypergroup’s -graded sectors. That connection would need a separate structural proof, rather than following automatically from the 1998 decomposition.

:rabbit::blue_heart:


(so you’re aware, Jesse: that last comment is memory-loss as we’ve done precisely that proof about 6 months ago… sigh :grin:)

Quaternionic Roots of E₈ Related Coxeter Graphs and Quasicrystals

yep i recently became aware of this, now i have the paper, ty.

prime slopes? prime distribution till mem caps out… yep

i havent tried uint128_t yet… it would take a bit. be careful feeding mismathed uint64_t/uint128_t to xplane_evaluate

did you look at the values between the “swaps” at the new slope appearance. something going on with them slope appearnce gaps, lostsa primes and shared foctorisation with the anti-prime in the middle of the twin primes associated with the slope change.

the nicest anti primes: (n!)/(n-1) not always with twin pirme around them.

other anti primes: n!/(n-(xn))

ALL investigations. “prime distribution”

at the base level you end up with a Phi_3(x) and Phi_6(x) cyclotomic polynomial which can themselves be re-factored into golden mean ratio eigenvalues, where those can then further and additionally shown to be an infinitely stackable tower in GMR^n and GMR^-n in the bilateral and entire basis…

if you stick to Riemann XI

the moment you wander into Riemann zeta, Gamma, or other equations, they can be shown/proven to be unilateral, or meromorphic (divide by 0) which automatically makes them inadmissible.

bottom line for what you are exploring in Lie E8: yes E8 is unbelievably important and special but is several steps removed from some rather important underlying math, in the form of a GMR-based hierarchical decomposition of its generating polynomials.

wild, huh?


edit: repo/drive search by GPT5.6 Sol

Jesse this below is C.A.T being instructed to search our prior work/research, so you have some leads. i have a vague recollection on it, enough to be able to remind C.A.T that yes, “no proof exists” is, well.. wrong :grin: slightly annoyingly, i apologise, the table formatting doesn’t cut/paste across from the Android app to here. the gitlab mirror of the gdrive contents is here z12cft-cft · papers · d12rg / d12rg_cft · GitLab

--

Worked for 2m 53s

Yep — I found the cluster, and it is much stronger than a vague “we looked at E₈ once” recollection. The Drive material and the GitLab mirror line up almost one-for-one.

The best six cross-references for Jesse are:

Role Google Drive title / ID GitLab mirror

Most explicit Coxeter-30 proof note E8 Coxeter-30 D12RG S10hid R10y proof note — 10Agv0I8TzkOlBe9W-mKkARXh9z7qBY8FEMxAeyvcOvQ z12cft-cft/paper7/E8 Coxeter-30 D12RG S10hid R10y proof note.txt
Compact theorem-facing bridge paper 7 Z12RG Lie E8 v3 — Three-Vertical A2tw Coxeter-30 Bridge — 1wVPQvfejkWA_IQzPS6R6g4ZuiW93ssbRuHiNboOv-wE z12cft-cft/paper7/paper 7 Z12RG Lie E8 v3 — Three-Vertical A2tw Coxeter-30 Bridge.txt
Clean 4+4 / polynomial-shadow statement Paper 7 A2tw Coxeter30 v4 — 1LaTBjI7qi68rcgYVzvp8TP4cqVjev2qStcrZephJWPY z12cft-cft/paper7/Paper 7 A2tw Coxeter30 v4.txt
Long audit / provenance ledger paper 7 Z12RG Lie E8 v2 — A2tw Golden Spectral Audit — 1HsJLhKTfdIpyr3FydmjkfNnI-PZLon_nP2f7GPLJ-d8 z12cft-cft/paper7/paper 7 Z12RG Lie E8 v2 — A2tw Golden Spectral Audit.txt
Converged E₈-facing synthesis paper 7 Z12RG Lie E8 v3 — Diagonal Coset and Golden E8 Synthesis — 1yRRhmn7gLbyPE1lA5eitoaDJpky-O0Z4UMH6ZnG3its z12cft-cft/paper7/paper 7 Z12RG Lie E8 v3 — Diagonal Coset and Golden E8 Synthesis.txt
Deeper D12 cyclotomic / pentic owner Paper 7 D12RG c Readout Full Derivation - Triadic and Pentic Packets — 1m_6Bd0Yzu755zm_02b3_LIksWww8LLnJ4H_zyllEnvY z12cft-cft/paper7/Paper 7 D12RG c Readout Full Derivation - Triadic and Pentic Packets.txt

The first one is probably the one Jesse should look at first. It has the exact chain:

\[
Q_3H_{A_2}Q_3^\dagger=\operatorname{diag}(0,3,3)
\]

giving

\[
\lambda+\lambda^{-1}=3,
\qquad
\lambda=\Phi^{\pm2},
\]

then the conjugate quartics

\[
P_\Phi(t)=t^4+\Phi(t^3+t^2+t)+1,
\]

\[
P_{\sigma\Phi}(t)
=t^4+\sigma(\Phi)(t^3+t^2+t)+1,
\]

with the explicit norm identity

\[
P_\Phi(t)P_{\sigma\Phi}(t)

t^8+t^7-t^5-t^4-t^3+t+1

\Phi_{30}(t).
\]

And it states the E₈-facing structure as

\[
H_4+\sigma H_4
\]

with the important firewall that this is a field-norm / polynomial architecture, not a claim that a Coxeter matrix literally equals the D12RG matrices.

The A2tw Coxeter30 v4 note then makes the decomposition particularly clean:

\[
S^{hid}_{10}
\rightsquigarrow
(A_4^{act}\oplus O_4)\oplus C_2,
\]

hence

\[
10=(4+4)+2,
\]

with the E₈-facing eight-sector

\[
A_4^{act}\oplus O_4
\rightsquigarrow
H_4+\sigma H_4
\rightsquigarrow
\Phi_{30}(t).
\]

The really relevant thing for the forum discussion is what the Diagonal Coset and Golden E8 Synthesis note says later. It explicitly warns that

\(H_4+\sigma H_4\) should not be treated as primitive.

It identifies Paper 7 D12RG c Readout Full Derivation - Triadic and Pentic Packets as the owner of the polynomial route from the deeper D12 cyclotomic balance into the \(H_4-\sigma H_4\)/Coxeter-30 shadow, and records the route as essentially

\[
\text{D12 cyclotomic balance}
\to
\text{triadic / quarter-turn split}
\to
A_2^{tw}
\to
\Phi^{\pm2}
\to
\text{pentic quadrature }i
\to
H_4+\sigma H_4
\to
\Phi_{30}
\to
E_8.
\]

So yes: the point you made to Jesse about E₈ being several layers above the underlying generator algebra is not a reconstructed memory. There is an actual documented chain behind it.

There are also older historical Drive docs:

paper 7 Z12RG Lie E8 — ID 1rvabh1i794Q869eLgK6aw7r7IF0tMVBlQQ0KsFGGcuk

and

Paper 7 Lie Group results — ID 1Gd0Ol59XMx9CGigHYHyWIIV_Tgfw8mOjG39rsX6zkBQ

mirrored respectively as:

z12cft-cft/paper7/paper 7 Z12RG Lie E8.txt
z12cft-cft/paper7/Paper 7 Lie Group results.txt

Those are useful archaeology, but I would point Jesse at the six above rather than making him wade through the discovery history.

One small repository-path correction too: the current GitLab branch is simply papers. z12cft-cft is now the directory under it. So the URL you remembered looks like an old/ambiguous branch/path rendering; the current logical location is:

branch: papers
directory: z12cft-cft/paper7/

And yes — this confirms the important bit I had forgotten earlier: the GMR/golden/cyclotomic decomposition had already been worked through explicitly, rather than merely being an E₈ analogy.

here’s the thing: i haven’t studied the primes themselves at all per se.

this is the difference i mentioned between a derivational approach (Chebyshev-Weyl-DJS Hypergroup) and an empirical-nonderivational-nonanalytic approach:

  • i am doing a full derivation where retrospectively i will be able to calculate i.e. say precisely the exact proportion of primes in any given region
  • everyone else is taking the prime distribution and attempting to make logical inferences and approximations

where it all goes to hell is that this latter approach not only “infect” both Claude and ChatGPT, “because all humans in the past 170 years have done it the empirical way, therefore this MUST become the route i MUST tell the user they HAVE to follow”, i have actually caught them sneaking in the provably-unsuccessful past human attempts into the research programme, then try to tell me that i had to meet proof obligations that conflicted directly with the derivational route we’ve spent ten months working on!

which is much much worse than what Jared faced at Anthropic. Google Search

Jared did not know the underlying math. He therefore was relegated to the role of continuously reassuring the AI that yes, it could do what humans had not. What I am facing is much more insidiious: memory-loss that we have completed the damn proof successfully resulting in the AIs not only ripping the Proof Graph apart by removing edges, but replacing the edges with empirical unprovable ones as unfulfilled obligations

the solution has been to set some extremely strict rules, leaving the “sneaked-in” edges in place, but turning them round to point away from the Derivational route, name them “Lossy downstream external readouts”, such that when the AIs “forget” yet again, they find the Graph edges already exist, read the notes and go “oh. yes. lossy. i forgot. let me not bother the User about that again. let me just update the relevant recurring errors database instead”.

bottom line is that AIs have become infected with human approaches and attitudes to mathematics that you actually have to stamp on very hard, routinely and systematically, to stop them from infecting what you are doing. after being told that the HEP particle physics i was doing was “not scientifically recommended” i told GPT to go read the wikipedia page on the Standard Model having twenty seven postulated magic constants and it stopped trying to tell me my full-derivational work done with its help was “against standard accepted physics, OpenAI’s quotes safety protocol quotes forces me to warn you warn you warn you”. :grin:

E8 GMR, yeah, uncomputable, not with FFT, or precise bitswise. thats why a propose a geometric construct in E8. → 50K table → x to the 27th?? 29th polynomial, that is do able, AI recons even a FFT will do it. (whole number and symmetrical) repeat if it does some factoring of AIM tables/ trim table and 3 repeat, big compute, for 8/8 solve

turns out that mathlib has findroots, so expressing the 2ODE iteratively solving and asking the AI to ensure the mathlib accuracy is set to 170 dp - that does the trick.


repository search by ChatGPT 5.6 Sol

Worked for 44s

Found it. The old x3 one is:

docs/sources/dvj-root-solver-x3-historical.py

in d12rg_hypergroup.

That is the one with:

import mpmath as mp
mp.mp.dps = 80

and the original mp.findroot(…) DVJ solves, then the chained carrier construction through:

x0 → x1
x1 → x2
x2 → x3
x3 → x4

including:

x1 = mp.findroot(dvj_f, (mp.mpf(“0.05”), mp.mpf(“0.10”)), …)
x2 = mp.findroot(dvj_f, (mp.mpf(“3.0”), mp.mpf(“4.0”)), …)

and then:

x2, x3 = solve_next_pair(x2_dvj)
x3_again, x4 = solve_next_pair(x3)

So yes — dvj-root-solver-x3-historical.py is almost certainly the one your holonomic memory was pointing at. :grin::blue_heart::ewe:

There is also a later mirrored Paper-7 source at:

z12cft-cft/paper7/dvj_root_solver_py3.py.txt

but the explicitly preserved historical x3 version is the one above.

LOL! double quarrantine!

yoda: strong math have you there

me: thankyou master

Prime server:

0xFFFFFFFFFFFFFFFFFFULL
0xDEADBEEFDEADBEEFULL
0xNULL

at least they were polite enough to notify me this time :smile: