12.1. QuantumBlockEncoding/RobinMatrix.lean
395 explicit public declarations, in source order.
Plain-English reading. This definition gives the library's named construction or computation for “stencil row coeff”. Coefficient at column 'colIdx' when the stencil 'entries' is applied at row 'rowIdx'.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Coefficient at column 'colIdx' when the stencil 'entries' is applied at row 'rowIdx'. Only entries whose offset lands on 'colIdx' contribute; the result is the sum of all matching coefficients. Returns bare 'Coeff' (no zero-wrapping) when exactly one entry matches.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:21. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.1●1 definition
Associated Lean declarations
-
QuantumBlockEncoding.stencilRowCoeff[complete]
-
QuantumBlockEncoding.stencilRowCoeff[complete]
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.stencilRowCoeff (rowIdx colIdx : ℕ) (entries : List QuantumBlockEncoding.StencilEntry) : QuantumBlockEncoding.Coeff
def QuantumBlockEncoding.stencilRowCoeff (rowIdx colIdx : ℕ) (entries : List QuantumBlockEncoding.StencilEntry) : QuantumBlockEncoding.Coeff
Coefficient at column `colIdx` when the stencil `entries` is applied at row `rowIdx`. Only entries whose offset lands on `colIdx` contribute; the result is the sum of all matching coefficients. Returns bare `Coeff` (no zero-wrapping) when exactly one entry matches.
Plain-English reading. This definition gives the library's named construction or computation for “robin row entries”. Select the stencil entry list for row 'i': - rows 'i < w.lower' use left boundary rows, - rows 'i > w.upper' use right boundary rows, - all others use the bulk stencil.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Select the stencil entry list for row 'i': - rows 'i < w.lower' use left boundary rows, - rows 'i > w.upper' use right boundary rows, - all others use the bulk stencil. Falls back to the empty list if a boundary row is missing from the supplied data, so the definition is total and does not need index proofs.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:37. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.2●1 definition
Associated Lean declarations
-
QuantumBlockEncoding.robinRowEntries[complete]
-
QuantumBlockEncoding.robinRowEntries[complete]
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.robinRowEntries (bulkEntries : List QuantumBlockEncoding.StencilEntry) (leftRows rightRows : List (List QuantumBlockEncoding.StencilEntry)) (w : QuantumBlockEncoding.BulkWindow) (i : ℕ) : List QuantumBlockEncoding.StencilEntry
def QuantumBlockEncoding.robinRowEntries (bulkEntries : List QuantumBlockEncoding.StencilEntry) (leftRows rightRows : List (List QuantumBlockEncoding.StencilEntry)) (w : QuantumBlockEncoding.BulkWindow) (i : ℕ) : List QuantumBlockEncoding.StencilEntry
Select the stencil entry list for row `i`: - rows `i < w.lower` use left boundary rows, - rows `i > w.upper` use right boundary rows, - all others use the bulk stencil. Falls back to the empty list if a boundary row is missing from the supplied data, so the definition is total and does not need index proofs.
Plain-English reading. This definition gives the library's named construction or computation for “build robin matrix”. Build the full Robin derivative matrix of size 'gridSize n × gridSize n'.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Build the full Robin derivative matrix of size 'gridSize n × gridSize n'. The boundary rows come from 'leftRows' and 'rightRows'; the interior uses 'bulkEntries'. The 'BulkWindow w' records where the interior starts and ends.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:56. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.3●1 definition
Associated Lean declarations
-
QuantumBlockEncoding.buildRobinMatrix[complete]
-
QuantumBlockEncoding.buildRobinMatrix[complete]
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.buildRobinMatrix (n : ℕ) (bulkEntries : List QuantumBlockEncoding.StencilEntry) (leftRows rightRows : List (List QuantumBlockEncoding.StencilEntry)) (w : QuantumBlockEncoding.BulkWindow) : QuantumBlockEncoding.Matrix (QuantumBlockEncoding.gridSize n) (QuantumBlockEncoding.gridSize n) QuantumBlockEncoding.Coeff
def QuantumBlockEncoding.buildRobinMatrix (n : ℕ) (bulkEntries : List QuantumBlockEncoding.StencilEntry) (leftRows rightRows : List (List QuantumBlockEncoding.StencilEntry)) (w : QuantumBlockEncoding.BulkWindow) : QuantumBlockEncoding.Matrix (QuantumBlockEncoding.gridSize n) (QuantumBlockEncoding.gridSize n) QuantumBlockEncoding.Coeff
Build the full Robin derivative matrix of size `gridSize n × gridSize n`. The boundary rows come from `leftRows` and `rightRows`; the interior uses `bulkEntries`. The `BulkWindow w` records where the interior starts and ends.
Plain-English reading. This definition gives the library's named construction or computation for “robin derivative matrix”. The concrete Robin derivative matrix for the fourth-order central second-derivative stencil.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The concrete Robin derivative matrix for the fourth-order central second-derivative stencil.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:68. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.4●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.robinDerivativeMatrix (n : ℕ) : QuantumBlockEncoding.Matrix (QuantumBlockEncoding.gridSize n) (QuantumBlockEncoding.gridSize n) QuantumBlockEncoding.Coeff
def QuantumBlockEncoding.Examples.RobinHeat.robinDerivativeMatrix (n : ℕ) : QuantumBlockEncoding.Matrix (QuantumBlockEncoding.gridSize n) (QuantumBlockEncoding.gridSize n) QuantumBlockEncoding.Coeff
The concrete Robin derivative matrix for the fourth-order central second-derivative stencil.
Plain-English reading. This definition gives the library's named construction or computation for “one term robin ak matrix”. The one-term Robin theorem target $A_k$.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The one-term Robin theorem target $A_k$. Theorem '1 term robin' block-encodes the row-scaled operator 'A_k ~ f(x) d^m/dx^m'; Eq. 'ROBIN clarified' carries entries 'f(x_i) D_{ij}' in the 'gamma3' branch.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:81. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.5●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinAkMatrix (n : ℕ) : QuantumBlockEncoding.Matrix (QuantumBlockEncoding.gridSize n) (QuantumBlockEncoding.gridSize n) QuantumBlockEncoding.Coeff
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinAkMatrix (n : ℕ) : QuantumBlockEncoding.Matrix (QuantumBlockEncoding.gridSize n) (QuantumBlockEncoding.gridSize n) QuantumBlockEncoding.Coeff
The one-term Robin theorem target $A_k$. Theorem `1 term robin` block-encodes the row-scaled operator `A_k ~ f(x) d^m/dx^m`; Eq. `ROBIN clarified` carries entries `f(x_i) D_{ij}` in the `gamma3` branch.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin ak matrix apply”; its local proof does not by itself complete the broader paper route.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The source declaration has no docstring. The reader cue above is generated from its kind and name and does not replace the Lean signature.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:84. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.6●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinAkMatrix_apply (n : ℕ) (i j : Fin (QuantumBlockEncoding.gridSize n)) : QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinAkMatrix n i j = (QuantumBlockEncoding.GHL2025.robinFunctionValue n ↑i).mul (QuantumBlockEncoding.Examples.RobinHeat.robinDerivativeMatrix n i j)
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinAkMatrix_apply (n : ℕ) (i j : Fin (QuantumBlockEncoding.gridSize n)) : QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinAkMatrix n i j = (QuantumBlockEncoding.GHL2025.robinFunctionValue n ↑i).mul (QuantumBlockEncoding.Examples.RobinHeat.robinDerivativeMatrix n i j)
Plain-English reading. This definition gives the library's named construction or computation for “matrix row abs sum”. Absolute-row-sum for row 'i' of a 'Coeff'-valued matrix, given a symbol environment 'env'.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Absolute-row-sum for row 'i' of a 'Coeff'-valued matrix, given a symbol environment 'env'. This is the building block for the induced 1-norm.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:96. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.7●1 definition
Associated Lean declarations
-
QuantumBlockEncoding.matrixRowAbsSum[complete]
-
QuantumBlockEncoding.matrixRowAbsSum[complete]
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.matrixRowAbsSum {rows cols : ℕ} (mat : QuantumBlockEncoding.Matrix rows cols QuantumBlockEncoding.Coeff) (env : String → ℚ) (i : Fin rows) : ℚ
def QuantumBlockEncoding.matrixRowAbsSum {rows cols : ℕ} (mat : QuantumBlockEncoding.Matrix rows cols QuantumBlockEncoding.Coeff) (env : String → ℚ) (i : Fin rows) : ℚ
Absolute-row-sum for row `i` of a `Coeff`-valued matrix, given a symbol environment `env`. This is the building block for the induced 1-norm.
Plain-English reading. This definition gives the library's named construction or computation for “matrix one norm”. Induced matrix 1-norm: the maximum absolute row sum.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Induced matrix 1-norm: the maximum absolute row sum. Uses 'evalWith env' to convert symbolic 'Coeff' entries to concrete 'Rat' values.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:106. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.8●1 definition
Associated Lean declarations
-
QuantumBlockEncoding.matrixOneNorm[complete]
-
QuantumBlockEncoding.matrixOneNorm[complete]
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.matrixOneNorm {rows cols : ℕ} (mat : QuantumBlockEncoding.Matrix rows cols QuantumBlockEncoding.Coeff) (env : String → ℚ) : ℚ
def QuantumBlockEncoding.matrixOneNorm {rows cols : ℕ} (mat : QuantumBlockEncoding.Matrix rows cols QuantumBlockEncoding.Coeff) (env : String → ℚ) : ℚ
Induced matrix 1-norm: the maximum absolute row sum. Uses `evalWith env` to convert symbolic `Coeff` entries to concrete `Rat` values.
Plain-English reading. This definition gives the library's named construction or computation for “robin derivative norm”. Numeric 1-norm of the Robin derivative matrix under a symbol environment.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Numeric 1-norm of the Robin derivative matrix under a symbol environment. Returns the maximum absolute row sum as a concrete 'Rat'.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:117. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.9●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.robinDerivativeNorm (n : ℕ) (env : String → ℚ) : ℚ
def QuantumBlockEncoding.Examples.RobinHeat.robinDerivativeNorm (n : ℕ) (env : String → ℚ) : ℚ
Numeric 1-norm of the Robin derivative matrix under a symbol environment. Returns the maximum absolute row sum as a concrete `Rat`.
Plain-English reading. This definition gives the library's named construction or computation for “one term robin numeric normalizer”. Numeric normalizer α = N_D · N_f · κ for the one-term Robin construction.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Numeric normalizer α = N_D · N_f · κ for the one-term Robin construction. 'nD' is the derivative-stencil normalization (1-norm of the Robin derivative matrix), 'nF' is the function-oracle normalization, and 'k' is the Robin-condition bound.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:125. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.10●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinNumericNormalizer (nD nF : ℚ) (k : ℕ) : ℚ
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinNumericNormalizer (nD nF : ℚ) (k : ℕ) : ℚ
Numeric normalizer α = N_D · N_f · κ for the one-term Robin construction. `nD` is the derivative-stencil normalization (1-norm of the Robin derivative matrix), `nF` is the function-oracle normalization, and `k` is the Robin-condition bound.
Plain-English reading. This definition gives the library's named construction or computation for “robin normalizer bound”. Proposition: the numeric normalizer α is at least the induced 1-norm of the Robin derivative matrix, i.e.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Proposition: the numeric normalizer α is at least the induced 1-norm of the Robin derivative matrix, i.e. α ≥ ∥D_Robin∥₁. Stated via a 'Decidable' check so 'native_decide' can close concrete instances.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:133. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.11●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.robinNormalizerBound (n : ℕ) (env : String → ℚ) (nF : ℚ) (k : ℕ) : Bool
def QuantumBlockEncoding.Examples.RobinHeat.robinNormalizerBound (n : ℕ) (env : String → ℚ) (nF : ℚ) (k : ℕ) : Bool
Proposition: the numeric normalizer α is at least the induced 1-norm of the Robin derivative matrix, i.e. α ≥ ∥D_Robin∥₁. Stated via a `Decidable` check so `native_decide` can close concrete instances.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin numeric normalizer eq eval”; its local proof does not by itself complete the broader paper route. Connecting the numeric normalizer to the symbolic GHL2025 normalizer via a concrete environment mapping the three symbols to their numeric values.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Connecting the numeric normalizer to the symbolic GHL2025 normalizer via a concrete environment mapping the three symbols to their numeric values.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:139. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.12●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinNumericNormalizer_eq_eval (nD nF : ℚ) (k : ℕ) : QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinNumericNormalizer nD nF k = QuantumBlockEncoding.Coeff.evalWith (fun s => if s = "N_D" then nD else if s = "N_f" then nF else ↑k) QuantumBlockEncoding.GHL2025.oneTermRobinNormalizer
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinNumericNormalizer_eq_eval (nD nF : ℚ) (k : ℕ) : QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinNumericNormalizer nD nF k = QuantumBlockEncoding.Coeff.evalWith (fun s => if s = "N_D" then nD else if s = "N_f" then nF else ↑k) QuantumBlockEncoding.GHL2025.oneTermRobinNormalizer
Connecting the numeric normalizer to the symbolic GHL2025 normalizer via a concrete environment mapping the three symbols to their numeric values.
Plain-English reading. This definition gives the library's named construction or computation for “robin block encoding spec”. Concrete BlockEncodingSpec wiring the Robin derivative matrix into the one-term Robin block encoding framework.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Concrete BlockEncodingSpec wiring the Robin derivative matrix into the one-term Robin block encoding framework. Uses the fourth-order central stencil with Robin boundary corrections.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:149. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.13●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.robinBlockEncodingSpec (n : ℕ) : QuantumBlockEncoding.BlockEncodingSpec QuantumBlockEncoding.Coeff (QuantumBlockEncoding.gridSize n) (QuantumBlockEncoding.gridSize n)
def QuantumBlockEncoding.Examples.RobinHeat.robinBlockEncodingSpec (n : ℕ) : QuantumBlockEncoding.BlockEncodingSpec QuantumBlockEncoding.Coeff (QuantumBlockEncoding.gridSize n) (QuantumBlockEncoding.gridSize n)
Concrete BlockEncodingSpec wiring the Robin derivative matrix into the one-term Robin block encoding framework. Uses the fourth-order central stencil with Robin boundary corrections.
Plain-English reading. Lean checks the research-module proposition indexed as “robin block encoding spec pure ancilla”; its local proof does not by itself complete the broader paper route. The spec's resource pureAncilla matches 2n.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The spec's resource pureAncilla matches 2n.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:158. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.14●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.robinBlockEncodingSpec_pureAncilla (n : ℕ) : (QuantumBlockEncoding.Examples.RobinHeat.robinBlockEncodingSpec n).resource.pureAncilla = 2 * n
theorem QuantumBlockEncoding.Examples.RobinHeat.robinBlockEncodingSpec_pureAncilla (n : ℕ) : (QuantumBlockEncoding.Examples.RobinHeat.robinBlockEncodingSpec n).resource.pureAncilla = 2 * n
The spec's resource pureAncilla matches 2n.
Plain-English reading. This definition gives the library's named construction or computation for “robin derivative oracle resource”. Concrete derivative oracle resource for the fourth-order Robin stencil.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Concrete derivative oracle resource for the fourth-order Robin stencil. Uses half-bandwidth l = leftRadius = 2.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:163. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.15●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.robinDerivativeOracleResource (n : ℕ) : QuantumBlockEncoding.Resource
def QuantumBlockEncoding.Examples.RobinHeat.robinDerivativeOracleResource (n : ℕ) : QuantumBlockEncoding.Resource
Concrete derivative oracle resource for the fourth-order Robin stencil. Uses half-bandwidth l = leftRadius = 2.
Plain-English reading. Lean checks the research-module proposition indexed as “robin derivative oracle resource eq”; its local proof does not by itself complete the broader paper route. The Robin derivative oracle resource equals bandedSparseAccessResource n 2.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The Robin derivative oracle resource equals bandedSparseAccessResource n 2.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:167. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.16●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.robinDerivativeOracleResource_eq (n : ℕ) : QuantumBlockEncoding.Examples.RobinHeat.robinDerivativeOracleResource n = QuantumBlockEncoding.bandedSparseAccessResource n 2
theorem QuantumBlockEncoding.Examples.RobinHeat.robinDerivativeOracleResource_eq (n : ℕ) : QuantumBlockEncoding.Examples.RobinHeat.robinDerivativeOracleResource n = QuantumBlockEncoding.bandedSparseAccessResource n 2
The Robin derivative oracle resource equals bandedSparseAccessResource n 2.
Plain-English reading. Lean checks the research-module proposition indexed as “robin derivative oracle resource pure ancilla”; its local proof does not by itself complete the broader paper route. The Robin derivative oracle uses n - 1 pure ancillas (from Lemma 1).
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The Robin derivative oracle uses n - 1 pure ancillas (from Lemma 1).
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:171. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.17●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.robinDerivativeOracleResource_pureAncilla (n : ℕ) : (QuantumBlockEncoding.Examples.RobinHeat.robinDerivativeOracleResource n).pureAncilla = n - 1
theorem QuantumBlockEncoding.Examples.RobinHeat.robinDerivativeOracleResource_pureAncilla (n : ℕ) : (QuantumBlockEncoding.Examples.RobinHeat.robinDerivativeOracleResource n).pureAncilla = n - 1
The Robin derivative oracle uses n - 1 pure ancillas (from Lemma 1).
Plain-English reading. This definition gives the library's named construction or computation for “robin block encoding predicate”. PO-6: Block-extraction equation for the Robin derivative block encoding.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. PO-6: Block-extraction equation for the Robin derivative block encoding. Records the structural preconditions that are checkable now (normalizer bound, ancilla count, zero error) and reserves the full equation ⟨0^a| ⊗ I) U (|0^a⟩ ⊗ I) = A / α as an abstract component pending unitary semantics.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:181. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.18●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.robinBlockEncodingPredicate (n : ℕ) : Prop
def QuantumBlockEncoding.Examples.RobinHeat.robinBlockEncodingPredicate (n : ℕ) : Prop
PO-6: Block-extraction equation for the Robin derivative block encoding. Records the structural preconditions that are checkable now (normalizer bound, ancilla count, zero error) and reserves the full equation ⟨0^a| ⊗ I) U (|0^a⟩ ⊗ I) = A / α as an abstract component pending unitary semantics.
Plain-English reading. This definition gives the library's named construction or computation for “robin resource bound holds”. PO-7: Resource bound holds for the Robin block encoding.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. PO-7: Resource bound holds for the Robin block encoding. Concrete decidable check: pureAncilla = 2n and gate count ≤ paper's formula.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:188. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.19●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.robinResourceBoundHolds (n : ℕ) : Prop
def QuantumBlockEncoding.Examples.RobinHeat.robinResourceBoundHolds (n : ℕ) : Prop
PO-7: Resource bound holds for the Robin block encoding. Concrete decidable check: pureAncilla = 2n and gate count ≤ paper's formula.
Plain-English reading. This definition gives the library's named construction or computation for “one term robin resource consistent”. PO-9: The concrete resource is consistent with the symbolic expression.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. PO-9: The concrete resource is consistent with the symbolic expression. Checks the decidable part: pureAncilla = 2n.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:195. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.20●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinResourceConsistent (p : QuantumBlockEncoding.GHL2025.OneTermRobinParameters) : Prop
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinResourceConsistent (p : QuantumBlockEncoding.GHL2025.OneTermRobinParameters) : Prop
PO-9: The concrete resource is consistent with the symbolic expression. Checks the decidable part: pureAncilla = 2n.
Plain-English reading. This record groups the data and proof fields needed for “robin oracle composition”. A proposition-valued field is a requirement until a constructor supplies it. Bundle of oracle contracts and LCU composition obligation for the one-term Robin construction.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Bundle of oracle contracts and LCU composition obligation for the one-term Robin construction. Contains: - derivative oracle O_D (sparse-access for the banded stencil matrix), - function oracle O_f (amplitude oracle for the coefficient function), - LCU composition Prop (PO-15: linear combination of unitaries correctness), - matrix coherence (the oracle's matrix equals the Robin derivative matrix).
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:204. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.21●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.RobinOracleComposition (n : ℕ) : Type
structure QuantumBlockEncoding.Examples.RobinHeat.RobinOracleComposition (n : ℕ) : Type
Bundle of oracle contracts and LCU composition obligation for the one-term Robin construction. Contains: - derivative oracle O_D (sparse-access for the banded stencil matrix), - function oracle O_f (amplitude oracle for the coefficient function), - LCU composition Prop (PO-15: linear combination of unitaries correctness), - matrix coherence (the oracle's matrix equals the Robin derivative matrix).
Fields
derivativeOracle : QuantumBlockEncoding.GHL2025.DerivativeOracleContract n
functionOracle : QuantumBlockEncoding.GHL2025.FunctionOracleContract n
lcuCorrect : QuantumBlockEncoding.GHL2025.ObligationRecord
Obligation: LCU composition of oracle calls yields the correct linear combination. figure:1_term_ROBIN, main.tex:1131-1136 -
matrixCoherence : self.derivativeOracle.matrix = QuantumBlockEncoding.Examples.RobinHeat.robinDerivativeMatrix n
Plain-English reading. This definition gives the library's named construction or computation for “robin oracle composition”. PO-13/14/15: Concrete oracle composition for the Robin derivative block encoding.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. PO-13/14/15: Concrete oracle composition for the Robin derivative block encoding. Instantiates the derivative oracle with the fourth-order stencil, the function oracle with one piece, and records the LCU composition Prop as an abstract claim.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:215. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.22●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.robinOracleComposition (n : ℕ) : QuantumBlockEncoding.Examples.RobinHeat.RobinOracleComposition n
def QuantumBlockEncoding.Examples.RobinHeat.robinOracleComposition (n : ℕ) : QuantumBlockEncoding.Examples.RobinHeat.RobinOracleComposition n
PO-13/14/15: Concrete oracle composition for the Robin derivative block encoding. Instantiates the derivative oracle with the fourth-order stencil, the function oracle with one piece, and records the LCU composition Prop as an abstract claim.
Plain-English reading. Lean checks the research-module proposition indexed as “robin oracle composition bandwidth”; its local proof does not by itself complete the broader paper route.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The source declaration has no docstring. The reader cue above is generated from its kind and name and does not replace the Lean signature.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:231. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.23●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.robinOracleComposition_bandwidth (n : ℕ) : (QuantumBlockEncoding.Examples.RobinHeat.robinOracleComposition n).derivativeOracle.bandwidth = 5
theorem QuantumBlockEncoding.Examples.RobinHeat.robinOracleComposition_bandwidth (n : ℕ) : (QuantumBlockEncoding.Examples.RobinHeat.robinOracleComposition n).derivativeOracle.bandwidth = 5
Plain-English reading. Lean checks the research-module proposition indexed as “robin oracle composition function pieces”; its local proof does not by itself complete the broader paper route.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The source declaration has no docstring. The reader cue above is generated from its kind and name and does not replace the Lean signature.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:234. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.24●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.robinOracleComposition_functionPieces (n : ℕ) : (QuantumBlockEncoding.Examples.RobinHeat.robinOracleComposition n).functionOracle.functionPieces = 1
theorem QuantumBlockEncoding.Examples.RobinHeat.robinOracleComposition_functionPieces (n : ℕ) : (QuantumBlockEncoding.Examples.RobinHeat.robinOracleComposition n).functionOracle.functionPieces = 1
Plain-English reading. Lean checks the research-module proposition indexed as “robin oracle composition matrix”; its local proof does not by itself complete the broader paper route.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The source declaration has no docstring. The reader cue above is generated from its kind and name and does not replace the Lean signature.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:237. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.25●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.robinOracleComposition_matrix (n : ℕ) : (QuantumBlockEncoding.Examples.RobinHeat.robinOracleComposition n).derivativeOracle.matrix = QuantumBlockEncoding.Examples.RobinHeat.robinDerivativeMatrix n
theorem QuantumBlockEncoding.Examples.RobinHeat.robinOracleComposition_matrix (n : ℕ) : (QuantumBlockEncoding.Examples.RobinHeat.robinOracleComposition n).derivativeOracle.matrix = QuantumBlockEncoding.Examples.RobinHeat.robinDerivativeMatrix n
Plain-English reading. This definition gives the library's named construction or computation for “robin proof obligations”. Default proof-obligation bundle for the one-term Robin construction.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Default proof-obligation bundle for the one-term Robin construction. All obligations are unproved. main.tex:1131-1136 -
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:242. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.26●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.robinProofObligations : QuantumBlockEncoding.GHL2025.RobinProofObligations
def QuantumBlockEncoding.Examples.RobinHeat.robinProofObligations : QuantumBlockEncoding.GHL2025.RobinProofObligations
Default proof-obligation bundle for the one-term Robin construction. All obligations are unproved. main.tex:1131-1136 -
Plain-English reading. This definition gives the library's named construction or computation for “one term robin circuit semantics”. CircuitMatrixSemantics for the one-term Robin circuit using honest gate matrices.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. CircuitMatrixSemantics for the one-term Robin circuit using honest gate matrices. The full-space matrix is the product of the 7 honest gate matrices computed by 'evalGateMatrices'. Unproved gate claims remain in their own 'SemanticObligation' records. figure:1_term_ROBIN -
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:252. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.27●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinCircuitSemantics (n : ℕ) : QuantumBlockEncoding.CircuitMatrixSemantics QuantumBlockEncoding.Coeff (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n))
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinCircuitSemantics (n : ℕ) : QuantumBlockEncoding.CircuitMatrixSemantics QuantumBlockEncoding.Coeff (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n))
CircuitMatrixSemantics for the one-term Robin circuit using honest gate matrices. The full-space matrix is the product of the 7 honest gate matrices computed by `evalGateMatrices`. Unproved gate claims remain in their own `SemanticObligation` records. figure:1_term_ROBIN -
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin circuit dim compat”; its local proof does not by itself complete the broader paper route.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The source declaration has no docstring. The reader cue above is generated from its kind and name and does not replace the Lean signature.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:275. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.28●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinCircuitDimCompat (n : ℕ) : QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)) = QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.effectiveRobinSignalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)) * QuantumBlockEncoding.gridSize n
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinCircuitDimCompat (n : ℕ) : QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)) = QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.effectiveRobinSignalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)) * QuantumBlockEncoding.gridSize n
Plain-English reading. This definition gives the library's named construction or computation for “one term robin block extraction target”. Block-extraction target for the one-term Robin block encoding.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Block-extraction target for the one-term Robin block encoding. States that the '(0, 0)' block of the circuit matrix should equal 'A_k / (N_D * N_f * kappa)'. The 'unitaryMatrix' and 'blockMatrix' are derived from the real circuit matrix product computed by 'evalGateMatrices' over all 7 honest gate matrices. Block correctness remains unproved. The 'signalDim' is 'qubitDim effectiveRobinSignalQubits' where 'effectiveRobinSignalQubits' counts all non-system qubits. 'systemDim' is 'gridSize n'. figure:1_term_ROBIN, main.tex:1131-1136 -
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:296. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.29●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockExtractionTarget (n : ℕ) : QuantumBlockEncoding.BlockExtractionTarget QuantumBlockEncoding.Coeff (QuantumBlockEncoding.gridSize n) (QuantumBlockEncoding.gridSize n) (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.effectiveRobinSignalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockExtractionTarget (n : ℕ) : QuantumBlockEncoding.BlockExtractionTarget QuantumBlockEncoding.Coeff (QuantumBlockEncoding.gridSize n) (QuantumBlockEncoding.gridSize n) (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.effectiveRobinSignalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))
Block-extraction target for the one-term Robin block encoding. States that the `(0, 0)` block of the circuit matrix should equal `A_k / (N_D * N_f * kappa)`. The `unitaryMatrix` and `blockMatrix` are derived from the real circuit matrix product computed by `evalGateMatrices` over all 7 honest gate matrices. Block correctness remains unproved. The `signalDim` is `qubitDim effectiveRobinSignalQubits` where `effectiveRobinSignalQubits` counts all non-system qubits. `systemDim` is `gridSize n`. figure:1_term_ROBIN, main.tex:1131-1136 -
Plain-English reading. This definition gives the library's named construction or computation for “one term robin circuit block claim”. Circuit block encoding claim for the one-term Robin construction.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Circuit block encoding claim for the one-term Robin construction. Connects the circuit matrix semantics to the block extraction target and records the dimension compatibility as a parameter. The caller must supply 'hDim' proving that the total circuit Hilbert space decomposes as signalDim × systemDim. For concrete 'n' (e.g. n = 3) this is provable by 'native_decide'. figure:1_term_ROBIN, main.tex:1131-1136 -
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:323. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.30●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinCircuitBlockClaim (n : ℕ) (hDim : QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)) = QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.effectiveRobinSignalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)) * QuantumBlockEncoding.gridSize n) : QuantumBlockEncoding.CircuitBlockEncodingClaim QuantumBlockEncoding.Coeff (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)) (QuantumBlockEncoding.gridSize n) (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.effectiveRobinSignalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinCircuitBlockClaim (n : ℕ) (hDim : QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)) = QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.effectiveRobinSignalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)) * QuantumBlockEncoding.gridSize n) : QuantumBlockEncoding.CircuitBlockEncodingClaim QuantumBlockEncoding.Coeff (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)) (QuantumBlockEncoding.gridSize n) (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.effectiveRobinSignalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))
Circuit block encoding claim for the one-term Robin construction. Connects the circuit matrix semantics to the block extraction target and records the dimension compatibility as a parameter. The caller must supply `hDim` proving that the total circuit Hilbert space decomposes as signalDim × systemDim. For concrete `n` (e.g. n = 3) this is provable by `native_decide`. figure:1_term_ROBIN, main.tex:1131-1136 -
Plain-English reading. This definition gives the library's named construction or computation for “default one term robin circuit block claim”. Default one-term Robin circuit block claim using the reusable dimension compatibility theorem.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Default one-term Robin circuit block claim using the reusable dimension compatibility theorem. The block-correctness obligation remains unproved.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:344. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.31●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.defaultOneTermRobinCircuitBlockClaim (n : ℕ) : QuantumBlockEncoding.CircuitBlockEncodingClaim QuantumBlockEncoding.Coeff (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)) (QuantumBlockEncoding.gridSize n) (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.effectiveRobinSignalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))
def QuantumBlockEncoding.Examples.RobinHeat.defaultOneTermRobinCircuitBlockClaim (n : ℕ) : QuantumBlockEncoding.CircuitBlockEncodingClaim QuantumBlockEncoding.Coeff (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)) (QuantumBlockEncoding.gridSize n) (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.effectiveRobinSignalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))
Default one-term Robin circuit block claim using the reusable dimension compatibility theorem. The block-correctness obligation remains unproved.
Plain-English reading. This definition gives the library's named construction or computation for “one term robin finite block composition contract”. Contract-only finite-dimensional LCU/block-composition dependency for the one-term Robin theorem.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Contract-only finite-dimensional LCU/block-composition dependency for the one-term Robin theorem. This records the exact circuit claim, target matrix, normalizer, and open matrix obligations that a future finite-dimensional composition theorem must close. It does not promote the current LCU, projection, or extraction flags.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:359. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.32●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteBlockCompositionContract (n : ℕ) : QuantumBlockEncoding.FiniteBlockCompositionContract QuantumBlockEncoding.Coeff (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)) (QuantumBlockEncoding.gridSize n) (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.effectiveRobinSignalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteBlockCompositionContract (n : ℕ) : QuantumBlockEncoding.FiniteBlockCompositionContract QuantumBlockEncoding.Coeff (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)) (QuantumBlockEncoding.gridSize n) (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.effectiveRobinSignalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))
Contract-only finite-dimensional LCU/block-composition dependency for the one-term Robin theorem. This records the exact circuit claim, target matrix, normalizer, and open matrix obligations that a future finite-dimensional composition theorem must close. It does not promote the current LCU, projection, or extraction flags.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin finite block composition contract transcript”; its local proof does not by itself complete the broader paper route. The finite block-composition contract is wired to the concrete target.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The finite block-composition contract is wired to the concrete target.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:404. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.33●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteBlockCompositionContract_transcript (n : ℕ) : have contract := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteBlockCompositionContract n; contract.sourceAnchor = "QBE finite-dimensional LCU/block-composition contract for GHL2025 Theorem one-term block-encoding" ∧ contract.lcuSourceAnchor = "LCU.StandardBlockEncoding; Childs-Wiebe 2012, arXiv:1202.5822; QBE cited-results row" ∧ contract.theoremAnchor = "Guseynov-Huang-Liu 2025, Theorem one-term block-encoding and Fig. 1-term Robin, arXiv:2506.20478" ∧ contract.claim = QuantumBlockEncoding.Examples.RobinHeat.defaultOneTermRobinCircuitBlockClaim n ∧ contract.expectedTarget = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockExtractionTarget n ∧ contract.claim.target = contract.expectedTarget ∧ contract.expectedTarget.targetMatrix = contract.targetMatrix ∧ contract.expectedTarget.normalizer = contract.normalizer ∧ contract.targetMatrix = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinAkMatrix n ∧ contract.normalizer = QuantumBlockEncoding.GHL2025.oneTermRobinNormalizer ∧ contract.circuitUnitary.proved = false ∧ contract.lcuComposition.proved = false ∧ contract.blockProjection.proved = false ∧ contract.normalizedBlockEquality.proved = false ∧ contract.finalExtraction.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteBlockCompositionContract_transcript (n : ℕ) : have contract := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteBlockCompositionContract n; contract.sourceAnchor = "QBE finite-dimensional LCU/block-composition contract for GHL2025 Theorem one-term block-encoding" ∧ contract.lcuSourceAnchor = "LCU.StandardBlockEncoding; Childs-Wiebe 2012, arXiv:1202.5822; QBE cited-results row" ∧ contract.theoremAnchor = "Guseynov-Huang-Liu 2025, Theorem one-term block-encoding and Fig. 1-term Robin, arXiv:2506.20478" ∧ contract.claim = QuantumBlockEncoding.Examples.RobinHeat.defaultOneTermRobinCircuitBlockClaim n ∧ contract.expectedTarget = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockExtractionTarget n ∧ contract.claim.target = contract.expectedTarget ∧ contract.expectedTarget.targetMatrix = contract.targetMatrix ∧ contract.expectedTarget.normalizer = contract.normalizer ∧ contract.targetMatrix = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinAkMatrix n ∧ contract.normalizer = QuantumBlockEncoding.GHL2025.oneTermRobinNormalizer ∧ contract.circuitUnitary.proved = false ∧ contract.lcuComposition.proved = false ∧ contract.blockProjection.proved = false ∧ contract.normalizedBlockEquality.proved = false ∧ contract.finalExtraction.proved = false
The finite block-composition contract is wired to the concrete target.
Plain-English reading. This definition gives the library's named construction or computation for “one term robin finite composition exact theorem obligation”. Contract-only interface for the exact finite composition theorem still needed to close the GHL2025 one-term Robin block encoding.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Contract-only interface for the exact finite composition theorem still needed to close the GHL2025 one-term Robin block encoding. This names the missing theorem-facing step without asserting it: the seven-gate matrix product, projected in the Definition 'def:block-encoding' signal-zero convention, must realize the Eq. 'ROBIN clarified' target block 'oneTermRobinAkMatrix n / (N_D N_f kappa)'. The proof flag stays false until that exact finite-dimensional theorem is build-tested.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:441. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.34●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteCompositionExactTheoremObligation (_n : ℕ) : QuantumBlockEncoding.SemanticObligation
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteCompositionExactTheoremObligation (_n : ℕ) : QuantumBlockEncoding.SemanticObligation
Contract-only interface for the exact finite composition theorem still needed to close the GHL2025 one-term Robin block encoding. This names the missing theorem-facing step without asserting it: the seven-gate matrix product, projected in the Definition `def:block-encoding` signal-zero convention, must realize the Eq. `ROBIN clarified` target block `oneTermRobinAkMatrix n / (N_D N_f kappa)`. The proof flag stays false until that exact finite-dimensional theorem is build-tested.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin finite composition exact theorem obligation transcript”; its local proof does not by itself complete the broader paper route.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The source declaration has no docstring. The reader cue above is generated from its kind and name and does not replace the Lean signature.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:449. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.35●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteCompositionExactTheoremObligation_transcript (n : ℕ) : (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteCompositionExactTheoremObligation n).source = "GHL2025 Theorem one-term block-encoding, Eq. ROBIN clarified, Fig. 1-term ROBIN, Definition def:block-encoding; cited-results row LCU.StandardBlockEncoding" ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteCompositionExactTheoremObligation n).proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteCompositionExactTheoremObligation_transcript (n : ℕ) : (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteCompositionExactTheoremObligation n).source = "GHL2025 Theorem one-term block-encoding, Eq. ROBIN clarified, Fig. 1-term ROBIN, Definition def:block-encoding; cited-results row LCU.StandardBlockEncoding" ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteCompositionExactTheoremObligation n).proved = false
Plain-English reading. This record groups the data and proof fields needed for “one term robin block encoding proof route”. A proposition-valued field is a requirement until a constructor supplies it. Phase 1 proof-route contract for the GHL2025 one-term Robin theorem.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Phase 1 proof-route contract for the GHL2025 one-term Robin theorem. This record ties the theorem tuple, circuit-matrix semantics, block-projection target, active oracle contracts, and source-route blockers into one Lean object. It is a transcript and obligation map, not a proof that the block encoding is correct.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:467. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.36●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinBlockEncodingProofRoute (n : ℕ) : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinBlockEncodingProofRoute (n : ℕ) : Type
Phase 1 proof-route contract for the GHL2025 one-term Robin theorem. This record ties the theorem tuple, circuit-matrix semantics, block-projection target, active oracle contracts, and source-route blockers into one Lean object. It is a transcript and obligation map, not a proof that the block encoding is correct.
Fields
sourceAnchor : String
parameters : QuantumBlockEncoding.GHL2025.OneTermRobinParameters
theoremData : QuantumBlockEncoding.GHL2025.OneTermRobinTheoremData
circuitSemantics : QuantumBlockEncoding.CircuitMatrixSemantics QuantumBlockEncoding.Coeff (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n))
blockClaim : QuantumBlockEncoding.CircuitBlockEncodingClaim QuantumBlockEncoding.Coeff (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)) (QuantumBlockEncoding.gridSize n) (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.effectiveRobinSignalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))
oracleComposition : QuantumBlockEncoding.Examples.RobinHeat.RobinOracleComposition n
sparseAccessContract : QuantumBlockEncoding.GHL2025.BandedSparseAccessPaperContract
cleanupScopeDecision : QuantumBlockEncoding.GHL2025.BandedSparseAccessCleanupScopeDecision
functionOracleSource : QuantumBlockEncoding.GHL2025.FunctionOracleExternalAmplitudeSourceContract
parameters_eq : self.parameters = QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n
theoremNormalizerMatchesTarget : self.theoremData.alpha = self.blockClaim.target.normalizer
targetMatrixMatchesSpec : self.blockClaim.target.targetMatrix = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinAkMatrix n
signalIndexZero : ↑self.blockClaim.target.signalIndex = 0
circuitWired : self.circuitSemantics.circuit = QuantumBlockEncoding.GHL2025.oneTermRobinCircuit
claimUsesSemantics : self.blockClaim.semantics = self.circuitSemantics
claimUsesTarget : self.blockClaim.target = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockExtractionTarget n
blockProjectionOpen : self.blockClaim.target.blockProjection.proved = false
blockCorrectOpen : self.blockClaim.target.blockCorrect.proved = false
theoremBlockExtractionOpen : self.theoremData.obligations.blockExtraction.proved = false
theoremCircuitUnitaryOpen : self.theoremData.obligations.circuitUnitary.proved = false
sparseAccessForwardOpen : self.sparseAccessContract.forwardCorrect.proved = false
sparseAccessCleanupOpen : self.sparseAccessContract.daggerCleanup.proved = false
sparseAccessUnitaryOpen : self.sparseAccessContract.unitaryExtension.proved = false
cleanupScopeActive : self.cleanupScopeDecision.selectedScope = QuantumBlockEncoding.GHL2025.BandedSparseAccessCleanupScope.activeGlobalSource
cleanupScopePredicate : self.cleanupScopeDecision.selectedPredicate = "bandedSparseAccessPaperGlobalSlotSource"
cleanupScopeEvidence : self.cleanupScopeDecision.selectedEvidence = "bandedSparseAccessGlobalSlotInverseOnRangeContract_restrictedDaggerColumnIndicator"
cleanupScopeFullCleanDomainOpen : self.cleanupScopeDecision.fullCleanDomainSelected = false
cleanupScopeFullSpaceOpen : self.cleanupScopeDecision.fullSpaceSelected = false
cleanupScopeNoSemanticPromotion : self.cleanupScopeDecision.semanticCleanupPromotionAllowed = false
cleanupScopePaperCleanupOpen : self.cleanupScopeDecision.paperContractCleanup.proved = false
cleanupScopeFullCleanDomainCleanupOpen : self.cleanupScopeDecision.fullCleanDomainCleanup.proved = false
cleanupScopeFullSpaceUnitaryOpen : self.cleanupScopeDecision.fullSpaceUnitaryExtension.proved = false
functionOracleExternalOpen : self.functionOracleSource.closesFunctionOracleContract = false
functionOracleOpen : self.oracleComposition.functionOracle.amplitudeCorrect.proved = false
lcuOpen : self.oracleComposition.lcuCorrect.proved = false
Plain-English reading. This definition gives the library's named construction or computation for “one term robin block encoding proof route”. Default theorem-level proof route for the one-term Robin block encoding.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Default theorem-level proof route for the one-term Robin block encoding. All unproved semantic obligations are deliberately kept false. The route uses the active seven-gate circuit product, the global-slot 'O_D^BS' cleanup-scope decision, and the external-source transcript for 'O_f'.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:531. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.37●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute (n : ℕ) : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinBlockEncodingProofRoute n
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute (n : ℕ) : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinBlockEncodingProofRoute n
Default theorem-level proof route for the one-term Robin block encoding. All unproved semantic obligations are deliberately kept false. The route uses the active seven-gate circuit product, the global-slot `O_D^BS` cleanup-scope decision, and the external-source transcript for `O_f`.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route normalizer”; its local proof does not by itself complete the broader paper route. The proof-route contract links the theorem normalizer to the block target.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The proof-route contract links the theorem normalizer to the block target.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:573. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.38●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_normalizer (n : ℕ) : (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.alpha = (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.normalizer
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_normalizer (n : ℕ) : (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.alpha = (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.normalizer
The proof-route contract links the theorem normalizer to the block target.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route block target”; its local proof does not by itself complete the broader paper route. The theorem-level route pins the block target used for the one-term theorem.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The theorem-level route pins the block target used for the one-term theorem. This is only a structural guard: it records the signal-index-zero convention, the Robin target matrix, and the shared circuit semantics object. It does not prove the extracted block equation.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:586. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.39●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_blockTarget (n : ℕ) : (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockExtractionTarget n ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.semantics = (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.targetMatrix = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinAkMatrix n ∧ ↑(QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.signalIndex = 0
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_blockTarget (n : ℕ) : (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockExtractionTarget n ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.semantics = (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.targetMatrix = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinAkMatrix n ∧ ↑(QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.signalIndex = 0
The theorem-level route pins the block target used for the one-term theorem. This is only a structural guard: it records the signal-index-zero convention, the Robin target matrix, and the shared circuit semantics object. It does not prove the extracted block equation.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route block projection normalizer audit”; its local proof does not by itself complete the broader paper route. The theorem-level route uses the same block-projection target, normalizer, and open flags as the concrete circuit matrix target.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The theorem-level route uses the same block-projection target, normalizer, and open flags as the concrete circuit matrix target. This is a route guard for the final block-extraction statement. It records the cast circuit product, the signal-index-zero projection API, the Robin target matrix, and the normalizer 'N_D * N_f * kappa', while keeping the block and LCU obligations false.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:610. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.40●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_blockProjectionNormalizerAudit (n : ℕ) : (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockExtractionTarget n ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.unitaryMatrix = cast ⋯ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinCircuitSemantics n).matrix ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockMatrix = QuantumBlockEncoding.signalSystemBlockProjection (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.effectiveRobinSignalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n))) (QuantumBlockEncoding.gridSize n) (QuantumBlockEncoding.gridSize n) (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.unitaryMatrix (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.signalIndex ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.targetMatrix = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinAkMatrix n ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.normalizer = QuantumBlockEncoding.GHL2025.oneTermRobinNormalizer ∧ ↑(QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.signalIndex = 0 ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_blockProjectionNormalizerAudit (n : ℕ) : (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockExtractionTarget n ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.unitaryMatrix = cast ⋯ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinCircuitSemantics n).matrix ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockMatrix = QuantumBlockEncoding.signalSystemBlockProjection (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.effectiveRobinSignalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n))) (QuantumBlockEncoding.gridSize n) (QuantumBlockEncoding.gridSize n) (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.unitaryMatrix (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.signalIndex ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.targetMatrix = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinAkMatrix n ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.normalizer = QuantumBlockEncoding.GHL2025.oneTermRobinNormalizer ∧ ↑(QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.signalIndex = 0 ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false
The theorem-level route uses the same block-projection target, normalizer, and open flags as the concrete circuit matrix target. This is a route guard for the final block-extraction statement. It records the cast circuit product, the signal-index-zero projection API, the Robin target matrix, and the normalizer `N_D * N_f * kappa`, while keeping the block and LCU obligations false.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route circuit product”; its local proof does not by itself complete the broader paper route. The theorem-level route uses the active seven-gate circuit product.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The theorem-level route uses the active seven-gate circuit product. This is a structural guard for Phase 1: it records that the route still points to 'oneTermRobinCircuitSemantics', whose matrix is the ordered product computed by 'evalGateMatrices' over 'oneTermRobinGateMatrixPlaceholders'. It does not prove any gate unitarity or block-extraction equation.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:680. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.41●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_circuitProduct (n : ℕ) : (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.circuit = QuantumBlockEncoding.GHL2025.oneTermRobinCircuit ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices = QuantumBlockEncoding.GHL2025.oneTermRobinGateMatrixPlaceholders (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ∧ ⋯ = ⋯ ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.matrix.PointwiseEq (QuantumBlockEncoding.evalGateMatrices (QuantumBlockEncoding.GHL2025.oneTermRobinGateMatrixPlaceholders (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n))) ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.semantics = (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_circuitProduct (n : ℕ) : (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.circuit = QuantumBlockEncoding.GHL2025.oneTermRobinCircuit ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices = QuantumBlockEncoding.GHL2025.oneTermRobinGateMatrixPlaceholders (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ∧ ⋯ = ⋯ ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.matrix.PointwiseEq (QuantumBlockEncoding.evalGateMatrices (QuantumBlockEncoding.GHL2025.oneTermRobinGateMatrixPlaceholders (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n))) ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.semantics = (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics
The theorem-level route uses the active seven-gate circuit product. This is a structural guard for Phase 1: it records that the route still points to `oneTermRobinCircuitSemantics`, whose matrix is the ordered product computed by `evalGateMatrices` over `oneTermRobinGateMatrixPlaceholders`. It does not prove any gate unitarity or block-extraction equation.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route gate unitary flags”; its local proof does not by itself complete the broader paper route. The theorem route uses the active seven-gate matrix product with the current gate-level proof flags frozen.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The theorem route uses the active seven-gate matrix product with the current gate-level proof flags frozen. Only 'U_indic' and SWAP are locally marked proved. The paper-oracle gates 'O_DT^S', 'Ry_boundary', 'O_D^BS', 'O_f', and '(O_D^BS)^dagger' remain in obligation mode, and the O_D^BS cleanup scope is still restricted to the active global sparse-slot source.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:712. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.42●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gateUnitaryFlags (n : ℕ) : List.map (fun gateMatrix => gateMatrix.unitary.proved) (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices = [true, false, false, false, false, true, false] ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.selectedScope = QuantumBlockEncoding.GHL2025.BandedSparseAccessCleanupScope.activeGlobalSource ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.semanticCleanupPromotionAllowed = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gateUnitaryFlags (n : ℕ) : List.map (fun gateMatrix => gateMatrix.unitary.proved) (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices = [true, false, false, false, false, true, false] ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.selectedScope = QuantumBlockEncoding.GHL2025.BandedSparseAccessCleanupScope.activeGlobalSource ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.semanticCleanupPromotionAllowed = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false
The theorem route uses the active seven-gate matrix product with the current gate-level proof flags frozen. Only `U_indic` and SWAP are locally marked proved. The paper-oracle gates `O_DT^S`, `Ry_boundary`, `O_D^BS`, `O_f`, and `(O_D^BS)^dagger` remain in obligation mode, and the O_D^BS cleanup scope is still restricted to the active global sparse-slot source.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route gate list and flags”; its local proof does not by itself complete the broader paper route. The theorem route keeps the Fig.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The theorem route keeps the Fig. 1-term Robin gate order and the current gate-level proof flags synchronized. This guard packages the gate-list freeze with the seven-gate flag freeze. It does not prove any of the paper-oracle gates unitary and keeps the O_D^BS active global-source cleanup scope in obligation mode.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:740. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.43●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gateListAndFlags (n : ℕ) : List.map (fun gateMatrix => gateMatrix.gate) (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices = QuantumBlockEncoding.GHL2025.oneTermRobinCircuit ∧ List.map (fun gateMatrix => gateMatrix.unitary.proved) (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices = [true, false, false, false, false, true, false] ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.selectedScope = QuantumBlockEncoding.GHL2025.BandedSparseAccessCleanupScope.activeGlobalSource ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.semanticCleanupPromotionAllowed = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gateListAndFlags (n : ℕ) : List.map (fun gateMatrix => gateMatrix.gate) (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices = QuantumBlockEncoding.GHL2025.oneTermRobinCircuit ∧ List.map (fun gateMatrix => gateMatrix.unitary.proved) (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices = [true, false, false, false, false, true, false] ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.selectedScope = QuantumBlockEncoding.GHL2025.BandedSparseAccessCleanupScope.activeGlobalSource ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.semanticCleanupPromotionAllowed = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false
The theorem route keeps the Fig. 1-term Robin gate order and the current gate-level proof flags synchronized. This guard packages the gate-list freeze with the seven-gate flag freeze. It does not prove any of the paper-oracle gates unitary and keeps the O_D^BS active global-source cleanup scope in obligation mode.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route gate projection freeze”; its local proof does not by itself complete the broader paper route. The theorem route keeps the seven-gate order and projection target frozen together.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The theorem route keeps the seven-gate order and projection target frozen together. This is a reviewer-facing proof-DAG wrapper over the gate-list guard and the block-projection normalizer audit. It records the active Fig. 1-term Robin gate order, the current proof-state vector, the signal-index-zero target, and the final false flags. It does not prove a block equation or change any oracle matrix.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:780. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.44●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gateProjectionFreeze (n : ℕ) : List.map (fun gateMatrix => gateMatrix.gate) (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices = QuantumBlockEncoding.GHL2025.oneTermRobinCircuit ∧ List.map (fun gateMatrix => gateMatrix.unitary.proved) (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices = [true, false, false, false, false, true, false] ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.normalizer = QuantumBlockEncoding.GHL2025.oneTermRobinNormalizer ∧ ↑(QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.signalIndex = 0 ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.semanticCleanupPromotionAllowed = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gateProjectionFreeze (n : ℕ) : List.map (fun gateMatrix => gateMatrix.gate) (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices = QuantumBlockEncoding.GHL2025.oneTermRobinCircuit ∧ List.map (fun gateMatrix => gateMatrix.unitary.proved) (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices = [true, false, false, false, false, true, false] ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.normalizer = QuantumBlockEncoding.GHL2025.oneTermRobinNormalizer ∧ ↑(QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.signalIndex = 0 ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.semanticCleanupPromotionAllowed = false
The theorem route keeps the seven-gate order and projection target frozen together. This is a reviewer-facing proof-DAG wrapper over the gate-list guard and the block-projection normalizer audit. It records the active Fig. 1-term Robin gate order, the current proof-state vector, the signal-index-zero target, and the final false flags. It does not prove a block equation or change any oracle matrix.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route layout projection audit”; its local proof does not by itself complete the broader paper route. The theorem-level signal and pure-ancilla counts are wired separately from the circuit-level projection dimension.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The theorem-level signal and pure-ancilla counts are wired separately from the circuit-level projection dimension. The paper theorem states the block-encoding tuple with 'oneTermRobinLayout.signalQubits' and '2n' pure ancillas. The matrix backend uses 'effectiveRobinSignalQubits' because the block projection zeros every non-system wire in the concrete register partition. This guard records both counts and keeps resource cleanup plus block extraction in obligation mode.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:823. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.45●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_layoutProjectionAudit (n : ℕ) : (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.signalQubits = (QuantumBlockEncoding.GHL2025.oneTermRobinLayout (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).signalQubits ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.pureAncillas = (QuantumBlockEncoding.GHL2025.oneTermRobinLayout (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).pureAncillas ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.pureAncillas = (QuantumBlockEncoding.GHL2025.oneTermRobinResource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).pureAncilla ∧ QuantumBlockEncoding.GHL2025.effectiveRobinSignalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) = (QuantumBlockEncoding.GHL2025.oneTermRobinLayout (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).signalQubits + (QuantumBlockEncoding.GHL2025.defaultRobinRegisterPartition (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).odPureAncillaQubits + 1 ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.resourceBound.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.ancillaCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_layoutProjectionAudit (n : ℕ) : (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.signalQubits = (QuantumBlockEncoding.GHL2025.oneTermRobinLayout (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).signalQubits ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.pureAncillas = (QuantumBlockEncoding.GHL2025.oneTermRobinLayout (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).pureAncillas ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.pureAncillas = (QuantumBlockEncoding.GHL2025.oneTermRobinResource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).pureAncilla ∧ QuantumBlockEncoding.GHL2025.effectiveRobinSignalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) = (QuantumBlockEncoding.GHL2025.oneTermRobinLayout (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).signalQubits + (QuantumBlockEncoding.GHL2025.defaultRobinRegisterPartition (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).odPureAncillaQubits + 1 ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.resourceBound.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.ancillaCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false
The theorem-level signal and pure-ancilla counts are wired separately from the circuit-level projection dimension. The paper theorem states the block-encoding tuple with `oneTermRobinLayout.signalQubits` and `2n` pure ancillas. The matrix backend uses `effectiveRobinSignalQubits` because the block projection zeros every non-system wire in the concrete register partition. This guard records both counts and keeps resource cleanup plus block extraction in obligation mode.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block extraction target signal zero block indices”; its local proof does not by itself complete the broader paper route. The signal-index-zero Robin target uses the unshifted system row and column indices.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The signal-index-zero Robin target uses the unshifted system row and column indices. This is an index-convention guard for the block-projection route, not a proof of the extracted block equation.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:862. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.46●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockExtractionTarget_signalZeroBlockIndices (n : ℕ) (i j : Fin (QuantumBlockEncoding.gridSize n)) : QuantumBlockEncoding.signalSystemBlockRowIndex (QuantumBlockEncoding.gridSize n) ↑(QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockExtractionTarget n).signalIndex ↑i = ↑i ∧ QuantumBlockEncoding.signalSystemBlockColIndex (QuantumBlockEncoding.gridSize n) ↑(QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockExtractionTarget n).signalIndex ↑j = ↑j
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockExtractionTarget_signalZeroBlockIndices (n : ℕ) (i j : Fin (QuantumBlockEncoding.gridSize n)) : QuantumBlockEncoding.signalSystemBlockRowIndex (QuantumBlockEncoding.gridSize n) ↑(QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockExtractionTarget n).signalIndex ↑i = ↑i ∧ QuantumBlockEncoding.signalSystemBlockColIndex (QuantumBlockEncoding.gridSize n) ↑(QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockExtractionTarget n).signalIndex ↑j = ↑j
The signal-index-zero Robin target uses the unshifted system row and column indices. This is an index-convention guard for the block-projection route, not a proof of the extracted block equation.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route signal zero block indices”; its local proof does not by itself complete the broader paper route. The theorem-level route inherits the signal-index-zero block index convention from 'oneTermRobinBlockExtractionTarget'.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The theorem-level route inherits the signal-index-zero block index convention from 'oneTermRobinBlockExtractionTarget'.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:876. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.47●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_signalZeroBlockIndices (n : ℕ) (i j : Fin (QuantumBlockEncoding.gridSize n)) : QuantumBlockEncoding.signalSystemBlockRowIndex (QuantumBlockEncoding.gridSize n) ↑(QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.signalIndex ↑i = ↑i ∧ QuantumBlockEncoding.signalSystemBlockColIndex (QuantumBlockEncoding.gridSize n) ↑(QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.signalIndex ↑j = ↑j
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_signalZeroBlockIndices (n : ℕ) (i j : Fin (QuantumBlockEncoding.gridSize n)) : QuantumBlockEncoding.signalSystemBlockRowIndex (QuantumBlockEncoding.gridSize n) ↑(QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.signalIndex ↑i = ↑i ∧ QuantumBlockEncoding.signalSystemBlockColIndex (QuantumBlockEncoding.gridSize n) ↑(QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.signalIndex ↑j = ↑j
The theorem-level route inherits the signal-index-zero block index convention from `oneTermRobinBlockExtractionTarget`.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route claim block correct false”; its local proof does not by itself complete the broader paper route. The theorem-level route keeps the circuit-claim block obligation open.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The theorem-level route keeps the circuit-claim block obligation open. 'CircuitBlockEncodingClaim.blockCorrect' is separate from the target-level 'blockCorrect' field. This guard prevents the route from silently promoting the theorem claim while the paper-level oracle and composition blockers remain open.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:899. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.48●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_claimBlockCorrectFalse (n : ℕ) : (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_claimBlockCorrectFalse (n : ℕ) : (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false
The theorem-level route keeps the circuit-claim block obligation open. `CircuitBlockEncodingClaim.blockCorrect` is separate from the target-level `blockCorrect` field. This guard prevents the route from silently promoting the theorem claim while the paper-level oracle and composition blockers remain open.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route flags false”; its local proof does not by itself complete the broader paper route. The theorem-level route keeps all semantic blockers in obligation mode.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The theorem-level route keeps all semantic blockers in obligation mode. This theorem is the acceptance guard for the Phase 1 contract: it records the current false flags without using them as proofs.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:917. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.49●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_flags_false (n : ℕ) : (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.selectedScope = QuantumBlockEncoding.GHL2025.BandedSparseAccessCleanupScope.activeGlobalSource ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.fullCleanDomainSelected = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.fullSpaceSelected = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.semanticCleanupPromotionAllowed = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource.closesFunctionOracleContract = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.functionOracle.amplitudeCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_flags_false (n : ℕ) : (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.selectedScope = QuantumBlockEncoding.GHL2025.BandedSparseAccessCleanupScope.activeGlobalSource ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.fullCleanDomainSelected = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.fullSpaceSelected = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.semanticCleanupPromotionAllowed = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource.closesFunctionOracleContract = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.functionOracle.amplitudeCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false
The theorem-level route keeps all semantic blockers in obligation mode. This theorem is the acceptance guard for the Phase 1 contract: it records the current false flags without using them as proofs.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route of external source and flags”; its local proof does not by itself complete the broader paper route. The theorem route exposes the 'O_f' external-source transcript and false flags.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The theorem route exposes the 'O_f' external-source transcript and false flags. This is a Phase 1 bridge from the per-column 'functionOracleAmplitudeProofRoute_externalSourceAndFlags' guard to 'oneTermRobinBlockEncodingProofRoute'. It records that the route still points to the cited GHL2025/GL2024 source contract and keeps the 'N_f', orthogonal completion, gate-unitarity, LCU, projection, and block-correctness obligations false.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:969. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.50●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_ofExternalSourceAndFlags (n j : ℕ) : (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource = QuantumBlockEncoding.GHL2025.functionOracleExternalAmplitudeSourceContract ∧ (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) j).sourceAnchor = (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource.sourceAnchor ∧ (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) j).normalizerNf = (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource.normalizerNf ∧ (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) j).normalizedAmplitudeFormula = (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource.cleanBranchFormula ∧ (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) j).nonzeroNormalizer = (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource.nonzeroNormalizer ∧ (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) j).divisionSemantics = (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource.divisionSemantics ∧ (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) j).theoremAmplitudeCorrect = (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource.theoremAmplitudeCorrect ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource.resourceClaim.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource.externalTheoremFormalized.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource.nonzeroNormalizer.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource.divisionSemantics.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource.theoremAmplitudeCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource.closesNormalizerBound = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource.closesOrthogonalCompletion = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource.closesUnitaryCompletion = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource.closesFunctionOracleContract = false ∧ (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) j).normalizedAmplitudeCorrect.proved = false ∧ (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) j).nonzeroNormalizer.proved = false ∧ (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) j).divisionSemantics.proved = false ∧ (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) j).normalizerBound.proved = false ∧ (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) j).orthogonalComponentCorrect.proved = false ∧ (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) j).unitaryCompletion.proved = false ∧ (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) j).theoremAmplitudeCorrect.proved = false ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨4, ⋯⟩).gate = QuantumBlockEncoding.Gate.oracleCall "O_f" ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨4, ⋯⟩).matrix = QuantumBlockEncoding.GHL2025.functionOraclePaperMatrix (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_f (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.functionOracle.amplitudeCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_ofExternalSourceAndFlags (n j : ℕ) : (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource = QuantumBlockEncoding.GHL2025.functionOracleExternalAmplitudeSourceContract ∧ (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) j).sourceAnchor = (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource.sourceAnchor ∧ (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) j).normalizerNf = (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource.normalizerNf ∧ (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) j).normalizedAmplitudeFormula = (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource.cleanBranchFormula ∧ (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) j).nonzeroNormalizer = (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource.nonzeroNormalizer ∧ (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) j).divisionSemantics = (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource.divisionSemantics ∧ (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) j).theoremAmplitudeCorrect = (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource.theoremAmplitudeCorrect ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource.resourceClaim.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource.externalTheoremFormalized.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource.nonzeroNormalizer.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource.divisionSemantics.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource.theoremAmplitudeCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource.closesNormalizerBound = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource.closesOrthogonalCompletion = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource.closesUnitaryCompletion = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource.closesFunctionOracleContract = false ∧ (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) j).normalizedAmplitudeCorrect.proved = false ∧ (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) j).nonzeroNormalizer.proved = false ∧ (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) j).divisionSemantics.proved = false ∧ (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) j).normalizerBound.proved = false ∧ (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) j).orthogonalComponentCorrect.proved = false ∧ (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) j).unitaryCompletion.proved = false ∧ (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) j).theoremAmplitudeCorrect.proved = false ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨4, ⋯⟩).gate = QuantumBlockEncoding.Gate.oracleCall "O_f" ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨4, ⋯⟩).matrix = QuantumBlockEncoding.GHL2025.functionOraclePaperMatrix (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_f (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.functionOracle.amplitudeCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false
The theorem route exposes the `O_f` external-source transcript and false flags. This is a Phase 1 bridge from the per-column `functionOracleAmplitudeProofRoute_externalSourceAndFlags` guard to `oneTermRobinBlockEncodingProofRoute`. It records that the route still points to the cited GHL2025/GL2024 source contract and keeps the `N_f`, orthogonal completion, gate-unitarity, LCU, projection, and block-correctness obligations false.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route of clean function oracle entry”; its local proof does not by itself complete the broader paper route. The route-level 'O_f' gate exposes the clean-workspace paper branch entry.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The route-level 'O_f' gate exposes the clean-workspace paper branch entry. This is a narrow bridge from gate slot 4 of Fig. 1-term Robin to the per-column 'functionOracleAmplitudeProofRoute'. It proves only the matrix entry selected by the clean 'm_f' branch; the theorem-level function-oracle, LCU, projection, block-correctness, and final extraction flags remain false.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:1076. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.51●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_ofCleanFunctionOracleEntry (n : ℕ) (i j : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))) (hClean : (QuantumBlockEncoding.GHL2025.functionOraclePaperImage (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑j).cleanWorkspaceBranch = true) (hBranch : ↑i = (QuantumBlockEncoding.GHL2025.functionOraclePaperImage (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑j).cleanBranchBasisIndex) : have p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n; ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨4, ⋯⟩).gate = QuantumBlockEncoding.Gate.oracleCall "O_f" ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨4, ⋯⟩).matrix i j = (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute p ↑j).cleanBranchAmplitude ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨4, ⋯⟩).matrix i j = (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute p ↑j).normalizedAmplitude ∧ (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute p ↑j).cleanBranchBasisIndex = ↑i ∧ (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute p ↑j).cleanWorkspaceBranch = true ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨4, ⋯⟩).unitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource.closesFunctionOracleContract = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.functionOracle.amplitudeCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_ofCleanFunctionOracleEntry (n : ℕ) (i j : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))) (hClean : (QuantumBlockEncoding.GHL2025.functionOraclePaperImage (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑j).cleanWorkspaceBranch = true) (hBranch : ↑i = (QuantumBlockEncoding.GHL2025.functionOraclePaperImage (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑j).cleanBranchBasisIndex) : have p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n; ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨4, ⋯⟩).gate = QuantumBlockEncoding.Gate.oracleCall "O_f" ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨4, ⋯⟩).matrix i j = (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute p ↑j).cleanBranchAmplitude ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨4, ⋯⟩).matrix i j = (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute p ↑j).normalizedAmplitude ∧ (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute p ↑j).cleanBranchBasisIndex = ↑i ∧ (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute p ↑j).cleanWorkspaceBranch = true ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨4, ⋯⟩).unitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource.closesFunctionOracleContract = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.functionOracle.amplitudeCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false
The route-level `O_f` gate exposes the clean-workspace paper branch entry. This is a narrow bridge from gate slot 4 of Fig. 1-term Robin to the per-column `functionOracleAmplitudeProofRoute`. It proves only the matrix entry selected by the clean `m_f` branch; the theorem-level function-oracle, LCU, projection, block-correctness, and final extraction flags remain false.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route derivative boundary contract map”; its local proof does not by itself complete the broader paper route. The theorem route exposes the derivative-amplitude and boundary-rotation contracts that share the paper normalizer 'N_D'.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The theorem route exposes the derivative-amplitude and boundary-rotation contracts that share the paper normalizer 'N_D'. This guard connects GHL2025 Lemma 3, Eq. (20), Eq. 'angles for Ry', and Fig. 1-term Robin to 'oneTermRobinBlockEncodingProofRoute'. It packages the existing source-bound bridge for 'O_DT^S' and 'Ry_boundary', checks that those gates occur in the active seven-gate route, and keeps all analytic, gate-level, LCU, projection, and final extraction flags false.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:1174. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.52●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_derivativeBoundaryContractMap (n row sparse : ℕ) : ((QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).coefficient = (QuantumBlockEncoding.GHL2025.derivativeNormalizerNDSourceBound (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).sourceCoefficient ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).normalizerND = (QuantumBlockEncoding.GHL2025.derivativeNormalizerNDSourceBound (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).normalizerND ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).normalizerBound = (QuantumBlockEncoding.GHL2025.derivativeNormalizerNDSourceBound (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).coefficientBound) ∧ ((QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).coefficient = (QuantumBlockEncoding.GHL2025.derivativeNormalizerNDSourceBound (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).sourceCoefficient ∧ (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).normalizerND = (QuantumBlockEncoding.GHL2025.derivativeNormalizerNDSourceBound (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).normalizerND ∧ (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).normalizerBound = (QuantumBlockEncoding.GHL2025.derivativeNormalizerNDSourceBound (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).coefficientBound) ∧ ((QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).coefficient = (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).coefficient ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).normalizerND = (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).normalizerND ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).normalizerBound = (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).normalizerBound) ∧ (QuantumBlockEncoding.GHL2025.derivativeNormalizerNDContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).nonzeroNormalizer.proved = false ∧ (QuantumBlockEncoding.GHL2025.derivativeNormalizerNDContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).divisionSemantics.proved = false ∧ (QuantumBlockEncoding.GHL2025.derivativeNormalizerNDContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).coefficientBound.proved = false ∧ (QuantumBlockEncoding.GHL2025.derivativeNormalizerNDContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).absSquareSemantics.proved = false ∧ (QuantumBlockEncoding.GHL2025.derivativeNormalizerNDContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).sqrtComplementSemantics.proved = false ∧ (QuantumBlockEncoding.GHL2025.derivativeNormalizerNDContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).arccosSemantics.proved = false ∧ (QuantumBlockEncoding.GHL2025.derivativeNormalizerNDContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).twoByTwoUnitary.proved = false ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).coefficientDivision.proved = false ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).normalizerBound.proved = false ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).absSquareSemantics.proved = false ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).sqrtComplementSemantics.proved = false ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).twoByTwoUnitary.proved = false ∧ (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).coefficientDivision.proved = false ∧ (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).realArccosSemantics.proved = false ∧ (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).halfAngleSemantics.proved = false ∧ (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).normalizerBound.proved = false ∧ (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).twoByTwoUnitary.proved = false ∧ List.map (fun gateMatrix => gateMatrix.gate) (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices = QuantumBlockEncoding.GHL2025.oneTermRobinCircuit ∧ List.map (fun gateMatrix => gateMatrix.unitary.proved) (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices = [true, false, false, false, false, true, false] ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨1, ⋯⟩).gate = QuantumBlockEncoding.Gate.oracleCall "O_DT^S" ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨1, ⋯⟩).matrix = QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTRotationMatrix (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨2, ⋯⟩).gate = QuantumBlockEncoding.Gate.oracleCall "Ry_boundary" ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨2, ⋯⟩).matrix = QuantumBlockEncoding.GHL2025.boundaryRotationMatrix (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_DT_S (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitary.proved = false ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_Ry_boundary (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.functionOracle.amplitudeCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_derivativeBoundaryContractMap (n row sparse : ℕ) : ((QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).coefficient = (QuantumBlockEncoding.GHL2025.derivativeNormalizerNDSourceBound (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).sourceCoefficient ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).normalizerND = (QuantumBlockEncoding.GHL2025.derivativeNormalizerNDSourceBound (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).normalizerND ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).normalizerBound = (QuantumBlockEncoding.GHL2025.derivativeNormalizerNDSourceBound (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).coefficientBound) ∧ ((QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).coefficient = (QuantumBlockEncoding.GHL2025.derivativeNormalizerNDSourceBound (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).sourceCoefficient ∧ (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).normalizerND = (QuantumBlockEncoding.GHL2025.derivativeNormalizerNDSourceBound (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).normalizerND ∧ (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).normalizerBound = (QuantumBlockEncoding.GHL2025.derivativeNormalizerNDSourceBound (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).coefficientBound) ∧ ((QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).coefficient = (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).coefficient ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).normalizerND = (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).normalizerND ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).normalizerBound = (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).normalizerBound) ∧ (QuantumBlockEncoding.GHL2025.derivativeNormalizerNDContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).nonzeroNormalizer.proved = false ∧ (QuantumBlockEncoding.GHL2025.derivativeNormalizerNDContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).divisionSemantics.proved = false ∧ (QuantumBlockEncoding.GHL2025.derivativeNormalizerNDContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).coefficientBound.proved = false ∧ (QuantumBlockEncoding.GHL2025.derivativeNormalizerNDContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).absSquareSemantics.proved = false ∧ (QuantumBlockEncoding.GHL2025.derivativeNormalizerNDContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).sqrtComplementSemantics.proved = false ∧ (QuantumBlockEncoding.GHL2025.derivativeNormalizerNDContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).arccosSemantics.proved = false ∧ (QuantumBlockEncoding.GHL2025.derivativeNormalizerNDContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).twoByTwoUnitary.proved = false ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).coefficientDivision.proved = false ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).normalizerBound.proved = false ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).absSquareSemantics.proved = false ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).sqrtComplementSemantics.proved = false ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).twoByTwoUnitary.proved = false ∧ (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).coefficientDivision.proved = false ∧ (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).realArccosSemantics.proved = false ∧ (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).halfAngleSemantics.proved = false ∧ (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).normalizerBound.proved = false ∧ (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).twoByTwoUnitary.proved = false ∧ List.map (fun gateMatrix => gateMatrix.gate) (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices = QuantumBlockEncoding.GHL2025.oneTermRobinCircuit ∧ List.map (fun gateMatrix => gateMatrix.unitary.proved) (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices = [true, false, false, false, false, true, false] ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨1, ⋯⟩).gate = QuantumBlockEncoding.Gate.oracleCall "O_DT^S" ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨1, ⋯⟩).matrix = QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTRotationMatrix (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨2, ⋯⟩).gate = QuantumBlockEncoding.Gate.oracleCall "Ry_boundary" ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨2, ⋯⟩).matrix = QuantumBlockEncoding.GHL2025.boundaryRotationMatrix (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_DT_S (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitary.proved = false ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_Ry_boundary (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.functionOracle.amplitudeCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false
The theorem route exposes the derivative-amplitude and boundary-rotation contracts that share the paper normalizer `N_D`. This guard connects GHL2025 Lemma 3, Eq. (20), Eq. `angles for Ry`, and Fig. 1-term Robin to `oneTermRobinBlockEncodingProofRoute`. It packages the existing source-bound bridge for `O_DT^S` and `Ry_boundary`, checks that those gates occur in the active seven-gate route, and keeps all analytic, gate-level, LCU, projection, and final extraction flags false.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route odts ket zero entry”; its local proof does not by itself complete the broader paper route. The route-level 'O_DT^S' gate exposes the Eq.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The route-level 'O_DT^S' gate exposes the Eq. (20) ket-zero entry. This is the local matrix-entry bridge for the derivative-amplitude factor in Eq. 'ROBIN clarified'. Under the paper-register hypotheses selecting an indicator-1, ancilla-0 column and the ancilla-0 row with matching non-ancilla bits, gate slot 1 of the Fig. 1-term Robin route has the symbolic ket-zero entry recorded by 'sparseAmplitudeOracleDTCoefficientNormalizerProofRoute'. It does not prove the division semantics, normalizer bound, two-by-two unitarity, LCU composition, projection, or final block extraction.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:1320. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.53●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_odtsKetZeroEntry (n : ℕ) (i j : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))) (hIndicator : (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑j).indicatorBit = 1) (hAncilla : (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑j).ancillaBit = 0) (hRow : ↑i >>> 1 = (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑j).nonAncillaValue) (hAncillaRow : ↑i &&& 1 = 0) : have p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n; have regs := QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p ↑j; ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨1, ⋯⟩).gate = QuantumBlockEncoding.Gate.oracleCall "O_DT^S" ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨1, ⋯⟩).matrix i j = (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute p regs.rowValue regs.sparseIndexValue).ketZeroEntry ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute p regs.rowValue regs.sparseIndexValue).ketZeroEntry = (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerContract p regs.rowValue regs.sparseIndexValue).ketZeroEntry ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute p regs.rowValue regs.sparseIndexValue).normalizedCoefficient = QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTNormalizedCoefficient p regs.rowValue regs.sparseIndexValue ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute p regs.rowValue regs.sparseIndexValue).coefficientDivision.proved = false ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute p regs.rowValue regs.sparseIndexValue).normalizerBound.proved = false ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute p regs.rowValue regs.sparseIndexValue).absSquareSemantics.proved = false ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute p regs.rowValue regs.sparseIndexValue).sqrtComplementSemantics.proved = false ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute p regs.rowValue regs.sparseIndexValue).twoByTwoUnitary.proved = false ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_DT_S p).unitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_odtsKetZeroEntry (n : ℕ) (i j : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))) (hIndicator : (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑j).indicatorBit = 1) (hAncilla : (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑j).ancillaBit = 0) (hRow : ↑i >>> 1 = (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑j).nonAncillaValue) (hAncillaRow : ↑i &&& 1 = 0) : have p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n; have regs := QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p ↑j; ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨1, ⋯⟩).gate = QuantumBlockEncoding.Gate.oracleCall "O_DT^S" ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨1, ⋯⟩).matrix i j = (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute p regs.rowValue regs.sparseIndexValue).ketZeroEntry ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute p regs.rowValue regs.sparseIndexValue).ketZeroEntry = (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerContract p regs.rowValue regs.sparseIndexValue).ketZeroEntry ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute p regs.rowValue regs.sparseIndexValue).normalizedCoefficient = QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTNormalizedCoefficient p regs.rowValue regs.sparseIndexValue ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute p regs.rowValue regs.sparseIndexValue).coefficientDivision.proved = false ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute p regs.rowValue regs.sparseIndexValue).normalizerBound.proved = false ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute p regs.rowValue regs.sparseIndexValue).absSquareSemantics.proved = false ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute p regs.rowValue regs.sparseIndexValue).sqrtComplementSemantics.proved = false ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute p regs.rowValue regs.sparseIndexValue).twoByTwoUnitary.proved = false ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_DT_S p).unitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false
The route-level `O_DT^S` gate exposes the Eq. (20) ket-zero entry. This is the local matrix-entry bridge for the derivative-amplitude factor in Eq. `ROBIN clarified`. Under the paper-register hypotheses selecting an indicator-1, ancilla-0 column and the ancilla-0 row with matching non-ancilla bits, gate slot 1 of the Fig. 1-term Robin route has the symbolic ket-zero entry recorded by `sparseAmplitudeOracleDTCoefficientNormalizerProofRoute`. It does not prove the division semantics, normalizer bound, two-by-two unitarity, LCU composition, projection, or final block extraction.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route boundary ket zero entry”; its local proof does not by itself complete the broader paper route. The route-level 'Ry_boundary' gate exposes the boundary ket-zero entry.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The route-level 'Ry_boundary' gate exposes the boundary ket-zero entry. This is the local matrix-entry bridge for the boundary rotation factor in Eq. 'angles for Ry' and Eq. 'ROBIN clarified'. Under the paper-register hypotheses selecting an indicator-0, ancilla-0 column and the ancilla-0 row with matching non-ancilla bits, gate slot 2 of the Fig. 1-term Robin route has the symbolic cosine half-angle entry recorded by 'boundaryRotationAngleNormalizerProofRoute'. It does not prove the arccos semantics, half-angle identities, two-by-two unitarity, LCU composition, projection, or final block extraction.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:1439. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.54●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_boundaryKetZeroEntry (n : ℕ) (i j : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))) (hIndicator : (QuantumBlockEncoding.GHL2025.boundaryRotationPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑j).indicatorBit = 0) (hAncilla : (QuantumBlockEncoding.GHL2025.boundaryRotationPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑j).ancillaBit = 0) (hRow : ↑i >>> 1 = (QuantumBlockEncoding.GHL2025.boundaryRotationPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑j).nonAncillaValue) (hAncillaRow : ↑i &&& 1 = 0) : have p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n; have regs := QuantumBlockEncoding.GHL2025.boundaryRotationPaperRegisters p ↑j; ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨2, ⋯⟩).gate = QuantumBlockEncoding.Gate.oracleCall "Ry_boundary" ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨2, ⋯⟩).matrix i j = (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute p regs.rowValue regs.sparseIndexValue).cosHalfEntry ∧ (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute p regs.rowValue regs.sparseIndexValue).cosHalfEntry = (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerContract p regs.rowValue regs.sparseIndexValue).cosHalfEntry ∧ (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute p regs.rowValue regs.sparseIndexValue).arccosArgument = QuantumBlockEncoding.GHL2025.boundaryRotationNormalizedCoefficient p regs.rowValue regs.sparseIndexValue ∧ ((QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute p regs.rowValue regs.sparseIndexValue).coefficient = (QuantumBlockEncoding.GHL2025.derivativeNormalizerNDSourceBound p regs.rowValue regs.sparseIndexValue).sourceCoefficient ∧ (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute p regs.rowValue regs.sparseIndexValue).normalizerND = (QuantumBlockEncoding.GHL2025.derivativeNormalizerNDSourceBound p regs.rowValue regs.sparseIndexValue).normalizerND ∧ (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute p regs.rowValue regs.sparseIndexValue).normalizerBound = (QuantumBlockEncoding.GHL2025.derivativeNormalizerNDSourceBound p regs.rowValue regs.sparseIndexValue).coefficientBound) ∧ (QuantumBlockEncoding.GHL2025.derivativeNormalizerNDContract p regs.rowValue regs.sparseIndexValue).nonzeroNormalizer.proved = false ∧ (QuantumBlockEncoding.GHL2025.derivativeNormalizerNDContract p regs.rowValue regs.sparseIndexValue).divisionSemantics.proved = false ∧ (QuantumBlockEncoding.GHL2025.derivativeNormalizerNDContract p regs.rowValue regs.sparseIndexValue).coefficientBound.proved = false ∧ (QuantumBlockEncoding.GHL2025.derivativeNormalizerNDContract p regs.rowValue regs.sparseIndexValue).absSquareSemantics.proved = false ∧ (QuantumBlockEncoding.GHL2025.derivativeNormalizerNDContract p regs.rowValue regs.sparseIndexValue).sqrtComplementSemantics.proved = false ∧ (QuantumBlockEncoding.GHL2025.derivativeNormalizerNDContract p regs.rowValue regs.sparseIndexValue).arccosSemantics.proved = false ∧ (QuantumBlockEncoding.GHL2025.derivativeNormalizerNDContract p regs.rowValue regs.sparseIndexValue).twoByTwoUnitary.proved = false ∧ (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute p regs.rowValue regs.sparseIndexValue).coefficientDivision.proved = false ∧ (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute p regs.rowValue regs.sparseIndexValue).realArccosSemantics.proved = false ∧ (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute p regs.rowValue regs.sparseIndexValue).halfAngleSemantics.proved = false ∧ (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute p regs.rowValue regs.sparseIndexValue).normalizerBound.proved = false ∧ (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute p regs.rowValue regs.sparseIndexValue).twoByTwoUnitary.proved = false ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_DT_S p).unitary.proved = false ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_Ry_boundary p).unitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource.closesFunctionOracleContract = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.functionOracle.amplitudeCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_boundaryKetZeroEntry (n : ℕ) (i j : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))) (hIndicator : (QuantumBlockEncoding.GHL2025.boundaryRotationPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑j).indicatorBit = 0) (hAncilla : (QuantumBlockEncoding.GHL2025.boundaryRotationPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑j).ancillaBit = 0) (hRow : ↑i >>> 1 = (QuantumBlockEncoding.GHL2025.boundaryRotationPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑j).nonAncillaValue) (hAncillaRow : ↑i &&& 1 = 0) : have p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n; have regs := QuantumBlockEncoding.GHL2025.boundaryRotationPaperRegisters p ↑j; ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨2, ⋯⟩).gate = QuantumBlockEncoding.Gate.oracleCall "Ry_boundary" ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨2, ⋯⟩).matrix i j = (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute p regs.rowValue regs.sparseIndexValue).cosHalfEntry ∧ (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute p regs.rowValue regs.sparseIndexValue).cosHalfEntry = (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerContract p regs.rowValue regs.sparseIndexValue).cosHalfEntry ∧ (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute p regs.rowValue regs.sparseIndexValue).arccosArgument = QuantumBlockEncoding.GHL2025.boundaryRotationNormalizedCoefficient p regs.rowValue regs.sparseIndexValue ∧ ((QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute p regs.rowValue regs.sparseIndexValue).coefficient = (QuantumBlockEncoding.GHL2025.derivativeNormalizerNDSourceBound p regs.rowValue regs.sparseIndexValue).sourceCoefficient ∧ (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute p regs.rowValue regs.sparseIndexValue).normalizerND = (QuantumBlockEncoding.GHL2025.derivativeNormalizerNDSourceBound p regs.rowValue regs.sparseIndexValue).normalizerND ∧ (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute p regs.rowValue regs.sparseIndexValue).normalizerBound = (QuantumBlockEncoding.GHL2025.derivativeNormalizerNDSourceBound p regs.rowValue regs.sparseIndexValue).coefficientBound) ∧ (QuantumBlockEncoding.GHL2025.derivativeNormalizerNDContract p regs.rowValue regs.sparseIndexValue).nonzeroNormalizer.proved = false ∧ (QuantumBlockEncoding.GHL2025.derivativeNormalizerNDContract p regs.rowValue regs.sparseIndexValue).divisionSemantics.proved = false ∧ (QuantumBlockEncoding.GHL2025.derivativeNormalizerNDContract p regs.rowValue regs.sparseIndexValue).coefficientBound.proved = false ∧ (QuantumBlockEncoding.GHL2025.derivativeNormalizerNDContract p regs.rowValue regs.sparseIndexValue).absSquareSemantics.proved = false ∧ (QuantumBlockEncoding.GHL2025.derivativeNormalizerNDContract p regs.rowValue regs.sparseIndexValue).sqrtComplementSemantics.proved = false ∧ (QuantumBlockEncoding.GHL2025.derivativeNormalizerNDContract p regs.rowValue regs.sparseIndexValue).arccosSemantics.proved = false ∧ (QuantumBlockEncoding.GHL2025.derivativeNormalizerNDContract p regs.rowValue regs.sparseIndexValue).twoByTwoUnitary.proved = false ∧ (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute p regs.rowValue regs.sparseIndexValue).coefficientDivision.proved = false ∧ (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute p regs.rowValue regs.sparseIndexValue).realArccosSemantics.proved = false ∧ (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute p regs.rowValue regs.sparseIndexValue).halfAngleSemantics.proved = false ∧ (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute p regs.rowValue regs.sparseIndexValue).normalizerBound.proved = false ∧ (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute p regs.rowValue regs.sparseIndexValue).twoByTwoUnitary.proved = false ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_DT_S p).unitary.proved = false ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_Ry_boundary p).unitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource.closesFunctionOracleContract = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.functionOracle.amplitudeCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false
The route-level `Ry_boundary` gate exposes the boundary ket-zero entry. This is the local matrix-entry bridge for the boundary rotation factor in Eq. `angles for Ry` and Eq. `ROBIN clarified`. Under the paper-register hypotheses selecting an indicator-0, ancilla-0 column and the ancilla-0 row with matching non-ancilla bits, gate slot 2 of the Fig. 1-term Robin route has the symbolic cosine half-angle entry recorded by `boundaryRotationAngleNormalizerProofRoute`. It does not prove the arccos semantics, half-angle identities, two-by-two unitarity, LCU composition, projection, or final block extraction.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route odbs active global slot blockers”; its local proof does not by itself complete the broader paper route. The theorem-level route exposes the active global-slot 'O_D^BS' blockers.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The theorem-level route exposes the active global-slot 'O_D^BS' blockers. This is the replacement for the retired row-dependent unused-branch route. The active route is the global sparse-slot source together with the restricted dagger-column cleanup interface. Full clean-domain cleanup and full-space unitarity remain obligations.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:1612. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.55●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_odbsActiveGlobalSlotBlockers (n j : ℕ) : (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.selectedScope = QuantumBlockEncoding.GHL2025.BandedSparseAccessCleanupScope.activeGlobalSource ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.selectedPredicate = "bandedSparseAccessPaperGlobalSlotSource" ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.selectedEvidence = "bandedSparseAccessGlobalSlotInverseOnRangeContract_restrictedDaggerColumnIndicator" ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.fullCleanDomainSelected = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.fullSpaceSelected = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.semanticCleanupPromotionAllowed = false ∧ ((QuantumBlockEncoding.GHL2025.bandedSparseAccessFullCleanDomainExtensionContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unusedBranchImageRuleContract j).proposedImageIndex = none ∧ ((QuantumBlockEncoding.GHL2025.bandedSparseAccessFullCleanDomainExtensionContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unusedBranchImageRuleContract j).imageSpecified.proved = false ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessFullCleanDomainExtensionContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).daggerCleanup.proved = false ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessFullCleanDomainExtensionContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_odbsActiveGlobalSlotBlockers (n j : ℕ) : (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.selectedScope = QuantumBlockEncoding.GHL2025.BandedSparseAccessCleanupScope.activeGlobalSource ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.selectedPredicate = "bandedSparseAccessPaperGlobalSlotSource" ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.selectedEvidence = "bandedSparseAccessGlobalSlotInverseOnRangeContract_restrictedDaggerColumnIndicator" ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.fullCleanDomainSelected = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.fullSpaceSelected = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.semanticCleanupPromotionAllowed = false ∧ ((QuantumBlockEncoding.GHL2025.bandedSparseAccessFullCleanDomainExtensionContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unusedBranchImageRuleContract j).proposedImageIndex = none ∧ ((QuantumBlockEncoding.GHL2025.bandedSparseAccessFullCleanDomainExtensionContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unusedBranchImageRuleContract j).imageSpecified.proved = false ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessFullCleanDomainExtensionContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).daggerCleanup.proved = false ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessFullCleanDomainExtensionContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false
The theorem-level route exposes the active global-slot `O_D^BS` blockers. This is the replacement for the retired row-dependent unused-branch route. The active route is the global sparse-slot source together with the restricted dagger-column cleanup interface. Full clean-domain cleanup and full-space unitarity remain obligations.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route active odbs gate pair blocked”; its local proof does not by itself complete the broader paper route. The theorem-level route keeps the active 'O_D^BS' gate pair in obligation mode.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The theorem-level route keeps the active 'O_D^BS' gate pair in obligation mode. This guard is intentionally weaker than a semantic theorem. It records only that the active forward and dagger matrices remain unproved as unitaries while the paper cleanup and unitary-extension flags stay false.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:1672. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.56●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_activeOdbsGatePairBlocked (n : ℕ) : (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitary.proved = false ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS_dagger (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.semanticCleanupPromotionAllowed = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_activeOdbsGatePairBlocked (n : ℕ) : (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitary.proved = false ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS_dagger (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.semanticCleanupPromotionAllowed = false
The theorem-level route keeps the active `O_D^BS` gate pair in obligation mode. This guard is intentionally weaker than a semantic theorem. It records only that the active forward and dagger matrices remain unproved as unitaries while the paper cleanup and unitary-extension flags stay false.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route odbs active scope keeps final flags false”; its local proof does not by itself complete the broader paper route. The active-scope blocker propagates to the final theorem flags.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The active-scope blocker propagates to the final theorem flags. The global-slot cleanup interface is currently restricted to 'bandedSparseAccessPaperGlobalSlotSource'. This theorem keeps final composition and block-extraction flags false until a full clean-domain or full-space theorem is accepted.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:1697. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.57●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_odbsActiveScopeKeepsFinalFlagsFalse (n : ℕ) : (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.semanticCleanupPromotionAllowed = false ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitary.proved = false ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS_dagger (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_odbsActiveScopeKeepsFinalFlagsFalse (n : ℕ) : (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.semanticCleanupPromotionAllowed = false ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitary.proved = false ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS_dagger (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false
The active-scope blocker propagates to the final theorem flags. The global-slot cleanup interface is currently restricted to `bandedSparseAccessPaperGlobalSlotSource`. This theorem keeps final composition and block-extraction flags false until a full clean-domain or full-space theorem is accepted.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route active odbs gate pair wiring”; its local proof does not by itself complete the broader paper route. The theorem-level route wires the active 'O_D^BS' gate pair at the Fig.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The theorem-level route wires the active 'O_D^BS' gate pair at the Fig. 1-term Robin positions. This is only a circuit-product guard. It records the gate labels and matrices used by the route while preserving the false unitarity flags.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:1732. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.58●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_activeOdbsGatePairWiring (n : ℕ) : ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨3, ⋯⟩).gate = QuantumBlockEncoding.Gate.oracleCall "O_D^BS" ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨3, ⋯⟩).matrix = QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperMatrix (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨3, ⋯⟩).unitary.proved = false ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨6, ⋯⟩).gate = QuantumBlockEncoding.Gate.oracleCall "(O_D^BS)^†" ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨6, ⋯⟩).matrix = QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperDaggerMatrix (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨6, ⋯⟩).unitary.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_activeOdbsGatePairWiring (n : ℕ) : ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨3, ⋯⟩).gate = QuantumBlockEncoding.Gate.oracleCall "O_D^BS" ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨3, ⋯⟩).matrix = QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperMatrix (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨3, ⋯⟩).unitary.proved = false ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨6, ⋯⟩).gate = QuantumBlockEncoding.Gate.oracleCall "(O_D^BS)^†" ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨6, ⋯⟩).matrix = QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperDaggerMatrix (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨6, ⋯⟩).unitary.proved = false
The theorem-level route wires the active `O_D^BS` gate pair at the Fig. 1-term Robin positions. This is only a circuit-product guard. It records the gate labels and matrices used by the route while preserving the false unitarity flags.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route active odbs gate pair public sources”; its local proof does not by itself complete the broader paper route. The active 'O_D^BS' gate pair keeps public source anchors on its obligation records.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The active 'O_D^BS' gate pair keeps public source anchors on its obligation records.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:1770. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.59●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_activeOdbsGatePairPublicSources (n : ℕ) : (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitary.source = "Guseynov-Huang-Liu 2025, Lemma 1, arXiv:2506.20478" ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS_dagger (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitary.source = "Guseynov-Huang-Liu 2025, Fig. 1-term Robin and Lemma 1, arXiv:2506.20478" ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitary.proved = false ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS_dagger (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitary.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_activeOdbsGatePairPublicSources (n : ℕ) : (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitary.source = "Guseynov-Huang-Liu 2025, Lemma 1, arXiv:2506.20478" ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS_dagger (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitary.source = "Guseynov-Huang-Liu 2025, Fig. 1-term Robin and Lemma 1, arXiv:2506.20478" ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitary.proved = false ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS_dagger (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitary.proved = false
The active `O_D^BS` gate pair keeps public source anchors on its obligation records.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route odbs active global slot gate freeze”; its local proof does not by itself complete the broader paper route. The active global-slot gate freeze combines the active matrices, cleanup-scope blocker, block target, and final false flags.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The active global-slot gate freeze combines the active matrices, cleanup-scope blocker, block target, and final false flags.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:1786. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.60●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_odbsActiveGlobalSlotGateFreeze (n j : ℕ) : (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.selectedScope = QuantumBlockEncoding.GHL2025.BandedSparseAccessCleanupScope.activeGlobalSource ∧ ((QuantumBlockEncoding.GHL2025.bandedSparseAccessFullCleanDomainExtensionContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unusedBranchImageRuleContract j).proposedImageIndex = none ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitary.source = "Guseynov-Huang-Liu 2025, Lemma 1, arXiv:2506.20478" ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS_dagger (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitary.source = "Guseynov-Huang-Liu 2025, Fig. 1-term Robin and Lemma 1, arXiv:2506.20478" ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨3, ⋯⟩).matrix = QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperMatrix (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨6, ⋯⟩).matrix = QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperDaggerMatrix (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.normalizer = QuantumBlockEncoding.GHL2025.oneTermRobinNormalizer ∧ ↑(QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.signalIndex = 0 ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_odbsActiveGlobalSlotGateFreeze (n j : ℕ) : (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.selectedScope = QuantumBlockEncoding.GHL2025.BandedSparseAccessCleanupScope.activeGlobalSource ∧ ((QuantumBlockEncoding.GHL2025.bandedSparseAccessFullCleanDomainExtensionContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unusedBranchImageRuleContract j).proposedImageIndex = none ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitary.source = "Guseynov-Huang-Liu 2025, Lemma 1, arXiv:2506.20478" ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS_dagger (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitary.source = "Guseynov-Huang-Liu 2025, Fig. 1-term Robin and Lemma 1, arXiv:2506.20478" ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨3, ⋯⟩).matrix = QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperMatrix (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨6, ⋯⟩).matrix = QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperDaggerMatrix (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.normalizer = QuantumBlockEncoding.GHL2025.oneTermRobinNormalizer ∧ ↑(QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.signalIndex = 0 ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false
The active global-slot gate freeze combines the active matrices, cleanup-scope blocker, block target, and final false flags.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route projection source freeze”; its local proof does not by itself complete the broader paper route. The source-gate freeze keeps the projection target and final theorem flags open under the active global-slot cleanup scope.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The source-gate freeze keeps the projection target and final theorem flags open under the active global-slot cleanup scope.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:1838. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.61●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_projectionSourceFreeze (n : ℕ) : (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.normalizer = QuantumBlockEncoding.GHL2025.oneTermRobinNormalizer ∧ ↑(QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.signalIndex = 0 ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.semanticCleanupPromotionAllowed = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_projectionSourceFreeze (n : ℕ) : (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.normalizer = QuantumBlockEncoding.GHL2025.oneTermRobinNormalizer ∧ ↑(QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.signalIndex = 0 ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.semanticCleanupPromotionAllowed = false
The source-gate freeze keeps the projection target and final theorem flags open under the active global-slot cleanup scope.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route rejected row dependent collision regression n 3”; its local proof does not by itself complete the broader paper route. The old row-dependent collision remains rejected-model regression memory.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The old row-dependent collision remains rejected-model regression memory. The active global-slot image separates the same two boundary columns, so this theorem must not be used as an active paper-level blocker.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:1870. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.62●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_rejectedRowDependentCollisionRegression_n3 : let p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3; QuantumBlockEncoding.GHL2025.bandedSparseAccessRowDependentPaperImage p 0 = QuantumBlockEncoding.GHL2025.bandedSparseAccessRowDependentPaperImage p 48 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperImage p 0 ≠ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperImage p 48 ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS p).matrix ⟨96, ⋯⟩ ⟨0, ⋯⟩ = QuantumBlockEncoding.Coeff.rat 1 ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS p).matrix ⟨16, ⋯⟩ ⟨48, ⋯⟩ = QuantumBlockEncoding.Coeff.rat 1 ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).cleanupScopeDecision.selectedScope = QuantumBlockEncoding.GHL2025.BandedSparseAccessCleanupScope.activeGlobalSource ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).cleanupScopeDecision.semanticCleanupPromotionAllowed = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).sparseAccessContract.unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).oracleComposition.lcuCorrect.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_rejectedRowDependentCollisionRegression_n3 : let p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3; QuantumBlockEncoding.GHL2025.bandedSparseAccessRowDependentPaperImage p 0 = QuantumBlockEncoding.GHL2025.bandedSparseAccessRowDependentPaperImage p 48 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperImage p 0 ≠ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperImage p 48 ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS p).matrix ⟨96, ⋯⟩ ⟨0, ⋯⟩ = QuantumBlockEncoding.Coeff.rat 1 ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS p).matrix ⟨16, ⋯⟩ ⟨48, ⋯⟩ = QuantumBlockEncoding.Coeff.rat 1 ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).cleanupScopeDecision.selectedScope = QuantumBlockEncoding.GHL2025.BandedSparseAccessCleanupScope.activeGlobalSource ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).cleanupScopeDecision.semanticCleanupPromotionAllowed = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).sparseAccessContract.unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).oracleComposition.lcuCorrect.proved = false
The old row-dependent collision remains rejected-model regression memory. The active global-slot image separates the same two boundary columns, so this theorem must not be used as an active paper-level blocker.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route encoded out of range sparse slot n 3”; its local proof does not by itself complete the broader paper route. The theorem route records encoded sparse value '7' as the first out-of-range clean slot for the one-term 'kappa = 7' source domain.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The theorem route records encoded sparse value '7' as the first out-of-range clean slot for the one-term 'kappa = 7' source domain. This guard replaces the retired row-dependent unused-branch blocker in the active route. The source column is clean, but it is not in 'bandedSparseAccessPaperGlobalSlotSource', so any broader cleanup theorem must use a precise full-clean-domain or full-space extension interface.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:1901. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.63●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_encodedOutOfRangeSparseSlot_n3 : have p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3; QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperCleanInput p 112 = true ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p 112).sparseIndexValue = 7 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperSparseIndexInKappa p 112 = false ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource p 112 = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).cleanupScopeDecision.selectedScope = QuantumBlockEncoding.GHL2025.BandedSparseAccessCleanupScope.activeGlobalSource ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).cleanupScopeDecision.semanticCleanupPromotionAllowed = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).sparseAccessContract.unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).oracleComposition.lcuCorrect.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_encodedOutOfRangeSparseSlot_n3 : have p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3; QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperCleanInput p 112 = true ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p 112).sparseIndexValue = 7 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperSparseIndexInKappa p 112 = false ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource p 112 = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).cleanupScopeDecision.selectedScope = QuantumBlockEncoding.GHL2025.BandedSparseAccessCleanupScope.activeGlobalSource ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).cleanupScopeDecision.semanticCleanupPromotionAllowed = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).sparseAccessContract.unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).oracleComposition.lcuCorrect.proved = false
The theorem route records encoded sparse value `7` as the first out-of-range clean slot for the one-term `kappa = 7` source domain. This guard replaces the retired row-dependent unused-branch blocker in the active route. The source column is clean, but it is not in `bandedSparseAccessPaperGlobalSlotSource`, so any broader cleanup theorem must use a precise full-clean-domain or full-space extension interface.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route contract drift column 8 blocked n 3”; its local proof does not by itself complete the broader paper route. The theorem route carries the active column-8 'O_D^BS' contract-drift guard.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The theorem route carries the active column-8 'O_D^BS' contract-drift guard. For 'n = 3', source column '8' maps to the Lemma 1 paper-image row '40' in the route's active 'O_D^BS' gate. The legacy helper still has a row-'4' entry, so this guard keeps the active/legacy separation visible at the theorem route without proving injectivity, dagger cleanup, or block correctness.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:1929. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.64●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_contractDriftColumn8Blocked_n3 : let p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3; QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperImage p 8 = 40 ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).circuitSemantics.gateMatrices.get ⟨3, ⋯⟩).matrix ⟨40, ⋯⟩ ⟨8, ⋯⟩ = QuantumBlockEncoding.Coeff.rat 1 ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).circuitSemantics.gateMatrices.get ⟨3, ⋯⟩).matrix ⟨4, ⋯⟩ ⟨8, ⋯⟩ = QuantumBlockEncoding.Coeff.rat 0 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessMatrix p ⟨4, ⋯⟩ ⟨8, ⋯⟩ = QuantumBlockEncoding.Coeff.rat 1 ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).cleanupScopeDecision.semanticCleanupPromotionAllowed = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockCorrect.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_contractDriftColumn8Blocked_n3 : let p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3; QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperImage p 8 = 40 ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).circuitSemantics.gateMatrices.get ⟨3, ⋯⟩).matrix ⟨40, ⋯⟩ ⟨8, ⋯⟩ = QuantumBlockEncoding.Coeff.rat 1 ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).circuitSemantics.gateMatrices.get ⟨3, ⋯⟩).matrix ⟨4, ⋯⟩ ⟨8, ⋯⟩ = QuantumBlockEncoding.Coeff.rat 0 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessMatrix p ⟨4, ⋯⟩ ⟨8, ⋯⟩ = QuantumBlockEncoding.Coeff.rat 1 ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).cleanupScopeDecision.semanticCleanupPromotionAllowed = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockCorrect.proved = false
The theorem route carries the active column-8 `O_D^BS` contract-drift guard. For `n = 3`, source column `8` maps to the Lemma 1 paper-image row `40` in the route's active `O_D^BS` gate. The legacy helper still has a row-`4` entry, so this guard keeps the active/legacy separation visible at the theorem route without proving injectivity, dagger cleanup, or block correctness.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route sparse access contract identity”; its local proof does not by itself complete the broader paper route. The theorem-level route uses the default Lemma 1 'O_D^BS' contract object.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The theorem-level route uses the default Lemma 1 'O_D^BS' contract object. This guard prevents a later lower packet from swapping in a different sparse-access contract while preserving similar-looking field values. It does not prove the oracle image, dagger cleanup, or unitary extension.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:1959. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.65●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_sparseAccessContractIdentity (n : ℕ) : (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract = QuantumBlockEncoding.GHL2025.defaultBandedSparseAccessPaperContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.forwardCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.semanticCleanupPromotionAllowed = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_sparseAccessContractIdentity (n : ℕ) : (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract = QuantumBlockEncoding.GHL2025.defaultBandedSparseAccessPaperContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.forwardCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.semanticCleanupPromotionAllowed = false
The theorem-level route uses the default Lemma 1 `O_D^BS` contract object. This guard prevents a later lower packet from swapping in a different sparse-access contract while preserving similar-looking field values. It does not prove the oracle image, dagger cleanup, or unitary extension.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route odbs paper contract transcript”; its local proof does not by itself complete the broader paper route. The theorem-level route carries the Lemma 1 'O_D^BS' paper contract verbatim.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The theorem-level route carries the Lemma 1 'O_D^BS' paper contract verbatim. This is a source-transcript guard. It pins the padded input/output ket formula and the register widths while keeping all paper-contract semantic flags false.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:1983. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.66●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_odbsPaperContractTranscript (n : ℕ) : (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.sourceAnchor = "Guseynov-Huang-Liu 2025, Lemma 1, arXiv:2506.20478" ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.rowRegisterQubits = (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n).n ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.paddedZeroQubits = (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n).n - QuantumBlockEncoding.clog2 (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n).kappa ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.sparseIndexQubits = QuantumBlockEncoding.clog2 (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n).kappa ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.outputAddressQubits = (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n).n ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.inputKet = "|0>^(n-l)|s>^l|i>^n" ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.outputKet = "|r_si>^n|i>^n" ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.imageFormula = "r_si = r_s0 + i mod 2^n" ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.cleanInputDomain.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.widthCompatible.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.addressRange.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.noSpill.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.forwardCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.selectedPredicate = "bandedSparseAccessPaperGlobalSlotSource"
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_odbsPaperContractTranscript (n : ℕ) : (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.sourceAnchor = "Guseynov-Huang-Liu 2025, Lemma 1, arXiv:2506.20478" ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.rowRegisterQubits = (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n).n ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.paddedZeroQubits = (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n).n - QuantumBlockEncoding.clog2 (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n).kappa ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.sparseIndexQubits = QuantumBlockEncoding.clog2 (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n).kappa ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.outputAddressQubits = (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n).n ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.inputKet = "|0>^(n-l)|s>^l|i>^n" ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.outputKet = "|r_si>^n|i>^n" ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.imageFormula = "r_si = r_s0 + i mod 2^n" ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.cleanInputDomain.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.widthCompatible.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.addressRange.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.noSpill.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.forwardCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.selectedPredicate = "bandedSparseAccessPaperGlobalSlotSource"
The theorem-level route carries the Lemma 1 `O_D^BS` paper contract verbatim. This is a source-transcript guard. It pins the padded input/output ket formula and the register widths while keeping all paper-contract semantic flags false.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route odbs restricted dagger column indicator”; its local proof does not by itself complete the broader paper route. The theorem-level route exposes the active-domain 'O_D^BS' dagger-column indicator.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The theorem-level route exposes the active-domain 'O_D^BS' dagger-column indicator. For the fixed one-term Robin parameters, this guard routes the compiled global-slot cleanup evidence through 'oneTermRobinBlockEncodingProofRoute'. It is still restricted to rows satisfying 'bandedSparseAccessPaperGlobalSlotSource', and it keeps every theorem-level cleanup, unitarity, LCU, projection, and block-correctness flag false.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:2032. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.67●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_odbsRestrictedDaggerColumnIndicator (n : ℕ) (source : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))) (hn : 3 ≤ n) (hsource : QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source = true) : ∃ post pre, QuantumBlockEncoding.GHL2025.BandedSparseAccessPostSwapCleanup (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) source post pre ∧ ↑post = (QuantumBlockEncoding.GHL2025.bandedSparseAccessGlobalSlotInverseOnRangeContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source).postSwapImageIndex ∧ ↑pre = (QuantumBlockEncoding.GHL2025.bandedSparseAccessGlobalSlotInverseOnRangeContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source).candidatePreimageIndex ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑pre = true ∧ (∀ (other : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))), QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑other = true → (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS_dagger (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).matrix other post = if ↑other = ↑pre then QuantumBlockEncoding.Coeff.rat 1 else QuantumBlockEncoding.Coeff.rat 0) ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract = QuantumBlockEncoding.GHL2025.defaultBandedSparseAccessPaperContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.unitaryExtension.proved = false ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitary.proved = false ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS_dagger (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.semanticCleanupPromotionAllowed = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_odbsRestrictedDaggerColumnIndicator (n : ℕ) (source : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))) (hn : 3 ≤ n) (hsource : QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source = true) : ∃ post pre, QuantumBlockEncoding.GHL2025.BandedSparseAccessPostSwapCleanup (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) source post pre ∧ ↑post = (QuantumBlockEncoding.GHL2025.bandedSparseAccessGlobalSlotInverseOnRangeContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source).postSwapImageIndex ∧ ↑pre = (QuantumBlockEncoding.GHL2025.bandedSparseAccessGlobalSlotInverseOnRangeContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source).candidatePreimageIndex ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑pre = true ∧ (∀ (other : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))), QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑other = true → (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS_dagger (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).matrix other post = if ↑other = ↑pre then QuantumBlockEncoding.Coeff.rat 1 else QuantumBlockEncoding.Coeff.rat 0) ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract = QuantumBlockEncoding.GHL2025.defaultBandedSparseAccessPaperContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.unitaryExtension.proved = false ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitary.proved = false ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS_dagger (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.semanticCleanupPromotionAllowed = false
The theorem-level route exposes the active-domain `O_D^BS` dagger-column indicator. For the fixed one-term Robin parameters, this guard routes the compiled global-slot cleanup evidence through `oneTermRobinBlockEncodingProofRoute`. It is still restricted to rows satisfying `bandedSparseAccessPaperGlobalSlotSource`, and it keeps every theorem-level cleanup, unitarity, LCU, projection, and block-correctness flag false.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route odbs cleanup scope decision”; its local proof does not by itself complete the broader paper route. The theorem route selects the active global-source domain as the next 'O_D^BS' cleanup theorem scope.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The theorem route selects the active global-source domain as the next 'O_D^BS' cleanup theorem scope. This is a proof-search scope guard, not a cleanup proof. It connects the route to the compiled restricted dagger-column indicator and records that full clean-domain cleanup, full-space unitary extension, LCU correctness, and final block-correctness obligations remain false.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:2116. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.68●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_odbsCleanupScopeDecision (n : ℕ) : (QuantumBlockEncoding.GHL2025.bandedSparseAccessCleanupScopeDecision (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).selectedScope = QuantumBlockEncoding.GHL2025.BandedSparseAccessCleanupScope.activeGlobalSource ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessCleanupScopeDecision (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).selectedPredicate = "bandedSparseAccessPaperGlobalSlotSource" ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessCleanupScopeDecision (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).selectedEvidence = "bandedSparseAccessGlobalSlotInverseOnRangeContract_restrictedDaggerColumnIndicator" ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessCleanupScopeDecision (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).fullCleanDomainSelected = false ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessCleanupScopeDecision (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).fullSpaceSelected = false ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessCleanupScopeDecision (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).semanticCleanupPromotionAllowed = false ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessCleanupScopeDecision (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).paperContractCleanup.proved = false ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessCleanupScopeDecision (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).fullCleanDomainCleanup.proved = false ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessCleanupScopeDecision (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).fullSpaceUnitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract = QuantumBlockEncoding.GHL2025.defaultBandedSparseAccessPaperContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.semanticCleanupPromotionAllowed = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_odbsCleanupScopeDecision (n : ℕ) : (QuantumBlockEncoding.GHL2025.bandedSparseAccessCleanupScopeDecision (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).selectedScope = QuantumBlockEncoding.GHL2025.BandedSparseAccessCleanupScope.activeGlobalSource ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessCleanupScopeDecision (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).selectedPredicate = "bandedSparseAccessPaperGlobalSlotSource" ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessCleanupScopeDecision (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).selectedEvidence = "bandedSparseAccessGlobalSlotInverseOnRangeContract_restrictedDaggerColumnIndicator" ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessCleanupScopeDecision (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).fullCleanDomainSelected = false ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessCleanupScopeDecision (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).fullSpaceSelected = false ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessCleanupScopeDecision (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).semanticCleanupPromotionAllowed = false ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessCleanupScopeDecision (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).paperContractCleanup.proved = false ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessCleanupScopeDecision (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).fullCleanDomainCleanup.proved = false ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessCleanupScopeDecision (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).fullSpaceUnitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract = QuantumBlockEncoding.GHL2025.defaultBandedSparseAccessPaperContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.semanticCleanupPromotionAllowed = false
The theorem route selects the active global-source domain as the next `O_D^BS` cleanup theorem scope. This is a proof-search scope guard, not a cleanup proof. It connects the route to the compiled restricted dagger-column indicator and records that full clean-domain cleanup, full-space unitary extension, LCU correctness, and final block-correctness obligations remain false.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route odbs full clean domain image rule blocked”; its local proof does not by itself complete the broader paper route. The theorem route keeps the full clean-domain 'O_D^BS' image-rule slot blocked.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The theorem route keeps the full clean-domain 'O_D^BS' image-rule slot blocked. This is a source-contract guard for the scope decision. The route may use the active global-source cleanup interface, but the full clean-domain wrapper still has no unused-branch image rule and cannot promote cleanup, unitarity, LCU, or block correctness.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:2173. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.69●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_odbsFullCleanDomainImageRuleBlocked (n j : ℕ) : (QuantumBlockEncoding.GHL2025.bandedSparseAccessCleanupScopeDecision (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).selectedScope = QuantumBlockEncoding.GHL2025.BandedSparseAccessCleanupScope.activeGlobalSource ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessCleanupScopeDecision (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).fullCleanDomainSelected = false ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessCleanupScopeDecision (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).semanticCleanupPromotionAllowed = false ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessCleanupScopeDecision (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).fullCleanDomainCleanup.proved = false ∧ ((QuantumBlockEncoding.GHL2025.bandedSparseAccessFullCleanDomainExtensionContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unusedBranchImageRuleContract j).proposedImageIndex = none ∧ ((QuantumBlockEncoding.GHL2025.bandedSparseAccessFullCleanDomainExtensionContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unusedBranchImageRuleContract j).imageSpecified.proved = false ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessFullCleanDomainExtensionContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unusedBranchImageSpecified.proved = false ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessFullCleanDomainExtensionContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).fullCleanDomainInjective.proved = false ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessFullCleanDomainExtensionContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).daggerCleanup.proved = false ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessFullCleanDomainExtensionContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.semanticCleanupPromotionAllowed = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_odbsFullCleanDomainImageRuleBlocked (n j : ℕ) : (QuantumBlockEncoding.GHL2025.bandedSparseAccessCleanupScopeDecision (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).selectedScope = QuantumBlockEncoding.GHL2025.BandedSparseAccessCleanupScope.activeGlobalSource ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessCleanupScopeDecision (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).fullCleanDomainSelected = false ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessCleanupScopeDecision (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).semanticCleanupPromotionAllowed = false ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessCleanupScopeDecision (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).fullCleanDomainCleanup.proved = false ∧ ((QuantumBlockEncoding.GHL2025.bandedSparseAccessFullCleanDomainExtensionContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unusedBranchImageRuleContract j).proposedImageIndex = none ∧ ((QuantumBlockEncoding.GHL2025.bandedSparseAccessFullCleanDomainExtensionContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unusedBranchImageRuleContract j).imageSpecified.proved = false ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessFullCleanDomainExtensionContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unusedBranchImageSpecified.proved = false ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessFullCleanDomainExtensionContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).fullCleanDomainInjective.proved = false ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessFullCleanDomainExtensionContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).daggerCleanup.proved = false ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessFullCleanDomainExtensionContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.semanticCleanupPromotionAllowed = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false
The theorem route keeps the full clean-domain `O_D^BS` image-rule slot blocked. This is a source-contract guard for the scope decision. The route may use the active global-source cleanup interface, but the full clean-domain wrapper still has no unused-branch image rule and cannot promote cleanup, unitarity, LCU, or block correctness.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route odbs active global source cleanup interface”; its local proof does not by itself complete the broader paper route. The theorem-level route exposes the selected active global-source cleanup interface for 'O_D^BS'.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The theorem-level route exposes the selected active global-source cleanup interface for 'O_D^BS'. This is only an interface wrapper around the compiled active-domain dagger column and the cleanup-scope decision. It does not promote 'daggerCleanup', unitarity, LCU correctness, block projection, block correctness, or final block extraction.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:2233. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.70●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_odbsActiveGlobalSourceCleanupInterface (n : ℕ) (source : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))) (hn : 3 ≤ n) (hsource : QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source = true) : ∃ post pre, QuantumBlockEncoding.GHL2025.BandedSparseAccessPostSwapCleanup (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) source post pre ∧ ↑post = (QuantumBlockEncoding.GHL2025.bandedSparseAccessGlobalSlotInverseOnRangeContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source).postSwapImageIndex ∧ ↑pre = (QuantumBlockEncoding.GHL2025.bandedSparseAccessGlobalSlotInverseOnRangeContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source).candidatePreimageIndex ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑pre = true ∧ (∀ (other : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))), QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑other = true → (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS_dagger (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).matrix other post = if ↑other = ↑pre then QuantumBlockEncoding.Coeff.rat 1 else QuantumBlockEncoding.Coeff.rat 0) ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessCleanupScopeDecision (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).selectedScope = QuantumBlockEncoding.GHL2025.BandedSparseAccessCleanupScope.activeGlobalSource ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessCleanupScopeDecision (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).selectedPredicate = "bandedSparseAccessPaperGlobalSlotSource" ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessCleanupScopeDecision (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).selectedEvidence = "bandedSparseAccessGlobalSlotInverseOnRangeContract_restrictedDaggerColumnIndicator" ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessCleanupScopeDecision (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).semanticCleanupPromotionAllowed = false ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessCleanupScopeDecision (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).fullCleanDomainSelected = false ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessCleanupScopeDecision (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).fullSpaceSelected = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.unitaryExtension.proved = false ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitary.proved = false ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS_dagger (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.semanticCleanupPromotionAllowed = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_odbsActiveGlobalSourceCleanupInterface (n : ℕ) (source : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))) (hn : 3 ≤ n) (hsource : QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source = true) : ∃ post pre, QuantumBlockEncoding.GHL2025.BandedSparseAccessPostSwapCleanup (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) source post pre ∧ ↑post = (QuantumBlockEncoding.GHL2025.bandedSparseAccessGlobalSlotInverseOnRangeContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source).postSwapImageIndex ∧ ↑pre = (QuantumBlockEncoding.GHL2025.bandedSparseAccessGlobalSlotInverseOnRangeContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source).candidatePreimageIndex ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑pre = true ∧ (∀ (other : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))), QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑other = true → (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS_dagger (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).matrix other post = if ↑other = ↑pre then QuantumBlockEncoding.Coeff.rat 1 else QuantumBlockEncoding.Coeff.rat 0) ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessCleanupScopeDecision (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).selectedScope = QuantumBlockEncoding.GHL2025.BandedSparseAccessCleanupScope.activeGlobalSource ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessCleanupScopeDecision (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).selectedPredicate = "bandedSparseAccessPaperGlobalSlotSource" ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessCleanupScopeDecision (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).selectedEvidence = "bandedSparseAccessGlobalSlotInverseOnRangeContract_restrictedDaggerColumnIndicator" ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessCleanupScopeDecision (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).semanticCleanupPromotionAllowed = false ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessCleanupScopeDecision (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).fullCleanDomainSelected = false ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessCleanupScopeDecision (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).fullSpaceSelected = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.unitaryExtension.proved = false ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitary.proved = false ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS_dagger (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.semanticCleanupPromotionAllowed = false
The theorem-level route exposes the selected active global-source cleanup interface for `O_D^BS`. This is only an interface wrapper around the compiled active-domain dagger column and the cleanup-scope decision. It does not promote `daggerCleanup`, unitarity, LCU correctness, block projection, block correctness, or final block extraction.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route odbs active global source cleanup contract map”; its local proof does not by itself complete the broader paper route. The theorem-level route exposes the active global-source cleanup contract map.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The theorem-level route exposes the active global-source cleanup contract map. This guard packages the current proof-DAG block for post-SWAP inverse evidence: the named candidate is an active global-source preimage of the post-SWAP target, it is unique among active global-source rows, and the transpose-style dagger entry is '1'. The statement is still restricted to 'bandedSparseAccessPaperGlobalSlotSource'; it does not promote paper-contract cleanup, full clean-domain cleanup, full-space unitarity, LCU correctness, or block extraction.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:2323. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.71●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_odbsActiveGlobalSourceCleanupContractMap (n : ℕ) (source : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))) (hn : 3 ≤ n) (hsource : QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source = true) : ∃ post pre, QuantumBlockEncoding.GHL2025.BandedSparseAccessPostSwapCleanup (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) source post pre ∧ ↑post = (QuantumBlockEncoding.GHL2025.bandedSparseAccessGlobalSlotInverseOnRangeContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source).postSwapImageIndex ∧ ↑pre = (QuantumBlockEncoding.GHL2025.bandedSparseAccessGlobalSlotInverseOnRangeContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source).candidatePreimageIndex ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑pre = true ∧ (∀ (pre' : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))), QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑pre' = true → QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperImage (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑pre' = ↑post → ↑pre' = ↑pre) ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS_dagger (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).matrix pre post = QuantumBlockEncoding.Coeff.rat 1 ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessGlobalSlotInverseOnRangeContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source).inverseOnRange.proved = false ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessGlobalSlotInverseOnRangeContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source).uniquePreimage.proved = false ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessGlobalSlotInverseOnRangeContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source).imageInjectiveOnGlobalSource.proved = false ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessGlobalSlotInverseOnRangeContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source).daggerCleanup.proved = false ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessGlobalSlotInverseOnRangeContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source).unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.selectedScope = QuantumBlockEncoding.GHL2025.BandedSparseAccessCleanupScope.activeGlobalSource ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.semanticCleanupPromotionAllowed = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_odbsActiveGlobalSourceCleanupContractMap (n : ℕ) (source : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))) (hn : 3 ≤ n) (hsource : QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source = true) : ∃ post pre, QuantumBlockEncoding.GHL2025.BandedSparseAccessPostSwapCleanup (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) source post pre ∧ ↑post = (QuantumBlockEncoding.GHL2025.bandedSparseAccessGlobalSlotInverseOnRangeContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source).postSwapImageIndex ∧ ↑pre = (QuantumBlockEncoding.GHL2025.bandedSparseAccessGlobalSlotInverseOnRangeContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source).candidatePreimageIndex ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑pre = true ∧ (∀ (pre' : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))), QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑pre' = true → QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperImage (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑pre' = ↑post → ↑pre' = ↑pre) ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS_dagger (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).matrix pre post = QuantumBlockEncoding.Coeff.rat 1 ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessGlobalSlotInverseOnRangeContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source).inverseOnRange.proved = false ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessGlobalSlotInverseOnRangeContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source).uniquePreimage.proved = false ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessGlobalSlotInverseOnRangeContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source).imageInjectiveOnGlobalSource.proved = false ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessGlobalSlotInverseOnRangeContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source).daggerCleanup.proved = false ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessGlobalSlotInverseOnRangeContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source).unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.selectedScope = QuantumBlockEncoding.GHL2025.BandedSparseAccessCleanupScope.activeGlobalSource ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.semanticCleanupPromotionAllowed = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false
The theorem-level route exposes the active global-source cleanup contract map. This guard packages the current proof-DAG block for post-SWAP inverse evidence: the named candidate is an active global-source preimage of the post-SWAP target, it is unique among active global-source rows, and the transpose-style dagger entry is `1`. The statement is still restricted to `bandedSparseAccessPaperGlobalSlotSource`; it does not promote paper-contract cleanup, full clean-domain cleanup, full-space unitarity, LCU correctness, or block extraction.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route theorem transcript dependencies”; its local proof does not by itself complete the broader paper route. The theorem route exposes the source transcript dependencies for Theorem '1 term robin'.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The theorem route exposes the source transcript dependencies for Theorem '1 term robin'. This is a guard-only Phase 1 declaration. It ties the theorem source anchor, normalizer, gate order, active 'O_D^BS' global-source scope, 'O_f' external source, signal-index-zero target, and current false proof flags into one reviewer-facing checkpoint. It does not prove cleanup, unitarity, LCU correctness, block projection, block correctness, or final block extraction.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:2420. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.72●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_theoremTranscriptDependencies (n : ℕ) : (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sourceAnchor = "Guseynov-Huang-Liu 2025, Theorem one-term block-encoding, Fig. 1-term Robin, arXiv:2506.20478" ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.alpha = (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.normalizer ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.alpha = QuantumBlockEncoding.GHL2025.oneTermRobinNormalizer ∧ List.map (fun gateMatrix => gateMatrix.gate) (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices = QuantumBlockEncoding.GHL2025.oneTermRobinCircuit ∧ List.map (fun gateMatrix => gateMatrix.unitary.proved) (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices = [true, false, false, false, false, true, false] ∧ ↑(QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.signalIndex = 0 ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.sourceAnchor = "Guseynov-Huang-Liu 2025, Lemma 1, arXiv:2506.20478" ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.imageFormula = "r_si = r_s0 + i mod 2^n" ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.selectedScope = QuantumBlockEncoding.GHL2025.BandedSparseAccessCleanupScope.activeGlobalSource ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.selectedPredicate = "bandedSparseAccessPaperGlobalSlotSource" ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.semanticCleanupPromotionAllowed = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.fullCleanDomainSelected = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.fullSpaceSelected = false ∧ ((QuantumBlockEncoding.GHL2025.bandedSparseAccessFullCleanDomainExtensionContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unusedBranchImageRuleContract 0).proposedImageIndex = none ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessFullCleanDomainExtensionContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).daggerCleanup.proved = false ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessFullCleanDomainExtensionContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource = QuantumBlockEncoding.GHL2025.functionOracleExternalAmplitudeSourceContract ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource.closesFunctionOracleContract = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.functionOracle.amplitudeCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_theoremTranscriptDependencies (n : ℕ) : (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sourceAnchor = "Guseynov-Huang-Liu 2025, Theorem one-term block-encoding, Fig. 1-term Robin, arXiv:2506.20478" ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.alpha = (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.normalizer ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.alpha = QuantumBlockEncoding.GHL2025.oneTermRobinNormalizer ∧ List.map (fun gateMatrix => gateMatrix.gate) (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices = QuantumBlockEncoding.GHL2025.oneTermRobinCircuit ∧ List.map (fun gateMatrix => gateMatrix.unitary.proved) (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices = [true, false, false, false, false, true, false] ∧ ↑(QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.signalIndex = 0 ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.sourceAnchor = "Guseynov-Huang-Liu 2025, Lemma 1, arXiv:2506.20478" ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.imageFormula = "r_si = r_s0 + i mod 2^n" ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.selectedScope = QuantumBlockEncoding.GHL2025.BandedSparseAccessCleanupScope.activeGlobalSource ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.selectedPredicate = "bandedSparseAccessPaperGlobalSlotSource" ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.semanticCleanupPromotionAllowed = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.fullCleanDomainSelected = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.fullSpaceSelected = false ∧ ((QuantumBlockEncoding.GHL2025.bandedSparseAccessFullCleanDomainExtensionContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unusedBranchImageRuleContract 0).proposedImageIndex = none ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessFullCleanDomainExtensionContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).daggerCleanup.proved = false ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessFullCleanDomainExtensionContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource = QuantumBlockEncoding.GHL2025.functionOracleExternalAmplitudeSourceContract ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource.closesFunctionOracleContract = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.functionOracle.amplitudeCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false
The theorem route exposes the source transcript dependencies for Theorem `1 term robin`. This is a guard-only Phase 1 declaration. It ties the theorem source anchor, normalizer, gate order, active `O_D^BS` global-source scope, `O_f` external source, signal-index-zero target, and current false proof flags into one reviewer-facing checkpoint. It does not prove cleanup, unitarity, LCU correctness, block projection, block correctness, or final block extraction.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route theorem transcript active cleanup map”; its local proof does not by itself complete the broader paper route. The theorem transcript consumes the active global-source cleanup map.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The theorem transcript consumes the active global-source cleanup map. This is the next guard-only proof-DAG bridge after the cleanup contract map: it exposes the active-source post-SWAP preimage data while also pinning the one-term theorem source, normalizer, circuit order, sparse-access formula, and 'O_f' source transcript. The bridge remains restricted to 'bandedSparseAccessPaperGlobalSlotSource' and does not promote semantic cleanup, unitarity, LCU correctness, block projection, block correctness, or final block extraction.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:2525. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.73●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_theoremTranscriptActiveCleanupMap (n : ℕ) (source : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))) (hn : 3 ≤ n) (hsource : QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source = true) : ∃ post pre, QuantumBlockEncoding.GHL2025.BandedSparseAccessPostSwapCleanup (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) source post pre ∧ ↑post = (QuantumBlockEncoding.GHL2025.bandedSparseAccessGlobalSlotInverseOnRangeContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source).postSwapImageIndex ∧ ↑pre = (QuantumBlockEncoding.GHL2025.bandedSparseAccessGlobalSlotInverseOnRangeContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source).candidatePreimageIndex ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑pre = true ∧ (∀ (pre' : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))), QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑pre' = true → QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperImage (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑pre' = ↑post → ↑pre' = ↑pre) ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS_dagger (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).matrix pre post = QuantumBlockEncoding.Coeff.rat 1 ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sourceAnchor = "Guseynov-Huang-Liu 2025, Theorem one-term block-encoding, Fig. 1-term Robin, arXiv:2506.20478" ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.alpha = QuantumBlockEncoding.GHL2025.oneTermRobinNormalizer ∧ List.map (fun gateMatrix => gateMatrix.gate) (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices = QuantumBlockEncoding.GHL2025.oneTermRobinCircuit ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.imageFormula = "r_si = r_s0 + i mod 2^n" ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.selectedScope = QuantumBlockEncoding.GHL2025.BandedSparseAccessCleanupScope.activeGlobalSource ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.selectedPredicate = "bandedSparseAccessPaperGlobalSlotSource" ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource = QuantumBlockEncoding.GHL2025.functionOracleExternalAmplitudeSourceContract ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.functionOracle.amplitudeCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_theoremTranscriptActiveCleanupMap (n : ℕ) (source : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))) (hn : 3 ≤ n) (hsource : QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source = true) : ∃ post pre, QuantumBlockEncoding.GHL2025.BandedSparseAccessPostSwapCleanup (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) source post pre ∧ ↑post = (QuantumBlockEncoding.GHL2025.bandedSparseAccessGlobalSlotInverseOnRangeContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source).postSwapImageIndex ∧ ↑pre = (QuantumBlockEncoding.GHL2025.bandedSparseAccessGlobalSlotInverseOnRangeContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source).candidatePreimageIndex ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑pre = true ∧ (∀ (pre' : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))), QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑pre' = true → QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperImage (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑pre' = ↑post → ↑pre' = ↑pre) ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS_dagger (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).matrix pre post = QuantumBlockEncoding.Coeff.rat 1 ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sourceAnchor = "Guseynov-Huang-Liu 2025, Theorem one-term block-encoding, Fig. 1-term Robin, arXiv:2506.20478" ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.alpha = QuantumBlockEncoding.GHL2025.oneTermRobinNormalizer ∧ List.map (fun gateMatrix => gateMatrix.gate) (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices = QuantumBlockEncoding.GHL2025.oneTermRobinCircuit ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.imageFormula = "r_si = r_s0 + i mod 2^n" ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.selectedScope = QuantumBlockEncoding.GHL2025.BandedSparseAccessCleanupScope.activeGlobalSource ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.selectedPredicate = "bandedSparseAccessPaperGlobalSlotSource" ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource = QuantumBlockEncoding.GHL2025.functionOracleExternalAmplitudeSourceContract ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.functionOracle.amplitudeCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false
The theorem transcript consumes the active global-source cleanup map. This is the next guard-only proof-DAG bridge after the cleanup contract map: it exposes the active-source post-SWAP preimage data while also pinning the one-term theorem source, normalizer, circuit order, sparse-access formula, and `O_f` source transcript. The bridge remains restricted to `bandedSparseAccessPaperGlobalSlotSource` and does not promote semantic cleanup, unitarity, LCU correctness, block projection, block correctness, or final block extraction.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route robin clarified gamma transcript”; its local proof does not by itself complete the broader paper route. The theorem transcript exposes the Eq.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The theorem transcript exposes the Eq. ROBIN clarified gamma decomposition. This guard ties 'defaultRobinWavefunctionDecomposition' to the one-term theorem route, the active global-source cleanup map, and the external 'O_f' source record. It records the three gamma normalizers and keeps the final semantic flags false; it is not a block-extraction proof.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:2615. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.74●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_robinClarifiedGammaTranscript (n : ℕ) (source : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))) (hn : 3 ≤ n) (hsource : QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source = true) : have gamma := QuantumBlockEncoding.GHL2025.defaultRobinWavefunctionDecomposition (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n); ∃ post pre, QuantumBlockEncoding.GHL2025.BandedSparseAccessPostSwapCleanup (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) source post pre ∧ gamma.kappa = (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n).kappa ∧ gamma.K1 = 2 ∧ gamma.K2 = QuantumBlockEncoding.gridSize n - 3 ∧ gamma.gridSize = QuantumBlockEncoding.gridSize n ∧ gamma.gamma1.kappa = gamma.kappa ∧ gamma.gamma1.K1 = gamma.K1 ∧ gamma.gamma1.K2 = gamma.K2 ∧ gamma.gamma1.gridSize = gamma.gridSize ∧ gamma.gamma1.boundaryNormalizer = (QuantumBlockEncoding.Coeff.symbol "N_D").mul (QuantumBlockEncoding.Coeff.symbol "sqrt(kappa)") ∧ gamma.gamma1.bulkNormalizer = QuantumBlockEncoding.Coeff.symbol "sqrt(kappa)" ∧ gamma.gamma2.kappa = gamma.kappa ∧ gamma.gamma2.normalizer = (QuantumBlockEncoding.Coeff.symbol "N_D").mul (QuantumBlockEncoding.Coeff.symbol "sqrt(kappa)") ∧ gamma.gamma2.hasOrthogonalRemainder = true ∧ gamma.gamma3.kappa = gamma.kappa ∧ gamma.gamma3.normalizer = QuantumBlockEncoding.GHL2025.oneTermRobinNormalizer ∧ gamma.gamma3.hasOrthogonalRemainder = true ∧ gamma.gamma3.pureAncillaQubits = n - QuantumBlockEncoding.clog2 (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n).kappa + 1 ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.alpha = gamma.gamma3.normalizer ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.normalizer = gamma.gamma3.normalizer ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource = QuantumBlockEncoding.GHL2025.functionOracleExternalAmplitudeSourceContract ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.selectedScope = QuantumBlockEncoding.GHL2025.BandedSparseAccessCleanupScope.activeGlobalSource ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.functionOracle.amplitudeCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_robinClarifiedGammaTranscript (n : ℕ) (source : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))) (hn : 3 ≤ n) (hsource : QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source = true) : have gamma := QuantumBlockEncoding.GHL2025.defaultRobinWavefunctionDecomposition (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n); ∃ post pre, QuantumBlockEncoding.GHL2025.BandedSparseAccessPostSwapCleanup (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) source post pre ∧ gamma.kappa = (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n).kappa ∧ gamma.K1 = 2 ∧ gamma.K2 = QuantumBlockEncoding.gridSize n - 3 ∧ gamma.gridSize = QuantumBlockEncoding.gridSize n ∧ gamma.gamma1.kappa = gamma.kappa ∧ gamma.gamma1.K1 = gamma.K1 ∧ gamma.gamma1.K2 = gamma.K2 ∧ gamma.gamma1.gridSize = gamma.gridSize ∧ gamma.gamma1.boundaryNormalizer = (QuantumBlockEncoding.Coeff.symbol "N_D").mul (QuantumBlockEncoding.Coeff.symbol "sqrt(kappa)") ∧ gamma.gamma1.bulkNormalizer = QuantumBlockEncoding.Coeff.symbol "sqrt(kappa)" ∧ gamma.gamma2.kappa = gamma.kappa ∧ gamma.gamma2.normalizer = (QuantumBlockEncoding.Coeff.symbol "N_D").mul (QuantumBlockEncoding.Coeff.symbol "sqrt(kappa)") ∧ gamma.gamma2.hasOrthogonalRemainder = true ∧ gamma.gamma3.kappa = gamma.kappa ∧ gamma.gamma3.normalizer = QuantumBlockEncoding.GHL2025.oneTermRobinNormalizer ∧ gamma.gamma3.hasOrthogonalRemainder = true ∧ gamma.gamma3.pureAncillaQubits = n - QuantumBlockEncoding.clog2 (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n).kappa + 1 ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.alpha = gamma.gamma3.normalizer ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.normalizer = gamma.gamma3.normalizer ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource = QuantumBlockEncoding.GHL2025.functionOracleExternalAmplitudeSourceContract ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.selectedScope = QuantumBlockEncoding.GHL2025.BandedSparseAccessCleanupScope.activeGlobalSource ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.functionOracle.amplitudeCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false
The theorem transcript exposes the Eq. ROBIN clarified gamma decomposition. This guard ties `defaultRobinWavefunctionDecomposition` to the one-term theorem route, the active global-source cleanup map, and the external `O_f` source record. It records the three gamma normalizers and keeps the final semantic flags false; it is not a block-extraction proof.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route block projection dependency map”; its local proof does not by itself complete the broader paper route. The theorem transcript exposes the dependency map for the final block projection.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The theorem transcript exposes the dependency map for the final block projection. This is a contract-only Phase 1 map. It packages the Eq. ROBIN gamma transcript, active-source 'O_D^BS' cleanup evidence, the 'CircuitBlockEncodingClaim' projection target, the full clean-domain blocker, and the external 'O_f' source contract. It does not prove the signal block equation or promote LCU, cleanup, unitarity, projection, block-correctness, or final extraction flags.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:2709. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.75●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_blockProjectionDependencyMap (n : ℕ) (source : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))) (hn : 3 ≤ n) (hsource : QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source = true) (i j : Fin (QuantumBlockEncoding.gridSize n)) : have gamma := QuantumBlockEncoding.GHL2025.defaultRobinWavefunctionDecomposition (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n); ∃ post pre, QuantumBlockEncoding.GHL2025.BandedSparseAccessPostSwapCleanup (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) source post pre ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim = QuantumBlockEncoding.Examples.RobinHeat.defaultOneTermRobinCircuitBlockClaim n ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.semantics = (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockExtractionTarget n ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockMatrix = QuantumBlockEncoding.signalSystemBlockProjection (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.effectiveRobinSignalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n))) (QuantumBlockEncoding.gridSize n) (QuantumBlockEncoding.gridSize n) (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.unitaryMatrix (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.signalIndex ∧ QuantumBlockEncoding.signalSystemBlockRowIndex (QuantumBlockEncoding.gridSize n) ↑(QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.signalIndex ↑i = ↑i ∧ QuantumBlockEncoding.signalSystemBlockColIndex (QuantumBlockEncoding.gridSize n) ↑(QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.signalIndex ↑j = ↑j ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.normalizer = gamma.gamma3.normalizer ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.targetMatrix = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinAkMatrix n ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource = QuantumBlockEncoding.GHL2025.functionOracleExternalAmplitudeSourceContract ∧ QuantumBlockEncoding.GHL2025.functionOracleExternalAmplitudeSourceContract.closesFunctionOracleContract = false ∧ ((QuantumBlockEncoding.GHL2025.bandedSparseAccessFullCleanDomainExtensionContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unusedBranchImageRuleContract ↑source).proposedImageIndex = none ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessFullCleanDomainExtensionContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).daggerCleanup.proved = false ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessFullCleanDomainExtensionContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.selectedScope = QuantumBlockEncoding.GHL2025.BandedSparseAccessCleanupScope.activeGlobalSource ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.functionOracle.amplitudeCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_blockProjectionDependencyMap (n : ℕ) (source : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))) (hn : 3 ≤ n) (hsource : QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source = true) (i j : Fin (QuantumBlockEncoding.gridSize n)) : have gamma := QuantumBlockEncoding.GHL2025.defaultRobinWavefunctionDecomposition (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n); ∃ post pre, QuantumBlockEncoding.GHL2025.BandedSparseAccessPostSwapCleanup (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) source post pre ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim = QuantumBlockEncoding.Examples.RobinHeat.defaultOneTermRobinCircuitBlockClaim n ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.semantics = (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockExtractionTarget n ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockMatrix = QuantumBlockEncoding.signalSystemBlockProjection (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.effectiveRobinSignalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n))) (QuantumBlockEncoding.gridSize n) (QuantumBlockEncoding.gridSize n) (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.unitaryMatrix (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.signalIndex ∧ QuantumBlockEncoding.signalSystemBlockRowIndex (QuantumBlockEncoding.gridSize n) ↑(QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.signalIndex ↑i = ↑i ∧ QuantumBlockEncoding.signalSystemBlockColIndex (QuantumBlockEncoding.gridSize n) ↑(QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.signalIndex ↑j = ↑j ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.normalizer = gamma.gamma3.normalizer ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.targetMatrix = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinAkMatrix n ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource = QuantumBlockEncoding.GHL2025.functionOracleExternalAmplitudeSourceContract ∧ QuantumBlockEncoding.GHL2025.functionOracleExternalAmplitudeSourceContract.closesFunctionOracleContract = false ∧ ((QuantumBlockEncoding.GHL2025.bandedSparseAccessFullCleanDomainExtensionContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unusedBranchImageRuleContract ↑source).proposedImageIndex = none ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessFullCleanDomainExtensionContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).daggerCleanup.proved = false ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessFullCleanDomainExtensionContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.selectedScope = QuantumBlockEncoding.GHL2025.BandedSparseAccessCleanupScope.activeGlobalSource ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.functionOracle.amplitudeCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false
The theorem transcript exposes the dependency map for the final block projection. This is a contract-only Phase 1 map. It packages the Eq. ROBIN gamma transcript, active-source `O_D^BS` cleanup evidence, the `CircuitBlockEncodingClaim` projection target, the full clean-domain blocker, and the external `O_f` source contract. It does not prove the signal block equation or promote LCU, cleanup, unitarity, projection, block-correctness, or final extraction flags.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route full gate contract ledger”; its local proof does not by itself complete the broader paper route. The theorem route exposes one ledger for all Fig.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The theorem route exposes one ledger for all Fig. 1-term Robin gate contracts. This is a guard-only aggregation step for Phase 1. It consumes the compiled 'O_DT^S'/'Ry_boundary' bridge, the active-source 'O_D^BS' cleanup map, and the external 'O_f' source transcript. It freezes the seven gate slots and keeps all paper-oracle, LCU, projection, and final block-extraction flags false.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:2827. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.76●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_fullGateContractLedger (n row sparse ofColumn : ℕ) (source : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))) (hn : 3 ≤ n) (hsource : QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source = true) : ∃ post pre, QuantumBlockEncoding.GHL2025.BandedSparseAccessPostSwapCleanup (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) source post pre ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sourceAnchor = "Guseynov-Huang-Liu 2025, Theorem one-term block-encoding, Fig. 1-term Robin, arXiv:2506.20478" ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.alpha = QuantumBlockEncoding.GHL2025.oneTermRobinNormalizer ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.normalizer = QuantumBlockEncoding.GHL2025.oneTermRobinNormalizer ∧ List.map (fun gateMatrix => gateMatrix.gate) (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices = QuantumBlockEncoding.GHL2025.oneTermRobinCircuit ∧ List.map (fun gateMatrix => gateMatrix.unitary.proved) (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices = [true, false, false, false, false, true, false] ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨0, ⋯⟩).gate = QuantumBlockEncoding.Gate.oracleCall "U_indic" ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨0, ⋯⟩).matrix = QuantumBlockEncoding.GHL2025.indicatorOracleMatrix (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨0, ⋯⟩).unitary.proved = true ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).coefficient = (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).coefficient ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨1, ⋯⟩).gate = QuantumBlockEncoding.Gate.oracleCall "O_DT^S" ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨1, ⋯⟩).matrix = QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTRotationMatrix (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_DT_S (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitary.proved = false ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨2, ⋯⟩).gate = QuantumBlockEncoding.Gate.oracleCall "Ry_boundary" ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨2, ⋯⟩).matrix = QuantumBlockEncoding.GHL2025.boundaryRotationMatrix (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_Ry_boundary (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitary.proved = false ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨3, ⋯⟩).gate = QuantumBlockEncoding.Gate.oracleCall "O_D^BS" ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨3, ⋯⟩).matrix = QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperMatrix (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.imageFormula = "r_si = r_s0 + i mod 2^n" ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.selectedScope = QuantumBlockEncoding.GHL2025.BandedSparseAccessCleanupScope.activeGlobalSource ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessFullCleanDomainExtensionContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).daggerCleanup.proved = false ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessFullCleanDomainExtensionContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.unitaryExtension.proved = false ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨4, ⋯⟩).gate = QuantumBlockEncoding.Gate.oracleCall "O_f" ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨4, ⋯⟩).matrix = QuantumBlockEncoding.GHL2025.functionOraclePaperMatrix (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_f (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource = QuantumBlockEncoding.GHL2025.functionOracleExternalAmplitudeSourceContract ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource.closesFunctionOracleContract = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.functionOracle.amplitudeCorrect.proved = false ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨5, ⋯⟩).gate = QuantumBlockEncoding.Gate.swap 0 0 ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨5, ⋯⟩).matrix = QuantumBlockEncoding.GHL2025.swapOracleMatrix (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨5, ⋯⟩).unitary.proved = true ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨6, ⋯⟩).gate = QuantumBlockEncoding.Gate.oracleCall "(O_D^BS)^†" ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨6, ⋯⟩).matrix = QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperDaggerMatrix (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS_dagger (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_fullGateContractLedger (n row sparse ofColumn : ℕ) (source : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))) (hn : 3 ≤ n) (hsource : QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source = true) : ∃ post pre, QuantumBlockEncoding.GHL2025.BandedSparseAccessPostSwapCleanup (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) source post pre ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sourceAnchor = "Guseynov-Huang-Liu 2025, Theorem one-term block-encoding, Fig. 1-term Robin, arXiv:2506.20478" ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.alpha = QuantumBlockEncoding.GHL2025.oneTermRobinNormalizer ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.normalizer = QuantumBlockEncoding.GHL2025.oneTermRobinNormalizer ∧ List.map (fun gateMatrix => gateMatrix.gate) (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices = QuantumBlockEncoding.GHL2025.oneTermRobinCircuit ∧ List.map (fun gateMatrix => gateMatrix.unitary.proved) (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices = [true, false, false, false, false, true, false] ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨0, ⋯⟩).gate = QuantumBlockEncoding.Gate.oracleCall "U_indic" ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨0, ⋯⟩).matrix = QuantumBlockEncoding.GHL2025.indicatorOracleMatrix (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨0, ⋯⟩).unitary.proved = true ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).coefficient = (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).coefficient ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨1, ⋯⟩).gate = QuantumBlockEncoding.Gate.oracleCall "O_DT^S" ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨1, ⋯⟩).matrix = QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTRotationMatrix (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_DT_S (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitary.proved = false ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨2, ⋯⟩).gate = QuantumBlockEncoding.Gate.oracleCall "Ry_boundary" ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨2, ⋯⟩).matrix = QuantumBlockEncoding.GHL2025.boundaryRotationMatrix (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_Ry_boundary (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitary.proved = false ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨3, ⋯⟩).gate = QuantumBlockEncoding.Gate.oracleCall "O_D^BS" ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨3, ⋯⟩).matrix = QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperMatrix (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.imageFormula = "r_si = r_s0 + i mod 2^n" ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.selectedScope = QuantumBlockEncoding.GHL2025.BandedSparseAccessCleanupScope.activeGlobalSource ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessFullCleanDomainExtensionContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).daggerCleanup.proved = false ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessFullCleanDomainExtensionContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.unitaryExtension.proved = false ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨4, ⋯⟩).gate = QuantumBlockEncoding.Gate.oracleCall "O_f" ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨4, ⋯⟩).matrix = QuantumBlockEncoding.GHL2025.functionOraclePaperMatrix (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_f (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource = QuantumBlockEncoding.GHL2025.functionOracleExternalAmplitudeSourceContract ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource.closesFunctionOracleContract = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.functionOracle.amplitudeCorrect.proved = false ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨5, ⋯⟩).gate = QuantumBlockEncoding.Gate.swap 0 0 ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨5, ⋯⟩).matrix = QuantumBlockEncoding.GHL2025.swapOracleMatrix (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨5, ⋯⟩).unitary.proved = true ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨6, ⋯⟩).gate = QuantumBlockEncoding.Gate.oracleCall "(O_D^BS)^†" ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨6, ⋯⟩).matrix = QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperDaggerMatrix (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS_dagger (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false
The theorem route exposes one ledger for all Fig. 1-term Robin gate contracts. This is a guard-only aggregation step for Phase 1. It consumes the compiled `O_DT^S`/`Ry_boundary` bridge, the active-source `O_D^BS` cleanup map, and the external `O_f` source transcript. It freezes the seven gate slots and keeps all paper-oracle, LCU, projection, and final block-extraction flags false.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route theorem transcript closure packet”; its local proof does not by itself complete the broader paper route. The theorem-transcript closure packet consumes the current Phase 1 guards.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The theorem-transcript closure packet consumes the current Phase 1 guards. This is the middle-agent checkpoint for Theorem '1 term robin': it combines the source transcript dependencies, layout/projection audit, block-projection dependency map, and full Fig. 1-term Robin gate-contract ledger into one reviewer-facing statement. It records the exact false-obligation ledger and does not promote cleanup, unitarity, LCU correctness, projection, block-correctness, resource-bound, ancilla-cleanup, or final extraction flags.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:3041. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.77●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_theoremTranscriptClosurePacket (n row sparse ofColumn : ℕ) (source : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))) (hn : 3 ≤ n) (hsource : QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source = true) (i j : Fin (QuantumBlockEncoding.gridSize n)) : have gamma := QuantumBlockEncoding.GHL2025.defaultRobinWavefunctionDecomposition (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n); ∃ post pre, QuantumBlockEncoding.GHL2025.BandedSparseAccessPostSwapCleanup (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) source post pre ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sourceAnchor = "Guseynov-Huang-Liu 2025, Theorem one-term block-encoding, Fig. 1-term Robin, arXiv:2506.20478" ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.sourceAnchor = "Guseynov-Huang-Liu 2025, Lemma 1, arXiv:2506.20478" ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.imageFormula = "r_si = r_s0 + i mod 2^n" ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource = QuantumBlockEncoding.GHL2025.functionOracleExternalAmplitudeSourceContract ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource.citedSourceAnchor = "Guseynov-Liu 2024, arXiv:2411.01131, Theorem 5" ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource.closesFunctionOracleContract = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.alpha = QuantumBlockEncoding.GHL2025.oneTermRobinNormalizer ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.normalizer = gamma.gamma3.normalizer ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.signalQubits = (QuantumBlockEncoding.GHL2025.oneTermRobinLayout (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).signalQubits ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.pureAncillas = (QuantumBlockEncoding.GHL2025.oneTermRobinLayout (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).pureAncillas ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.pureAncillas = (QuantumBlockEncoding.GHL2025.oneTermRobinResource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).pureAncilla ∧ QuantumBlockEncoding.GHL2025.effectiveRobinSignalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) = (QuantumBlockEncoding.GHL2025.oneTermRobinLayout (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).signalQubits + (QuantumBlockEncoding.GHL2025.defaultRobinRegisterPartition (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).odPureAncillaQubits + 1 ∧ List.map (fun gateMatrix => gateMatrix.gate) (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices = QuantumBlockEncoding.GHL2025.oneTermRobinCircuit ∧ List.map (fun gateMatrix => gateMatrix.unitary.proved) (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices = [true, false, false, false, false, true, false] ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim = QuantumBlockEncoding.Examples.RobinHeat.defaultOneTermRobinCircuitBlockClaim n ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.targetMatrix = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinAkMatrix n ∧ QuantumBlockEncoding.signalSystemBlockRowIndex (QuantumBlockEncoding.gridSize n) ↑(QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.signalIndex ↑i = ↑i ∧ QuantumBlockEncoding.signalSystemBlockColIndex (QuantumBlockEncoding.gridSize n) ↑(QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.signalIndex ↑j = ↑j ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).coefficient = (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).coefficient ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.selectedScope = QuantumBlockEncoding.GHL2025.BandedSparseAccessCleanupScope.activeGlobalSource ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.selectedPredicate = "bandedSparseAccessPaperGlobalSlotSource" ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.semanticCleanupPromotionAllowed = false ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessFullCleanDomainExtensionContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).daggerCleanup.proved = false ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessFullCleanDomainExtensionContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.resourceBound.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.ancillaCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.functionOracle.amplitudeCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_theoremTranscriptClosurePacket (n row sparse ofColumn : ℕ) (source : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))) (hn : 3 ≤ n) (hsource : QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source = true) (i j : Fin (QuantumBlockEncoding.gridSize n)) : have gamma := QuantumBlockEncoding.GHL2025.defaultRobinWavefunctionDecomposition (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n); ∃ post pre, QuantumBlockEncoding.GHL2025.BandedSparseAccessPostSwapCleanup (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) source post pre ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sourceAnchor = "Guseynov-Huang-Liu 2025, Theorem one-term block-encoding, Fig. 1-term Robin, arXiv:2506.20478" ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.sourceAnchor = "Guseynov-Huang-Liu 2025, Lemma 1, arXiv:2506.20478" ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.imageFormula = "r_si = r_s0 + i mod 2^n" ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource = QuantumBlockEncoding.GHL2025.functionOracleExternalAmplitudeSourceContract ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource.citedSourceAnchor = "Guseynov-Liu 2024, arXiv:2411.01131, Theorem 5" ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource.closesFunctionOracleContract = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.alpha = QuantumBlockEncoding.GHL2025.oneTermRobinNormalizer ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.normalizer = gamma.gamma3.normalizer ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.signalQubits = (QuantumBlockEncoding.GHL2025.oneTermRobinLayout (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).signalQubits ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.pureAncillas = (QuantumBlockEncoding.GHL2025.oneTermRobinLayout (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).pureAncillas ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.pureAncillas = (QuantumBlockEncoding.GHL2025.oneTermRobinResource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).pureAncilla ∧ QuantumBlockEncoding.GHL2025.effectiveRobinSignalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) = (QuantumBlockEncoding.GHL2025.oneTermRobinLayout (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).signalQubits + (QuantumBlockEncoding.GHL2025.defaultRobinRegisterPartition (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).odPureAncillaQubits + 1 ∧ List.map (fun gateMatrix => gateMatrix.gate) (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices = QuantumBlockEncoding.GHL2025.oneTermRobinCircuit ∧ List.map (fun gateMatrix => gateMatrix.unitary.proved) (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices = [true, false, false, false, false, true, false] ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim = QuantumBlockEncoding.Examples.RobinHeat.defaultOneTermRobinCircuitBlockClaim n ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.targetMatrix = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinAkMatrix n ∧ QuantumBlockEncoding.signalSystemBlockRowIndex (QuantumBlockEncoding.gridSize n) ↑(QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.signalIndex ↑i = ↑i ∧ QuantumBlockEncoding.signalSystemBlockColIndex (QuantumBlockEncoding.gridSize n) ↑(QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.signalIndex ↑j = ↑j ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).coefficient = (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) row sparse).coefficient ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.selectedScope = QuantumBlockEncoding.GHL2025.BandedSparseAccessCleanupScope.activeGlobalSource ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.selectedPredicate = "bandedSparseAccessPaperGlobalSlotSource" ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.semanticCleanupPromotionAllowed = false ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessFullCleanDomainExtensionContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).daggerCleanup.proved = false ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessFullCleanDomainExtensionContract (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)).unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.resourceBound.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.ancillaCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.functionOracle.amplitudeCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false
The theorem-transcript closure packet consumes the current Phase 1 guards. This is the middle-agent checkpoint for Theorem `1 term robin`: it combines the source transcript dependencies, layout/projection audit, block-projection dependency map, and full Fig. 1-term Robin gate-contract ledger into one reviewer-facing statement. It records the exact false-obligation ledger and does not promote cleanup, unitarity, LCU correctness, projection, block-correctness, resource-bound, ancilla-cleanup, or final extraction flags.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route finite block composition contract map”; its local proof does not by itself complete the broader paper route. The theorem route now has a typed finite LCU/block-composition contract.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The theorem route now has a typed finite LCU/block-composition contract. This guard consumes the Phase 1 closure packet and exposes the exact remaining finite-dimensional composition obligations. It keeps the route-level LCU, circuit-unitary, block-projection, block-correctness, and final-extraction flags false.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:3195. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.78●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_finiteBlockCompositionContractMap (n row sparse ofColumn : ℕ) (source : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))) (hn : 3 ≤ n) (hsource : QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source = true) (i j : Fin (QuantumBlockEncoding.gridSize n)) : have contract := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteBlockCompositionContract n; ∃ post pre, QuantumBlockEncoding.GHL2025.BandedSparseAccessPostSwapCleanup (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) source post pre ∧ contract.sourceAnchor = "QBE finite-dimensional LCU/block-composition contract for GHL2025 Theorem one-term block-encoding" ∧ contract.lcuSourceAnchor = "LCU.StandardBlockEncoding; Childs-Wiebe 2012, arXiv:1202.5822; QBE cited-results row" ∧ contract.theoremAnchor = "Guseynov-Huang-Liu 2025, Theorem one-term block-encoding and Fig. 1-term Robin, arXiv:2506.20478" ∧ contract.claim = (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim ∧ contract.claim.target = contract.expectedTarget ∧ contract.expectedTarget = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockExtractionTarget n ∧ contract.targetMatrix = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinAkMatrix n ∧ contract.normalizer = QuantumBlockEncoding.GHL2025.oneTermRobinNormalizer ∧ contract.expectedTarget.targetMatrix = contract.targetMatrix ∧ contract.expectedTarget.normalizer = contract.normalizer ∧ contract.circuitUnitary.proved = false ∧ contract.lcuComposition.proved = false ∧ contract.blockProjection.proved = false ∧ contract.normalizedBlockEquality.proved = false ∧ contract.finalExtraction.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_finiteBlockCompositionContractMap (n row sparse ofColumn : ℕ) (source : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))) (hn : 3 ≤ n) (hsource : QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source = true) (i j : Fin (QuantumBlockEncoding.gridSize n)) : have contract := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteBlockCompositionContract n; ∃ post pre, QuantumBlockEncoding.GHL2025.BandedSparseAccessPostSwapCleanup (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) source post pre ∧ contract.sourceAnchor = "QBE finite-dimensional LCU/block-composition contract for GHL2025 Theorem one-term block-encoding" ∧ contract.lcuSourceAnchor = "LCU.StandardBlockEncoding; Childs-Wiebe 2012, arXiv:1202.5822; QBE cited-results row" ∧ contract.theoremAnchor = "Guseynov-Huang-Liu 2025, Theorem one-term block-encoding and Fig. 1-term Robin, arXiv:2506.20478" ∧ contract.claim = (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim ∧ contract.claim.target = contract.expectedTarget ∧ contract.expectedTarget = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockExtractionTarget n ∧ contract.targetMatrix = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinAkMatrix n ∧ contract.normalizer = QuantumBlockEncoding.GHL2025.oneTermRobinNormalizer ∧ contract.expectedTarget.targetMatrix = contract.targetMatrix ∧ contract.expectedTarget.normalizer = contract.normalizer ∧ contract.circuitUnitary.proved = false ∧ contract.lcuComposition.proved = false ∧ contract.blockProjection.proved = false ∧ contract.normalizedBlockEquality.proved = false ∧ contract.finalExtraction.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false
The theorem route now has a typed finite LCU/block-composition contract. This guard consumes the Phase 1 closure packet and exposes the exact remaining finite-dimensional composition obligations. It keeps the route-level LCU, circuit-unitary, block-projection, block-correctness, and final-extraction flags false.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route finite composition exact theorem interface”; its local proof does not by itself complete the broader paper route. The theorem route exposes the exact finite composition theorem interface.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The theorem route exposes the exact finite composition theorem interface. This consumes the finite block-composition contract map and names the precise matrix objects that a future theorem must relate: the route circuit semantics, the signal-zero block projection, the row-scaled Robin target matrix, and the normalizer 'N_D * N_f * kappa'. It is contract-only; all finite composition, route LCU, resource, cleanup, projection, block-correctness, and extraction flags remain false.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:3281. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.79●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_finiteCompositionExactTheoremInterface (n row sparse ofColumn : ℕ) (source : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))) (hn : 3 ≤ n) (hsource : QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source = true) (i j : Fin (QuantumBlockEncoding.gridSize n)) : have contract := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteBlockCompositionContract n; have exactTheorem := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteCompositionExactTheoremObligation n; ∃ post pre, QuantumBlockEncoding.GHL2025.BandedSparseAccessPostSwapCleanup (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) source post pre ∧ exactTheorem.source = "GHL2025 Theorem one-term block-encoding, Eq. ROBIN clarified, Fig. 1-term ROBIN, Definition def:block-encoding; cited-results row LCU.StandardBlockEncoding" ∧ exactTheorem.proved = false ∧ contract.claim = (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim ∧ contract.claim.semantics = (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics ∧ contract.claim.target = contract.expectedTarget ∧ contract.expectedTarget = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockExtractionTarget n ∧ contract.expectedTarget.blockMatrix = QuantumBlockEncoding.signalSystemBlockProjection (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.effectiveRobinSignalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n))) (QuantumBlockEncoding.gridSize n) (QuantumBlockEncoding.gridSize n) contract.expectedTarget.unitaryMatrix contract.expectedTarget.signalIndex ∧ contract.expectedTarget.blockMatrix i j = contract.expectedTarget.unitaryMatrix ⟨QuantumBlockEncoding.signalSystemBlockRowIndex (QuantumBlockEncoding.gridSize n) ↑contract.expectedTarget.signalIndex ↑i, ⋯⟩ ⟨QuantumBlockEncoding.signalSystemBlockColIndex (QuantumBlockEncoding.gridSize n) ↑contract.expectedTarget.signalIndex ↑j, ⋯⟩ ∧ ↑contract.expectedTarget.signalIndex = 0 ∧ contract.targetMatrix = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinAkMatrix n ∧ contract.normalizer = QuantumBlockEncoding.GHL2025.oneTermRobinNormalizer ∧ contract.blockProjection.source = "GHL2025 Eq. ROBIN clarified and Fig. 1-term Robin" ∧ contract.normalizedBlockEquality.description = "projected block equals oneTermRobinAkMatrix n divided by N_D*N_f*kappa" ∧ contract.finalExtraction.source = "GHL2025 Theorem one-term block-encoding" ∧ contract.circuitUnitary.proved = false ∧ contract.lcuComposition.proved = false ∧ contract.blockProjection.proved = false ∧ contract.normalizedBlockEquality.proved = false ∧ contract.finalExtraction.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.resourceBound.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.ancillaCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_finiteCompositionExactTheoremInterface (n row sparse ofColumn : ℕ) (source : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))) (hn : 3 ≤ n) (hsource : QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source = true) (i j : Fin (QuantumBlockEncoding.gridSize n)) : have contract := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteBlockCompositionContract n; have exactTheorem := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteCompositionExactTheoremObligation n; ∃ post pre, QuantumBlockEncoding.GHL2025.BandedSparseAccessPostSwapCleanup (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) source post pre ∧ exactTheorem.source = "GHL2025 Theorem one-term block-encoding, Eq. ROBIN clarified, Fig. 1-term ROBIN, Definition def:block-encoding; cited-results row LCU.StandardBlockEncoding" ∧ exactTheorem.proved = false ∧ contract.claim = (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim ∧ contract.claim.semantics = (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics ∧ contract.claim.target = contract.expectedTarget ∧ contract.expectedTarget = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockExtractionTarget n ∧ contract.expectedTarget.blockMatrix = QuantumBlockEncoding.signalSystemBlockProjection (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.effectiveRobinSignalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n))) (QuantumBlockEncoding.gridSize n) (QuantumBlockEncoding.gridSize n) contract.expectedTarget.unitaryMatrix contract.expectedTarget.signalIndex ∧ contract.expectedTarget.blockMatrix i j = contract.expectedTarget.unitaryMatrix ⟨QuantumBlockEncoding.signalSystemBlockRowIndex (QuantumBlockEncoding.gridSize n) ↑contract.expectedTarget.signalIndex ↑i, ⋯⟩ ⟨QuantumBlockEncoding.signalSystemBlockColIndex (QuantumBlockEncoding.gridSize n) ↑contract.expectedTarget.signalIndex ↑j, ⋯⟩ ∧ ↑contract.expectedTarget.signalIndex = 0 ∧ contract.targetMatrix = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinAkMatrix n ∧ contract.normalizer = QuantumBlockEncoding.GHL2025.oneTermRobinNormalizer ∧ contract.blockProjection.source = "GHL2025 Eq. ROBIN clarified and Fig. 1-term Robin" ∧ contract.normalizedBlockEquality.description = "projected block equals oneTermRobinAkMatrix n divided by N_D*N_f*kappa" ∧ contract.finalExtraction.source = "GHL2025 Theorem one-term block-encoding" ∧ contract.circuitUnitary.proved = false ∧ contract.lcuComposition.proved = false ∧ contract.blockProjection.proved = false ∧ contract.normalizedBlockEquality.proved = false ∧ contract.finalExtraction.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.resourceBound.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.ancillaCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false
The theorem route exposes the exact finite composition theorem interface. This consumes the finite block-composition contract map and names the precise matrix objects that a future theorem must relate: the route circuit semantics, the signal-zero block projection, the row-scaled Robin target matrix, and the normalizer `N_D * N_f * kappa`. It is contract-only; all finite composition, route LCU, resource, cleanup, projection, block-correctness, and extraction flags remain false.
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 signal block entry obligation”. Contract-only entry obligation connecting Eq.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Contract-only entry obligation connecting Eq. 'ROBIN clarified' to the signal-zero block matrix. The future theorem must show, entry by entry, that the signal-zero projection of the Fig. 1-term Robin gate product realizes the 'gamma3' clean branch and therefore the row-scaled Robin target normalized by 'N_D * N_f * kappa'. This declaration only names that missing theorem-facing step.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:3420. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.80●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3SignalBlockEntryObligation (_n : ℕ) : QuantumBlockEncoding.SemanticObligation
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3SignalBlockEntryObligation (_n : ℕ) : QuantumBlockEncoding.SemanticObligation
Contract-only entry obligation connecting Eq. `ROBIN clarified` to the signal-zero block matrix. The future theorem must show, entry by entry, that the signal-zero projection of the Fig. 1-term Robin gate product realizes the `gamma3` clean branch and therefore the row-scaled Robin target normalized by `N_D * N_f * kappa`. This declaration only names that missing theorem-facing step.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 signal block entry obligation transcript”; its local proof does not by itself complete the broader paper route.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The source declaration has no docstring. The reader cue above is generated from its kind and name and does not replace the Lean signature.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:3428. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.81●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3SignalBlockEntryObligation_transcript (n : ℕ) : (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3SignalBlockEntryObligation n).source = "GHL2025 Eq. ROBIN clarified gamma3 line, Theorem one-term block-encoding, Fig. 1-term ROBIN, Definition def:block-encoding" ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3SignalBlockEntryObligation n).proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3SignalBlockEntryObligation_transcript (n : ℕ) : (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3SignalBlockEntryObligation n).source = "GHL2025 Eq. ROBIN clarified gamma3 line, Theorem one-term block-encoding, Fig. 1-term ROBIN, Definition def:block-encoding" ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3SignalBlockEntryObligation n).proved = false
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route gamma 3 signal block entry obligation map”; its local proof does not by itself complete the broader paper route. The exact finite-composition interface is refined to the gamma3 entry target.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The exact finite-composition interface is refined to the gamma3 entry target. This is still a Phase 1 transcript guard. It consumes the exact finite theorem interface, exposes the 'gamma3' normalizer, the concrete signal-projection entry, the target matrix, and the false final flags. It does not prove that the entry equals the paper coefficient, nor does it promote LCU, projection, block-correctness, resource, cleanup, or extraction obligations.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:3445. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.82●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3SignalBlockEntryObligationMap (n row sparse ofColumn : ℕ) (source : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))) (hn : 3 ≤ n) (hsource : QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source = true) (i j : Fin (QuantumBlockEncoding.gridSize n)) : have gamma := QuantumBlockEncoding.GHL2025.defaultRobinWavefunctionDecomposition (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n); have contract := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteBlockCompositionContract n; have exactTheorem := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteCompositionExactTheoremObligation n; have entryObligation := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3SignalBlockEntryObligation n; ∃ post pre, QuantumBlockEncoding.GHL2025.BandedSparseAccessPostSwapCleanup (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) source post pre ∧ entryObligation.source = "GHL2025 Eq. ROBIN clarified gamma3 line, Theorem one-term block-encoding, Fig. 1-term ROBIN, Definition def:block-encoding" ∧ entryObligation.proved = false ∧ exactTheorem.source = "GHL2025 Theorem one-term block-encoding, Eq. ROBIN clarified, Fig. 1-term ROBIN, Definition def:block-encoding; cited-results row LCU.StandardBlockEncoding" ∧ exactTheorem.proved = false ∧ gamma.gamma3.normalizer = QuantumBlockEncoding.GHL2025.oneTermRobinNormalizer ∧ contract.normalizer = gamma.gamma3.normalizer ∧ contract.expectedTarget.blockMatrix i j = contract.expectedTarget.unitaryMatrix ⟨QuantumBlockEncoding.signalSystemBlockRowIndex (QuantumBlockEncoding.gridSize n) ↑contract.expectedTarget.signalIndex ↑i, ⋯⟩ ⟨QuantumBlockEncoding.signalSystemBlockColIndex (QuantumBlockEncoding.gridSize n) ↑contract.expectedTarget.signalIndex ↑j, ⋯⟩ ∧ contract.targetMatrix = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinAkMatrix n ∧ contract.normalizedBlockEquality.proved = false ∧ contract.finalExtraction.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.resourceBound.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.ancillaCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3SignalBlockEntryObligationMap (n row sparse ofColumn : ℕ) (source : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))) (hn : 3 ≤ n) (hsource : QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source = true) (i j : Fin (QuantumBlockEncoding.gridSize n)) : have gamma := QuantumBlockEncoding.GHL2025.defaultRobinWavefunctionDecomposition (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n); have contract := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteBlockCompositionContract n; have exactTheorem := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteCompositionExactTheoremObligation n; have entryObligation := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3SignalBlockEntryObligation n; ∃ post pre, QuantumBlockEncoding.GHL2025.BandedSparseAccessPostSwapCleanup (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) source post pre ∧ entryObligation.source = "GHL2025 Eq. ROBIN clarified gamma3 line, Theorem one-term block-encoding, Fig. 1-term ROBIN, Definition def:block-encoding" ∧ entryObligation.proved = false ∧ exactTheorem.source = "GHL2025 Theorem one-term block-encoding, Eq. ROBIN clarified, Fig. 1-term ROBIN, Definition def:block-encoding; cited-results row LCU.StandardBlockEncoding" ∧ exactTheorem.proved = false ∧ gamma.gamma3.normalizer = QuantumBlockEncoding.GHL2025.oneTermRobinNormalizer ∧ contract.normalizer = gamma.gamma3.normalizer ∧ contract.expectedTarget.blockMatrix i j = contract.expectedTarget.unitaryMatrix ⟨QuantumBlockEncoding.signalSystemBlockRowIndex (QuantumBlockEncoding.gridSize n) ↑contract.expectedTarget.signalIndex ↑i, ⋯⟩ ⟨QuantumBlockEncoding.signalSystemBlockColIndex (QuantumBlockEncoding.gridSize n) ↑contract.expectedTarget.signalIndex ↑j, ⋯⟩ ∧ contract.targetMatrix = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinAkMatrix n ∧ contract.normalizedBlockEquality.proved = false ∧ contract.finalExtraction.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.resourceBound.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.ancillaCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false
The exact finite-composition interface is refined to the gamma3 entry target. This is still a Phase 1 transcript guard. It consumes the exact finite theorem interface, exposes the `gamma3` normalizer, the concrete signal-projection entry, the target matrix, and the false final flags. It does not prove that the entry equals the paper coefficient, nor does it promote LCU, projection, block-correctness, resource, cleanup, or extraction obligations.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route gamma 3 target entry data”; its local proof does not by itself complete the broader paper route. The gamma3 entry obligation also exposes the concrete target entry.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The gamma3 entry obligation also exposes the concrete target entry. This is the RHS data for the future entry theorem: the same fixed system indices 'i, j' point to 'f(x_i) D_{ij}', with normalizer 'N_D*N_f*kappa'. The statement intentionally does not prove that the circuit block entry equals this target entry; the normalized block equality and final extraction flags remain false.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:3538. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.83●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3TargetEntryData (n row sparse ofColumn : ℕ) (source : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))) (hn : 3 ≤ n) (hsource : QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source = true) (i j : Fin (QuantumBlockEncoding.gridSize n)) : have gamma := QuantumBlockEncoding.GHL2025.defaultRobinWavefunctionDecomposition (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n); have contract := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteBlockCompositionContract n; have entryObligation := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3SignalBlockEntryObligation n; ∃ post pre, QuantumBlockEncoding.GHL2025.BandedSparseAccessPostSwapCleanup (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) source post pre ∧ entryObligation.proved = false ∧ contract.expectedTarget.targetMatrix i j = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinAkMatrix n i j ∧ contract.expectedTarget.normalizer = gamma.gamma3.normalizer ∧ contract.targetMatrix i j = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinAkMatrix n i j ∧ contract.normalizer = gamma.gamma3.normalizer ∧ contract.expectedTarget.blockMatrix i j = contract.expectedTarget.unitaryMatrix ⟨QuantumBlockEncoding.signalSystemBlockRowIndex (QuantumBlockEncoding.gridSize n) ↑contract.expectedTarget.signalIndex ↑i, ⋯⟩ ⟨QuantumBlockEncoding.signalSystemBlockColIndex (QuantumBlockEncoding.gridSize n) ↑contract.expectedTarget.signalIndex ↑j, ⋯⟩ ∧ contract.normalizedBlockEquality.proved = false ∧ contract.finalExtraction.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3TargetEntryData (n row sparse ofColumn : ℕ) (source : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))) (hn : 3 ≤ n) (hsource : QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source = true) (i j : Fin (QuantumBlockEncoding.gridSize n)) : have gamma := QuantumBlockEncoding.GHL2025.defaultRobinWavefunctionDecomposition (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n); have contract := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteBlockCompositionContract n; have entryObligation := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3SignalBlockEntryObligation n; ∃ post pre, QuantumBlockEncoding.GHL2025.BandedSparseAccessPostSwapCleanup (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) source post pre ∧ entryObligation.proved = false ∧ contract.expectedTarget.targetMatrix i j = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinAkMatrix n i j ∧ contract.expectedTarget.normalizer = gamma.gamma3.normalizer ∧ contract.targetMatrix i j = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinAkMatrix n i j ∧ contract.normalizer = gamma.gamma3.normalizer ∧ contract.expectedTarget.blockMatrix i j = contract.expectedTarget.unitaryMatrix ⟨QuantumBlockEncoding.signalSystemBlockRowIndex (QuantumBlockEncoding.gridSize n) ↑contract.expectedTarget.signalIndex ↑i, ⋯⟩ ⟨QuantumBlockEncoding.signalSystemBlockColIndex (QuantumBlockEncoding.gridSize n) ↑contract.expectedTarget.signalIndex ↑j, ⋯⟩ ∧ contract.normalizedBlockEquality.proved = false ∧ contract.finalExtraction.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false
The gamma3 entry obligation also exposes the concrete target entry. This is the RHS data for the future entry theorem: the same fixed system indices `i, j` point to `f(x_i) D_{ij}`, with normalizer `N_D*N_f*kappa`. The statement intentionally does not prove that the circuit block entry equals this target entry; the normalized block equality and final extraction flags remain false.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route gamma 3 factor entry ledger”; its local proof does not by itself complete the broader paper route. The gamma3 factor-entry ledger joins the existing single-gate transcript bridges.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The gamma3 factor-entry ledger joins the existing single-gate transcript bridges. This is the next theorem-facing interface for the future 'one_term_gamma3_signal_block_entry' proof. It packages the target-entry side, the clean 'O_f' entry, the 'O_DT^S' ket-zero entry, the boundary 'Ry_boundary' ket-zero entry, and the active global-source 'O_D^BS' cleanup map. It is still a ledger: the normalized block equality, LCU composition, cleanup promotion, and final extraction fields remain false.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:3620. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.84●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3FactorEntryLedger (n row sparse ofColumn : ℕ) (source : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))) (hn : 3 ≤ n) (hsource : QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source = true) (i j : Fin (QuantumBlockEncoding.gridSize n)) (ofRow ofCol odtsRow odtsCol ryRow ryCol : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))) (hOfClean : (QuantumBlockEncoding.GHL2025.functionOraclePaperImage (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑ofCol).cleanWorkspaceBranch = true) (hOfBranch : ↑ofRow = (QuantumBlockEncoding.GHL2025.functionOraclePaperImage (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑ofCol).cleanBranchBasisIndex) (hOdtsIndicator : (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑odtsCol).indicatorBit = 1) (hOdtsAncilla : (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑odtsCol).ancillaBit = 0) (hOdtsRow : ↑odtsRow >>> 1 = (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑odtsCol).nonAncillaValue) (hOdtsAncillaRow : ↑odtsRow &&& 1 = 0) (hRyIndicator : (QuantumBlockEncoding.GHL2025.boundaryRotationPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑ryCol).indicatorBit = 0) (hRyAncilla : (QuantumBlockEncoding.GHL2025.boundaryRotationPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑ryCol).ancillaBit = 0) (hRyRow : ↑ryRow >>> 1 = (QuantumBlockEncoding.GHL2025.boundaryRotationPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑ryCol).nonAncillaValue) (hRyAncillaRow : ↑ryRow &&& 1 = 0) : let p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n; have gamma := QuantumBlockEncoding.GHL2025.defaultRobinWavefunctionDecomposition p; have contract := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteBlockCompositionContract n; have entryObligation := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3SignalBlockEntryObligation n; have odtsRegs := QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p ↑odtsCol; have ryRegs := QuantumBlockEncoding.GHL2025.boundaryRotationPaperRegisters p ↑ryCol; ∃ post pre, QuantumBlockEncoding.GHL2025.BandedSparseAccessPostSwapCleanup p source post pre ∧ entryObligation.proved = false ∧ contract.expectedTarget.targetMatrix i j = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinAkMatrix n i j ∧ contract.targetMatrix i j = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinAkMatrix n i j ∧ contract.expectedTarget.normalizer = gamma.gamma3.normalizer ∧ contract.normalizer = gamma.gamma3.normalizer ∧ contract.expectedTarget.blockMatrix i j = contract.expectedTarget.unitaryMatrix ⟨QuantumBlockEncoding.signalSystemBlockRowIndex (QuantumBlockEncoding.gridSize n) ↑contract.expectedTarget.signalIndex ↑i, ⋯⟩ ⟨QuantumBlockEncoding.signalSystemBlockColIndex (QuantumBlockEncoding.gridSize n) ↑contract.expectedTarget.signalIndex ↑j, ⋯⟩ ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨4, ⋯⟩).gate = QuantumBlockEncoding.Gate.oracleCall "O_f" ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨4, ⋯⟩).matrix ofRow ofCol = (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute p ↑ofCol).normalizedAmplitude ∧ (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute p ↑ofCol).cleanWorkspaceBranch = true ∧ (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute p ↑ofCol).unitaryCompletion.proved = false ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨1, ⋯⟩).gate = QuantumBlockEncoding.Gate.oracleCall "O_DT^S" ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨1, ⋯⟩).matrix odtsRow odtsCol = (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute p odtsRegs.rowValue odtsRegs.sparseIndexValue).ketZeroEntry ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute p odtsRegs.rowValue odtsRegs.sparseIndexValue).normalizedCoefficient = QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTNormalizedCoefficient p odtsRegs.rowValue odtsRegs.sparseIndexValue ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute p odtsRegs.rowValue odtsRegs.sparseIndexValue).twoByTwoUnitary.proved = false ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨2, ⋯⟩).gate = QuantumBlockEncoding.Gate.oracleCall "Ry_boundary" ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨2, ⋯⟩).matrix ryRow ryCol = (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute p ryRegs.rowValue ryRegs.sparseIndexValue).cosHalfEntry ∧ (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute p ryRegs.rowValue ryRegs.sparseIndexValue).arccosArgument = QuantumBlockEncoding.GHL2025.boundaryRotationNormalizedCoefficient p ryRegs.rowValue ryRegs.sparseIndexValue ∧ (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute p ryRegs.rowValue ryRegs.sparseIndexValue).twoByTwoUnitary.proved = false ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨3, ⋯⟩).matrix = QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperMatrix p ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨6, ⋯⟩).matrix = QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperDaggerMatrix p ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource p ↑pre = true ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS_dagger p).matrix pre post = QuantumBlockEncoding.Coeff.rat 1 ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.selectedScope = QuantumBlockEncoding.GHL2025.BandedSparseAccessCleanupScope.activeGlobalSource ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.semanticCleanupPromotionAllowed = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource.closesFunctionOracleContract = false ∧ contract.normalizedBlockEquality.proved = false ∧ contract.finalExtraction.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.functionOracle.amplitudeCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3FactorEntryLedger (n row sparse ofColumn : ℕ) (source : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))) (hn : 3 ≤ n) (hsource : QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source = true) (i j : Fin (QuantumBlockEncoding.gridSize n)) (ofRow ofCol odtsRow odtsCol ryRow ryCol : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))) (hOfClean : (QuantumBlockEncoding.GHL2025.functionOraclePaperImage (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑ofCol).cleanWorkspaceBranch = true) (hOfBranch : ↑ofRow = (QuantumBlockEncoding.GHL2025.functionOraclePaperImage (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑ofCol).cleanBranchBasisIndex) (hOdtsIndicator : (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑odtsCol).indicatorBit = 1) (hOdtsAncilla : (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑odtsCol).ancillaBit = 0) (hOdtsRow : ↑odtsRow >>> 1 = (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑odtsCol).nonAncillaValue) (hOdtsAncillaRow : ↑odtsRow &&& 1 = 0) (hRyIndicator : (QuantumBlockEncoding.GHL2025.boundaryRotationPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑ryCol).indicatorBit = 0) (hRyAncilla : (QuantumBlockEncoding.GHL2025.boundaryRotationPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑ryCol).ancillaBit = 0) (hRyRow : ↑ryRow >>> 1 = (QuantumBlockEncoding.GHL2025.boundaryRotationPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑ryCol).nonAncillaValue) (hRyAncillaRow : ↑ryRow &&& 1 = 0) : let p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n; have gamma := QuantumBlockEncoding.GHL2025.defaultRobinWavefunctionDecomposition p; have contract := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteBlockCompositionContract n; have entryObligation := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3SignalBlockEntryObligation n; have odtsRegs := QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p ↑odtsCol; have ryRegs := QuantumBlockEncoding.GHL2025.boundaryRotationPaperRegisters p ↑ryCol; ∃ post pre, QuantumBlockEncoding.GHL2025.BandedSparseAccessPostSwapCleanup p source post pre ∧ entryObligation.proved = false ∧ contract.expectedTarget.targetMatrix i j = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinAkMatrix n i j ∧ contract.targetMatrix i j = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinAkMatrix n i j ∧ contract.expectedTarget.normalizer = gamma.gamma3.normalizer ∧ contract.normalizer = gamma.gamma3.normalizer ∧ contract.expectedTarget.blockMatrix i j = contract.expectedTarget.unitaryMatrix ⟨QuantumBlockEncoding.signalSystemBlockRowIndex (QuantumBlockEncoding.gridSize n) ↑contract.expectedTarget.signalIndex ↑i, ⋯⟩ ⟨QuantumBlockEncoding.signalSystemBlockColIndex (QuantumBlockEncoding.gridSize n) ↑contract.expectedTarget.signalIndex ↑j, ⋯⟩ ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨4, ⋯⟩).gate = QuantumBlockEncoding.Gate.oracleCall "O_f" ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨4, ⋯⟩).matrix ofRow ofCol = (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute p ↑ofCol).normalizedAmplitude ∧ (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute p ↑ofCol).cleanWorkspaceBranch = true ∧ (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute p ↑ofCol).unitaryCompletion.proved = false ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨1, ⋯⟩).gate = QuantumBlockEncoding.Gate.oracleCall "O_DT^S" ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨1, ⋯⟩).matrix odtsRow odtsCol = (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute p odtsRegs.rowValue odtsRegs.sparseIndexValue).ketZeroEntry ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute p odtsRegs.rowValue odtsRegs.sparseIndexValue).normalizedCoefficient = QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTNormalizedCoefficient p odtsRegs.rowValue odtsRegs.sparseIndexValue ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute p odtsRegs.rowValue odtsRegs.sparseIndexValue).twoByTwoUnitary.proved = false ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨2, ⋯⟩).gate = QuantumBlockEncoding.Gate.oracleCall "Ry_boundary" ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨2, ⋯⟩).matrix ryRow ryCol = (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute p ryRegs.rowValue ryRegs.sparseIndexValue).cosHalfEntry ∧ (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute p ryRegs.rowValue ryRegs.sparseIndexValue).arccosArgument = QuantumBlockEncoding.GHL2025.boundaryRotationNormalizedCoefficient p ryRegs.rowValue ryRegs.sparseIndexValue ∧ (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute p ryRegs.rowValue ryRegs.sparseIndexValue).twoByTwoUnitary.proved = false ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨3, ⋯⟩).matrix = QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperMatrix p ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨6, ⋯⟩).matrix = QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperDaggerMatrix p ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource p ↑pre = true ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS_dagger p).matrix pre post = QuantumBlockEncoding.Coeff.rat 1 ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.selectedScope = QuantumBlockEncoding.GHL2025.BandedSparseAccessCleanupScope.activeGlobalSource ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.semanticCleanupPromotionAllowed = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource.closesFunctionOracleContract = false ∧ contract.normalizedBlockEquality.proved = false ∧ contract.finalExtraction.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.functionOracle.amplitudeCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false
The gamma3 factor-entry ledger joins the existing single-gate transcript bridges. This is the next theorem-facing interface for the future `one_term_gamma3_signal_block_entry` proof. It packages the target-entry side, the clean `O_f` entry, the `O_DT^S` ket-zero entry, the boundary `Ry_boundary` ket-zero entry, and the active global-source `O_D^BS` cleanup map. It is still a ledger: the normalized block equality, LCU composition, cleanup promotion, and final extraction fields remain false.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route gamma 3 signal block product entry”; its local proof does not by itself complete the broader paper route. The gamma3 signal-block entry is the concrete seven-gate product entry.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The gamma3 signal-block entry is the concrete seven-gate product entry. This is a matrix-semantics bridge, not the final coefficient theorem. It consumes the factor-entry ledger and exposes that the signal-zero projected entry is an entry of 'evalGateMatrices' over the Fig. 1-term Robin gate list. The finite product still has to be related to the Eq. 'ROBIN clarified' coefficient, so the normalized-block, LCU, projection, and extraction flags remain false.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:3843. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.85●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3SignalBlockProductEntry (n row sparse ofColumn : ℕ) (source : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))) (hn : 3 ≤ n) (hsource : QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source = true) (i j : Fin (QuantumBlockEncoding.gridSize n)) (ofRow ofCol odtsRow odtsCol ryRow ryCol : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))) (hOfClean : (QuantumBlockEncoding.GHL2025.functionOraclePaperImage (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑ofCol).cleanWorkspaceBranch = true) (hOfBranch : ↑ofRow = (QuantumBlockEncoding.GHL2025.functionOraclePaperImage (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑ofCol).cleanBranchBasisIndex) (hOdtsIndicator : (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑odtsCol).indicatorBit = 1) (hOdtsAncilla : (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑odtsCol).ancillaBit = 0) (hOdtsRow : ↑odtsRow >>> 1 = (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑odtsCol).nonAncillaValue) (hOdtsAncillaRow : ↑odtsRow &&& 1 = 0) (hRyIndicator : (QuantumBlockEncoding.GHL2025.boundaryRotationPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑ryCol).indicatorBit = 0) (hRyAncilla : (QuantumBlockEncoding.GHL2025.boundaryRotationPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑ryCol).ancillaBit = 0) (hRyRow : ↑ryRow >>> 1 = (QuantumBlockEncoding.GHL2025.boundaryRotationPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑ryCol).nonAncillaValue) (hRyAncillaRow : ↑ryRow &&& 1 = 0) : let p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n; have contract := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteBlockCompositionContract n; have entryObligation := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3SignalBlockEntryObligation n; have productMatrix := QuantumBlockEncoding.evalGateMatrices (QuantumBlockEncoding.GHL2025.oneTermRobinGateMatrixPlaceholders p); ∃ post pre, QuantumBlockEncoding.GHL2025.BandedSparseAccessPostSwapCleanup p source post pre ∧ entryObligation.proved = false ∧ contract.expectedTarget.blockMatrix i j = cast ⋯ productMatrix ⟨QuantumBlockEncoding.signalSystemBlockRowIndex (QuantumBlockEncoding.gridSize n) ↑contract.expectedTarget.signalIndex ↑i, ⋯⟩ ⟨QuantumBlockEncoding.signalSystemBlockColIndex (QuantumBlockEncoding.gridSize n) ↑contract.expectedTarget.signalIndex ↑j, ⋯⟩ ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.matrix = productMatrix ∧ List.map (fun gateMatrix => gateMatrix.gate) (QuantumBlockEncoding.GHL2025.oneTermRobinGateMatrixPlaceholders p) = QuantumBlockEncoding.GHL2025.oneTermRobinCircuit ∧ List.map (fun gateMatrix => gateMatrix.unitary.proved) (QuantumBlockEncoding.GHL2025.oneTermRobinGateMatrixPlaceholders p) = [true, false, false, false, false, true, false] ∧ contract.normalizedBlockEquality.proved = false ∧ contract.finalExtraction.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3SignalBlockProductEntry (n row sparse ofColumn : ℕ) (source : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))) (hn : 3 ≤ n) (hsource : QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source = true) (i j : Fin (QuantumBlockEncoding.gridSize n)) (ofRow ofCol odtsRow odtsCol ryRow ryCol : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))) (hOfClean : (QuantumBlockEncoding.GHL2025.functionOraclePaperImage (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑ofCol).cleanWorkspaceBranch = true) (hOfBranch : ↑ofRow = (QuantumBlockEncoding.GHL2025.functionOraclePaperImage (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑ofCol).cleanBranchBasisIndex) (hOdtsIndicator : (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑odtsCol).indicatorBit = 1) (hOdtsAncilla : (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑odtsCol).ancillaBit = 0) (hOdtsRow : ↑odtsRow >>> 1 = (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑odtsCol).nonAncillaValue) (hOdtsAncillaRow : ↑odtsRow &&& 1 = 0) (hRyIndicator : (QuantumBlockEncoding.GHL2025.boundaryRotationPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑ryCol).indicatorBit = 0) (hRyAncilla : (QuantumBlockEncoding.GHL2025.boundaryRotationPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑ryCol).ancillaBit = 0) (hRyRow : ↑ryRow >>> 1 = (QuantumBlockEncoding.GHL2025.boundaryRotationPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑ryCol).nonAncillaValue) (hRyAncillaRow : ↑ryRow &&& 1 = 0) : let p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n; have contract := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteBlockCompositionContract n; have entryObligation := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3SignalBlockEntryObligation n; have productMatrix := QuantumBlockEncoding.evalGateMatrices (QuantumBlockEncoding.GHL2025.oneTermRobinGateMatrixPlaceholders p); ∃ post pre, QuantumBlockEncoding.GHL2025.BandedSparseAccessPostSwapCleanup p source post pre ∧ entryObligation.proved = false ∧ contract.expectedTarget.blockMatrix i j = cast ⋯ productMatrix ⟨QuantumBlockEncoding.signalSystemBlockRowIndex (QuantumBlockEncoding.gridSize n) ↑contract.expectedTarget.signalIndex ↑i, ⋯⟩ ⟨QuantumBlockEncoding.signalSystemBlockColIndex (QuantumBlockEncoding.gridSize n) ↑contract.expectedTarget.signalIndex ↑j, ⋯⟩ ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.matrix = productMatrix ∧ List.map (fun gateMatrix => gateMatrix.gate) (QuantumBlockEncoding.GHL2025.oneTermRobinGateMatrixPlaceholders p) = QuantumBlockEncoding.GHL2025.oneTermRobinCircuit ∧ List.map (fun gateMatrix => gateMatrix.unitary.proved) (QuantumBlockEncoding.GHL2025.oneTermRobinGateMatrixPlaceholders p) = [true, false, false, false, false, true, false] ∧ contract.normalizedBlockEquality.proved = false ∧ contract.finalExtraction.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false
The gamma3 signal-block entry is the concrete seven-gate product entry. This is a matrix-semantics bridge, not the final coefficient theorem. It consumes the factor-entry ledger and exposes that the signal-zero projected entry is an entry of `evalGateMatrices` over the Fig. 1-term Robin gate list. The finite product still has to be related to the Eq. `ROBIN clarified` coefficient, so the normalized-block, LCU, projection, and extraction flags remain false.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route gamma 3 ak coefficient entry contract”; its local proof does not by itself complete the broader paper route. The gamma3 coefficient-entry contract is now tied to the Ak target.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The gamma3 coefficient-entry contract is now tied to the Ak target. This is still a contract bridge, not the finite coefficient theorem. It reuses the concrete signal-block product entry, the factor-entry ledger, and the Ak target expansion 'oneTermRobinAkMatrix n i j = f(x_i) * D_ij'. The product-to-coefficient equality, LCU composition, oracle analytic correctness, cleanup, unitarity, projection, and final extraction flags remain false.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:3980. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.86●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3AkCoefficientEntryContract (n row sparse ofColumn : ℕ) (source : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))) (hn : 3 ≤ n) (hsource : QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source = true) (i j : Fin (QuantumBlockEncoding.gridSize n)) (ofRow ofCol odtsRow odtsCol ryRow ryCol : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))) (hOfClean : (QuantumBlockEncoding.GHL2025.functionOraclePaperImage (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑ofCol).cleanWorkspaceBranch = true) (hOfBranch : ↑ofRow = (QuantumBlockEncoding.GHL2025.functionOraclePaperImage (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑ofCol).cleanBranchBasisIndex) (hOdtsIndicator : (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑odtsCol).indicatorBit = 1) (hOdtsAncilla : (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑odtsCol).ancillaBit = 0) (hOdtsRow : ↑odtsRow >>> 1 = (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑odtsCol).nonAncillaValue) (hOdtsAncillaRow : ↑odtsRow &&& 1 = 0) (hRyIndicator : (QuantumBlockEncoding.GHL2025.boundaryRotationPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑ryCol).indicatorBit = 0) (hRyAncilla : (QuantumBlockEncoding.GHL2025.boundaryRotationPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑ryCol).ancillaBit = 0) (hRyRow : ↑ryRow >>> 1 = (QuantumBlockEncoding.GHL2025.boundaryRotationPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑ryCol).nonAncillaValue) (hRyAncillaRow : ↑ryRow &&& 1 = 0) : let p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n; have contract := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteBlockCompositionContract n; have entryObligation := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3SignalBlockEntryObligation n; have productMatrix := QuantumBlockEncoding.evalGateMatrices (QuantumBlockEncoding.GHL2025.oneTermRobinGateMatrixPlaceholders p); have odtsRegs := QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p ↑odtsCol; have ryRegs := QuantumBlockEncoding.GHL2025.boundaryRotationPaperRegisters p ↑ryCol; ∃ post pre, QuantumBlockEncoding.GHL2025.BandedSparseAccessPostSwapCleanup p source post pre ∧ entryObligation.proved = false ∧ contract.expectedTarget.blockMatrix i j = cast ⋯ productMatrix ⟨QuantumBlockEncoding.signalSystemBlockRowIndex (QuantumBlockEncoding.gridSize n) ↑contract.expectedTarget.signalIndex ↑i, ⋯⟩ ⟨QuantumBlockEncoding.signalSystemBlockColIndex (QuantumBlockEncoding.gridSize n) ↑contract.expectedTarget.signalIndex ↑j, ⋯⟩ ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.matrix = productMatrix ∧ List.map (fun gateMatrix => gateMatrix.gate) (QuantumBlockEncoding.GHL2025.oneTermRobinGateMatrixPlaceholders p) = QuantumBlockEncoding.GHL2025.oneTermRobinCircuit ∧ List.map (fun gateMatrix => gateMatrix.unitary.proved) (QuantumBlockEncoding.GHL2025.oneTermRobinGateMatrixPlaceholders p) = [true, false, false, false, false, true, false] ∧ contract.expectedTarget.targetMatrix i j = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinAkMatrix n i j ∧ contract.targetMatrix i j = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinAkMatrix n i j ∧ QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinAkMatrix n i j = (QuantumBlockEncoding.GHL2025.robinFunctionValue n ↑i).mul (QuantumBlockEncoding.Examples.RobinHeat.robinDerivativeMatrix n i j) ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨4, ⋯⟩).gate = QuantumBlockEncoding.Gate.oracleCall "O_f" ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨4, ⋯⟩).matrix ofRow ofCol = (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute p ↑ofCol).normalizedAmplitude ∧ (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute p ↑ofCol).cleanWorkspaceBranch = true ∧ (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute p ↑ofCol).unitaryCompletion.proved = false ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨1, ⋯⟩).gate = QuantumBlockEncoding.Gate.oracleCall "O_DT^S" ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨1, ⋯⟩).matrix odtsRow odtsCol = (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute p odtsRegs.rowValue odtsRegs.sparseIndexValue).ketZeroEntry ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute p odtsRegs.rowValue odtsRegs.sparseIndexValue).normalizedCoefficient = QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTNormalizedCoefficient p odtsRegs.rowValue odtsRegs.sparseIndexValue ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_DT_S p).unitary.proved = false ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨2, ⋯⟩).gate = QuantumBlockEncoding.Gate.oracleCall "Ry_boundary" ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨2, ⋯⟩).matrix ryRow ryCol = (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute p ryRegs.rowValue ryRegs.sparseIndexValue).cosHalfEntry ∧ (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute p ryRegs.rowValue ryRegs.sparseIndexValue).arccosArgument = QuantumBlockEncoding.GHL2025.boundaryRotationNormalizedCoefficient p ryRegs.rowValue ryRegs.sparseIndexValue ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_Ry_boundary p).unitary.proved = false ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨3, ⋯⟩).matrix = QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperMatrix p ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨6, ⋯⟩).matrix = QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperDaggerMatrix p ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource p ↑pre = true ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS_dagger p).matrix pre post = QuantumBlockEncoding.Coeff.rat 1 ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS p).unitary.proved = false ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS_dagger p).unitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.selectedScope = QuantumBlockEncoding.GHL2025.BandedSparseAccessCleanupScope.activeGlobalSource ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.semanticCleanupPromotionAllowed = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource.closesFunctionOracleContract = false ∧ contract.lcuComposition.proved = false ∧ contract.blockProjection.proved = false ∧ contract.normalizedBlockEquality.proved = false ∧ contract.finalExtraction.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.functionOracle.amplitudeCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ ⋯.blockProjection.proved = false ∧ ⋯.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3AkCoefficientEntryContract (n row sparse ofColumn : ℕ) (source : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))) (hn : 3 ≤ n) (hsource : QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source = true) (i j : Fin (QuantumBlockEncoding.gridSize n)) (ofRow ofCol odtsRow odtsCol ryRow ryCol : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))) (hOfClean : (QuantumBlockEncoding.GHL2025.functionOraclePaperImage (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑ofCol).cleanWorkspaceBranch = true) (hOfBranch : ↑ofRow = (QuantumBlockEncoding.GHL2025.functionOraclePaperImage (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑ofCol).cleanBranchBasisIndex) (hOdtsIndicator : (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑odtsCol).indicatorBit = 1) (hOdtsAncilla : (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑odtsCol).ancillaBit = 0) (hOdtsRow : ↑odtsRow >>> 1 = (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑odtsCol).nonAncillaValue) (hOdtsAncillaRow : ↑odtsRow &&& 1 = 0) (hRyIndicator : (QuantumBlockEncoding.GHL2025.boundaryRotationPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑ryCol).indicatorBit = 0) (hRyAncilla : (QuantumBlockEncoding.GHL2025.boundaryRotationPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑ryCol).ancillaBit = 0) (hRyRow : ↑ryRow >>> 1 = (QuantumBlockEncoding.GHL2025.boundaryRotationPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑ryCol).nonAncillaValue) (hRyAncillaRow : ↑ryRow &&& 1 = 0) : let p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n; have contract := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteBlockCompositionContract n; have entryObligation := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3SignalBlockEntryObligation n; have productMatrix := QuantumBlockEncoding.evalGateMatrices (QuantumBlockEncoding.GHL2025.oneTermRobinGateMatrixPlaceholders p); have odtsRegs := QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p ↑odtsCol; have ryRegs := QuantumBlockEncoding.GHL2025.boundaryRotationPaperRegisters p ↑ryCol; ∃ post pre, QuantumBlockEncoding.GHL2025.BandedSparseAccessPostSwapCleanup p source post pre ∧ entryObligation.proved = false ∧ contract.expectedTarget.blockMatrix i j = cast ⋯ productMatrix ⟨QuantumBlockEncoding.signalSystemBlockRowIndex (QuantumBlockEncoding.gridSize n) ↑contract.expectedTarget.signalIndex ↑i, ⋯⟩ ⟨QuantumBlockEncoding.signalSystemBlockColIndex (QuantumBlockEncoding.gridSize n) ↑contract.expectedTarget.signalIndex ↑j, ⋯⟩ ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.matrix = productMatrix ∧ List.map (fun gateMatrix => gateMatrix.gate) (QuantumBlockEncoding.GHL2025.oneTermRobinGateMatrixPlaceholders p) = QuantumBlockEncoding.GHL2025.oneTermRobinCircuit ∧ List.map (fun gateMatrix => gateMatrix.unitary.proved) (QuantumBlockEncoding.GHL2025.oneTermRobinGateMatrixPlaceholders p) = [true, false, false, false, false, true, false] ∧ contract.expectedTarget.targetMatrix i j = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinAkMatrix n i j ∧ contract.targetMatrix i j = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinAkMatrix n i j ∧ QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinAkMatrix n i j = (QuantumBlockEncoding.GHL2025.robinFunctionValue n ↑i).mul (QuantumBlockEncoding.Examples.RobinHeat.robinDerivativeMatrix n i j) ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨4, ⋯⟩).gate = QuantumBlockEncoding.Gate.oracleCall "O_f" ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨4, ⋯⟩).matrix ofRow ofCol = (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute p ↑ofCol).normalizedAmplitude ∧ (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute p ↑ofCol).cleanWorkspaceBranch = true ∧ (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute p ↑ofCol).unitaryCompletion.proved = false ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨1, ⋯⟩).gate = QuantumBlockEncoding.Gate.oracleCall "O_DT^S" ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨1, ⋯⟩).matrix odtsRow odtsCol = (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute p odtsRegs.rowValue odtsRegs.sparseIndexValue).ketZeroEntry ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute p odtsRegs.rowValue odtsRegs.sparseIndexValue).normalizedCoefficient = QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTNormalizedCoefficient p odtsRegs.rowValue odtsRegs.sparseIndexValue ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_DT_S p).unitary.proved = false ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨2, ⋯⟩).gate = QuantumBlockEncoding.Gate.oracleCall "Ry_boundary" ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨2, ⋯⟩).matrix ryRow ryCol = (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute p ryRegs.rowValue ryRegs.sparseIndexValue).cosHalfEntry ∧ (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute p ryRegs.rowValue ryRegs.sparseIndexValue).arccosArgument = QuantumBlockEncoding.GHL2025.boundaryRotationNormalizedCoefficient p ryRegs.rowValue ryRegs.sparseIndexValue ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_Ry_boundary p).unitary.proved = false ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨3, ⋯⟩).matrix = QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperMatrix p ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨6, ⋯⟩).matrix = QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperDaggerMatrix p ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource p ↑pre = true ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS_dagger p).matrix pre post = QuantumBlockEncoding.Coeff.rat 1 ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS p).unitary.proved = false ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS_dagger p).unitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.selectedScope = QuantumBlockEncoding.GHL2025.BandedSparseAccessCleanupScope.activeGlobalSource ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).cleanupScopeDecision.semanticCleanupPromotionAllowed = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.unitaryExtension.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).functionOracleSource.closesFunctionOracleContract = false ∧ contract.lcuComposition.proved = false ∧ contract.blockProjection.proved = false ∧ contract.normalizedBlockEquality.proved = false ∧ contract.finalExtraction.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.functionOracle.amplitudeCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ ⋯.blockProjection.proved = false ∧ ⋯.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false
The gamma3 coefficient-entry contract is now tied to the Ak target. This is still a contract bridge, not the finite coefficient theorem. It reuses the concrete signal-block product entry, the factor-entry ledger, and the Ak target expansion `oneTermRobinAkMatrix n i j = f(x_i) * D_ij`. The product-to-coefficient equality, LCU composition, oracle analytic correctness, cleanup, unitarity, projection, and final extraction flags remain false.
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 product to coefficient obligation”. Named product-to-coefficient obligation for the gamma3 entry.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Named product-to-coefficient obligation for the gamma3 entry. The future theorem must multiply the already ledgered factor entries in the signal-zero product into the normalized Ak entry. This declaration only names that remaining finite entry theorem; it does not assert the equality.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:4218. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.87●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProductToCoefficientObligation (n : ℕ) (_i _j : Fin (QuantumBlockEncoding.gridSize n)) : QuantumBlockEncoding.SemanticObligation
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProductToCoefficientObligation (n : ℕ) (_i _j : Fin (QuantumBlockEncoding.gridSize n)) : QuantumBlockEncoding.SemanticObligation
Named product-to-coefficient obligation for the gamma3 entry. The future theorem must multiply the already ledgered factor entries in the signal-zero product into the normalized Ak entry. This declaration only names that remaining finite entry theorem; it does not assert the equality.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 product to coefficient obligation transcript”; its local proof does not by itself complete the broader paper route.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The source declaration has no docstring. The reader cue above is generated from its kind and name and does not replace the Lean signature.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:4226. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.88●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProductToCoefficientObligation_transcript (n : ℕ) (i j : Fin (QuantumBlockEncoding.gridSize n)) : (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProductToCoefficientObligation n i j).source = "GHL2025 Eq. ROBIN clarified gamma3 line, Theorem one-term block-encoding, Fig. 1-term ROBIN, Definition def:block-encoding; cited-results row LCU.StandardBlockEncoding" ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProductToCoefficientObligation n i j).proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProductToCoefficientObligation_transcript (n : ℕ) (i j : Fin (QuantumBlockEncoding.gridSize n)) : (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProductToCoefficientObligation n i j).source = "GHL2025 Eq. ROBIN clarified gamma3 line, Theorem one-term block-encoding, Fig. 1-term ROBIN, Definition def:block-encoding; cited-results row LCU.StandardBlockEncoding" ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProductToCoefficientObligation n i j).proved = false
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route gamma 3 product to coefficient interface”; its local proof does not by itself complete the broader paper route. Interface for the exact finite product-to-coefficient theorem.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Interface for the exact finite product-to-coefficient theorem. This guard consumes the compiled gamma3 Ak coefficient-entry contract and exposes the remaining theorem-facing obligation: the signal-zero product entry must equal the Ak coefficient normalized by 'N_D*N_f*kappa'. It keeps the entry obligation, LCU composition, projection, cleanup, unitarity, and final extraction flags false.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:4243. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.89●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3ProductToCoefficientInterface (n row sparse ofColumn : ℕ) (source : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))) (hn : 3 ≤ n) (hsource : QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source = true) (i j : Fin (QuantumBlockEncoding.gridSize n)) (ofRow ofCol odtsRow odtsCol ryRow ryCol : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))) (hOfClean : (QuantumBlockEncoding.GHL2025.functionOraclePaperImage (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑ofCol).cleanWorkspaceBranch = true) (hOfBranch : ↑ofRow = (QuantumBlockEncoding.GHL2025.functionOraclePaperImage (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑ofCol).cleanBranchBasisIndex) (hOdtsIndicator : (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑odtsCol).indicatorBit = 1) (hOdtsAncilla : (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑odtsCol).ancillaBit = 0) (hOdtsRow : ↑odtsRow >>> 1 = (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑odtsCol).nonAncillaValue) (hOdtsAncillaRow : ↑odtsRow &&& 1 = 0) (hRyIndicator : (QuantumBlockEncoding.GHL2025.boundaryRotationPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑ryCol).indicatorBit = 0) (hRyAncilla : (QuantumBlockEncoding.GHL2025.boundaryRotationPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑ryCol).ancillaBit = 0) (hRyRow : ↑ryRow >>> 1 = (QuantumBlockEncoding.GHL2025.boundaryRotationPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑ryCol).nonAncillaValue) (hRyAncillaRow : ↑ryRow &&& 1 = 0) : let p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n; have contract := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteBlockCompositionContract n; have entryObligation := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3SignalBlockEntryObligation n; have productToCoefficient := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProductToCoefficientObligation n i j; have productMatrix := QuantumBlockEncoding.evalGateMatrices (QuantumBlockEncoding.GHL2025.oneTermRobinGateMatrixPlaceholders p); have odtsRegs := QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p ↑odtsCol; have ryRegs := QuantumBlockEncoding.GHL2025.boundaryRotationPaperRegisters p ↑ryCol; ∃ post pre, QuantumBlockEncoding.GHL2025.BandedSparseAccessPostSwapCleanup p source post pre ∧ productToCoefficient.source = "GHL2025 Eq. ROBIN clarified gamma3 line, Theorem one-term block-encoding, Fig. 1-term ROBIN, Definition def:block-encoding; cited-results row LCU.StandardBlockEncoding" ∧ productToCoefficient.proved = false ∧ entryObligation.proved = false ∧ contract.expectedTarget.blockMatrix i j = cast ⋯ productMatrix ⟨QuantumBlockEncoding.signalSystemBlockRowIndex (QuantumBlockEncoding.gridSize n) ↑contract.expectedTarget.signalIndex ↑i, ⋯⟩ ⟨QuantumBlockEncoding.signalSystemBlockColIndex (QuantumBlockEncoding.gridSize n) ↑contract.expectedTarget.signalIndex ↑j, ⋯⟩ ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.matrix = productMatrix ∧ List.map (fun gateMatrix => gateMatrix.gate) (QuantumBlockEncoding.GHL2025.oneTermRobinGateMatrixPlaceholders p) = QuantumBlockEncoding.GHL2025.oneTermRobinCircuit ∧ List.map (fun gateMatrix => gateMatrix.unitary.proved) (QuantumBlockEncoding.GHL2025.oneTermRobinGateMatrixPlaceholders p) = [true, false, false, false, false, true, false] ∧ contract.expectedTarget.targetMatrix i j = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinAkMatrix n i j ∧ contract.targetMatrix i j = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinAkMatrix n i j ∧ QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinAkMatrix n i j = (QuantumBlockEncoding.GHL2025.robinFunctionValue n ↑i).mul (QuantumBlockEncoding.Examples.RobinHeat.robinDerivativeMatrix n i j) ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨4, ⋯⟩).matrix ofRow ofCol = (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute p ↑ofCol).normalizedAmplitude ∧ (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute p ↑ofCol).unitaryCompletion.proved = false ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨1, ⋯⟩).matrix odtsRow odtsCol = (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute p odtsRegs.rowValue odtsRegs.sparseIndexValue).ketZeroEntry ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_DT_S p).unitary.proved = false ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨2, ⋯⟩).matrix ryRow ryCol = (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute p ryRegs.rowValue ryRegs.sparseIndexValue).cosHalfEntry ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_Ry_boundary p).unitary.proved = false ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS_dagger p).matrix pre post = QuantumBlockEncoding.Coeff.rat 1 ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS p).unitary.proved = false ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS_dagger p).unitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.unitaryExtension.proved = false ∧ contract.lcuComposition.proved = false ∧ contract.blockProjection.proved = false ∧ contract.normalizedBlockEquality.proved = false ∧ contract.finalExtraction.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.functionOracle.amplitudeCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3ProductToCoefficientInterface (n row sparse ofColumn : ℕ) (source : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))) (hn : 3 ≤ n) (hsource : QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑source = true) (i j : Fin (QuantumBlockEncoding.gridSize n)) (ofRow ofCol odtsRow odtsCol ryRow ryCol : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n)))) (hOfClean : (QuantumBlockEncoding.GHL2025.functionOraclePaperImage (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑ofCol).cleanWorkspaceBranch = true) (hOfBranch : ↑ofRow = (QuantumBlockEncoding.GHL2025.functionOraclePaperImage (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑ofCol).cleanBranchBasisIndex) (hOdtsIndicator : (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑odtsCol).indicatorBit = 1) (hOdtsAncilla : (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑odtsCol).ancillaBit = 0) (hOdtsRow : ↑odtsRow >>> 1 = (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑odtsCol).nonAncillaValue) (hOdtsAncillaRow : ↑odtsRow &&& 1 = 0) (hRyIndicator : (QuantumBlockEncoding.GHL2025.boundaryRotationPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑ryCol).indicatorBit = 0) (hRyAncilla : (QuantumBlockEncoding.GHL2025.boundaryRotationPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑ryCol).ancillaBit = 0) (hRyRow : ↑ryRow >>> 1 = (QuantumBlockEncoding.GHL2025.boundaryRotationPaperRegisters (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n) ↑ryCol).nonAncillaValue) (hRyAncillaRow : ↑ryRow &&& 1 = 0) : let p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters n; have contract := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteBlockCompositionContract n; have entryObligation := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3SignalBlockEntryObligation n; have productToCoefficient := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProductToCoefficientObligation n i j; have productMatrix := QuantumBlockEncoding.evalGateMatrices (QuantumBlockEncoding.GHL2025.oneTermRobinGateMatrixPlaceholders p); have odtsRegs := QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p ↑odtsCol; have ryRegs := QuantumBlockEncoding.GHL2025.boundaryRotationPaperRegisters p ↑ryCol; ∃ post pre, QuantumBlockEncoding.GHL2025.BandedSparseAccessPostSwapCleanup p source post pre ∧ productToCoefficient.source = "GHL2025 Eq. ROBIN clarified gamma3 line, Theorem one-term block-encoding, Fig. 1-term ROBIN, Definition def:block-encoding; cited-results row LCU.StandardBlockEncoding" ∧ productToCoefficient.proved = false ∧ entryObligation.proved = false ∧ contract.expectedTarget.blockMatrix i j = cast ⋯ productMatrix ⟨QuantumBlockEncoding.signalSystemBlockRowIndex (QuantumBlockEncoding.gridSize n) ↑contract.expectedTarget.signalIndex ↑i, ⋯⟩ ⟨QuantumBlockEncoding.signalSystemBlockColIndex (QuantumBlockEncoding.gridSize n) ↑contract.expectedTarget.signalIndex ↑j, ⋯⟩ ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.matrix = productMatrix ∧ List.map (fun gateMatrix => gateMatrix.gate) (QuantumBlockEncoding.GHL2025.oneTermRobinGateMatrixPlaceholders p) = QuantumBlockEncoding.GHL2025.oneTermRobinCircuit ∧ List.map (fun gateMatrix => gateMatrix.unitary.proved) (QuantumBlockEncoding.GHL2025.oneTermRobinGateMatrixPlaceholders p) = [true, false, false, false, false, true, false] ∧ contract.expectedTarget.targetMatrix i j = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinAkMatrix n i j ∧ contract.targetMatrix i j = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinAkMatrix n i j ∧ QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinAkMatrix n i j = (QuantumBlockEncoding.GHL2025.robinFunctionValue n ↑i).mul (QuantumBlockEncoding.Examples.RobinHeat.robinDerivativeMatrix n i j) ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨4, ⋯⟩).matrix ofRow ofCol = (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute p ↑ofCol).normalizedAmplitude ∧ (QuantumBlockEncoding.GHL2025.functionOracleAmplitudeProofRoute p ↑ofCol).unitaryCompletion.proved = false ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨1, ⋯⟩).matrix odtsRow odtsCol = (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTCoefficientNormalizerProofRoute p odtsRegs.rowValue odtsRegs.sparseIndexValue).ketZeroEntry ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_DT_S p).unitary.proved = false ∧ ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).circuitSemantics.gateMatrices.get ⟨2, ⋯⟩).matrix ryRow ryCol = (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute p ryRegs.rowValue ryRegs.sparseIndexValue).cosHalfEntry ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_Ry_boundary p).unitary.proved = false ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS_dagger p).matrix pre post = QuantumBlockEncoding.Coeff.rat 1 ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS p).unitary.proved = false ∧ (QuantumBlockEncoding.GHL2025.oneTermRobinGate_O_D_BS_dagger p).unitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.daggerCleanup.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).sparseAccessContract.unitaryExtension.proved = false ∧ contract.lcuComposition.proved = false ∧ contract.blockProjection.proved = false ∧ contract.normalizedBlockEquality.proved = false ∧ contract.finalExtraction.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.functionOracle.amplitudeCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.circuitUnitary.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute n).theoremData.obligations.blockExtraction.proved = false
Interface for the exact finite product-to-coefficient theorem. This guard consumes the compiled gamma3 Ak coefficient-entry contract and exposes the remaining theorem-facing obligation: the signal-zero product entry must equal the Ak coefficient normalized by `N_D*N_f*kappa`. It keeps the entry obligation, LCU composition, projection, cleanup, unitarity, and final extraction flags false.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route gamma 3 projection path audit n 3”; its local proof does not by itself complete the broader paper route. Focused path-state audit for the current 'n = 3' gamma3 product attempt.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Focused path-state audit for the current 'n = 3' gamma3 product attempt. The signal-zero projection sends system entry '(2, 5)' to the full entry '(2, 5)'. The executable gate images then show that the projected-column forward path and the existing factor-entry ledger columns are not one coherent seven-gate path. This is a register-layout audit only: it does not unfold the full product and does not promote any semantic proof flag.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:4415. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.90●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3ProjectionPathAudit_n3 : let p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3; let fullDim := QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits p); have sysRow := ⟨2, ⋯⟩; have sysCol := ⟨5, ⋯⟩; have row2 := ⟨2, ⋯⟩; have row18 := ⟨18, ⋯⟩; have row192 := ⟨192, ⋯⟩; have col2 := ⟨2, ⋯⟩; have col160 := ⟨160, ⋯⟩; have col132 := ⟨132, ⋯⟩; have col133 := ⟨133, ⋯⟩; QuantumBlockEncoding.signalSystemBlockRowIndex (QuantumBlockEncoding.gridSize 3) ↑(QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteBlockCompositionContract 3).expectedTarget.signalIndex ↑sysRow = 2 ∧ QuantumBlockEncoding.signalSystemBlockColIndex (QuantumBlockEncoding.gridSize 3) ↑(QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteBlockCompositionContract 3).expectedTarget.signalIndex ↑sysCol = 5 ∧ QuantumBlockEncoding.GHL2025.indicatorOracleImage p 5 = 133 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p 133).indicatorBit = 1 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p 133).ancillaBit = 1 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p 133).rowValue = 2 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p 133).sparseIndexValue = 0 ∧ QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTRotationMatrix p col132 col133 = (QuantumBlockEncoding.Coeff.symbol "odts_sin_half_2_0").neg ∧ QuantumBlockEncoding.GHL2025.boundaryRotationMatrix p col132 col132 = QuantumBlockEncoding.Coeff.rat 1 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperImage p 132 = 132 ∧ (QuantumBlockEncoding.GHL2025.functionOraclePaperImage p 132).cleanBranchBasisIndex = 132 ∧ (QuantumBlockEncoding.GHL2025.functionOraclePaperImage p 132).cleanBranchSystemValue = 2 ∧ QuantumBlockEncoding.GHL2025.swapOracleImage p 132 = 160 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperDaggerMatrix p row192 col160 = QuantumBlockEncoding.Coeff.rat 1 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperDaggerMatrix p row2 col160 = QuantumBlockEncoding.Coeff.rat 0 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperImage p 48 = 16 ∧ (QuantumBlockEncoding.GHL2025.functionOraclePaperImage p 16).cleanBranchSystemValue = 0 ∧ QuantumBlockEncoding.GHL2025.swapOracleImage p 16 = 2 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperPostSwapPreimageCandidate p 48 = 18 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperDaggerMatrix p row18 col2 = QuantumBlockEncoding.Coeff.rat 1 ∧ 18 ≠ 2 ∧ 16 ≠ 36 ∧ (QuantumBlockEncoding.GHL2025.functionOraclePaperImage p 36).cleanBranchBasisIndex = 36 ∧ (QuantumBlockEncoding.GHL2025.functionOraclePaperImage p 36).cleanBranchAmplitude = (QuantumBlockEncoding.Coeff.symbol "f_3_2").mul (QuantumBlockEncoding.Coeff.symbol "N_f_inv") ∧ QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTRotationMatrix p col132 col132 = QuantumBlockEncoding.Coeff.symbol "odts_cos_half_2_0" ∧ QuantumBlockEncoding.GHL2025.boundaryRotationMatrix p ⟨0, ⋯⟩ ⟨0, ⋯⟩ = QuantumBlockEncoding.Coeff.symbol "boundary_cos_half_0_0" ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperImage p 2 = 114 ∧ QuantumBlockEncoding.GHL2025.swapOracleImage p 30 = 114 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperImage p 78 = 30 ∧ (QuantumBlockEncoding.GHL2025.functionOraclePaperImage p 30).cleanBranchSystemValue = 7 ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProductToCoefficientObligation 3 sysRow sysCol).proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).theoremData.obligations.blockExtraction.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3ProjectionPathAudit_n3 : let p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3; let fullDim := QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits p); have sysRow := ⟨2, ⋯⟩; have sysCol := ⟨5, ⋯⟩; have row2 := ⟨2, ⋯⟩; have row18 := ⟨18, ⋯⟩; have row192 := ⟨192, ⋯⟩; have col2 := ⟨2, ⋯⟩; have col160 := ⟨160, ⋯⟩; have col132 := ⟨132, ⋯⟩; have col133 := ⟨133, ⋯⟩; QuantumBlockEncoding.signalSystemBlockRowIndex (QuantumBlockEncoding.gridSize 3) ↑(QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteBlockCompositionContract 3).expectedTarget.signalIndex ↑sysRow = 2 ∧ QuantumBlockEncoding.signalSystemBlockColIndex (QuantumBlockEncoding.gridSize 3) ↑(QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteBlockCompositionContract 3).expectedTarget.signalIndex ↑sysCol = 5 ∧ QuantumBlockEncoding.GHL2025.indicatorOracleImage p 5 = 133 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p 133).indicatorBit = 1 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p 133).ancillaBit = 1 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p 133).rowValue = 2 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p 133).sparseIndexValue = 0 ∧ QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTRotationMatrix p col132 col133 = (QuantumBlockEncoding.Coeff.symbol "odts_sin_half_2_0").neg ∧ QuantumBlockEncoding.GHL2025.boundaryRotationMatrix p col132 col132 = QuantumBlockEncoding.Coeff.rat 1 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperImage p 132 = 132 ∧ (QuantumBlockEncoding.GHL2025.functionOraclePaperImage p 132).cleanBranchBasisIndex = 132 ∧ (QuantumBlockEncoding.GHL2025.functionOraclePaperImage p 132).cleanBranchSystemValue = 2 ∧ QuantumBlockEncoding.GHL2025.swapOracleImage p 132 = 160 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperDaggerMatrix p row192 col160 = QuantumBlockEncoding.Coeff.rat 1 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperDaggerMatrix p row2 col160 = QuantumBlockEncoding.Coeff.rat 0 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperImage p 48 = 16 ∧ (QuantumBlockEncoding.GHL2025.functionOraclePaperImage p 16).cleanBranchSystemValue = 0 ∧ QuantumBlockEncoding.GHL2025.swapOracleImage p 16 = 2 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperPostSwapPreimageCandidate p 48 = 18 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperDaggerMatrix p row18 col2 = QuantumBlockEncoding.Coeff.rat 1 ∧ 18 ≠ 2 ∧ 16 ≠ 36 ∧ (QuantumBlockEncoding.GHL2025.functionOraclePaperImage p 36).cleanBranchBasisIndex = 36 ∧ (QuantumBlockEncoding.GHL2025.functionOraclePaperImage p 36).cleanBranchAmplitude = (QuantumBlockEncoding.Coeff.symbol "f_3_2").mul (QuantumBlockEncoding.Coeff.symbol "N_f_inv") ∧ QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTRotationMatrix p col132 col132 = QuantumBlockEncoding.Coeff.symbol "odts_cos_half_2_0" ∧ QuantumBlockEncoding.GHL2025.boundaryRotationMatrix p ⟨0, ⋯⟩ ⟨0, ⋯⟩ = QuantumBlockEncoding.Coeff.symbol "boundary_cos_half_0_0" ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperImage p 2 = 114 ∧ QuantumBlockEncoding.GHL2025.swapOracleImage p 30 = 114 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperImage p 78 = 30 ∧ (QuantumBlockEncoding.GHL2025.functionOraclePaperImage p 30).cleanBranchSystemValue = 7 ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProductToCoefficientObligation 3 sysRow sysCol).proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).theoremData.obligations.blockExtraction.proved = false
Focused path-state audit for the current `n = 3` gamma3 product attempt. The signal-zero projection sends system entry `(2, 5)` to the full entry `(2, 5)`. The executable gate images then show that the projected-column forward path and the existing factor-entry ledger columns are not one coherent seven-gate path. This is a register-layout audit only: it does not unfold the full product and does not promote any semantic proof flag.
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 paper basis index”. Full-basis index for the clean 'gamma3' ket layout in Eq.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Full-basis index for the clean 'gamma3' ket layout in Eq. 'ROBIN clarified'. This is a Phase 1 layout helper, not a new projection convention. It places the trailing rotation ancilla at bit '0', the system register in bits '[1, 1+n)', the padded 'O_D^BS' zero register next, and the sparse slot above that padded register, with all higher 'm_f' and indicator workspace bits set to zero.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:4490. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.91●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3PaperBasisIndex (p : QuantumBlockEncoding.GHL2025.OneTermRobinParameters) (s j : ℕ) : ℕ
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3PaperBasisIndex (p : QuantumBlockEncoding.GHL2025.OneTermRobinParameters) (s j : ℕ) : ℕ
Full-basis index for the clean `gamma3` ket layout in Eq. `ROBIN clarified`. This is a Phase 1 layout helper, not a new projection convention. It places the trailing rotation ancilla at bit `0`, the system register in bits `[1, 1+n)`, the padded `O_D^BS` zero register next, and the sparse slot above that padded register, with all higher `m_f` and indicator workspace bits set to zero.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route gamma 3 paper basis layout n 3”; its local proof does not by itself complete the broader paper route. Layout contract for the next gamma3 path attempt at 'n = 3'.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Layout contract for the next gamma3 path attempt at 'n = 3'. Eq. 'ROBIN clarified' places the clean 'gamma3' basis states for system entry '(2, 5)' at full indices '(4, 10)' when the sparse slot is '0'. The existing 'signalSystemBlockProjection' convention instead selects full indices '(2, 5)'. This theorem records that mismatch together with the relevant clean-register extractions, so the product-to-coefficient route can choose a coherent block index before applying the reusable unique-path product lemma.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:4505. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.92●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3PaperBasisLayout_n3 : have p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3; have sysRow := ⟨2, ⋯⟩; have sysCol := ⟨5, ⋯⟩; have projectedRow := QuantumBlockEncoding.signalSystemBlockRowIndex (QuantumBlockEncoding.gridSize 3) ↑(QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteBlockCompositionContract 3).expectedTarget.signalIndex ↑sysRow; have projectedCol := QuantumBlockEncoding.signalSystemBlockColIndex (QuantumBlockEncoding.gridSize 3) ↑(QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteBlockCompositionContract 3).expectedTarget.signalIndex ↑sysCol; have paperRow := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3PaperBasisIndex p 0 ↑sysRow; have paperCol := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3PaperBasisIndex p 0 ↑sysCol; paperRow = 4 ∧ paperCol = 10 ∧ projectedRow = 2 ∧ projectedCol = 5 ∧ paperRow ≠ projectedRow ∧ paperCol ≠ projectedCol ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p paperRow).rowValue = 2 ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p paperRow).paddedZeroValue = 0 ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p paperRow).sparseIndexValue = 0 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource p paperRow = true ∧ (QuantumBlockEncoding.GHL2025.functionOraclePaperRegisters p paperRow).cleanWorkspace = true ∧ (QuantumBlockEncoding.GHL2025.functionOraclePaperImage p paperRow).cleanBranchBasisIndex = paperRow ∧ (QuantumBlockEncoding.GHL2025.functionOraclePaperImage p paperRow).cleanBranchSystemValue = 2 ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p paperCol).rowValue = 5 ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p paperCol).paddedZeroValue = 0 ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p paperCol).sparseIndexValue = 0 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource p paperCol = true ∧ (QuantumBlockEncoding.GHL2025.functionOraclePaperRegisters p paperCol).cleanWorkspace = true ∧ (QuantumBlockEncoding.GHL2025.functionOraclePaperImage p paperCol).cleanBranchBasisIndex = paperCol ∧ (QuantumBlockEncoding.GHL2025.functionOraclePaperImage p paperCol).cleanBranchSystemValue = 5 ∧ QuantumBlockEncoding.GHL2025.indicatorOracleImage p paperCol = 138 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p 138).indicatorBit = 1 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p 138).ancillaBit = 0 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p 138).rowValue = 5 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p 138).sparseIndexValue = 0
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3PaperBasisLayout_n3 : have p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3; have sysRow := ⟨2, ⋯⟩; have sysCol := ⟨5, ⋯⟩; have projectedRow := QuantumBlockEncoding.signalSystemBlockRowIndex (QuantumBlockEncoding.gridSize 3) ↑(QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteBlockCompositionContract 3).expectedTarget.signalIndex ↑sysRow; have projectedCol := QuantumBlockEncoding.signalSystemBlockColIndex (QuantumBlockEncoding.gridSize 3) ↑(QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteBlockCompositionContract 3).expectedTarget.signalIndex ↑sysCol; have paperRow := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3PaperBasisIndex p 0 ↑sysRow; have paperCol := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3PaperBasisIndex p 0 ↑sysCol; paperRow = 4 ∧ paperCol = 10 ∧ projectedRow = 2 ∧ projectedCol = 5 ∧ paperRow ≠ projectedRow ∧ paperCol ≠ projectedCol ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p paperRow).rowValue = 2 ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p paperRow).paddedZeroValue = 0 ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p paperRow).sparseIndexValue = 0 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource p paperRow = true ∧ (QuantumBlockEncoding.GHL2025.functionOraclePaperRegisters p paperRow).cleanWorkspace = true ∧ (QuantumBlockEncoding.GHL2025.functionOraclePaperImage p paperRow).cleanBranchBasisIndex = paperRow ∧ (QuantumBlockEncoding.GHL2025.functionOraclePaperImage p paperRow).cleanBranchSystemValue = 2 ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p paperCol).rowValue = 5 ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p paperCol).paddedZeroValue = 0 ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p paperCol).sparseIndexValue = 0 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource p paperCol = true ∧ (QuantumBlockEncoding.GHL2025.functionOraclePaperRegisters p paperCol).cleanWorkspace = true ∧ (QuantumBlockEncoding.GHL2025.functionOraclePaperImage p paperCol).cleanBranchBasisIndex = paperCol ∧ (QuantumBlockEncoding.GHL2025.functionOraclePaperImage p paperCol).cleanBranchSystemValue = 5 ∧ QuantumBlockEncoding.GHL2025.indicatorOracleImage p paperCol = 138 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p 138).indicatorBit = 1 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p 138).ancillaBit = 0 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p 138).rowValue = 5 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p 138).sparseIndexValue = 0
Layout contract for the next gamma3 path attempt at `n = 3`. Eq. `ROBIN clarified` places the clean `gamma3` basis states for system entry `(2, 5)` at full indices `(4, 10)` when the sparse slot is `0`. The existing `signalSystemBlockProjection` convention instead selects full indices `(2, 5)`. This theorem records that mismatch together with the relevant clean-register extractions, so the product-to-coefficient route can choose a coherent block index before applying the reusable unique-path product lemma.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route gamma 3 paper basis path audit n 3”; its local proof does not by itself complete the broader paper route. Focused Fig.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Focused Fig. 1-term Robin path audit for the clean 'gamma3' paper-basis endpoints at 'n = 3'. Starting from the paper clean-column index '10', the ket-zero branch follows the active seven-gate images to final dagger row '198', not to the paper clean-row index '4'. The first decisive drift is the active 'O_D^BS' sparse-slot-zero address: after 'U_indic' and the identity 'Ry_boundary' branch, it writes address '3', so SWAP exposes system row '3' before the dagger cleanup. This is a path-state audit only; it does not apply the unique-path product lemma and does not promote any semantic proof flag.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:4563. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.93●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3PaperBasisPathAudit_n3 : let p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3; let fullDim := QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits p); have row4 := ⟨4, ⋯⟩; have row198 := ⟨198, ⋯⟩; have col10 := ⟨10, ⋯⟩; have col138 := ⟨138, ⋯⟩; have col139 := ⟨139, ⋯⟩; have col186 := ⟨186, ⋯⟩; have col187 := ⟨187, ⋯⟩; have col214 := ⟨214, ⋯⟩; have col215 := ⟨215, ⋯⟩; QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3PaperBasisIndex p 0 2 = 4 ∧ QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3PaperBasisIndex p 0 5 = 10 ∧ List.map (fun gateMatrix => gateMatrix.gate) (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).circuitSemantics.gateMatrices = QuantumBlockEncoding.GHL2025.oneTermRobinCircuit ∧ List.map (fun gateMatrix => gateMatrix.unitary.proved) (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).circuitSemantics.gateMatrices = [true, false, false, false, false, true, false] ∧ QuantumBlockEncoding.GHL2025.indicatorOracleImage p 10 = 138 ∧ QuantumBlockEncoding.GHL2025.indicatorOracleMatrix p col138 col10 = QuantumBlockEncoding.Coeff.rat 1 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p 138).indicatorBit = 1 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p 138).ancillaBit = 0 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p 138).rowValue = 5 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p 138).sparseIndexValue = 0 ∧ QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTRotationMatrix p col138 col138 = QuantumBlockEncoding.Coeff.symbol "odts_cos_half_5_0" ∧ QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTRotationMatrix p col139 col138 = QuantumBlockEncoding.Coeff.symbol "odts_sin_half_5_0" ∧ QuantumBlockEncoding.GHL2025.boundaryRotationMatrix p col138 col138 = QuantumBlockEncoding.Coeff.rat 1 ∧ QuantumBlockEncoding.GHL2025.boundaryRotationMatrix p col139 col139 = QuantumBlockEncoding.Coeff.rat 1 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperImage p 138 = 186 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperImage p 139 = 187 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperMatrix p col186 col138 = QuantumBlockEncoding.Coeff.rat 1 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperMatrix p col187 col139 = QuantumBlockEncoding.Coeff.rat 1 ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p 186).odRegisterValue = 3 ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p 186).rowValue = 5 ∧ (QuantumBlockEncoding.GHL2025.functionOraclePaperImage p 186).cleanBranchBasisIndex = 186 ∧ (QuantumBlockEncoding.GHL2025.functionOraclePaperImage p 186).cleanBranchSystemValue = 5 ∧ (QuantumBlockEncoding.GHL2025.functionOraclePaperImage p 186).cleanBranchAmplitude = (QuantumBlockEncoding.Coeff.symbol "f_3_5").mul (QuantumBlockEncoding.Coeff.symbol "N_f_inv") ∧ QuantumBlockEncoding.GHL2025.functionOraclePaperMatrix p col186 col186 = (QuantumBlockEncoding.Coeff.symbol "f_3_5").mul (QuantumBlockEncoding.Coeff.symbol "N_f_inv") ∧ QuantumBlockEncoding.GHL2025.swapOracleImage p 186 = 214 ∧ QuantumBlockEncoding.GHL2025.swapOracleImage p 187 = 215 ∧ QuantumBlockEncoding.GHL2025.swapOracleMatrix p col214 col186 = QuantumBlockEncoding.Coeff.rat 1 ∧ QuantumBlockEncoding.GHL2025.swapOracleMatrix p col215 col187 = QuantumBlockEncoding.Coeff.rat 1 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperPostSwapPreimageCandidate p 138 = 198 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperImage p 198 = 214 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperDaggerMatrix p row198 col214 = QuantumBlockEncoding.Coeff.rat 1 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperDaggerMatrix p row4 col214 = QuantumBlockEncoding.Coeff.rat 0 ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p 214).rowValue = 3 ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p 198).rowValue = 3 ∧ 198 ≠ 4 ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProductToCoefficientObligation 3 ⟨2, ⋯⟩ ⟨5, ⋯⟩).proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).oracleComposition.lcuCorrect.proved = false ∧ ⋯.proved = false ∧ ⋯ = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).theoremData.obligations.blockExtraction.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3PaperBasisPathAudit_n3 : let p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3; let fullDim := QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits p); have row4 := ⟨4, ⋯⟩; have row198 := ⟨198, ⋯⟩; have col10 := ⟨10, ⋯⟩; have col138 := ⟨138, ⋯⟩; have col139 := ⟨139, ⋯⟩; have col186 := ⟨186, ⋯⟩; have col187 := ⟨187, ⋯⟩; have col214 := ⟨214, ⋯⟩; have col215 := ⟨215, ⋯⟩; QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3PaperBasisIndex p 0 2 = 4 ∧ QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3PaperBasisIndex p 0 5 = 10 ∧ List.map (fun gateMatrix => gateMatrix.gate) (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).circuitSemantics.gateMatrices = QuantumBlockEncoding.GHL2025.oneTermRobinCircuit ∧ List.map (fun gateMatrix => gateMatrix.unitary.proved) (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).circuitSemantics.gateMatrices = [true, false, false, false, false, true, false] ∧ QuantumBlockEncoding.GHL2025.indicatorOracleImage p 10 = 138 ∧ QuantumBlockEncoding.GHL2025.indicatorOracleMatrix p col138 col10 = QuantumBlockEncoding.Coeff.rat 1 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p 138).indicatorBit = 1 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p 138).ancillaBit = 0 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p 138).rowValue = 5 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p 138).sparseIndexValue = 0 ∧ QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTRotationMatrix p col138 col138 = QuantumBlockEncoding.Coeff.symbol "odts_cos_half_5_0" ∧ QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTRotationMatrix p col139 col138 = QuantumBlockEncoding.Coeff.symbol "odts_sin_half_5_0" ∧ QuantumBlockEncoding.GHL2025.boundaryRotationMatrix p col138 col138 = QuantumBlockEncoding.Coeff.rat 1 ∧ QuantumBlockEncoding.GHL2025.boundaryRotationMatrix p col139 col139 = QuantumBlockEncoding.Coeff.rat 1 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperImage p 138 = 186 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperImage p 139 = 187 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperMatrix p col186 col138 = QuantumBlockEncoding.Coeff.rat 1 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperMatrix p col187 col139 = QuantumBlockEncoding.Coeff.rat 1 ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p 186).odRegisterValue = 3 ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p 186).rowValue = 5 ∧ (QuantumBlockEncoding.GHL2025.functionOraclePaperImage p 186).cleanBranchBasisIndex = 186 ∧ (QuantumBlockEncoding.GHL2025.functionOraclePaperImage p 186).cleanBranchSystemValue = 5 ∧ (QuantumBlockEncoding.GHL2025.functionOraclePaperImage p 186).cleanBranchAmplitude = (QuantumBlockEncoding.Coeff.symbol "f_3_5").mul (QuantumBlockEncoding.Coeff.symbol "N_f_inv") ∧ QuantumBlockEncoding.GHL2025.functionOraclePaperMatrix p col186 col186 = (QuantumBlockEncoding.Coeff.symbol "f_3_5").mul (QuantumBlockEncoding.Coeff.symbol "N_f_inv") ∧ QuantumBlockEncoding.GHL2025.swapOracleImage p 186 = 214 ∧ QuantumBlockEncoding.GHL2025.swapOracleImage p 187 = 215 ∧ QuantumBlockEncoding.GHL2025.swapOracleMatrix p col214 col186 = QuantumBlockEncoding.Coeff.rat 1 ∧ QuantumBlockEncoding.GHL2025.swapOracleMatrix p col215 col187 = QuantumBlockEncoding.Coeff.rat 1 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperPostSwapPreimageCandidate p 138 = 198 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperImage p 198 = 214 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperDaggerMatrix p row198 col214 = QuantumBlockEncoding.Coeff.rat 1 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperDaggerMatrix p row4 col214 = QuantumBlockEncoding.Coeff.rat 0 ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p 214).rowValue = 3 ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p 198).rowValue = 3 ∧ 198 ≠ 4 ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProductToCoefficientObligation 3 ⟨2, ⋯⟩ ⟨5, ⋯⟩).proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).oracleComposition.lcuCorrect.proved = false ∧ ⋯.proved = false ∧ ⋯ = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).theoremData.obligations.blockExtraction.proved = false
Focused Fig. 1-term Robin path audit for the clean `gamma3` paper-basis endpoints at `n = 3`. Starting from the paper clean-column index `10`, the ket-zero branch follows the active seven-gate images to final dagger row `198`, not to the paper clean-row index `4`. The first decisive drift is the active `O_D^BS` sparse-slot-zero address: after `U_indic` and the identity `Ry_boundary` branch, it writes address `3`, so SWAP exposes system row `3` before the dagger cleanup. This is a path-state audit only; it does not apply the unique-path product lemma and does not promote any semantic proof flag.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route gamma 3 sparse slot alignment n 3”; its local proof does not by itself complete the broader paper route. Sparse-slot alignment audit for the focused 'n = 3' gamma3 coefficient 'D_{2,5}'.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Sparse-slot alignment audit for the focused 'n = 3' gamma3 coefficient 'D_{2,5}'. The slot-zero paper-basis path remains useful negative evidence: it maps source column '5' to address '3', so it cannot be the route for target row '2'. The finite global-slot table instead selects slot '5', the '-3' diagonal, for the coefficient from source column '5' to target row '2'. This theorem only chooses the slot and clean endpoint data needed by the next path isolation packet; it does not apply the unique-path multiplication lemma or promote any semantic proof flag.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:4646. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.94●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3SparseSlotAlignment_n3 : let p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3; let fullDim := QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits p); have slot0Col := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3PaperBasisIndex p 0 5; have slot5Row := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3PaperBasisIndex p 5 2; have slot5Col := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3PaperBasisIndex p 5 5; have slot5Image := QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperImage p slot5Col; have row4 := ⟨4, ⋯⟩; have col214 := ⟨214, ⋯⟩; QuantumBlockEncoding.GHL2025.oneTermRobinGlobalSparseOffset 3 0 = 6 ∧ QuantumBlockEncoding.GHL2025.oneTermRobinGlobalSparseAddress 3 0 5 = 3 ∧ QuantumBlockEncoding.GHL2025.oneTermRobinGlobalSparseOffset 3 5 = 5 ∧ QuantumBlockEncoding.GHL2025.oneTermRobinGlobalSparseAddress 3 5 5 = 2 ∧ QuantumBlockEncoding.GHL2025.oneTermRobinGlobalSparseAddress 3 5 5 ≠ QuantumBlockEncoding.GHL2025.oneTermRobinGlobalSparseAddress 3 0 5 ∧ QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3PaperBasisIndex p 0 5 = 10 ∧ QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3PaperBasisIndex p 5 2 = 84 ∧ QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3PaperBasisIndex p 5 5 = 90 ∧ slot5Row = 84 ∧ slot5Col = 90 ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p slot5Col).rowValue = 5 ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p slot5Col).paddedZeroValue = 0 ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p slot5Col).sparseIndexValue = 5 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource p slot5Col = true ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperAddress p slot5Col = 2 ∧ slot5Image = 42 ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p slot5Image).rowValue = 5 ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p slot5Image).odRegisterValue = 2 ∧ QuantumBlockEncoding.GHL2025.swapOracleImage p slot5Image = slot5Row ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p slot5Row).rowValue = 2 ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p slot5Row).paddedZeroValue = 0 ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p slot5Row).sparseIndexValue = 5 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource p slot5Row = true ∧ QuantumBlockEncoding.GHL2025.indicatorOracleImage p slot5Col = 218 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p 218).rowValue = 5 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p 218).sparseIndexValue = 5 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperAddress p slot0Col = 3 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperImage p 138 = 186 ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p 186).odRegisterValue = 3 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperPostSwapPreimageCandidate p 138 = 198 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperImage p 198 = 214 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperDaggerMatrix p row4 col214 = QuantumBlockEncoding.Coeff.rat 0 ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProductToCoefficientObligation 3 ⟨2, ⋯⟩ ⟨5, ⋯⟩).proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).theoremData.obligations.blockExtraction.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3SparseSlotAlignment_n3 : let p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3; let fullDim := QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits p); have slot0Col := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3PaperBasisIndex p 0 5; have slot5Row := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3PaperBasisIndex p 5 2; have slot5Col := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3PaperBasisIndex p 5 5; have slot5Image := QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperImage p slot5Col; have row4 := ⟨4, ⋯⟩; have col214 := ⟨214, ⋯⟩; QuantumBlockEncoding.GHL2025.oneTermRobinGlobalSparseOffset 3 0 = 6 ∧ QuantumBlockEncoding.GHL2025.oneTermRobinGlobalSparseAddress 3 0 5 = 3 ∧ QuantumBlockEncoding.GHL2025.oneTermRobinGlobalSparseOffset 3 5 = 5 ∧ QuantumBlockEncoding.GHL2025.oneTermRobinGlobalSparseAddress 3 5 5 = 2 ∧ QuantumBlockEncoding.GHL2025.oneTermRobinGlobalSparseAddress 3 5 5 ≠ QuantumBlockEncoding.GHL2025.oneTermRobinGlobalSparseAddress 3 0 5 ∧ QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3PaperBasisIndex p 0 5 = 10 ∧ QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3PaperBasisIndex p 5 2 = 84 ∧ QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3PaperBasisIndex p 5 5 = 90 ∧ slot5Row = 84 ∧ slot5Col = 90 ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p slot5Col).rowValue = 5 ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p slot5Col).paddedZeroValue = 0 ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p slot5Col).sparseIndexValue = 5 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource p slot5Col = true ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperAddress p slot5Col = 2 ∧ slot5Image = 42 ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p slot5Image).rowValue = 5 ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p slot5Image).odRegisterValue = 2 ∧ QuantumBlockEncoding.GHL2025.swapOracleImage p slot5Image = slot5Row ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p slot5Row).rowValue = 2 ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p slot5Row).paddedZeroValue = 0 ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p slot5Row).sparseIndexValue = 5 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource p slot5Row = true ∧ QuantumBlockEncoding.GHL2025.indicatorOracleImage p slot5Col = 218 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p 218).rowValue = 5 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p 218).sparseIndexValue = 5 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperAddress p slot0Col = 3 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperImage p 138 = 186 ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p 186).odRegisterValue = 3 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperPostSwapPreimageCandidate p 138 = 198 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperImage p 198 = 214 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperDaggerMatrix p row4 col214 = QuantumBlockEncoding.Coeff.rat 0 ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProductToCoefficientObligation 3 ⟨2, ⋯⟩ ⟨5, ⋯⟩).proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).theoremData.obligations.blockExtraction.proved = false
Sparse-slot alignment audit for the focused `n = 3` gamma3 coefficient `D_{2,5}`. The slot-zero paper-basis path remains useful negative evidence: it maps source column `5` to address `3`, so it cannot be the route for target row `2`. The finite global-slot table instead selects slot `5`, the `-3` diagonal, for the coefficient from source column `5` to target row `2`. This theorem only chooses the slot and clean endpoint data needed by the next path isolation packet; it does not apply the unique-path multiplication lemma or promote any semantic proof flag.
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 projection slot convention obligation”. Source-contract obligation for the gamma3 projection-slot convention.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Source-contract obligation for the gamma3 projection-slot convention. Eq. 'ROBIN clarified' sums the clean 'gamma3' branch over sparse slots. The finite path audit for a matrix entry therefore needs an interface that relates the slot-specific clean basis state with 's' satisfying 'r_{s,j}=i' to the theorem-level signal-zero block projection or sparse-register summation. This declaration names that missing convention without proving it.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:4715. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.95●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProjectionSlotConventionObligation (n : ℕ) (_i _j : Fin (QuantumBlockEncoding.gridSize n)) : QuantumBlockEncoding.SemanticObligation
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProjectionSlotConventionObligation (n : ℕ) (_i _j : Fin (QuantumBlockEncoding.gridSize n)) : QuantumBlockEncoding.SemanticObligation
Source-contract obligation for the gamma3 projection-slot convention. Eq. `ROBIN clarified` sums the clean `gamma3` branch over sparse slots. The finite path audit for a matrix entry therefore needs an interface that relates the slot-specific clean basis state with `s` satisfying `r_{s,j}=i` to the theorem-level signal-zero block projection or sparse-register summation. This declaration names that missing convention without proving it.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 projection slot convention obligation transcript”; its local proof does not by itself complete the broader paper route.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The source declaration has no docstring. The reader cue above is generated from its kind and name and does not replace the Lean signature.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:4723. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.96●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProjectionSlotConventionObligation_transcript (n : ℕ) (i j : Fin (QuantumBlockEncoding.gridSize n)) : (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProjectionSlotConventionObligation n i j).source = "GHL2025 Eq. ROBIN clarified gamma3 line, Theorem one-term block-encoding, Fig. 1-term ROBIN, Definition def:block-encoding, Lemma Banded-sparse-access-oracle" ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProjectionSlotConventionObligation n i j).proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProjectionSlotConventionObligation_transcript (n : ℕ) (i j : Fin (QuantumBlockEncoding.gridSize n)) : (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProjectionSlotConventionObligation n i j).source = "GHL2025 Eq. ROBIN clarified gamma3 line, Theorem one-term block-encoding, Fig. 1-term ROBIN, Definition def:block-encoding, Lemma Banded-sparse-access-oracle" ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProjectionSlotConventionObligation n i j).proved = false
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route gamma 3 projection slot convention map n 3”; its local proof does not by itself complete the broader paper route. Focused projection-slot contract map for the compiled 'n = 3' gamma3 audit.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Focused projection-slot contract map for the compiled 'n = 3' gamma3 audit. The previous slot-alignment audit shows that the coefficient for the system entry '(2, 5)' uses sparse slot '5', not slot '0'. This theorem packages the slot-specific clean endpoints '90' and '84' and records that they are still not the generic signal-zero projection endpoints '(2, 5)'. The remaining projection-slot convention is deliberately kept as an unproved obligation.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:4740. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.97●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3ProjectionSlotConventionMap_n3 : have p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3; have sysRow := ⟨2, ⋯⟩; have sysCol := ⟨5, ⋯⟩; have projectionObligation := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProjectionSlotConventionObligation 3 sysRow sysCol; have productObligation := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProductToCoefficientObligation 3 sysRow sysCol; have projectedRow := QuantumBlockEncoding.signalSystemBlockRowIndex (QuantumBlockEncoding.gridSize 3) ↑(QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteBlockCompositionContract 3).expectedTarget.signalIndex ↑sysRow; have projectedCol := QuantumBlockEncoding.signalSystemBlockColIndex (QuantumBlockEncoding.gridSize 3) ↑(QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteBlockCompositionContract 3).expectedTarget.signalIndex ↑sysCol; have slot5Row := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3PaperBasisIndex p 5 ↑sysRow; have slot5Col := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3PaperBasisIndex p 5 ↑sysCol; projectionObligation.source = "GHL2025 Eq. ROBIN clarified gamma3 line, Theorem one-term block-encoding, Fig. 1-term ROBIN, Definition def:block-encoding, Lemma Banded-sparse-access-oracle" ∧ projectionObligation.proved = false ∧ QuantumBlockEncoding.GHL2025.oneTermRobinGlobalSparseAddress 3 5 5 = 2 ∧ projectedRow = 2 ∧ projectedCol = 5 ∧ slot5Row = 84 ∧ slot5Col = 90 ∧ slot5Row ≠ projectedRow ∧ slot5Col ≠ projectedCol ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p slot5Col).rowValue = 5 ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p slot5Col).sparseIndexValue = 5 ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p slot5Col).paddedZeroValue = 0 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource p slot5Col = true ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperAddress p slot5Col = 2 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperImage p slot5Col = 42 ∧ QuantumBlockEncoding.GHL2025.swapOracleImage p (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperImage p slot5Col) = slot5Row ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p slot5Row).rowValue = 2 ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p slot5Row).sparseIndexValue = 5 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource p slot5Row = true ∧ QuantumBlockEncoding.GHL2025.indicatorOracleImage p slot5Col = 218 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p 218).rowValue = 5 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p 218).sparseIndexValue = 5 ∧ productObligation.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).theoremData.obligations.blockExtraction.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3ProjectionSlotConventionMap_n3 : have p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3; have sysRow := ⟨2, ⋯⟩; have sysCol := ⟨5, ⋯⟩; have projectionObligation := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProjectionSlotConventionObligation 3 sysRow sysCol; have productObligation := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProductToCoefficientObligation 3 sysRow sysCol; have projectedRow := QuantumBlockEncoding.signalSystemBlockRowIndex (QuantumBlockEncoding.gridSize 3) ↑(QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteBlockCompositionContract 3).expectedTarget.signalIndex ↑sysRow; have projectedCol := QuantumBlockEncoding.signalSystemBlockColIndex (QuantumBlockEncoding.gridSize 3) ↑(QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteBlockCompositionContract 3).expectedTarget.signalIndex ↑sysCol; have slot5Row := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3PaperBasisIndex p 5 ↑sysRow; have slot5Col := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3PaperBasisIndex p 5 ↑sysCol; projectionObligation.source = "GHL2025 Eq. ROBIN clarified gamma3 line, Theorem one-term block-encoding, Fig. 1-term ROBIN, Definition def:block-encoding, Lemma Banded-sparse-access-oracle" ∧ projectionObligation.proved = false ∧ QuantumBlockEncoding.GHL2025.oneTermRobinGlobalSparseAddress 3 5 5 = 2 ∧ projectedRow = 2 ∧ projectedCol = 5 ∧ slot5Row = 84 ∧ slot5Col = 90 ∧ slot5Row ≠ projectedRow ∧ slot5Col ≠ projectedCol ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p slot5Col).rowValue = 5 ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p slot5Col).sparseIndexValue = 5 ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p slot5Col).paddedZeroValue = 0 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource p slot5Col = true ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperAddress p slot5Col = 2 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperImage p slot5Col = 42 ∧ QuantumBlockEncoding.GHL2025.swapOracleImage p (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperImage p slot5Col) = slot5Row ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p slot5Row).rowValue = 2 ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p slot5Row).sparseIndexValue = 5 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperGlobalSlotSource p slot5Row = true ∧ QuantumBlockEncoding.GHL2025.indicatorOracleImage p slot5Col = 218 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p 218).rowValue = 5 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p 218).sparseIndexValue = 5 ∧ productObligation.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).theoremData.obligations.blockExtraction.proved = false
Focused projection-slot contract map for the compiled `n = 3` gamma3 audit. The previous slot-alignment audit shows that the coefficient for the system entry `(2, 5)` uses sparse slot `5`, not slot `0`. This theorem packages the slot-specific clean endpoints `90` and `84` and records that they are still not the generic signal-zero projection endpoints `(2, 5)`. The remaining projection-slot convention is deliberately kept as an unproved obligation.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route gamma 3 slot 5 path audit n 3”; its local proof does not by itself complete the broader paper route. Focused Fig.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Focused Fig. 1-term Robin path audit for the slot-'5' clean 'gamma3' endpoints at 'n = 3'. The slot-alignment map gives the clean endpoint chain '90 -> 42 -> 84' if the path starts directly at 'O_D^BS'. The actual seven-gate circuit first applies 'U_indic', which flips the indicator bit for system column '5', so the active path starts from '218'. The ket-zero branch then reaches final dagger row '228', not the slot-specific clean row '84'. This declaration records the adjacent states only; it does not apply a product lemma or promote any semantic proof flag.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:4809. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.98●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3Slot5PathAudit_n3 : let p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3; let fullDim := QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits p); have sysRow := ⟨2, ⋯⟩; have sysCol := ⟨5, ⋯⟩; have slot5Row := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3PaperBasisIndex p 5 ↑sysRow; have slot5Col := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3PaperBasisIndex p 5 ↑sysCol; have afterIndic := QuantumBlockEncoding.GHL2025.indicatorOracleImage p slot5Col; have odtsKetOne := afterIndic + 1; have afterOdbsKetZero := QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperImage p afterIndic; have afterOdbsKetOne := QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperImage p odtsKetOne; have afterSwapKetZero := QuantumBlockEncoding.GHL2025.swapOracleImage p afterOdbsKetZero; have afterSwapKetOne := QuantumBlockEncoding.GHL2025.swapOracleImage p afterOdbsKetOne; have daggerPreKetZero := QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperPostSwapPreimageCandidate p afterIndic; have daggerPreKetOne := QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperPostSwapPreimageCandidate p odtsKetOne; have row84 := ⟨84, ⋯⟩; have row85 := ⟨85, ⋯⟩; have row228 := ⟨228, ⋯⟩; have row229 := ⟨229, ⋯⟩; have col90 := ⟨90, ⋯⟩; have col218 := ⟨218, ⋯⟩; have col219 := ⟨219, ⋯⟩; have col170 := ⟨170, ⋯⟩; have col171 := ⟨171, ⋯⟩; have col212 := ⟨212, ⋯⟩; have col213 := ⟨213, ⋯⟩; slot5Col = 90 ∧ slot5Row = 84 ∧ QuantumBlockEncoding.GHL2025.oneTermRobinGlobalSparseAddress 3 5 5 = 2 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperImage p slot5Col = 42 ∧ QuantumBlockEncoding.GHL2025.swapOracleImage p (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperImage p slot5Col) = slot5Row ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p slot5Col).indicatorBit = 0 ∧ afterIndic = 218 ∧ QuantumBlockEncoding.GHL2025.indicatorOracleMatrix p col218 col90 = QuantumBlockEncoding.Coeff.rat 1 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p afterIndic).indicatorBit = 1 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p afterIndic).ancillaBit = 0 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p afterIndic).rowValue = 5 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p afterIndic).sparseIndexValue = 5 ∧ QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTRotationMatrix p col218 col218 = QuantumBlockEncoding.Coeff.symbol "odts_cos_half_5_5" ∧ QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTRotationMatrix p col219 col218 = QuantumBlockEncoding.Coeff.symbol "odts_sin_half_5_5" ∧ QuantumBlockEncoding.GHL2025.boundaryRotationMatrix p col218 col218 = QuantumBlockEncoding.Coeff.rat 1 ∧ QuantumBlockEncoding.GHL2025.boundaryRotationMatrix p col219 col219 = QuantumBlockEncoding.Coeff.rat 1 ∧ afterOdbsKetZero = 170 ∧ afterOdbsKetOne = 171 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperMatrix p col170 col218 = QuantumBlockEncoding.Coeff.rat 1 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperMatrix p col171 col219 = QuantumBlockEncoding.Coeff.rat 1 ∧ (QuantumBlockEncoding.GHL2025.functionOraclePaperImage p afterOdbsKetZero).cleanBranchBasisIndex = afterOdbsKetZero ∧ (QuantumBlockEncoding.GHL2025.functionOraclePaperImage p afterOdbsKetZero).cleanBranchSystemValue = 5 ∧ (QuantumBlockEncoding.GHL2025.functionOraclePaperImage p afterOdbsKetZero).cleanBranchAmplitude = (QuantumBlockEncoding.Coeff.symbol "f_3_5").mul (QuantumBlockEncoding.Coeff.symbol "N_f_inv") ∧ QuantumBlockEncoding.GHL2025.functionOraclePaperMatrix p col170 col170 = (QuantumBlockEncoding.Coeff.symbol "f_3_5").mul (QuantumBlockEncoding.Coeff.symbol "N_f_inv") ∧ QuantumBlockEncoding.GHL2025.functionOraclePaperMatrix p col171 col171 = (QuantumBlockEncoding.Coeff.symbol "f_3_5").mul (QuantumBlockEncoding.Coeff.symbol "N_f_inv") ∧ afterSwapKetZero = 212 ∧ ⋯
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3Slot5PathAudit_n3 : let p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3; let fullDim := QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits p); have sysRow := ⟨2, ⋯⟩; have sysCol := ⟨5, ⋯⟩; have slot5Row := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3PaperBasisIndex p 5 ↑sysRow; have slot5Col := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3PaperBasisIndex p 5 ↑sysCol; have afterIndic := QuantumBlockEncoding.GHL2025.indicatorOracleImage p slot5Col; have odtsKetOne := afterIndic + 1; have afterOdbsKetZero := QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperImage p afterIndic; have afterOdbsKetOne := QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperImage p odtsKetOne; have afterSwapKetZero := QuantumBlockEncoding.GHL2025.swapOracleImage p afterOdbsKetZero; have afterSwapKetOne := QuantumBlockEncoding.GHL2025.swapOracleImage p afterOdbsKetOne; have daggerPreKetZero := QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperPostSwapPreimageCandidate p afterIndic; have daggerPreKetOne := QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperPostSwapPreimageCandidate p odtsKetOne; have row84 := ⟨84, ⋯⟩; have row85 := ⟨85, ⋯⟩; have row228 := ⟨228, ⋯⟩; have row229 := ⟨229, ⋯⟩; have col90 := ⟨90, ⋯⟩; have col218 := ⟨218, ⋯⟩; have col219 := ⟨219, ⋯⟩; have col170 := ⟨170, ⋯⟩; have col171 := ⟨171, ⋯⟩; have col212 := ⟨212, ⋯⟩; have col213 := ⟨213, ⋯⟩; slot5Col = 90 ∧ slot5Row = 84 ∧ QuantumBlockEncoding.GHL2025.oneTermRobinGlobalSparseAddress 3 5 5 = 2 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperImage p slot5Col = 42 ∧ QuantumBlockEncoding.GHL2025.swapOracleImage p (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperImage p slot5Col) = slot5Row ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p slot5Col).indicatorBit = 0 ∧ afterIndic = 218 ∧ QuantumBlockEncoding.GHL2025.indicatorOracleMatrix p col218 col90 = QuantumBlockEncoding.Coeff.rat 1 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p afterIndic).indicatorBit = 1 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p afterIndic).ancillaBit = 0 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p afterIndic).rowValue = 5 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p afterIndic).sparseIndexValue = 5 ∧ QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTRotationMatrix p col218 col218 = QuantumBlockEncoding.Coeff.symbol "odts_cos_half_5_5" ∧ QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTRotationMatrix p col219 col218 = QuantumBlockEncoding.Coeff.symbol "odts_sin_half_5_5" ∧ QuantumBlockEncoding.GHL2025.boundaryRotationMatrix p col218 col218 = QuantumBlockEncoding.Coeff.rat 1 ∧ QuantumBlockEncoding.GHL2025.boundaryRotationMatrix p col219 col219 = QuantumBlockEncoding.Coeff.rat 1 ∧ afterOdbsKetZero = 170 ∧ afterOdbsKetOne = 171 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperMatrix p col170 col218 = QuantumBlockEncoding.Coeff.rat 1 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperMatrix p col171 col219 = QuantumBlockEncoding.Coeff.rat 1 ∧ (QuantumBlockEncoding.GHL2025.functionOraclePaperImage p afterOdbsKetZero).cleanBranchBasisIndex = afterOdbsKetZero ∧ (QuantumBlockEncoding.GHL2025.functionOraclePaperImage p afterOdbsKetZero).cleanBranchSystemValue = 5 ∧ (QuantumBlockEncoding.GHL2025.functionOraclePaperImage p afterOdbsKetZero).cleanBranchAmplitude = (QuantumBlockEncoding.Coeff.symbol "f_3_5").mul (QuantumBlockEncoding.Coeff.symbol "N_f_inv") ∧ QuantumBlockEncoding.GHL2025.functionOraclePaperMatrix p col170 col170 = (QuantumBlockEncoding.Coeff.symbol "f_3_5").mul (QuantumBlockEncoding.Coeff.symbol "N_f_inv") ∧ QuantumBlockEncoding.GHL2025.functionOraclePaperMatrix p col171 col171 = (QuantumBlockEncoding.Coeff.symbol "f_3_5").mul (QuantumBlockEncoding.Coeff.symbol "N_f_inv") ∧ afterSwapKetZero = 212 ∧ ⋯
Focused Fig. 1-term Robin path audit for the slot-`5` clean `gamma3` endpoints at `n = 3`. The slot-alignment map gives the clean endpoint chain `90 -> 42 -> 84` if the path starts directly at `O_D^BS`. The actual seven-gate circuit first applies `U_indic`, which flips the indicator bit for system column `5`, so the active path starts from `218`. The ket-zero branch then reaches final dagger row `228`, not the slot-specific clean row `84`. This declaration records the adjacent states only; it does not apply a product lemma or promote any semantic proof flag.
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 slot 5 projection register audit check n 3”. Executable field check for the slot-'5' gamma3 projection/register audit.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Executable field check for the slot-'5' gamma3 projection/register audit. The checked path is the ket-zero branch '90 -> 218 -> 218 -> 218 -> 170 -> 170 -> 212 -> 228'. The Boolean records the indicator, ancilla, system-row, padded-zero, sparse-index, 'm_f' workspace, and active-source fields for the clean source, adjacent states, final endpoint, and clean Eq. ROBIN endpoint.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:4923. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.99●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3Slot5ProjectionRegisterAuditCheck_n3 : Bool
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3Slot5ProjectionRegisterAuditCheck_n3 : Bool
Executable field check for the slot-`5` gamma3 projection/register audit. The checked path is the ket-zero branch `90 -> 218 -> 218 -> 218 -> 170 -> 170 -> 212 -> 228`. The Boolean records the indicator, ancilla, system-row, padded-zero, sparse-index, `m_f` workspace, and active-source fields for the clean source, adjacent states, final endpoint, and clean Eq. ROBIN endpoint.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route gamma 3 slot 5 projection register audit n 3”; its local proof does not by itself complete the broader paper route. Projection/register audit for the slot-'5' gamma3 path at 'n = 3'.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Projection/register audit for the slot-'5' gamma3 path at 'n = 3'. The first field-level mismatch between the final seven-gate endpoint '228' and the clean Eq. ROBIN endpoint '84' is the indicator bit: the full path keeps the bulk indicator set to '1', while the clean endpoint has indicator bit '0'. The sparse-index field also differs ('6' versus '5'). No semantic proof flag is promoted.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:5066. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.100●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3Slot5ProjectionRegisterAudit_n3 : QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3Slot5ProjectionRegisterAuditCheck_n3 = true ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProjectionSlotConventionObligation 3 ⟨2, ⋯⟩ ⟨5, ⋯⟩).proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProductToCoefficientObligation 3 ⟨2, ⋯⟩ ⟨5, ⋯⟩).proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).theoremData.obligations.blockExtraction.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3Slot5ProjectionRegisterAudit_n3 : QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3Slot5ProjectionRegisterAuditCheck_n3 = true ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProjectionSlotConventionObligation 3 ⟨2, ⋯⟩ ⟨5, ⋯⟩).proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProductToCoefficientObligation 3 ⟨2, ⋯⟩ ⟨5, ⋯⟩).proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).theoremData.obligations.blockExtraction.proved = false
Projection/register audit for the slot-`5` gamma3 path at `n = 3`. The first field-level mismatch between the final seven-gate endpoint `228` and the clean Eq. ROBIN endpoint `84` is the indicator bit: the full path keeps the bulk indicator set to `1`, while the clean endpoint has indicator bit `0`. The sparse-index field also differs (`6` versus `5`). No semantic proof flag is promoted.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 projection register convention decision”. A proposition-valued field is a requirement until a constructor supplies it. Middle-agent decision record for the blocked gamma3 projection/register convention at 'n = 3'.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Middle-agent decision record for the blocked gamma3 projection/register convention at 'n = 3'. The source transcript provides Eq. ROBIN clarified, Fig. 1-term ROBIN, and the block-encoding projection definition, but it does not specify the finite basis bridge that would identify the full seven-gate endpoint '228' with the clean slot-'5' endpoint '84'. This record keeps product search blocked until that convention is stated precisely.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:5098. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.101●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3ProjectionRegisterConventionDecision : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3ProjectionRegisterConventionDecision : Type
Middle-agent decision record for the blocked gamma3 projection/register convention at `n = 3`. The source transcript provides Eq. ROBIN clarified, Fig. 1-term ROBIN, and the block-encoding projection definition, but it does not specify the finite basis bridge that would identify the full seven-gate endpoint `228` with the clean slot-`5` endpoint `84`. This record keeps product search blocked until that convention is stated precisely.
Fields
sourceAnchor : String
cleanEndpoint : ℕ
fullEndpoint : ℕ
firstMismatch : String
secondaryMismatch : String
classification : String
requiredDecision : QuantumBlockEncoding.SemanticObligation
auditCheck : Bool
productSearchBlocked : Bool
projectionSlotConventionProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 projection register convention decision n 3”. The focused gamma3 endpoint mismatch is a source-contract gap, not a finite matrix multiplication target.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The focused gamma3 endpoint mismatch is a source-contract gap, not a finite matrix multiplication target.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:5119. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.102●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProjectionRegisterConventionDecision_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3ProjectionRegisterConventionDecision
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProjectionRegisterConventionDecision_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3ProjectionRegisterConventionDecision
The focused gamma3 endpoint mismatch is a source-contract gap, not a finite matrix multiplication target.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 projection register convention decision n 3 transcript”; its local proof does not by itself complete the broader paper route. Transcript theorem for the middle decision record.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Transcript theorem for the middle decision record. This theorem deliberately preserves the false semantic flags. It only records that the compiled register audit has converted the next step into a projection/register convention decision before any product-to-coefficient proof search may continue.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:5160. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.103●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProjectionRegisterConventionDecision_n3_transcript : have decision := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProjectionRegisterConventionDecision_n3; decision.auditCheck = true ∧ decision.cleanEndpoint = 84 ∧ decision.fullEndpoint = 228 ∧ decision.firstMismatch = "indicator bit: full endpoint has 1, clean endpoint has 0" ∧ decision.secondaryMismatch = "sparse-index value: full endpoint has 6, clean endpoint has 5" ∧ decision.classification = "source-contract-gap plus internal-paper-step" ∧ decision.requiredDecision.proved = false ∧ decision.productSearchBlocked = true ∧ decision.projectionSlotConventionProved = false ∧ decision.productToCoefficientProved = false ∧ decision.lcuCorrectProved = false ∧ decision.blockProjectionProved = false ∧ decision.blockCorrectProved = false ∧ decision.finalExtractionProved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProjectionRegisterConventionDecision_n3_transcript : have decision := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProjectionRegisterConventionDecision_n3; decision.auditCheck = true ∧ decision.cleanEndpoint = 84 ∧ decision.fullEndpoint = 228 ∧ decision.firstMismatch = "indicator bit: full endpoint has 1, clean endpoint has 0" ∧ decision.secondaryMismatch = "sparse-index value: full endpoint has 6, clean endpoint has 5" ∧ decision.classification = "source-contract-gap plus internal-paper-step" ∧ decision.requiredDecision.proved = false ∧ decision.productSearchBlocked = true ∧ decision.projectionSlotConventionProved = false ∧ decision.productToCoefficientProved = false ∧ decision.lcuCorrectProved = false ∧ decision.blockProjectionProved = false ∧ decision.blockCorrectProved = false ∧ decision.finalExtractionProved = false
Transcript theorem for the middle decision record. This theorem deliberately preserves the false semantic flags. It only records that the compiled register audit has converted the next step into a projection/register convention decision before any product-to-coefficient proof search may continue.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 sparse register summation convention”. A proposition-valued field is a requirement until a constructor supplies it. Chosen theorem-facing convention for the focused 'n = 3' gamma3 entry.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Chosen theorem-facing convention for the focused 'n = 3' gamma3 entry. Eq. 'ROBIN clarified' writes the gamma3 contribution as a sum over sparse slots, so the next interface selects sparse-register summation. The compiled slot-'5' audit also found an indicator-bit mismatch between the full endpoint '228' and the clean endpoint '84'; that mismatch is kept as a separate false obligation instead of being hidden by the summation choice.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:5193. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.104●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3SparseRegisterSummationConvention : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3SparseRegisterSummationConvention : Type
Chosen theorem-facing convention for the focused `n = 3` gamma3 entry. Eq. `ROBIN clarified` writes the gamma3 contribution as a sum over sparse slots, so the next interface selects sparse-register summation. The compiled slot-`5` audit also found an indicator-bit mismatch between the full endpoint `228` and the clean endpoint `84`; that mismatch is kept as a separate false obligation instead of being hidden by the summation choice.
Fields
sourceAnchor : String
chosenConvention : String
summedSlotRange : String
cleanEndpoint : ℕ
fullEndpoint : ℕ
cleanSystemRow : ℕ
fullSystemRow : ℕ
cleanIndicator : ℕ
fullIndicator : ℕ
cleanSparseIndex : ℕ
fullSparseIndex : ℕ
systemRowAgrees : Bool
sparseRegisterSummationSelected : Bool
indicatorMismatchHandledBySummation : Bool
indicatorMismatchObligation : QuantumBlockEncoding.SemanticObligation
decision : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3ProjectionRegisterConventionDecision
auditCheck : Bool
projectionSlotConventionProved : Bool
productToCoefficientProved : Bool
productSearchBlocked : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 sparse register summation convention n 3”. Sparse-register summation convention selected for the slot-'5' gamma3 audit.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Sparse-register summation convention selected for the slot-'5' gamma3 audit. This is a contract map only. It records the source-supported summation over 's = 0, ..., kappa - 1', but it does not prove that the current block projection implements that summation. The indicator mismatch remains open.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:5226. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.105●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3SparseRegisterSummationConvention_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3SparseRegisterSummationConvention
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3SparseRegisterSummationConvention_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3SparseRegisterSummationConvention
Sparse-register summation convention selected for the slot-`5` gamma3 audit. This is a contract map only. It records the source-supported summation over `s = 0, ..., kappa - 1`, but it does not prove that the current block projection implements that summation. The indicator mismatch remains open.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 sparse register summation convention n 3 transcript”; its local proof does not by itself complete the broader paper route. Transcript theorem for the selected sparse-register summation convention.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Transcript theorem for the selected sparse-register summation convention. The theorem proves only the compiled contract map and endpoint facts. It keeps product-to-coefficient search blocked and preserves all semantic false flags.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:5290. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.106●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3SparseRegisterSummationConvention_n3_transcript : have convention := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3SparseRegisterSummationConvention_n3; convention.chosenConvention = "sparse-register summation" ∧ convention.summedSlotRange = "s = 0..kappa-1" ∧ convention.sparseRegisterSummationSelected = true ∧ convention.auditCheck = true ∧ convention.cleanEndpoint = 84 ∧ convention.fullEndpoint = 228 ∧ convention.cleanSystemRow = 2 ∧ convention.fullSystemRow = 2 ∧ convention.systemRowAgrees = true ∧ convention.cleanIndicator = 0 ∧ convention.fullIndicator = 1 ∧ convention.indicatorMismatchHandledBySummation = false ∧ convention.indicatorMismatchObligation.proved = false ∧ convention.cleanSparseIndex = 5 ∧ convention.fullSparseIndex = 6 ∧ convention.decision.productSearchBlocked = true ∧ convention.projectionSlotConventionProved = false ∧ convention.productToCoefficientProved = false ∧ convention.productSearchBlocked = true ∧ convention.lcuCorrectProved = false ∧ convention.blockProjectionProved = false ∧ convention.blockCorrectProved = false ∧ convention.finalExtractionProved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3SparseRegisterSummationConvention_n3_transcript : have convention := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3SparseRegisterSummationConvention_n3; convention.chosenConvention = "sparse-register summation" ∧ convention.summedSlotRange = "s = 0..kappa-1" ∧ convention.sparseRegisterSummationSelected = true ∧ convention.auditCheck = true ∧ convention.cleanEndpoint = 84 ∧ convention.fullEndpoint = 228 ∧ convention.cleanSystemRow = 2 ∧ convention.fullSystemRow = 2 ∧ convention.systemRowAgrees = true ∧ convention.cleanIndicator = 0 ∧ convention.fullIndicator = 1 ∧ convention.indicatorMismatchHandledBySummation = false ∧ convention.indicatorMismatchObligation.proved = false ∧ convention.cleanSparseIndex = 5 ∧ convention.fullSparseIndex = 6 ∧ convention.decision.productSearchBlocked = true ∧ convention.projectionSlotConventionProved = false ∧ convention.productToCoefficientProved = false ∧ convention.productSearchBlocked = true ∧ convention.lcuCorrectProved = false ∧ convention.blockProjectionProved = false ∧ convention.blockCorrectProved = false ∧ convention.finalExtractionProved = false
Transcript theorem for the selected sparse-register summation convention. The theorem proves only the compiled contract map and endpoint facts. It keeps product-to-coefficient search blocked and preserves all semantic false flags.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 sparse register summation indicator gap n 3”; its local proof does not by itself complete the broader paper route. Indicator-field gap after selecting sparse-register summation.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Indicator-field gap after selecting sparse-register summation. The sparse-register summation convention is source-backed by Eq. 'ROBIN clarified', but it does not explain why the full seven-gate endpoint keeps the indicator bit set. This theorem packages that remaining field-level source contract gap and keeps product-to-coefficient search blocked.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:5330. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.107●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3SparseRegisterSummation_indicatorGap_n3 : have convention := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3SparseRegisterSummationConvention_n3; convention.chosenConvention = "sparse-register summation" ∧ convention.indicatorMismatchHandledBySummation = false ∧ convention.indicatorMismatchObligation.description = "indicator-bit mismatch between full endpoint 228 and clean endpoint 84 must be handled by a separate projection/register convention; sparse-register summation alone does not close it" ∧ convention.indicatorMismatchObligation.source = "GHL2025 Eq. ROBIN clarified, Fig. 1-term ROBIN; QBE slot-5 projection/register audit" ∧ convention.indicatorMismatchObligation.proved = false ∧ convention.cleanEndpoint = 84 ∧ convention.fullEndpoint = 228 ∧ convention.cleanSystemRow = convention.fullSystemRow ∧ convention.systemRowAgrees = true ∧ convention.cleanIndicator = 0 ∧ convention.fullIndicator = 1 ∧ convention.cleanIndicator ≠ convention.fullIndicator ∧ convention.cleanSparseIndex = 5 ∧ convention.fullSparseIndex = 6 ∧ convention.productSearchBlocked = true ∧ convention.projectionSlotConventionProved = false ∧ convention.productToCoefficientProved = false ∧ convention.lcuCorrectProved = false ∧ convention.blockProjectionProved = false ∧ convention.blockCorrectProved = false ∧ convention.finalExtractionProved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).theoremData.obligations.blockExtraction.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3SparseRegisterSummation_indicatorGap_n3 : have convention := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3SparseRegisterSummationConvention_n3; convention.chosenConvention = "sparse-register summation" ∧ convention.indicatorMismatchHandledBySummation = false ∧ convention.indicatorMismatchObligation.description = "indicator-bit mismatch between full endpoint 228 and clean endpoint 84 must be handled by a separate projection/register convention; sparse-register summation alone does not close it" ∧ convention.indicatorMismatchObligation.source = "GHL2025 Eq. ROBIN clarified, Fig. 1-term ROBIN; QBE slot-5 projection/register audit" ∧ convention.indicatorMismatchObligation.proved = false ∧ convention.cleanEndpoint = 84 ∧ convention.fullEndpoint = 228 ∧ convention.cleanSystemRow = convention.fullSystemRow ∧ convention.systemRowAgrees = true ∧ convention.cleanIndicator = 0 ∧ convention.fullIndicator = 1 ∧ convention.cleanIndicator ≠ convention.fullIndicator ∧ convention.cleanSparseIndex = 5 ∧ convention.fullSparseIndex = 6 ∧ convention.productSearchBlocked = true ∧ convention.projectionSlotConventionProved = false ∧ convention.productToCoefficientProved = false ∧ convention.lcuCorrectProved = false ∧ convention.blockProjectionProved = false ∧ convention.blockCorrectProved = false ∧ convention.finalExtractionProved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).theoremData.obligations.blockExtraction.proved = false
Indicator-field gap after selecting sparse-register summation. The sparse-register summation convention is source-backed by Eq. `ROBIN clarified`, but it does not explain why the full seven-gate endpoint keeps the indicator bit set. This theorem packages that remaining field-level source contract gap and keeps product-to-coefficient search blocked.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 indicator projection convention”. A proposition-valued field is a requirement until a constructor supplies it. Indicator-field projection/register convention for the focused 'n = 3' gamma3 endpoint pair.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Indicator-field projection/register convention for the focused 'n = 3' gamma3 endpoint pair. After sparse-register summation has been selected, the remaining question is whether the theorem-level block projection sums, ignores, resets, or permutes the indicator field that differs between full endpoint '228' and clean endpoint '84'. The GHL2025 transcript has not yet supplied that rule, so the convention is recorded as a false source-contract obligation rather than a product proof.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:5378. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.108●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3IndicatorProjectionConvention : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3IndicatorProjectionConvention : Type
Indicator-field projection/register convention for the focused `n = 3` gamma3 endpoint pair. After sparse-register summation has been selected, the remaining question is whether the theorem-level block projection sums, ignores, resets, or permutes the indicator field that differs between full endpoint `228` and clean endpoint `84`. The GHL2025 transcript has not yet supplied that rule, so the convention is recorded as a false source-contract obligation rather than a product proof.
Fields
sourceAnchor : String
cleanEndpoint : ℕ
fullEndpoint : ℕ
cleanIndicator : ℕ
fullIndicator : ℕ
indicatorRelationSpecifiedBySource : Bool
humanInputRequired : Bool
requiredConvention : String
conventionObligation : QuantumBlockEncoding.SemanticObligation
sparseSummationConvention : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3SparseRegisterSummationConvention
projectionDecision : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3ProjectionRegisterConventionDecision
productSearchBlocked : Bool
indicatorMismatchObligationProved : Bool
projectionSlotConventionProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 indicator projection convention n 3”. The active gamma3 indicator convention is still an explicit source-contract gap.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The active gamma3 indicator convention is still an explicit source-contract gap. This declaration is deliberately theorem-facing but not a semantic proof. It reuses the sparse-register summation gap and keeps all block-encoding flags false until a source-backed projection/register rule is stated.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:5406. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.109●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3IndicatorProjectionConvention_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3IndicatorProjectionConvention
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3IndicatorProjectionConvention_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3IndicatorProjectionConvention
The active gamma3 indicator convention is still an explicit source-contract gap. This declaration is deliberately theorem-facing but not a semantic proof. It reuses the sparse-register summation gap and keeps all block-encoding flags false until a source-backed projection/register rule is stated.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 indicator projection convention n 3 transcript”; its local proof does not by itself complete the broader paper route. Transcript theorem for the active gamma3 indicator convention.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Transcript theorem for the active gamma3 indicator convention. The theorem packages the endpoint and false-obligation facts needed by the next proof step. It does not identify endpoints '228' and '84', and it does not promote product-to-coefficient, LCU, projection, block, or final extraction flags.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:5456. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.110●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3IndicatorProjectionConvention_n3_transcript : have convention := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3IndicatorProjectionConvention_n3; convention.cleanEndpoint = 84 ∧ convention.fullEndpoint = 228 ∧ convention.cleanIndicator = 0 ∧ convention.fullIndicator = 1 ∧ convention.cleanIndicator ≠ convention.fullIndicator ∧ convention.indicatorRelationSpecifiedBySource = false ∧ convention.humanInputRequired = true ∧ convention.requiredConvention = "state whether the theorem projection sums, ignores, resets, or permutes the indicator field relating endpoint 228 to endpoint 84" ∧ convention.conventionObligation.source = "GHL2025 Eq. ROBIN clarified, Fig. 1-term ROBIN, Definition def:block-encoding; QBE gamma3 sparse-register summation indicator gap" ∧ convention.conventionObligation.proved = false ∧ convention.sparseSummationConvention.indicatorMismatchHandledBySummation = false ∧ convention.sparseSummationConvention.indicatorMismatchObligation.proved = false ∧ convention.projectionDecision.productSearchBlocked = true ∧ convention.productSearchBlocked = true ∧ convention.indicatorMismatchObligationProved = false ∧ convention.projectionSlotConventionProved = false ∧ convention.productToCoefficientProved = false ∧ convention.lcuCorrectProved = false ∧ convention.blockProjectionProved = false ∧ convention.blockCorrectProved = false ∧ convention.finalExtractionProved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).theoremData.obligations.blockExtraction.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3IndicatorProjectionConvention_n3_transcript : have convention := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3IndicatorProjectionConvention_n3; convention.cleanEndpoint = 84 ∧ convention.fullEndpoint = 228 ∧ convention.cleanIndicator = 0 ∧ convention.fullIndicator = 1 ∧ convention.cleanIndicator ≠ convention.fullIndicator ∧ convention.indicatorRelationSpecifiedBySource = false ∧ convention.humanInputRequired = true ∧ convention.requiredConvention = "state whether the theorem projection sums, ignores, resets, or permutes the indicator field relating endpoint 228 to endpoint 84" ∧ convention.conventionObligation.source = "GHL2025 Eq. ROBIN clarified, Fig. 1-term ROBIN, Definition def:block-encoding; QBE gamma3 sparse-register summation indicator gap" ∧ convention.conventionObligation.proved = false ∧ convention.sparseSummationConvention.indicatorMismatchHandledBySummation = false ∧ convention.sparseSummationConvention.indicatorMismatchObligation.proved = false ∧ convention.projectionDecision.productSearchBlocked = true ∧ convention.productSearchBlocked = true ∧ convention.indicatorMismatchObligationProved = false ∧ convention.projectionSlotConventionProved = false ∧ convention.productToCoefficientProved = false ∧ convention.lcuCorrectProved = false ∧ convention.blockProjectionProved = false ∧ convention.blockCorrectProved = false ∧ convention.finalExtractionProved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).theoremData.obligations.blockExtraction.proved = false
Transcript theorem for the active gamma3 indicator convention. The theorem packages the endpoint and false-obligation facts needed by the next proof step. It does not identify endpoints `228` and `84`, and it does not promote product-to-coefficient, LCU, projection, block, or final extraction flags.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 bulk indicator source audit”. A proposition-valued field is a requirement until a constructor supplies it. Focused source audit for the bulk-indicator field in the 'n = 3' gamma3 endpoint pair.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Focused source audit for the bulk-indicator field in the 'n = 3' gamma3 endpoint pair. For the entry using system column '5', the paper's bulk window 'K1 <= j <= K2' classifies the column as bulk. The source-backed 'U_indic' behavior therefore sets the indicator to '1', which matches the full Fig. 1-term Robin endpoint '228' and not the clean endpoint '84'. This refines the active blocker without closing it: the source still does not state a projection/register rule that identifies the two endpoints, and all product, LCU, projection, block, and extraction flags remain false.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:5512. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.111●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BulkIndicatorSourceAudit : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BulkIndicatorSourceAudit : Type
Focused source audit for the bulk-indicator field in the `n = 3` gamma3 endpoint pair. For the entry using system column `5`, the paper's bulk window `K1 <= j <= K2` classifies the column as bulk. The source-backed `U_indic` behavior therefore sets the indicator to `1`, which matches the full Fig. 1-term Robin endpoint `228` and not the clean endpoint `84`. This refines the active blocker without closing it: the source still does not state a projection/register rule that identifies the two endpoints, and all product, LCU, projection, block, and extraction flags remain false.
Fields
sourceAnchor : String
focusedSystemColumn : ℕ
K1 : ℕ
K2 : ℕ
isBulkColumn : Bool
cleanEndpoint : ℕ
fullEndpoint : ℕ
cleanIndicator : ℕ
fullIndicator : ℕ
sourceBulkIndicator : ℕ
fullEndpointMatchesSourceBulkIndicator : Bool
cleanEndpointMatchesSourceBulkIndicator : Bool
sourceStatesResetRule : Bool
indicatorConvention : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3IndicatorProjectionConvention
productSearchBlocked : Bool
conventionObligationProved : Bool
productToCoefficientProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 bulk indicator source audit n 3”. Source-backed refinement of the active indicator convention blocker.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Source-backed refinement of the active indicator convention blocker. The focused column '5' is in the bulk window for 'n = 3', so the indicator value '1' at endpoint '228' is not accidental; it is exactly the value produced by the 'U_indic' source paragraph. Endpoint '84' remains the clean displayed slot endpoint, and no reset/projection rule is promoted.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:5542. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.112●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BulkIndicatorSourceAudit_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BulkIndicatorSourceAudit
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BulkIndicatorSourceAudit_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BulkIndicatorSourceAudit
Source-backed refinement of the active indicator convention blocker. The focused column `5` is in the bulk window for `n = 3`, so the indicator value `1` at endpoint `228` is not accidental; it is exactly the value produced by the `U_indic` source paragraph. Endpoint `84` remains the clean displayed slot endpoint, and no reset/projection rule is promoted.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 bulk indicator source audit n 3 transcript”; its local proof does not by itself complete the broader paper route. Transcript theorem for the bulk-indicator source audit.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Transcript theorem for the bulk-indicator source audit. This theorem only records the source-backed branch classification and the remaining false obligations. It does not replace the missing projection/register convention and does not resume product multiplication.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:5579. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.113●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BulkIndicatorSourceAudit_n3_transcript : have p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3; have audit := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BulkIndicatorSourceAudit_n3; audit.focusedSystemColumn = 5 ∧ audit.K1 = 2 ∧ audit.K2 = 5 ∧ audit.isBulkColumn = true ∧ QuantumBlockEncoding.GHL2025.isBulkRow audit.K1 audit.K2 audit.focusedSystemColumn = true ∧ QuantumBlockEncoding.GHL2025.indicatorOracleImage p (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3PaperBasisIndex p 5 audit.focusedSystemColumn) = 218 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p 218).indicatorBit = audit.sourceBulkIndicator ∧ audit.sourceBulkIndicator = 1 ∧ audit.fullEndpoint = 228 ∧ audit.fullIndicator = 1 ∧ audit.fullEndpointMatchesSourceBulkIndicator = true ∧ audit.cleanEndpoint = 84 ∧ audit.cleanIndicator = 0 ∧ audit.cleanEndpointMatchesSourceBulkIndicator = false ∧ audit.sourceStatesResetRule = false ∧ audit.indicatorConvention.indicatorRelationSpecifiedBySource = false ∧ audit.indicatorConvention.humanInputRequired = true ∧ audit.indicatorConvention.conventionObligation.proved = false ∧ audit.productSearchBlocked = true ∧ audit.conventionObligationProved = false ∧ audit.productToCoefficientProved = false ∧ audit.blockProjectionProved = false ∧ audit.blockCorrectProved = false ∧ audit.finalExtractionProved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).theoremData.obligations.blockExtraction.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BulkIndicatorSourceAudit_n3_transcript : have p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3; have audit := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BulkIndicatorSourceAudit_n3; audit.focusedSystemColumn = 5 ∧ audit.K1 = 2 ∧ audit.K2 = 5 ∧ audit.isBulkColumn = true ∧ QuantumBlockEncoding.GHL2025.isBulkRow audit.K1 audit.K2 audit.focusedSystemColumn = true ∧ QuantumBlockEncoding.GHL2025.indicatorOracleImage p (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3PaperBasisIndex p 5 audit.focusedSystemColumn) = 218 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p 218).indicatorBit = audit.sourceBulkIndicator ∧ audit.sourceBulkIndicator = 1 ∧ audit.fullEndpoint = 228 ∧ audit.fullIndicator = 1 ∧ audit.fullEndpointMatchesSourceBulkIndicator = true ∧ audit.cleanEndpoint = 84 ∧ audit.cleanIndicator = 0 ∧ audit.cleanEndpointMatchesSourceBulkIndicator = false ∧ audit.sourceStatesResetRule = false ∧ audit.indicatorConvention.indicatorRelationSpecifiedBySource = false ∧ audit.indicatorConvention.humanInputRequired = true ∧ audit.indicatorConvention.conventionObligation.proved = false ∧ audit.productSearchBlocked = true ∧ audit.conventionObligationProved = false ∧ audit.productToCoefficientProved = false ∧ audit.blockProjectionProved = false ∧ audit.blockCorrectProved = false ∧ audit.finalExtractionProved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).theoremData.obligations.blockExtraction.proved = false
Transcript theorem for the bulk-indicator source audit. This theorem only records the source-backed branch classification and the remaining false obligations. It does not replace the missing projection/register convention and does not resume product multiplication.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 branch correct source map”. A proposition-valued field is a requirement until a constructor supplies it. Branch-correct source map for the focused 'n = 3' gamma3 transcript.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Branch-correct source map for the focused 'n = 3' gamma3 transcript. The older endpoint audit compared the bulk column 'j = 5' against the displayed boundary summand of Eq. 'ROBIN clarified'. This record keeps that bulk audit as omitted-branch memory and introduces a boundary-focused endpoint with 'j = 0', where 'U_indic' leaves the indicator at '0'. It is a transcript map only; both branch product obligations remain false.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:5630. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.114●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BranchCorrectSourceMap : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BranchCorrectSourceMap : Type
Branch-correct source map for the focused `n = 3` gamma3 transcript. The older endpoint audit compared the bulk column `j = 5` against the displayed boundary summand of Eq. `ROBIN clarified`. This record keeps that bulk audit as omitted-branch memory and introduces a boundary-focused endpoint with `j = 0`, where `U_indic` leaves the indicator at `0`. It is a transcript map only; both branch product obligations remain false.
Fields
sourceAnchor : String
K1 : ℕ
K2 : ℕ
boundaryColumn : ℕ
boundaryColumnIsBoundary : Bool
boundaryColumnIsBulk : Bool
boundaryEndpoint : ℕ
boundaryAfterIndic : ℕ
boundaryIndicator : ℕ
boundaryBranchIsDisplayed : Bool
bulkColumn : ℕ
bulkColumnIsBoundary : Bool
bulkColumnIsBulk : Bool
bulkCleanEndpoint : ℕ
bulkFullEndpoint : ℕ
bulkIndicator : ℕ
bulkBranchIsOmittedByDisplay : Bool
oldEndpointMismatchWasBranchMismatch : Bool
oldHumanProjectionFreezeSuperseded : Bool
boundaryProductObligation : QuantumBlockEncoding.SemanticObligation
bulkProductObligation : QuantumBlockEncoding.SemanticObligation
lowerBoundaryPacketAllowed : Bool
lowerBulkPacketAllowed : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 branch correct source map n 3”. Compiled branch-correct gamma3 transcript for 'n = 3'.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Compiled branch-correct gamma3 transcript for 'n = 3'. The boundary target uses 'j = 0', satisfying the displayed condition '0 <= j < K1'. The old 'j = 5' target satisfies 'K1 <= j <= K2', so it belongs to the omitted bulk summand hidden by '+ ...'. Lower proof search may now target one branch-specific product interface at a time, but no theorem-level semantic flag is promoted here.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:5668. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.115●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BranchCorrectSourceMap_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BranchCorrectSourceMap
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BranchCorrectSourceMap_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BranchCorrectSourceMap
Compiled branch-correct gamma3 transcript for `n = 3`. The boundary target uses `j = 0`, satisfying the displayed condition `0 <= j < K1`. The old `j = 5` target satisfies `K1 <= j <= K2`, so it belongs to the omitted bulk summand hidden by `+ ...`. Lower proof search may now target one branch-specific product interface at a time, but no theorem-level semantic flag is promoted here.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 branch correct source map n 3 transcript”; its local proof does not by itself complete the broader paper route. Transcript theorem for the branch-correct gamma3 source map.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Transcript theorem for the branch-correct gamma3 source map. This theorem is the handoff boundary between the old bulk endpoint audit and the next lower packet. It proves only branch classification and endpoint facts; the boundary and bulk product-to-coefficient obligations, LCU composition, projection, block correctness, and final extraction stay false.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:5729. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.116●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BranchCorrectSourceMap_n3_transcript : have p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3; have branch := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BranchCorrectSourceMap_n3; branch.K1 = 2 ∧ branch.K2 = 5 ∧ branch.boundaryColumn = 0 ∧ QuantumBlockEncoding.GHL2025.isBoundaryRow branch.K1 branch.K2 (QuantumBlockEncoding.gridSize p.n) branch.boundaryColumn = true ∧ branch.boundaryColumnIsBoundary = true ∧ QuantumBlockEncoding.GHL2025.isBulkRow branch.K1 branch.K2 branch.boundaryColumn = false ∧ branch.boundaryColumnIsBulk = false ∧ branch.boundaryEndpoint = 0 ∧ QuantumBlockEncoding.GHL2025.indicatorOracleImage p branch.boundaryEndpoint = branch.boundaryAfterIndic ∧ branch.boundaryAfterIndic = 0 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p branch.boundaryAfterIndic).indicatorBit = 0 ∧ branch.boundaryIndicator = 0 ∧ branch.boundaryBranchIsDisplayed = true ∧ branch.bulkColumn = 5 ∧ QuantumBlockEncoding.GHL2025.isBoundaryRow branch.K1 branch.K2 (QuantumBlockEncoding.gridSize p.n) branch.bulkColumn = false ∧ branch.bulkColumnIsBoundary = false ∧ QuantumBlockEncoding.GHL2025.isBulkRow branch.K1 branch.K2 branch.bulkColumn = true ∧ branch.bulkColumnIsBulk = true ∧ branch.bulkCleanEndpoint = 84 ∧ branch.bulkFullEndpoint = 228 ∧ branch.bulkIndicator = 1 ∧ branch.bulkBranchIsOmittedByDisplay = true ∧ branch.oldEndpointMismatchWasBranchMismatch = true ∧ branch.oldHumanProjectionFreezeSuperseded = true ∧ branch.boundaryProductObligation.proved = false ∧ branch.bulkProductObligation.proved = false ∧ branch.lowerBoundaryPacketAllowed = true ∧ branch.lowerBulkPacketAllowed = true ∧ branch.lcuCorrectProved = false ∧ branch.blockProjectionProved = false ∧ branch.blockCorrectProved = false ∧ branch.finalExtractionProved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).theoremData.obligations.blockExtraction.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BranchCorrectSourceMap_n3_transcript : have p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3; have branch := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BranchCorrectSourceMap_n3; branch.K1 = 2 ∧ branch.K2 = 5 ∧ branch.boundaryColumn = 0 ∧ QuantumBlockEncoding.GHL2025.isBoundaryRow branch.K1 branch.K2 (QuantumBlockEncoding.gridSize p.n) branch.boundaryColumn = true ∧ branch.boundaryColumnIsBoundary = true ∧ QuantumBlockEncoding.GHL2025.isBulkRow branch.K1 branch.K2 branch.boundaryColumn = false ∧ branch.boundaryColumnIsBulk = false ∧ branch.boundaryEndpoint = 0 ∧ QuantumBlockEncoding.GHL2025.indicatorOracleImage p branch.boundaryEndpoint = branch.boundaryAfterIndic ∧ branch.boundaryAfterIndic = 0 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p branch.boundaryAfterIndic).indicatorBit = 0 ∧ branch.boundaryIndicator = 0 ∧ branch.boundaryBranchIsDisplayed = true ∧ branch.bulkColumn = 5 ∧ QuantumBlockEncoding.GHL2025.isBoundaryRow branch.K1 branch.K2 (QuantumBlockEncoding.gridSize p.n) branch.bulkColumn = false ∧ branch.bulkColumnIsBoundary = false ∧ QuantumBlockEncoding.GHL2025.isBulkRow branch.K1 branch.K2 branch.bulkColumn = true ∧ branch.bulkColumnIsBulk = true ∧ branch.bulkCleanEndpoint = 84 ∧ branch.bulkFullEndpoint = 228 ∧ branch.bulkIndicator = 1 ∧ branch.bulkBranchIsOmittedByDisplay = true ∧ branch.oldEndpointMismatchWasBranchMismatch = true ∧ branch.oldHumanProjectionFreezeSuperseded = true ∧ branch.boundaryProductObligation.proved = false ∧ branch.bulkProductObligation.proved = false ∧ branch.lowerBoundaryPacketAllowed = true ∧ branch.lowerBulkPacketAllowed = true ∧ branch.lcuCorrectProved = false ∧ branch.blockProjectionProved = false ∧ branch.blockCorrectProved = false ∧ branch.finalExtractionProved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).theoremData.obligations.blockExtraction.proved = false
Transcript theorem for the branch-correct gamma3 source map. This theorem is the handoff boundary between the old bulk endpoint audit and the next lower packet. It proves only branch classification and endpoint facts; the boundary and bulk product-to-coefficient obligations, LCU composition, projection, block correctness, and final extraction stay false.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route gamma 3 boundary branch path audit n 3”; its local proof does not by itself complete the broader paper route. Boundary-focused path audit for the displayed gamma3 branch at 'n = 3'.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Boundary-focused path audit for the displayed gamma3 branch at 'n = 3'. The branch-correct source map chooses the boundary column 'j = 0', so 'U_indic' leaves the indicator bit at '0'. For the target entry '(0, 0)', the sparse slot that maps the source column back to row '0' is slot '2' (offset '0'), not slot '0' (offset '6'). This theorem records the resulting slot-'2' clean path through the Fig. 1-term Robin gate images. It is only a path-state audit: the product-to-coefficient obligation and all block-encoding semantic flags remain false.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:5790. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.117●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3BoundaryBranchPathAudit_n3 : let p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3; let fullDim := QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits p); have branch := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BranchCorrectSourceMap_n3; have sysRow := ⟨0, ⋯⟩; have sysCol := ⟨0, ⋯⟩; have slot0Col := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3PaperBasisIndex p 0 ↑sysCol; have slot2Col := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3PaperBasisIndex p 2 ↑sysCol; have slot2Row := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3PaperBasisIndex p 2 ↑sysRow; have afterIndic := QuantumBlockEncoding.GHL2025.indicatorOracleImage p slot2Col; have afterOdbs := QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperImage p afterIndic; have afterSwap := QuantumBlockEncoding.GHL2025.swapOracleImage p afterOdbs; have daggerEndpoint := QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperPostSwapPreimageCandidate p slot2Col; have row0 := ⟨0, ⋯⟩; have row1 := ⟨1, ⋯⟩; have row32 := ⟨32, ⋯⟩; have row33 := ⟨33, ⋯⟩; branch.boundaryColumn = ↑sysCol ∧ branch.boundaryColumnIsBoundary = true ∧ branch.boundaryColumnIsBulk = false ∧ branch.boundaryEndpoint = slot0Col ∧ branch.boundaryAfterIndic = slot0Col ∧ branch.boundaryIndicator = 0 ∧ branch.boundaryBranchIsDisplayed = true ∧ slot0Col = 0 ∧ QuantumBlockEncoding.GHL2025.oneTermRobinGlobalSparseAddress 3 0 ↑sysCol = 6 ∧ QuantumBlockEncoding.GHL2025.oneTermRobinGlobalSparseAddress 3 2 ↑sysCol = ↑sysRow ∧ QuantumBlockEncoding.GHL2025.oneTermRobinGlobalSparseAddress 3 2 ↑sysCol ≠ QuantumBlockEncoding.GHL2025.oneTermRobinGlobalSparseAddress 3 0 ↑sysCol ∧ slot2Col = 32 ∧ slot2Row = 32 ∧ slot2Col ≠ slot0Col ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperImage p slot0Col = 96 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperPostSwapPreimageCandidate p slot0Col = 76 ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p 76).rowValue = 6 ∧ afterIndic = slot2Col ∧ QuantumBlockEncoding.GHL2025.indicatorOracleMatrix p row32 row32 = QuantumBlockEncoding.Coeff.rat 1 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p afterIndic).indicatorBit = 0 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p afterIndic).ancillaBit = 0 ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p afterIndic).rowValue = ↑sysCol ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p afterIndic).sparseIndexValue = 2 ∧ QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTRotationMatrix p row32 row32 = QuantumBlockEncoding.Coeff.rat 1 ∧ QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTRotationMatrix p row33 row32 = QuantumBlockEncoding.Coeff.rat 0 ∧ QuantumBlockEncoding.GHL2025.boundaryRotationMatrix p row32 row32 = QuantumBlockEncoding.Coeff.symbol "boundary_cos_half_0_2" ∧ QuantumBlockEncoding.GHL2025.boundaryRotationMatrix p row33 row32 = QuantumBlockEncoding.Coeff.symbol "boundary_sin_half_0_2" ∧ afterOdbs = 0 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperMatrix p row0 row32 = QuantumBlockEncoding.Coeff.rat 1 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperMatrix p row1 row33 = QuantumBlockEncoding.Coeff.rat 1 ∧ (QuantumBlockEncoding.GHL2025.functionOraclePaperImage p afterOdbs).cleanBranchBasisIndex = afterOdbs ∧ (QuantumBlockEncoding.GHL2025.functionOraclePaperImage p afterOdbs).cleanBranchSystemValue = ↑sysRow ∧ (QuantumBlockEncoding.GHL2025.functionOraclePaperImage p afterOdbs).cleanBranchAmplitude = (QuantumBlockEncoding.Coeff.symbol "f_3_0").mul (QuantumBlockEncoding.Coeff.symbol "N_f_inv") ∧ QuantumBlockEncoding.GHL2025.functionOraclePaperMatrix p row0 row0 = (QuantumBlockEncoding.Coeff.symbol "f_3_0").mul (QuantumBlockEncoding.Coeff.symbol "N_f_inv") ∧ QuantumBlockEncoding.GHL2025.functionOraclePaperMatrix p row1 row1 = (QuantumBlockEncoding.Coeff.symbol "f_3_0").mul (QuantumBlockEncoding.Coeff.symbol "N_f_inv") ∧ ⋯
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3BoundaryBranchPathAudit_n3 : let p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3; let fullDim := QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits p); have branch := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BranchCorrectSourceMap_n3; have sysRow := ⟨0, ⋯⟩; have sysCol := ⟨0, ⋯⟩; have slot0Col := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3PaperBasisIndex p 0 ↑sysCol; have slot2Col := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3PaperBasisIndex p 2 ↑sysCol; have slot2Row := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3PaperBasisIndex p 2 ↑sysRow; have afterIndic := QuantumBlockEncoding.GHL2025.indicatorOracleImage p slot2Col; have afterOdbs := QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperImage p afterIndic; have afterSwap := QuantumBlockEncoding.GHL2025.swapOracleImage p afterOdbs; have daggerEndpoint := QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperPostSwapPreimageCandidate p slot2Col; have row0 := ⟨0, ⋯⟩; have row1 := ⟨1, ⋯⟩; have row32 := ⟨32, ⋯⟩; have row33 := ⟨33, ⋯⟩; branch.boundaryColumn = ↑sysCol ∧ branch.boundaryColumnIsBoundary = true ∧ branch.boundaryColumnIsBulk = false ∧ branch.boundaryEndpoint = slot0Col ∧ branch.boundaryAfterIndic = slot0Col ∧ branch.boundaryIndicator = 0 ∧ branch.boundaryBranchIsDisplayed = true ∧ slot0Col = 0 ∧ QuantumBlockEncoding.GHL2025.oneTermRobinGlobalSparseAddress 3 0 ↑sysCol = 6 ∧ QuantumBlockEncoding.GHL2025.oneTermRobinGlobalSparseAddress 3 2 ↑sysCol = ↑sysRow ∧ QuantumBlockEncoding.GHL2025.oneTermRobinGlobalSparseAddress 3 2 ↑sysCol ≠ QuantumBlockEncoding.GHL2025.oneTermRobinGlobalSparseAddress 3 0 ↑sysCol ∧ slot2Col = 32 ∧ slot2Row = 32 ∧ slot2Col ≠ slot0Col ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperImage p slot0Col = 96 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperPostSwapPreimageCandidate p slot0Col = 76 ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p 76).rowValue = 6 ∧ afterIndic = slot2Col ∧ QuantumBlockEncoding.GHL2025.indicatorOracleMatrix p row32 row32 = QuantumBlockEncoding.Coeff.rat 1 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p afterIndic).indicatorBit = 0 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p afterIndic).ancillaBit = 0 ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p afterIndic).rowValue = ↑sysCol ∧ (QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperRegisters p afterIndic).sparseIndexValue = 2 ∧ QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTRotationMatrix p row32 row32 = QuantumBlockEncoding.Coeff.rat 1 ∧ QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTRotationMatrix p row33 row32 = QuantumBlockEncoding.Coeff.rat 0 ∧ QuantumBlockEncoding.GHL2025.boundaryRotationMatrix p row32 row32 = QuantumBlockEncoding.Coeff.symbol "boundary_cos_half_0_2" ∧ QuantumBlockEncoding.GHL2025.boundaryRotationMatrix p row33 row32 = QuantumBlockEncoding.Coeff.symbol "boundary_sin_half_0_2" ∧ afterOdbs = 0 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperMatrix p row0 row32 = QuantumBlockEncoding.Coeff.rat 1 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperMatrix p row1 row33 = QuantumBlockEncoding.Coeff.rat 1 ∧ (QuantumBlockEncoding.GHL2025.functionOraclePaperImage p afterOdbs).cleanBranchBasisIndex = afterOdbs ∧ (QuantumBlockEncoding.GHL2025.functionOraclePaperImage p afterOdbs).cleanBranchSystemValue = ↑sysRow ∧ (QuantumBlockEncoding.GHL2025.functionOraclePaperImage p afterOdbs).cleanBranchAmplitude = (QuantumBlockEncoding.Coeff.symbol "f_3_0").mul (QuantumBlockEncoding.Coeff.symbol "N_f_inv") ∧ QuantumBlockEncoding.GHL2025.functionOraclePaperMatrix p row0 row0 = (QuantumBlockEncoding.Coeff.symbol "f_3_0").mul (QuantumBlockEncoding.Coeff.symbol "N_f_inv") ∧ QuantumBlockEncoding.GHL2025.functionOraclePaperMatrix p row1 row1 = (QuantumBlockEncoding.Coeff.symbol "f_3_0").mul (QuantumBlockEncoding.Coeff.symbol "N_f_inv") ∧ ⋯
Boundary-focused path audit for the displayed gamma3 branch at `n = 3`. The branch-correct source map chooses the boundary column `j = 0`, so `U_indic` leaves the indicator bit at `0`. For the target entry `(0, 0)`, the sparse slot that maps the source column back to row `0` is slot `2` (offset `0`), not slot `0` (offset `6`). This theorem records the resulting slot-`2` clean path through the Fig. 1-term Robin gate images. It is only a path-state audit: the product-to-coefficient obligation and all block-encoding semantic flags remain false.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 bulk product interface”. A proposition-valued field is a requirement until a constructor supplies it. Bulk-specific interface for the omitted gamma3 product branch.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Bulk-specific interface for the omitted gamma3 product branch. The old focused column 'j = 5' is bulk for 'n = 3', 'K1 = 2', and 'K2 = 5'. It therefore belongs to the summand hidden by the '+ ...' in Eq. 'ROBIN clarified', not to the displayed boundary branch. This interface uses the source-backed full endpoint with indicator '1'; it does not compare that endpoint with the displayed boundary endpoint and does not prove the final product-to-coefficient theorem.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:5906. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.118●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BulkProductInterface : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BulkProductInterface : Type
Bulk-specific interface for the omitted gamma3 product branch. The old focused column `j = 5` is bulk for `n = 3`, `K1 = 2`, and `K2 = 5`. It therefore belongs to the summand hidden by the `+ ...` in Eq. `ROBIN clarified`, not to the displayed boundary branch. This interface uses the source-backed full endpoint with indicator `1`; it does not compare that endpoint with the displayed boundary endpoint and does not prove the final product-to-coefficient theorem.
Fields
sourceAnchor : String
systemRow : ℕ
systemColumn : ℕ
sparseSlot : ℕ
K1 : ℕ
K2 : ℕ
bulkColumnIsBulk : Bool
bulkBranchIsOmittedByDisplay : Bool
fullEndpointUsed : Bool
cleanBoundaryEndpointComparisonUsed : Bool
cleanSource : ℕ
afterIndic : ℕ
sourceBulkIndicator : ℕ
afterOdtsKetZero : ℕ
afterOdtsKetOne : ℕ
afterRyKetZero : ℕ
afterRyKetOne : ℕ
afterOdbsKetZero : ℕ
afterOdbsKetOne : ℕ
afterOfKetZero : ℕ
afterOfKetOne : ℕ
afterSwapKetZero : ℕ
afterSwapKetOne : ℕ
daggerKetZeroEndpoint : ℕ
daggerKetOneEndpoint : ℕ
ketZeroFactors : List QuantumBlockEncoding.Coeff
adjacentKetOneFactors : List QuantumBlockEncoding.Coeff
productObligation : QuantumBlockEncoding.SemanticObligation
indicatorProjectionConvention : QuantumBlockEncoding.SemanticObligation
uniquePathSupportObligation : QuantumBlockEncoding.SemanticObligation
exactProductEqualityProved : Bool
derivativeAmplitudeNormalizerProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
Plain-English reading. This definition gives the library's named construction or computation for “one term robin block encoding proof route gamma 3 bulk product to coefficient interface n 3”. Compiled product interface for the omitted bulk branch at 'n = 3', system entry '(2,5)', and global sparse slot '5'.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Compiled product interface for the omitted bulk branch at 'n = 3', system entry '(2,5)', and global sparse slot '5'. The factor list follows the Fig. 1-term Robin gate order 'U_indic', 'O_DT^S', 'Ry_boundary', 'O_D^BS', 'O_f', 'SWAP', 'O_D^BS†'. Because the column is bulk, 'U_indic' sets the indicator bit to '1', 'O_DT^S' supplies the derivative-amplitude factor, and 'Ry_boundary' acts as identity.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:5955. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.119●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3BulkProductToCoefficientInterface_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BulkProductInterface
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3BulkProductToCoefficientInterface_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BulkProductInterface
Compiled product interface for the omitted bulk branch at `n = 3`, system entry `(2,5)`, and global sparse slot `5`. The factor list follows the Fig. 1-term Robin gate order `U_indic`, `O_DT^S`, `Ry_boundary`, `O_D^BS`, `O_f`, `SWAP`, `O_D^BS†`. Because the column is bulk, `U_indic` sets the indicator bit to `1`, `O_DT^S` supplies the derivative-amplitude factor, and `Ry_boundary` acts as identity.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route gamma 3 bulk product to coefficient interface n 3 transcript”; its local proof does not by itself complete the broader paper route. Transcript theorem for the omitted bulk product interface.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Transcript theorem for the omitted bulk product interface. This theorem proves only branch classification, endpoint data, and the gate-factor ledger for the source-backed bulk path. The unique-path support, indicator projection convention, product-to-coefficient equality, LCU composition, block projection, block correctness, and final extraction remain false obligations.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:6052. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.120●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3BulkProductToCoefficientInterface_n3_transcript : let p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3; let fullDim := QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits p); have interface := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3BulkProductToCoefficientInterface_n3; have sysRow := ⟨2, ⋯⟩; have sysCol := ⟨5, ⋯⟩; have row90 := ⟨90, ⋯⟩; have row170 := ⟨170, ⋯⟩; have row171 := ⟨171, ⋯⟩; have row212 := ⟨212, ⋯⟩; have row213 := ⟨213, ⋯⟩; have row218 := ⟨218, ⋯⟩; have row219 := ⟨219, ⋯⟩; have row228 := ⟨228, ⋯⟩; have row229 := ⟨229, ⋯⟩; interface.sourceAnchor = "GHL2025 Eq. ROBIN clarified omitted gamma3 bulk branch, U_indic paragraph, Fig. 1-term ROBIN, and Theorem one-term block-encoding, arXiv:2506.20478" ∧ interface.systemRow = ↑sysRow ∧ interface.systemColumn = ↑sysCol ∧ interface.sparseSlot = 5 ∧ interface.K1 = 2 ∧ interface.K2 = 5 ∧ QuantumBlockEncoding.GHL2025.isBulkRow interface.K1 interface.K2 interface.systemColumn = true ∧ interface.bulkColumnIsBulk = true ∧ interface.bulkBranchIsOmittedByDisplay = true ∧ interface.fullEndpointUsed = true ∧ interface.cleanBoundaryEndpointComparisonUsed = false ∧ QuantumBlockEncoding.GHL2025.oneTermRobinGlobalSparseAddress 3 interface.sparseSlot interface.systemColumn = interface.systemRow ∧ interface.cleanSource = 90 ∧ interface.afterIndic = 218 ∧ interface.sourceBulkIndicator = 1 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p interface.afterIndic).indicatorBit = interface.sourceBulkIndicator ∧ interface.afterOdtsKetZero = 218 ∧ interface.afterOdtsKetOne = 219 ∧ interface.afterRyKetZero = 218 ∧ interface.afterRyKetOne = 219 ∧ interface.afterOdbsKetZero = 170 ∧ interface.afterOdbsKetOne = 171 ∧ interface.afterOfKetZero = 170 ∧ interface.afterOfKetOne = 171 ∧ interface.afterSwapKetZero = 212 ∧ interface.afterSwapKetOne = 213 ∧ interface.daggerKetZeroEndpoint = 228 ∧ interface.daggerKetOneEndpoint = 229 ∧ List.length QuantumBlockEncoding.GHL2025.oneTermRobinCircuit = interface.ketZeroFactors.length ∧ interface.ketZeroFactors = [QuantumBlockEncoding.Coeff.rat 1, QuantumBlockEncoding.Coeff.symbol "odts_cos_half_5_5", QuantumBlockEncoding.Coeff.rat 1, QuantumBlockEncoding.Coeff.rat 1, (QuantumBlockEncoding.Coeff.symbol "f_3_5").mul (QuantumBlockEncoding.Coeff.symbol "N_f_inv"), QuantumBlockEncoding.Coeff.rat 1, QuantumBlockEncoding.Coeff.rat 1] ∧ List.length QuantumBlockEncoding.GHL2025.oneTermRobinCircuit = interface.adjacentKetOneFactors.length ∧ interface.adjacentKetOneFactors = [QuantumBlockEncoding.Coeff.rat 1, QuantumBlockEncoding.Coeff.symbol "odts_sin_half_5_5", QuantumBlockEncoding.Coeff.rat 1, QuantumBlockEncoding.Coeff.rat 1, (QuantumBlockEncoding.Coeff.symbol "f_3_5").mul (QuantumBlockEncoding.Coeff.symbol "N_f_inv"), QuantumBlockEncoding.Coeff.rat 1, QuantumBlockEncoding.Coeff.rat 1] ∧ QuantumBlockEncoding.GHL2025.indicatorOracleMatrix p row218 row90 = QuantumBlockEncoding.Coeff.rat 1 ∧ QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTRotationMatrix p row218 row218 = QuantumBlockEncoding.Coeff.symbol "odts_cos_half_5_5" ∧ QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTRotationMatrix p row219 row218 = QuantumBlockEncoding.Coeff.symbol "odts_sin_half_5_5" ∧ QuantumBlockEncoding.GHL2025.boundaryRotationMatrix p row218 row218 = QuantumBlockEncoding.Coeff.rat 1 ∧ QuantumBlockEncoding.GHL2025.boundaryRotationMatrix p row219 row219 = QuantumBlockEncoding.Coeff.rat 1 ∧ ⋯
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3BulkProductToCoefficientInterface_n3_transcript : let p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3; let fullDim := QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits p); have interface := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3BulkProductToCoefficientInterface_n3; have sysRow := ⟨2, ⋯⟩; have sysCol := ⟨5, ⋯⟩; have row90 := ⟨90, ⋯⟩; have row170 := ⟨170, ⋯⟩; have row171 := ⟨171, ⋯⟩; have row212 := ⟨212, ⋯⟩; have row213 := ⟨213, ⋯⟩; have row218 := ⟨218, ⋯⟩; have row219 := ⟨219, ⋯⟩; have row228 := ⟨228, ⋯⟩; have row229 := ⟨229, ⋯⟩; interface.sourceAnchor = "GHL2025 Eq. ROBIN clarified omitted gamma3 bulk branch, U_indic paragraph, Fig. 1-term ROBIN, and Theorem one-term block-encoding, arXiv:2506.20478" ∧ interface.systemRow = ↑sysRow ∧ interface.systemColumn = ↑sysCol ∧ interface.sparseSlot = 5 ∧ interface.K1 = 2 ∧ interface.K2 = 5 ∧ QuantumBlockEncoding.GHL2025.isBulkRow interface.K1 interface.K2 interface.systemColumn = true ∧ interface.bulkColumnIsBulk = true ∧ interface.bulkBranchIsOmittedByDisplay = true ∧ interface.fullEndpointUsed = true ∧ interface.cleanBoundaryEndpointComparisonUsed = false ∧ QuantumBlockEncoding.GHL2025.oneTermRobinGlobalSparseAddress 3 interface.sparseSlot interface.systemColumn = interface.systemRow ∧ interface.cleanSource = 90 ∧ interface.afterIndic = 218 ∧ interface.sourceBulkIndicator = 1 ∧ (QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTPaperRegisters p interface.afterIndic).indicatorBit = interface.sourceBulkIndicator ∧ interface.afterOdtsKetZero = 218 ∧ interface.afterOdtsKetOne = 219 ∧ interface.afterRyKetZero = 218 ∧ interface.afterRyKetOne = 219 ∧ interface.afterOdbsKetZero = 170 ∧ interface.afterOdbsKetOne = 171 ∧ interface.afterOfKetZero = 170 ∧ interface.afterOfKetOne = 171 ∧ interface.afterSwapKetZero = 212 ∧ interface.afterSwapKetOne = 213 ∧ interface.daggerKetZeroEndpoint = 228 ∧ interface.daggerKetOneEndpoint = 229 ∧ List.length QuantumBlockEncoding.GHL2025.oneTermRobinCircuit = interface.ketZeroFactors.length ∧ interface.ketZeroFactors = [QuantumBlockEncoding.Coeff.rat 1, QuantumBlockEncoding.Coeff.symbol "odts_cos_half_5_5", QuantumBlockEncoding.Coeff.rat 1, QuantumBlockEncoding.Coeff.rat 1, (QuantumBlockEncoding.Coeff.symbol "f_3_5").mul (QuantumBlockEncoding.Coeff.symbol "N_f_inv"), QuantumBlockEncoding.Coeff.rat 1, QuantumBlockEncoding.Coeff.rat 1] ∧ List.length QuantumBlockEncoding.GHL2025.oneTermRobinCircuit = interface.adjacentKetOneFactors.length ∧ interface.adjacentKetOneFactors = [QuantumBlockEncoding.Coeff.rat 1, QuantumBlockEncoding.Coeff.symbol "odts_sin_half_5_5", QuantumBlockEncoding.Coeff.rat 1, QuantumBlockEncoding.Coeff.rat 1, (QuantumBlockEncoding.Coeff.symbol "f_3_5").mul (QuantumBlockEncoding.Coeff.symbol "N_f_inv"), QuantumBlockEncoding.Coeff.rat 1, QuantumBlockEncoding.Coeff.rat 1] ∧ QuantumBlockEncoding.GHL2025.indicatorOracleMatrix p row218 row90 = QuantumBlockEncoding.Coeff.rat 1 ∧ QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTRotationMatrix p row218 row218 = QuantumBlockEncoding.Coeff.symbol "odts_cos_half_5_5" ∧ QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTRotationMatrix p row219 row218 = QuantumBlockEncoding.Coeff.symbol "odts_sin_half_5_5" ∧ QuantumBlockEncoding.GHL2025.boundaryRotationMatrix p row218 row218 = QuantumBlockEncoding.Coeff.rat 1 ∧ QuantumBlockEncoding.GHL2025.boundaryRotationMatrix p row219 row219 = QuantumBlockEncoding.Coeff.rat 1 ∧ ⋯
Transcript theorem for the omitted bulk product interface. This theorem proves only branch classification, endpoint data, and the gate-factor ledger for the source-backed bulk path. The unique-path support, indicator projection convention, product-to-coefficient equality, LCU composition, block projection, block correctness, and final extraction remain false obligations.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary product interface”. A proposition-valued field is a requirement until a constructor supplies it. Boundary-specific interface for the next gamma3 product theorem.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Boundary-specific interface for the next gamma3 product theorem. The displayed boundary branch of Eq. 'ROBIN clarified' at 'n = 3', '(i,j) = (0,0)' uses sparse slot '2'. The compiled path audit isolates the seven Fig. 1-term Robin factors for the ket-zero branch, but this record does not claim that the full matrix product has already been reduced to that path. The unique-path support facts and product-to-coefficient equality remain false obligations.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:6176. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.121●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProductInterface : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProductInterface : Type
Boundary-specific interface for the next gamma3 product theorem. The displayed boundary branch of Eq. `ROBIN clarified` at `n = 3`, `(i,j) = (0,0)` uses sparse slot `2`. The compiled path audit isolates the seven Fig. 1-term Robin factors for the ket-zero branch, but this record does not claim that the full matrix product has already been reduced to that path. The unique-path support facts and product-to-coefficient equality remain false obligations.
Fields
sourceAnchor : String
systemRow : ℕ
systemColumn : ℕ
sparseSlot : ℕ
cleanSource : ℕ
afterIndic : ℕ
afterOdtsKetZero : ℕ
afterRyKetZero : ℕ
afterRyKetOne : ℕ
afterOdbsKetZero : ℕ
afterOdbsKetOne : ℕ
afterOfKetZero : ℕ
afterOfKetOne : ℕ
afterSwapKetZero : ℕ
afterSwapKetOne : ℕ
daggerKetZeroEndpoint : ℕ
daggerKetOneEndpoint : ℕ
ketZeroFactors : List QuantumBlockEncoding.Coeff
adjacentKetOneFactors : List QuantumBlockEncoding.Coeff
productObligation : QuantumBlockEncoding.SemanticObligation
projectionSlotConvention : QuantumBlockEncoding.SemanticObligation
uniquePathSupportObligation : QuantumBlockEncoding.SemanticObligation
exactProductEqualityProved : Bool
boundaryRotationNormalizerProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
Plain-English reading. This definition gives the library's named construction or computation for “one term robin block encoding proof route gamma 3 boundary product to coefficient interface n 3”. Compiled boundary product interface for the 'n = 3', '(0,0)', sparse-slot-'2' gamma3 packet.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Compiled boundary product interface for the 'n = 3', '(0,0)', sparse-slot-'2' gamma3 packet. The factor list follows the gate order 'U_indic', 'O_DT^S', 'Ry_boundary', 'O_D^BS', 'O_f', 'SWAP', 'O_D^BS†'. The ket-zero branch factors are recorded, but applying 'Matrix.evalWith_mul_unique_path' is left to the next finite support proof.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:6216. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.122●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3BoundaryProductToCoefficientInterface_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProductInterface
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3BoundaryProductToCoefficientInterface_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProductInterface
Compiled boundary product interface for the `n = 3`, `(0,0)`, sparse-slot-`2` gamma3 packet. The factor list follows the gate order `U_indic`, `O_DT^S`, `Ry_boundary`, `O_D^BS`, `O_f`, `SWAP`, `O_D^BS†`. The ket-zero branch factors are recorded, but applying `Matrix.evalWith_mul_unique_path` is left to the next finite support proof.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route gamma 3 boundary product to coefficient interface n 3 transcript”; its local proof does not by itself complete the broader paper route. Transcript theorem for the boundary product interface.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Transcript theorem for the boundary product interface. This proves the branch-specific data and factor list used by the next unique-path product attempt. It deliberately keeps the unique-path support obligation, product-to-coefficient obligation, projection-slot convention, LCU composition, block projection, block correctness, and final extraction false.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:6302. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.123●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3BoundaryProductToCoefficientInterface_n3_transcript : let p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3; let fullDim := QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits p); have interface := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3BoundaryProductToCoefficientInterface_n3; have sysRow := ⟨0, ⋯⟩; have sysCol := ⟨0, ⋯⟩; have row0 := ⟨0, ⋯⟩; have row1 := ⟨1, ⋯⟩; have row32 := ⟨32, ⋯⟩; have row33 := ⟨33, ⋯⟩; interface.systemRow = ↑sysRow ∧ interface.systemColumn = ↑sysCol ∧ interface.sparseSlot = 2 ∧ QuantumBlockEncoding.GHL2025.oneTermRobinGlobalSparseAddress 3 interface.sparseSlot interface.systemColumn = interface.systemRow ∧ interface.cleanSource = 32 ∧ interface.afterIndic = 32 ∧ interface.afterOdtsKetZero = 32 ∧ interface.afterRyKetZero = 32 ∧ interface.afterRyKetOne = 33 ∧ interface.afterOdbsKetZero = 0 ∧ interface.afterOdbsKetOne = 1 ∧ interface.afterOfKetZero = 0 ∧ interface.afterOfKetOne = 1 ∧ interface.afterSwapKetZero = 0 ∧ interface.afterSwapKetOne = 1 ∧ interface.daggerKetZeroEndpoint = 32 ∧ interface.daggerKetOneEndpoint = 33 ∧ List.length QuantumBlockEncoding.GHL2025.oneTermRobinCircuit = interface.ketZeroFactors.length ∧ interface.ketZeroFactors = [QuantumBlockEncoding.Coeff.rat 1, QuantumBlockEncoding.Coeff.rat 1, QuantumBlockEncoding.Coeff.symbol "boundary_cos_half_0_2", QuantumBlockEncoding.Coeff.rat 1, (QuantumBlockEncoding.Coeff.symbol "f_3_0").mul (QuantumBlockEncoding.Coeff.symbol "N_f_inv"), QuantumBlockEncoding.Coeff.rat 1, QuantumBlockEncoding.Coeff.rat 1] ∧ List.length QuantumBlockEncoding.GHL2025.oneTermRobinCircuit = interface.adjacentKetOneFactors.length ∧ interface.adjacentKetOneFactors = [QuantumBlockEncoding.Coeff.rat 1, QuantumBlockEncoding.Coeff.rat 0, QuantumBlockEncoding.Coeff.symbol "boundary_sin_half_0_2", QuantumBlockEncoding.Coeff.rat 1, (QuantumBlockEncoding.Coeff.symbol "f_3_0").mul (QuantumBlockEncoding.Coeff.symbol "N_f_inv"), QuantumBlockEncoding.Coeff.rat 1, QuantumBlockEncoding.Coeff.rat 1] ∧ QuantumBlockEncoding.GHL2025.indicatorOracleMatrix p row32 row32 = QuantumBlockEncoding.Coeff.rat 1 ∧ QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTRotationMatrix p row32 row32 = QuantumBlockEncoding.Coeff.rat 1 ∧ QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTRotationMatrix p row33 row32 = QuantumBlockEncoding.Coeff.rat 0 ∧ QuantumBlockEncoding.GHL2025.boundaryRotationMatrix p row32 row32 = QuantumBlockEncoding.Coeff.symbol "boundary_cos_half_0_2" ∧ QuantumBlockEncoding.GHL2025.boundaryRotationMatrix p row33 row32 = QuantumBlockEncoding.Coeff.symbol "boundary_sin_half_0_2" ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperMatrix p row0 row32 = QuantumBlockEncoding.Coeff.rat 1 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperMatrix p row1 row33 = QuantumBlockEncoding.Coeff.rat 1 ∧ QuantumBlockEncoding.GHL2025.functionOraclePaperMatrix p row0 row0 = (QuantumBlockEncoding.Coeff.symbol "f_3_0").mul (QuantumBlockEncoding.Coeff.symbol "N_f_inv") ∧ QuantumBlockEncoding.GHL2025.functionOraclePaperMatrix p row1 row1 = (QuantumBlockEncoding.Coeff.symbol "f_3_0").mul (QuantumBlockEncoding.Coeff.symbol "N_f_inv") ∧ QuantumBlockEncoding.GHL2025.swapOracleMatrix p row0 row0 = QuantumBlockEncoding.Coeff.rat 1 ∧ QuantumBlockEncoding.GHL2025.swapOracleMatrix p row1 row1 = QuantumBlockEncoding.Coeff.rat 1 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperDaggerMatrix p row32 row0 = QuantumBlockEncoding.Coeff.rat 1 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperDaggerMatrix p row33 row1 = QuantumBlockEncoding.Coeff.rat 1 ∧ interface.productObligation.source = "GHL2025 Eq. ROBIN clarified gamma3 line, Theorem one-term block-encoding, Fig. 1-term ROBIN, Definition def:block-encoding; cited-results row LCU.StandardBlockEncoding" ∧ interface.productObligation.proved = false ∧ interface.projectionSlotConvention.proved = false ∧ interface.uniquePathSupportObligation.proved = false ∧ interface.exactProductEqualityProved = false ∧ interface.boundaryRotationNormalizerProved = false ∧ interface.productToCoefficientProved = false ∧ interface.lcuCorrectProved = false ∧ ⋯
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3BoundaryProductToCoefficientInterface_n3_transcript : let p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3; let fullDim := QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits p); have interface := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3BoundaryProductToCoefficientInterface_n3; have sysRow := ⟨0, ⋯⟩; have sysCol := ⟨0, ⋯⟩; have row0 := ⟨0, ⋯⟩; have row1 := ⟨1, ⋯⟩; have row32 := ⟨32, ⋯⟩; have row33 := ⟨33, ⋯⟩; interface.systemRow = ↑sysRow ∧ interface.systemColumn = ↑sysCol ∧ interface.sparseSlot = 2 ∧ QuantumBlockEncoding.GHL2025.oneTermRobinGlobalSparseAddress 3 interface.sparseSlot interface.systemColumn = interface.systemRow ∧ interface.cleanSource = 32 ∧ interface.afterIndic = 32 ∧ interface.afterOdtsKetZero = 32 ∧ interface.afterRyKetZero = 32 ∧ interface.afterRyKetOne = 33 ∧ interface.afterOdbsKetZero = 0 ∧ interface.afterOdbsKetOne = 1 ∧ interface.afterOfKetZero = 0 ∧ interface.afterOfKetOne = 1 ∧ interface.afterSwapKetZero = 0 ∧ interface.afterSwapKetOne = 1 ∧ interface.daggerKetZeroEndpoint = 32 ∧ interface.daggerKetOneEndpoint = 33 ∧ List.length QuantumBlockEncoding.GHL2025.oneTermRobinCircuit = interface.ketZeroFactors.length ∧ interface.ketZeroFactors = [QuantumBlockEncoding.Coeff.rat 1, QuantumBlockEncoding.Coeff.rat 1, QuantumBlockEncoding.Coeff.symbol "boundary_cos_half_0_2", QuantumBlockEncoding.Coeff.rat 1, (QuantumBlockEncoding.Coeff.symbol "f_3_0").mul (QuantumBlockEncoding.Coeff.symbol "N_f_inv"), QuantumBlockEncoding.Coeff.rat 1, QuantumBlockEncoding.Coeff.rat 1] ∧ List.length QuantumBlockEncoding.GHL2025.oneTermRobinCircuit = interface.adjacentKetOneFactors.length ∧ interface.adjacentKetOneFactors = [QuantumBlockEncoding.Coeff.rat 1, QuantumBlockEncoding.Coeff.rat 0, QuantumBlockEncoding.Coeff.symbol "boundary_sin_half_0_2", QuantumBlockEncoding.Coeff.rat 1, (QuantumBlockEncoding.Coeff.symbol "f_3_0").mul (QuantumBlockEncoding.Coeff.symbol "N_f_inv"), QuantumBlockEncoding.Coeff.rat 1, QuantumBlockEncoding.Coeff.rat 1] ∧ QuantumBlockEncoding.GHL2025.indicatorOracleMatrix p row32 row32 = QuantumBlockEncoding.Coeff.rat 1 ∧ QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTRotationMatrix p row32 row32 = QuantumBlockEncoding.Coeff.rat 1 ∧ QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTRotationMatrix p row33 row32 = QuantumBlockEncoding.Coeff.rat 0 ∧ QuantumBlockEncoding.GHL2025.boundaryRotationMatrix p row32 row32 = QuantumBlockEncoding.Coeff.symbol "boundary_cos_half_0_2" ∧ QuantumBlockEncoding.GHL2025.boundaryRotationMatrix p row33 row32 = QuantumBlockEncoding.Coeff.symbol "boundary_sin_half_0_2" ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperMatrix p row0 row32 = QuantumBlockEncoding.Coeff.rat 1 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperMatrix p row1 row33 = QuantumBlockEncoding.Coeff.rat 1 ∧ QuantumBlockEncoding.GHL2025.functionOraclePaperMatrix p row0 row0 = (QuantumBlockEncoding.Coeff.symbol "f_3_0").mul (QuantumBlockEncoding.Coeff.symbol "N_f_inv") ∧ QuantumBlockEncoding.GHL2025.functionOraclePaperMatrix p row1 row1 = (QuantumBlockEncoding.Coeff.symbol "f_3_0").mul (QuantumBlockEncoding.Coeff.symbol "N_f_inv") ∧ QuantumBlockEncoding.GHL2025.swapOracleMatrix p row0 row0 = QuantumBlockEncoding.Coeff.rat 1 ∧ QuantumBlockEncoding.GHL2025.swapOracleMatrix p row1 row1 = QuantumBlockEncoding.Coeff.rat 1 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperDaggerMatrix p row32 row0 = QuantumBlockEncoding.Coeff.rat 1 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperDaggerMatrix p row33 row1 = QuantumBlockEncoding.Coeff.rat 1 ∧ interface.productObligation.source = "GHL2025 Eq. ROBIN clarified gamma3 line, Theorem one-term block-encoding, Fig. 1-term ROBIN, Definition def:block-encoding; cited-results row LCU.StandardBlockEncoding" ∧ interface.productObligation.proved = false ∧ interface.projectionSlotConvention.proved = false ∧ interface.uniquePathSupportObligation.proved = false ∧ interface.exactProductEqualityProved = false ∧ interface.boundaryRotationNormalizerProved = false ∧ interface.productToCoefficientProved = false ∧ interface.lcuCorrectProved = false ∧ ⋯
Transcript theorem for the boundary product interface. This proves the branch-specific data and factor list used by the next unique-path product attempt. It deliberately keeps the unique-path support obligation, product-to-coefficient obligation, projection-slot convention, LCU composition, block projection, block correctness, and final extraction false.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary unique path support audit”. A proposition-valued field is a requirement until a constructor supplies it. Boundary unique-path support audit for the displayed 'n = 3' gamma3 branch.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Boundary unique-path support audit for the displayed 'n = 3' gamma3 branch. This record is intentionally narrower than the final product theorem. It proves the concrete adjacent-branch zero entries currently available from the gate skeletons, then names the first missing global support interface needed before 'Matrix.evalWith_mul_unique_path' can isolate the full seven-gate product.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:6408. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.124●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryUniquePathSupportAudit : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryUniquePathSupportAudit : Type
Boundary unique-path support audit for the displayed `n = 3` gamma3 branch. This record is intentionally narrower than the final product theorem. It proves the concrete adjacent-branch zero entries currently available from the gate skeletons, then names the first missing global support interface needed before `Matrix.evalWith_mul_unique_path` can isolate the full seven-gate product.
Fields
sourceAnchor : String
systemRow : ℕ
systemColumn : ℕ
sparseSlot : ℕ
sourceColumn : ℕ
targetRow : ℕ
survivingKetZeroPath : List ℕ
adjacentKetOnePath : List ℕ
odtsKetOneProbeEntry : QuantumBlockEncoding.Coeff
adjacentOfTargetEntry : QuantumBlockEncoding.Coeff
adjacentDaggerTargetEntry : QuantumBlockEncoding.Coeff
adjacentBranchKilledAtOf : Bool
adjacentBranchKilledAtDagger : Bool
firstMissingGateIndex : ℕ
firstMissingSupportRows : String
firstMissingSupportColumn : ℕ
firstMissingMatrixEntry : String
supportComplete : Bool
uniquePathSupportObligation : QuantumBlockEncoding.SemanticObligation
productObligation : QuantumBlockEncoding.SemanticObligation
projectionSlotConvention : QuantumBlockEncoding.SemanticObligation
exactProductEqualityProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
Plain-English reading. This definition gives the library's named construction or computation for “one term robin block encoding proof route gamma 3 boundary unique path support audit n 3”. Compiled audit for the first boundary unique-path support packet.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Compiled audit for the first boundary unique-path support packet. The target path is the ket-zero branch '32 -> 32 -> 32 -> 32 -> 0 -> 0 -> 0 -> 32'. The adjacent boundary-rotation ket-one branch reaches the row-'33' endpoint, and its contribution to target row '32' is killed by concrete zero entries in the current 'O_f' and dagger matrices. The remaining all-other-path support theorem is still an explicit false obligation.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:6447. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.125●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3BoundaryUniquePathSupportAudit_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryUniquePathSupportAudit
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3BoundaryUniquePathSupportAudit_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryUniquePathSupportAudit
Compiled audit for the first boundary unique-path support packet. The target path is the ket-zero branch `32 -> 32 -> 32 -> 32 -> 0 -> 0 -> 0 -> 32`. The adjacent boundary-rotation ket-one branch reaches the row-`33` endpoint, and its contribution to target row `32` is killed by concrete zero entries in the current `O_f` and dagger matrices. The remaining all-other-path support theorem is still an explicit false obligation.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route gamma 3 boundary unique path support n 3”; its local proof does not by itself complete the broader paper route. First boundary unique-path support result.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. First boundary unique-path support result. This theorem compiles the concrete zero entries for the adjacent ket-one branch and records the remaining missing prefix-support theorem. It deliberately does not prove the all-path support condition, does not apply 'Matrix.evalWith_mul_unique_path' to the seven-gate product, and does not promote any product, projection, LCU, block-correctness, or extraction flag.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:6519. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.126●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3BoundaryUniquePathSupport_n3 : let p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3; let fullDim := QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits p); have audit := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3BoundaryUniquePathSupportAudit_n3; have row0 := ⟨0, ⋯⟩; have row1 := ⟨1, ⋯⟩; have row32 := ⟨32, ⋯⟩; have row33 := ⟨33, ⋯⟩; audit.systemRow = 0 ∧ audit.systemColumn = 0 ∧ audit.sparseSlot = 2 ∧ audit.sourceColumn = 32 ∧ audit.targetRow = 32 ∧ audit.survivingKetZeroPath = [32, 32, 32, 32, 0, 0, 0, 32] ∧ audit.adjacentKetOnePath = [32, 32, 32, 33, 1, 1, 1, 33] ∧ audit.odtsKetOneProbeEntry = QuantumBlockEncoding.Coeff.rat 0 ∧ QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTRotationMatrix p row33 row32 = QuantumBlockEncoding.Coeff.rat 0 ∧ audit.adjacentOfTargetEntry = QuantumBlockEncoding.Coeff.rat 0 ∧ QuantumBlockEncoding.GHL2025.functionOraclePaperMatrix p row0 row1 = QuantumBlockEncoding.Coeff.rat 0 ∧ audit.adjacentDaggerTargetEntry = QuantumBlockEncoding.Coeff.rat 0 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperDaggerMatrix p row32 row1 = QuantumBlockEncoding.Coeff.rat 0 ∧ audit.adjacentBranchKilledAtOf = true ∧ audit.adjacentBranchKilledAtDagger = true ∧ audit.firstMissingGateIndex = 3 ∧ audit.firstMissingSupportRows = "all intermediate rows k not in {0,1} after O_D^BS" ∧ audit.firstMissingSupportColumn = 32 ∧ audit.firstMissingMatrixEntry = "(O_D^BS * Ry_boundary * O_DT^S * U_indic)[k,32]" ∧ audit.supportComplete = false ∧ audit.uniquePathSupportObligation.proved = false ∧ audit.productObligation.proved = false ∧ audit.projectionSlotConvention.proved = false ∧ audit.exactProductEqualityProved = false ∧ audit.productToCoefficientProved = false ∧ audit.lcuCorrectProved = false ∧ audit.blockProjectionProved = false ∧ audit.blockCorrectProved = false ∧ audit.finalExtractionProved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).theoremData.obligations.blockExtraction.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3BoundaryUniquePathSupport_n3 : let p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3; let fullDim := QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits p); have audit := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3BoundaryUniquePathSupportAudit_n3; have row0 := ⟨0, ⋯⟩; have row1 := ⟨1, ⋯⟩; have row32 := ⟨32, ⋯⟩; have row33 := ⟨33, ⋯⟩; audit.systemRow = 0 ∧ audit.systemColumn = 0 ∧ audit.sparseSlot = 2 ∧ audit.sourceColumn = 32 ∧ audit.targetRow = 32 ∧ audit.survivingKetZeroPath = [32, 32, 32, 32, 0, 0, 0, 32] ∧ audit.adjacentKetOnePath = [32, 32, 32, 33, 1, 1, 1, 33] ∧ audit.odtsKetOneProbeEntry = QuantumBlockEncoding.Coeff.rat 0 ∧ QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTRotationMatrix p row33 row32 = QuantumBlockEncoding.Coeff.rat 0 ∧ audit.adjacentOfTargetEntry = QuantumBlockEncoding.Coeff.rat 0 ∧ QuantumBlockEncoding.GHL2025.functionOraclePaperMatrix p row0 row1 = QuantumBlockEncoding.Coeff.rat 0 ∧ audit.adjacentDaggerTargetEntry = QuantumBlockEncoding.Coeff.rat 0 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperDaggerMatrix p row32 row1 = QuantumBlockEncoding.Coeff.rat 0 ∧ audit.adjacentBranchKilledAtOf = true ∧ audit.adjacentBranchKilledAtDagger = true ∧ audit.firstMissingGateIndex = 3 ∧ audit.firstMissingSupportRows = "all intermediate rows k not in {0,1} after O_D^BS" ∧ audit.firstMissingSupportColumn = 32 ∧ audit.firstMissingMatrixEntry = "(O_D^BS * Ry_boundary * O_DT^S * U_indic)[k,32]" ∧ audit.supportComplete = false ∧ audit.uniquePathSupportObligation.proved = false ∧ audit.productObligation.proved = false ∧ audit.projectionSlotConvention.proved = false ∧ audit.exactProductEqualityProved = false ∧ audit.productToCoefficientProved = false ∧ audit.lcuCorrectProved = false ∧ audit.blockProjectionProved = false ∧ audit.blockCorrectProved = false ∧ audit.finalExtractionProved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).theoremData.obligations.blockExtraction.proved = false
First boundary unique-path support result. This theorem compiles the concrete zero entries for the adjacent ket-one branch and records the remaining missing prefix-support theorem. It deliberately does not prove the all-path support condition, does not apply `Matrix.evalWith_mul_unique_path` to the seven-gate product, and does not promote any product, projection, LCU, block-correctness, or extraction flag.
Plain-English reading. This abbreviation gives a shorter name to the type or expression used for “one term robin gamma 3 boundary prefix parameters n 3”. Parameters for the focused 'n = 3' displayed-boundary gamma3 prefix packet.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Parameters for the focused 'n = 3' displayed-boundary gamma3 prefix packet.
Declaration kind. abbrev.
Source: QuantumBlockEncoding/RobinMatrix.lean:6576. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.127●1 definition
Associated Lean declarations
-
abbrevdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
abbrev QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixParameters_n3 : QuantumBlockEncoding.GHL2025.OneTermRobinParameters
abbrev QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixParameters_n3 : QuantumBlockEncoding.GHL2025.OneTermRobinParameters
Parameters for the focused `n = 3` displayed-boundary gamma3 prefix packet.
Plain-English reading. This abbreviation gives a shorter name to the type or expression used for “one term robin gamma 3 boundary prefix dim n 3”. Full matrix dimension for the focused boundary gamma3 prefix packet.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Full matrix dimension for the focused boundary gamma3 prefix packet.
Declaration kind. abbrev.
Source: QuantumBlockEncoding/RobinMatrix.lean:6581. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.128●1 definition
Associated Lean declarations
-
abbrevdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
abbrev QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixDim_n3 : ℕ
abbrev QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixDim_n3 : ℕ
Full matrix dimension for the focused boundary gamma3 prefix packet.
Plain-English reading. This abbreviation gives a shorter name to the type or expression used for “one term robin gamma 3 boundary prefix source n 3”. Full source column '32' for the focused boundary gamma3 prefix packet.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Full source column '32' for the focused boundary gamma3 prefix packet.
Declaration kind. abbrev.
Source: QuantumBlockEncoding/RobinMatrix.lean:6586. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.129●1 definition
Associated Lean declarations
-
abbrevdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
abbrev QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3 : Fin QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixDim_n3
abbrev QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3 : Fin QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixDim_n3
Full source column `32` for the focused boundary gamma3 prefix packet.
Plain-English reading. This abbreviation gives a shorter name to the type or expression used for “one term robin gamma 3 boundary prefix row 0 n 3”. Prefix row '0', the ket-zero image after the forward 'O_D^BS' gate.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Prefix row '0', the ket-zero image after the forward 'O_D^BS' gate.
Declaration kind. abbrev.
Source: QuantumBlockEncoding/RobinMatrix.lean:6591. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.130●1 definition
Associated Lean declarations
-
abbrevdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
abbrev QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3 : Fin QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixDim_n3
abbrev QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3 : Fin QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixDim_n3
Prefix row `0`, the ket-zero image after the forward `O_D^BS` gate.
Plain-English reading. This abbreviation gives a shorter name to the type or expression used for “one term robin gamma 3 boundary prefix row 1 n 3”. Prefix row '1', the adjacent ket-one image after the forward 'O_D^BS' gate.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Prefix row '1', the adjacent ket-one image after the forward 'O_D^BS' gate.
Declaration kind. abbrev.
Source: QuantumBlockEncoding/RobinMatrix.lean:6596. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.131●1 definition
Associated Lean declarations
-
abbrevdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
abbrev QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow1_n3 : Fin QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixDim_n3
abbrev QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow1_n3 : Fin QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixDim_n3
Prefix row `1`, the adjacent ket-one image after the forward `O_D^BS` gate.
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary du prefix matrix n 3”. Two-gate prefix 'O_DT^S * U_indic' for the displayed-boundary gamma3 packet.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Two-gate prefix 'O_DT^S * U_indic' for the displayed-boundary gamma3 packet.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:6605. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.132●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryDUPrefixMatrix_n3 : QuantumBlockEncoding.Matrix QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixDim_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixDim_n3 QuantumBlockEncoding.Coeff
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryDUPrefixMatrix_n3 : QuantumBlockEncoding.Matrix QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixDim_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixDim_n3 QuantumBlockEncoding.Coeff
Two-gate prefix `O_DT^S * U_indic` for the displayed-boundary gamma3 packet.
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary rdu prefix matrix n 3”. Three-gate prefix 'Ry_boundary * O_DT^S * U_indic'.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Three-gate prefix 'Ry_boundary * O_DT^S * U_indic'.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:6613. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.133●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRDUPrefixMatrix_n3 : QuantumBlockEncoding.Matrix QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixDim_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixDim_n3 QuantumBlockEncoding.Coeff
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRDUPrefixMatrix_n3 : QuantumBlockEncoding.Matrix QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixDim_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixDim_n3 QuantumBlockEncoding.Coeff
Three-gate prefix `Ry_boundary * O_DT^S * U_indic`.
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary prefix matrix n 3”. Four-gate prefix 'O_D^BS * Ry_boundary * O_DT^S * U_indic'.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Four-gate prefix 'O_D^BS * Ry_boundary * O_DT^S * U_indic'.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:6621. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.134●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixMatrix_n3 : QuantumBlockEncoding.Matrix QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixDim_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixDim_n3 QuantumBlockEncoding.Coeff
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixMatrix_n3 : QuantumBlockEncoding.Matrix QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixDim_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixDim_n3 QuantumBlockEncoding.Coeff
Four-gate prefix `O_D^BS * Ry_boundary * O_DT^S * U_indic`.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary du prefix support n 3”; its local proof does not by itself complete the broader paper route. The two-gate boundary prefix has no evaluated support away from source column '32'.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The two-gate boundary prefix has no evaluated support away from source column '32'. This is an evaluated-matrix support theorem. It does not simplify the raw symbolic 'Coeff' fold and does not promote the product-to-coefficient obligation.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:6744. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.135●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryDUPrefixSupport_n3 (env : String → ℚ) (i : Fin QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixDim_n3) (hi : i ≠ QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryDUPrefixMatrix_n3 i QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3) = 0
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryDUPrefixSupport_n3 (env : String → ℚ) (i : Fin QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixDim_n3) (hi : i ≠ QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryDUPrefixMatrix_n3 i QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3) = 0
The two-gate boundary prefix has no evaluated support away from source column `32`. This is an evaluated-matrix support theorem. It does not simplify the raw symbolic `Coeff` fold and does not promote the product-to-coefficient obligation.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary rdu prefix support n 3”; its local proof does not by itself complete the broader paper route. The three-gate boundary prefix has evaluated support only in rows '32' and '33'.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The three-gate boundary prefix has evaluated support only in rows '32' and '33'.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:6762. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.136●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRDUPrefixSupport_n3 (env : String → ℚ) (i : Fin QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixDim_n3) (hi32 : i ≠ QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3) (hi33 : i ≠ QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow33_n3✝) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRDUPrefixMatrix_n3 i QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3) = 0
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRDUPrefixSupport_n3 (env : String → ℚ) (i : Fin QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixDim_n3) (hi32 : i ≠ QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3) (hi33 : i ≠ QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow33_n3✝) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRDUPrefixMatrix_n3 i QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3) = 0
The three-gate boundary prefix has evaluated support only in rows `32` and `33`.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route gamma 3 boundary prefix support n 3”; its local proof does not by itself complete the broader paper route. Boundary prefix support for the displayed gamma3 branch at 'n = 3'.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Boundary prefix support for the displayed gamma3 branch at 'n = 3'. For the branch-correct source column '32', the evaluated four-gate prefix 'O_D^BS * Ry_boundary * O_DT^S * U_indic' can land only in rows '0' and '1'. This is the missing prefix-support block named by the previous audit. It does not prove the seven-gate product equality, projection-slot convention, LCU composition, block projection, block correctness, or final extraction.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:6787. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.137●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3BoundaryPrefixSupport_n3 (env : String → ℚ) (i : Fin QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixDim_n3) (hi0 : i ≠ QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3) (hi1 : i ≠ QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow1_n3) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixMatrix_n3 i QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3) = 0
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3BoundaryPrefixSupport_n3 (env : String → ℚ) (i : Fin QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixDim_n3) (hi0 : i ≠ QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3) (hi1 : i ≠ QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow1_n3) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixMatrix_n3 i QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3) = 0
Boundary prefix support for the displayed gamma3 branch at `n = 3`. For the branch-correct source column `32`, the evaluated four-gate prefix `O_D^BS * Ry_boundary * O_DT^S * U_indic` can land only in rows `0` and `1`. This is the missing prefix-support block named by the previous audit. It does not prove the seven-gate product equality, projection-slot convention, LCU composition, block projection, block correctness, or final extraction.
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary of swap matrix n 3”. Two-gate suffix 'SWAP * O_f' for the displayed-boundary gamma3 packet.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Two-gate suffix 'SWAP * O_f' for the displayed-boundary gamma3 packet.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:6807. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.138●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryOfSwapMatrix_n3 : QuantumBlockEncoding.Matrix QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixDim_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixDim_n3 QuantumBlockEncoding.Coeff
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryOfSwapMatrix_n3 : QuantumBlockEncoding.Matrix QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixDim_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixDim_n3 QuantumBlockEncoding.Coeff
Two-gate suffix `SWAP * O_f` for the displayed-boundary gamma3 packet.
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary suffix matrix n 3”. Three-gate suffix '(O_D^BS)^† * SWAP * O_f'.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Three-gate suffix '(O_D^BS)^† * SWAP * O_f'.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:6814. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.139●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySuffixMatrix_n3 : QuantumBlockEncoding.Matrix QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixDim_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixDim_n3 QuantumBlockEncoding.Coeff
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySuffixMatrix_n3 : QuantumBlockEncoding.Matrix QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixDim_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixDim_n3 QuantumBlockEncoding.Coeff
Three-gate suffix `(O_D^BS)^† * SWAP * O_f`.
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary seven gate matrix n 3”. Full seven-gate matrix for the focused displayed-boundary gamma3 packet.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Full seven-gate matrix for the focused displayed-boundary gamma3 packet. This is only the finite matrix product for the branch-correct 'n = 3', row-'32', column-'32' support proof. It does not promote any semantic obligation on the theorem route.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:6828. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.140●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySevenGateMatrix_n3 : QuantumBlockEncoding.Matrix QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixDim_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixDim_n3 QuantumBlockEncoding.Coeff
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySevenGateMatrix_n3 : QuantumBlockEncoding.Matrix QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixDim_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixDim_n3 QuantumBlockEncoding.Coeff
Full seven-gate matrix for the focused displayed-boundary gamma3 packet. This is only the finite matrix product for the branch-correct `n = 3`, row-`32`, column-`32` support proof. It does not promote any semantic obligation on the theorem route.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary of swap row 0 col 1 zero n 3”; its local proof does not by itself complete the broader paper route. After 'O_f' and 'SWAP', the adjacent ket-one column has no evaluated support at row '0'.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. After 'O_f' and 'SWAP', the adjacent ket-one column has no evaluated support at row '0'. This is the suffix-side companion to the prefix support theorem. It uses the compiled clean-workspace zero entry 'O_f[0,1] = 0' and SWAP row-'0' support instead of expanding the full symbolic product.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:6897. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.141●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryOfSwapRow0Col1_zero_n3 (env : String → ℚ) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryOfSwapMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow1_n3) = 0
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryOfSwapRow0Col1_zero_n3 (env : String → ℚ) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryOfSwapMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow1_n3) = 0
After `O_f` and `SWAP`, the adjacent ket-one column has no evaluated support at row `0`. This is the suffix-side companion to the prefix support theorem. It uses the compiled clean-workspace zero entry `O_f[0,1] = 0` and SWAP row-`0` support instead of expanding the full symbolic product.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary suffix row 32 col 1 zero n 3”; its local proof does not by itself complete the broader paper route. The suffix '(O_D^BS)^† * SWAP * O_f' kills the adjacent row-'1' branch when the target row is the boundary row '32'.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The suffix '(O_D^BS)^† * SWAP * O_f' kills the adjacent row-'1' branch when the target row is the boundary row '32'.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:6921. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.142●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySuffixRow32Col1_zero_n3 (env : String → ℚ) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySuffixMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow1_n3) = 0
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySuffixRow32Col1_zero_n3 (env : String → ℚ) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySuffixMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow1_n3) = 0
The suffix `(O_D^BS)^† * SWAP * O_f` kills the adjacent row-`1` branch when the target row is the boundary row `32`.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route gamma 3 boundary seven gate support n 3”; its local proof does not by itself complete the broader paper route. Seven-gate support for the displayed 'n = 3' gamma3 boundary branch.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Seven-gate support for the displayed 'n = 3' gamma3 boundary branch. For the full product written as 'suffix * prefix', every evaluated contribution from source column '32' to target row '32' vanishes unless the intermediate row between the prefix and suffix is row '0'. Rows outside '{0,1}' are killed by the compiled prefix-support theorem; row '1' is killed by the suffix-side 'O_f'/SWAP/dagger support above. Product-to-coefficient, projection, LCU, block-correctness, and final-extraction obligations remain false.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:6945. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.143●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3BoundarySevenGateSupport_n3 (env : String → ℚ) (q : Fin QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixDim_n3) (hq0 : q ≠ QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySuffixMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3 q) * QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixMatrix_n3 q QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3) = 0
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3BoundarySevenGateSupport_n3 (env : String → ℚ) (q : Fin QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixDim_n3) (hq0 : q ≠ QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySuffixMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3 q) * QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixMatrix_n3 q QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3) = 0
Seven-gate support for the displayed `n = 3` gamma3 boundary branch. For the full product written as `suffix * prefix`, every evaluated contribution from source column `32` to target row `32` vanishes unless the intermediate row between the prefix and suffix is row `0`. Rows outside `{0,1}` are killed by the compiled prefix-support theorem; row `1` is killed by the suffix-side `O_f`/SWAP/dagger support above. Product-to-coefficient, projection, LCU, block-correctness, and final-extraction obligations remain false.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route gamma 3 boundary seven gate unique path n 3”; its local proof does not by itself complete the broader paper route. One-step unique-path reduction for the focused seven-gate boundary entry.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. One-step unique-path reduction for the focused seven-gate boundary entry. This applies the generic evaluated-product reducer to the already isolated row-'0' intermediate branch. It is not the gamma3 coefficient theorem and it does not change any 'proved' flag.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:6970. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.144●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3BoundarySevenGateUniquePath_n3 (env : String → ℚ) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySevenGateMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3) = QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySuffixMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3) * QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3)
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3BoundarySevenGateUniquePath_n3 (env : String → ℚ) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySevenGateMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3) = QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySuffixMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3) * QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3)
One-step unique-path reduction for the focused seven-gate boundary entry. This applies the generic evaluated-product reducer to the already isolated row-`0` intermediate branch. It is not the gamma3 coefficient theorem and it does not change any `proved` flag.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary du prefix entry eval n 3”; its local proof does not by itself complete the broader paper route. The two-gate 'O_DT^S * U_indic' prefix contributes unit amplitude on the boundary source column '32'.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The two-gate 'O_DT^S * U_indic' prefix contributes unit amplitude on the boundary source column '32'.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:6995. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.145●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryDUPrefixEntryEval_n3 (env : String → ℚ) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryDUPrefixMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3) = 1
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryDUPrefixEntryEval_n3 (env : String → ℚ) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryDUPrefixMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3) = 1
The two-gate `O_DT^S * U_indic` prefix contributes unit amplitude on the boundary source column `32`.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary rdu prefix entry eval n 3”; its local proof does not by itself complete the broader paper route. The three-gate 'Ry_boundary * O_DT^S * U_indic' prefix contributes the boundary half-angle cosine on source column '32'.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The three-gate 'Ry_boundary * O_DT^S * U_indic' prefix contributes the boundary half-angle cosine on source column '32'.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:7045. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.146●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRDUPrefixEntryEval_n3 (env : String → ℚ) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRDUPrefixMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3) = env "boundary_cos_half_0_2"
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRDUPrefixEntryEval_n3 (env : String → ℚ) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRDUPrefixMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3) = env "boundary_cos_half_0_2"
The three-gate `Ry_boundary * O_DT^S * U_indic` prefix contributes the boundary half-angle cosine on source column `32`.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary prefix entry eval n 3”; its local proof does not by itself complete the broader paper route. The four-gate prefix entry from source column '32' to row '0' is the boundary half-angle cosine.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The four-gate prefix entry from source column '32' to row '0' is the boundary half-angle cosine.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:7087. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.147●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixEntryEval_n3 (env : String → ℚ) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3) = env "boundary_cos_half_0_2"
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixEntryEval_n3 (env : String → ℚ) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3) = env "boundary_cos_half_0_2"
The four-gate prefix entry from source column `32` to row `0` is the boundary half-angle cosine.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary of swap entry eval n 3”; its local proof does not by itself complete the broader paper route. The 'SWAP * O_f' suffix prefix on row/column '0' contributes the clean function-oracle amplitude 'f_3_0 * N_f_inv'.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The 'SWAP * O_f' suffix prefix on row/column '0' contributes the clean function-oracle amplitude 'f_3_0 * N_f_inv'.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:7140. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.148●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryOfSwapEntryEval_n3 (env : String → ℚ) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryOfSwapMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3) = env "f_3_0" * env "N_f_inv"
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryOfSwapEntryEval_n3 (env : String → ℚ) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryOfSwapMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3) = env "f_3_0" * env "N_f_inv"
The `SWAP * O_f` suffix prefix on row/column `0` contributes the clean function-oracle amplitude `f_3_0 * N_f_inv`.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary suffix entry eval n 3”; its local proof does not by itself complete the broader paper route. The three-gate suffix entry from row '32' to the row-'0' intermediate state is the clean function-oracle amplitude.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The three-gate suffix entry from row '32' to the row-'0' intermediate state is the clean function-oracle amplitude.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:7191. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.149●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySuffixEntryEval_n3 (env : String → ℚ) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySuffixMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3) = env "f_3_0" * env "N_f_inv"
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySuffixEntryEval_n3 (env : String → ℚ) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySuffixMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3) = env "f_3_0" * env "N_f_inv"
The three-gate suffix entry from row `32` to the row-`0` intermediate state is the clean function-oracle amplitude.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route gamma 3 boundary product entry eval n 3”; its local proof does not by itself complete the broader paper route. Evaluated seven-gate product entry for the displayed boundary 'gamma3' packet.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Evaluated seven-gate product entry for the displayed boundary 'gamma3' packet. This proves the finite row-'32', column-'32' branch product after the compiled unique-path reduction. It is still only the branch product evaluation: the paper-level product-to-'A_k' coefficient theorem, sparse-register projection convention, LCU composition, block projection, block correctness, and final extraction remain separate false obligations.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:7238. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.150●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3BoundaryProductEntryEval_n3 (env : String → ℚ) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySevenGateMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3) = env "f_3_0" * env "N_f_inv" * env "boundary_cos_half_0_2"
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3BoundaryProductEntryEval_n3 (env : String → ℚ) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySevenGateMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3) = env "f_3_0" * env "N_f_inv" * env "boundary_cos_half_0_2"
Evaluated seven-gate product entry for the displayed boundary `gamma3` packet. This proves the finite row-`32`, column-`32` branch product after the compiled unique-path reduction. It is still only the branch product evaluation: the paper-level product-to-`A_k` coefficient theorem, sparse-register projection convention, LCU composition, block projection, block correctness, and final extraction remain separate false obligations.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary du prefix col 0 support n 3”; its local proof does not by itself complete the broader paper route. Two-gate 'O_DT^S * U_indic' prefix support at column '0'.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Two-gate 'O_DT^S * U_indic' prefix support at column '0'. Both 'U_indic' and 'O_DT^S' act as the identity on state '|0⟩' (indicator bit is zero), so the DU prefix at column '0' has support only at row '0'.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:7322. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.151●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryDUPrefixCol0Support_n3 (env : String → ℚ) (i : Fin QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixDim_n3) (hi : i ≠ QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryDUPrefixMatrix_n3 i QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3) = 0
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryDUPrefixCol0Support_n3 (env : String → ℚ) (i : Fin QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixDim_n3) (hi : i ≠ QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryDUPrefixMatrix_n3 i QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3) = 0
Two-gate `O_DT^S * U_indic` prefix support at column `0`. Both `U_indic` and `O_DT^S` act as the identity on state `|0⟩` (indicator bit is zero), so the DU prefix at column `0` has support only at row `0`.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary rdu prefix col 0 support n 3”; its local proof does not by itself complete the broader paper route. Three-gate 'Ry * O_DT^S * U_indic' prefix support at column '0'.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Three-gate 'Ry * O_DT^S * U_indic' prefix support at column '0'. Since 'DU' feeds only row '0' into 'Ry', and 'Ry' at column '0' acts on the pair '{0, 1}', the RDU prefix at column '0' has support only at rows '{0, 1}'.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:7422. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.152●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRDUPrefixCol0Support_n3 (env : String → ℚ) (i : Fin QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixDim_n3) (hi0 : i ≠ QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3) (hi1 : i ≠ QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow1_n3) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRDUPrefixMatrix_n3 i QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3) = 0
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRDUPrefixCol0Support_n3 (env : String → ℚ) (i : Fin QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixDim_n3) (hi0 : i ≠ QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3) (hi1 : i ≠ QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow1_n3) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRDUPrefixMatrix_n3 i QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3) = 0
Three-gate `Ry * O_DT^S * U_indic` prefix support at column `0`. Since `DU` feeds only row `0` into `Ry`, and `Ry` at column `0` acts on the pair `{0, 1}`, the RDU prefix at column `0` has support only at rows `{0, 1}`.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary prefix col 0 support n 3”; its local proof does not by itself complete the broader paper route. Four-gate prefix 'O_D^BS * Ry * O_DT^S * U_indic' support at column '0'.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Four-gate prefix 'O_D^BS * Ry * O_DT^S * U_indic' support at column '0'. The RDU prefix feeds rows '{0, 1}' into 'O_D^BS'. Since 'image(0) = 96' and 'image(1) = 97', the full prefix at column '0' has support only at rows '{96, 97}'.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:7445. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.153●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixCol0Support_n3 (env : String → ℚ) (i : Fin QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixDim_n3) (hi96 : ↑i ≠ 96) (hi97 : ↑i ≠ 97) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixMatrix_n3 i QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3) = 0
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixCol0Support_n3 (env : String → ℚ) (i : Fin QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixDim_n3) (hi96 : ↑i ≠ 96) (hi97 : ↑i ≠ 97) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixMatrix_n3 i QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3) = 0
Four-gate prefix `O_D^BS * Ry * O_DT^S * U_indic` support at column `0`. The RDU prefix feeds rows `{0, 1}` into `O_D^BS`. Since `image(0) = 96` and `image(1) = 97`, the full prefix at column `0` has support only at rows `{96, 97}`.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary du prefix col 0 entry eval n 3”; its local proof does not by itself complete the broader paper route. The two-gate prefix at column '0' contributes unit amplitude on row '0'.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The two-gate prefix at column '0' contributes unit amplitude on row '0'. This is the column-'0' analogue of 'oneTermRobinGamma3BoundaryDUPrefixEntryEval_n3'; it feeds the two-path decomposition for the active '[0,0]' entry.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:7471. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.154●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryDUPrefixCol0EntryEval_n3 (env : String → ℚ) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryDUPrefixMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3) = 1
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryDUPrefixCol0EntryEval_n3 (env : String → ℚ) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryDUPrefixMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3) = 1
The two-gate prefix at column `0` contributes unit amplitude on row `0`. This is the column-`0` analogue of `oneTermRobinGamma3BoundaryDUPrefixEntryEval_n3`; it feeds the two-path decomposition for the active `[0,0]` entry.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary rdu prefix row 0 col 0 eval n 3”; its local proof does not by itself complete the broader paper route. The three-gate column-'0' prefix row '0' is the slot-'0' boundary cosine entry.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The three-gate column-'0' prefix row '0' is the slot-'0' boundary cosine entry.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:7518. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.155●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRDUPrefixRow0Col0_eval_n3 (env : String → ℚ) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRDUPrefixMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3) = env "boundary_cos_half_0_0"
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRDUPrefixRow0Col0_eval_n3 (env : String → ℚ) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRDUPrefixMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3) = env "boundary_cos_half_0_0"
The three-gate column-`0` prefix row `0` is the slot-`0` boundary cosine entry.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary rdu prefix row 1 col 0 eval n 3”; its local proof does not by itself complete the broader paper route. The three-gate column-'0' prefix row '1' is the slot-'0' boundary sine entry.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The three-gate column-'0' prefix row '1' is the slot-'0' boundary sine entry.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:7557. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.156●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRDUPrefixRow1Col0_eval_n3 (env : String → ℚ) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRDUPrefixMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow1_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3) = env "boundary_sin_half_0_0"
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRDUPrefixRow1Col0_eval_n3 (env : String → ℚ) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRDUPrefixMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow1_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3) = env "boundary_sin_half_0_0"
The three-gate column-`0` prefix row `1` is the slot-`0` boundary sine entry.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary prefix row 96 col 0 eval n 3”; its local proof does not by itself complete the broader paper route. The four-gate prefix row '96', column '0' evaluates to the slot-'0' boundary cosine half-angle entry.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The four-gate prefix row '96', column '0' evaluates to the slot-'0' boundary cosine half-angle entry. This is one of the two prefix factors required by 'oneTermRobinBlockEncodingProofRoute_gamma3BoundarySevenGateTwoPath_n3'.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:7602. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.157●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow96Col0_eval_n3 (env : String → ℚ) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixMatrix_n3 ⟨96, ⋯⟩ QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3) = env "boundary_cos_half_0_0"
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow96Col0_eval_n3 (env : String → ℚ) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixMatrix_n3 ⟨96, ⋯⟩ QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3) = env "boundary_cos_half_0_0"
The four-gate prefix row `96`, column `0` evaluates to the slot-`0` boundary cosine half-angle entry. This is one of the two prefix factors required by `oneTermRobinBlockEncodingProofRoute_gamma3BoundarySevenGateTwoPath_n3`.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary prefix row 97 col 0 eval n 3”; its local proof does not by itself complete the broader paper route. The four-gate prefix row '97', column '0' evaluates to the slot-'0' boundary sine half-angle entry.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The four-gate prefix row '97', column '0' evaluates to the slot-'0' boundary sine half-angle entry.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:7659. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.158●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow97Col0_eval_n3 (env : String → ℚ) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixMatrix_n3 ⟨97, ⋯⟩ QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3) = env "boundary_sin_half_0_0"
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow97Col0_eval_n3 (env : String → ℚ) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixMatrix_n3 ⟨97, ⋯⟩ QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3) = env "boundary_sin_half_0_0"
The four-gate prefix row `97`, column `0` evaluates to the slot-`0` boundary sine half-angle entry.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary col 0 support analysis”. A proposition-valued field is a requirement until a constructor supplies it. QBE-AUTO-002 column-'0' support analysis record for the '[0,0]' entry.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. QBE-AUTO-002 column-'0' support analysis record for the '[0,0]' entry. The '[0,0]' entry of the seven-gate product 'suffix * prefix' at column '0' requires a different support analysis from the '[32,32]' entry: 1. 'U_indic' at column '0': identity (indicator condition not triggered for state '0'). Support only at row '0'. Compiled. 2. 'O_DT^S' at column '0': identity (indicator bit '0'). Support only at row '0'. Compiled. 3. 'DU = O_DT^S * U_indic' at column '0': support only at row '0'. Compiled. 4. 'Ry_boundary' at column '0': acts on the '(0, 1)' rotation pair. 'Ry[0, 0] = cosHalf' and 'Ry[1, 0] = sinHalf' are both non-zero. Support at rows '{0, 1}'. Compiled. 5. 'RDU = Ry * DU' at column '0': since 'DU' feeds only row '0' into 'Ry', the RDU prefix has support at rows '{0, 1}' (both Ry targets of row '0'). Compiled. 6. 'prefix = O_D^BS * RDU' at column '0': maps rows '{0, 1}' through 'O_D^BS'. The prefix has support at '{image(0), image(1)} = {96, 97}'. Both images compiled. Prefix support compiled. The next proof obligation is: - Add the suffix-side support for row '0' (dagger concentrates at column '96', SWAP maps to row '12', 'O_f' spreads from there) - Build the two-path reduction for '[0,0]' through intermediate rows '{96, 97}' - Compare the resulting entry with the backend fold under HWKappa This record does not promote any 'proved' flag.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:7741. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.159●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryCol0SupportAnalysis : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryCol0SupportAnalysis : Type
QBE-AUTO-002 column-`0` support analysis record for the `[0,0]` entry. The `[0,0]` entry of the seven-gate product `suffix * prefix` at column `0` requires a different support analysis from the `[32,32]` entry: 1. `U_indic` at column `0`: identity (indicator condition not triggered for state `0`). Support only at row `0`. Compiled. 2. `O_DT^S` at column `0`: identity (indicator bit `0`). Support only at row `0`. Compiled. 3. `DU = O_DT^S * U_indic` at column `0`: support only at row `0`. Compiled. 4. `Ry_boundary` at column `0`: acts on the `(0, 1)` rotation pair. `Ry[0, 0] = cosHalf` and `Ry[1, 0] = sinHalf` are both non-zero. Support at rows `{0, 1}`. Compiled. 5. `RDU = Ry * DU` at column `0`: since `DU` feeds only row `0` into `Ry`, the RDU prefix has support at rows `{0, 1}` (both Ry targets of row `0`). Compiled. 6. `prefix = O_D^BS * RDU` at column `0`: maps rows `{0, 1}` through `O_D^BS`. The prefix has support at `{image(0), image(1)} = {96, 97}`. Both images compiled. Prefix support compiled. The next proof obligation is: - Add the suffix-side support for row `0` (dagger concentrates at column `96`, SWAP maps to row `12`, `O_f` spreads from there) - Build the two-path reduction for `[0,0]` through intermediate rows `{96, 97}` - Compare the resulting entry with the backend fold under HWKappa This record does not promote any `proved` flag.Fields
sourceAnchor : String
prefixColumn : ℕ
indicatorSupportRows : List ℕ
odtsSupportRows : List ℕ
duSupportRows : List ℕ
rySupportRows : List ℕ
rduSupportRows : List ℕ
odbsImage0 : ℕ
odbsImage1 : ℕ
prefixSupportRows : List ℕ
indicatorSupportCompiled : Bool
odtsSupportCompiled : Bool
duSupportCompiled : Bool
rySupportCompiled : Bool
rduSupportCompiled : Bool
odbsImage0Compiled : Bool
odbsImage1Compiled : Bool
prefixSupportCompiled : Bool
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary col 0 support analysis n 3”. Compiled column-'0' support analysis for the '[0,0]' seven-gate entry.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Compiled column-'0' support analysis for the '[0,0]' seven-gate entry.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:7765. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.160●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCol0SupportAnalysis_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryCol0SupportAnalysis
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCol0SupportAnalysis_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryCol0SupportAnalysis
Compiled column-`0` support analysis for the `[0,0]` seven-gate entry.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route gamma 3 boundary seven gate two path n 3”; its local proof does not by itself complete the broader paper route. Two-path reduction for the '[0,0]' entry of the seven-gate boundary matrix.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Two-path reduction for the '[0,0]' entry of the seven-gate boundary matrix. The prefix at column '0' has support only at intermediate rows '{96, 97}' (compiled in 'oneTermRobinGamma3BoundaryPrefixCol0Support_n3'). All other intermediate rows contribute zero to the matrix product 'suffix * prefix' at position '[0, 0]'. This applies 'Matrix.evalWith_mul_two_path' from CircuitSemantics and does not promote any 'proved' flag.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:7838. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.161●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3BoundarySevenGateTwoPath_n3 (env : String → ℚ) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySevenGateMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3) = QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySuffixMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3 ⟨96, ⋯⟩) * QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixMatrix_n3 ⟨96, ⋯⟩ QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3) + QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySuffixMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3 ⟨97, ⋯⟩) * QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixMatrix_n3 ⟨97, ⋯⟩ QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3)
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3BoundarySevenGateTwoPath_n3 (env : String → ℚ) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySevenGateMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3) = QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySuffixMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3 ⟨96, ⋯⟩) * QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixMatrix_n3 ⟨96, ⋯⟩ QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3) + QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySuffixMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3 ⟨97, ⋯⟩) * QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixMatrix_n3 ⟨97, ⋯⟩ QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3)
Two-path reduction for the `[0,0]` entry of the seven-gate boundary matrix. The prefix at column `0` has support only at intermediate rows `{96, 97}` (compiled in `oneTermRobinGamma3BoundaryPrefixCol0Support_n3`). All other intermediate rows contribute zero to the matrix product `suffix * prefix` at position `[0, 0]`. This applies `Matrix.evalWith_mul_two_path` from CircuitSemantics and does not promote any `proved` flag.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary ry coefficient bridge”. A proposition-valued field is a requirement until a constructor supplies it. Focused false bridge for the displayed boundary 'gamma3' branch.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Focused false bridge for the displayed boundary 'gamma3' branch. The compiled seven-gate product contributes the 'Ry_boundary' half-angle entry 'boundary_cos_half_0_2'. Eq. 'ROBIN clarified' needs the normalized derivative coefficient 'D_0^(2) / N_D'. The paper angle line states 'theta_0^2 = arccos(D_0^(2) / N_D)', so identifying the half-angle matrix entry itself with the normalized coefficient is a separate source-contract gap. This record names that gap without changing any matrix convention or promoting the product-to-coefficient theorem.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:8564. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.162●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryRyCoefficientBridge : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryRyCoefficientBridge : Type
Focused false bridge for the displayed boundary `gamma3` branch. The compiled seven-gate product contributes the `Ry_boundary` half-angle entry `boundary_cos_half_0_2`. Eq. `ROBIN clarified` needs the normalized derivative coefficient `D_0^(2) / N_D`. The paper angle line states `theta_0^2 = arccos(D_0^(2) / N_D)`, so identifying the half-angle matrix entry itself with the normalized coefficient is a separate source-contract gap. This record names that gap without changing any matrix convention or promoting the product-to-coefficient theorem.
Fields
sourceAnchor : String
systemRow : ℕ
systemColumn : ℕ
sparseSlot : ℕ
cosHalfEntry : QuantumBlockEncoding.Coeff
normalizedCoefficient : QuantumBlockEncoding.Coeff
normalizedCoefficientFormula : String
thetaFormula : String
cosHalfFormula : String
angleConventionObligation : QuantumBlockEncoding.SemanticObligation
productObligation : QuantumBlockEncoding.SemanticObligation
boundaryCoefficientDivisionProved : Bool
boundaryArccosSemanticsProved : Bool
boundaryHalfAngleSemanticsProved : Bool
boundaryNormalizerBoundProved : Bool
boundaryTwoByTwoUnitaryProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary ry coefficient bridge n 3”. Compiled focused bridge for the 'n = 3', row-'0', column-'0', global-slot-'2' boundary branch.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Compiled focused bridge for the 'n = 3', row-'0', column-'0', global-slot-'2' boundary branch. The bridge records exactly the factor mismatch left after 'oneTermRobinBlockEncodingProofRoute_gamma3BoundaryProductEntryEval_n3'. It keeps the 'R_y' angle convention, product-to-coefficient equality, LCU, projection, block correctness, and final extraction as false obligations.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:8597. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.163●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRyCoefficientBridge_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryRyCoefficientBridge
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRyCoefficientBridge_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryRyCoefficientBridge
Compiled focused bridge for the `n = 3`, row-`0`, column-`0`, global-slot-`2` boundary branch. The bridge records exactly the factor mismatch left after `oneTermRobinBlockEncodingProofRoute_gamma3BoundaryProductEntryEval_n3`. It keeps the `R_y` angle convention, product-to-coefficient equality, LCU, projection, block correctness, and final extraction as false obligations.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary ry coefficient bridge n 3 transcript”; its local proof does not by itself complete the broader paper route. Transcript theorem for the focused boundary 'R_y' coefficient bridge.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Transcript theorem for the focused boundary 'R_y' coefficient bridge. This theorem proves only the typed wiring of the source-contract gap. The bridge obligation and every theorem-level semantic flag remain false.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:8651. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.164●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRyCoefficientBridge_n3_transcript : have p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3; have bridge := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRyCoefficientBridge_n3; bridge.sourceAnchor = "GHL2025 Eq. angles for Ry, Eq. ROBIN clarified, Fig. 1-term ROBIN, arXiv:2506.20478" ∧ bridge.systemRow = 0 ∧ bridge.systemColumn = 0 ∧ bridge.sparseSlot = 2 ∧ bridge.cosHalfEntry = QuantumBlockEncoding.Coeff.symbol "boundary_cos_half_0_2" ∧ bridge.normalizedCoefficient = QuantumBlockEncoding.GHL2025.boundaryRotationNormalizedCoefficient p 0 2 ∧ bridge.normalizedCoefficient = (QuantumBlockEncoding.GHL2025.robinGlobalSparseAmplitudeValue 3 2 0).mul (QuantumBlockEncoding.Coeff.symbol "N_D_inv") ∧ bridge.normalizedCoefficient = ((QuantumBlockEncoding.Coeff.rat (-5 / 2)).add ((QuantumBlockEncoding.Coeff.rat (7 / 3)).mul (QuantumBlockEncoding.Coeff.symbol "A1*dx"))).mul (QuantumBlockEncoding.Coeff.symbol "N_D_inv") ∧ bridge.normalizedCoefficientFormula = "D_0^(2) / N_D" ∧ bridge.thetaFormula = "theta_j^s = arccos(D_j^(s) / N_D)" ∧ bridge.cosHalfFormula = "sqrt((1 + D_j^(s) / N_D) / 2)" ∧ (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute p 0 2).cosHalfEntry = bridge.cosHalfEntry ∧ (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute p 0 2).arccosArgument = bridge.normalizedCoefficient ∧ bridge.angleConventionObligation.proved = false ∧ bridge.productObligation.proved = false ∧ bridge.boundaryCoefficientDivisionProved = false ∧ bridge.boundaryArccosSemanticsProved = false ∧ bridge.boundaryHalfAngleSemanticsProved = false ∧ bridge.boundaryNormalizerBoundProved = false ∧ bridge.boundaryTwoByTwoUnitaryProved = false ∧ bridge.productToCoefficientProved = false ∧ bridge.lcuCorrectProved = false ∧ bridge.blockProjectionProved = false ∧ bridge.blockCorrectProved = false ∧ bridge.finalExtractionProved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProductToCoefficientObligation 3 ⟨0, ⋯⟩ ⟨0, ⋯⟩).proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).theoremData.obligations.blockExtraction.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRyCoefficientBridge_n3_transcript : have p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3; have bridge := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRyCoefficientBridge_n3; bridge.sourceAnchor = "GHL2025 Eq. angles for Ry, Eq. ROBIN clarified, Fig. 1-term ROBIN, arXiv:2506.20478" ∧ bridge.systemRow = 0 ∧ bridge.systemColumn = 0 ∧ bridge.sparseSlot = 2 ∧ bridge.cosHalfEntry = QuantumBlockEncoding.Coeff.symbol "boundary_cos_half_0_2" ∧ bridge.normalizedCoefficient = QuantumBlockEncoding.GHL2025.boundaryRotationNormalizedCoefficient p 0 2 ∧ bridge.normalizedCoefficient = (QuantumBlockEncoding.GHL2025.robinGlobalSparseAmplitudeValue 3 2 0).mul (QuantumBlockEncoding.Coeff.symbol "N_D_inv") ∧ bridge.normalizedCoefficient = ((QuantumBlockEncoding.Coeff.rat (-5 / 2)).add ((QuantumBlockEncoding.Coeff.rat (7 / 3)).mul (QuantumBlockEncoding.Coeff.symbol "A1*dx"))).mul (QuantumBlockEncoding.Coeff.symbol "N_D_inv") ∧ bridge.normalizedCoefficientFormula = "D_0^(2) / N_D" ∧ bridge.thetaFormula = "theta_j^s = arccos(D_j^(s) / N_D)" ∧ bridge.cosHalfFormula = "sqrt((1 + D_j^(s) / N_D) / 2)" ∧ (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute p 0 2).cosHalfEntry = bridge.cosHalfEntry ∧ (QuantumBlockEncoding.GHL2025.boundaryRotationAngleNormalizerProofRoute p 0 2).arccosArgument = bridge.normalizedCoefficient ∧ bridge.angleConventionObligation.proved = false ∧ bridge.productObligation.proved = false ∧ bridge.boundaryCoefficientDivisionProved = false ∧ bridge.boundaryArccosSemanticsProved = false ∧ bridge.boundaryHalfAngleSemanticsProved = false ∧ bridge.boundaryNormalizerBoundProved = false ∧ bridge.boundaryTwoByTwoUnitaryProved = false ∧ bridge.productToCoefficientProved = false ∧ bridge.lcuCorrectProved = false ∧ bridge.blockProjectionProved = false ∧ bridge.blockCorrectProved = false ∧ bridge.finalExtractionProved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProductToCoefficientObligation 3 ⟨0, ⋯⟩ ⟨0, ⋯⟩).proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).theoremData.obligations.blockExtraction.proved = false
Transcript theorem for the focused boundary `R_y` coefficient bridge. This theorem proves only the typed wiring of the source-contract gap. The bridge obligation and every theorem-level semantic flag remain false.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary ry angle convention decision”. A proposition-valued field is a requirement until a constructor supplies it. Human/source decision packet for the boundary 'R_y' angle convention.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Human/source decision packet for the boundary 'R_y' angle convention. The focused bridge proves that the compiled seven-gate product uses the standard 'R_y' half-angle entry 'boundary_cos_half_0_2', while Eq. 'ROBIN clarified' needs the normalized coefficient 'D_0^(2) / N_D'. This packet is the theorem-facing freeze requested by the source audit: product-to-coefficient search stays blocked until a paper-backed convention or human decision supplies the missing rule.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:8717. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.165●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryRyAngleConventionDecision : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryRyAngleConventionDecision : Type
Human/source decision packet for the boundary `R_y` angle convention. The focused bridge proves that the compiled seven-gate product uses the standard `R_y` half-angle entry `boundary_cos_half_0_2`, while Eq. `ROBIN clarified` needs the normalized coefficient `D_0^(2) / N_D`. This packet is the theorem-facing freeze requested by the source audit: product-to-coefficient search stays blocked until a paper-backed convention or human decision supplies the missing rule.
Fields
sourceAnchor : String
bridge : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryRyCoefficientBridge
standardRyMatrixConvention : String
paperCoefficientNeed : String
sourceSpecifiesDirectHalfAngleCoefficientRule : Bool
humanInputRequired : Bool
acceptedSourceBackedOptions : String
productSearchBlocked : Bool
decisionObligation : QuantumBlockEncoding.SemanticObligation
angleConventionObligationProved : Bool
boundaryHalfAngleSemanticsProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary ry angle convention decision n 3”. Compiled decision packet for the focused boundary branch at 'n = 3'.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Compiled decision packet for the focused boundary branch at 'n = 3'. This declaration does not choose a new matrix convention. It records that the source currently supports only the bridge obligation, and that lower product proof search must wait for either a source-backed half-angle convention or an accepted decision to keep the standard 'R_y' entry as an explicit theorem gap.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:8744. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.166●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRyAngleConventionDecision_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryRyAngleConventionDecision
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRyAngleConventionDecision_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryRyAngleConventionDecision
Compiled decision packet for the focused boundary branch at `n = 3`. This declaration does not choose a new matrix convention. It records that the source currently supports only the bridge obligation, and that lower product proof search must wait for either a source-backed half-angle convention or an accepted decision to keep the standard `R_y` entry as an explicit theorem gap.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary ry angle convention decision n 3 transcript”; its local proof does not by itself complete the broader paper route. Transcript theorem for the boundary 'R_y' angle-convention decision packet.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Transcript theorem for the boundary 'R_y' angle-convention decision packet. Only the source-backed decision boundary is checked here. The bridge obligation, product-to-coefficient theorem, LCU composition, block projection, block correctness, and final extraction remain false.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:8790. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.167●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRyAngleConventionDecision_n3_transcript : have p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3; have decision := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRyAngleConventionDecision_n3; decision.sourceAnchor = "GHL2025 Eq. angles for Ry, Eq. ROBIN clarified, Fig. 1-term ROBIN, arXiv:2506.20478" ∧ decision.bridge = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRyCoefficientBridge_n3 ∧ decision.bridge.cosHalfEntry = QuantumBlockEncoding.Coeff.symbol "boundary_cos_half_0_2" ∧ decision.bridge.normalizedCoefficient = QuantumBlockEncoding.GHL2025.boundaryRotationNormalizedCoefficient p 0 2 ∧ decision.bridge.normalizedCoefficient = (QuantumBlockEncoding.GHL2025.robinGlobalSparseAmplitudeValue 3 2 0).mul (QuantumBlockEncoding.Coeff.symbol "N_D_inv") ∧ decision.standardRyMatrixConvention = "boundary_cos_half_0_2 is the cos(theta_0^2 / 2) matrix entry" ∧ decision.paperCoefficientNeed = "the displayed gamma3 coefficient uses D_0^(2) / N_D" ∧ decision.sourceSpecifiesDirectHalfAngleCoefficientRule = false ∧ decision.humanInputRequired = true ∧ decision.acceptedSourceBackedOptions = "either keep standard Ry and leave the coefficient bridge as a theorem gap, or supply an author/paper-backed boundary amplitude-preparation convention" ∧ decision.productSearchBlocked = true ∧ decision.decisionObligation.proved = false ∧ decision.angleConventionObligationProved = false ∧ decision.boundaryHalfAngleSemanticsProved = false ∧ decision.productToCoefficientProved = false ∧ decision.lcuCorrectProved = false ∧ decision.blockProjectionProved = false ∧ decision.blockCorrectProved = false ∧ decision.finalExtractionProved = false ∧ decision.bridge.angleConventionObligation.proved = false ∧ decision.bridge.productObligation.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProductToCoefficientObligation 3 ⟨0, ⋯⟩ ⟨0, ⋯⟩).proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).theoremData.obligations.blockExtraction.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRyAngleConventionDecision_n3_transcript : have p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3; have decision := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRyAngleConventionDecision_n3; decision.sourceAnchor = "GHL2025 Eq. angles for Ry, Eq. ROBIN clarified, Fig. 1-term ROBIN, arXiv:2506.20478" ∧ decision.bridge = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRyCoefficientBridge_n3 ∧ decision.bridge.cosHalfEntry = QuantumBlockEncoding.Coeff.symbol "boundary_cos_half_0_2" ∧ decision.bridge.normalizedCoefficient = QuantumBlockEncoding.GHL2025.boundaryRotationNormalizedCoefficient p 0 2 ∧ decision.bridge.normalizedCoefficient = (QuantumBlockEncoding.GHL2025.robinGlobalSparseAmplitudeValue 3 2 0).mul (QuantumBlockEncoding.Coeff.symbol "N_D_inv") ∧ decision.standardRyMatrixConvention = "boundary_cos_half_0_2 is the cos(theta_0^2 / 2) matrix entry" ∧ decision.paperCoefficientNeed = "the displayed gamma3 coefficient uses D_0^(2) / N_D" ∧ decision.sourceSpecifiesDirectHalfAngleCoefficientRule = false ∧ decision.humanInputRequired = true ∧ decision.acceptedSourceBackedOptions = "either keep standard Ry and leave the coefficient bridge as a theorem gap, or supply an author/paper-backed boundary amplitude-preparation convention" ∧ decision.productSearchBlocked = true ∧ decision.decisionObligation.proved = false ∧ decision.angleConventionObligationProved = false ∧ decision.boundaryHalfAngleSemanticsProved = false ∧ decision.productToCoefficientProved = false ∧ decision.lcuCorrectProved = false ∧ decision.blockProjectionProved = false ∧ decision.blockCorrectProved = false ∧ decision.finalExtractionProved = false ∧ decision.bridge.angleConventionObligation.proved = false ∧ decision.bridge.productObligation.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProductToCoefficientObligation 3 ⟨0, ⋯⟩ ⟨0, ⋯⟩).proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).theoremData.obligations.blockExtraction.proved = false
Transcript theorem for the boundary `R_y` angle-convention decision packet. Only the source-backed decision boundary is checked here. The bridge obligation, product-to-coefficient theorem, LCU composition, block projection, block correctness, and final extraction remain false.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary ry lower packet guard”. A proposition-valued field is a requirement until a constructor supplies it. Lower-packet guard for the boundary 'R_y' decision freeze.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Lower-packet guard for the boundary 'R_y' decision freeze. This record is deliberately non-semantic. It packages the current source decision state so future lower packets can test that product-to-coefficient proof search is disabled until a source-backed convention or human decision is recorded. Source-backed convention work and reviewer audit remain allowed.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:8843. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.168●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryRyLowerPacketGuard : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryRyLowerPacketGuard : Type
Lower-packet guard for the boundary `R_y` decision freeze. This record is deliberately non-semantic. It packages the current source decision state so future lower packets can test that product-to-coefficient proof search is disabled until a source-backed convention or human decision is recorded. Source-backed convention work and reviewer audit remain allowed.
Fields
sourceAnchor : String
decision : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryRyAngleConventionDecision
lowerProductProofPacketAllowed : Bool
sourceBackedConventionPacketAllowed : Bool
reviewerAuditAllowed : Bool
guardReason : String
bridgeObligationProved : Bool
decisionObligationProved : Bool
boundaryHalfAngleSemanticsProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary ry lower packet guard n 3”. Compiled lower-packet guard for the focused 'n = 3' boundary branch.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Compiled lower-packet guard for the focused 'n = 3' boundary branch. The guard does not choose an angle convention. It only freezes lower product-to-coefficient proof search around the existing decision packet while preserving the option to add a source-backed convention packet.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:8867. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.169●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRyLowerPacketGuard_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryRyLowerPacketGuard
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRyLowerPacketGuard_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryRyLowerPacketGuard
Compiled lower-packet guard for the focused `n = 3` boundary branch. The guard does not choose an angle convention. It only freezes lower product-to-coefficient proof search around the existing decision packet while preserving the option to add a source-backed convention packet.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary ry lower packet guard n 3 transcript”; its local proof does not by itself complete the broader paper route. Transcript theorem for the lower-packet guard.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Transcript theorem for the lower-packet guard. The theorem checks only the freeze state and false semantic flags. It is a guard against accidentally resuming the focused product proof before the boundary 'R_y' convention gap is resolved.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:8903. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.170●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRyLowerPacketGuard_n3_transcript : have guard := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRyLowerPacketGuard_n3; guard.sourceAnchor = "GHL2025 Eq. angles for Ry, Eq. ROBIN clarified, Fig. 1-term ROBIN, arXiv:2506.20478" ∧ guard.decision = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRyAngleConventionDecision_n3 ∧ guard.decision.humanInputRequired = true ∧ guard.decision.productSearchBlocked = true ∧ guard.lowerProductProofPacketAllowed = false ∧ guard.sourceBackedConventionPacketAllowed = true ∧ guard.reviewerAuditAllowed = true ∧ guard.guardReason = "product-to-coefficient search is blocked until the boundary Ry angle convention has source-backed or human input" ∧ guard.bridgeObligationProved = false ∧ guard.decisionObligationProved = false ∧ guard.boundaryHalfAngleSemanticsProved = false ∧ guard.productToCoefficientProved = false ∧ guard.lcuCorrectProved = false ∧ guard.blockProjectionProved = false ∧ guard.blockCorrectProved = false ∧ guard.finalExtractionProved = false ∧ guard.decision.bridge.angleConventionObligation.proved = false ∧ guard.decision.decisionObligation.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProductToCoefficientObligation 3 ⟨0, ⋯⟩ ⟨0, ⋯⟩).proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).theoremData.obligations.blockExtraction.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRyLowerPacketGuard_n3_transcript : have guard := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRyLowerPacketGuard_n3; guard.sourceAnchor = "GHL2025 Eq. angles for Ry, Eq. ROBIN clarified, Fig. 1-term ROBIN, arXiv:2506.20478" ∧ guard.decision = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRyAngleConventionDecision_n3 ∧ guard.decision.humanInputRequired = true ∧ guard.decision.productSearchBlocked = true ∧ guard.lowerProductProofPacketAllowed = false ∧ guard.sourceBackedConventionPacketAllowed = true ∧ guard.reviewerAuditAllowed = true ∧ guard.guardReason = "product-to-coefficient search is blocked until the boundary Ry angle convention has source-backed or human input" ∧ guard.bridgeObligationProved = false ∧ guard.decisionObligationProved = false ∧ guard.boundaryHalfAngleSemanticsProved = false ∧ guard.productToCoefficientProved = false ∧ guard.lcuCorrectProved = false ∧ guard.blockProjectionProved = false ∧ guard.blockCorrectProved = false ∧ guard.finalExtractionProved = false ∧ guard.decision.bridge.angleConventionObligation.proved = false ∧ guard.decision.decisionObligation.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProductToCoefficientObligation 3 ⟨0, ⋯⟩ ⟨0, ⋯⟩).proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).theoremData.obligations.blockExtraction.proved = false
Transcript theorem for the lower-packet guard. The theorem checks only the freeze state and false semantic flags. It is a guard against accidentally resuming the focused product proof before the boundary `R_y` convention gap is resolved.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary ry corrected angle source decision”. A proposition-valued field is a requirement until a constructor supplies it. Source-backed correction decision for the focused boundary 'R_y' route.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Source-backed correction decision for the focused boundary 'R_y' route. The local GHL2025 text states 'theta_j^s = arccos(D_j^(s) / N_D)', but the paper uses the standard one-qubit 'R_y' convention elsewhere and the companion implementation computes boundary correction angles as '2 * arccos(...)'. Therefore the next faithful lower packet should use the corrected input angle '2 * arccos(D_j^(s) / N_D)' with the standard 'R_y' matrix. This decision only unblocks product-to-coefficient work; it does not promote the product, LCU, projection, block-correctness, unitarity, or final-extraction flags.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:8951. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.171●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryRyCorrectedAngleSourceDecision : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryRyCorrectedAngleSourceDecision : Type
Source-backed correction decision for the focused boundary `R_y` route. The local GHL2025 text states `theta_j^s = arccos(D_j^(s) / N_D)`, but the paper uses the standard one-qubit `R_y` convention elsewhere and the companion implementation computes boundary correction angles as `2 * arccos(...)`. Therefore the next faithful lower packet should use the corrected input angle `2 * arccos(D_j^(s) / N_D)` with the standard `R_y` matrix. This decision only unblocks product-to-coefficient work; it does not promote the product, LCU, projection, block-correctness, unitarity, or final-extraction flags.
Fields
sourceAnchor : String
localPaperFormula : String
priorPaperFormula : String
companionCodeFormula : String
standardRyConventionSource : String
correctedThetaFormula : String
bridge : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryRyCoefficientBridge
correctedAngleSourceBacked : Bool
useStandardRyMatrixConvention : Bool
directCoefficientEntryAllowed : Bool
productSearchBlocked : Bool
lowerProductProofPacketAllowed : Bool
reviewerAuditAllowed : Bool
semanticFlagsRemainFalseUntilLeanProof : Bool
productObligation : QuantumBlockEncoding.SemanticObligation
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary ry corrected angle source decision n 3”. Compiled corrected-angle decision for the 'n = 3', row-'0', slot-'2' boundary branch.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Compiled corrected-angle decision for the 'n = 3', row-'0', slot-'2' boundary branch. This records the source audit result needed before the next lower packet: the boundary rotation should be represented as the standard 'R_y' gate with input angle '2 * arccos(D_0^(2) / N_D)', so its clean ket-zero entry is the normalized coefficient. All theorem-facing semantic claims remain unproved.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:8983. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.172●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRyCorrectedAngleSourceDecision_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryRyCorrectedAngleSourceDecision
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRyCorrectedAngleSourceDecision_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryRyCorrectedAngleSourceDecision
Compiled corrected-angle decision for the `n = 3`, row-`0`, slot-`2` boundary branch. This records the source audit result needed before the next lower packet: the boundary rotation should be represented as the standard `R_y` gate with input angle `2 * arccos(D_0^(2) / N_D)`, so its clean ket-zero entry is the normalized coefficient. All theorem-facing semantic claims remain unproved.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary ry corrected angle source decision n 3 transcript”; its local proof does not by itself complete the broader paper route. Transcript theorem for the corrected-angle source decision.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Transcript theorem for the corrected-angle source decision. The theorem checks only the decision state. It explicitly leaves the product-to-coefficient theorem and all downstream semantic flags false.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:9029. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.173●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRyCorrectedAngleSourceDecision_n3_transcript : have decision := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRyCorrectedAngleSourceDecision_n3; decision.localPaperFormula = "theta_j^s = arccos(D_j^(s) / N_D)" ∧ decision.priorPaperFormula = "theta_s = 2 arccos((p^m)^(s) / sqrt(N_p^m)) for the standard Ry sparse-amplitude oracle" ∧ decision.companionCodeFormula = "theta = 2 * np.arccos(boundary_coefficient / normalizer)" ∧ decision.standardRyConventionSource = "companion repository README and fundamental_gates_unitary.py define ry(parameter) with cos(parameter/2) and sin(parameter/2)" ∧ decision.correctedThetaFormula = "theta_j^s = 2 arccos(D_j^(s) / N_D)" ∧ decision.bridge = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRyCoefficientBridge_n3 ∧ decision.bridge.cosHalfEntry = QuantumBlockEncoding.Coeff.symbol "boundary_cos_half_0_2" ∧ decision.bridge.normalizedCoefficient = QuantumBlockEncoding.GHL2025.boundaryRotationNormalizedCoefficient (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3) 0 2 ∧ decision.correctedAngleSourceBacked = true ∧ decision.useStandardRyMatrixConvention = true ∧ decision.directCoefficientEntryAllowed = true ∧ decision.productSearchBlocked = false ∧ decision.lowerProductProofPacketAllowed = true ∧ decision.reviewerAuditAllowed = true ∧ decision.semanticFlagsRemainFalseUntilLeanProof = true ∧ decision.productObligation.proved = false ∧ decision.productToCoefficientProved = false ∧ decision.lcuCorrectProved = false ∧ decision.blockProjectionProved = false ∧ decision.blockCorrectProved = false ∧ decision.finalExtractionProved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRyCorrectedAngleSourceDecision_n3_transcript : have decision := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRyCorrectedAngleSourceDecision_n3; decision.localPaperFormula = "theta_j^s = arccos(D_j^(s) / N_D)" ∧ decision.priorPaperFormula = "theta_s = 2 arccos((p^m)^(s) / sqrt(N_p^m)) for the standard Ry sparse-amplitude oracle" ∧ decision.companionCodeFormula = "theta = 2 * np.arccos(boundary_coefficient / normalizer)" ∧ decision.standardRyConventionSource = "companion repository README and fundamental_gates_unitary.py define ry(parameter) with cos(parameter/2) and sin(parameter/2)" ∧ decision.correctedThetaFormula = "theta_j^s = 2 arccos(D_j^(s) / N_D)" ∧ decision.bridge = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRyCoefficientBridge_n3 ∧ decision.bridge.cosHalfEntry = QuantumBlockEncoding.Coeff.symbol "boundary_cos_half_0_2" ∧ decision.bridge.normalizedCoefficient = QuantumBlockEncoding.GHL2025.boundaryRotationNormalizedCoefficient (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3) 0 2 ∧ decision.correctedAngleSourceBacked = true ∧ decision.useStandardRyMatrixConvention = true ∧ decision.directCoefficientEntryAllowed = true ∧ decision.productSearchBlocked = false ∧ decision.lowerProductProofPacketAllowed = true ∧ decision.reviewerAuditAllowed = true ∧ decision.semanticFlagsRemainFalseUntilLeanProof = true ∧ decision.productObligation.proved = false ∧ decision.productToCoefficientProved = false ∧ decision.lcuCorrectProved = false ∧ decision.blockProjectionProved = false ∧ decision.blockCorrectProved = false ∧ decision.finalExtractionProved = false
Transcript theorem for the corrected-angle source decision. The theorem checks only the decision state. It explicitly leaves the product-to-coefficient theorem and all downstream semantic flags false.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary corrected coefficient interface”. A proposition-valued field is a requirement until a constructor supplies it. Corrected-angle coefficient interface for the focused boundary branch.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Corrected-angle coefficient interface for the focused boundary branch. The record is deliberately conditional: the source-backed angle correction allows the 'Ry_boundary' clean entry to be treated as the normalized boundary coefficient, but the product-to-coefficient theorem and all block-encoding semantics remain false until separate Lean theorems prove them.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:9070. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.174●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryCorrectedCoefficientInterface : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryCorrectedCoefficientInterface : Type
Corrected-angle coefficient interface for the focused boundary branch. The record is deliberately conditional: the source-backed angle correction allows the `Ry_boundary` clean entry to be treated as the normalized boundary coefficient, but the product-to-coefficient theorem and all block-encoding semantics remain false until separate Lean theorems prove them.
Fields
sourceAnchor : String
decision : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryRyCorrectedAngleSourceDecision
productEntryFactor : QuantumBlockEncoding.Coeff
normalizedCoefficient : QuantumBlockEncoding.Coeff
correctedEntryHypothesis : QuantumBlockEncoding.SemanticObligation
productObligation : QuantumBlockEncoding.SemanticObligation
correctedAngleSourceBacked : Bool
coefficientInterfaceCompiled : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary corrected coefficient interface n 3”. Compiled interface for replacing the boundary free factor by the corrected normalized coefficient in the 'n = 3', row-'0', column-'0', slot-'2' branch.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Compiled interface for replacing the boundary free factor by the corrected normalized coefficient in the 'n = 3', row-'0', column-'0', slot-'2' branch.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:9090. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.175●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCorrectedCoefficientInterface_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryCorrectedCoefficientInterface
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCorrectedCoefficientInterface_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryCorrectedCoefficientInterface
Compiled interface for replacing the boundary free factor by the corrected normalized coefficient in the `n = 3`, row-`0`, column-`0`, slot-`2` branch.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary corrected coefficient interface n 3 transcript”; its local proof does not by itself complete the broader paper route. Transcript theorem for the corrected-angle coefficient interface.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Transcript theorem for the corrected-angle coefficient interface. This checks that the interface uses the global sparse-slot normalized coefficient and that every theorem-facing semantic claim remains unproved.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:9130. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.176●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCorrectedCoefficientInterface_n3_transcript : have interface := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCorrectedCoefficientInterface_n3; interface.decision = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRyCorrectedAngleSourceDecision_n3 ∧ interface.productEntryFactor = QuantumBlockEncoding.Coeff.symbol "boundary_cos_half_0_2" ∧ interface.normalizedCoefficient = QuantumBlockEncoding.GHL2025.boundaryRotationNormalizedCoefficient (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3) 0 2 ∧ interface.normalizedCoefficient = (QuantumBlockEncoding.GHL2025.robinGlobalSparseAmplitudeValue 3 2 0).mul (QuantumBlockEncoding.Coeff.symbol "N_D_inv") ∧ interface.correctedEntryHypothesis.proved = false ∧ interface.productObligation.proved = false ∧ interface.correctedAngleSourceBacked = true ∧ interface.coefficientInterfaceCompiled = true ∧ interface.productToCoefficientProved = false ∧ interface.lcuCorrectProved = false ∧ interface.blockProjectionProved = false ∧ interface.blockCorrectProved = false ∧ interface.finalExtractionProved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCorrectedCoefficientInterface_n3_transcript : have interface := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCorrectedCoefficientInterface_n3; interface.decision = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRyCorrectedAngleSourceDecision_n3 ∧ interface.productEntryFactor = QuantumBlockEncoding.Coeff.symbol "boundary_cos_half_0_2" ∧ interface.normalizedCoefficient = QuantumBlockEncoding.GHL2025.boundaryRotationNormalizedCoefficient (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3) 0 2 ∧ interface.normalizedCoefficient = (QuantumBlockEncoding.GHL2025.robinGlobalSparseAmplitudeValue 3 2 0).mul (QuantumBlockEncoding.Coeff.symbol "N_D_inv") ∧ interface.correctedEntryHypothesis.proved = false ∧ interface.productObligation.proved = false ∧ interface.correctedAngleSourceBacked = true ∧ interface.coefficientInterfaceCompiled = true ∧ interface.productToCoefficientProved = false ∧ interface.lcuCorrectProved = false ∧ interface.blockProjectionProved = false ∧ interface.blockCorrectProved = false ∧ interface.finalExtractionProved = false
Transcript theorem for the corrected-angle coefficient interface. This checks that the interface uses the global sparse-slot normalized coefficient and that every theorem-facing semantic claim remains unproved.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route gamma 3 boundary product entry eval corrected angle n 3”; its local proof does not by itself complete the broader paper route. Conditional evaluated-product interface for the corrected boundary angle.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Conditional evaluated-product interface for the corrected boundary angle. Once the corrected-angle entry hypothesis is supplied for the environment, the compiled seven-gate boundary product is expressed using 'boundaryRotationNormalizedCoefficient' rather than the unresolved free symbol. This is not the final product-to-coefficient theorem.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:9164. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.177●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3BoundaryProductEntryEval_correctedAngle_n3 (env : String → ℚ) (hentry : env "boundary_cos_half_0_2" = QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.GHL2025.boundaryRotationNormalizedCoefficient (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3) 0 2)) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySevenGateMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3) = env "f_3_0" * env "N_f_inv" * QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.GHL2025.boundaryRotationNormalizedCoefficient (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3) 0 2)
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3BoundaryProductEntryEval_correctedAngle_n3 (env : String → ℚ) (hentry : env "boundary_cos_half_0_2" = QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.GHL2025.boundaryRotationNormalizedCoefficient (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3) 0 2)) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySevenGateMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3) = env "f_3_0" * env "N_f_inv" * QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.GHL2025.boundaryRotationNormalizedCoefficient (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3) 0 2)
Conditional evaluated-product interface for the corrected boundary angle. Once the corrected-angle entry hypothesis is supplied for the environment, the compiled seven-gate boundary product is expressed using `boundaryRotationNormalizedCoefficient` rather than the unresolved free symbol. This is not the final product-to-coefficient theorem.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin block encoding proof route gamma 3 boundary product entry eval corrected coefficient expanded n 3”; its local proof does not by itself complete the broader paper route. Expanded corrected-angle product entry for the displayed boundary branch.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Expanded corrected-angle product entry for the displayed boundary branch. This is the strongest local coefficient statement currently available for the focused 'n = 3', '(0,0)', slot-'2' packet. Under the corrected-entry hypothesis, the seven-gate product is the clean 'O_f' amplitude times the global-slot boundary coefficient normalized by 'N_D'. The theorem deliberately does not insert the theorem-level sparse-summation/'kappa' factor or promote the product-to-coefficient obligation.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:9192. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.178●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3BoundaryProductEntryEval_correctedCoefficientExpanded_n3 (env : String → ℚ) (hentry : env "boundary_cos_half_0_2" = QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.GHL2025.boundaryRotationNormalizedCoefficient (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3) 0 2)) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySevenGateMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3) = QuantumBlockEncoding.Coeff.evalWith env (((QuantumBlockEncoding.GHL2025.robinFunctionValue 3 0).mul (QuantumBlockEncoding.Coeff.symbol "N_f_inv")).mul (QuantumBlockEncoding.GHL2025.boundaryRotationNormalizedCoefficient (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3) 0 2))
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute_gamma3BoundaryProductEntryEval_correctedCoefficientExpanded_n3 (env : String → ℚ) (hentry : env "boundary_cos_half_0_2" = QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.GHL2025.boundaryRotationNormalizedCoefficient (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3) 0 2)) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySevenGateMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3) = QuantumBlockEncoding.Coeff.evalWith env (((QuantumBlockEncoding.GHL2025.robinFunctionValue 3 0).mul (QuantumBlockEncoding.Coeff.symbol "N_f_inv")).mul (QuantumBlockEncoding.GHL2025.boundaryRotationNormalizedCoefficient (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3) 0 2))
Expanded corrected-angle product entry for the displayed boundary branch. This is the strongest local coefficient statement currently available for the focused `n = 3`, `(0,0)`, slot-`2` packet. Under the corrected-entry hypothesis, the seven-gate product is the clean `O_f` amplitude times the global-slot boundary coefficient normalized by `N_D`. The theorem deliberately does not insert the theorem-level sparse-summation/`kappa` factor or promote the product-to-coefficient obligation.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary ak entry matches global slot 2 n 3”; its local proof does not by itself complete the broader paper route. The focused boundary target entry uses the same global slot-'2' coefficient.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The focused boundary target entry uses the same global slot-'2' coefficient. This closes the local stencil-side comparison for '(A_k)_{0,0}'. The remaining gap is not the Robin matrix entry; it is the theorem-level quotient/projection convention that must turn the branch-local product into '(A_k)_{0,0}/(N_D N_f kappa)'.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:9225. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.179●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryAkEntry_matches_globalSlot2_n3 : have sysRow := ⟨0, ⋯⟩; have sysCol := ⟨0, ⋯⟩; QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinAkMatrix 3 sysRow sysCol = (QuantumBlockEncoding.GHL2025.robinFunctionValue 3 0).mul (QuantumBlockEncoding.GHL2025.robinGlobalSparseAmplitudeValue 3 2 0)
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryAkEntry_matches_globalSlot2_n3 : have sysRow := ⟨0, ⋯⟩; have sysCol := ⟨0, ⋯⟩; QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinAkMatrix 3 sysRow sysCol = (QuantumBlockEncoding.GHL2025.robinFunctionValue 3 0).mul (QuantumBlockEncoding.GHL2025.robinGlobalSparseAmplitudeValue 3 2 0)
The focused boundary target entry uses the same global slot-`2` coefficient. This closes the local stencil-side comparison for `(A_k)_{0,0}`. The remaining gap is not the Robin matrix entry; it is the theorem-level quotient/projection convention that must turn the branch-local product into `(A_k)_{0,0}/(N_D N_f kappa)`.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary product to coefficient obstruction”. A proposition-valued field is a requirement until a constructor supplies it. Precise remaining obstruction for the focused boundary product-to-coefficient route.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Precise remaining obstruction for the focused boundary product-to-coefficient route. The corrected-angle product has been reduced to '(f_3_0 * N_f_inv) * (D_0^(2) * N_D_inv)', and the target entry has been identified as 'f_3_0 * D_0^(2)'. What is still missing is an exact Lean convention relating this branch-local product to the theorem's normalized block entry with normalizer 'N_D * N_f * kappa', including the sparse-register summation/projection factor. This record keeps the theorem-facing obligation false instead of changing the scientific contract.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:9245. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.180●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProductToCoefficientObstruction : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProductToCoefficientObstruction : Type
Precise remaining obstruction for the focused boundary product-to-coefficient route. The corrected-angle product has been reduced to `(f_3_0 * N_f_inv) * (D_0^(2) * N_D_inv)`, and the target entry has been identified as `f_3_0 * D_0^(2)`. What is still missing is an exact Lean convention relating this branch-local product to the theorem's normalized block entry with normalizer `N_D * N_f * kappa`, including the sparse-register summation/projection factor. This record keeps the theorem-facing obligation false instead of changing the scientific contract.
Fields
sourceAnchor : String
productEntryFormula : String
akEntryFormula : String
correctedEntryHypothesis : QuantumBlockEncoding.SemanticObligation
normalizedQuotientConvention : QuantumBlockEncoding.SemanticObligation
sparseRegisterProjectionConvention : QuantumBlockEncoding.SemanticObligation
productObligation : QuantumBlockEncoding.SemanticObligation
productEntryExpanded : Bool
akEntryMatched : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary product to coefficient obstruction n 3”. Compiled obstruction packet for 'oneTermRobinGamma3ProductToCoefficientObligation 3 0 0'.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Compiled obstruction packet for 'oneTermRobinGamma3ProductToCoefficientObligation 3 0 0'.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:9266. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.181●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProductToCoefficientObstruction_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProductToCoefficientObstruction
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProductToCoefficientObstruction_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProductToCoefficientObstruction
Compiled obstruction packet for `oneTermRobinGamma3ProductToCoefficientObligation 3 0 0`.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary product to coefficient obstruction n 3 transcript”; its local proof does not by itself complete the broader paper route. Transcript theorem for the focused boundary product-to-coefficient obstruction.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Transcript theorem for the focused boundary product-to-coefficient obstruction. This theorem records the smallest remaining Lean-local obstruction after the corrected-angle expansion and target-entry comparison. It keeps all semantic flags false.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:9316. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.182●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProductToCoefficientObstruction_n3_transcript : have obstruction := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProductToCoefficientObstruction_n3; obstruction.productEntryFormula = "under the corrected-entry hypothesis, product[32,32] = (f_3_0 * N_f_inv) * (D_0^(2) * N_D_inv)" ∧ obstruction.akEntryFormula = "(oneTermRobinAkMatrix 3)[0,0] = f_3_0 * D_0^(2)" ∧ obstruction.correctedEntryHypothesis.proved = false ∧ obstruction.normalizedQuotientConvention.proved = false ∧ obstruction.sparseRegisterProjectionConvention.proved = false ∧ obstruction.productObligation.proved = false ∧ obstruction.productEntryExpanded = true ∧ obstruction.akEntryMatched = true ∧ obstruction.productToCoefficientProved = false ∧ obstruction.lcuCorrectProved = false ∧ obstruction.blockProjectionProved = false ∧ obstruction.blockCorrectProved = false ∧ obstruction.finalExtractionProved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProductToCoefficientObligation 3 ⟨0, ⋯⟩ ⟨0, ⋯⟩).proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).theoremData.obligations.blockExtraction.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProductToCoefficientObstruction_n3_transcript : have obstruction := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProductToCoefficientObstruction_n3; obstruction.productEntryFormula = "under the corrected-entry hypothesis, product[32,32] = (f_3_0 * N_f_inv) * (D_0^(2) * N_D_inv)" ∧ obstruction.akEntryFormula = "(oneTermRobinAkMatrix 3)[0,0] = f_3_0 * D_0^(2)" ∧ obstruction.correctedEntryHypothesis.proved = false ∧ obstruction.normalizedQuotientConvention.proved = false ∧ obstruction.sparseRegisterProjectionConvention.proved = false ∧ obstruction.productObligation.proved = false ∧ obstruction.productEntryExpanded = true ∧ obstruction.akEntryMatched = true ∧ obstruction.productToCoefficientProved = false ∧ obstruction.lcuCorrectProved = false ∧ obstruction.blockProjectionProved = false ∧ obstruction.blockCorrectProved = false ∧ obstruction.finalExtractionProved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProductToCoefficientObligation 3 ⟨0, ⋯⟩ ⟨0, ⋯⟩).proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).theoremData.obligations.blockExtraction.proved = false
Transcript theorem for the focused boundary product-to-coefficient obstruction. This theorem records the smallest remaining Lean-local obstruction after the corrected-angle expansion and target-entry comparison. It keeps all semantic flags false.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary normalizer projection convention”. A proposition-valued field is a requirement until a constructor supplies it. Theorem-level normalizer/projection convention packet for the focused boundary 'gamma3' product route.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Theorem-level normalizer/projection convention packet for the focused boundary 'gamma3' product route. The preceding local theorems have reduced the branch product to '(f_3_0 * N_f_inv) * (D_0^(2) * N_D_inv)' and the target entry to 'f_3_0 * D_0^(2)'. This packet ties those facts to the theorem normalizer 'N_D*N_f*kappa', while keeping the quotient interpretation of 'N_D_inv', 'N_f_inv', and the sparse-register 'kappa' projection as explicit false obligations.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:9360. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.183●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryNormalizerProjectionConvention : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryNormalizerProjectionConvention : Type
Theorem-level normalizer/projection convention packet for the focused boundary `gamma3` product route. The preceding local theorems have reduced the branch product to `(f_3_0 * N_f_inv) * (D_0^(2) * N_D_inv)` and the target entry to `f_3_0 * D_0^(2)`. This packet ties those facts to the theorem normalizer `N_D*N_f*kappa`, while keeping the quotient interpretation of `N_D_inv`, `N_f_inv`, and the sparse-register `kappa` projection as explicit false obligations.
Fields
sourceAnchor : String
obstruction : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProductToCoefficientObstruction
branchLocalProduct : QuantumBlockEncoding.Coeff
targetEntry : QuantumBlockEncoding.Coeff
targetEntryLocalFormula : QuantumBlockEncoding.Coeff
theoremNormalizer : QuantumBlockEncoding.Coeff
finiteCompositionNormalizer : QuantumBlockEncoding.Coeff
normalizerFormula : String
quotientConventionFormula : String
sparseProjectionFormula : String
quotientConvention : QuantumBlockEncoding.SemanticObligation
sparseProjectionConvention : QuantumBlockEncoding.SemanticObligation
productObligation : QuantumBlockEncoding.SemanticObligation
finiteCompositionNormalizedEquality : QuantumBlockEncoding.SemanticObligation
quotientConventionProved : Bool
sparseProjectionConventionProved : Bool
productToCoefficientProved : Bool
finiteCompositionNormalizedEqualityProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary normalizer projection convention n 3”. Compiled normalizer/projection convention interface for 'oneTermRobinGamma3ProductToCoefficientObligation 3 0 0'.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Compiled normalizer/projection convention interface for 'oneTermRobinGamma3ProductToCoefficientObligation 3 0 0'. This is a typed convention packet, not the final product-to-coefficient proof. It records that the finite-composition contract uses the same normalizer 'GHL2025.oneTermRobinNormalizer', and that the remaining work is the symbolic inverse convention plus the sparse-register projection factor contributing the 'kappa' denominator.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:9395. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.184●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryNormalizerProjectionConvention_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryNormalizerProjectionConvention
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryNormalizerProjectionConvention_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryNormalizerProjectionConvention
Compiled normalizer/projection convention interface for `oneTermRobinGamma3ProductToCoefficientObligation 3 0 0`. This is a typed convention packet, not the final product-to-coefficient proof. It records that the finite-composition contract uses the same normalizer `GHL2025.oneTermRobinNormalizer`, and that the remaining work is the symbolic inverse convention plus the sparse-register projection factor contributing the `kappa` denominator.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary normalizer projection convention n 3 transcript”; its local proof does not by itself complete the broader paper route. Transcript theorem for the focused normalizer/projection convention packet.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Transcript theorem for the focused normalizer/projection convention packet. The theorem checks the wiring to the compiled obstruction, the target-entry comparison, and the finite-composition normalizer. All theorem-facing semantic claims remain false.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:9446. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.185●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryNormalizerProjectionConvention_n3_transcript : have p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3; have convention := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryNormalizerProjectionConvention_n3; have sysRow := ⟨0, ⋯⟩; have sysCol := ⟨0, ⋯⟩; convention.sourceAnchor = "GHL2025 Eq. ROBIN clarified displayed gamma3 boundary branch, Theorem one-term block-encoding, Definition def:block-encoding, and Fig. 1-term ROBIN, arXiv:2506.20478" ∧ convention.obstruction = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProductToCoefficientObstruction_n3 ∧ convention.branchLocalProduct = ((QuantumBlockEncoding.GHL2025.robinFunctionValue 3 0).mul (QuantumBlockEncoding.Coeff.symbol "N_f_inv")).mul (QuantumBlockEncoding.GHL2025.boundaryRotationNormalizedCoefficient p 0 2) ∧ convention.targetEntry = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinAkMatrix 3 sysRow sysCol ∧ convention.targetEntryLocalFormula = (QuantumBlockEncoding.GHL2025.robinFunctionValue 3 0).mul (QuantumBlockEncoding.GHL2025.robinGlobalSparseAmplitudeValue 3 2 0) ∧ convention.targetEntry = convention.targetEntryLocalFormula ∧ convention.theoremNormalizer = QuantumBlockEncoding.GHL2025.oneTermRobinNormalizer ∧ convention.finiteCompositionNormalizer = (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteBlockCompositionContract 3).normalizer ∧ convention.finiteCompositionNormalizer = QuantumBlockEncoding.GHL2025.oneTermRobinNormalizer ∧ convention.theoremNormalizer = convention.finiteCompositionNormalizer ∧ convention.normalizerFormula = "N_D*N_f*kappa" ∧ convention.quotientConventionFormula = "N_D_inv and N_f_inv represent the N_D*N_f part of division by the theorem normalizer" ∧ convention.sparseProjectionFormula = "the sparse-register summation/projection contributes the remaining 1/kappa factor for the focused slot-2 boundary branch" ∧ convention.quotientConvention = convention.obstruction.normalizedQuotientConvention ∧ convention.sparseProjectionConvention = convention.obstruction.sparseRegisterProjectionConvention ∧ convention.productObligation = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProductToCoefficientObligation 3 sysRow sysCol ∧ convention.finiteCompositionNormalizedEquality = (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteBlockCompositionContract 3).normalizedBlockEquality ∧ convention.quotientConvention.proved = false ∧ convention.sparseProjectionConvention.proved = false ∧ convention.productObligation.proved = false ∧ convention.finiteCompositionNormalizedEquality.proved = false ∧ convention.quotientConventionProved = false ∧ convention.sparseProjectionConventionProved = false ∧ convention.productToCoefficientProved = false ∧ convention.finiteCompositionNormalizedEqualityProved = false ∧ convention.lcuCorrectProved = false ∧ convention.blockProjectionProved = false ∧ convention.blockCorrectProved = false ∧ convention.finalExtractionProved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProductToCoefficientObligation 3 ⟨0, ⋯⟩ ⟨0, ⋯⟩).proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteBlockCompositionContract 3).normalizedBlockEquality.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).theoremData.obligations.blockExtraction.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryNormalizerProjectionConvention_n3_transcript : have p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3; have convention := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryNormalizerProjectionConvention_n3; have sysRow := ⟨0, ⋯⟩; have sysCol := ⟨0, ⋯⟩; convention.sourceAnchor = "GHL2025 Eq. ROBIN clarified displayed gamma3 boundary branch, Theorem one-term block-encoding, Definition def:block-encoding, and Fig. 1-term ROBIN, arXiv:2506.20478" ∧ convention.obstruction = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProductToCoefficientObstruction_n3 ∧ convention.branchLocalProduct = ((QuantumBlockEncoding.GHL2025.robinFunctionValue 3 0).mul (QuantumBlockEncoding.Coeff.symbol "N_f_inv")).mul (QuantumBlockEncoding.GHL2025.boundaryRotationNormalizedCoefficient p 0 2) ∧ convention.targetEntry = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinAkMatrix 3 sysRow sysCol ∧ convention.targetEntryLocalFormula = (QuantumBlockEncoding.GHL2025.robinFunctionValue 3 0).mul (QuantumBlockEncoding.GHL2025.robinGlobalSparseAmplitudeValue 3 2 0) ∧ convention.targetEntry = convention.targetEntryLocalFormula ∧ convention.theoremNormalizer = QuantumBlockEncoding.GHL2025.oneTermRobinNormalizer ∧ convention.finiteCompositionNormalizer = (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteBlockCompositionContract 3).normalizer ∧ convention.finiteCompositionNormalizer = QuantumBlockEncoding.GHL2025.oneTermRobinNormalizer ∧ convention.theoremNormalizer = convention.finiteCompositionNormalizer ∧ convention.normalizerFormula = "N_D*N_f*kappa" ∧ convention.quotientConventionFormula = "N_D_inv and N_f_inv represent the N_D*N_f part of division by the theorem normalizer" ∧ convention.sparseProjectionFormula = "the sparse-register summation/projection contributes the remaining 1/kappa factor for the focused slot-2 boundary branch" ∧ convention.quotientConvention = convention.obstruction.normalizedQuotientConvention ∧ convention.sparseProjectionConvention = convention.obstruction.sparseRegisterProjectionConvention ∧ convention.productObligation = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProductToCoefficientObligation 3 sysRow sysCol ∧ convention.finiteCompositionNormalizedEquality = (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteBlockCompositionContract 3).normalizedBlockEquality ∧ convention.quotientConvention.proved = false ∧ convention.sparseProjectionConvention.proved = false ∧ convention.productObligation.proved = false ∧ convention.finiteCompositionNormalizedEquality.proved = false ∧ convention.quotientConventionProved = false ∧ convention.sparseProjectionConventionProved = false ∧ convention.productToCoefficientProved = false ∧ convention.finiteCompositionNormalizedEqualityProved = false ∧ convention.lcuCorrectProved = false ∧ convention.blockProjectionProved = false ∧ convention.blockCorrectProved = false ∧ convention.finalExtractionProved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProductToCoefficientObligation 3 ⟨0, ⋯⟩ ⟨0, ⋯⟩).proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteBlockCompositionContract 3).normalizedBlockEquality.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).oracleComposition.lcuCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockProjection.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).blockClaim.target.blockCorrect.proved = false ∧ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinBlockEncodingProofRoute 3).theoremData.obligations.blockExtraction.proved = false
Transcript theorem for the focused normalizer/projection convention packet. The theorem checks the wiring to the compiled obstruction, the target-entry comparison, and the finite-composition normalizer. All theorem-facing semantic claims remain false.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary normalizer split target”. A proposition-valued field is a requirement until a constructor supplies it. Middle-agent split target for the next focused boundary 'gamma3' packet.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Middle-agent split target for the next focused boundary 'gamma3' packet. The existing normalizer/projection convention already identifies the two remaining blockers. This record makes them explicit as separate lower-agent targets while reusing the same theorem route: * symbolic inverse semantics for 'N_D_inv' and 'N_f_inv'; * the sparse-register projection factor that contributes '1/kappa'. It is still a convention packet, not a proof of the product-to-coefficient obligation.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:9530. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.186●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryNormalizerSplitTarget : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryNormalizerSplitTarget : Type
Middle-agent split target for the next focused boundary `gamma3` packet. The existing normalizer/projection convention already identifies the two remaining blockers. This record makes them explicit as separate lower-agent targets while reusing the same theorem route: * symbolic inverse semantics for `N_D_inv` and `N_f_inv`; * the sparse-register projection factor that contributes `1/kappa`. It is still a convention packet, not a proof of the product-to-coefficient obligation.
Fields
sourceAnchor : String
convention : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryNormalizerProjectionConvention
symbolicInverseFormula : String
kappaProjectionFormula : String
symbolicInverseObligation : QuantumBlockEncoding.SemanticObligation
kappaProjectionObligation : QuantumBlockEncoding.SemanticObligation
finiteCompositionNormalizedEquality : QuantumBlockEncoding.SemanticObligation
productObligation : QuantumBlockEncoding.SemanticObligation
branchLocalProduct : QuantumBlockEncoding.Coeff
targetEntry : QuantumBlockEncoding.Coeff
theoremNormalizer : QuantumBlockEncoding.Coeff
symbolicInverseProved : Bool
kappaProjectionProved : Bool
normalizedBlockEqualityProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary normalizer split target n 3”. Lean-facing lower packet target after the boundary normalizer/projection convention compiled.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Lean-facing lower packet target after the boundary normalizer/projection convention compiled. The target keeps the fixed theorem-facing obligation 'oneTermRobinGamma3ProductToCoefficientObligation 3 0 0', but it splits the next proof work into two non-overlapping subgoals: the symbolic inverse interpretation of 'N_D_inv'/'N_f_inv', and the sparse-register 'kappa' projection factor. All semantic flags remain false.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:9562. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.187●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryNormalizerSplitTarget_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryNormalizerSplitTarget
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryNormalizerSplitTarget_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryNormalizerSplitTarget
Lean-facing lower packet target after the boundary normalizer/projection convention compiled. The target keeps the fixed theorem-facing obligation `oneTermRobinGamma3ProductToCoefficientObligation 3 0 0`, but it splits the next proof work into two non-overlapping subgoals: the symbolic inverse interpretation of `N_D_inv`/`N_f_inv`, and the sparse-register `kappa` projection factor. All semantic flags remain false.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary normalizer split target n 3 transcript”; its local proof does not by itself complete the broader paper route. Transcript theorem for the split target.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Transcript theorem for the split target. It checks that the two named sub-obligations are exactly the fields of the compiled normalizer/projection convention and that no semantic flag has been promoted.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:9597. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.188●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryNormalizerSplitTarget_n3_transcript : have target := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryNormalizerSplitTarget_n3; target.sourceAnchor = "GHL2025 Eq. ROBIN clarified gamma3 denominator N_D*N_f*kappa and Definition def:block-encoding, arXiv:2506.20478" ∧ target.convention = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryNormalizerProjectionConvention_n3 ∧ target.symbolicInverseFormula = "N_D_inv and N_f_inv supply only the N_D*N_f inverse factors in the corrected boundary product" ∧ target.kappaProjectionFormula = "the sparse-register projection/summation supplies the separate 1/kappa factor for the focused slot-2 branch" ∧ target.symbolicInverseObligation = target.convention.quotientConvention ∧ target.kappaProjectionObligation = target.convention.sparseProjectionConvention ∧ target.finiteCompositionNormalizedEquality = target.convention.finiteCompositionNormalizedEquality ∧ target.productObligation = target.convention.productObligation ∧ target.branchLocalProduct = target.convention.branchLocalProduct ∧ target.targetEntry = target.convention.targetEntry ∧ target.theoremNormalizer = target.convention.theoremNormalizer ∧ target.symbolicInverseObligation.proved = false ∧ target.kappaProjectionObligation.proved = false ∧ target.finiteCompositionNormalizedEquality.proved = false ∧ target.productObligation.proved = false ∧ target.symbolicInverseProved = false ∧ target.kappaProjectionProved = false ∧ target.normalizedBlockEqualityProved = false ∧ target.productToCoefficientProved = false ∧ target.lcuCorrectProved = false ∧ target.blockProjectionProved = false ∧ target.blockCorrectProved = false ∧ target.finalExtractionProved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryNormalizerSplitTarget_n3_transcript : have target := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryNormalizerSplitTarget_n3; target.sourceAnchor = "GHL2025 Eq. ROBIN clarified gamma3 denominator N_D*N_f*kappa and Definition def:block-encoding, arXiv:2506.20478" ∧ target.convention = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryNormalizerProjectionConvention_n3 ∧ target.symbolicInverseFormula = "N_D_inv and N_f_inv supply only the N_D*N_f inverse factors in the corrected boundary product" ∧ target.kappaProjectionFormula = "the sparse-register projection/summation supplies the separate 1/kappa factor for the focused slot-2 branch" ∧ target.symbolicInverseObligation = target.convention.quotientConvention ∧ target.kappaProjectionObligation = target.convention.sparseProjectionConvention ∧ target.finiteCompositionNormalizedEquality = target.convention.finiteCompositionNormalizedEquality ∧ target.productObligation = target.convention.productObligation ∧ target.branchLocalProduct = target.convention.branchLocalProduct ∧ target.targetEntry = target.convention.targetEntry ∧ target.theoremNormalizer = target.convention.theoremNormalizer ∧ target.symbolicInverseObligation.proved = false ∧ target.kappaProjectionObligation.proved = false ∧ target.finiteCompositionNormalizedEquality.proved = false ∧ target.productObligation.proved = false ∧ target.symbolicInverseProved = false ∧ target.kappaProjectionProved = false ∧ target.normalizedBlockEqualityProved = false ∧ target.productToCoefficientProved = false ∧ target.lcuCorrectProved = false ∧ target.blockProjectionProved = false ∧ target.blockCorrectProved = false ∧ target.finalExtractionProved = false
Transcript theorem for the split target. It checks that the two named sub-obligations are exactly the fields of the compiled normalizer/projection convention and that no semantic flag has been promoted.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary symbolic inverse eval n 3”; its local proof does not by itself complete the broader paper route. Conditional symbolic-inverse evaluation for the focused boundary branch.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Conditional symbolic-inverse evaluation for the focused boundary branch. This proves the local algebraic part of the split target: if the coefficient environment interprets 'N_D_inv' and 'N_f_inv' as right inverses of 'N_D' and 'N_f', then the corrected branch-local product recovers the target entry after multiplication by the 'N_D*N_f' part of the theorem normalizer. The lemma does not supply those inverse hypotheses and does not account for the separate '1/kappa' sparse-register projection factor.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:9647. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.189●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySymbolicInverseEval_n3 (env : String → ℚ) (hND : env "N_D_inv" * env "N_D" = 1) (hNF : env "N_f_inv" * env "N_f" = 1) : QuantumBlockEncoding.Coeff.evalWith env QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryNormalizerSplitTarget_n3.branchLocalProduct * (env "N_D" * env "N_f") = QuantumBlockEncoding.Coeff.evalWith env QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryNormalizerSplitTarget_n3.targetEntry
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySymbolicInverseEval_n3 (env : String → ℚ) (hND : env "N_D_inv" * env "N_D" = 1) (hNF : env "N_f_inv" * env "N_f" = 1) : QuantumBlockEncoding.Coeff.evalWith env QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryNormalizerSplitTarget_n3.branchLocalProduct * (env "N_D" * env "N_f") = QuantumBlockEncoding.Coeff.evalWith env QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryNormalizerSplitTarget_n3.targetEntry
Conditional symbolic-inverse evaluation for the focused boundary branch. This proves the local algebraic part of the split target: if the coefficient environment interprets `N_D_inv` and `N_f_inv` as right inverses of `N_D` and `N_f`, then the corrected branch-local product recovers the target entry after multiplication by the `N_D*N_f` part of the theorem normalizer. The lemma does not supply those inverse hypotheses and does not account for the separate `1/kappa` sparse-register projection factor.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary symbolic inverse semantics”. A proposition-valued field is a requirement until a constructor supplies it. Transcript packet for the symbolic-inverse half of the boundary split target.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Transcript packet for the symbolic-inverse half of the boundary split target. The conditional evaluation lemma above is compiled, but the theorem route still needs actual inverse semantics for the environment and still needs the separate 'kappa' projection factor. The product-to-coefficient and block-composition flags therefore remain false.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:9711. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.190●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundarySymbolicInverseSemantics : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundarySymbolicInverseSemantics : Type
Transcript packet for the symbolic-inverse half of the boundary split target. The conditional evaluation lemma above is compiled, but the theorem route still needs actual inverse semantics for the environment and still needs the separate `kappa` projection factor. The product-to-coefficient and block-composition flags therefore remain false.
Fields
sourceAnchor : String
splitTarget : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryNormalizerSplitTarget
normalizerPartFormula : String
ndInverseHypothesis : String
nfInverseHypothesis : String
conditionalEvalLemma : String
symbolicInverseObligation : QuantumBlockEncoding.SemanticObligation
kappaProjectionObligation : QuantumBlockEncoding.SemanticObligation
finiteCompositionNormalizedEquality : QuantumBlockEncoding.SemanticObligation
productObligation : QuantumBlockEncoding.SemanticObligation
conditionalEvalCompiled : Bool
symbolicInverseProved : Bool
kappaProjectionProved : Bool
normalizedBlockEqualityProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary symbolic inverse semantics n 3”. Compiled symbolic-inverse packet for the focused boundary branch.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Compiled symbolic-inverse packet for the focused boundary branch. This reuses 'oneTermRobinGamma3BoundaryNormalizerSplitTarget_n3' and reduces only the 'N_D_inv'/'N_f_inv' algebra under explicit environment hypotheses. It does not prove the sparse-register '1/kappa' projection or the final product-to-coefficient obligation.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:9741. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.191●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySymbolicInverseSemantics_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundarySymbolicInverseSemantics
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySymbolicInverseSemantics_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundarySymbolicInverseSemantics
Compiled symbolic-inverse packet for the focused boundary branch. This reuses `oneTermRobinGamma3BoundaryNormalizerSplitTarget_n3` and reduces only the `N_D_inv`/`N_f_inv` algebra under explicit environment hypotheses. It does not prove the sparse-register `1/kappa` projection or the final product-to-coefficient obligation.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary symbolic inverse semantics n 3 transcript”; its local proof does not by itself complete the broader paper route. Transcript theorem for the symbolic-inverse packet.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Transcript theorem for the symbolic-inverse packet. It confirms that the new packet consumes exactly the split target's symbolic inverse obligation and leaves the 'kappa' projection and theorem-level composition obligations unproved.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:9777. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.192●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySymbolicInverseSemantics_n3_transcript : have semantics := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySymbolicInverseSemantics_n3; have target := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryNormalizerSplitTarget_n3; semantics.sourceAnchor = "GHL2025 Eq. ROBIN clarified gamma3 denominator N_D*N_f*kappa, arXiv:2506.20478" ∧ semantics.splitTarget = target ∧ semantics.normalizerPartFormula = "branchLocalProduct * (N_D*N_f) = targetEntry under N_D_inv*N_D=1 and N_f_inv*N_f=1" ∧ semantics.ndInverseHypothesis = "env N_D_inv * env N_D = 1" ∧ semantics.nfInverseHypothesis = "env N_f_inv * env N_f = 1" ∧ semantics.conditionalEvalLemma = "oneTermRobinGamma3BoundarySymbolicInverseEval_n3" ∧ semantics.symbolicInverseObligation = target.symbolicInverseObligation ∧ semantics.kappaProjectionObligation = target.kappaProjectionObligation ∧ semantics.finiteCompositionNormalizedEquality = target.finiteCompositionNormalizedEquality ∧ semantics.productObligation = target.productObligation ∧ semantics.conditionalEvalCompiled = true ∧ semantics.symbolicInverseObligation.proved = false ∧ semantics.kappaProjectionObligation.proved = false ∧ semantics.finiteCompositionNormalizedEquality.proved = false ∧ semantics.productObligation.proved = false ∧ semantics.symbolicInverseProved = false ∧ semantics.kappaProjectionProved = false ∧ semantics.normalizedBlockEqualityProved = false ∧ semantics.productToCoefficientProved = false ∧ semantics.lcuCorrectProved = false ∧ semantics.blockProjectionProved = false ∧ semantics.blockCorrectProved = false ∧ semantics.finalExtractionProved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySymbolicInverseSemantics_n3_transcript : have semantics := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySymbolicInverseSemantics_n3; have target := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryNormalizerSplitTarget_n3; semantics.sourceAnchor = "GHL2025 Eq. ROBIN clarified gamma3 denominator N_D*N_f*kappa, arXiv:2506.20478" ∧ semantics.splitTarget = target ∧ semantics.normalizerPartFormula = "branchLocalProduct * (N_D*N_f) = targetEntry under N_D_inv*N_D=1 and N_f_inv*N_f=1" ∧ semantics.ndInverseHypothesis = "env N_D_inv * env N_D = 1" ∧ semantics.nfInverseHypothesis = "env N_f_inv * env N_f = 1" ∧ semantics.conditionalEvalLemma = "oneTermRobinGamma3BoundarySymbolicInverseEval_n3" ∧ semantics.symbolicInverseObligation = target.symbolicInverseObligation ∧ semantics.kappaProjectionObligation = target.kappaProjectionObligation ∧ semantics.finiteCompositionNormalizedEquality = target.finiteCompositionNormalizedEquality ∧ semantics.productObligation = target.productObligation ∧ semantics.conditionalEvalCompiled = true ∧ semantics.symbolicInverseObligation.proved = false ∧ semantics.kappaProjectionObligation.proved = false ∧ semantics.finiteCompositionNormalizedEquality.proved = false ∧ semantics.productObligation.proved = false ∧ semantics.symbolicInverseProved = false ∧ semantics.kappaProjectionProved = false ∧ semantics.normalizedBlockEqualityProved = false ∧ semantics.productToCoefficientProved = false ∧ semantics.lcuCorrectProved = false ∧ semantics.blockProjectionProved = false ∧ semantics.blockCorrectProved = false ∧ semantics.finalExtractionProved = false
Transcript theorem for the symbolic-inverse packet. It confirms that the new packet consumes exactly the split target's symbolic inverse obligation and leaves the `kappa` projection and theorem-level composition obligations unproved.
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary uniform sparse register preparation obligation n 3”. Uniform sparse-register preparation obligation for the focused boundary 'gamma3' route.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Uniform sparse-register preparation obligation for the focused boundary 'gamma3' route. GHL2025 Eq. 'arbitrary sparcity' defines 'H_W^(kappa)' as the state preparation that gives each sparse slot amplitude '1/sqrt(kappa)'. For the boundary product-to-coefficient route, the missing projection convention is that the preparation amplitude and the matching sparse-register projection contribute the remaining '1/kappa' factor. This obligation records that source dependency without treating the cited implementation as formalized.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:9825. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.193●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryUniformSparseRegisterPreparationObligation_n3 : QuantumBlockEncoding.SemanticObligation
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryUniformSparseRegisterPreparationObligation_n3 : QuantumBlockEncoding.SemanticObligation
Uniform sparse-register preparation obligation for the focused boundary `gamma3` route. GHL2025 Eq. `arbitrary sparcity` defines `H_W^(kappa)` as the state preparation that gives each sparse slot amplitude `1/sqrt(kappa)`. For the boundary product-to-coefficient route, the missing projection convention is that the preparation amplitude and the matching sparse-register projection contribute the remaining `1/kappa` factor. This obligation records that source dependency without treating the cited implementation as formalized.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary kappa projection target”. A proposition-valued field is a requirement until a constructor supplies it. Middle-agent packet target for the sparse-register 'kappa' projection factor.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Middle-agent packet target for the sparse-register 'kappa' projection factor. The symbolic 'N_D_inv'/'N_f_inv' algebra now has a compiled conditional lemma. This target isolates the remaining source/projection convention: the sparse register is prepared by 'H_W^(kappa)' with amplitude '1/sqrt(kappa)', and the matching projection onto the focused slot contributes another '1/sqrt(kappa)'. The packet is intentionally contract-only; it does not prove the projection factor or the product-to-coefficient theorem.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:9843. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.194●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryKappaProjectionTarget : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryKappaProjectionTarget : Type
Middle-agent packet target for the sparse-register `kappa` projection factor. The symbolic `N_D_inv`/`N_f_inv` algebra now has a compiled conditional lemma. This target isolates the remaining source/projection convention: the sparse register is prepared by `H_W^(kappa)` with amplitude `1/sqrt(kappa)`, and the matching projection onto the focused slot contributes another `1/sqrt(kappa)`. The packet is intentionally contract-only; it does not prove the projection factor or the product-to-coefficient theorem.
Fields
sourceAnchor : String
splitTarget : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryNormalizerSplitTarget
symbolicInverseSemantics : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundarySymbolicInverseSemantics
citedResultId : String
hWFormula : String
preparationAmplitudeFormula : String
projectionAmplitudeFormula : String
productProjectionFormula : String
focusedKappa : ℕ
focusedSparseSlot : ℕ
focusedSystemRow : ℕ
focusedSystemColumn : ℕ
sourceBasisIndex : ℕ
targetBasisIndex : ℕ
theoremNormalizer : QuantumBlockEncoding.Coeff
kappaSymbol : QuantumBlockEncoding.Coeff
uniformPreparationObligation : QuantumBlockEncoding.SemanticObligation
kappaProjectionObligation : QuantumBlockEncoding.SemanticObligation
finiteCompositionNormalizedEquality : QuantumBlockEncoding.SemanticObligation
productObligation : QuantumBlockEncoding.SemanticObligation
symbolicInverseConditionalLemmaCompiled : Bool
dependsOnUniformPreparationCitation : Bool
uniformPreparationProved : Bool
kappaProjectionProved : Bool
normalizedBlockEqualityProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary kappa projection target n 3”. Compiled sparse-register 'kappa' projection target for the focused boundary entry '(0,0)' and global sparse slot '2'.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Compiled sparse-register 'kappa' projection target for the focused boundary entry '(0,0)' and global sparse slot '2'. This is the next lower-agent packet target after 'oneTermRobinGamma3BoundarySymbolicInverseSemantics_n3'. It keeps all theorem-facing obligations false and records that the sparse-register factor depends on the 'H_W^(kappa)' uniform-preparation contract rather than on a new gate-level proof in this batch.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:9886. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.195●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryKappaProjectionTarget_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryKappaProjectionTarget
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryKappaProjectionTarget_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryKappaProjectionTarget
Compiled sparse-register `kappa` projection target for the focused boundary entry `(0,0)` and global sparse slot `2`. This is the next lower-agent packet target after `oneTermRobinGamma3BoundarySymbolicInverseSemantics_n3`. It keeps all theorem-facing obligations false and records that the sparse-register factor depends on the `H_W^(kappa)` uniform-preparation contract rather than on a new gate-level proof in this batch.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary kappa projection target n 3 transcript”; its local proof does not by itself complete the broader paper route. Transcript theorem for the sparse-register 'kappa' projection target.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Transcript theorem for the sparse-register 'kappa' projection target. The theorem only checks packet wiring: the focused sparse slot is '2', the source and target clean basis index is '32', the cited uniform-preparation dependency is named, and all product/composition/projection flags remain false.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:9938. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.196●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryKappaProjectionTarget_n3_transcript : have target := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryKappaProjectionTarget_n3; target.sourceAnchor = "GHL2025 Eq. arbitrary sparcity, Eq. ROBIN clarified gamma3 boundary summand, Fig. 1-term ROBIN, and Definition def:block-encoding, arXiv:2506.20478" ∧ target.splitTarget = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryNormalizerSplitTarget_n3 ∧ target.symbolicInverseSemantics = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySymbolicInverseSemantics_n3 ∧ target.citedResultId = "ShuklaVedula2024.HWkappaUniformSuperposition" ∧ target.hWFormula = "H_W^(kappa)|0>^ceil(log2 kappa) = (1/sqrt(kappa)) * sum_{s=0}^{kappa-1} |s>" ∧ target.preparationAmplitudeFormula = "1/sqrt(kappa)" ∧ target.projectionAmplitudeFormula = "1/sqrt(kappa)" ∧ target.productProjectionFormula = "1/kappa" ∧ target.focusedKappa = 7 ∧ target.focusedSparseSlot = 2 ∧ target.focusedSystemRow = 0 ∧ target.focusedSystemColumn = 0 ∧ target.sourceBasisIndex = 32 ∧ target.targetBasisIndex = 32 ∧ target.theoremNormalizer = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryNormalizerSplitTarget_n3.theoremNormalizer ∧ target.kappaSymbol = QuantumBlockEncoding.Coeff.symbol "kappa" ∧ target.uniformPreparationObligation = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryUniformSparseRegisterPreparationObligation_n3 ∧ target.kappaProjectionObligation = target.splitTarget.kappaProjectionObligation ∧ target.finiteCompositionNormalizedEquality = target.splitTarget.finiteCompositionNormalizedEquality ∧ target.productObligation = target.splitTarget.productObligation ∧ target.symbolicInverseConditionalLemmaCompiled = true ∧ target.dependsOnUniformPreparationCitation = true ∧ target.uniformPreparationObligation.proved = false ∧ target.kappaProjectionObligation.proved = false ∧ target.finiteCompositionNormalizedEquality.proved = false ∧ target.productObligation.proved = false ∧ target.uniformPreparationProved = false ∧ target.kappaProjectionProved = false ∧ target.normalizedBlockEqualityProved = false ∧ target.productToCoefficientProved = false ∧ target.lcuCorrectProved = false ∧ target.blockProjectionProved = false ∧ target.blockCorrectProved = false ∧ target.finalExtractionProved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryKappaProjectionTarget_n3_transcript : have target := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryKappaProjectionTarget_n3; target.sourceAnchor = "GHL2025 Eq. arbitrary sparcity, Eq. ROBIN clarified gamma3 boundary summand, Fig. 1-term ROBIN, and Definition def:block-encoding, arXiv:2506.20478" ∧ target.splitTarget = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryNormalizerSplitTarget_n3 ∧ target.symbolicInverseSemantics = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySymbolicInverseSemantics_n3 ∧ target.citedResultId = "ShuklaVedula2024.HWkappaUniformSuperposition" ∧ target.hWFormula = "H_W^(kappa)|0>^ceil(log2 kappa) = (1/sqrt(kappa)) * sum_{s=0}^{kappa-1} |s>" ∧ target.preparationAmplitudeFormula = "1/sqrt(kappa)" ∧ target.projectionAmplitudeFormula = "1/sqrt(kappa)" ∧ target.productProjectionFormula = "1/kappa" ∧ target.focusedKappa = 7 ∧ target.focusedSparseSlot = 2 ∧ target.focusedSystemRow = 0 ∧ target.focusedSystemColumn = 0 ∧ target.sourceBasisIndex = 32 ∧ target.targetBasisIndex = 32 ∧ target.theoremNormalizer = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryNormalizerSplitTarget_n3.theoremNormalizer ∧ target.kappaSymbol = QuantumBlockEncoding.Coeff.symbol "kappa" ∧ target.uniformPreparationObligation = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryUniformSparseRegisterPreparationObligation_n3 ∧ target.kappaProjectionObligation = target.splitTarget.kappaProjectionObligation ∧ target.finiteCompositionNormalizedEquality = target.splitTarget.finiteCompositionNormalizedEquality ∧ target.productObligation = target.splitTarget.productObligation ∧ target.symbolicInverseConditionalLemmaCompiled = true ∧ target.dependsOnUniformPreparationCitation = true ∧ target.uniformPreparationObligation.proved = false ∧ target.kappaProjectionObligation.proved = false ∧ target.finiteCompositionNormalizedEquality.proved = false ∧ target.productObligation.proved = false ∧ target.uniformPreparationProved = false ∧ target.kappaProjectionProved = false ∧ target.normalizedBlockEqualityProved = false ∧ target.productToCoefficientProved = false ∧ target.lcuCorrectProved = false ∧ target.blockProjectionProved = false ∧ target.blockCorrectProved = false ∧ target.finalExtractionProved = false
Transcript theorem for the sparse-register `kappa` projection target. The theorem only checks packet wiring: the focused sparse slot is `2`, the source and target clean basis index is `32`, the cited uniform-preparation dependency is named, and all product/composition/projection flags remain false.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary kappa projection eval n 3”; its local proof does not by itself complete the broader paper route. Conditional sparse-register 'kappa' projection evaluation for the focused boundary branch.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Conditional sparse-register 'kappa' projection evaluation for the focused boundary branch. This combines the already compiled 'N_D_inv'/'N_f_inv' cancellation lemma with a separate symbolic 'kappa_inv' projection factor. Under explicit environment hypotheses, the projected branch-local product multiplied by the theorem normalizer evaluates to the target entry. The theorem does not prove that the circuit actually prepares or projects the sparse register with amplitude '1/sqrt(kappa)'; that source/projection convention remains an obligation.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:10000. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.197●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryKappaProjectionEval_n3 (env : String → ℚ) (hND : env "N_D_inv" * env "N_D" = 1) (hNF : env "N_f_inv" * env "N_f" = 1) (hkappa : env "kappa_inv" * env "kappa" = 1) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryKappaProjectionTarget_n3.splitTarget.branchLocalProduct.mul (QuantumBlockEncoding.Coeff.symbol "kappa_inv")) * QuantumBlockEncoding.Coeff.evalWith env QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryKappaProjectionTarget_n3.theoremNormalizer = QuantumBlockEncoding.Coeff.evalWith env QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryKappaProjectionTarget_n3.splitTarget.targetEntry
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryKappaProjectionEval_n3 (env : String → ℚ) (hND : env "N_D_inv" * env "N_D" = 1) (hNF : env "N_f_inv" * env "N_f" = 1) (hkappa : env "kappa_inv" * env "kappa" = 1) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryKappaProjectionTarget_n3.splitTarget.branchLocalProduct.mul (QuantumBlockEncoding.Coeff.symbol "kappa_inv")) * QuantumBlockEncoding.Coeff.evalWith env QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryKappaProjectionTarget_n3.theoremNormalizer = QuantumBlockEncoding.Coeff.evalWith env QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryKappaProjectionTarget_n3.splitTarget.targetEntry
Conditional sparse-register `kappa` projection evaluation for the focused boundary branch. This combines the already compiled `N_D_inv`/`N_f_inv` cancellation lemma with a separate symbolic `kappa_inv` projection factor. Under explicit environment hypotheses, the projected branch-local product multiplied by the theorem normalizer evaluates to the target entry. The theorem does not prove that the circuit actually prepares or projects the sparse register with amplitude `1/sqrt(kappa)`; that source/projection convention remains an obligation.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary kappa projection semantics”. A proposition-valued field is a requirement until a constructor supplies it. Compiled packet for the conditional 'kappa_inv' projection evaluation.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Compiled packet for the conditional 'kappa_inv' projection evaluation. The packet records the Lean algebra that would finish the normalizer part once the sparse-register preparation/projection convention is available. It keeps the uniform-preparation, projection, finite-composition, and theorem-facing product obligations false.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:10079. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.198●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryKappaProjectionSemantics : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryKappaProjectionSemantics : Type
Compiled packet for the conditional `kappa_inv` projection evaluation. The packet records the Lean algebra that would finish the normalizer part once the sparse-register preparation/projection convention is available. It keeps the uniform-preparation, projection, finite-composition, and theorem-facing product obligations false.
Fields
sourceAnchor : String
projectionTarget : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryKappaProjectionTarget
projectedBranchProduct : QuantumBlockEncoding.Coeff
projectionFactor : QuantumBlockEncoding.Coeff
kappaInverseHypothesis : String
conditionalEvalLemma : String
uniformPreparationObligation : QuantumBlockEncoding.SemanticObligation
kappaProjectionObligation : QuantumBlockEncoding.SemanticObligation
finiteCompositionNormalizedEquality : QuantumBlockEncoding.SemanticObligation
productObligation : QuantumBlockEncoding.SemanticObligation
symbolicInverseConditionalLemmaCompiled : Bool
kappaProjectionConditionalLemmaCompiled : Bool
uniformPreparationProved : Bool
kappaProjectionProved : Bool
normalizedBlockEqualityProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary kappa projection semantics n 3”. Boundary 'gamma3' sparse-register projection packet for 'n = 3'.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Boundary 'gamma3' sparse-register projection packet for 'n = 3'. The field 'projectedBranchProduct' is the corrected branch-local product multiplied by a symbolic 'kappa_inv' factor. The compiled evaluation lemma checks only rational cancellation under explicit environment hypotheses; it is not a gate-level proof of 'H_W^(kappa)' or block projection.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:10110. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.199●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryKappaProjectionSemantics_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryKappaProjectionSemantics
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryKappaProjectionSemantics_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryKappaProjectionSemantics
Boundary `gamma3` sparse-register projection packet for `n = 3`. The field `projectedBranchProduct` is the corrected branch-local product multiplied by a symbolic `kappa_inv` factor. The compiled evaluation lemma checks only rational cancellation under explicit environment hypotheses; it is not a gate-level proof of `H_W^(kappa)` or block projection.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary kappa projection semantics n 3 transcript”; its local proof does not by itself complete the broader paper route. Transcript theorem for the conditional sparse-register projection packet.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Transcript theorem for the conditional sparse-register projection packet. It checks that the packet reuses the middle-agent target, names 'oneTermRobinGamma3BoundaryKappaProjectionEval_n3' as the compiled algebra lemma, and preserves all semantic proof flags as false.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:10148. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.200●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryKappaProjectionSemantics_n3_transcript : have semantics := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryKappaProjectionSemantics_n3; have target := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryKappaProjectionTarget_n3; semantics.sourceAnchor = "GHL2025 Eq. arbitrary sparcity, Eq. ROBIN clarified gamma3 denominator N_D*N_f*kappa, Fig. 1-term ROBIN, and Definition def:block-encoding, arXiv:2506.20478" ∧ semantics.projectionTarget = target ∧ semantics.projectedBranchProduct = target.splitTarget.branchLocalProduct.mul (QuantumBlockEncoding.Coeff.symbol "kappa_inv") ∧ semantics.projectionFactor = QuantumBlockEncoding.Coeff.symbol "kappa_inv" ∧ semantics.kappaInverseHypothesis = "env kappa_inv * env kappa = 1" ∧ semantics.conditionalEvalLemma = "oneTermRobinGamma3BoundaryKappaProjectionEval_n3" ∧ semantics.uniformPreparationObligation = target.uniformPreparationObligation ∧ semantics.kappaProjectionObligation = target.kappaProjectionObligation ∧ semantics.finiteCompositionNormalizedEquality = target.finiteCompositionNormalizedEquality ∧ semantics.productObligation = target.productObligation ∧ semantics.symbolicInverseConditionalLemmaCompiled = true ∧ semantics.kappaProjectionConditionalLemmaCompiled = true ∧ semantics.uniformPreparationObligation.proved = false ∧ semantics.kappaProjectionObligation.proved = false ∧ semantics.finiteCompositionNormalizedEquality.proved = false ∧ semantics.productObligation.proved = false ∧ semantics.uniformPreparationProved = false ∧ semantics.kappaProjectionProved = false ∧ semantics.normalizedBlockEqualityProved = false ∧ semantics.productToCoefficientProved = false ∧ semantics.lcuCorrectProved = false ∧ semantics.blockProjectionProved = false ∧ semantics.blockCorrectProved = false ∧ semantics.finalExtractionProved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryKappaProjectionSemantics_n3_transcript : have semantics := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryKappaProjectionSemantics_n3; have target := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryKappaProjectionTarget_n3; semantics.sourceAnchor = "GHL2025 Eq. arbitrary sparcity, Eq. ROBIN clarified gamma3 denominator N_D*N_f*kappa, Fig. 1-term ROBIN, and Definition def:block-encoding, arXiv:2506.20478" ∧ semantics.projectionTarget = target ∧ semantics.projectedBranchProduct = target.splitTarget.branchLocalProduct.mul (QuantumBlockEncoding.Coeff.symbol "kappa_inv") ∧ semantics.projectionFactor = QuantumBlockEncoding.Coeff.symbol "kappa_inv" ∧ semantics.kappaInverseHypothesis = "env kappa_inv * env kappa = 1" ∧ semantics.conditionalEvalLemma = "oneTermRobinGamma3BoundaryKappaProjectionEval_n3" ∧ semantics.uniformPreparationObligation = target.uniformPreparationObligation ∧ semantics.kappaProjectionObligation = target.kappaProjectionObligation ∧ semantics.finiteCompositionNormalizedEquality = target.finiteCompositionNormalizedEquality ∧ semantics.productObligation = target.productObligation ∧ semantics.symbolicInverseConditionalLemmaCompiled = true ∧ semantics.kappaProjectionConditionalLemmaCompiled = true ∧ semantics.uniformPreparationObligation.proved = false ∧ semantics.kappaProjectionObligation.proved = false ∧ semantics.finiteCompositionNormalizedEquality.proved = false ∧ semantics.productObligation.proved = false ∧ semantics.uniformPreparationProved = false ∧ semantics.kappaProjectionProved = false ∧ semantics.normalizedBlockEqualityProved = false ∧ semantics.productToCoefficientProved = false ∧ semantics.lcuCorrectProved = false ∧ semantics.blockProjectionProved = false ∧ semantics.blockCorrectProved = false ∧ semantics.finalExtractionProved = false
Transcript theorem for the conditional sparse-register projection packet. It checks that the packet reuses the middle-agent target, names `oneTermRobinGamma3BoundaryKappaProjectionEval_n3` as the compiled algebra lemma, and preserves all semantic proof flags as false.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary projection source contract”. A proposition-valued field is a requirement until a constructor supplies it. Source-backed projection contract for the inserted 'kappa_inv' factor.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Source-backed projection contract for the inserted 'kappa_inv' factor. The compiled cancellation lemma treats 'Coeff.symbol "kappa_inv"' as an explicit factor in the projected branch product. This contract records the paper-facing source of that factor: 'H_W^(kappa)' prepares the sparse register with amplitude '1/sqrt(kappa)' on the focused slot, and the matching block-projection bra contributes the second '1/sqrt(kappa)'. The actual state-preparation circuit, projection convention, normalized block equality, and focused product-to-coefficient equality remain obligations.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:10198. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.201●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProjectionSourceContract : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProjectionSourceContract : Type
Source-backed projection contract for the inserted `kappa_inv` factor. The compiled cancellation lemma treats `Coeff.symbol "kappa_inv"` as an explicit factor in the projected branch product. This contract records the paper-facing source of that factor: `H_W^(kappa)` prepares the sparse register with amplitude `1/sqrt(kappa)` on the focused slot, and the matching block-projection bra contributes the second `1/sqrt(kappa)`. The actual state-preparation circuit, projection convention, normalized block equality, and focused product-to-coefficient equality remain obligations.
Fields
sourceAnchor : String
kappaSemantics : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryKappaProjectionSemantics
citedResultId : String
preparationFormula : String
preparationAmplitudeFormula : String
projectionAmplitudeFormula : String
combinedProjectionFormula : String
focusedKappa : ℕ
focusedSparseSlot : ℕ
sourceBasisIndex : ℕ
targetBasisIndex : ℕ
projectionFactor : QuantumBlockEncoding.Coeff
projectedBranchProduct : QuantumBlockEncoding.Coeff
uniformPreparationObligation : QuantumBlockEncoding.SemanticObligation
matchingProjectionObligation : QuantumBlockEncoding.SemanticObligation
projectionFactorSemantics : QuantumBlockEncoding.SemanticObligation
finiteCompositionNormalizedEquality : QuantumBlockEncoding.SemanticObligation
productObligation : QuantumBlockEncoding.SemanticObligation
conditionalEvalLemma : String
sourceContractCompiled : Bool
uniformPreparationProved : Bool
matchingProjectionProved : Bool
projectionFactorSemanticsProved : Bool
normalizedBlockEqualityProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary projection source contract n 3”. Compiled source/projection contract for the focused boundary branch.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Compiled source/projection contract for the focused boundary branch. This packet connects the existing conditional 'kappa_inv' algebra to the paper source and the cited uniform-state-preparation result. It deliberately does not prove that the circuit supplies the factor; the relevant fields remain false obligations for a later block-projection packet.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:10238. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.202●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSourceContract_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProjectionSourceContract
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSourceContract_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProjectionSourceContract
Compiled source/projection contract for the focused boundary branch. This packet connects the existing conditional `kappa_inv` algebra to the paper source and the cited uniform-state-preparation result. It deliberately does not prove that the circuit supplies the factor; the relevant fields remain false obligations for a later block-projection packet.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary projection source contract n 3 transcript”; its local proof does not by itself complete the broader paper route. Transcript theorem for the boundary projection source contract.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Transcript theorem for the boundary projection source contract. It checks that the contract reuses the compiled 'kappa_inv' packet, points to the cited uniform-preparation row, fixes the focused slot data, and leaves all semantic obligations false.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:10289. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.203●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSourceContract_n3_transcript : have contract := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSourceContract_n3; have semantics := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryKappaProjectionSemantics_n3; contract.kappaSemantics = semantics ∧ contract.citedResultId = "ShuklaVedula2024.HWkappaUniformSuperposition" ∧ contract.preparationFormula = "H_W^(kappa)|0>^ceil(log2 kappa) = (1/sqrt(kappa)) * sum_{s=0}^{kappa-1} |s>" ∧ contract.preparationAmplitudeFormula = "1/sqrt(kappa)" ∧ contract.projectionAmplitudeFormula = "1/sqrt(kappa)" ∧ contract.combinedProjectionFormula = "1/kappa" ∧ contract.focusedKappa = 7 ∧ contract.focusedSparseSlot = 2 ∧ contract.sourceBasisIndex = 32 ∧ contract.targetBasisIndex = 32 ∧ contract.projectionFactor = QuantumBlockEncoding.Coeff.symbol "kappa_inv" ∧ contract.projectedBranchProduct = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryKappaProjectionTarget_n3.splitTarget.branchLocalProduct.mul (QuantumBlockEncoding.Coeff.symbol "kappa_inv") ∧ contract.uniformPreparationObligation = semantics.uniformPreparationObligation ∧ contract.matchingProjectionObligation = semantics.kappaProjectionObligation ∧ contract.finiteCompositionNormalizedEquality = semantics.finiteCompositionNormalizedEquality ∧ contract.productObligation = semantics.productObligation ∧ contract.conditionalEvalLemma = "oneTermRobinGamma3BoundaryKappaProjectionEval_n3" ∧ contract.sourceContractCompiled = true ∧ contract.uniformPreparationObligation.proved = false ∧ contract.matchingProjectionObligation.proved = false ∧ contract.projectionFactorSemantics.proved = false ∧ contract.finiteCompositionNormalizedEquality.proved = false ∧ contract.productObligation.proved = false ∧ contract.uniformPreparationProved = false ∧ contract.matchingProjectionProved = false ∧ contract.projectionFactorSemanticsProved = false ∧ contract.normalizedBlockEqualityProved = false ∧ contract.productToCoefficientProved = false ∧ contract.lcuCorrectProved = false ∧ contract.blockProjectionProved = false ∧ contract.blockCorrectProved = false ∧ contract.finalExtractionProved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSourceContract_n3_transcript : have contract := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSourceContract_n3; have semantics := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryKappaProjectionSemantics_n3; contract.kappaSemantics = semantics ∧ contract.citedResultId = "ShuklaVedula2024.HWkappaUniformSuperposition" ∧ contract.preparationFormula = "H_W^(kappa)|0>^ceil(log2 kappa) = (1/sqrt(kappa)) * sum_{s=0}^{kappa-1} |s>" ∧ contract.preparationAmplitudeFormula = "1/sqrt(kappa)" ∧ contract.projectionAmplitudeFormula = "1/sqrt(kappa)" ∧ contract.combinedProjectionFormula = "1/kappa" ∧ contract.focusedKappa = 7 ∧ contract.focusedSparseSlot = 2 ∧ contract.sourceBasisIndex = 32 ∧ contract.targetBasisIndex = 32 ∧ contract.projectionFactor = QuantumBlockEncoding.Coeff.symbol "kappa_inv" ∧ contract.projectedBranchProduct = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryKappaProjectionTarget_n3.splitTarget.branchLocalProduct.mul (QuantumBlockEncoding.Coeff.symbol "kappa_inv") ∧ contract.uniformPreparationObligation = semantics.uniformPreparationObligation ∧ contract.matchingProjectionObligation = semantics.kappaProjectionObligation ∧ contract.finiteCompositionNormalizedEquality = semantics.finiteCompositionNormalizedEquality ∧ contract.productObligation = semantics.productObligation ∧ contract.conditionalEvalLemma = "oneTermRobinGamma3BoundaryKappaProjectionEval_n3" ∧ contract.sourceContractCompiled = true ∧ contract.uniformPreparationObligation.proved = false ∧ contract.matchingProjectionObligation.proved = false ∧ contract.projectionFactorSemantics.proved = false ∧ contract.finiteCompositionNormalizedEquality.proved = false ∧ contract.productObligation.proved = false ∧ contract.uniformPreparationProved = false ∧ contract.matchingProjectionProved = false ∧ contract.projectionFactorSemanticsProved = false ∧ contract.normalizedBlockEqualityProved = false ∧ contract.productToCoefficientProved = false ∧ contract.lcuCorrectProved = false ∧ contract.blockProjectionProved = false ∧ contract.blockCorrectProved = false ∧ contract.finalExtractionProved = false
Transcript theorem for the boundary projection source contract. It checks that the contract reuses the compiled `kappa_inv` packet, points to the cited uniform-preparation row, fixes the focused slot data, and leaves all semantic obligations false.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary projection factor index n 3”; its local proof does not by itself complete the broader paper route. Finite index check for the boundary projection-factor packet.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Finite index check for the boundary projection-factor packet. This theorem proves only the local bookkeeping part of the sparse-register projection factor: the prepared sparse slot and the projected sparse slot are the same focused slot '2', and both use the clean basis index generated by 'oneTermRobinGamma3PaperBasisIndex'. It does not prove the amplitude of 'H_W^(kappa)', the matching projection amplitude, or the block-composition equality.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:10347. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.204●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionFactorIndex_n3 : have p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3; have contract := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSourceContract_n3; contract.focusedSparseSlot = 2 ∧ contract.sourceBasisIndex = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3PaperBasisIndex p 2 0 ∧ contract.targetBasisIndex = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3PaperBasisIndex p 2 0 ∧ contract.sourceBasisIndex = contract.targetBasisIndex ∧ contract.sourceBasisIndex = 32 ∧ contract.targetBasisIndex = 32 ∧ contract.projectionFactor = QuantumBlockEncoding.Coeff.symbol "kappa_inv" ∧ contract.projectedBranchProduct = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryKappaProjectionTarget_n3.splitTarget.branchLocalProduct.mul (QuantumBlockEncoding.Coeff.symbol "kappa_inv") ∧ contract.projectionFactorSemantics.proved = false ∧ contract.uniformPreparationObligation.proved = false ∧ contract.matchingProjectionObligation.proved = false ∧ contract.finiteCompositionNormalizedEquality.proved = false ∧ contract.productObligation.proved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionFactorIndex_n3 : have p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3; have contract := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSourceContract_n3; contract.focusedSparseSlot = 2 ∧ contract.sourceBasisIndex = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3PaperBasisIndex p 2 0 ∧ contract.targetBasisIndex = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3PaperBasisIndex p 2 0 ∧ contract.sourceBasisIndex = contract.targetBasisIndex ∧ contract.sourceBasisIndex = 32 ∧ contract.targetBasisIndex = 32 ∧ contract.projectionFactor = QuantumBlockEncoding.Coeff.symbol "kappa_inv" ∧ contract.projectedBranchProduct = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryKappaProjectionTarget_n3.splitTarget.branchLocalProduct.mul (QuantumBlockEncoding.Coeff.symbol "kappa_inv") ∧ contract.projectionFactorSemantics.proved = false ∧ contract.uniformPreparationObligation.proved = false ∧ contract.matchingProjectionObligation.proved = false ∧ contract.finiteCompositionNormalizedEquality.proved = false ∧ contract.productObligation.proved = false
Finite index check for the boundary projection-factor packet. This theorem proves only the local bookkeeping part of the sparse-register projection factor: the prepared sparse slot and the projected sparse slot are the same focused slot `2`, and both use the clean basis index generated by `oneTermRobinGamma3PaperBasisIndex`. It does not prove the amplitude of `H_W^(kappa)`, the matching projection amplitude, or the block-composition equality.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary projection factor semantics”. A proposition-valued field is a requirement until a constructor supplies it. Finite projection-factor interface for the inserted 'kappa_inv' factor.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Finite projection-factor interface for the inserted 'kappa_inv' factor. The source contract says where the factor must come from. This packet adds the finite Lean-side index interface: the preparation and projection are both focused on sparse slot '2' and clean basis index '32', so the only remaining meaning of 'Coeff.symbol "kappa_inv"' is the amplitude theorem for the uniform sparse-register preparation and its matching block projection.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:10379. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.205●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProjectionFactorSemantics : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProjectionFactorSemantics : Type
Finite projection-factor interface for the inserted `kappa_inv` factor. The source contract says where the factor must come from. This packet adds the finite Lean-side index interface: the preparation and projection are both focused on sparse slot `2` and clean basis index `32`, so the only remaining meaning of `Coeff.symbol "kappa_inv"` is the amplitude theorem for the uniform sparse-register preparation and its matching block projection.
Fields
sourceAnchor : String
sourceContract : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProjectionSourceContract
finiteIndexLemma : String
preparedSparseSlot : ℕ
projectedSparseSlot : ℕ
preparedBasisIndex : ℕ
projectedBasisIndex : ℕ
preparedAndProjectedSlotAgree : Bool
preparedAndProjectedBasisAgree : Bool
preparationAmplitudeFormula : String
projectionAmplitudeFormula : String
combinedProjectionFormula : String
projectionFactor : QuantumBlockEncoding.Coeff
projectedBranchProduct : QuantumBlockEncoding.Coeff
factorSemanticsObligation : QuantumBlockEncoding.SemanticObligation
uniformPreparationObligation : QuantumBlockEncoding.SemanticObligation
matchingProjectionObligation : QuantumBlockEncoding.SemanticObligation
finiteCompositionNormalizedEquality : QuantumBlockEncoding.SemanticObligation
productObligation : QuantumBlockEncoding.SemanticObligation
conditionalEvalLemma : String
sourceContractCompiled : Bool
finiteIndexLemmaCompiled : Bool
exactRemainingObstruction : String
uniformPreparationProved : Bool
matchingProjectionProved : Bool
projectionFactorSemanticsProved : Bool
normalizedBlockEqualityProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary projection factor semantics n 3”. Compiled finite projection-factor interface for the focused boundary branch.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Compiled finite projection-factor interface for the focused boundary branch. This declaration reduces the projection-source gap to the exact missing semantic theorem: QBE still has to prove that the cited 'H_W^(kappa)' preparation and the matching block projection contribute the symbolic factor 'kappa_inv'. The finite slot and basis-index alignment is build-tested here.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:10422. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.206●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionFactorSemantics_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProjectionFactorSemantics
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionFactorSemantics_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProjectionFactorSemantics
Compiled finite projection-factor interface for the focused boundary branch. This declaration reduces the projection-source gap to the exact missing semantic theorem: QBE still has to prove that the cited `H_W^(kappa)` preparation and the matching block projection contribute the symbolic factor `kappa_inv`. The finite slot and basis-index alignment is build-tested here.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary projection factor semantics n 3 transcript”; its local proof does not by itself complete the broader paper route. Transcript theorem for the finite projection-factor interface.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Transcript theorem for the finite projection-factor interface. The theorem checks the compiled index lemma, the focused sparse slot, the clean basis index, the projected branch product, and every false semantic flag.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:10472. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.207●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionFactorSemantics_n3_transcript : have factor := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionFactorSemantics_n3; have contract := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSourceContract_n3; factor.sourceAnchor = "GHL2025 Eq. arbitrary sparcity, Eq. ROBIN clarified gamma3 boundary branch, Definition def:block-encoding, and Shukla-Vedula 2024, arXiv:2506.20478" ∧ factor.sourceContract = contract ∧ factor.finiteIndexLemma = "oneTermRobinGamma3BoundaryProjectionFactorIndex_n3" ∧ factor.preparedSparseSlot = 2 ∧ factor.projectedSparseSlot = 2 ∧ factor.preparedBasisIndex = 32 ∧ factor.projectedBasisIndex = 32 ∧ factor.preparedAndProjectedSlotAgree = true ∧ factor.preparedAndProjectedBasisAgree = true ∧ factor.preparationAmplitudeFormula = "1/sqrt(kappa)" ∧ factor.projectionAmplitudeFormula = "1/sqrt(kappa)" ∧ factor.combinedProjectionFormula = "1/kappa" ∧ factor.projectionFactor = QuantumBlockEncoding.Coeff.symbol "kappa_inv" ∧ factor.projectedBranchProduct = contract.projectedBranchProduct ∧ factor.factorSemanticsObligation = contract.projectionFactorSemantics ∧ factor.uniformPreparationObligation = contract.uniformPreparationObligation ∧ factor.matchingProjectionObligation = contract.matchingProjectionObligation ∧ factor.finiteCompositionNormalizedEquality = contract.finiteCompositionNormalizedEquality ∧ factor.productObligation = contract.productObligation ∧ factor.conditionalEvalLemma = "oneTermRobinGamma3BoundaryKappaProjectionEval_n3" ∧ factor.sourceContractCompiled = true ∧ factor.finiteIndexLemmaCompiled = true ∧ factor.exactRemainingObstruction = "prove that H_W^(kappa) preparation and matching sparse-slot projection contribute Coeff.symbol \"kappa_inv\" for focused slot 2" ∧ factor.factorSemanticsObligation.proved = false ∧ factor.uniformPreparationObligation.proved = false ∧ factor.matchingProjectionObligation.proved = false ∧ factor.finiteCompositionNormalizedEquality.proved = false ∧ factor.productObligation.proved = false ∧ factor.uniformPreparationProved = false ∧ factor.matchingProjectionProved = false ∧ factor.projectionFactorSemanticsProved = false ∧ factor.normalizedBlockEqualityProved = false ∧ factor.productToCoefficientProved = false ∧ factor.lcuCorrectProved = false ∧ factor.blockProjectionProved = false ∧ factor.blockCorrectProved = false ∧ factor.finalExtractionProved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionFactorSemantics_n3_transcript : have factor := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionFactorSemantics_n3; have contract := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSourceContract_n3; factor.sourceAnchor = "GHL2025 Eq. arbitrary sparcity, Eq. ROBIN clarified gamma3 boundary branch, Definition def:block-encoding, and Shukla-Vedula 2024, arXiv:2506.20478" ∧ factor.sourceContract = contract ∧ factor.finiteIndexLemma = "oneTermRobinGamma3BoundaryProjectionFactorIndex_n3" ∧ factor.preparedSparseSlot = 2 ∧ factor.projectedSparseSlot = 2 ∧ factor.preparedBasisIndex = 32 ∧ factor.projectedBasisIndex = 32 ∧ factor.preparedAndProjectedSlotAgree = true ∧ factor.preparedAndProjectedBasisAgree = true ∧ factor.preparationAmplitudeFormula = "1/sqrt(kappa)" ∧ factor.projectionAmplitudeFormula = "1/sqrt(kappa)" ∧ factor.combinedProjectionFormula = "1/kappa" ∧ factor.projectionFactor = QuantumBlockEncoding.Coeff.symbol "kappa_inv" ∧ factor.projectedBranchProduct = contract.projectedBranchProduct ∧ factor.factorSemanticsObligation = contract.projectionFactorSemantics ∧ factor.uniformPreparationObligation = contract.uniformPreparationObligation ∧ factor.matchingProjectionObligation = contract.matchingProjectionObligation ∧ factor.finiteCompositionNormalizedEquality = contract.finiteCompositionNormalizedEquality ∧ factor.productObligation = contract.productObligation ∧ factor.conditionalEvalLemma = "oneTermRobinGamma3BoundaryKappaProjectionEval_n3" ∧ factor.sourceContractCompiled = true ∧ factor.finiteIndexLemmaCompiled = true ∧ factor.exactRemainingObstruction = "prove that H_W^(kappa) preparation and matching sparse-slot projection contribute Coeff.symbol \"kappa_inv\" for focused slot 2" ∧ factor.factorSemanticsObligation.proved = false ∧ factor.uniformPreparationObligation.proved = false ∧ factor.matchingProjectionObligation.proved = false ∧ factor.finiteCompositionNormalizedEquality.proved = false ∧ factor.productObligation.proved = false ∧ factor.uniformPreparationProved = false ∧ factor.matchingProjectionProved = false ∧ factor.projectionFactorSemanticsProved = false ∧ factor.normalizedBlockEqualityProved = false ∧ factor.productToCoefficientProved = false ∧ factor.lcuCorrectProved = false ∧ factor.blockProjectionProved = false ∧ factor.blockCorrectProved = false ∧ factor.finalExtractionProved = false
Transcript theorem for the finite projection-factor interface. The theorem checks the compiled index lemma, the focused sparse slot, the clean basis index, the projected branch product, and every false semantic flag.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary projection factor obstruction”. A proposition-valued field is a requirement until a constructor supplies it. Smallest current obstruction for proving the focused projection factor.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Smallest current obstruction for proving the focused projection factor. The finite slot and basis-index interface is compiled, and the conditional 'kappa_inv' cancellation lemma is compiled. What remains is not another finite-index calculation: QBE still needs a formal source for the 'H_W^(kappa)' per-slot amplitude and a matching block-projection convention for the same sparse slot. This packet separates those two obligations while keeping the product-to-coefficient route false.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:10536. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.208●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProjectionFactorObstruction : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProjectionFactorObstruction : Type
Smallest current obstruction for proving the focused projection factor. The finite slot and basis-index interface is compiled, and the conditional `kappa_inv` cancellation lemma is compiled. What remains is not another finite-index calculation: QBE still needs a formal source for the `H_W^(kappa)` per-slot amplitude and a matching block-projection convention for the same sparse slot. This packet separates those two obligations while keeping the product-to-coefficient route false.
Fields
sourceAnchor : String
factorSemantics : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProjectionFactorSemantics
citedUniformPreparationId : String
citedUniformPreparationNeed : String
matchingProjectionNeed : String
symbolicFactorNeed : String
uniformPreparationObligation : QuantumBlockEncoding.SemanticObligation
matchingProjectionObligation : QuantumBlockEncoding.SemanticObligation
factorSemanticsObligation : QuantumBlockEncoding.SemanticObligation
finiteCompositionNormalizedEquality : QuantumBlockEncoding.SemanticObligation
productObligation : QuantumBlockEncoding.SemanticObligation
finiteIndexLemma : String
conditionalEvalLemma : String
finiteIndexLemmaCompiled : Bool
conditionalEvalCompiled : Bool
citedUniformPreparationProved : Bool
matchingProjectionProved : Bool
factorSemanticsProved : Bool
normalizedBlockEqualityProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
exactRemainingObstruction : String
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary projection factor obstruction n 3”. Compiled obstruction packet for the projection-factor semantics of the focused boundary branch.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Compiled obstruction packet for the projection-factor semantics of the focused boundary branch. This is deliberately not a proof of 'kappa_inv'. It records that the cited uniform-preparation amplitude and the QBE matching projection convention are the two separate missing ingredients before the existing conditional algebra can feed the product-to-coefficient route.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:10573. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.209●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionFactorObstruction_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProjectionFactorObstruction
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionFactorObstruction_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProjectionFactorObstruction
Compiled obstruction packet for the projection-factor semantics of the focused boundary branch. This is deliberately not a proof of `kappa_inv`. It records that the cited uniform-preparation amplitude and the QBE matching projection convention are the two separate missing ingredients before the existing conditional algebra can feed the product-to-coefficient route.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary projection factor obstruction n 3 transcript”; its local proof does not by itself complete the broader paper route. Transcript theorem for the projection-factor obstruction packet.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Transcript theorem for the projection-factor obstruction packet. The theorem confirms that the obstruction reuses the compiled finite projection-factor interface and does not promote product equality, LCU, projection, block correctness, normalized equality, or final extraction.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:10618. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.210●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionFactorObstruction_n3_transcript : have obstruction := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionFactorObstruction_n3; have factor := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionFactorSemantics_n3; obstruction.factorSemantics = factor ∧ obstruction.citedUniformPreparationId = "ShuklaVedula2024.HWkappaUniformSuperposition" ∧ obstruction.citedUniformPreparationNeed = "formalize or contract-map the H_W^(kappa) per-slot amplitude 1/sqrt(kappa) for focused sparse slot 2" ∧ obstruction.matchingProjectionNeed = "state the QBE block-projection convention that the bra onto the same sparse slot contributes the second 1/sqrt(kappa) factor" ∧ obstruction.symbolicFactorNeed = "identify the product of the two amplitudes with Coeff.symbol \"kappa_inv\" before using oneTermRobinGamma3BoundaryKappaProjectionEval_n3" ∧ obstruction.uniformPreparationObligation = factor.uniformPreparationObligation ∧ obstruction.matchingProjectionObligation = factor.matchingProjectionObligation ∧ obstruction.factorSemanticsObligation = factor.factorSemanticsObligation ∧ obstruction.finiteCompositionNormalizedEquality = factor.finiteCompositionNormalizedEquality ∧ obstruction.productObligation = factor.productObligation ∧ obstruction.finiteIndexLemma = "oneTermRobinGamma3BoundaryProjectionFactorIndex_n3" ∧ obstruction.conditionalEvalLemma = "oneTermRobinGamma3BoundaryKappaProjectionEval_n3" ∧ obstruction.finiteIndexLemmaCompiled = true ∧ obstruction.conditionalEvalCompiled = true ∧ obstruction.uniformPreparationObligation.proved = false ∧ obstruction.matchingProjectionObligation.proved = false ∧ obstruction.factorSemanticsObligation.proved = false ∧ obstruction.finiteCompositionNormalizedEquality.proved = false ∧ obstruction.productObligation.proved = false ∧ obstruction.citedUniformPreparationProved = false ∧ obstruction.matchingProjectionProved = false ∧ obstruction.factorSemanticsProved = false ∧ obstruction.normalizedBlockEqualityProved = false ∧ obstruction.productToCoefficientProved = false ∧ obstruction.lcuCorrectProved = false ∧ obstruction.blockProjectionProved = false ∧ obstruction.blockCorrectProved = false ∧ obstruction.finalExtractionProved = false ∧ obstruction.exactRemainingObstruction = "missing semantic theorem for H_W^(kappa) amplitude times matching sparse-slot projection equals Coeff.symbol \"kappa_inv\""
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionFactorObstruction_n3_transcript : have obstruction := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionFactorObstruction_n3; have factor := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionFactorSemantics_n3; obstruction.factorSemantics = factor ∧ obstruction.citedUniformPreparationId = "ShuklaVedula2024.HWkappaUniformSuperposition" ∧ obstruction.citedUniformPreparationNeed = "formalize or contract-map the H_W^(kappa) per-slot amplitude 1/sqrt(kappa) for focused sparse slot 2" ∧ obstruction.matchingProjectionNeed = "state the QBE block-projection convention that the bra onto the same sparse slot contributes the second 1/sqrt(kappa) factor" ∧ obstruction.symbolicFactorNeed = "identify the product of the two amplitudes with Coeff.symbol \"kappa_inv\" before using oneTermRobinGamma3BoundaryKappaProjectionEval_n3" ∧ obstruction.uniformPreparationObligation = factor.uniformPreparationObligation ∧ obstruction.matchingProjectionObligation = factor.matchingProjectionObligation ∧ obstruction.factorSemanticsObligation = factor.factorSemanticsObligation ∧ obstruction.finiteCompositionNormalizedEquality = factor.finiteCompositionNormalizedEquality ∧ obstruction.productObligation = factor.productObligation ∧ obstruction.finiteIndexLemma = "oneTermRobinGamma3BoundaryProjectionFactorIndex_n3" ∧ obstruction.conditionalEvalLemma = "oneTermRobinGamma3BoundaryKappaProjectionEval_n3" ∧ obstruction.finiteIndexLemmaCompiled = true ∧ obstruction.conditionalEvalCompiled = true ∧ obstruction.uniformPreparationObligation.proved = false ∧ obstruction.matchingProjectionObligation.proved = false ∧ obstruction.factorSemanticsObligation.proved = false ∧ obstruction.finiteCompositionNormalizedEquality.proved = false ∧ obstruction.productObligation.proved = false ∧ obstruction.citedUniformPreparationProved = false ∧ obstruction.matchingProjectionProved = false ∧ obstruction.factorSemanticsProved = false ∧ obstruction.normalizedBlockEqualityProved = false ∧ obstruction.productToCoefficientProved = false ∧ obstruction.lcuCorrectProved = false ∧ obstruction.blockProjectionProved = false ∧ obstruction.blockCorrectProved = false ∧ obstruction.finalExtractionProved = false ∧ obstruction.exactRemainingObstruction = "missing semantic theorem for H_W^(kappa) amplitude times matching sparse-slot projection equals Coeff.symbol \"kappa_inv\""
Transcript theorem for the projection-factor obstruction packet. The theorem confirms that the obstruction reuses the compiled finite projection-factor interface and does not promote product equality, LCU, projection, block correctness, normalized equality, or final extraction.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary matching projection convention”. A proposition-valued field is a requirement until a constructor supplies it. Local matching-projection convention for the focused boundary branch.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Local matching-projection convention for the focused boundary branch. The projection-factor obstruction has already separated the cited 'H_W^(kappa)' preparation amplitude from QBE's matching block-projection convention. This packet records only the local convention side: the projected bra is the same sparse slot '2' and the same clean basis index '32' used by the prepared branch. It does not prove that the bra contributes amplitude '1/sqrt(kappa)' and does not identify the two amplitude factors with 'Coeff.symbol "kappa_inv"'.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:10677. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.211●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryMatchingProjectionConvention : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryMatchingProjectionConvention : Type
Local matching-projection convention for the focused boundary branch. The projection-factor obstruction has already separated the cited `H_W^(kappa)` preparation amplitude from QBE's matching block-projection convention. This packet records only the local convention side: the projected bra is the same sparse slot `2` and the same clean basis index `32` used by the prepared branch. It does not prove that the bra contributes amplitude `1/sqrt(kappa)` and does not identify the two amplitude factors with `Coeff.symbol "kappa_inv"`.
Fields
sourceAnchor : String
obstruction : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProjectionFactorObstruction
sourceContract : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProjectionSourceContract
factorSemantics : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProjectionFactorSemantics
focusedSparseSlot : ℕ
preparedBasisIndex : ℕ
projectedBasisIndex : ℕ
projectionBraFormula : String
projectionKetFormula : String
matchingProjectionNeed : String
matchingProjectionObligation : QuantumBlockEncoding.SemanticObligation
uniformPreparationObligation : QuantumBlockEncoding.SemanticObligation
factorSemanticsObligation : QuantumBlockEncoding.SemanticObligation
finiteCompositionNormalizedEquality : QuantumBlockEncoding.SemanticObligation
productObligation : QuantumBlockEncoding.SemanticObligation
finiteIndexLemma : String
conditionalEvalLemma : String
finiteIndexLemmaCompiled : Bool
obstructionPacketCompiled : Bool
matchingProjectionConventionCompiled : Bool
uniformPreparationProved : Bool
matchingProjectionProved : Bool
factorSemanticsProved : Bool
normalizedBlockEqualityProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary matching projection convention n 3”. Compiled local matching-projection convention for sparse slot '2'.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Compiled local matching-projection convention for sparse slot '2'. The convention reuses the compiled projection-factor obstruction and finite index lemma. It narrows the local missing ingredient to the semantic theorem that the block projection onto the matching sparse slot contributes the second '1/sqrt(kappa)' amplitude.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:10717. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.212●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryMatchingProjectionConvention_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryMatchingProjectionConvention
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryMatchingProjectionConvention_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryMatchingProjectionConvention
Compiled local matching-projection convention for sparse slot `2`. The convention reuses the compiled projection-factor obstruction and finite index lemma. It narrows the local missing ingredient to the semantic theorem that the block projection onto the matching sparse slot contributes the second `1/sqrt(kappa)` amplitude.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary matching projection convention n 3 transcript”; its local proof does not by itself complete the broader paper route. Transcript theorem for the matching-projection convention packet.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Transcript theorem for the matching-projection convention packet. The theorem checks the local slot and basis-index wiring and confirms that the matching projection, projection-factor semantics, finite normalized equality, product-to-coefficient equality, and downstream block-encoding claims remain unproved.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:10765. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.213●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryMatchingProjectionConvention_n3_transcript : have convention := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryMatchingProjectionConvention_n3; have obstruction := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionFactorObstruction_n3; have factor := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionFactorSemantics_n3; convention.sourceAnchor = "GHL2025 Definition def:block-encoding, Eq. arbitrary sparcity, Eq. ROBIN clarified boundary branch, arXiv:2506.20478" ∧ convention.obstruction = obstruction ∧ convention.sourceContract = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSourceContract_n3 ∧ convention.factorSemantics = factor ∧ convention.focusedSparseSlot = 2 ∧ convention.preparedBasisIndex = 32 ∧ convention.projectedBasisIndex = 32 ∧ convention.preparedBasisIndex = convention.projectedBasisIndex ∧ convention.projectionBraFormula = "matching block-projection bra selects sparse slot 2 at clean basis index 32 and should contribute 1/sqrt(kappa)" ∧ convention.projectionKetFormula = "H_W^(kappa) prepares sparse slot 2 at clean basis index 32 with amplitude 1/sqrt(kappa)" ∧ convention.matchingProjectionNeed = obstruction.matchingProjectionNeed ∧ convention.matchingProjectionObligation = obstruction.matchingProjectionObligation ∧ convention.uniformPreparationObligation = obstruction.uniformPreparationObligation ∧ convention.factorSemanticsObligation = obstruction.factorSemanticsObligation ∧ convention.finiteCompositionNormalizedEquality = obstruction.finiteCompositionNormalizedEquality ∧ convention.productObligation = obstruction.productObligation ∧ convention.finiteIndexLemma = "oneTermRobinGamma3BoundaryProjectionFactorIndex_n3" ∧ convention.conditionalEvalLemma = "oneTermRobinGamma3BoundaryKappaProjectionEval_n3" ∧ convention.finiteIndexLemmaCompiled = true ∧ convention.obstructionPacketCompiled = true ∧ convention.matchingProjectionConventionCompiled = true ∧ convention.uniformPreparationObligation.proved = false ∧ convention.matchingProjectionObligation.proved = false ∧ convention.factorSemanticsObligation.proved = false ∧ convention.finiteCompositionNormalizedEquality.proved = false ∧ convention.productObligation.proved = false ∧ convention.uniformPreparationProved = false ∧ convention.matchingProjectionProved = false ∧ convention.factorSemanticsProved = false ∧ convention.normalizedBlockEqualityProved = false ∧ convention.productToCoefficientProved = false ∧ convention.lcuCorrectProved = false ∧ convention.blockProjectionProved = false ∧ convention.blockCorrectProved = false ∧ convention.finalExtractionProved = false
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryMatchingProjectionConvention_n3_transcript : have convention := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryMatchingProjectionConvention_n3; have obstruction := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionFactorObstruction_n3; have factor := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionFactorSemantics_n3; convention.sourceAnchor = "GHL2025 Definition def:block-encoding, Eq. arbitrary sparcity, Eq. ROBIN clarified boundary branch, arXiv:2506.20478" ∧ convention.obstruction = obstruction ∧ convention.sourceContract = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSourceContract_n3 ∧ convention.factorSemantics = factor ∧ convention.focusedSparseSlot = 2 ∧ convention.preparedBasisIndex = 32 ∧ convention.projectedBasisIndex = 32 ∧ convention.preparedBasisIndex = convention.projectedBasisIndex ∧ convention.projectionBraFormula = "matching block-projection bra selects sparse slot 2 at clean basis index 32 and should contribute 1/sqrt(kappa)" ∧ convention.projectionKetFormula = "H_W^(kappa) prepares sparse slot 2 at clean basis index 32 with amplitude 1/sqrt(kappa)" ∧ convention.matchingProjectionNeed = obstruction.matchingProjectionNeed ∧ convention.matchingProjectionObligation = obstruction.matchingProjectionObligation ∧ convention.uniformPreparationObligation = obstruction.uniformPreparationObligation ∧ convention.factorSemanticsObligation = obstruction.factorSemanticsObligation ∧ convention.finiteCompositionNormalizedEquality = obstruction.finiteCompositionNormalizedEquality ∧ convention.productObligation = obstruction.productObligation ∧ convention.finiteIndexLemma = "oneTermRobinGamma3BoundaryProjectionFactorIndex_n3" ∧ convention.conditionalEvalLemma = "oneTermRobinGamma3BoundaryKappaProjectionEval_n3" ∧ convention.finiteIndexLemmaCompiled = true ∧ convention.obstructionPacketCompiled = true ∧ convention.matchingProjectionConventionCompiled = true ∧ convention.uniformPreparationObligation.proved = false ∧ convention.matchingProjectionObligation.proved = false ∧ convention.factorSemanticsObligation.proved = false ∧ convention.finiteCompositionNormalizedEquality.proved = false ∧ convention.productObligation.proved = false ∧ convention.uniformPreparationProved = false ∧ convention.matchingProjectionProved = false ∧ convention.factorSemanticsProved = false ∧ convention.normalizedBlockEqualityProved = false ∧ convention.productToCoefficientProved = false ∧ convention.lcuCorrectProved = false ∧ convention.blockProjectionProved = false ∧ convention.blockCorrectProved = false ∧ convention.finalExtractionProved = false
Transcript theorem for the matching-projection convention packet. The theorem checks the local slot and basis-index wiring and confirms that the matching projection, projection-factor semantics, finite normalized equality, product-to-coefficient equality, and downstream block-encoding claims remain unproved.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary projection factor product eval n 3”; its local proof does not by itself complete the broader paper route. Symbolic product check for the two sparse-register amplitude factors.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Symbolic product check for the two sparse-register amplitude factors. This is only coefficient algebra: if an environment interprets the two '1/sqrt(kappa)' factors as 'sqrt_kappa_inv' and their product as 'kappa_inv', then the symbolic product evaluates to 'kappa_inv'. It does not prove the cited uniform-preparation amplitude or the matching projection amplitude.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:10832. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.214●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionFactorProductEval_n3 (env : String → ℚ) (hkappaSqrt : env "sqrt_kappa_inv" * env "sqrt_kappa_inv" = env "kappa_inv") : QuantumBlockEncoding.Coeff.evalWith env ((QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv").mul (QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv")) = QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Coeff.symbol "kappa_inv")
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionFactorProductEval_n3 (env : String → ℚ) (hkappaSqrt : env "sqrt_kappa_inv" * env "sqrt_kappa_inv" = env "kappa_inv") : QuantumBlockEncoding.Coeff.evalWith env ((QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv").mul (QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv")) = QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Coeff.symbol "kappa_inv")
Symbolic product check for the two sparse-register amplitude factors. This is only coefficient algebra: if an environment interprets the two `1/sqrt(kappa)` factors as `sqrt_kappa_inv` and their product as `kappa_inv`, then the symbolic product evaluates to `kappa_inv`. It does not prove the cited uniform-preparation amplitude or the matching projection amplitude.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary matching projection amplitude obstruction”. A proposition-valued field is a requirement until a constructor supplies it. Smallest current obstruction for the matching-projection amplitude packet.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Smallest current obstruction for the matching-projection amplitude packet. The local convention already fixes the projected bra to sparse slot '2' and clean basis index '32'. This packet separates the remaining amplitude work: the ket-side '1/sqrt(kappa)' factor is an external contract through 'H_W^(kappa)', the bra-side '1/sqrt(kappa)' factor is a local QBE block-projection obligation, and the product must be identified with the symbolic factor 'kappa_inv' before the conditional normalizer lemma can close the focused product route.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:10854. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.215●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryMatchingProjectionAmplitudeObstruction : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryMatchingProjectionAmplitudeObstruction : Type
Smallest current obstruction for the matching-projection amplitude packet. The local convention already fixes the projected bra to sparse slot `2` and clean basis index `32`. This packet separates the remaining amplitude work: the ket-side `1/sqrt(kappa)` factor is an external contract through `H_W^(kappa)`, the bra-side `1/sqrt(kappa)` factor is a local QBE block-projection obligation, and the product must be identified with the symbolic factor `kappa_inv` before the conditional normalizer lemma can close the focused product route.
Fields
sourceAnchor : String
matchingConvention : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryMatchingProjectionConvention
preparationAmplitudeFormula : String
matchingProjectionAmplitudeFormula : String
combinedProjectionFormula : String
symbolicProductFormula : String
preparationAmplitudeFactor : QuantumBlockEncoding.Coeff
matchingProjectionAmplitudeFactor : QuantumBlockEncoding.Coeff
combinedAmplitudeFactor : QuantumBlockEncoding.Coeff
expectedProjectionFactor : QuantumBlockEncoding.Coeff
uniformPreparationObligation : QuantumBlockEncoding.SemanticObligation
matchingProjectionObligation : QuantumBlockEncoding.SemanticObligation
factorSemanticsObligation : QuantumBlockEncoding.SemanticObligation
finiteCompositionNormalizedEquality : QuantumBlockEncoding.SemanticObligation
productObligation : QuantumBlockEncoding.SemanticObligation
finiteIndexLemma : String
conditionalEvalLemma : String
symbolicProductEvalLemma : String
matchingProjectionConventionCompiled : Bool
finiteIndexLemmaCompiled : Bool
conditionalEvalCompiled : Bool
symbolicProductEvalCompiled : Bool
uniformPreparationProved : Bool
matchingProjectionAmplitudeProved : Bool
factorSemanticsProved : Bool
normalizedBlockEqualityProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
exactRemainingObstruction : String
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary matching projection amplitude obstruction n 3”. Compiled obstruction packet for the focused matching-projection amplitude.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Compiled obstruction packet for the focused matching-projection amplitude. This reuses the matching-projection convention and adds the smallest symbolic factor interface needed by the next proof block. It does not prove either '1/sqrt(kappa)' amplitude and keeps product equality, finite normalized equality, LCU, block projection, block correctness, and final extraction false.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:10898. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.216●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryMatchingProjectionAmplitudeObstruction_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryMatchingProjectionAmplitudeObstruction
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryMatchingProjectionAmplitudeObstruction_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryMatchingProjectionAmplitudeObstruction
Compiled obstruction packet for the focused matching-projection amplitude. This reuses the matching-projection convention and adds the smallest symbolic factor interface needed by the next proof block. It does not prove either `1/sqrt(kappa)` amplitude and keeps product equality, finite normalized equality, LCU, block projection, block correctness, and final extraction false.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary matching projection amplitude obstruction n 3 transcript”; its local proof does not by itself complete the broader paper route. Transcript theorem for the matching-projection amplitude obstruction.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Transcript theorem for the matching-projection amplitude obstruction. The theorem checks that the obstruction is downstream of the compiled matching-projection convention and that it introduces no semantic promotion.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:10956. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.217●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryMatchingProjectionAmplitudeObstruction_n3_transcript : have obstruction := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryMatchingProjectionAmplitudeObstruction_n3; have convention := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryMatchingProjectionConvention_n3; obstruction.matchingConvention = convention ∧ obstruction.preparationAmplitudeFormula = "1/sqrt(kappa)" ∧ obstruction.matchingProjectionAmplitudeFormula = "1/sqrt(kappa)" ∧ obstruction.combinedProjectionFormula = "1/kappa" ∧ obstruction.symbolicProductFormula = "sqrt_kappa_inv * sqrt_kappa_inv = kappa_inv" ∧ obstruction.preparationAmplitudeFactor = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv" ∧ obstruction.matchingProjectionAmplitudeFactor = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv" ∧ obstruction.combinedAmplitudeFactor = (QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv").mul (QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv") ∧ obstruction.expectedProjectionFactor = QuantumBlockEncoding.Coeff.symbol "kappa_inv" ∧ obstruction.uniformPreparationObligation = convention.uniformPreparationObligation ∧ obstruction.matchingProjectionObligation = convention.matchingProjectionObligation ∧ obstruction.factorSemanticsObligation = convention.factorSemanticsObligation ∧ obstruction.finiteCompositionNormalizedEquality = convention.finiteCompositionNormalizedEquality ∧ obstruction.productObligation = convention.productObligation ∧ obstruction.finiteIndexLemma = "oneTermRobinGamma3BoundaryProjectionFactorIndex_n3" ∧ obstruction.conditionalEvalLemma = "oneTermRobinGamma3BoundaryKappaProjectionEval_n3" ∧ obstruction.symbolicProductEvalLemma = "oneTermRobinGamma3BoundaryProjectionFactorProductEval_n3" ∧ obstruction.matchingProjectionConventionCompiled = true ∧ obstruction.finiteIndexLemmaCompiled = true ∧ obstruction.conditionalEvalCompiled = true ∧ obstruction.symbolicProductEvalCompiled = true ∧ obstruction.uniformPreparationObligation.proved = false ∧ obstruction.matchingProjectionObligation.proved = false ∧ obstruction.factorSemanticsObligation.proved = false ∧ obstruction.finiteCompositionNormalizedEquality.proved = false ∧ obstruction.productObligation.proved = false ∧ obstruction.uniformPreparationProved = false ∧ obstruction.matchingProjectionAmplitudeProved = false ∧ obstruction.factorSemanticsProved = false ∧ obstruction.normalizedBlockEqualityProved = false ∧ obstruction.productToCoefficientProved = false ∧ obstruction.lcuCorrectProved = false ∧ obstruction.blockProjectionProved = false ∧ obstruction.blockCorrectProved = false ∧ obstruction.finalExtractionProved = false ∧ obstruction.exactRemainingObstruction = "prove the matching projection bra contributes sqrt_kappa_inv and combine it with the external H_W^(kappa) ket amplitude to justify Coeff.symbol \"kappa_inv\""
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryMatchingProjectionAmplitudeObstruction_n3_transcript : have obstruction := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryMatchingProjectionAmplitudeObstruction_n3; have convention := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryMatchingProjectionConvention_n3; obstruction.matchingConvention = convention ∧ obstruction.preparationAmplitudeFormula = "1/sqrt(kappa)" ∧ obstruction.matchingProjectionAmplitudeFormula = "1/sqrt(kappa)" ∧ obstruction.combinedProjectionFormula = "1/kappa" ∧ obstruction.symbolicProductFormula = "sqrt_kappa_inv * sqrt_kappa_inv = kappa_inv" ∧ obstruction.preparationAmplitudeFactor = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv" ∧ obstruction.matchingProjectionAmplitudeFactor = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv" ∧ obstruction.combinedAmplitudeFactor = (QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv").mul (QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv") ∧ obstruction.expectedProjectionFactor = QuantumBlockEncoding.Coeff.symbol "kappa_inv" ∧ obstruction.uniformPreparationObligation = convention.uniformPreparationObligation ∧ obstruction.matchingProjectionObligation = convention.matchingProjectionObligation ∧ obstruction.factorSemanticsObligation = convention.factorSemanticsObligation ∧ obstruction.finiteCompositionNormalizedEquality = convention.finiteCompositionNormalizedEquality ∧ obstruction.productObligation = convention.productObligation ∧ obstruction.finiteIndexLemma = "oneTermRobinGamma3BoundaryProjectionFactorIndex_n3" ∧ obstruction.conditionalEvalLemma = "oneTermRobinGamma3BoundaryKappaProjectionEval_n3" ∧ obstruction.symbolicProductEvalLemma = "oneTermRobinGamma3BoundaryProjectionFactorProductEval_n3" ∧ obstruction.matchingProjectionConventionCompiled = true ∧ obstruction.finiteIndexLemmaCompiled = true ∧ obstruction.conditionalEvalCompiled = true ∧ obstruction.symbolicProductEvalCompiled = true ∧ obstruction.uniformPreparationObligation.proved = false ∧ obstruction.matchingProjectionObligation.proved = false ∧ obstruction.factorSemanticsObligation.proved = false ∧ obstruction.finiteCompositionNormalizedEquality.proved = false ∧ obstruction.productObligation.proved = false ∧ obstruction.uniformPreparationProved = false ∧ obstruction.matchingProjectionAmplitudeProved = false ∧ obstruction.factorSemanticsProved = false ∧ obstruction.normalizedBlockEqualityProved = false ∧ obstruction.productToCoefficientProved = false ∧ obstruction.lcuCorrectProved = false ∧ obstruction.blockProjectionProved = false ∧ obstruction.blockCorrectProved = false ∧ obstruction.finalExtractionProved = false ∧ obstruction.exactRemainingObstruction = "prove the matching projection bra contributes sqrt_kappa_inv and combine it with the external H_W^(kappa) ket amplitude to justify Coeff.symbol \"kappa_inv\""
Transcript theorem for the matching-projection amplitude obstruction. The theorem checks that the obstruction is downstream of the compiled matching-projection convention and that it introduces no semantic promotion.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary matching projection amplitude contract”. A proposition-valued field is a requirement until a constructor supplies it. Focused contract for the bra-side matching projection amplitude.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Focused contract for the bra-side matching projection amplitude. The preceding obstruction already separates the cited ket amplitude from the local projection side. This packet gives the local side a precise interface: the block-projection bra is the clean branch for sparse slot '2', basis index '32', and its expected amplitude factor is the symbol 'sqrt_kappa_inv'. It is still a contract, not a projection theorem, so all semantic flags remain false.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:11028. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.218●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryMatchingProjectionAmplitudeContract : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryMatchingProjectionAmplitudeContract : Type
Focused contract for the bra-side matching projection amplitude. The preceding obstruction already separates the cited ket amplitude from the local projection side. This packet gives the local side a precise interface: the block-projection bra is the clean branch for sparse slot `2`, basis index `32`, and its expected amplitude factor is the symbol `sqrt_kappa_inv`. It is still a contract, not a projection theorem, so all semantic flags remain false.
Fields
sourceAnchor : String
amplitudeObstruction : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryMatchingProjectionAmplitudeObstruction
matchingConvention : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryMatchingProjectionConvention
focusedSparseSlot : ℕ
preparedBasisIndex : ℕ
projectedBasisIndex : ℕ
projectionBraFormula : String
expectedBraAmplitudeFormula : String
matchingProjectionAmplitudeFactor : QuantumBlockEncoding.Coeff
routeMatchingProjectionObligation : QuantumBlockEncoding.SemanticObligation
amplitudeContractObligation : QuantumBlockEncoding.SemanticObligation
factorSemanticsObligation : QuantumBlockEncoding.SemanticObligation
productObligation : QuantumBlockEncoding.SemanticObligation
finiteIndexLemma : String
symbolicProductEvalLemma : String
amplitudeContractCompiled : Bool
finiteIndexLemmaCompiled : Bool
symbolicProductEvalCompiled : Bool
uniformPreparationProved : Bool
matchingProjectionAmplitudeProved : Bool
factorSemanticsProved : Bool
normalizedBlockEqualityProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
exactRemainingObstruction : String
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary matching projection amplitude contract n 3”. Compiled bra-side projection-amplitude contract for the focused boundary route.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Compiled bra-side projection-amplitude contract for the focused boundary route. This is the QBE-local complement to the cited 'H_W^(kappa)' preparation-amplitude contract. It narrows the remaining block-projection obligation to one finite branch and one expected symbolic amplitude factor.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:11069. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.219●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryMatchingProjectionAmplitudeContract_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryMatchingProjectionAmplitudeContract
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryMatchingProjectionAmplitudeContract_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryMatchingProjectionAmplitudeContract
Compiled bra-side projection-amplitude contract for the focused boundary route. This is the QBE-local complement to the cited `H_W^(kappa)` preparation-amplitude contract. It narrows the remaining block-projection obligation to one finite branch and one expected symbolic amplitude factor.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary matching projection amplitude contract n 3 transcript”; its local proof does not by itself complete the broader paper route. Transcript theorem for the focused bra-side projection-amplitude contract.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Transcript theorem for the focused bra-side projection-amplitude contract. It checks that the new contract is downstream of the existing obstruction, uses the same slot and basis index, exposes the expected 'sqrt_kappa_inv' factor, and preserves all false theorem-facing obligations.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:11125. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.220●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryMatchingProjectionAmplitudeContract_n3_transcript : have contract := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryMatchingProjectionAmplitudeContract_n3; have obstruction := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryMatchingProjectionAmplitudeObstruction_n3; have convention := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryMatchingProjectionConvention_n3; contract.amplitudeObstruction = obstruction ∧ contract.matchingConvention = convention ∧ contract.focusedSparseSlot = 2 ∧ contract.preparedBasisIndex = 32 ∧ contract.projectedBasisIndex = 32 ∧ contract.preparedBasisIndex = contract.projectedBasisIndex ∧ contract.projectionBraFormula = "bra <0| on the sparse-register preparation block, restricted to sparse slot 2 and clean basis index 32" ∧ contract.expectedBraAmplitudeFormula = "1/sqrt(kappa)" ∧ contract.matchingProjectionAmplitudeFactor = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv" ∧ contract.routeMatchingProjectionObligation = obstruction.matchingProjectionObligation ∧ contract.amplitudeContractObligation.description = "prove the matching block-projection bra for sparse slot 2 and clean basis index 32 contributes Coeff.symbol \"sqrt_kappa_inv\"" ∧ contract.amplitudeContractObligation.source = "GHL2025 Definition def:block-encoding, Eq. arbitrary sparcity, Eq. ROBIN clarified boundary branch, and Fig. 1-term ROBIN" ∧ contract.amplitudeContractObligation.proved = false ∧ contract.factorSemanticsObligation = obstruction.factorSemanticsObligation ∧ contract.productObligation = obstruction.productObligation ∧ contract.finiteIndexLemma = "oneTermRobinGamma3BoundaryProjectionFactorIndex_n3" ∧ contract.symbolicProductEvalLemma = "oneTermRobinGamma3BoundaryProjectionFactorProductEval_n3" ∧ contract.amplitudeContractCompiled = true ∧ contract.finiteIndexLemmaCompiled = true ∧ contract.symbolicProductEvalCompiled = true ∧ contract.routeMatchingProjectionObligation.proved = false ∧ contract.factorSemanticsObligation.proved = false ∧ contract.productObligation.proved = false ∧ contract.uniformPreparationProved = false ∧ contract.matchingProjectionAmplitudeProved = false ∧ contract.factorSemanticsProved = false ∧ contract.normalizedBlockEqualityProved = false ∧ contract.productToCoefficientProved = false ∧ contract.lcuCorrectProved = false ∧ contract.blockProjectionProved = false ∧ contract.blockCorrectProved = false ∧ contract.finalExtractionProved = false ∧ contract.exactRemainingObstruction = "prove the finite block-projection bra amplitude sqrt_kappa_inv for sparse slot 2, then combine it with the cited ket amplitude through oneTermRobinGamma3BoundaryProjectionFactorProductEval_n3"
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryMatchingProjectionAmplitudeContract_n3_transcript : have contract := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryMatchingProjectionAmplitudeContract_n3; have obstruction := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryMatchingProjectionAmplitudeObstruction_n3; have convention := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryMatchingProjectionConvention_n3; contract.amplitudeObstruction = obstruction ∧ contract.matchingConvention = convention ∧ contract.focusedSparseSlot = 2 ∧ contract.preparedBasisIndex = 32 ∧ contract.projectedBasisIndex = 32 ∧ contract.preparedBasisIndex = contract.projectedBasisIndex ∧ contract.projectionBraFormula = "bra <0| on the sparse-register preparation block, restricted to sparse slot 2 and clean basis index 32" ∧ contract.expectedBraAmplitudeFormula = "1/sqrt(kappa)" ∧ contract.matchingProjectionAmplitudeFactor = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv" ∧ contract.routeMatchingProjectionObligation = obstruction.matchingProjectionObligation ∧ contract.amplitudeContractObligation.description = "prove the matching block-projection bra for sparse slot 2 and clean basis index 32 contributes Coeff.symbol \"sqrt_kappa_inv\"" ∧ contract.amplitudeContractObligation.source = "GHL2025 Definition def:block-encoding, Eq. arbitrary sparcity, Eq. ROBIN clarified boundary branch, and Fig. 1-term ROBIN" ∧ contract.amplitudeContractObligation.proved = false ∧ contract.factorSemanticsObligation = obstruction.factorSemanticsObligation ∧ contract.productObligation = obstruction.productObligation ∧ contract.finiteIndexLemma = "oneTermRobinGamma3BoundaryProjectionFactorIndex_n3" ∧ contract.symbolicProductEvalLemma = "oneTermRobinGamma3BoundaryProjectionFactorProductEval_n3" ∧ contract.amplitudeContractCompiled = true ∧ contract.finiteIndexLemmaCompiled = true ∧ contract.symbolicProductEvalCompiled = true ∧ contract.routeMatchingProjectionObligation.proved = false ∧ contract.factorSemanticsObligation.proved = false ∧ contract.productObligation.proved = false ∧ contract.uniformPreparationProved = false ∧ contract.matchingProjectionAmplitudeProved = false ∧ contract.factorSemanticsProved = false ∧ contract.normalizedBlockEqualityProved = false ∧ contract.productToCoefficientProved = false ∧ contract.lcuCorrectProved = false ∧ contract.blockProjectionProved = false ∧ contract.blockCorrectProved = false ∧ contract.finalExtractionProved = false ∧ contract.exactRemainingObstruction = "prove the finite block-projection bra amplitude sqrt_kappa_inv for sparse slot 2, then combine it with the cited ket amplitude through oneTermRobinGamma3BoundaryProjectionFactorProductEval_n3"
Transcript theorem for the focused bra-side projection-amplitude contract. It checks that the new contract is downstream of the existing obstruction, uses the same slot and basis index, exposes the expected `sqrt_kappa_inv` factor, and preserves all false theorem-facing obligations.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary projection amplitude semantics”. A proposition-valued field is a requirement until a constructor supplies it. Phase-1 projection-amplitude semantics for the focused boundary branch.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Phase-1 projection-amplitude semantics for the focused boundary branch. The bra-side matching projection amplitude has now been narrowed to the symbol 'sqrt_kappa_inv', and the ket-side amplitude remains the cited 'H_W^(kappa)' contract. This packet accepts both as explicit contracts for the current GHL theorem transcript, while keeping the actual amplitude, factor-semantics, finite-composition, and product-to-coefficient obligations false.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:11190. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.221●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProjectionAmplitudeSemantics : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProjectionAmplitudeSemantics : Type
Phase-1 projection-amplitude semantics for the focused boundary branch. The bra-side matching projection amplitude has now been narrowed to the symbol `sqrt_kappa_inv`, and the ket-side amplitude remains the cited `H_W^(kappa)` contract. This packet accepts both as explicit contracts for the current GHL theorem transcript, while keeping the actual amplitude, factor-semantics, finite-composition, and product-to-coefficient obligations false.
Fields
sourceAnchor : String
amplitudeContract : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryMatchingProjectionAmplitudeContract
citedUniformPreparationId : String
focusedSparseSlot : ℕ
cleanBasisIndex : ℕ
ketAmplitudeFormula : String
braAmplitudeFormula : String
symbolicProductFormula : String
ketAmplitudeFactor : QuantumBlockEncoding.Coeff
braAmplitudeFactor : QuantumBlockEncoding.Coeff
combinedAmplitudeFactor : QuantumBlockEncoding.Coeff
expectedProjectionFactor : QuantumBlockEncoding.Coeff
productHypothesisFormula : String
conditionalProductEvalLemma : String
uniformPreparationObligation : QuantumBlockEncoding.SemanticObligation
braAmplitudeObligation : QuantumBlockEncoding.SemanticObligation
routeMatchingProjectionObligation : QuantumBlockEncoding.SemanticObligation
factorSemanticsObligation : QuantumBlockEncoding.SemanticObligation
finiteCompositionNormalizedEquality : QuantumBlockEncoding.SemanticObligation
productObligation : QuantumBlockEncoding.SemanticObligation
ketAmplitudeAcceptedAsContract : Bool
braAmplitudeAcceptedAsContract : Bool
amplitudeContractCompiled : Bool
conditionalProductEvalCompiled : Bool
uniformPreparationProved : Bool
braAmplitudeProved : Bool
routeMatchingProjectionProved : Bool
factorSemanticsProved : Bool
normalizedBlockEqualityProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
exactRemainingObstruction : String
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary projection amplitude semantics n 3”. Compiled projection-amplitude semantics packet for the focused 'gamma3' boundary branch.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Compiled projection-amplitude semantics packet for the focused 'gamma3' boundary branch. This is not a proof of the sparse-register amplitude. It is the precise Phase-1 contract interface needed before the route can use the symbolic product lemma and later discharge 'factorSemanticsObligation'.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:11237. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.222●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionAmplitudeSemantics_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProjectionAmplitudeSemantics
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionAmplitudeSemantics_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProjectionAmplitudeSemantics
Compiled projection-amplitude semantics packet for the focused `gamma3` boundary branch. This is not a proof of the sparse-register amplitude. It is the precise Phase-1 contract interface needed before the route can use the symbolic product lemma and later discharge `factorSemanticsObligation`.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary projection amplitude contract product eval n 3”; its local proof does not by itself complete the broader paper route. Conditional product evaluation for the accepted sparse-register amplitude contracts.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Conditional product evaluation for the accepted sparse-register amplitude contracts. The theorem only performs symbolic coefficient algebra. It does not prove the cited 'H_W^(kappa)' ket amplitude, the QBE matching bra amplitude, or the factor-semantics obligation.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:11298. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.223●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionAmplitudeContractProductEval_n3 (env : String → ℚ) (hkappaSqrt : env "sqrt_kappa_inv" * env "sqrt_kappa_inv" = env "kappa_inv") : have semantics := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionAmplitudeSemantics_n3; QuantumBlockEncoding.Coeff.evalWith env semantics.combinedAmplitudeFactor = QuantumBlockEncoding.Coeff.evalWith env semantics.expectedProjectionFactor
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionAmplitudeContractProductEval_n3 (env : String → ℚ) (hkappaSqrt : env "sqrt_kappa_inv" * env "sqrt_kappa_inv" = env "kappa_inv") : have semantics := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionAmplitudeSemantics_n3; QuantumBlockEncoding.Coeff.evalWith env semantics.combinedAmplitudeFactor = QuantumBlockEncoding.Coeff.evalWith env semantics.expectedProjectionFactor
Conditional product evaluation for the accepted sparse-register amplitude contracts. The theorem only performs symbolic coefficient algebra. It does not prove the cited `H_W^(kappa)` ket amplitude, the QBE matching bra amplitude, or the factor-semantics obligation.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary projection amplitude semantics n 3 transcript”; its local proof does not by itself complete the broader paper route. Transcript theorem for the projection-amplitude semantics packet.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Transcript theorem for the projection-amplitude semantics packet. It verifies that the packet consumes the existing bra-side amplitude contract, accepts the ket and bra amplitudes only as Phase-1 contracts, and keeps all semantic proof flags false.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:11318. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.224●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionAmplitudeSemantics_n3_transcript : have semantics := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionAmplitudeSemantics_n3; have contract := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryMatchingProjectionAmplitudeContract_n3; semantics.amplitudeContract = contract ∧ semantics.citedUniformPreparationId = "ShuklaVedula2024.HWkappaUniformSuperposition" ∧ semantics.focusedSparseSlot = 2 ∧ semantics.cleanBasisIndex = 32 ∧ semantics.ketAmplitudeFormula = "1/sqrt(kappa)" ∧ semantics.braAmplitudeFormula = "1/sqrt(kappa)" ∧ semantics.symbolicProductFormula = "sqrt_kappa_inv * sqrt_kappa_inv = kappa_inv" ∧ semantics.ketAmplitudeFactor = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv" ∧ semantics.braAmplitudeFactor = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv" ∧ semantics.combinedAmplitudeFactor = (QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv").mul (QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv") ∧ semantics.expectedProjectionFactor = QuantumBlockEncoding.Coeff.symbol "kappa_inv" ∧ semantics.productHypothesisFormula = "env sqrt_kappa_inv * env sqrt_kappa_inv = env kappa_inv" ∧ semantics.conditionalProductEvalLemma = "oneTermRobinGamma3BoundaryProjectionAmplitudeContractProductEval_n3" ∧ semantics.uniformPreparationObligation = contract.amplitudeObstruction.uniformPreparationObligation ∧ semantics.braAmplitudeObligation = contract.amplitudeContractObligation ∧ semantics.routeMatchingProjectionObligation = contract.routeMatchingProjectionObligation ∧ semantics.factorSemanticsObligation = contract.factorSemanticsObligation ∧ semantics.finiteCompositionNormalizedEquality = contract.amplitudeObstruction.finiteCompositionNormalizedEquality ∧ semantics.productObligation = contract.productObligation ∧ semantics.ketAmplitudeAcceptedAsContract = true ∧ semantics.braAmplitudeAcceptedAsContract = true ∧ semantics.amplitudeContractCompiled = true ∧ semantics.conditionalProductEvalCompiled = true ∧ semantics.uniformPreparationObligation.proved = false ∧ semantics.braAmplitudeObligation.proved = false ∧ semantics.routeMatchingProjectionObligation.proved = false ∧ semantics.factorSemanticsObligation.proved = false ∧ semantics.finiteCompositionNormalizedEquality.proved = false ∧ semantics.productObligation.proved = false ∧ semantics.uniformPreparationProved = false ∧ semantics.braAmplitudeProved = false ∧ semantics.routeMatchingProjectionProved = false ∧ semantics.factorSemanticsProved = false ∧ semantics.normalizedBlockEqualityProved = false ∧ semantics.productToCoefficientProved = false ∧ semantics.lcuCorrectProved = false ∧ semantics.blockProjectionProved = false ∧ semantics.blockCorrectProved = false ∧ semantics.finalExtractionProved = false ∧ semantics.exactRemainingObstruction = "use the accepted ket and bra amplitude contracts plus the conditional product lemma only after the projection-factor semantics obligation is discharged"
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionAmplitudeSemantics_n3_transcript : have semantics := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionAmplitudeSemantics_n3; have contract := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryMatchingProjectionAmplitudeContract_n3; semantics.amplitudeContract = contract ∧ semantics.citedUniformPreparationId = "ShuklaVedula2024.HWkappaUniformSuperposition" ∧ semantics.focusedSparseSlot = 2 ∧ semantics.cleanBasisIndex = 32 ∧ semantics.ketAmplitudeFormula = "1/sqrt(kappa)" ∧ semantics.braAmplitudeFormula = "1/sqrt(kappa)" ∧ semantics.symbolicProductFormula = "sqrt_kappa_inv * sqrt_kappa_inv = kappa_inv" ∧ semantics.ketAmplitudeFactor = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv" ∧ semantics.braAmplitudeFactor = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv" ∧ semantics.combinedAmplitudeFactor = (QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv").mul (QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv") ∧ semantics.expectedProjectionFactor = QuantumBlockEncoding.Coeff.symbol "kappa_inv" ∧ semantics.productHypothesisFormula = "env sqrt_kappa_inv * env sqrt_kappa_inv = env kappa_inv" ∧ semantics.conditionalProductEvalLemma = "oneTermRobinGamma3BoundaryProjectionAmplitudeContractProductEval_n3" ∧ semantics.uniformPreparationObligation = contract.amplitudeObstruction.uniformPreparationObligation ∧ semantics.braAmplitudeObligation = contract.amplitudeContractObligation ∧ semantics.routeMatchingProjectionObligation = contract.routeMatchingProjectionObligation ∧ semantics.factorSemanticsObligation = contract.factorSemanticsObligation ∧ semantics.finiteCompositionNormalizedEquality = contract.amplitudeObstruction.finiteCompositionNormalizedEquality ∧ semantics.productObligation = contract.productObligation ∧ semantics.ketAmplitudeAcceptedAsContract = true ∧ semantics.braAmplitudeAcceptedAsContract = true ∧ semantics.amplitudeContractCompiled = true ∧ semantics.conditionalProductEvalCompiled = true ∧ semantics.uniformPreparationObligation.proved = false ∧ semantics.braAmplitudeObligation.proved = false ∧ semantics.routeMatchingProjectionObligation.proved = false ∧ semantics.factorSemanticsObligation.proved = false ∧ semantics.finiteCompositionNormalizedEquality.proved = false ∧ semantics.productObligation.proved = false ∧ semantics.uniformPreparationProved = false ∧ semantics.braAmplitudeProved = false ∧ semantics.routeMatchingProjectionProved = false ∧ semantics.factorSemanticsProved = false ∧ semantics.normalizedBlockEqualityProved = false ∧ semantics.productToCoefficientProved = false ∧ semantics.lcuCorrectProved = false ∧ semantics.blockProjectionProved = false ∧ semantics.blockCorrectProved = false ∧ semantics.finalExtractionProved = false ∧ semantics.exactRemainingObstruction = "use the accepted ket and bra amplitude contracts plus the conditional product lemma only after the projection-factor semantics obligation is discharged"
Transcript theorem for the projection-amplitude semantics packet. It verifies that the packet consumes the existing bra-side amplitude contract, accepts the ket and bra amplitudes only as Phase-1 contracts, and keeps all semantic proof flags false.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary projection amplitude factor eval n 3”; its local proof does not by itself complete the broader paper route. Conditional factor-semantics evaluation for the accepted sparse-register amplitude contracts.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Conditional factor-semantics evaluation for the accepted sparse-register amplitude contracts. This combines the local symbolic product lemma for the two 'sqrt_kappa_inv' factors with the existing conditional 'kappa_inv' normalizer lemma. The hypotheses are explicit coefficient-environment semantics; the theorem does not prove the cited 'H_W^(kappa)' amplitude, the matching projection amplitude, or the theorem-facing product obligation.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:11394. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.225●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionAmplitudeFactorEval_n3 (env : String → ℚ) (hND : env "N_D_inv" * env "N_D" = 1) (hNF : env "N_f_inv" * env "N_f" = 1) (hkappa : env "kappa_inv" * env "kappa" = 1) (hkappaSqrt : env "sqrt_kappa_inv" * env "sqrt_kappa_inv" = env "kappa_inv") : have semantics := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionAmplitudeSemantics_n3; QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryKappaProjectionTarget_n3.splitTarget.branchLocalProduct.mul semantics.combinedAmplitudeFactor) * QuantumBlockEncoding.Coeff.evalWith env QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryKappaProjectionTarget_n3.theoremNormalizer = QuantumBlockEncoding.Coeff.evalWith env QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryKappaProjectionTarget_n3.splitTarget.targetEntry
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionAmplitudeFactorEval_n3 (env : String → ℚ) (hND : env "N_D_inv" * env "N_D" = 1) (hNF : env "N_f_inv" * env "N_f" = 1) (hkappa : env "kappa_inv" * env "kappa" = 1) (hkappaSqrt : env "sqrt_kappa_inv" * env "sqrt_kappa_inv" = env "kappa_inv") : have semantics := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionAmplitudeSemantics_n3; QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryKappaProjectionTarget_n3.splitTarget.branchLocalProduct.mul semantics.combinedAmplitudeFactor) * QuantumBlockEncoding.Coeff.evalWith env QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryKappaProjectionTarget_n3.theoremNormalizer = QuantumBlockEncoding.Coeff.evalWith env QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryKappaProjectionTarget_n3.splitTarget.targetEntry
Conditional factor-semantics evaluation for the accepted sparse-register amplitude contracts. This combines the local symbolic product lemma for the two `sqrt_kappa_inv` factors with the existing conditional `kappa_inv` normalizer lemma. The hypotheses are explicit coefficient-environment semantics; the theorem does not prove the cited `H_W^(kappa)` amplitude, the matching projection amplitude, or the theorem-facing product obligation.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary projection amplitude factor semantics”. A proposition-valued field is a requirement until a constructor supplies it. Compiled packet for the conditional factor-semantics bridge.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Compiled packet for the conditional factor-semantics bridge. The packet records that the accepted ket and bra amplitude contracts can feed the existing 'kappa_inv' normalizer lemma only under the explicit product hypothesis. It keeps all amplitude, factor-semantics, finite-composition, and product-to-coefficient proof flags false.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:11457. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.226●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProjectionAmplitudeFactorSemantics : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProjectionAmplitudeFactorSemantics : Type
Compiled packet for the conditional factor-semantics bridge. The packet records that the accepted ket and bra amplitude contracts can feed the existing `kappa_inv` normalizer lemma only under the explicit product hypothesis. It keeps all amplitude, factor-semantics, finite-composition, and product-to-coefficient proof flags false.
Fields
sourceAnchor : String
projectionAmplitudeSemantics : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProjectionAmplitudeSemantics
projectedBranchProduct : QuantumBlockEncoding.Coeff
expectedTargetEntry : QuantumBlockEncoding.Coeff
theoremNormalizer : QuantumBlockEncoding.Coeff
factorHypothesisFormula : String
conditionalFactorEvalLemma : String
productEvalLemma : String
kappaProjectionEvalLemma : String
uniformPreparationObligation : QuantumBlockEncoding.SemanticObligation
braAmplitudeObligation : QuantumBlockEncoding.SemanticObligation
routeMatchingProjectionObligation : QuantumBlockEncoding.SemanticObligation
factorSemanticsObligation : QuantumBlockEncoding.SemanticObligation
finiteCompositionNormalizedEquality : QuantumBlockEncoding.SemanticObligation
productObligation : QuantumBlockEncoding.SemanticObligation
conditionalProductEvalCompiled : Bool
kappaProjectionEvalCompiled : Bool
conditionalFactorEvalCompiled : Bool
uniformPreparationProved : Bool
braAmplitudeProved : Bool
routeMatchingProjectionProved : Bool
factorSemanticsProved : Bool
normalizedBlockEqualityProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
exactRemainingObstruction : String
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary projection amplitude factor semantics n 3”. Factor-semantics bridge for the focused boundary 'gamma3' packet.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Factor-semantics bridge for the focused boundary 'gamma3' packet. The projected branch product uses the two accepted 'sqrt_kappa_inv' amplitude contracts directly. The conditional lemma shows that this product has the same normalizer behavior as the earlier inserted 'kappa_inv' factor when the environment supplies the product identity.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:11498. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.227●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionAmplitudeFactorSemantics_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProjectionAmplitudeFactorSemantics
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionAmplitudeFactorSemantics_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProjectionAmplitudeFactorSemantics
Factor-semantics bridge for the focused boundary `gamma3` packet. The projected branch product uses the two accepted `sqrt_kappa_inv` amplitude contracts directly. The conditional lemma shows that this product has the same normalizer behavior as the earlier inserted `kappa_inv` factor when the environment supplies the product identity.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary projection amplitude factor semantics n 3 transcript”; its local proof does not by itself complete the broader paper route. Transcript theorem for the conditional factor-semantics bridge.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Transcript theorem for the conditional factor-semantics bridge. It checks the bridge wiring and confirms that no amplitude, projection, finite-composition, product-to-coefficient, LCU, block-correctness, or final extraction flag has been promoted.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:11554. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.228●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionAmplitudeFactorSemantics_n3_transcript : have factor := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionAmplitudeFactorSemantics_n3; have semantics := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionAmplitudeSemantics_n3; have target := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryKappaProjectionTarget_n3; factor.projectionAmplitudeSemantics = semantics ∧ factor.projectedBranchProduct = target.splitTarget.branchLocalProduct.mul semantics.combinedAmplitudeFactor ∧ factor.expectedTargetEntry = target.splitTarget.targetEntry ∧ factor.theoremNormalizer = target.theoremNormalizer ∧ factor.factorHypothesisFormula = "env sqrt_kappa_inv * env sqrt_kappa_inv = env kappa_inv" ∧ factor.conditionalFactorEvalLemma = "oneTermRobinGamma3BoundaryProjectionAmplitudeFactorEval_n3" ∧ factor.productEvalLemma = "oneTermRobinGamma3BoundaryProjectionAmplitudeContractProductEval_n3" ∧ factor.kappaProjectionEvalLemma = "oneTermRobinGamma3BoundaryKappaProjectionEval_n3" ∧ factor.uniformPreparationObligation = semantics.uniformPreparationObligation ∧ factor.braAmplitudeObligation = semantics.braAmplitudeObligation ∧ factor.routeMatchingProjectionObligation = semantics.routeMatchingProjectionObligation ∧ factor.factorSemanticsObligation = semantics.factorSemanticsObligation ∧ factor.finiteCompositionNormalizedEquality = semantics.finiteCompositionNormalizedEquality ∧ factor.productObligation = semantics.productObligation ∧ factor.conditionalProductEvalCompiled = true ∧ factor.kappaProjectionEvalCompiled = true ∧ factor.conditionalFactorEvalCompiled = true ∧ factor.uniformPreparationObligation.proved = false ∧ factor.braAmplitudeObligation.proved = false ∧ factor.routeMatchingProjectionObligation.proved = false ∧ factor.factorSemanticsObligation.proved = false ∧ factor.finiteCompositionNormalizedEquality.proved = false ∧ factor.productObligation.proved = false ∧ factor.uniformPreparationProved = false ∧ factor.braAmplitudeProved = false ∧ factor.routeMatchingProjectionProved = false ∧ factor.factorSemanticsProved = false ∧ factor.normalizedBlockEqualityProved = false ∧ factor.productToCoefficientProved = false ∧ factor.lcuCorrectProved = false ∧ factor.blockProjectionProved = false ∧ factor.blockCorrectProved = false ∧ factor.finalExtractionProved = false ∧ factor.exactRemainingObstruction = "discharge the actual ket amplitude, bra amplitude, factor-semantics, finite-composition, and focused product-to-coefficient obligations before promoting the route"
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionAmplitudeFactorSemantics_n3_transcript : have factor := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionAmplitudeFactorSemantics_n3; have semantics := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionAmplitudeSemantics_n3; have target := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryKappaProjectionTarget_n3; factor.projectionAmplitudeSemantics = semantics ∧ factor.projectedBranchProduct = target.splitTarget.branchLocalProduct.mul semantics.combinedAmplitudeFactor ∧ factor.expectedTargetEntry = target.splitTarget.targetEntry ∧ factor.theoremNormalizer = target.theoremNormalizer ∧ factor.factorHypothesisFormula = "env sqrt_kappa_inv * env sqrt_kappa_inv = env kappa_inv" ∧ factor.conditionalFactorEvalLemma = "oneTermRobinGamma3BoundaryProjectionAmplitudeFactorEval_n3" ∧ factor.productEvalLemma = "oneTermRobinGamma3BoundaryProjectionAmplitudeContractProductEval_n3" ∧ factor.kappaProjectionEvalLemma = "oneTermRobinGamma3BoundaryKappaProjectionEval_n3" ∧ factor.uniformPreparationObligation = semantics.uniformPreparationObligation ∧ factor.braAmplitudeObligation = semantics.braAmplitudeObligation ∧ factor.routeMatchingProjectionObligation = semantics.routeMatchingProjectionObligation ∧ factor.factorSemanticsObligation = semantics.factorSemanticsObligation ∧ factor.finiteCompositionNormalizedEquality = semantics.finiteCompositionNormalizedEquality ∧ factor.productObligation = semantics.productObligation ∧ factor.conditionalProductEvalCompiled = true ∧ factor.kappaProjectionEvalCompiled = true ∧ factor.conditionalFactorEvalCompiled = true ∧ factor.uniformPreparationObligation.proved = false ∧ factor.braAmplitudeObligation.proved = false ∧ factor.routeMatchingProjectionObligation.proved = false ∧ factor.factorSemanticsObligation.proved = false ∧ factor.finiteCompositionNormalizedEquality.proved = false ∧ factor.productObligation.proved = false ∧ factor.uniformPreparationProved = false ∧ factor.braAmplitudeProved = false ∧ factor.routeMatchingProjectionProved = false ∧ factor.factorSemanticsProved = false ∧ factor.normalizedBlockEqualityProved = false ∧ factor.productToCoefficientProved = false ∧ factor.lcuCorrectProved = false ∧ factor.blockProjectionProved = false ∧ factor.blockCorrectProved = false ∧ factor.finalExtractionProved = false ∧ factor.exactRemainingObstruction = "discharge the actual ket amplitude, bra amplitude, factor-semantics, finite-composition, and focused product-to-coefficient obligations before promoting the route"
Transcript theorem for the conditional factor-semantics bridge. It checks the bridge wiring and confirms that no amplitude, projection, finite-composition, product-to-coefficient, LCU, block-correctness, or final extraction flag has been promoted.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary factor semantics contract map”. A proposition-valued field is a requirement until a constructor supplies it. Source-backed contract map for the factor-semantics obligation.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Source-backed contract map for the factor-semantics obligation. The conditional factor bridge is already compiled. This packet records the four remaining sources that must be supplied before the bridge can discharge the actual factor-semantics obligation: the cited ket amplitude, the local bra projection amplitude, the symbolic square-root product hypothesis, and the finite normalized block-composition equality. It keeps the theorem-facing obligation false.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:11623. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.229●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryFactorSemanticsContractMap : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryFactorSemanticsContractMap : Type
Source-backed contract map for the factor-semantics obligation. The conditional factor bridge is already compiled. This packet records the four remaining sources that must be supplied before the bridge can discharge the actual factor-semantics obligation: the cited ket amplitude, the local bra projection amplitude, the symbolic square-root product hypothesis, and the finite normalized block-composition equality. It keeps the theorem-facing obligation false.
Fields
sourceAnchor : String
factorBridge : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProjectionAmplitudeFactorSemantics
projectedBranchProduct : QuantumBlockEncoding.Coeff
expectedTargetEntry : QuantumBlockEncoding.Coeff
theoremNormalizer : QuantumBlockEncoding.Coeff
conditionalFactorEvalLemma : String
productEvalLemma : String
kappaProjectionEvalLemma : String
ketAmplitudeObligation : QuantumBlockEncoding.SemanticObligation
braAmplitudeObligation : QuantumBlockEncoding.SemanticObligation
routeMatchingProjectionObligation : QuantumBlockEncoding.SemanticObligation
productHypothesisObligation : QuantumBlockEncoding.SemanticObligation
factorSemanticsObligation : QuantumBlockEncoding.SemanticObligation
finiteCompositionNormalizedEquality : QuantumBlockEncoding.SemanticObligation
productObligation : QuantumBlockEncoding.SemanticObligation
requiredHypothesesFormula : String
factorSemanticsContractMapped : Bool
conditionalFactorEvalCompiled : Bool
ketAmplitudeProved : Bool
braAmplitudeProved : Bool
routeMatchingProjectionProved : Bool
productHypothesisProved : Bool
factorSemanticsProved : Bool
normalizedBlockEqualityProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
exactRemainingObstruction : String
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary factor semantics contract map n 3”. Compiled contract map for the focused boundary factor-semantics obligation.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Compiled contract map for the focused boundary factor-semantics obligation. This is a Phase-1 transcript object. It says precisely what would make 'oneTermRobinGamma3BoundaryProjectionAmplitudeFactorEval_n3' usable as the factor-semantics step, while preserving the false status of the real semantic obligations.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:11664. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.230●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryFactorSemanticsContractMap_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryFactorSemanticsContractMap
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryFactorSemanticsContractMap_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryFactorSemanticsContractMap
Compiled contract map for the focused boundary factor-semantics obligation. This is a Phase-1 transcript object. It says precisely what would make `oneTermRobinGamma3BoundaryProjectionAmplitudeFactorEval_n3` usable as the factor-semantics step, while preserving the false status of the real semantic obligations.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary factor semantics contract map eval n 3”; its local proof does not by itself complete the broader paper route. Conditional evaluation through the contract-map fields.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Conditional evaluation through the contract-map fields. The theorem does not prove the source obligations. It only shows that if the environment supplies the four stated coefficient hypotheses, then the contract map's projected branch product normalizes to the expected target entry.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:11719. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.231●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryFactorSemanticsContractMapEval_n3 (env : String → ℚ) (hND : env "N_D_inv" * env "N_D" = 1) (hNF : env "N_f_inv" * env "N_f" = 1) (hkappa : env "kappa_inv" * env "kappa" = 1) (hkappaSqrt : env "sqrt_kappa_inv" * env "sqrt_kappa_inv" = env "kappa_inv") : have contract := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryFactorSemanticsContractMap_n3; QuantumBlockEncoding.Coeff.evalWith env contract.projectedBranchProduct * QuantumBlockEncoding.Coeff.evalWith env contract.theoremNormalizer = QuantumBlockEncoding.Coeff.evalWith env contract.expectedTargetEntry
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryFactorSemanticsContractMapEval_n3 (env : String → ℚ) (hND : env "N_D_inv" * env "N_D" = 1) (hNF : env "N_f_inv" * env "N_f" = 1) (hkappa : env "kappa_inv" * env "kappa" = 1) (hkappaSqrt : env "sqrt_kappa_inv" * env "sqrt_kappa_inv" = env "kappa_inv") : have contract := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryFactorSemanticsContractMap_n3; QuantumBlockEncoding.Coeff.evalWith env contract.projectedBranchProduct * QuantumBlockEncoding.Coeff.evalWith env contract.theoremNormalizer = QuantumBlockEncoding.Coeff.evalWith env contract.expectedTargetEntry
Conditional evaluation through the contract-map fields. The theorem does not prove the source obligations. It only shows that if the environment supplies the four stated coefficient hypotheses, then the contract map's projected branch product normalizes to the expected target entry.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary factor semantics contract map n 3 transcript”; its local proof does not by itself complete the broader paper route. Transcript theorem for the focused factor-semantics contract map.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Transcript theorem for the focused factor-semantics contract map. It checks that the map is downstream of the compiled factor bridge, separates the ket, bra, product-hypothesis, and finite-composition blockers, and keeps all semantic proof flags false.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:11744. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.232●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryFactorSemanticsContractMap_n3_transcript : have contract := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryFactorSemanticsContractMap_n3; have factor := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionAmplitudeFactorSemantics_n3; contract.sourceAnchor = "GHL2025 Eq. arbitrary sparcity, Eq. ROBIN clarified boundary branch, Definition def:block-encoding, Fig. 1-term ROBIN, and Shukla-Vedula 2024, arXiv:2506.20478" ∧ contract.factorBridge = factor ∧ contract.projectedBranchProduct = factor.projectedBranchProduct ∧ contract.expectedTargetEntry = factor.expectedTargetEntry ∧ contract.theoremNormalizer = factor.theoremNormalizer ∧ contract.conditionalFactorEvalLemma = "oneTermRobinGamma3BoundaryProjectionAmplitudeFactorEval_n3" ∧ contract.productEvalLemma = "oneTermRobinGamma3BoundaryProjectionAmplitudeContractProductEval_n3" ∧ contract.kappaProjectionEvalLemma = "oneTermRobinGamma3BoundaryKappaProjectionEval_n3" ∧ contract.ketAmplitudeObligation = factor.uniformPreparationObligation ∧ contract.braAmplitudeObligation = factor.braAmplitudeObligation ∧ contract.routeMatchingProjectionObligation = factor.routeMatchingProjectionObligation ∧ contract.productHypothesisObligation.description = "interpret sqrt_kappa_inv * sqrt_kappa_inv as kappa_inv for the focused boundary sparse slot 2" ∧ contract.productHypothesisObligation.source = "GHL2025 Eq. arbitrary sparcity and Definition def:block-encoding; QBE coefficient-environment convention" ∧ contract.productHypothesisObligation.proved = false ∧ contract.factorSemanticsObligation = factor.factorSemanticsObligation ∧ contract.finiteCompositionNormalizedEquality = factor.finiteCompositionNormalizedEquality ∧ contract.productObligation = factor.productObligation ∧ contract.requiredHypothesesFormula = "N_D_inv*N_D=1, N_f_inv*N_f=1, kappa_inv*kappa=1, and sqrt_kappa_inv*sqrt_kappa_inv=kappa_inv" ∧ contract.factorSemanticsContractMapped = true ∧ contract.conditionalFactorEvalCompiled = true ∧ contract.ketAmplitudeObligation.proved = false ∧ contract.braAmplitudeObligation.proved = false ∧ contract.routeMatchingProjectionObligation.proved = false ∧ contract.factorSemanticsObligation.proved = false ∧ contract.finiteCompositionNormalizedEquality.proved = false ∧ contract.productObligation.proved = false ∧ contract.ketAmplitudeProved = false ∧ contract.braAmplitudeProved = false ∧ contract.routeMatchingProjectionProved = false ∧ contract.productHypothesisProved = false ∧ contract.factorSemanticsProved = false ∧ contract.normalizedBlockEqualityProved = false ∧ contract.productToCoefficientProved = false ∧ contract.lcuCorrectProved = false ∧ contract.blockProjectionProved = false ∧ contract.blockCorrectProved = false ∧ contract.finalExtractionProved = false ∧ contract.exactRemainingObstruction = "supply source-backed ket amplitude, bra amplitude, square-root product, and finite normalized block-composition semantics before proving the focused product obligation"
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryFactorSemanticsContractMap_n3_transcript : have contract := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryFactorSemanticsContractMap_n3; have factor := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionAmplitudeFactorSemantics_n3; contract.sourceAnchor = "GHL2025 Eq. arbitrary sparcity, Eq. ROBIN clarified boundary branch, Definition def:block-encoding, Fig. 1-term ROBIN, and Shukla-Vedula 2024, arXiv:2506.20478" ∧ contract.factorBridge = factor ∧ contract.projectedBranchProduct = factor.projectedBranchProduct ∧ contract.expectedTargetEntry = factor.expectedTargetEntry ∧ contract.theoremNormalizer = factor.theoremNormalizer ∧ contract.conditionalFactorEvalLemma = "oneTermRobinGamma3BoundaryProjectionAmplitudeFactorEval_n3" ∧ contract.productEvalLemma = "oneTermRobinGamma3BoundaryProjectionAmplitudeContractProductEval_n3" ∧ contract.kappaProjectionEvalLemma = "oneTermRobinGamma3BoundaryKappaProjectionEval_n3" ∧ contract.ketAmplitudeObligation = factor.uniformPreparationObligation ∧ contract.braAmplitudeObligation = factor.braAmplitudeObligation ∧ contract.routeMatchingProjectionObligation = factor.routeMatchingProjectionObligation ∧ contract.productHypothesisObligation.description = "interpret sqrt_kappa_inv * sqrt_kappa_inv as kappa_inv for the focused boundary sparse slot 2" ∧ contract.productHypothesisObligation.source = "GHL2025 Eq. arbitrary sparcity and Definition def:block-encoding; QBE coefficient-environment convention" ∧ contract.productHypothesisObligation.proved = false ∧ contract.factorSemanticsObligation = factor.factorSemanticsObligation ∧ contract.finiteCompositionNormalizedEquality = factor.finiteCompositionNormalizedEquality ∧ contract.productObligation = factor.productObligation ∧ contract.requiredHypothesesFormula = "N_D_inv*N_D=1, N_f_inv*N_f=1, kappa_inv*kappa=1, and sqrt_kappa_inv*sqrt_kappa_inv=kappa_inv" ∧ contract.factorSemanticsContractMapped = true ∧ contract.conditionalFactorEvalCompiled = true ∧ contract.ketAmplitudeObligation.proved = false ∧ contract.braAmplitudeObligation.proved = false ∧ contract.routeMatchingProjectionObligation.proved = false ∧ contract.factorSemanticsObligation.proved = false ∧ contract.finiteCompositionNormalizedEquality.proved = false ∧ contract.productObligation.proved = false ∧ contract.ketAmplitudeProved = false ∧ contract.braAmplitudeProved = false ∧ contract.routeMatchingProjectionProved = false ∧ contract.productHypothesisProved = false ∧ contract.factorSemanticsProved = false ∧ contract.normalizedBlockEqualityProved = false ∧ contract.productToCoefficientProved = false ∧ contract.lcuCorrectProved = false ∧ contract.blockProjectionProved = false ∧ contract.blockCorrectProved = false ∧ contract.finalExtractionProved = false ∧ contract.exactRemainingObstruction = "supply source-backed ket amplitude, bra amplitude, square-root product, and finite normalized block-composition semantics before proving the focused product obligation"
Transcript theorem for the focused factor-semantics contract map. It checks that the map is downstream of the compiled factor bridge, separates the ket, bra, product-hypothesis, and finite-composition blockers, and keeps all semantic proof flags false.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary bra projection amplitude source map”. A proposition-valued field is a requirement until a constructor supplies it. Source map for the remaining bra-side projection-amplitude obstruction.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Source map for the remaining bra-side projection-amplitude obstruction. The focused projection-amplitude contract already fixes sparse slot '2', clean basis index '32', and the expected factor 'sqrt_kappa_inv'. What is still missing is not another finite index lemma: QBE has not yet introduced the concrete sparse-register preparation/projection matrix, or an equivalent adjoint-entry contract, that would make the bra amplitude a Lean theorem.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:11816. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.233●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBraProjectionAmplitudeSourceMap : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBraProjectionAmplitudeSourceMap : Type
Source map for the remaining bra-side projection-amplitude obstruction. The focused projection-amplitude contract already fixes sparse slot `2`, clean basis index `32`, and the expected factor `sqrt_kappa_inv`. What is still missing is not another finite index lemma: QBE has not yet introduced the concrete sparse-register preparation/projection matrix, or an equivalent adjoint-entry contract, that would make the bra amplitude a Lean theorem.
Fields
sourceAnchor : String
amplitudeContract : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryMatchingProjectionAmplitudeContract
factorContractMap : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryFactorSemanticsContractMap
focusedSparseSlot : ℕ
cleanBasisIndex : ℕ
projectionBraEntryFormula : String
requiredSemanticObject : String
requiredAdjointEntry : String
expectedBraAmplitudeFactor : QuantumBlockEncoding.Coeff
finiteIndexLemma : String
amplitudeContractObligation : QuantumBlockEncoding.SemanticObligation
routeMatchingProjectionObligation : QuantumBlockEncoding.SemanticObligation
factorSemanticsObligation : QuantumBlockEncoding.SemanticObligation
finiteCompositionNormalizedEquality : QuantumBlockEncoding.SemanticObligation
productObligation : QuantumBlockEncoding.SemanticObligation
finiteIndexLemmaCompiled : Bool
braAmplitudeSourceMapped : Bool
directBraAmplitudeProofAvailable : Bool
amplitudeContractProved : Bool
routeMatchingProjectionProved : Bool
factorSemanticsProved : Bool
normalizedBlockEqualityProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
exactRemainingObstruction : String
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary bra projection amplitude source map n 3”. Compiled source map for the focused bra-side amplitude packet.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Compiled source map for the focused bra-side amplitude packet. This is the smaller obstruction requested by the lower packet. It records the precise semantic object needed to prove the local bra amplitude, instead of pretending that the current block-projection API already supplies it.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:11855. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.234●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBraProjectionAmplitudeSourceMap_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBraProjectionAmplitudeSourceMap
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBraProjectionAmplitudeSourceMap_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBraProjectionAmplitudeSourceMap
Compiled source map for the focused bra-side amplitude packet. This is the smaller obstruction requested by the lower packet. It records the precise semantic object needed to prove the local bra amplitude, instead of pretending that the current block-projection API already supplies it.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary bra projection amplitude source map n 3 transcript”; its local proof does not by itself complete the broader paper route. Transcript theorem for the bra-side projection-amplitude source map.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Transcript theorem for the bra-side projection-amplitude source map. This theorem checks only the source mapping and false-flag discipline. It does not prove the 'H_W^(kappa)' adjoint entry, the block-projection amplitude, the factor-semantics obligation, finite normalized equality, or the focused product-to-coefficient theorem.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:11914. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.235●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBraProjectionAmplitudeSourceMap_n3_transcript : have sourceMap := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBraProjectionAmplitudeSourceMap_n3; have amplitudeContract := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryMatchingProjectionAmplitudeContract_n3; have factorContract := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryFactorSemanticsContractMap_n3; sourceMap.amplitudeContract = amplitudeContract ∧ sourceMap.factorContractMap = factorContract ∧ sourceMap.focusedSparseSlot = 2 ∧ sourceMap.cleanBasisIndex = 32 ∧ sourceMap.projectionBraEntryFormula = "<0| H_W^(kappa)^dagger |2> = 1/sqrt(kappa), embedded at clean basis index 32" ∧ sourceMap.requiredSemanticObject = "sparse-register H_W^(kappa) preparation matrix, its dagger, or an equivalent block-projection bra-entry contract" ∧ sourceMap.requiredAdjointEntry = "the focused bra projection entry from sparse slot 2 to the clean sparse-register branch is Coeff.symbol \"sqrt_kappa_inv\"" ∧ sourceMap.expectedBraAmplitudeFactor = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv" ∧ sourceMap.finiteIndexLemma = "oneTermRobinGamma3BoundaryProjectionFactorIndex_n3" ∧ sourceMap.amplitudeContractObligation = amplitudeContract.amplitudeContractObligation ∧ sourceMap.routeMatchingProjectionObligation = amplitudeContract.routeMatchingProjectionObligation ∧ sourceMap.factorSemanticsObligation = amplitudeContract.factorSemanticsObligation ∧ sourceMap.finiteCompositionNormalizedEquality = factorContract.finiteCompositionNormalizedEquality ∧ sourceMap.productObligation = amplitudeContract.productObligation ∧ sourceMap.finiteIndexLemmaCompiled = true ∧ sourceMap.braAmplitudeSourceMapped = true ∧ sourceMap.directBraAmplitudeProofAvailable = false ∧ sourceMap.amplitudeContractObligation.proved = false ∧ sourceMap.routeMatchingProjectionObligation.proved = false ∧ sourceMap.factorSemanticsObligation.proved = false ∧ sourceMap.finiteCompositionNormalizedEquality.proved = false ∧ sourceMap.productObligation.proved = false ∧ sourceMap.amplitudeContractProved = false ∧ sourceMap.routeMatchingProjectionProved = false ∧ sourceMap.factorSemanticsProved = false ∧ sourceMap.normalizedBlockEqualityProved = false ∧ sourceMap.productToCoefficientProved = false ∧ sourceMap.lcuCorrectProved = false ∧ sourceMap.blockProjectionProved = false ∧ sourceMap.blockCorrectProved = false ∧ sourceMap.finalExtractionProved = false ∧ sourceMap.exactRemainingObstruction = "introduce or cite a typed H_W^(kappa) dagger/projection-entry semantic contract before proving the bra amplitude; the current block-projection target only fixes indices"
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBraProjectionAmplitudeSourceMap_n3_transcript : have sourceMap := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBraProjectionAmplitudeSourceMap_n3; have amplitudeContract := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryMatchingProjectionAmplitudeContract_n3; have factorContract := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryFactorSemanticsContractMap_n3; sourceMap.amplitudeContract = amplitudeContract ∧ sourceMap.factorContractMap = factorContract ∧ sourceMap.focusedSparseSlot = 2 ∧ sourceMap.cleanBasisIndex = 32 ∧ sourceMap.projectionBraEntryFormula = "<0| H_W^(kappa)^dagger |2> = 1/sqrt(kappa), embedded at clean basis index 32" ∧ sourceMap.requiredSemanticObject = "sparse-register H_W^(kappa) preparation matrix, its dagger, or an equivalent block-projection bra-entry contract" ∧ sourceMap.requiredAdjointEntry = "the focused bra projection entry from sparse slot 2 to the clean sparse-register branch is Coeff.symbol \"sqrt_kappa_inv\"" ∧ sourceMap.expectedBraAmplitudeFactor = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv" ∧ sourceMap.finiteIndexLemma = "oneTermRobinGamma3BoundaryProjectionFactorIndex_n3" ∧ sourceMap.amplitudeContractObligation = amplitudeContract.amplitudeContractObligation ∧ sourceMap.routeMatchingProjectionObligation = amplitudeContract.routeMatchingProjectionObligation ∧ sourceMap.factorSemanticsObligation = amplitudeContract.factorSemanticsObligation ∧ sourceMap.finiteCompositionNormalizedEquality = factorContract.finiteCompositionNormalizedEquality ∧ sourceMap.productObligation = amplitudeContract.productObligation ∧ sourceMap.finiteIndexLemmaCompiled = true ∧ sourceMap.braAmplitudeSourceMapped = true ∧ sourceMap.directBraAmplitudeProofAvailable = false ∧ sourceMap.amplitudeContractObligation.proved = false ∧ sourceMap.routeMatchingProjectionObligation.proved = false ∧ sourceMap.factorSemanticsObligation.proved = false ∧ sourceMap.finiteCompositionNormalizedEquality.proved = false ∧ sourceMap.productObligation.proved = false ∧ sourceMap.amplitudeContractProved = false ∧ sourceMap.routeMatchingProjectionProved = false ∧ sourceMap.factorSemanticsProved = false ∧ sourceMap.normalizedBlockEqualityProved = false ∧ sourceMap.productToCoefficientProved = false ∧ sourceMap.lcuCorrectProved = false ∧ sourceMap.blockProjectionProved = false ∧ sourceMap.blockCorrectProved = false ∧ sourceMap.finalExtractionProved = false ∧ sourceMap.exactRemainingObstruction = "introduce or cite a typed H_W^(kappa) dagger/projection-entry semantic contract before proving the bra amplitude; the current block-projection target only fixes indices"
Transcript theorem for the bra-side projection-amplitude source map. This theorem checks only the source mapping and false-flag discipline. It does not prove the `H_W^(kappa)` adjoint entry, the block-projection amplitude, the factor-semantics obligation, finite normalized equality, or the focused product-to-coefficient theorem.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary hw kappa dagger projection entry contract”. A proposition-valued field is a requirement until a constructor supplies it. Typed contract for the focused 'H_W^(kappa)' dagger projection entry.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Typed contract for the focused 'H_W^(kappa)' dagger projection entry. The source map already identified the missing semantic object. This contract turns that object into a Lean-facing interface for the exact entry needed by the boundary gamma3 route: the bra projection from sparse slot '2' to the clean sparse-register branch contributes 'sqrt_kappa_inv' at clean basis index '32'. It is accepted only as a Phase-1 contract; the actual matrix entry theorem and all downstream semantic obligations remain false.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:11980. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.236●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryHWKappaDaggerProjectionEntryContract : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryHWKappaDaggerProjectionEntryContract : Type
Typed contract for the focused `H_W^(kappa)` dagger projection entry. The source map already identified the missing semantic object. This contract turns that object into a Lean-facing interface for the exact entry needed by the boundary gamma3 route: the bra projection from sparse slot `2` to the clean sparse-register branch contributes `sqrt_kappa_inv` at clean basis index `32`. It is accepted only as a Phase-1 contract; the actual matrix entry theorem and all downstream semantic obligations remain false.
Fields
sourceAnchor : String
braSourceMap : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBraProjectionAmplitudeSourceMap
factorContractMap : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryFactorSemanticsContractMap
focusedSparseSlot : ℕ
cleanBasisIndex : ℕ
sparseRegisterBra : ℕ
sparseRegisterKet : ℕ
entryFormula : String
embeddedEntryFormula : String
expectedEntry : QuantumBlockEncoding.Coeff
sourceContractObligation : QuantumBlockEncoding.SemanticObligation
sourceMapBraAmplitudeObligation : QuantumBlockEncoding.SemanticObligation
factorMapBraAmplitudeObligation : QuantumBlockEncoding.SemanticObligation
routeMatchingProjectionObligation : QuantumBlockEncoding.SemanticObligation
factorSemanticsObligation : QuantumBlockEncoding.SemanticObligation
finiteCompositionNormalizedEquality : QuantumBlockEncoding.SemanticObligation
productObligation : QuantumBlockEncoding.SemanticObligation
contractAcceptedAsTypedInterface : Bool
sourceMapWired : Bool
factorMapWired : Bool
daggerEntryProved : Bool
braAmplitudeProved : Bool
routeMatchingProjectionProved : Bool
factorSemanticsProved : Bool
normalizedBlockEqualityProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
exactRemainingObstruction : String
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary hw kappa dagger projection entry contract n 3”. Compiled Phase-1 contract for the focused bra projection entry.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Compiled Phase-1 contract for the focused bra projection entry. The contract is downstream of 'oneTermRobinGamma3BoundaryBraProjectionAmplitudeSourceMap_n3' and rewires the same bra-amplitude obligation into 'oneTermRobinGamma3BoundaryFactorSemanticsContractMap_n3'. It does not prove the entry of 'H_W^(kappa)^dagger'; it records the precise contract that a future semantic matrix theorem must instantiate.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:12024. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.237●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerProjectionEntryContract_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryHWKappaDaggerProjectionEntryContract
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerProjectionEntryContract_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryHWKappaDaggerProjectionEntryContract
Compiled Phase-1 contract for the focused bra projection entry. The contract is downstream of `oneTermRobinGamma3BoundaryBraProjectionAmplitudeSourceMap_n3` and rewires the same bra-amplitude obligation into `oneTermRobinGamma3BoundaryFactorSemanticsContractMap_n3`. It does not prove the entry of `H_W^(kappa)^dagger`; it records the precise contract that a future semantic matrix theorem must instantiate.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary hw kappa dagger projection entry contract n 3 transcript”; its local proof does not by itself complete the broader paper route. Transcript theorem for the focused 'H_W^(kappa)' dagger entry contract.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Transcript theorem for the focused 'H_W^(kappa)' dagger entry contract. This checks that the new contract is wired to both the bra-source map and the factor-semantics contract map. The entry is still a contract-only interface: the actual dagger entry, bra amplitude, factor semantics, finite normalized equality, product-to-coefficient theorem, and final extraction remain false.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:12087. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.238●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerProjectionEntryContract_n3_transcript : have entry := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerProjectionEntryContract_n3; have sourceMap := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBraProjectionAmplitudeSourceMap_n3; have factorMap := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryFactorSemanticsContractMap_n3; entry.braSourceMap = sourceMap ∧ entry.factorContractMap = factorMap ∧ entry.focusedSparseSlot = 2 ∧ entry.cleanBasisIndex = 32 ∧ entry.sparseRegisterBra = 0 ∧ entry.sparseRegisterKet = 2 ∧ entry.entryFormula = "<0|H_W^(kappa)^dagger|2> = 1/sqrt(kappa)" ∧ entry.embeddedEntryFormula = "the focused entry is embedded at clean basis index 32 and represented by Coeff.symbol \"sqrt_kappa_inv\"" ∧ entry.expectedEntry = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv" ∧ entry.sourceContractObligation.description = "instantiate the focused H_W^(kappa) dagger projection-entry contract <0|H_W^(kappa)^dagger|2> = 1/sqrt(kappa)" ∧ entry.sourceContractObligation.proved = false ∧ entry.sourceMapBraAmplitudeObligation = sourceMap.amplitudeContractObligation ∧ entry.factorMapBraAmplitudeObligation = factorMap.braAmplitudeObligation ∧ entry.factorMapBraAmplitudeObligation = entry.sourceMapBraAmplitudeObligation ∧ entry.routeMatchingProjectionObligation = sourceMap.routeMatchingProjectionObligation ∧ entry.factorSemanticsObligation = factorMap.factorSemanticsObligation ∧ entry.finiteCompositionNormalizedEquality = factorMap.finiteCompositionNormalizedEquality ∧ entry.productObligation = factorMap.productObligation ∧ entry.contractAcceptedAsTypedInterface = true ∧ entry.sourceMapWired = true ∧ entry.factorMapWired = true ∧ entry.daggerEntryProved = false ∧ entry.sourceMapBraAmplitudeObligation.proved = false ∧ entry.factorMapBraAmplitudeObligation.proved = false ∧ entry.routeMatchingProjectionObligation.proved = false ∧ entry.factorSemanticsObligation.proved = false ∧ entry.finiteCompositionNormalizedEquality.proved = false ∧ entry.productObligation.proved = false ∧ entry.braAmplitudeProved = false ∧ entry.routeMatchingProjectionProved = false ∧ entry.factorSemanticsProved = false ∧ entry.normalizedBlockEqualityProved = false ∧ entry.productToCoefficientProved = false ∧ entry.lcuCorrectProved = false ∧ entry.blockProjectionProved = false ∧ entry.blockCorrectProved = false ∧ entry.finalExtractionProved = false ∧ entry.exactRemainingObstruction = "instantiate this projection-entry contract with an actual H_W^(kappa) dagger matrix theorem or equivalent block-projection theorem before discharging the bra-amplitude and factor-semantics obligations"
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerProjectionEntryContract_n3_transcript : have entry := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerProjectionEntryContract_n3; have sourceMap := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBraProjectionAmplitudeSourceMap_n3; have factorMap := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryFactorSemanticsContractMap_n3; entry.braSourceMap = sourceMap ∧ entry.factorContractMap = factorMap ∧ entry.focusedSparseSlot = 2 ∧ entry.cleanBasisIndex = 32 ∧ entry.sparseRegisterBra = 0 ∧ entry.sparseRegisterKet = 2 ∧ entry.entryFormula = "<0|H_W^(kappa)^dagger|2> = 1/sqrt(kappa)" ∧ entry.embeddedEntryFormula = "the focused entry is embedded at clean basis index 32 and represented by Coeff.symbol \"sqrt_kappa_inv\"" ∧ entry.expectedEntry = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv" ∧ entry.sourceContractObligation.description = "instantiate the focused H_W^(kappa) dagger projection-entry contract <0|H_W^(kappa)^dagger|2> = 1/sqrt(kappa)" ∧ entry.sourceContractObligation.proved = false ∧ entry.sourceMapBraAmplitudeObligation = sourceMap.amplitudeContractObligation ∧ entry.factorMapBraAmplitudeObligation = factorMap.braAmplitudeObligation ∧ entry.factorMapBraAmplitudeObligation = entry.sourceMapBraAmplitudeObligation ∧ entry.routeMatchingProjectionObligation = sourceMap.routeMatchingProjectionObligation ∧ entry.factorSemanticsObligation = factorMap.factorSemanticsObligation ∧ entry.finiteCompositionNormalizedEquality = factorMap.finiteCompositionNormalizedEquality ∧ entry.productObligation = factorMap.productObligation ∧ entry.contractAcceptedAsTypedInterface = true ∧ entry.sourceMapWired = true ∧ entry.factorMapWired = true ∧ entry.daggerEntryProved = false ∧ entry.sourceMapBraAmplitudeObligation.proved = false ∧ entry.factorMapBraAmplitudeObligation.proved = false ∧ entry.routeMatchingProjectionObligation.proved = false ∧ entry.factorSemanticsObligation.proved = false ∧ entry.finiteCompositionNormalizedEquality.proved = false ∧ entry.productObligation.proved = false ∧ entry.braAmplitudeProved = false ∧ entry.routeMatchingProjectionProved = false ∧ entry.factorSemanticsProved = false ∧ entry.normalizedBlockEqualityProved = false ∧ entry.productToCoefficientProved = false ∧ entry.lcuCorrectProved = false ∧ entry.blockProjectionProved = false ∧ entry.blockCorrectProved = false ∧ entry.finalExtractionProved = false ∧ entry.exactRemainingObstruction = "instantiate this projection-entry contract with an actual H_W^(kappa) dagger matrix theorem or equivalent block-projection theorem before discharging the bra-amplitude and factor-semantics obligations"
Transcript theorem for the focused `H_W^(kappa)` dagger entry contract. This checks that the new contract is wired to both the bra-source map and the factor-semantics contract map. The entry is still a contract-only interface: the actual dagger entry, bra amplitude, factor semantics, finite normalized equality, product-to-coefficient theorem, and final extraction remain false.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary hw kappa dagger embedded entry interface”. A proposition-valued field is a requirement until a constructor supplies it. Embedded-entry interface for the focused 'H_W^(kappa)^dagger' contract.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Embedded-entry interface for the focused 'H_W^(kappa)^dagger' contract. The preceding contract names the required local sparse-register entry '<0|H_W^(kappa)^dagger|2>'. This packet refines that contract to the exact finite layout used by the boundary gamma3 route for 'n = 3': the sparse register has width 'ceil(log2 kappa) = 3', local column '2' is in the 'kappa = 7' source domain and the eight-dimensional register, and the ambient clean branch is basis index '32'. It still does not define the 'H_W^(kappa)' matrix or prove the entry.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:12159. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.239●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryHWKappaDaggerEmbeddedEntryInterface : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryHWKappaDaggerEmbeddedEntryInterface : Type
Embedded-entry interface for the focused `H_W^(kappa)^dagger` contract. The preceding contract names the required local sparse-register entry `<0|H_W^(kappa)^dagger|2>`. This packet refines that contract to the exact finite layout used by the boundary gamma3 route for `n = 3`: the sparse register has width `ceil(log2 kappa) = 3`, local column `2` is in the `kappa = 7` source domain and the eight-dimensional register, and the ambient clean branch is basis index `32`. It still does not define the `H_W^(kappa)` matrix or prove the entry.
Fields
sourceAnchor : String
entryContract : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryHWKappaDaggerProjectionEntryContract
focusedSparseSlot : ℕ
focusedKappa : ℕ
sparseRegisterQubits : ℕ
sparseRegisterDimension : ℕ
localBraIndex : ℕ
localKetIndex : ℕ
ambientCleanBasisIndex : ℕ
localEntryFormula : String
ambientEmbeddingFormula : String
expectedLocalEntry : QuantumBlockEncoding.Coeff
expectedEmbeddedEntry : QuantumBlockEncoding.Coeff
sourceContractObligation : QuantumBlockEncoding.SemanticObligation
sourceMapBraAmplitudeObligation : QuantumBlockEncoding.SemanticObligation
factorMapBraAmplitudeObligation : QuantumBlockEncoding.SemanticObligation
routeMatchingProjectionObligation : QuantumBlockEncoding.SemanticObligation
factorSemanticsObligation : QuantumBlockEncoding.SemanticObligation
finiteCompositionNormalizedEquality : QuantumBlockEncoding.SemanticObligation
productObligation : QuantumBlockEncoding.SemanticObligation
localKetWithinKappa : Bool
localKetWithinSparseDimension : Bool
ambientIndexCompiled : Bool
refinesProjectionEntryContract : Bool
concreteHWKappaMatrixAvailable : Bool
localEntryProved : Bool
embeddedEntryProved : Bool
braAmplitudeProved : Bool
routeMatchingProjectionProved : Bool
factorSemanticsProved : Bool
normalizedBlockEqualityProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
exactRemainingObstruction : String
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary hw kappa dagger embedded entry interface n 3”. Compiled embedded-entry interface for the focused boundary branch.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Compiled embedded-entry interface for the focused boundary branch. This is the strict local interface that a future concrete 'H_W^(kappa)^dagger' matrix theorem should instantiate. It is narrower than the source map because the local sparse-register entry, the 'kappa = 7' domain check, the '2^3 = 8' ambient sparse-register dimension, and the clean gamma3 basis index are all fixed and build-tested.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:12208. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.240●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerEmbeddedEntryInterface_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryHWKappaDaggerEmbeddedEntryInterface
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerEmbeddedEntryInterface_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryHWKappaDaggerEmbeddedEntryInterface
Compiled embedded-entry interface for the focused boundary branch. This is the strict local interface that a future concrete `H_W^(kappa)^dagger` matrix theorem should instantiate. It is narrower than the source map because the local sparse-register entry, the `kappa = 7` domain check, the `2^3 = 8` ambient sparse-register dimension, and the clean gamma3 basis index are all fixed and build-tested.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary hw kappa dagger embedded entry interface n 3 transcript”; its local proof does not by itself complete the broader paper route. Transcript theorem for the embedded-entry interface.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Transcript theorem for the embedded-entry interface. This theorem proves only finite layout wiring for the focused interface. It does not prove the 'H_W^(kappa)^dagger' matrix entry, the bra amplitude, the factor-semantics obligation, finite normalized equality, or the focused product-to-coefficient theorem.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:12269. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.241●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerEmbeddedEntryInterface_n3_transcript : have interface := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerEmbeddedEntryInterface_n3; have entry := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerProjectionEntryContract_n3; have p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3; interface.entryContract = entry ∧ interface.focusedSparseSlot = 2 ∧ interface.focusedKappa = 7 ∧ interface.sparseRegisterQubits = 3 ∧ interface.sparseRegisterDimension = 8 ∧ interface.localBraIndex = 0 ∧ interface.localKetIndex = 2 ∧ interface.ambientCleanBasisIndex = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3PaperBasisIndex p 2 0 ∧ interface.ambientCleanBasisIndex = 32 ∧ interface.localEntryFormula = "<0|H_W^(kappa)^dagger|2> = 1/sqrt(kappa)" ∧ interface.ambientEmbeddingFormula = "slot 2 with system column 0 is embedded as oneTermRobinGamma3PaperBasisIndex p 2 0 = 32" ∧ interface.expectedLocalEntry = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv" ∧ interface.expectedEmbeddedEntry = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv" ∧ interface.sourceContractObligation = entry.sourceContractObligation ∧ interface.sourceMapBraAmplitudeObligation = entry.sourceMapBraAmplitudeObligation ∧ interface.factorMapBraAmplitudeObligation = entry.factorMapBraAmplitudeObligation ∧ interface.factorMapBraAmplitudeObligation = interface.sourceMapBraAmplitudeObligation ∧ interface.routeMatchingProjectionObligation = entry.routeMatchingProjectionObligation ∧ interface.factorSemanticsObligation = entry.factorSemanticsObligation ∧ interface.finiteCompositionNormalizedEquality = entry.finiteCompositionNormalizedEquality ∧ interface.productObligation = entry.productObligation ∧ interface.localKetWithinKappa = true ∧ interface.localKetWithinSparseDimension = true ∧ interface.ambientIndexCompiled = true ∧ interface.refinesProjectionEntryContract = true ∧ interface.concreteHWKappaMatrixAvailable = false ∧ interface.localEntryProved = false ∧ interface.embeddedEntryProved = false ∧ interface.sourceContractObligation.proved = false ∧ interface.sourceMapBraAmplitudeObligation.proved = false ∧ interface.factorMapBraAmplitudeObligation.proved = false ∧ interface.routeMatchingProjectionObligation.proved = false ∧ interface.factorSemanticsObligation.proved = false ∧ interface.finiteCompositionNormalizedEquality.proved = false ∧ interface.productObligation.proved = false ∧ interface.braAmplitudeProved = false ∧ interface.routeMatchingProjectionProved = false ∧ interface.factorSemanticsProved = false ∧ interface.normalizedBlockEqualityProved = false ∧ interface.productToCoefficientProved = false ∧ interface.lcuCorrectProved = false ∧ interface.blockProjectionProved = false ∧ interface.blockCorrectProved = false ∧ interface.finalExtractionProved = false ∧ interface.exactRemainingObstruction = "instantiate the local sparse-register matrix entry row 0 column 2 of H_W^(kappa)^dagger, embedded at clean gamma3 basis index 32, before discharging the bra-amplitude and factor-semantics obligations"
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerEmbeddedEntryInterface_n3_transcript : have interface := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerEmbeddedEntryInterface_n3; have entry := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerProjectionEntryContract_n3; have p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3; interface.entryContract = entry ∧ interface.focusedSparseSlot = 2 ∧ interface.focusedKappa = 7 ∧ interface.sparseRegisterQubits = 3 ∧ interface.sparseRegisterDimension = 8 ∧ interface.localBraIndex = 0 ∧ interface.localKetIndex = 2 ∧ interface.ambientCleanBasisIndex = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3PaperBasisIndex p 2 0 ∧ interface.ambientCleanBasisIndex = 32 ∧ interface.localEntryFormula = "<0|H_W^(kappa)^dagger|2> = 1/sqrt(kappa)" ∧ interface.ambientEmbeddingFormula = "slot 2 with system column 0 is embedded as oneTermRobinGamma3PaperBasisIndex p 2 0 = 32" ∧ interface.expectedLocalEntry = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv" ∧ interface.expectedEmbeddedEntry = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv" ∧ interface.sourceContractObligation = entry.sourceContractObligation ∧ interface.sourceMapBraAmplitudeObligation = entry.sourceMapBraAmplitudeObligation ∧ interface.factorMapBraAmplitudeObligation = entry.factorMapBraAmplitudeObligation ∧ interface.factorMapBraAmplitudeObligation = interface.sourceMapBraAmplitudeObligation ∧ interface.routeMatchingProjectionObligation = entry.routeMatchingProjectionObligation ∧ interface.factorSemanticsObligation = entry.factorSemanticsObligation ∧ interface.finiteCompositionNormalizedEquality = entry.finiteCompositionNormalizedEquality ∧ interface.productObligation = entry.productObligation ∧ interface.localKetWithinKappa = true ∧ interface.localKetWithinSparseDimension = true ∧ interface.ambientIndexCompiled = true ∧ interface.refinesProjectionEntryContract = true ∧ interface.concreteHWKappaMatrixAvailable = false ∧ interface.localEntryProved = false ∧ interface.embeddedEntryProved = false ∧ interface.sourceContractObligation.proved = false ∧ interface.sourceMapBraAmplitudeObligation.proved = false ∧ interface.factorMapBraAmplitudeObligation.proved = false ∧ interface.routeMatchingProjectionObligation.proved = false ∧ interface.factorSemanticsObligation.proved = false ∧ interface.finiteCompositionNormalizedEquality.proved = false ∧ interface.productObligation.proved = false ∧ interface.braAmplitudeProved = false ∧ interface.routeMatchingProjectionProved = false ∧ interface.factorSemanticsProved = false ∧ interface.normalizedBlockEqualityProved = false ∧ interface.productToCoefficientProved = false ∧ interface.lcuCorrectProved = false ∧ interface.blockProjectionProved = false ∧ interface.blockCorrectProved = false ∧ interface.finalExtractionProved = false ∧ interface.exactRemainingObstruction = "instantiate the local sparse-register matrix entry row 0 column 2 of H_W^(kappa)^dagger, embedded at clean gamma3 basis index 32, before discharging the bra-amplitude and factor-semantics obligations"
Transcript theorem for the embedded-entry interface. This theorem proves only finite layout wiring for the focused interface. It does not prove the `H_W^(kappa)^dagger` matrix entry, the bra amplitude, the factor-semantics obligation, finite normalized equality, or the focused product-to-coefficient theorem.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary hw kappa dagger entry from uniform column n 3”; its local proof does not by itself complete the broader paper route. Conditional adjoint-entry lemma for the focused 'H_W^(kappa)' slot.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Conditional adjoint-entry lemma for the focused 'H_W^(kappa)' slot. If a sparse-register preparation matrix has clean-column entry 'H_W^(kappa)[2,0] = sqrt_kappa_inv', and the local adjoint-entry convention identifies the dagger entry with that clean-column entry, then the focused row-'0', column-'2' dagger entry has the expected value. This is only the local matrix-entry algebra; it does not provide the cited uniform-column contract or a concrete 'H_W^(kappa)' matrix.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:12345. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.242●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerEntryFromUniformColumn_n3 (H Hdagger : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) (hUniform : H ⟨2, ⋯⟩ ⟨0, ⋯⟩ = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv") (hAdjoint : Hdagger ⟨0, ⋯⟩ ⟨2, ⋯⟩ = H ⟨2, ⋯⟩ ⟨0, ⋯⟩) : Hdagger ⟨0, ⋯⟩ ⟨2, ⋯⟩ = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv"
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerEntryFromUniformColumn_n3 (H Hdagger : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) (hUniform : H ⟨2, ⋯⟩ ⟨0, ⋯⟩ = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv") (hAdjoint : Hdagger ⟨0, ⋯⟩ ⟨2, ⋯⟩ = H ⟨2, ⋯⟩ ⟨0, ⋯⟩) : Hdagger ⟨0, ⋯⟩ ⟨2, ⋯⟩ = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv"
Conditional adjoint-entry lemma for the focused `H_W^(kappa)` slot. If a sparse-register preparation matrix has clean-column entry `H_W^(kappa)[2,0] = sqrt_kappa_inv`, and the local adjoint-entry convention identifies the dagger entry with that clean-column entry, then the focused row-`0`, column-`2` dagger entry has the expected value. This is only the local matrix-entry algebra; it does not provide the cited uniform-column contract or a concrete `H_W^(kappa)` matrix.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary hw kappa dagger uniform column contract”. A proposition-valued field is a requirement until a constructor supplies it. Uniform-column and adjoint-entry contract split for the focused dagger entry.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Uniform-column and adjoint-entry contract split for the focused dagger entry. The embedded interface fixes the local row and column. This record splits the remaining semantic source into the cited clean-column amplitude 'H_W^(kappa)[2,0] = 1/sqrt(kappa)' and the QBE adjoint-entry convention that turns that column entry into the bra-side dagger entry. Both source inputs remain obligations; the only compiled theorem is the conditional entry lemma above.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:12367. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.243●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryHWKappaDaggerUniformColumnContract : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryHWKappaDaggerUniformColumnContract : Type
Uniform-column and adjoint-entry contract split for the focused dagger entry. The embedded interface fixes the local row and column. This record splits the remaining semantic source into the cited clean-column amplitude `H_W^(kappa)[2,0] = 1/sqrt(kappa)` and the QBE adjoint-entry convention that turns that column entry into the bra-side dagger entry. Both source inputs remain obligations; the only compiled theorem is the conditional entry lemma above.
Fields
sourceAnchor : String
embeddedInterface : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryHWKappaDaggerEmbeddedEntryInterface
focusedSparseSlot : ℕ
focusedKappa : ℕ
sparseRegisterDimension : ℕ
uniformColumnRowIndex : ℕ
uniformColumnColIndex : ℕ
daggerRowIndex : ℕ
daggerColIndex : ℕ
ambientCleanBasisIndex : ℕ
uniformColumnFormula : String
adjointEntryFormula : String
conditionalEntryLemma : String
expectedUniformColumnEntry : QuantumBlockEncoding.Coeff
expectedDaggerEntry : QuantumBlockEncoding.Coeff
uniformColumnObligation : QuantumBlockEncoding.SemanticObligation
adjointEntryConventionObligation : QuantumBlockEncoding.SemanticObligation
sourceContractObligation : QuantumBlockEncoding.SemanticObligation
sourceMapBraAmplitudeObligation : QuantumBlockEncoding.SemanticObligation
factorMapBraAmplitudeObligation : QuantumBlockEncoding.SemanticObligation
routeMatchingProjectionObligation : QuantumBlockEncoding.SemanticObligation
factorSemanticsObligation : QuantumBlockEncoding.SemanticObligation
finiteCompositionNormalizedEquality : QuantumBlockEncoding.SemanticObligation
productObligation : QuantumBlockEncoding.SemanticObligation
uniformColumnContractMapped : Bool
adjointEntryConventionMapped : Bool
conditionalEntryLemmaCompiled : Bool
concreteHWKappaMatrixAvailable : Bool
uniformColumnProved : Bool
adjointEntryConventionProved : Bool
daggerEntryProved : Bool
embeddedEntryProved : Bool
braAmplitudeProved : Bool
routeMatchingProjectionProved : Bool
factorSemanticsProved : Bool
normalizedBlockEqualityProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
exactRemainingObstruction : String
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary hw kappa dagger uniform column contract n 3”. Compiled contract split for row '0', column '2' of 'H_W^(kappa)^dagger'.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Compiled contract split for row '0', column '2' of 'H_W^(kappa)^dagger'. This refines the embedded-entry interface without proving the uniform preparation result or the adjoint-entry convention. The compiled conditional lemma records exactly what a future concrete sparse-register matrix theorem must instantiate.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:12421. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.244●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerUniformColumnContract_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryHWKappaDaggerUniformColumnContract
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerUniformColumnContract_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryHWKappaDaggerUniformColumnContract
Compiled contract split for row `0`, column `2` of `H_W^(kappa)^dagger`. This refines the embedded-entry interface without proving the uniform preparation result or the adjoint-entry convention. The compiled conditional lemma records exactly what a future concrete sparse-register matrix theorem must instantiate.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary hw kappa dagger uniform column contract n 3 transcript”; its local proof does not by itself complete the broader paper route. Transcript theorem for the uniform-column contract split.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Transcript theorem for the uniform-column contract split. The theorem checks that the split is tied to the embedded-entry interface, that the compiled conditional entry lemma has the expected shape, and that all semantic proof flags remain false.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:12502. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.245●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerUniformColumnContract_n3_transcript : have contract := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerUniformColumnContract_n3; have interface := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerEmbeddedEntryInterface_n3; contract.embeddedInterface = interface ∧ contract.focusedSparseSlot = 2 ∧ contract.focusedKappa = 7 ∧ contract.sparseRegisterDimension = 8 ∧ contract.uniformColumnRowIndex = 2 ∧ contract.uniformColumnColIndex = 0 ∧ contract.daggerRowIndex = 0 ∧ contract.daggerColIndex = 2 ∧ contract.ambientCleanBasisIndex = 32 ∧ contract.uniformColumnFormula = "H_W^(kappa)[2,0] = 1/sqrt(kappa)" ∧ contract.adjointEntryFormula = "H_W^(kappa)^dagger[0,2] = H_W^(kappa)[2,0]" ∧ contract.conditionalEntryLemma = "oneTermRobinGamma3BoundaryHWKappaDaggerEntryFromUniformColumn_n3" ∧ contract.expectedUniformColumnEntry = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv" ∧ contract.expectedDaggerEntry = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv" ∧ contract.uniformColumnObligation.description = "instantiate the clean-column uniform sparse-register entry H_W^(kappa)[2,0] = 1/sqrt(kappa) for kappa = 7" ∧ contract.uniformColumnObligation.proved = false ∧ contract.adjointEntryConventionObligation.description = "provide the QBE adjoint-entry convention identifying H_W^(kappa)^dagger[0,2] with H_W^(kappa)[2,0]" ∧ contract.adjointEntryConventionObligation.proved = false ∧ contract.sourceContractObligation = interface.sourceContractObligation ∧ contract.sourceMapBraAmplitudeObligation = interface.sourceMapBraAmplitudeObligation ∧ contract.factorMapBraAmplitudeObligation = interface.factorMapBraAmplitudeObligation ∧ contract.routeMatchingProjectionObligation = interface.routeMatchingProjectionObligation ∧ contract.factorSemanticsObligation = interface.factorSemanticsObligation ∧ contract.finiteCompositionNormalizedEquality = interface.finiteCompositionNormalizedEquality ∧ contract.productObligation = interface.productObligation ∧ contract.uniformColumnContractMapped = true ∧ contract.adjointEntryConventionMapped = true ∧ contract.conditionalEntryLemmaCompiled = true ∧ contract.concreteHWKappaMatrixAvailable = false ∧ contract.uniformColumnProved = false ∧ contract.adjointEntryConventionProved = false ∧ contract.daggerEntryProved = false ∧ contract.embeddedEntryProved = false ∧ contract.sourceContractObligation.proved = false ∧ contract.sourceMapBraAmplitudeObligation.proved = false ∧ contract.factorMapBraAmplitudeObligation.proved = false ∧ contract.routeMatchingProjectionObligation.proved = false ∧ contract.factorSemanticsObligation.proved = false ∧ contract.finiteCompositionNormalizedEquality.proved = false ∧ contract.productObligation.proved = false ∧ contract.braAmplitudeProved = false ∧ contract.routeMatchingProjectionProved = false ∧ contract.factorSemanticsProved = false ∧ contract.normalizedBlockEqualityProved = false ∧ contract.productToCoefficientProved = false ∧ contract.lcuCorrectProved = false ∧ contract.blockProjectionProved = false ∧ contract.blockCorrectProved = false ∧ contract.finalExtractionProved = false ∧ contract.exactRemainingObstruction = "instantiate an actual H_W^(kappa) matrix or equivalent projection-entry theorem supplying the uniform-column entry and adjoint-entry convention; then apply oneTermRobinGamma3BoundaryHWKappaDaggerEntryFromUniformColumn_n3"
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerUniformColumnContract_n3_transcript : have contract := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerUniformColumnContract_n3; have interface := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerEmbeddedEntryInterface_n3; contract.embeddedInterface = interface ∧ contract.focusedSparseSlot = 2 ∧ contract.focusedKappa = 7 ∧ contract.sparseRegisterDimension = 8 ∧ contract.uniformColumnRowIndex = 2 ∧ contract.uniformColumnColIndex = 0 ∧ contract.daggerRowIndex = 0 ∧ contract.daggerColIndex = 2 ∧ contract.ambientCleanBasisIndex = 32 ∧ contract.uniformColumnFormula = "H_W^(kappa)[2,0] = 1/sqrt(kappa)" ∧ contract.adjointEntryFormula = "H_W^(kappa)^dagger[0,2] = H_W^(kappa)[2,0]" ∧ contract.conditionalEntryLemma = "oneTermRobinGamma3BoundaryHWKappaDaggerEntryFromUniformColumn_n3" ∧ contract.expectedUniformColumnEntry = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv" ∧ contract.expectedDaggerEntry = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv" ∧ contract.uniformColumnObligation.description = "instantiate the clean-column uniform sparse-register entry H_W^(kappa)[2,0] = 1/sqrt(kappa) for kappa = 7" ∧ contract.uniformColumnObligation.proved = false ∧ contract.adjointEntryConventionObligation.description = "provide the QBE adjoint-entry convention identifying H_W^(kappa)^dagger[0,2] with H_W^(kappa)[2,0]" ∧ contract.adjointEntryConventionObligation.proved = false ∧ contract.sourceContractObligation = interface.sourceContractObligation ∧ contract.sourceMapBraAmplitudeObligation = interface.sourceMapBraAmplitudeObligation ∧ contract.factorMapBraAmplitudeObligation = interface.factorMapBraAmplitudeObligation ∧ contract.routeMatchingProjectionObligation = interface.routeMatchingProjectionObligation ∧ contract.factorSemanticsObligation = interface.factorSemanticsObligation ∧ contract.finiteCompositionNormalizedEquality = interface.finiteCompositionNormalizedEquality ∧ contract.productObligation = interface.productObligation ∧ contract.uniformColumnContractMapped = true ∧ contract.adjointEntryConventionMapped = true ∧ contract.conditionalEntryLemmaCompiled = true ∧ contract.concreteHWKappaMatrixAvailable = false ∧ contract.uniformColumnProved = false ∧ contract.adjointEntryConventionProved = false ∧ contract.daggerEntryProved = false ∧ contract.embeddedEntryProved = false ∧ contract.sourceContractObligation.proved = false ∧ contract.sourceMapBraAmplitudeObligation.proved = false ∧ contract.factorMapBraAmplitudeObligation.proved = false ∧ contract.routeMatchingProjectionObligation.proved = false ∧ contract.factorSemanticsObligation.proved = false ∧ contract.finiteCompositionNormalizedEquality.proved = false ∧ contract.productObligation.proved = false ∧ contract.braAmplitudeProved = false ∧ contract.routeMatchingProjectionProved = false ∧ contract.factorSemanticsProved = false ∧ contract.normalizedBlockEqualityProved = false ∧ contract.productToCoefficientProved = false ∧ contract.lcuCorrectProved = false ∧ contract.blockProjectionProved = false ∧ contract.blockCorrectProved = false ∧ contract.finalExtractionProved = false ∧ contract.exactRemainingObstruction = "instantiate an actual H_W^(kappa) matrix or equivalent projection-entry theorem supplying the uniform-column entry and adjoint-entry convention; then apply oneTermRobinGamma3BoundaryHWKappaDaggerEntryFromUniformColumn_n3"
Transcript theorem for the uniform-column contract split. The theorem checks that the split is tied to the embedded-entry interface, that the compiled conditional entry lemma has the expected shape, and that all semantic proof flags remain false.
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary hw kappa dagger transpose matrix n 3”. Local transpose-style dagger for the focused symbolic 'H_W^(kappa)' matrix.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Local transpose-style dagger for the focused symbolic 'H_W^(kappa)' matrix. The current 'Coeff' backend is a symbolic real-coefficient matrix layer with no conjugation operation. For this Phase-1 packet the only needed adjoint fact is therefore the focused transpose entry used by the row-'0', column-'2' boundary route.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:12589. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.246●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerTransposeMatrix_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerTransposeMatrix_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff
Local transpose-style dagger for the focused symbolic `H_W^(kappa)` matrix. The current `Coeff` backend is a symbolic real-coefficient matrix layer with no conjugation operation. For this Phase-1 packet the only needed adjoint fact is therefore the focused transpose entry used by the row-`0`, column-`2` boundary route.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary hw kappa dagger transpose entry convention n 3”; its local proof does not by itself complete the broader paper route. Focused adjoint-entry convention for the boundary 'H_W^(kappa)' packet.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Focused adjoint-entry convention for the boundary 'H_W^(kappa)' packet. This proves only the matrix-interface convention 'H_W^(kappa)^dagger[0,2] = H_W^(kappa)[2,0]' for the local transpose-style dagger. It does not provide the cited clean-column amplitude.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:12600. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.247●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerTransposeEntryConvention_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) : QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerTransposeMatrix_n3 H ⟨0, ⋯⟩ ⟨2, ⋯⟩ = H ⟨2, ⋯⟩ ⟨0, ⋯⟩
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerTransposeEntryConvention_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) : QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerTransposeMatrix_n3 H ⟨0, ⋯⟩ ⟨2, ⋯⟩ = H ⟨2, ⋯⟩ ⟨0, ⋯⟩
Focused adjoint-entry convention for the boundary `H_W^(kappa)` packet. This proves only the matrix-interface convention `H_W^(kappa)^dagger[0,2] = H_W^(kappa)[2,0]` for the local transpose-style dagger. It does not provide the cited clean-column amplitude.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary hw kappa dagger entry from transpose uniform column n 3”; its local proof does not by itself complete the broader paper route. Focused dagger-entry theorem under the external uniform-column contract.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Focused dagger-entry theorem under the external uniform-column contract. The adjoint-entry convention is now supplied by the local transpose-style matrix interface; the theorem remains conditional on the clean-column amplitude from the cited 'H_W^(kappa)' state-preparation contract.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:12614. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.248●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerEntryFromTransposeUniformColumn_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) (hUniform : H ⟨2, ⋯⟩ ⟨0, ⋯⟩ = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv") : QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerTransposeMatrix_n3 H ⟨0, ⋯⟩ ⟨2, ⋯⟩ = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv"
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerEntryFromTransposeUniformColumn_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) (hUniform : H ⟨2, ⋯⟩ ⟨0, ⋯⟩ = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv") : QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerTransposeMatrix_n3 H ⟨0, ⋯⟩ ⟨2, ⋯⟩ = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv"
Focused dagger-entry theorem under the external uniform-column contract. The adjoint-entry convention is now supplied by the local transpose-style matrix interface; the theorem remains conditional on the clean-column amplitude from the cited `H_W^(kappa)` state-preparation contract.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary hw kappa dagger adjoint entry convention”. A proposition-valued field is a requirement until a constructor supplies it. Adjoint-entry convention packet for the focused 'H_W^(kappa)' dagger entry.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Adjoint-entry convention packet for the focused 'H_W^(kappa)' dagger entry. This refines 'oneTermRobinGamma3BoundaryHWKappaDaggerUniformColumnContract_n3' by supplying the QBE local transpose-style adjoint convention for row '0', column '2'. The Shukla--Vedula clean-column amplitude remains contract-only, so the full dagger entry and all downstream product/block obligations remain false.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:12636. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.249●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryHWKappaDaggerAdjointEntryConvention : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryHWKappaDaggerAdjointEntryConvention : Type
Adjoint-entry convention packet for the focused `H_W^(kappa)` dagger entry. This refines `oneTermRobinGamma3BoundaryHWKappaDaggerUniformColumnContract_n3` by supplying the QBE local transpose-style adjoint convention for row `0`, column `2`. The Shukla--Vedula clean-column amplitude remains contract-only, so the full dagger entry and all downstream product/block obligations remain false.
Fields
sourceAnchor : String
uniformColumnContract : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryHWKappaDaggerUniformColumnContract
focusedSparseSlot : ℕ
focusedKappa : ℕ
sparseRegisterDimension : ℕ
uniformColumnRowIndex : ℕ
uniformColumnColIndex : ℕ
daggerRowIndex : ℕ
daggerColIndex : ℕ
transposeMatrixDefinition : String
transposeEntryConventionLemma : String
conditionalDaggerEntryLemma : String
expectedUniformColumnEntry : QuantumBlockEncoding.Coeff
expectedDaggerEntry : QuantumBlockEncoding.Coeff
uniformColumnObligation : QuantumBlockEncoding.SemanticObligation
adjointEntryConventionObligation : QuantumBlockEncoding.SemanticObligation
sourceContractObligation : QuantumBlockEncoding.SemanticObligation
sourceMapBraAmplitudeObligation : QuantumBlockEncoding.SemanticObligation
factorMapBraAmplitudeObligation : QuantumBlockEncoding.SemanticObligation
routeMatchingProjectionObligation : QuantumBlockEncoding.SemanticObligation
factorSemanticsObligation : QuantumBlockEncoding.SemanticObligation
finiteCompositionNormalizedEquality : QuantumBlockEncoding.SemanticObligation
productObligation : QuantumBlockEncoding.SemanticObligation
transposeMatrixAvailable : Bool
transposeEntryConventionCompiled : Bool
conditionalDaggerEntryFromTransposeCompiled : Bool
uniformColumnContractMapped : Bool
adjointEntryConventionProved : Bool
uniformColumnProved : Bool
daggerEntryProved : Bool
embeddedEntryProved : Bool
braAmplitudeProved : Bool
routeMatchingProjectionProved : Bool
factorSemanticsProved : Bool
normalizedBlockEqualityProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
exactRemainingObstruction : String
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary hw kappa dagger adjoint entry convention n 3”. Compiled local adjoint-entry convention for the focused boundary branch.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Compiled local adjoint-entry convention for the focused boundary branch. Only the local transpose convention is proved here. The uniform clean-column entry remains an external cited contract, so this packet cannot discharge the bra-amplitude or focused product-to-coefficient obligations by itself.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:12688. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.250●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerAdjointEntryConvention_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryHWKappaDaggerAdjointEntryConvention
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerAdjointEntryConvention_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryHWKappaDaggerAdjointEntryConvention
Compiled local adjoint-entry convention for the focused boundary branch. Only the local transpose convention is proved here. The uniform clean-column entry remains an external cited contract, so this packet cannot discharge the bra-amplitude or focused product-to-coefficient obligations by itself.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary hw kappa dagger adjoint entry convention n 3 transcript”; its local proof does not by itself complete the broader paper route. Transcript theorem for the local adjoint-entry convention packet.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Transcript theorem for the local adjoint-entry convention packet. The QBE transpose-style convention is now compiled and marked proved in this local packet. The external uniform-column source, full dagger entry, bra-amplitude route, factor semantics, finite normalized equality, focused product theorem, and all block-correctness flags remain false.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:12762. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.251●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerAdjointEntryConvention_n3_transcript : have convention := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerAdjointEntryConvention_n3; have contract := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerUniformColumnContract_n3; convention.uniformColumnContract = contract ∧ convention.focusedSparseSlot = 2 ∧ convention.focusedKappa = 7 ∧ convention.sparseRegisterDimension = 8 ∧ convention.uniformColumnRowIndex = 2 ∧ convention.uniformColumnColIndex = 0 ∧ convention.daggerRowIndex = 0 ∧ convention.daggerColIndex = 2 ∧ convention.transposeMatrixDefinition = "oneTermRobinGamma3BoundaryHWKappaDaggerTransposeMatrix_n3 H row col = H col row" ∧ convention.transposeEntryConventionLemma = "oneTermRobinGamma3BoundaryHWKappaDaggerTransposeEntryConvention_n3" ∧ convention.conditionalDaggerEntryLemma = "oneTermRobinGamma3BoundaryHWKappaDaggerEntryFromTransposeUniformColumn_n3" ∧ convention.expectedUniformColumnEntry = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv" ∧ convention.expectedDaggerEntry = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv" ∧ convention.uniformColumnObligation = contract.uniformColumnObligation ∧ convention.uniformColumnObligation.proved = false ∧ convention.adjointEntryConventionObligation.description = "QBE transpose-style symbolic dagger convention gives H_W^(kappa)^dagger[0,2] = H_W^(kappa)[2,0]" ∧ convention.adjointEntryConventionObligation.source = "oneTermRobinGamma3BoundaryHWKappaDaggerTransposeEntryConvention_n3" ∧ convention.adjointEntryConventionObligation.proved = true ∧ convention.sourceContractObligation = contract.sourceContractObligation ∧ convention.sourceMapBraAmplitudeObligation = contract.sourceMapBraAmplitudeObligation ∧ convention.factorMapBraAmplitudeObligation = contract.factorMapBraAmplitudeObligation ∧ convention.routeMatchingProjectionObligation = contract.routeMatchingProjectionObligation ∧ convention.factorSemanticsObligation = contract.factorSemanticsObligation ∧ convention.finiteCompositionNormalizedEquality = contract.finiteCompositionNormalizedEquality ∧ convention.productObligation = contract.productObligation ∧ convention.transposeMatrixAvailable = true ∧ convention.transposeEntryConventionCompiled = true ∧ convention.conditionalDaggerEntryFromTransposeCompiled = true ∧ convention.uniformColumnContractMapped = true ∧ convention.adjointEntryConventionProved = true ∧ convention.uniformColumnProved = false ∧ convention.daggerEntryProved = false ∧ convention.embeddedEntryProved = false ∧ convention.sourceContractObligation.proved = false ∧ convention.sourceMapBraAmplitudeObligation.proved = false ∧ convention.factorMapBraAmplitudeObligation.proved = false ∧ convention.routeMatchingProjectionObligation.proved = false ∧ convention.factorSemanticsObligation.proved = false ∧ convention.finiteCompositionNormalizedEquality.proved = false ∧ convention.productObligation.proved = false ∧ convention.braAmplitudeProved = false ∧ convention.routeMatchingProjectionProved = false ∧ convention.factorSemanticsProved = false ∧ convention.normalizedBlockEqualityProved = false ∧ convention.productToCoefficientProved = false ∧ convention.lcuCorrectProved = false ∧ convention.blockProjectionProved = false ∧ convention.blockCorrectProved = false ∧ convention.finalExtractionProved = false ∧ convention.exactRemainingObstruction = "instantiate the external uniform-column entry H_W^(kappa)[2,0] = sqrt_kappa_inv before using the compiled transpose convention to prove the focused dagger entry and bra-amplitude obligation"
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerAdjointEntryConvention_n3_transcript : have convention := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerAdjointEntryConvention_n3; have contract := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerUniformColumnContract_n3; convention.uniformColumnContract = contract ∧ convention.focusedSparseSlot = 2 ∧ convention.focusedKappa = 7 ∧ convention.sparseRegisterDimension = 8 ∧ convention.uniformColumnRowIndex = 2 ∧ convention.uniformColumnColIndex = 0 ∧ convention.daggerRowIndex = 0 ∧ convention.daggerColIndex = 2 ∧ convention.transposeMatrixDefinition = "oneTermRobinGamma3BoundaryHWKappaDaggerTransposeMatrix_n3 H row col = H col row" ∧ convention.transposeEntryConventionLemma = "oneTermRobinGamma3BoundaryHWKappaDaggerTransposeEntryConvention_n3" ∧ convention.conditionalDaggerEntryLemma = "oneTermRobinGamma3BoundaryHWKappaDaggerEntryFromTransposeUniformColumn_n3" ∧ convention.expectedUniformColumnEntry = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv" ∧ convention.expectedDaggerEntry = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv" ∧ convention.uniformColumnObligation = contract.uniformColumnObligation ∧ convention.uniformColumnObligation.proved = false ∧ convention.adjointEntryConventionObligation.description = "QBE transpose-style symbolic dagger convention gives H_W^(kappa)^dagger[0,2] = H_W^(kappa)[2,0]" ∧ convention.adjointEntryConventionObligation.source = "oneTermRobinGamma3BoundaryHWKappaDaggerTransposeEntryConvention_n3" ∧ convention.adjointEntryConventionObligation.proved = true ∧ convention.sourceContractObligation = contract.sourceContractObligation ∧ convention.sourceMapBraAmplitudeObligation = contract.sourceMapBraAmplitudeObligation ∧ convention.factorMapBraAmplitudeObligation = contract.factorMapBraAmplitudeObligation ∧ convention.routeMatchingProjectionObligation = contract.routeMatchingProjectionObligation ∧ convention.factorSemanticsObligation = contract.factorSemanticsObligation ∧ convention.finiteCompositionNormalizedEquality = contract.finiteCompositionNormalizedEquality ∧ convention.productObligation = contract.productObligation ∧ convention.transposeMatrixAvailable = true ∧ convention.transposeEntryConventionCompiled = true ∧ convention.conditionalDaggerEntryFromTransposeCompiled = true ∧ convention.uniformColumnContractMapped = true ∧ convention.adjointEntryConventionProved = true ∧ convention.uniformColumnProved = false ∧ convention.daggerEntryProved = false ∧ convention.embeddedEntryProved = false ∧ convention.sourceContractObligation.proved = false ∧ convention.sourceMapBraAmplitudeObligation.proved = false ∧ convention.factorMapBraAmplitudeObligation.proved = false ∧ convention.routeMatchingProjectionObligation.proved = false ∧ convention.factorSemanticsObligation.proved = false ∧ convention.finiteCompositionNormalizedEquality.proved = false ∧ convention.productObligation.proved = false ∧ convention.braAmplitudeProved = false ∧ convention.routeMatchingProjectionProved = false ∧ convention.factorSemanticsProved = false ∧ convention.normalizedBlockEqualityProved = false ∧ convention.productToCoefficientProved = false ∧ convention.lcuCorrectProved = false ∧ convention.blockProjectionProved = false ∧ convention.blockCorrectProved = false ∧ convention.finalExtractionProved = false ∧ convention.exactRemainingObstruction = "instantiate the external uniform-column entry H_W^(kappa)[2,0] = sqrt_kappa_inv before using the compiled transpose convention to prove the focused dagger entry and bra-amplitude obligation"
Transcript theorem for the local adjoint-entry convention packet. The QBE transpose-style convention is now compiled and marked proved in this local packet. The external uniform-column source, full dagger entry, bra-amplitude route, factor semantics, finite normalized equality, focused product theorem, and all block-correctness flags remain false.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary hw kappa clean column contract”. A proposition-valued field is a requirement until a constructor supplies it. External clean-column contract bridge for the focused 'H_W^(kappa)' entry.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. External clean-column contract bridge for the focused 'H_W^(kappa)' entry. This packet accepts the GHL2025 Eq. 'arbitrary sparcity' clean-column entry only as a typed external contract through the existing Shukla--Vedula cited row. It then records that the accepted entry is the exact hypothesis consumed by the compiled transpose-style dagger bridge. No cited theorem is formalized and no product, projection, LCU, block-correctness, or final-extraction flag is promoted.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:12853. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.252●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryHWKappaCleanColumnContract : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryHWKappaCleanColumnContract : Type
External clean-column contract bridge for the focused `H_W^(kappa)` entry. This packet accepts the GHL2025 Eq. `arbitrary sparcity` clean-column entry only as a typed external contract through the existing Shukla--Vedula cited row. It then records that the accepted entry is the exact hypothesis consumed by the compiled transpose-style dagger bridge. No cited theorem is formalized and no product, projection, LCU, block-correctness, or final-extraction flag is promoted.
Fields
sourceAnchor : String
adjointConvention : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryHWKappaDaggerAdjointEntryConvention
citedResultId : String
focusedSparseSlot : ℕ
focusedKappa : ℕ
sparseRegisterDimension : ℕ
uniformColumnRowIndex : ℕ
uniformColumnColIndex : ℕ
daggerRowIndex : ℕ
daggerColIndex : ℕ
uniformColumnFormula : String
citedUniformSuperpositionFormula : String
conditionalDaggerEntryLemma : String
expectedUniformColumnEntry : QuantumBlockEncoding.Coeff
expectedDaggerEntry : QuantumBlockEncoding.Coeff
uniformColumnObligation : QuantumBlockEncoding.SemanticObligation
adjointEntryConventionObligation : QuantumBlockEncoding.SemanticObligation
sourceContractObligation : QuantumBlockEncoding.SemanticObligation
sourceMapBraAmplitudeObligation : QuantumBlockEncoding.SemanticObligation
factorMapBraAmplitudeObligation : QuantumBlockEncoding.SemanticObligation
routeMatchingProjectionObligation : QuantumBlockEncoding.SemanticObligation
factorSemanticsObligation : QuantumBlockEncoding.SemanticObligation
finiteCompositionNormalizedEquality : QuantumBlockEncoding.SemanticObligation
productObligation : QuantumBlockEncoding.SemanticObligation
externalCleanColumnAcceptedAsContract : Bool
cleanColumnFeedsTransposeBridge : Bool
conditionalDaggerEntryBridgeCompiled : Bool
uniformColumnProved : Bool
adjointEntryConventionProved : Bool
daggerEntryProved : Bool
embeddedEntryProved : Bool
braAmplitudeProved : Bool
routeMatchingProjectionProved : Bool
factorSemanticsProved : Bool
normalizedBlockEqualityProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
exactRemainingObstruction : String
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary hw kappa clean column contract n 3”. Compiled clean-column contract bridge for the focused boundary branch.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Compiled clean-column contract bridge for the focused boundary branch. The bridge records the external contract 'H_W^(kappa)[2,0] = sqrt_kappa_inv' and ties it to the already-compiled transpose convention. The clean-column source remains 'contract-only'; the actual dagger entry and downstream bra-amplitude route remain unproved.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:12906. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.253●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaCleanColumnContract_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryHWKappaCleanColumnContract
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaCleanColumnContract_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryHWKappaCleanColumnContract
Compiled clean-column contract bridge for the focused boundary branch. The bridge records the external contract `H_W^(kappa)[2,0] = sqrt_kappa_inv` and ties it to the already-compiled transpose convention. The clean-column source remains `contract-only`; the actual dagger entry and downstream bra-amplitude route remain unproved.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary hw kappa clean column contract feeds transpose bridge n 3”; its local proof does not by itself complete the broader paper route. The clean-column contract is exactly the hypothesis consumed by the transpose dagger bridge.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The clean-column contract is exactly the hypothesis consumed by the transpose dagger bridge. This theorem is conditional on a matrix satisfying the external clean-column entry. It does not prove that any concrete 'H_W^(kappa)' matrix satisfies that entry.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:12976. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.254●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaCleanColumnContract_feedsTransposeBridge_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) (hUniform : H ⟨QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaCleanColumnContract_n3.uniformColumnRowIndex, ⋯⟩ ⟨QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaCleanColumnContract_n3.uniformColumnColIndex, ⋯⟩ = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaCleanColumnContract_n3.expectedUniformColumnEntry) : QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerTransposeMatrix_n3 H ⟨QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaCleanColumnContract_n3.daggerRowIndex, ⋯⟩ ⟨QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaCleanColumnContract_n3.daggerColIndex, ⋯⟩ = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaCleanColumnContract_n3.expectedDaggerEntry
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaCleanColumnContract_feedsTransposeBridge_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) (hUniform : H ⟨QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaCleanColumnContract_n3.uniformColumnRowIndex, ⋯⟩ ⟨QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaCleanColumnContract_n3.uniformColumnColIndex, ⋯⟩ = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaCleanColumnContract_n3.expectedUniformColumnEntry) : QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerTransposeMatrix_n3 H ⟨QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaCleanColumnContract_n3.daggerRowIndex, ⋯⟩ ⟨QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaCleanColumnContract_n3.daggerColIndex, ⋯⟩ = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaCleanColumnContract_n3.expectedDaggerEntry
The clean-column contract is exactly the hypothesis consumed by the transpose dagger bridge. This theorem is conditional on a matrix satisfying the external clean-column entry. It does not prove that any concrete `H_W^(kappa)` matrix satisfies that entry.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary hw kappa clean column contract n 3 transcript”; its local proof does not by itself complete the broader paper route. Transcript theorem for the clean-column contract bridge.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Transcript theorem for the clean-column contract bridge. The theorem checks that the bridge uses the Shukla--Vedula cited row as a contract-only source, feeds the accepted entry through the transpose lemma, and keeps the theorem-facing semantic flags false.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:13002. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.255●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaCleanColumnContract_n3_transcript : have bridge := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaCleanColumnContract_n3; have convention := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerAdjointEntryConvention_n3; bridge.adjointConvention = convention ∧ bridge.citedResultId = "ShuklaVedula2024.HWkappaUniformSuperposition" ∧ bridge.focusedSparseSlot = 2 ∧ bridge.focusedKappa = 7 ∧ bridge.sparseRegisterDimension = 8 ∧ bridge.uniformColumnRowIndex = 2 ∧ bridge.uniformColumnColIndex = 0 ∧ bridge.daggerRowIndex = 0 ∧ bridge.daggerColIndex = 2 ∧ bridge.uniformColumnFormula = "H_W^(kappa)[2,0] = 1/sqrt(kappa)" ∧ bridge.citedUniformSuperpositionFormula = "H_W^(kappa)|0> = kappa^{-1/2} sum_{s=0}^{kappa-1} |s>" ∧ bridge.conditionalDaggerEntryLemma = "oneTermRobinGamma3BoundaryHWKappaDaggerEntryFromTransposeUniformColumn_n3" ∧ bridge.expectedUniformColumnEntry = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv" ∧ bridge.expectedDaggerEntry = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv" ∧ bridge.uniformColumnObligation = convention.uniformColumnObligation ∧ bridge.uniformColumnObligation.proved = false ∧ bridge.adjointEntryConventionObligation = convention.adjointEntryConventionObligation ∧ bridge.adjointEntryConventionObligation.proved = true ∧ bridge.sourceContractObligation = convention.sourceContractObligation ∧ bridge.sourceMapBraAmplitudeObligation = convention.sourceMapBraAmplitudeObligation ∧ bridge.factorMapBraAmplitudeObligation = convention.factorMapBraAmplitudeObligation ∧ bridge.routeMatchingProjectionObligation = convention.routeMatchingProjectionObligation ∧ bridge.factorSemanticsObligation = convention.factorSemanticsObligation ∧ bridge.finiteCompositionNormalizedEquality = convention.finiteCompositionNormalizedEquality ∧ bridge.productObligation = convention.productObligation ∧ bridge.externalCleanColumnAcceptedAsContract = true ∧ bridge.cleanColumnFeedsTransposeBridge = true ∧ bridge.conditionalDaggerEntryBridgeCompiled = true ∧ bridge.uniformColumnProved = false ∧ bridge.adjointEntryConventionProved = true ∧ bridge.daggerEntryProved = false ∧ bridge.embeddedEntryProved = false ∧ bridge.sourceContractObligation.proved = false ∧ bridge.sourceMapBraAmplitudeObligation.proved = false ∧ bridge.factorMapBraAmplitudeObligation.proved = false ∧ bridge.routeMatchingProjectionObligation.proved = false ∧ bridge.factorSemanticsObligation.proved = false ∧ bridge.finiteCompositionNormalizedEquality.proved = false ∧ bridge.productObligation.proved = false ∧ bridge.braAmplitudeProved = false ∧ bridge.routeMatchingProjectionProved = false ∧ bridge.factorSemanticsProved = false ∧ bridge.normalizedBlockEqualityProved = false ∧ bridge.productToCoefficientProved = false ∧ bridge.lcuCorrectProved = false ∧ bridge.blockProjectionProved = false ∧ bridge.blockCorrectProved = false ∧ bridge.finalExtractionProved = false ∧ bridge.exactRemainingObstruction = "connect the external clean-column contract to the bra-amplitude and factor-semantics obligations, or formalize the cited H_W^(kappa) preparation theorem before marking the dagger entry proved"
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaCleanColumnContract_n3_transcript : have bridge := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaCleanColumnContract_n3; have convention := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerAdjointEntryConvention_n3; bridge.adjointConvention = convention ∧ bridge.citedResultId = "ShuklaVedula2024.HWkappaUniformSuperposition" ∧ bridge.focusedSparseSlot = 2 ∧ bridge.focusedKappa = 7 ∧ bridge.sparseRegisterDimension = 8 ∧ bridge.uniformColumnRowIndex = 2 ∧ bridge.uniformColumnColIndex = 0 ∧ bridge.daggerRowIndex = 0 ∧ bridge.daggerColIndex = 2 ∧ bridge.uniformColumnFormula = "H_W^(kappa)[2,0] = 1/sqrt(kappa)" ∧ bridge.citedUniformSuperpositionFormula = "H_W^(kappa)|0> = kappa^{-1/2} sum_{s=0}^{kappa-1} |s>" ∧ bridge.conditionalDaggerEntryLemma = "oneTermRobinGamma3BoundaryHWKappaDaggerEntryFromTransposeUniformColumn_n3" ∧ bridge.expectedUniformColumnEntry = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv" ∧ bridge.expectedDaggerEntry = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv" ∧ bridge.uniformColumnObligation = convention.uniformColumnObligation ∧ bridge.uniformColumnObligation.proved = false ∧ bridge.adjointEntryConventionObligation = convention.adjointEntryConventionObligation ∧ bridge.adjointEntryConventionObligation.proved = true ∧ bridge.sourceContractObligation = convention.sourceContractObligation ∧ bridge.sourceMapBraAmplitudeObligation = convention.sourceMapBraAmplitudeObligation ∧ bridge.factorMapBraAmplitudeObligation = convention.factorMapBraAmplitudeObligation ∧ bridge.routeMatchingProjectionObligation = convention.routeMatchingProjectionObligation ∧ bridge.factorSemanticsObligation = convention.factorSemanticsObligation ∧ bridge.finiteCompositionNormalizedEquality = convention.finiteCompositionNormalizedEquality ∧ bridge.productObligation = convention.productObligation ∧ bridge.externalCleanColumnAcceptedAsContract = true ∧ bridge.cleanColumnFeedsTransposeBridge = true ∧ bridge.conditionalDaggerEntryBridgeCompiled = true ∧ bridge.uniformColumnProved = false ∧ bridge.adjointEntryConventionProved = true ∧ bridge.daggerEntryProved = false ∧ bridge.embeddedEntryProved = false ∧ bridge.sourceContractObligation.proved = false ∧ bridge.sourceMapBraAmplitudeObligation.proved = false ∧ bridge.factorMapBraAmplitudeObligation.proved = false ∧ bridge.routeMatchingProjectionObligation.proved = false ∧ bridge.factorSemanticsObligation.proved = false ∧ bridge.finiteCompositionNormalizedEquality.proved = false ∧ bridge.productObligation.proved = false ∧ bridge.braAmplitudeProved = false ∧ bridge.routeMatchingProjectionProved = false ∧ bridge.factorSemanticsProved = false ∧ bridge.normalizedBlockEqualityProved = false ∧ bridge.productToCoefficientProved = false ∧ bridge.lcuCorrectProved = false ∧ bridge.blockProjectionProved = false ∧ bridge.blockCorrectProved = false ∧ bridge.finalExtractionProved = false ∧ bridge.exactRemainingObstruction = "connect the external clean-column contract to the bra-amplitude and factor-semantics obligations, or formalize the cited H_W^(kappa) preparation theorem before marking the dagger entry proved"
Transcript theorem for the clean-column contract bridge. The theorem checks that the bridge uses the Shukla--Vedula cited row as a contract-only source, feeds the accepted entry through the transpose lemma, and keeps the theorem-facing semantic flags false.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary clean column bra route contract”. A proposition-valued field is a requirement until a constructor supplies it. Route contract from the accepted clean-column input to the existing bra amplitude and factor-semantics obligations.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Route contract from the accepted clean-column input to the existing bra amplitude and factor-semantics obligations. The clean-column bridge supplies a conditional focused dagger entry under the external Shukla--Vedula uniform-column contract. This packet records that the same entry is exactly the bra-side amplitude source needed by 'oneTermRobinGamma3BoundaryBraProjectionAmplitudeSourceMap_n3' and the same bra-amplitude obligation consumed by 'oneTermRobinGamma3BoundaryFactorSemanticsContractMap_n3'. It is still only a route contract: the external clean-column theorem, the actual bra amplitude, factor semantics, finite normalized equality, and product-to-coefficient obligation remain false.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:13097. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.256●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryCleanColumnBraRouteContract : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryCleanColumnBraRouteContract : Type
Route contract from the accepted clean-column input to the existing bra amplitude and factor-semantics obligations. The clean-column bridge supplies a conditional focused dagger entry under the external Shukla--Vedula uniform-column contract. This packet records that the same entry is exactly the bra-side amplitude source needed by `oneTermRobinGamma3BoundaryBraProjectionAmplitudeSourceMap_n3` and the same bra-amplitude obligation consumed by `oneTermRobinGamma3BoundaryFactorSemanticsContractMap_n3`. It is still only a route contract: the external clean-column theorem, the actual bra amplitude, factor semantics, finite normalized equality, and product-to-coefficient obligation remain false.
Fields
sourceAnchor : String
cleanColumnContract : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryHWKappaCleanColumnContract
braSourceMap : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBraProjectionAmplitudeSourceMap
factorContractMap : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryFactorSemanticsContractMap
citedResultId : String
focusedSparseSlot : ℕ
focusedKappa : ℕ
sparseRegisterDimension : ℕ
cleanBasisIndex : ℕ
uniformColumnRowIndex : ℕ
uniformColumnColIndex : ℕ
daggerRowIndex : ℕ
daggerColIndex : ℕ
cleanColumnEntryFormula : String
daggerEntryFormula : String
braProjectionEntryFormula : String
conditionalDaggerEntryLemma : String
bridgeLemma : String
expectedUniformColumnEntry : QuantumBlockEncoding.Coeff
expectedDaggerEntry : QuantumBlockEncoding.Coeff
expectedBraAmplitudeFactor : QuantumBlockEncoding.Coeff
uniformColumnObligation : QuantumBlockEncoding.SemanticObligation
sourceContractObligation : QuantumBlockEncoding.SemanticObligation
sourceMapBraAmplitudeObligation : QuantumBlockEncoding.SemanticObligation
factorMapBraAmplitudeObligation : QuantumBlockEncoding.SemanticObligation
routeMatchingProjectionObligation : QuantumBlockEncoding.SemanticObligation
factorSemanticsObligation : QuantumBlockEncoding.SemanticObligation
finiteCompositionNormalizedEquality : QuantumBlockEncoding.SemanticObligation
productObligation : QuantumBlockEncoding.SemanticObligation
externalCleanColumnAcceptedAsContract : Bool
cleanColumnFeedsDaggerEntry : Bool
sourceMapWired : Bool
factorMapWired : Bool
braRouteContractMapped : Bool
uniformColumnProved : Bool
daggerEntryProved : Bool
braAmplitudeProved : Bool
routeMatchingProjectionProved : Bool
factorSemanticsProved : Bool
normalizedBlockEqualityProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
exactRemainingObstruction : String
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary clean column bra route contract n 3”. Compiled clean-column to bra-route contract for the focused boundary branch.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Compiled clean-column to bra-route contract for the focused boundary branch. This declaration connects the contract-only clean-column bridge to the exact bra-amplitude and factor-semantics fields already present in the route. It does not prove the Shukla--Vedula clean-column input or discharge the internal projection-amplitude obligation.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:13154. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.257●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCleanColumnBraRouteContract_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryCleanColumnBraRouteContract
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCleanColumnBraRouteContract_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryCleanColumnBraRouteContract
Compiled clean-column to bra-route contract for the focused boundary branch. This declaration connects the contract-only clean-column bridge to the exact bra-amplitude and factor-semantics fields already present in the route. It does not prove the Shukla--Vedula clean-column input or discharge the internal projection-amplitude obligation.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary clean column bra route contract feeds bra amplitude n 3”; its local proof does not by itself complete the broader paper route. The clean-column bridge feeds the expected bra-amplitude factor conditionally.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The clean-column bridge feeds the expected bra-amplitude factor conditionally. This theorem only rewrites the existing transpose bridge through the new route contract. The uniform-column hypothesis remains external.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:13226. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.258●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCleanColumnBraRouteContract_feedsBraAmplitude_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) (hUniform : H ⟨QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCleanColumnBraRouteContract_n3.uniformColumnRowIndex, ⋯⟩ ⟨QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCleanColumnBraRouteContract_n3.uniformColumnColIndex, ⋯⟩ = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCleanColumnBraRouteContract_n3.expectedUniformColumnEntry) : QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerTransposeMatrix_n3 H ⟨QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCleanColumnBraRouteContract_n3.daggerRowIndex, ⋯⟩ ⟨QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCleanColumnBraRouteContract_n3.daggerColIndex, ⋯⟩ = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCleanColumnBraRouteContract_n3.expectedBraAmplitudeFactor
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCleanColumnBraRouteContract_feedsBraAmplitude_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) (hUniform : H ⟨QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCleanColumnBraRouteContract_n3.uniformColumnRowIndex, ⋯⟩ ⟨QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCleanColumnBraRouteContract_n3.uniformColumnColIndex, ⋯⟩ = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCleanColumnBraRouteContract_n3.expectedUniformColumnEntry) : QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerTransposeMatrix_n3 H ⟨QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCleanColumnBraRouteContract_n3.daggerRowIndex, ⋯⟩ ⟨QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCleanColumnBraRouteContract_n3.daggerColIndex, ⋯⟩ = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCleanColumnBraRouteContract_n3.expectedBraAmplitudeFactor
The clean-column bridge feeds the expected bra-amplitude factor conditionally. This theorem only rewrites the existing transpose bridge through the new route contract. The uniform-column hypothesis remains external.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary clean column bra route contract n 3 transcript”; its local proof does not by itself complete the broader paper route. Transcript theorem for the clean-column to bra-route contract.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Transcript theorem for the clean-column to bra-route contract. This checks that the route points at the same bra-amplitude obligation in the source map and the factor-semantics contract map, while every semantic proof flag remains false.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:13252. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.259●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCleanColumnBraRouteContract_n3_transcript : have route := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCleanColumnBraRouteContract_n3; have cleanColumn := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaCleanColumnContract_n3; have sourceMap := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBraProjectionAmplitudeSourceMap_n3; have factorMap := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryFactorSemanticsContractMap_n3; route.cleanColumnContract = cleanColumn ∧ route.braSourceMap = sourceMap ∧ route.factorContractMap = factorMap ∧ route.citedResultId = "ShuklaVedula2024.HWkappaUniformSuperposition" ∧ route.focusedSparseSlot = 2 ∧ route.focusedKappa = 7 ∧ route.sparseRegisterDimension = 8 ∧ route.cleanBasisIndex = 32 ∧ route.uniformColumnRowIndex = 2 ∧ route.uniformColumnColIndex = 0 ∧ route.daggerRowIndex = 0 ∧ route.daggerColIndex = 2 ∧ route.cleanColumnEntryFormula = "H_W^(kappa)[2,0] = 1/sqrt(kappa)" ∧ route.daggerEntryFormula = "H_W^(kappa)^dagger[0,2] = sqrt_kappa_inv under the accepted clean-column contract" ∧ route.braProjectionEntryFormula = "<0| H_W^(kappa)^dagger |2> = 1/sqrt(kappa), embedded at clean basis index 32" ∧ route.conditionalDaggerEntryLemma = "oneTermRobinGamma3BoundaryHWKappaDaggerEntryFromTransposeUniformColumn_n3" ∧ route.bridgeLemma = "oneTermRobinGamma3BoundaryHWKappaCleanColumnContract_feedsTransposeBridge_n3" ∧ route.expectedUniformColumnEntry = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv" ∧ route.expectedDaggerEntry = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv" ∧ route.expectedBraAmplitudeFactor = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv" ∧ route.uniformColumnObligation = cleanColumn.uniformColumnObligation ∧ route.sourceContractObligation = cleanColumn.sourceContractObligation ∧ route.sourceMapBraAmplitudeObligation = sourceMap.amplitudeContractObligation ∧ route.factorMapBraAmplitudeObligation = factorMap.braAmplitudeObligation ∧ route.sourceMapBraAmplitudeObligation = route.factorMapBraAmplitudeObligation ∧ route.sourceMapBraAmplitudeObligation = cleanColumn.sourceMapBraAmplitudeObligation ∧ route.factorMapBraAmplitudeObligation = cleanColumn.factorMapBraAmplitudeObligation ∧ route.routeMatchingProjectionObligation = sourceMap.routeMatchingProjectionObligation ∧ route.factorSemanticsObligation = factorMap.factorSemanticsObligation ∧ route.finiteCompositionNormalizedEquality = factorMap.finiteCompositionNormalizedEquality ∧ route.productObligation = factorMap.productObligation ∧ route.externalCleanColumnAcceptedAsContract = true ∧ route.cleanColumnFeedsDaggerEntry = true ∧ route.sourceMapWired = true ∧ route.factorMapWired = true ∧ route.braRouteContractMapped = true ∧ route.uniformColumnObligation.proved = false ∧ route.sourceContractObligation.proved = false ∧ route.sourceMapBraAmplitudeObligation.proved = false ∧ route.factorMapBraAmplitudeObligation.proved = false ∧ route.routeMatchingProjectionObligation.proved = false ∧ route.factorSemanticsObligation.proved = false ∧ route.finiteCompositionNormalizedEquality.proved = false ∧ route.productObligation.proved = false ∧ route.uniformColumnProved = false ∧ route.daggerEntryProved = false ∧ route.braAmplitudeProved = false ∧ ⋯
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCleanColumnBraRouteContract_n3_transcript : have route := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCleanColumnBraRouteContract_n3; have cleanColumn := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaCleanColumnContract_n3; have sourceMap := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBraProjectionAmplitudeSourceMap_n3; have factorMap := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryFactorSemanticsContractMap_n3; route.cleanColumnContract = cleanColumn ∧ route.braSourceMap = sourceMap ∧ route.factorContractMap = factorMap ∧ route.citedResultId = "ShuklaVedula2024.HWkappaUniformSuperposition" ∧ route.focusedSparseSlot = 2 ∧ route.focusedKappa = 7 ∧ route.sparseRegisterDimension = 8 ∧ route.cleanBasisIndex = 32 ∧ route.uniformColumnRowIndex = 2 ∧ route.uniformColumnColIndex = 0 ∧ route.daggerRowIndex = 0 ∧ route.daggerColIndex = 2 ∧ route.cleanColumnEntryFormula = "H_W^(kappa)[2,0] = 1/sqrt(kappa)" ∧ route.daggerEntryFormula = "H_W^(kappa)^dagger[0,2] = sqrt_kappa_inv under the accepted clean-column contract" ∧ route.braProjectionEntryFormula = "<0| H_W^(kappa)^dagger |2> = 1/sqrt(kappa), embedded at clean basis index 32" ∧ route.conditionalDaggerEntryLemma = "oneTermRobinGamma3BoundaryHWKappaDaggerEntryFromTransposeUniformColumn_n3" ∧ route.bridgeLemma = "oneTermRobinGamma3BoundaryHWKappaCleanColumnContract_feedsTransposeBridge_n3" ∧ route.expectedUniformColumnEntry = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv" ∧ route.expectedDaggerEntry = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv" ∧ route.expectedBraAmplitudeFactor = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv" ∧ route.uniformColumnObligation = cleanColumn.uniformColumnObligation ∧ route.sourceContractObligation = cleanColumn.sourceContractObligation ∧ route.sourceMapBraAmplitudeObligation = sourceMap.amplitudeContractObligation ∧ route.factorMapBraAmplitudeObligation = factorMap.braAmplitudeObligation ∧ route.sourceMapBraAmplitudeObligation = route.factorMapBraAmplitudeObligation ∧ route.sourceMapBraAmplitudeObligation = cleanColumn.sourceMapBraAmplitudeObligation ∧ route.factorMapBraAmplitudeObligation = cleanColumn.factorMapBraAmplitudeObligation ∧ route.routeMatchingProjectionObligation = sourceMap.routeMatchingProjectionObligation ∧ route.factorSemanticsObligation = factorMap.factorSemanticsObligation ∧ route.finiteCompositionNormalizedEquality = factorMap.finiteCompositionNormalizedEquality ∧ route.productObligation = factorMap.productObligation ∧ route.externalCleanColumnAcceptedAsContract = true ∧ route.cleanColumnFeedsDaggerEntry = true ∧ route.sourceMapWired = true ∧ route.factorMapWired = true ∧ route.braRouteContractMapped = true ∧ route.uniformColumnObligation.proved = false ∧ route.sourceContractObligation.proved = false ∧ route.sourceMapBraAmplitudeObligation.proved = false ∧ route.factorMapBraAmplitudeObligation.proved = false ∧ route.routeMatchingProjectionObligation.proved = false ∧ route.factorSemanticsObligation.proved = false ∧ route.finiteCompositionNormalizedEquality.proved = false ∧ route.productObligation.proved = false ∧ route.uniformColumnProved = false ∧ route.daggerEntryProved = false ∧ route.braAmplitudeProved = false ∧ ⋯
Transcript theorem for the clean-column to bra-route contract. This checks that the route points at the same bra-amplitude obligation in the source map and the factor-semantics contract map, while every semantic proof flag remains false.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary clean column factor semantics route”. A proposition-valued field is a requirement until a constructor supplies it. Under-contract route from the clean-column bra factor to factor semantics.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Under-contract route from the clean-column bra factor to factor semantics. The route records that the clean-column-to-bra bridge supplies the bra-side factor expected by the factor-semantics contract map. It also keeps the external uniform amplitude, ket amplitude, square-root product convention, finite normalized equality, and focused product theorem as explicit false obligations.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:13362. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.260●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryCleanColumnFactorSemanticsRoute : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryCleanColumnFactorSemanticsRoute : Type
Under-contract route from the clean-column bra factor to factor semantics. The route records that the clean-column-to-bra bridge supplies the bra-side factor expected by the factor-semantics contract map. It also keeps the external uniform amplitude, ket amplitude, square-root product convention, finite normalized equality, and focused product theorem as explicit false obligations.
Fields
sourceAnchor : String
cleanColumnRoute : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryCleanColumnBraRouteContract
factorContractMap : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryFactorSemanticsContractMap
focusedSparseSlot : ℕ
cleanBasisIndex : ℕ
uniformColumnRowIndex : ℕ
uniformColumnColIndex : ℕ
daggerRowIndex : ℕ
daggerColIndex : ℕ
expectedUniformColumnEntry : QuantumBlockEncoding.Coeff
expectedBraAmplitudeFactor : QuantumBlockEncoding.Coeff
projectedBranchProduct : QuantumBlockEncoding.Coeff
expectedTargetEntry : QuantumBlockEncoding.Coeff
theoremNormalizer : QuantumBlockEncoding.Coeff
cleanColumnFeedLemma : String
factorEvalLemma : String
requiredHypothesesFormula : String
uniformColumnObligation : QuantumBlockEncoding.SemanticObligation
ketAmplitudeObligation : QuantumBlockEncoding.SemanticObligation
braAmplitudeObligation : QuantumBlockEncoding.SemanticObligation
routeMatchingProjectionObligation : QuantumBlockEncoding.SemanticObligation
productHypothesisObligation : QuantumBlockEncoding.SemanticObligation
factorSemanticsObligation : QuantumBlockEncoding.SemanticObligation
finiteCompositionNormalizedEquality : QuantumBlockEncoding.SemanticObligation
productObligation : QuantumBlockEncoding.SemanticObligation
externalCleanColumnAcceptedAsContract : Bool
braFactorRouteWired : Bool
factorMapWired : Bool
conditionalBraFactorCompiled : Bool
conditionalFactorEvalCompiled : Bool
cleanColumnToFactorRouteMapped : Bool
uniformColumnProved : Bool
ketAmplitudeProved : Bool
braAmplitudeProved : Bool
routeMatchingProjectionProved : Bool
productHypothesisProved : Bool
factorSemanticsProved : Bool
normalizedBlockEqualityProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
exactRemainingObstruction : String
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary clean column factor semantics route n 3”. Compiled clean-column to factor-semantics route for the focused boundary branch.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Compiled clean-column to factor-semantics route for the focused boundary branch. This declaration is not a proof of the Shukla--Vedula preparation theorem or the final product-to-coefficient obligation. It only connects the clean bra-factor route to the already compiled conditional factor-map evaluation.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:13417. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.261●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCleanColumnFactorSemanticsRoute_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryCleanColumnFactorSemanticsRoute
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCleanColumnFactorSemanticsRoute_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryCleanColumnFactorSemanticsRoute
Compiled clean-column to factor-semantics route for the focused boundary branch. This declaration is not a proof of the Shukla--Vedula preparation theorem or the final product-to-coefficient obligation. It only connects the clean bra-factor route to the already compiled conditional factor-map evaluation.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary clean column factor semantics route eval n 3”; its local proof does not by itself complete the broader paper route. Conditional evaluation for the clean-column to factor-semantics route.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Conditional evaluation for the clean-column to factor-semantics route. The theorem explicitly consumes the external clean-column hypothesis and the coefficient-environment hypotheses. It proves only the local conditional bridge and the already compiled factor-map evaluation under those contracts.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:13488. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.262●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCleanColumnFactorSemanticsRouteEval_n3 (env : String → ℚ) (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) (hUniform : H ⟨QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCleanColumnFactorSemanticsRoute_n3.uniformColumnRowIndex, ⋯⟩ ⟨QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCleanColumnFactorSemanticsRoute_n3.uniformColumnColIndex, ⋯⟩ = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCleanColumnFactorSemanticsRoute_n3.expectedUniformColumnEntry) (hND : env "N_D_inv" * env "N_D" = 1) (hNF : env "N_f_inv" * env "N_f" = 1) (hkappa : env "kappa_inv" * env "kappa" = 1) (hkappaSqrt : env "sqrt_kappa_inv" * env "sqrt_kappa_inv" = env "kappa_inv") : let route := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCleanColumnFactorSemanticsRoute_n3; QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerTransposeMatrix_n3 H ⟨route.daggerRowIndex, ⋯⟩ ⟨route.daggerColIndex, ⋯⟩ = route.expectedBraAmplitudeFactor ∧ QuantumBlockEncoding.Coeff.evalWith env route.projectedBranchProduct * QuantumBlockEncoding.Coeff.evalWith env route.theoremNormalizer = QuantumBlockEncoding.Coeff.evalWith env route.expectedTargetEntry
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCleanColumnFactorSemanticsRouteEval_n3 (env : String → ℚ) (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) (hUniform : H ⟨QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCleanColumnFactorSemanticsRoute_n3.uniformColumnRowIndex, ⋯⟩ ⟨QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCleanColumnFactorSemanticsRoute_n3.uniformColumnColIndex, ⋯⟩ = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCleanColumnFactorSemanticsRoute_n3.expectedUniformColumnEntry) (hND : env "N_D_inv" * env "N_D" = 1) (hNF : env "N_f_inv" * env "N_f" = 1) (hkappa : env "kappa_inv" * env "kappa" = 1) (hkappaSqrt : env "sqrt_kappa_inv" * env "sqrt_kappa_inv" = env "kappa_inv") : let route := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCleanColumnFactorSemanticsRoute_n3; QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerTransposeMatrix_n3 H ⟨route.daggerRowIndex, ⋯⟩ ⟨route.daggerColIndex, ⋯⟩ = route.expectedBraAmplitudeFactor ∧ QuantumBlockEncoding.Coeff.evalWith env route.projectedBranchProduct * QuantumBlockEncoding.Coeff.evalWith env route.theoremNormalizer = QuantumBlockEncoding.Coeff.evalWith env route.expectedTargetEntry
Conditional evaluation for the clean-column to factor-semantics route. The theorem explicitly consumes the external clean-column hypothesis and the coefficient-environment hypotheses. It proves only the local conditional bridge and the already compiled factor-map evaluation under those contracts.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary clean column factor semantics route n 3 transcript”; its local proof does not by itself complete the broader paper route. Transcript theorem for the clean-column to factor-semantics route.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Transcript theorem for the clean-column to factor-semantics route. It checks that the route connects the clean-column bra factor to the factor contract map and preserves all theorem-facing semantic flags as false.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:13532. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.263●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCleanColumnFactorSemanticsRoute_n3_transcript : have route := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCleanColumnFactorSemanticsRoute_n3; have cleanRoute := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCleanColumnBraRouteContract_n3; have factorMap := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryFactorSemanticsContractMap_n3; route.cleanColumnRoute = cleanRoute ∧ route.factorContractMap = factorMap ∧ route.focusedSparseSlot = 2 ∧ route.cleanBasisIndex = 32 ∧ route.uniformColumnRowIndex = 2 ∧ route.uniformColumnColIndex = 0 ∧ route.daggerRowIndex = 0 ∧ route.daggerColIndex = 2 ∧ route.expectedUniformColumnEntry = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv" ∧ route.expectedBraAmplitudeFactor = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv" ∧ route.projectedBranchProduct = factorMap.projectedBranchProduct ∧ route.expectedTargetEntry = factorMap.expectedTargetEntry ∧ route.theoremNormalizer = factorMap.theoremNormalizer ∧ route.cleanColumnFeedLemma = "oneTermRobinGamma3BoundaryCleanColumnBraRouteContract_feedsBraAmplitude_n3" ∧ route.factorEvalLemma = "oneTermRobinGamma3BoundaryFactorSemanticsContractMapEval_n3" ∧ route.uniformColumnObligation = cleanRoute.uniformColumnObligation ∧ route.ketAmplitudeObligation = factorMap.ketAmplitudeObligation ∧ route.braAmplitudeObligation = factorMap.braAmplitudeObligation ∧ route.braAmplitudeObligation = cleanRoute.factorMapBraAmplitudeObligation ∧ route.routeMatchingProjectionObligation = factorMap.routeMatchingProjectionObligation ∧ route.productHypothesisObligation = factorMap.productHypothesisObligation ∧ route.factorSemanticsObligation = factorMap.factorSemanticsObligation ∧ route.finiteCompositionNormalizedEquality = factorMap.finiteCompositionNormalizedEquality ∧ route.productObligation = factorMap.productObligation ∧ route.externalCleanColumnAcceptedAsContract = true ∧ route.braFactorRouteWired = true ∧ route.factorMapWired = true ∧ route.conditionalBraFactorCompiled = true ∧ route.conditionalFactorEvalCompiled = true ∧ route.cleanColumnToFactorRouteMapped = true ∧ route.uniformColumnObligation.proved = false ∧ route.ketAmplitudeObligation.proved = false ∧ route.braAmplitudeObligation.proved = false ∧ route.routeMatchingProjectionObligation.proved = false ∧ route.productHypothesisObligation.proved = false ∧ route.factorSemanticsObligation.proved = false ∧ route.finiteCompositionNormalizedEquality.proved = false ∧ route.productObligation.proved = false ∧ route.uniformColumnProved = false ∧ route.ketAmplitudeProved = false ∧ route.braAmplitudeProved = false ∧ route.routeMatchingProjectionProved = false ∧ route.productHypothesisProved = false ∧ route.factorSemanticsProved = false ∧ route.normalizedBlockEqualityProved = false ∧ route.productToCoefficientProved = false ∧ route.lcuCorrectProved = false ∧ route.blockProjectionProved = false ∧ route.blockCorrectProved = false ∧ route.finalExtractionProved = false ∧ route.exactRemainingObstruction = "supply the external clean-column theorem, ket amplitude, square-root product convention, finite normalized equality, and focused product theorem before promoting factor semantics"
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCleanColumnFactorSemanticsRoute_n3_transcript : have route := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCleanColumnFactorSemanticsRoute_n3; have cleanRoute := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCleanColumnBraRouteContract_n3; have factorMap := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryFactorSemanticsContractMap_n3; route.cleanColumnRoute = cleanRoute ∧ route.factorContractMap = factorMap ∧ route.focusedSparseSlot = 2 ∧ route.cleanBasisIndex = 32 ∧ route.uniformColumnRowIndex = 2 ∧ route.uniformColumnColIndex = 0 ∧ route.daggerRowIndex = 0 ∧ route.daggerColIndex = 2 ∧ route.expectedUniformColumnEntry = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv" ∧ route.expectedBraAmplitudeFactor = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv" ∧ route.projectedBranchProduct = factorMap.projectedBranchProduct ∧ route.expectedTargetEntry = factorMap.expectedTargetEntry ∧ route.theoremNormalizer = factorMap.theoremNormalizer ∧ route.cleanColumnFeedLemma = "oneTermRobinGamma3BoundaryCleanColumnBraRouteContract_feedsBraAmplitude_n3" ∧ route.factorEvalLemma = "oneTermRobinGamma3BoundaryFactorSemanticsContractMapEval_n3" ∧ route.uniformColumnObligation = cleanRoute.uniformColumnObligation ∧ route.ketAmplitudeObligation = factorMap.ketAmplitudeObligation ∧ route.braAmplitudeObligation = factorMap.braAmplitudeObligation ∧ route.braAmplitudeObligation = cleanRoute.factorMapBraAmplitudeObligation ∧ route.routeMatchingProjectionObligation = factorMap.routeMatchingProjectionObligation ∧ route.productHypothesisObligation = factorMap.productHypothesisObligation ∧ route.factorSemanticsObligation = factorMap.factorSemanticsObligation ∧ route.finiteCompositionNormalizedEquality = factorMap.finiteCompositionNormalizedEquality ∧ route.productObligation = factorMap.productObligation ∧ route.externalCleanColumnAcceptedAsContract = true ∧ route.braFactorRouteWired = true ∧ route.factorMapWired = true ∧ route.conditionalBraFactorCompiled = true ∧ route.conditionalFactorEvalCompiled = true ∧ route.cleanColumnToFactorRouteMapped = true ∧ route.uniformColumnObligation.proved = false ∧ route.ketAmplitudeObligation.proved = false ∧ route.braAmplitudeObligation.proved = false ∧ route.routeMatchingProjectionObligation.proved = false ∧ route.productHypothesisObligation.proved = false ∧ route.factorSemanticsObligation.proved = false ∧ route.finiteCompositionNormalizedEquality.proved = false ∧ route.productObligation.proved = false ∧ route.uniformColumnProved = false ∧ route.ketAmplitudeProved = false ∧ route.braAmplitudeProved = false ∧ route.routeMatchingProjectionProved = false ∧ route.productHypothesisProved = false ∧ route.factorSemanticsProved = false ∧ route.normalizedBlockEqualityProved = false ∧ route.productToCoefficientProved = false ∧ route.lcuCorrectProved = false ∧ route.blockProjectionProved = false ∧ route.blockCorrectProved = false ∧ route.finalExtractionProved = false ∧ route.exactRemainingObstruction = "supply the external clean-column theorem, ket amplitude, square-root product convention, finite normalized equality, and focused product theorem before promoting factor semantics"
Transcript theorem for the clean-column to factor-semantics route. It checks that the route connects the clean-column bra factor to the factor contract map and preserves all theorem-facing semantic flags as false.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary product under contracts route”. A proposition-valued field is a requirement until a constructor supplies it. Product-under-contracts route for the focused boundary branch.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Product-under-contracts route for the focused boundary branch. The clean-column factor-semantics route already supplies the conditional coefficient calculation. This packet ties that route to the fixed 'oneTermRobinGamma3ProductToCoefficientObligation 3 0 0' and names the exact remaining bridge: the finite block-composition contract must identify the projected branch product with the theorem's normalized block entry. No semantic proof flag is promoted here.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:13630. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.264●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProductUnderContractsRoute : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProductUnderContractsRoute : Type
Product-under-contracts route for the focused boundary branch. The clean-column factor-semantics route already supplies the conditional coefficient calculation. This packet ties that route to the fixed `oneTermRobinGamma3ProductToCoefficientObligation 3 0 0` and names the exact remaining bridge: the finite block-composition contract must identify the projected branch product with the theorem's normalized block entry. No semantic proof flag is promoted here.
Fields
sourceAnchor : String
cleanColumnFactorRoute : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryCleanColumnFactorSemanticsRoute
focusedSystemRow : ℕ
focusedSystemColumn : ℕ
focusedSparseSlot : ℕ
cleanBasisIndex : ℕ
expectedBraAmplitudeFactor : QuantumBlockEncoding.Coeff
projectedBranchProduct : QuantumBlockEncoding.Coeff
expectedTargetEntry : QuantumBlockEncoding.Coeff
theoremNormalizer : QuantumBlockEncoding.Coeff
conditionalEvalLemma : String
fixedProductObligationName : String
requiredContractsFormula : String
uniformColumnObligation : QuantumBlockEncoding.SemanticObligation
ketAmplitudeObligation : QuantumBlockEncoding.SemanticObligation
braAmplitudeObligation : QuantumBlockEncoding.SemanticObligation
productHypothesisObligation : QuantumBlockEncoding.SemanticObligation
factorSemanticsObligation : QuantumBlockEncoding.SemanticObligation
finiteCompositionNormalizedEquality : QuantumBlockEncoding.SemanticObligation
productBridgeObligation : QuantumBlockEncoding.SemanticObligation
productObligation : QuantumBlockEncoding.SemanticObligation
externalCleanColumnAcceptedAsContract : Bool
ketAmplitudeAcceptedAsContract : Bool
braAmplitudeAcceptedAsContract : Bool
coefficientHypothesesExplicit : Bool
conditionalEvalCompiled : Bool
productUnderContractsMapped : Bool
uniformColumnProved : Bool
ketAmplitudeProved : Bool
braAmplitudeProved : Bool
productHypothesisProved : Bool
factorSemanticsProved : Bool
normalizedBlockEqualityProved : Bool
productBridgeProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
exactRemainingObstruction : String
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary product under contracts route n 3”. Compiled product-under-contracts route for 'oneTermRobinGamma3ProductToCoefficientObligation 3 0 0'.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Compiled product-under-contracts route for 'oneTermRobinGamma3ProductToCoefficientObligation 3 0 0'. The route uses the clean-column factor-semantics calculation as its local coefficient engine, then records the remaining theorem-facing bridge to the finite block-composition contract. The product obligation remains false.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:13682. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.265●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProductUnderContractsRoute_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProductUnderContractsRoute
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProductUnderContractsRoute_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProductUnderContractsRoute
Compiled product-under-contracts route for `oneTermRobinGamma3ProductToCoefficientObligation 3 0 0`. The route uses the clean-column factor-semantics calculation as its local coefficient engine, then records the remaining theorem-facing bridge to the finite block-composition contract. The product obligation remains false.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary product under contracts eval n 3”; its local proof does not by itself complete the broader paper route. Conditional product-under-contracts evaluation for the focused boundary route.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Conditional product-under-contracts evaluation for the focused boundary route. This is only the Lean-local algebra under explicit contracts. It reuses 'oneTermRobinGamma3BoundaryCleanColumnFactorSemanticsRouteEval_n3' and does not prove the finite block-composition bridge or the product-to-coefficient obligation.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:13749. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.266●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProductUnderContractsEval_n3 (env : String → ℚ) (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) (hUniform : H ⟨QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProductUnderContractsRoute_n3.cleanColumnFactorRoute.uniformColumnRowIndex, ⋯⟩ ⟨QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProductUnderContractsRoute_n3.cleanColumnFactorRoute.uniformColumnColIndex, ⋯⟩ = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProductUnderContractsRoute_n3.cleanColumnFactorRoute.expectedUniformColumnEntry) (hND : env "N_D_inv" * env "N_D" = 1) (hNF : env "N_f_inv" * env "N_f" = 1) (hkappa : env "kappa_inv" * env "kappa" = 1) (hkappaSqrt : env "sqrt_kappa_inv" * env "sqrt_kappa_inv" = env "kappa_inv") : let productRoute := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProductUnderContractsRoute_n3; QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerTransposeMatrix_n3 H ⟨productRoute.cleanColumnFactorRoute.daggerRowIndex, ⋯⟩ ⟨productRoute.cleanColumnFactorRoute.daggerColIndex, ⋯⟩ = productRoute.expectedBraAmplitudeFactor ∧ QuantumBlockEncoding.Coeff.evalWith env productRoute.projectedBranchProduct * QuantumBlockEncoding.Coeff.evalWith env productRoute.theoremNormalizer = QuantumBlockEncoding.Coeff.evalWith env productRoute.expectedTargetEntry
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProductUnderContractsEval_n3 (env : String → ℚ) (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) (hUniform : H ⟨QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProductUnderContractsRoute_n3.cleanColumnFactorRoute.uniformColumnRowIndex, ⋯⟩ ⟨QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProductUnderContractsRoute_n3.cleanColumnFactorRoute.uniformColumnColIndex, ⋯⟩ = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProductUnderContractsRoute_n3.cleanColumnFactorRoute.expectedUniformColumnEntry) (hND : env "N_D_inv" * env "N_D" = 1) (hNF : env "N_f_inv" * env "N_f" = 1) (hkappa : env "kappa_inv" * env "kappa" = 1) (hkappaSqrt : env "sqrt_kappa_inv" * env "sqrt_kappa_inv" = env "kappa_inv") : let productRoute := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProductUnderContractsRoute_n3; QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaDaggerTransposeMatrix_n3 H ⟨productRoute.cleanColumnFactorRoute.daggerRowIndex, ⋯⟩ ⟨productRoute.cleanColumnFactorRoute.daggerColIndex, ⋯⟩ = productRoute.expectedBraAmplitudeFactor ∧ QuantumBlockEncoding.Coeff.evalWith env productRoute.projectedBranchProduct * QuantumBlockEncoding.Coeff.evalWith env productRoute.theoremNormalizer = QuantumBlockEncoding.Coeff.evalWith env productRoute.expectedTargetEntry
Conditional product-under-contracts evaluation for the focused boundary route. This is only the Lean-local algebra under explicit contracts. It reuses `oneTermRobinGamma3BoundaryCleanColumnFactorSemanticsRouteEval_n3` and does not prove the finite block-composition bridge or the product-to-coefficient obligation.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary product under contracts route n 3 transcript”; its local proof does not by itself complete the broader paper route. Transcript theorem for the product-under-contracts route.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Transcript theorem for the product-under-contracts route. The theorem confirms that the new packet starts from the clean-column factor route, points at the fixed boundary product obligation, and leaves the finite-composition bridge and product-to-coefficient theorem unproved.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:13788. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.267●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProductUnderContractsRoute_n3_transcript : have productRoute := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProductUnderContractsRoute_n3; have factorRoute := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCleanColumnFactorSemanticsRoute_n3; productRoute.cleanColumnFactorRoute = factorRoute ∧ productRoute.focusedSystemRow = 0 ∧ productRoute.focusedSystemColumn = 0 ∧ productRoute.focusedSparseSlot = 2 ∧ productRoute.cleanBasisIndex = 32 ∧ productRoute.expectedBraAmplitudeFactor = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv" ∧ productRoute.projectedBranchProduct = factorRoute.projectedBranchProduct ∧ productRoute.expectedTargetEntry = factorRoute.expectedTargetEntry ∧ productRoute.theoremNormalizer = QuantumBlockEncoding.GHL2025.oneTermRobinNormalizer ∧ productRoute.conditionalEvalLemma = "oneTermRobinGamma3BoundaryProductUnderContractsEval_n3" ∧ productRoute.fixedProductObligationName = "oneTermRobinGamma3ProductToCoefficientObligation 3 0 0" ∧ productRoute.uniformColumnObligation = factorRoute.uniformColumnObligation ∧ productRoute.ketAmplitudeObligation = factorRoute.ketAmplitudeObligation ∧ productRoute.braAmplitudeObligation = factorRoute.braAmplitudeObligation ∧ productRoute.productHypothesisObligation = factorRoute.productHypothesisObligation ∧ productRoute.factorSemanticsObligation = factorRoute.factorSemanticsObligation ∧ productRoute.finiteCompositionNormalizedEquality = factorRoute.finiteCompositionNormalizedEquality ∧ productRoute.productObligation = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProductToCoefficientObligation 3 ⟨0, ⋯⟩ ⟨0, ⋯⟩ ∧ productRoute.productBridgeObligation.proved = false ∧ productRoute.productObligation.proved = false ∧ productRoute.externalCleanColumnAcceptedAsContract = true ∧ productRoute.ketAmplitudeAcceptedAsContract = true ∧ productRoute.braAmplitudeAcceptedAsContract = true ∧ productRoute.coefficientHypothesesExplicit = true ∧ productRoute.conditionalEvalCompiled = true ∧ productRoute.productUnderContractsMapped = true ∧ productRoute.uniformColumnObligation.proved = false ∧ productRoute.ketAmplitudeObligation.proved = false ∧ productRoute.braAmplitudeObligation.proved = false ∧ productRoute.productHypothesisObligation.proved = false ∧ productRoute.factorSemanticsObligation.proved = false ∧ productRoute.finiteCompositionNormalizedEquality.proved = false ∧ productRoute.uniformColumnProved = false ∧ productRoute.ketAmplitudeProved = false ∧ productRoute.braAmplitudeProved = false ∧ productRoute.productHypothesisProved = false ∧ productRoute.factorSemanticsProved = false ∧ productRoute.normalizedBlockEqualityProved = false ∧ productRoute.productBridgeProved = false ∧ productRoute.productToCoefficientProved = false ∧ productRoute.lcuCorrectProved = false ∧ productRoute.blockProjectionProved = false ∧ productRoute.blockCorrectProved = false ∧ productRoute.finalExtractionProved = false ∧ productRoute.exactRemainingObstruction = "the conditional coefficient route is compiled, but QBE still needs finite normalized block equality and a projection/product bridge before marking oneTermRobinGamma3ProductToCoefficientObligation 3 0 0 proved"
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProductUnderContractsRoute_n3_transcript : have productRoute := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProductUnderContractsRoute_n3; have factorRoute := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCleanColumnFactorSemanticsRoute_n3; productRoute.cleanColumnFactorRoute = factorRoute ∧ productRoute.focusedSystemRow = 0 ∧ productRoute.focusedSystemColumn = 0 ∧ productRoute.focusedSparseSlot = 2 ∧ productRoute.cleanBasisIndex = 32 ∧ productRoute.expectedBraAmplitudeFactor = QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv" ∧ productRoute.projectedBranchProduct = factorRoute.projectedBranchProduct ∧ productRoute.expectedTargetEntry = factorRoute.expectedTargetEntry ∧ productRoute.theoremNormalizer = QuantumBlockEncoding.GHL2025.oneTermRobinNormalizer ∧ productRoute.conditionalEvalLemma = "oneTermRobinGamma3BoundaryProductUnderContractsEval_n3" ∧ productRoute.fixedProductObligationName = "oneTermRobinGamma3ProductToCoefficientObligation 3 0 0" ∧ productRoute.uniformColumnObligation = factorRoute.uniformColumnObligation ∧ productRoute.ketAmplitudeObligation = factorRoute.ketAmplitudeObligation ∧ productRoute.braAmplitudeObligation = factorRoute.braAmplitudeObligation ∧ productRoute.productHypothesisObligation = factorRoute.productHypothesisObligation ∧ productRoute.factorSemanticsObligation = factorRoute.factorSemanticsObligation ∧ productRoute.finiteCompositionNormalizedEquality = factorRoute.finiteCompositionNormalizedEquality ∧ productRoute.productObligation = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3ProductToCoefficientObligation 3 ⟨0, ⋯⟩ ⟨0, ⋯⟩ ∧ productRoute.productBridgeObligation.proved = false ∧ productRoute.productObligation.proved = false ∧ productRoute.externalCleanColumnAcceptedAsContract = true ∧ productRoute.ketAmplitudeAcceptedAsContract = true ∧ productRoute.braAmplitudeAcceptedAsContract = true ∧ productRoute.coefficientHypothesesExplicit = true ∧ productRoute.conditionalEvalCompiled = true ∧ productRoute.productUnderContractsMapped = true ∧ productRoute.uniformColumnObligation.proved = false ∧ productRoute.ketAmplitudeObligation.proved = false ∧ productRoute.braAmplitudeObligation.proved = false ∧ productRoute.productHypothesisObligation.proved = false ∧ productRoute.factorSemanticsObligation.proved = false ∧ productRoute.finiteCompositionNormalizedEquality.proved = false ∧ productRoute.uniformColumnProved = false ∧ productRoute.ketAmplitudeProved = false ∧ productRoute.braAmplitudeProved = false ∧ productRoute.productHypothesisProved = false ∧ productRoute.factorSemanticsProved = false ∧ productRoute.normalizedBlockEqualityProved = false ∧ productRoute.productBridgeProved = false ∧ productRoute.productToCoefficientProved = false ∧ productRoute.lcuCorrectProved = false ∧ productRoute.blockProjectionProved = false ∧ productRoute.blockCorrectProved = false ∧ productRoute.finalExtractionProved = false ∧ productRoute.exactRemainingObstruction = "the conditional coefficient route is compiled, but QBE still needs finite normalized block equality and a projection/product bridge before marking oneTermRobinGamma3ProductToCoefficientObligation 3 0 0 proved"
Transcript theorem for the product-under-contracts route. The theorem confirms that the new packet starts from the clean-column factor route, points at the fixed boundary product obligation, and leaves the finite-composition bridge and product-to-coefficient theorem unproved.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary finite projection block entry index n 3”; its local proof does not by itself complete the broader paper route. Finite signal-block index lemma for the focused product/projection bridge.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Finite signal-block index lemma for the focused product/projection bridge. The conditional product route works with the branch basis index '32', where sparse slot '2' and system column '0' are embedded in the full circuit basis. The finite block-composition contract, however, exposes the signal-zero block entry at compound row and column '0' for the '(0,0)' system entry. This lemma records that finite indexing fact without claiming that the branch product has already been summed into the block entry.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:13877. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.268●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryFiniteProjectionBlockEntryIndex_n3 : let p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3; have contract := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteBlockCompositionContract 3; have sysRow := ⟨0, ⋯⟩; have sysCol := ⟨0, ⋯⟩; have blockRow := ⟨QuantumBlockEncoding.signalSystemBlockRowIndex (QuantumBlockEncoding.gridSize 3) ↑contract.expectedTarget.signalIndex ↑sysRow, ⋯⟩; have blockCol := ⟨QuantumBlockEncoding.signalSystemBlockColIndex (QuantumBlockEncoding.gridSize 3) ↑contract.expectedTarget.signalIndex ↑sysCol, ⋯⟩; contract.expectedTarget.blockMatrix sysRow sysCol = contract.expectedTarget.unitaryMatrix blockRow blockCol ∧ ↑blockRow = 0 ∧ ↑blockCol = 0 ∧ QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3PaperBasisIndex p 2 0 = 32 ∧ ↑QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3 = 32 ∧ ↑blockRow ≠ ↑QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3 ∧ ↑blockCol ≠ ↑QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryFiniteProjectionBlockEntryIndex_n3 : let p := QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3; have contract := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteBlockCompositionContract 3; have sysRow := ⟨0, ⋯⟩; have sysCol := ⟨0, ⋯⟩; have blockRow := ⟨QuantumBlockEncoding.signalSystemBlockRowIndex (QuantumBlockEncoding.gridSize 3) ↑contract.expectedTarget.signalIndex ↑sysRow, ⋯⟩; have blockCol := ⟨QuantumBlockEncoding.signalSystemBlockColIndex (QuantumBlockEncoding.gridSize 3) ↑contract.expectedTarget.signalIndex ↑sysCol, ⋯⟩; contract.expectedTarget.blockMatrix sysRow sysCol = contract.expectedTarget.unitaryMatrix blockRow blockCol ∧ ↑blockRow = 0 ∧ ↑blockCol = 0 ∧ QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3PaperBasisIndex p 2 0 = 32 ∧ ↑QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3 = 32 ∧ ↑blockRow ≠ ↑QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3 ∧ ↑blockCol ≠ ↑QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3
Finite signal-block index lemma for the focused product/projection bridge. The conditional product route works with the branch basis index `32`, where sparse slot `2` and system column `0` are embedded in the full circuit basis. The finite block-composition contract, however, exposes the signal-zero block entry at compound row and column `0` for the `(0,0)` system entry. This lemma records that finite indexing fact without claiming that the branch product has already been summed into the block entry.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary finite projection product bridge”. A proposition-valued field is a requirement until a constructor supplies it. Finite projection/product bridge packet for the focused boundary branch.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Finite projection/product bridge packet for the focused boundary branch. This consumes 'oneTermRobinGamma3BoundaryProductUnderContractsRoute_n3' and connects it to the exact finite block-composition entry interface. The compiled part is the index bridge: the signal-zero block entry is the full unitary entry at compound row and column '0', while the branch-local product has been calculated at the embedded sparse-slot basis index '32'. The missing field is now explicit: QBE still needs a branch-decomposition/projection theorem identifying the route's projected branch product with the finite signal-zero block entry before the product obligation can be promoted.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:13917. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.269●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryFiniteProjectionProductBridge : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryFiniteProjectionProductBridge : Type
Finite projection/product bridge packet for the focused boundary branch. This consumes `oneTermRobinGamma3BoundaryProductUnderContractsRoute_n3` and connects it to the exact finite block-composition entry interface. The compiled part is the index bridge: the signal-zero block entry is the full unitary entry at compound row and column `0`, while the branch-local product has been calculated at the embedded sparse-slot basis index `32`. The missing field is now explicit: QBE still needs a branch-decomposition/projection theorem identifying the route's projected branch product with the finite signal-zero block entry before the product obligation can be promoted.
Fields
sourceAnchor : String
productRoute : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProductUnderContractsRoute
focusedSystemRow : ℕ
focusedSystemColumn : ℕ
focusedSparseSlot : ℕ
signalIndexValue : ℕ
signalBlockRowIndex : ℕ
signalBlockColumnIndex : ℕ
branchBasisIndex : ℕ
signalBlockEntryFormula : String
branchProductEntryFormula : String
projectedBranchProduct : QuantumBlockEncoding.Coeff
expectedTargetEntry : QuantumBlockEncoding.Coeff
theoremNormalizer : QuantumBlockEncoding.Coeff
finiteBlockEntryIndexLemma : String
conditionalProductEvalLemma : String
absentProjectionField : String
productBridgeObligation : QuantumBlockEncoding.SemanticObligation
branchDecompositionObligation : QuantumBlockEncoding.SemanticObligation
finiteCompositionNormalizedEquality : QuantumBlockEncoding.SemanticObligation
signalBlockEntryObligation : QuantumBlockEncoding.SemanticObligation
productObligation : QuantumBlockEncoding.SemanticObligation
finiteBlockIndexCompiled : Bool
conditionalProductEvalCompiled : Bool
productRouteConsumed : Bool
branchBasisMatchesSignalBlockIndex : Bool
productBridgeProved : Bool
branchDecompositionProved : Bool
normalizedBlockEqualityProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
exactRemainingObstruction : String
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary finite projection product bridge n 3”. Compiled finite projection/product bridge for 'oneTermRobinGamma3ProductToCoefficientObligation 3 0 0'.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Compiled finite projection/product bridge for 'oneTermRobinGamma3ProductToCoefficientObligation 3 0 0'. The bridge deliberately does not assert that the branch-local product is the finite block entry. It records the exact indexing mismatch and names the missing branch-decomposition theorem as the current Lean-local obstruction.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:13963. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.270●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryFiniteProjectionProductBridge_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryFiniteProjectionProductBridge
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryFiniteProjectionProductBridge_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryFiniteProjectionProductBridge
Compiled finite projection/product bridge for `oneTermRobinGamma3ProductToCoefficientObligation 3 0 0`. The bridge deliberately does not assert that the branch-local product is the finite block entry. It records the exact indexing mismatch and names the missing branch-decomposition theorem as the current Lean-local obstruction.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary finite projection product bridge n 3 transcript”; its local proof does not by itself complete the broader paper route. Transcript theorem for the finite projection/product bridge packet.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Transcript theorem for the finite projection/product bridge packet. This checks that the bridge consumes the active product-under-contracts route, that the finite signal block uses row and column '0' while the focused branch uses basis index '32', and that all theorem-facing proof flags remain false.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:14036. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.271●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryFiniteProjectionProductBridge_n3_transcript : have bridge := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryFiniteProjectionProductBridge_n3; have productRoute := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProductUnderContractsRoute_n3; bridge.productRoute = productRoute ∧ bridge.focusedSystemRow = 0 ∧ bridge.focusedSystemColumn = 0 ∧ bridge.focusedSparseSlot = 2 ∧ bridge.signalIndexValue = 0 ∧ bridge.signalBlockRowIndex = 0 ∧ bridge.signalBlockColumnIndex = 0 ∧ bridge.branchBasisIndex = 32 ∧ bridge.signalBlockEntryFormula = "contract.expectedTarget.blockMatrix[0,0] = contract.expectedTarget.unitaryMatrix[0,0]" ∧ bridge.branchProductEntryFormula = "focused branch product was computed at full basis entry [32,32] before sparse-register projection/summation" ∧ bridge.projectedBranchProduct = productRoute.projectedBranchProduct ∧ bridge.expectedTargetEntry = productRoute.expectedTargetEntry ∧ bridge.theoremNormalizer = productRoute.theoremNormalizer ∧ bridge.finiteBlockEntryIndexLemma = "oneTermRobinGamma3BoundaryFiniteProjectionBlockEntryIndex_n3" ∧ bridge.conditionalProductEvalLemma = "oneTermRobinGamma3BoundaryProductUnderContractsEval_n3" ∧ bridge.absentProjectionField = "branch-decomposition/projection theorem identifying the route's projectedBranchProduct with the finite signal-zero block entry" ∧ bridge.productBridgeObligation = productRoute.productBridgeObligation ∧ bridge.branchDecompositionObligation.description = "provide the finite branch-decomposition/projection theorem from the slot-2 projected branch product to the signal-zero block entry (0,0)" ∧ bridge.branchDecompositionObligation.proved = false ∧ bridge.finiteCompositionNormalizedEquality = productRoute.finiteCompositionNormalizedEquality ∧ bridge.signalBlockEntryObligation = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3SignalBlockEntryObligation 3 ∧ bridge.productObligation = productRoute.productObligation ∧ bridge.finiteBlockIndexCompiled = true ∧ bridge.conditionalProductEvalCompiled = true ∧ bridge.productRouteConsumed = true ∧ bridge.branchBasisMatchesSignalBlockIndex = false ∧ bridge.productBridgeObligation.proved = false ∧ bridge.finiteCompositionNormalizedEquality.proved = false ∧ bridge.signalBlockEntryObligation.proved = false ∧ bridge.productObligation.proved = false ∧ bridge.productBridgeProved = false ∧ bridge.branchDecompositionProved = false ∧ bridge.normalizedBlockEqualityProved = false ∧ bridge.productToCoefficientProved = false ∧ bridge.lcuCorrectProved = false ∧ bridge.blockProjectionProved = false ∧ bridge.blockCorrectProved = false ∧ bridge.finalExtractionProved = false ∧ bridge.exactRemainingObstruction = "finite block index is compiled, but QBE still needs the branch-decomposition/projection theorem that sends the slot-2 projected branch product into the signal-zero block entry before oneTermRobinGamma3ProductToCoefficientObligation 3 0 0 can be proved"
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryFiniteProjectionProductBridge_n3_transcript : have bridge := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryFiniteProjectionProductBridge_n3; have productRoute := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProductUnderContractsRoute_n3; bridge.productRoute = productRoute ∧ bridge.focusedSystemRow = 0 ∧ bridge.focusedSystemColumn = 0 ∧ bridge.focusedSparseSlot = 2 ∧ bridge.signalIndexValue = 0 ∧ bridge.signalBlockRowIndex = 0 ∧ bridge.signalBlockColumnIndex = 0 ∧ bridge.branchBasisIndex = 32 ∧ bridge.signalBlockEntryFormula = "contract.expectedTarget.blockMatrix[0,0] = contract.expectedTarget.unitaryMatrix[0,0]" ∧ bridge.branchProductEntryFormula = "focused branch product was computed at full basis entry [32,32] before sparse-register projection/summation" ∧ bridge.projectedBranchProduct = productRoute.projectedBranchProduct ∧ bridge.expectedTargetEntry = productRoute.expectedTargetEntry ∧ bridge.theoremNormalizer = productRoute.theoremNormalizer ∧ bridge.finiteBlockEntryIndexLemma = "oneTermRobinGamma3BoundaryFiniteProjectionBlockEntryIndex_n3" ∧ bridge.conditionalProductEvalLemma = "oneTermRobinGamma3BoundaryProductUnderContractsEval_n3" ∧ bridge.absentProjectionField = "branch-decomposition/projection theorem identifying the route's projectedBranchProduct with the finite signal-zero block entry" ∧ bridge.productBridgeObligation = productRoute.productBridgeObligation ∧ bridge.branchDecompositionObligation.description = "provide the finite branch-decomposition/projection theorem from the slot-2 projected branch product to the signal-zero block entry (0,0)" ∧ bridge.branchDecompositionObligation.proved = false ∧ bridge.finiteCompositionNormalizedEquality = productRoute.finiteCompositionNormalizedEquality ∧ bridge.signalBlockEntryObligation = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3SignalBlockEntryObligation 3 ∧ bridge.productObligation = productRoute.productObligation ∧ bridge.finiteBlockIndexCompiled = true ∧ bridge.conditionalProductEvalCompiled = true ∧ bridge.productRouteConsumed = true ∧ bridge.branchBasisMatchesSignalBlockIndex = false ∧ bridge.productBridgeObligation.proved = false ∧ bridge.finiteCompositionNormalizedEquality.proved = false ∧ bridge.signalBlockEntryObligation.proved = false ∧ bridge.productObligation.proved = false ∧ bridge.productBridgeProved = false ∧ bridge.branchDecompositionProved = false ∧ bridge.normalizedBlockEqualityProved = false ∧ bridge.productToCoefficientProved = false ∧ bridge.lcuCorrectProved = false ∧ bridge.blockProjectionProved = false ∧ bridge.blockCorrectProved = false ∧ bridge.finalExtractionProved = false ∧ bridge.exactRemainingObstruction = "finite block index is compiled, but QBE still needs the branch-decomposition/projection theorem that sends the slot-2 projected branch product into the signal-zero block entry before oneTermRobinGamma3ProductToCoefficientObligation 3 0 0 can be proved"
Transcript theorem for the finite projection/product bridge packet. This checks that the bridge consumes the active product-under-contracts route, that the finite signal block uses row and column `0` while the focused branch uses basis index `32`, and that all theorem-facing proof flags remain false.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary branch decomposition slot 2”. A proposition-valued field is a requirement until a constructor supplies it. Branch-decomposition interface for the focused slot-'2' boundary product.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Branch-decomposition interface for the focused slot-'2' boundary product. The finite projection bridge proves only the index fact: Definition 'def:block-encoding' reads the signal-zero block entry at full '[0,0]', while the branch-local route is attached to the embedded sparse-slot entry '[32,32]'. This packet names the missing finite theorem that must decompose the signal-zero entry into sparse-branch contributions and identify the slot-'2' contribution with the route's projected branch product. It is an obstruction/interface record, not a proof of the branch sum. All theorem-facing proof flags therefore remain false.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:14112. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.272●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBranchDecompositionSlot2 : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBranchDecompositionSlot2 : Type
Branch-decomposition interface for the focused slot-`2` boundary product. The finite projection bridge proves only the index fact: Definition `def:block-encoding` reads the signal-zero block entry at full `[0,0]`, while the branch-local route is attached to the embedded sparse-slot entry `[32,32]`. This packet names the missing finite theorem that must decompose the signal-zero entry into sparse-branch contributions and identify the slot-`2` contribution with the route's projected branch product. It is an obstruction/interface record, not a proof of the branch sum. All theorem-facing proof flags therefore remain false.
Fields
sourceAnchor : String
finiteBridge : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryFiniteProjectionProductBridge
focusedSystemRow : ℕ
focusedSystemColumn : ℕ
focusedSparseSlot : ℕ
signalBlockRowIndex : ℕ
signalBlockColumnIndex : ℕ
branchRowIndex : ℕ
branchColumnIndex : ℕ
signalBlockEntryFormula : String
branchProductEntryFormula : String
branchSumProjectionFormula : String
requiredProjectionSummationTheorem : String
absentProjectionField : String
projectedBranchProduct : QuantumBlockEncoding.Coeff
expectedTargetEntry : QuantumBlockEncoding.Coeff
theoremNormalizer : QuantumBlockEncoding.Coeff
finiteBlockEntryIndexLemma : String
conditionalProductEvalLemma : String
productBridgeObligation : QuantumBlockEncoding.SemanticObligation
branchDecompositionObligation : QuantumBlockEncoding.SemanticObligation
projectionSummationObligation : QuantumBlockEncoding.SemanticObligation
finiteCompositionNormalizedEquality : QuantumBlockEncoding.SemanticObligation
signalBlockEntryObligation : QuantumBlockEncoding.SemanticObligation
productObligation : QuantumBlockEncoding.SemanticObligation
branchDecompositionInterfaceCompiled : Bool
finiteIndexCompiled : Bool
conditionalProductEvalCompiled : Bool
productRouteConsumed : Bool
signalBlockEntryMatchesBranchEntry : Bool
projectionSummationProved : Bool
productBridgeProved : Bool
branchDecompositionProved : Bool
normalizedBlockEqualityProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
exactRemainingObstruction : String
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary branch decomposition slot 2 n 3”. Compiled branch-decomposition interface for the fixed boundary branch.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Compiled branch-decomposition interface for the fixed boundary branch. The record consumes 'oneTermRobinGamma3BoundaryFiniteProjectionProductBridge_n3' and makes the next missing theorem precise: QBE needs a finite branch-sum or projection-summation theorem that sends the slot-'2' projected branch product at '[32,32]' into the signal-zero block entry '[0,0]'. No semantic flag is promoted.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:14164. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.273●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchDecompositionSlot2_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBranchDecompositionSlot2
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchDecompositionSlot2_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBranchDecompositionSlot2
Compiled branch-decomposition interface for the fixed boundary branch. The record consumes `oneTermRobinGamma3BoundaryFiniteProjectionProductBridge_n3` and makes the next missing theorem precise: QBE needs a finite branch-sum or projection-summation theorem that sends the slot-`2` projected branch product at `[32,32]` into the signal-zero block entry `[0,0]`. No semantic flag is promoted.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary branch decomposition slot 2 n 3 transcript”; its local proof does not by itself complete the broader paper route. Transcript theorem for the slot-'2' branch-decomposition interface.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Transcript theorem for the slot-'2' branch-decomposition interface. The theorem checks that the packet starts from the finite projection bridge, keeps the signal-zero entry '[0,0]' separate from the branch-local entry '[32,32]', and leaves the projection-summation theorem and all semantic flags false.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:14231. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.274●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchDecompositionSlot2_n3_transcript : have packet := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchDecompositionSlot2_n3; have bridge := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryFiniteProjectionProductBridge_n3; packet.finiteBridge = bridge ∧ packet.focusedSystemRow = 0 ∧ packet.focusedSystemColumn = 0 ∧ packet.focusedSparseSlot = 2 ∧ packet.signalBlockRowIndex = 0 ∧ packet.signalBlockColumnIndex = 0 ∧ packet.branchRowIndex = 32 ∧ packet.branchColumnIndex = 32 ∧ packet.signalBlockEntryFormula = "contract.expectedTarget.blockMatrix[0,0] = contract.expectedTarget.unitaryMatrix[0,0]" ∧ packet.branchProductEntryFormula = "focused branch product was computed at full basis entry [32,32] before sparse-register projection/summation" ∧ packet.branchSumProjectionFormula = "signal-zero entry [0,0] must be expanded as the sparse-branch projection/summation whose slot-2 contribution is the branch product at [32,32]" ∧ packet.requiredProjectionSummationTheorem = "finite branch-decomposition/projection theorem: slot-2 projectedBranchProduct at [32,32] contributes to contract.expectedTarget.blockMatrix[0,0]" ∧ packet.absentProjectionField = "branch-decomposition/projection theorem identifying the route's projectedBranchProduct with the finite signal-zero block entry" ∧ packet.projectedBranchProduct = bridge.projectedBranchProduct ∧ packet.expectedTargetEntry = bridge.expectedTargetEntry ∧ packet.theoremNormalizer = bridge.theoremNormalizer ∧ packet.finiteBlockEntryIndexLemma = "oneTermRobinGamma3BoundaryFiniteProjectionBlockEntryIndex_n3" ∧ packet.conditionalProductEvalLemma = "oneTermRobinGamma3BoundaryProductUnderContractsEval_n3" ∧ packet.productBridgeObligation = bridge.productBridgeObligation ∧ packet.branchDecompositionObligation = bridge.branchDecompositionObligation ∧ packet.projectionSummationObligation.description = "state and prove the finite projection/summation theorem from slot-2 branch product [32,32] to signal-zero block entry [0,0]" ∧ packet.projectionSummationObligation.proved = false ∧ packet.finiteCompositionNormalizedEquality = bridge.finiteCompositionNormalizedEquality ∧ packet.signalBlockEntryObligation = bridge.signalBlockEntryObligation ∧ packet.productObligation = bridge.productObligation ∧ packet.branchDecompositionInterfaceCompiled = true ∧ packet.finiteIndexCompiled = true ∧ packet.conditionalProductEvalCompiled = true ∧ packet.productRouteConsumed = true ∧ packet.signalBlockEntryMatchesBranchEntry = false ∧ packet.projectionSummationProved = false ∧ packet.productBridgeObligation.proved = false ∧ packet.branchDecompositionObligation.proved = false ∧ packet.finiteCompositionNormalizedEquality.proved = false ∧ packet.signalBlockEntryObligation.proved = false ∧ packet.productObligation.proved = false ∧ packet.productBridgeProved = false ∧ packet.branchDecompositionProved = false ∧ packet.normalizedBlockEqualityProved = false ∧ packet.productToCoefficientProved = false ∧ packet.lcuCorrectProved = false ∧ packet.blockProjectionProved = false ∧ packet.blockCorrectProved = false ∧ packet.finalExtractionProved = false ∧ packet.exactRemainingObstruction = "missing finite branch-decomposition/projection-summation theorem identifying the slot-2 projected branch product [32,32] with its contribution to the signal-zero block entry [0,0]"
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchDecompositionSlot2_n3_transcript : have packet := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchDecompositionSlot2_n3; have bridge := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryFiniteProjectionProductBridge_n3; packet.finiteBridge = bridge ∧ packet.focusedSystemRow = 0 ∧ packet.focusedSystemColumn = 0 ∧ packet.focusedSparseSlot = 2 ∧ packet.signalBlockRowIndex = 0 ∧ packet.signalBlockColumnIndex = 0 ∧ packet.branchRowIndex = 32 ∧ packet.branchColumnIndex = 32 ∧ packet.signalBlockEntryFormula = "contract.expectedTarget.blockMatrix[0,0] = contract.expectedTarget.unitaryMatrix[0,0]" ∧ packet.branchProductEntryFormula = "focused branch product was computed at full basis entry [32,32] before sparse-register projection/summation" ∧ packet.branchSumProjectionFormula = "signal-zero entry [0,0] must be expanded as the sparse-branch projection/summation whose slot-2 contribution is the branch product at [32,32]" ∧ packet.requiredProjectionSummationTheorem = "finite branch-decomposition/projection theorem: slot-2 projectedBranchProduct at [32,32] contributes to contract.expectedTarget.blockMatrix[0,0]" ∧ packet.absentProjectionField = "branch-decomposition/projection theorem identifying the route's projectedBranchProduct with the finite signal-zero block entry" ∧ packet.projectedBranchProduct = bridge.projectedBranchProduct ∧ packet.expectedTargetEntry = bridge.expectedTargetEntry ∧ packet.theoremNormalizer = bridge.theoremNormalizer ∧ packet.finiteBlockEntryIndexLemma = "oneTermRobinGamma3BoundaryFiniteProjectionBlockEntryIndex_n3" ∧ packet.conditionalProductEvalLemma = "oneTermRobinGamma3BoundaryProductUnderContractsEval_n3" ∧ packet.productBridgeObligation = bridge.productBridgeObligation ∧ packet.branchDecompositionObligation = bridge.branchDecompositionObligation ∧ packet.projectionSummationObligation.description = "state and prove the finite projection/summation theorem from slot-2 branch product [32,32] to signal-zero block entry [0,0]" ∧ packet.projectionSummationObligation.proved = false ∧ packet.finiteCompositionNormalizedEquality = bridge.finiteCompositionNormalizedEquality ∧ packet.signalBlockEntryObligation = bridge.signalBlockEntryObligation ∧ packet.productObligation = bridge.productObligation ∧ packet.branchDecompositionInterfaceCompiled = true ∧ packet.finiteIndexCompiled = true ∧ packet.conditionalProductEvalCompiled = true ∧ packet.productRouteConsumed = true ∧ packet.signalBlockEntryMatchesBranchEntry = false ∧ packet.projectionSummationProved = false ∧ packet.productBridgeObligation.proved = false ∧ packet.branchDecompositionObligation.proved = false ∧ packet.finiteCompositionNormalizedEquality.proved = false ∧ packet.signalBlockEntryObligation.proved = false ∧ packet.productObligation.proved = false ∧ packet.productBridgeProved = false ∧ packet.branchDecompositionProved = false ∧ packet.normalizedBlockEqualityProved = false ∧ packet.productToCoefficientProved = false ∧ packet.lcuCorrectProved = false ∧ packet.blockProjectionProved = false ∧ packet.blockCorrectProved = false ∧ packet.finalExtractionProved = false ∧ packet.exactRemainingObstruction = "missing finite branch-decomposition/projection-summation theorem identifying the slot-2 projected branch product [32,32] with its contribution to the signal-zero block entry [0,0]"
Transcript theorem for the slot-`2` branch-decomposition interface. The theorem checks that the packet starts from the finite projection bridge, keeps the signal-zero entry `[0,0]` separate from the branch-local entry `[32,32]`, and leaves the projection-summation theorem and all semantic flags false.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary projection summation target”. A proposition-valued field is a requirement until a constructor supplies it. Typed projection-summation target for the focused slot-'2' boundary packet.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Typed projection-summation target for the focused slot-'2' boundary packet. The earlier branch-decomposition record names the missing theorem in prose. This target exposes the actual coefficient objects that the theorem must relate: the signal-zero block entry selected by Definition 'def:block-encoding' and the compiled branch-local seven-gate matrix entry at '[32,32]'. The record does not assert that these entries are equal or that the branch contribution has already been summed into the signal-zero block.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:14308. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.275●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProjectionSummationTarget : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProjectionSummationTarget : Type
Typed projection-summation target for the focused slot-`2` boundary packet. The earlier branch-decomposition record names the missing theorem in prose. This target exposes the actual coefficient objects that the theorem must relate: the signal-zero block entry selected by Definition `def:block-encoding` and the compiled branch-local seven-gate matrix entry at `[32,32]`. The record does not assert that these entries are equal or that the branch contribution has already been summed into the signal-zero block.
Fields
sourceAnchor : String
branchPacket : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBranchDecompositionSlot2
focusedSystemRow : ℕ
focusedSystemColumn : ℕ
focusedSparseSlot : ℕ
signalBlockRowIndex : ℕ
signalBlockColumnIndex : ℕ
branchRowIndex : ℕ
branchColumnIndex : ℕ
signalBlockEntry : QuantumBlockEncoding.Coeff
signalUnitaryEntry : QuantumBlockEncoding.Coeff
branchMatrixEntry : QuantumBlockEncoding.Coeff
projectedBranchProduct : QuantumBlockEncoding.Coeff
expectedTargetEntry : QuantumBlockEncoding.Coeff
theoremNormalizer : QuantumBlockEncoding.Coeff
signalBlockEntryFormula : String
signalUnitaryEntryFormula : String
branchMatrixEntryFormula : String
projectionSummationStatement : String
signalBlockEntryEqualityLemma : String
branchEntryEvalLemma : String
requiredBranchEntrySelectionTheorem : String
missingProjectionSummationField : String
projectionSummationObligation : QuantumBlockEncoding.SemanticObligation
branchEntrySelectionObligation : QuantumBlockEncoding.SemanticObligation
productBridgeObligation : QuantumBlockEncoding.SemanticObligation
finiteCompositionNormalizedEquality : QuantumBlockEncoding.SemanticObligation
productObligation : QuantumBlockEncoding.SemanticObligation
typedProjectionSummationTargetCompiled : Bool
signalBlockEntryTyped : Bool
branchMatrixEntryTyped : Bool
branchEntrySelectionProved : Bool
projectionSummationProved : Bool
productBridgeProved : Bool
normalizedBlockEqualityProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
exactRemainingObstruction : String
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary projection summation target n 3”. Compiled typed target for the missing branch projection/summation theorem.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Compiled typed target for the missing branch projection/summation theorem. The signal-zero block entry is taken from the finite block-composition contract, while the branch entry is the local seven-gate boundary matrix entry at the slot-'2' basis index. The missing theorem is now a typed bridge between these two 'Coeff' objects rather than only a string-level obligation.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:14360. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.276●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSummationTarget_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProjectionSummationTarget
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSummationTarget_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProjectionSummationTarget
Compiled typed target for the missing branch projection/summation theorem. The signal-zero block entry is taken from the finite block-composition contract, while the branch entry is the local seven-gate boundary matrix entry at the slot-`2` basis index. The missing theorem is now a typed bridge between these two `Coeff` objects rather than only a string-level obligation.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary projection summation target n 3 transcript”; its local proof does not by itself complete the broader paper route. Transcript theorem for the typed projection-summation target.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Transcript theorem for the typed projection-summation target. The theorem checks that the target keeps the signal block entry '[0,0]' and the branch matrix entry '[32,32]' as typed coefficient objects, names the existing evaluation lemma, and leaves branch selection, projection-summation, normalized equality, and product-to-coefficient flags false.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:14467. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.277●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSummationTarget_n3_transcript : have target := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSummationTarget_n3; have packet := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchDecompositionSlot2_n3; target.branchPacket = packet ∧ target.focusedSystemRow = packet.focusedSystemRow ∧ target.focusedSystemColumn = packet.focusedSystemColumn ∧ target.focusedSparseSlot = packet.focusedSparseSlot ∧ target.signalBlockEntryFormula = "contract.expectedTarget.blockMatrix[0,0]" ∧ target.signalUnitaryEntryFormula = "contract.expectedTarget.unitaryMatrix[0,0]" ∧ target.branchMatrixEntryFormula = "oneTermRobinGamma3BoundarySevenGateMatrix_n3[32,32]" ∧ target.projectionSummationStatement = "prove that the sparse-register projection/summation sends the selected slot-2 branch contribution into the signal-zero block entry" ∧ target.signalBlockEntryEqualityLemma = "oneTermRobinGamma3BoundaryProjectionSummationTarget_blockEntry_eq_unitary_n3" ∧ target.branchEntryEvalLemma = "oneTermRobinBlockEncodingProofRoute_gamma3BoundaryProductEntryEval_n3" ∧ target.requiredBranchEntrySelectionTheorem = "branch-matrix entry [32,32] evaluates to the projectedBranchProduct used by the product route under the explicit coefficient contracts" ∧ target.missingProjectionSummationField = "finite matrix semantics field expanding contract.expectedTarget.blockMatrix[0,0] as the sparse-branch sum and selecting slot 2" ∧ target.projectionSummationObligation = packet.projectionSummationObligation ∧ target.projectionSummationObligation.proved = false ∧ target.branchEntrySelectionObligation.description = "connect the typed branch matrix entry oneTermRobinGamma3BoundarySevenGateMatrix_n3[32,32] to projectedBranchProduct under the existing coefficient contracts" ∧ target.branchEntrySelectionObligation.proved = false ∧ target.productBridgeObligation = packet.productBridgeObligation ∧ target.finiteCompositionNormalizedEquality = packet.finiteCompositionNormalizedEquality ∧ target.productObligation = packet.productObligation ∧ target.typedProjectionSummationTargetCompiled = true ∧ target.signalBlockEntryTyped = true ∧ target.branchMatrixEntryTyped = true ∧ target.branchEntrySelectionProved = false ∧ target.projectionSummationProved = false ∧ target.productBridgeProved = false ∧ target.normalizedBlockEqualityProved = false ∧ target.productToCoefficientProved = false ∧ target.lcuCorrectProved = false ∧ target.blockProjectionProved = false ∧ target.blockCorrectProved = false ∧ target.finalExtractionProved = false ∧ target.productBridgeObligation.proved = false ∧ target.finiteCompositionNormalizedEquality.proved = false ∧ target.productObligation.proved = false ∧ target.exactRemainingObstruction = "typed signal block entry and branch matrix entry are exposed, but QBE still lacks the projection/summation theorem selecting the slot-2 contribution in contract.expectedTarget.blockMatrix[0,0]"
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSummationTarget_n3_transcript : have target := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSummationTarget_n3; have packet := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchDecompositionSlot2_n3; target.branchPacket = packet ∧ target.focusedSystemRow = packet.focusedSystemRow ∧ target.focusedSystemColumn = packet.focusedSystemColumn ∧ target.focusedSparseSlot = packet.focusedSparseSlot ∧ target.signalBlockEntryFormula = "contract.expectedTarget.blockMatrix[0,0]" ∧ target.signalUnitaryEntryFormula = "contract.expectedTarget.unitaryMatrix[0,0]" ∧ target.branchMatrixEntryFormula = "oneTermRobinGamma3BoundarySevenGateMatrix_n3[32,32]" ∧ target.projectionSummationStatement = "prove that the sparse-register projection/summation sends the selected slot-2 branch contribution into the signal-zero block entry" ∧ target.signalBlockEntryEqualityLemma = "oneTermRobinGamma3BoundaryProjectionSummationTarget_blockEntry_eq_unitary_n3" ∧ target.branchEntryEvalLemma = "oneTermRobinBlockEncodingProofRoute_gamma3BoundaryProductEntryEval_n3" ∧ target.requiredBranchEntrySelectionTheorem = "branch-matrix entry [32,32] evaluates to the projectedBranchProduct used by the product route under the explicit coefficient contracts" ∧ target.missingProjectionSummationField = "finite matrix semantics field expanding contract.expectedTarget.blockMatrix[0,0] as the sparse-branch sum and selecting slot 2" ∧ target.projectionSummationObligation = packet.projectionSummationObligation ∧ target.projectionSummationObligation.proved = false ∧ target.branchEntrySelectionObligation.description = "connect the typed branch matrix entry oneTermRobinGamma3BoundarySevenGateMatrix_n3[32,32] to projectedBranchProduct under the existing coefficient contracts" ∧ target.branchEntrySelectionObligation.proved = false ∧ target.productBridgeObligation = packet.productBridgeObligation ∧ target.finiteCompositionNormalizedEquality = packet.finiteCompositionNormalizedEquality ∧ target.productObligation = packet.productObligation ∧ target.typedProjectionSummationTargetCompiled = true ∧ target.signalBlockEntryTyped = true ∧ target.branchMatrixEntryTyped = true ∧ target.branchEntrySelectionProved = false ∧ target.projectionSummationProved = false ∧ target.productBridgeProved = false ∧ target.normalizedBlockEqualityProved = false ∧ target.productToCoefficientProved = false ∧ target.lcuCorrectProved = false ∧ target.blockProjectionProved = false ∧ target.blockCorrectProved = false ∧ target.finalExtractionProved = false ∧ target.productBridgeObligation.proved = false ∧ target.finiteCompositionNormalizedEquality.proved = false ∧ target.productObligation.proved = false ∧ target.exactRemainingObstruction = "typed signal block entry and branch matrix entry are exposed, but QBE still lacks the projection/summation theorem selecting the slot-2 contribution in contract.expectedTarget.blockMatrix[0,0]"
Transcript theorem for the typed projection-summation target. The theorem checks that the target keeps the signal block entry `[0,0]` and the branch matrix entry `[32,32]` as typed coefficient objects, names the existing evaluation lemma, and leaves branch selection, projection-summation, normalized equality, and product-to-coefficient flags false.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary branch entry selection”. A proposition-valued field is a requirement until a constructor supplies it. Conditional branch-entry selection packet for the focused slot-'2' boundary target.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Conditional branch-entry selection packet for the focused slot-'2' boundary target. The selected local branch entry is the seven-gate matrix entry at '[32,32]'. The route's 'projectedBranchProduct' already includes the two sparse-register projection amplitudes, so the compiled theorem below multiplies the selected branch entry by the existing projection-amplitude factor. The theorem is still conditional on the corrected boundary-rotation entry; it does not prove the projection/summation theorem from the signal-zero block entry '[0,0]'.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:14537. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.278●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBranchEntrySelection : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBranchEntrySelection : Type
Conditional branch-entry selection packet for the focused slot-`2` boundary target. The selected local branch entry is the seven-gate matrix entry at `[32,32]`. The route's `projectedBranchProduct` already includes the two sparse-register projection amplitudes, so the compiled theorem below multiplies the selected branch entry by the existing projection-amplitude factor. The theorem is still conditional on the corrected boundary-rotation entry; it does not prove the projection/summation theorem from the signal-zero block entry `[0,0]`.
Fields
sourceAnchor : String
projectionTarget : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProjectionSummationTarget
focusedSparseSlot : ℕ
branchRowIndex : ℕ
branchColumnIndex : ℕ
projectionAmplitudeFactor : QuantumBlockEncoding.Coeff
selectedBranchEntryFormula : String
routeProjectedProductFormula : String
correctedEntryHypothesis : QuantumBlockEncoding.SemanticObligation
ketAmplitudeObligation : QuantumBlockEncoding.SemanticObligation
braAmplitudeObligation : QuantumBlockEncoding.SemanticObligation
branchEntrySelectionObligation : QuantumBlockEncoding.SemanticObligation
projectionSummationObligation : QuantumBlockEncoding.SemanticObligation
productBridgeObligation : QuantumBlockEncoding.SemanticObligation
finiteCompositionNormalizedEquality : QuantumBlockEncoding.SemanticObligation
productObligation : QuantumBlockEncoding.SemanticObligation
conditionalBranchEntrySelectionLemma : String
conditionalBranchEntrySelectionCompiled : Bool
branchEntrySelectionProved : Bool
projectionSummationProved : Bool
productBridgeProved : Bool
normalizedBlockEqualityProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
exactRemainingObstruction : String
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary branch entry selection n 3”. Compiled branch-entry selection interface for the focused projection target.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Compiled branch-entry selection interface for the focused projection target. This packet reuses the typed projection-summation target and records the conditional local theorem that selects the branch entry '[32,32]' and feeds it to the route product after the sparse-register projection-amplitude factor is attached. All source obligations and theorem-facing flags remain false.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:14576. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.279●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchEntrySelection_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBranchEntrySelection
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchEntrySelection_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBranchEntrySelection
Compiled branch-entry selection interface for the focused projection target. This packet reuses the typed projection-summation target and records the conditional local theorem that selects the branch entry `[32,32]` and feeds it to the route product after the sparse-register projection-amplitude factor is attached. All source obligations and theorem-facing flags remain false.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary branch entry selection eval n 3”; its local proof does not by itself complete the broader paper route. Conditional branch-entry selection for the focused projection target.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Conditional branch-entry selection for the focused projection target. Under the corrected 'Ry_boundary' entry hypothesis, the selected seven-gate entry '[32,32]', multiplied by the existing sparse-register projection amplitude factor, evaluates to the route's typed 'projectedBranchProduct'. This is not the signal-block projection/summation theorem.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:14626. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.280●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchEntrySelectionEval_n3 (env : String → ℚ) (hentry : env "boundary_cos_half_0_2" = QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.GHL2025.boundaryRotationNormalizedCoefficient (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3) 0 2)) : have selection := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchEntrySelection_n3; QuantumBlockEncoding.Coeff.evalWith env ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySevenGateMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3).mul selection.projectionAmplitudeFactor) = QuantumBlockEncoding.Coeff.evalWith env selection.projectionTarget.projectedBranchProduct
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchEntrySelectionEval_n3 (env : String → ℚ) (hentry : env "boundary_cos_half_0_2" = QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.GHL2025.boundaryRotationNormalizedCoefficient (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3) 0 2)) : have selection := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchEntrySelection_n3; QuantumBlockEncoding.Coeff.evalWith env ((QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySevenGateMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3).mul selection.projectionAmplitudeFactor) = QuantumBlockEncoding.Coeff.evalWith env selection.projectionTarget.projectedBranchProduct
Conditional branch-entry selection for the focused projection target. Under the corrected `Ry_boundary` entry hypothesis, the selected seven-gate entry `[32,32]`, multiplied by the existing sparse-register projection amplitude factor, evaluates to the route's typed `projectedBranchProduct`. This is not the signal-block projection/summation theorem.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary branch entry selection n 3 transcript”; its local proof does not by itself complete the broader paper route. Transcript theorem for the branch-entry selection packet.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Transcript theorem for the branch-entry selection packet. The theorem records the new conditional local lemma and checks that the actual branch-entry selection, projection/summation, product bridge, normalized equality, and product-to-coefficient obligations remain unproved.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:14666. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.281●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchEntrySelection_n3_transcript : have selection := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchEntrySelection_n3; have target := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSummationTarget_n3; selection.projectionTarget = target ∧ selection.focusedSparseSlot = 2 ∧ selection.branchRowIndex = 32 ∧ selection.branchColumnIndex = 32 ∧ selection.projectionAmplitudeFactor = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionAmplitudeSemantics_n3.combinedAmplitudeFactor ∧ selection.projectionAmplitudeFactor = (QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv").mul (QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv") ∧ selection.selectedBranchEntryFormula = "eval(oneTermRobinGamma3BoundarySevenGateMatrix_n3[32,32] * sqrt_kappa_inv*sqrt_kappa_inv)" ∧ selection.routeProjectedProductFormula = "eval(projectedBranchProduct) for oneTermRobinGamma3BoundaryProjectionSummationTarget_n3" ∧ selection.correctedEntryHypothesis = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCorrectedCoefficientInterface_n3.correctedEntryHypothesis ∧ selection.correctedEntryHypothesis.proved = false ∧ selection.ketAmplitudeObligation = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionAmplitudeSemantics_n3.uniformPreparationObligation ∧ selection.ketAmplitudeObligation.proved = false ∧ selection.braAmplitudeObligation = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionAmplitudeSemantics_n3.braAmplitudeObligation ∧ selection.braAmplitudeObligation.proved = false ∧ selection.branchEntrySelectionObligation = target.branchEntrySelectionObligation ∧ selection.projectionSummationObligation = target.projectionSummationObligation ∧ selection.productBridgeObligation = target.productBridgeObligation ∧ selection.finiteCompositionNormalizedEquality = target.finiteCompositionNormalizedEquality ∧ selection.productObligation = target.productObligation ∧ selection.conditionalBranchEntrySelectionLemma = "oneTermRobinGamma3BoundaryBranchEntrySelectionEval_n3" ∧ selection.conditionalBranchEntrySelectionCompiled = true ∧ selection.branchEntrySelectionObligation.proved = false ∧ selection.projectionSummationObligation.proved = false ∧ selection.productBridgeObligation.proved = false ∧ selection.finiteCompositionNormalizedEquality.proved = false ∧ selection.productObligation.proved = false ∧ selection.branchEntrySelectionProved = false ∧ selection.projectionSummationProved = false ∧ selection.productBridgeProved = false ∧ selection.normalizedBlockEqualityProved = false ∧ selection.productToCoefficientProved = false ∧ selection.lcuCorrectProved = false ∧ selection.blockProjectionProved = false ∧ selection.blockCorrectProved = false ∧ selection.finalExtractionProved = false ∧ selection.exactRemainingObstruction = "conditional branch-entry selection is compiled, but the corrected Ry entry, sparse-register amplitudes, and signal-block projection/summation theorem remain obligations"
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchEntrySelection_n3_transcript : have selection := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchEntrySelection_n3; have target := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSummationTarget_n3; selection.projectionTarget = target ∧ selection.focusedSparseSlot = 2 ∧ selection.branchRowIndex = 32 ∧ selection.branchColumnIndex = 32 ∧ selection.projectionAmplitudeFactor = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionAmplitudeSemantics_n3.combinedAmplitudeFactor ∧ selection.projectionAmplitudeFactor = (QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv").mul (QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv") ∧ selection.selectedBranchEntryFormula = "eval(oneTermRobinGamma3BoundarySevenGateMatrix_n3[32,32] * sqrt_kappa_inv*sqrt_kappa_inv)" ∧ selection.routeProjectedProductFormula = "eval(projectedBranchProduct) for oneTermRobinGamma3BoundaryProjectionSummationTarget_n3" ∧ selection.correctedEntryHypothesis = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryCorrectedCoefficientInterface_n3.correctedEntryHypothesis ∧ selection.correctedEntryHypothesis.proved = false ∧ selection.ketAmplitudeObligation = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionAmplitudeSemantics_n3.uniformPreparationObligation ∧ selection.ketAmplitudeObligation.proved = false ∧ selection.braAmplitudeObligation = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionAmplitudeSemantics_n3.braAmplitudeObligation ∧ selection.braAmplitudeObligation.proved = false ∧ selection.branchEntrySelectionObligation = target.branchEntrySelectionObligation ∧ selection.projectionSummationObligation = target.projectionSummationObligation ∧ selection.productBridgeObligation = target.productBridgeObligation ∧ selection.finiteCompositionNormalizedEquality = target.finiteCompositionNormalizedEquality ∧ selection.productObligation = target.productObligation ∧ selection.conditionalBranchEntrySelectionLemma = "oneTermRobinGamma3BoundaryBranchEntrySelectionEval_n3" ∧ selection.conditionalBranchEntrySelectionCompiled = true ∧ selection.branchEntrySelectionObligation.proved = false ∧ selection.projectionSummationObligation.proved = false ∧ selection.productBridgeObligation.proved = false ∧ selection.finiteCompositionNormalizedEquality.proved = false ∧ selection.productObligation.proved = false ∧ selection.branchEntrySelectionProved = false ∧ selection.projectionSummationProved = false ∧ selection.productBridgeProved = false ∧ selection.normalizedBlockEqualityProved = false ∧ selection.productToCoefficientProved = false ∧ selection.lcuCorrectProved = false ∧ selection.blockProjectionProved = false ∧ selection.blockCorrectProved = false ∧ selection.finalExtractionProved = false ∧ selection.exactRemainingObstruction = "conditional branch-entry selection is compiled, but the corrected Ry entry, sparse-register amplitudes, and signal-block projection/summation theorem remain obligations"
Transcript theorem for the branch-entry selection packet. The theorem records the new conditional local lemma and checks that the actual branch-entry selection, projection/summation, product bridge, normalized equality, and product-to-coefficient obligations remain unproved.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary projection summation obstruction”. A proposition-valued field is a requirement until a constructor supplies it. Typed obstruction for the remaining finite projection/summation step.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Typed obstruction for the remaining finite projection/summation step. The selected slot-'2' contribution is now a concrete 'Coeff': the branch-local entry '[32,32]' multiplied by the two sparse-register projection amplitudes. What QBE still lacks is a finite matrix-semantics field that presents the signal-zero entry '[0,0]' as a sum over sparse-branch contributions and then selects the slot-'2' summand. This record names that missing field without asserting the sum.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:14739. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.282●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProjectionSummationObstruction : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProjectionSummationObstruction : Type
Typed obstruction for the remaining finite projection/summation step. The selected slot-`2` contribution is now a concrete `Coeff`: the branch-local entry `[32,32]` multiplied by the two sparse-register projection amplitudes. What QBE still lacks is a finite matrix-semantics field that presents the signal-zero entry `[0,0]` as a sum over sparse-branch contributions and then selects the slot-`2` summand. This record names that missing field without asserting the sum.
Fields
sourceAnchor : String
branchEntrySelection : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBranchEntrySelection
projectionTarget : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProjectionSummationTarget
slotDomain : List ℕ
slotDomainCardinality : ℕ
focusedSparseSlot : ℕ
focusedSlotInDomain : Bool
signalBlockEntry : QuantumBlockEncoding.Coeff
selectedBranchEntry : QuantumBlockEncoding.Coeff
projectionAmplitudeFactor : QuantumBlockEncoding.Coeff
selectedSlotContribution : QuantumBlockEncoding.Coeff
selectedSlotContributionFormula : String
sparseBranchSumFormula : String
branchContributionFamilyInterface : String
requiredBranchContributionField : String
requiredSelectedSlotTheorem : String
requiredProjectionSummationTheorem : String
branchEntrySelectionLemma : String
selectedSlotEvalLemma : String
correctedEntryHypothesis : QuantumBlockEncoding.SemanticObligation
ketAmplitudeObligation : QuantumBlockEncoding.SemanticObligation
braAmplitudeObligation : QuantumBlockEncoding.SemanticObligation
projectionSummationObligation : QuantumBlockEncoding.SemanticObligation
productBridgeObligation : QuantumBlockEncoding.SemanticObligation
finiteCompositionNormalizedEquality : QuantumBlockEncoding.SemanticObligation
productObligation : QuantumBlockEncoding.SemanticObligation
typedInterfaceCompiled : Bool
selectedSlotContributionTyped : Bool
selectedSlotEvalCompiled : Bool
branchContributionFamilyAvailable : Bool
sparseBranchSumExpansionAvailable : Bool
projectionSummationProved : Bool
productBridgeProved : Bool
normalizedBlockEqualityProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
exactRemainingObstruction : String
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary projection summation obstruction n 3”. Compiled typed obstruction for the focused boundary projection/summation bridge.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Compiled typed obstruction for the focused boundary projection/summation bridge. The object is the next theorem-facing interface for 'oneTermRobinGamma3ProductToCoefficientObligation 3 0 0': it records the slot domain '0, ..., 6', identifies slot '2', and exposes the selected contribution as a typed coefficient. The sparse-branch contribution family itself is absent from the current finite matrix semantics.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:14792. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.283●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSummationObstruction_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProjectionSummationObstruction
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSummationObstruction_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProjectionSummationObstruction
Compiled typed obstruction for the focused boundary projection/summation bridge. The object is the next theorem-facing interface for `oneTermRobinGamma3ProductToCoefficientObligation 3 0 0`: it records the slot domain `0, ..., 6`, identifies slot `2`, and exposes the selected contribution as a typed coefficient. The sparse-branch contribution family itself is absent from the current finite matrix semantics.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary projection summation obstruction selected slot eval n 3”; its local proof does not by itself complete the broader paper route. The new obstruction reuses the accepted branch-entry selection lemma.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The new obstruction reuses the accepted branch-entry selection lemma. Under the corrected boundary-rotation entry hypothesis, the typed selected slot contribution evaluates to the route's projected branch product. This still does not prove that the signal-zero block entry is the sparse-branch sum.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:14863. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.284●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSummationObstruction_selectedSlotEval_n3 (env : String → ℚ) (hentry : env "boundary_cos_half_0_2" = QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.GHL2025.boundaryRotationNormalizedCoefficient (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3) 0 2)) : have obstruction := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSummationObstruction_n3; QuantumBlockEncoding.Coeff.evalWith env obstruction.selectedSlotContribution = QuantumBlockEncoding.Coeff.evalWith env obstruction.projectionTarget.projectedBranchProduct
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSummationObstruction_selectedSlotEval_n3 (env : String → ℚ) (hentry : env "boundary_cos_half_0_2" = QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.GHL2025.boundaryRotationNormalizedCoefficient (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3) 0 2)) : have obstruction := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSummationObstruction_n3; QuantumBlockEncoding.Coeff.evalWith env obstruction.selectedSlotContribution = QuantumBlockEncoding.Coeff.evalWith env obstruction.projectionTarget.projectedBranchProduct
The new obstruction reuses the accepted branch-entry selection lemma. Under the corrected boundary-rotation entry hypothesis, the typed selected slot contribution evaluates to the route's projected branch product. This still does not prove that the signal-zero block entry is the sparse-branch sum.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary projection summation obstruction n 3 transcript”; its local proof does not by itself complete the broader paper route. Transcript theorem for the typed projection/summation obstruction.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Transcript theorem for the typed projection/summation obstruction. The theorem checks that the sparse-slot domain and selected contribution are typed, names the exact missing branch-contribution family, and keeps every projection, block-composition, and theorem-facing flag false.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:14892. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.285●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSummationObstruction_n3_transcript : have obstruction := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSummationObstruction_n3; have selection := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchEntrySelection_n3; have target := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSummationTarget_n3; obstruction.branchEntrySelection = selection ∧ obstruction.projectionTarget = target ∧ obstruction.slotDomain = [0, 1, 2, 3, 4, 5, 6] ∧ obstruction.slotDomainCardinality = 7 ∧ obstruction.focusedSparseSlot = 2 ∧ obstruction.focusedSlotInDomain = true ∧ obstruction.signalBlockEntry = target.signalBlockEntry ∧ obstruction.selectedBranchEntry = target.branchMatrixEntry ∧ obstruction.projectionAmplitudeFactor = selection.projectionAmplitudeFactor ∧ obstruction.selectedSlotContribution = (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySevenGateMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3).mul selection.projectionAmplitudeFactor ∧ obstruction.selectedSlotContributionFormula = "oneTermRobinGamma3BoundarySevenGateMatrix_n3[32,32] * sqrt_kappa_inv * sqrt_kappa_inv" ∧ obstruction.sparseBranchSumFormula = "contract.expectedTarget.blockMatrix[0,0] = sum_{s=0}^{6} branchContribution(s)" ∧ obstruction.branchContributionFamilyInterface = "branchContribution : Fin 7 -> Coeff" ∧ obstruction.requiredBranchContributionField = "finite matrix semantics must provide branchContribution : Fin 7 -> Coeff for the signal-zero entry" ∧ obstruction.requiredSelectedSlotTheorem = "branchContribution[2] = selectedSlotContribution" ∧ obstruction.requiredProjectionSummationTheorem = "signalBlockEntry = Finset.univ.sum branchContribution" ∧ obstruction.branchEntrySelectionLemma = "oneTermRobinGamma3BoundaryBranchEntrySelectionEval_n3" ∧ obstruction.selectedSlotEvalLemma = "oneTermRobinGamma3BoundaryProjectionSummationObstruction_selectedSlotEval_n3" ∧ obstruction.correctedEntryHypothesis = selection.correctedEntryHypothesis ∧ obstruction.ketAmplitudeObligation = selection.ketAmplitudeObligation ∧ obstruction.braAmplitudeObligation = selection.braAmplitudeObligation ∧ obstruction.projectionSummationObligation = selection.projectionSummationObligation ∧ obstruction.productBridgeObligation = selection.productBridgeObligation ∧ obstruction.finiteCompositionNormalizedEquality = selection.finiteCompositionNormalizedEquality ∧ obstruction.productObligation = selection.productObligation ∧ obstruction.typedInterfaceCompiled = true ∧ obstruction.selectedSlotContributionTyped = true ∧ obstruction.selectedSlotEvalCompiled = true ∧ obstruction.branchContributionFamilyAvailable = false ∧ obstruction.sparseBranchSumExpansionAvailable = false ∧ obstruction.projectionSummationProved = false ∧ obstruction.productBridgeProved = false ∧ obstruction.normalizedBlockEqualityProved = false ∧ obstruction.productToCoefficientProved = false ∧ obstruction.lcuCorrectProved = false ∧ obstruction.blockProjectionProved = false ∧ obstruction.blockCorrectProved = false ∧ obstruction.finalExtractionProved = false ∧ obstruction.projectionSummationObligation.proved = false ∧ obstruction.productBridgeObligation.proved = false ∧ obstruction.finiteCompositionNormalizedEquality.proved = false ∧ obstruction.productObligation.proved = false ∧ obstruction.exactRemainingObstruction = "the selected slot-2 contribution is typed and conditionally evaluated, but finite matrix semantics lacks branchContribution : Fin 7 -> Coeff and the summation theorem identifying signalBlockEntry with the sparse-branch sum"
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSummationObstruction_n3_transcript : have obstruction := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSummationObstruction_n3; have selection := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchEntrySelection_n3; have target := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSummationTarget_n3; obstruction.branchEntrySelection = selection ∧ obstruction.projectionTarget = target ∧ obstruction.slotDomain = [0, 1, 2, 3, 4, 5, 6] ∧ obstruction.slotDomainCardinality = 7 ∧ obstruction.focusedSparseSlot = 2 ∧ obstruction.focusedSlotInDomain = true ∧ obstruction.signalBlockEntry = target.signalBlockEntry ∧ obstruction.selectedBranchEntry = target.branchMatrixEntry ∧ obstruction.projectionAmplitudeFactor = selection.projectionAmplitudeFactor ∧ obstruction.selectedSlotContribution = (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySevenGateMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3).mul selection.projectionAmplitudeFactor ∧ obstruction.selectedSlotContributionFormula = "oneTermRobinGamma3BoundarySevenGateMatrix_n3[32,32] * sqrt_kappa_inv * sqrt_kappa_inv" ∧ obstruction.sparseBranchSumFormula = "contract.expectedTarget.blockMatrix[0,0] = sum_{s=0}^{6} branchContribution(s)" ∧ obstruction.branchContributionFamilyInterface = "branchContribution : Fin 7 -> Coeff" ∧ obstruction.requiredBranchContributionField = "finite matrix semantics must provide branchContribution : Fin 7 -> Coeff for the signal-zero entry" ∧ obstruction.requiredSelectedSlotTheorem = "branchContribution[2] = selectedSlotContribution" ∧ obstruction.requiredProjectionSummationTheorem = "signalBlockEntry = Finset.univ.sum branchContribution" ∧ obstruction.branchEntrySelectionLemma = "oneTermRobinGamma3BoundaryBranchEntrySelectionEval_n3" ∧ obstruction.selectedSlotEvalLemma = "oneTermRobinGamma3BoundaryProjectionSummationObstruction_selectedSlotEval_n3" ∧ obstruction.correctedEntryHypothesis = selection.correctedEntryHypothesis ∧ obstruction.ketAmplitudeObligation = selection.ketAmplitudeObligation ∧ obstruction.braAmplitudeObligation = selection.braAmplitudeObligation ∧ obstruction.projectionSummationObligation = selection.projectionSummationObligation ∧ obstruction.productBridgeObligation = selection.productBridgeObligation ∧ obstruction.finiteCompositionNormalizedEquality = selection.finiteCompositionNormalizedEquality ∧ obstruction.productObligation = selection.productObligation ∧ obstruction.typedInterfaceCompiled = true ∧ obstruction.selectedSlotContributionTyped = true ∧ obstruction.selectedSlotEvalCompiled = true ∧ obstruction.branchContributionFamilyAvailable = false ∧ obstruction.sparseBranchSumExpansionAvailable = false ∧ obstruction.projectionSummationProved = false ∧ obstruction.productBridgeProved = false ∧ obstruction.normalizedBlockEqualityProved = false ∧ obstruction.productToCoefficientProved = false ∧ obstruction.lcuCorrectProved = false ∧ obstruction.blockProjectionProved = false ∧ obstruction.blockCorrectProved = false ∧ obstruction.finalExtractionProved = false ∧ obstruction.projectionSummationObligation.proved = false ∧ obstruction.productBridgeObligation.proved = false ∧ obstruction.finiteCompositionNormalizedEquality.proved = false ∧ obstruction.productObligation.proved = false ∧ obstruction.exactRemainingObstruction = "the selected slot-2 contribution is typed and conditionally evaluated, but finite matrix semantics lacks branchContribution : Fin 7 -> Coeff and the summation theorem identifying signalBlockEntry with the sparse-branch sum"
Transcript theorem for the typed projection/summation obstruction. The theorem checks that the sparse-slot domain and selected contribution are typed, names the exact missing branch-contribution family, and keeps every projection, block-composition, and theorem-facing flag false.
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary branch contribution focused slot”. Focused sparse slot for the branch-contribution interface.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Focused sparse slot for the branch-contribution interface. The source boundary branch of Eq. 'ROBIN clarified' uses the global sparse slot '2' for system entry '(0,0)' in the finite 'n = 3', 'κ = 7' witness.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:14978. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.286●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchContributionFocusedSlot : Fin 7
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchContributionFocusedSlot : Fin 7
Focused sparse slot for the branch-contribution interface. The source boundary branch of Eq. `ROBIN clarified` uses the global sparse slot `2` for system entry `(0,0)` in the finite `n = 3`, `κ = 7` witness.
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary branch contribution sum”. Typed sparse-branch sum over the seven one-term Robin sparse slots.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Typed sparse-branch sum over the seven one-term Robin sparse slots. This is intentionally a project-local 'List.finRange' fold instead of a 'Finset.sum', because 'Coeff' is a syntactic coefficient language rather than an additive commutative monoid. It provides the Lean type that the missing projection/summation theorem must target.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:14989. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.287●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchContributionSum (branchContribution : Fin 7 → QuantumBlockEncoding.Coeff) : QuantumBlockEncoding.Coeff
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchContributionSum (branchContribution : Fin 7 → QuantumBlockEncoding.Coeff) : QuantumBlockEncoding.Coeff
Typed sparse-branch sum over the seven one-term Robin sparse slots. This is intentionally a project-local `List.finRange` fold instead of a `Finset.sum`, because `Coeff` is a syntactic coefficient language rather than an additive commutative monoid. It provides the Lean type that the missing projection/summation theorem must target.
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary branch contribution placeholder n 3”. Placeholder branch-contribution family for the focused projection/summation interface.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Placeholder branch-contribution family for the focused projection/summation interface. Only slot '2' is identified with the already compiled selected contribution. The other slots remain opaque symbolic placeholders; this definition does not assert that their sum is the signal-zero block entry.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:15001. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.288●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchContributionPlaceholder_n3 (obstruction : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProjectionSummationObstruction) : Fin 7 → QuantumBlockEncoding.Coeff
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchContributionPlaceholder_n3 (obstruction : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProjectionSummationObstruction) : Fin 7 → QuantumBlockEncoding.Coeff
Placeholder branch-contribution family for the focused projection/summation interface. Only slot `2` is identified with the already compiled selected contribution. The other slots remain opaque symbolic placeholders; this definition does not assert that their sum is the signal-zero block entry.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary branch contribution family”. A proposition-valued field is a requirement until a constructor supplies it. Typed branch-contribution family required by the finite projection/summation bridge.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Typed branch-contribution family required by the finite projection/summation bridge. The record supplies the missing shape 'branchContribution : Fin 7 -> Coeff', proves only the selected slot-'2' identity, and leaves the statement 'signalBlockEntry = branchContributionSum' as a typed unproved proposition.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:15019. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.289●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBranchContributionFamily : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBranchContributionFamily : Type
Typed branch-contribution family required by the finite projection/summation bridge. The record supplies the missing shape `branchContribution : Fin 7 -> Coeff`, proves only the selected slot-`2` identity, and leaves the statement `signalBlockEntry = branchContributionSum` as a typed unproved proposition.
Fields
sourceAnchor : String
projectionObstruction : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProjectionSummationObstruction
branchContribution : Fin 7 → QuantumBlockEncoding.Coeff
focusedSparseSlot : Fin 7
selectedSlotContribution : QuantumBlockEncoding.Coeff
selectedSlotStatement : Prop
signalBlockEntry : QuantumBlockEncoding.Coeff
branchContributionSum : QuantumBlockEncoding.Coeff
projectionSummationStatement : Prop
selectedSlotTheorem : String
projectionSummationTheoremTarget : String
branchContributionFamilyAvailable : Bool
selectedSlotStatementTyped : Bool
selectedSlotProved : Bool
projectionSummationStatementTyped : Bool
projectionSummationProved : Bool
productBridgeProved : Bool
normalizedBlockEqualityProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
exactRemainingObstruction : String
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary branch contribution family n 3”. Compiled branch-contribution family for the focused 'n = 3' boundary branch.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Compiled branch-contribution family for the focused 'n = 3' boundary branch. This turns the previous string-level interface into a typed Lean family. It does not prove that the signal-zero block entry is the sparse-branch sum.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:15052. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.290●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchContributionFamily_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBranchContributionFamily
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchContributionFamily_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBranchContributionFamily
Compiled branch-contribution family for the focused `n = 3` boundary branch. This turns the previous string-level interface into a typed Lean family. It does not prove that the signal-zero block entry is the sparse-branch sum.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary branch contribution selected slot n 3”; its local proof does not by itself complete the broader paper route. The typed branch-contribution family selects the accepted slot-'2' contribution.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The typed branch-contribution family selects the accepted slot-'2' contribution. This is only the local selected-slot identity. It is not the sparse-branch summation theorem for the signal-zero block entry.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:15101. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.291●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchContribution_selectedSlot_n3 : QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchContributionFamily_n3.selectedSlotStatement
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchContribution_selectedSlot_n3 : QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchContributionFamily_n3.selectedSlotStatement
The typed branch-contribution family selects the accepted slot-`2` contribution. This is only the local selected-slot identity. It is not the sparse-branch summation theorem for the signal-zero block entry.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary branch contribution obstruction”. A proposition-valued field is a requirement until a constructor supplies it. Typed obstruction after introducing the branch-contribution family.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Typed obstruction after introducing the branch-contribution family. The selected slot theorem is now compiled, but the QBE-local finite matrix semantics still lacks the summation proof connecting the signal-zero block entry to the branch-contribution fold.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:15114. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.292●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBranchContributionObstruction : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBranchContributionObstruction : Type
Typed obstruction after introducing the branch-contribution family. The selected slot theorem is now compiled, but the QBE-local finite matrix semantics still lacks the summation proof connecting the signal-zero block entry to the branch-contribution fold.
Fields
sourceAnchor : String
family : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBranchContributionFamily
projectionObstruction : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProjectionSummationObstruction
selectedSlotTheorem : String
projectionSummationTheoremTarget : String
branchContributionFamilyAvailable : Bool
selectedSlotTheoremCompiled : Bool
projectionSummationStatementTyped : Bool
projectionSummationTheoremAvailable : Bool
projectionSummationProved : Bool
productBridgeProved : Bool
normalizedBlockEqualityProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
exactRemainingObstruction : String
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary branch contribution obstruction n 3”. Current obstruction for the focused projection/summation bridge after the branch-contribution family has been made a typed Lean interface.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Current obstruction for the focused projection/summation bridge after the branch-contribution family has been made a typed Lean interface.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:15139. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.293●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchContributionObstruction_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBranchContributionObstruction
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchContributionObstruction_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBranchContributionObstruction
Current obstruction for the focused projection/summation bridge after the branch-contribution family has been made a typed Lean interface.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary branch contribution obstruction n 3 transcript”; its local proof does not by itself complete the broader paper route. Transcript theorem for the branch-contribution-family obstruction.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Transcript theorem for the branch-contribution-family obstruction. The theorem verifies that the focused family is typed, slot '2' is selected, and every theorem-facing semantic flag remains false except the local selected-slot interface theorem.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:15174. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.294●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchContributionObstruction_n3_transcript : have obstruction := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchContributionObstruction_n3; have family := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchContributionFamily_n3; obstruction.family = family ∧ family.projectionObstruction = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSummationObstruction_n3 ∧ family.focusedSparseSlot = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchContributionFocusedSlot ∧ ↑family.focusedSparseSlot = 2 ∧ family.branchContribution family.focusedSparseSlot = family.selectedSlotContribution ∧ family.selectedSlotStatement ∧ family.signalBlockEntry = family.projectionObstruction.signalBlockEntry ∧ family.branchContributionSum = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchContributionSum family.branchContribution ∧ family.projectionSummationStatement = (family.signalBlockEntry = family.branchContributionSum) ∧ family.branchContributionFamilyAvailable = true ∧ family.selectedSlotStatementTyped = true ∧ family.selectedSlotProved = true ∧ family.projectionSummationStatementTyped = true ∧ family.projectionSummationProved = false ∧ obstruction.branchContributionFamilyAvailable = true ∧ obstruction.selectedSlotTheoremCompiled = true ∧ obstruction.projectionSummationStatementTyped = true ∧ obstruction.projectionSummationTheoremAvailable = false ∧ obstruction.projectionSummationProved = false ∧ obstruction.productBridgeProved = false ∧ obstruction.normalizedBlockEqualityProved = false ∧ obstruction.productToCoefficientProved = false ∧ obstruction.lcuCorrectProved = false ∧ obstruction.blockProjectionProved = false ∧ obstruction.blockCorrectProved = false ∧ obstruction.finalExtractionProved = false ∧ obstruction.exactRemainingObstruction = "finite matrix semantics still needs oneTermRobinGamma3BoundaryBranchContribution_sum_n3: signalBlockEntry = oneTermRobinGamma3BoundaryBranchContributionSum branchContribution"
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchContributionObstruction_n3_transcript : have obstruction := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchContributionObstruction_n3; have family := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchContributionFamily_n3; obstruction.family = family ∧ family.projectionObstruction = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSummationObstruction_n3 ∧ family.focusedSparseSlot = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchContributionFocusedSlot ∧ ↑family.focusedSparseSlot = 2 ∧ family.branchContribution family.focusedSparseSlot = family.selectedSlotContribution ∧ family.selectedSlotStatement ∧ family.signalBlockEntry = family.projectionObstruction.signalBlockEntry ∧ family.branchContributionSum = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchContributionSum family.branchContribution ∧ family.projectionSummationStatement = (family.signalBlockEntry = family.branchContributionSum) ∧ family.branchContributionFamilyAvailable = true ∧ family.selectedSlotStatementTyped = true ∧ family.selectedSlotProved = true ∧ family.projectionSummationStatementTyped = true ∧ family.projectionSummationProved = false ∧ obstruction.branchContributionFamilyAvailable = true ∧ obstruction.selectedSlotTheoremCompiled = true ∧ obstruction.projectionSummationStatementTyped = true ∧ obstruction.projectionSummationTheoremAvailable = false ∧ obstruction.projectionSummationProved = false ∧ obstruction.productBridgeProved = false ∧ obstruction.normalizedBlockEqualityProved = false ∧ obstruction.productToCoefficientProved = false ∧ obstruction.lcuCorrectProved = false ∧ obstruction.blockProjectionProved = false ∧ obstruction.blockCorrectProved = false ∧ obstruction.finalExtractionProved = false ∧ obstruction.exactRemainingObstruction = "finite matrix semantics still needs oneTermRobinGamma3BoundaryBranchContribution_sum_n3: signalBlockEntry = oneTermRobinGamma3BoundaryBranchContributionSum branchContribution"
Transcript theorem for the branch-contribution-family obstruction. The theorem verifies that the focused family is typed, slot `2` is selected, and every theorem-facing semantic flag remains false except the local selected-slot interface theorem.
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary backend branch contribution predicate n 3”. Predicate that a backend-sourced sparse-branch contribution family must satisfy for the focused boundary projection/summation theorem.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Predicate that a backend-sourced sparse-branch contribution family must satisfy for the focused boundary projection/summation theorem. This is the next-run target, not a new assumption. A candidate family must come from the finite projection semantics, select slot '2' as the accepted branch contribution, and sum to the signal-zero block entry.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:15233. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.295●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContributionPredicate_n3 (branchContribution : Fin 7 → QuantumBlockEncoding.Coeff) : Prop
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContributionPredicate_n3 (branchContribution : Fin 7 → QuantumBlockEncoding.Coeff) : Prop
Predicate that a backend-sourced sparse-branch contribution family must satisfy for the focused boundary projection/summation theorem. This is the next-run target, not a new assumption. A candidate family must come from the finite projection semantics, select slot `2` as the accepted branch contribution, and sum to the signal-zero block entry.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary backend projection summation field target”. A proposition-valued field is a requirement until a constructor supplies it. Smallest backend field still missing from the focused projection bridge.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Smallest backend field still missing from the focused projection bridge. The previous packet supplied a placeholder 'branchContribution' family so Lean could type the selected-slot and branch-sum statements. This record prevents that placeholder from being mistaken for the finite matrix-semantics field: the actual field must be sourced from the 'BlockExtractionTarget'/projection backend and satisfy 'oneTermRobinGamma3BoundaryBackendBranchContributionPredicate_n3'.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:15250. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.296●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBackendProjectionSummationFieldTarget : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBackendProjectionSummationFieldTarget : Type
Smallest backend field still missing from the focused projection bridge. The previous packet supplied a placeholder `branchContribution` family so Lean could type the selected-slot and branch-sum statements. This record prevents that placeholder from being mistaken for the finite matrix-semantics field: the actual field must be sourced from the `BlockExtractionTarget`/projection backend and satisfy `oneTermRobinGamma3BoundaryBackendBranchContributionPredicate_n3`.
Fields
sourceAnchor : String
family : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBranchContributionFamily
projectionObstruction : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProjectionSummationObstruction
projectionTarget : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProjectionSummationTarget
backendBranchContributionPredicate : (Fin 7 → QuantumBlockEncoding.Coeff) → Prop
backendFieldExpectedOwner : String
backendFieldLeanType : String
requiredSelectedSlotTheorem : String
requiredProjectionSummationTheorem : String
placeholderFamilyIsBackendSourced : Bool
placeholderMayCloseProjectionSummation : Bool
backendFieldAvailable : Bool
backendPredicateTyped : Bool
backendSelectedSlotTheoremAvailable : Bool
backendProjectionSummationTheoremAvailable : Bool
projectionSummationProved : Bool
productBridgeProved : Bool
normalizedBlockEqualityProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
exactRemainingObstruction : String
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary backend projection summation field target n 3”. Concrete backend-field target for the focused 'n = 3' boundary branch.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Concrete backend-field target for the focused 'n = 3' boundary branch. No theorem-facing flag is promoted. The record says that the placeholder family is useful only for typing the statements; the missing semantic field is a backend-sourced 'Fin 7 -> Coeff' family for the signal-zero entry.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:15284. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.297●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendProjectionSummationFieldTarget_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBackendProjectionSummationFieldTarget
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendProjectionSummationFieldTarget_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBackendProjectionSummationFieldTarget
Concrete backend-field target for the focused `n = 3` boundary branch. No theorem-facing flag is promoted. The record says that the placeholder family is useful only for typing the statements; the missing semantic field is a backend-sourced `Fin 7 -> Coeff` family for the signal-zero entry.
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary block extraction branch contribution target n 3”. Generic block-extraction branch-contribution target for the focused boundary entry.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Generic block-extraction branch-contribution target for the focused boundary entry. This uses the new QBE-local backend interface to type the seven-slot family at 'contract.expectedTarget.blockMatrix[0,0]'. The family is still the current placeholder from the Robin obstruction, so the backend-source and branch-sum obligations stay false. This target exists only to make the next required backend theorem precise.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:15385. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.298●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBlockExtractionBranchContributionTarget_n3 : QuantumBlockEncoding.BlockExtractionBranchContributionTarget QuantumBlockEncoding.Coeff (QuantumBlockEncoding.gridSize 3) (QuantumBlockEncoding.gridSize 3) (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.effectiveRobinSignalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3))) 7
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBlockExtractionBranchContributionTarget_n3 : QuantumBlockEncoding.BlockExtractionBranchContributionTarget QuantumBlockEncoding.Coeff (QuantumBlockEncoding.gridSize 3) (QuantumBlockEncoding.gridSize 3) (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.effectiveRobinSignalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3))) 7
Generic block-extraction branch-contribution target for the focused boundary entry. This uses the new QBE-local backend interface to type the seven-slot family at `contract.expectedTarget.blockMatrix[0,0]`. The family is still the current placeholder from the Robin obstruction, so the backend-source and branch-sum obligations stay false. This target exists only to make the next required backend theorem precise.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary block extraction backend gap”. A proposition-valued field is a requirement until a constructor supplies it. Smallest obstruction after inspecting the current 'BlockExtractionTarget' backend.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Smallest obstruction after inspecting the current 'BlockExtractionTarget' backend. The backend gives a concrete 'blockMatrix[0,0]' entry and the corresponding full-unitary entry. It does not yet expose a sparse-slot contribution family for that entry. This record is therefore a narrower obstruction than the generic backend-field target: it points at the existing 'BlockExtractionTarget' fields and names the missing projection-summand interface.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:15467. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.299●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBlockExtractionBackendGap : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBlockExtractionBackendGap : Type
Smallest obstruction after inspecting the current `BlockExtractionTarget` backend. The backend gives a concrete `blockMatrix[0,0]` entry and the corresponding full-unitary entry. It does not yet expose a sparse-slot contribution family for that entry. This record is therefore a narrower obstruction than the generic backend-field target: it points at the existing `BlockExtractionTarget` fields and names the missing projection-summand interface.
Fields
sourceAnchor : String
backendFieldTarget : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBackendProjectionSummationFieldTarget
expectedTarget : QuantumBlockEncoding.BlockExtractionTarget QuantumBlockEncoding.Coeff (QuantumBlockEncoding.gridSize 3) (QuantumBlockEncoding.gridSize 3) (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.effectiveRobinSignalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3)))
signalBlockEntry : QuantumBlockEncoding.Coeff
unitaryEntry : QuantumBlockEncoding.Coeff
blockProjectionObligation : QuantumBlockEncoding.SemanticObligation
blockCorrectObligation : QuantumBlockEncoding.SemanticObligation
backendPredicate : (Fin 7 → QuantumBlockEncoding.Coeff) → Prop
branchContributionTarget : QuantumBlockEncoding.BlockExtractionBranchContributionTarget QuantumBlockEncoding.Coeff (QuantumBlockEncoding.gridSize 3) (QuantumBlockEncoding.gridSize 3) (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.effectiveRobinSignalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3))) 7
exposesUnitaryMatrix : Bool
exposesBlockMatrix : Bool
exposesTargetMatrix : Bool
exposesSignalIndex : Bool
exposesBranchContributionField : Bool
genericBranchContributionInterfaceAvailable : Bool
genericBranchContributionBackendSourced : Bool
genericSelectedBranchStatementCompiled : Bool
genericProjectionSummationStatementTyped : Bool
blockEntryOnlyBridgeCompiled : Bool
backendPredicateTyped : Bool
backendFieldAvailable : Bool
placeholderFamilyRejected : Bool
projectionSummationProved : Bool
productBridgeProved : Bool
normalizedBlockEqualityProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
missingBackendField : String
requiredBackendDeclaration : String
reasonPlaceholderRejected : String
exactRemainingObstruction : String
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary block extraction backend gap n 3”. Concrete backend gap for the focused 'n = 3' boundary branch.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Concrete backend gap for the focused 'n = 3' boundary branch. This does not change 'BlockExtractionTarget' or prove the branch sum. It records that the available backend data reaches only the signal-zero block entry and its full-unitary index bridge.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:15517. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.300●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBlockExtractionBackendGap_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBlockExtractionBackendGap
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBlockExtractionBackendGap_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBlockExtractionBackendGap
Concrete backend gap for the focused `n = 3` boundary branch. This does not change `BlockExtractionTarget` or prove the branch sum. It records that the available backend data reaches only the signal-zero block entry and its full-unitary index bridge.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary block extraction backend gap n 3 transcript”; its local proof does not by itself complete the broader paper route. Transcript theorem for the block-extraction backend gap.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Transcript theorem for the block-extraction backend gap. The theorem checks that the gap is tied to the actual 'BlockExtractionTarget' entry and that all theorem-facing semantic flags remain false.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:15572. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.301●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBlockExtractionBackendGap_n3_transcript : have gap := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBlockExtractionBackendGap_n3; have backendTarget := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendProjectionSummationFieldTarget_n3; have contract := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteBlockCompositionContract 3; gap.backendFieldTarget = backendTarget ∧ gap.expectedTarget = contract.expectedTarget ∧ gap.signalBlockEntry = backendTarget.projectionTarget.signalBlockEntry ∧ gap.unitaryEntry = backendTarget.projectionTarget.signalUnitaryEntry ∧ gap.signalBlockEntry = gap.unitaryEntry ∧ gap.blockProjectionObligation = contract.expectedTarget.blockProjection ∧ gap.blockCorrectObligation = contract.expectedTarget.blockCorrect ∧ gap.blockProjectionObligation.proved = false ∧ gap.blockCorrectObligation.proved = false ∧ gap.backendPredicate = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContributionPredicate_n3 ∧ gap.branchContributionTarget = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBlockExtractionBranchContributionTarget_n3 ∧ gap.branchContributionTarget.extractionTarget = gap.expectedTarget ∧ ↑gap.branchContributionTarget.selectedBranch = 2 ∧ gap.branchContributionTarget.backendSource.proved = false ∧ gap.branchContributionTarget.branchSummationCorrect.proved = false ∧ gap.exposesUnitaryMatrix = true ∧ gap.exposesBlockMatrix = true ∧ gap.exposesTargetMatrix = true ∧ gap.exposesSignalIndex = true ∧ gap.exposesBranchContributionField = false ∧ gap.genericBranchContributionInterfaceAvailable = true ∧ gap.genericBranchContributionBackendSourced = false ∧ gap.genericSelectedBranchStatementCompiled = true ∧ gap.genericProjectionSummationStatementTyped = true ∧ gap.blockEntryOnlyBridgeCompiled = true ∧ gap.backendPredicateTyped = true ∧ gap.backendFieldAvailable = false ∧ gap.placeholderFamilyRejected = true ∧ gap.projectionSummationProved = false ∧ gap.productBridgeProved = false ∧ gap.normalizedBlockEqualityProved = false ∧ gap.productToCoefficientProved = false ∧ gap.lcuCorrectProved = false ∧ gap.blockProjectionProved = false ∧ gap.blockCorrectProved = false ∧ gap.finalExtractionProved = false ∧ gap.missingBackendField = "branchContribution : Fin 7 -> Coeff computed from contract.expectedTarget.blockMatrix[0,0]" ∧ gap.requiredBackendDeclaration = "BlockExtractionTarget sparse-slot projection-summand interface for a fixed signal/system entry" ∧ gap.reasonPlaceholderRejected = "the placeholder family is not computed from contract.expectedTarget.blockMatrix[0,0]" ∧ gap.exactRemainingObstruction = "BlockExtractionTarget can be paired with a typed seven-slot branch target, but the backend-source proof and signal-block branch-sum theorem are still absent"
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBlockExtractionBackendGap_n3_transcript : have gap := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBlockExtractionBackendGap_n3; have backendTarget := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendProjectionSummationFieldTarget_n3; have contract := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteBlockCompositionContract 3; gap.backendFieldTarget = backendTarget ∧ gap.expectedTarget = contract.expectedTarget ∧ gap.signalBlockEntry = backendTarget.projectionTarget.signalBlockEntry ∧ gap.unitaryEntry = backendTarget.projectionTarget.signalUnitaryEntry ∧ gap.signalBlockEntry = gap.unitaryEntry ∧ gap.blockProjectionObligation = contract.expectedTarget.blockProjection ∧ gap.blockCorrectObligation = contract.expectedTarget.blockCorrect ∧ gap.blockProjectionObligation.proved = false ∧ gap.blockCorrectObligation.proved = false ∧ gap.backendPredicate = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContributionPredicate_n3 ∧ gap.branchContributionTarget = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBlockExtractionBranchContributionTarget_n3 ∧ gap.branchContributionTarget.extractionTarget = gap.expectedTarget ∧ ↑gap.branchContributionTarget.selectedBranch = 2 ∧ gap.branchContributionTarget.backendSource.proved = false ∧ gap.branchContributionTarget.branchSummationCorrect.proved = false ∧ gap.exposesUnitaryMatrix = true ∧ gap.exposesBlockMatrix = true ∧ gap.exposesTargetMatrix = true ∧ gap.exposesSignalIndex = true ∧ gap.exposesBranchContributionField = false ∧ gap.genericBranchContributionInterfaceAvailable = true ∧ gap.genericBranchContributionBackendSourced = false ∧ gap.genericSelectedBranchStatementCompiled = true ∧ gap.genericProjectionSummationStatementTyped = true ∧ gap.blockEntryOnlyBridgeCompiled = true ∧ gap.backendPredicateTyped = true ∧ gap.backendFieldAvailable = false ∧ gap.placeholderFamilyRejected = true ∧ gap.projectionSummationProved = false ∧ gap.productBridgeProved = false ∧ gap.normalizedBlockEqualityProved = false ∧ gap.productToCoefficientProved = false ∧ gap.lcuCorrectProved = false ∧ gap.blockProjectionProved = false ∧ gap.blockCorrectProved = false ∧ gap.finalExtractionProved = false ∧ gap.missingBackendField = "branchContribution : Fin 7 -> Coeff computed from contract.expectedTarget.blockMatrix[0,0]" ∧ gap.requiredBackendDeclaration = "BlockExtractionTarget sparse-slot projection-summand interface for a fixed signal/system entry" ∧ gap.reasonPlaceholderRejected = "the placeholder family is not computed from contract.expectedTarget.blockMatrix[0,0]" ∧ gap.exactRemainingObstruction = "BlockExtractionTarget can be paired with a typed seven-slot branch target, but the backend-source proof and signal-block branch-sum theorem are still absent"
Transcript theorem for the block-extraction backend gap. The theorem checks that the gap is tied to the actual `BlockExtractionTarget` entry and that all theorem-facing semantic flags remain false.
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary backend branch full index n 3”. Full-basis branch index map for the focused 'n = 3' boundary backend packet.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Full-basis branch index map for the focused 'n = 3' boundary backend packet. For the system column '0', this maps each sparse slot to the clean paper-basis index used by the displayed 'gamma3' register expression. The map is typed as a full circuit basis index; it does not by itself provide the branch summand formula or the branch-sum theorem for the signal-zero block entry.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:15644. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.302●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchFullIndex_n3 (s : Fin 7) : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3)))
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchFullIndex_n3 (s : Fin 7) : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3)))
Full-basis branch index map for the focused `n = 3` boundary backend packet. For the system column `0`, this maps each sparse slot to the clean paper-basis index used by the displayed `gamma3` register expression. The map is typed as a full circuit basis index; it does not by itself provide the branch summand formula or the branch-sum theorem for the signal-zero block entry.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary backend branch full index selected n 3”; its local proof does not by itself complete the broader paper route. The backend branch-index map sends the focused slot '2' to the accepted clean branch basis index '32'.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The backend branch-index map sends the focused slot '2' to the accepted clean branch basis index '32'.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:15668. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.303●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchFullIndex_selected_n3 : have idx := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchFullIndex_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchContributionFocusedSlot; ↑idx = 32 ∧ idx = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchFullIndex_selected_n3 : have idx := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchFullIndex_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchContributionFocusedSlot; ↑idx = 32 ∧ idx = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3
The backend branch-index map sends the focused slot `2` to the accepted clean branch basis index `32`.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary backend branch full index slot zero n 3”; its local proof does not by itself complete the broader paper route. The backend branch-index map sends sparse slot '0' to the active signal-zero full basis index '0'.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The backend branch-index map sends sparse slot '0' to the active signal-zero full basis index '0'. This is the active-entry side of the current raw-fold obstruction: the uncast '[0,0]' entry is attached to the slot-'0' diagonal, while the backend fold still contains all seven sparse-slot summands.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:15683. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.304●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchFullIndex_slotZero_n3 : have idx := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchFullIndex_n3 ⟨0, ⋯⟩; ↑idx = 0 ∧ idx = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchFullIndex_slotZero_n3 : have idx := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchFullIndex_n3 ⟨0, ⋯⟩; ↑idx = 0 ∧ idx = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3
The backend branch-index map sends sparse slot `0` to the active signal-zero full basis index `0`. This is the active-entry side of the current raw-fold obstruction: the uncast `[0,0]` entry is attached to the slot-`0` diagonal, while the backend fold still contains all seven sparse-slot summands.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary backend branch full index value n 3”; its local proof does not by itself complete the broader paper route. The all-slot backend branch-index map embeds sparse slot 's' at full basis index '16 * s'.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The all-slot backend branch-index map embeds sparse slot 's' at full basis index '16 * s'. This is the reusable index feeder for future slot support or cancellation lemmas in the full-unitary fold; it does not prove any summand vanishes and does not assert the branch-sum theorem.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:15698. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.305●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchFullIndex_value_n3 (s : Fin 7) : ↑(QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchFullIndex_n3 s) = ↑s * 16
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchFullIndex_value_n3 (s : Fin 7) : ↑(QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchFullIndex_n3 s) = ↑s * 16
The all-slot backend branch-index map embeds sparse slot `s` at full basis index `16 * s`. This is the reusable index feeder for future slot support or cancellation lemmas in the full-unitary fold; it does not prove any summand vanishes and does not assert the branch-sum theorem.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary backend branch full index injective n 3”; its local proof does not by itself complete the broader paper route. The seven backend sparse slots occupy distinct full-basis indices.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The seven backend sparse slots occupy distinct full-basis indices. This is a support feeder for the full-unitary fold frontier: later slot-by-slot support or cancellation lemmas can use it to rule out accidental branch-index collisions. It does not prove that any summand vanishes or that the fold equals the signal-zero unitary entry.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:15715. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.306●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchFullIndex_injective_n3 : Function.Injective QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchFullIndex_n3
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchFullIndex_injective_n3 : Function.Injective QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchFullIndex_n3
The seven backend sparse slots occupy distinct full-basis indices. This is a support feeder for the full-unitary fold frontier: later slot-by-slot support or cancellation lemmas can use it to rule out accidental branch-index collisions. It does not prove that any summand vanishes or that the fold equals the signal-zero unitary entry.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary backend slot one dagger after swap zero n 3”; its local proof does not by itself complete the broader paper route. Slot-'1' clean path support mismatch for the backend diagonal branch.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Slot-'1' clean path support mismatch for the backend diagonal branch. The backend slot maps to full index '16'; the forward sparse-access image is '112', and SWAP sends that image to '14'. The transpose-style dagger row for the original slot-'1' index has zero entry at column '14', so the clean slot-'1' path cannot close the diagonal branch through the dagger. This is a strict support feeder for a future slot-'1' vanish proof; it proves no full fold equality and promotes no semantic flag.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:15734. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.307●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendSlotOneDaggerAfterSwap_zero_n3 : let p := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixParameters_n3; have slotOne := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchFullIndex_n3 ⟨1, ⋯⟩; have afterForward := ⟨112, ⋯⟩; have afterSwap := ⟨14, ⋯⟩; ↑slotOne = 16 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperImage p ↑slotOne = ↑afterForward ∧ QuantumBlockEncoding.GHL2025.swapOracleImage p ↑afterForward = ↑afterSwap ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperDaggerMatrix p slotOne afterSwap = QuantumBlockEncoding.Coeff.rat 0
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendSlotOneDaggerAfterSwap_zero_n3 : let p := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixParameters_n3; have slotOne := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchFullIndex_n3 ⟨1, ⋯⟩; have afterForward := ⟨112, ⋯⟩; have afterSwap := ⟨14, ⋯⟩; ↑slotOne = 16 ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperImage p ↑slotOne = ↑afterForward ∧ QuantumBlockEncoding.GHL2025.swapOracleImage p ↑afterForward = ↑afterSwap ∧ QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperDaggerMatrix p slotOne afterSwap = QuantumBlockEncoding.Coeff.rat 0
Slot-`1` clean path support mismatch for the backend diagonal branch. The backend slot maps to full index `16`; the forward sparse-access image is `112`, and SWAP sends that image to `14`. The transpose-style dagger row for the original slot-`1` index has zero entry at column `14`, so the clean slot-`1` path cannot close the diagonal branch through the dagger. This is a strict support feeder for a future slot-`1` vanish proof; it proves no full fold equality and promotes no semantic flag.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary backend selected branch summand formula n 3”; its local proof does not by itself complete the broader paper route. The selected contribution in the generic branch target is the already compiled slot-'2' seven-gate summand formula.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The selected contribution in the generic branch target is the already compiled slot-'2' seven-gate summand formula. This proves only the selected branch formula. It does not construct the all-slot backend family and does not prove that the signal-zero block entry is the seven-branch fold.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:15830. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.308●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendSelectedBranchSummandFormula_n3 : have target := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBlockExtractionBranchContributionTarget_n3; target.selectedContribution = (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySevenGateMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3).mul QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchEntrySelection_n3.projectionAmplitudeFactor
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendSelectedBranchSummandFormula_n3 : have target := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBlockExtractionBranchContributionTarget_n3; target.selectedContribution = (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySevenGateMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3).mul QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchEntrySelection_n3.projectionAmplitudeFactor
The selected contribution in the generic branch target is the already compiled slot-`2` seven-gate summand formula. This proves only the selected branch formula. It does not construct the all-slot backend family and does not prove that the signal-zero block entry is the seven-branch fold.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary backend branch index map obstruction”. A proposition-valued field is a requirement until a constructor supplies it. Narrow obstruction after adding the branch-to-full-index map.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Narrow obstruction after adding the branch-to-full-index map. The selected branch now has a typed full-basis index and a compiled selected summand formula. The remaining backend gap is smaller: QBE still lacks the all-slot summand formula that would compute every 'branchContribution s' from the projection backend and then prove the folded sum equals 'contract.expectedTarget.blockMatrix[0,0]'.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:15859. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.309●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBackendBranchIndexMapObstruction : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBackendBranchIndexMapObstruction : Type
Narrow obstruction after adding the branch-to-full-index map. The selected branch now has a typed full-basis index and a compiled selected summand formula. The remaining backend gap is smaller: QBE still lacks the all-slot summand formula that would compute every `branchContribution s` from the projection backend and then prove the folded sum equals `contract.expectedTarget.blockMatrix[0,0]`.
Fields
sourceAnchor : String
backendGap : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBlockExtractionBackendGap
branchContributionTarget : QuantumBlockEncoding.BlockExtractionBranchContributionTarget QuantumBlockEncoding.Coeff (QuantumBlockEncoding.gridSize 3) (QuantumBlockEncoding.gridSize 3) (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.effectiveRobinSignalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3))) 7
branchFullIndex : Fin 7 → Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3)))
selectedBranch : Fin 7
selectedBranchFullIndex : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3)))
selectedContribution : QuantumBlockEncoding.Coeff
branchIndexMapFormula : String
selectedSummandFormula : String
selectedBranchIndexLemma : String
selectedBranchSummandLemma : String
requiredAllBranchSummandFormula : String
requiredProjectionSummationTheorem : String
requiredBackendPredicateTheorem : String
backendBranchIndexMapAvailable : Bool
selectedBranchIndexMapCompiled : Bool
selectedBranchSummandFormulaCompiled : Bool
backendBranchSummandFormulaAvailable : Bool
backendPredicateTyped : Bool
backendPredicateProved : Bool
projectionSummationProved : Bool
productBridgeProved : Bool
normalizedBlockEqualityProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
exactRemainingObstruction : String
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary backend branch index map obstruction n 3”. Focused 'n = 3' backend branch-index map obstruction.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Focused 'n = 3' backend branch-index map obstruction. This packet is the current smallest Lean-facing interface: the full-basis index map for the seven sparse slots is present, and slot '2' is connected to the selected summand. The all-slot summand formula and branch-sum predicate remain unavailable.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:15905. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.310●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchIndexMapObstruction_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBackendBranchIndexMapObstruction
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchIndexMapObstruction_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBackendBranchIndexMapObstruction
Focused `n = 3` backend branch-index map obstruction. This packet is the current smallest Lean-facing interface: the full-basis index map for the seven sparse slots is present, and slot `2` is connected to the selected summand. The all-slot summand formula and branch-sum predicate remain unavailable.
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary backend branch contribution n 3”. All-slot backend summand formula for the focused 'n = 3' boundary packet.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. All-slot backend summand formula for the focused 'n = 3' boundary packet. Each sparse slot is mapped through the compiled branch-to-full-index map and then read from the focused seven-gate matrix. The two sparse-register projection amplitudes are attached uniformly. This supplies the all-slot formula requested by the projection backend, but it is not yet the theorem that the signal-zero block entry is the fold of these seven summands.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:16028. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.311●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_n3 (s : Fin 7) : QuantumBlockEncoding.Coeff
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_n3 (s : Fin 7) : QuantumBlockEncoding.Coeff
All-slot backend summand formula for the focused `n = 3` boundary packet. Each sparse slot is mapped through the compiled branch-to-full-index map and then read from the focused seven-gate matrix. The two sparse-register projection amplitudes are attached uniformly. This supplies the all-slot formula requested by the projection backend, but it is not yet the theorem that the signal-zero block entry is the fold of these seven summands.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary backend branch contribution selected n 3”; its local proof does not by itself complete the broader paper route. The all-slot backend summand formula selects the accepted slot-'2' contribution.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The all-slot backend summand formula selects the accepted slot-'2' contribution. This proves the selected branch clause of 'oneTermRobinGamma3BoundaryBackendBranchContributionPredicate_n3'. The branch-sum clause remains a separate projection/summation theorem.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:16044. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.312●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_selected_n3 : QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchContributionFocusedSlot = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSummationObstruction_n3.selectedSlotContribution
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_selected_n3 : QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchContributionFocusedSlot = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSummationObstruction_n3.selectedSlotContribution
The all-slot backend summand formula selects the accepted slot-`2` contribution. This proves the selected branch clause of `oneTermRobinGamma3BoundaryBackendBranchContributionPredicate_n3`. The branch-sum clause remains a separate projection/summation theorem.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary backend branch contribution slot zero n 3”; its local proof does not by itself complete the broader paper route. The slot-'0' backend summand is the active '[0,0]' seven-gate diagonal multiplied by the sparse-register projection amplitude factor.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The slot-'0' backend summand is the active '[0,0]' seven-gate diagonal multiplied by the sparse-register projection amplitude factor. This is a smaller compiled term identification for the raw uncast backend-expansion target. It does not prove that the active '[0,0]' entry is the full seven-slot fold; it shows that the fold's slot-'0' term is the active diagonal term with the projection weight attached.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:16064. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.313●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_slotZero_n3 : QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_n3 ⟨0, ⋯⟩ = (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySevenGateMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3).mul QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchEntrySelection_n3.projectionAmplitudeFactor
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_slotZero_n3 : QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_n3 ⟨0, ⋯⟩ = (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySevenGateMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3).mul QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchEntrySelection_n3.projectionAmplitudeFactor
The slot-`0` backend summand is the active `[0,0]` seven-gate diagonal multiplied by the sparse-register projection amplitude factor. This is a smaller compiled term identification for the raw uncast backend-expansion target. It does not prove that the active `[0,0]` entry is the full seven-slot fold; it shows that the fold's slot-`0` term is the active diagonal term with the projection weight attached.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary backend branch contribution slot zero eval zero n 3”; its local proof does not by itself complete the broader paper route. The slot-'0' backend branch contribution vanishes after coefficient evaluation.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The slot-'0' backend branch contribution vanishes after coefficient evaluation. This packages the active column-'0' vanish fact with the backend summand formula. It is a local support lemma for the active/prepared entry frontier; the all-slot fold and active/prepared equality remain open.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:16085. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.314●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_slotZeroEval_zero_n3 (env : String → ℚ) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_n3 ⟨0, ⋯⟩) = 0
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_slotZeroEval_zero_n3 (env : String → ℚ) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_n3 ⟨0, ⋯⟩) = 0
The slot-`0` backend branch contribution vanishes after coefficient evaluation. This packages the active column-`0` vanish fact with the backend summand formula. It is a local support lemma for the active/prepared entry frontier; the all-slot fold and active/prepared equality remain open.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary backend branch contribution slot one eval zero n 3”; its local proof does not by itself complete the broader paper route. The slot-'1' backend branch contribution vanishes after coefficient evaluation.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The slot-'1' backend branch contribution vanishes after coefficient evaluation. This is the first full slot-'1' vanish feeder: the all-slot backend summand formula maps slot '1' to the full diagonal entry '[16,16]', and the finite seven-gate matrix entry is zero for the focused backend. It does not prove the active/prepared equality, the full unitary fold, or any oracle/block flag.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:16427. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.315●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_slotOneEval_zero_n3 (env : String → ℚ) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_n3 ⟨1, ⋯⟩) = 0
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_slotOneEval_zero_n3 (env : String → ℚ) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_n3 ⟨1, ⋯⟩) = 0
The slot-`1` backend branch contribution vanishes after coefficient evaluation. This is the first full slot-`1` vanish feeder: the all-slot backend summand formula maps slot `1` to the full diagonal entry `[16,16]`, and the finite seven-gate matrix entry is zero for the focused backend. It does not prove the active/prepared equality, the full unitary fold, or any oracle/block flag.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary backend branch contribution slot three eval zero n 3”; its local proof does not by itself complete the broader paper route. The slot-'3' backend branch contribution vanishes after coefficient evaluation.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The slot-'3' backend branch contribution vanishes after coefficient evaluation. This is the first full evaluated remaining-slot vanish feeder. It uses the slot-'3' full index '48', the seven-gate diagonal support at '[48,48]', and the existing backend branch summand formula. It does not prove the active/prepared equality, the full unitary fold, or any oracle/block flag.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:16757. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.316●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_slotThreeEval_zero_n3 (env : String → ℚ) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_n3 ⟨3, ⋯⟩) = 0
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_slotThreeEval_zero_n3 (env : String → ℚ) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_n3 ⟨3, ⋯⟩) = 0
The slot-`3` backend branch contribution vanishes after coefficient evaluation. This is the first full evaluated remaining-slot vanish feeder. It uses the slot-`3` full index `48`, the seven-gate diagonal support at `[48,48]`, and the existing backend branch summand formula. It does not prove the active/prepared equality, the full unitary fold, or any oracle/block flag.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary backend branch contribution slot four eval zero n 3”; its local proof does not by itself complete the broader paper route. The slot-'4' backend branch contribution vanishes after coefficient evaluation.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The slot-'4' backend branch contribution vanishes after coefficient evaluation. This is a full evaluated remaining-slot feeder at index '64', following the same local support route as the compiled slot-'3' proof. It does not prove the active/prepared equality, the full unitary fold, or any oracle/block flag.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:17086. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.317●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_slotFourEval_zero_n3 (env : String → ℚ) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_n3 ⟨4, ⋯⟩) = 0
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_slotFourEval_zero_n3 (env : String → ℚ) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_n3 ⟨4, ⋯⟩) = 0
The slot-`4` backend branch contribution vanishes after coefficient evaluation. This is a full evaluated remaining-slot feeder at index `64`, following the same local support route as the compiled slot-`3` proof. It does not prove the active/prepared equality, the full unitary fold, or any oracle/block flag.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary backend branch contribution slot five eval zero n 3”; its local proof does not by itself complete the broader paper route. The slot-'5' backend branch contribution vanishes after coefficient evaluation.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The slot-'5' backend branch contribution vanishes after coefficient evaluation. This is the post-slot-'4' full evaluated remaining-slot feeder at index '80'. It only advances the local finite matrix-semantics DAG for the all-slot backend fold; it does not prove the active/prepared equality, the full unitary fold, or any oracle/block flag.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:17416. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.318●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_slotFiveEval_zero_n3 (env : String → ℚ) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_n3 ⟨5, ⋯⟩) = 0
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_slotFiveEval_zero_n3 (env : String → ℚ) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_n3 ⟨5, ⋯⟩) = 0
The slot-`5` backend branch contribution vanishes after coefficient evaluation. This is the post-slot-`4` full evaluated remaining-slot feeder at index `80`. It only advances the local finite matrix-semantics DAG for the all-slot backend fold; it does not prove the active/prepared equality, the full unitary fold, or any oracle/block flag.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary backend branch contribution slot six eval zero n 3”; its local proof does not by itself complete the broader paper route. The slot-'6' backend branch contribution vanishes after coefficient evaluation.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The slot-'6' backend branch contribution vanishes after coefficient evaluation. This closes the last remaining evaluated backend-slot vanish feeder at full index '96'. It only advances the local finite matrix-semantics DAG for the all-slot backend fold; it does not prove the active/prepared equality, the full unitary fold, or any oracle/block flag.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:17746. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.319●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_slotSixEval_zero_n3 (env : String → ℚ) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_n3 ⟨6, ⋯⟩) = 0
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_slotSixEval_zero_n3 (env : String → ℚ) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_n3 ⟨6, ⋯⟩) = 0
The slot-`6` backend branch contribution vanishes after coefficient evaluation. This closes the last remaining evaluated backend-slot vanish feeder at full index `96`. It only advances the local finite matrix-semantics DAG for the all-slot backend fold; it does not prove the active/prepared equality, the full unitary fold, or any oracle/block flag.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary backend branch fold eval eq selected slot contribution n 3”; its local proof does not by itself complete the broader paper route. After the compiled vanish feeders for slots '0', '1', '3', '4', '5', and '6', the evaluated seven-slot backend fold collapses to the selected slot-'2' contribution.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. After the compiled vanish feeders for slots '0', '1', '3', '4', '5', and '6', the evaluated seven-slot backend fold collapses to the selected slot-'2' contribution. This is a backend-side feeder for 'ActiveUncastToPreparedEntry'; it does not prove the active/prepared equality and promotes no theorem-facing oracle, projection, block-correctness, or final-extraction flag.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:17783. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.320●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchFoldEval_eq_selectedSlotContribution_n3 (env : String → ℚ) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.blockExtractionBranchContributionSum QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_n3) = QuantumBlockEncoding.Coeff.evalWith env QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSummationObstruction_n3.selectedSlotContribution
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchFoldEval_eq_selectedSlotContribution_n3 (env : String → ℚ) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.blockExtractionBranchContributionSum QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_n3) = QuantumBlockEncoding.Coeff.evalWith env QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSummationObstruction_n3.selectedSlotContribution
After the compiled vanish feeders for slots `0`, `1`, `3`, `4`, `5`, and `6`, the evaluated seven-slot backend fold collapses to the selected slot-`2` contribution. This is a backend-side feeder for `ActiveUncastToPreparedEntry`; it does not prove the active/prepared equality and promotes no theorem-facing oracle, projection, block-correctness, or final-extraction flag.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary backend branch fold expanded slot zero n 3”; its local proof does not by itself complete the broader paper route. Concrete seven-summand expansion of the backend branch fold.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Concrete seven-summand expansion of the backend branch fold. This is the smaller compiled obstruction for the current backend-expansion target: the first summand is the active row-'0' diagonal branch, weighted by the sparse-register projection amplitude, and the remaining six summands stay as the all-slot backend contribution family. It does not prove that the active signal-zero entry equals this fold.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:17834. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.321●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchFold_expandedSlotZero_n3 : QuantumBlockEncoding.blockExtractionBranchContributionSum QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_n3 = 0 + (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySevenGateMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3).mul QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchEntrySelection_n3.projectionAmplitudeFactor + QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_n3 ⟨1, ⋯⟩ + QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_n3 ⟨2, ⋯⟩ + QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_n3 ⟨3, ⋯⟩ + QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_n3 ⟨4, ⋯⟩ + QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_n3 ⟨5, ⋯⟩ + QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_n3 ⟨6, ⋯⟩
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchFold_expandedSlotZero_n3 : QuantumBlockEncoding.blockExtractionBranchContributionSum QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_n3 = 0 + (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySevenGateMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3).mul QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchEntrySelection_n3.projectionAmplitudeFactor + QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_n3 ⟨1, ⋯⟩ + QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_n3 ⟨2, ⋯⟩ + QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_n3 ⟨3, ⋯⟩ + QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_n3 ⟨4, ⋯⟩ + QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_n3 ⟨5, ⋯⟩ + QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_n3 ⟨6, ⋯⟩
Concrete seven-summand expansion of the backend branch fold. This is the smaller compiled obstruction for the current backend-expansion target: the first summand is the active row-`0` diagonal branch, weighted by the sparse-register projection amplitude, and the remaining six summands stay as the all-slot backend contribution family. It does not prove that the active signal-zero entry equals this fold.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary backend branch fold expanded all slots n 3”; its local proof does not by itself complete the broader paper route. Concrete seven-slot expansion of the backend branch fold.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Concrete seven-slot expansion of the backend branch fold. This support lemma exposes every sparse-slot summand as the corresponding full-basis diagonal entry of 'oneTermRobinGamma3BoundarySevenGateMatrix_n3', weighted by the sparse-register projection amplitude. It does not prove that the active signal-zero entry equals this fold.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:17865. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.322●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchFold_expandedAllSlots_n3 : QuantumBlockEncoding.blockExtractionBranchContributionSum QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_n3 = 0 + (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySevenGateMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3).mul QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchEntrySelection_n3.projectionAmplitudeFactor + (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySevenGateMatrix_n3 ⟨16, ⋯⟩ ⟨16, ⋯⟩).mul QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchEntrySelection_n3.projectionAmplitudeFactor + (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySevenGateMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3).mul QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchEntrySelection_n3.projectionAmplitudeFactor + (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySevenGateMatrix_n3 ⟨48, ⋯⟩ ⟨48, ⋯⟩).mul QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchEntrySelection_n3.projectionAmplitudeFactor + (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySevenGateMatrix_n3 ⟨64, ⋯⟩ ⟨64, ⋯⟩).mul QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchEntrySelection_n3.projectionAmplitudeFactor + (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySevenGateMatrix_n3 ⟨80, ⋯⟩ ⟨80, ⋯⟩).mul QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchEntrySelection_n3.projectionAmplitudeFactor + (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySevenGateMatrix_n3 ⟨96, ⋯⟩ ⟨96, ⋯⟩).mul QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchEntrySelection_n3.projectionAmplitudeFactor
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchFold_expandedAllSlots_n3 : QuantumBlockEncoding.blockExtractionBranchContributionSum QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_n3 = 0 + (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySevenGateMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3).mul QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchEntrySelection_n3.projectionAmplitudeFactor + (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySevenGateMatrix_n3 ⟨16, ⋯⟩ ⟨16, ⋯⟩).mul QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchEntrySelection_n3.projectionAmplitudeFactor + (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySevenGateMatrix_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixSource_n3).mul QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchEntrySelection_n3.projectionAmplitudeFactor + (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySevenGateMatrix_n3 ⟨48, ⋯⟩ ⟨48, ⋯⟩).mul QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchEntrySelection_n3.projectionAmplitudeFactor + (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySevenGateMatrix_n3 ⟨64, ⋯⟩ ⟨64, ⋯⟩).mul QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchEntrySelection_n3.projectionAmplitudeFactor + (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySevenGateMatrix_n3 ⟨80, ⋯⟩ ⟨80, ⋯⟩).mul QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchEntrySelection_n3.projectionAmplitudeFactor + (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySevenGateMatrix_n3 ⟨96, ⋯⟩ ⟨96, ⋯⟩).mul QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchEntrySelection_n3.projectionAmplitudeFactor
Concrete seven-slot expansion of the backend branch fold. This support lemma exposes every sparse-slot summand as the corresponding full-basis diagonal entry of `oneTermRobinGamma3BoundarySevenGateMatrix_n3`, weighted by the sparse-register projection amplitude. It does not prove that the active signal-zero entry equals this fold.
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary backend branch contribution target n 3”. Backend branch-contribution target using the all-slot summand formula.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Backend branch-contribution target using the all-slot summand formula. Unlike 'oneTermRobinGamma3BoundaryBlockExtractionBranchContributionTarget_n3', this target no longer uses the placeholder family. The 'backendSource' and 'branchSummationCorrect' obligations remain false until the finite projection backend proves that this seven-slot family is exactly the signal-zero block expansion.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:18012. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.323●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContributionTarget_n3 : QuantumBlockEncoding.BlockExtractionBranchContributionTarget QuantumBlockEncoding.Coeff (QuantumBlockEncoding.gridSize 3) (QuantumBlockEncoding.gridSize 3) (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.effectiveRobinSignalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3))) 7
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContributionTarget_n3 : QuantumBlockEncoding.BlockExtractionBranchContributionTarget QuantumBlockEncoding.Coeff (QuantumBlockEncoding.gridSize 3) (QuantumBlockEncoding.gridSize 3) (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.effectiveRobinSignalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3))) 7
Backend branch-contribution target using the all-slot summand formula. Unlike `oneTermRobinGamma3BoundaryBlockExtractionBranchContributionTarget_n3`, this target no longer uses the placeholder family. The `backendSource` and `branchSummationCorrect` obligations remain false until the finite projection backend proves that this seven-slot family is exactly the signal-zero block expansion.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary backend all slot summand formula”. A proposition-valued field is a requirement until a constructor supplies it. Follow-up packet after the branch-index obstruction.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Follow-up packet after the branch-index obstruction. The all-slot summand formula is now a concrete 'Fin 7 -> Coeff' family sourced from the branch full-index map and the focused seven-gate matrix. The packet proves only the selected slot-'2' clause. The remaining theorem is still the finite projection/summation equality that identifies the signal-zero block entry with the fold of this backend family.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:18090. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.324●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBackendAllSlotSummandFormula : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBackendAllSlotSummandFormula : Type
Follow-up packet after the branch-index obstruction. The all-slot summand formula is now a concrete `Fin 7 -> Coeff` family sourced from the branch full-index map and the focused seven-gate matrix. The packet proves only the selected slot-`2` clause. The remaining theorem is still the finite projection/summation equality that identifies the signal-zero block entry with the fold of this backend family.
Fields
sourceAnchor : String
indexMapObstruction : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBackendBranchIndexMapObstruction
backendBranchTarget : QuantumBlockEncoding.BlockExtractionBranchContributionTarget QuantumBlockEncoding.Coeff (QuantumBlockEncoding.gridSize 3) (QuantumBlockEncoding.gridSize 3) (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.effectiveRobinSignalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3))) 7
backendBranchContribution : Fin 7 → QuantumBlockEncoding.Coeff
selectedBranch : Fin 7
selectedBranchFullIndex : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3)))
selectedContribution : QuantumBlockEncoding.Coeff
selectedSlotContribution : QuantumBlockEncoding.Coeff
signalBlockEntry : QuantumBlockEncoding.Coeff
backendBranchSum : QuantumBlockEncoding.Coeff
allBranchSummandFormula : String
selectedBranchContributionLemma : String
selectedBranchTargetLemma : String
requiredProjectionSummationTheorem : String
requiredBackendPredicateTheorem : String
allSlotBackendSummandFormulaAvailable : Bool
backendBranchContributionFamilyAvailable : Bool
selectedBranchContributionCompiled : Bool
backendPredicateSelectedClauseProved : Bool
backendPredicateProved : Bool
projectionSummationProved : Bool
productBridgeProved : Bool
normalizedBlockEqualityProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
exactRemainingObstruction : String
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary backend all slot summand formula n 3”. Concrete all-slot backend summand formula packet for the focused boundary branch.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Concrete all-slot backend summand formula packet for the focused boundary branch. This supersedes the previous branch-index obstruction only for the all-slot formula itself: 'backendBranchContribution s' is now defined for every 's : Fin 7'. The full backend predicate remains unproved because its second clause is the missing signal-block branch-sum theorem.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:18136. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.325●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendAllSlotSummandFormula_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBackendAllSlotSummandFormula
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendAllSlotSummandFormula_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBackendAllSlotSummandFormula
Concrete all-slot backend summand formula packet for the focused boundary branch. This supersedes the previous branch-index obstruction only for the all-slot formula itself: `backendBranchContribution s` is now defined for every `s : Fin 7`. The full backend predicate remains unproved because its second clause is the missing signal-block branch-sum theorem.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary backend branch sum closure”. A proposition-valued field is a requirement until a constructor supplies it. Final focused obstruction for the current backend branch-sum packet.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Final focused obstruction for the current backend branch-sum packet. The selected sparse slot is proved and the predicate closure is conditional on one equality. The unproved equality is precisely the QBE-local projection summation statement: the signal-zero block entry must be the fold of the backend seven-slot branch family.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:18301. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.326●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBackendBranchSumClosure : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBackendBranchSumClosure : Type
Final focused obstruction for the current backend branch-sum packet. The selected sparse slot is proved and the predicate closure is conditional on one equality. The unproved equality is precisely the QBE-local projection summation statement: the signal-zero block entry must be the fold of the backend seven-slot branch family.
Fields
sourceAnchor : String
allSlotPacket : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBackendAllSlotSummandFormula
backendBranchTarget : QuantumBlockEncoding.BlockExtractionBranchContributionTarget QuantumBlockEncoding.Coeff (QuantumBlockEncoding.gridSize 3) (QuantumBlockEncoding.gridSize 3) (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.effectiveRobinSignalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3))) 7
backendBranchContribution : Fin 7 → QuantumBlockEncoding.Coeff
selectedClauseStatement : Prop
requiredBranchSumStatement : Prop
projectionSummationStatement : Prop
backendPredicateStatement : Prop
selectedClauseTheorem : String
conditionalPredicateClosureTheorem : String
requiredProjectionSummationTheorem : String
requiredSecondConjunct : String
missingBackendField : String
selectedClauseProved : Bool
conditionalPredicateClosureCompiled : Bool
projectionSummationStatementTyped : Bool
backendPredicateTyped : Bool
backendPredicateProved : Bool
projectionSummationProved : Bool
productBridgeProved : Bool
normalizedBlockEqualityProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
exactRemainingObstruction : String
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary backend branch sum closure n 3”. Concrete branch-sum closure target for the focused 'n = 3' boundary packet.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Concrete branch-sum closure target for the focused 'n = 3' boundary packet. This record is the narrow fallback for the current lower task: it does not claim the branch sum, but it proves that the selected clause is no longer a blocker and names the single remaining proposition.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:18341. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.327●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchSumClosure_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBackendBranchSumClosure
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchSumClosure_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBackendBranchSumClosure
Concrete branch-sum closure target for the focused `n = 3` boundary packet. This record is the narrow fallback for the current lower task: it does not claim the branch sum, but it proves that the selected clause is no longer a blocker and names the single remaining proposition.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary backend branch sum closure n 3 transcript”; its local proof does not by itself complete the broader paper route. Transcript theorem for the backend branch-sum closure target.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Transcript theorem for the backend branch-sum closure target. The theorem verifies that the new packet consumes the all-slot summand formula, proves the selected predicate clause, and keeps the actual projection summation statement and every theorem-facing semantic flag false.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:18398. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.328●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchSumClosure_n3_transcript : have closure := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchSumClosure_n3; have packet := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendAllSlotSummandFormula_n3; have target := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContributionTarget_n3; closure.allSlotPacket = packet ∧ closure.backendBranchTarget = target ∧ closure.backendBranchContribution = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_n3 ∧ closure.selectedClauseStatement ∧ closure.selectedClauseTheorem = "oneTermRobinGamma3BoundaryBackendBranchContributionPredicate_selectedClause_n3" ∧ closure.conditionalPredicateClosureTheorem = "oneTermRobinGamma3BoundaryBackendBranchContributionPredicate_of_branchSum_n3" ∧ closure.requiredProjectionSummationTheorem = "BlockExtractionBranchContributionTarget.projectionSummationStatement oneTermRobinGamma3BoundaryBackendBranchContributionTarget_n3" ∧ closure.requiredSecondConjunct = "oneTermRobinGamma3BoundaryProjectionSummationObstruction_n3.signalBlockEntry = oneTermRobinGamma3BoundaryBranchContributionSum oneTermRobinGamma3BoundaryBackendBranchContribution_n3" ∧ closure.missingBackendField = "finite projection backend theorem expanding contract.expectedTarget.blockMatrix[0,0] as the fold over backend sparse-branch contributions" ∧ closure.selectedClauseProved = true ∧ closure.conditionalPredicateClosureCompiled = true ∧ closure.projectionSummationStatementTyped = true ∧ closure.backendPredicateTyped = true ∧ closure.backendPredicateProved = false ∧ closure.projectionSummationProved = false ∧ closure.productBridgeProved = false ∧ closure.normalizedBlockEqualityProved = false ∧ closure.productToCoefficientProved = false ∧ closure.lcuCorrectProved = false ∧ closure.blockProjectionProved = false ∧ closure.blockCorrectProved = false ∧ closure.finalExtractionProved = false ∧ closure.exactRemainingObstruction = "the selected branch predicate clause is proved and predicate closure is conditional, but QBE still lacks the signal-zero branch-sum equality for the backend seven-slot family"
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchSumClosure_n3_transcript : have closure := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchSumClosure_n3; have packet := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendAllSlotSummandFormula_n3; have target := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContributionTarget_n3; closure.allSlotPacket = packet ∧ closure.backendBranchTarget = target ∧ closure.backendBranchContribution = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_n3 ∧ closure.selectedClauseStatement ∧ closure.selectedClauseTheorem = "oneTermRobinGamma3BoundaryBackendBranchContributionPredicate_selectedClause_n3" ∧ closure.conditionalPredicateClosureTheorem = "oneTermRobinGamma3BoundaryBackendBranchContributionPredicate_of_branchSum_n3" ∧ closure.requiredProjectionSummationTheorem = "BlockExtractionBranchContributionTarget.projectionSummationStatement oneTermRobinGamma3BoundaryBackendBranchContributionTarget_n3" ∧ closure.requiredSecondConjunct = "oneTermRobinGamma3BoundaryProjectionSummationObstruction_n3.signalBlockEntry = oneTermRobinGamma3BoundaryBranchContributionSum oneTermRobinGamma3BoundaryBackendBranchContribution_n3" ∧ closure.missingBackendField = "finite projection backend theorem expanding contract.expectedTarget.blockMatrix[0,0] as the fold over backend sparse-branch contributions" ∧ closure.selectedClauseProved = true ∧ closure.conditionalPredicateClosureCompiled = true ∧ closure.projectionSummationStatementTyped = true ∧ closure.backendPredicateTyped = true ∧ closure.backendPredicateProved = false ∧ closure.projectionSummationProved = false ∧ closure.productBridgeProved = false ∧ closure.normalizedBlockEqualityProved = false ∧ closure.productToCoefficientProved = false ∧ closure.lcuCorrectProved = false ∧ closure.blockProjectionProved = false ∧ closure.blockCorrectProved = false ∧ closure.finalExtractionProved = false ∧ closure.exactRemainingObstruction = "the selected branch predicate clause is proved and predicate closure is conditional, but QBE still lacks the signal-zero branch-sum equality for the backend seven-slot family"
Transcript theorem for the backend branch-sum closure target. The theorem verifies that the new packet consumes the all-slot summand formula, proves the selected predicate clause, and keeps the actual projection summation statement and every theorem-facing semantic flag false.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary backend projection statement signal entry n 3”; its local proof does not by itself complete the broader paper route. The signal entry used in the Robin-local obstruction is the block entry of the generic backend branch-contribution target.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The signal entry used in the Robin-local obstruction is the block entry of the generic backend branch-contribution target. This is an index/record bridge only. It does not assert that the block entry equals the folded branch contribution family.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:18476. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.329●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendProjectionStatement_signalEntry_n3 : QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSummationObstruction_n3.signalBlockEntry = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContributionTarget_n3.blockEntry
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendProjectionStatement_signalEntry_n3 : QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSummationObstruction_n3.signalBlockEntry = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContributionTarget_n3.blockEntry
The signal entry used in the Robin-local obstruction is the block entry of the generic backend branch-contribution target. This is an index/record bridge only. It does not assert that the block entry equals the folded branch contribution family.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary backend projection statement obstruction”. A proposition-valued field is a requirement until a constructor supplies it. Smallest obstruction after attempting the generic projection statement.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Smallest obstruction after attempting the generic projection statement. The previous declarations provide the all-slot branch family and the selected slot theorem. This packet records the remaining missing backend theorem: 'BlockExtractionTarget' exposes the signal-zero block entry, but it does not yet expose a proof that this entry expands as the fold over the backend sparse-branch contributions.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:18566. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.330●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBackendProjectionStatementObstruction : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBackendProjectionStatementObstruction : Type
Smallest obstruction after attempting the generic projection statement. The previous declarations provide the all-slot branch family and the selected slot theorem. This packet records the remaining missing backend theorem: `BlockExtractionTarget` exposes the signal-zero block entry, but it does not yet expose a proof that this entry expands as the fold over the backend sparse-branch contributions.
Fields
sourceAnchor : String
closurePacket : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBackendBranchSumClosure
branchContributionTarget : QuantumBlockEncoding.BlockExtractionBranchContributionTarget QuantumBlockEncoding.Coeff (QuantumBlockEncoding.gridSize 3) (QuantumBlockEncoding.gridSize 3) (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.effectiveRobinSignalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3))) 7
backendBranchContribution : Fin 7 → QuantumBlockEncoding.Coeff
genericProjectionStatement : Prop
focusedBranchSumStatement : Prop
equivalenceLemma : String
selectedClauseTheorem : String
conditionalPredicateClosureTheorem : String
requiredBackendField : String
requiredBackendTheorem : String
missingBackendField : String
blockEntryOnlyBridgeCompiled : Bool
equivalenceCompiled : Bool
selectedClauseProved : Bool
backendFieldAvailable : Bool
projectionSummationProved : Bool
backendPredicateProved : Bool
productBridgeProved : Bool
normalizedBlockEqualityProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
exactRemainingObstruction : String
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary backend projection statement obstruction n 3”. Compiled obstruction for the current lower target.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Compiled obstruction for the current lower target. No theorem-facing flag is promoted. The packet only names the exact missing projection-backend field required to turn the current all-slot family into the signal-zero block-entry sum.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:18605. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.331●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendProjectionStatementObstruction_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBackendProjectionStatementObstruction
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendProjectionStatementObstruction_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBackendProjectionStatementObstruction
Compiled obstruction for the current lower target. No theorem-facing flag is promoted. The packet only names the exact missing projection-backend field required to turn the current all-slot family into the signal-zero block-entry sum.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary backend expansion bridge”. A proposition-valued field is a requirement until a constructor supplies it. Proof-DAG packet for the remaining backend-expansion theorem.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Proof-DAG packet for the remaining backend-expansion theorem. The packet records that the generic backend-expansion interface is now available and that it conditionally closes the focused projection statement. The actual sparse-slot fold theorem is still absent, so all theorem-facing semantic flags remain false.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:18785. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.332●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBackendExpansionBridge : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBackendExpansionBridge : Type
Proof-DAG packet for the remaining backend-expansion theorem. The packet records that the generic backend-expansion interface is now available and that it conditionally closes the focused projection statement. The actual sparse-slot fold theorem is still absent, so all theorem-facing semantic flags remain false.
Fields
sourceAnchor : String
projectionStatementObstruction : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBackendProjectionStatementObstruction
branchContributionTarget : QuantumBlockEncoding.BlockExtractionBranchContributionTarget QuantumBlockEncoding.Coeff (QuantumBlockEncoding.gridSize 3) (QuantumBlockEncoding.gridSize 3) (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.effectiveRobinSignalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3))) 7
backendExpansionStatement : Prop
projectionSummationStatement : Prop
focusedBranchSumStatement : Prop
genericEquivalenceLemma : String
robinEquivalenceLemma : String
conditionalProjectionTheorem : String
conditionalPredicateTheorem : String
requiredBackendTheorem : String
backendExpansionStatementTyped : Bool
genericEquivalenceCompiled : Bool
robinEquivalenceCompiled : Bool
conditionalProjectionCompiled : Bool
conditionalPredicateCompiled : Bool
backendExpansionProved : Bool
projectionSummationProved : Bool
backendPredicateProved : Bool
productBridgeProved : Bool
normalizedBlockEqualityProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
exactRemainingObstruction : String
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary backend expansion bridge n 3”. Compiled backend-expansion bridge packet for the focused boundary branch.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Compiled backend-expansion bridge packet for the focused boundary branch. This is an interface refinement, not a proof of the sparse-branch expansion. It keeps the current 'oneTermRobinGamma3ProductToCoefficientObligation 3 0 0' blocked until Lean proves the backend expansion statement.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:18826. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.333●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendExpansionBridge_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBackendExpansionBridge
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendExpansionBridge_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBackendExpansionBridge
Compiled backend-expansion bridge packet for the focused boundary branch. This is an interface refinement, not a proof of the sparse-branch expansion. It keeps the current `oneTermRobinGamma3ProductToCoefficientObligation 3 0 0` blocked until Lean proves the backend expansion statement.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary backend expansion bridge n 3 transcript”; its local proof does not by itself complete the broader paper route. Transcript theorem for the backend-expansion bridge packet.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Transcript theorem for the backend-expansion bridge packet. The theorem verifies that the packet uses the generic proof-DAG interface, records the Robin-local equivalence, and keeps the backend expansion and all theorem-facing semantic flags false.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:18879. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.334●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendExpansionBridge_n3_transcript : have bridge := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendExpansionBridge_n3; have obstruction := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendProjectionStatementObstruction_n3; have target := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContributionTarget_n3; bridge.projectionStatementObstruction = obstruction ∧ bridge.branchContributionTarget = target ∧ bridge.backendExpansionStatement = target.backendExpansionStatement ∧ bridge.projectionSummationStatement = target.projectionSummationStatement ∧ bridge.focusedBranchSumStatement = (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSummationObstruction_n3.signalBlockEntry = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchContributionSum QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_n3) ∧ bridge.genericEquivalenceLemma = "BlockExtractionBranchContributionTarget.projectionSummationStatement_iff_backendExpansionStatement" ∧ bridge.robinEquivalenceLemma = "oneTermRobinGamma3BoundaryBackendExpansionStatement_equivBranchSum_n3" ∧ bridge.conditionalProjectionTheorem = "oneTermRobinGamma3BoundaryBackendProjectionStatement_of_backendExpansion_n3" ∧ bridge.conditionalPredicateTheorem = "oneTermRobinGamma3BoundaryBackendBranchContributionPredicate_of_targetProjection_n3" ∧ bridge.requiredBackendTheorem = "oneTermRobinGamma3BoundaryBackendBranchContributionTarget_n3.backendExpansionStatement" ∧ bridge.backendExpansionStatementTyped = true ∧ bridge.genericEquivalenceCompiled = true ∧ bridge.robinEquivalenceCompiled = true ∧ bridge.conditionalProjectionCompiled = true ∧ bridge.conditionalPredicateCompiled = true ∧ bridge.backendExpansionProved = false ∧ bridge.projectionSummationProved = false ∧ bridge.backendPredicateProved = false ∧ bridge.productBridgeProved = false ∧ bridge.normalizedBlockEqualityProved = false ∧ bridge.productToCoefficientProved = false ∧ bridge.lcuCorrectProved = false ∧ bridge.blockProjectionProved = false ∧ bridge.blockCorrectProved = false ∧ bridge.finalExtractionProved = false ∧ bridge.exactRemainingObstruction = "the backend-expansion statement is typed and equivalent to the focused branch-sum equality, but the finite backend still has not proved the seven-slot fold for blockMatrix[0,0]"
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendExpansionBridge_n3_transcript : have bridge := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendExpansionBridge_n3; have obstruction := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendProjectionStatementObstruction_n3; have target := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContributionTarget_n3; bridge.projectionStatementObstruction = obstruction ∧ bridge.branchContributionTarget = target ∧ bridge.backendExpansionStatement = target.backendExpansionStatement ∧ bridge.projectionSummationStatement = target.projectionSummationStatement ∧ bridge.focusedBranchSumStatement = (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSummationObstruction_n3.signalBlockEntry = QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchContributionSum QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_n3) ∧ bridge.genericEquivalenceLemma = "BlockExtractionBranchContributionTarget.projectionSummationStatement_iff_backendExpansionStatement" ∧ bridge.robinEquivalenceLemma = "oneTermRobinGamma3BoundaryBackendExpansionStatement_equivBranchSum_n3" ∧ bridge.conditionalProjectionTheorem = "oneTermRobinGamma3BoundaryBackendProjectionStatement_of_backendExpansion_n3" ∧ bridge.conditionalPredicateTheorem = "oneTermRobinGamma3BoundaryBackendBranchContributionPredicate_of_targetProjection_n3" ∧ bridge.requiredBackendTheorem = "oneTermRobinGamma3BoundaryBackendBranchContributionTarget_n3.backendExpansionStatement" ∧ bridge.backendExpansionStatementTyped = true ∧ bridge.genericEquivalenceCompiled = true ∧ bridge.robinEquivalenceCompiled = true ∧ bridge.conditionalProjectionCompiled = true ∧ bridge.conditionalPredicateCompiled = true ∧ bridge.backendExpansionProved = false ∧ bridge.projectionSummationProved = false ∧ bridge.backendPredicateProved = false ∧ bridge.productBridgeProved = false ∧ bridge.normalizedBlockEqualityProved = false ∧ bridge.productToCoefficientProved = false ∧ bridge.lcuCorrectProved = false ∧ bridge.blockProjectionProved = false ∧ bridge.blockCorrectProved = false ∧ bridge.finalExtractionProved = false ∧ bridge.exactRemainingObstruction = "the backend-expansion statement is typed and equivalent to the focused branch-sum equality, but the finite backend still has not proved the seven-slot fold for blockMatrix[0,0]"
Transcript theorem for the backend-expansion bridge packet. The theorem verifies that the packet uses the generic proof-DAG interface, records the Robin-local equivalence, and keeps the backend expansion and all theorem-facing semantic flags false.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary backend unitary entry fold target”. A proposition-valued field is a requirement until a constructor supplies it. Smallest current projection-backend target after moving from the cached block entry to the full finite product entry.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Smallest current projection-backend target after moving from the cached block entry to the full finite product entry. The record points at the exact next theorem: the signal-zero full-unitary entry selected by 'def:block-encoding' must be expanded as the seven-slot backend fold. It keeps the backend expansion, product-to-coefficient theorem, LCU, block projection, block correctness, and final extraction flags false.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:19020. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.335●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBackendUnitaryEntryFoldTarget : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBackendUnitaryEntryFoldTarget : Type
Smallest current projection-backend target after moving from the cached block entry to the full finite product entry. The record points at the exact next theorem: the signal-zero full-unitary entry selected by `def:block-encoding` must be expanded as the seven-slot backend fold. It keeps the backend expansion, product-to-coefficient theorem, LCU, block projection, block correctness, and final extraction flags false.
Fields
sourceAnchor : String
backendExpansionBridge : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBackendExpansionBridge
branchContributionTarget : QuantumBlockEncoding.BlockExtractionBranchContributionTarget QuantumBlockEncoding.Coeff (QuantumBlockEncoding.gridSize 3) (QuantumBlockEncoding.gridSize 3) (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.effectiveRobinSignalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3))) 7
signalBlockEntry : QuantumBlockEncoding.Coeff
signalUnitaryEntry : QuantumBlockEncoding.Coeff
backendBranchContribution : Fin 7 → QuantumBlockEncoding.Coeff
backendBranchFold : QuantumBlockEncoding.Coeff
backendExpansionStatement : Prop
unitaryEntryFoldStatement : Prop
blockEntryUnitaryLemma : String
equivalenceLemma : String
requiredFullProductFoldTheorem : String
missingProjectionBackendField : String
blockEntryUnitaryBridgeCompiled : Bool
unitaryEntryFoldStatementTyped : Bool
backendExpansionEquivalentToUnitaryFold : Bool
backendExpansionProved : Bool
projectionSummationProved : Bool
backendPredicateProved : Bool
productBridgeProved : Bool
normalizedBlockEqualityProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
exactRemainingObstruction : String
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary backend unitary entry fold target n 3”. Concrete unitary-entry fold target for the focused 'n = 3' boundary branch.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Concrete unitary-entry fold target for the focused 'n = 3' boundary branch. This is the accepted fallback when the preferred backend expansion theorem is not available: it replaces the broad block-matrix fold obligation by the full-product entry fold that a finite projection backend must provide.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:19060. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.336●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendUnitaryEntryFoldTarget_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBackendUnitaryEntryFoldTarget
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendUnitaryEntryFoldTarget_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBackendUnitaryEntryFoldTarget
Concrete unitary-entry fold target for the focused `n = 3` boundary branch. This is the accepted fallback when the preferred backend expansion theorem is not available: it replaces the broad block-matrix fold obligation by the full-product entry fold that a finite projection backend must provide.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary backend unitary entry fold support target”. A proposition-valued field is a requirement until a constructor supplies it. Support packet for the remaining full-unitary entry fold.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Support packet for the remaining full-unitary entry fold. The packet records the finite fold domain, proves that the focused slot '2' is inside that domain, and keeps the actual theorem 'signalUnitaryEntry = blockExtractionBranchContributionSum ...' as the remaining projection-backend obligation.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:19190. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.337●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBackendUnitaryEntryFoldSupportTarget : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBackendUnitaryEntryFoldSupportTarget : Type
Support packet for the remaining full-unitary entry fold. The packet records the finite fold domain, proves that the focused slot `2` is inside that domain, and keeps the actual theorem `signalUnitaryEntry = blockExtractionBranchContributionSum ...` as the remaining projection-backend obligation.
Fields
sourceAnchor : String
unitaryEntryFoldTarget : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBackendUnitaryEntryFoldTarget
branchContributionTarget : QuantumBlockEncoding.BlockExtractionBranchContributionTarget QuantumBlockEncoding.Coeff (QuantumBlockEncoding.gridSize 3) (QuantumBlockEncoding.gridSize 3) (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.effectiveRobinSignalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3))) 7
backendBranchContribution : Fin 7 → QuantumBlockEncoding.Coeff
foldIndexList : List (Fin 7)
selectedBranch : Fin 7
selectedBranchIndex : ℕ
selectedBranchFullIndex : Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3)))
selectedBranchInFoldStatement : Prop
selectedContributionStatement : Prop
unitaryEntryFoldStatement : Prop
selectedBranchMembershipLemma : String
selectedContributionLemma : String
requiredFullProductFoldTheorem : String
missingProjectionBackendField : String
foldDomainTyped : Bool
selectedBranchInFoldProved : Bool
selectedContributionProved : Bool
unitaryEntryFoldStatementTyped : Bool
fullProductFoldProved : Bool
projectionSummationProved : Bool
backendPredicateProved : Bool
productBridgeProved : Bool
normalizedBlockEqualityProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
exactRemainingObstruction : String
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary backend unitary entry fold support target n 3”. Concrete fold-support target for the focused 'n = 3' boundary branch.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Concrete fold-support target for the focused 'n = 3' boundary branch. This refines the obstruction from "prove a seven-slot fold" to the exact remaining backend theorem: the fold domain contains slot '2' and the slot is already identified with the accepted summand, but Lean still lacks the finite product/projection proof that the full signal-zero entry equals the complete seven-slot fold.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:19237. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.338●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendUnitaryEntryFoldSupportTarget_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBackendUnitaryEntryFoldSupportTarget
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendUnitaryEntryFoldSupportTarget_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBackendUnitaryEntryFoldSupportTarget
Concrete fold-support target for the focused `n = 3` boundary branch. This refines the obstruction from "prove a seven-slot fold" to the exact remaining backend theorem: the fold domain contains slot `2` and the slot is already identified with the accepted summand, but Lean still lacks the finite product/projection proof that the full signal-zero entry equals the complete seven-slot fold.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary prepared branch contribution formula n 3”; its local proof does not by itself complete the broader paper route. Every backend sparse-slot contribution is the corresponding branch-diagonal seven-gate entry, multiplied by the two sparse-register projection amplitudes.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Every backend sparse-slot contribution is the corresponding branch-diagonal seven-gate entry, multiplied by the two sparse-register projection amplitudes. This is the all-slot formula that was implicit in 'oneTermRobinGamma3BoundaryBackendBranchContribution_n3'. It is not the full-entry fold theorem: it only identifies the summands of that fold.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:19361. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.339●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPreparedBranchContribution_formula_n3 (s : Fin 7) : QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_n3 s = (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySevenGateMatrix_n3 (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchFullIndex_n3 s) (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchFullIndex_n3 s)).mul ((QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv").mul (QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv"))
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPreparedBranchContribution_formula_n3 (s : Fin 7) : QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_n3 s = (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySevenGateMatrix_n3 (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchFullIndex_n3 s) (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchFullIndex_n3 s)).mul ((QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv").mul (QuantumBlockEncoding.Coeff.symbol "sqrt_kappa_inv"))
Every backend sparse-slot contribution is the corresponding branch-diagonal seven-gate entry, multiplied by the two sparse-register projection amplitudes. This is the all-slot formula that was implicit in `oneTermRobinGamma3BoundaryBackendBranchContribution_n3`. It is not the full-entry fold theorem: it only identifies the summands of that fold.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary prepared branch expansion target”. A proposition-valued field is a requirement until a constructor supplies it. Typed target for the prepared branch expansion still missing from the focused projection bridge.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Typed target for the prepared branch expansion still missing from the focused projection bridge. The current 'CircuitMatrixSemantics' exposes the raw seven-gate product entry selected by the signal-zero block convention. The branch fold, however, also uses the external sparse-register preparation/projection amplitudes. This packet proves the all-slot summand formula and records the missing backend field as a prepared-projection theorem, rather than promoting the fold itself.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:19383. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.340●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryPreparedBranchExpansionTarget : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryPreparedBranchExpansionTarget : Type
Typed target for the prepared branch expansion still missing from the focused projection bridge. The current `CircuitMatrixSemantics` exposes the raw seven-gate product entry selected by the signal-zero block convention. The branch fold, however, also uses the external sparse-register preparation/projection amplitudes. This packet proves the all-slot summand formula and records the missing backend field as a prepared-projection theorem, rather than promoting the fold itself.
Fields
sourceAnchor : String
foldSupportTarget : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBackendUnitaryEntryFoldSupportTarget
unitaryEntryFoldTarget : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryBackendUnitaryEntryFoldTarget
branchContributionTarget : QuantumBlockEncoding.BlockExtractionBranchContributionTarget QuantumBlockEncoding.Coeff (QuantumBlockEncoding.gridSize 3) (QuantumBlockEncoding.gridSize 3) (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.effectiveRobinSignalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3))) 7
rawSignalUnitaryEntry : QuantumBlockEncoding.Coeff
backendBranchContribution : Fin 7 → QuantumBlockEncoding.Coeff
branchFullIndex : Fin 7 → Fin (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3)))
branchMatrix : QuantumBlockEncoding.Matrix (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3))) (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3))) QuantumBlockEncoding.Coeff
ketAmplitude : QuantumBlockEncoding.Coeff
braAmplitude : QuantumBlockEncoding.Coeff
amplitudeProduct : QuantumBlockEncoding.Coeff
branchContributionFormulaStatement : Prop
unitaryEntryFoldStatement : Prop
preparedProjectionBackendStatement : Prop
branchContributionFormulaLemma : String
requiredPreparedProjectionTheorem : String
rawCircuitMatrixSource : String
missingPreparedProjectionField : String
branchContributionFormulaProved : Bool
preparedProjectionBackendStatementTyped : Bool
rawCircuitMatrixExposed : Bool
preparedProjectionBackendAvailable : Bool
fullProductFoldProved : Bool
projectionSummationProved : Bool
backendPredicateProved : Bool
productBridgeProved : Bool
normalizedBlockEqualityProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
exactRemainingObstruction : String
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary prepared branch expansion target n 3”. Concrete prepared-branch expansion target for the focused 'n = 3' boundary branch.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Concrete prepared-branch expansion target for the focused 'n = 3' boundary branch. The packet narrows the missing interface: the summands are now proved to be the prepared branch entries, and the only absent theorem is the backend proof that the raw signal-zero entry expands through those prepared branches.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:19438. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.341●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPreparedBranchExpansionTarget_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryPreparedBranchExpansionTarget
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPreparedBranchExpansionTarget_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryPreparedBranchExpansionTarget
Concrete prepared-branch expansion target for the focused `n = 3` boundary branch. The packet narrows the missing interface: the summands are now proved to be the prepared branch entries, and the only absent theorem is the backend proof that the raw signal-zero entry expands through those prepared branches.
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary sparse clean index n 3”. Clean sparse-register column index for the focused 'H_W^(kappa)' packet.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Clean sparse-register column index for the focused 'H_W^(kappa)' packet.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:19582. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.342●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySparseCleanIndex_n3 : Fin 8
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySparseCleanIndex_n3 : Fin 8
Clean sparse-register column index for the focused `H_W^(kappa)` packet.
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary sparse slot index n 3”. Embed one of the seven paper sparse slots into the eight-dimensional register.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Embed one of the seven paper sparse slots into the eight-dimensional register.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:19586. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.343●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySparseSlotIndex_n3 (s : Fin 7) : Fin 8
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySparseSlotIndex_n3 (s : Fin 7) : Fin 8
Embed one of the seven paper sparse slots into the eight-dimensional register.
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary hw kappa uniform column all slots statement n 3”. Focused uniform-column statement for the sparse-register preparation matrix.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Focused uniform-column statement for the sparse-register preparation matrix. This is the exact local shape of the Shukla--Vedula contract needed by the prepared projection bridge: each of the seven paper slots has clean-column amplitude 'sqrt_kappa_inv'.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:19596. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.344●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaUniformColumnAllSlotsStatement_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) : Prop
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaUniformColumnAllSlotsStatement_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) : Prop
Focused uniform-column statement for the sparse-register preparation matrix. This is the exact local shape of the Shukla--Vedula contract needed by the prepared projection bridge: each of the seven paper slots has clean-column amplitude `sqrt_kappa_inv`.
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary prepared projection sandwich contribution n 3”. Prepared sandwich contribution for one sparse slot.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Prepared sandwich contribution for one sparse slot. The expression is the local branch-diagonal seven-gate entry multiplied by the ket-side 'H_W^(kappa)' clean-column amplitude and the matching transpose-style bra amplitude. It is the smallest matrix object missing from the raw 'CircuitMatrixSemantics' block entry.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:19611. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.345●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPreparedProjectionSandwichContribution_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) (s : Fin 7) : QuantumBlockEncoding.Coeff
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPreparedProjectionSandwichContribution_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) (s : Fin 7) : QuantumBlockEncoding.Coeff
Prepared sandwich contribution for one sparse slot. The expression is the local branch-diagonal seven-gate entry multiplied by the ket-side `H_W^(kappa)` clean-column amplitude and the matching transpose-style bra amplitude. It is the smallest matrix object missing from the raw `CircuitMatrixSemantics` block entry.
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary prepared projection sandwich sum n 3”. Fold the prepared sandwich contributions over the seven paper sparse slots.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Fold the prepared sandwich contributions over the seven paper sparse slots.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:19625. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.346●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPreparedProjectionSandwichSum_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) : QuantumBlockEncoding.Coeff
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPreparedProjectionSandwichSum_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) : QuantumBlockEncoding.Coeff
Fold the prepared sandwich contributions over the seven paper sparse slots.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary prepared projection sandwich backend target”. A proposition-valued field is a requirement until a constructor supplies it. Smallest prepared-projection backend field still missing from the current matrix semantics.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Smallest prepared-projection backend field still missing from the current matrix semantics. QBE can now prove that a prepared 'H_W^(kappa)^dagger * U * H_W^(kappa)' sandwich fold specializes to the backend branch sum. What remains absent is a field or theorem connecting the raw signal-zero entry exposed by 'CircuitMatrixSemantics' to that prepared sandwich fold.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:19712. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.347●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryPreparedProjectionSandwichBackendTarget : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryPreparedProjectionSandwichBackendTarget : Type
Smallest prepared-projection backend field still missing from the current matrix semantics. QBE can now prove that a prepared `H_W^(kappa)^dagger * U * H_W^(kappa)` sandwich fold specializes to the backend branch sum. What remains absent is a field or theorem connecting the raw signal-zero entry exposed by `CircuitMatrixSemantics` to that prepared sandwich fold.
Fields
sourceAnchor : String
preparedBranchExpansionTarget : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryPreparedBranchExpansionTarget
cleanColumnContract : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryHWKappaCleanColumnContract
sparseCleanIndex : ℕ
sparseSlotDomain : List ℕ
sparsePreparationMatrixType : String
sparseDaggerMatrixType : String
preparedSandwichContributionFormula : String
preparedSandwichSumFormula : String
uniformColumnStatementName : String
contributionSpecializationTheorem : String
sumSpecializationTheorem : String
conditionalUnitaryFoldTheorem : String
requiredPreparedProjectionBackendField : String
missingPreparedProjectionBackendField : String
uniformColumnObligation : QuantumBlockEncoding.SemanticObligation
preparedProjectionBackendObligation : QuantumBlockEncoding.SemanticObligation
preparedSandwichContributionSpecialized : Bool
preparedSandwichSumSpecialized : Bool
conditionalUnitaryFoldCompiled : Bool
preparedProjectionBackendAvailable : Bool
fullProductFoldProved : Bool
projectionSummationProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
exactRemainingObstruction : String
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary prepared projection sandwich backend target n 3”. Concrete prepared-sandwich backend target for the focused 'n = 3' boundary branch.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Concrete prepared-sandwich backend target for the focused 'n = 3' boundary branch. This is a strict reduction of the previous obstruction: the branch summands and their fold are now connected to an explicit 'H_W^(kappa)' clean-column matrix contract. The missing theorem is only the raw-entry-to-prepared-fold backend field.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:19753. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.348●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPreparedProjectionSandwichBackendTarget_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryPreparedProjectionSandwichBackendTarget
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPreparedProjectionSandwichBackendTarget_n3 : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryPreparedProjectionSandwichBackendTarget
Concrete prepared-sandwich backend target for the focused `n = 3` boundary branch. This is a strict reduction of the previous obstruction: the branch summands and their fold are now connected to an explicit `H_W^(kappa)` clean-column matrix contract. The missing theorem is only the raw-entry-to-prepared-fold backend field.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary raw entry prepared sandwich circuit field”. A proposition-valued field is a requirement until a constructor supplies it. Typed raw-entry field needed by the prepared-sandwich backend.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Typed raw-entry field needed by the prepared-sandwich backend. The previous packet proved that a prepared sparse-register sandwich fold specializes to the backend branch fold under the clean-column contract. This record names the smaller remaining finite matrix field: the actual signal-zero entry exposed by 'CircuitMatrixSemantics' must equal that prepared sandwich fold. It does not assert that field.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:19884. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.349●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryRawEntryPreparedSandwichCircuitField : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryRawEntryPreparedSandwichCircuitField : Type
Typed raw-entry field needed by the prepared-sandwich backend. The previous packet proved that a prepared sparse-register sandwich fold specializes to the backend branch fold under the clean-column contract. This record names the smaller remaining finite matrix field: the actual signal-zero entry exposed by `CircuitMatrixSemantics` must equal that prepared sandwich fold. It does not assert that field.
Fields
sourceAnchor : String
preparedSandwichBackendTarget : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryPreparedProjectionSandwichBackendTarget
sparsePreparationMatrix : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff
rawUnitaryEntry : QuantumBlockEncoding.Coeff
preparedSandwichSum : QuantumBlockEncoding.Coeff
uniformColumnStatement : Prop
rawEntryPreparedSandwichStatement : Prop
preferredUnitaryEntryFoldStatement : Prop
rawCircuitSemanticsEntryFormula : String
requiredCircuitMatrixField : String
conditionalFoldTheorem : String
uniformColumnObligation : QuantumBlockEncoding.SemanticObligation
rawEntryPreparedSandwichObligation : QuantumBlockEncoding.SemanticObligation
rawEntryPreparedSandwichStatementTyped : Bool
conditionalFoldBridgeCompiled : Bool
preparedProjectionBackendAvailable : Bool
fullProductFoldProved : Bool
projectionSummationProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
exactRemainingObstruction : String
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary raw entry prepared sandwich circuit field n 3”. Concrete raw-entry prepared-sandwich field for the focused boundary packet.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Concrete raw-entry prepared-sandwich field for the focused boundary packet. The matrix 'H' is the sparse-register preparation matrix named by the source contract. The record keeps the Shukla--Vedula clean-column contract separate from the QBE-local raw circuit-entry theorem.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:19918. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.350●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRawEntryPreparedSandwichCircuitField_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryRawEntryPreparedSandwichCircuitField
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRawEntryPreparedSandwichCircuitField_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryRawEntryPreparedSandwichCircuitField
Concrete raw-entry prepared-sandwich field for the focused boundary packet. The matrix `H` is the sparse-register preparation matrix named by the source contract. The record keeps the Shukla--Vedula clean-column contract separate from the QBE-local raw circuit-entry theorem.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary raw unitary entry contract matrix n 3”; its local proof does not by itself complete the broader paper route. The raw entry in the focused packet is the active seven-gate circuit product entry selected by the finite block-extraction contract.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The raw entry in the focused packet is the active seven-gate circuit product entry selected by the finite block-extraction contract. This is smaller than the prepared-sandwich theorem: it identifies the source of the raw entry without asserting that the active circuit product already contains the sparse-register preparation and its adjoint.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:20119. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.351●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRawUnitaryEntry_contractMatrix_n3 : QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSummationTarget_n3.signalUnitaryEntry = (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteBlockCompositionContract 3).expectedTarget.unitaryMatrix ⟨0, ⋯⟩ ⟨0, ⋯⟩
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryRawUnitaryEntry_contractMatrix_n3 : QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSummationTarget_n3.signalUnitaryEntry = (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinFiniteBlockCompositionContract 3).expectedTarget.unitaryMatrix ⟨0, ⋯⟩ ⟨0, ⋯⟩
The raw entry in the focused packet is the active seven-gate circuit product entry selected by the finite block-extraction contract. This is smaller than the prepared-sandwich theorem: it identifies the source of the raw entry without asserting that the active circuit product already contains the sparse-register preparation and its adjoint.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary sparse preparation gates absent n 3”; its local proof does not by itself complete the broader paper route. The active Fig.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The active Fig. 1-term Robin gate list does not include the external 'H_W^(kappa)' sparse-register preparation block or its adjoint. The missing prepared-sandwich theorem therefore cannot be obtained by simply unfolding 'oneTermRobinGateMatrixPlaceholders'; QBE still needs either a prepared circuit semantics object or a theorem identifying the active raw entry with that prepared circuit entry.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:20135. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.352●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySparsePreparationGates_absent_n3 : QuantumBlockEncoding.Gate.oracleCall "H_W^(kappa)" ∉ List.map (fun gateMatrix => gateMatrix.gate) (QuantumBlockEncoding.GHL2025.oneTermRobinGateMatrixPlaceholders (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3)) ∧ QuantumBlockEncoding.Gate.oracleCall "(H_W^(kappa))^dagger" ∉ List.map (fun gateMatrix => gateMatrix.gate) (QuantumBlockEncoding.GHL2025.oneTermRobinGateMatrixPlaceholders (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3))
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySparsePreparationGates_absent_n3 : QuantumBlockEncoding.Gate.oracleCall "H_W^(kappa)" ∉ List.map (fun gateMatrix => gateMatrix.gate) (QuantumBlockEncoding.GHL2025.oneTermRobinGateMatrixPlaceholders (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3)) ∧ QuantumBlockEncoding.Gate.oracleCall "(H_W^(kappa))^dagger" ∉ List.map (fun gateMatrix => gateMatrix.gate) (QuantumBlockEncoding.GHL2025.oneTermRobinGateMatrixPlaceholders (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3))
The active Fig. 1-term Robin gate list does not include the external `H_W^(kappa)` sparse-register preparation block or its adjoint. The missing prepared-sandwich theorem therefore cannot be obtained by simply unfolding `oneTermRobinGateMatrixPlaceholders`; QBE still needs either a prepared circuit semantics object or a theorem identifying the active raw entry with that prepared circuit entry.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary prepared circuit semantics gap”. A proposition-valued field is a requirement until a constructor supplies it. Smallest prepared-circuit semantics gap after exposing the raw entry.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Smallest prepared-circuit semantics gap after exposing the raw entry. The current raw entry is the active seven-gate 'CircuitMatrixSemantics' entry at '[0,0]'. The prepared-sandwich equality needs a circuit-matrix field for the source-preparation sandwich 'H_W^(kappa)^dagger * U * H_W^(kappa)', or an equivalent theorem relating the active raw entry to that prepared entry. This record does not add an assumption and does not promote any theorem-facing semantic flag.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:20154. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.353●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryPreparedCircuitSemanticsGap : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryPreparedCircuitSemanticsGap : Type
Smallest prepared-circuit semantics gap after exposing the raw entry. The current raw entry is the active seven-gate `CircuitMatrixSemantics` entry at `[0,0]`. The prepared-sandwich equality needs a circuit-matrix field for the source-preparation sandwich `H_W^(kappa)^dagger * U * H_W^(kappa)`, or an equivalent theorem relating the active raw entry to that prepared entry. This record does not add an assumption and does not promote any theorem-facing semantic flag.
Fields
sourceAnchor : String
rawEntryField : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryRawEntryPreparedSandwichCircuitField
rawUnitaryEntryContractStatementName : String
sparsePreparationGateAbsentStatementName : String
sparsePreparationDaggerGateAbsentStatementName : String
rawUnitaryEntryContractLemma : String
sparsePreparationAbsenceLemma : String
requiredPreparedCircuitSemantics : String
missingPreparedMatrixField : String
rawEntryContractProved : Bool
sparsePreparationAbsenceProved : Bool
rawEntryPreparedSandwichStatementTyped : Bool
preparedCircuitSemanticsAvailable : Bool
preparedCircuitEntryEqualityProved : Bool
fullProductFoldProved : Bool
projectionSummationProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
exactRemainingObstruction : String
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary prepared circuit semantics gap n 3”. Compiled prepared-circuit semantics gap for the focused 'n = 3' boundary packet.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Compiled prepared-circuit semantics gap for the focused 'n = 3' boundary packet. This is a strict refinement of the raw-entry field: Lean now knows that the raw entry is sourced from the active seven-gate contract matrix and that no 'H_W^(kappa)' preparation gate is present in that active gate list. The next field must therefore be a prepared circuit semantics matrix, not another restatement of the same raw-entry equality.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:20188. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.354●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPreparedCircuitSemanticsGap_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryPreparedCircuitSemanticsGap
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPreparedCircuitSemanticsGap_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryPreparedCircuitSemanticsGap
Compiled prepared-circuit semantics gap for the focused `n = 3` boundary packet. This is a strict refinement of the raw-entry field: Lean now knows that the raw entry is sourced from the active seven-gate contract matrix and that no `H_W^(kappa)` preparation gate is present in that active gate list. The next field must therefore be a prepared circuit semantics matrix, not another restatement of the same raw-entry equality.
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary prepared circuit sparse matrix n 3”. Compressed prepared sparse-register sandwich matrix for the focused boundary branch.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Compressed prepared sparse-register sandwich matrix for the focused boundary branch. Rows and columns are sparse-register indices. The clean-clean entry is the seven-slot fold for the prepared 'H_W^(kappa)^dagger * oneTermRobinGamma3BoundarySevenGateMatrix_n3 * H_W^(kappa)' sandwich. This is a local matrix-interface block; it does not assert that the active raw circuit entry equals this prepared entry.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:20287. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.355●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPreparedCircuitSparseMatrix_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPreparedCircuitSparseMatrix_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff
Compressed prepared sparse-register sandwich matrix for the focused boundary branch. Rows and columns are sparse-register indices. The clean-clean entry is the seven-slot fold for the prepared `H_W^(kappa)^dagger * oneTermRobinGamma3BoundarySevenGateMatrix_n3 * H_W^(kappa)` sandwich. This is a local matrix-interface block; it does not assert that the active raw circuit entry equals this prepared entry.
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary prepared composite gate n 3”. Composite prepared sparse-register gate for the focused boundary packet.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Composite prepared sparse-register gate for the focused boundary packet. This is a local semantics object for the source-side prepared product 'H_W^(kappa)^dagger * U * H_W^(kappa)' on the sparse register. Its unitarity claim stays false because the cited state-preparation and diagonal-product certificates are not being proved in this lower packet.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:20369. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.356●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPreparedCompositeGate_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) : QuantumBlockEncoding.GateMatrix QuantumBlockEncoding.Coeff 3
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPreparedCompositeGate_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) : QuantumBlockEncoding.GateMatrix QuantumBlockEncoding.Coeff 3
Composite prepared sparse-register gate for the focused boundary packet. This is a local semantics object for the source-side prepared product `H_W^(kappa)^dagger * U * H_W^(kappa)` on the sparse register. Its unitarity claim stays false because the cited state-preparation and diagonal-product certificates are not being proved in this lower packet.
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary prepared composite circuit n 3”. Singleton circuit for the prepared sparse-register composite gate.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Singleton circuit for the prepared sparse-register composite gate.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:20384. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.357●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPreparedCompositeCircuit_n3 : QuantumBlockEncoding.Circuit
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPreparedCompositeCircuit_n3 : QuantumBlockEncoding.Circuit
Singleton circuit for the prepared sparse-register composite gate.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary prepared composite gate matches circuit n 3”; its local proof does not by itself complete the broader paper route. The prepared composite gate matrix matches its singleton circuit label.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The prepared composite gate matrix matches its singleton circuit label.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:20389. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.358●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPreparedCompositeGateMatchesCircuit_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) : QuantumBlockEncoding.gateMatricesMatchCircuit QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPreparedCompositeCircuit_n3 [QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPreparedCompositeGate_n3 H] = true
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPreparedCompositeGateMatchesCircuit_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) : QuantumBlockEncoding.gateMatricesMatchCircuit QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPreparedCompositeCircuit_n3 [QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPreparedCompositeGate_n3 H] = true
The prepared composite gate matrix matches its singleton circuit label.
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary prepared composite circuit semantics n 3”. Circuit-matrix semantics for the prepared sparse-register composite.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Circuit-matrix semantics for the prepared sparse-register composite. This is not the active seven-gate Fig. 1-term Robin circuit. It is the prepared-side matrix object that the source projection step requires before one can relate the active signal-zero entry to a prepared clean entry.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:20404. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.359●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPreparedCompositeCircuitSemantics_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) : QuantumBlockEncoding.CircuitMatrixSemantics QuantumBlockEncoding.Coeff 3
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPreparedCompositeCircuitSemantics_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) : QuantumBlockEncoding.CircuitMatrixSemantics QuantumBlockEncoding.Coeff 3
Circuit-matrix semantics for the prepared sparse-register composite. This is not the active seven-gate Fig. 1-term Robin circuit. It is the prepared-side matrix object that the source projection step requires before one can relate the active signal-zero entry to a prepared clean entry.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary prepared circuit matrix interface”. A proposition-valued field is a requirement until a constructor supplies it. Prepared-circuit matrix interface for the current projection backend.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Prepared-circuit matrix interface for the current projection backend. This packet supplies the missing prepared sparse-register matrix object and proves its clean entry is the prepared sandwich fold. It leaves the theorem connecting the active raw 'CircuitMatrixSemantics' entry to this prepared matrix entry as the exact remaining obstruction.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:20486. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.360●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryPreparedCircuitMatrixInterface : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryPreparedCircuitMatrixInterface : Type
Prepared-circuit matrix interface for the current projection backend. This packet supplies the missing prepared sparse-register matrix object and proves its clean entry is the prepared sandwich fold. It leaves the theorem connecting the active raw `CircuitMatrixSemantics` entry to this prepared matrix entry as the exact remaining obstruction.
Fields
sourceAnchor : String
preparedCircuitGap : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryPreparedCircuitSemanticsGap
sparsePreparationMatrix : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff
preparedSparseMatrix : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff
preparedCompositeSemantics : QuantumBlockEncoding.CircuitMatrixSemantics QuantumBlockEncoding.Coeff 3
cleanRow : Fin 8
cleanColumn : Fin 8
cleanEntry : QuantumBlockEncoding.Coeff
preparedCompositeCleanEntry : QuantumBlockEncoding.Coeff
preparedSandwichSum : QuantumBlockEncoding.Coeff
cleanEntryStatement : Prop
preparedCompositeCleanEntryEvalStatement : Prop
activeEntryToPreparedEntryStatement : Prop
cleanEntryLemma : String
preparedCompositeCleanEntryEvalLemma : String
conditionalUnitaryFoldTheorem : String
requiredActivePreparedEntryTheorem : String
preparedSparseMatrixAvailable : Bool
preparedCompositeSemanticsAvailable : Bool
cleanEntryStatementProved : Bool
preparedCompositeCleanEntryEvalCompiled : Bool
activePreparedEntryEqualityProved : Bool
fullProductFoldProved : Bool
projectionSummationProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
exactRemainingObstruction : String
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary prepared circuit matrix interface n 3”. Concrete prepared-circuit matrix interface for the focused 'n = 3' boundary branch.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Concrete prepared-circuit matrix interface for the focused 'n = 3' boundary branch. The prepared sparse matrix is now a Lean object. The active route remains blocked only on the raw-entry theorem identifying 'signalUnitaryEntry' with that prepared matrix's clean-clean entry.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:20526. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.361●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPreparedCircuitMatrixInterface_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryPreparedCircuitMatrixInterface
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPreparedCircuitMatrixInterface_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryPreparedCircuitMatrixInterface
Concrete prepared-circuit matrix interface for the focused `n = 3` boundary branch. The prepared sparse matrix is now a Lean object. The active route remains blocked only on the raw-entry theorem identifying `signalUnitaryEntry` with that prepared matrix's clean-clean entry.
Plain-English reading. This abbreviation gives a shorter name to the type or expression used for “one term robin gamma 3 boundary active full dim n 3”. Full active matrix dimension for the focused 'n = 3' boundary packet.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Full active matrix dimension for the focused 'n = 3' boundary packet.
Declaration kind. abbrev.
Source: QuantumBlockEncoding/RobinMatrix.lean:20680. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.362●1 definition
Associated Lean declarations
-
abbrevdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
abbrev QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryActiveFullDim_n3 : ℕ
abbrev QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryActiveFullDim_n3 : ℕ
Full active matrix dimension for the focused `n = 3` boundary packet.
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary active clean index n 3”. Clean active full-basis index for the focused signal-zero/system-zero entry.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Clean active full-basis index for the focused signal-zero/system-zero entry.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:20685. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.363●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryActiveCleanIndex_n3 : Fin QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryActiveFullDim_n3
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryActiveCleanIndex_n3 : Fin QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryActiveFullDim_n3
Clean active full-basis index for the focused signal-zero/system-zero entry.
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary active prepared entry target n 3”. Typed active-entry/prepared-entry target for the focused boundary branch.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Typed active-entry/prepared-entry target for the focused boundary branch. The active entry is the current signal-zero entry from the seven-gate 'CircuitMatrixSemantics' product. The prepared entry is the clean-clean entry of the local sparse-register sandwich matrix. This target names the exact composition equality that is still missing; it does not prove that equality.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:20912. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.364●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryActivePreparedEntryTarget_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) : QuantumBlockEncoding.PreparedCircuitEntryTarget QuantumBlockEncoding.Coeff QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryActiveFullDim_n3 8
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryActivePreparedEntryTarget_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) : QuantumBlockEncoding.PreparedCircuitEntryTarget QuantumBlockEncoding.Coeff QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryActiveFullDim_n3 8
Typed active-entry/prepared-entry target for the focused boundary branch. The active entry is the current signal-zero entry from the seven-gate `CircuitMatrixSemantics` product. The prepared entry is the clean-clean entry of the local sparse-register sandwich matrix. This target names the exact composition equality that is still missing; it does not prove that equality.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary active prepared composition field target”. A proposition-valued field is a requirement until a constructor supplies it. Smallest prepared-composition field target now missing from the matrix backend.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Smallest prepared-composition field target now missing from the matrix backend. The previous packet produced the prepared sparse-register matrix and proved its clean entry. This packet exposes the next field as a generic 'PreparedCircuitEntryTarget': relate the active seven-gate signal-zero entry to the clean entry of the prepared sandwich matrix. All theorem-facing flags stay false.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:21087. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.365●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryActivePreparedCompositionFieldTarget : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryActivePreparedCompositionFieldTarget : Type
Smallest prepared-composition field target now missing from the matrix backend. The previous packet produced the prepared sparse-register matrix and proved its clean entry. This packet exposes the next field as a generic `PreparedCircuitEntryTarget`: relate the active seven-gate signal-zero entry to the clean entry of the prepared sandwich matrix. All theorem-facing flags stay false.
Fields
sourceAnchor : String
preparedMatrixInterface : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryPreparedCircuitMatrixInterface
entryTarget : QuantumBlockEncoding.PreparedCircuitEntryTarget QuantumBlockEncoding.Coeff QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryActiveFullDim_n3 8
activeEntryStatement : Prop
matrixEntryStatement : Prop
interfaceStatement : Prop
genericEntryTarget : String
matrixEntryEquivalenceLemma : String
requiredCompositionTheorem : String
missingCircuitSemanticsField : String
activeEntrySourceProved : Bool
preparedCleanEntryProved : Bool
entryTargetTyped : Bool
matrixEntryEquivalenceCompiled : Bool
preparedCompositionFieldAvailable : Bool
activePreparedEntryEqualityProved : Bool
fullProductFoldProved : Bool
projectionSummationProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
exactRemainingObstruction : String
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary active prepared composition field target n 3”. Concrete prepared-composition field target for the focused 'n = 3' boundary branch.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Concrete prepared-composition field target for the focused 'n = 3' boundary branch. This is the accepted fallback for the active-entry proof attempt: it is smaller than the previous interface because it uses the generic prepared-entry target and states the exact missing 'CircuitMatrixSemantics' composition field.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:21124. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.366●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryActivePreparedCompositionFieldTarget_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryActivePreparedCompositionFieldTarget
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryActivePreparedCompositionFieldTarget_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryActivePreparedCompositionFieldTarget
Concrete prepared-composition field target for the focused `n = 3` boundary branch. This is the accepted fallback for the active-entry proof attempt: it is smaller than the previous interface because it uses the generic prepared-entry target and states the exact missing `CircuitMatrixSemantics` composition field.
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary active prepared composite eval statement n 3”. Evaluation-level active/prepared composite entry statement.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Evaluation-level active/prepared composite entry statement. The active side is the signal-zero entry selected by Definition 'def:block-encoding'. The prepared side is the clean entry of the local singleton 'CircuitMatrixSemantics' object for 'H_W^(kappa)^dagger * U_gamma3_boundary * H_W^(kappa)'. This is not asserted by the current backend; it is the exact composition field still missing.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:21540. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.367●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryActivePreparedCompositeEvalStatement_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) (env : String → ℚ) : Prop
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryActivePreparedCompositeEvalStatement_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) (env : String → ℚ) : Prop
Evaluation-level active/prepared composite entry statement. The active side is the signal-zero entry selected by Definition `def:block-encoding`. The prepared side is the clean entry of the local singleton `CircuitMatrixSemantics` object for `H_W^(kappa)^dagger * U_gamma3_boundary * H_W^(kappa)`. This is not asserted by the current backend; it is the exact composition field still missing.
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary uncast active prepared composite eval statement n 3”. Uncast active-entry form of the active/prepared singleton statement.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Uncast active-entry form of the active/prepared singleton statement. This removes the signal-system block wrapper and dimension cast from the fixed active/prepared target. The remaining equality is exactly the evaluated Fig. '1 term ROBIN' active entry '[0,0]' against the prepared singleton clean entry. It does not prove that equality.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:21557. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.368●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryUncastActivePreparedCompositeEvalStatement_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) (env : String → ℚ) : Prop
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryUncastActivePreparedCompositeEvalStatement_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) (env : String → ℚ) : Prop
Uncast active-entry form of the active/prepared singleton statement. This removes the signal-system block wrapper and dimension cast from the fixed active/prepared target. The remaining equality is exactly the evaluated Fig. `1 term ROBIN` active entry `[0,0]` against the prepared singleton clean entry. It does not prove that equality.
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary active prepared sparse eval statement n 3”. Evaluation-level active/prepared sparse-matrix entry statement.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Evaluation-level active/prepared sparse-matrix entry statement. This is the same active entry compared directly with the prepared sparse matrix's clean-clean entry, bypassing the singleton 'evalGateMatrices' wrapper.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:21652. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.369●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryActivePreparedSparseEvalStatement_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) (env : String → ℚ) : Prop
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryActivePreparedSparseEvalStatement_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) (env : String → ℚ) : Prop
Evaluation-level active/prepared sparse-matrix entry statement. This is the same active entry compared directly with the prepared sparse matrix's clean-clean entry, bypassing the singleton `evalGateMatrices` wrapper.
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary uncast prepared sandwich eval statement n 3”. Named evaluated target for the current prepared-sandwich equality.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Named evaluated target for the current prepared-sandwich equality. This is the right-hand side of 'oneTermRobinGamma3BoundaryUncastActivePreparedCompositeEval_iff_preparedSandwich_n3': the active Fig. 'fig:1 term ROBIN' uncast '[0,0]' entry must evaluate to the prepared sandwich fold. The definition names the target only; it does not assert the equality.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:21785. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.370●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryUncastPreparedSandwichEvalStatement_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) (env : String → ℚ) : Prop
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryUncastPreparedSandwichEvalStatement_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) (env : String → ℚ) : Prop
Named evaluated target for the current prepared-sandwich equality. This is the right-hand side of `oneTermRobinGamma3BoundaryUncastActivePreparedCompositeEval_iff_preparedSandwich_n3`: the active Fig. `fig:1 term ROBIN` uncast `[0,0]` entry must evaluate to the prepared sandwich fold. The definition names the target only; it does not assert the equality.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary active prepared circuit labels distinct n 3”; its local proof does not by itself complete the broader paper route. The active seven-gate circuit and the prepared singleton circuit have distinct gate labels.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The active seven-gate circuit and the prepared singleton circuit have distinct gate labels. This is a structural guard for the missing composition theorem: the prepared entry cannot be obtained by unfolding the active gate list.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:21890. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.371●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryActivePreparedCircuitLabels_distinct_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) : (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinCircuitSemantics 3).circuit ≠ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPreparedCompositeCircuitSemantics_n3 H).circuit
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryActivePreparedCircuitLabels_distinct_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) : (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinCircuitSemantics 3).circuit ≠ (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPreparedCompositeCircuitSemantics_n3 H).circuit
The active seven-gate circuit and the prepared singleton circuit have distinct gate labels. This is a structural guard for the missing composition theorem: the prepared entry cannot be obtained by unfolding the active gate list.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary active prepared circuit field target”. A proposition-valued field is a requirement until a constructor supplies it. Circuit-semantics field target for the active/prepared clean-entry bridge.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Circuit-semantics field target for the active/prepared clean-entry bridge. Both sides now have concrete 'CircuitMatrixSemantics' objects: the active seven-gate Fig. 'fig:1 term ROBIN' semantics and the prepared singleton semantics for 'H_W^(kappa)^dagger * U * H_W^(kappa)'. The packet records the exact entry comparison still missing and the evaluation-level bridge to the prepared sparse matrix. It does not add an assumption and leaves every theorem-facing flag false.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:21910. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.372●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryActivePreparedCircuitFieldTarget : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryActivePreparedCircuitFieldTarget : Type
Circuit-semantics field target for the active/prepared clean-entry bridge. Both sides now have concrete `CircuitMatrixSemantics` objects: the active seven-gate Fig. `fig:1 term ROBIN` semantics and the prepared singleton semantics for `H_W^(kappa)^dagger * U * H_W^(kappa)`. The packet records the exact entry comparison still missing and the evaluation-level bridge to the prepared sparse matrix. It does not add an assumption and leaves every theorem-facing flag false.
Fields
sourceAnchor : String
activeSemantics : QuantumBlockEncoding.CircuitMatrixSemantics QuantumBlockEncoding.Coeff (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3))
preparedSemantics : QuantumBlockEncoding.CircuitMatrixSemantics QuantumBlockEncoding.Coeff 3
entryTarget : QuantumBlockEncoding.PreparedCircuitEntryTarget QuantumBlockEncoding.Coeff QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryActiveFullDim_n3 8
activeCircuit : QuantumBlockEncoding.Circuit
preparedCircuit : QuantumBlockEncoding.Circuit
activeGateCount : ℕ
preparedGateCount : ℕ
activeEntry : QuantumBlockEncoding.Coeff
preparedCompositeEntry : QuantumBlockEncoding.Coeff
preparedSparseEntry : QuantumBlockEncoding.Coeff
activePreparedCompositeEvalStatement : Prop
activePreparedSparseEvalStatement : Prop
activePreparedEntryStatement : Prop
circuitLabelsDistinctLemma : String
compositeEvalEquivalenceLemma : String
compositeEvalOfEntryLemma : String
requiredCircuitCompositionTheorem : String
missingCircuitCompositionField : String
activeSevenGateSemanticsCompiled : Bool
preparedSingletonSemanticsCompiled : Bool
preparedCompositeCleanEvalCompiled : Bool
activePreparedEvalBridgeCompiled : Bool
activePreparedEntryEqualityProved : Bool
fullProductFoldProved : Bool
projectionSummationProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
exactRemainingObstruction : String
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary active prepared circuit field target n 3”. Concrete active/prepared circuit-semantics field target.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Concrete active/prepared circuit-semantics field target. This is the smallest current obstruction after the prepared singleton semantics packet: the prepared object is typed and its selected entry evaluates to the prepared sparse matrix, but QBE still lacks the composition theorem that identifies the active signal-zero entry with that prepared singleton entry.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:21956. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.373●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryActivePreparedCircuitFieldTarget_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) (env : String → ℚ) : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryActivePreparedCircuitFieldTarget
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryActivePreparedCircuitFieldTarget_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) (env : String → ℚ) : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryActivePreparedCircuitFieldTarget
Concrete active/prepared circuit-semantics field target. This is the smallest current obstruction after the prepared singleton semantics packet: the prepared object is typed and its selected entry evaluates to the prepared sparse matrix, but QBE still lacks the composition theorem that identifies the active signal-zero entry with that prepared singleton entry.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary source prepared projection target”. A proposition-valued field is a requirement until a constructor supplies it. Theorem-facing prepared projection target for the focused boundary branch.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Theorem-facing prepared projection target for the focused boundary branch. The selected entry is the clean entry of the prepared singleton semantics for 'H_W^(kappa)^dagger * U_gamma3_boundary * H_W^(kappa)'. The active signal-zero entry remains a separate missing field; this target prevents the projection backend from silently treating the raw seven-gate entry as the source-prepared entry.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:22207. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.374●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundarySourcePreparedProjectionTarget : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundarySourcePreparedProjectionTarget : Type
Theorem-facing prepared projection target for the focused boundary branch. The selected entry is the clean entry of the prepared singleton semantics for `H_W^(kappa)^dagger * U_gamma3_boundary * H_W^(kappa)`. The active signal-zero entry remains a separate missing field; this target prevents the projection backend from silently treating the raw seven-gate entry as the source-prepared entry.
Fields
sourceAnchor : String
activePreparedCircuitField : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryActivePreparedCircuitFieldTarget
sparsePreparationMatrix : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff
preparedSemantics : QuantumBlockEncoding.CircuitMatrixSemantics QuantumBlockEncoding.Coeff 3
cleanIndex : Fin 8
preparedProjectionEntry : QuantumBlockEncoding.Coeff
preparedSparseEntry : QuantumBlockEncoding.Coeff
backendBranchFold : QuantumBlockEncoding.Coeff
uniformColumnStatement : Prop
preparedSingletonToSparseEvalStatement : Prop
preparedSingletonToBackendEvalStatement : Prop
activeToPreparedSingletonEvalStatement : Prop
theoremFacingPreparedEntry : String
singletonEvalLemma : String
conditionalBackendEvalBridgeLemma : String
requiredProjectionBackendField : String
missingProjectionBackendField : String
uniformColumnObligation : QuantumBlockEncoding.SemanticObligation
preparedProjectionTargetCompiled : Bool
preparedSingletonEntrySelected : Bool
singletonToSparseEvalCompiled : Bool
conditionalBackendEvalBridgeCompiled : Bool
activeProjectionBackendUsesPreparedEntry : Bool
activePreparedEntryEqualityProved : Bool
fullProductFoldProved : Bool
projectionSummationProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
exactRemainingObstruction : String
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary source prepared projection target n 3”. Concrete theorem-facing prepared projection target for 'n = 3'.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Concrete theorem-facing prepared projection target for 'n = 3'. It selects the prepared singleton clean entry and records the conditional evaluation bridge to the backend fold under the existing all-slot 'H_W^(kappa)' clean-column contract. The active projection backend still needs a finite composition theorem before this target can close the H-free fold.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:22250. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.375●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySourcePreparedProjectionTarget_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) (env : String → ℚ) : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundarySourcePreparedProjectionTarget
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySourcePreparedProjectionTarget_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) (env : String → ℚ) : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundarySourcePreparedProjectionTarget
Concrete theorem-facing prepared projection target for `n = 3`. It selects the prepared singleton clean entry and records the conditional evaluation bridge to the backend fold under the existing all-slot `H_W^(kappa)` clean-column contract. The active projection backend still needs a finite composition theorem before this target can close the H-free fold.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary source prepared projection to backend fold n 3”; its local proof does not by itself complete the broader paper route. Named lower2 leaf from the source-prepared projection entry to the backend fold.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Named lower2 leaf from the source-prepared projection entry to the backend fold. This is only the source-prepared wrapper requested by the current projection/product packet. It consumes the explicit 'H_W^(kappa)' clean-column contract through the existing target-level bridge and does not revive the H-free active row-'0' feeder or the refuted backend-expansion parent.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:22491. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.376●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySourcePreparedProjection_to_backendFold_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) (env : String → ℚ) (hUniform : QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaUniformColumnAllSlotsStatement_n3 H) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySourcePreparedProjectionTarget_n3 H env).preparedProjectionEntry = QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySourcePreparedProjectionTarget_n3 H env).backendBranchFold
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySourcePreparedProjection_to_backendFold_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) (env : String → ℚ) (hUniform : QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaUniformColumnAllSlotsStatement_n3 H) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySourcePreparedProjectionTarget_n3 H env).preparedProjectionEntry = QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySourcePreparedProjectionTarget_n3 H env).backendBranchFold
Named lower2 leaf from the source-prepared projection entry to the backend fold. This is only the source-prepared wrapper requested by the current projection/product packet. It consumes the explicit `H_W^(kappa)` clean-column contract through the existing target-level bridge and does not revive the H-free active row-`0` feeder or the refuted backend-expansion parent.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary backend fold to slot 2 projected product n 3”; its local proof does not by itself complete the broader paper route. Named lower2 bridge from the backend fold to the focused slot-'2' projected branch product.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Named lower2 bridge from the backend fold to the focused slot-'2' projected branch product. The proof composes only the compiled backend-fold collapse with the compiled selected-slot evaluator under the explicit boundary-entry convention. It does not use the rejected backend-expansion parent, the H-free evaluated fold, or the old selected-slot feeder.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:22514. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.377●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendFold_to_slot2ProjectedProduct_n3 (env : String → ℚ) (hentry : env "boundary_cos_half_0_2" = QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.GHL2025.boundaryRotationNormalizedCoefficient (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3) 0 2)) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.blockExtractionBranchContributionSum QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_n3) = QuantumBlockEncoding.Coeff.evalWith env QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSummationTarget_n3.projectedBranchProduct
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendFold_to_slot2ProjectedProduct_n3 (env : String → ℚ) (hentry : env "boundary_cos_half_0_2" = QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.GHL2025.boundaryRotationNormalizedCoefficient (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3) 0 2)) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.blockExtractionBranchContributionSum QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_n3) = QuantumBlockEncoding.Coeff.evalWith env QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSummationTarget_n3.projectedBranchProduct
Named lower2 bridge from the backend fold to the focused slot-`2` projected branch product. The proof composes only the compiled backend-fold collapse with the compiled selected-slot evaluator under the explicit boundary-entry convention. It does not use the rejected backend-expansion parent, the H-free evaluated fold, or the old selected-slot feeder.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary source prepared projection slot 2 to projected branch product n 3”; its local proof does not by itself complete the broader paper route. Named composite lower2 leaf from the source-prepared projection entry to the focused slot-'2' projected branch product.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Named composite lower2 leaf from the source-prepared projection entry to the focused slot-'2' projected branch product. This is only DAG wiring through the two compiled bridge leaves. The sparse preparation hypothesis enters through the source-prepared/backend-fold bridge, and the boundary-entry convention enters through the backend-fold/product bridge.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:22549. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.378●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySourcePreparedProjection_slot2_to_projectedBranchProduct_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) (env : String → ℚ) (hUniform : QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaUniformColumnAllSlotsStatement_n3 H) (hentry : env "boundary_cos_half_0_2" = QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.GHL2025.boundaryRotationNormalizedCoefficient (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3) 0 2)) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySourcePreparedProjectionTarget_n3 H env).preparedProjectionEntry = QuantumBlockEncoding.Coeff.evalWith env QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSummationTarget_n3.projectedBranchProduct
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySourcePreparedProjection_slot2_to_projectedBranchProduct_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) (env : String → ℚ) (hUniform : QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryHWKappaUniformColumnAllSlotsStatement_n3 H) (hentry : env "boundary_cos_half_0_2" = QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.GHL2025.boundaryRotationNormalizedCoefficient (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3) 0 2)) : QuantumBlockEncoding.Coeff.evalWith env (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySourcePreparedProjectionTarget_n3 H env).preparedProjectionEntry = QuantumBlockEncoding.Coeff.evalWith env QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSummationTarget_n3.projectedBranchProduct
Named composite lower2 leaf from the source-prepared projection entry to the focused slot-`2` projected branch product. This is only DAG wiring through the two compiled bridge leaves. The sparse preparation hypothesis enters through the source-prepared/backend-fold bridge, and the boundary-entry convention enters through the backend-fold/product bridge.
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary evaluated backend fold statement n 3”. Evaluation-level backend-fold statement for the focused boundary branch.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Evaluation-level backend-fold statement for the focused boundary branch. This is the H-free form of the remaining projection theorem: after interpreting symbolic 'Coeff' terms in an environment, the active signal-zero entry must equal the seven-slot backend branch fold. It is weaker than the raw 'Coeff' equality and does not assert the missing finite projection theorem.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:22956. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.379●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryEvaluatedBackendFoldStatement_n3 (env : String → ℚ) : Prop
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryEvaluatedBackendFoldStatement_n3 (env : String → ℚ) : Prop
Evaluation-level backend-fold statement for the focused boundary branch. This is the H-free form of the remaining projection theorem: after interpreting symbolic `Coeff` terms in an environment, the active signal-zero entry must equal the seven-slot backend branch fold. It is weaker than the raw `Coeff` equality and does not assert the missing finite projection theorem.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary selected slot contribution all one nonzero n 3”; its local proof does not by itself complete the broader paper route. Concrete obstruction witness for the retired all-environment H-free backend fold.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Concrete obstruction witness for the retired all-environment H-free backend fold. Under an all-one environment for the selected branch symbols, the selected slot-'2' contribution evaluates to '1'. This formalizes the finite counterexample side of the current proof-DAG packet; it does not prove or use the retired row-'0' backend fold.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:23196. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.380●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySelectedSlotContribution_allOne_nonzero_n3 : have env := fun name => if name = "f_3_0" then 1 else if name = "N_f_inv" then 1 else if name = "boundary_cos_half_0_2" then 1 else if name = "sqrt_kappa_inv" then 1 else 0; QuantumBlockEncoding.Coeff.evalWith env QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSummationObstruction_n3.selectedSlotContribution = 1
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySelectedSlotContribution_allOne_nonzero_n3 : have env := fun name => if name = "f_3_0" then 1 else if name = "N_f_inv" then 1 else if name = "boundary_cos_half_0_2" then 1 else if name = "sqrt_kappa_inv" then 1 else 0; QuantumBlockEncoding.Coeff.evalWith env QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSummationObstruction_n3.selectedSlotContribution = 1
Concrete obstruction witness for the retired all-environment H-free backend fold. Under an all-one environment for the selected branch symbols, the selected slot-`2` contribution evaluates to `1`. This formalizes the finite counterexample side of the current proof-DAG packet; it does not prove or use the retired row-`0` backend fold.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary active selected slot index split n 3”; its local proof does not by itself complete the broader paper route. Index split for the active strict-feeder frontier.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Index split for the active strict-feeder frontier. The active 'evalGateMatrices' entry in the strict feeder is the signal-zero full-basis entry '[0,0]', while the selected backend contribution is the source slot-'2' branch at full basis index '32'. This is only a compiled calibration guard: it does not prove the feeder and it leaves the required projection/path-normal-form theorem open.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:23247. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.381●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryActiveSelectedSlotIndexSplit_n3 : have active := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3; have selected := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchFullIndex_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchContributionFocusedSlot; ↑active = 0 ∧ ↑selected = 32 ∧ active ≠ selected ∧ QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSummationObstruction_n3.focusedSparseSlot = 2 ∧ QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSummationObstruction_n3.selectedSlotContribution = (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySevenGateMatrix_n3 selected selected).mul QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchEntrySelection_n3.projectionAmplitudeFactor
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryActiveSelectedSlotIndexSplit_n3 : have active := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryPrefixRow0_n3; have selected := QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchFullIndex_n3 QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchContributionFocusedSlot; ↑active = 0 ∧ ↑selected = 32 ∧ active ≠ selected ∧ QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSummationObstruction_n3.focusedSparseSlot = 2 ∧ QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSummationObstruction_n3.selectedSlotContribution = (QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySevenGateMatrix_n3 selected selected).mul QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBranchEntrySelection_n3.projectionAmplitudeFactor
Index split for the active strict-feeder frontier. The active `evalGateMatrices` entry in the strict feeder is the signal-zero full-basis entry `[0,0]`, while the selected backend contribution is the source slot-`2` branch at full basis index `32`. This is only a compiled calibration guard: it does not prove the feeder and it leaves the required projection/path-normal-form theorem open.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary backend expansion statement not n 3”; its local proof does not by itself complete the broader paper route. No-go guard for the current backend-expansion statement.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. No-go guard for the current backend-expansion statement. The all-one selected-branch environment makes the focused selected-slot contribution evaluate to '1', while any backend-expansion proof would force the same evaluated contribution to vanish through the evaluated backend fold.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:23637. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.382●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendExpansionStatement_not_n3 : ¬QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContributionTarget_n3.backendExpansionStatement
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendExpansionStatement_not_n3 : ¬QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContributionTarget_n3.backendExpansionStatement
No-go guard for the current backend-expansion statement. The all-one selected-branch environment makes the focused selected-slot contribution evaluate to `1`, while any backend-expansion proof would force the same evaluated contribution to vanish through the evaluated backend fold.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary backend projection summation statement not n 3”; its local proof does not by itself complete the broader paper route. No-go guard for the generic projection-summation surface.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. No-go guard for the generic projection-summation surface. The generic 'BlockExtractionBranchContributionTarget.projectionSummationStatement' is equivalent to the backend-expansion statement for the current target. The unchanged backend-expansion route is already refuted by 'oneTermRobinGamma3BoundaryBackendExpansionStatement_not_n3', so this theorem records that the active lower target must be restated as a corrected source-backed branch statement before it can be proved.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:23681. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.383●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendProjectionSummationStatement_not_n3 : ¬QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContributionTarget_n3.projectionSummationStatement
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendProjectionSummationStatement_not_n3 : ¬QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContributionTarget_n3.projectionSummationStatement
No-go guard for the generic projection-summation surface. The generic `BlockExtractionBranchContributionTarget.projectionSummationStatement` is equivalent to the backend-expansion statement for the current target. The unchanged backend-expansion route is already refuted by `oneTermRobinGamma3BoundaryBackendExpansionStatement_not_n3`, so this theorem records that the active lower target must be restated as a corrected source-backed branch statement before it can be proved.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary evaluated backend fold target”. A proposition-valued field is a requirement until a constructor supplies it. Smallest current evaluated projection-backend target.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Smallest current evaluated projection-backend target. The source-prepared target has selected the correct prepared singleton entry. This packet removes the matrix 'H' from the statement that still has to be proved: the active signal-zero entry must evaluate to the evaluated backend fold. The external clean-column contract is recorded only as the bridge needed to compare this H-free statement with the active/prepared singleton field.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:24126. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.384●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryEvaluatedBackendFoldTarget : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryEvaluatedBackendFoldTarget : Type
Smallest current evaluated projection-backend target. The source-prepared target has selected the correct prepared singleton entry. This packet removes the matrix `H` from the statement that still has to be proved: the active signal-zero entry must evaluate to the evaluated backend fold. The external clean-column contract is recorded only as the bridge needed to compare this H-free statement with the active/prepared singleton field.
Fields
sourceAnchor : String
sourcePreparedProjectionTarget : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundarySourcePreparedProjectionTarget
activeSignalEntry : QuantumBlockEncoding.Coeff
backendBranchFold : QuantumBlockEncoding.Coeff
evaluatedBackendFoldStatement : Prop
activePreparedEvalStatement : Prop
equivalenceLemma : String
requiredEvaluationTheorem : String
missingFiniteProjectionField : String
cleanColumnObligation : QuantumBlockEncoding.SemanticObligation
sourcePreparedTargetCompiled : Bool
evaluatedBackendFoldStatementTyped : Bool
activeEvalEquivalenceCompiled : Bool
evaluatedBackendFoldProved : Bool
rawCoeffFoldProved : Bool
projectionSummationProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
exactRemainingObstruction : String
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary evaluated backend fold target n 3”. Concrete evaluated backend-fold target for 'n = 3'.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Concrete evaluated backend-fold target for 'n = 3'. No semantic flag is promoted. The packet records that the remaining local theorem is an evaluated equality between the active signal-zero entry and the backend branch fold; a raw 'Coeff' proof would be stronger but is still absent.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:24158. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.385●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryEvaluatedBackendFoldTarget_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) (env : String → ℚ) : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryEvaluatedBackendFoldTarget
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryEvaluatedBackendFoldTarget_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) (env : String → ℚ) : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryEvaluatedBackendFoldTarget
Concrete evaluated backend-fold target for `n = 3`. No semantic flag is promoted. The packet records that the remaining local theorem is an evaluated equality between the active signal-zero entry and the backend branch fold; a raw `Coeff` proof would be stronger but is still absent.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary source prepared product projection obligation”. A proposition-valued field is a requirement until a constructor supplies it. Source-prepared product/projection proof-DAG packet for the focused boundary leaf.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Source-prepared product/projection proof-DAG packet for the focused boundary leaf. The packet starts from the clean projection of the full prepared sandwich '(H_W^kappa)^dagger * U_gamma3_boundary * H_W^kappa', reuses the compiled prepared-backend evaluator, and records the fixed product-to-coefficient obligation. It explicitly forbids the stale backend-expansion parent and does not consume the product route or promote any downstream theorem-facing flag.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:24931. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.386●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundarySourcePreparedProductProjectionObligation : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundarySourcePreparedProductProjectionObligation : Type
Source-prepared product/projection proof-DAG packet for the focused boundary leaf. The packet starts from the clean projection of the full prepared sandwich `(H_W^kappa)^dagger * U_gamma3_boundary * H_W^kappa`, reuses the compiled prepared-backend evaluator, and records the fixed product-to-coefficient obligation. It explicitly forbids the stale backend-expansion parent and does not consume the product route or promote any downstream theorem-facing flag.
Fields
sourceAnchor : String
sourceTarget : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundarySourcePreparedProjectionTarget
productRoute : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryProductUnderContractsRoute
productBridge : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryFiniteProjectionProductBridge
preparedBackendEvalStatement : Prop
fixedProductObligation : QuantumBlockEncoding.SemanticObligation
forbiddenBackendExpansionParent : Bool
preparedBackendEvalCompiled : Bool
productRouteConsumed : Bool
normalizedBlockEqualityProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
exactRemainingObstruction : String
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary source prepared product projection obligation n 3”. Concrete 'n = 3' source-prepared product/projection packet.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Concrete 'n = 3' source-prepared product/projection packet. This is bookkeeping only: the prepared clean entry evaluator is compiled, but the slot-'2' projection/product bridge and normalizer algebra are still open.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:24955. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.387●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySourcePreparedProductProjectionObligation_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) (env : String → ℚ) : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundarySourcePreparedProductProjectionObligation
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySourcePreparedProductProjectionObligation_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) (env : String → ℚ) : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundarySourcePreparedProductProjectionObligation
Concrete `n = 3` source-prepared product/projection packet. This is bookkeeping only: the prepared clean entry evaluator is compiled, but the slot-`2` projection/product bridge and normalizer algebra are still open.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary source prepared normalized projection bridge”. A proposition-valued field is a requirement until a constructor supplies it. Source-prepared finite normalized-projection bridge packet for the focused boundary branch.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Source-prepared finite normalized-projection bridge packet for the focused boundary branch. This is route bookkeeping. It attaches the source-prepared projection packet to the finite projection/product bridge and the finite block-composition contract for 'n = 3'. It does not prove the fixed product-to-coefficient obligation or promote any LCU, normalized-block, block, or extraction flag.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:25219. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.388●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundarySourcePreparedNormalizedProjectionBridge : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundarySourcePreparedNormalizedProjectionBridge : Type
Source-prepared finite normalized-projection bridge packet for the focused boundary branch. This is route bookkeeping. It attaches the source-prepared projection packet to the finite projection/product bridge and the finite block-composition contract for `n = 3`. It does not prove the fixed product-to-coefficient obligation or promote any LCU, normalized-block, block, or extraction flag.
Fields
sourceAnchor : String
sourcePreparedPacket : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundarySourcePreparedProductProjectionObligation
finiteProjectionBridge : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryFiniteProjectionProductBridge
fixedProductObligation : QuantumBlockEncoding.SemanticObligation
finiteBlockNormalizer : QuantumBlockEncoding.Coeff
finiteBlockNormalizedEquality : QuantumBlockEncoding.SemanticObligation
finiteBlockProjectionObligation : QuantumBlockEncoding.SemanticObligation
finiteBlockLCUCompositionObligation : QuantumBlockEncoding.SemanticObligation
finiteBlockFinalExtractionObligation : QuantumBlockEncoding.SemanticObligation
preparedProjectionEntry : QuantumBlockEncoding.Coeff
projectedBranchProduct : QuantumBlockEncoding.Coeff
expectedTargetEntry : QuantumBlockEncoding.Coeff
theoremNormalizer : QuantumBlockEncoding.Coeff
sourcePreparedProductProjectionPacketName : String
finiteProjectionProductBridgeName : String
finiteBlockCompositionContractName : String
conditionalNormalizerBridgeLemma : String
forbiddenBackendExpansionCounterexample : String
focusedSystemRow : ℕ
focusedSystemColumn : ℕ
focusedSparseSlot : ℕ
signalBlockRowIndex : ℕ
signalBlockColumnIndex : ℕ
branchBasisIndex : ℕ
sourcePreparedPacketCompiled : Bool
finiteProjectionProductBridgeCompiled : Bool
conditionalNormalizerBridgeCompiled : Bool
finiteBlockContractAttached : Bool
backendExpansionRouteForbidden : Bool
fixedProductObligationProved : Bool
normalizedBlockEqualityProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
exactRemainingObstruction : String
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary source prepared normalized projection bridge n 3”. Concrete 'n = 3' source-prepared finite normalized-projection packet.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Concrete 'n = 3' source-prepared finite normalized-projection packet. The packet consumes only already compiled route memory: 'oneTermRobinGamma3BoundarySourcePreparedProductProjectionObligation_n3', 'oneTermRobinGamma3BoundaryFiniteProjectionProductBridge_n3', 'oneTermRobinFiniteBlockCompositionContract 3', and the conditional normalizer bridge by name. The root obligation remains false.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:25269. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.389●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySourcePreparedNormalizedProjectionBridge_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) (env : String → ℚ) : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundarySourcePreparedNormalizedProjectionBridge
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundarySourcePreparedNormalizedProjectionBridge_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) (env : String → ℚ) : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundarySourcePreparedNormalizedProjectionBridge
Concrete `n = 3` source-prepared finite normalized-projection packet. The packet consumes only already compiled route memory: `oneTermRobinGamma3BoundarySourcePreparedProductProjectionObligation_n3`, `oneTermRobinGamma3BoundaryFiniteProjectionProductBridge_n3`, `oneTermRobinFiniteBlockCompositionContract 3`, and the conditional normalizer bridge by name. The root obligation remains false.
Plain-English reading. This record groups the data and proof fields needed for “one term robin gamma 3 boundary theorem facing finite block contract audit”. A proposition-valued field is a requirement until a constructor supplies it. Theorem-facing finite block-contract audit for the focused boundary branch.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Theorem-facing finite block-contract audit for the focused boundary branch. This packet records that the finite block-composition contract is still wired to the active seven-gate backend while the source-facing Fig. 4 transcript is a larger circuit. It is an audit object only: no normalized-block equality, LCU claim, block projection, final extraction, oracle correctness, unitarity, resource claim, or product-to-coefficient flag is promoted.
Declaration kind. structure.
Source: QuantumBlockEncoding/RobinMatrix.lean:25426. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.390●1 definition
Associated Lean declarations
-
structuredefined in QuantumBlockEncoding/RobinMatrix.leancomplete
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryTheoremFacingFiniteBlockContractAudit : Type
structure QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryTheoremFacingFiniteBlockContractAudit : Type
Theorem-facing finite block-contract audit for the focused boundary branch. This packet records that the finite block-composition contract is still wired to the active seven-gate backend while the source-facing Fig. 4 transcript is a larger circuit. It is an audit object only: no normalized-block equality, LCU claim, block projection, final extraction, oracle correctness, unitarity, resource claim, or product-to-coefficient flag is promoted.
Fields
sourceAnchor : String
theoremFacingCircuit : QuantumBlockEncoding.Circuit
activeBackendCircuit : QuantumBlockEncoding.Circuit
activeSemantics : QuantumBlockEncoding.CircuitMatrixSemantics QuantumBlockEncoding.Coeff (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3))
finiteBlockContract : QuantumBlockEncoding.FiniteBlockCompositionContract QuantumBlockEncoding.Coeff (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3)) (QuantumBlockEncoding.gridSize 3) (QuantumBlockEncoding.qubitDim (QuantumBlockEncoding.GHL2025.effectiveRobinSignalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3)))
normalizedProjectionBridge : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundarySourcePreparedNormalizedProjectionBridge
contractClaimSemantics : QuantumBlockEncoding.CircuitMatrixSemantics QuantumBlockEncoding.Coeff (QuantumBlockEncoding.GHL2025.oneTermRobinTotalQubits (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3))
theoremFacingGateCount : ℕ
activeBackendGateCount : ℕ
contractClaimCircuit : QuantumBlockEncoding.Circuit
fixedProductObligation : QuantumBlockEncoding.SemanticObligation
finiteBlockNormalizedEquality : QuantumBlockEncoding.SemanticObligation
finiteBlockProjectionObligation : QuantumBlockEncoding.SemanticObligation
finiteBlockLCUCompositionObligation : QuantumBlockEncoding.SemanticObligation
finiteBlockFinalExtractionObligation : QuantumBlockEncoding.SemanticObligation
theoremFacingGateListGuard : String
activeBackendGateListGuard : String
activePlaceholderGateListGuard : String
finiteBlockCompositionContractTranscript : String
normalizedProjectionBridgeTranscript : String
theoremFacingActiveMismatchStatement : Prop
theoremFacingGateListGuardCompiled : Bool
activeBackendGateListGuardCompiled : Bool
activePlaceholderGateListGuardCompiled : Bool
finiteBlockContractTranscriptCompiled : Bool
normalizedProjectionBridgeCompiled : Bool
contractUsesActiveBackendSemantics : Bool
theoremFacingCircuitSubstitutedForActive : Bool
activeBackendContractMutated : Bool
sourceTranslationGapRecorded : Bool
normalizedBlockEqualityProved : Bool
productToCoefficientProved : Bool
lcuCorrectProved : Bool
blockProjectionProved : Bool
blockCorrectProved : Bool
finalExtractionProved : Bool
oracleCorrectProved : Bool
unitaryProved : Bool
resourceClaimProved : Bool
exactRemainingObstruction : String
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary theorem facing finite block contract audit n 3”. Concrete 'n = 3' theorem-facing finite block-contract audit packet.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Concrete 'n = 3' theorem-facing finite block-contract audit packet. The packet consumes only existing transcript guards and compiled route memory. It records the source-translation gap between the theorem-facing Fig. 4 circuit and the active backend currently used by 'oneTermRobinFiniteBlockCompositionContract 3'.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:25484. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.391●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryTheoremFacingFiniteBlockContractAudit_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) (env : String → ℚ) : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryTheoremFacingFiniteBlockContractAudit
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryTheoremFacingFiniteBlockContractAudit_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) (env : String → ℚ) : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryTheoremFacingFiniteBlockContractAudit
Concrete `n = 3` theorem-facing finite block-contract audit packet. The packet consumes only existing transcript guards and compiled route memory. It records the source-translation gap between the theorem-facing Fig. 4 circuit and the active backend currently used by `oneTermRobinFiniteBlockCompositionContract 3`.
Plain-English reading. This definition gives the library's named construction or computation for “one term robin gamma 3 boundary theorem facing finite block projection interface n 3”. Concrete 'n = 3' theorem-facing finite block/projection interface packet.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Concrete 'n = 3' theorem-facing finite block/projection interface packet. The packet records that the source-prepared projection target is the clean prepared entry, while the finite block-composition contract still consumes 'oneTermRobinCircuitSemantics 3'. It does not substitute the Fig. 4 circuit for the active backend and does not prove the root product-to-coefficient obligation.
Declaration kind. def.
Source: QuantumBlockEncoding/RobinMatrix.lean:25726. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition12.1.392●1 definition
Associated Lean declarations
-
defdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryTheoremFacingFiniteBlockProjectionInterface_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) (env : String → ℚ) : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryTheoremFacingFiniteBlockProjectionInterface
def QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryTheoremFacingFiniteBlockProjectionInterface_n3 (H : QuantumBlockEncoding.Matrix 8 8 QuantumBlockEncoding.Coeff) (env : String → ℚ) : QuantumBlockEncoding.Examples.RobinHeat.OneTermRobinGamma3BoundaryTheoremFacingFiniteBlockProjectionInterface
Concrete `n = 3` theorem-facing finite block/projection interface packet. The packet records that the source-prepared projection target is the clean prepared entry, while the finite block-composition contract still consumes `oneTermRobinCircuitSemantics 3`. It does not substitute the Fig. 4 circuit for the active backend and does not prove the root product-to-coefficient obligation.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary evaluated backend fold statement diagnostic n 3”; its local proof does not by itself complete the broader paper route. Diagnostic/H-free route: the evaluated backend fold follows from the raw Coeff equality 'signalUnitaryEntry = blockExtractionBranchContributionSum' via the bridge theorem.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. Diagnostic/H-free route: the evaluated backend fold follows from the raw Coeff equality 'signalUnitaryEntry = blockExtractionBranchContributionSum' via the bridge theorem. This is not the source-correct route; the source-correct route goes through 'oneTermRobinGamma3BoundaryEvaluatedBackendFoldStatement_of_activePreparedEval_n3'.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:26934. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.393●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryEvaluatedBackendFoldStatement_diagnostic_n3 (env : String → ℚ) (hRaw : QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSummationTarget_n3.signalUnitaryEntry = QuantumBlockEncoding.blockExtractionBranchContributionSum QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_n3) : QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryEvaluatedBackendFoldStatement_n3 env
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryEvaluatedBackendFoldStatement_diagnostic_n3 (env : String → ℚ) (hRaw : QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSummationTarget_n3.signalUnitaryEntry = QuantumBlockEncoding.blockExtractionBranchContributionSum QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_n3) : QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryEvaluatedBackendFoldStatement_n3 env
Diagnostic/H-free route: the evaluated backend fold follows from the raw Coeff equality `signalUnitaryEntry = blockExtractionBranchContributionSum` via the bridge theorem. This is not the source-correct route; the source-correct route goes through `oneTermRobinGamma3BoundaryEvaluatedBackendFoldStatement_of_activePreparedEval_n3`.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary unitary entry ne backend fold n 3”; its local proof does not by itself complete the broader paper route. The historical H-free raw fold is false for the current symbolic target.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The historical H-free raw fold is false for the current symbolic target. This closes the old diagnostic route by rejection rather than by an axiom. It combines the compiled equivalence to the backend-expansion statement with the explicit all-one counterexample above. The source-prepared route remains a separate conditional interface and is never allowed to reuse this rejected parent.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:26952. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.394●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryUnitaryEntry_ne_backendFold_n3 : QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSummationTarget_n3.signalUnitaryEntry ≠ QuantumBlockEncoding.blockExtractionBranchContributionSum QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_n3
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryUnitaryEntry_ne_backendFold_n3 : QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryProjectionSummationTarget_n3.signalUnitaryEntry ≠ QuantumBlockEncoding.blockExtractionBranchContributionSum QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryBackendBranchContribution_n3
The historical H-free raw fold is false for the current symbolic target. This closes the old diagnostic route by rejection rather than by an axiom. It combines the compiled equivalence to the backend-expansion statement with the explicit all-one counterexample above. The source-prepared route remains a separate conditional interface and is never allowed to reuse this rejected parent.
Plain-English reading. Lean checks the research-module proposition indexed as “one term robin gamma 3 boundary gate matrix list n 3”; its local proof does not by itself complete the broader paper route. The seven active gate matrices have the exact paper-facing order recorded by the circuit semantics layer.
Formal status. Compiled by the full ASPBE gate in a research-level module. The displayed theorem is checked, but it does not promote a broader paper route or an external oracle contract.
Why it is in this chapter. Compiled Robin-matrix research included in the full ASPBE gate; local results are separated from the broader paper route and external contracts.
Technical source note. The seven active gate matrices have the exact paper-facing order recorded by the circuit semantics layer. The project-local symbolic 'Coeff' matrix multiplication stores syntax trees, so differently parenthesized products are not definitionally equal. This structural theorem is the correct raw certificate; algebraic regrouping must be stated after 'Coeff.evalWith', where rational associativity is available.
Declaration kind. theorem.
Source: QuantumBlockEncoding/RobinMatrix.lean:26970. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem12.1.395●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/RobinMatrix.leancomplete
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryGateMatrixList_n3 : List.map (fun gateMatrix => gateMatrix.matrix) (QuantumBlockEncoding.GHL2025.oneTermRobinGateMatrixPlaceholders (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3)) = [QuantumBlockEncoding.GHL2025.indicatorOracleMatrix (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3), QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTRotationMatrix (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3), QuantumBlockEncoding.GHL2025.boundaryRotationMatrix (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3), QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperMatrix (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3), QuantumBlockEncoding.GHL2025.functionOraclePaperMatrix (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3), QuantumBlockEncoding.GHL2025.swapOracleMatrix (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3), QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperDaggerMatrix (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3)]
theorem QuantumBlockEncoding.Examples.RobinHeat.oneTermRobinGamma3BoundaryGateMatrixList_n3 : List.map (fun gateMatrix => gateMatrix.matrix) (QuantumBlockEncoding.GHL2025.oneTermRobinGateMatrixPlaceholders (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3)) = [QuantumBlockEncoding.GHL2025.indicatorOracleMatrix (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3), QuantumBlockEncoding.GHL2025.sparseAmplitudeOracleDTRotationMatrix (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3), QuantumBlockEncoding.GHL2025.boundaryRotationMatrix (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3), QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperMatrix (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3), QuantumBlockEncoding.GHL2025.functionOraclePaperMatrix (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3), QuantumBlockEncoding.GHL2025.swapOracleMatrix (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3), QuantumBlockEncoding.GHL2025.bandedSparseAccessPaperDaggerMatrix (QuantumBlockEncoding.Examples.RobinHeat.oneTermParameters 3)]
The seven active gate matrices have the exact paper-facing order recorded by the circuit semantics layer. The project-local symbolic `Coeff` matrix multiplication stores syntax trees, so differently parenthesized products are not definitionally equal. This structural theorem is the correct raw certificate; algebraic regrouping must be stated after `Coeff.evalWith`, where rational associativity is available.