We provide Maple verification of the main arguments present in the proof of the main statement in our recent article ”Explicit maximal to- tally real embeddings” as well as verification of the vanishing of the integrability equations there up to a certain order. The present note provide also a useful synthesis of the main arguments in our article. The note is written in an independent fashion with respect to the article . Therefore it can be read by computer programmers without differential geometry background. We keep the notations here as much close as possible to the notations in the article . In this note we show that the explicit formula for the complex structure given in allows very fast computer verification of the vanishing of its integrability equations up to the order k = 7.
We provide Maple verification of the main arguments present in the proof of the main statement in our recent article ”Explicit maximal to- tally real embeddings” [Pal-Sal] as well as verification of the vanishing of the integrability equations there up to a certain order. The present note provide also a useful synthesis of the main arguments in our article. The note is written in an independent fashion with respect to the article [Pal-Sal]. Therefore it can be read by computer programmers without differential geometry background. We keep the notations here as much close as possible to the notations in the article [Pal-Sal]. In this note we show that the explicit formula for the complex structure given in [Pal-Sal] allows very fast computer verification of the vanishing of its integrability equations up to the order k = 7.