Exact P1 forest N25A

Abstract

Ordered concatenation of the complete literal forest; no check success is asserted.

Definition 1.1 (Ordered literal forest nodes).

Lean statement: D5/S3/Quantum/Entanglement/AbsolutePPT/P1Data/Nodes/N25A.nodes

Formalization. D5/S3/Quantum/Entanglement/AbsolutePPT/P1Data/Nodes/N25A.nodes (✓ std3).

Source. Repository-derived.

Commentary.

The ordered records retain every box endpoint, rule, child index and rational coefficient. These data assert no successful check.

References

• Truth anchor: D5/S3/Quantum/Entanglement/AbsolutePPT/P1Data/Nodes/N25A.nodes
• Dependency: D5/S3/Quantum/Entanglement/AbsolutePPT/P1Data/Nodes/N25AChunk00
• Dependency: D5/S3/Quantum/Entanglement/AbsolutePPT/P1Data/Nodes/N25AChunk01
• Dependency: D5/S3/Quantum/Entanglement/AbsolutePPT/P1Data/Nodes/N25AChunk02
• Dependency: D5/S3/Quantum/Entanglement/AbsolutePPT/P1Data/Nodes/N25AChunk03