Problem 1
It records when homological features appear and disappear across a filtration, summarized by intervals or a persistence diagram.
Faculty solution guide
Computational Topology and Persistent Homology
Accept equivalent mathematically correct reasoning. Require explicit definitions, theorem hypotheses, proof structure, verification, and limitations.
Problem 2
Identify the first invalid inference, missing hypothesis, quantifier error, unjustified limit interchange, or unproved existence claim; then supply a valid repair.
Problem 3
A complete response explicitly states the definitions, domain, hypotheses, exact target, and theorem dependencies for Computational Topology and Persistent Homology.
Problem 4
The argument must address tracking homological features across filtrations with each nontrivial step justified and the final conclusion restated.
Problem 5
A strong application explains the mathematical model in topological data analysis, robotics, materials, quantum field theory, relativity, geometric computing, and advanced research, verifies conditions, and names at least one limitation.
Problem 6
Accept a second valid proof, a counterexample showing necessity of a hypothesis, an independent estimate, or a reproducible finite check that is correctly described as supporting evidence.