Plectis Atlas
Search

↑ and ↓ move, Enter opens, Esc closes.

Lean statement

Invariant-projection counterexamples for every irrational rotation

Lean is a language for mathematical statements and proofs that a computer can verify. This page shows one statement file from OpenAI’s release, possible paper matches and independent reports. The code-like names below identify the definitions or theorems selected by the proof-verification settings.

Theorems selected for verification: OAI.Invariant233.Results.prescribed_irrational_counterexample OAI.Invariant233.Results.product_realization

Lean statement file: IrrationalRotation.leanShow on the mapOpenAI’s Lean catalogue does not list this as a main result; the release’s Lean notes for family 293 link it.

The Lean statement

The lines of the Lean statement that state the theorem, then the definitions in the file that it uses.

theorem prescribed_irrational_counterexample (θ : ℝ)    (hθ0 : 0 < θ) (hθ1 : θ < 1) (hθ : Irrational θ) :    ∃ f : C(Circle, ℝ), Rotation.IsContinuousCounterexample θ f := by  sorrytheorem product_realization :    ∃ θ c : ℕ → ℝ, ProductModel.IsCounterexampleRealization θ c := by  sorry

A Lean statement states the theorem and leaves its proof as sorry on purpose. OpenAI’s proof is in a separate solution module, and a program called Comparator checks that proof against this statement.

Definitions needed to read it

Local definitions the statement names, followed through the definitions they name in turn. The match is by name in the source text, so a name reached only through notation can be missed; the full file is below.

  • abbreviation OAI.Invariant233.Circle line 12

    abbrev Circle := AddCircle (1 : ℝ)
  • definition OAI.Invariant233.circleMeasure line 14

    def circleMeasure : Measure Circle := volume
  • definition OAI.Invariant233.negLogCost line 16

    def negLogCost (t : ℝ) : ℝ≥0∞ :=  if t = 0 then ∞ else ENNReal.ofReal (-Real.log |t|)
  • definition OAI.Invariant233.HasNegInfiniteLogIntegral line 19

    def HasNegInfiniteLogIntegral {X : Type*} [MeasurableSpace X]    (μ : Measure X) (f : X → ℝ) : Prop :=  (∫⁻ x, negLogCost (f x) ∂μ) = ∞
  • definition OAI.Invariant233.NormQuasinilpotent line 27

    def NormQuasinilpotent {A : Type*} [NormedRing A] (T : A) : Prop :=  Tendsto (fun n : ℕ => ‖T ^ n‖ ^ (1 / (n : ℝ))) atTop (𝓝 0)
  • definition OAI.Invariant233.IsContinuousCircleWeight line 30

    def IsContinuousCircleWeight (f : Circle → ℝ) : Prop :=  Continuous f ∧ (∀ x, 0 ≤ f x ∧ f x ≤ 1) ∧    (∀ x, f x = 0 ↔ x = 0) ∧ HasNegInfiniteLogIntegral circleMeasure f
  • abbreviation OAI.Invariant233.WeightedShift.Hilbert line 44

    abbrev Hilbert := lp (fun _ : ℤ => ℂ) 2
  • abbreviation OAI.Invariant233.WeightedShift.Weight line 45

    abbrev Weight := lp (fun _ : ℤ => ℂ) ∞
  • definition OAI.Invariant233.WeightedShift.reindex line 47

    def reindex (e : Equiv.Perm ℤ) : Hilbert ≃ₗᵢ[ℂ] Hilbert where
    Show the remaining 12 lines
      toFun ξ := ⟨fun k => ξ (e k), memℓp_gen <|    (e.summable_iff).2 ((lp.memℓp ξ).summable (by norm_num))⟩  invFun ξ := ⟨fun k => ξ (e.symm k), memℓp_gen <|    (e.symm.summable_iff).2 ((lp.memℓp ξ).summable (by norm_num))⟩  left_inv ξ := by ext k; simp  right_inv ξ := by ext k; simp  map_add' ξ η := by ext k; rfl  map_smul' c ξ := by ext k; rfl  norm_map' ξ := by    rw [lp.norm_eq_tsum_rpow (by norm_num), lp.norm_eq_tsum_rpow (by norm_num)]    congr 1    exact e.tsum_eq (fun k => ‖ξ k‖ ^ (2 : ENNReal).toReal)
  • definition OAI.Invariant233.WeightedShift.shift line 61

    def shift (m : ℤ) : Hilbert ≃ₗᵢ[ℂ] Hilbert := reindex (Equiv.addRight (-m))
  • definition OAI.Invariant233.WeightedShift.diagonal line 63

    def diagonal (w : Weight) : Hilbert →L[ℂ] Hilbert :=  lp.mapCLM 2 (fun k => w k • ContinuousLinearMap.id ℂ ℂ) (norm_nonneg w)    (fun k => by      let : T0Space ℂ := @MetricSpace.instT0Space ℂ Complex.instNormedAddCommGroup.toMetricSpace      simpa [norm_smul] using lp.norm_apply_le_norm (by simp) w k)
  • definition OAI.Invariant233.WeightedShift.operator line 98

    def operator (w : Weight) : Hilbert →L[ℂ] Hilbert :=  (shift 1).toLinearIsometry.toContinuousLinearMap.comp (diagonal w)
  • definition OAI.Invariant233.vonNeumannGenerated line 138

    noncomputable def vonNeumannGenerated (s : Set (H →L[ℂ] H)) : VonNeumannAlgebra H where  toStarSubalgebra :=    StarSubalgebra.centralizer ℂ (StarSubalgebra.centralizer ℂ s : Set (H →L[ℂ] H))  centralizer_centralizer' := by    change Set.centralizer (Set.centralizer      (StarSubalgebra.centralizer ℂ (StarSubalgebra.centralizer ℂ s : Set (H →L[ℂ] H)) :        Set (H →L[ℂ] H))) = _    rw [StarSubalgebra.coe_centralizer_centralizer]    rw [Set.centralizer_centralizer_centralizer]    exact (StarSubalgebra.coe_centralizer_centralizer ℂ s).symm
  • definition OAI.Invariant233.WeightedShift.fieldDiagonalVec line 192

    def fieldDiagonalVec (a : X → Weight) (C : ℝ) (hC : 0 ≤ C)    (ha : ∀ x, ‖a x‖ ≤ C)    (hm : ∀ i, AEStronglyMeasurable (fun x => a x i) μ)    (f : Lp (Hilbert) 2 μ) : Lp (Hilbert) 2 μ :=  ((Lp.memLp f).of_le_mul    (diagonal_aestronglyMeasurable a C hC ha hm (Lp.aestronglyMeasurable f))    (Filter.Eventually.of_forall fun x => diagonal_bound (a x) C (ha x) (f x))).toLp _
  • definition OAI.Invariant233.WeightedShift.fieldDiagonalLinear line 208

    def fieldDiagonalLinear (a : X → Weight) (C : ℝ) (hC : 0 ≤ C)    (ha : ∀ x, ‖a x‖ ≤ C)    (hm : ∀ i, AEStronglyMeasurable (fun x => a x i) μ) :    Lp (Hilbert) 2 μ →ₗ[ℂ] Lp (Hilbert) 2 μ where
    Show the remaining 18 lines
      toFun := fieldDiagonalVec a C hC ha hm  map_add' f g := by    apply Lp.ext    filter_upwards [fieldDiagonalVec_ae a C hC ha hm (f + g),      fieldDiagonalVec_ae a C hC ha hm f, fieldDiagonalVec_ae a C hC ha hm g,      Lp.coeFn_add f g, Lp.coeFn_add        (fieldDiagonalVec a C hC ha hm f) (fieldDiagonalVec a C hC ha hm g)]      with x hfg hf hg hsum hout    simp only [Pi.add_apply] at hsum hout    rw [hfg, hout, hf, hg, hsum, map_add]  map_smul' c f := by    change fieldDiagonalVec a C hC ha hm (c • f) = c • fieldDiagonalVec a C hC ha hm f    apply Lp.ext    filter_upwards [fieldDiagonalVec_ae a C hC ha hm (c • f),      fieldDiagonalVec_ae a C hC ha hm f, Lp.coeFn_smul c f,      Lp.coeFn_smul c (fieldDiagonalVec a C hC ha hm f)] with x hcf hf hsmul hout    simp only [Pi.smul_apply] at hsmul hout    rw [hcf, hout, hf, hsmul, map_smul]
  • definition OAI.Invariant233.WeightedShift.fieldDiagonal line 231

    def fieldDiagonal (a : X → Weight) (C : ℝ) (hC : 0 ≤ C)    (ha : ∀ x, ‖a x‖ ≤ C)    (hm : ∀ i, AEStronglyMeasurable (fun x => a x i) μ) :    Lp (Hilbert) 2 μ →L[ℂ] Lp (Hilbert) 2 μ :=
    Show the remaining 7 lines
      (fieldDiagonalLinear a C hC ha hm).mkContinuous C (by    intro f    apply Lp.norm_le_mul_norm_of_ae_le_mul    change ∀ᵐ x ∂μ, ‖fieldDiagonalVec a C hC ha hm f x‖ ≤ C * ‖f x‖    filter_upwards [fieldDiagonalVec_ae a C hC ha hm f] with x hx    rw [hx]    exact diagonal_bound (a x) C (ha x) (f x))
  • abbreviation OAI.Invariant233.Rotation.Fiber line 262

    abbrev Fiber := WeightedShift.Hilbert
  • definition OAI.Invariant233.Rotation.action line 265

    def action (θ : ℝ) (k : ℤ) (x : Circle) : Circle :=  x + k • (θ : Circle)
  • definition OAI.Invariant233.Rotation.U line 268

    def U : Hilbert →L[ℂ] Hilbert :=  (WeightedShift.shift 1).toLinearIsometry.toContinuousLinearMap.compLpL 2 circleMeasure
  • definition OAI.Invariant233.Rotation.orbitWeight line 271

    def orbitWeight (θ : ℝ) (a : C(Circle, ℂ)) (x : Circle) : WeightedShift.Weight :=  ⟨fun k => a (action θ k x), memℓp_infty <| by    refine ⟨‖a‖, ?_⟩    rintro r ⟨k, rfl⟩    exact a.norm_coe_le_norm _⟩
  • definition OAI.Invariant233.Rotation.character line 277

    def character : C(Circle, ℂ) := fourier 1
  • definition OAI.Invariant233.Rotation.representation line 279

    def representation (θ : ℝ) (a : C(Circle, ℂ)) : Hilbert →L[ℂ] Hilbert :=  WeightedShift.fieldDiagonal (orbitWeight θ a) ‖a‖ (norm_nonneg a)    (fun x => lp.norm_le_of_forall_le (norm_nonneg a) (fun k => a.norm_coe_le_norm _))    (fun k => by      let : T0Space ℝ := @MetricSpace.instT0Space ℝ Real.metricSpace      let : T0Space ℂ := @MetricSpace.instT0Space ℂ Complex.instNormedAddCommGroup.toMetricSpace      change AEStronglyMeasurable (fun x : Circle => a (x + k • (θ : Circle))) circleMeasure      exact (a.continuous.comp (continuous_id.add continuous_const)).aestronglyMeasurable)
  • definition OAI.Invariant233.Rotation.V line 288

    def V (θ : ℝ) : Hilbert →L[ℂ] Hilbert := representation θ character
  • definition OAI.Invariant233.Rotation.algebra line 290

    def algebra (θ : ℝ) : VonNeumannAlgebra Hilbert :=  vonNeumannGenerated ({U, V θ} : Set (Hilbert →L[ℂ] Hilbert))

63 more definitions are reached the same way; the full file lists them.

Possible paper match, with no recorded review

Atlas selected this possible match by comparing words in the Lean statement with every statement in the family. No review of whether the statements mean the same thing is recorded.

Words of the Lean statement, its names split into words, that also appear in the theorem: rationally, conjugates, predual, factor, ii, costs, independent, atomic and 20 more. Shared only with the release’s name for the Lean statement or OpenAI’s note on it: delta, tp, nonzero and theta.

Statements in Invariant-projection counterexamples for every irrational rotation come first because the release’s name for this Lean statement shares words with that paper’s title.

Theorem A.1 of Invariant-projection counterexamples for every irrational rotation

Theorem (Product realization)

There are angles 0<\theta_i<1 and costs c_i>0, with \sum_i\theta_i<\infty and 1,\theta_1,\theta_2,\ldots rationally independent, such that the measurable weight

f(x)=\exp\left(-\sum_{i\ge1}c_i\lfloor x_i+\theta_i\rfloor\right)

is positive almost everywhere and has \int_X\log f\,d\mu=-\infty. The algebra M is a type \mathrm{II}_1 factor with separable predual, and T=U\pi(f) is nonzero and norm-quasinilpotent, with \Delta(T)=0. Every projection p\in M satisfying (1-p)Tp=0 is 0 or 1.

Moreover, |T| has pure-point spectral type. The abelian algebra generated by any finite family of polar conjugates U^n|T|U^{-n} is atomic, whereas W^*(U^n|T|U^{-n}:n\in\Z) is diffuse.

Appendix, A product-rotation realization Read it in the paper TeX source, line 27
Show the TeX
There are angles $0<\theta_i<1$ and costs $c_i>0$, with
$\sum_i\theta_i<\infty$ and $1,\theta_1,\theta_2,\ldots$ rationally
independent, such that the measurable weight
\[
 f(x)=\exp\left(-\sum_{i\ge1}c_i\lfloor x_i+\theta_i\rfloor\right)
\]
is positive almost everywhere and has $\int_X\log f\,d\mu=-\infty$.
The algebra $M$ is a type $\mathrm{II}_1$ factor with separable predual,
and $T=U\pi(f)$ is nonzero and norm-quasinilpotent, with
$\Delta(T)=0$.  Every projection $p\in M$ satisfying $(1-p)Tp=0$ is
$0$ or $1$.

Moreover, $|T|$ has pure-point spectral type.  The abelian algebra
generated by any finite family of polar conjugates
$U^n|T|U^{-n}$ is atomic, whereas
$W^*(U^n|T|U^{-n}:n\in\Z)$ is diffuse.

Other possible paper matches, closest wording first

  • Proposition A.9 of Invariant-projection counterexamples for every irrational rotation. Words of the Lean statement, its names split into words, that also appear in the theorem: countably, von, neumann, full, spectral, abelian and eight more. Shared only with the release’s name for the Lean statement or OpenAI’s note on it: constructed.
  • Proposition A.3 of Invariant-projection counterexamples for every irrational rotation. Words of the Lean statement, its names split into words, that also appear in the theorem: borel, probability, marginals, converging, sampling, one and 16 more. Shared only with the release’s name for the Lean statement or OpenAI’s note on it: theta.
  • Theorem 1.1 of Invariant-projection counterexamples for every irrational rotation. Words of the Lean statement, its names split into words, that also appear in the theorem: irrational, log, continuous, function and projection. Found in the paper’s title, which its main theorem states: counterexamples, rotation and invariant. Shared only with the release’s name for the Lean statement or OpenAI’s note on it: theta.
  • Corollary 1.4 of Invariant-projection counterexamples for every irrational rotation. Words of the Lean statement, its names split into words, that also appear in the theorem: nontrivial, infinite, hilbert, strongly, complex, space and five more. Shared only with the release’s name for the Lean statement or OpenAI’s note on it: nonzero.
  • Proposition A.2 of Invariant-projection counterexamples for every irrational rotation. Words of the Lean statement, its names split into words, that also appear in the theorem: coordinates, prescribed, fact, ranges, angles, realization and one more. Shared only with the release’s name for the Lean statement or OpenAI’s note on it: theta.
  • Theorem 1.1 of Backward intertwiners and a transitive commutant. Words of the Lean statement, its names split into words, that also appear in the theorem: multipliers, scalar, shifts, commutes, weights, properties and ten more. Shared only with the release’s name for the Lean statement or OpenAI’s note on it: nonzero and theta.

How Atlas selects possible matches: it compares words in the Lean statement with every statement in the family. It also splits Lean names into words. The release’s label and note receive less weight; a main theorem wins a close match. If the Lean wording yields no clear match, Atlas uses the catalogue description. This selects passages to compare; it does not establish that they mean the same thing.

Reported Comparator runs

two independent groups report that Comparator accepted runs for this Lean statement file: Carlos Toledo’s cert-machine; MathVet. Each group reports its own Comparator run for this statement file. Atlas has not repeated the runs.

For a configured theorem, Comparator tests whether OpenAI’s proof proves the exact Lean statement. Some files instead configure definitions for comparison by name and type. Acceptance does not establish that the statement means the same thing as the paper’s theorem.

Carlos Toledo’s cert-machine

How they ran it, in their words

Every Comparator challenge re-run on Linux with nanoda switched on, decided by a preregistered rule; every family’s challenge statements read against OpenAI’s headline, clause by clause. Decider: Comparator (leanprover/comparator d03acab1 = tag v4.34.0, built with the release’s toolchain v4.34.1), lean4export 076e8e57, landrun 811cfff5, nanoda_lib 3a240721 — on GitHub’s Linux runners (.github/workflows/openai-math-kernel.yml), one j…

  • Accepted Their term: “CERTIFIED”.

    Re-run through Comparator with the independent nanoda kernel switched on: Lean’s kernel and nanoda both accept OpenAI’s solution.

    Reported 10 October 2026, at the release version shown here. Original verification report

MathVet

How they ran it, in their words

An independent, model-assisted, pre-referee reading of each family’s challenge statements against its headline claim under a published rubric (PROTOCOL.md), with its own Comparator runs per challenge. Its protocol describes a planned error-rate study; this import does not establish that the study has been completed.

  • Accepted Their term: “comparator-sandboxed-pass”.

    Re-run through Comparator in a sandboxed virtual machine: accepted.

    Reported 8 October 2026, at the release version shown here. Original verification report

What an accepted Comparator run would establish

If Comparator is run under this configuration and accepts, the solution proves the configured theorem using only the allowed axioms, and the Lean kernel accepts every step.

This configuration lists no definition holes, so every definition the statement uses is compared as it is written in this file.

Allowed axioms: propext, Quot.sound, Classical.choice

Acceptance leaves open whether the Lean statement means the same thing as the paper’s theorem, whether the paper’s other claims are correct, and whether the result is new. Those questions require comparing the definitions and statements, reviewing the paper’s arguments, and reading the earlier literature.

Do family 293’s Lean statements express the advertised result?

These assessments compare all the family’s Lean statements with the whole result OpenAI describes in its catalogue. They do not assess this statement alone. Each group uses its own published rules.

MathVet and cert-machine agree on how much of the advertised result the Lean statements express.

  • MathVet

    Finds the whole advertised result stated or implied Their term: “full”.

    The challenge statements imply the headline claim after unpacking definitions or one routine step. Their record

    Their note: Both summary claims are stated: Hyperinvariant.main_theorem (hInf : ¬FiniteDimensional ℂ H) (also BackwardIntertwiners.direct_algebra_corollary) for every separable infinite-dimensional complex Hilbert space: ∃ T ≠ 0, ‖T^n‖^(1/n) → 0 ∧ TransitiveCommutant T ∧ commutant T ≠ ⊤ ∧ SOT-closed commutant (no nonzero proper closed hyperinvariant subspace), and for the invariant-projection counterexamples FiniteFactor.main_theorem (a II₁ factor with separable predual and a nonzero quasinilpotent T ∈ M with (1 - p) T p = 0 → p = 0 ∨ p = 1), IrrationalRotation.prescribed_irrational_counterexample (every irrational θ: continuous weight f with Rotation.IsContinuousCounterexample θ f, T in the irrational-rotation algebra, nonzero, norm-quasinilpotent, trivial invariant projections) and ProductBrown (Brown measure δ₀). 'Hyperfinite' is only implicit (FiniteFactor asserts a II₁ factor with separable predual; the rotation algebra is the hyperfinite one by construction).

    Definitions the group asks readers to compare with the paper: Hand-written operator-algebra notions: TransitiveCommutant T := ∀ K closed submodule, (∀ A commuting with T, A K ⊆ K) → K = ⊥ ∨ K = ⊤, HasOnlyTrivialInvariantProjections, NormQuasinilpotent, vectorFugledeKadisonDeterminant, IsVectorBrownMeasure, strongOperatorTopology, HasSeparablePredual M := ∃ separable Banach E, Nonempty (StrongDual ℂ E ≃ₗᵢ⋆[ℂ] M); quasinilpotence is via ‖T^n‖^(1/n) → 0 and ContinuousCircleWeight.MainStatement does not itself state quasinilpotence (only trivial invariant projections for a weight with log-integral -∞).

  • Carlos Toledo’s cert-machine

    Finds the whole advertised result stated or implied Their term: “MATCHES”.

    The challenge statements state the headline as OpenAI wrote it. Their record

Read the complete assessments on the family page.

OpenAI’s own note on what this Lean statement covers

“For every irrational rotation angle $\theta\in(0,1)$, the formalization constructs a continuous nonnegative circle weight with a single zero and logarithmic integral $-\infty$ whose weighted rotation is nonzero and quasinilpotent. In its associated hyperfinite type $\mathrm{II}_1$ factor, the operator has no nontrivial invariant projection: $(1-p)Tp=0$ forces $p=0$ or $p=1$. The linked statements also include an earlier existence construction, a product realization, and the selected product model's Brown measure $\delta_0$.”

An AI agent drafted an interpretation of that note, classifying this statement as “states a paper’s theorem as the paper does”. No human review of the draft is recorded.

Supporting material

The complete Lean statement file

849 lines, copied from release version fd4aeeb. A name defined in this file links to its line; pointing at the name shows its definition.

Declared in this fileOpenAI’s library at fd4aeebOther linked names open the current documentation for Mathlib, Lean’s mathematical library.

Links in the file: 393 to its own declarations, 391 to Mathlib’s documentation. 115 declared names also link to the same declaration in OpenAI’s library. 2 identifiers stay plain because they resolve to no single declaration: variables Lean binds automatically, notation, or names the scan of the pinned sources did not find. OpenAI uses Mathlib version d13f23b. The linked documentation describes the current version, so names that have since changed may be missing there.

import Mathlibnamespace OAIsectionnoncomputable sectionopen Filter MeasureTheoryopen scoped ENNReal Topologynamespace Invariant233abbrev Circle := AddCircle (1 : ℝ)def circleMeasure : Measure Circle := volumedef negLogCost (t : ℝ) : ℝ≥0∞ :=  if t = 0 then ∞ else ENNReal.ofReal (-Real.log |t|)def HasNegInfiniteLogIntegral {X : Type*} [MeasurableSpace X]    (μ : Measure X) (f : X → ℝ) : Prop :=  (∫⁻ x, negLogCost (f x) ∂μ) = ∞def scalarWeightDeterminant {X : Type*} [MeasurableSpace X]    (μ : Measure X) (f : X → ℝ) : ℝ≥0∞ :=  EReal.exp (-((∫⁻ x, negLogCost (f x) ∂μ) : EReal))def NormQuasinilpotent {A : Type*} [NormedRing A] (T : A) : Prop :=  Tendsto (fun n : ℕ => ‖T ^ n‖ ^ (1 / (n : ℝ))) atTop (𝓝 0)def IsContinuousCircleWeight (f : Circle → ℝ) : Prop :=  Continuous f ∧ (∀ x, 0 ≤ f x ∧ f x ≤ 1) ∧    (∀ x, f x = 0 ↔ x = 0) ∧ HasNegInfiniteLogIntegral circleMeasure fend Invariant233endendsectionnoncomputable sectionopen scoped ENNRealnamespace Invariant233.WeightedShiftabbrev Hilbert := lp (fun _ : ℤ => ℂ) 2abbrev Weight := lp (fun _ : ℤ => ℂ) ∞def reindex (e : Equiv.Perm ℤ) : Hilbert ≃ₗᵢ[ℂ] Hilbert where  toFun ξ := ⟨fun k => ξ (e k), memℓp_gen <|    (e.summable_iff).2 ((lp.memℓp ξ).summable (by norm_num))⟩  invFun ξ := ⟨fun k => ξ (e.symm k), memℓp_gen <|    (e.symm.summable_iff).2 ((lp.memℓp ξ).summable (by norm_num))⟩  left_inv ξ := by ext k; simp  right_inv ξ := by ext k; simp  map_add' ξ η := by ext k; rfl  map_smul' c ξ := by ext k; rfl  norm_map' ξ := by    rw [lp.norm_eq_tsum_rpow (by norm_num), lp.norm_eq_tsum_rpow (by norm_num)]    congr 1    exact e.tsum_eq (fun k => ‖ξ k‖ ^ (2 : ENNReal).toReal)def shift (m : ℤ) : Hilbert ≃ₗᵢ[ℂ] Hilbert := reindex (Equiv.addRight (-m))def diagonal (w : Weight) : Hilbert →L[ℂ] Hilbert :=  lp.mapCLM 2 (fun k => w k • ContinuousLinearMap.id ℂ ℂ) (norm_nonneg w)    (fun k => by      let : T0Space ℂ := @MetricSpace.instT0Space ℂ Complex.instNormedAddCommGroup.toMetricSpace      simpa [norm_smul] using lp.norm_apply_le_norm (by simp) w k)def diagonalAlgHom : Weight →ₐ[ℂ] (Hilbert →L[ℂ] Hilbert) where  toFun := diagonal  map_one' := by    ext ξ k    change (1 : ℂ) * ξ k = ξ k    exact one_mul _  map_mul' w v := by    ext ξ k    change (w k * v k) * ξ k = w k * (v k * ξ k)    exact mul_assoc _ _ _  map_zero' := by    ext ξ k    change (0 : ℂ) * ξ k = 0    exact zero_mul _  map_add' w v := by    ext ξ k    change (w k + v k) * ξ k = w k * ξ k + v k * ξ k    exact add_mul _ _ _  commutes' c := by    ext ξ k    change c * ξ k = c * ξ k    rfldef translate (w : Weight) (m : ℤ) : Weight :=  ⟨fun k => w (k + m), memℓp_infty <| by    refine ⟨‖w‖, ?_⟩    rintro r ⟨k, rfl⟩    exact lp.norm_apply_le_norm (by simp) w (k + m)⟩def operator (w : Weight) : Hilbert →L[ℂ] Hilbert :=  (shift 1).toLinearIsometry.toContinuousLinearMap.comp (diagonal w)def orbitProduct (w : Weight) (n : ℕ) : Weight :=  ⟨fun k => ∏ j ∈ Finset.range n, w (k + j), memℓp_infty <| by    refine ⟨‖w‖ ^ n, ?_⟩    rintro r ⟨k, rfl⟩    calc      ‖∏ j ∈ Finset.range n, w (k + j)‖ ≤          ∏ j ∈ Finset.range n, ‖w (k + j)‖ := le_of_eq (norm_prod _ _)      _ ≤ ∏ _j ∈ Finset.range n, ‖w‖ := by        apply Finset.prod_le_prod₀        · intro j hj; exact norm_nonneg _        · intro j hj; exact lp.norm_apply_le_norm (by simp) w _      _ = ‖w‖ ^ n := by simp⟩def tailWeight (m : ℤ) : Weight :=  ⟨fun k => if m ≤ k then 1 else 0, memℓp_infty <| by    refine ⟨1, ?_⟩    rintro r ⟨k, rfl⟩    by_cases h : m ≤ k <;> simp [h]⟩def tailProjection (m : ℤ) : Hilbert →L[ℂ] Hilbert := diagonal (tailWeight m)end Invariant233.WeightedShiftendendsectionopen scoped Pointwisenamespace Invariant233variable {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H]  [CompleteSpace H]local instance instStarModuleGenerated : StarModule ℂ (H →L[ℂ] H) :=  ContinuousLinearMap.instStarModuleIdnoncomputable def vonNeumannGenerated (s : Set (H →L[ℂ] H)) : VonNeumannAlgebra H where  toStarSubalgebra :=    StarSubalgebra.centralizer ℂ (StarSubalgebra.centralizer ℂ s : Set (H →L[ℂ] H))  centralizer_centralizer' := by    change Set.centralizer (Set.centralizer      (StarSubalgebra.centralizer ℂ (StarSubalgebra.centralizer ℂ s : Set (H →L[ℂ] H)) :        Set (H →L[ℂ] H))) = _    rw [StarSubalgebra.coe_centralizer_centralizer]    rw [Set.centralizer_centralizer_centralizer]    exact (StarSubalgebra.coe_centralizer_centralizer ℂ s).symmend Invariant233endsectionnoncomputable sectionopen MeasureTheory Filteropen scoped ENNReal lp Topologyrun_cmd Lean.modifyEnv fun env => Lean.Meta.auxLemmasExt.setState env {}namespace Invariant233.WeightedShiftvariable {X : Type*} [MeasurableSpace X] {μ : Measure X}theorem diagonal_value (w : Weight) (v : Hilbert) (i : ℤ) :    diagonal w v i = w i * v i := rfltheorem diagonal_bound (w : Weight) (C : ℝ) (hw : ‖w‖ ≤ C) (v : Hilbert) :    ‖diagonal w v‖ ≤ C * ‖v‖ := by  apply (diagonal w).le_of_opNorm_le  exact (lp.norm_mapCLM_le 2 _ (norm_nonneg w) _).trans hwtheorem diagonal_aestronglyMeasurable (a : X → Weight) (C : ℝ) (_hC : 0 ≤ C)    (_ha : ∀ x, ‖a x‖ ≤ C)    (hm : ∀ i, AEStronglyMeasurable (fun x => a x i) μ)    {f : X → Hilbert} (hf : AEStronglyMeasurable f μ) :    AEStronglyMeasurable (fun x => diagonal (a x) (f x)) μ := by  classical  let : Nonempty (Finset ℤ) := ⟨∅⟩  let F : Finset ℤ → X → Hilbert :=    fun s => ∑ i ∈ s, fun x => lp.single 2 i (a x i * f x i)  apply aestronglyMeasurable_of_tendsto_ae (atTop : Filter (Finset ℤ))    (f := F)  · intro s    apply Finset.aestronglyMeasurable_sum    intro i hi    exact (lp.singleContinuousLinearMap ℂ (fun _ : ℤ => ℂ) 2 i).continuous.comp_aestronglyMeasurable      ((hm i).mul ((lp.evalCLM ℂ (fun _ : ℤ => ℂ) 2 i).continuous.comp_aestronglyMeasurable hf))  · apply Filter.Eventually.of_forall    intro x    simpa only [F, Finset.sum_apply, diagonal_value, HasSum, SummationFilter.unconditional] using      lp.hasSum_single (by norm_num) (diagonal (a x) (f x))def fieldDiagonalVec (a : X → Weight) (C : ℝ) (hC : 0 ≤ C)    (ha : ∀ x, ‖a x‖ ≤ C)    (hm : ∀ i, AEStronglyMeasurable (fun x => a x i) μ)    (f : Lp (Hilbert) 2 μ) : Lp (Hilbert) 2 μ :=  ((Lp.memLp f).of_le_mul    (diagonal_aestronglyMeasurable a C hC ha hm (Lp.aestronglyMeasurable f))    (Filter.Eventually.of_forall fun x => diagonal_bound (a x) C (ha x) (f x))).toLp _theorem fieldDiagonalVec_ae (a : X → Weight) (C : ℝ) (hC : 0 ≤ C)    (ha : ∀ x, ‖a x‖ ≤ C)    (hm : ∀ i, AEStronglyMeasurable (fun x => a x i) μ)    (f : Lp (Hilbert) 2 μ) :    fieldDiagonalVec a C hC ha hm f =ᵐ[μ]      fun x => diagonal (a x) (f x) :=  MemLp.coeFn_toLp _def fieldDiagonalLinear (a : X → Weight) (C : ℝ) (hC : 0 ≤ C)    (ha : ∀ x, ‖a x‖ ≤ C)    (hm : ∀ i, AEStronglyMeasurable (fun x => a x i) μ) :    Lp (Hilbert) 2 μ →ₗ[ℂ] Lp (Hilbert) 2 μ where  toFun := fieldDiagonalVec a C hC ha hm  map_add' f g := by    apply Lp.ext    filter_upwards [fieldDiagonalVec_ae a C hC ha hm (f + g),      fieldDiagonalVec_ae a C hC ha hm f, fieldDiagonalVec_ae a C hC ha hm g,      Lp.coeFn_add f g, Lp.coeFn_add        (fieldDiagonalVec a C hC ha hm f) (fieldDiagonalVec a C hC ha hm g)]      with x hfg hf hg hsum hout    simp only [Pi.add_apply] at hsum hout    rw [hfg, hout, hf, hg, hsum, map_add]  map_smul' c f := by    change fieldDiagonalVec a C hC ha hm (c • f) = c • fieldDiagonalVec a C hC ha hm f    apply Lp.ext    filter_upwards [fieldDiagonalVec_ae a C hC ha hm (c • f),      fieldDiagonalVec_ae a C hC ha hm f, Lp.coeFn_smul c f,      Lp.coeFn_smul c (fieldDiagonalVec a C hC ha hm f)] with x hcf hf hsmul hout    simp only [Pi.smul_apply] at hsmul hout    rw [hcf, hout, hf, hsmul, map_smul]def fieldDiagonal (a : X → Weight) (C : ℝ) (hC : 0 ≤ C)    (ha : ∀ x, ‖a x‖ ≤ C)    (hm : ∀ i, AEStronglyMeasurable (fun x => a x i) μ) :    Lp (Hilbert) 2 μ →L[ℂ] Lp (Hilbert) 2 μ :=  (fieldDiagonalLinear a C hC ha hm).mkContinuous C (by    intro f    apply Lp.norm_le_mul_norm_of_ae_le_mul    change ∀ᵐ x ∂μ, ‖fieldDiagonalVec a C hC ha hm f x‖ ≤ C * ‖f x‖    filter_upwards [fieldDiagonalVec_ae a C hC ha hm f] with x hx    rw [hx]    exact diagonal_bound (a x) C (ha x) (f x))end Invariant233.WeightedShiftendendsectionnoncomputable sectionopen MeasureTheoryopen scoped ENNRealnamespace Invariant233.Rotationrun_cmd Lean.modifyEnv fun env => Lean.Meta.auxLemmasExt.setState env {}instance circleMeasure_probability : IsProbabilityMeasure circleMeasure := by  constructor  change volume (Set.univ : Set Circle) = 1  exact UnitAddCircle.measure_univabbrev Fiber := WeightedShift.Hilbertabbrev Hilbert := MeasureTheory.Lp Fiber 2 circleMeasuredef action (θ : ℝ) (k : ℤ) (x : Circle) : Circle :=  x + k • (θ : Circle)def U : Hilbert →L[ℂ] Hilbert :=  (WeightedShift.shift 1).toLinearIsometry.toContinuousLinearMap.compLpL 2 circleMeasuredef orbitWeight (θ : ℝ) (a : C(Circle, ℂ)) (x : Circle) : WeightedShift.Weight :=  ⟨fun k => a (action θ k x), memℓp_infty <| by    refine ⟨‖a‖, ?_⟩    rintro r ⟨k, rfl⟩    exact a.norm_coe_le_norm _⟩def character : C(Circle, ℂ) := fourier 1def representation (θ : ℝ) (a : C(Circle, ℂ)) : Hilbert →L[ℂ] Hilbert :=  WeightedShift.fieldDiagonal (orbitWeight θ a) ‖a‖ (norm_nonneg a)    (fun x => lp.norm_le_of_forall_le (norm_nonneg a) (fun k => a.norm_coe_le_norm _))    (fun k => by      let : T0Space ℝ := @MetricSpace.instT0Space ℝ Real.metricSpace      let : T0Space ℂ := @MetricSpace.instT0Space ℂ Complex.instNormedAddCommGroup.toMetricSpace      change AEStronglyMeasurable (fun x : Circle => a (x + k • (θ : Circle))) circleMeasure      exact (a.continuous.comp (continuous_id.add continuous_const)).aestronglyMeasurable)def V (θ : ℝ) : Hilbert →L[ℂ] Hilbert := representation θ characterdef algebra (θ : ℝ) : VonNeumannAlgebra Hilbert :=  vonNeumannGenerated ({U, V θ} : Set (Hilbert →L[ℂ] Hilbert))def weighted (θ : ℝ) (a : C(Circle, ℂ)) : Hilbert →L[ℂ] Hilbert :=  U * representation θ adef complexWeight (f : C(Circle, ℝ)) : C(Circle, ℂ) :=  ⟨fun x => (f x : ℂ), Complex.continuous_ofReal.comp f.continuous⟩def weightedReal (θ : ℝ) (f : C(Circle, ℝ)) : Hilbert →L[ℂ] Hilbert :=  weighted θ (complexWeight f)def vacuum : Hilbert := Lp.const 2 circleMeasure (lp.single 2 (0 : ℤ) (1 : ℂ))def vacuumFunctional (T : Hilbert →L[ℂ] Hilbert) : ℂ := inner ℂ vacuum (T vacuum)end Invariant233.Rotationendendsectionnoncomputable sectionnamespace Invariant233run_cmd Lean.modifyEnv fun env => Lean.Meta.auxLemmasExt.setState env {}universe uvariable {H : Type u} [NormedAddCommGroup H] [InnerProductSpace ℂ H]  [CompleteSpace H]def HasOnlyTrivialInvariantProjections (M : VonNeumannAlgebra H)    (T : H →L[ℂ] H) : Prop :=  ∀ p : H →L[ℂ] H, p ∈ M → IsStarProjection p →    (1 - p) * T * p = 0 → p = 0 ∨ p = 1def IsProjectionAtom (M : VonNeumannAlgebra H) (p : H →L[ℂ] H) : Prop :=  p ∈ M ∧ IsStarProjection p ∧ p ≠ 0 ∧    ∀ q : H →L[ℂ] H, q ∈ M → IsStarProjection q → q * p = q →      q = 0 ∨ q = pdef IsAtomicVonNeumannAlgebra (M : VonNeumannAlgebra H) : Prop :=  ∀ p : H →L[ℂ] H, p ∈ M → IsStarProjection p → p ≠ 0 →    ∃ q : H →L[ℂ] H, IsProjectionAtom M q ∧ q * p = qdef IsAbelianVonNeumannAlgebra (M : VonNeumannAlgebra H) : Prop :=  ∀ A B : H →L[ℂ] H, A ∈ M → B ∈ M → Commute A Bdef IsDiffuseVonNeumannAlgebra (M : VonNeumannAlgebra H) : Prop :=  ∀ p : H →L[ℂ] H, ¬ IsProjectionAtom M pdef IsFactor (M : VonNeumannAlgebra H) : Prop :=  Nontrivial H ∧ ∀ A : H →L[ℂ] H, A ∈ M →    (∀ B : H →L[ℂ] H, B ∈ M → Commute A B) →      ∃ c : ℂ, A = c • (1 : H →L[ℂ] H)def vectorTrace (ξ : H) (A : H →L[ℂ] H) : ℂ :=  @inner ℂ H InnerProductSpace.toInner ξ (A ξ)def IsFaithfulTracialVector (M : VonNeumannAlgebra H) (ξ : H) : Prop :=  ‖ξ‖ = 1 ∧    (∀ A B : H →L[ℂ] H, A ∈ M → B ∈ M →      vectorTrace ξ (A * B) = vectorTrace ξ (B * A)) ∧    (∀ A : H →L[ℂ] H, A ∈ M → A.IsPositive →      vectorTrace ξ A = 0 → A = 0)def IsTypeII1FactorWithVector (M : VonNeumannAlgebra H) (ξ : H) : Prop :=  IsFactor M ∧ IsDiffuseVonNeumannAlgebra M ∧ IsFaithfulTracialVector M ξlocal instance instNormedAlgebraPredual : NormedAlgebra ℂ (H →L[ℂ] H) :=  ContinuousLinearMap.toNormedAlgebradef HasSeparablePredual (M : VonNeumannAlgebra H) : Prop :=  ∃ (X : Type u) (_ : NormedAddCommGroup X) (_ : NormedSpace ℂ X)    (_ : CompleteSpace X) (_ : TopologicalSpace.SeparableSpace X),    Nonempty (StrongDual ℂ X ≃ₗᵢ[ℂ] M.toStarSubalgebra)end Invariant233endendsectionnoncomputable sectionopen MeasureTheoryopen scoped ENNRealnamespace Invariant233run_cmd Lean.modifyEnv fun env => Lean.Meta.auxLemmasExt.setState env {}structure TracialState (A : Type*) [CStarAlgebra A] where  toContinuousLinearMap : A →L[ℂ] ℂ  map_one : toContinuousLinearMap 1 = 1  map_star : ∀ a, toContinuousLinearMap (star a) = star (toContinuousLinearMap a)  positive : ∀ a, 0 ≤ (toContinuousLinearMap (star a * a)).re  tracial : ∀ a b, toContinuousLinearMap (a * b) = toContinuousLinearMap (b * a)namespace TracialStatevariable {A : Type*} [CStarAlgebra A]instance : CoeFun (TracialState A) (fun _ => A → ℂ) :=  ⟨fun τ => τ.toContinuousLinearMap⟩end TracialStatedef fugledeKadisonDeterminant {A : Type*} [CStarAlgebra A]    (τ : TracialState A) (a : A) : ℝ≥0∞ :=  ⨅ ε : {r : ℝ // 0 < r},    ENNReal.ofReal (Real.exp ((τ (CFC.log (star a * a + (ε.val : ℝ) • (1 : A)))).re / 2))def logarithmicPotentialDeterminant (μ : Measure ℂ) (z : ℂ) : ℝ≥0∞ :=  ⨅ ε : {r : ℝ // 0 < r},    ENNReal.ofReal (Real.exp ((∫ w, Real.log (‖w - z‖ ^ 2 + ε.val) ∂μ) / 2))def IsBrownMeasure {A : Type*} [CStarAlgebra A]    (τ : TracialState A) (a : A) (μ : Measure ℂ) : Prop :=  IsProbabilityMeasure μ ∧ IsCompact μ.support ∧    ∀ z : ℂ, fugledeKadisonDeterminant τ (a - algebraMap ℂ A z) =      logarithmicPotentialDeterminant μ zend Invariant233endendsectionnoncomputable sectionopen MeasureTheoryopen scoped ENNRealnamespace Invariant233variable {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H]run_cmd Lean.modifyEnv fun env => Lean.Meta.auxLemmasExt.setState env {}def vectorFugledeKadisonDeterminant (ξ : H) (T : H →L[ℂ] H) : ℝ≥0∞ :=  ⨅ ε : {r : ℝ // 0 < r}, ENNReal.ofReal    (Real.exp ((vectorTrace ξ (CFC.log (star T * T + ε.val • (1 : H →L[ℂ] H)))).re / 2))def IsVectorBrownMeasure (ξ : H) (T : H →L[ℂ] H) (μ : Measure ℂ) : Prop :=  IsProbabilityMeasure μ ∧ IsCompact μ.support ∧ ∀ z : ℂ,    vectorFugledeKadisonDeterminant ξ (T - z • (1 : H →L[ℂ] H)) =      logarithmicPotentialDeterminant μ zdef operatorModulus (T : H →L[ℂ] H) : H →L[ℂ] H := CFC.sqrt (star T * T)def HasCountablyAtomicSpectralType (B : H →L[ℂ] H) : Prop :=  ∃ S : Set ℂ, S.Countable ∧    (⨆ z : S, Module.End.eigenspace B.toLinearMap z.val).topologicalClosure = ⊤def polarConjugate (U B : H →L[ℂ] H) (n : ℤ) : H →L[ℂ] H :=  if 0 ≤ n then U ^ n.toNat * B * star U ^ n.toNat  else star U ^ (-n).toNat * B * U ^ (-n).toNatdef finitePolarAlgebra (U B : H →L[ℂ] H) (F : Finset ℤ) : VonNeumannAlgebra H :=  vonNeumannGenerated {A | ∃ n ∈ F, A = polarConjugate U B n}def fullPolarAlgebra (U B : H →L[ℂ] H) : VonNeumannAlgebra H :=  vonNeumannGenerated (Set.range (polarConjugate U B))def ProductPolarStructure (U T : H →L[ℂ] H) : Prop :=  star U * U = 1 ∧ U * star U = 1 ∧ T = U * operatorModulus T ∧    Function.Injective (operatorModulus T) ∧ HasCountablyAtomicSpectralType (operatorModulus T) ∧    (∀ F : Finset ℤ,      IsAbelianVonNeumannAlgebra (finitePolarAlgebra U (operatorModulus T) F) ∧      IsAtomicVonNeumannAlgebra (finitePolarAlgebra U (operatorModulus T) F)) ∧    IsAbelianVonNeumannAlgebra (fullPolarAlgebra U (operatorModulus T)) ∧    IsDiffuseVonNeumannAlgebra (fullPolarAlgebra U (operatorModulus T))end Invariant233endendsectionnoncomputable sectionopen MeasureTheoryopen scoped ENNRealnamespace Invariant233run_cmd Lean.modifyEnv fun env => Lean.Meta.auxLemmasExt.setState env {}def circleRepresentative (x : Circle) : ℝ :=  (AddCircle.equivIco (1 : ℝ) 0 x).valinstance circleMeasure_probability : IsProbabilityMeasure circleMeasure := by  constructor  simp [circleMeasure, Circle, AddCircle.measure_univ]namespace ProductModelabbrev Base := ℕ → Circledef baseMeasure : Measure Base := Measure.infinitePi (fun _ : ℕ => circleMeasure)instance baseMeasure_probability : IsProbabilityMeasure baseMeasure := by  unfold baseMeasure  infer_instancedef Ordered (x y : Base) : Prop :=  ∀ i, circleRepresentative (x i) ≤ circleRepresentative (y i)def rotation (θ : ℕ → ℝ) (x : Base) : Base :=  fun i => x i + (θ i : Circle)def rotationIterate (θ : ℕ → ℝ) (k : ℤ) (x : Base) : Base :=  fun i => x i + ((k : ℝ) * θ i : ℝ)def logarithmicCost (θ c : ℕ → ℝ) (x : Base) : ℝ≥0∞ :=  ∑' i, ENNReal.ofReal (c i * (⌊circleRepresentative (x i) + θ i⌋ : ℤ))def weight (θ c : ℕ → ℝ) (x : Base) : ℝ :=  (EReal.exp (-(logarithmicCost θ c x : EReal))).toRealdef JointlyRationallyIndependent (θ : ℕ → ℝ) : Prop :=  LinearIndependent ℚ (fun i : Option ℕ => i.elim 1 θ)def AdmissibleAnglesAndCosts (θ c : ℕ → ℝ) : Prop :=  (∀ i, 0 < θ i ∧ θ i < 1 ∧ 0 < c i) ∧    Summable θ ∧ JointlyRationallyIndependent θabbrev Fiber := @lp ℤ (fun _ => ℂ) (fun _ => Complex.instNormedAddCommGroup) 2abbrev Hilbert :=  @MeasureTheory.Lp Base Fiber MeasurableSpace.pi    (@lp.normedAddCommGroup ℤ (fun _ => ℂ) 2      (fun _ => Complex.instNormedAddCommGroup) fact_one_le_two_ennreal)    2 baseMeasureend ProductModelend Invariant233endendsectionnoncomputable sectionopen MeasureTheoryopen scoped ENNRealnamespace Invariant233.ProductModelrun_cmd Lean.modifyEnv fun env => Lean.Meta.auxLemmasExt.setState env {}theorem measurable_rep : Measurable circleRepresentative :=  measurable_subtype_coe.comp (AddCircle.measurableEquivIco (T := (1 : ℝ)) 0).measurabletheorem measurable_iterate (θ : ℕ → ℝ) (k : ℤ) :    Measurable (rotationIterate θ k) := by  let : T0Space ℝ := @MetricSpace.instT0Space ℝ Real.metricSpace  let : BorelSpace Circle := QuotientAddGroup.borelSpace  let : ContinuousAdd Circle :=    (QuotientAddGroup.instIsTopologicalAddGroup (AddSubgroup.zmultiples (1 : ℝ))).toContinuousAdd  let : MeasurableAdd Circle := ContinuousAdd.measurableAdd  apply Measurable.of_eval  intro i  exact (measurable_pi_apply i).add_const _theorem measurable_cost (θ c : ℕ → ℝ) : Measurable (logarithmicCost θ c) := by  apply Measurable.tsum  intro i  have hm : Measurable (fun x : Base => circleRepresentative (x i) + θ i) :=    (measurable_rep.comp (measurable_pi_apply i)).add_const (θ i)  have hc : Measurable (fun x : Base => (⌊circleRepresentative (x i) + θ i⌋ : ℝ)) :=    (measurable_of_countable (fun z : ℤ => (z : ℝ))).comp hm.floor  exact (measurable_const.mul hc).ennreal_ofRealtheorem weight_measurable (θ c : ℕ → ℝ) : Measurable (weight θ c) := by  exact (measurable_cost θ c).coe_ereal_ennreal.neg.ereal_exp.ennreal_toRealtheorem weight_nonneg (θ c : ℕ → ℝ) (x : Base) : 0 ≤ weight θ c x :=  ENNReal.toReal_nonnegtheorem weight_le_one (θ c : ℕ → ℝ) (x : Base) : weight θ c x ≤ 1 := by  have h : EReal.exp (-(logarithmicCost θ c x : EReal)) ≤ 1 := by    rw [← EReal.exp_zero]    apply EReal.exp_le_exp_iff.mpr    exact EReal.neg_le_zero.mpr (EReal.coe_ennreal_nonneg (logarithmicCost θ c x))  exact (ENNReal.toReal_mono (by simp) h).trans (by simp)def shiftOperator : Hilbert →L[ℂ] Hilbert :=  (WeightedShift.shift 1).toLinearIsometry.toContinuousLinearMap.compLpL 2 baseMeasuredef multiplierField (θ : ℕ → ℝ) (g : Base → ℂ) (C : ℝ)    (hb : ∀ x, ‖g x‖ ≤ C) (x : Base) : WeightedShift.Weight :=  ⟨fun k => g (rotationIterate θ k x), memℓp_infty <| by    refine ⟨C, ?_⟩    rintro r ⟨k, rfl⟩    exact hb _⟩def multiplier (θ : ℕ → ℝ) (g : Base → ℂ) (C : ℝ) (hC : 0 ≤ C)    (hg : Measurable g) (hb : ∀ x, ‖g x‖ ≤ C) : Hilbert →L[ℂ] Hilbert :=  WeightedShift.fieldDiagonal (multiplierField θ g C hb) C hC    (fun _x => lp.norm_le_of_forall_le hC (fun _k => hb _))    (fun k => (hg.comp (measurable_iterate θ k)).aestronglyMeasurable)def multiplierGenerators (θ : ℕ → ℝ) : Set (Hilbert →L[ℂ] Hilbert) :=  {A | ∃ (g : Base → ℂ) (C : ℝ) (hC : 0 ≤ C) (hg : Measurable g)    (hb : ∀ x, ‖g x‖ ≤ C), A = multiplier θ g C hC hg hb}def factor (θ : ℕ → ℝ) : VonNeumannAlgebra Hilbert :=  vonNeumannGenerated ({shiftOperator} ∪ multiplierGenerators θ)def traceVector : Hilbert := Lp.const 2 baseMeasure (lp.single 2 0 (1 : ℂ))theorem measurable_complexWeight (θ c : ℕ → ℝ) :    Measurable (fun x => (weight θ c x : ℂ)) :=  (weight_measurable θ c).complex_ofRealtheorem norm_complexWeight_le_one (θ c : ℕ → ℝ) (x : Base) :    ‖(weight θ c x : ℂ)‖ ≤ 1 := by  simpa only [Complex.norm_real, Real.norm_eq_abs, abs_of_nonneg (weight_nonneg θ c x)]    using weight_le_one θ c xlocal instance instNormedAddCommGroupProductWeightedOperator : NormedAddCommGroup Hilbert :=  @MeasureTheory.Lp.instNormedAddCommGroup Base Fiber MeasurableSpace.pi 2 baseMeasure    (@lp.normedAddCommGroup ℤ (fun _ => ℂ) 2      (fun _ => Complex.instNormedAddCommGroup) fact_one_le_two_ennreal)    fact_one_le_two_ennreallocal instance instInnerProductSpaceProductWeightedOperator :    @InnerProductSpace ℂ Hilbert Complex.instRCLike      instNormedAddCommGroupProductWeightedOperator.toSeminormedAddCommGroup :=  @MeasureTheory.L2.innerProductSpace Base Fiber ℂ Complex.instRCLike MeasurableSpace.pi    baseMeasure    (@lp.normedAddCommGroup ℤ (fun _ => ℂ) 2      (fun _ => Complex.instNormedAddCommGroup) fact_one_le_two_ennreal)    (@lp.instInnerProductSpace ℤ ℂ Complex.instRCLike (fun _ => ℂ)      (fun _ => Complex.instNormedAddCommGroup)      (fun _ => @RCLike.innerProductSpace ℂ Complex.instRCLike))local instance instTopologicalSpaceProductWeightedOperator : TopologicalSpace Hilbert :=  instNormedAddCommGroupProductWeightedOperator.toUniformSpace.toTopologicalSpacelocal instance instAddCommMonoidProductWeightedOperator : AddCommMonoid Hilbert :=  instNormedAddCommGroupProductWeightedOperator.toAddCommGroup.toAddCommMonoidlocal instance instModuleProductWeightedOperator : Module ℂ Hilbert :=  instInnerProductSpaceProductWeightedOperator.toNormedSpace.toModulelocal notation "weightedOperatorSemiring" =>  Complex.instNormedField.toField.toCommRing.toRing.toSemiringlocal notation "weightedOperatorScalarIdentity" =>  @RingHom.id ℂ (@Semiring.toNonAssocSemiring ℂ weightedOperatorSemiring)run_cmd Lean.modifyEnv fun env => Lean.Meta.auxLemmasExt.setState env {}def weightedOperator (θ c : ℕ → ℝ) :    @ContinuousLinearMap ℂ ℂ weightedOperatorSemiring weightedOperatorSemiring      weightedOperatorScalarIdentity      Hilbert instTopologicalSpaceProductWeightedOperator instAddCommMonoidProductWeightedOperator      Hilbert instTopologicalSpaceProductWeightedOperator instAddCommMonoidProductWeightedOperator      instModuleProductWeightedOperator instModuleProductWeightedOperator :=  let compose := fun (Scalar : Type) [Semiring Scalar] (Space : Type)      [TopologicalSpace Space] [AddCommMonoid Space] [Module Scalar Space]      (left right : Space →L[Scalar] Space) => left ∘L right  @compose ℂ weightedOperatorSemiring Hilbert instTopologicalSpaceProductWeightedOperator    instAddCommMonoidProductWeightedOperator instModuleProductWeightedOperator    shiftOperator (multiplier θ (fun x => (weight θ c x : ℂ)) 1 zero_le_one      (measurable_complexWeight θ c) (norm_complexWeight_le_one θ c))end Invariant233.ProductModelendendsectionnoncomputable sectionopen Filter MeasureTheoryopen scoped ENNReal Topology BigOperatorsnamespace Invariant233.ProductModelrun_cmd Lean.modifyEnv fun env => Lean.Meta.auxLemmasExt.setState env {}abbrev EndpointPair := Base × Basedef selectedEndpoint (I : Finset ℕ) (x z : Base) : Base :=  fun i => if i ∈ I then z i else x idef triangularEvent (I : Finset ℕ) : Set EndpointPair :=  {xz | ∀ i ∈ I, circleRepresentative (xz.1 i) < circleRepresentative (xz.2 i)}def triangularLaw (I : Finset ℕ) : Measure EndpointPair :=  Measure.map (fun xz : EndpointPair => (xz.1, selectedEndpoint I xz.1 xz.2))    ((baseMeasure.prod baseMeasure).restrict (triangularEvent I))def triangularFirstDensity (I : Finset ℕ) (x : Base) : ℝ :=  ∏ i ∈ I, (1 - circleRepresentative (x i))def triangularSecondDensity (I : Finset ℕ) (y : Base) : ℝ :=  ∏ i ∈ I, circleRepresentative (y i)def TriangularLawProperties (I : Finset ℕ) : Prop :=  IsFiniteMeasure (triangularLaw I) ∧  triangularLaw I Set.univ = (1 / 2 : ℝ≥0∞) ^ I.card ∧  (triangularLaw I).map Prod.fst =    baseMeasure.withDensity (fun x => ENNReal.ofReal (triangularFirstDensity I x)) ∧  (triangularLaw I).map Prod.snd =    baseMeasure.withDensity (fun y => ENNReal.ofReal (triangularSecondDensity I y)) ∧  (∀ᵐ xy ∂triangularLaw I, Ordered xy.1 xy.2) ∧  (∀ x, 0 ≤ triangularFirstDensity I x ∧ triangularFirstDensity I x ≤ 1) ∧  (∀ y, 0 ≤ triangularSecondDensity I y ∧ triangularSecondDensity I y ≤ 1)def WeaklyConverges (η : ℕ → Measure EndpointPair) (ν : Measure EndpointPair) : Prop :=  ∀ φ : C(EndpointPair, ℝ),    Tendsto (fun l => ∫ xy, φ xy ∂η l) atTop (𝓝 (∫ xy, φ xy ∂ν))def SupportedOnPositiveOrderedOrbitPairs (θ : ℕ → ℝ) (η : Measure EndpointPair) : Prop :=  ∃ N : Finset ℕ, (∀ n ∈ N, 0 < n) ∧    ∀ᵐ xy ∂η, Ordered xy.1 xy.2 ∧      ∃ n ∈ N, xy.2 = rotationIterate θ (n : ℤ) xy.1def HasUniformL2Marginals (η : ℕ → Measure EndpointPair) : Prop :=  ∃ H : ℝ, 0 ≤ H ∧ ∀ l, ∃ f g : Lp ℝ 2 baseMeasure,    (∀ᵐ x ∂baseMeasure, 0 ≤ f x) ∧ (∀ᵐ y ∂baseMeasure, 0 ≤ g y) ∧    (η l).map Prod.fst = baseMeasure.withDensity (fun x => ENNReal.ofReal (f x)) ∧    (η l).map Prod.snd = baseMeasure.withDensity (fun y => ENNReal.ofReal (g y)) ∧    ‖f‖ ≤ H ∧ ‖g‖ ≤ Hdef OrderedOrbitSampling (θ : ℕ → ℝ) (I : Finset ℕ) : Prop :=  ∃ η : ℕ → Measure EndpointPair,    (∀ l, IsFiniteMeasure (η l)) ∧    (∀ l, SupportedOnPositiveOrderedOrbitPairs θ (η l)) ∧    HasUniformL2Marginals η ∧ WeaklyConverges η (triangularLaw I)def HasAllFiniteCoordinateSampling (θ : ℕ → ℝ) : Prop :=  ∀ I : Finset ℕ, OrderedOrbitSampling θ Iend Invariant233.ProductModelendendsectionnoncomputable sectionopen MeasureTheorynamespace Invariant233.ProductModeldef IsCovariantFieldRepresentation (θ : ℕ → ℝ) (A : Hilbert →L[ℂ] Hilbert)    (F : Base → Fiber →L[ℂ] Fiber) (B : ℝ) : Prop :=  0 ≤ B ∧ (∀ x, ‖F x‖ ≤ B) ∧    (∀ v : Fiber, StronglyMeasurable (fun x => F x v)) ∧    (∀ f : Hilbert, A f =ᵐ[baseMeasure] fun x => F x (f x)) ∧    (∀ᵐ x ∂baseMeasure,      F (rotation θ x) =        (WeightedShift.shift (-1)).toLinearIsometry.toContinuousLinearMap * F x *          (WeightedShift.shift 1).toLinearIsometry.toContinuousLinearMap)def centralDiagonalIntegral (F : Base → Fiber →L[ℂ] Fiber) : ℂ :=  ∫ x, inner ℂ (lp.single 2 0 (1 : ℂ) : Fiber)    (F x (lp.single 2 0 (1 : ℂ) : Fiber)) ∂baseMeasureend Invariant233.ProductModelendendnamespace Invariant233run_cmd Lean.modifyEnv fun env => Lean.Meta.auxLemmasExt.setState env {}def Rotation.IsContinuousCounterexample (θ : ℝ) (f : C(Circle, ℝ)) : Prop :=  IsContinuousCircleWeight f ∧    let operator : Rotation.Hilbert →L[ℂ] Rotation.Hilbert := Rotation.weightedReal θ f    let factor : VonNeumannAlgebra Rotation.Hilbert := Rotation.algebra θ    operator ∈ factor ∧    HasOnlyTrivialInvariantProjections (H := Rotation.Hilbert) factor operator ∧    operator ≠ 0 ∧    NormQuasinilpotent (A := Rotation.Hilbert →L[ℂ] Rotation.Hilbert) operator ∧    vectorFugledeKadisonDeterminant (H := Rotation.Hilbert) Rotation.vacuum operator = 0run_cmd Lean.modifyEnv fun env => Lean.Meta.auxLemmasExt.setState env {}local instance ProductModel.instFactOneLeTwoCounterexample :    Fact (1 ≤ (2 : ENNReal)) := ⟨by norm_num⟩abbrev ProductModel.CounterexampleFiber : Type :=  @lp ℤ (fun _ => ℂ) (fun _ => Complex.instNormedAddCommGroup) 2abbrev ProductModel.CounterexampleHilbert : Type :=  @MeasureTheory.Lp ProductModel.Base ProductModel.CounterexampleFiber MeasurableSpace.pi    (@lp.normedAddCommGroup ℤ (fun _ => ℂ) 2      (fun _ => Complex.instNormedAddCommGroup) ProductModel.instFactOneLeTwoCounterexample)    2 ProductModel.baseMeasureinstance ProductModel.instCompleteSpaceHilbertCounterexample :    CompleteSpace ProductModel.CounterexampleHilbert := inferInstancedef ProductOperatorProperties {H : Type*} [NormedAddCommGroup H]    [InnerProductSpace ℂ H] [CompleteSpace H] (factor : VonNeumannAlgebra H)    (traceVector : H) (shift operator : H →L[ℂ] H) : Prop :=  IsTypeII1FactorWithVector factor traceVector ∧    HasSeparablePredual factor ∧    operator ∈ factor ∧ operator ≠ 0 ∧    NormQuasinilpotent operator ∧    vectorFugledeKadisonDeterminant traceVector operator = 0 ∧    spectrum ℂ operator = {0} ∧    IsVectorBrownMeasure traceVector operator (MeasureTheory.Measure.dirac 0) ∧    HasOnlyTrivialInvariantProjections factor operator ∧    ProductPolarStructure shift operator@[instance_reducible]noncomputable def ProductModel.counterexampleHilbertNormedAddCommGroup :    NormedAddCommGroup ProductModel.CounterexampleHilbert :=  @MeasureTheory.Lp.instNormedAddCommGroup ProductModel.Base ProductModel.CounterexampleFiber    MeasurableSpace.pi 2 ProductModel.baseMeasure    (@lp.normedAddCommGroup ℤ (fun _ => ℂ) 2      (fun _ => Complex.instNormedAddCommGroup) ProductModel.instFactOneLeTwoCounterexample)    ProductModel.instFactOneLeTwoCounterexample@[instance_reducible]noncomputable def ProductModel.counterexampleHilbertInnerProductSpace :    @InnerProductSpace ℂ ProductModel.CounterexampleHilbert Complex.instRCLike      ProductModel.counterexampleHilbertNormedAddCommGroup.toSeminormedAddCommGroup :=  @MeasureTheory.L2.innerProductSpace ProductModel.Base ProductModel.CounterexampleFiber ℂ    Complex.instRCLike MeasurableSpace.pi ProductModel.baseMeasure    (@lp.normedAddCommGroup ℤ (fun _ => ℂ) 2      (fun _ => Complex.instNormedAddCommGroup) ProductModel.instFactOneLeTwoCounterexample)    (@lp.instInnerProductSpace ℤ ℂ Complex.instRCLike (fun _ => ℂ)      (fun _ => Complex.instNormedAddCommGroup)      (fun _ => @RCLike.innerProductSpace ℂ Complex.instRCLike))def ProductModel.HasCounterexampleOperator (θ c : ℕ → ℝ) : Prop :=  @ProductOperatorProperties ProductModel.CounterexampleHilbert    ProductModel.counterexampleHilbertNormedAddCommGroup    ProductModel.counterexampleHilbertInnerProductSpace    ProductModel.instCompleteSpaceHilbertCounterexample (ProductModel.factor θ)    ProductModel.traceVector ProductModel.shiftOperator (ProductModel.weightedOperator θ c)def ProductModel.IsCounterexampleRealization (θ c : ℕ → ℝ) : Prop :=  ProductModel.AdmissibleAnglesAndCosts θ c ∧    ProductModel.HasAllFiniteCoordinateSampling θ ∧    Filter.Eventually (fun x : ProductModel.Base => 0 < ProductModel.weight θ c x)      (@MeasureTheory.ae ProductModel.Base        (@MeasureTheory.Measure ProductModel.Base MeasurableSpace.pi)        MeasureTheory.Measure.instFunLike MeasureTheory.Measure.instOuterMeasureClass        ProductModel.baseMeasure) ∧    @HasNegInfiniteLogIntegral ProductModel.Base MeasurableSpace.pi      ProductModel.baseMeasure (ProductModel.weight θ c) ∧    ProductModel.HasCounterexampleOperator θ cend Invariant233namespace Invariant233.Resultstheorem prescribed_irrational_counterexample (θ : ℝ)    (hθ0 : 0 < θ) (hθ1 : θ < 1) (hθ : Irrational θ) :    ∃ f : C(Circle, ℝ), Rotation.IsContinuousCounterexample θ f := by  sorrytheorem product_realization :    ∃ θ c : ℕ → ℝ, ProductModel.IsCounterexampleRealization θ c := by  sorryend Invariant233.Resultsend OAI
Every extracted statement of the accompanying papers

The statements the atlas extracted automatically from each accompanying paper’s TeX source, with links to the full sources.

Invariant-projection counterexamples for every irrational rotation

Theorem

For every irrational \theta\in(0,1) there exists a continuous function f:\T\to[0,1] such that

f^{-1}(\{0\})=\{1\},\qquad \int_\T\log f\,dm=-\infty,

and every projection p\in R_\theta satisfying (1-p)Uf(V)p=0 is either 0 or 1.

Section 1, Introduction Read it in the paper TeX source, line 33
Show the TeX
For every irrational $\theta\in(0,1)$ there exists a continuous function
$f:\T\to[0,1]$ such that
\[
 f^{-1}(\{0\})=\{1\},\qquad \int_\T\log f\,dm=-\infty,
\]
and every projection $p\in R_\theta$ satisfying $(1-p)Uf(V)p=0$
is either $0$ or $1$.
Corollary

Every separable infinite-dimensional complex Hilbert space carries a nonzero norm-quasinilpotent operator with no nontrivial hyperinvariant subspace. Its commutant is a proper strongly closed transitive unital algebra.

Section 1, Introduction Read it in the paper TeX source, line 94
Show the TeX
Every separable infinite-dimensional complex Hilbert space carries a
nonzero norm-quasinilpotent operator with no nontrivial hyperinvariant
subspace.  Its commutant is a proper strongly closed transitive unital
algebra.

Backward intertwiners and a transitive commutant

Theorem

There are measurable positive weights \beta_j:X\to(0,\infty), j\in\Z, and a contraction V\in\B(H_0) with the following properties. The shifts

S_xe_j=\beta_j(x)e_{j+1},\qquad (Sf)(x)=S_xf(x),

define a bounded operator S on H_0, and:

  1. 1.

    For every x\in X, the closed invariant subspaces of S_x are exactly \Ktail{h}, h\in\Z\cup\{-\infty,+\infty\}. • The operator S is nonzero, \|S\|=e^{-10}, and for every integer n\ge1,

    \|S^n\|\le \exp\left(-10\left\lfloor\frac{(n+1)^2}{4}\right\rfloor\right).

    • The operator V commutes with S and has the form

    (Vf)(\theta x)=V_xf(x),\qquad V_xe_j=b_j(x)e_{j-1},

    where 0\le b_j(x)\le1 are measurable and are positive on a common conull set. On that set,

    \overline{V_x\Ktail{h}}=\Ktail{h-1}\quad(h\in\Z), \qquad \overline{V_xK}=K.

    • The unital complex algebra generated by S, V, and all scalar multipliers M_g is transitive.

Section 1, Introduction Read it in the paper TeX source, line 35
Show the TeX
There are measurable positive weights $\beta_j:X\to(0,\infty)$,
$j\in\Z$, and a contraction $V\in\B(H_0)$ with the following properties.
The shifts
\[
 S_xe_j=\beta_j(x)e_{j+1},\qquad (Sf)(x)=S_xf(x),
\]
define a bounded operator $S$ on $H_0$, and:
\begin{enumerate}
\item For every $x\in X$, the closed invariant subspaces of $S_x$ are
exactly $\Ktail{h}$, $h\in\Z\cup\{-\infty,+\infty\}$.
\item The operator $S$ is nonzero, $\|S\|=e^{-10}$, and for every
integer $n\ge1$,
\begin{equation}
 \|S^n\|\le
 \exp\left(-10\left\lfloor\frac{(n+1)^2}{4}\right\rfloor\right).
\end{equation}
\item The operator $V$ commutes with $S$ and has the form
\[
 (Vf)(\theta x)=V_xf(x),\qquad V_xe_j=b_j(x)e_{j-1},
\]
where $0\le b_j(x)\le1$ are measurable and are positive on a common
conull set. On that set,
\[
 \overline{V_x\Ktail{h}}=\Ktail{h-1}\quad(h\in\Z),
 \qquad \overline{V_xK}=K.
\]
\item The unital complex algebra generated by $S$, $V$, and all
scalar multipliers $M_g$ is transitive.
\end{enumerate}
Corollary

Every infinite-dimensional separable complex Hilbert space admits a nonzero bounded norm-quasinilpotent operator with no nonzero proper closed hyperinvariant subspace. Its commutant is a proper strongly closed unital transitive complex operator algebra.

Section 1, Introduction Read it in the paper TeX source, line 72
Show the TeX
Every infinite-dimensional separable complex Hilbert space admits a
nonzero bounded norm-quasinilpotent operator with no nonzero proper
closed hyperinvariant subspace. Its commutant is a proper strongly
closed unital transitive complex operator algebra.
Configuration and file facts
OpenAI’s Lean catalogue
OpenAI’s Lean catalogue does not list this as a main result; the release’s Lean notes for family 293 link it.
Solution module
OAI.Analysis.IrrationalRotation.Main
Allowed axioms
propext, Quot.sound, Classical.choiceThe axioms this configuration allows a proof to use. A replay shows which of them a proof uses.
Imports
Mathlib
Imports from outside Mathlib
None
Local vocabulary
114 local vocabulary declarations
Lines of Lean, without comments or blank lines
551
Second proof-verification program (nanoda)
Off in OpenAI's configuration.

Statement comparison

A shareable summary of this page: the proposed paper match, what the Lean statement expresses, and which reviews are recorded.

Plectis Atlas

Invariant-projection counterexamples for every irrational rotation

Family 293: Invariant projections, hyperinvariant subspaces, and transitive algebras

Candidate pairing

Theorem (Product realization)

There are angles 0<\theta_i<1 and costs c_i>0, with \sum_i\theta_i<\infty and 1,\theta_1,\theta_2,\ldots rationally independent, such that the measurable weight

f(x)=\exp\left(-\sum_{i\ge1}c_i\lfloor x_i+\theta_i\rfloor\right)

is positive almost everywhere and has \int_X\log f\,d\mu=-\infty. The algebra M is a type \mathrm{II}_1 factor with separable predual, and T=U\pi(f) is nonzero and norm-quasinilpotent, with \Delta(T)=0. Every projection p\in M satisfying (1-p)Tp=0 is 0 or 1.

Moreover, |T| has pure-point spectral type. The abelian algebra generated by any finite family of polar conjugates U^n|T|U^{-n} is atomic, whereas W^*(U^n|T|U^{-n}:n\in\Z) is diffuse.

Invariant-projection counterexamples for every irrational rotation

TeX label p:thm:model, build/appendix-product.tex, line 27

The Lean statement says

theorem prescribed_irrational_counterexample (θ : ℝ)    (hθ0 : 0 < θ) (hθ1 : θ < 1) (hθ : Irrational θ) :    ∃ f : C(Circle, ℝ), Rotation.IsContinuousCounterexample θ f := by  sorrytheorem product_realization :    ∃ θ c : ℕ → ℝ, ProductModel.IsCounterexampleRealization θ c := by  sorry

A Lean statement states the theorem and leaves its proof as sorry on purpose. OpenAI’s proof is in a separate solution module, and a program called Comparator checks that proof against this statement.

Atlas selected this possible match because the two statements share words. No review of whether they mean the same thing is recorded.two independent groups report that Comparator accepted runs for this file at the release version shown here.Statement review: none recorded

114 local vocabulary declarationsAllowed axioms: propext, Quot.sound, Classical.choiceopenai/math at fd4aeebwcook04.github.io/plectis-atlas/statements/IrrationalRotation.html

Recorded comparisons with the paper

Atlas records no contributed comparison of this statement with the paper.

Contributed Comparator run reports

Atlas records no contributed report of running Comparator for this statement file.

Questions to resolve when comparing this statement with the paper

  • 114 local vocabulary declarations to read.

Compare this statement with the paperShare a Comparator run reportSuggest a change