Skip to main content

Attention and Memory

The Unconscious separates phase statistics from access to content. This chapter proposes models of attention and memory; the correspondence to cognitive processes is an empirical hypothesis [H].

Typed quantities

Γ∈D(C7)\Gamma\in\mathcal D(\mathbb C^7) is a density matrix in a declared native frame, P=Tr(Γ2)P=\mathrm{Tr}(\Gamma^2) and Φ=P/∑iγii2−1\Phi=P/\sum_i\gamma_{ii}^2-1. Trace normalization constrains populations and bounds coherences, but does not conserve an attention resource or personal identity. For γij≠0\gamma_{ij}\ne0, Gap(i,j)=∣sin⁡arg⁡γij∣\mathrm{Gap}(i,j)=|\sin\arg\gamma_{ij}| is a phase statistic; at zero coherence the phase is undefined. A memory kernel describes dependence of an evolution equation on earlier states. It is not a stored memory or a recall score by definition.

Scope

Matrix inequalities below are [T]. Chosen control objectives and kernel families are [D]; their identification with attention, recall and phenomenology is [H/I], requiring an observation model and task validation. Neither PP, Φ\Phi, Gap nor a fixed-point score alone determines physical consciousness, clinical condition or treatment efficacy. See the mathematical kernel.

Chapter roadmap​

Historical models; constrained coherence control; operational tests of attention; kernel families; recoverability and forgetting; interaction with memory.

1. Historical perspective: attention​

1.1 William James (1890)​

"Everyone knows what attention is. It is the taking possession by the mind, in clear and vivid form, of one out of what seem several simultaneously possible objects or trains of thought."

— William James, The Principles of Psychology (1890), ch. 11

James's description motivates a selective-control model [I/H]. Increasing a chosen coherence relative to others is a possible objective; the transfer of a conserved budget requires an additional controller law, not the historical description or trace normalization.

Mapping scope [H/I]. The UHM correspondences in this historical comparison are proposals; they do not follow from the cited historical result or from normalization.

1.2 Filter models (1950–1970s)​

Broadbent (1958): early selection filter. Information passes through a narrow 'bottleneck' — only one channel is fully processed, the rest are blocked. In UHM: ∣γAEtarget∣≫∣γAEdistractor∣|\gamma_{AE_{\text{target}}}| \gg |\gamma_{AE_{\text{distractor}}}| — hard filtering.

Treisman (1964): attenuation model. Non-target channels are not fully blocked but attenuated. In UHM: ∣γAEdistractor∣>0|\gamma_{AE_{\text{distractor}}}| > 0, but ∣γAEdistractor∣≪∣γAEtarget∣|\gamma_{AE_{\text{distractor}}}| \ll |\gamma_{AE_{\text{target}}}| — soft filtering. Its proposed matrix counterpart would require an independently tested access/response readout [H].

Deutsch and Deutsch (1963): late selection filter. All information is fully processed; selection occurs at the response stage. In UHM: all ∣γAX∣|\gamma_{AX}| are moderate; selection occurs via channel (A,D)(A,D) — attention influences action (DD), not perception (EE).

Mapping scope [H/I]. The UHM correspondences in this historical comparison are proposals; they do not follow from the cited historical result or from normalization.

1.3 Posner: components of attention (1980–1990s)​

Michael Posner identified three neural 'attention networks':

  • Alerting (vigilance) — maintenance of the tonic level γAA\gamma_{AA}
  • Orienting (orientation) — redirecting coherence: γAE1→γAE2\gamma_{AE_1} \to \gamma_{AE_2}
  • Executive (executive control) — resolving conflict between channels

Mapping these networks to A-sector features is a candidate hypothesis [H]; naming a matrix entry does not establish its neural implementation.

Mapping scope [H/I]. The UHM correspondences in this historical comparison are proposals; they do not follow from the cited historical result or from normalization.

1.4 From classical models to UHM​

Classical modelUHM formalism
Broadbent's filter∥γAEtarget∥≫0\|\gamma_{AE_{\text{target}}}\| \gg 0, ∥γAEdistr∥≈0\|\gamma_{AE_{\text{distr}}}\| \approx 0
Treisman's attenuation∥γAEtarget∥>∥γAEdistr∥>0\|\gamma_{AE_{\text{target}}}\| > \|\gamma_{AE_{\text{distr}}}\| > 0
Late selectionAll ∥γAX∥\|\gamma_{AX}\| moderate; selection via (A,D)(A,D)
Alerting (Posner)γAA\gamma_{AA} — tonic level
Orienting (Posner)γAE1→γAE2\gamma_{AE_1} \to \gamma_{AE_2} — redistribution
Executive (Posner)Resolution of ∥γAX1∥>?∥γAX2∥\|\gamma_{AX_1}\| \stackrel{?}{>} \|\gamma_{AX_2}\|

Mapping scope [H/I]. The UHM correspondences in this historical comparison are proposals; they do not follow from the cited historical result or from normalization.

2. Attention as redistribution of coherence​

2.1 Definition​

Definition [D]. A candidate attention controller changes selected A-sector entries toward a declared task objective. Selectivity can be represented by increasing ∣γAX∣|\gamma_{AX}| relative to declared distractor entries, sustained control by maintaining a target over an interval, and divided control by several simultaneous targets. These are alternative objectives, not consequences of normalization. An empirical attention measure must specify the task, stimulus, response and independent performance readout [H/Pr]. Unitary control is one model choice; general open-system control need not be unitary.

2.2 The 'spotlight' mechanism: detailed derivation​

Theorem [T]. Positivity of each 2×22\times2 principal minor gives ∣γAX∣2≤γAAγXX|\gamma_{AX}|^2\le\gamma_{AA}\gamma_{XX}. Summing and using trace one yields

∑X≠A∣γAX∣2≤γAA(1−γAA).\sum_{X\ne A}|\gamma_{AX}|^2\le\gamma_{AA}(1-\gamma_{AA}).

This is an upper bound, not a fixed sum. The former inference “one coherence rises, another must fall” is false when the bound has slack.

Counterexample in the proof. Let u=(1,…,1)/7u=(1,\ldots,1)/\sqrt7 and

Γ(t)=(1−t)I7/7+tuu†,0≤t≤1.\Gamma(t)=(1-t)I_7/7+tuu^\dagger,\qquad 0\le t\le1.

These states are positive and trace one. Every diagonal is 1/71/7, every off-diagonal modulus is t/7t/7, and P=(1+6t2)/7P=(1+6t^2)/7. All six A-sector moduli can increase together while the trace and diagonal populations stay fixed.

A spotlight tradeoff follows conditionally if an additional controller enforces the fixed budget BA=∑X≠A∣γAX∣2B_A=\sum_{X\ne A}|\gamma_{AX}|^2. Then d∣γAX∣2/dτ>0d|\gamma_{AX}|^2/d\tau>0 implies ∑Y≠A,Xd∣γAY∣2/dτ<0\sum_{Y\ne A,X}d|\gamma_{AY}|^2/d\tau<0. This conservation is an extra dynamical hypothesis [D/H], to be tested rather than derived from TrΓ=1\mathrm{Tr}\Gamma=1.

2.3 Connection to the 21-pair taxonomy of qualia​

The proposed names apperception (A,E)(A,E), morphogenesis (A,S)(A,S), actualisation (A,D)(A,D) and predication (A,L)(A,L) belong to the linked interpretive taxonomy [I]. Matrix indices alone do not establish these cognitive functions. Test a proposed mapping by independently manipulating task demands and estimating the corresponding entries with a fixed observation model; include competing mappings and held-out tasks [Pr].

2.4 Types of attention​

The three labels selective, sustained and divided attention are a chosen taxonomy [D/H]. Sustained control may impose ∣γAX(τ)∣≥θ|\gamma_{AX}(\tau)|\ge\theta on a declared interval; selective control may maximize a target-to-distractor ratio. Neither objective establishes energetic cost, fatigue, a neural network identity or a universal performance loss.

The ratio ∣γAX∣2/∑Y≠A,X∣γAY∣2|\gamma_{AX}|^2/\sum_{Y\ne A,X}|\gamma_{AY}|^2 is a matrix contrast [D] when its denominator is positive. Calling it an SNR requires an observation model in which the denominator actually measures noise power. A zero denominator requires separate handling. Positivity must be checked for the full matrix; specifying a few entries below their individual bounds is not sufficient.

2.5 Attention and Gap​

Theorem [T]. In polar coordinates γij=rijeiθij\gamma_{ij}=r_{ij}e^{i\theta_{ij}}, rij>0r_{ij}>0,

Gap(i,j)=∣sin⁡θij∣,∂Gap(i,j)∂rij∣θij=0.\mathrm{Gap}(i,j)=|\sin\theta_{ij}|,\qquad \left.\frac{\partial\mathrm{Gap}(i,j)}{\partial r_{ij}}\right|_{\theta_{ij}}=0.

Counterexample to automatic Gap reduction. Varying rr in reiθre^{i\theta} at fixed phase changes amplitude but leaves Gap unchanged. The family in §2.2 changes all amplitudes while every defined pairwise Gap remains zero. Cross-channel derivatives have no sign without a specified coupled evolution. Even along a flow, where the derivative exists, G˙ij=sgn⁡(sin⁡θij)cos⁡θijθ˙ij\dot G_{ij}=\operatorname{sgn}(\sin\theta_{ij})\cos\theta_{ij}\dot\theta_{ij} depends on phase velocity.

Attention training could affect phase, access or model prediction through an independently specified controller [H]. The proposed test compares task performance, amplitude and oriented phase before and after the intervention; it does not equate a decrease of this phase statistic with awareness or clinical benefit [Pr].

3. Historical perspective: memory​

3.1 Hermann Ebbinghaus (1885)​

Ebbinghaus was the first researcher to apply the experimental method to the study of memory. His main discoveries:

  • Forgetting curve: retention was studied across delays. A particular power-law fit and its exponent require the measured retention data; neither is fixed by the kernel formalism.
  • Learning curve: repetition improves retention, but with diminishing returns.
  • Spacing effect: distributed repetition is more effective than massed practice.

In UHM, a power-law retention fit is a candidate hypothesis; §4.5 does not derive its exponent from the kernel alone.

Mapping scope [H/I]. The UHM correspondences in this historical comparison are proposals; they do not follow from the cited historical result or from normalization.

3.2 Atkinson and Shiffrin (1968): modal model​

The 'three-store' model:

  • Sensory register — instantaneous snapshot (duration ~250 ms)
  • Short-term (working) memory — 7 ± 2 items, duration ~20 s
  • Long-term memory — virtually unlimited capacity and duration

A proposed UHM comparison assigns different kernel families to these stores [H]; it does not show that their distinct mechanisms reduce to one kernel:

Atkinson-Shiffrin modelUHM formalism
Sensory registerK(τ)∼δ(τ)K(\tau) \sim \delta(\tau) — Markovian limit
Working memoryK(τ)∼e−τ/τWMK(\tau) \sim e^{-\tau/\tau_{WM}} — exponential kernel
Long-term memoryK(τ)∼τ−αK(\tau) \sim \tau^{-\alpha} — power-law kernel

Mapping scope [H/I]. The UHM correspondences in this historical comparison are proposals; they do not follow from the cited historical result or from normalization.

3.3 Tulving (1972): types of memory​

Endel Tulving introduced the distinction:

  • Episodic memory — memory of specific events ('I was at the café yesterday')
  • Semantic memory — knowledge of facts ('Paris is the capital of France')
  • Procedural memory — skills ('how to ride a bicycle')

In UHM:

  • Different fitted retention functions could model episodic and semantic tasks [H]; no unique kernel exponent is derived.
  • Learned generator parameters are a candidate model of skill retention [H], with the limitations in §4.6.

Mapping scope [H/I]. The UHM correspondences in this historical comparison are proposals; they do not follow from the cited historical result or from normalization.

4. Types of memory from the non-Markovian kernel​

A temporal kernel and cognitive memory have different types. The former belongs to an evolution law; the latter requires encoded information and a recall task. The following families are candidate models [D/H], not a theorem deriving four cognitive stores.

4.1 The memory kernel and cognitive memory​

A candidate equation is z˙(τ)=∫0τK(τ−s)z(s) ds+f(τ)\dot z(\tau)=\int_0^\tau K(\tau-s)z(s)\,ds+f(\tau). The kernel has units of inverse time squared for dimensionless zz. In a matrix model, a scalar kernel per entry does not by itself ensure positivity, trace preservation or complete positivity of the evolution. Those conditions must be established for the whole map. A nonzero history kernel alone does not show that task-relevant information can be recalled; a Markovian dynamical system may carry records in its state.

4.2 Memory typology​

Candidate family [D]Mathematical propertyCognitive bridge [H]
Delta kernelLocal evolution lawShort persistence on a sensory task
Exponential kernelFinite kernel timescaleA fitted working-memory task
Power-law kernelLong temporal tailA fitted long-retention task
Learned generator parametersPersistent change of evolution lawSkill learning

The temporal form, observed retention curve and psychological category must be estimated separately. None of the families fixes a universal human timescale or a memory capacity.

4.3 Sensory memory​

Under a one-sided delta convention, K=−λδK=-\lambda\delta, λ>0\lambda>0, gives z˙=−λz\dot z=-\lambda z and z(τ)=z(0)e−λτz(\tau)=z(0)e^{-\lambda\tau} [T]. Its half-life is log⁡2/λ\log2/\lambda, not zero. The delta kernel removes dependence on earlier values from the evolution law; it does not remove stored information instantaneously. Identification with sensory retention requires an independent task readout [H].

4.4 Working memory​

For the scalar model K(τ)=−ce−ωcτK(\tau)=-c e^{-\omega_c\tau}, c,ωc>0c,\omega_c>0, with no forcing and z(0)=z0z(0)=z_0, differentiation of the convolution equation gives

z¨+ωcz˙+cz=0,z˙(0)=0.\ddot z+\omega_c\dot z+cz=0,\qquad\dot z(0)=0.

Oscillations occur only if c>ωc2/4c>\omega_c^2/4. Then, with Ω=c−ωc2/4\Omega=\sqrt{c-\omega_c^2/4},

z(τ)=z0e−ωcτ/2(cos⁡Ωτ+ωc2Ωsin⁡Ωτ).z(\tau)=z_0e^{-\omega_c\tau/2} \left(\cos\Omega\tau+\frac{\omega_c}{2\Omega}\sin\Omega\tau\right).

Proof and counterexample to universal refresh oscillations [T]. Introduce y=∫0τe−ωc(τ−s)z(s)dsy=\int_0^\tau e^{-\omega_c(\tau-s)}z(s)ds; z˙=−cy\dot z=-cy and y˙=z−ωcy\dot y=z-\omega_c y imply the second-order equation. At c<ωc2/4c<\omega_c^2/4 its two characteristic roots are real; an exponential memory kernel therefore need not produce oscillations. Ω\Omega is an angular frequency; the cycle count in duration TT is ΩT/(2π)\Omega T/(2\pi), not ΩT\Omega T. A neural rehearsal frequency or retained item count does not follow from these roots [H].

4.5 Long-term memory​

A power-law kernel does not determine a retention exponent by itself. For the explicit scalar equation z˙=K∗z\dot z=K*z, K(τ)=−cτ−α/Γ ⁣Euler(1−α)K(\tau)=-c\tau^{-\alpha}/\Gamma_{\!\mathrm{Euler}}(1-\alpha), 0<α<10<\alpha<1, with cc in units of timeα−2^{\alpha-2}, its Laplace transform satisfies

(s+csα−1)z^(s)=z0,z^(s)=z0s1−αs2−α+c.(s+c s^{\alpha-1})\widehat z(s)=z_0,\qquad \widehat z(s)=\frac{z_0s^{1-\alpha}}{s^{2-\alpha}+c}.

Correction of the former proof. The initial term z0z_0 cannot be dropped from sz^−z0=K^z^s\widehat z-z_0=\widehat K\widehat z. The displayed resolvent does not justify the claimed universal exponent β=α/2\beta=\alpha/2; no step permits replacing one inverse transform by that power. Generator terms, initial conditions and the recall readout change the retention law.

A candidate empirical retention fit is b(τ)=b0(1+τ/τ0)−βb(\tau)=b_0(1+\tau/\tau_0)^{-\beta} [D/H]. Its exponent and timescale must be fitted and compared with alternatives. A nonzero long tail of a dynamical quantity alone does not establish readable autobiographical content, permanent storage or identity preservation.

4.6 Procedural memory​

Learned parameters of HeffH_{\mathrm{eff}} or of an open-system generator may encode a persistent change of policy [D/H]. This does not give a canonical embedding K↪HeffK\hookrightarrow H_{\mathrm{eff}}: kernels and Hamiltonians have different types and units. Persistence requires an evolution law for the parameters and a performance test. Parameters may drift or be overwritten; being stored in a generator does not prove a skill is never forgotten.

5. Forgetting as kernel decoherence​

Operational forgetting is a decline of performance on a declared recall task [D]. It may be modeled through changing dynamics, stored records or access. Decay of a history kernel is one candidate mechanism [H], not an equivalent definition.

5.1 Two mechanisms of forgetting​

Recoverability depends on the encoding, channel and allowed decoder. A channel can erase a record while preserving trace one; another can preserve a record while a particular decoder fails to access it. Thus loss of a record and loss of access are distinct, but neither is identified by Gap or KK alone.

Counterexamples. A Markovian identity channel preserves all encoded states without a history kernel. A replacement channel maps every input to the same trace-one state and destroys distinguishability of the records at its output. Conversely, an invertible phase rotation changes Gap yet permits exact recovery by its inverse. These examples invalidate “KK decay = irreversible information loss” and “Gap increase = intact recoverable memory”. Recovery from an environment is a separate question requiring access to that environment.

5.2 Forgetting rate and viability​

Conditional result [T]. Suppose a positive differentiable scalar kernel amplitude k=∣K∣k=|K| is nonincreasing and, as an additional model assumption, satisfies

k˙≥−κP−Pcritk,P>Pcrit,κ≥0.\dot k\ge-\frac{\kappa}{P-P_{\mathrm{crit}}}k, \qquad P>P_{\mathrm{crit}},\quad\kappa\ge0.

Dividing by kk and changing the sign gives an upper bound on the nonnegative forgetting rate:

0≤r:=−k˙/k≤κP−Pcrit.0\le r:=-\dot k/k\le\frac{\kappa}{P-P_{\mathrm{crit}}}.

Counterexample in the proof. The constant kernel amplitude k(τ)=k0>0k(\tau)=k_0>0 has r=0r=0 and satisfies the inequality for every allowed PP. Letting PP approach the cutoff makes the upper bound weaker; it does not force rr to diverge. Non-Markovianity does not imply the assumed inequality either.

The equality r=κ/(P−Pcrit)r=\kappa/(P-P_{\mathrm{crit}}) would be an extra constitutive law [D/H], valid only on an explicitly declared domain, with a separate model at its singular boundary. Neither this law nor the bound identifies dementia stages, a person's survival or loss of identity. Those claims and the former clinical numerical table are withdrawn.

6. Integration: attention, memory and Gap​

Attention control, stored records, temporal dependence and phase statistics can interact in a specified model. No universal cycle attention → Gap reduction → awareness → permanent memory follows from the definitions.

6.1 Interaction of attention and memory​

A testable joint model specifies an encoding x↦Γxx\mapsto\Gamma_x, an attention controller, the state evolution, a recall decoder and a task score. Compare changes in that score with estimated amplitudes, oriented phases and kernel parameters on held-out data [Pr]. Improvements in a surrogate statistic cannot substitute for an improvement in recall or an independently assessed intervention outcome. The following machine experiment concerns an explicit architecture; its numerical results do not by themselves validate the biological mapping.

6.2 Measured: mood as address — state-dependent memory in silicon​

Psychology has long known state-dependent recall: what is learned in one state of mind is retrieved worse in another (Godden–Baddeley's divers, mood-congruent memory). In the agent stack this stops being a curiosity and becomes an architectural choice: index every memory address by the dominant axis of the current thought — knowledge is filed under the state of the mind that learned it.

The consequences were then measured on a returning world with direct interference (the law of phase B is the opposite of the law of phase A on the same situations; the world goes A → B → back to A). Three strategies, one number each — accuracy in the first window after each switch:

  1. Bare memory pays on every switch, including the return home (0.700.70 and 0.690.69 against settled tails of 1.001.00): the old cells are overwritten by the opposite law, and coming back means relearning what was already known. Interference is symmetric — it spares neither the new world nor the old one.
  2. Forgetting on detected change (an endogenous change-detector that wipes the transition map) turned out to be a precise null: bit-for-bit identical to bare memory. The finding is the separation of organs: the detector wipes the map (where actions lead), while accuracy is made by the policy (what to answer) — two different memory organs, told apart by the instrument rather than by introspection.
  3. Mood-indexed memory wins both switches, not just the return: clean learning at fresh addresses (0.940.94) is faster than relearning against anti-knowledge (0.700.70), and the return home is nearly free (0.980.98) — the old mood's file cabinet was never touched.

The reading for a psychologist: state-dependent memory is not a bug of biological recall but a strategy against interference — segregating knowledge by the state that acquired it protects old competence from new contradicting experience, at the price of not transferring between states. And the right unit of mood turned out to be a small theorem: indexing by the dominant axis flickers, because one note belongs to three themes — every Fano point lies on three lines, so a single-note state does not pick a theme at all. Indexing by the dominant line (the theme itself) stands firm even when the theme's notes are equally loud (0.94/0.980.94/0.98 on equal notes, where the axis would split the address space): a theme is at least two notes, for two points determine a line.

One step deeper, and the address hit an honest wall — worth telling, because the wall turned out to be a law rather than a shortage. A theme names what the mind is on; a melody names which way around the mind walks it: the same three notes of a line can be visited in two cyclic orders, and in the octonion algebra behind the Fano plane a line is literally oriented — eiej=+eke_ie_j=+e_k one way round, −ek-e_k the other. Measurement showed that the mind does keep a compass of that direction: walk the three notes slowly (about eight ticks per note) and the line's paint — its holonomy phase — is pumped with a sign equal to the direction of the walk, exactly antisymmetric under reversal. Curiously, the needle only settles in a dissipative mind: softer media weaken both the amplitude and the purity of the sign, because the compass is a non-equilibrium instrument — without friction the needle never stops swinging. But the compass could not join the address, and the reason is a rule already in the canon: paint born of the internal Hamiltonian alone lives on a carrier about half the qualia threshold, and the gate "no carrier — no qualia" (the same one that keeps colourless noise out of the paint passport) never opens the orientation bit. So melody-addressing stands as a named seam of the architecture: it waits for a paint channel in the food itself. Real-valued percept axes cannot carry phase; until the environment can hand the mind coherent content, direction remains a measurable quality without an address.


What we learned​

  1. Positivity and trace one give an upper bound on A-sector coherence; a conserved attention budget requires an extra controller assumption.
  2. At fixed phase, increasing coherence amplitude leaves phase Gap unchanged. Access and task performance require independent readouts.
  3. Delta, exponential and power-law kernels describe temporal dependence, not a uniquely derived taxonomy of cognitive memory. Exponential kernels oscillate only in their underdamped parameter regime.
  4. Forgetting is assessed by recall performance and recoverability of an encoding. Trace one, nonzero coherence and a long kernel tail do not prove preservation of memories or personal identity.
  5. The proposed purity-dependent inequality bounds the decay rate from above; its constant-kernel counterexample rules out the claimed mandatory divergence.
  6. The architectural experiment in §6.2 is a separate measured case, with an explicit scope; biological and clinical interpretation remains a research hypothesis.

Connections​