arxiv: 2602.12193 · v2 · submitted 2026-02-12 · 🪐 quant-ph

Recognition: 2 theorem links

· Lean Theorem

A Framework for Spatial Quantum Sensing

Lu\'is Bugalho , Yasser Omar , Damian Markham

Authors on Pith no claims yet

Pith reviewed 2026-05-16 02:40 UTC · model grok-4.3

classification 🪐 quant-ph

keywords quantum sensingentanglementsensor networksfield estimationinterpolationanalytic functionsdistributed sensingalgebraic geometry

0 comments

The pith

Entanglement in quantum sensor networks achieves maximal precision for field estimation under global resource constraints.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper introduces spatial quantum sensing as a framework to build estimators for properties of an underlying field using a network of quantum sensors at fixed positions. It first solves the task for polynomial fields by recasting it as interpolation and then extends the approach to analytic functions via least-squares estimators. Conditions on sensor placement are derived using algebraic geometry to ensure the estimators are well-defined and error-free. The central result compares non-local entangled protocols to the best local strategies and shows that entanglement delivers maximal precision when total resources are fixed globally. Error-free subspaces are also presented as a way to exploit prior field knowledge and cut the number of sensors required.

Core claim

The paper establishes a framework for spatial quantum sensing in which non-local entangled protocols achieve maximal precision for estimating properties of a field compared with the optimal local strategy, under global resource constraints, with explicit algebraic-geometry constructions that guarantee well-defined, error-free estimators for polynomial fields and least-squares estimators for analytic fields.

What carries the argument

The spatial quantum sensing framework that casts estimation as an interpolation problem for polynomials or least-squares for analytic functions, using algebraic geometry to enforce sensor-placement conditions that make the estimators well-defined and error-free.

If this is right

Non-local entangled protocols deliver higher precision than local strategies in distributed sensing when total resources are constrained globally.
Explicit sensor placements derived from algebraic geometry guarantee that polynomial-field estimators are well-defined and error-free.
Error-free subspaces allow prior knowledge of the field to reduce the number of sensors needed without sacrificing accuracy.
The same constructions extend from polynomial interpolation to general least-squares estimation for analytic fields.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The framework could be tested in atomic or optical lattice setups where sensor positions are controllable to verify the algebraic placement conditions.
Error-free subspaces suggest a route to adaptive sensing in which prior measurements dynamically shrink the required sensor count.
Global resource constraints in the result point to potential advantages in large-scale networks where communication or total energy is limited.

Load-bearing premise

The field must be exactly polynomial or analytic and the sensor positions must satisfy the algebraic-geometry conditions needed for the estimators to be well-defined.

What would settle it

An experiment that fixes total resources and directly compares the achieved precision of a non-local entangled protocol against the best local protocol on a known polynomial field, checking whether the entangled version fails to reach the predicted maximal precision.

Figures

Figures reproduced from arXiv: 2602.12193 by Damian Markham, Lu\'is Bugalho, Yasser Omar.

**Figure 2.** Figure 2: Comparison between the best non-local and local strategies for the solution of a interpo [PITH_FULL_IMAGE:figures/full_fig_p014_2.png] view at source ↗

**Figure 3.** Figure 3: Top Row: Comparison of the error of the interpolation of the polynomial F(x) = (x − 1)3 + (y − 1)3 , considering the two possible equally spaced grids containing 3 × 3 sensors (left) and 5 × 5 sensors (right). Bottom Row: Comparison of the error of the interpolation of the polynomial F(x) = (x−1)5 + (y −1)5 , considering the two possible equally spaced grids containing 3 × 3 sensors (left) and 5 × 5 sensor… view at source ↗

read the original abstract

Quantum sensor networks promise precision advantages over classical and single-sensor strategies, in particular when the estimator is non-local. We address the problem of finding such estimators through a framework we connote spatial quantum sensing: given an underlying field interrogated by a network of quantum sensors at fixed positions, construct an estimator for a property of the field, for example, distinguishing a source of signal, or evaluating the field or its derivatives at an arbitrary point. We first treat polynomial fields, casting the task as an interpolation problem, and then generalize to fields modeled by analytic functions, which yields general least-squares estimators. A central and largely unaddressed question is under what conditions on sensor placement these estimators are well-defined and error-free. For $m$-dimensional arrays we give explicit constructions and proofs in the interpolation setting using algebraic geometry, and establish necessary and sufficient conditions in the general case. Comparing a non-local entangled protocol with the best local strategy, we show that entanglement yields maximal precision in distributed sensing under global resource constraints. Finally, we introduce error-free subspaces, a technique that translates prior knowledge of the field into a reduction in the number of required sensors. We expect these techniques to be broadly useful in sensing problems across scales, ranging from earth-scale experiments to local applications such as biological imaging.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

Framework for spatial quantum sensing with algebraic-geometry sensor placements and a consistent entanglement advantage under global constraints.

read the letter

The main thing to know is that this paper builds a framework for placing quantum sensors to estimate non-local properties of a field, with explicit algebraic-geometry constructions that guarantee error-free interpolation for polynomial cases in m-dimensional arrays, plus necessary and sufficient conditions for the analytic generalization, and a direct comparison showing entangled protocols achieve maximal precision over local ones when resources are shared globally. The error-free subspaces technique is a clean way to reduce sensor count using prior knowledge. These pieces are new and do not collapse into the cited prior work. The paper does well by keeping the entangled and local comparisons inside the same estimator framework, which avoids apples-to-oranges issues, and by moving from interpolation to least-squares without introducing free parameters or circular definitions. The constructions rest on standard field models and algebraic geometry, so the logic holds together internally once the placement conditions are met. The soft spots are limited. Everything depends on the field being exactly polynomial or analytic and the positions satisfying the derived conditions; deviations in real data would remove the error-free guarantee. The abstract states the proofs exist, but without the full derivations any subtle gaps in the general case stay hidden. No load-bearing flaws appear in the summary. This is for quantum information theorists working on distributed sensing networks, especially those who need concrete placement rules or entanglement bounds for applications like source localization. A reader who wants to optimize sensor arrays under resource limits would get direct value. It has enough specific, verifiable claims to deserve a serious referee who can check the algebraic details and the precision comparison.

Referee Report

1 major / 2 minor

Summary. The manuscript introduces a framework for spatial quantum sensing in quantum sensor networks interrogating polynomial or analytic fields. It casts polynomial-field estimation as an interpolation problem, supplies explicit constructions and proofs for m-dimensional arrays via algebraic geometry, derives necessary and sufficient sensor-placement conditions for well-defined error-free estimators in the general analytic case, compares a non-local entangled protocol against the optimal local strategy to establish an entanglement advantage under global resource constraints, and introduces error-free subspaces that exploit prior field knowledge to reduce the required number of sensors.

Significance. If the algebraic-geometry constructions and placement conditions hold, the work supplies a systematic, largely parameter-free route to error-free distributed sensing with a quantifiable entanglement advantage. The explicit proofs for the interpolation case, the necessary-and-sufficient conditions for the general case, and the error-free-subspace reduction technique are concrete strengths that could be directly useful for applications ranging from biological imaging to large-scale field sensing.

major comments (1)

[Abstract (interpolation constructions and protocol comparison)] The central entanglement-advantage claim rests on the estimators being exactly error-free once the algebraic-geometry placement conditions are satisfied. The abstract asserts explicit constructions and proofs for the interpolation setting, yet the provided text does not contain the detailed derivations or error-propagation analysis; without these, the load-bearing comparison between non-local and local protocols cannot be fully verified.

minor comments (2)

[Protocol comparison paragraph] Clarify the precise definition of 'global resource constraints' when the entangled and local protocols are compared, and state whether the same total number of photons or the same total number of sensors is held fixed.
[Interpolation setting] Provide a short table or explicit list of the algebraic-geometry theorems invoked in the m-dimensional constructions so that readers can trace the necessary-and-sufficient conditions without external lookup.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their careful reading and constructive feedback. We address the single major comment below and will revise the manuscript to incorporate the requested details.

read point-by-point responses

Referee: The central entanglement-advantage claim rests on the estimators being exactly error-free once the algebraic-geometry placement conditions are satisfied. The abstract asserts explicit constructions and proofs for the interpolation setting, yet the provided text does not contain the detailed derivations or error-propagation analysis; without these, the load-bearing comparison between non-local and local protocols cannot be fully verified.

Authors: We agree that the submitted manuscript did not include sufficiently expanded derivations. In the revised version we will add the explicit algebraic-geometry constructions and proofs for the m-dimensional interpolation case, together with the full error-propagation analysis that underpins the non-local versus local protocol comparison. These additions will make the error-free property and the resulting entanglement advantage directly verifiable from the text. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivations self-contained

full rationale

The paper builds estimators for polynomial fields via interpolation and for analytic fields via least-squares, with explicit algebraic-geometry constructions and necessary-and-sufficient placement conditions supplied directly in the text. The central comparison of entangled versus local protocols occurs inside this explicitly delimited regime, without any equation reducing a claimed prediction to a fitted input by construction or to a self-citation whose validity depends on the present result. All load-bearing steps rest on standard field models and algebraic geometry rather than on renaming or smuggling prior ansatzes from the same authors.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The framework rests on standard domain assumptions about field smoothness and fixed sensor positions; no free parameters or invented entities are introduced in the abstract.

axioms (2)

domain assumption The interrogated field is exactly a polynomial or an analytic function
Used to cast the estimation task as interpolation or least-squares fitting.
domain assumption Sensor positions are fixed and chosen to satisfy algebraic conditions for well-defined estimators
Required for the explicit constructions and necessary-and-sufficient conditions to hold.

pith-pipeline@v0.9.0 · 5519 in / 1303 out tokens · 54233 ms · 2026-05-16T02:40:12.896800+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Foundation/AlexanderDuality.lean alexander_duality_circle_linking echoes

?

echoes
ECHOES: this paper passage has the same mathematical shape or conceptual pattern as the Recognition theorem, but is not a direct formal dependency.

V(X, L) is invertible iff no polynomial spanned by L vanishes for all x ∈ X (Thm 3.1); Condition A.1: span L ∩ I(X) = ∅; lower-set placements X ∼ Y guarantee rank p (Thm 3.2, Prop 3.1)
IndisputableMonolith/Foundation/AbsoluteFloorClosure.lean absolute_floor_iff_bare_distinguishability unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

Error-free subspaces: any n⊥ · β for n⊥ ⊥ N can be estimated without construction error (Cor 6.1); GLS pseudo-inverse yields c·F (Eq. 35)

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

38 extracted references · 38 canonical work pages

[1]

Matteo G.A. Paris. Quantum estimation for quantum technology.Interna- tional Journal of Quantum Information, 7(SUPPL.):125–137, 2009. ISSN 02197499. doi:10.1142/S0219749909004839

work page doi:10.1142/s0219749909004839 2009
[2]

K´ om´ ar, T

P. K´ om´ ar, T. Topcu, E. M. Kessler, A. Derevianko, V. Vuleti´ c, J. Ye, and M. D. Lukin. Quantum Network of Atom Clocks: A Possible Implementation with Neutral Atoms.Physi- cal Review Letters, 117(6):1–5, 2016. ISSN 10797114. doi:10.1103/PhysRevLett.117.060506

work page doi:10.1103/physrevlett.117.060506 2016
[3]

Optical clock networks.Nature Photonics, 11(1):25–31, January 2017

Fritz Riehle. Optical clock networks.Nature Photonics, 11(1):25–31, January 2017. ISSN 1749-4893. doi:10.1038/nphoton.2016.235

work page doi:10.1038/nphoton.2016.235 2017
[4]

Gross, Steven L

Zachary Eldredge, Michael Foss-Feig, Jonathan A. Gross, Steven L. Rolston, and Alexey V. Gorshkov. Optimal and secure measurement protocols for quantum sensor networks.Physi- cal Review A, 97(4):042337, April 2018. ISSN 2469-9926. doi:10.1103/PhysRevA.97.042337

work page doi:10.1103/physreva.97.042337 2018
[5]

Gorshkov, and Michael Foss-Feig

Wenchao Ge, Kurt Jacobs, Zachary Eldredge, Alexey V. Gorshkov, and Michael Foss-Feig. Distributed Quantum Metrology with Linear Networks and Separa- ble Inputs.Physical Review Letters, 121(4):043604, July 2018. ISSN 0031-9007. doi:10.1103/PhysRevLett.121.043604

work page doi:10.1103/physrevlett.121.043604 2018
[6]

Quntao Zhuang, Zheshen Zhang, and Jeffrey H. Shapiro. Distributed quantum sensing using continuous-variable multipartite entanglement.Physical Review A, 97(3):032329, March 2018. doi:10.1103/PhysRevA.97.032329

work page doi:10.1103/physreva.97.032329 2018
[7]

Proctor, Paul A

Timothy J. Proctor, Paul A. Knott, and Jacob A. Dunningham. Multiparameter Estima- tion in Networked Quantum Sensors.Physical Review Letters, 120(8):1–11, 2018. ISSN 10797114. doi:10.1103/PhysRevLett.120.080501

work page doi:10.1103/physrevlett.120.080501 2018
[8]

Kevin Qian, Zachary Eldredge, Wenchao Ge, Guido Pagano, Christopher Monroe, J. V. Porto, and Alexey V. Gorshkov. Heisenberg-scaling measurement protocol for analytic functions with quantum sensor networks.Physical Review A, 100(4):042304, October 2019. ISSN 2469-9926. doi:10.1103/PhysRevA.100.042304

work page doi:10.1103/physreva.100.042304 2019
[9]

Sidhu and Pieter Kok

Jasminder S. Sidhu and Pieter Kok. A Geometric Perspective on Quantum Param- eter Estimation.AVS Quantum Science, 2(1):014701, July 2019. ISSN 2639-0213. doi:10.1116/1.5119961

work page doi:10.1116/1.5119961 2019
[10]

Optimal dis- tributed quantum sensing using Gaussian states.Physical Review Research, 2(2):1–9, 2020

Changhun Oh, Changhyoup Lee, Seok Hyung Lie, and Hyunseok Jeong. Optimal dis- tributed quantum sensing using Gaussian states.Physical Review Research, 2(2):1–9, 2020. ISSN 2643-1564. doi:10.1103/physrevresearch.2.023030. 22

work page doi:10.1103/physrevresearch.2.023030 2020
[11]

2022 On some aspects of the response to stochastic and deterministic forcings.Journal of Physics A: Mathematical and Theoretical55, 425002

Jes´ us Rubio, Paul A. Knott, Timothy J. Proctor, and Jacob A. Dunningham. Quantum sensing networks for the estimation of linear functions.Journal of Physics A: Mathe- matical and Theoretical, 53(34):344001, March 2020. ISSN 1751-8113. doi:10.1088/1751- 8121/ab9d46

work page doi:10.1088/1751- 2020
[12]

Goldberg, Luis L

Aaron Z. Goldberg, Luis L. S´ anchez-Soto, and Hugo Ferretti. Intrinsic Sensitivity Limits for Multiparameter Quantum Metrology.Physical Review Letters, 127(11):110501, September

work page
[13]

doi:10.1103/PhysRevLett.127.110501

work page doi:10.1103/physrevlett.127.110501
[14]

Distributed quantum phase esti- mation with entangled photons.Nature Photonics, 15(2):137–142, February 2021

Li-Zheng Liu, Yu-Zhe Zhang, Zheng-Da Li, Rui Zhang, Xu-Fei Yin, Yue-Yang Fei, Li Li, Nai-Le Liu, Feihu Xu, Yu-Ao Chen, and Jian-Wei Pan. Distributed quantum phase esti- mation with entangled photons.Nature Photonics, 15(2):137–142, February 2021. ISSN 1749-4885, 1749-4893. doi:10.1038/s41566-020-00718-2

work page doi:10.1038/s41566-020-00718-2 2021
[15]

Optimal distributed sens- ing in noisy environments.Physical Review Research, 2(2):1–8, May 2019

Pavel Sekatski, Sabine W¨ olk, and Wolfgang D¨ ur. Optimal distributed sens- ing in noisy environments.Physical Review Research, 2(2):1–8, May 2019. doi:10.1103/PhysRevResearch.2.023052

work page doi:10.1103/physrevresearch.2.023052 2019
[16]

Approximate decoherence free subspaces for distributed sensing.Quantum Science and Technology, 7(2):025003, January 2022

Arne Hamann, Pavel Sekatski, and Wolfgang D¨ ur. Approximate decoherence free subspaces for distributed sensing.Quantum Science and Technology, 7(2):025003, January 2022. ISSN 2058-9565. doi:10.1088/2058-9565/ac44de

work page doi:10.1088/2058-9565/ac44de 2022
[17]

Optimal distributed mul- tiparameter estimation in noisy environments, June 2023, arXiv:2306.01077

Arne Hamann, Pavel Sekatski, and Wolfgang D¨ ur. Optimal distributed mul- tiparameter estimation in noisy environments, June 2023, arXiv:2306.01077. doi:10.48550/arXiv.2306.01077

work page doi:10.48550/arxiv.2306.01077 2023
[18]

Selective and noise- resilient wave estimation with quantum sensor networks, December 2024, arXiv:2412.12291

Arne Hamann, Paul Aigner, Pavel Sekatski, and Wolfgang D¨ ur. Selective and noise- resilient wave estimation with quantum sensor networks, December 2024, arXiv:2412.12291. doi:10.48550/arXiv.2412.12291

work page doi:10.48550/arxiv.2412.12291 2024
[19]

Experimental dis- tributed quantum sensing in a noisy environment, January 2025, arXiv:2501.08940

James Bate, Arne Hamann, Marco Canteri, Armin Winkler, Zhe Xian Koong, Vic- tor Krutyanskiy, Wolfgang D¨ ur, and Benjamin Peter Lanyon. Experimental dis- tributed quantum sensing in a noisy environment, January 2025, arXiv:2501.08940. doi:10.48550/arXiv.2501.08940

work page doi:10.48550/arxiv.2501.08940 2025
[20]

Private and Robust States for Distributed Quantum Sensing.Quantum, 9:1596, January 2025

Lu´ ıs Bugalho, Majid Hassani, Yasser Omar, and Damian Markham. Private and Robust States for Distributed Quantum Sensing.Quantum, 9:1596, January 2025. doi:10.22331/q- 2025-01-15-1596

work page doi:10.22331/q- 2025
[21]

Marijn A. M. Versteegh, Michael E. Reimer, Aafke A. Van Den Berg, Gediminas Juska, Valeria Dimastrodonato, Agnieszka Gocalinska, Emanuele Pelucchi, and Val Zwiller. Single pairs of time-bin-entangled photons.Physical Review A, 92(3):033802, September 2015. ISSN 1050-2947, 1094-1622. doi:10.1103/PhysRevA.92.033802

work page doi:10.1103/physreva.92.033802 2015
[22]

Bell, Andri Mahendra, Chunle Xiong, Philip H

Xiang Zhang, Bryn A. Bell, Andri Mahendra, Chunle Xiong, Philip H. W. Leong, and Benjamin J. Eggleton. Integrated silicon nitride time-bin entanglement circuits.Optics Letters, 43(15):3469–3472, August 2018. ISSN 1539-4794. doi:10.1364/OL.43.003469

work page doi:10.1364/ol.43.003469 2018
[23]

Abend, M

S. Abend, M. Gersemann, C. Schubert, D. Schlippert, E. M. Rasel, M. Zimmermann, M. A. Efremov, A. Roura, F. A. Narducci, and W. P. Schleich. Atom interferometry and its applications.Proceedings of the International School of Physics ”Enrico Fermi”, 197: 345–392, 2019. ISSN 18798195. doi:10.3254/978-1-61499-937-9-345

work page doi:10.3254/978-1-61499-937-9-345 2019
[24]

Quantum interpolation for high-resolution sens- ing.Proceedings of the National Academy of Sciences, 114(9):2149–2153, February 2017

Ashok Ajoy, Yi-Xiang Liu, Kasturi Saha, Luca Marseglia, Jean-Christophe Jaskula, Ulf Bissbort, and Paola Cappellaro. Quantum interpolation for high-resolution sens- ing.Proceedings of the National Academy of Sciences, 114(9):2149–2153, February 2017. doi:10.1073/pnas.1610835114. 23

work page doi:10.1073/pnas.1610835114 2017
[25]

Magnetometer with nitrogen-vacancy cen- ter in a bulk diamond for detecting magnetic nanoparticles in biomedical applications

Akihiro Kuwahata, Takahiro Kitaizumi, Kota Saichi, Takumi Sato, Ryuji Igarashi, Takeshi Ohshima, Yuta Masuyama, Takayuki Iwasaki, Mutsuko Hatano, Fedor Jelezko, Moriaki Kusakabe, Takashi Yatsui, and Masaki Sekino. Magnetometer with nitrogen-vacancy cen- ter in a bulk diamond for detecting magnetic nanoparticles in biomedical applications. Scientific Repor...

work page doi:10.1038/s41598-020- 2020
[26]

Buck, Raymond A

Marshall W. Buck, Raymond A. Coley, and David P. Robbins. A Generalized Vandermonde Determinant.Journal of Algebraic Combinatorics, 1(2):105–109, September 1992. ISSN 1572-9192. doi:10.1023/A:1022468019197

work page doi:10.1023/a:1022468019197 1992
[27]

Lundeng˚ ard.Generalized Vandermonde Matrices and Determinants in Electromagnetic Compatibility

K. Lundeng˚ ard.Generalized Vandermonde Matrices and Determinants in Electromagnetic Compatibility. PhD thesis, 2017

work page 2017
[28]

MATH 216: Foundations of algebraic geometry

Ravi Vakil. MATH 216: Foundations of algebraic geometry

work page
[29]

J S Milne.Algebraic Geometry. 2023

work page 2023
[30]

William Fulton.Algebraic Curves, volume Mathematics Lecture Note Series. 2008

work page 2008
[31]

On the ideal structure of the ring of entire functions.Pa- cific Journal of Mathematics, 2(2):179–184, June 1952

Melvin Henriksen. On the ideal structure of the ring of entire functions.Pa- cific Journal of Mathematics, 2(2):179–184, June 1952. ISSN 0030-8730, 0030-8730. doi:10.2140/pjm.1952.2.179

work page doi:10.2140/pjm.1952.2.179 1952
[32]

On the prime ideals of the ring of entire functions.Pacific Journal of Mathematics, 3(4):711–720, December 1953

Melvin Henriksen. On the prime ideals of the ring of entire functions.Pacific Journal of Mathematics, 3(4):711–720, December 1953. ISSN 0030-8730, 0030-8730. doi:10.2140/pjm.1953.3.711. A Invertibility of Vandermonde Matrix In this appendix we pick up on the informal theorem (Thm. 3.1) in the main text to prove a more formal version of it, using tools of ...

work page doi:10.2140/pjm.1953.3.711 1953
[33]

, xn] then V(T)⊆V(S)

IfS⊆T⊆k[x 1, . . . , xn] then V(T)⊆V(S)

work page
[34]

If{I α}is a collection of ideals, then V ( S α Iα) =T α V (Iα) 3.V(IJ) =V(I)∪V(J)

work page
[35]

, xm −a m) ={(a 1,

V(0) =A m,V(1) =∅, and V (x 1 −a 1, . . . , xm −a m) ={(a 1, . . . , am)}

work page
[36]

IfX⊆Y⊆A m then I(Y)⊆I(X)

work page
[37]

I(∅) =k[x 1, . . . , xn]. I ({(a1, . . . , an)}) =⟨x 1 −a 1, . . . , xm −a m⟩for any point (a1, . . . , am)∈ Am. I (An) = 0 ifkis infinite. 7.S⊆I(V(S)) for any set of polynomialsS⊆k[x 1, . . . , xn].X⊆V(I(X)) for any set of pointsX⊆A m

work page
[38]

V(I(V(S))) = V(S) for any set of polynomialsS⊆k[x 1, . . . , xn]. I(V(I(X))) = I(X) for any set of pointsX⊆A m. Intuitively, the main idea behind finding the ideals, is that they should give the smallest polynomials under which composition into a larger polynomial (in terms of degree) can be made while maintaining the zero locus of the smallest polynomial...

work page