Documentation

CsdLean4.CV.RecordInfluence

ST-1: the influence relation on records #

Category: 3-Local (CV; the first theorem about records with a causal shape). BACKLOG #38, brick ST-1 of records-to-spacetime-scoping.md.

The CV chain states causality about operators (SupportedOn, commutators, the Lieb–Robinson cone); FibredArenaBridge.lean carried it to the record medium with an error bound. This module states it as a relation between read regions and proves the three things the scoping note asked of ST-1: the relation is reflexive, monotone in the period count and transitive with the periods adding — a graded reachability relation, which becomes a genuine preorder once the budget is existentially quantified (★ isPreorder_eventuallyInfluences) — spacelike records are jointly measurable and unsteerable from one another, and their joint law factors.

Honest scope #

⚠️ This is not emergent spacetime, and it is not a metric. Influences is the causal shape the assumed coupling graph E defines on mode regions, with the period count as the only notion of duration. There is no light speed, no Lorentzian signature, no continuum, and no derivation of E from anything. The scoping note's finding stands: what is missing for emergence proper is which coarse-graining projection defines the macroscopic coordinates (Paper D §5.2), and that is a decision for the author rather than a lemma. Finiteness of the arena is not what stands in the way — it bounds what is defined directly from Σ, not what can arise after coarse-graining over many records.

⚠️ Influences is permitted influence, not demonstrated influence. It says that S₂ lies inside the cone the graph allows, and everything proved from it is of the form outside the cone ⇒ nothing happens (not_influences_of_spacelike and the three unsteerability theorems). The converse — inside the cone, some influence actually occurs — is not proved and is not true in general: a coupling along the path may vanish, or the particular dynamics may fail to transmit the perturbation. That propagation is not fictional is a separate theorem, SupportSpreading.lean's spreadKick_not_supportedOn (an operator does leave its region), but there is no equivalence between graph reachability and operational influenceability anywhere in the corpus. Read Influences as the causal accessibility cone.

⚠️ "Record" here is the corpus's record mechanism, the skew stroke of RecordLayer/ShearWitness.lean as carried to the field arena by FibredArenaBridge.lean: a base-dependent shift of the fibre, read through a region-supported arena observable. Contexts enter only through their read regions and their write maps.

⚠️ The factoring theorem is about the medium, not about the state. map_recordStroke₂_prod says the fibre contributes no correlation; it does not say two spacelike records are statistically independent, which would also need the base readings to be independent — a statement about the preparation (a product point), and one that needs a tensor factorisation of the field space over a mode partition that the corpus does not have. Saying more than this would be the mistake the scoping note was written to avoid.

⚠️ Discrete periods of the fixed interacting unitary graphInteractingU, and Finset-indexed mode regions at a finite cutoff.

References: records-to-spacetime-scoping.md ST-1; CV/SupportSpreading.lean (graphBall, commute_heisenberg_graphInteractingU_pow); CV/FibredArenaBridge.lean (recordStroke, record_lightcone); RecordLayer/ShearWitness.lean (the stroke this is about); specs/BACKLOG.md #38 and #39.

The light cone is monotone in its region #

theorem CSD.CV.graphNeighborhood_subset_of_subset {K : ℕ} (E : Finset (Fin K × Fin K)) {R S : Finset (Fin K)} (h : R ⊆ S) :
theorem CSD.CV.graphBall_subset_of_subset {K : ℕ} (E : Finset (Fin K × Fin K)) {R S : Finset (Fin K)} (h : R ⊆ S) (n : ℕ) :
graphBall E R n ⊆ graphBall E S n
theorem CSD.CV.graphBall_add {K : ℕ} (E : Finset (Fin K × Fin K)) (R : Finset (Fin K)) (m n : ℕ) :
graphBall E R (m + n) = graphBall E (graphBall E R m) n

The cones compose: m periods then n more is m + n periods.

The influence relation on read regions #

def CSD.CV.Influences {K : ℕ} (E : Finset (Fin K × Fin K)) (S₁ S₂ : Finset (Fin K)) (n : ℕ) :

Influence within n periods. The record of a context that reads the mode region S₁ can influence the record of a context that reads S₂ within n interacting periods exactly when S₂ lies in the coupling graph's n-ball around S₁.

⚠️ This is the causal shape the coupling graph defines, relative to an assumed E. It is not a metric, not a Lorentzian structure, and not emergent spacetime: see the module docstring.

Equations
Instances For
    theorem CSD.CV.influences_refl {K : ℕ} (E : Finset (Fin K × Fin K)) (S : Finset (Fin K)) :
    Influences E S S 0

    ★ Reflexive at zero periods: a record influences itself, now.

    theorem CSD.CV.influences_mono {K : ℕ} {E : Finset (Fin K × Fin K)} {S₁ S₂ : Finset (Fin K)} {m n : ℕ} (h : Influences E S₁ S₂ m) (hmn : m ≤ n) :
    Influences E S₁ S₂ n

    ★ Monotone in the period count: more time can only add influence.

    theorem CSD.CV.influences_trans {K : ℕ} {E : Finset (Fin K × Fin K)} {S₁ S₂ S₃ : Finset (Fin K)} {m n : ℕ} (h₁ : Influences E S₁ S₂ m) (h₂ : Influences E S₂ S₃ n) :
    Influences E S₁ S₃ (m + n)

    ★★ Transitive, with the periods adding: influence composes along the graph, which is what makes the relation a preorder on regions once the period count is carried.

    theorem CSD.CV.influences_trans_le {K : ℕ} {E : Finset (Fin K × Fin K)} {S₁ S₂ S₃ : Finset (Fin K)} {m n p : ℕ} (h₁ : Influences E S₁ S₂ m) (h₂ : Influences E S₂ S₃ n) (hp : m + n ≤ p) :
    Influences E S₁ S₃ p

    ★ The relation at a fixed budget is a preorder, once "within n" is read as "within at most n": reflexivity is the zero ball and transitivity is influences_trans followed by influences_mono.

    def CSD.CV.EventuallyInfluences {K : ℕ} (E : Finset (Fin K × Fin K)) (S₁ S₂ : Finset (Fin K)) :

    Influence within some budget: the relation whose transitivity needs no bookkeeping, because the budget is existentially quantified. This is the relation the word preorder belongs to.

    Equations
    Instances For
      theorem CSD.CV.eventuallyInfluences_trans {K : ℕ} {E : Finset (Fin K × Fin K)} {S₁ S₂ S₃ : Finset (Fin K)} (h₁ : EventuallyInfluences E S₁ S₂) (h₂ : EventuallyInfluences E S₂ S₃) :

      ★ The graded relation is a preorder once the period budget is existentially quantified. At a fixed budget it is not: two reaches within n periods compose into one within 2n.

      Spacelike regions #

      def CSD.CV.Spacelike {K : ℕ} (E : Finset (Fin K × Fin K)) (R T : Finset (Fin K)) (n : ℕ) :

      Spacelike at n periods: neither region's light cone has reached the other's, so neither record can influence the other within n periods.

      Equations
      Instances For
        theorem CSD.CV.spacelike_symm {K : ℕ} {E : Finset (Fin K × Fin K)} {R T : Finset (Fin K)} {n : ℕ} (h : Spacelike E R T n) :
        Spacelike E T R n
        theorem CSD.CV.spacelike_of_le {K : ℕ} {E : Finset (Fin K × Fin K)} {R T : Finset (Fin K)} {m n : ℕ} (h : Spacelike E R T n) (hmn : m ≤ n) :
        Spacelike E R T m

        ★ Spacelike is antitone in the period count: if the cones have not met by n, they had not met earlier either.

        theorem CSD.CV.subset_graphBall {K : ℕ} (E : Finset (Fin K × Fin K)) (R : Finset (Fin K)) (n : ℕ) :
        R ⊆ graphBall E R n

        The region sits inside its own cone.

        theorem CSD.CV.not_influences_of_spacelike {K : ℕ} {E : Finset (Fin K × Fin K)} {R T : Finset (Fin K)} {n : ℕ} (h : Spacelike E R T n) (hT : T.Nonempty) :
        ¬Influences E R T n

        ★ Spacelike regions do not influence one another — the relation and its negation line up, provided the target region is actually there to be influenced.

        theorem CSD.CV.disjoint_graphBall_of_spacelike {K : ℕ} {E : Finset (Fin K × Fin K)} {R T : Finset (Fin K)} {n : ℕ} (h : Spacelike E R T n) :

        A kick on a spacelike region is disjoint from the record's cone.

        Spacelike records commute #

        theorem CSD.CV.commute_record_of_spacelike {K N : ℕ} {R T : Finset (Fin K)} {A B : Matrix (FieldConfig K N) (FieldConfig K N) ℂ} (τ lam : ℝ) (E : Finset (Fin K × Fin K)) (g : Fin K × Fin K → Fin N → Fin N → ℝ) (n : ℕ) (hRT : Spacelike E R T n) (hA : SupportedOn R A) (hB : SupportedOn T B) :
        heisenberg (graphInteractingU K N τ lam E g ^ n) A * heisenberg (graphInteractingU K N τ lam E g ^ n) B = heisenberg (graphInteractingU K N τ lam E g ^ n) B * heisenberg (graphInteractingU K N τ lam E g ^ n) A

        ★★ Spacelike records are jointly measurable. Two contexts whose read regions are spacelike at n periods have commuting evolved observables, so the record layer may assign them outcomes simultaneously — commute_heisenberg_graphInteractingU_pow read in the influence vocabulary.

        A record outside the cone cannot be steered — exactly #

        theorem CSD.CV.arenaObs_heisenberg_kick_of_spacelike {K N : ℕ} [NeZero N] {R T : Finset (Fin K)} {A : Matrix (FieldConfig K N) (FieldConfig K N) ℂ} (τ lam : ℝ) (E : Finset (Fin K × Fin K)) (g : Fin K × Fin K → Fin N → Fin N → ℝ) (n : ℕ) (hRT : Spacelike E R T n) (hA : SupportedOn R A) {W : ↥(Matrix.unitaryGroup (FieldConfig K N) ℂ)} (hW : SupportedOn T ↑W) (p : FieldArena K N) :
        arenaObs (heisenberg (graphInteractingU K N τ lam E g ^ n) A) (arenaKick W p) = arenaObs (heisenberg (graphInteractingU K N τ lam E g ^ n) A) p

        ★★★ The exact discrete record cone. A kick supported on a region spacelike from the record's read region leaves the record's base reading exactly unchanged, after any number of interacting periods. record_lightcone of FibredArenaBridge.lean is the continuous-time statement with a Lieb–Robinson error; this is the discrete-time statement with no error at all, because the support of the evolved observable is contained in the cone on the nose.

        theorem CSD.CV.recordStroke_heisenberg_comm_kick_of_spacelike {K N : ℕ} [NeZero N] {R T : Finset (Fin K)} {A : Matrix (FieldConfig K N) (FieldConfig K N) ℂ} (τ lam : ℝ) (E : Finset (Fin K × Fin K)) (gc : Fin K × Fin K → Fin N → Fin N → ℝ) (n : ℕ) (hRT : Spacelike E R T n) (hA : SupportedOn R A) {W : ↥(Matrix.unitaryGroup (FieldConfig K N) ℂ)} (hW : SupportedOn T ↑W) (g : ℝ → RecordFibre) (x : FibredFieldArena K N) :
        recordStroke (heisenberg (graphInteractingU K N τ lam E gc ^ n) A) g (fibredKick W x) = fibredKick W (recordStroke (heisenberg (graphInteractingU K N τ lam E gc ^ n) A) g x)

        ★★★ The record write is unsteerable from outside the cone. Kick a spacelike region and write the record, or write it and then kick: the same point of the fibred arena, exactly.

        Two records in the two channels of the fibre #

        noncomputable def CSD.CV.recordStroke₂ {K N : ℕ} (A₁ A₂ : Matrix (FieldConfig K N) (FieldConfig K N) ℂ) (g₁ g₂ : ℝ → AddCircle 1) (x : FibredFieldArena K N) :

        Two records written into the two coordinates of the T² fibre: one context reads A₁ and shifts the first circle, the other reads A₂ and shifts the second.

        Equations
        Instances For
          noncomputable def CSD.CV.recordStrokeFst {K N : ℕ} (A : Matrix (FieldConfig K N) (FieldConfig K N) ℂ) (g : ℝ → AddCircle 1) (x : FibredFieldArena K N) :

          The first channel alone.

          Equations
          Instances For
            noncomputable def CSD.CV.recordStrokeSnd {K N : ℕ} (A : Matrix (FieldConfig K N) (FieldConfig K N) ℂ) (g : ℝ → AddCircle 1) (x : FibredFieldArena K N) :

            The second channel alone.

            Equations
            Instances For
              theorem CSD.CV.recordStroke_channels_comm {K N : ℕ} (A₁ A₂ : Matrix (FieldConfig K N) (FieldConfig K N) ℂ) (g₁ g₂ : ℝ → AddCircle 1) (x : FibredFieldArena K N) :
              recordStrokeFst A₁ g₁ (recordStrokeSnd A₂ g₂ x) = recordStrokeSnd A₂ g₂ (recordStrokeFst A₁ g₁ x) ∧ recordStrokeFst A₁ g₁ (recordStrokeSnd A₂ g₂ x) = recordStroke₂ A₁ A₂ g₁ g₂ x

              ★★ The two channels commute, and their composite is the joint write. Neither order of writing is privileged: a record write holds the base fixed, so the second write reads exactly what the first one read.

              The record medium adds no correlation #

              The fibre part of the joint write, at a fixed base point.

              Equations
              Instances For
                theorem CSD.CV.recordStroke₂_fibre {K N : ℕ} (A₁ A₂ : Matrix (FieldConfig K N) (FieldConfig K N) ℂ) (g₁ g₂ : ℝ → AddCircle 1) (x : FibredFieldArena K N) :
                (recordStroke₂ A₁ A₂ g₁ g₂ x).2 = fibreShift (g₁ (arenaObs A₁ x.1)) (g₂ (arenaObs A₂ x.1)) x.2

                ★★ The record medium adds no correlation and no bias. For any translation-invariant law μ on a channel — Haar being the case the corpus uses — the joint law of the two channels is the product μ ⊗ μ, and the joint write preserves it: whatever the two contexts read, the pair of records is distributed exactly as the untouched medium was.

                theorem CSD.CV.map_recordStroke₂_prod {K N : ℕ} {μ : MeasureTheory.Measure (AddCircle 1)} [μ.IsAddRightInvariant] [MeasureTheory.SFinite μ] (A₁ A₂ : Matrix (FieldConfig K N) (FieldConfig K N) ℂ) (g₁ g₂ : ℝ → AddCircle 1) (p : FieldArena K N) :
                MeasureTheory.Measure.map (fun (θ : RecordFibre) => (recordStroke₂ A₁ A₂ g₁ g₂ (p, θ)).2) (μ.prod μ) = μ.prod μ

                ★★★ The joint record law of two records factors. At every base point, the law of the pair of records written by two contexts into the two channels of the fibre is the product law μ ⊗ μ of the medium — independent channels, each unbiased. So any correlation between two records lives in their base readings, never in the medium; and when the read regions are spacelike, those readings are jointly measurable (commute_record_of_spacelike) and neither is steerable from the other's region (recordStroke_heisenberg_comm_kick_of_spacelike). That is the causal package the influence preorder was defined for.