Public weights, bounded rejection, and chart calibration
DefinitionInfoLossLAR_RuntimeBundle_04affine-transportinfo-loss-lar-runtimestoc-2027
These programs evaluate the background and paired-tensor weights, implement bounded rejection with an explicit fallback, and complete local charts by finite iteration, projection, and legalization. The random input is an explicit finite bit string. The definitions provide total algorithms, including behavior on malformed or insufficient encoded data.
Definition code
import Definitions.Def_InfoLossLAR_RuntimeBundle_03
open _root_.InfoLossLARNativeSupplements.h7fd26e43562bbe30.AFT.BinaryArithmetic.RationalBits renaming exists_code → AFT.BinaryArithmetic.RationalBits.exists_code
open _root_.InfoLossLARNativeSupplements.h7fd26e43562bbe30.AFT.BinaryArithmetic.RationalBits renaming exists_code → _p2mNativeSupplement0
open _root_.InfoLossLARNativeSupplements.hbc5d2d237f3bc4c8.AFT.BinaryArithmetic renaming bits_value → AFT.BinaryArithmetic.bits_value
open _root_.InfoLossLARNativeSupplements.hbc5d2d237f3bc4c8.AFT.BinaryArithmetic renaming bits_value → _p2mNativeSupplement1
open _root_.InfoLossLARNativeSupplements.h5a8ca90c605f85fc.AFT.CanonicalMoments renaming independent_embedding_expectation_general → AFT.CanonicalMoments.independent_embedding_expectation_general
open _root_.InfoLossLARNativeSupplements.h5a8ca90c605f85fc.AFT.CanonicalMoments renaming independent_embedding_expectation_general → _p2mNativeSupplement2
open _root_.InfoLossLARNativeSupplements.hf808c8dbbd952db7.AFT.CanonicalMoments renaming independent_equiv_expectation_general → AFT.CanonicalMoments.independent_equiv_expectation_general
open _root_.InfoLossLARNativeSupplements.hf808c8dbbd952db7.AFT.CanonicalMoments renaming independent_equiv_expectation_general → _p2mNativeSupplement3
open _root_.InfoLossLARNativeSupplements.h854528c9e123c6f3.AFT.RationalNumerics.HeightBound renaming div → AFT.RationalNumerics.HeightBound.div
open _root_.InfoLossLARNativeSupplements.h854528c9e123c6f3.AFT.RationalNumerics.HeightBound renaming div → _p2mNativeSupplement4
open _root_.InfoLossLARNativeSupplements.ha562531658b7642e.AFT.RationalNumerics.HeightBound renaming inv → AFT.RationalNumerics.HeightBound.inv
open _root_.InfoLossLARNativeSupplements.ha562531658b7642e.AFT.RationalNumerics.HeightBound renaming inv → _p2mNativeSupplement5
open _root_.InfoLossLARNativeSupplements.h4f5add37bf40c2da.AFT.RationalNumerics.HeightBound renaming mono → AFT.RationalNumerics.HeightBound.mono
open _root_.InfoLossLARNativeSupplements.h4f5add37bf40c2da.AFT.RationalNumerics.HeightBound renaming mono → _p2mNativeSupplement6
open _root_.InfoLossLARNativeSupplements.hec331a1b1191da2d.AFT.RationalNumerics.HeightBound renaming mul → AFT.RationalNumerics.HeightBound.mul
open _root_.InfoLossLARNativeSupplements.hec331a1b1191da2d.AFT.RationalNumerics.HeightBound renaming mul → _p2mNativeSupplement7
open _root_.InfoLossLARNativeSupplements.hca9f3ecea512145f.AFT.RationalNumerics.HeightBound renaming of_int → AFT.RationalNumerics.HeightBound.of_int
open _root_.InfoLossLARNativeSupplements.hca9f3ecea512145f.AFT.RationalNumerics.HeightBound renaming of_int → _p2mNativeSupplement8
open _root_.InfoLossLARNativeSupplements.h5b3dd70c728d6348.AFT.RationalNumerics.HeightBound renaming of_nat → AFT.RationalNumerics.HeightBound.of_nat
open _root_.InfoLossLARNativeSupplements.h5b3dd70c728d6348.AFT.RationalNumerics.HeightBound renaming of_nat → _p2mNativeSupplement9
open _root_.InfoLossLARNativeSupplements.h8fac5110874b5cd9.AFT.RationalNumerics.HeightBound renaming one → AFT.RationalNumerics.HeightBound.one
open _root_.InfoLossLARNativeSupplements.h8fac5110874b5cd9.AFT.RationalNumerics.HeightBound renaming one → _p2mNativeSupplement10
open _root_.InfoLossLARNativeSupplements.h90032182500c2e77.AFT.RationalNumerics.HeightBound renaming pow → AFT.RationalNumerics.HeightBound.pow
open _root_.InfoLossLARNativeSupplements.h90032182500c2e77.AFT.RationalNumerics.HeightBound renaming pow → _p2mNativeSupplement11
open _root_.InfoLossLARNativeSupplements.h6381918e2bfc67e4.AFT.RationalNumerics renaming arctanSum_error → AFT.RationalNumerics.arctanSum_error
open _root_.InfoLossLARNativeSupplements.h6381918e2bfc67e4.AFT.RationalNumerics renaming arctanSum_error → _p2mNativeSupplement12
open _root_.InfoLossLARNativeSupplements.h3497cf28d345cc71.AFT.RationalNumerics renaming arctan_term_bound → AFT.RationalNumerics.arctan_term_bound
open _root_.InfoLossLARNativeSupplements.h3497cf28d345cc71.AFT.RationalNumerics renaming arctan_term_bound → _p2mNativeSupplement13
open _root_.InfoLossLARNativeSupplements.had468f01f375d910.AFT.RationalNumerics renaming boundedRootList_nodup → AFT.RationalNumerics.boundedRootList_nodup
open _root_.InfoLossLARNativeSupplements.had468f01f375d910.AFT.RationalNumerics renaming boundedRootList_nodup → _p2mNativeSupplement14
open _root_.InfoLossLARNativeSupplements.h41ae6c8d47a51d34.AFT.RationalNumerics renaming commonDenominator_le → AFT.RationalNumerics.commonDenominator_le
open _root_.InfoLossLARNativeSupplements.h41ae6c8d47a51d34.AFT.RationalNumerics renaming commonDenominator_le → _p2mNativeSupplement15
open _root_.InfoLossLARNativeSupplements.h5f0d1be1226eed7f.AFT.RationalNumerics renaming commonDenominator_pos → AFT.RationalNumerics.commonDenominator_pos
open _root_.InfoLossLARNativeSupplements.h5f0d1be1226eed7f.AFT.RationalNumerics renaming commonDenominator_pos → _p2mNativeSupplement16
open _root_.InfoLossLARNativeSupplements.h1076ff82614707e5.AFT.RationalNumerics renaming commonNumerator_abs_le → AFT.RationalNumerics.commonNumerator_abs_le
open _root_.InfoLossLARNativeSupplements.h1076ff82614707e5.AFT.RationalNumerics renaming commonNumerator_abs_le → _p2mNativeSupplement17
open _root_.InfoLossLARNativeSupplements.h3827d5d7d51242c6.AFT.RationalNumerics renaming commonNumerator_cast → AFT.RationalNumerics.commonNumerator_cast
open _root_.InfoLossLARNativeSupplements.h3827d5d7d51242c6.AFT.RationalNumerics renaming commonNumerator_cast → _p2mNativeSupplement18
open _root_.InfoLossLARNativeSupplements.h4b0b2c49d14fd209.AFT.RationalNumerics renaming commonNumerator_div → AFT.RationalNumerics.commonNumerator_div
open _root_.InfoLossLARNativeSupplements.h4b0b2c49d14fd209.AFT.RationalNumerics renaming commonNumerator_div → _p2mNativeSupplement19
open _root_.InfoLossLARNativeSupplements.h2882c93186ab7cf8.AFT.RationalNumerics renaming denominator_dvd_common → AFT.RationalNumerics.denominator_dvd_common
open _root_.InfoLossLARNativeSupplements.h2882c93186ab7cf8.AFT.RationalNumerics renaming denominator_dvd_common → _p2mNativeSupplement20
open _root_.InfoLossLARNativeSupplements.h05d99dd2bef78a64.AFT.RationalNumerics renaming integerLinearIteration_abs_le → AFT.RationalNumerics.integerLinearIteration_abs_le
open _root_.InfoLossLARNativeSupplements.h05d99dd2bef78a64.AFT.RationalNumerics renaming integerLinearIteration_abs_le → _p2mNativeSupplement21
open _root_.InfoLossLARNativeSupplements.hc6ad092b2f522781.AFT.RationalNumerics renaming integerLinearIteration_exact → AFT.RationalNumerics.integerLinearIteration_exact
open _root_.InfoLossLARNativeSupplements.hc6ad092b2f522781.AFT.RationalNumerics renaming integerLinearIteration_exact → _p2mNativeSupplement22
open _root_.InfoLossLARNativeSupplements.hdcd54a4fdf95f258.AFT.RationalNumerics renaming integerLinearIteration_height → AFT.RationalNumerics.integerLinearIteration_height
open _root_.InfoLossLARNativeSupplements.hdcd54a4fdf95f258.AFT.RationalNumerics renaming integerLinearIteration_height → _p2mNativeSupplement23
open _root_.InfoLossLARNativeSupplements.he7db6c4ee6224eee.AFT.RationalNumerics renaming linearIteration_height → AFT.RationalNumerics.linearIteration_height
open _root_.InfoLossLARNativeSupplements.he7db6c4ee6224eee.AFT.RationalNumerics renaming linearIteration_height → _p2mNativeSupplement24
open _root_.InfoLossLARNativeSupplements.h18af7218e3ae5082.AFT.RationalNumerics renaming mem_boundedRootList → AFT.RationalNumerics.mem_boundedRootList
open _root_.InfoLossLARNativeSupplements.h18af7218e3ae5082.AFT.RationalNumerics renaming mem_boundedRootList → _p2mNativeSupplement25
open _root_.InfoLossLARNativeSupplements.h878260dd8e6c9a6e.AFT.RationalNumerics renaming piApprox_error → AFT.RationalNumerics.piApprox_error
open _root_.InfoLossLARNativeSupplements.h878260dd8e6c9a6e.AFT.RationalNumerics renaming piApprox_error → _p2mNativeSupplement26
open _root_.InfoLossLARNativeSupplements.h91d71a61f0497f7b.AFT.RationalNumerics renaming piApprox_le_five → AFT.RationalNumerics.piApprox_le_five
open _root_.InfoLossLARNativeSupplements.h91d71a61f0497f7b.AFT.RationalNumerics renaming piApprox_le_five → _p2mNativeSupplement27
open _root_.InfoLossLARNativeSupplements.hb0db73987b7b1eff.AFT.V7Calibration renaming actualPublicBodyChoice_nonempty → AFT.V7Calibration.actualPublicBodyChoice_nonempty
open _root_.InfoLossLARNativeSupplements.hb0db73987b7b1eff.AFT.V7Calibration renaming actualPublicBodyChoice_nonempty → _p2mNativeSupplement28
open _root_.InfoLossLARNativeSupplements.hb6587a05bd2df660.AFT.V7Calibration renaming actualPublicPrimaryChoice_nonempty → AFT.V7Calibration.actualPublicPrimaryChoice_nonempty
open _root_.InfoLossLARNativeSupplements.hb6587a05bd2df660.AFT.V7Calibration renaming actualPublicPrimaryChoice_nonempty → _p2mNativeSupplement29
open _root_.InfoLossLARNativeSupplements.he83cfe7a7db39d44.CurrentAFT.BinaryFiniteProduct renaming current_value → CurrentAFT.BinaryFiniteProduct.current_value
open _root_.InfoLossLARNativeSupplements.he83cfe7a7db39d44.CurrentAFT.BinaryFiniteProduct renaming current_value → _p2mNativeSupplement30
open _root_.InfoLossLARNativeSupplements.hf109288ce2bff41a.CurrentAFT.BinaryFullResponseCounts renaming current_sizes → CurrentAFT.BinaryFullResponseCounts.current_sizes
open _root_.InfoLossLARNativeSupplements.hf109288ce2bff41a.CurrentAFT.BinaryFullResponseCounts renaming current_sizes → _p2mNativeSupplement31
open _root_.InfoLossLARNativeSupplements.hab90893a8a9293a2.CurrentAFT.BinaryListSum renaming current_value → CurrentAFT.BinaryListSum.current_value
open _root_.InfoLossLARNativeSupplements.hab90893a8a9293a2.CurrentAFT.BinaryListSum renaming current_value → _p2mNativeSupplement32
open _root_.InfoLossLARNativeSupplements.hb7b15c9a79e648be.CurrentAFT.BinaryRootMetadataSerializer renaming actualChoice_ordinary → CurrentAFT.BinaryRootMetadataSerializer.actualChoice_ordinary
open _root_.InfoLossLARNativeSupplements.hb7b15c9a79e648be.CurrentAFT.BinaryRootMetadataSerializer renaming actualChoice_ordinary → _p2mNativeSupplement33
open _root_.InfoLossLARNativeSupplements.h9bd8eaff2c880c78.CurrentAFT.BinaryRootMetadataSerializer renaming actualChoice_primary → CurrentAFT.BinaryRootMetadataSerializer.actualChoice_primary
open _root_.InfoLossLARNativeSupplements.h9bd8eaff2c880c78.CurrentAFT.BinaryRootMetadataSerializer renaming actualChoice_primary → _p2mNativeSupplement34
open _root_.InfoLossLARNativeSupplements.ha802267fba3ae37a.CurrentAFT.BinaryRootMetadataSerializer renaming candidate_input → CurrentAFT.BinaryRootMetadataSerializer.candidate_input
open _root_.InfoLossLARNativeSupplements.ha802267fba3ae37a.CurrentAFT.BinaryRootMetadataSerializer renaming candidate_input → _p2mNativeSupplement35
open _root_.InfoLossLARNativeSupplements.h1ccc0b12a2e9b2e7.CurrentAFT.BinaryRootMetadataSerializer renaming candidate_kept → CurrentAFT.BinaryRootMetadataSerializer.candidate_kept
open _root_.InfoLossLARNativeSupplements.h1ccc0b12a2e9b2e7.CurrentAFT.BinaryRootMetadataSerializer renaming candidate_kept → _p2mNativeSupplement36
open _root_.InfoLossLARNativeSupplements.hf63ab620f3c57a9b.CurrentAFT.BinaryRootMetadataSerializer renaming candidate_ordinary → CurrentAFT.BinaryRootMetadataSerializer.candidate_ordinary
open _root_.InfoLossLARNativeSupplements.hf63ab620f3c57a9b.CurrentAFT.BinaryRootMetadataSerializer renaming candidate_ordinary → _p2mNativeSupplement37
open _root_.InfoLossLARNativeSupplements.h8b1af35cb5128d1e.CurrentAFT.BinaryRootMetadataSerializer renaming candidate_primary → CurrentAFT.BinaryRootMetadataSerializer.candidate_primary
open _root_.InfoLossLARNativeSupplements.h8b1af35cb5128d1e.CurrentAFT.BinaryRootMetadataSerializer renaming candidate_primary → _p2mNativeSupplement38
open _root_.InfoLossLARNativeSupplements.hc002c1f58373bc9e.CurrentAFT.BinaryRootMetadataSerializer renaming classify_numbering → CurrentAFT.BinaryRootMetadataSerializer.classify_numbering
open _root_.InfoLossLARNativeSupplements.hc002c1f58373bc9e.CurrentAFT.BinaryRootMetadataSerializer renaming classify_numbering → _p2mNativeSupplement39
open _root_.InfoLossLARNativeSupplements.h0654708b8f7abd41.CurrentAFT.BinaryRootMetadataSerializer renaming current_castMetadata → CurrentAFT.BinaryRootMetadataSerializer.current_castMetadata
open _root_.InfoLossLARNativeSupplements.h0654708b8f7abd41.CurrentAFT.BinaryRootMetadataSerializer renaming current_castMetadata → _p2mNativeSupplement40
open _root_.InfoLossLARNativeSupplements.h62365cd168bf9746.CurrentAFT.BinaryRootMetadataSerializer renaming current_cast_tags → CurrentAFT.BinaryRootMetadataSerializer.current_cast_tags
open _root_.InfoLossLARNativeSupplements.h62365cd168bf9746.CurrentAFT.BinaryRootMetadataSerializer renaming current_cast_tags → _p2mNativeSupplement41
open _root_.InfoLossLARNativeSupplements.hd04a074a03468451.CurrentAFT.BinaryRootMetadataSerializer renaming current_congr_counts → CurrentAFT.BinaryRootMetadataSerializer.current_congr_counts
open _root_.InfoLossLARNativeSupplements.hd04a074a03468451.CurrentAFT.BinaryRootMetadataSerializer renaming current_congr_counts → _p2mNativeSupplement42
open _root_.InfoLossLARNativeSupplements.h92779a9b15e1ad74.CurrentAFT.BinaryRootMetadataSerializer renaming current_kept_le → CurrentAFT.BinaryRootMetadataSerializer.current_kept_le
open _root_.InfoLossLARNativeSupplements.h92779a9b15e1ad74.CurrentAFT.BinaryRootMetadataSerializer renaming current_kept_le → _p2mNativeSupplement43
open _root_.InfoLossLARNativeSupplements.h5d3e6518d488d268.CurrentAFT.BinaryRootMetadataSerializer renaming current_metadata_actual → CurrentAFT.BinaryRootMetadataSerializer.current_metadata_actual
open _root_.InfoLossLARNativeSupplements.h5d3e6518d488d268.CurrentAFT.BinaryRootMetadataSerializer renaming current_metadata_actual → _p2mNativeSupplement44
open _root_.InfoLossLARNativeSupplements.h6da04ab1cb4f0ae9.CurrentAFT.BinaryRootMetadataSerializer renaming current_native_counts → CurrentAFT.BinaryRootMetadataSerializer.current_native_counts
open _root_.InfoLossLARNativeSupplements.h6da04ab1cb4f0ae9.CurrentAFT.BinaryRootMetadataSerializer renaming current_native_counts → _p2mNativeSupplement45
open _root_.InfoLossLARNativeSupplements.h0034013fd46e34b6.CurrentAFT.BinaryRootMetadataSerializer renaming current_rational_actual → CurrentAFT.BinaryRootMetadataSerializer.current_rational_actual
open _root_.InfoLossLARNativeSupplements.h0034013fd46e34b6.CurrentAFT.BinaryRootMetadataSerializer renaming current_rational_actual → _p2mNativeSupplement46
open _root_.InfoLossLARNativeSupplements.he41810aeef644de7.CurrentAFT.BinaryRootMetadataSerializer renaming current_rational_native → CurrentAFT.BinaryRootMetadataSerializer.current_rational_native
open _root_.InfoLossLARNativeSupplements.he41810aeef644de7.CurrentAFT.BinaryRootMetadataSerializer renaming current_rational_native → _p2mNativeSupplement47
open _root_.InfoLossLARNativeSupplements.hdf21f91932116c35.CurrentAFT.BinaryRootMetadataSerializer renaming current_role → CurrentAFT.BinaryRootMetadataSerializer.current_role
open _root_.InfoLossLARNativeSupplements.hdf21f91932116c35.CurrentAFT.BinaryRootMetadataSerializer renaming current_role → _p2mNativeSupplement48
open _root_.InfoLossLARNativeSupplements.h2f02b0da80d0da15.CurrentAFT.BinaryRootMetadataSerializer renaming current_role_actual → CurrentAFT.BinaryRootMetadataSerializer.current_role_actual
open _root_.InfoLossLARNativeSupplements.h2f02b0da80d0da15.CurrentAFT.BinaryRootMetadataSerializer renaming current_role_actual → _p2mNativeSupplement49
open _root_.InfoLossLARNativeSupplements.hf05bd272bb1b56e1.CurrentAFT.BinaryRootMetadataSerializer renaming current_tagSlot → CurrentAFT.BinaryRootMetadataSerializer.current_tagSlot
open _root_.InfoLossLARNativeSupplements.hf05bd272bb1b56e1.CurrentAFT.BinaryRootMetadataSerializer renaming current_tagSlot → _p2mNativeSupplement50
open _root_.InfoLossLARNativeSupplements.h99dea6e0b2cb92cd.CurrentAFT.BinaryRootMetadataSerializer renaming current_tagSlot_actual → CurrentAFT.BinaryRootMetadataSerializer.current_tagSlot_actual
open _root_.InfoLossLARNativeSupplements.h99dea6e0b2cb92cd.CurrentAFT.BinaryRootMetadataSerializer renaming current_tagSlot_actual → _p2mNativeSupplement51
open _root_.InfoLossLARNativeSupplements.h5aa51497de94248a.CurrentAFT.BinaryRootMetadataSerializer renaming find_value → CurrentAFT.BinaryRootMetadataSerializer.find_value
open _root_.InfoLossLARNativeSupplements.h5aa51497de94248a.CurrentAFT.BinaryRootMetadataSerializer renaming find_value → _p2mNativeSupplement52
open _root_.InfoLossLARNativeSupplements.he1ba053a04ebe416.CurrentAFT.BinaryRootMetadataSerializer renaming inputOrdering_symm_kept → CurrentAFT.BinaryRootMetadataSerializer.inputOrdering_symm_kept
open _root_.InfoLossLARNativeSupplements.he1ba053a04ebe416.CurrentAFT.BinaryRootMetadataSerializer renaming inputOrdering_symm_kept → _p2mNativeSupplement53
open _root_.InfoLossLARNativeSupplements.hb19b481a4ab916e9.CurrentAFT.BinaryRootMetadataSerializer renaming inputOrdering_symm_ordinary → CurrentAFT.BinaryRootMetadataSerializer.inputOrdering_symm_ordinary
open _root_.InfoLossLARNativeSupplements.hb19b481a4ab916e9.CurrentAFT.BinaryRootMetadataSerializer renaming inputOrdering_symm_ordinary → _p2mNativeSupplement54
open _root_.InfoLossLARNativeSupplements.h925bf1f311c5581d.CurrentAFT.BinaryRootMetadataSerializer renaming inputOrdering_symm_primary → CurrentAFT.BinaryRootMetadataSerializer.inputOrdering_symm_primary
open _root_.InfoLossLARNativeSupplements.h925bf1f311c5581d.CurrentAFT.BinaryRootMetadataSerializer renaming inputOrdering_symm_primary → _p2mNativeSupplement55
open _root_.InfoLossLARNativeSupplements.h28bdeb915df6f31b.CurrentAFT.BinaryRootMetadataSerializer renaming keptOrdering_number → CurrentAFT.BinaryRootMetadataSerializer.keptOrdering_number
open _root_.InfoLossLARNativeSupplements.h28bdeb915df6f31b.CurrentAFT.BinaryRootMetadataSerializer renaming keptOrdering_number → _p2mNativeSupplement56
open _root_.InfoLossLARNativeSupplements.hd98ece77ce245c62.CurrentAFT.BinaryRootMetadataSerializer renaming kept_length_le → CurrentAFT.BinaryRootMetadataSerializer.kept_length_le
open _root_.InfoLossLARNativeSupplements.hd98ece77ce245c62.CurrentAFT.BinaryRootMetadataSerializer renaming kept_length_le → _p2mNativeSupplement57
open _root_.InfoLossLARNativeSupplements.h0c3b1f75a36dc0a1.CurrentAFT.BinaryRootMetadataSerializer renaming matchesBlock_input → CurrentAFT.BinaryRootMetadataSerializer.matchesBlock_input
open _root_.InfoLossLARNativeSupplements.h0c3b1f75a36dc0a1.CurrentAFT.BinaryRootMetadataSerializer renaming matchesBlock_input → _p2mNativeSupplement58
open _root_.InfoLossLARNativeSupplements.h3614eab28d16c434.CurrentAFT.BinaryRootMetadataSerializer renaming matchesBlock_value → CurrentAFT.BinaryRootMetadataSerializer.matchesBlock_value
open _root_.InfoLossLARNativeSupplements.h3614eab28d16c434.CurrentAFT.BinaryRootMetadataSerializer renaming matchesBlock_value → _p2mNativeSupplement59
open _root_.InfoLossLARNativeSupplements.h7211ad64e277ecd6.CurrentAFT.BinaryRootMetadataSerializer renaming nativeTag_get → CurrentAFT.BinaryRootMetadataSerializer.nativeTag_get
open _root_.InfoLossLARNativeSupplements.h7211ad64e277ecd6.CurrentAFT.BinaryRootMetadataSerializer renaming nativeTag_get → _p2mNativeSupplement60
open _root_.InfoLossLARNativeSupplements.h5bfd14958fa45ca1.CurrentAFT.BinaryRootMetadataSerializer renaming nativeTag_increasing → CurrentAFT.BinaryRootMetadataSerializer.nativeTag_increasing
open _root_.InfoLossLARNativeSupplements.h5bfd14958fa45ca1.CurrentAFT.BinaryRootMetadataSerializer renaming nativeTag_increasing → _p2mNativeSupplement61
open _root_.InfoLossLARNativeSupplements.h830e34787bfcc36e.CurrentAFT.BinaryRootMetadataSerializer renaming nativeTag_membership → CurrentAFT.BinaryRootMetadataSerializer.nativeTag_membership
open _root_.InfoLossLARNativeSupplements.h830e34787bfcc36e.CurrentAFT.BinaryRootMetadataSerializer renaming nativeTag_membership → _p2mNativeSupplement62
open _root_.InfoLossLARNativeSupplements.hdf4e90e4faeda9bb.CurrentAFT.BinaryRootMetadataSerializer renaming nativeTag_tagsInput → CurrentAFT.BinaryRootMetadataSerializer.nativeTag_tagsInput
open _root_.InfoLossLARNativeSupplements.hdf4e90e4faeda9bb.CurrentAFT.BinaryRootMetadataSerializer renaming nativeTag_tagsInput → _p2mNativeSupplement63
open _root_.InfoLossLARNativeSupplements.h0eb6479555712d22.CurrentAFT.BinaryRootMetadataSerializer renaming nativeTag_tagsInput_vector → CurrentAFT.BinaryRootMetadataSerializer.nativeTag_tagsInput_vector
open _root_.InfoLossLARNativeSupplements.h0eb6479555712d22.CurrentAFT.BinaryRootMetadataSerializer renaming nativeTag_tagsInput_vector → _p2mNativeSupplement64
open _root_.InfoLossLARNativeSupplements.he3484ce79e618bef.CurrentAFT.BinaryRootMetadataSerializer renaming nativeTag_value → CurrentAFT.BinaryRootMetadataSerializer.nativeTag_value
open _root_.InfoLossLARNativeSupplements.he3484ce79e618bef.CurrentAFT.BinaryRootMetadataSerializer renaming nativeTag_value → _p2mNativeSupplement65
open _root_.InfoLossLARNativeSupplements.hb10c61056b84e123.CurrentAFT.BinaryRootMetadataSerializer renaming position_input → CurrentAFT.BinaryRootMetadataSerializer.position_input
open _root_.InfoLossLARNativeSupplements.hb10c61056b84e123.CurrentAFT.BinaryRootMetadataSerializer renaming position_input → _p2mNativeSupplement66
open _root_.InfoLossLARNativeSupplements.h717398dca61c08fb.CurrentAFT.BinaryRootMetadataSerializer renaming rational_current_cast_tags → CurrentAFT.BinaryRootMetadataSerializer.rational_current_cast_tags
open _root_.InfoLossLARNativeSupplements.h717398dca61c08fb.CurrentAFT.BinaryRootMetadataSerializer renaming rational_current_cast_tags → _p2mNativeSupplement67
open _root_.InfoLossLARNativeSupplements.h5c1679d60747a3c8.CurrentAFT.BinaryRootMetadataSerializer renaming retainedInput_at_group → CurrentAFT.BinaryRootMetadataSerializer.retainedInput_at_group
open _root_.InfoLossLARNativeSupplements.h5c1679d60747a3c8.CurrentAFT.BinaryRootMetadataSerializer renaming retainedInput_at_group → _p2mNativeSupplement68
open _root_.InfoLossLARNativeSupplements.hd10b40ce4e5fb3ce.CurrentAFT.BinaryRootMetadataSerializer renaming retainedInput_get → CurrentAFT.BinaryRootMetadataSerializer.retainedInput_get
open _root_.InfoLossLARNativeSupplements.hd10b40ce4e5fb3ce.CurrentAFT.BinaryRootMetadataSerializer renaming retainedInput_get → _p2mNativeSupplement69
open _root_.InfoLossLARNativeSupplements.h790debae9bc7d744.CurrentAFT.BinaryRootMetadataSerializer renaming role_input → CurrentAFT.BinaryRootMetadataSerializer.role_input
open _root_.InfoLossLARNativeSupplements.h790debae9bc7d744.CurrentAFT.BinaryRootMetadataSerializer renaming role_input → _p2mNativeSupplement70
open _root_.InfoLossLARNativeSupplements.h36433fb6e771176d.CurrentAFT.BinaryRootMetadataSerializer renaming role_kept → CurrentAFT.BinaryRootMetadataSerializer.role_kept
open _root_.InfoLossLARNativeSupplements.h36433fb6e771176d.CurrentAFT.BinaryRootMetadataSerializer renaming role_kept → _p2mNativeSupplement71
open _root_.InfoLossLARNativeSupplements.h1c0aacbfbcab259c.CurrentAFT.BinaryRootMetadataSerializer renaming role_ordinary → CurrentAFT.BinaryRootMetadataSerializer.role_ordinary
open _root_.InfoLossLARNativeSupplements.h1c0aacbfbcab259c.CurrentAFT.BinaryRootMetadataSerializer renaming role_ordinary → _p2mNativeSupplement72
open _root_.InfoLossLARNativeSupplements.had28d56c66c172c2.CurrentAFT.BinaryRootMetadataSerializer renaming role_primary → CurrentAFT.BinaryRootMetadataSerializer.role_primary
open _root_.InfoLossLARNativeSupplements.had28d56c66c172c2.CurrentAFT.BinaryRootMetadataSerializer renaming role_primary → _p2mNativeSupplement73
open _root_.InfoLossLARNativeSupplements.hf7b606d7b6c71037.CurrentAFT.BinaryRootMetadataSerializer renaming splitIndex_value → CurrentAFT.BinaryRootMetadataSerializer.splitIndex_value
open _root_.InfoLossLARNativeSupplements.hf7b606d7b6c71037.CurrentAFT.BinaryRootMetadataSerializer renaming splitIndex_value → _p2mNativeSupplement74
open _root_.InfoLossLARNativeSupplements.hc171b658125977dd.CurrentAFT.BinaryRootMetadataSerializer renaming tagBlocks_card → CurrentAFT.BinaryRootMetadataSerializer.tagBlocks_card
open _root_.InfoLossLARNativeSupplements.hc171b658125977dd.CurrentAFT.BinaryRootMetadataSerializer renaming tagBlocks_card → _p2mNativeSupplement75
open _root_.InfoLossLARNativeSupplements.h864990220cd05a68.CurrentAFT.BinaryRootMetadataSerializer renaming tagSlot_input → CurrentAFT.BinaryRootMetadataSerializer.tagSlot_input
open _root_.InfoLossLARNativeSupplements.h864990220cd05a68.CurrentAFT.BinaryRootMetadataSerializer renaming tagSlot_input → _p2mNativeSupplement76
open _root_.InfoLossLARNativeSupplements.he99bee3d04267632.CurrentAFT.BinaryRootMetadataSerializer renaming tagsInput_get → CurrentAFT.BinaryRootMetadataSerializer.tagsInput_get
open _root_.InfoLossLARNativeSupplements.he99bee3d04267632.CurrentAFT.BinaryRootMetadataSerializer renaming tagsInput_get → _p2mNativeSupplement77
open _root_.InfoLossLARNativeSupplements.h15d8c2848429780a.CurrentAFT.BinaryRootMetadataSerializer renaming vector_count_cast_get → CurrentAFT.BinaryRootMetadataSerializer.vector_count_cast_get
open _root_.InfoLossLARNativeSupplements.h15d8c2848429780a.CurrentAFT.BinaryRootMetadataSerializer renaming vector_count_cast_get → _p2mNativeSupplement78
open _root_.InfoLossLARNativeSupplements.h6033ffbe1c08cc96.CurrentAFT.BinaryRootMetadataSerializer renaming vector_length_cast_get → CurrentAFT.BinaryRootMetadataSerializer.vector_length_cast_get
open _root_.InfoLossLARNativeSupplements.h6033ffbe1c08cc96.CurrentAFT.BinaryRootMetadataSerializer renaming vector_length_cast_get → _p2mNativeSupplement79
open _root_.InfoLossLARNativeSupplements.he438d921f6936ff8.CurrentAFT.BinaryRootMetadataSerializer renaming vector_mem_toList → CurrentAFT.BinaryRootMetadataSerializer.vector_mem_toList
open _root_.InfoLossLARNativeSupplements.he438d921f6936ff8.CurrentAFT.BinaryRootMetadataSerializer renaming vector_mem_toList → _p2mNativeSupplement80
open _root_.InfoLossLARNativeSupplements.he37fcb2fedaaad11.CurrentAFT.BinarySparseCycleEvaluation renaming current_tuple_value → CurrentAFT.BinarySparseCycleEvaluation.current_tuple_value
open _root_.InfoLossLARNativeSupplements.he37fcb2fedaaad11.CurrentAFT.BinarySparseCycleEvaluation renaming current_tuple_value → _p2mNativeSupplement81
open _root_.InfoLossLARNativeSupplements.h42f327202f6ffc34.CurrentAFT.BinarySparseCycleEvaluation renaming rootEntry_value → CurrentAFT.BinarySparseCycleEvaluation.rootEntry_value
open _root_.InfoLossLARNativeSupplements.h42f327202f6ffc34.CurrentAFT.BinarySparseCycleEvaluation renaming rootEntry_value → _p2mNativeSupplement82
open _root_.InfoLossLARNativeSupplements.h046841627a1cee9b.CurrentAFT.BinarySparseCycleEvaluation renaming roots_value → CurrentAFT.BinarySparseCycleEvaluation.roots_value
open _root_.InfoLossLARNativeSupplements.h046841627a1cee9b.CurrentAFT.BinarySparseCycleEvaluation renaming roots_value → _p2mNativeSupplement83
open _root_.InfoLossLARNativeSupplements.hd0df78f75d4d893f.CurrentAFT.BinarySparseCycleEvaluation renaming term_value → CurrentAFT.BinarySparseCycleEvaluation.term_value
open _root_.InfoLossLARNativeSupplements.hd0df78f75d4d893f.CurrentAFT.BinarySparseCycleEvaluation renaming term_value → _p2mNativeSupplement84
open _root_.InfoLossLARNativeSupplements.hf4f5fd4dcb0d678c.CurrentAFT.BinarySparseCycleEvaluation renaming weightEntry_value → CurrentAFT.BinarySparseCycleEvaluation.weightEntry_value
open _root_.InfoLossLARNativeSupplements.hf4f5fd4dcb0d678c.CurrentAFT.BinarySparseCycleEvaluation renaming weightEntry_value → _p2mNativeSupplement85
open _root_.InfoLossLARNativeSupplements.haf9b5363dbfc3f4c.CurrentAFT.BinarySparseCycleSemantic renaming coordinates_apply → CurrentAFT.BinarySparseCycleSemantic.coordinates_apply
open _root_.InfoLossLARNativeSupplements.haf9b5363dbfc3f4c.CurrentAFT.BinarySparseCycleSemantic renaming coordinates_apply → _p2mNativeSupplement86
open _root_.InfoLossLARNativeSupplements.hb39aff037bdc4326.CurrentAFT.BinarySparseCycleSemantic renaming current_value → CurrentAFT.BinarySparseCycleSemantic.current_value
open _root_.InfoLossLARNativeSupplements.hb39aff037bdc4326.CurrentAFT.BinarySparseCycleSemantic renaming current_value → _p2mNativeSupplement87
open _root_.InfoLossLARNativeSupplements.h0cda298b0874d5b6.CurrentAFT.BinarySparseCycleSemantic renaming product_coordinates → CurrentAFT.BinarySparseCycleSemantic.product_coordinates
open _root_.InfoLossLARNativeSupplements.h0cda298b0874d5b6.CurrentAFT.BinarySparseCycleSemantic renaming product_coordinates → _p2mNativeSupplement88
open _root_.InfoLossLARNativeSupplements.h10d530ee15bdc77f.CurrentAFT.BinarySparseCycleSemantic renaming roots_coordinates → CurrentAFT.BinarySparseCycleSemantic.roots_coordinates
open _root_.InfoLossLARNativeSupplements.h10d530ee15bdc77f.CurrentAFT.BinarySparseCycleSemantic renaming roots_coordinates → _p2mNativeSupplement89
open _root_.InfoLossLARNativeSupplements.h5cfbe96a887c7fbe.CurrentAFT.BinaryTouchedCycle renaming candidates_length → CurrentAFT.BinaryTouchedCycle.candidates_length
open _root_.InfoLossLARNativeSupplements.h5cfbe96a887c7fbe.CurrentAFT.BinaryTouchedCycle renaming candidates_length → _p2mNativeSupplement90
open _root_.InfoLossLARNativeSupplements.hbcb1352f59b47e7a.CurrentAFT.BinaryTouchedCycle renaming prepare_length → CurrentAFT.BinaryTouchedCycle.prepare_length
open _root_.InfoLossLARNativeSupplements.hbcb1352f59b47e7a.CurrentAFT.BinaryTouchedCycle renaming prepare_length → _p2mNativeSupplement91
open _root_.InfoLossLARNativeSupplements.h7b66ba8c3614b749.CurrentAFT.BinaryTouchedCycle renaming unique_length → CurrentAFT.BinaryTouchedCycle.unique_length
open _root_.InfoLossLARNativeSupplements.h7b66ba8c3614b749.CurrentAFT.BinaryTouchedCycle renaming unique_length → _p2mNativeSupplement92
open _root_.InfoLossLARNativeSupplements.h8bc15ae79e4624be.CurrentAFT.BinaryTouchedCycleBuffer renaming lookup_value → CurrentAFT.BinaryTouchedCycleBuffer.lookup_value
open _root_.InfoLossLARNativeSupplements.h8bc15ae79e4624be.CurrentAFT.BinaryTouchedCycleBuffer renaming lookup_value → _p2mNativeSupplement93
open _root_.InfoLossLARNativeSupplements.hf362d6b0d865f5c6.CurrentAFT.BinaryTouchedCycleRanks renaming positions_value → CurrentAFT.BinaryTouchedCycleRanks.positions_value
open _root_.InfoLossLARNativeSupplements.hf362d6b0d865f5c6.CurrentAFT.BinaryTouchedCycleRanks renaming positions_value → _p2mNativeSupplement94
open _root_.InfoLossLARNativeSupplements.h4cdf4f6ad2d19d90.CurrentAFT.BinaryTupleSum renaming current_value → CurrentAFT.BinaryTupleSum.current_value
open _root_.InfoLossLARNativeSupplements.h4cdf4f6ad2d19d90.CurrentAFT.BinaryTupleSum renaming current_value → _p2mNativeSupplement95
open _root_.InfoLossLARNativeSupplements.ha8fcea89e723dc23.CurrentAFT.BinaryTupleSum renaming get_ofFn_fun → CurrentAFT.BinaryTupleSum.get_ofFn_fun
open _root_.InfoLossLARNativeSupplements.ha8fcea89e723dc23.CurrentAFT.BinaryTupleSum renaming get_ofFn_fun → _p2mNativeSupplement96
open _root_.InfoLossLARNativeSupplements.ha84cbfc4268e8d40.CurrentAFT.BinaryTupleSum renaming prepend_get → CurrentAFT.BinaryTupleSum.prepend_get
open _root_.InfoLossLARNativeSupplements.ha84cbfc4268e8d40.CurrentAFT.BinaryTupleSum renaming prepend_get → _p2mNativeSupplement97
open _root_.InfoLossLARNativeSupplements.hcca3d782e3229b7c.CurrentAFT.BinaryTupleSum renaming prepend_value → CurrentAFT.BinaryTupleSum.prepend_value
open _root_.InfoLossLARNativeSupplements.hcca3d782e3229b7c.CurrentAFT.BinaryTupleSum renaming prepend_value → _p2mNativeSupplement98
open _root_.InfoLossLARNativeSupplements.h78d75bb492074482.CurrentAFT.CountedBoundedRootTags.Tag renaming card → CurrentAFT.CountedBoundedRootTags.Tag.card
open _root_.InfoLossLARNativeSupplements.h78d75bb492074482.CurrentAFT.CountedBoundedRootTags.Tag renaming card → _p2mNativeSupplement99
open _root_.InfoLossLARNativeSupplements.h9568a61082f27bb9.CurrentAFT.CountedBoundedRootTags.Tag renaming nodup → CurrentAFT.CountedBoundedRootTags.Tag.nodup
open _root_.InfoLossLARNativeSupplements.h9568a61082f27bb9.CurrentAFT.CountedBoundedRootTags.Tag renaming nodup → _p2mNativeSupplement100
open _root_.InfoLossLARNativeSupplements.hf6e7f4bd634f80a9.CurrentAFT.CountedBoundedRootTags.Tag renaming read_value → CurrentAFT.CountedBoundedRootTags.Tag.read_value
open _root_.InfoLossLARNativeSupplements.hf6e7f4bd634f80a9.CurrentAFT.CountedBoundedRootTags.Tag renaming read_value → _p2mNativeSupplement101
open _root_.InfoLossLARNativeSupplements.hd05ef333dfb7baf7.CurrentAFT.CountedBoundedRootTags.Tag renaming store_value → CurrentAFT.CountedBoundedRootTags.Tag.store_value
open _root_.InfoLossLARNativeSupplements.hd05ef333dfb7baf7.CurrentAFT.CountedBoundedRootTags.Tag renaming store_value → _p2mNativeSupplement102
open _root_.InfoLossLARNativeSupplements.h8bf8720ebb55498f.CurrentAFT.CountedBoundedRootTags.Tag renaming vector_increasing → CurrentAFT.CountedBoundedRootTags.Tag.vector_increasing
open _root_.InfoLossLARNativeSupplements.h8bf8720ebb55498f.CurrentAFT.CountedBoundedRootTags.Tag renaming vector_increasing → _p2mNativeSupplement103
open _root_.InfoLossLARNativeSupplements.h5fde173c8469afa6.CurrentAFT.CountedBoundedRootTags renaming current_sets → CurrentAFT.CountedBoundedRootTags.current_sets
open _root_.InfoLossLARNativeSupplements.h5fde173c8469afa6.CurrentAFT.CountedBoundedRootTags renaming current_sets → _p2mNativeSupplement104
open _root_.InfoLossLARNativeSupplements.he8f344a3055fc54a.CurrentAFT.CountedBoundedRootTags renaming entry_sets → CurrentAFT.CountedBoundedRootTags.entry_sets
open _root_.InfoLossLARNativeSupplements.he8f344a3055fc54a.CurrentAFT.CountedBoundedRootTags renaming entry_sets → _p2mNativeSupplement105
open _root_.InfoLossLARNativeSupplements.h2c50018e32584610.CurrentAFT.CountedBoundedRootTags renaming guarded_value → CurrentAFT.CountedBoundedRootTags.guarded_value
open _root_.InfoLossLARNativeSupplements.h2c50018e32584610.CurrentAFT.CountedBoundedRootTags renaming guarded_value → _p2mNativeSupplement106
open _root_.InfoLossLARNativeSupplements.h4aa23a1b871c5bc6.CurrentAFT.CountedBoundedRootTags renaming sum_value → CurrentAFT.CountedBoundedRootTags.sum_value
open _root_.InfoLossLARNativeSupplements.h4aa23a1b871c5bc6.CurrentAFT.CountedBoundedRootTags renaming sum_value → _p2mNativeSupplement107
open _root_.InfoLossLARNativeSupplements.h5a83c4211de0d052.CurrentAFT.CountedBoundedRootTags renaming sum_value_equiv → CurrentAFT.CountedBoundedRootTags.sum_value_equiv
open _root_.InfoLossLARNativeSupplements.h5a83c4211de0d052.CurrentAFT.CountedBoundedRootTags renaming sum_value_equiv → _p2mNativeSupplement108
open _root_.InfoLossLARNativeSupplements.h857ff8dbe55756b8.CurrentAFT.CurrentCycleEntryProgram renaming bodyCount_eq → CurrentAFT.CurrentCycleEntryProgram.bodyCount_eq
open _root_.InfoLossLARNativeSupplements.h857ff8dbe55756b8.CurrentAFT.CurrentCycleEntryProgram renaming bodyCount_eq → _p2mNativeSupplement109
open _root_.InfoLossLARNativeSupplements.h4b24203afd73c049.CurrentAFT.CurrentCycleEntryProgram renaming roots_mod_iff → CurrentAFT.CurrentCycleEntryProgram.roots_mod_iff
open _root_.InfoLossLARNativeSupplements.h4b24203afd73c049.CurrentAFT.CurrentCycleEntryProgram renaming roots_mod_iff → _p2mNativeSupplement110
open _root_.InfoLossLARNativeSupplements.h187f69822989eb63.CurrentAFT.CurrentCycleEntryProgram renaming selectedEntry_cast → CurrentAFT.CurrentCycleEntryProgram.selectedEntry_cast
open _root_.InfoLossLARNativeSupplements.h187f69822989eb63.CurrentAFT.CurrentCycleEntryProgram renaming selectedEntry_cast → _p2mNativeSupplement111
open _root_.InfoLossLARNativeSupplements.h9180bab9fc132623.CurrentAFT.CurrentCycleEntryProgram renaming selected_probability_source → CurrentAFT.CurrentCycleEntryProgram.selected_probability_source
open _root_.InfoLossLARNativeSupplements.h9180bab9fc132623.CurrentAFT.CurrentCycleEntryProgram renaming selected_probability_source → _p2mNativeSupplement112
open _root_.InfoLossLARNativeSupplements.hf7c0550335227b9c.CurrentAFT.CurrentGaussianBits renaming ratio_bounds → CurrentAFT.CurrentGaussianBits.ratio_bounds
open _root_.InfoLossLARNativeSupplements.hf7c0550335227b9c.CurrentAFT.CurrentGaussianBits renaming ratio_bounds → _p2mNativeSupplement113
open _root_.InfoLossLARNativeSupplements.ha029c925a85a9044.CurrentAFT.CurrentPublicShiftProgram renaming encode_value → CurrentAFT.CurrentPublicShiftProgram.encode_value
open _root_.InfoLossLARNativeSupplements.ha029c925a85a9044.CurrentAFT.CurrentPublicShiftProgram renaming encode_value → _p2mNativeSupplement114
open _root_.InfoLossLARNativeSupplements.h4ae04e3f1cb5b359.CurrentAFT.CurrentRootSlotIndex renaming tagPosition_eq → CurrentAFT.CurrentRootSlotIndex.tagPosition_eq
open _root_.InfoLossLARNativeSupplements.h4ae04e3f1cb5b359.CurrentAFT.CurrentRootSlotIndex renaming tagPosition_eq → _p2mNativeSupplement115
open _root_.InfoLossLARNativeSupplements.h20ee486b3d1dffd8.CurrentAFT.CyclePatternProgram renaming averagedEvaluate_cast → CurrentAFT.CyclePatternProgram.averagedEvaluate_cast
open _root_.InfoLossLARNativeSupplements.h20ee486b3d1dffd8.CurrentAFT.CyclePatternProgram renaming averagedEvaluate_cast → _p2mNativeSupplement116
open _root_.InfoLossLARNativeSupplements.hb37dd6f3dcea3b7d.CurrentAFT.CyclePatternProgram renaming evaluate_local → CurrentAFT.CyclePatternProgram.evaluate_local
open _root_.InfoLossLARNativeSupplements.hb37dd6f3dcea3b7d.CurrentAFT.CyclePatternProgram renaming evaluate_local → _p2mNativeSupplement117
open _root_.InfoLossLARNativeSupplements.h689ba464633d8cff.CurrentAFT.CyclePatternProgram renaming evaluate_semantics → CurrentAFT.CyclePatternProgram.evaluate_semantics
open _root_.InfoLossLARNativeSupplements.h689ba464633d8cff.CurrentAFT.CyclePatternProgram renaming evaluate_semantics → _p2mNativeSupplement118
open _root_.InfoLossLARNativeSupplements.hd02155c30f7ca58d.CurrentAFT.CyclePatternProgram renaming gaussianEvaluate_eq_windowEvaluate → CurrentAFT.CyclePatternProgram.gaussianEvaluate_eq_windowEvaluate
open _root_.InfoLossLARNativeSupplements.hd02155c30f7ca58d.CurrentAFT.CyclePatternProgram renaming gaussianEvaluate_eq_windowEvaluate → _p2mNativeSupplement119
open _root_.InfoLossLARNativeSupplements.hc532f8ed89f571a1.CurrentAFT.CyclePatternProgram renaming gaussianEvaluate_semantics → CurrentAFT.CyclePatternProgram.gaussianEvaluate_semantics
open _root_.InfoLossLARNativeSupplements.hc532f8ed89f571a1.CurrentAFT.CyclePatternProgram renaming gaussianEvaluate_semantics → _p2mNativeSupplement120
open _root_.InfoLossLARNativeSupplements.h3e1ece29cbe1b4d4.CurrentAFT.CyclePatternProgram renaming restricted_expectation → CurrentAFT.CyclePatternProgram.restricted_expectation
open _root_.InfoLossLARNativeSupplements.h3e1ece29cbe1b4d4.CurrentAFT.CyclePatternProgram renaming restricted_expectation → _p2mNativeSupplement121
open _root_.InfoLossLARNativeSupplements.h33993643e1712ab8.CurrentAFT.CycleRootExpansion renaming current_body_two_le → CurrentAFT.CycleRootExpansion.current_body_two_le
open _root_.InfoLossLARNativeSupplements.h33993643e1712ab8.CurrentAFT.CycleRootExpansion renaming current_body_two_le → _p2mNativeSupplement122
open _root_.InfoLossLARNativeSupplements.hd99e5f9e75bbb7e1.CurrentAFT.CycleSelections renaming averagedSelectedLaw_coordinate → CurrentAFT.CycleSelections.averagedSelectedLaw_coordinate
open _root_.InfoLossLARNativeSupplements.hd99e5f9e75bbb7e1.CurrentAFT.CycleSelections renaming averagedSelectedLaw_coordinate → _p2mNativeSupplement123
open _root_.InfoLossLARNativeSupplements.h788b7dba49e3cc6b.CurrentAFT.CycleSelections renaming selectedLaw_coordinate → CurrentAFT.CycleSelections.selectedLaw_coordinate
open _root_.InfoLossLARNativeSupplements.h788b7dba49e3cc6b.CurrentAFT.CycleSelections renaming selectedLaw_coordinate → _p2mNativeSupplement124
open _root_.InfoLossLARNativeSupplements.h8eafa7c1234de921.CurrentAFT.FullResponseEnumeration renaming mem_boundedSubsets → CurrentAFT.FullResponseEnumeration.mem_boundedSubsets
open _root_.InfoLossLARNativeSupplements.h8eafa7c1234de921.CurrentAFT.FullResponseEnumeration renaming mem_boundedSubsets → _p2mNativeSupplement125
open _root_.InfoLossLARNativeSupplements.h4d94229af05aca84.CurrentAFT.Parameters renaming modulus_eq_find → CurrentAFT.Parameters.modulus_eq_find
open _root_.InfoLossLARNativeSupplements.h4d94229af05aca84.CurrentAFT.Parameters renaming modulus_eq_find → _p2mNativeSupplement126
open _root_.InfoLossLARNativeSupplements.h7c8d9f04458b8eff.CurrentAFT.ProtectedCycle renaming cycleLaw_marginal → CurrentAFT.ProtectedCycle.cycleLaw_marginal
open _root_.InfoLossLARNativeSupplements.h7c8d9f04458b8eff.CurrentAFT.ProtectedCycle renaming cycleLaw_marginal → _p2mNativeSupplement127
open _root_.InfoLossLARNativeSupplements.ha0baf4dfdfb7707f.CurrentAFT.ProtectedCycle renaming cycleLaw_marginal_of_two_le → CurrentAFT.ProtectedCycle.cycleLaw_marginal_of_two_le
open _root_.InfoLossLARNativeSupplements.ha0baf4dfdfb7707f.CurrentAFT.ProtectedCycle renaming cycleLaw_marginal_of_two_le → _p2mNativeSupplement128
open _root_.InfoLossLARNativeSupplements.h94f62847a0770621.CurrentAFT.ProtectedCycle renaming independent_pair_law → CurrentAFT.ProtectedCycle.independent_pair_law
open _root_.InfoLossLARNativeSupplements.h94f62847a0770621.CurrentAFT.ProtectedCycle renaming independent_pair_law → _p2mNativeSupplement129
open _root_.InfoLossLARNativeSupplements.h2021c53cebcb97f7.CurrentAFT.RationalScalarFamilyAverage renaming current_eq_window_sum → CurrentAFT.RationalScalarFamilyAverage.current_eq_window_sum
open _root_.InfoLossLARNativeSupplements.h2021c53cebcb97f7.CurrentAFT.RationalScalarFamilyAverage renaming current_eq_window_sum → _p2mNativeSupplement130
open _root_.InfoLossLARNativeSupplements.h6473fbae786c301e.CurrentAFT.RootSignedMassProgram renaming referenceEntry_cast → CurrentAFT.RootSignedMassProgram.referenceEntry_cast
open _root_.InfoLossLARNativeSupplements.h6473fbae786c301e.CurrentAFT.RootSignedMassProgram renaming referenceEntry_cast → _p2mNativeSupplement131
open _root_.InfoLossLARNativeSupplements.h4c23fa31c2a53a0c.CurrentAFT.RootSignedMassProgram renaming singleton_probability → CurrentAFT.RootSignedMassProgram.singleton_probability
open _root_.InfoLossLARNativeSupplements.h4c23fa31c2a53a0c.CurrentAFT.RootSignedMassProgram renaming singleton_probability → _p2mNativeSupplement132
open _root_.InfoLossLARNativeSupplements.hb738544899c1bf50.CurrentAFT.TensorPublicProjection renaming independent_decision_expectation → CurrentAFT.TensorPublicProjection.independent_decision_expectation
open _root_.InfoLossLARNativeSupplements.hb738544899c1bf50.CurrentAFT.TensorPublicProjection renaming independent_decision_expectation → _p2mNativeSupplement133
open _root_.InfoLossLARNativeSupplements.hf2382f7ddc8e222e.AFT.RationalNumerics renaming natAbs_finset_sum_le → AFT.RationalNumerics.natAbs_finset_sum_le
open _root_.InfoLossLARNativeSupplements.hf2382f7ddc8e222e.AFT.RationalNumerics renaming natAbs_finset_sum_le → _p2mNativeSupplement134
open _root_.InfoLossLARNativeSupplements.h707562ec4bd11ae8.AFT.RationalNumerics.HeightBound renaming reduced_le → AFT.RationalNumerics.HeightBound.reduced_le
open _root_.InfoLossLARNativeSupplements.h707562ec4bd11ae8.AFT.RationalNumerics.HeightBound renaming reduced_le → _p2mNativeSupplement135
open _root_.InfoLossLARNativeSupplements.hd70d55bab6f2346d.CurrentAFT.CountedBoundedRootTags renaming bounded_sum → CurrentAFT.CountedBoundedRootTags.bounded_sum
open _root_.InfoLossLARNativeSupplements.hd70d55bab6f2346d.CurrentAFT.CountedBoundedRootTags renaming bounded_sum → _p2mNativeSupplement136
open _root_.InfoLossLARNativeSupplements.hb84db39a2a2ae627.CurrentAFT.CountedBoundedRootTags renaming flatMap_attach → CurrentAFT.CountedBoundedRootTags.flatMap_attach
open _root_.InfoLossLARNativeSupplements.hb84db39a2a2ae627.CurrentAFT.CountedBoundedRootTags renaming flatMap_attach → _p2mNativeSupplement137
open _root_.InfoLossLARNativeSupplements.he91e90e23380c2d0.CurrentAFT.JointTaggedPhysicalFock renaming law_nonempty → CurrentAFT.JointTaggedPhysicalFock.law_nonempty
open _root_.InfoLossLARNativeSupplements.he91e90e23380c2d0.CurrentAFT.JointTaggedPhysicalFock renaming law_nonempty → _p2mNativeSupplement138
section
namespace CurrentAFT
end CurrentAFT
namespace CurrentAFT.MarkedPairCertificates
end CurrentAFT.MarkedPairCertificates
namespace CurrentAFT.MarkedPairCertificates.markedMixedCertificate
end CurrentAFT.MarkedPairCertificates.markedMixedCertificate
namespace CurrentAFT.RationalConditionalPairProgram
end CurrentAFT.RationalConditionalPairProgram
namespace CurrentAFT.RationalConditionalPairProgram.centeredMean
end CurrentAFT.RationalConditionalPairProgram.centeredMean
namespace CurrentAFT.RationalConditionalPairProgram.colors
end CurrentAFT.RationalConditionalPairProgram.colors
namespace CurrentAFT.RationalConditionalPairProgram.computedBound
end CurrentAFT.RationalConditionalPairProgram.computedBound
namespace CurrentAFT.RationalConditionalPairProgram.current
end CurrentAFT.RationalConditionalPairProgram.current
namespace CurrentAFT.RationalConditionalPairProgram.errorConstant
end CurrentAFT.RationalConditionalPairProgram.errorConstant
namespace CurrentAFT.RationalConditionalPairProgram.profileErrorConstant
end CurrentAFT.RationalConditionalPairProgram.profileErrorConstant
namespace CurrentAFT.RationalMarkedPairProgram
end CurrentAFT.RationalMarkedPairProgram
set_option autoImplicit false
set_option maxHeartbeats 3000000
set_option maxRecDepth 10000
set_option backward.isDefEq.respectTransparency false
namespace Integration9_9.TM2NativeBackgroundMarked
open AFT AFT.RationalNumerics CurrentAFT GradedControlAlgebra
open OAI.MetricKMedian.Binary OAI.MetricKMedian.Binary.Automatic
open TM2NativeRootGroupAlgebra TM2NativeRootGroupProfiles TM2NativeRootGroupMass TM2NativeBackgroundProfiles
open scoped BigOperators
abbrev Meta := _root_.Integration9_9.TM2NativeFirstInverse.Meta
def fixedAnchor (x : (_root_.Integration9_9.TM2NativeBackgroundMarked.Meta × ℤ) × (ℕ × ℕ)) : ℚ :=
_root_.CurrentAFT.RationalMarkedSeedProgram.fixedAnchor x.1.1.1.length x.2.1 x.1.2 x.2.2
@[fun_prop] theorem fixedAnchor_poly : Poly _root_.Integration9_9.TM2NativeBackgroundMarked.fixedAnchor := by
have h : Poly (fun x : (_root_.Integration9_9.TM2NativeBackgroundMarked.Meta × ℤ) × (ℕ × ℕ) => _root_.Integration9_9.TM2NativeMarkedKernel.current
((_root_.Integration9_9.TM2NativePrime.modulus x.1.1.1,_root_.Integration9_9.TM2NativeProfile.widthTicks x.1.1.1),((x.2.1,x.1.2),((x.2.1,x.2.2),0)))) := by fun_prop
refine ⟨h.program.congr _ (fun x => ?_)⟩
simp only [_root_.Integration9_9.TM2NativeBackgroundMarked.fixedAnchor,_root_.CurrentAFT.RationalMarkedSeedProgram.fixedAnchor,_root_.CurrentAFT.RationalProposalProgram.anchorKernel,
_root_.Integration9_9.TM2NativeMarkedKernel.current_value,_root_.Integration9_9.TM2NativePrime.modulus_native,_root_.Integration9_9.TM2NativeProfile.widthTicks_length,neg_neg]
def secondCentered (x : (_root_.Integration9_9.TM2NativeBackgroundMarked.Meta × ℤ) × (ℕ × ℕ)) : ℚ := _root_.CurrentAFT.RationalMarkedSeedProgram.secondCentered
x.1.1.1.length x.1.1.2.length x.2.1 x.1.2 x.2.2
@[fun_prop] theorem secondCentered_poly : Poly _root_.Integration9_9.TM2NativeBackgroundMarked.secondCentered := by
change Poly (fun x : (_root_.Integration9_9.TM2NativeBackgroundMarked.Meta × ℤ) × (ℕ × ℕ) => _root_.Integration9_9.TM2NativeBackgroundMarked.fixedAnchor x / _root_.Integration9_9.TM2NativeRootGroupProfiles.center (x.1.1,x.2.2)-1)
fun_prop
def secondMean (x : (_root_.Integration9_9.TM2NativeBackgroundMarked.Meta × ℤ) × ℕ) : ℚ := _root_.CurrentAFT.RationalMarkedSeedProgram.secondMean
x.1.1.1.length x.1.1.2.length x.1.2 x.2
@[fun_prop] theorem secondMean_poly : Poly _root_.Integration9_9.TM2NativeBackgroundMarked.secondMean := by
let f := fun y : (_root_.Integration9_9.TM2NativeBackgroundMarked.Meta × (ℤ × ℕ)) × ℕ => _root_.Integration9_9.TM2NativeRootGroupProfiles.primary (y.1.1,y.2)*_root_.Integration9_9.TM2NativeBackgroundMarked.secondCentered ((y.1.1,y.1.2.1),(y.2,y.1.2.2))
have hf : Poly f := by unfold f;fun_prop
exact Automatic.Poly.comp (g := fun x : (_root_.Integration9_9.TM2NativeBackgroundMarked.Meta × ℤ) × ℕ => (x.1.1,(x.1.2,x.2))) (_root_.Integration9_9.TM2NativeRootGroupProfiles.palette_sum_poly hf) (by fun_prop)
def seedDensity (x : (_root_.Integration9_9.TM2NativeBackgroundMarked.Meta × ℤ) × (ℕ × ℕ)) : ℚ := _root_.CurrentAFT.RationalMarkedSeedProgram.seedDensity
x.1.1.1.length x.1.1.2.length x.2.1 x.1.2 x.2.2
@[fun_prop] theorem seedDensity_poly : Poly _root_.Integration9_9.TM2NativeBackgroundMarked.seedDensity := by
change Poly (fun x : (_root_.Integration9_9.TM2NativeBackgroundMarked.Meta × ℤ) × (ℕ × ℕ) => _root_.Integration9_9.TM2NativeBackgroundMarked.secondCentered x -
(1/(_root_.Integration9_9.TM2NativeBackgroundProfiles.colors x.1.1.1 : ℚ))/_root_.Integration9_9.TM2NativeRootGroupProfiles.primary (x.1.1,x.2.1)*_root_.Integration9_9.TM2NativeBackgroundMarked.secondMean (x.1,x.2.2))
fun_prop
def inverseDensity (x : (_root_.Integration9_9.TM2NativeBackgroundMarked.Meta × ℤ) × (ℕ × ℕ)) : ℚ := _root_.CurrentAFT.RationalMarkedSeedProgram.inverseDensity
x.1.1.1.length x.1.1.2.length x.1.2 x.2.1 x.2.2
@[fun_prop] theorem inverseDensity_poly : Poly _root_.Integration9_9.TM2NativeBackgroundMarked.inverseDensity := by
let f := fun y : (_root_.Integration9_9.TM2NativeBackgroundMarked.Meta × (ℤ × ℕ)) × ℕ => _root_.Integration9_9.TM2NativeRootGroupProfiles.primary (y.1.1,y.2)*_root_.Integration9_9.TM2NativeBackgroundMarked.seedDensity ((y.1.1,y.1.2.1),(y.2,y.1.2.2))
have hf : Poly f := by unfold f;fun_prop
exact Automatic.Poly.comp (g := fun x : (_root_.Integration9_9.TM2NativeBackgroundMarked.Meta × ℤ) × (ℕ × ℕ) => ((x.1.1,(x.1.2,x.2.2)),x.2.1))
(_root_.Integration9_9.TM2NativeRootGroupProfiles.massLift_poly hf) (by fun_prop)
def primaryDeviation (x : (_root_.Integration9_9.TM2NativeBackgroundMarked.Meta × Unit) × ℕ) : ℚ := _root_.CurrentAFT.RationalPrimaryDeviationProgram.profile
x.1.1.1.length x.1.1.2.length x.2
@[fun_prop] theorem primaryDeviation_poly : Poly _root_.Integration9_9.TM2NativeBackgroundMarked.primaryDeviation := by
change Poly (fun x : (_root_.Integration9_9.TM2NativeBackgroundMarked.Meta × Unit) × ℕ => _root_.Integration9_9.TM2NativeRootGroupProfiles.primary (x.1.1,x.2)-1/(_root_.Integration9_9.TM2NativeBackgroundProfiles.colors x.1.1.1 : ℚ))
fun_prop
def primaryDensity (x : _root_.Integration9_9.TM2NativeBackgroundMarked.Meta × ℕ) : ℚ := _root_.CurrentAFT.RationalMassLiftProgram.current x.1.1.length x.1.2.length
(_root_.CurrentAFT.RationalPrimaryDeviationProgram.profile x.1.1.length x.1.2.length) x.2
@[fun_prop] theorem primaryDensity_poly : Poly _root_.Integration9_9.TM2NativeBackgroundMarked.primaryDensity :=
Automatic.Poly.comp (g := fun x : _root_.Integration9_9.TM2NativeBackgroundMarked.Meta × ℕ => ((x.1,()),x.2)) (_root_.Integration9_9.TM2NativeRootGroupProfiles.massLift_poly _root_.Integration9_9.TM2NativeBackgroundMarked.primaryDeviation_poly) (by fun_prop)
theorem primaryIsPoly (order : ℕ) : _root_.Integration9_9.TM2NativeRootGroupAlgebra.IsPoly order (fun x : _root_.Integration9_9.TM2NativeBackgroundMarked.Meta => _root_.CurrentAFT.RationalPrimaryDeviationProgram.current x.1.length x.2.length order) :=
_root_.Integration9_9.TM2NativeRootGroupAlgebra.IsPoly.firstTable _root_.Integration9_9.TM2NativeBackgroundMarked.primaryDensity_poly (Automatic.Poly.const 0)
attribute [local irreducible] RationalMarkedSeedProgram.inverseDensity
theorem mixedIsPoly (order : ℕ) : _root_.Integration9_9.TM2NativeRootGroupAlgebra.IsPoly order (fun x : _root_.Integration9_9.TM2NativeBackgroundMarked.Meta × ℤ => _root_.CurrentAFT.RationalMarkedCertificateProgram.current x.1.1.length x.1.2.length order x.2) := by
intro arity
unfold _root_.Integration9_9.TM2NativeRootGroupAlgebra.evaluate _root_.CurrentAFT.RationalMarkedCertificateProgram.current
by_cases h : arity.val.1.val=1 ∧ arity.val.2.val=1
· simp only [dif_pos h]
change Poly (fun x : _root_.Integration9_9.TM2NativeRootGroupAlgebra.Query (_root_.Integration9_9.TM2NativeBackgroundMarked.Meta × ℤ) => _root_.Integration9_9.TM2NativeBackgroundMarked.inverseDensity (x.1,(x.2.1[0]?.getD 0,x.2.2[0]?.getD 0)))
fun_prop
· simp only [dif_neg h];fun_prop
theorem currentIsPoly (order : ℕ) : _root_.Integration9_9.TM2NativeRootGroupAlgebra.IsPoly order (fun x : _root_.Integration9_9.TM2NativeBackgroundMarked.Meta × ℤ => _root_.CurrentAFT.RationalMarkedPairProgram.current x.1.1.length x.1.2.length order x.2) := by
change _root_.Integration9_9.TM2NativeRootGroupAlgebra.IsPoly order (fun x : _root_.Integration9_9.TM2NativeBackgroundMarked.Meta × ℤ => _root_.CurrentAFT.RationalMarkedCertificateProgram.current x.1.1.length x.1.2.length order x.2 +
_root_.CurrentAFT.RationalFamilyProductProgram.product order (_root_.CurrentAFT.RationalPrimaryDeviationProgram.current x.1.1.length x.1.2.length order)
(_root_.CurrentAFT.RationalBackgroundProgram.free x.1.1.length x.1.2.length order))
exact (_root_.Integration9_9.TM2NativeBackgroundMarked.mixedIsPoly order).add (((_root_.Integration9_9.TM2NativeBackgroundMarked.primaryIsPoly order).comp (g := fun x : _root_.Integration9_9.TM2NativeBackgroundMarked.Meta × ℤ => x.1) (by fun_prop)).product
((_root_.Integration9_9.TM2NativeBackgroundProfiles.freeIsPoly order).comp (g := fun x : _root_.Integration9_9.TM2NativeBackgroundMarked.Meta × ℤ => x.1) (by fun_prop)))
def pairProfile (x : (_root_.Integration9_9.TM2NativeBackgroundMarked.Meta × (ℤ × ℕ)) × ℕ) : ℚ := _root_.CurrentAFT.RationalConditionalPairProgram.pairProfile
x.1.1.1.length x.1.1.2.length x.1.2.2 x.1.2.1 x.2
@[fun_prop] theorem pairProfile_poly : Poly _root_.Integration9_9.TM2NativeBackgroundMarked.pairProfile := by
let f := fun y : (_root_.Integration9_9.TM2NativeBackgroundMarked.Meta × ((ℤ × ℕ) × ℕ)) × ℕ => _root_.Integration9_9.TM2NativeRootGroupMass.pair (y.1.1,((y.1.2.1.2,y.1.2.1.1),(y.1.2.2,y.2)))
let g := fun y : (_root_.Integration9_9.TM2NativeBackgroundMarked.Meta × ((ℤ × ℕ) × ℕ)) × ℕ => _root_.Integration9_9.TM2NativeRootGroupMass.pair (y.1.1,((y.1.2.1.2,y.1.2.1.1),(y.2,y.1.2.2)))
have hf : Poly f := by unfold f;fun_prop
have hg : Poly g := by unfold g;fun_prop
change Poly (fun x : (_root_.Integration9_9.TM2NativeBackgroundMarked.Meta × (ℤ × ℕ)) × ℕ => _root_.Integration9_9.TM2NativeRootGroupProfiles.paletteSum f (x.1.1,(x.1.2,x.2))+_root_.Integration9_9.TM2NativeRootGroupProfiles.paletteSum g (x.1.1,(x.1.2,x.2)))
fun_prop
def pairMean (x : (_root_.Integration9_9.TM2NativeBackgroundMarked.Meta × ℤ) × ℕ) : ℚ := _root_.CurrentAFT.RationalConditionalPairProgram.pairMean
x.1.1.1.length x.1.1.2.length x.1.2 x.2
@[fun_prop] theorem pairMean_poly : Poly _root_.Integration9_9.TM2NativeBackgroundMarked.pairMean := by
let f := fun y : (_root_.Integration9_9.TM2NativeBackgroundMarked.Meta × (ℤ × ℕ)) × ℕ => _root_.Integration9_9.TM2NativeRootGroupProfiles.primary (y.1.1,y.2)*_root_.Integration9_9.TM2NativeBackgroundMarked.pairProfile ((y.1.1,(y.1.2.1,y.2)),y.1.2.2)
have hf : Poly f := by unfold f;fun_prop
exact Automatic.Poly.comp (g := fun x : (_root_.Integration9_9.TM2NativeBackgroundMarked.Meta × ℤ) × ℕ => (x.1.1,(x.1.2,x.2))) (_root_.Integration9_9.TM2NativeRootGroupProfiles.palette_sum_poly hf) (by fun_prop)
def centeredMean (x : (_root_.Integration9_9.TM2NativeBackgroundMarked.Meta × ℤ) × ℕ) : ℚ := _root_.CurrentAFT.RationalConditionalPairProgram.centeredMean x.1.1.1.length x.1.1.2.length x.1.2 x.2
@[fun_prop] theorem centeredMean_poly : Poly _root_.Integration9_9.TM2NativeBackgroundMarked.centeredMean := by
change Poly (fun x : (_root_.Integration9_9.TM2NativeBackgroundMarked.Meta × ℤ) × ℕ => _root_.Integration9_9.TM2NativeBackgroundMarked.pairMean x-2/(_root_.Integration9_9.TM2NativeBackgroundProfiles.colors x.1.1.1 : ℚ))
fun_prop
theorem conditionalIsPoly (order : ℕ) : _root_.Integration9_9.TM2NativeRootGroupAlgebra.IsPoly order (fun x : _root_.Integration9_9.TM2NativeBackgroundMarked.Meta × ℤ =>
_root_.CurrentAFT.RationalConditionalPairProgram.current x.1.1.length x.1.2.length order x.2) :=
_root_.Integration9_9.TM2NativeRootGroupAlgebra.IsPoly.firstTable (_root_.Integration9_9.TM2NativeRootGroupProfiles.massLift_poly _root_.Integration9_9.TM2NativeBackgroundMarked.centeredMean_poly) (Automatic.Poly.const 0)
end Integration9_9.TM2NativeBackgroundMarked
end
section
set_option autoImplicit false
set_option maxHeartbeats 3000000
set_option maxRecDepth 10000
set_option synthInstance.maxSize 1024
set_option backward.isDefEq.respectTransparency false
namespace Integration9_9.TM2NativeBackgroundTensor
open AFT AFT.RationalNumerics CurrentAFT GradedControlAlgebra
open OAI.MetricKMedian.Binary OAI.MetricKMedian.Binary.Automatic
open TM2NativeRootGroupAlgebra TM2NativeRootGroupProfiles TM2NativeRootGroupCoefficient TM2NativeBackgroundDiffuse
open scoped BigOperators
abbrev Meta := _root_.Integration9_9.TM2NativeFirstInverse.Meta
def entry (x : _root_.Integration9_9.TM2NativeBackgroundTensor.Meta × (ℕ × ℕ)) : ℚ := _root_.CurrentAFT.RationalMassLiftTensorProgram.entry x.1.1.length x.1.2.length x.2.1 x.2.2
@[fun_prop] theorem entry_poly : Poly _root_.Integration9_9.TM2NativeBackgroundTensor.entry := by
have hf : Poly (fun x : (_root_.Integration9_9.TM2NativeBackgroundTensor.Meta × ℕ) × ℕ => if x.2=x.1.2 then (1 : ℚ) else 0) := by fun_prop
exact Automatic.Poly.comp (g := fun x : _root_.Integration9_9.TM2NativeBackgroundTensor.Meta × (ℕ × ℕ) => ((x.1,x.2.1),x.2.2)) (_root_.Integration9_9.TM2NativeRootGroupProfiles.massLift_poly hf) (by fun_prop)
def current {α : Type} (degree : ℕ) (f : (_root_.Integration9_9.TM2NativeBackgroundTensor.Meta × α) × List ℕ → ℚ) (x : (_root_.Integration9_9.TM2NativeBackgroundTensor.Meta × α) × List ℕ) : ℚ :=
_root_.CurrentAFT.RationalMassLiftTensorProgram.current x.1.1.1.length x.1.1.2.length degree
(fun source => f (x.1,List.ofFn source)) (fun i => x.2[i.val]?.getD 0)
@[fun_prop] theorem current_poly {α : Type} [Coding α] (degree : ℕ)
{f : (_root_.Integration9_9.TM2NativeBackgroundTensor.Meta × α) × List ℕ → ℚ} (hf : Poly f) : Poly (_root_.Integration9_9.TM2NativeBackgroundTensor.current degree f) := by
let term := fun y : (_root_.Integration9_9.TM2NativeBackgroundTensor.Meta × (α × List ℕ)) × List ℕ => f ((y.1.1,y.1.2.1),y.2)*
∏i : Fin degree, _root_.Integration9_9.TM2NativeBackgroundTensor.entry (y.1.1,(y.2[i.val]?.getD 0,y.1.2.2[i.val]?.getD 0))
have hp : Poly (fun y : (_root_.Integration9_9.TM2NativeBackgroundTensor.Meta × (α × List ℕ)) × List ℕ =>
∏i : Fin degree, _root_.Integration9_9.TM2NativeBackgroundTensor.entry (y.1.1,(y.2[i.val]?.getD 0,y.1.2.2[i.val]?.getD 0))) := by
apply _root_.Integration9_9.TM2NativeRootGroupCoefficient.finite_prod_poly
intro i _
fun_prop
have ht : Poly term := by unfold term;fun_prop
have hs : Poly (fun x : (_root_.Integration9_9.TM2NativeBackgroundTensor.Meta × α) × List ℕ => _root_.Integration9_9.TM2NativeRootGroupCoefficient.tupleSum degree term (x.1.1,(x.1.2,x.2))) := by fun_prop
refine ⟨hs.program.congr _ (fun x => ?_)⟩
simp only [_root_.Integration9_9.TM2NativeRootGroupCoefficient.tupleSum,term,_root_.Integration9_9.TM2NativeBackgroundTensor.current,_root_.CurrentAFT.RationalMassLiftTensorProgram.current]
apply Finset.sum_congr rfl
intro source _
simp only [List.getElem?_ofFn,Fin.isLt,dif_pos,Option.getD_some,_root_.Integration9_9.TM2NativeBackgroundTensor.entry]
def primaryValue (x : (_root_.Integration9_9.TM2NativeBackgroundTensor.Meta × ℤ) × List ℕ) : ℚ := _root_.Integration9_9.TM2NativeBackgroundTensor.current 2
(fun y : (_root_.Integration9_9.TM2NativeBackgroundTensor.Meta × ℤ) × List ℕ => _root_.Integration9_9.TM2NativeBackgroundDiffuse.residual (y.1,(y.2[0]?.getD 0,y.2[1]?.getD 0))) x
@[fun_prop] theorem primaryValue_poly : Poly _root_.Integration9_9.TM2NativeBackgroundTensor.primaryValue := by
unfold _root_.Integration9_9.TM2NativeBackgroundTensor.primaryValue
apply _root_.Integration9_9.TM2NativeBackgroundTensor.current_poly
fun_prop
theorem primaryValue_eq (x : (_root_.Integration9_9.TM2NativeBackgroundTensor.Meta × ℤ) × List ℕ) : _root_.Integration9_9.TM2NativeBackgroundTensor.primaryValue x =
_root_.CurrentAFT.RationalMassLiftTensorProgram.current x.1.1.1.length x.1.1.2.length 2
(fun word => _root_.CurrentAFT.RationalDiffuseResidualProgram.residual x.1.1.1.length x.1.1.2.length x.1.2 (word 0) (word 1))
(fun i => x.2[i.val]?.getD 0) := by
simp only [_root_.Integration9_9.TM2NativeBackgroundTensor.primaryValue,_root_.Integration9_9.TM2NativeBackgroundTensor.current,List.getElem?_ofFn,show (0 : ℕ)<2 by omega,show (1 : ℕ)<2 by omega,
dif_pos,Option.getD_some,_root_.Integration9_9.TM2NativeBackgroundDiffuse.residual]
rfl
attribute [local irreducible] RationalDiffuseResidualProgram.bodyDensity RationalMassLiftTensorProgram.current
theorem bodyIsPoly (order : ℕ) : _root_.Integration9_9.TM2NativeRootGroupAlgebra.IsPoly order (fun x : _root_.Integration9_9.TM2NativeBackgroundTensor.Meta × ℤ => _root_.CurrentAFT.RationalDiffuseFamilyProgram.body x.1.1.length x.1.2.length order x.2) := by
intro arity
unfold _root_.Integration9_9.TM2NativeRootGroupAlgebra.evaluate _root_.CurrentAFT.RationalDiffuseFamilyProgram.body _root_.CurrentAFT.RationalDiffuseFamilyProgram.bodyTable
by_cases h : arity.val.1.val=0 ∧ arity.val.2.val=2
· simp only [dif_pos h]
change Poly (fun x : _root_.Integration9_9.TM2NativeRootGroupAlgebra.Query (_root_.Integration9_9.TM2NativeBackgroundTensor.Meta × ℤ) => _root_.Integration9_9.TM2NativeBackgroundDiffuse.bodyDensity (x.1,(x.2.2[0]?.getD 0,x.2.2[1]?.getD 0)))
fun_prop
· simp only [dif_neg h];fun_prop
theorem primaryIsPoly (order : ℕ) : _root_.Integration9_9.TM2NativeRootGroupAlgebra.IsPoly order (fun x : _root_.Integration9_9.TM2NativeBackgroundTensor.Meta × ℤ => _root_.CurrentAFT.RationalDiffuseFamilyProgram.primary x.1.1.length x.1.2.length order x.2) := by
intro arity
unfold _root_.Integration9_9.TM2NativeRootGroupAlgebra.evaluate _root_.CurrentAFT.RationalDiffuseFamilyProgram.primary _root_.CurrentAFT.RationalDiffuseFamilyProgram.primaryTable
by_cases h : 2=arity.val.1.val ∧ 0=arity.val.2.val
· simp only [dif_pos h]
have hp : Poly (fun x : _root_.Integration9_9.TM2NativeRootGroupAlgebra.Query (_root_.Integration9_9.TM2NativeBackgroundTensor.Meta × ℤ) => _root_.Integration9_9.TM2NativeBackgroundTensor.primaryValue (x.1,x.2.1)) := by fun_prop
refine ⟨hp.program.congr _ (fun x => ?_)⟩
rw [_root_.Integration9_9.TM2NativeBackgroundTensor.primaryValue_eq]
rfl
· simp only [dif_neg h];fun_prop
theorem diffuseIsPoly (order : ℕ) : _root_.Integration9_9.TM2NativeRootGroupAlgebra.IsPoly order (fun x : _root_.Integration9_9.TM2NativeBackgroundTensor.Meta × ℤ => _root_.CurrentAFT.RationalDiffuseFamilyProgram.current x.1.1.length x.1.2.length order x.2) :=
(_root_.Integration9_9.TM2NativeBackgroundTensor.bodyIsPoly order).add (_root_.Integration9_9.TM2NativeBackgroundTensor.primaryIsPoly order)
end Integration9_9.TM2NativeBackgroundTensor
end
section
namespace CurrentAFT
end CurrentAFT
namespace CurrentAFT.RationalLegBackgroundProgram
end CurrentAFT.RationalLegBackgroundProgram
namespace CurrentAFT.RationalLegBackgroundProgram.base_one
end CurrentAFT.RationalLegBackgroundProgram.base_one
namespace CurrentAFT.RationalLegBackgroundProgram.current
end CurrentAFT.RationalLegBackgroundProgram.current
set_option autoImplicit false
set_option maxHeartbeats 3000000
set_option maxRecDepth 10000
set_option synthInstance.maxSize 1024
set_option backward.isDefEq.respectTransparency false
namespace Integration9_9.TM2NativeBackgroundLeg
open AFT AFT.RationalNumerics CurrentAFT GradedControlAlgebra
open OAI.MetricKMedian.Binary OAI.MetricKMedian.Binary.Automatic
open TM2NativeRootGroupAlgebra TM2NativeBackgroundProfiles TM2NativeBackgroundAlgebra
open scoped BigOperators
abbrev Meta := _root_.Integration9_9.TM2NativeFirstInverse.Meta
def activation (x : _root_.Integration9_9.TM2NativeBackgroundLeg.Meta) : ℚ := _root_.CurrentAFT.LocalPairProgram.activationApprox x.1.length x.2.length
@[fun_prop] theorem activation_poly : Poly _root_.Integration9_9.TM2NativeBackgroundLeg.activation := by
refine ⟨_root_.Integration9_9.TM2NativeActivation.currentProgram.congr _ (fun x => ?_)⟩
rw [_root_.Integration9_9.TM2NativeActivation.current_value,_root_.CurrentAFT.BinaryActivationProgram.current_value]
rfl
attribute [local irreducible] RationalDiffuseFamilyProgram.current RationalMarkedPairProgram.current
attribute [local irreducible] LocalPairProgram.activationApprox
theorem pairIsPoly (order : ℕ) : _root_.Integration9_9.TM2NativeRootGroupAlgebra.IsPoly order (fun x : _root_.Integration9_9.TM2NativeBackgroundLeg.Meta × ℤ => _root_.CurrentAFT.RationalPairQuadraticProgram.current x.1.1.length x.1.2.length order x.2) := by
intro arity
have hd := _root_.Integration9_9.TM2NativeBackgroundTensor.diffuseIsPoly order arity
have hm := _root_.Integration9_9.TM2NativeBackgroundMarked.currentIsPoly order arity
change Poly (fun x : _root_.Integration9_9.TM2NativeRootGroupAlgebra.Query (_root_.Integration9_9.TM2NativeBackgroundLeg.Meta × ℤ) =>
(1-_root_.Integration9_9.TM2NativeBackgroundLeg.activation x.1.1)*_root_.Integration9_9.TM2NativeRootGroupAlgebra.evaluate (fun y : _root_.Integration9_9.TM2NativeBackgroundLeg.Meta × ℤ => _root_.CurrentAFT.RationalDiffuseFamilyProgram.current y.1.1.length y.1.2.length order y.2) arity x+
_root_.Integration9_9.TM2NativeBackgroundLeg.activation x.1.1*_root_.Integration9_9.TM2NativeRootGroupAlgebra.evaluate (fun y : _root_.Integration9_9.TM2NativeBackgroundLeg.Meta × ℤ => _root_.CurrentAFT.RationalMarkedPairProgram.current y.1.1.length y.1.2.length order y.2) arity x)
fun_prop
theorem conditionalQuadraticIsPoly (order : ℕ) : _root_.Integration9_9.TM2NativeRootGroupAlgebra.IsPoly order (fun x : _root_.Integration9_9.TM2NativeBackgroundLeg.Meta × ℤ => _root_.CurrentAFT.RationalLegBackgroundProgram.conditionalQuadratic x.1.1.length x.1.2.length order x.2) :=
(_root_.Integration9_9.TM2NativeBackgroundLeg.pairIsPoly order).add ((_root_.Integration9_9.TM2NativeBackgroundMarked.conditionalIsPoly order).product (_root_.Integration9_9.TM2NativeBackgroundProfiles.translationIsPoly order))
theorem conditionalCubicIsPoly (order : ℕ) : _root_.Integration9_9.TM2NativeRootGroupAlgebra.IsPoly order (fun x : _root_.Integration9_9.TM2NativeBackgroundLeg.Meta × ℤ => _root_.CurrentAFT.RationalLegBackgroundProgram.conditionalCubic x.1.1.length x.1.2.length order x.2) :=
(_root_.Integration9_9.TM2NativeBackgroundLeg.pairIsPoly order).product (_root_.Integration9_9.TM2NativeBackgroundProfiles.translationIsPoly order)
theorem quadraticIsPoly (order : ℕ) : _root_.Integration9_9.TM2NativeRootGroupAlgebra.IsPoly order (fun x : _root_.Integration9_9.TM2NativeBackgroundLeg.Meta => _root_.CurrentAFT.RationalLegBackgroundProgram.quadratic x.1.length x.2.length order) :=
_root_.Integration9_9.TM2NativeBackgroundAlgebra.scalarAverageIsPoly (_root_.Integration9_9.TM2NativeBackgroundLeg.conditionalQuadraticIsPoly order)
theorem cubicIsPoly (order : ℕ) : _root_.Integration9_9.TM2NativeRootGroupAlgebra.IsPoly order (fun x : _root_.Integration9_9.TM2NativeBackgroundLeg.Meta => _root_.CurrentAFT.RationalLegBackgroundProgram.cubic x.1.length x.2.length order) :=
_root_.Integration9_9.TM2NativeBackgroundAlgebra.scalarAverageIsPoly (_root_.Integration9_9.TM2NativeBackgroundLeg.conditionalCubicIsPoly order)
theorem meanTranslationIsPoly (order : ℕ) : _root_.Integration9_9.TM2NativeRootGroupAlgebra.IsPoly order (fun x : _root_.Integration9_9.TM2NativeBackgroundLeg.Meta => _root_.CurrentAFT.RationalBackgroundLinearProgram.meanTranslation x.1.length x.2.length order) :=
_root_.Integration9_9.TM2NativeBackgroundAlgebra.scalarAverageIsPoly (_root_.Integration9_9.TM2NativeBackgroundProfiles.translationIsPoly order)
@[fun_prop] theorem rat_fixed_power_poly (n : ℕ) : Poly (fun x : ℚ => x^n) := by
induction n with
| zero => simp only [pow_zero];fun_prop
| succ n ih => simp only [pow_succ];fun_prop
def freeMass (x : List Unit) : ℚ := _root_.CurrentAFT.RationalBackgroundLinearProgram.freeMass x.length
@[fun_prop] theorem freeMass_poly : Poly _root_.Integration9_9.TM2NativeBackgroundLeg.freeMass := by
change Poly (fun x : List Unit => (_root_.Integration9_9.TM2NativeBackgroundProfiles.colors x : ℚ)*(x.length+2)^96-(x.length+2)^128-_root_.Integration9_9.TM2NativeBackgroundProfiles.colors x)
fun_prop
def legMass (x : List Unit) : ℚ := (x.length+2 : ℚ)^128
@[fun_prop] theorem legMass_poly : Poly _root_.Integration9_9.TM2NativeBackgroundLeg.legMass := by unfold _root_.Integration9_9.TM2NativeBackgroundLeg.legMass;fun_prop
attribute [local irreducible] RationalBackgroundProgram.free RationalBackgroundLinearProgram.meanTranslation
theorem linearIsPoly (order : ℕ) : _root_.Integration9_9.TM2NativeRootGroupAlgebra.IsPoly order (fun x : _root_.Integration9_9.TM2NativeBackgroundLeg.Meta => _root_.CurrentAFT.RationalBackgroundLinearProgram.legLinear x.1.length x.2.length order) := by
intro arity
have hf := _root_.Integration9_9.TM2NativeBackgroundProfiles.freeIsPoly order arity
have hm := _root_.Integration9_9.TM2NativeBackgroundLeg.meanTranslationIsPoly order arity
change Poly (fun x : _root_.Integration9_9.TM2NativeRootGroupAlgebra.Query _root_.Integration9_9.TM2NativeBackgroundLeg.Meta =>
-(_root_.Integration9_9.TM2NativeBackgroundLeg.freeMass x.1.1*_root_.Integration9_9.TM2NativeRootGroupAlgebra.evaluate (fun y : _root_.Integration9_9.TM2NativeBackgroundLeg.Meta => _root_.CurrentAFT.RationalBackgroundProgram.free y.1.length y.2.length order) arity x+
(_root_.Integration9_9.TM2NativeBackgroundProfiles.colors x.1.1 : ℚ)*_root_.Integration9_9.TM2NativeRootGroupAlgebra.evaluate (fun y : _root_.Integration9_9.TM2NativeBackgroundLeg.Meta => _root_.CurrentAFT.RationalBackgroundLinearProgram.meanTranslation y.1.length y.2.length order) arity x)/_root_.Integration9_9.TM2NativeBackgroundLeg.legMass x.1.1)
fun_prop
theorem currentIsPoly (order : ℕ) : _root_.Integration9_9.TM2NativeRootGroupAlgebra.IsPoly order (fun x : _root_.Integration9_9.TM2NativeBackgroundLeg.Meta => _root_.CurrentAFT.RationalLegBackgroundProgram.current x.1.length x.2.length order) :=
((_root_.Integration9_9.TM2NativeBackgroundLeg.linearIsPoly order).add (_root_.Integration9_9.TM2NativeBackgroundLeg.quadraticIsPoly order)).add (_root_.Integration9_9.TM2NativeBackgroundLeg.cubicIsPoly order)
end Integration9_9.TM2NativeBackgroundLeg
end
section
namespace CurrentAFT
end CurrentAFT
namespace CurrentAFT.BinaryBackgroundPopulation
end CurrentAFT.BinaryBackgroundPopulation
namespace CurrentAFT.BinaryBackgroundPopulation.Role
end CurrentAFT.BinaryBackgroundPopulation.Role
namespace CurrentAFT.BinaryBackgroundPopulation.Role.free
end CurrentAFT.BinaryBackgroundPopulation.Role.free
namespace CurrentAFT.BinaryBackgroundPopulation.Role.leg
end CurrentAFT.BinaryBackgroundPopulation.Role.leg
namespace CurrentAFT.BinaryBackgroundPopulation.Role.queue
end CurrentAFT.BinaryBackgroundPopulation.Role.queue
namespace CurrentAFT.BinaryBackgroundPopulation.factorWorkPolynomial
end CurrentAFT.BinaryBackgroundPopulation.factorWorkPolynomial
namespace CurrentAFT.BinaryBackgroundPopulation.population
end CurrentAFT.BinaryBackgroundPopulation.population
set_option autoImplicit false
set_option maxHeartbeats 3000000
set_option maxRecDepth 10000
set_option synthInstance.maxSize 1024
set_option backward.isDefEq.respectTransparency false
namespace Integration9_9.TM2NativeBackgroundPopulation
open AFT AFT.RationalNumerics AFT.BinaryArithmetic CurrentAFT GradedControlAlgebra
open OAI.MetricKMedian.Binary OAI.MetricKMedian.Binary.Automatic
open TM2NativeRootGroupAlgebra TM2NativeBackgroundProfiles TM2NativeBackgroundAlgebra TM2NativeBackgroundLeg
open scoped BigOperators
abbrev Meta := _root_.Integration9_9.TM2NativeFirstInverse.Meta
def freeCount (x : List Unit) : ℕ := _root_.CurrentAFT.RationalBackgroundPopulationProgram.freeCount x.length
@[fun_prop] theorem freeCount_poly : Poly _root_.Integration9_9.TM2NativeBackgroundPopulation.freeCount := by
change Poly (fun x : List Unit => _root_.Integration9_9.TM2NativeBackgroundProfiles.colors x*(x.length+2)^96-(x.length+2)^128-_root_.Integration9_9.TM2NativeBackgroundProfiles.colors x)
fun_prop
attribute [local irreducible] RationalBackgroundProgram.free RationalBackgroundProgram.translation RationalLegBackgroundProgram.current
theorem freeIsPoly (order : ℕ) : _root_.Integration9_9.TM2NativeRootGroupAlgebra.IsPoly order (fun x : _root_.Integration9_9.TM2NativeBackgroundPopulation.Meta => _root_.CurrentAFT.RationalBackgroundPopulationProgram.freeFactor x.1.length x.2.length order) :=
_root_.Integration9_9.TM2NativeBackgroundAlgebra.binomialIsPoly (_root_.Integration9_9.TM2NativeBackgroundProfiles.freeIsPoly order) (n := fun x : _root_.Integration9_9.TM2NativeBackgroundPopulation.Meta => _root_.Integration9_9.TM2NativeBackgroundPopulation.freeCount x.1) (by fun_prop)
theorem queueIsPoly (order : ℕ) : _root_.Integration9_9.TM2NativeRootGroupAlgebra.IsPoly order (fun x : _root_.Integration9_9.TM2NativeBackgroundPopulation.Meta × ℤ => _root_.CurrentAFT.RationalBackgroundPopulationProgram.queueFactor x.1.1.length x.1.2.length order x.2) :=
_root_.Integration9_9.TM2NativeBackgroundAlgebra.binomialIsPoly (_root_.Integration9_9.TM2NativeBackgroundProfiles.translationIsPoly order) (n := fun x : _root_.Integration9_9.TM2NativeBackgroundPopulation.Meta × ℤ => _root_.Integration9_9.TM2NativeBackgroundProfiles.colors x.1.1) (by fun_prop)
theorem legIsPoly (order : ℕ) : _root_.Integration9_9.TM2NativeRootGroupAlgebra.IsPoly order (fun x : _root_.Integration9_9.TM2NativeBackgroundPopulation.Meta => _root_.CurrentAFT.RationalBackgroundPopulationProgram.legFactor x.1.length x.2.length order) :=
_root_.Integration9_9.TM2NativeBackgroundAlgebra.binomialIsPoly (_root_.Integration9_9.TM2NativeBackgroundLeg.currentIsPoly order) (n := fun x : _root_.Integration9_9.TM2NativeBackgroundPopulation.Meta => (x.1.length+2)^128) (by fun_prop)
theorem currentIsPoly (order : ℕ) : _root_.Integration9_9.TM2NativeRootGroupAlgebra.IsPoly order (fun x : _root_.Integration9_9.TM2NativeBackgroundPopulation.Meta × ℤ => _root_.CurrentAFT.RationalBackgroundPopulationProgram.current x.1.1.length x.1.2.length order x.2) :=
(((_root_.Integration9_9.TM2NativeBackgroundPopulation.freeIsPoly order).comp (g := fun x : _root_.Integration9_9.TM2NativeBackgroundPopulation.Meta × ℤ => x.1) (by fun_prop)).product (_root_.Integration9_9.TM2NativeBackgroundPopulation.queueIsPoly order)).product
((_root_.Integration9_9.TM2NativeBackgroundPopulation.legIsPoly order).comp (g := fun x : _root_.Integration9_9.TM2NativeBackgroundPopulation.Meta × ℤ => x.1) (by fun_prop))
structure Context (order : ℕ) (arity : _root_.CurrentAFT.GradedControlAlgebra.TruncatedArity order) where
security : List Unit
precision : List Unit
queue : _root_.AFT.BinaryArithmetic.IntegerBits
inputs : Vector ℕ arity.val.1.val
centers : Vector ℕ arity.val.2.val
input_bound : ∀ i,inputs.get i<_root_.CurrentAFT.BinaryFirstInverseProgram.colors security.length
center_bound : ∀ i,centers.get i<_root_.CurrentAFT.BinaryFirstInverseProgram.colors security.length
end Integration9_9.TM2NativeBackgroundPopulation
end
section
namespace CurrentAFT
end CurrentAFT
namespace CurrentAFT.RationalWeightProgram
end CurrentAFT.RationalWeightProgram
namespace CurrentAFT.RationalWeightProgram.groupValues
end CurrentAFT.RationalWeightProgram.groupValues
namespace CurrentAFT.RationalWeightProgram.pairedTensor
end CurrentAFT.RationalWeightProgram.pairedTensor
namespace CurrentAFT.RationalWeightProgram.pairedTensor.match_1
end CurrentAFT.RationalWeightProgram.pairedTensor.match_1
set_option autoImplicit false
set_option maxHeartbeats 2500000
set_option maxRecDepth 10000
set_option synthInstance.maxSize 1024
set_option backward.isDefEq.respectTransparency false
namespace Integration9_9.TM2NativePairedTensor
open AFT AFT.RationalNumerics CurrentAFT
open OAI.MetricKMedian.Binary OAI.MetricKMedian.Binary.Automatic
open TM2NativeRootGroupProfiles TM2NativeRootGroupAlgebra TM2NativeBackgroundLeg
open scoped BigOperators
abbrev Meta := _root_.Integration9_9.TM2NativeFirstInverse.Meta
def paired {α : Type} (f : (_root_.Integration9_9.TM2NativePairedTensor.Meta × α) × ℕ → ℚ) (x : (_root_.Integration9_9.TM2NativePairedTensor.Meta × α) × (ℕ × ℕ)) : ℚ :=
_root_.CurrentAFT.RationalPairedLiftProgram.current x.1.1.1.length x.1.1.2.length (fun i => f (x.1,i)) x.2.1 x.2.2
def tensor {α : Type} (count : ℕ) (f : (_root_.Integration9_9.TM2NativePairedTensor.Meta × α) × List ℕ → ℚ) (x : (_root_.Integration9_9.TM2NativePairedTensor.Meta × α) × List (ℕ × ℕ)) : ℚ :=
_root_.CurrentAFT.RationalWeightProgram.pairedTensor x.1.1.1.length x.1.1.2.length count (fun word => f (x.1,List.ofFn word))
(fun i => x.2[i.val]?.getD (0,0))
end Integration9_9.TM2NativePairedTensor
end
section
namespace CurrentAFT
end CurrentAFT
namespace CurrentAFT.BinaryDistinctTuples
end CurrentAFT.BinaryDistinctTuples
namespace CurrentAFT.BinaryDistinctTuples.current
end CurrentAFT.BinaryDistinctTuples.current
namespace CurrentAFT.BinaryDistinctTuples.guarded
end CurrentAFT.BinaryDistinctTuples.guarded
namespace CurrentAFT.BinaryDistinctTuples.normalizer
end CurrentAFT.BinaryDistinctTuples.normalizer
namespace CurrentAFT.BinaryDistinctTuples.pairCheck
end CurrentAFT.BinaryDistinctTuples.pairCheck
namespace CurrentAFT.BinaryDistinctTuples.sum
end CurrentAFT.BinaryDistinctTuples.sum
set_option autoImplicit false
set_option maxHeartbeats 1400000
set_option maxRecDepth 10000
set_option synthInstance.maxSize 1024
set_option backward.isDefEq.respectTransparency false
/-! Actual pairwise distinctness/increasing tests and fixed-order ordered
selection sums. Every pair of positions is generated from the real word;
selection words are materialized from real unary pool buffers. -/
namespace Integration9_9.TM2NativeDistinctTuples
open AFT AFT.RationalNumerics AFT.BinaryArithmetic
open OAI.MetricKMedian.Binary OAI.MetricKMedian.Binary.Automatic
open TM2NativeFiniteSeries
open scoped BigOperators
def indices (word : List ℕ) : List ℕ := List.range word.length
@[fun_prop] theorem indices_poly : Poly _root_.Integration9_9.TM2NativeDistinctTuples.indices := Poly.list_indices (α := ℕ)
def pairs (word : List ℕ) : List (ℕ×ℕ) := (_root_.Integration9_9.TM2NativeDistinctTuples.indices word).flatMap (fun i => (_root_.Integration9_9.TM2NativeDistinctTuples.indices word).map (fun j => (i,j)))
@[fun_prop] theorem pairs_poly : Poly _root_.Integration9_9.TM2NativeDistinctTuples.pairs := by unfold _root_.Integration9_9.TM2NativeDistinctTuples.pairs;fun_prop
def pairCheck (strict : Bool) (x : List ℕ×(ℕ×ℕ)) : Bool :=
if x.2.1<x.2.2 then
if strict then decide (x.1[x.2.1]?.getD 0<x.1[x.2.2]?.getD 0)
else !(decide (x.1[x.2.1]?.getD 0=x.1[x.2.2]?.getD 0))
else true
@[fun_prop] theorem pairCheck_poly (strict : Bool) : Poly (_root_.Integration9_9.TM2NativeDistinctTuples.pairCheck strict) := by unfold _root_.Integration9_9.TM2NativeDistinctTuples.pairCheck;fun_prop
def ordered (strict : Bool) (word : List ℕ) : Bool :=
((_root_.Integration9_9.TM2NativeDistinctTuples.pairs word).filter (fun ij => !_root_.Integration9_9.TM2NativeDistinctTuples.pairCheck strict (word,ij))).isEmpty
@[fun_prop] theorem ordered_poly (strict : Bool) : Poly (_root_.Integration9_9.TM2NativeDistinctTuples.ordered strict) := by unfold _root_.Integration9_9.TM2NativeDistinctTuples.ordered;fun_prop
def relation (strict : Bool) (a b : ℕ) : Prop := if strict then a<b else a≠b
theorem mem_pairs (word : List ℕ) (i j : ℕ) : (i,j)∈_root_.Integration9_9.TM2NativeDistinctTuples.pairs word ↔ i<word.length ∧ j<word.length := by
simp [_root_.Integration9_9.TM2NativeDistinctTuples.pairs,_root_.Integration9_9.TM2NativeDistinctTuples.indices,List.mem_flatMap,List.mem_map]
theorem pairCheck_value (strict : Bool) (word : List ℕ) (i j : ℕ) :
_root_.Integration9_9.TM2NativeDistinctTuples.pairCheck strict (word,(i,j))=true ↔ (i<j → _root_.Integration9_9.TM2NativeDistinctTuples.relation strict (word[i]?.getD 0) (word[j]?.getD 0)) := by
cases strict <;> by_cases h : i<j <;> simp [_root_.Integration9_9.TM2NativeDistinctTuples.pairCheck,h,_root_.Integration9_9.TM2NativeDistinctTuples.relation]
theorem _root_.Integration9_9.TM2NativeDistinctTuples.getD_get (word : List ℕ) (i : Fin word.length) : word[i.val]?.getD 0=word.get i := by simp
theorem ordered_value (strict : Bool) (word : List ℕ) : _root_.Integration9_9.TM2NativeDistinctTuples.ordered strict word=true ↔ word.Pairwise (_root_.Integration9_9.TM2NativeDistinctTuples.relation strict) := by
have hc : _root_.Integration9_9.TM2NativeDistinctTuples.ordered strict word=true ↔ ∀ij∈_root_.Integration9_9.TM2NativeDistinctTuples.pairs word,_root_.Integration9_9.TM2NativeDistinctTuples.pairCheck strict (word,ij)=true := by
simp [_root_.Integration9_9.TM2NativeDistinctTuples.ordered,List.filter_eq_nil_iff]
rw [hc,List.pairwise_iff_get]
constructor
· intro h i j hij
have hp:=(_root_.Integration9_9.TM2NativeDistinctTuples.pairCheck_value strict word i.val j.val).mp
(h (i.val,j.val) ((_root_.Integration9_9.TM2NativeDistinctTuples.mem_pairs word i.val j.val).mpr ⟨i.isLt,j.isLt⟩)) hij
simpa only [_root_.Integration9_9.TM2NativeDistinctTuples.getD_get] using hp
· intro h ij hm
obtain ⟨hi,hj⟩:=(_root_.Integration9_9.TM2NativeDistinctTuples.mem_pairs word ij.1 ij.2).mp hm
apply (_root_.Integration9_9.TM2NativeDistinctTuples.pairCheck_value strict word ij.1 ij.2).mpr
intro hij
have hp:=h ⟨ij.1,hi⟩ ⟨ij.2,hj⟩ hij
rw [_root_.Integration9_9.TM2NativeDistinctTuples.getD_get word ⟨ij.1,hi⟩,_root_.Integration9_9.TM2NativeDistinctTuples.getD_get word ⟨ij.2,hj⟩]
exact hp
theorem distinct_value (word : List ℕ) : _root_.Integration9_9.TM2NativeDistinctTuples.ordered false word=true ↔ word.Nodup := by
change _root_.Integration9_9.TM2NativeDistinctTuples.ordered false word=true ↔ word.Pairwise (_root_.Integration9_9.TM2NativeDistinctTuples.relation false)
exact _root_.Integration9_9.TM2NativeDistinctTuples.ordered_value false word
theorem increasing_value (word : List ℕ) : _root_.Integration9_9.TM2NativeDistinctTuples.ordered true word=true ↔ word.Pairwise (·<·) := by
change _root_.Integration9_9.TM2NativeDistinctTuples.ordered true word=true ↔ word.Pairwise (_root_.Integration9_9.TM2NativeDistinctTuples.relation true)
exact _root_.Integration9_9.TM2NativeDistinctTuples.ordered_value true word
theorem distinct_ofFn (pool count : ℕ) (word : Fin count→Fin pool) :
_root_.Integration9_9.TM2NativeDistinctTuples.ordered false (List.ofFn (fun i => (word i).val))=true ↔ Function.Injective word := by
rw [_root_.Integration9_9.TM2NativeDistinctTuples.distinct_value,List.nodup_ofFn]
constructor
· intro h i j hij
exact h (congrArg Fin.val hij)
· intro h i j hij
exact h (Fin.ext hij)
def guarded {α : Type} (f : α×List ℕ→ℚ) (x : α×List ℕ) : ℚ := if _root_.Integration9_9.TM2NativeDistinctTuples.ordered false x.2 then f x else 0
noncomputable def guardedProgram {α : Type} [Coding α] {f : α×List ℕ→ℚ}
(leaf : PolyProgram Automatic.enc Ratio.encode f) : PolyProgram Automatic.enc Ratio.encode (_root_.Integration9_9.TM2NativeDistinctTuples.guarded f) := by
have hp : Poly (fun x : α×List ℕ => _root_.Integration9_9.TM2NativeDistinctTuples.ordered false x.2) :=
Poly.comp (_root_.Integration9_9.TM2NativeDistinctTuples.ordered_poly false) Poly.snd
have hf : Poly f := ⟨leaf⟩
have h : Poly (_root_.Integration9_9.TM2NativeDistinctTuples.guarded f) := by unfold _root_.Integration9_9.TM2NativeDistinctTuples.guarded;fun_prop
exact h.program
def sum {α : Type} (count : ℕ) (f : α×List ℕ→ℚ) (x : α×List Unit) : ℚ :=
((_root_.Integration9_9.TM2NativeTupleEnumeration.tuples count (List.range x.2.length)).map (fun w => _root_.Integration9_9.TM2NativeDistinctTuples.guarded f (x.1,w))).sum
noncomputable def sumProgram {α : Type} [Coding α] (count : ℕ) {f : α×List ℕ→ℚ}
(leaf : PolyProgram Automatic.enc Ratio.encode f) :
PolyProgram (encodePair Automatic.enc _root_.Integration9_9.TM2NativeFiniteSeries.ticksCode) Ratio.encode (_root_.Integration9_9.TM2NativeDistinctTuples.sum count f) :=
_root_.Integration9_9.TM2NativeTupleEnumeration.sumProgram count (_root_.Integration9_9.TM2NativeDistinctTuples.guardedProgram leaf)
noncomputable section
open scoped Classical
theorem sum_value {α : Type} (count pool : ℕ) (f : α×List ℕ→ℚ) (data : α) (xs : List Unit) (hxs : xs.length=pool) :
_root_.Integration9_9.TM2NativeDistinctTuples.sum count f (data,xs)=∑ selection : Fin count↪Fin pool,f (data,List.ofFn (fun i => (selection i).val)) := by
rw [_root_.Integration9_9.TM2NativeDistinctTuples.sum,hxs,_root_.Integration9_9.TM2NativeTupleEnumeration.sum_tuples]
have hg : (∑word : Fin count→Fin pool,_root_.Integration9_9.TM2NativeDistinctTuples.guarded f (data,List.ofFn (fun i => (word i).val)))=
∑word : Fin count→Fin pool,if Function.Injective word then f (data,List.ofFn (fun i => (word i).val)) else 0 := by
apply Finset.sum_congr rfl
intro word _
unfold _root_.Integration9_9.TM2NativeDistinctTuples.guarded
simp only [_root_.Integration9_9.TM2NativeDistinctTuples.distinct_ofFn]
rw [hg]
letI : Fintype {word : Fin count→Fin pool // Function.Injective word} := Fintype.ofFinite _
have hs:=Finset.sum_subtype (p := fun word : Fin count→Fin pool => Function.Injective word) (F := inferInstance)
(Finset.univ.filter Function.Injective) (by simp) (fun word => f (data,List.ofFn (fun i => (word i).val)))
rw [Finset.sum_filter] at hs
rw [hs]
exact (Equiv.sum_comp (_root_.CurrentAFT.CyclePatternProgram.selectionEquiv pool count)
(fun word => f (data,List.ofFn (fun i => (word.val i).val)))).symm
end
end Integration9_9.TM2NativeDistinctTuples
end
section
set_option autoImplicit false
set_option maxHeartbeats 600000
set_option maxRecDepth 10000
set_option synthInstance.maxSize 1024
set_option backward.isDefEq.respectTransparency false
/-! The actual independent without-replacement average in two generated
pools. Normalizing masses are computed by the same distinct-word machines;
there is no running-time or height hypothesis on a callback. -/
namespace Integration9_9.TM2NativeTwoPoolAverage
open AFT AFT.RationalNumerics AFT.BinaryArithmetic
open OAI.MetricKMedian.Binary OAI.MetricKMedian.Binary.Automatic
open TM2NativeFiniteSeries
open scoped BigOperators
@[fun_prop] theorem distinctSum_poly {α : Type} [Coding α] (count : ℕ)
{f : α×List ℕ→ℚ} (hf : Poly f) : Poly (_root_.Integration9_9.TM2NativeDistinctTuples.sum count f) :=
⟨_root_.Integration9_9.TM2NativeDistinctTuples.sumProgram count hf.program⟩
def normalizer (count : ℕ) (xs : List Unit) : ℚ :=
_root_.Integration9_9.TM2NativeDistinctTuples.sum count (fun _ : Unit×List ℕ => (1 : ℚ)) ((),xs)
@[fun_prop] theorem normalizer_poly (count : ℕ) : Poly (_root_.Integration9_9.TM2NativeTwoPoolAverage.normalizer count) := by
have hs : Poly (_root_.Integration9_9.TM2NativeDistinctTuples.sum count (fun _ : Unit×List ℕ => (1 : ℚ))) :=
_root_.Integration9_9.TM2NativeTwoPoolAverage.distinctSum_poly count (Automatic.Poly.const 1)
unfold _root_.Integration9_9.TM2NativeTwoPoolAverage.normalizer
exact Poly.comp (f := _root_.Integration9_9.TM2NativeDistinctTuples.sum count (fun _ : Unit×List ℕ => (1 : ℚ)))
(g := fun xs : List Unit => ((),xs)) hs (by fun_prop)
def inner {α : Type} (count : ℕ) (f : α×(List ℕ×List ℕ)→ℚ)
(x : (α×List ℕ)×List Unit) : ℚ :=
_root_.Integration9_9.TM2NativeDistinctTuples.sum count (fun y : (α×List ℕ)×List ℕ => f (y.1.1,(y.1.2,y.2))) x
@[fun_prop] theorem inner_poly {α : Type} [Coding α] (count : ℕ)
{f : α×(List ℕ×List ℕ)→ℚ} (hf : Poly f) : Poly (_root_.Integration9_9.TM2NativeTwoPoolAverage.inner count f) := by
have hp : Poly (fun y : (α×List ℕ)×List ℕ => f (y.1.1,(y.1.2,y.2))) := Poly.comp hf (by fun_prop)
exact _root_.Integration9_9.TM2NativeTwoPoolAverage.distinctSum_poly count hp
def numerator {α : Type} (r s : ℕ) (f : α×(List ℕ×List ℕ)→ℚ)
(x : α×(List Unit×List Unit)) : ℚ :=
_root_.Integration9_9.TM2NativeDistinctTuples.sum r (fun y : (α×List Unit)×List ℕ =>
_root_.Integration9_9.TM2NativeTwoPoolAverage.inner s f ((y.1.1,y.2),y.1.2)) ((x.1,x.2.2),x.2.1)
@[fun_prop] theorem numerator_poly {α : Type} [Coding α] (r s : ℕ)
{f : α×(List ℕ×List ℕ)→ℚ} (hf : Poly f) : Poly (_root_.Integration9_9.TM2NativeTwoPoolAverage.numerator r s f) := by
have hp : Poly (fun y : (α×List Unit)×List ℕ => _root_.Integration9_9.TM2NativeTwoPoolAverage.inner s f ((y.1.1,y.2),y.1.2)) :=
Poly.comp (_root_.Integration9_9.TM2NativeTwoPoolAverage.inner_poly s hf) (by fun_prop)
have hs:=_root_.Integration9_9.TM2NativeTwoPoolAverage.distinctSum_poly r hp
unfold _root_.Integration9_9.TM2NativeTwoPoolAverage.numerator
exact Poly.comp (f := _root_.Integration9_9.TM2NativeDistinctTuples.sum r (fun y : (α×List Unit)×List ℕ =>
_root_.Integration9_9.TM2NativeTwoPoolAverage.inner s f ((y.1.1,y.2),y.1.2)))
(g := fun x : α×(List Unit×List Unit) => ((x.1,x.2.2),x.2.1)) hs (by fun_prop)
def current {α : Type} (r s : ℕ) (f : α×(List ℕ×List ℕ)→ℚ)
(x : α×(List Unit×List Unit)) : ℚ :=
_root_.Integration9_9.TM2NativeTwoPoolAverage.numerator r s f x/(_root_.Integration9_9.TM2NativeTwoPoolAverage.normalizer r x.2.1*_root_.Integration9_9.TM2NativeTwoPoolAverage.normalizer s x.2.2)
noncomputable def currentProgram {α : Type} [Coding α] (r s : ℕ)
{f : α×(List ℕ×List ℕ)→ℚ} (leaf : PolyProgram Automatic.enc Ratio.encode f) :
PolyProgram Automatic.enc Ratio.encode (_root_.Integration9_9.TM2NativeTwoPoolAverage.current r s f) := by
have hn:=_root_.Integration9_9.TM2NativeTwoPoolAverage.numerator_poly r s (show Poly f from ⟨leaf⟩)
have hp : Poly (_root_.Integration9_9.TM2NativeTwoPoolAverage.current r s f) := by unfold _root_.Integration9_9.TM2NativeTwoPoolAverage.current;fun_prop
exact hp.program
noncomputable section
open scoped Classical
theorem normalizer_value (count : ℕ) (xs : List Unit) :
_root_.Integration9_9.TM2NativeTwoPoolAverage.normalizer count xs=(xs.length.descFactorial count : ℚ) := by
rw [_root_.Integration9_9.TM2NativeTwoPoolAverage.normalizer,_root_.Integration9_9.TM2NativeDistinctTuples.sum_value count xs.length _ () xs rfl]
simp only [Finset.sum_const,Finset.card_univ,Fintype.card_embedding_eq,Fintype.card_fin,nsmul_eq_mul,mul_one]
theorem numerator_value {α : Type} (r s : ℕ) (f : α×(List ℕ×List ℕ)→ℚ)
(x : α×(List Unit×List Unit)) : _root_.Integration9_9.TM2NativeTwoPoolAverage.numerator r s f x=
∑ primary : Fin r↪Fin x.2.1.length,∑ body : Fin s↪Fin x.2.2.length,
f (x.1,(List.ofFn (fun i => (primary i).val),List.ofFn (fun i => (body i).val))) := by
unfold _root_.Integration9_9.TM2NativeTwoPoolAverage.numerator
rw [_root_.Integration9_9.TM2NativeDistinctTuples.sum_value r x.2.1.length _ (x.1,x.2.2) x.2.1 rfl]
apply Finset.sum_congr rfl
intro primary _
exact _root_.Integration9_9.TM2NativeDistinctTuples.sum_value s x.2.2.length _
(x.1,List.ofFn (fun i => (primary i).val)) x.2.2 rfl
theorem current_value {α : Type} (r s : ℕ) (f : α×(List ℕ×List ℕ)→ℚ)
(x : α×(List Unit×List Unit)) : _root_.Integration9_9.TM2NativeTwoPoolAverage.current r s f x=
(∑ primary : Fin r↪Fin x.2.1.length,∑ body : Fin s↪Fin x.2.2.length,
f (x.1,(List.ofFn (fun i => (primary i).val),List.ofFn (fun i => (body i).val)))) /
((x.2.1.length.descFactorial r : ℚ)*(x.2.2.length.descFactorial s : ℚ)) := by
rw [_root_.Integration9_9.TM2NativeTwoPoolAverage.current,_root_.Integration9_9.TM2NativeTwoPoolAverage.numerator_value,_root_.Integration9_9.TM2NativeTwoPoolAverage.normalizer_value,_root_.Integration9_9.TM2NativeTwoPoolAverage.normalizer_value]
end
end Integration9_9.TM2NativeTwoPoolAverage
end
section
set_option autoImplicit false
set_option maxHeartbeats 2500000
set_option maxRecDepth 10000
set_option synthInstance.maxSize 1024
set_option backward.isDefEq.respectTransparency false
namespace Integration9_9.TM2NativeWeightEvaluation
open AFT AFT.RationalNumerics CurrentAFT GradedControlAlgebra ControlCoordinates
open OAI.MetricKMedian.Binary OAI.MetricKMedian.Binary.Automatic
open TM2NativeRootGroupAlgebra
open scoped BigOperators
abbrev Meta := _root_.Integration9_9.TM2NativeFirstInverse.Meta
abbrev Data (α : Type) := (_root_.Integration9_9.TM2NativeWeightEvaluation.Meta × α) × (List (ℕ × ℕ) × List ℕ)
def kernel {α : Type} {order : ℕ} (F : _root_.Integration9_9.TM2NativeWeightEvaluation.Meta × α → _root_.CurrentAFT.RationalWeightProgram.RawTable order)
(arity : _root_.CurrentAFT.GradedControlAlgebra.TruncatedArity order) (x : (_root_.Integration9_9.TM2NativeWeightEvaluation.Meta × (α × List ℕ)) × List ℕ) : ℚ :=
F (x.1.1,x.1.2.1) arity (fun i => x.2[i.val]?.getD 0) (fun i => x.1.2.2[i.val]?.getD 0)
def selected {α : Type} {order : ℕ} (F : _root_.Integration9_9.TM2NativeWeightEvaluation.Meta × α → _root_.CurrentAFT.RationalWeightProgram.RawTable order)
(arity : _root_.CurrentAFT.GradedControlAlgebra.TruncatedArity order) (x : _root_.Integration9_9.TM2NativeWeightEvaluation.Data α × (List ℕ × List ℕ)) : ℚ :=
_root_.Integration9_9.TM2NativePairedTensor.tensor arity.val.1.val (_root_.Integration9_9.TM2NativeWeightEvaluation.kernel F arity)
((x.1.1.1,(x.1.1.2,x.2.2.map (fun i => x.1.2.2[i]?.getD 0))),
x.2.1.map (fun i => x.1.2.1[i]?.getD (0,0)))
def average {α : Type} {order : ℕ} (F : _root_.Integration9_9.TM2NativeWeightEvaluation.Meta × α → _root_.CurrentAFT.RationalWeightProgram.RawTable order)
(arity : _root_.CurrentAFT.GradedControlAlgebra.TruncatedArity order) (x : _root_.Integration9_9.TM2NativeWeightEvaluation.Data α) : ℚ :=
_root_.Integration9_9.TM2NativeTwoPoolAverage.current arity.val.1.val arity.val.2.val (_root_.Integration9_9.TM2NativeWeightEvaluation.selected F arity)
(x,(x.2.1.map (fun _ => ()),x.2.2.map (fun _ => ())))
def current {α : Type} (order : ℕ) (F : _root_.Integration9_9.TM2NativeWeightEvaluation.Meta × α → _root_.CurrentAFT.RationalWeightProgram.RawTable order) (x : _root_.Integration9_9.TM2NativeWeightEvaluation.Data α) : ℚ :=
F x.1 (_root_.CurrentAFT.GradedControlAlgebra.zeroArity order) Fin.elim0 Fin.elim0 +
∑a : _root_.CurrentAFT.ControlCoordinates.PositiveArity order, _root_.Integration9_9.TM2NativeWeightEvaluation.average F (_root_.CurrentAFT.GradedControlAlgebra.positiveArity order a) x
end Integration9_9.TM2NativeWeightEvaluation
end
section
namespace CurrentAFT
end CurrentAFT
namespace CurrentAFT.BinaryWeightBlock
end CurrentAFT.BinaryWeightBlock
namespace CurrentAFT.BinaryWeightBlock.current
end CurrentAFT.BinaryWeightBlock.current
namespace CurrentAFT.BinaryWeightProgram
end CurrentAFT.BinaryWeightProgram
namespace CurrentAFT.BinaryWeightProgram.current
end CurrentAFT.BinaryWeightProgram.current
namespace CurrentAFT.BinaryWeightProgram.evaluationWork
end CurrentAFT.BinaryWeightProgram.evaluationWork
namespace CurrentAFT.BinaryWeightProgram.term
end CurrentAFT.BinaryWeightProgram.term
set_option autoImplicit false
set_option maxHeartbeats 2500000
set_option maxRecDepth 10000
set_option synthInstance.maxSize 1024
set_option backward.isDefEq.respectTransparency false
namespace Integration9_9.TM2NativeWeightTable
open AFT AFT.RationalNumerics AFT.BinaryArithmetic CurrentAFT GradedControlAlgebra ControlCoordinates
open OAI.MetricKMedian.Binary OAI.MetricKMedian.Binary.Automatic
open TM2NativeRootGroupAlgebra TM2NativeBackgroundProfiles TM2NativeBackgroundLeg
open scoped BigOperators
abbrev Meta := _root_.Integration9_9.TM2NativeFirstInverse.Meta
abbrev Table := List (List ℚ)
def tupleCode (count : ℕ) (x : ℕ × List ℕ) : ℕ := _root_.CurrentAFT.WeightCoordinates.tupleCode x.1 count (fun i => x.2[i.val]?.getD 0)
def jointCode (r s : ℕ) (x : ℕ × (List ℕ × List ℕ)) : ℕ := x.1^s*_root_.Integration9_9.TM2NativeWeightTable.tupleCode r (x.1,x.2.1)+_root_.Integration9_9.TM2NativeWeightTable.tupleCode s (x.1,x.2.2)
def valid (count : ℕ) (x : ℕ × List ℕ) : Bool :=
(List.ofFn (fun i : Fin count => decide (x.2[i.val]?.getD 0<x.1))).all id
def table (order : ℕ) (x : _root_.Integration9_9.TM2NativeWeightTable.Meta × _root_.Integration9_9.TM2NativeWeightTable.Table) : _root_.CurrentAFT.RationalWeightProgram.RawTable order := fun arity primary body =>
if (∀i,primary i<_root_.Integration9_9.TM2NativeBackgroundProfiles.colors x.1.1) ∧ (∀i,body i<_root_.Integration9_9.TM2NativeBackgroundProfiles.colors x.1.1) then
(x.2[_root_.CurrentAFT.WeightCoordinates.arityCode order arity.val.1.val arity.val.2.val]?.getD [])[_root_.CurrentAFT.WeightCoordinates.jointCode (_root_.Integration9_9.TM2NativeBackgroundProfiles.colors x.1.1) arity.val.1.val arity.val.2.val primary body]?.getD 0
else 0
def current (order : ℕ) : _root_.Integration9_9.TM2NativeWeightEvaluation.Data _root_.Integration9_9.TM2NativeWeightTable.Table → ℚ := _root_.Integration9_9.TM2NativeWeightEvaluation.current order (_root_.Integration9_9.TM2NativeWeightTable.table order)
end Integration9_9.TM2NativeWeightTable
end
section
set_option autoImplicit false
set_option maxHeartbeats 2500000
set_option maxRecDepth 10000
set_option synthInstance.maxSize 1024
set_option backward.isDefEq.respectTransparency false
namespace Integration9_9.TM2NativeWeightProgram
open AFT AFT.BinaryArithmetic CurrentAFT
open OAI.MetricKMedian.Binary OAI.MetricKMedian.Binary.Automatic
attribute [local irreducible] RationalWeightProgram.current BinaryWeightProgram.current BinaryWeightLocal.rawTable
abbrev Meta := _root_.Integration9_9.TM2NativeFirstInverse.Meta
structure Context (order : ℕ) where
params : _root_.Integration9_9.TM2NativeWeightProgram.Meta
primaryPool : ℕ
bodyPool : ℕ
primary_pos : 0<primaryPool
body_pos : 0<bodyPool
table : _root_.CurrentAFT.BinaryWeightCoordinates.Table (_root_.CurrentAFT.BinaryWeightLocal.colors params.1.length) order
groups : Vector (Fin (_root_.CurrentAFT.BinaryWeightLocal.colors params.1.length) × Fin (_root_.CurrentAFT.BinaryWeightLocal.colors params.1.length)) primaryPool
centers : Vector (Fin (_root_.CurrentAFT.BinaryWeightLocal.colors params.1.length)) bodyPool
abbrev Raw := (_root_.Integration9_9.TM2NativeWeightProgram.Meta × List (List _root_.AFT.BinaryArithmetic.RationalBits)) × (List (ℕ × ℕ) × List ℕ)
def rawInput {order : ℕ} (x : _root_.Integration9_9.TM2NativeWeightProgram.Context order) : _root_.Integration9_9.TM2NativeWeightProgram.Raw :=
((x.params,List.ofFn (fun i => List.ofFn (fun j => (x.table.get i).get j))),
(List.ofFn (fun i => ((x.groups.get i).1.val,(x.groups.get i).2.val)),
List.ofFn (fun i => (x.centers.get i).val)))
def parse (x : _root_.Integration9_9.TM2NativeWeightProgram.Raw) : _root_.Integration9_9.TM2NativeWeightEvaluation.Data _root_.Integration9_9.TM2NativeWeightTable.Table :=
((x.1.1,x.1.2.map (fun row => row.map _root_.AFT.BinaryArithmetic.RationalBits.decode)),x.2)
end Integration9_9.TM2NativeWeightProgram
end
section
namespace CurrentAFT
end CurrentAFT
namespace CurrentAFT.BinaryCoreWeightData
end CurrentAFT.BinaryCoreWeightData
namespace CurrentAFT.BinaryCoreWeightData.centers
end CurrentAFT.BinaryCoreWeightData.centers
namespace CurrentAFT.BinaryCoreWeightData.color
end CurrentAFT.BinaryCoreWeightData.color
namespace CurrentAFT.BinaryCoreWeightData.current
end CurrentAFT.BinaryCoreWeightData.current
namespace CurrentAFT.BinaryCoreWeightData.groups
end CurrentAFT.BinaryCoreWeightData.groups
namespace CurrentAFT.BinaryCoreWeightData.ordinaryAddress
end CurrentAFT.BinaryCoreWeightData.ordinaryAddress
namespace CurrentAFT.BinaryCoreWeightData.ordinaryEntry
end CurrentAFT.BinaryCoreWeightData.ordinaryEntry
namespace CurrentAFT.BinaryCoreWeightData.primaryEntry
end CurrentAFT.BinaryCoreWeightData.primaryEntry
namespace CurrentAFT.BinaryWeightProgram
end CurrentAFT.BinaryWeightProgram
namespace CurrentAFT.BinaryWeightProgram.current
end CurrentAFT.BinaryWeightProgram.current
set_option autoImplicit false
set_option maxHeartbeats 2000000
set_option maxRecDepth 10000
set_option synthInstance.maxSize 1024
set_option backward.isDefEq.respectTransparency false
namespace Integration9_9.TM2NativeCoreWeight
open AFT AFT.BinaryArithmetic CurrentAFT
open OAI.MetricKMedian.Binary OAI.MetricKMedian.Binary.Automatic
open TM2NativeCoreProposal
attribute [local irreducible] CurrentProposalDimensions.current BinaryFullResponseCounts.current
CurrentAFT.Parameters.legCount CurrentAFT.Parameters.bodySize CurrentAFT.Parameters.dimension
RationalWeightProgram.current BinaryWeightProgram.current BinaryWeightLocal.rawTable
def groups (data : _root_.Integration9_9.TM2NativeCoreProposal.Core) : List _root_.Integration9_9.TM2NativeCoreProposal.Control := data.1.1.take data.1.2.length
def centers (data : _root_.Integration9_9.TM2NativeCoreProposal.Core) : List ℕ := (data.1.1.drop data.1.2.length).map Prod.snd
def current (order : ℕ) (x : (_root_.Integration9_9.TM2NativeCoreProposal.Meta × _root_.Integration9_9.TM2NativeWeightTable.Table) × _root_.Integration9_9.TM2NativeCoreProposal.Core) : ℚ :=
_root_.Integration9_9.TM2NativeWeightTable.current order (x.1,(_root_.Integration9_9.TM2NativeCoreWeight.groups x.2,_root_.Integration9_9.TM2NativeCoreWeight.centers x.2))
end Integration9_9.TM2NativeCoreWeight
end
section
namespace CurrentAFT
end CurrentAFT
namespace CurrentAFT.BinaryArrayRejection
end CurrentAFT.BinaryArrayRejection
namespace CurrentAFT.BinaryArrayRejection.run
end CurrentAFT.BinaryArrayRejection.run
namespace CurrentAFT.BinaryArrayRejection.run.match_1
end CurrentAFT.BinaryArrayRejection.run.match_1
set_option autoImplicit false
set_option maxHeartbeats 2000000
set_option maxRecDepth 10000
set_option synthInstance.maxSize 1024
set_option backward.isDefEq.respectTransparency false
namespace Integration9_9.TM2NativeRejection
open AFT AFT.RationalNumerics AFT.BinaryArithmetic
open OAI.MetricKMedian.Binary OAI.MetricKMedian.Binary.Automatic
open TM2NativeFiniteDraw
variable {α Tape State : Type}
def select (x : List (Bool × State) × State) : State :=
(x.1[x.1.findIdx Prod.fst]?.getD (false,x.2)).2
def candidate (sample : α × Tape → State) (score : α × State → ℚ) (envelope : α → ℚ)
(x : α × (Tape × List Bool)) : Bool × State :=
let point := sample (x.1,x.2.1)
(decide (_root_.Integration9_9.TM2NativeFiniteDraw.acceptance (_root_.Integration9_9.TM2NativePositiveDraw.positive (score (x.1,point))/envelope x.1,x.2.2)=0),point)
def current (sample : α × Tape → State) (score : α × State → ℚ) (envelope : α → ℚ)
(fallback : α → State) (x : α × List (Tape × List Bool)) : State :=
_root_.Integration9_9.TM2NativeRejection.select ((x.2.map (fun word => _root_.Integration9_9.TM2NativeRejection.candidate sample score envelope (x.1,word))),fallback x.1)
end Integration9_9.TM2NativeRejection
end
section
namespace CurrentAFT
end CurrentAFT
namespace CurrentAFT.BinaryPublicRejection
end CurrentAFT.BinaryPublicRejection
namespace CurrentAFT.BinaryPublicRejection.coreScore
end CurrentAFT.BinaryPublicRejection.coreScore
namespace CurrentAFT.BinaryPublicRejection.score
end CurrentAFT.BinaryPublicRejection.score
set_option autoImplicit false
set_option maxHeartbeats 2200000
set_option maxRecDepth 10000
set_option synthInstance.maxSize 1024
set_option backward.isDefEq.respectTransparency false
namespace Integration9_9.TM2NativePublicRejection
open AFT AFT.RationalNumerics AFT.BinaryArithmetic CurrentAFT
open OAI.MetricKMedian.Binary OAI.MetricKMedian.Binary.Automatic
open TM2NativeCoreProposal
attribute [local irreducible] CurrentProposalDimensions.current CurrentPreparedCoreProposal.draw
BinaryCoreWeightData.current BinaryCoreCharge.current TM2NativeCoreProposal.current
TM2NativeCoreWeight.current TM2NativeCoreCharge.current
abbrev Context := (_root_.Integration9_9.TM2NativeCoreProposal.Meta × List Unit) × (List Unit × _root_.Integration9_9.TM2NativeWeightTable.Table)
abbrev State := Bool × _root_.Integration9_9.TM2NativeCoreProposal.Core
def sample (x : _root_.Integration9_9.TM2NativePublicRejection.Context × _root_.Integration9_9.TM2NativeCoreProposal.Tapes) : _root_.Integration9_9.TM2NativePublicRejection.State := (true,_root_.Integration9_9.TM2NativeCoreProposal.current (x.1.1,x.2))
def score (order : ℕ) (x : _root_.Integration9_9.TM2NativePublicRejection.Context × _root_.Integration9_9.TM2NativePublicRejection.State) : ℚ :=
if x.2.1 && _root_.Integration9_9.TM2NativeCoreCharge.current (x.1.1.1.1,x.2.2) then
_root_.Integration9_9.TM2NativeCoreWeight.current order (((x.1.1.1.1,x.1.2.1),x.1.2.2),x.2.2) else 0
def current (order : ℕ) : _root_.Integration9_9.TM2NativePublicRejection.Context × List (_root_.Integration9_9.TM2NativeCoreProposal.Tapes × List Bool) → _root_.Integration9_9.TM2NativePublicRejection.State :=
_root_.Integration9_9.TM2NativeRejection.current _root_.Integration9_9.TM2NativePublicRejection.sample (_root_.Integration9_9.TM2NativePublicRejection.score order) (fun _ => 2) (fun _ => (false,default))
def resultData {security : ℕ} : Option (_root_.CurrentAFT.CurrentCoreProposal.MaterializedCore security) → _root_.Integration9_9.TM2NativePublicRejection.State
| none => (false,default)
| some core => (true,_root_.Integration9_9.TM2NativeCoreProposal.coreData core)
def inputContext (order : ℕ) (params : _root_.Integration9_9.TM2NativeCoreProposal.Meta) (drawTicks weightTicks : List Unit)
(table : _root_.CurrentAFT.BinaryWeightCoordinates.Table (_root_.CurrentAFT.BinaryWeightLocal.colors params.1.length) order) : _root_.Integration9_9.TM2NativePublicRejection.Context :=
((params,drawTicks),(weightTicks,List.ofFn (fun i => List.ofFn (fun j => ((table.get i).get j).decode))))
end Integration9_9.TM2NativePublicRejection
end
section
namespace CurrentAFT
end CurrentAFT
namespace CurrentAFT.CappedPublicRejection
end CurrentAFT.CappedPublicRejection
namespace CurrentAFT.CappedPublicRejection.current
end CurrentAFT.CappedPublicRejection.current
namespace CurrentAFT.CappedPublicRejection.error
end CurrentAFT.CappedPublicRejection.error
namespace CurrentAFT.CappedPublicRejection.law
end CurrentAFT.CappedPublicRejection.law
namespace CurrentAFT.CappedPublicRejection.tablePrecision
end CurrentAFT.CappedPublicRejection.tablePrecision
namespace CurrentAFT.CappedPublicRejection.workPolynomial
end CurrentAFT.CappedPublicRejection.workPolynomial
set_option autoImplicit false
set_option maxHeartbeats 1800000
set_option maxRecDepth 10000
set_option synthInstance.maxSize 1024
set_option backward.isDefEq.respectTransparency false
namespace Integration9_9.TM2NativeCappedRejection
open AFT AFT.BinaryArithmetic CurrentAFT
open OAI.MetricKMedian.Binary OAI.MetricKMedian.Binary.Automatic
open TM2NativeCoreProposal
attribute [local irreducible] CurrentProposalDimensions.current
CurrentAFT.Parameters.bodySize CurrentAFT.Parameters.dimension CurrentAFT.Parameters.legCount
TM2NativePublicRejection.current BinaryPublicRejection.current BinaryPublicRejection.draw CappedPublicRejection.current
BinaryRejectionCap.current BinaryProposalPrecision.current PublicParameterProgram.modulus
/-- The actual fixed polynomial reference-precision buffer. -/
def precisionTicks (xs : List Unit) : List Unit := List.replicate (xs.length+2^44*(xs.length+2)^226) ()
attribute [local irreducible] precisionTicks
abbrev Input := (List Unit×_root_.Integration9_9.TM2NativeWeightTable.Table)×List (_root_.Integration9_9.TM2NativeCoreProposal.Tapes×List Bool)
def current (order : ℕ) (x : _root_.Integration9_9.TM2NativeCappedRejection.Input) : _root_.Integration9_9.TM2NativePublicRejection.State :=
_root_.Integration9_9.TM2NativePublicRejection.current order
((((x.1.1,_root_.Integration9_9.TM2NativeCappedRejection.precisionTicks x.1.1),x.1.1),(x.1.1,x.1.2)),x.2)
def tapeData {security : ℕ} (word : _root_.CurrentAFT.CappedPublicRejection.Tapes security) : List (_root_.Integration9_9.TM2NativeCoreProposal.Tapes×List Bool) :=
List.ofFn (fun i=>(_root_.Integration9_9.TM2NativeCoreProposal.tapesData (word i).1,List.ofFn (fun j=>_root_.AFT.BinaryArithmetic.digitBoolean ((word i).2 j))))
end Integration9_9.TM2NativeCappedRejection
end
section
namespace AFT
end AFT
namespace AFT.BinaryArithmetic
end AFT.BinaryArithmetic
namespace AFT.BinaryArithmetic.protectedMetadata
end AFT.BinaryArithmetic.protectedMetadata
namespace CurrentAFT
end CurrentAFT
namespace CurrentAFT.CurrentFlagBinaryMasks
end CurrentAFT.CurrentFlagBinaryMasks
namespace CurrentAFT.CurrentFlagBinaryMasks.fiberAt
end CurrentAFT.CurrentFlagBinaryMasks.fiberAt
namespace CurrentAFT.CurrentFlagBinaryMetadata
end CurrentAFT.CurrentFlagBinaryMetadata
namespace CurrentAFT.CurrentFlagBinaryMetadata.Data
end CurrentAFT.CurrentFlagBinaryMetadata.Data
namespace CurrentAFT.CurrentFlagBinaryMetadata.Data.mk
end CurrentAFT.CurrentFlagBinaryMetadata.Data.mk
namespace CurrentAFT.CurrentFlagBinaryMetadata.build
end CurrentAFT.CurrentFlagBinaryMetadata.build
namespace CurrentAFT.CurrentFlagBinaryMetadata.coordinates
end CurrentAFT.CurrentFlagBinaryMetadata.coordinates
set_option autoImplicit false
set_option maxHeartbeats 2200000
set_option maxRecDepth 10000
set_option synthInstance.maxSize 1024
set_option backward.isDefEq.respectTransparency false
namespace Integration9_9.TM2NativeChartCoordinates
open AFT AFT.BinaryArithmetic CurrentAFT
open OAI.MetricKMedian.Binary OAI.MetricKMedian.Binary.Automatic
abbrev Params := List Unit × List Unit
def coordinates (x : ℕ × ℕ) : ℕ × (ℕ × ℕ) :=
(x.2/(x.1*x.1),((x.2%(x.1*x.1))/x.1,(x.2%(x.1*x.1))%x.1))
def difference (x : (ℕ × ℕ) × ℕ) : ℕ := (x.1.1+(x.2-x.1.2%x.2))%x.2
def feature (x : (ℕ × ℕ) × (ℕ × ℕ)) : ℕ :=
let width:=2*x.1.1+1
let chart:=_root_.Integration9_9.TM2NativeChartCoordinates.coordinates (x.1.2,x.2.2)
(chart.1+chart.2.1*_root_.Integration9_9.TM2NativeChartCoordinates.difference ((x.2.1/width,x.1.1),x.1.2)+
chart.2.2*_root_.Integration9_9.TM2NativeChartCoordinates.difference ((x.2.1%width,x.1.1),x.1.2))%x.1.2
def palette (x : ((ℕ × ℕ) × ℤ) × (ℕ × ℕ)) : Bool :=
let shift:=x.1.2-((x.2.1%(2*x.1.1.1+1) : ℕ) : ℤ)+(x.1.1.1 : ℤ)
decide ((1 : ℤ)≤(x.2.2 : ℤ) ∧ 1+shift≤(x.2.2 : ℤ) ∧
(x.2.2 : ℤ)<(x.1.1.2 : ℤ)-1 ∧ (x.2.2 : ℤ)<(x.1.1.2 : ℤ)-1+shift)
end Integration9_9.TM2NativeChartCoordinates
end
section
set_option autoImplicit false
set_option maxHeartbeats 2500000
set_option maxRecDepth 10000
set_option synthInstance.maxSize 1024
set_option backward.isDefEq.respectTransparency false
namespace Integration9_9.TM2NativeChartMetadata
open AFT AFT.BinaryArithmetic CurrentAFT
open OAI.MetricKMedian.Binary OAI.MetricKMedian.Binary.Automatic
open TM2NativeChartCoordinates
abbrev Context := (_root_.Integration9_9.TM2NativeChartCoordinates.Params × ℤ) × ℕ
abbrev Data := (List (List ℕ) × List (List Bool)) × (List Bool × (List Bool × List Bool))
def chartTicks (p : _root_.Integration9_9.TM2NativeChartCoordinates.Params) : List Unit := _root_.Integration9_9.TM2NativePrime.powerSlots 3 p.2
def featureTicks (p : _root_.Integration9_9.TM2NativeChartCoordinates.Params) : List Unit := _root_.Integration9_9.TM2NativePrime.powerSlots 2 (p.1++p.1++[()])
attribute [local irreducible] chartTicks featureTicks
def charts (p : _root_.Integration9_9.TM2NativeChartCoordinates.Params) : List ℕ := List.range (_root_.Integration9_9.TM2NativeChartMetadata.chartTicks p).length
def features (p : _root_.Integration9_9.TM2NativeChartCoordinates.Params) : List ℕ := List.range (_root_.Integration9_9.TM2NativeChartMetadata.featureTicks p).length
def colors (p : _root_.Integration9_9.TM2NativeChartCoordinates.Params) : List ℕ := List.range p.2.length
attribute [local irreducible] charts features colors
def every (xs : List Bool) : Bool := xs.all id
def allowedAt (x : _root_.Integration9_9.TM2NativeChartMetadata.Context × (ℕ × ℕ)) : Bool :=
_root_.Integration9_9.TM2NativeChartCoordinates.palette (((x.1.1.1.1.length,x.1.1.1.2.length),x.1.1.2),
(x.2.1,_root_.Integration9_9.TM2NativeChartCoordinates.feature ((x.1.1.1.1.length,x.1.1.1.2.length),x.2)))
def line (x : _root_.Integration9_9.TM2NativeChartCoordinates.Params × ℕ) : Bool := decide (x.2/(2*x.1.1.length+1)=x.1.1.length)
def safe (x : _root_.Integration9_9.TM2NativeChartMetadata.Context × ℕ) : Bool :=
!(decide ((_root_.Integration9_9.TM2NativeChartCoordinates.coordinates (x.1.1.1.2.length,x.2)).2.1=0)) &&
_root_.Integration9_9.TM2NativeChartMetadata.every ((_root_.Integration9_9.TM2NativeChartMetadata.features x.1.1.1).map (fun i => _root_.Integration9_9.TM2NativeChartMetadata.allowedAt (x.1,(i,x.2))))
def fiber (x : _root_.Integration9_9.TM2NativeChartMetadata.Context × ℕ) : Bool :=
let coords:=_root_.Integration9_9.TM2NativeChartCoordinates.coordinates (x.1.1.1.2.length,x.2)
decide (coords.1=x.1.2) && !(decide (coords.2.1=0)) && decide (coords.2.2=0) &&
_root_.Integration9_9.TM2NativeChartMetadata.every ((_root_.Integration9_9.TM2NativeChartMetadata.features x.1.1.1).map (fun i => _root_.Integration9_9.TM2NativeChartMetadata.line (x.1.1.1,i) || _root_.Integration9_9.TM2NativeChartMetadata.allowedAt (x.1,(i,x.2))))
def current (x : _root_.Integration9_9.TM2NativeChartMetadata.Context) : _root_.Integration9_9.TM2NativeChartMetadata.Data :=
(((_root_.Integration9_9.TM2NativeChartMetadata.features x.1.1).map (fun i => (_root_.Integration9_9.TM2NativeChartMetadata.charts x.1.1).map
(fun j => _root_.Integration9_9.TM2NativeChartCoordinates.feature ((x.1.1.1.length,x.1.1.2.length),(i,j)))),
(_root_.Integration9_9.TM2NativeChartMetadata.features x.1.1).map (fun i => (_root_.Integration9_9.TM2NativeChartMetadata.colors x.1.1).map
(fun c => _root_.Integration9_9.TM2NativeChartCoordinates.palette (((x.1.1.1.length,x.1.1.2.length),x.1.2),(i,c))))),
((_root_.Integration9_9.TM2NativeChartMetadata.charts x.1.1).map (fun j => _root_.Integration9_9.TM2NativeChartMetadata.safe (x,j)),
((_root_.Integration9_9.TM2NativeChartMetadata.features x.1.1).map (fun i => _root_.Integration9_9.TM2NativeChartMetadata.line (x.1.1,i)),(_root_.Integration9_9.TM2NativeChartMetadata.charts x.1.1).map (fun j => _root_.Integration9_9.TM2NativeChartMetadata.fiber (x,j)))))
theorem range_map {A : Type} (n : ℕ) (f : ℕ→A) : (List.range n).map f=List.ofFn (fun i : Fin n => f i.val) := by
apply List.ext_getElem
· simp
· intros;simp
def data {charts colors features : ℕ} (d : _root_.CurrentAFT.CurrentFlagBinaryMetadata.Data charts colors features) : _root_.Integration9_9.TM2NativeChartMetadata.Data :=
((List.ofFn (fun i => List.ofFn (fun j => ((d.feature.get i).get j).val)),
List.ofFn (fun i => List.ofFn (d.allowed.get i).get)),
(List.ofFn d.safe.get,(List.ofFn d.line.get,List.ofFn d.fiber.get)))
end Integration9_9.TM2NativeChartMetadata
end
section
namespace AFT
end AFT
namespace AFT.BinaryArithmetic
end AFT.BinaryArithmetic
namespace AFT.BinaryArithmetic.RationalBits
end AFT.BinaryArithmetic.RationalBits
namespace AFT.BinaryArithmetic.RationalBits.iteration
end AFT.BinaryArithmetic.RationalBits.iteration
namespace AFT.BinaryArithmetic.RationalBits.iteration.match_1
end AFT.BinaryArithmetic.RationalBits.iteration.match_1
namespace AFT.BinaryArithmetic.RationalBits.iterationEntry
end AFT.BinaryArithmetic.RationalBits.iterationEntry
namespace AFT.BinaryArithmetic.RationalBits.iterationWorkStep
end AFT.BinaryArithmetic.RationalBits.iterationWorkStep
namespace AFT.BinaryArithmetic.RationalBits.matrixApply
end AFT.BinaryArithmetic.RationalBits.matrixApply
namespace AFT.BinaryArithmetic.RationalBits.matrixEntry
end AFT.BinaryArithmetic.RationalBits.matrixEntry
namespace AFT.BinaryArithmetic.RationalBits.matrixProductTerm
end AFT.BinaryArithmetic.RationalBits.matrixProductTerm
namespace AFT.BinaryArithmetic.RationalBits.matrixRow
end AFT.BinaryArithmetic.RationalBits.matrixRow
namespace AFT.BinaryArithmetic.RationalBits.normalizeArray
end AFT.BinaryArithmetic.RationalBits.normalizeArray
namespace AFT.BinaryArithmetic.RationalBits.normalizeArrayWork
end AFT.BinaryArithmetic.RationalBits.normalizeArrayWork
namespace AFT.BinaryArithmetic.RationalBits.sumArray
end AFT.BinaryArithmetic.RationalBits.sumArray
namespace Integration9_9
end Integration9_9
namespace Integration9_9.TM2NativeLinearAlgebra
end Integration9_9.TM2NativeLinearAlgebra
namespace Integration9_9.TM2NativeLinearAlgebra.decodedVector
end Integration9_9.TM2NativeLinearAlgebra.decodedVector
namespace Integration9_9.TM2NativeLinearAlgebra.dot
end Integration9_9.TM2NativeLinearAlgebra.dot
namespace Integration9_9.TM2NativeLinearAlgebra.matrixList
end Integration9_9.TM2NativeLinearAlgebra.matrixList
namespace Integration9_9.TM2NativeLinearAlgebra.rawMatrixCode
end Integration9_9.TM2NativeLinearAlgebra.rawMatrixCode
namespace Integration9_9.TM2NativeLinearAlgebra.rawVectorCode
end Integration9_9.TM2NativeLinearAlgebra.rawVectorCode
namespace Integration9_9.TM2NativeLinearAlgebra.vectorList
end Integration9_9.TM2NativeLinearAlgebra.vectorList
set_option autoImplicit false
set_option maxHeartbeats 4000000
set_option maxRecDepth 10000
set_option synthInstance.maxSize 1024
set_option backward.isDefEq.respectTransparency false
/-! Real polynomial-time compilation of the sampler's materialized Neumann
iteration, uniformly over stored dimensions. Unary tick tapes bound iterations;
the proved common-denominator height bound controls every actual state encoding.
Initialization and raw native input decoding are part of the machine program. -/
namespace Integration9_9.TM2NativeIteration
open AFT.RationalNumerics
open OAI.MetricKMedian.Binary
open OAI.MetricKMedian.Binary.Automatic
open scoped BigOperators
def _root_.Integration9_9.TM2NativeIteration.qDot (x : List ℚ × List ℚ) : ℚ := ((x.1.zip x.2).map (fun p => p.1*p.2)).sum
noncomputable def _root_.Integration9_9.TM2NativeIteration.qDotProgram : PolyProgram (encodePair (encodeList Ratio.encode) (encodeList Ratio.encode)) Ratio.encode _root_.Integration9_9.TM2NativeIteration.qDot :=
((PolyProgram.listZipWith Ratio.encode Ratio.encode 0 0 PolyProgram.ratMul).comp PolyProgram.ratSum).congr _ (fun _ => rfl)
def _root_.Integration9_9.TM2NativeIteration.qApply (x : List (List ℚ) × List ℚ) : List ℚ := x.1.map (fun row => _root_.Integration9_9.TM2NativeIteration.qDot (row,x.2))
noncomputable def _root_.Integration9_9.TM2NativeIteration.qApplyProgram :
PolyProgram (encodePair (encodeList (encodeList Ratio.encode)) (encodeList Ratio.encode)) (encodeList Ratio.encode) _root_.Integration9_9.TM2NativeIteration.qApply := by
let row := (PolyProgram.exchange (encodeList Ratio.encode) (encodeList Ratio.encode)).comp _root_.Integration9_9.TM2NativeIteration.qDotProgram
let rows := row.listMapWith ([] : List ℚ) (0 : ℚ)
exact ((PolyProgram.exchange (encodeList (encodeList Ratio.encode)) (encodeList Ratio.encode)).comp rows).congr _ (fun _ => rfl)
@[fun_prop] theorem _root_.Integration9_9.TM2NativeIteration.qApply_poly : Poly _root_.Integration9_9.TM2NativeIteration.qApply := ⟨_root_.Integration9_9.TM2NativeIteration.qApplyProgram⟩
theorem _root_.Integration9_9.TM2NativeIteration.zip_ofFn {α β : Type} {n : ℕ} (f : Fin n → α) (g : Fin n → β) :
(List.ofFn f).zip (List.ofFn g) = List.ofFn (fun i => (f i,g i)) := by
apply List.ext_getElem
· simp
· intros; simp
structure State where
count : ℕ
matrix : Vector (Vector ℚ count) count
rhs : Vector ℚ count
done : List Unit
todo : List Unit
profile : Vector ℚ count
correct : ∀ i, profile.get i = _root_.AFT.RationalNumerics.linearIteration
(fun o j => (matrix.get o).get j) rhs.get done.length i
abbrev Fields := List (List ℚ) × (List ℚ × (List Unit × (List Unit × List ℚ)))
abbrev vectorCode : List ℚ → List Bool := encodeList Ratio.encode
abbrev matrixCode : List (List ℚ) → List Bool := encodeList _root_.Integration9_9.TM2NativeIteration.vectorCode
abbrev ticksCode : List Unit → List Bool := encodeList (fun _ => [])
def fieldsCode : _root_.Integration9_9.TM2NativeIteration.Fields → List Bool :=
encodePair _root_.Integration9_9.TM2NativeIteration.matrixCode (encodePair _root_.Integration9_9.TM2NativeIteration.vectorCode (encodePair _root_.Integration9_9.TM2NativeIteration.ticksCode (encodePair _root_.Integration9_9.TM2NativeIteration.ticksCode _root_.Integration9_9.TM2NativeIteration.vectorCode)))
def fields (s : _root_.Integration9_9.TM2NativeIteration.State) : _root_.Integration9_9.TM2NativeIteration.Fields :=
(List.ofFn (fun i => List.ofFn (s.matrix.get i).get),
(List.ofFn s.rhs.get,(s.done,(s.todo,List.ofFn s.profile.get))))
def stateCode (s : _root_.Integration9_9.TM2NativeIteration.State) : List Bool := _root_.Integration9_9.TM2NativeIteration.fieldsCode (_root_.Integration9_9.TM2NativeIteration.fields s)
def next (s : _root_.Integration9_9.TM2NativeIteration.State) : _root_.Integration9_9.TM2NativeIteration.State where
count := s.count
matrix := s.matrix
rhs := s.rhs
done := ()::s.done
todo := s.todo.tail
profile := Vector.ofFn (fun i => s.rhs.get i - ∑ j, ((s.matrix.get i).get j)*s.profile.get j)
correct i := by
simp only [Vector.get_ofFn,List.length_cons,_root_.AFT.RationalNumerics.linearIteration,Pi.sub_apply,_root_.AFT.RationalNumerics.matrixApply]
congr 1
apply Finset.sum_congr rfl
intro j _
rw [s.correct]
def fieldsNext (x : _root_.Integration9_9.TM2NativeIteration.Fields) : _root_.Integration9_9.TM2NativeIteration.Fields :=
(x.1,(x.2.1,(()::x.2.2.1,(x.2.2.2.1.tail,
(x.2.1.zip (_root_.Integration9_9.TM2NativeIteration.qApply (x.1,x.2.2.2.2))).map (fun p => p.1-p.2)))))
theorem _root_.Integration9_9.TM2NativeIteration.get_ofFn {n : ℕ} (f : Fin n → ℚ) : (Vector.ofFn f).get = f := by
funext i
simp only [Vector.get_ofFn]
theorem fields_next (s : _root_.Integration9_9.TM2NativeIteration.State) : _root_.Integration9_9.TM2NativeIteration.fieldsNext (_root_.Integration9_9.TM2NativeIteration.fields s) = _root_.Integration9_9.TM2NativeIteration.fields (_root_.Integration9_9.TM2NativeIteration.next s) := by
unfold _root_.Integration9_9.TM2NativeIteration.fieldsNext _root_.Integration9_9.TM2NativeIteration.fields _root_.Integration9_9.TM2NativeIteration.next
simp only [_root_.Integration9_9.TM2NativeIteration.qApply,List.map_ofFn,Function.comp_def]
have happly : List.ofFn (fun i => _root_.Integration9_9.TM2NativeIteration.qDot (List.ofFn (s.matrix.get i).get,List.ofFn s.profile.get)) =
List.ofFn (fun i => ∑ j, ((s.matrix.get i).get j)*s.profile.get j) := by
congr 1
funext i
simp only [_root_.Integration9_9.TM2NativeIteration.qDot,_root_.Integration9_9.TM2NativeIteration.zip_ofFn,List.map_ofFn,List.sum_ofFn]
rfl
rw [happly,_root_.Integration9_9.TM2NativeIteration.zip_ofFn,List.map_ofFn]
simp only [Function.comp_def,_root_.Integration9_9.TM2NativeIteration.get_ofFn]
noncomputable def _root_.Integration9_9.TM2NativeIteration.fieldsNextProgram : PolyProgram _root_.Integration9_9.TM2NativeIteration.fieldsCode _root_.Integration9_9.TM2NativeIteration.fieldsCode _root_.Integration9_9.TM2NativeIteration.fieldsNext := by
change PolyProgram Automatic.enc Automatic.enc _root_.Integration9_9.TM2NativeIteration.fieldsNext
exact (show Poly _root_.Integration9_9.TM2NativeIteration.fieldsNext by unfold _root_.Integration9_9.TM2NativeIteration.fieldsNext; fun_prop).program
noncomputable def nextProgram : PolyProgram _root_.Integration9_9.TM2NativeIteration.stateCode _root_.Integration9_9.TM2NativeIteration.stateCode _root_.Integration9_9.TM2NativeIteration.next :=
_root_.Integration9_9.TM2NativeIteration.fieldsNextProgram.recode _root_.Integration9_9.TM2NativeIteration.fields (fun _ => rfl) (fun s => congrArg _root_.Integration9_9.TM2NativeIteration.fieldsCode (_root_.Integration9_9.TM2NativeIteration.fields_next s))
def body (s : _root_.Integration9_9.TM2NativeIteration.State) : List ℚ ⊕ _root_.Integration9_9.TM2NativeIteration.State := if s.todo.isEmpty then .inl (List.ofFn s.profile.get) else .inr (_root_.Integration9_9.TM2NativeIteration.next s)
def result (s : _root_.Integration9_9.TM2NativeIteration.State) : List ℚ := List.ofFn (_root_.AFT.RationalNumerics.linearIteration
(fun o j => (s.matrix.get o).get j) s.rhs.get (s.done.length+s.todo.length))
noncomputable def bodyProgram : PolyProgram _root_.Integration9_9.TM2NativeIteration.stateCode (encodeLoop _root_.Integration9_9.TM2NativeIteration.stateCode _root_.Integration9_9.TM2NativeIteration.vectorCode) _root_.Integration9_9.TM2NativeIteration.body := by
let testFields : PolyProgram _root_.Integration9_9.TM2NativeIteration.fieldsCode encodeBool (fun x : _root_.Integration9_9.TM2NativeIteration.Fields => x.2.2.2.1.isEmpty) := by
change PolyProgram Automatic.enc Automatic.enc _
exact (show Poly (fun x : _root_.Integration9_9.TM2NativeIteration.Fields => x.2.2.2.1.isEmpty) by fun_prop).program
let test := testFields.recode _root_.Integration9_9.TM2NativeIteration.fields (fun _ => rfl) (fun _ => rfl)
let outFields : PolyProgram _root_.Integration9_9.TM2NativeIteration.fieldsCode _root_.Integration9_9.TM2NativeIteration.vectorCode (fun x : _root_.Integration9_9.TM2NativeIteration.Fields => x.2.2.2.2) := by
change PolyProgram Automatic.enc Automatic.enc _
exact (show Poly (fun x : _root_.Integration9_9.TM2NativeIteration.Fields => x.2.2.2.2) by fun_prop).program
let out := outFields.recode _root_.Integration9_9.TM2NativeIteration.fields (fun _ => rfl) (fun _ => rfl)
exact (PolyProgram.ite test
(_root_.Integration9_9.TM2NativeIteration.nextProgram.comp (PolyProgram.injectRight _root_.Integration9_9.TM2NativeIteration.stateCode _root_.Integration9_9.TM2NativeIteration.vectorCode))
(out.comp (PolyProgram.injectLeft _root_.Integration9_9.TM2NativeIteration.stateCode _root_.Integration9_9.TM2NativeIteration.vectorCode))).congr _ (fun _ => rfl)
theorem _root_.Integration9_9.TM2NativeIteration.ticks_length (xs : List Unit) : (_root_.Integration9_9.TM2NativeIteration.ticksCode xs).length = xs.length := by
induction xs with
| nil => rfl
| cons x xs ih => simp [_root_.Integration9_9.TM2NativeIteration.ticksCode,encodeList,quote,ih]
def baseSize (s : _root_.Integration9_9.TM2NativeIteration.State) : ℕ :=
2*(_root_.Integration9_9.TM2NativeIteration.matrixCode (_root_.Integration9_9.TM2NativeIteration.fields s).1).length + 2*(_root_.Integration9_9.TM2NativeIteration.vectorCode (_root_.Integration9_9.TM2NativeIteration.fields s).2.1).length +
2*s.done.length+2*s.todo.length+4
theorem state_length (s : _root_.Integration9_9.TM2NativeIteration.State) :
(_root_.Integration9_9.TM2NativeIteration.stateCode s).length = _root_.Integration9_9.TM2NativeIteration.baseSize s+(_root_.Integration9_9.TM2NativeIteration.vectorCode (List.ofFn s.profile.get)).length := by
simp only [_root_.Integration9_9.TM2NativeIteration.stateCode,_root_.Integration9_9.TM2NativeIteration.fieldsCode,_root_.Integration9_9.TM2NativeIteration.fields,_root_.Integration9_9.TM2NativeIteration.baseSize,encodePair_length,_root_.Integration9_9.TM2NativeIteration.ticks_length]
omega
theorem base_le_length (s : _root_.Integration9_9.TM2NativeIteration.State) : _root_.Integration9_9.TM2NativeIteration.baseSize s ≤ (_root_.Integration9_9.TM2NativeIteration.stateCode s).length := by rw [_root_.Integration9_9.TM2NativeIteration.state_length]; omega
theorem count_le_length (s : _root_.Integration9_9.TM2NativeIteration.State) : s.count ≤ (_root_.Integration9_9.TM2NativeIteration.stateCode s).length := by
have h := EncodedList.length_le Ratio.encode (List.ofFn s.rhs.get)
rw [List.length_ofFn] at h
have hb := _root_.Integration9_9.TM2NativeIteration.base_le_length s
dsimp only [_root_.Integration9_9.TM2NativeIteration.baseSize,_root_.Integration9_9.TM2NativeIteration.fields] at hb
change s.count ≤ (_root_.Integration9_9.TM2NativeIteration.vectorCode (List.ofFn s.rhs.get)).length at h
omega
theorem total_le_length (s : _root_.Integration9_9.TM2NativeIteration.State) : s.done.length+s.todo.length ≤ (_root_.Integration9_9.TM2NativeIteration.stateCode s).length := by
have hb := _root_.Integration9_9.TM2NativeIteration.base_le_length s
unfold _root_.Integration9_9.TM2NativeIteration.baseSize at hb
omega
theorem _root_.Integration9_9.TM2NativeIteration.nativeHeight {q : ℚ} {L : ℕ} (h : HasHeight q L) : _root_.AFT.RationalNumerics.HeightBound q L := by
constructor
· have hz : (q.num.natAbs : ℤ) ≤ (2 : ℤ)^L := by simpa only [Int.natCast_natAbs] using h.1
exact_mod_cast hz
· exact_mod_cast h.2
theorem matrix_height (s : _root_.Integration9_9.TM2NativeIteration.State) (i j : Fin s.count) : _root_.AFT.RationalNumerics.HeightBound ((s.matrix.get i).get j) (_root_.Integration9_9.TM2NativeIteration.stateCode s).length := by
let row := List.ofFn (s.matrix.get i).get
let rows := (_root_.Integration9_9.TM2NativeIteration.fields s).1
have h1 := EncodedList.member_length Ratio.encode row ((s.matrix.get i).get j) (List.mem_ofFn.mpr ⟨j,rfl⟩)
have h2 := EncodedList.member_length _root_.Integration9_9.TM2NativeIteration.vectorCode rows row (List.mem_ofFn.mpr ⟨i,rfl⟩)
have hb := _root_.Integration9_9.TM2NativeIteration.base_le_length s
have hsize : (Ratio.encode ((s.matrix.get i).get j)).length ≤ (_root_.Integration9_9.TM2NativeIteration.stateCode s).length := by
change (Ratio.encode ((s.matrix.get i).get j)).length ≤ (_root_.Integration9_9.TM2NativeIteration.vectorCode row).length at h1
change (_root_.Integration9_9.TM2NativeIteration.vectorCode row).length ≤ (_root_.Integration9_9.TM2NativeIteration.matrixCode (_root_.Integration9_9.TM2NativeIteration.fields s).1).length at h2
unfold _root_.Integration9_9.TM2NativeIteration.baseSize at hb
omega
exact (_root_.Integration9_9.TM2NativeIteration.nativeHeight (Ratio.height_length _)).mono hsize
theorem rhs_height (s : _root_.Integration9_9.TM2NativeIteration.State) (i : Fin s.count) : _root_.AFT.RationalNumerics.HeightBound (s.rhs.get i) (_root_.Integration9_9.TM2NativeIteration.stateCode s).length := by
have h := EncodedList.member_length Ratio.encode (List.ofFn s.rhs.get) (s.rhs.get i) (List.mem_ofFn.mpr ⟨i,rfl⟩)
have hb := _root_.Integration9_9.TM2NativeIteration.base_le_length s
have hsize : (Ratio.encode (s.rhs.get i)).length ≤ (_root_.Integration9_9.TM2NativeIteration.stateCode s).length := by
dsimp only [_root_.Integration9_9.TM2NativeIteration.baseSize,_root_.Integration9_9.TM2NativeIteration.fields] at hb
change (Ratio.encode (s.rhs.get i)).length ≤ (_root_.Integration9_9.TM2NativeIteration.vectorCode (List.ofFn s.rhs.get)).length at h
omega
exact (_root_.Integration9_9.TM2NativeIteration.nativeHeight (Ratio.height_length _)).mono hsize
def heightBudget (L : ℕ) : ℕ := L*((3*(L^2+L)+1)*L+L+1)
noncomputable def sizeBudget : Polynomial ℕ :=
Polynomial.X+Polynomial.X*(6*(Polynomial.X*((3*(Polynomial.X^2+Polynomial.X)+1)*Polynomial.X+Polynomial.X+1))+21)
theorem sizeBudget_eval (L : ℕ) : _root_.Integration9_9.TM2NativeIteration.sizeBudget.eval L = L+L*(6*_root_.Integration9_9.TM2NativeIteration.heightBudget L+21) := by simp [_root_.Integration9_9.TM2NativeIteration.sizeBudget,_root_.Integration9_9.TM2NativeIteration.heightBudget]
theorem state_size (s : _root_.Integration9_9.TM2NativeIteration.State) (L : ℕ)
(hm : ∀ i j, _root_.AFT.RationalNumerics.HeightBound ((s.matrix.get i).get j) L)
(hr : ∀ i, _root_.AFT.RationalNumerics.HeightBound (s.rhs.get i) L)
(hn : s.count ≤ L) (ht : s.done.length+s.todo.length ≤ L) (hb : _root_.Integration9_9.TM2NativeIteration.baseSize s ≤ L) :
(_root_.Integration9_9.TM2NativeIteration.stateCode s).length ≤ _root_.Integration9_9.TM2NativeIteration.sizeBudget.eval L := by
have hdone : s.done.length ≤ L := by omega
have hslope : (3*(s.count^2+s.count)+1)*L+s.count+1 ≤ (3*(L^2+L)+1)*L+L+1 := by gcongr
have hheight : s.done.length*((3*(s.count^2+s.count)+1)*L+s.count+1) ≤ _root_.Integration9_9.TM2NativeIteration.heightBudget L :=
Nat.mul_le_mul hdone hslope
have hp (i : Fin s.count) : _root_.AFT.RationalNumerics.HeightBound (s.profile.get i) (_root_.Integration9_9.TM2NativeIteration.heightBudget L) := by
rw [s.correct]
exact (_root_.InfoLossLARNativeSupplements.he7db6c4ee6224eee.AFT.RationalNumerics.linearIteration_height (fun o j => (s.matrix.get o).get j) s.rhs.get L s.done.length hm hr i).mono
(by simpa only [Fintype.card_fin] using hheight)
have hv := EncodedList.length_bound Ratio.encode (List.ofFn s.profile.get) (3*_root_.Integration9_9.TM2NativeIteration.heightBudget L+10) (by
intro q hq
obtain ⟨i,rfl⟩ := List.mem_ofFn.mp hq
exact _root_.Integration9_9.TM2NativeArithmetic.ratioLength (hp i))
have hv' : (_root_.Integration9_9.TM2NativeIteration.vectorCode (List.ofFn s.profile.get)).length ≤ L*(6*_root_.Integration9_9.TM2NativeIteration.heightBudget L+21) := by
simp only [List.length_ofFn,show 2*(3*_root_.Integration9_9.TM2NativeIteration.heightBudget L+10)+1=6*_root_.Integration9_9.TM2NativeIteration.heightBudget L+21 by omega] at hv
exact hv.trans (Nat.mul_le_mul_right _ hn)
rw [_root_.Integration9_9.TM2NativeIteration.state_length,_root_.Integration9_9.TM2NativeIteration.sizeBudget_eval]
exact Nat.add_le_add hb hv'
theorem total_next (s : _root_.Integration9_9.TM2NativeIteration.State) (h : s.todo ≠ []) :
(_root_.Integration9_9.TM2NativeIteration.next s).done.length+(_root_.Integration9_9.TM2NativeIteration.next s).todo.length = s.done.length+s.todo.length := by
cases ht : s.todo with
| nil => exact (h ht).elim
| cons u us => simp only [_root_.Integration9_9.TM2NativeIteration.next,ht,List.length_cons,List.tail_cons]; omega
theorem base_next (s : _root_.Integration9_9.TM2NativeIteration.State) (h : s.todo ≠ []) : _root_.Integration9_9.TM2NativeIteration.baseSize (_root_.Integration9_9.TM2NativeIteration.next s) = _root_.Integration9_9.TM2NativeIteration.baseSize s := by
cases ht : s.todo with
| nil => exact (h ht).elim
| cons u us =>
dsimp only [_root_.Integration9_9.TM2NativeIteration.baseSize,_root_.Integration9_9.TM2NativeIteration.fields,_root_.Integration9_9.TM2NativeIteration.next]
simp only [ht,List.length_cons,List.tail_cons]
omega
theorem result_next (s : _root_.Integration9_9.TM2NativeIteration.State) (h : s.todo ≠ []) : _root_.Integration9_9.TM2NativeIteration.result (_root_.Integration9_9.TM2NativeIteration.next s) = _root_.Integration9_9.TM2NativeIteration.result s := by
change List.ofFn (_root_.AFT.RationalNumerics.linearIteration (fun o j => (s.matrix.get o).get j) s.rhs.get
((_root_.Integration9_9.TM2NativeIteration.next s).done.length+(_root_.Integration9_9.TM2NativeIteration.next s).todo.length)) = _
rw [_root_.Integration9_9.TM2NativeIteration.total_next s h]
rfl
/-- Every intermediate state of the actual encoded loop has the polynomial
size budget proved above; termination consumes exactly one unary tick. -/
theorem run (s : _root_.Integration9_9.TM2NativeIteration.State) (L : ℕ)
(hm : ∀ i j, _root_.AFT.RationalNumerics.HeightBound ((s.matrix.get i).get j) L)
(hr : ∀ i, _root_.AFT.RationalNumerics.HeightBound (s.rhs.get i) L)
(hn : s.count ≤ L) (ht : s.done.length+s.todo.length ≤ L) (hb : _root_.Integration9_9.TM2NativeIteration.baseSize s ≤ L) :
BoundedRun _root_.Integration9_9.TM2NativeIteration.stateCode _root_.Integration9_9.TM2NativeIteration.body (_root_.Integration9_9.TM2NativeIteration.sizeBudget.eval L) (s.todo.length+1) s (_root_.Integration9_9.TM2NativeIteration.result s) := by
have hsize := _root_.Integration9_9.TM2NativeIteration.state_size s L hm hr hn ht hb
cases htodo : s.todo with
| nil =>
have hresult : List.ofFn s.profile.get = _root_.Integration9_9.TM2NativeIteration.result s := by
unfold _root_.Integration9_9.TM2NativeIteration.result
rw [htodo,List.length_nil,Nat.add_zero]
apply congrArg List.ofFn
funext i
exact s.correct i
apply BoundedRun.stop hsize
simpa only [_root_.Integration9_9.TM2NativeIteration.body,htodo,List.isEmpty_nil,ite_true] using congrArg Sum.inl hresult
| cons u us =>
have hne : s.todo ≠ [] := by simp [htodo]
have hm' : ∀ i j, _root_.AFT.RationalNumerics.HeightBound (((_root_.Integration9_9.TM2NativeIteration.next s).matrix.get i).get j) L := hm
have hr' : ∀ i, _root_.AFT.RationalNumerics.HeightBound ((_root_.Integration9_9.TM2NativeIteration.next s).rhs.get i) L := hr
have hn' : (_root_.Integration9_9.TM2NativeIteration.next s).count ≤ L := hn
have ht' : (_root_.Integration9_9.TM2NativeIteration.next s).done.length+(_root_.Integration9_9.TM2NativeIteration.next s).todo.length ≤ L := by rw [_root_.Integration9_9.TM2NativeIteration.total_next s hne]; exact ht
have hb' : _root_.Integration9_9.TM2NativeIteration.baseSize (_root_.Integration9_9.TM2NativeIteration.next s) ≤ L := by rw [_root_.Integration9_9.TM2NativeIteration.base_next s hne]; exact hb
have hrest := run (_root_.Integration9_9.TM2NativeIteration.next s) L hm' hr' hn' ht' hb'
rw [_root_.Integration9_9.TM2NativeIteration.result_next s hne] at hrest
have hbody : _root_.Integration9_9.TM2NativeIteration.body s = Sum.inr (_root_.Integration9_9.TM2NativeIteration.next s) := by simp only [_root_.Integration9_9.TM2NativeIteration.body,htodo,List.isEmpty_cons,Bool.false_eq_true,ite_false]
have hh := BoundedRun.step hsize hbody hrest
simpa only [_root_.Integration9_9.TM2NativeIteration.next,htodo,List.tail_cons,List.length_cons,Nat.add_assoc] using hh
termination_by s.todo.length
decreasing_by
simp only [_root_.Integration9_9.TM2NativeIteration.next,htodo,List.tail_cons,List.length_cons]
omega
/-- A complete finite Boolean-stack implementation of the materialized
iteration loop, with both iteration and intermediate bit sizes verified. -/
noncomputable def loop : PolyProgram _root_.Integration9_9.TM2NativeIteration.stateCode _root_.Integration9_9.TM2NativeIteration.vectorCode _root_.Integration9_9.TM2NativeIteration.result :=
_root_.Integration9_9.TM2NativeIteration.bodyProgram.loop _root_.Integration9_9.TM2NativeIteration.result (Polynomial.X+1) _root_.Integration9_9.TM2NativeIteration.sizeBudget (fun s => by
refine ⟨s.todo.length+1,?_,?_⟩
· simp only [Polynomial.eval_add,Polynomial.eval_X,Polynomial.eval_one]
have hh := _root_.Integration9_9.TM2NativeIteration.total_le_length s
omega
· exact _root_.Integration9_9.TM2NativeIteration.run s (_root_.Integration9_9.TM2NativeIteration.stateCode s).length (_root_.Integration9_9.TM2NativeIteration.matrix_height s) (_root_.Integration9_9.TM2NativeIteration.rhs_height s)
(_root_.Integration9_9.TM2NativeIteration.count_le_length s) (_root_.Integration9_9.TM2NativeIteration.total_le_length s) (_root_.Integration9_9.TM2NativeIteration.base_le_length s))
structure Request where
count : ℕ
matrix : Vector (Vector ℚ count) count
rhs : Vector ℚ count
ticks : List Unit
abbrev RequestFields := List (List ℚ) × (List ℚ × List Unit)
def requestFieldsCode : _root_.Integration9_9.TM2NativeIteration.RequestFields → List Bool := encodePair _root_.Integration9_9.TM2NativeIteration.matrixCode (encodePair _root_.Integration9_9.TM2NativeIteration.vectorCode _root_.Integration9_9.TM2NativeIteration.ticksCode)
def requestFields (r : _root_.Integration9_9.TM2NativeIteration.Request) : _root_.Integration9_9.TM2NativeIteration.RequestFields :=
(List.ofFn (fun i => List.ofFn (r.matrix.get i).get),(List.ofFn r.rhs.get,r.ticks))
def requestCode (r : _root_.Integration9_9.TM2NativeIteration.Request) : List Bool := _root_.Integration9_9.TM2NativeIteration.requestFieldsCode (_root_.Integration9_9.TM2NativeIteration.requestFields r)
def start (r : _root_.Integration9_9.TM2NativeIteration.Request) : _root_.Integration9_9.TM2NativeIteration.State where
count := r.count
matrix := r.matrix
rhs := r.rhs
done := []
todo := r.ticks
profile := Vector.replicate r.count 0
correct i := by simp only [Vector.get_replicate,List.length_nil,_root_.AFT.RationalNumerics.linearIteration,Pi.zero_apply]
def fieldsStart (x : _root_.Integration9_9.TM2NativeIteration.RequestFields) : _root_.Integration9_9.TM2NativeIteration.Fields :=
(x.1,(x.2.1,([],(x.2.2,x.2.1.map (fun _ => 0)))))
theorem _root_.Integration9_9.TM2NativeIteration.get_replicate (n : ℕ) : (Vector.replicate n (0 : ℚ)).get = (fun _ => 0) := by
funext i
simp only [Vector.get_replicate]
theorem fields_start (r : _root_.Integration9_9.TM2NativeIteration.Request) : _root_.Integration9_9.TM2NativeIteration.fieldsStart (_root_.Integration9_9.TM2NativeIteration.requestFields r) = _root_.Integration9_9.TM2NativeIteration.fields (_root_.Integration9_9.TM2NativeIteration.start r) := by
simp only [_root_.Integration9_9.TM2NativeIteration.fieldsStart,_root_.Integration9_9.TM2NativeIteration.requestFields,_root_.Integration9_9.TM2NativeIteration.fields,_root_.Integration9_9.TM2NativeIteration.start,List.map_ofFn,Function.comp_def,_root_.Integration9_9.TM2NativeIteration.get_replicate]
noncomputable def startProgram : PolyProgram _root_.Integration9_9.TM2NativeIteration.requestCode _root_.Integration9_9.TM2NativeIteration.stateCode _root_.Integration9_9.TM2NativeIteration.start := by
let p : PolyProgram _root_.Integration9_9.TM2NativeIteration.requestFieldsCode _root_.Integration9_9.TM2NativeIteration.fieldsCode _root_.Integration9_9.TM2NativeIteration.fieldsStart := by
change PolyProgram Automatic.enc Automatic.enc _root_.Integration9_9.TM2NativeIteration.fieldsStart
exact (show Poly _root_.Integration9_9.TM2NativeIteration.fieldsStart by unfold _root_.Integration9_9.TM2NativeIteration.fieldsStart; fun_prop).program
exact p.recode _root_.Integration9_9.TM2NativeIteration.requestFields (fun _ => rfl) (fun r => congrArg _root_.Integration9_9.TM2NativeIteration.fieldsCode (_root_.Integration9_9.TM2NativeIteration.fields_start r))
def requestResult (r : _root_.Integration9_9.TM2NativeIteration.Request) : List ℚ :=
List.ofFn (_root_.AFT.RationalNumerics.linearIteration (fun o j => (r.matrix.get o).get j) r.rhs.get r.ticks.length)
noncomputable def iterationProgram : PolyProgram _root_.Integration9_9.TM2NativeIteration.requestCode _root_.Integration9_9.TM2NativeIteration.vectorCode _root_.Integration9_9.TM2NativeIteration.requestResult :=
(_root_.Integration9_9.TM2NativeIteration.startProgram.comp _root_.Integration9_9.TM2NativeIteration.loop).congr _ (fun r => by simp only [Function.comp_apply,_root_.Integration9_9.TM2NativeIteration.result,_root_.Integration9_9.TM2NativeIteration.start,_root_.Integration9_9.TM2NativeIteration.requestResult,List.length_nil,Nat.zero_add])
/-- The dimensions are carried by the actual stored buffers. The iteration
count is an explicit unary list, not an unchecked binary-sized loop bound. -/
structure NativeRequest where
count : ℕ
matrix : Vector (Vector _root_.AFT.BinaryArithmetic.RationalBits count) count
rhs : Vector _root_.AFT.BinaryArithmetic.RationalBits count
ticks : List Unit
end Integration9_9.TM2NativeIteration
end
section
namespace AFT
end AFT
namespace AFT.BinaryArithmetic
end AFT.BinaryArithmetic
namespace AFT.BinaryArithmetic.RationalBits
end AFT.BinaryArithmetic.RationalBits
namespace AFT.BinaryArithmetic.RationalBits.chartDeletionMatrix
end AFT.BinaryArithmetic.RationalBits.chartDeletionMatrix
namespace CurrentAFT
end CurrentAFT
namespace CurrentAFT.CurrentFlagArray
end CurrentAFT.CurrentFlagArray
namespace CurrentAFT.CurrentFlagArray.defect
end CurrentAFT.CurrentFlagArray.defect
namespace CurrentAFT.CurrentFlagArray.target
end CurrentAFT.CurrentFlagArray.target
namespace CurrentAFT.CurrentFlagBinary
end CurrentAFT.CurrentFlagBinary
namespace CurrentAFT.CurrentFlagBinary.defect
end CurrentAFT.CurrentFlagBinary.defect
namespace CurrentAFT.CurrentFlagBinary.defectTerm
end CurrentAFT.CurrentFlagBinary.defectTerm
namespace CurrentAFT.CurrentFlagBinary.maskedEntry
end CurrentAFT.CurrentFlagBinary.maskedEntry
namespace CurrentAFT.CurrentFlagBinary.regular
end CurrentAFT.CurrentFlagBinary.regular
namespace CurrentAFT.CurrentFlagBinary.targetEntry
end CurrentAFT.CurrentFlagBinary.targetEntry
set_option autoImplicit false
set_option maxHeartbeats 2200000
set_option maxRecDepth 10000
set_option synthInstance.maxSize 1024
set_option backward.isDefEq.respectTransparency false
namespace Integration9_9.TM2NativeChartProjection
open AFT AFT.BinaryArithmetic AFT.RationalNumerics AFT.BoundaryCalibration CurrentAFT
open OAI.MetricKMedian.Binary OAI.MetricKMedian.Binary.Automatic
open TM2NativeChartMetadata
open scoped BigOperators
abbrev Row := List ℕ × List Bool
abbrev Component := (_root_.Integration9_9.TM2NativeChartProjection.Row × List ℚ) × ℕ
def mass (xs : List Bool) : ℚ := (xs.map (fun b => if b then (1 : ℚ) else 0)).sum
@[fun_prop] theorem mass_poly : Poly _root_.Integration9_9.TM2NativeChartProjection.mass := by unfold _root_.Integration9_9.TM2NativeChartProjection.mass;fun_prop
def conditional (x : (ℕ × List ℕ) × (List ℚ × ℕ)) : ℚ :=
(x.1.1 : ℚ)*(((List.range x.2.1.length).map (fun i =>
if x.1.2[i]?.getD 0=x.2.2 then x.2.1[i]?.getD 0 else 0)).sum/(x.2.1.length : ℚ))
@[fun_prop] theorem conditional_poly : Poly _root_.Integration9_9.TM2NativeChartProjection.conditional := by
have hi : Poly (fun x : (ℕ × List ℕ) × (List ℚ × ℕ) => List.range x.2.1.length) :=
Automatic.Poly.comp (f := fun xs : List ℚ=>List.range xs.length) (g := fun x : (ℕ × List ℕ) × (List ℚ × ℕ) => x.2.1)
(Poly.list_indices (α := ℚ)) (by fun_prop)
unfold _root_.Integration9_9.TM2NativeChartProjection.conditional
fun_prop
def component (x : _root_.Integration9_9.TM2NativeChartProjection.Component) : ℚ :=
if x.1.1.2[x.1.1.1[x.2]?.getD 0]?.getD false then
_root_.Integration9_9.TM2NativeChartProjection.conditional ((x.1.1.2.length,x.1.1.1),(x.1.2,x.1.1.1[x.2]?.getD 0))-
((List.range x.1.1.2.length).map (fun c => if x.1.1.2[c]?.getD false then
_root_.Integration9_9.TM2NativeChartProjection.conditional ((x.1.1.2.length,x.1.1.1),(x.1.2,c)) else 0)).sum/_root_.Integration9_9.TM2NativeChartProjection.mass x.1.1.2
else 0
@[fun_prop] theorem component_poly : Poly _root_.Integration9_9.TM2NativeChartProjection.component := by
have hi : Poly (fun x : _root_.Integration9_9.TM2NativeChartProjection.Component => List.range x.1.1.2.length) :=
Automatic.Poly.comp (f := fun xs : List Bool=>List.range xs.length) (g := fun x : _root_.Integration9_9.TM2NativeChartProjection.Component => x.1.1.2)
(Poly.list_indices (α := Bool)) (by fun_prop)
unfold _root_.Integration9_9.TM2NativeChartProjection.component
fun_prop
def projection (x : (_root_.Integration9_9.TM2NativeChartMetadata.Data × List ℚ) × ℕ) : ℚ :=
x.1.2.sum/(x.1.2.length : ℚ)+((List.range x.1.1.1.1.length).map (fun i =>
_root_.Integration9_9.TM2NativeChartProjection.component (((x.1.1.1.1[i]?.getD [],x.1.1.1.2[i]?.getD []),x.1.2),x.2))).sum
@[fun_prop] theorem projection_poly : Poly _root_.Integration9_9.TM2NativeChartProjection.projection := by
have hi : Poly (fun x : (_root_.Integration9_9.TM2NativeChartMetadata.Data × List ℚ) × ℕ => List.range x.1.1.1.1.length) :=
Automatic.Poly.comp (f := fun xs : List (List ℕ)=>List.range xs.length) (g := fun x : (_root_.Integration9_9.TM2NativeChartMetadata.Data × List ℚ) × ℕ => x.1.1.1.1)
(Poly.list_indices (α := List ℕ)) (by fun_prop)
unfold _root_.Integration9_9.TM2NativeChartProjection.projection
fun_prop
def spike (xs : List Bool) : List ℚ := xs.map (fun b => if b then (xs.length : ℚ)/_root_.Integration9_9.TM2NativeChartProjection.mass xs else 0)
@[fun_prop] theorem spike_poly : Poly _root_.Integration9_9.TM2NativeChartProjection.spike := by unfold _root_.Integration9_9.TM2NativeChartProjection.spike;fun_prop
def target (x : _root_.Integration9_9.TM2NativeChartMetadata.Data × ℕ) : ℚ :=
1-((List.range x.1.1.1.length).map (fun i => if x.1.2.2.1[i]?.getD false then 0 else
_root_.Integration9_9.TM2NativeChartProjection.component (((x.1.1.1[i]?.getD [],x.1.1.2[i]?.getD []),_root_.Integration9_9.TM2NativeChartProjection.spike x.1.2.2.2),x.2))).sum
@[fun_prop] theorem target_poly : Poly _root_.Integration9_9.TM2NativeChartProjection.target := by
have hi : Poly (fun x : _root_.Integration9_9.TM2NativeChartMetadata.Data × ℕ => List.range x.1.1.1.length) :=
Automatic.Poly.comp (f := fun xs : List (List ℕ)=>List.range xs.length) (g := fun x : _root_.Integration9_9.TM2NativeChartMetadata.Data × ℕ => x.1.1.1)
(Poly.list_indices (α := List ℕ)) (by fun_prop)
unfold _root_.Integration9_9.TM2NativeChartProjection.target
fun_prop
end Integration9_9.TM2NativeChartProjection
end
section
namespace CurrentAFT
end CurrentAFT
namespace CurrentAFT.CurrentFlagPublicProgram
end CurrentAFT.CurrentFlagPublicProgram
namespace CurrentAFT.CurrentFlagPublicProgram.half
end CurrentAFT.CurrentFlagPublicProgram.half
set_option autoImplicit false
set_option maxHeartbeats 2500000
set_option maxRecDepth 10000
set_option synthInstance.maxSize 1024
set_option backward.isDefEq.respectTransparency false
namespace Integration9_9.TM2NativeChartIteration
open AFT AFT.RationalNumerics AFT.BinaryArithmetic AFT.BoundaryCalibration CurrentAFT
open OAI.MetricKMedian.Binary OAI.MetricKMedian.Binary.Automatic
open TM2NativeChartMetadata TM2NativeChartProjection
def indices (d : _root_.Integration9_9.TM2NativeChartMetadata.Data) : List ℕ := List.range d.2.1.length
@[fun_prop] theorem indices_poly : Poly _root_.Integration9_9.TM2NativeChartIteration.indices :=
Automatic.Poly.comp (f := fun xs : List Bool => List.range xs.length) (g := fun d : _root_.Integration9_9.TM2NativeChartMetadata.Data => d.2.1)
(Poly.list_indices (α := Bool)) (by fun_prop)
def basis (x : List Bool × ℕ) : List ℚ := (List.range x.1.length).map
(fun i => if x.1[i]?.getD false then 0 else if i=x.2 then 1 else 0)
@[fun_prop] theorem basis_poly : Poly _root_.Integration9_9.TM2NativeChartIteration.basis := by
have hi : Poly (fun x : List Bool × ℕ => List.range x.1.length) :=
Automatic.Poly.comp (f := fun xs : List Bool => List.range xs.length) (g := fun x : List Bool × ℕ => x.1)
(Poly.list_indices (α := Bool)) (by fun_prop)
unfold _root_.Integration9_9.TM2NativeChartIteration.basis
fun_prop
def entry (x : _root_.Integration9_9.TM2NativeChartMetadata.Data × (ℕ × ℕ)) : ℚ := -_root_.Integration9_9.TM2NativeChartProjection.projection ((x.1,_root_.Integration9_9.TM2NativeChartIteration.basis (x.1.2.1,x.2.2)),x.2.1)
@[fun_prop] theorem entry_poly : Poly _root_.Integration9_9.TM2NativeChartIteration.entry := by unfold _root_.Integration9_9.TM2NativeChartIteration.entry;fun_prop
def matrix (d : _root_.Integration9_9.TM2NativeChartMetadata.Data) : List (List ℚ) := (_root_.Integration9_9.TM2NativeChartIteration.indices d).map (fun i => (_root_.Integration9_9.TM2NativeChartIteration.indices d).map (fun j => _root_.Integration9_9.TM2NativeChartIteration.entry (d,(i,j))))
def rhs (d : _root_.Integration9_9.TM2NativeChartMetadata.Data) : List ℚ := (_root_.Integration9_9.TM2NativeChartIteration.indices d).map (fun i => _root_.Integration9_9.TM2NativeChartProjection.target (d,i))
@[fun_prop] theorem matrix_poly : Poly _root_.Integration9_9.TM2NativeChartIteration.matrix := by unfold _root_.Integration9_9.TM2NativeChartIteration.matrix;fun_prop
@[fun_prop] theorem rhs_poly : Poly _root_.Integration9_9.TM2NativeChartIteration.rhs := by unfold _root_.Integration9_9.TM2NativeChartIteration.rhs;fun_prop
def fields (x : _root_.Integration9_9.TM2NativeChartMetadata.Data × List Unit) : _root_.Integration9_9.TM2NativeIteration.RequestFields := (_root_.Integration9_9.TM2NativeChartIteration.matrix x.1,(_root_.Integration9_9.TM2NativeChartIteration.rhs x.1,x.2))
@[fun_prop] theorem fields_poly : Poly _root_.Integration9_9.TM2NativeChartIteration.fields := by unfold _root_.Integration9_9.TM2NativeChartIteration.fields;fun_prop
def request (x : _root_.Integration9_9.TM2NativeChartMetadata.Data × List Unit) : _root_.Integration9_9.TM2NativeIteration.Request where
count:=x.1.2.1.length
matrix:=Vector.ofFn (fun i=>Vector.ofFn (fun j=>_root_.Integration9_9.TM2NativeChartIteration.entry (x.1,(i.val,j.val))))
rhs:=Vector.ofFn (fun i=>_root_.Integration9_9.TM2NativeChartProjection.target (x.1,i.val))
ticks:=x.2
theorem get_ofFn {A : Type} {n : ℕ} (f : Fin n→A) : (Vector.ofFn f).get=f := by
funext i
exact Vector.get_ofFn f i
theorem request_fields (x : _root_.Integration9_9.TM2NativeChartMetadata.Data × List Unit) : _root_.Integration9_9.TM2NativeIteration.requestFields (_root_.Integration9_9.TM2NativeChartIteration.request x)=_root_.Integration9_9.TM2NativeChartIteration.fields x := by
simp only [_root_.Integration9_9.TM2NativeIteration.requestFields,_root_.Integration9_9.TM2NativeChartIteration.request,_root_.Integration9_9.TM2NativeChartIteration.fields,_root_.Integration9_9.TM2NativeChartIteration.matrix,_root_.Integration9_9.TM2NativeChartIteration.rhs,_root_.Integration9_9.TM2NativeChartIteration.indices,_root_.Integration9_9.TM2NativeChartMetadata.range_map,_root_.Integration9_9.TM2NativeChartIteration.get_ofFn,Vector.get_ofFn]
noncomputable def requestProgram : PolyProgram Automatic.enc _root_.Integration9_9.TM2NativeIteration.requestCode _root_.Integration9_9.TM2NativeChartIteration.request :=
_root_.Integration9_9.TM2NativeChartIteration.fields_poly.program.recode id (fun _=>rfl) (fun x=>congrArg _root_.Integration9_9.TM2NativeIteration.requestFieldsCode (_root_.Integration9_9.TM2NativeChartIteration.request_fields x).symm)
def iterate (x : _root_.Integration9_9.TM2NativeChartMetadata.Data × List Unit) : List ℚ := _root_.Integration9_9.TM2NativeIteration.requestResult (_root_.Integration9_9.TM2NativeChartIteration.request x)
noncomputable def iterationProgram : PolyProgram Automatic.enc _root_.Integration9_9.TM2NativeIteration.vectorCode _root_.Integration9_9.TM2NativeChartIteration.iterate :=
_root_.Integration9_9.TM2NativeChartIteration.requestProgram.comp _root_.Integration9_9.TM2NativeIteration.iterationProgram
attribute [local irreducible] iterate
def current (x : _root_.Integration9_9.TM2NativeChartMetadata.Data × List Unit) : List ℚ :=
(_root_.Integration9_9.TM2NativeChartIteration.indices x.1).map (fun i=>if x.1.2.1[i]?.getD false then (_root_.Integration9_9.TM2NativeChartIteration.iterate x)[i]?.getD 0 else 0)
end Integration9_9.TM2NativeChartIteration
end
section
namespace AFT
end AFT
namespace AFT.BinaryArithmetic
end AFT.BinaryArithmetic
namespace AFT.BinaryArithmetic.binaryLegalChartIndex
end AFT.BinaryArithmetic.binaryLegalChartIndex
namespace AFT.BinaryArithmetic.binaryPositiveFinDraw
end AFT.BinaryArithmetic.binaryPositiveFinDraw
namespace CurrentAFT
end CurrentAFT
namespace CurrentAFT.CurrentFlagDraw
end CurrentAFT.CurrentFlagDraw
namespace CurrentAFT.CurrentFlagDraw.draw
end CurrentAFT.CurrentFlagDraw.draw
namespace CurrentAFT.CurrentFlagDraw.workBound
end CurrentAFT.CurrentFlagDraw.workBound
set_option autoImplicit false
set_option maxHeartbeats 1800000
set_option maxRecDepth 10000
set_option backward.isDefEq.respectTransparency false
namespace Integration9_9.TM2NativeChartLegalize
open AFT AFT.BinaryArithmetic CurrentAFT
open OAI.MetricKMedian.Binary OAI.MetricKMedian.Binary.Automatic
def fallback (xs : List Bool) : ℕ := if xs.findIdx id<xs.length then xs.findIdx id else 0
def current (x : List Bool × ℕ) : ℕ := if x.1[x.2]?.getD false then x.2 else _root_.Integration9_9.TM2NativeChartLegalize.fallback x.1
def draw (x : (List ℚ × List Bool) × List Bool) : ℕ :=
_root_.Integration9_9.TM2NativeChartLegalize.current (x.1.2,_root_.Integration9_9.TM2NativePositiveDraw.current (x.1.1,x.2))
end Integration9_9.TM2NativeChartLegalize
end
section
namespace CurrentAFT
end CurrentAFT
namespace CurrentAFT.CurrentFlagChartDraw
end CurrentAFT.CurrentFlagChartDraw
namespace CurrentAFT.CurrentFlagChartDraw.draw
end CurrentAFT.CurrentFlagChartDraw.draw
set_option autoImplicit false
set_option maxHeartbeats 2500000
set_option maxRecDepth 10000
set_option synthInstance.maxSize 1024
set_option backward.isDefEq.respectTransparency false
namespace Integration9_9.TM2NativeFlagDraw
open AFT AFT.BinaryArithmetic AFT.RationalNumerics AFT.BoundaryCalibration CurrentAFT
open OAI.MetricKMedian.Binary OAI.MetricKMedian.Binary.Automatic
open TM2NativeChartCoordinates TM2NativeChartMetadata TM2NativeChartProjection
abbrev Context := _root_.Integration9_9.TM2NativeChartMetadata.Context × List Unit
abbrev Chart := Bool × (ℕ × (ℕ × ℕ))
abbrev Tape := Bool × List Bool
def steps (x : _root_.Integration9_9.TM2NativeChartCoordinates.Params × List Unit) : List Unit :=
x.2++_root_.Integration9_9.TM2NativeChartMetadata.featureTicks x.1++_root_.Integration9_9.TM2NativeChartMetadata.featureTicks x.1++_root_.Integration9_9.TM2NativeChartMetadata.featureTicks x.1++_root_.Integration9_9.TM2NativeChartMetadata.featureTicks x.1++[(),(),(),()]
attribute [local irreducible] steps
def scale (xs : List ℚ) : List ℚ := xs.map (fun q => q/(xs.length : ℚ))
def regular (x : _root_.Integration9_9.TM2NativeFlagDraw.Context × List Bool) : ℕ :=
let d:=_root_.Integration9_9.TM2NativeChartMetadata.current x.1.1
_root_.Integration9_9.TM2NativeChartLegalize.draw ((_root_.Integration9_9.TM2NativeFlagDraw.scale (_root_.Integration9_9.TM2NativeChartIteration.current (d,_root_.Integration9_9.TM2NativeFlagDraw.steps (x.1.1.1.1,x.1.2))),d.2.1),x.2)
def marked (x : _root_.Integration9_9.TM2NativeFlagDraw.Context × List Bool) : ℕ :=
let d:=_root_.Integration9_9.TM2NativeChartMetadata.current x.1.1
_root_.Integration9_9.TM2NativeChartLegalize.draw ((_root_.Integration9_9.TM2NativeFlagDraw.scale (_root_.Integration9_9.TM2NativeChartProjection.spike d.2.2.2),d.2.2.2),x.2)
def current (x : _root_.Integration9_9.TM2NativeFlagDraw.Context × _root_.Integration9_9.TM2NativeFlagDraw.Tape) : _root_.Integration9_9.TM2NativeFlagDraw.Chart :=
let point:=if x.2.1 then _root_.Integration9_9.TM2NativeFlagDraw.marked (x.1,x.2.2) else _root_.Integration9_9.TM2NativeFlagDraw.regular (x.1,x.2.2)
(x.2.1,_root_.Integration9_9.TM2NativeChartCoordinates.coordinates (x.1.1.1.1.2.length,point))
def chartData {q : ℕ} (chart : Bool × _root_.AFT.BoundaryCalibration.Chart (ZMod q)) : _root_.Integration9_9.TM2NativeFlagDraw.Chart :=
(chart.1,(chart.2.1.val,(chart.2.2.1.val,chart.2.2.2.val)))
def tapeData {q bits : ℕ} (word : _root_.CurrentAFT.CurrentFlagJointDraw.Tape q bits) : _root_.Integration9_9.TM2NativeFlagDraw.Tape :=
(word.1,List.ofFn (fun i=>_root_.AFT.BinaryArithmetic.digitBoolean (word.2 i)))
end Integration9_9.TM2NativeFlagDraw
end
section
namespace CurrentAFT
end CurrentAFT
namespace CurrentAFT.CurrentFlagCompletionProgram
end CurrentAFT.CurrentFlagCompletionProgram
set_option autoImplicit false
set_option maxHeartbeats 1800000
set_option maxRecDepth 10000
set_option synthInstance.maxSize 1024
set_option backward.isDefEq.respectTransparency false
namespace Integration9_9.TM2NativeFlagCompletion
open AFT AFT.BinaryArithmetic CurrentAFT
open OAI.MetricKMedian.Binary OAI.MetricKMedian.Binary.Automatic
open TM2NativeChartCoordinates TM2NativeFlagDraw
abbrev Meta := List Unit × List Unit
abbrev Input := (_root_.Integration9_9.TM2NativeFlagCompletion.Meta × (ℕ × _root_.Integration9_9.TM2NativePublicSeed.Seed)) × _root_.Integration9_9.TM2NativeFlagDraw.Tape
attribute [local irreducible] TM2NativeProfile.scalarTicks TM2NativeBodyKernel.paletteTicks TM2NativeCoreCharge.shift TM2NativeFlagDraw.current
def params (xs : List Unit) : _root_.Integration9_9.TM2NativeChartCoordinates.Params := (_root_.Integration9_9.TM2NativeProfile.scalarTicks xs,_root_.Integration9_9.TM2NativeBodyKernel.paletteTicks xs)
def current (x : _root_.Integration9_9.TM2NativeFlagCompletion.Input) : _root_.Integration9_9.TM2NativeFlagDraw.Chart :=
_root_.Integration9_9.TM2NativeFlagDraw.current ((((_root_.Integration9_9.TM2NativeFlagCompletion.params x.1.1.1,_root_.Integration9_9.TM2NativeCoreCharge.shift (x.1.1.1,x.1.2)),x.1.2.1),x.1.1.2),x.2)
end Integration9_9.TM2NativeFlagCompletion
end
section
namespace CurrentAFT
end CurrentAFT
namespace CurrentAFT.CurrentChartsDraw
end CurrentAFT.CurrentChartsDraw
namespace CurrentAFT.CurrentChartsDraw.draw
end CurrentAFT.CurrentChartsDraw.draw
namespace CurrentAFT.CurrentChartsDraw.drawStored
end CurrentAFT.CurrentChartsDraw.drawStored
namespace CurrentAFT.CurrentChartsDraw.inputsOfCore
end CurrentAFT.CurrentChartsDraw.inputsOfCore
namespace CurrentAFT.CurrentPublicAffineSample
end CurrentAFT.CurrentPublicAffineSample
namespace CurrentAFT.CurrentPublicAffineSample.chartsLaw
end CurrentAFT.CurrentPublicAffineSample.chartsLaw
set_option autoImplicit false
set_option maxHeartbeats 2200000
set_option maxRecDepth 10000
set_option synthInstance.maxSize 1024
set_option backward.isDefEq.respectTransparency false
namespace Integration9_9.TM2NativeCharts
open AFT AFT.BinaryArithmetic CurrentAFT
open OAI.MetricKMedian.Binary OAI.MetricKMedian.Binary.Automatic
open TM2NativeCoreProposal TM2NativeFlagDraw
abbrev Context := _root_.Integration9_9.TM2NativeFlagCompletion.Meta × _root_.Integration9_9.TM2NativeCoreProposal.Core
abbrev Input := _root_.Integration9_9.TM2NativeCharts.Context × List _root_.Integration9_9.TM2NativeFlagDraw.Tape
attribute [local irreducible] CurrentProposalDimensions.current CurrentAFT.Parameters.legCount
TM2NativeFlagCompletion.current CurrentChartsDraw.drawStored CurrentChartsDraw.draw
CurrentFlagCompletionProgram.draw
def input (x : _root_.Integration9_9.TM2NativeCharts.Context × ℕ) : _root_.Integration9_9.TM2NativeFlagCompletion.Meta × (ℕ × _root_.Integration9_9.TM2NativePublicSeed.Seed) :=
(x.1.1,((x.1.2.1.1[x.2]?.getD (0,0)).1,(x.1.2.1.2[x.2]?.getD default).1))
def current (x : _root_.Integration9_9.TM2NativeCharts.Input) : List _root_.Integration9_9.TM2NativeFlagDraw.Chart :=
(List.range x.1.2.1.2.length).map (fun i=>_root_.Integration9_9.TM2NativeFlagCompletion.current (_root_.Integration9_9.TM2NativeCharts.input (x.1,i),x.2[i]?.getD default))
attribute [local irreducible] input coreData
end Integration9_9.TM2NativeCharts
end
section
set_option autoImplicit false
set_option maxHeartbeats 3000000
set_option maxRecDepth 10000
set_option backward.isDefEq.respectTransparency false
namespace Integration9_9.TM2NativeRootGroupSingleton
open AFT CurrentAFT CurrentAFT.ControlCoordinates GradedControlAlgebra
open OAI.MetricKMedian.Binary OAI.MetricKMedian.Binary.Automatic
open TM2NativeRootGroupAlgebra TM2NativeRootGroupRoles
open UniformBodyProfiles (BodyRole)
abbrev Meta := _root_.Integration9_9.TM2NativeFirstInverse.Meta
theorem first_poly (order : ℕ) (role : _root_.CurrentAFT.UniformBodyProfiles.BodyRole) : _root_.Integration9_9.TM2NativeRootGroupAlgebra.IsPoly order
(fun x : _root_.Integration9_9.TM2NativeRootGroupSingleton.Meta × (ℤ × ℤ) => _root_.CurrentAFT.RationalSingletonProgram.first x.1.1.length x.1.2.length order role x.2.1 x.2.2) :=
_root_.Integration9_9.TM2NativeRootGroupAlgebra.IsPoly.firstTable (_root_.Integration9_9.TM2NativeRootGroupRoles.firstDensity_poly role) (Automatic.Poly.const 0)
theorem positive_poly (order : ℕ) (role : _root_.CurrentAFT.UniformBodyProfiles.BodyRole) : _root_.Integration9_9.TM2NativeRootGroupAlgebra.IsPoly order
(fun x : _root_.Integration9_9.TM2NativeRootGroupSingleton.Meta × ℤ => _root_.CurrentAFT.RationalSingletonProgram.positive x.1.1.length x.1.2.length order role x.2) :=
_root_.Integration9_9.TM2NativeRootGroupAlgebra.IsPoly.unit.add (_root_.Integration9_9.TM2NativeRootGroupAlgebra.IsPoly.firstTable (_root_.Integration9_9.TM2NativeRootGroupRoles.meanDensity_poly role) (Automatic.Poly.const 0))
theorem inverse_poly (order : ℕ) (role : _root_.CurrentAFT.UniformBodyProfiles.BodyRole) : _root_.Integration9_9.TM2NativeRootGroupAlgebra.IsPoly order
(fun x : _root_.Integration9_9.TM2NativeRootGroupSingleton.Meta × ℤ => _root_.CurrentAFT.RationalSingletonProgram.inverse x.1.1.length x.1.2.length order role x.2) :=
(_root_.Integration9_9.TM2NativeRootGroupSingleton.positive_poly order role).reciprocal
theorem current_poly (order : ℕ) (role : _root_.CurrentAFT.UniformBodyProfiles.BodyRole) : _root_.Integration9_9.TM2NativeRootGroupAlgebra.IsPoly order
(fun x : _root_.Integration9_9.TM2NativeRootGroupSingleton.Meta × (ℤ × ℤ) => _root_.CurrentAFT.RationalSingletonProgram.current x.1.1.length x.1.2.length order role x.2.1 x.2.2) := by
have hi := (_root_.Integration9_9.TM2NativeRootGroupSingleton.inverse_poly order role).comp (g := fun x : _root_.Integration9_9.TM2NativeRootGroupSingleton.Meta × (ℤ × ℤ) => (x.1,x.2.1)) (by fun_prop)
exact (_root_.Integration9_9.TM2NativeRootGroupSingleton.first_poly order role).product hi
theorem ordinary_first_poly (order : ℕ) : _root_.Integration9_9.TM2NativeRootGroupAlgebra.IsPoly order
(fun x : _root_.Integration9_9.TM2NativeRootGroupSingleton.Meta × (ℕ × ℤ) => _root_.CurrentAFT.RationalOrdinaryFamilyProgram.first x.1.1.length x.1.2.length order x.2.1 x.2.2) :=
_root_.Integration9_9.TM2NativeRootGroupAlgebra.IsPoly.firstTable _root_.Integration9_9.TM2NativeRootGroupRoles.ordinaryDensity_poly (Automatic.Poly.const 0)
def bodyDelta (x : (_root_.Integration9_9.TM2NativeRootGroupSingleton.Meta × ℕ) × ℕ) : ℚ := _root_.CurrentAFT.WeightedPointKernelProgram.bodyDelta x.1.1.1.length x.1.1.2.length x.1.2 x.2
@[fun_prop] theorem bodyDelta_poly : Poly _root_.Integration9_9.TM2NativeRootGroupSingleton.bodyDelta := by
change Poly (fun x : (_root_.Integration9_9.TM2NativeRootGroupSingleton.Meta × ℕ) × ℕ => (if x.2=x.1.2 then 1 else 0)-_root_.Integration9_9.TM2NativeRootGroupProfiles.center x.1)
fun_prop
theorem ordinary_bodyFirst_poly (order : ℕ) : _root_.Integration9_9.TM2NativeRootGroupAlgebra.IsPoly order
(fun x : _root_.Integration9_9.TM2NativeRootGroupSingleton.Meta × ℕ => _root_.CurrentAFT.RationalOrdinaryFamilyProgram.bodyFirst x.1.1.length x.1.2.length order x.2) :=
_root_.Integration9_9.TM2NativeRootGroupAlgebra.IsPoly.firstTable (Automatic.Poly.const 0) _root_.Integration9_9.TM2NativeRootGroupSingleton.bodyDelta_poly
theorem ordinary_atRoot_poly (order : ℕ) : _root_.Integration9_9.TM2NativeRootGroupAlgebra.IsPoly order
(fun x : _root_.Integration9_9.TM2NativeRootGroupSingleton.Meta × (ℕ × ℤ) => _root_.CurrentAFT.RationalOrdinaryFamilyProgram.atRoot x.1.1.length x.1.2.length order x.2.1 x.2.2) := by
have hi := (_root_.Integration9_9.TM2NativeRootGroupSingleton.inverse_poly order .free).comp (g := fun x : _root_.Integration9_9.TM2NativeRootGroupSingleton.Meta × (ℕ × ℤ) => (x.1,(0 : ℤ))) (by fun_prop)
exact (_root_.Integration9_9.TM2NativeRootGroupSingleton.ordinary_first_poly order).product hi
theorem ordinary_independent_poly (order : ℕ) : _root_.Integration9_9.TM2NativeRootGroupAlgebra.IsPoly order
(fun x : _root_.Integration9_9.TM2NativeRootGroupSingleton.Meta × ℕ => _root_.CurrentAFT.RationalOrdinaryFamilyProgram.independent x.1.1.length x.1.2.length order x.2) := by
have hi := (_root_.Integration9_9.TM2NativeRootGroupSingleton.inverse_poly order .free).comp (g := fun x : _root_.Integration9_9.TM2NativeRootGroupSingleton.Meta × ℕ => (x.1,(0 : ℤ))) (by fun_prop)
exact (_root_.Integration9_9.TM2NativeRootGroupSingleton.ordinary_bodyFirst_poly order).product hi
end Integration9_9.TM2NativeRootGroupSingleton
end
section
namespace CurrentAFT
end CurrentAFT
namespace CurrentAFT.CycleSelections
end CurrentAFT.CycleSelections
namespace CurrentAFT.CycleSelections.centeredRootAtom
end CurrentAFT.CycleSelections.centeredRootAtom
namespace CurrentAFT.RootSignedMassProgram
end CurrentAFT.RootSignedMassProgram
namespace CurrentAFT.RootSignedMassProgram.referenceEntry
end CurrentAFT.RootSignedMassProgram.referenceEntry
namespace CurrentAFT.RootSignedMassProgram.signedTest
end CurrentAFT.RootSignedMassProgram.signedTest
set_option autoImplicit false
set_option maxHeartbeats 3000000
set_option maxRecDepth 10000
set_option backward.isDefEq.respectTransparency false
namespace Integration9_9.TM2NativeRootGroupReference
open AFT AFT.RationalNumerics AFT.BinaryArithmetic CurrentAFT
open OAI.MetricKMedian.Binary OAI.MetricKMedian.Binary.Automatic
open TM2NativeRootGroupProfiles TM2NativeRootGroupGaussian
open scoped BigOperators
attribute [local irreducible] TM2NativePrime.modulus TM2NativePrime.upperSlots
abbrev Meta := _root_.Integration9_9.TM2NativeFirstInverse.Meta
def right (x : (_root_.Integration9_9.TM2NativeRootGroupReference.Meta × (ℕ × ℤ)) × ℤ) : ℚ :=
if _root_.Integration9_9.TM2NativeBodyKernel.emodNatural (x.1.2.2-x.2,_root_.Integration9_9.TM2NativePrime.modulus x.1.1.1)=x.1.2.1 then 1 else 0
@[fun_prop] theorem right_poly : Poly _root_.Integration9_9.TM2NativeRootGroupReference.right := by unfold _root_.Integration9_9.TM2NativeRootGroupReference.right;fun_prop
def left (x : (_root_.Integration9_9.TM2NativeRootGroupReference.Meta × ℕ) × ℤ) : ℚ := _root_.Integration9_9.TM2NativeRootGroupGaussian.windowAverage true _root_.Integration9_9.TM2NativeRootGroupReference.right (x.1.1,(x.1.2,x.2))
@[fun_prop] theorem left_poly : Poly _root_.Integration9_9.TM2NativeRootGroupReference.left := by unfold _root_.Integration9_9.TM2NativeRootGroupReference.left;fun_prop
def average (x : _root_.Integration9_9.TM2NativeRootGroupReference.Meta × ℕ) : ℚ := _root_.Integration9_9.TM2NativeRootGroupGaussian.windowAverage true _root_.Integration9_9.TM2NativeRootGroupReference.left x
@[fun_prop] theorem average_poly : Poly _root_.Integration9_9.TM2NativeRootGroupReference.average := by unfold _root_.Integration9_9.TM2NativeRootGroupReference.average;fun_prop
theorem residue_iff {q : ℕ} [NeZero q] (z : ℤ) (out : ZMod q) :
_root_.Integration9_9.TM2NativeBodyKernel.emodNatural (z,q)=out.val ↔ (z : ZMod q)=out := by
rw [_root_.Integration9_9.TM2NativeBodyKernel.emodNatural_eq,← ZMod.val_intCast,Int.toNat_natCast]
constructor
· intro h; exact ZMod.val_injective q h
· intro h; exact congrArg ZMod.val h
theorem average_value (x : _root_.Integration9_9.TM2NativeRootGroupReference.Meta) (out : _root_.CurrentAFT.CycleRootExpansion.Root x.1.length) :
_root_.Integration9_9.TM2NativeRootGroupReference.average (x,out.val)=_root_.CurrentAFT.RootSignedMassProgram.referenceEntry x.1.length x.2.length out.val := by
letI : NeZero (_root_.CurrentAFT.Parameters.modulus x.1.length) := ⟨(_root_.CurrentAFT.Parameters.modulus_spec x.1.length).2.ne_zero⟩
apply Rat.cast_injective (α := ℝ)
rw [_root_.InfoLossLARNativeSupplements.h6473fbae786c301e.CurrentAFT.RootSignedMassProgram.referenceEntry_cast]
simp only [_root_.Integration9_9.TM2NativeRootGroupReference.average,_root_.Integration9_9.TM2NativeRootGroupGaussian.windowAverage_eq_window,_root_.Integration9_9.TM2NativeRootGroupReference.left,_root_.Integration9_9.TM2NativeRootGroupReference.right,_root_.Integration9_9.TM2NativePrime.modulus_value,
Rat.cast_sum,Rat.cast_mul,apply_ite,Rat.cast_one,Rat.cast_zero,
_root_.CurrentAFT.ProtectedCycle.differenceLaw,_root_.AFT.FiniteDist.map_weight,_root_.AFT.FiniteDist.prod_weight,Fintype.sum_prod_type,
_root_.CurrentAFT.RationalProposalProgram.gaussianWeight_eq,_root_.AFT.RationalNumerics.windowApproxLaw,Finset.mul_sum]
apply Finset.sum_congr rfl
intro l _
apply Finset.sum_congr rfl
intro r _
have he := _root_.Integration9_9.TM2NativeRootGroupReference.residue_iff (l.val-r.val) out
simp only [Int.cast_sub] at he
rw [if_congr he rfl rfl]
split_ifs <;> simp <;> rfl
theorem referenceEntry_outside (security bits out : ℕ)
(ho : _root_.CurrentAFT.Parameters.modulus security ≤ out) : _root_.CurrentAFT.RootSignedMassProgram.referenceEntry security bits out=0 := by
have hq : 0 < (_root_.CurrentAFT.Parameters.modulus security : ℤ) := by
exact_mod_cast (_root_.CurrentAFT.Parameters.modulus_spec security).2.pos
have hp (roots : Fin 1 → ℤ) : _root_.CurrentAFT.CurrentCycleEntryProgram.pointTest
(_root_.CurrentAFT.PublicParameterProgram.modulus security).count 1 (fun _ => out) roots=0 := by
unfold _root_.CurrentAFT.CurrentCycleEntryProgram.pointTest
rw [if_neg]
intro h
have hx := h 0
rw [_root_.CurrentAFT.PublicParameterProgram.modulus_value] at hx
change roots 0 % (_root_.CurrentAFT.Parameters.modulus security : ℤ) = (out : ℤ) at hx
have he := Int.emod_lt_of_pos (roots 0) hq
have hob : (_root_.CurrentAFT.Parameters.modulus security : ℤ) ≤ out := by exact_mod_cast ho
omega
unfold _root_.CurrentAFT.RootSignedMassProgram.referenceEntry _root_.CurrentAFT.CurrentCycleEntryProgram.selectedEntry
_root_.CurrentAFT.CyclePatternProgram.averagedEvaluate _root_.CurrentAFT.CyclePatternProgram.gaussianEvaluate _root_.CurrentAFT.CyclePatternProgram.evaluate
simp only [hp,mul_zero,Finset.sum_const_zero]
def current (x : _root_.Integration9_9.TM2NativeRootGroupReference.Meta × ℕ) : ℚ :=
if x.2<_root_.Integration9_9.TM2NativePrime.modulus x.1.1 then _root_.Integration9_9.TM2NativeRootGroupReference.average x else 0
@[fun_prop] theorem current_poly : Poly _root_.Integration9_9.TM2NativeRootGroupReference.current := by unfold _root_.Integration9_9.TM2NativeRootGroupReference.current;fun_prop
theorem current_value (x : _root_.Integration9_9.TM2NativeRootGroupReference.Meta × ℕ) : _root_.Integration9_9.TM2NativeRootGroupReference.current x=_root_.CurrentAFT.RootSignedMassProgram.referenceEntry x.1.1.length x.1.2.length x.2 := by
by_cases h : x.2<_root_.CurrentAFT.Parameters.modulus x.1.1.length
· letI : NeZero (_root_.CurrentAFT.Parameters.modulus x.1.1.length) := ⟨(_root_.CurrentAFT.Parameters.modulus_spec x.1.1.length).2.ne_zero⟩
have ho : ((x.2 : _root_.CurrentAFT.CycleRootExpansion.Root x.1.1.length)).val=x.2 := by
rw [ZMod.val_natCast,Nat.mod_eq_of_lt h]
simpa only [_root_.Integration9_9.TM2NativeRootGroupReference.current,_root_.Integration9_9.TM2NativePrime.modulus_value,h,ite_true,ho] using
_root_.Integration9_9.TM2NativeRootGroupReference.average_value x.1 (x.2 : _root_.CurrentAFT.CycleRootExpansion.Root x.1.1.length)
· simp only [_root_.Integration9_9.TM2NativeRootGroupReference.current,_root_.Integration9_9.TM2NativePrime.modulus_value,h,ite_false,
_root_.Integration9_9.TM2NativeRootGroupReference.referenceEntry_outside _ _ _ (Nat.le_of_not_gt h)]
noncomputable def currentProgram : PolyProgram Automatic.enc Ratio.encode
(fun x : _root_.Integration9_9.TM2NativeRootGroupReference.Meta × ℕ => _root_.CurrentAFT.RootSignedMassProgram.referenceEntry x.1.1.length x.1.2.length x.2) :=
_root_.Integration9_9.TM2NativeRootGroupReference.current_poly.program.congr _ _root_.Integration9_9.TM2NativeRootGroupReference.current_value
end Integration9_9.TM2NativeRootGroupReference
end
Source
Companion Lean implementation for the fixed-family Gaussian affine transport theorem. The source modules and their SHA-256 hashes are recorded in the checked extraction manifest. This exact generated file has SHA-256 033424dc31e216d3ba0694b983f0e05bc95f78cbecbce320c65f18bf91557696. Source modules: Integration9_9_TM2NativeBackgroundMarked, Integration9_9_TM2NativeBackgroundTensor, Integration9_9_TM2NativeBackgroundLeg, Integration9_9_TM2NativeBackgroundPopulation, Integration9_9_TM2NativePairedTensor, Integration9_9_TM2NativeDistinctTuples, Integration9_9_TM2NativeTwoPoolAverage, Integration9_9_TM2NativeWeightEvaluation, Integration9_9_TM2NativeWeightTable, Integration9_9_TM2NativeWeightProgram, Integration9_9_TM2NativeCoreWeight, Integration9_9_TM2NativeRejection, Integration9_9_TM2NativePublicRejection, Integration9_9_TM2NativeCappedRejection, Integration9_9_TM2NativeChartCoordinates, Integration9_9_TM2NativeChartMetadata, Integration9_9_TM2NativeIteration, Integration9_9_TM2NativeChartProjection, Integration9_9_TM2NativeChartIteration, Integration9_9_TM2NativeChartLegalize, Integration9_9_TM2NativeFlagDraw, Integration9_9_TM2NativeFlagCompletion, Integration9_9_TM2NativeCharts, Integration9_9_TM2NativeRootGroupSingleton, Integration9_9_TM2NativeRootGroupReference. Alternate sparse native dependencies preserve the original non-import body bytes and all public types; this header-only packaging is recorded in sparse_live/manifest.json. Current source SHA256 786365ceb8ce48d2239a71359b58c67db142f774e5d5a9c3d5ab2f1fc5ae7aa4. Native10/11 split fallback keeps every original scope-closed data body unchanged and retains the canonical module names as import facades. Current source SHA256 786365ceb8ce48d2239a71359b58c67db142f774e5d5a9c3d5ab2f1fc5ae7aa4.